are0h
/
Fipamo
1
2
Fork 0
Code Issues 19 Pull Requests 1 Packages Projects 1 Releases 22 Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
develop
toggle-buttons-#109
beta
nodejs-version-freeze
sql-version-freeze
1.0.0
b1.0.1
b1.2.0
b1.2.1
b1.2.2
b1.2.3
b1.2.4
b2.0.0
b2.1.0
b2.1.1
b2.2.0
b2.2.1
b2.2.2
b2.2.3
b2.2.4
b2.3.0
b2.4.0
b2.4.1
b2.5.0
b2.5.1
b2.6.0
b2.6.1
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b0cb4d9229'
${ noResults }
Fipamo/themes/dash/assets/js/dash.min.map

1 line
1.6 MiB
Raw Blame History Unescape Escape

This file contains invisible Unicode characters!

This file contains invisible Unicode characters that may be processed differently from what appears below. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to reveal hidden characters.

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

{"version":3,"sources":["../../../../brain/tools/events/EventEmitter.js","../../../../brain/tools/events/DataEvent.js","../../../../brain/tools/utilities/DataUtils.js","../../../../brain/tools/effects/Animate.js","../../../../brain/tools/utilities/StringUtils.js","../src/utils.js","../src/debug.js","../src/errors.js","../src/chaining-functions.js","../src/Promise.js","../src/Events.js","../src/Dexie.js","../../../../node_modules/entities/lib/decode_codepoint.js","../../../../node_modules/htmlparser2/lib/Tokenizer.js","../../../../node_modules/inherits/inherits_browser.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/events/events.js","../../../../node_modules/htmlparser2/lib/Parser.js","../../../../node_modules/domelementtype/index.js","../../../../node_modules/domhandler/lib/node.js","../../../../node_modules/domhandler/lib/element.js","../../../../node_modules/domhandler/index.js","../../../../node_modules/htmlparser2/lib/FeedHandler.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/base64-js/index.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/ieee754/index.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/isarray/index.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/buffer/index.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/safe-buffer/index.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/string_decoder/lib/string_decoder.js","../../../../node_modules/htmlparser2/lib/WritableStream.js","../../../../node_modules/htmlparser2/lib/Stream.js","../../../../node_modules/htmlparser2/lib/ProxyHandler.js","../../../../node_modules/dom-serializer/node_modules/domelementtype/index.js","../../../../node_modules/entities/lib/encode.js","../../../../node_modules/entities/lib/decode.js","../../../../node_modules/entities/index.js","../../../../node_modules/dom-serializer/index.js","../../../../node_modules/domutils/lib/stringify.js","../../../../node_modules/domutils/lib/traversal.js","../../../../node_modules/domutils/lib/manipulation.js","../../../../node_modules/domutils/lib/querying.js","../../../../node_modules/domutils/lib/legacy.js","../../../../node_modules/domutils/lib/helpers.js","../../../../node_modules/domutils/index.js","../../../../node_modules/htmlparser2/lib/CollectingHandler.js","../../../../node_modules/htmlparser2/lib/index.js","../../../../node_modules/xtend/immutable.js","../../../../node_modules/lodash.escaperegexp/index.js","../../../../node_modules/lodash.clonedeep/index.js","../../../../node_modules/lodash.mergewith/index.js","../../../../node_modules/lodash.isstring/index.js","../../../../node_modules/lodash.isplainobject/index.js","../../../../node_modules/number-is-nan/index.js","../../../../node_modules/array-uniq/index.js","../../../../node_modules/srcset/index.js","tokenize.es6","../../../../node_modules/source-map/lib/base64.js","../../../../node_modules/source-map/lib/base64-vlq.js","../../../../node_modules/source-map/lib/util.js","../../../../node_modules/source-map/lib/array-set.js","../../../../node_modules/source-map/lib/mapping-list.js","../../../../node_modules/source-map/lib/source-map-generator.js","../../../../node_modules/source-map/lib/binary-search.js","../../../../node_modules/source-map/lib/quick-sort.js","../../../../node_modules/source-map/lib/source-map-consumer.js","../../../../node_modules/source-map/lib/source-node.js","../../../../node_modules/source-map/source-map.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/process/browser.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/path-browserify/index.js","previous-map.es6","input.es6","terminal-highlight.es6","css-syntax-error.es6","stringifier.es6","stringify.es6","warn-once.es6","node.es6","declaration.es6","map-generator.es6","warning.es6","result.es6","comment.es6","list.es6","rule.es6","root.es6","container.es6","at-rule.es6","parser.es6","parse.es6","lazy-result.es6","processor.es6","vendor.es6","postcss.es6","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/punycode/punycode.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/url/util.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/querystring-es3/decode.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/querystring-es3/encode.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/querystring-es3/index.js","../../../../../../.nvm/versions/node/v8.12.0/lib/node_modules/parcel-bundler/node_modules/url/url.js","../../../../node_modules/sanitize-html/dist/index.js","../../../../brain/tools/utilities/DateUtils.js","../../../../brain/tools/utilities/DBUtils.js","../../../../node_modules/markdown-it/lib/common/entities.js","../../../../node_modules/uc.micro/categories/P/regex.js","../../../../node_modules/mdurl/encode.js","../../../../node_modules/mdurl/decode.js","../../../../node_modules/mdurl/format.js","../../../../node_modules/mdurl/parse.js","../../../../node_modules/mdurl/index.js","../../../../node_modules/uc.micro/properties/Any/regex.js","../../../../node_modules/uc.micro/categories/Cc/regex.js","../../../../node_modules/uc.micro/categories/Cf/regex.js","../../../../node_modules/uc.micro/categories/Z/regex.js","../../../../node_modules/uc.micro/index.js","../../../../node_modules/markdown-it/lib/common/utils.js","../../../../node_modules/markdown-it/lib/helpers/parse_link_label.js","../../../../node_modules/markdown-it/lib/helpers/parse_link_destination.js","../../../../node_modules/markdown-it/lib/helpers/parse_link_title.js","../../../../node_modules/markdown-it/lib/helpers/index.js","../../../../node_modules/markdown-it/lib/renderer.js","../../../../node_modules/markdown-it/lib/ruler.js","../../../../node_modules/markdown-it/lib/rules_core/normalize.js","../../../../node_modules/markdown-it/lib/rules_core/block.js","../../../../node_modules/markdown-it/lib/rules_core/inline.js","../../../../node_modules/markdown-it/lib/rules_core/linkify.js","../../../../node_modules/markdown-it/lib/rules_core/replacements.js","../../../../node_modules/markdown-it/lib/rules_core/smartquotes.js","../../../../node_modules/markdown-it/lib/token.js","../../../../node_modules/markdown-it/lib/rules_core/state_core.js","../../../../node_modules/markdown-it/lib/parser_core.js","../../../../node_modules/markdown-it/lib/rules_block/table.js","../../../../node_modules/markdown-it/lib/rules_block/code.js","../../../../node_modules/markdown-it/lib/rules_block/fence.js","../../../../node_modules/markdown-it/lib/rules_block/blockquote.js","../../../../node_modules/markdown-it/lib/rules_block/hr.js","../../../../node_modules/markdown-it/lib/rules_block/list.js","../../../../node_modules/markdown-it/lib/rules_block/reference.js","../../../../node_modules/markdown-it/lib/rules_block/heading.js","../../../../node_modules/markdown-it/lib/rules_block/lheading.js","../../../../node_modules/markdown-it/lib/common/html_blocks.js","../../../../node_modules/markdown-it/lib/common/html_re.js","../../../../node_modules/markdown-it/lib/rules_block/html_block.js","../../../../node_modules/markdown-it/lib/rules_block/paragraph.js","../../../../node_modules/markdown-it/lib/rules_block/state_block.js","../../../../node_modules/markdown-it/lib/parser_block.js","../../../../node_modules/markdown-it/lib/rules_inline/text.js","../../../../node_modules/markdown-it/lib/rules_inline/newline.js","../../../../node_modules/markdown-it/lib/rules_inline/escape.js","../../../../node_modules/markdown-it/lib/rules_inline/backticks.js","../../../../node_modules/markdown-it/lib/rules_inline/strikethrough.js","../../../../node_modules/markdown-it/lib/rules_inline/emphasis.js","../../../../node_modules/markdown-it/lib/rules_inline/link.js","../../../../node_modules/markdown-it/lib/rules_inline/image.js","../../../../node_modules/markdown-it/lib/rules_inline/autolink.js","../../../../node_modules/markdown-it/lib/rules_inline/html_inline.js","../../../../node_modules/markdown-it/lib/rules_inline/entity.js","../../../../node_modules/markdown-it/lib/rules_inline/balance_pairs.js","../../../../node_modules/markdown-it/lib/rules_inline/text_collapse.js","../../../../node_modules/markdown-it/lib/rules_inline/state_inline.js","../../../../node_modules/markdown-it/lib/parser_inline.js","../../../../node_modules/linkify-it/lib/re.js","../../../../node_modules/linkify-it/index.js","../../../../node_modules/markdown-it/lib/presets/default.js","../../../../node_modules/markdown-it/lib/presets/zero.js","../../../../node_modules/markdown-it/lib/presets/commonmark.js","../../../../node_modules/markdown-it/lib/index.js","../../../../node_modules/markdown-it/index.js","../../../../node_modules/uuid/lib/rng-browser.js","../../../../node_modules/uuid/lib/bytesToUuid.js","../../../../node_modules/uuid/v4.js","actions/PostActions.js","../../../../brain/tools/events/EditorEvent.js","../../../../node_modules/tiny-date-picker/dist/tiny-date-picker.js","../../src/mirror.js","../../src/utils.js","../../src/input.js","../../src/editable.js","../../src/main.js","../../../../brain/tools/ui/TextEditor.js","controllers/PostEditor.js","controllers/PostIndex.js","controllers/DashManager.js","Base.js","Start.js"],"names":["EventEmitter","listeners","Map","label","callback","has","set","get","push","isFunction","obj","index","length","reduce","i","listener","splice","args","forEach","REQUEST_GOOD","REQUEST_LAME","IMG_REQUEST_GOOD","IMG_REQUEST_LAME","SETTINGS_LOADED","HTML_LOADED","ARCHIVES_JSON_LOADED","ARCHIVES_PAGE_LOADED","ARCHIVES_ENTRY_LOADED","PROJECT_UPDATED","PROJECT_ADDED","PROJECTS_SORTED","POST_IMAGE_ADDED","FEATURE_IMAGE_ADDED","POST_ERROR","POST_ADDED","POST_UPDATED","POST_DELETED","POSTS_SYNCED","LOCAL_DB_READY","DataEvent","REQUEST_TYPE_POST","REQUEST_TYPE_GET","REQUEST_TYPE_PUT","REQUEST_TYPE_DELETE","CONTENT_TYPE_JSON","CONTENT_TYPE_FORM","DataUtils","self","requestURL","eventType","requestType","contentType","requestData","Promise","resolve","reject","request","XMLHttpRequest","upload","onprogress","handleLoadProgress","open","onload","e","status","setRequestHeader","send","JSON","stringify","url","responseType","response","Error","statusText","onerror","src","body","document","querySelector","myImage","Image","crossOrigin","imgLoad","then","imageURL","window","URL","createObjectURL","percentComplete","Math","ceil","loaded","total","Animate","properties","animation","anime","StringUtils","string","clean","replace","toLowerCase","quote_style","optTemp","noquotes","toString","OPTS","concat","ENT_HTML_QUOTE_SINGLE","asap","props","Debug.setDebug","Debug.debug","Debug.getErrorWithStack","keys","Debug.deprecated","_events","_maxListeners","undefined","module","exports","prototype","defaultMaxListeners","setMaxListeners","n","isNumber","isNaN","TypeError","emit","type","er","handler","len","error","isObject","arguments","err","context","isUndefined","call","Array","slice","apply","addListener","m","newListener","warned","console","trace","on","once","fired","g","removeListener","list","position","removeAllListeners","key","ret","listenerCount","evlistener","emitter","arg","extend","hasOwnProperty","Object","target","source","Number","x","uniqNoSet","arr","indexOf","uniqSet","seen","Set","filter","el","add","uniqSetWithForEach","doesForEachActuallyWork","global","numberIsNan","require","arrayUniq","reInt","deepUnique","sort","parse","str","split","map","trim","value","substring","postfix","intVal","parseInt","floatVal","parseFloat","test","width","height","density","join","tokenizer","SINGLE_QUOTE","DOUBLE_QUOTE","BACKSLASH","SLASH","NEWLINE","SPACE","FEED","TAB","CR","OPEN_SQUARE","CLOSE_SQUARE","OPEN_PARENTHESES","CLOSE_PARENTHESES","OPEN_CURLY","CLOSE_CURLY","SEMICOLON","ASTERISK","COLON","AT","RE_AT_END","RE_WORD_END","RE_BAD_BRACKET","RE_HEX_ESCAPE","input","options","css","valueOf","ignore","ignoreErrors","code","next","quote","lines","last","content","escape","nextLine","nextOffset","escaped","escapePos","prev","currentToken","offset","line","pos","buffer","returned","unclosed","what","endOfFile","nextToken","pop","charCodeAt","lastIndex","charAt","back","token","intToCharMap","encode","number","decode","charCode","bigA","bigZ","littleA","littleZ","zero","nine","plus","slash","littleOffset","numberOffset","base64","VLQ_BASE_SHIFT","VLQ_BASE","VLQ_BASE_MASK","VLQ_CONTINUATION_BIT","toVLQSigned","aValue","fromVLQSigned","isNegative","shifted","base64VLQ_encode","encoded","digit","vlq","base64VLQ_decode","aStr","aIndex","aOutParam","strLen","result","shift","continuation","rest","getArg","aArgs","aName","aDefaultValue","urlRegexp","dataUrlRegexp","urlParse","aUrl","match","scheme","auth","host","port","path","urlGenerate","aParsedUrl","normalize","aPath","isAbsolute","parts","part","up","aRoot","aPathUrl","aRootUrl","joined","relative","level","lastIndexOf","substr","supportsNullProto","create","identity","s","toSetString","isProtoString","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","strcmp","originalLine","originalColumn","generatedColumn","generatedLine","name","compareByGeneratedPositionsDeflated","onlyCompareGenerated","aStr1","aStr2","compareByGeneratedPositionsInflated","parseSourceMapInput","computeSourceURL","sourceRoot","sourceURL","sourceMapURL","parsed","util","hasNativeMap","ArraySet","_array","_set","fromArray","ArraySet_fromArray","aArray","aAllowDuplicates","size","ArraySet_size","getOwnPropertyNames","ArraySet_add","sStr","isDuplicate","idx","ArraySet_has","ArraySet_indexOf","at","ArraySet_at","aIdx","toArray","ArraySet_toArray","generatedPositionAfter","lineA","lineB","columnA","columnB","MappingList","_sorted","_last","unsortedForEach","MappingList_forEach","aCallback","aThisArg","MappingList_add","aMapping","MappingList_toArray","base64VLQ","SourceMapGenerator","_file","_sourceRoot","_skipValidation","_sources","_names","_mappings","_sourcesContents","_version","fromSourceMap","SourceMapGenerator_fromSourceMap","aSourceMapConsumer","generator","file","eachMapping","mapping","newMapping","generated","column","original","addMapping","sources","sourceFile","sourceRelative","sourceContentFor","setSourceContent","SourceMapGenerator_addMapping","_validateMapping","String","SourceMapGenerator_setSourceContent","aSourceFile","aSourceContent","applySourceMap","SourceMapGenerator_applySourceMap","aSourceMapPath","newSources","newNames","originalPositionFor","SourceMapGenerator_validateMapping","aGenerated","aOriginal","aSource","_serializeMappings","SourceMapGenerator_serializeMappings","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","nameIdx","sourceIdx","mappings","_generateSourcesContent","SourceMapGenerator_generateSourcesContent","aSources","aSourceRoot","toJSON","SourceMapGenerator_toJSON","version","names","sourcesContent","SourceMapGenerator_toString","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","recursiveSearch","aLow","aHigh","aNeedle","aHaystack","aCompare","aBias","mid","floor","search","swap","ary","y","temp","randomIntInRange","low","high","round","random","doQuickSort","comparator","p","r","pivotIndex","pivot","j","q","quickSort","binarySearch","SourceMapConsumer","aSourceMap","aSourceMapURL","sourceMap","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","__generatedMappings","defineProperty","configurable","enumerable","_parseMappings","__originalMappings","_charIsMappingSeparator","SourceMapConsumer_charIsMappingSeparator","c","SourceMapConsumer_parseMappings","GENERATED_ORDER","ORIGINAL_ORDER","SourceMapConsumer_eachMapping","aContext","aOrder","order","_generatedMappings","_originalMappings","_sourceMapURL","allGeneratedPositionsFor","SourceMapConsumer_allGeneratedPositionsFor","needle","_findSourceIndex","_findMapping","lastColumn","_absoluteSources","consumer","relativeSource","SourceMapConsumer_fromSourceMap","smc","generatedMappings","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","Mapping","cachedSegments","originalMappings","segment","end","SourceMapConsumer_findMapping","aMappings","aLineName","aColumnName","aComparator","computeColumnSpans","SourceMapConsumer_computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","SourceMapConsumer_originalPositionFor","hasContentsOfAllSources","BasicSourceMapConsumer_hasContentsOfAllSources","some","sc","SourceMapConsumer_sourceContentFor","nullOnMissing","fileUriAbsPath","generatedPositionFor","SourceMapConsumer_generatedPositionFor","lastOffset","_sections","offsetLine","offsetColumn","generatedOffset","constructor","IndexedSourceMapConsumer_originalPositionFor","sectionIndex","section","bias","IndexedSourceMapConsumer_hasContentsOfAllSources","every","IndexedSourceMapConsumer_sourceContentFor","IndexedSourceMapConsumer_generatedPositionFor","generatedPosition","IndexedSourceMapConsumer_parseMappings","sectionMappings","adjustedMapping","REGEX_NEWLINE","NEWLINE_CODE","isSourceNode","SourceNode","aLine","aColumn","aChunks","children","sourceContents","fromStringWithSourceMap","SourceNode_fromStringWithSourceMap","aGeneratedCode","aRelativePath","node","remainingLines","remainingLinesIndex","shiftNextLine","lineContents","getNextLine","newLine","lastGeneratedLine","lastMapping","addMappingWithCode","SourceNode_add","aChunk","isArray","chunk","prepend","SourceNode_prepend","unshift","walk","SourceNode_walk","aFn","SourceNode_join","aSep","newChildren","replaceRight","SourceNode_replaceRight","aPattern","aReplacement","lastChild","SourceNode_setSourceContent","walkSourceContents","SourceNode_walkSourceContents","SourceNode_toString","toStringWithSourceMap","SourceNode_toStringWithSourceMap","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","sourceContent","process","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","setTimeout","clearTimeout","runTimeout","fun","runClearTimeout","marker","queue","draining","currentQueue","queueIndex","cleanUpNextTick","drainQueue","timeout","run","nextTick","Item","array","title","browser","env","argv","versions","noop","off","prependListener","prependOnceListener","binding","cwd","chdir","dir","umask","fromBase64","Buffer","from","Uint8Array","atob","PreviousMap","opts","loadAnnotation","inline","startWith","annotation","text","loadMap","consumerCache","mozilla","withContent","start","decodeInline","baseUri","uri","decodeURIComponent","RegExp","lastMatch","encoding","prevPath","fs","existsSync","readFileSync","isMap","dirname","root","sequence","Input","mapResolve","id","message","origin","CssSyntaxError","plugin","HIGHLIGHT_THEME","chalk","cyan","gray","green","yellow","magenta","getTokenType","processor","terminalHighlight","color","reason","setMessage","captureStackTrace","showSourceCode","supportsColor","stdout","max","min","maxWidth","mark","red","bold","aside","gutter","spacing","defaultRaw","colon","indent","beforeDecl","beforeRule","beforeOpen","beforeClose","beforeComment","after","emptyBody","commentLeft","commentRight","capitalize","toUpperCase","Stringifier","builder","semicolon","raws","comment","left","raw","right","decl","between","prop","rawValue","important","rule","block","ownSemicolon","atrule","params","afterName","nodes","child","before","own","detect","parent","first","rawCache","beforeAfter","method","rawSemicolon","rawEmptyBody","rawIndent","rawBeforeComment","walkComments","rawBeforeDecl","walkDecls","rawBeforeRule","rawBeforeClose","rawBeforeOpen","rawColon","buf","depth","step","warnOnce","printed","warn","cloneNode","cloned","Node","defaults","positionBy","data","remove","removeChild","stringifier","clone","overrides","cloneBefore","insertBefore","cloneAfter","insertAfter","replaceWith","moveTo","newParent","cleanRaws","append","moveBefore","otherNode","moveAfter","fixed","defaultType","keepBetween","positionInside","word","Declaration","MapGenerator","mapOpts","previous","previousMaps","isInline","isSourcesContent","clearAnnotation","setSourcesContent","already","applyPrevMaps","isAnnotation","toBase64","btoa","unescape","encodeURIComponent","addAnnotation","outputFile","eol","to","generateMap","generateString","sep","sourcePath","generate","Warning","opt","Result","messages","lastPlugin","postcssPlugin","warning","warnings","Comment","separators","current","func","letter","space","spaces","comma","Rule","selector","values","Container","Root","sample","toResult","LazyResult","Processor","lazy","cleanSource","each","lastEach","indexes","walkRules","walkAtRules","reverse","exist","removeAll","replaceValues","pattern","fast","condition","AtRule","processed","rebuild","fix","Parser","createTokenizer","freeSemicolon","emptyRule","other","endFile","init","bracket","brackets","tokens","unclosedBracket","unknownWord","spacesAndCommentsFromEnd","spacesAndCommentsFromStart","precheckMissedSemicolon","stringFrom","spacesFromEnd","cache","checkMissedSemicolon","unnamedAtrule","unexpectedClose","unclosedBlock","all","lastTokenType","doubleColon","founded","safe","parser","isPromise","stringified","syntax","sync","onFulfilled","onRejected","async","catch","handleError","postcssVersion","pluginName","pluginVer","runtimeVer","a","b","asyncTick","plugins","promise","processing","use","normalized","postcss","vendor","prefix","unprefixed","initializer","creator","transformer","processOpts","pluginOpts","atRule","qs","eq","regexp","maxKeys","kstr","vstr","k","v","xs","stringifyPrimitive","isFinite","objectKeys","ks","f","res","DateUtils","time","Date","getFullYear","getMonth","getDate","getHours","getMinutes","getSeconds","getTime","seconds","date","rawdate","day","getUTCDate","month","getUTCMonth","year","getUTCFullYear","hour","getUTCHours","minute","getUTCMinutes","getUTCSeconds","millisecond","getUTCMilliseconds","getTimezoneOffset","COUNT","FINAL_KEY","DBUtils","dataUtils","db","Dexie","stores","postList","postData","freshID","put","fresh","update","post","updated","consol","log","syncRemote","clear","bulkAdd","event","BulkError","newPostId","bounce","newPost","archive","deleted","md","uuidv4","PostActions","dateUtils","dbUtils","files","lastKey","freshData","txt","createElement","innerHTML","getElementById","html","buffed","allowedTags","allowedAttributes","img","iframe","decodeHTML","slug","cleanString","plaintext","render","xhtmlOut","created","tags","page","getAttribute","featured","published","feature","uuid","author","modify","archivePost","EDITOR_DELETE","EDITOR_UPLOAD_POST_IMAGE","EDITOR_SAVE","EDITOR_UPDATE","EditorEvent","attributes","createMirror","element","mirror","mirrorCss","tagName","attr","getComputedStyle","initialize","styles","style","parentNode","nextSibling","rect","ownerDocument","boundingRect","offsetLeft","offsetTop","offsetHeight","isContentEditable","contentEditable","getContext","settings","customPos","noShadowCaret","contentWindow","contentDocument","getOffset","ctx","win","doc","getBoundingClientRect","docEl","documentElement","scrollLeft","pageXOffset","scrollTop","pageYOffset","top","createInputCaret","getPos","selectionStart","setPos","setSelectionRange","elementOffset","getPosition","format","val","startRange","endRange","createEditableCaret","sel","getSelection","found","find","childNodes","nodeType","range","createRange","setStart","removeAllRanges","addRange","getRange","hasCustomPos","endOffset","endContainer","clonedRange","cloneRange","fixedPosition","setEnd","detach","shadowCaret","createTextNode","insertNode","selectNode","clientTop","clientLeft","inputOffset","rangeCount","getRangeAt","selectNodeContents","createCaret","caret","TextEditor","textEditor","scrollLimit","hljs","initHighlightingOnLoad","fixLimit","caretPos","setInputs","addEventListener","refresh","editorButtons","querySelectorAll","handleEditorOption","inputType","spiffed","highlight","innerText","classList","pulled","deleteContents","preventDefault","emitEvent","PostEditor","anim","urlPieces","postID","getPost","editor","handleEditorOptions","handleImageUpload","mode","handleImageActions","click","optionButtons","handlePostOptions","currentOption","active","setAttribute","uploadFiles","location","notify","confirm","deletePost","stopPropagation","dataTransfer","dropEffect","reader","FileReader","theFile","image","span","appendChild","readAsDataURL","imageData","FormData","PostIndex","currentPage","choosePage","DashManager","currentDisplay","chooseDisplay","Base","dashManager","cacheAssets","storeLocalData","posts","syncLocal","navigator","serviceWorker","register","registration","base"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IAAMA;;;AAGF;AACA;AACA;AACA,0BACA;AAAA;;AACI,SAAKC,SAAL,GAAiB,IAAIC,GAAJ,EAAjB;AACH,IACD;AACA;AACA;;;;;gCACYC,OAAOC,UAAU;AACzB,WAAKH,SAAL,CAAeI,GAAf,CAAmBF,KAAnB,KAA6B,KAAKF,SAAL,CAAeK,GAAf,CAAmBH,KAAnB,EAA0B,EAA1B,CAA7B;AACA,WAAKF,SAAL,CAAeM,GAAf,CAAmBJ,KAAnB,EAA0BK,IAA1B,CAA+BJ,QAA/B;AACH;;;mCAEcD,OAAOC,UAAU;AAC5B,UAAIK,UAAU,GAAG,SAAbA,UAAa,CAASC,GAAT,EAAc;AAC3B,eAAO,OAAOA,GAAP,IAAc,UAAd,IAA4B,KAAnC;AACH,OAFD;;AAIA,UAAIT,SAAS,GAAG,KAAKA,SAAL,CAAeM,GAAf,CAAmBJ,KAAnB,CAAhB;AAAA,UACIQ,KADJ;;AAGA,UAAIV,SAAS,IAAIA,SAAS,CAACW,MAA3B,EAAmC;AAC/BD,QAAAA,KAAK,GAAGV,SAAS,CAACY,MAAV,CAAiB,UAACC,CAAD,EAAIC,QAAJ,EAAcJ,KAAd,EAAwB;AAC7C,iBAAQF,UAAU,CAACM,QAAD,CAAV,IAAwBA,QAAQ,KAAKX,QAAtC,GACDU,CAAC,GAAGH,KADH,GAEDG,CAFN;AAGH,SAJO,EAIL,CAAC,CAJI,CAAR;;AAMA,YAAIH,KAAK,GAAG,CAAC,CAAb,EAAgB;AACZV,UAAAA,SAAS,CAACe,MAAV,CAAiBL,KAAjB,EAAwB,CAAxB;AACA,eAAKV,SAAL,CAAeK,GAAf,CAAmBH,KAAnB,EAA0BF,SAA1B;AACA,iBAAO,IAAP;AACH;AACJ;;AACD,aAAO,KAAP;AACH;;;8BAESE,OAAgB;AAAA,wCAANc,IAAM;AAANA,QAAAA,IAAM;AAAA;;AACtB,UAAIhB,SAAS,GAAG,KAAKA,SAAL,CAAeM,GAAf,CAAmBJ,KAAnB,CAAhB;;AACA,UAAIF,SAAS,IAAIA,SAAS,CAACW,MAA3B,EAAmC;AAC/BX,QAAAA,SAAS,CAACiB,OAAV,CAAkB,UAACH,QAAD,EAAc;AAC5BA,UAAAA,QAAQ,MAAR,SAAYE,IAAZ;AACH,SAFD;AAGA,eAAO,IAAP;AACH;;AACD,aAAO,KAAP;AACH,MACD;AACA;AACA;;;;;;;eAEWjB;;;;;;;;;;;;ACxDR,IAAMmB,YAAY,GAAG,aAArB;;AACA,IAAMC,YAAY,GAAG,aAArB;;AACA,IAAMC,gBAAgB,GAAG,gBAAzB;;AACA,IAAMC,gBAAgB,GAAG,gBAAzB;;AACA,IAAMC,eAAe,GAAG,YAAxB;;AACA,IAAMC,WAAW,GAAG,YAApB;;AACA,IAAMC,oBAAoB,GAAG,oBAA7B;;AACA,IAAMC,oBAAoB,GAAG,oBAA7B;;AACA,IAAMC,qBAAqB,GAAG,qBAA9B;;AACA,IAAMC,eAAe,GAAG,gBAAxB;;AACA,IAAMC,aAAa,GAAG,cAAtB;;AACA,IAAMC,eAAe,GAAG,gBAAxB;;AACA,IAAMC,gBAAgB,GAAG,gBAAzB;;AACA,IAAMC,mBAAmB,GAAG,mBAA5B;;AACA,IAAMC,UAAU,GAAG,WAAnB;;AACA,IAAMC,UAAU,GAAG,WAAnB;;AACA,IAAMC,YAAY,GAAG,aAArB;;AACA,IAAMC,YAAY,GAAG,gBAArB;;AACA,IAAMC,YAAY,GAAG,aAArB;;AACA,IAAMC,cAAc,GAAG,cAAvB;;;IAEDC;;;;eAaS,IAAIA,SAAJ;;;;;;;;;;;AC5Bf;;AACA;;;;;;;;;;;;;;;;;;;;;;;;AAPO,IAAMC,iBAAiB,GAAG,MAA1B;;AACA,IAAMC,gBAAgB,GAAG,KAAzB;;AACA,IAAMC,gBAAgB,GAAG,KAAzB;;AACA,IAAMC,mBAAmB,GAAG,QAA5B;;AACA,IAAMC,iBAAiB,GAAG,MAA1B;;AACA,IAAMC,iBAAiB,GAAG,uBAA1B;;;IAGDC;;;;;AAEF;AACA;AACA;AACA,uBACA;AAAA;;AAAA;;AACI;;AACA,QAAIC,IAAI,wDAAR;;AAFJ;AAGC,IACD;AACA;AACA;;;;;4BACQC,YAAYC,WACpB;AAAA,UAD+BC,WAC/B,uEAD6CT,gBAC7C;AAAA,UAD+DU,WAC/D,uEAD6EP,iBAC7E;AAAA,UADgGQ,WAChG,uEAD8G,IAC9G;AACI,UAAIL,IAAI,GAAG,IAAX;AACA,aAAO,IAAIM,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACI,YAAIC,OAAO,GAAG,IAAIC,cAAJ,EAAd;AACAD,QAAAA,OAAO,CAACE,MAAR,CAAeC,UAAf,GAA4BZ,IAAI,CAACa,kBAAjC;AACAJ,QAAAA,OAAO,CAACK,IAAR,CAAaX,WAAb,EAA0BF,UAA1B,EAAsC,IAAtC;;AACAQ,QAAAA,OAAO,CAACM,MAAR,GAAiB,UAASC,CAAT,EACjB;AACI,cAAIP,OAAO,CAACQ,MAAR,IAAkB,GAAtB,EACA;AACIV,YAAAA,OAAO,CACP;AACIE,cAAAA,OAAO,EAAPA,OADJ;AAEIP,cAAAA,SAAS,EAATA;AAFJ,aADO,CAAP;AAKH,WAPD,MASA;AACIM,YAAAA,MAAM,CACN;AACIC,cAAAA,OAAO,EAAPA,OADJ;AAEIP,cAAAA,SAAS,EAATA;AAFJ,aADM,CAAN;AAKH;;AAAA;AACJ,SAlBD;;AAmBA,YAAIC,WAAW,IAAIR,gBAAf,IAAmCQ,WAAW,IAAIV,iBAAtD,EACA;AACI,kBAAQW,WAAR;AAEI,iBAAKP,iBAAL;AACIY,cAAAA,OAAO,CAACS,gBAAR,CAAyB,cAAzB,EAAyC,iBAAiBd,WAA1D;AACAK,cAAAA,OAAO,CAACU,IAAR,CAAaC,IAAI,CAACC,SAAL,CAAehB,WAAf,CAAb;AACA;;AACJ,iBAAKP,iBAAL;AACIW,cAAAA,OAAO,CAACU,IAAR,CAAad,WAAb;AACA;AARR;AAUH,SAZD,MAcA;AACII,UAAAA,OAAO,CAACU,IAAR;AACH;AACJ,OAzCM,CAAP;AA0CH;;;4BACOG,KACR;AACI,mBADJ,CAEI;AACA;;AACA,aAAO,IAAIhB,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACI;AACA,YAAIC,OAAO,GAAG,IAAIC,cAAJ,EAAd;AACAD,QAAAA,OAAO,CAACK,IAAR,CAAa,KAAb,EAAoBQ,GAApB;AACAb,QAAAA,OAAO,CAACc,YAAR,GAAuB,MAAvB,CAJJ,CAKI;;AACAd,QAAAA,OAAO,CAACM,MAAR,GAAiB,YACjB;AACI,cAAIN,OAAO,CAACQ,MAAR,KAAmB,GAAvB,EACA;AACI;AACAV,YAAAA,OAAO,CAACE,OAAO,CAACe,QAAT,CAAP;AACH,WAJD,MAMA;AACI;AACAhB,YAAAA,MAAM,CAAC,IAAIiB,KAAJ,CAAU,iDAAiDhB,OAAO,CAACiB,UAAnE,CAAD,CAAN;AACH;AACJ,SAZD;;AAaAjB,QAAAA,OAAO,CAACkB,OAAR,GAAkB,YAClB;AACI;AACA;AACAnB,UAAAA,MAAM,CAAC,IAAIiB,KAAJ,CAAU,4BAAV,CAAD,CAAN;AACH,SALD,CAnBJ,CAyBI;;;AACAhB,QAAAA,OAAO,CAACU,IAAR;AACH,OA5BM,CAAP;AA6BH;;;8BACSS,KACV;AACI;;AACA,UAAI5B,IAAI,GAAG,IAAX;AACA,aAAO,IAAIM,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACI;AACA,YAAIqB,IAAI,GAAGC,QAAQ,CAACC,aAAT,CAAuB,MAAvB,CAAX;AAAA,YACIC,OAAO,GAAG,IAAIC,KAAJ,EADd;AAEAD,QAAAA,OAAO,CAACE,WAAR,GAAsB,EAAtB,CAJJ,CAI8B;AAC1B;AACA;;AACAlC,QAAAA,IAAI,CAACmC,OAAL,CAAaP,GAAb,EAAkBQ,IAAlB,CAAuB,UAASZ,QAAT,EACvB;AACI;AACA,cAAIa,QAAQ,GAAGC,MAAM,CAACC,GAAP,CAAWC,eAAX,CAA2BhB,QAA3B,CAAf;AACAjB,UAAAA,OAAO,CAAC8B,QAAD,CAAP,CAHJ,CAII;AACA;AACA;AACA;AACH,SATD,EASG,UAASZ,KAAT,EACH;AACIjB,UAAAA,MAAM,CAACiB,KAAD,CAAN;AACH,SAZD;AAaH,OArBM,CAAP;AAsBH,MACD;AACA;AACA;;;;uCACmBT,GACnB;AACI,UAAIyB,eAAe,GAAGC,IAAI,CAACC,IAAL,CAAW3B,CAAC,CAAC4B,MAAF,GAAW5B,CAAC,CAAC6B,KAAd,GAAuB,GAAjC,CAAtB,CADJ,CAEI;AACH;;;;EAhImB5F;;eAkIT8C;;;;;;;;;;AC1If;;;;;;;;;;;;;;;;;;;;;;IAEM+C;;;;;AACF;AACA;AACA;AACA,qBAAc;AAAA;;AAAA;AAEb,IACD;AACA;AACA;;;;;2BACOC,YAAY;AACf,UAAIC,SAAS,GAAGC,KAAK,CACjBF,UADiB,CAArB,CADe,CAIf;AACH,MACD;AACA;AACA;;;;;EAlBkB9F;;eAoBP6F;;;;;;;;;;;;;;;;ICtBTI;;;AAGF;AACA;AACA;AACA,yBACA;AAAA;AAAE,IACF;AACA;AACA;;;;;gCACYC,QACZ;AACI,UAAIC,KAAK,GAAGD,MAAM,CAACE,OAAP,CAAe,kCAAf,EAAmD,EAAnD,EAAuDC,WAAvD,GAAqED,OAArE,CAA6E,YAA7E,EAA2F,GAA3F,CAAZ;AACA,aAAOD,KAAP;AACH;;;+BAEUD,QAAQI,aAAa;AAC5B,UAAIC,OAAO,GAAG,CAAd;AAAA,UACIzF,CAAC,GAAG,CADR;AAAA,UAEI0F,QAAQ,GAAG,KAFf;;AAGA,UAAI,OAAOF,WAAP,KAAuB,WAA3B,EAAwC;AACpCA,QAAAA,WAAW,GAAG,CAAd;AACH;;AACDJ,MAAAA,MAAM,GAAGA,MAAM,CAACO,QAAP,GAAkBL,OAAlB,CAA0B,OAA1B,EAAmC,GAAnC,EAAwCA,OAAxC,CAAgD,OAAhD,EAAyD,GAAzD,CAAT;AACA,UAAIM,IAAI,GAAG;AACP,wBAAgB,CADT;AAEP,iCAAyB,CAFlB;AAGP,iCAAyB,CAHlB;AAIP,sBAAc,CAJP;AAKP,sBAAc,CALP;AAMP,sBAAc;AANP,OAAX;;AAQA,UAAIJ,WAAW,KAAK,CAApB,EAAuB;AACnBE,QAAAA,QAAQ,GAAG,IAAX;AACH;;AACD,UAAI,OAAOF,WAAP,KAAuB,QAA3B,EAAqC;AAAE;AACnCA,QAAAA,WAAW,GAAG,GAAGK,MAAH,CAAUL,WAAV,CAAd;;AACA,aAAKxF,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGwF,WAAW,CAAC1F,MAA5B,EAAoCE,CAAC,EAArC,EAAyC;AACrC;AACA,cAAI4F,IAAI,CAACJ,WAAW,CAACxF,CAAD,CAAZ,CAAJ,KAAyB,CAA7B,EAAgC;AAC5B0F,YAAAA,QAAQ,GAAG,IAAX;AACH,WAFD,MAEO,IAAIE,IAAI,CAACJ,WAAW,CAACxF,CAAD,CAAZ,CAAR,EAA0B;AAC7ByF,YAAAA,OAAO,GAAGA,OAAO,GAAGG,IAAI,CAACJ,WAAW,CAACxF,CAAD,CAAZ,CAAxB;AACH;AACJ;;AACDwF,QAAAA,WAAW,GAAGC,OAAd;AACH;;AACD,UAAID,WAAW,GAAGI,IAAI,CAACE,qBAAvB,EAA8C;AAC1CV,QAAAA,MAAM,GAAGA,MAAM,CAACE,OAAP,CAAe,UAAf,EAA2B,GAA3B,CAAT,CAD0C,CACA;AAC1C;AACH;;AACD,UAAI,CAACI,QAAL,EAAe;AACXN,QAAAA,MAAM,GAAGA,MAAM,CAACE,OAAP,CAAe,SAAf,EAA0B,GAA1B,CAAT;AACH,OArC2B,CAsC5B;;;AACAF,MAAAA,MAAM,GAAGA,MAAM,CAACE,OAAP,CAAe,QAAf,EAAyB,GAAzB,CAAT;AACA,aAAOF,MAAP;AACH,MAEG;AACA;AACA;;;;;;;eAEOD;;;;;;;;;;;;;;;;;;;;;;;;;AChER,IAAI,IAAI,GAAG,MAAM,CAAC,IAAlB;AACP,IAAW,OAAO,GAAG,KAAK,CAAC,OAA3B;;AACA,IAAW,OAAO,GACd,OAAO,IAAP,KAAgB,WAAhB,GAA8B,IAA9B,GACA,OAAO,MAAP,KAAkB,WAAlB,GAAgC,MAAhC,GACA,MAHJ;;AAKA,SAAA,MAAA,CAAuB,GAAvB,EAA4B,SAA5B,EAAqC;AACjC,MAAI,QAAO,SAAP,MAAqB,QAAzB,EAAmC,OAAO,GAAP;AACnC,EAAA,IAAI,CAAC,SAAD,CAAJ,CAAgB,OAAhB,CAAwB,UAAU,GAAV,EAAa;AACjC,IAAA,GAAG,CAAC,GAAD,CAAH,GAAW,SAAS,CAAC,GAAD,CAApB;AACH,GAFD;AAGA,SAAO,GAAP;AACH;;AAED,IAAa,QAAQ,GAAG,MAAM,CAAC,cAA/B;AACA,IAAa,OAAO,GAAG,GAAG,cAA1B;;AACA,SAAA,MAAA,CAAuB,GAAvB,EAA4B,IAA5B,EAAgC;AAC5B,SAAO,OAAO,CAAC,IAAR,CAAa,GAAb,EAAkB,IAAlB,CAAP;AACH;;AAED,SAAA,KAAA,CAAuB,KAAvB,EAA8B,SAA9B,EAAuC;AACnC,MAAI,OAAO,SAAP,KAAqB,UAAzB,EAAqC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAD,CAAT,CAArB;AACrC,EAAA,IAAI,CAAC,SAAD,CAAJ,CAAgB,OAAhB,CAAwB,UAAA,GAAA,EAAG;AACvB,IAAA,OAAO,CAAC,KAAD,EAAQ,GAAR,EAAa,SAAS,CAAC,GAAD,CAAtB,CAAP;AACH,GAFD;AAGH;;AAED,IAAa,cAAc,GAAG,MAAM,CAAC,cAArC;;AAEA,SAAA,OAAA,CAAwB,GAAxB,EAA6B,IAA7B,EAAmC,gBAAnC,EAAqD,OAArD,EAA4D;AACxD,EAAA,cAAc,CAAC,GAAD,EAAM,IAAN,EAAY,MAAM,CAAC,gBAAgB,IAAI,MAAM,CAAC,gBAAD,EAAmB,KAAnB,CAA1B,IAAuD,OAAO,gBAAgB,CAAC,GAAxB,KAAgC,UAAvF,GAC7B;AAAC,IAAA,GAAG,EAAE,gBAAgB,CAAC,GAAvB;AAA4B,IAAA,GAAG,EAAE,gBAAgB,CAAC,GAAlD;AAAuD,IAAA,YAAY,EAAE;AAArE,GAD6B,GAE7B;AAAC,IAAA,KAAK,EAAE,gBAAR;AAA0B,IAAA,YAAY,EAAE,IAAxC;AAA8C,IAAA,QAAQ,EAAE;AAAxD,GAF4B,EAEmC,OAFnC,CAAlB,CAAd;AAGH;;AAED,SAAA,MAAA,CAAuB,KAAvB,EAA4B;AACxB,SAAO;AACH,IAAA,IAAI,EAAE,UAAU,MAAV,EAAgB;AAClB,MAAA,KAAK,CAAC,SAAN,GAAkB,MAAM,CAAC,MAAP,CAAc,MAAM,CAAC,SAArB,CAAlB;AACA,MAAA,OAAO,CAAC,KAAK,CAAC,SAAP,EAAkB,aAAlB,EAAiC,KAAjC,CAAP;AACA,aAAO;AACH,QAAA,MAAM,EAAE,KAAK,CAAC,IAAN,CAAW,IAAX,EAAiB,KAAK,CAAC,SAAvB;AADL,OAAP;AAGH;AAPE,GAAP;AASH;;AAED,IAAa,wBAAwB,GAAG,MAAM,CAAC,wBAA/C;;AAEA,SAAA,qBAAA,CAAsC,GAAtC,EAA2C,IAA3C,EAA+C;AAC3C,MAAI,EAAE,GAAG,wBAAwB,CAAC,GAAD,EAAM,IAAN,CAAjC;AAAA,MACI,KADJ;AAEA,SAAO,EAAE,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAD,CAAjB,KAA2B,qBAAqB,CAAE,KAAF,EAAS,IAAT,CAA7D;AACH;;AAED,IAAI,MAAM,GAAG,GAAG,KAAhB;;AACA,SAAA,KAAA,CAAsB,IAAtB,EAA4B,KAA5B,EAAmC,GAAnC,EAAsC;AAClC,SAAO,MAAM,CAAC,IAAP,CAAY,IAAZ,EAAkB,KAAlB,EAAyB,GAAzB,CAAP;AACH;;AAED,SAAA,QAAA,CAAyB,QAAzB,EAAmC,gBAAnC,EAAmD;AAC/C,SAAO,gBAAgB,CAAC,QAAD,CAAvB;AACH;;AAED,SAAA,MAAA,CAAwB,CAAxB,EAAyB;AACrB,MAAI,CAAC,CAAL,EAAQ,MAAM,IAAI,KAAJ,CAAU,kBAAV,CAAN;AACX;;AAED,SAAA,IAAA,CAAqB,EAArB,EAAuB;AACnB,MAAI,OAAO,CAAC,YAAZ,EAA0B,YAAY,CAAC,EAAD,CAAZ,CAA1B,KAAiD,UAAU,CAAC,EAAD,EAAK,CAAL,CAAV;AACpD;;;;;;;;AAWD,SAAA,aAAA,CAA+B,KAA/B,EAAsC,SAAtC,EAA+C;AAC3C,SAAO,KAAK,CAAC,MAAN,CAAa,UAAC,MAAD,EAAS,IAAT,EAAe,CAAf,EAAgB;AAChC,QAAI,YAAY,GAAG,SAAS,CAAC,IAAD,EAAO,CAAP,CAA5B;AACA,QAAI,YAAJ,EAAkB,MAAM,CAAC,YAAY,CAAC,CAAD,CAAb,CAAN,GAA0B,YAAY,CAAC,CAAD,CAAtC;AAClB,WAAO,MAAP;AACH,GAJM,EAIJ,EAJI,CAAP;AAKH;;AAED,SAAA,UAAA,CAA2B,EAA3B,EAA+B,MAA/B,EAAqC;AACjC,SAAO,YAAA;AACH,QAAI;AACA,MAAA,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf;AACH,KAFD,CAEE,OAAO,CAAP,EAAU;AACR,MAAA,MAAM,CAAC,CAAD,CAAN;AACH;AACJ,GAND;AAOH;;AAED,SAAA,QAAA,CAAyB,EAAzB,EAA6B,OAA7B,EAAsC,IAAtC,EAA0C;AACtC,MAAI;AACA,IAAA,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,IAAf;AACH,GAFD,CAEE,OAAO,EAAP,EAAW;AACT,IAAA,OAAO,IAAI,OAAO,CAAC,EAAD,CAAlB;AACH;AACJ;;AAED,SAAA,YAAA,CAA6B,GAA7B,EAAkC,OAAlC,EAAyC;;AAErC,MAAI,MAAM,CAAC,GAAD,EAAM,OAAN,CAAV,EAA0B,OAAO,GAAG,CAAC,OAAD,CAAV,CAFW,CAES;;AAC9C,MAAI,CAAC,OAAL,EAAc,OAAO,GAAP;;AACd,MAAI,OAAO,OAAP,KAAmB,QAAvB,EAAiC;AAC7B,QAAI,EAAE,GAAG,EAAT;;AACA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,OAAO,CAAC,MAA5B,EAAoC,CAAC,GAAG,CAAxC,EAA2C,EAAE,CAA7C,EAAgD;AAC5C,UAAI,GAAG,GAAG,YAAY,CAAC,GAAD,EAAM,OAAO,CAAC,CAAD,CAAb,CAAtB;AACA,MAAA,EAAE,CAAC,IAAH,CAAQ,GAAR;AACH;;AACD,WAAO,EAAP;AACH;;AACD,MAAI,MAAM,GAAG,OAAO,CAAC,OAAR,CAAgB,GAAhB,CAAb;;AACA,MAAI,MAAM,KAAK,CAAC,CAAhB,EAAmB;AACf,QAAI,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,MAAR,CAAe,CAAf,EAAkB,MAAlB,CAAD,CAAlB;AACA,WAAO,QAAQ,KAAK,SAAb,GAAyB,SAAzB,GAAqC,YAAY,CAAC,QAAD,EAAW,OAAO,CAAC,MAAR,CAAe,MAAM,GAAG,CAAxB,CAAX,CAAxD;AACH;;AACD,SAAO,SAAP;AACH;;AAED,SAAA,YAAA,CAA6B,GAA7B,EAAkC,OAAlC,EAA2C,KAA3C,EAAgD;AAC5C,MAAI,CAAC,GAAD,IAAQ,OAAO,KAAK,SAAxB,EAAmC;AACnC,MAAI,cAAc,MAAd,IAAwB,MAAM,CAAC,QAAP,CAAgB,GAAhB,CAA5B,EAAkD;;AAClD,MAAI,OAAO,OAAP,KAAmB,QAAnB,IAA+B,YAAY,OAA/C,EAAwD;AACpD,IAAA,MAAM,CAAC,OAAO,KAAP,KAAiB,QAAjB,IAA6B,YAAY,KAA1C,CAAN;;AACA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,OAAO,CAAC,MAA5B,EAAoC,CAAC,GAAG,CAAxC,EAA2C,EAAE,CAA7C,EAAgD;AAC5C,MAAA,YAAY,CAAC,GAAD,EAAM,OAAO,CAAC,CAAD,CAAb,EAAkB,KAAK,CAAC,CAAD,CAAvB,CAAZ;AACH;AACJ,GALD,MAKO;AACH,QAAI,MAAM,GAAG,OAAO,CAAC,OAAR,CAAgB,GAAhB,CAAb;;AACA,QAAI,MAAM,KAAK,CAAC,CAAhB,EAAmB;AACf,UAAI,cAAc,GAAG,OAAO,CAAC,MAAR,CAAe,CAAf,EAAkB,MAAlB,CAArB;AACA,UAAI,gBAAgB,GAAG,OAAO,CAAC,MAAR,CAAe,MAAM,GAAG,CAAxB,CAAvB;AACA,UAAI,gBAAgB,KAAK,EAAzB;AACI,YAAI,KAAK,KAAK,SAAd,EAAyB,OAAO,GAAG,CAAC,cAAD,CAAV,CAAzB,KAA0D,GAAG,CAAC,cAAD,CAAH,GAAsB,KAAtB;AAD9D,aAEK;AACD,YAAI,QAAQ,GAAG,GAAG,CAAC,cAAD,CAAlB;AACA,YAAI,CAAC,QAAL,EAAe,QAAQ,GAAI,GAAG,CAAC,cAAD,CAAH,GAAsB,EAAlC;AACf,QAAA,YAAY,CAAC,QAAD,EAAW,gBAAX,EAA6B,KAA7B,CAAZ;AACH;AACJ,KAVD,MAUO;AACH,UAAI,KAAK,KAAK,SAAd,EAAyB,OAAO,GAAG,CAAC,OAAD,CAAV,CAAzB,KAAmD,GAAG,CAAC,OAAD,CAAH,GAAe,KAAf;AACtD;AACJ;AACJ;;AAED,SAAA,YAAA,CAA6B,GAA7B,EAAkC,OAAlC,EAAyC;AACrC,MAAI,OAAO,OAAP,KAAmB,QAAvB,EACI,YAAY,CAAC,GAAD,EAAM,OAAN,EAAe,SAAf,CAAZ,CADJ,KAEK,IAAI,YAAY,OAAhB,EACD,GAAG,GAAH,CAAO,IAAP,CAAY,OAAZ,EAAqB,UAAS,EAAT,EAAW;AAC5B,IAAA,YAAY,CAAC,GAAD,EAAM,EAAN,EAAU,SAAV,CAAZ;AACH,GAFD;AAGP;;AAED,SAAA,YAAA,CAA6B,GAA7B,EAAgC;AAC5B,MAAI,EAAE,GAAG,EAAT;;AACA,OAAK,IAAI,CAAT,IAAc,GAAd,EAAmB;AACf,QAAI,MAAM,CAAC,GAAD,EAAM,CAAN,CAAV,EAAoB,EAAE,CAAC,CAAD,CAAF,GAAQ,GAAG,CAAC,CAAD,CAAX;AACvB;;AACD,SAAO,EAAP;AACH;;AAED,IAAM,MAAM,GAAG,GAAG,MAAlB;;AACA,SAAA,OAAA,CAAyB,CAAzB,EAA0B;AACtB,SAAO,MAAM,CAAC,KAAP,CAAa,EAAb,EAAiB,CAAjB,CAAP;AACH;;;AAGD,IAAI,cAAc,GACd,yGACC,KADD,CACO,GADP,EACY,MADZ,CAEI,OAAO,CAAC,CAAC,CAAD,EAAG,EAAH,EAAM,EAAN,EAAS,EAAT,EAAa,GAAb,CAAiB,UAAA,GAAA,EAAG;AAAE,SAAA,CAAC,KAAD,EAAO,MAAP,EAAc,OAAd,EAAuB,GAAvB,CAA2B,UAAA,CAAA,EAAC;AAAE,WAAA,CAAC,GAAC,GAAF,GAAM,OAAN;AAAa,GAA3C,CAAA;AAA4C,CAAlE,CAAD,CAFX,EAGE,MAHF,CAGS,UAAA,CAAA,EAAC;AAAE,SAAA,OAAO,CAAC,CAAD,CAAP;AAAU,CAHtB,EAGwB,GAHxB,CAG4B,UAAA,CAAA,EAAC;AAAE,SAAA,OAAO,CAAC,CAAD,CAAP;AAAU,CAHzC,CADJ;;AAMA,SAAA,SAAA,CAA0B,GAA1B,EAA6B;AACzB,MAAI,CAAC,GAAD,IAAQ,QAAO,GAAP,MAAe,QAA3B,EAAqC,OAAO,GAAP;AACrC,MAAI,EAAJ;;AACA,MAAI,OAAO,CAAC,GAAD,CAAX,EAAkB;AACd,IAAA,EAAE,GAAG,EAAL;;AACA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,GAAG,CAAC,MAAxB,EAAgC,CAAC,GAAG,CAApC,EAAuC,EAAE,CAAzC,EAA4C;AACxC,MAAA,EAAE,CAAC,IAAH,CAAQ,SAAS,CAAC,GAAG,CAAC,CAAD,CAAJ,CAAjB;AACH;AACJ,GALD,MAKO,IAAI,cAAc,CAAC,OAAf,CAAuB,GAAG,CAAC,WAA3B,KAA2C,CAA/C,EAAkD;AACrD,IAAA,EAAE,GAAG,GAAL;AACH,GAFM,MAEA;AACH,IAAA,EAAE,GAAG,GAAG,CAAC,WAAJ,GAAkB,MAAM,CAAC,MAAP,CAAc,GAAG,CAAC,WAAJ,CAAgB,SAA9B,CAAlB,GAA6D,EAAlE;;AACA,SAAK,IAAI,IAAT,IAAiB,GAAjB,EAAsB;AAClB,UAAI,MAAM,CAAC,GAAD,EAAM,IAAN,CAAV,EAAuB;AACnB,QAAA,EAAE,CAAC,IAAD,CAAF,GAAW,SAAS,CAAC,GAAG,CAAC,IAAD,CAAJ,CAApB;AACH;AACJ;AACJ;;AACD,SAAO,EAAP;AACH;;AAED,SAAA,aAAA,CAA8B,CAA9B,EAAiC,CAAjC,EAAoC,EAApC,EAAwC,IAAxC,EAA4C;;AAExC,EAAA,EAAE,GAAG,EAAE,IAAI,EAAX;AACA,EAAA,IAAI,GAAG,IAAI,IAAI,EAAf;AACA,EAAA,IAAI,CAAC,CAAD,CAAJ,CAAQ,OAAR,CAAgB,UAAA,IAAA,EAAI;AAChB,QAAI,CAAC,MAAM,CAAC,CAAD,EAAI,IAAJ,CAAX,EACI,EAAE,CAAC,IAAI,GAAC,IAAN,CAAF,GAAgB,SAAhB,CADJ,CAC8B;AAD9B,SAEK;AACD,YAAI,EAAE,GAAG,CAAC,CAAC,IAAD,CAAV;AAAA,YACI,EAAE,GAAG,CAAC,CAAC,IAAD,CADV;AAEA,YAAI,QAAO,EAAP,MAAc,QAAd,IAA0B,QAAO,EAAP,MAAc,QAAxC,IACI,EADJ,IACU,EADV;AAGK,aAAG,EAAE,CAAC,WAAP,KAAyB,KAAG,EAAE,CAAC,WAHvC;AAKI,UAAA,aAAa,CAAE,EAAF,EAAM,EAAN,EAAU,EAAV,EAAc,IAAI,GAAG,IAAP,GAAc,GAA5B,CAAb,CALJ,KAMK,IAAI,EAAE,KAAK,EAAX,EACD,EAAE,CAAC,IAAI,GAAG,IAAR,CAAF,GAAkB,CAAC,CAAC,IAAD,CAAnB,CAVH,CAU6B;AACjC;AACJ,GAfD;AAgBA,EAAA,IAAI,CAAC,CAAD,CAAJ,CAAQ,OAAR,CAAgB,UAAA,IAAA,EAAI;AAChB,QAAI,CAAC,MAAM,CAAC,CAAD,EAAI,IAAJ,CAAX,EAAsB;AAClB,MAAA,EAAE,CAAC,IAAI,GAAC,IAAN,CAAF,GAAgB,CAAC,CAAC,IAAD,CAAjB,CADkB,CACM;AAC3B;AACJ,GAJD;AAKA,SAAO,EAAP;AACH;;;AAGD,IAAa,cAAc,GAAG,OAAO,MAAP,KAAkB,WAAlB,IAAiC,MAAM,CAAC,QAAtE;AACA,IAAa,aAAa,GAAG,cAAc,GAAG,UAAS,CAAT,EAAU;AACpD,MAAI,CAAJ;AACA,SAAO,CAAC,IAAI,IAAL,KAAc,CAAC,GAAG,CAAC,CAAC,cAAD,CAAnB,KAAwC,CAAC,CAAC,KAAF,CAAQ,CAAR,CAA/C;AACH,CAH0C,GAGvC,YAAA;AAAc,SAAO,IAAP;AAAc,CAHhC;AAKA,IAAa,aAAa,GAAG,EAA7B;;;;;;;;;AASA,SAAA,UAAA,CAA4B,SAA5B,EAAqC;AACjC,MAAI,CAAJ,EAAO,CAAP,EAAU,CAAV,EAAa,EAAb;;AACA,MAAI,SAAS,CAAC,MAAV,KAAqB,CAAzB,EAA4B;AACxB,QAAI,OAAO,CAAC,SAAD,CAAX,EAAwB,OAAO,SAAS,CAAC,KAAV,EAAP;AACxB,QAAI,SAAS,aAAT,IAA0B,OAAO,SAAP,KAAqB,QAAnD,EAA6D,OAAO,CAAC,SAAD,CAAP;;AAC7D,QAAK,EAAE,GAAG,aAAa,CAAC,SAAD,CAAvB,EAAqC;AACjC,MAAA,CAAC,GAAG,EAAJ;;AACA,aAAQ,CAAC,GAAG,EAAE,CAAC,IAAH,EAAL,EAAiB,CAAC,CAAC,CAAC,IAA3B;AAAiC,QAAA,CAAC,CAAC,IAAF,CAAO,CAAC,CAAC,KAAT;AAAjC;;AACA,aAAO,CAAP;AACH;;AACD,QAAI,SAAS,IAAI,IAAjB,EAAuB,OAAO,CAAC,SAAD,CAAP;AACvB,IAAA,CAAC,GAAG,SAAS,CAAC,MAAd;;AACA,QAAI,OAAO,CAAP,KAAa,QAAjB,EAA2B;AACvB,MAAA,CAAC,GAAG,IAAI,KAAJ,CAAU,CAAV,CAAJ;;AACA,aAAO,CAAC,EAAR;AAAY,QAAA,CAAC,CAAC,CAAD,CAAD,GAAO,SAAS,CAAC,CAAD,CAAhB;AAAZ;;AACA,aAAO,CAAP;AACH;;AACD,WAAO,CAAC,SAAD,CAAP;AACH;;AACD,EAAA,CAAC,GAAG,SAAS,CAAC,MAAd;AACA,EAAA,CAAC,GAAG,IAAI,KAAJ,CAAU,CAAV,CAAJ;;AACA,SAAO,CAAC,EAAR;AAAY,IAAA,CAAC,CAAC,CAAD,CAAD,GAAO,SAAS,CAAC,CAAD,CAAhB;AAAZ;;AACA,SAAO,CAAP;AACH,EC/QD;;;;AAEA,IAAW,KAAK,GAAG,OAAO,QAAP,KAAoB,WAApB;AAEX,6CAA6C,IAA7C,CAAkD,QAAQ,CAAC,IAA3D,CAFR;;AAIA,SAAA,QAAA,CAAyB,KAAzB,EAAgC,MAAhC,EAAsC;AAClC,EAAA,KAAK,GAAG,KAAR;AACA,EAAA,aAAa,GAAG,MAAhB;AACH;;AAED,IAAW,aAAa,GAAG,YAAA;AAAM,SAAA,IAAA;AAAI,CAArC;;AAEA,IAAa,qBAAqB,GAAG,CAAC,IAAI,KAAJ,CAAU,EAAV,EAAc,KAApD;;AAEA,SAAA,iBAAA,GAAA;AACI;;AACA,MAAI,qBAAJ,EAA2B,IAAI;;;;;;AAM3B,IAAA,iBAAiB,CAAC,SAAlB;AACA,UAAM,IAAI,KAAJ,EAAN,CAP2B,CAOT;AACrB,GAR0B,CAQzB,OAAM,CAAN,EAAS;AACP,WAAO,CAAP;AACH;AACD,SAAO,IAAI,KAAJ,EAAP;AACH;;AAED,SAAA,WAAA,CAA4B,SAA5B,EAAuC,gBAAvC,EAAuD;AACnD,MAAI,KAAK,GAAG,SAAS,CAAC,KAAtB;AACA,MAAI,CAAC,KAAL,EAAY,OAAO,EAAP;AACZ,EAAA,gBAAgB,GAAI,gBAAgB,IAAI,CAAxC;AACA,MAAI,KAAK,CAAC,OAAN,CAAc,SAAS,CAAC,IAAxB,MAAkC,CAAtC,EACI,gBAAgB,IAAI,CAAC,SAAS,CAAC,IAAV,GAAiB,SAAS,CAAC,OAA5B,EAAqC,KAArC,CAA2C,IAA3C,EAAiD,MAArE;AACJ,SAAO,KAAK,CAAC,KAAN,CAAY,IAAZ,EACF,KADE,CACI,gBADJ,EAEF,MAFE,CAEK,aAFL,EAGF,GAHE,CAGE,UAAA,KAAA,EAAK;AAAI,WAAA,OAAO,KAAP;AAAY,GAHvB,EAIF,IAJE,CAIG,EAJH,CAAP;AAKH;;AAED,SAAA,UAAA,CAA4B,IAA5B,EAAkC,EAAlC,EAAoC;AAChC,SAAO,YAAA;AACH,IAAA,OAAO,CAAC,IAAR,CAAgB,IAAI,GAAA,gFAAJ,GAAqF,WAAW,CAAC,iBAAiB,EAAlB,EAAsB,CAAtB,CAAhH;AACA,WAAO,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAP;AACH,GAHD;AAIH;;AC9CD,IAAI,eAAe,GAAG,CAClB,QADkB,EAElB,MAFkB,EAGlB,YAHkB,EAIlB,eAJkB,EAKlB,QALkB,EAMlB,SANkB,EAOlB,cAPkB,EAQlB,YARkB,EASlB,gBATkB,EAUlB,iBAVkB,EAWlB,gBAXkB,EAYlB,aAZkB,EAalB,UAbkB,EAclB,gBAdkB,EAelB,iBAfkB,EAgBlB,cAhBkB,CAAtB;AAmBA,IAAI,gBAAgB,GAAG,CACnB,SADmB,EAEnB,YAFmB,EAGnB,MAHmB,EAInB,qBAJmB,EAKnB,UALmB,EAMnB,SANmB,EAOnB,UAPmB,EAQnB,cARmB,EASnB,eATmB,EAUnB,OAVmB,EAWnB,SAXmB,EAYnB,eAZmB,EAanB,QAbmB,EAcnB,WAdmB,CAAvB;AAiBA,IAAI,SAAS,GAAG,eAAe,CAAC,MAAhB,CAAuB,gBAAvB,CAAhB;AAEA,IAAI,YAAY,GAAG;AACf,EAAA,cAAc,EAAE,uDADD;AAEf,EAAA,cAAc,EAAE,0BAFD;AAGf,EAAA,KAAK,EAAE,qBAHQ;AAIf,EAAA,mBAAmB,EAAE;AAJN,CAAnB;;;;AAUA,SAAA,UAAA,CAA4B,IAA5B,EAAkC,GAAlC,EAAqC;;;;;;AAMjC,OAAK,EAAL,GAAU,iBAAiB,EAA3B;AACA,OAAK,IAAL,GAAY,IAAZ;AACA,OAAK,OAAL,GAAe,GAAf;AACH;;AAED,MAAM,CAAC,UAAD,CAAN,CAAmB,IAAnB,CAAwB,KAAxB,EAA+B,MAA/B,CAAsC;AAClC,EAAA,KAAK,EAAE;AACH,IAAA,GAAG,EAAE,YAAA;AACD,aAAO,KAAK,MAAL,KACF,KAAK,MAAL,GAAc,KAAK,IAAL,GAAY,IAAZ,GAAmB,KAAK,OAAxB,GAAkC,WAAW,CAAC,KAAK,EAAN,EAAU,CAAV,CADzD,CAAP;AAEH;AAJE,GAD2B;AAOlC,EAAA,QAAQ,EAAE,YAAA;AAAY,WAAO,KAAK,IAAL,GAAY,IAAZ,GAAmB,KAAK,OAA/B;AAAyC;AAP7B,CAAtC;;AAUA,SAAA,oBAAA,CAA+B,GAA/B,EAAoC,QAApC,EAA4C;AACxC,SAAO,GAAG,GAAG,YAAN,GAAqB,QAAQ,CAC/B,GADuB,CACnB,UAAA,CAAA,EAAC;AAAE,WAAA,CAAC,CAAC,QAAF,EAAA;AAAY,GADI,EAEvB,MAFuB,CAEhB,UAAC,CAAD,EAAG,CAAH,EAAK,CAAL,EAAM;AAAG,WAAA,CAAC,CAAC,OAAF,CAAU,CAAV,MAAiB,CAAjB;AAAkB,GAFX,EAEY;AAFZ,GAGvB,IAHuB,CAGlB,IAHkB,CAA5B;AAIH;;;;;;AAMD,SAAA,WAAA,CAA6B,GAA7B,EAAkC,QAAlC,EAA4C,YAA5C,EAA0D,UAA1D,EAAoE;AAChE,OAAK,EAAL,GAAU,iBAAiB,EAA3B;AACA,OAAK,QAAL,GAAgB,QAAhB;AACA,OAAK,UAAL,GAAkB,UAAlB;AACA,OAAK,YAAL,GAAoB,YAApB;AACH;;AACD,MAAM,CAAC,WAAD,CAAN,CAAoB,IAApB,CAAyB,UAAzB;;AAEA,SAAA,SAAA,CAA2B,GAA3B,EAAgC,QAAhC,EAAwC;AACpC,OAAK,EAAL,GAAU,iBAAiB,EAA3B;AACA,OAAK,IAAL,GAAY,WAAZ;AACA,OAAK,QAAL,GAAgB,QAAhB;AACA,OAAK,OAAL,GAAe,oBAAoB,CAAC,GAAD,EAAM,QAAN,CAAnC;AACH;;AACD,MAAM,CAAC,SAAD,CAAN,CAAkB,IAAlB,CAAuB,UAAvB;;;;;;;;AAUA,IAAW,QAAQ,GAAG,SAAS,CAAC,MAAV,CAAiB,UAAC,GAAD,EAAK,IAAL,EAAS;AAAG,SAAC,GAAG,CAAC,IAAD,CAAH,GAAU,IAAI,GAAC,OAAf,EAAuB,GAAxB;AAA4B,CAAzD,EAA0D,EAA1D,CAAtB;;AAGA,IAAM,aAAa,GAAG,UAAtB;;AAEA,IAAW,UAAU,GAAG,SAAS,CAAC,MAAV,CAAiB,UAAC,GAAD,EAAK,IAAL,EAAS;;;;;;;AAO9C,MAAI,QAAQ,GAAG,IAAI,GAAG,OAAtB;;AACA,WAAA,UAAA,CAAqB,UAArB,EAAiC,KAAjC,EAAsC;AAClC,SAAK,EAAL,GAAU,iBAAiB,EAA3B;AACA,SAAK,IAAL,GAAY,QAAZ;;AACA,QAAI,CAAC,UAAL,EAAiB;AACb,WAAK,OAAL,GAAe,YAAY,CAAC,IAAD,CAAZ,IAAsB,QAArC;AACA,WAAK,KAAL,GAAa,IAAb;AACH,KAHD,MAGO,IAAI,OAAO,UAAP,KAAsB,QAA1B,EAAoC;AACvC,WAAK,OAAL,GAAe,UAAf;AACA,WAAK,KAAL,GAAa,KAAK,IAAI,IAAtB;AACH,KAHM,MAGA,IAAI,QAAO,UAAP,MAAsB,QAA1B,EAAoC;AACvC,WAAK,OAAL,GAAkB,UAAU,CAAC,IAAX,GAAe,GAAf,GAAmB,UAAU,CAAC,OAAhD;AACA,WAAK,KAAL,GAAa,UAAb;AACH;AACJ;;AACD,EAAA,MAAM,CAAC,UAAD,CAAN,CAAmB,IAAnB,CAAwB,aAAxB;AACA,EAAA,GAAG,CAAC,IAAD,CAAH,GAAU,UAAV;AACA,SAAO,GAAP;AACH,CAzBuB,EAyBtB,EAzBsB,CAAxB;;AA4BA,UAAU,CAAC,MAAX,GAAoB,WAApB;AACA,UAAU,CAAC,IAAX,GAAkB,SAAlB;AACA,UAAU,CAAC,KAAX,GAAmB,UAAnB;AAEA,IAAW,YAAY,GAAG,gBAAgB,CAAC,MAAjB,CAAwB,UAAC,GAAD,EAAM,IAAN,EAAU;AACxD,EAAA,GAAG,CAAC,IAAI,GAAG,OAAR,CAAH,GAAsB,UAAU,CAAC,IAAD,CAAhC;AACA,SAAO,GAAP;AACH,CAHyB,EAGvB,EAHuB,CAA1B;;AAKA,SAAA,QAAA,CAA0B,QAA1B,EAAoC,OAApC,EAA2C;AACvC,MAAI,CAAC,QAAD,IAAa,QAAQ,YAAY,UAAjC,IAA+C,QAAQ,YAAY,SAAnE,IAAgF,QAAQ,YAAY,WAApG,IAAmH,CAAC,QAAQ,CAAC,IAA7H,IAAqI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAV,CAAtJ,EACI,OAAO,QAAP;AACJ,MAAI,EAAE,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,IAAV,CAAhB,CAAgC,OAAO,IAAI,QAAQ,CAAC,OAApD,EAA6D,QAA7D,CAAT;;AACA,MAAI,WAAW,QAAf,EAAyB;;AAErB,IAAA,OAAO,CAAC,EAAD,EAAK,OAAL,EAAc;AAAC,MAAA,GAAG,EAAE,YAAA;AACvB,eAAO,KAAK,KAAL,CAAW,KAAlB;AACH;AAFoB,KAAd,CAAP;AAGH;;AACD,SAAO,EAAP;AACH;;AAED,IAAW,kBAAkB,GAAG,SAAS,CAAC,MAAV,CAAiB,UAAC,GAAD,EAAM,IAAN,EAAU;AACvD,MAAI,CAAC,QAAD,EAAU,MAAV,EAAiB,OAAjB,EAA0B,OAA1B,CAAkC,IAAlC,MAA4C,CAAC,CAAjD,EACI,GAAG,CAAC,IAAI,GAAG,OAAR,CAAH,GAAsB,UAAU,CAAC,IAAD,CAAhC;AACJ,SAAO,GAAP;AACH,CAJ+B,EAI7B,EAJ6B,CAAhC;AAMA,kBAAkB,CAAC,WAAnB,GAAiC,WAAjC;AACA,kBAAkB,CAAC,UAAnB,GAAgC,UAAhC;AACA,kBAAkB,CAAC,SAAnB,GAA+B,SAA/B;;gBCxKyB;;AACzB,SAAA,MAAA,CAAuB,GAAvB,EAA0B;AAAI,SAAO,GAAP;AAAa;;AAC3C,SAAA,iBAAA,CAAkC,EAAlC,EAAsC,EAAtC,EAAwC;;;AAGpC,MAAI,EAAE,IAAI,IAAN,IAAc,EAAE,KAAK,MAAzB,EAAiC,OAAO,EAAP;AACjC,SAAO,UAAU,GAAV,EAAa;AAChB,WAAO,EAAE,CAAC,EAAE,CAAC,GAAD,CAAH,CAAT;AACH,GAFD;AAGH;;AAED,SAAA,QAAA,CAAyB,GAAzB,EAA8B,GAA9B,EAAiC;AAC7B,SAAO,YAAA;AACH,IAAA,GAAG,CAAC,KAAJ,CAAU,IAAV,EAAgB,SAAhB;AACA,IAAA,GAAG,CAAC,KAAJ,CAAU,IAAV,EAAgB,SAAhB;AACH,GAHD;AAIH;;AAED,SAAA,iBAAA,CAAkC,EAAlC,EAAsC,EAAtC,EAAwC;;;AAGpC,MAAI,EAAE,KAAK,GAAX,EAAgB,OAAO,EAAP;AAChB,SAAO,YAAA;AACH,QAAI,GAAG,GAAG,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAV;AACA,QAAI,GAAG,KAAK,SAAZ,EAAuB,SAAS,CAAC,CAAD,CAAT,GAAe,GAAf;AACvB,QAAI,SAAS,GAAG,KAAK,SAArB;AAAA,QAA8B;AAC1B,IAAA,OAAO,GAAG,KAAK,OADnB,CAHG,CAIwB;;AAC3B,SAAK,SAAL,GAAiB,IAAjB;AACA,SAAK,OAAL,GAAe,IAAf;AACA,QAAI,IAAI,GAAG,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAX;AACA,QAAI,SAAJ,EAAe,KAAK,SAAL,GAAiB,KAAK,SAAL,GAAiB,QAAQ,CAAC,SAAD,EAAY,KAAK,SAAjB,CAAzB,GAAuD,SAAxE;AACf,QAAI,OAAJ,EAAa,KAAK,OAAL,GAAe,KAAK,OAAL,GAAe,QAAQ,CAAC,OAAD,EAAU,KAAK,OAAf,CAAvB,GAAiD,OAAhE;AACb,WAAO,IAAI,KAAK,SAAT,GAAqB,IAArB,GAA4B,GAAnC;AACH,GAXD;AAYH;;AAED,SAAA,iBAAA,CAAkC,EAAlC,EAAsC,EAAtC,EAAwC;AACpC,MAAI,EAAE,KAAK,GAAX,EAAgB,OAAO,EAAP;AAChB,SAAO,YAAA;AACH,IAAA,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf;AACA,QAAI,SAAS,GAAG,KAAK,SAArB;AAAA,QAA8B;AAC1B,IAAA,OAAO,GAAG,KAAK,OADnB,CAFG,CAGwB;;AAC3B,SAAK,SAAL,GAAiB,KAAK,OAAL,GAAe,IAAhC;AACA,IAAA,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf;AACA,QAAI,SAAJ,EAAe,KAAK,SAAL,GAAiB,KAAK,SAAL,GAAiB,QAAQ,CAAC,SAAD,EAAY,KAAK,SAAjB,CAAzB,GAAuD,SAAxE;AACf,QAAI,OAAJ,EAAa,KAAK,OAAL,GAAe,KAAK,OAAL,GAAe,QAAQ,CAAC,OAAD,EAAU,KAAK,OAAf,CAAvB,GAAiD,OAAhE;AAChB,GARD;AASH;;AAED,SAAA,iBAAA,CAAkC,EAAlC,EAAsC,EAAtC,EAAwC;AACpC,MAAI,EAAE,KAAK,GAAX,EAAgB,OAAO,EAAP;AAChB,SAAO,UAAU,aAAV,EAAuB;AAC1B,QAAI,GAAG,GAAG,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAV;AACA,IAAA,MAAM,CAAC,aAAD,EAAgB,GAAhB,CAAN,CAF0B,CAEC;;AAC3B,QAAI,SAAS,GAAG,KAAK,SAArB;AAAA,QAA8B;AAC1B,IAAA,OAAO,GAAG,KAAK,OADnB,CAH0B,CAIC;;AAC3B,SAAK,SAAL,GAAiB,IAAjB;AACA,SAAK,OAAL,GAAe,IAAf;AACA,QAAI,IAAI,GAAG,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAX;AACA,QAAI,SAAJ,EAAe,KAAK,SAAL,GAAiB,KAAK,SAAL,GAAiB,QAAQ,CAAC,SAAD,EAAY,KAAK,SAAjB,CAAzB,GAAuD,SAAxE;AACf,QAAI,OAAJ,EAAa,KAAK,OAAL,GAAe,KAAK,OAAL,GAAe,QAAQ,CAAC,OAAD,EAAU,KAAK,OAAf,CAAvB,GAAiD,OAAhE;AACb,WAAO,GAAG,KAAK,SAAR,GACF,IAAI,KAAK,SAAT,GAAqB,SAArB,GAAiC,IAD/B,GAEF,MAAM,CAAC,GAAD,EAAM,IAAN,CAFX;AAGH,GAbD;AAcH;;AAED,SAAA,0BAAA,CAA2C,EAA3C,EAA+C,EAA/C,EAAiD;AAC7C,MAAI,EAAE,KAAK,GAAX,EAAgB,OAAO,EAAP;AAChB,SAAO,YAAA;AACH,QAAI,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,MAA8B,KAAlC,EAAyC,OAAO,KAAP;AACzC,WAAO,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAP;AACH,GAHD;AAIH;;AAUD,SAAA,eAAA,CAAgC,EAAhC,EAAoC,EAApC,EAAsC;AAClC,MAAI,EAAE,KAAK,GAAX,EAAgB,OAAO,EAAP;AAChB,SAAO,YAAA;AACH,QAAI,GAAG,GAAG,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAV;;AACA,QAAI,GAAG,IAAI,OAAO,GAAG,CAAC,IAAX,KAAoB,UAA/B,EAA2C;AACvC,UAAI,IAAI,GAAG,IAAX;AAAA,UACI,CAAC,GAAG,SAAS,CAAC,MADlB;AAAA,UAEI,IAAI,GAAG,IAAI,KAAJ,CAAU,CAAV,CAFX;;AAGA,aAAO,CAAC,EAAR;AAAY,QAAA,IAAI,CAAC,CAAD,CAAJ,GAAU,SAAS,CAAC,CAAD,CAAnB;AAAZ;;AACA,aAAO,GAAG,CAAC,IAAJ,CAAS,YAAA;AACZ,eAAO,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,IAAf,CAAP;AACH,OAFM,CAAP;AAGH;;AACD,WAAO,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAP;AACH,GAZD;AAaH;ACpGD;;;;AAIA;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,IAAI,QAAQ,GAAG,EAAf;;AAGA,IACI,sBAAsB,GAAG,GAD7B;IAGI,eAAe,GAAG;IAClB,eAAe,GAAG;;IAClB,6BAA6B,GAAI,YAAA;AAC7B,MAAI;;AAEA,WAAO,IAAI,QAAJ,CAAa,+FAAb,GAAP;AACH,GAHD,CAGE,OAAM,CAAN,EAAS;AACP,QAAI,CAAC,GAAG,OAAO,CAAC,OAAhB;AACA,WAAO,CAAC,GACJ,CAAC,CAAC,CAAC,OAAF,EAAD,EAAc,CAAC,CAAC,SAAhB,EAA2B,CAAC,CAAC,OAAF,EAA3B,CADI,GAEJ,EAFJ;AAGH;AACJ,CAV+B;;IAWhC,qBAAqB,GAAG,6BAA6B,CAAC,CAAD;IACrD,kBAAkB,GAAG,6BAA6B,CAAC,CAAD;IAClD,qBAAqB,GAAG,6BAA6B,CAAC,CAAD;IACrD,iBAAiB,GAAG,kBAAkB,IAAI,kBAAkB,CAAC;AAEjE,IAAa,aAAa,GAAG,qBAAqB,IAAI,qBAAqB,CAAC,WAA5E;AACA,IAAa,aAAa,GAAG,6BAA6B,CAAC,CAAD,CAA1D;AACA,IAAM,kBAAkB,GAAG,CAAC,CAAC,qBAA7B;AAEA,IAAI,qBAAqB,GAAG,KAA5B;;;;;;;;;AASA,IAAI,oBAAoB,GAAG,qBAAqB,GAC5C,YAAA;AAAO,EAAA,qBAAqB,CAAC,IAAtB,CAA2B,YAA3B;AAA0C,CADL,GAG5C,OAAO,CAAC,YAAR;AAEI,YAAY,CAAC,IAAb,CAAkB,IAAlB,EAAwB,YAAxB,CAFJ,GAGI,OAAO,CAAC,gBAAR;AAEI,YAAA;AACI,MAAI,SAAS,GAAG,QAAQ,CAAC,aAAT,CAAuB,KAAvB,CAAhB;AACC,MAAI,gBAAJ,CAAqB,YAAA;AAClB,IAAA,YAAY;AACZ,IAAA,SAAS,GAAG,IAAZ;AACH,GAHA,CAAD,CAGI,OAHJ,CAGY,SAHZ,EAGuB;AAAE,IAAA,UAAU,EAAE;AAAd,GAHvB;AAIA,EAAA,SAAS,CAAC,YAAV,CAAuB,GAAvB,EAA4B,GAA5B;AACH,CATL;;;AAaI,YAAA;AAAK,EAAA,UAAU,CAAC,YAAD,EAAc,CAAd,CAAV;AAA4B,CAnB7C;;;;;;AA0BA,IAAIY,MAAI,GAAG,UAAU,QAAV,EAAoB,IAApB,EAAwB;AAC/B,EAAA,cAAc,CAAC,IAAf,CAAoB,CAAC,QAAD,EAAW,IAAX,CAApB;;AACA,MAAI,oBAAJ,EAA0B;AACtB,IAAA,oBAAoB;AACpB,IAAA,oBAAoB,GAAG,KAAvB;AACH;AACJ,CAND;;AAQA,IAAI,kBAAkB,GAAG,IAAzB;IACI,oBAAoB,GAAG;IACvB,eAAe,GAAG;IAClB,eAAe,GAAG;IAClB,gBAAgB,GAAG;IACnB,eAAe,GAAG,QAAO;;AAE7B,IAAW,SAAS,GAAG;AACnB,EAAA,EAAE,EAAE,QADe;AAEnB,EAAA,MAAM,EAAE,IAFW;AAGnB,EAAA,GAAG,EAAE,CAHc;AAInB,EAAA,UAAU,EAAE,EAJO;AAKnB,EAAA,WAAW,EAAE,WALM;AAMnB,EAAA,GAAG,EAAE,KANc;AAOnB,EAAA,GAAG,EAAE,EAPc;AAQnB,EAAA,QAAQ,EAAE,YAAA;AACN,SAAK,UAAL,CAAgB,OAAhB,CAAwB,UAAA,EAAA,EAAE;AACtB,UAAI;AACA,QAAA,WAAW,CAAC,EAAE,CAAC,CAAD,CAAH,EAAQ,EAAE,CAAC,CAAD,CAAV,CAAX;AACH,OAFD,CAEE,OAAO,CAAP,EAAU,CAAE;AACjB,KAJD;AAKH;AAdkB,CAAvB;AAiBA,IAAW,GAAG,GAAG,SAAjB;AAEA,IAAW,cAAc,GAAG,EAA5B,EAA+B;;AAC/B,IAAW,iBAAiB,GAAG,CAA/B,EAAiC;;AACjC,IAAW,cAAc,GAAG,EAA5B,EAA+B;;AAE/B,SAAA,OAAA,CAAgC,EAAhC,EAAkC;AAC9B,MAAI,QAAO,IAAP,MAAgB,QAApB,EAA8B,MAAM,IAAI,SAAJ,CAAc,sCAAd,CAAN;AAC9B,OAAK,UAAL,GAAkB,EAAlB;AACA,OAAK,WAAL,GAAmB,GAAnB,CAH8B,CAGP;;;;;;;;AAQvB,OAAK,IAAL,GAAY,KAAZ,CAX8B;;AAa9B,MAAI,GAAG,GAAI,KAAK,IAAL,GAAY,GAAvB;;AAEA,MAAI,KAAJ,EAAW;AACP,SAAK,YAAL,GAAoB,iBAAiB,EAArC;AACA,SAAK,KAAL,GAAa,IAAb;AACA,SAAK,QAAL,GAAgB,CAAhB,CAHO,CAGW;AACrB;;AAED,MAAI,OAAO,EAAP,KAAc,UAAlB,EAA8B;AAC1B,QAAI,EAAE,KAAK,QAAX,EAAqB,MAAM,IAAI,SAAJ,CAAc,gBAAd,CAAN,CADK;;;AAI1B,SAAK,MAAL,GAAc,SAAS,CAAC,CAAD,CAAvB;AACA,SAAK,MAAL,GAAc,SAAS,CAAC,CAAD,CAAvB;AACA,QAAI,KAAK,MAAL,KAAgB,KAApB,EACI,eAAe,CAAC,IAAD,EAAO,KAAK,MAAZ,CAAf,CAPsB,CAOa;;AACvC;AACH;;AAED,OAAK,MAAL,GAAc,IAAd,CAhC8B,CAgCX;;AACnB,OAAK,MAAL,GAAc,IAAd,CAjC8B,CAiCX;;AACnB,IAAE,GAAG,CAAC,GAAN,CAlC8B,CAkCpB;;AACV,EAAA,kBAAkB,CAAC,IAAD,EAAO,EAAP,CAAlB;AACH;;;AAGD,IAAM,QAAQ,GAAG;AACb,EAAA,GAAG,EAAE,YAAA;AACD,QAAI,GAAG,GAAG,GAAV;AAAA,QAAe,WAAW,GAAG,WAA7B;;AAEA,aAAA,IAAA,CAAe,WAAf,EAA4B,UAA5B,EAAsC;AAAtC,UAAA,KAAA,GAAA,IAAA;;AACI,UAAI,aAAa,GAAG,CAAC,GAAG,CAAC,MAAL,KAAgB,GAAG,KAAK,GAAR,IAAe,WAAW,KAAK,WAA/C,CAApB;AACA,UAAI,aAAJ,EAAmB,uBAAuB;AAC1C,UAAI,EAAE,GAAG,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AACjC,QAAA,mBAAmB,CAAC,KAAD,EAAO,IAAI,QAAJ,CACtB,yBAAyB,CAAC,WAAD,EAAc,GAAd,EAAmB,aAAnB,CADH,EAEtB,yBAAyB,CAAC,UAAD,EAAa,GAAb,EAAkB,aAAlB,CAFH,EAGtB,OAHsB,EAItB,MAJsB,EAKtB,GALsB,CAAP,CAAnB;AAMH,OAPQ,CAAT;AAQA,MAAA,KAAK,IAAI,qBAAqB,CAAC,EAAD,EAAK,IAAL,CAA9B;AACA,aAAO,EAAP;AACH;;AAED,IAAA,IAAI,CAAC,SAAL,GAAiB,QAAjB,CAlBC,CAkByB;;AAE1B,WAAO,IAAP;AACH,GAtBY;;;AAyBb,EAAA,GAAG,EAAE,UAAU,KAAV,EAAe;AAChB,IAAA,OAAO,CAAE,IAAF,EAAQ,MAAR,EAAgB,KAAK,IAAI,KAAK,CAAC,SAAN,KAAoB,QAA7B,GACnB,QADmB,GACX;AACR;AACI,MAAA,GAAG,EAAE,YAAA;AACD,eAAO,KAAP,CADC,CACY;AAChB,OAHL;AAII,MAAA,GAAG,EAAE,QAAQ,CAAC,GAJlB,CAIqB;;AAJrB,KAFG,CAAP;AASH;AAnCY,CAAjB;AAsCA,KAAK,CAAC,OAAO,CAAC,SAAT,EAAoB;AACrB,EAAA,IAAI,EAAE,QADe;AAErB,EAAA,KAAK,EAAE,UAAU,WAAV,EAAuB,UAAvB,EAAiC;;AAEpC,IAAA,mBAAmB,CAAC,IAAD,EAAO,IAAI,QAAJ,CAAa,IAAb,EAAmB,IAAnB,EAAyB,WAAzB,EAAsC,UAAtC,EAAkD,GAAlD,CAAP,CAAnB;AACH,GALoB;AAOrB,EAAA,KAAK,EAAE,UAAU,UAAV,EAAoB;AACvB,QAAI,SAAS,CAAC,MAAV,KAAqB,CAAzB,EAA4B,OAAO,KAAK,IAAL,CAAU,IAAV,EAAgB,UAAhB,CAAP,CADL;;AAGvB,QAAI,IAAI,GAAG,SAAS,CAAC,CAAD,CAApB;AAAA,QACI,OAAO,GAAG,SAAS,CAAC,CAAD,CADvB;AAEA,WAAO,OAAO,IAAP,KAAgB,UAAhB,GAA6B,KAAK,IAAL,CAAU,IAAV,EAAgB,UAAA,GAAA,EAAG;;;AAGnD,aAAA,GAAG,YAAY,IAAf,GAAsB,OAAO,CAAC,GAAD,CAA7B,GAAqC,aAAa,CAAC,GAAD,CAAlD;AAAuD,KAHvB,CAA7B,GAIL,KAAK,IAAL,CAAU,IAAV,EAAgB,UAAA,GAAA,EAAG;;;;AAIjB,aAAA,GAAG,IAAI,GAAG,CAAC,IAAJ,KAAa,IAApB,GAA2B,OAAO,CAAC,GAAD,CAAlC,GAA0C,aAAa,CAAC,GAAD,CAAvD;AAA4D,KAJ9D,CAJF;AASH,GArBoB;AAuBrB,EAAA,OAAO,EAAE,UAAU,SAAV,EAAmB;AACxB,WAAO,KAAK,IAAL,CAAU,UAAA,KAAA,EAAK;AAClB,MAAA,SAAS;AACT,aAAO,KAAP;AACH,KAHM,EAGJ,UAAA,GAAA,EAAG;AACF,MAAA,SAAS;AACT,aAAO,aAAa,CAAC,GAAD,CAApB;AACH,KANM,CAAP;AAOH,GA/BoB;AAiCrB,EAAA,KAAK,EAAE;AACH,IAAA,GAAG,EAAE,YAAA;AACD,UAAI,KAAK,MAAT,EAAiB,OAAO,KAAK,MAAZ;;AACjB,UAAI;AACA,QAAA,qBAAqB,GAAG,IAAxB;AACA,YAAI,MAAM,GAAG,QAAQ,CAAE,IAAF,EAAQ,EAAR,EAAY,eAAZ,CAArB;AACA,YAAI,KAAK,GAAG,MAAM,CAAC,IAAP,CAAY,mBAAZ,CAAZ;AACA,YAAI,KAAK,MAAL,KAAgB,IAApB,EAA0B,KAAK,MAAL,GAAc,KAAd,CAJ1B,CAI8C;;AAC9C,eAAO,KAAP;AACH,OAND,SAMU;AACN,QAAA,qBAAqB,GAAG,KAAxB;AACH;AACJ;AAZE,GAjCc;AAgDrB,EAAA,OAAO,EAAE,UAAU,EAAV,EAAc,GAAd,EAAiB;AAAjB,QAAA,KAAA,GAAA,IAAA;;AACL,WAAO,EAAE,GAAG,QAAL,GACH,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AACxB,UAAI,MAAM,GAAG,UAAU,CAAC,YAAA;AAAM,eAAA,MAAM,CAAC,IAAI,UAAU,CAAC,OAAf,CAAuB,GAAvB,CAAD,CAAN;AAAmC,OAA1C,EAA4C,EAA5C,CAAvB;;AACA,MAAA,KAAI,CAAC,IAAL,CAAU,OAAV,EAAmB,MAAnB,EAA2B,OAA3B,CAAmC,YAAY,CAAC,IAAb,CAAkB,IAAlB,EAAwB,MAAxB,CAAnC;AACH,KAHD,CADG,GAIE,IAJT;AAKH;AAtDoB,CAApB,CAAL;AAyDA,IAAI,OAAO,MAAP,KAAkB,WAAlB,IAAiC,MAAM,CAAC,WAA5C,EACI,OAAO,CAAC,OAAO,CAAC,SAAT,EAAoB,MAAM,CAAC,WAA3B,EAAwC,SAAxC,CAAP;;;AAIJ,SAAS,CAAC,GAAV,GAAgB,QAAQ,EAAxB;;AAEA,SAAA,QAAA,CAAkB,WAAlB,EAA+B,UAA/B,EAA2C,OAA3C,EAAoD,MAApD,EAA4D,IAA5D,EAAgE;AAC5D,OAAK,WAAL,GAAmB,OAAO,WAAP,KAAuB,UAAvB,GAAoC,WAApC,GAAkD,IAArE;AACA,OAAK,UAAL,GAAkB,OAAO,UAAP,KAAsB,UAAtB,GAAmC,UAAnC,GAAgD,IAAlE;AACA,OAAK,OAAL,GAAe,OAAf;AACA,OAAK,MAAL,GAAc,MAAd;AACA,OAAK,GAAL,GAAW,IAAX;AACH;;;AAGD,KAAK,CAAE,OAAF,EAAW;AACZ,EAAA,GAAG,EAAE,YAAA;AACD,QAAI,MAAM,GAAG,UAAU,CAAC,KAAX,CAAiB,IAAjB,EAAuB,SAAvB,EAAiC;AAAjC,KACR,GADQ,CACJ,wBADI,CAAb,CADC,CAEkC;;AACnC,WAAO,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB,MAAnB,EAAyB;AACxC,UAAI,MAAM,CAAC,MAAP,KAAkB,CAAtB,EAAyB,OAAO,CAAC,EAAD,CAAP;AACzB,UAAI,SAAS,GAAG,MAAM,CAAC,MAAvB;AACA,MAAA,MAAM,CAAC,OAAP,CAAe,UAAC,CAAD,EAAG,CAAH,EAAI;AAAK,eAAA,OAAO,CAAC,OAAR,CAAgB,CAAhB,EAAmB,IAAnB,CAAwB,UAAA,CAAA,EAAC;AAC7C,UAAA,MAAM,CAAC,CAAD,CAAN,GAAY,CAAZ;AACA,cAAI,CAAC,GAAE,SAAP,EAAkB,OAAO,CAAC,MAAD,CAAP;AACrB,SAHuB,EAGrB,MAHqB,CAAA;AAGd,OAHV;AAIH,KAPM,CAAP;AAQH,GAZW;AAcZ,EAAA,OAAO,EAAE,UAAA,KAAA,EAAK;AACV,QAAI,KAAK,YAAY,OAArB,EAA8B,OAAO,KAAP;AAC9B,QAAI,KAAK,IAAI,OAAO,KAAK,CAAC,IAAb,KAAsB,UAAnC,EAA+C,OAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC9E,MAAA,KAAK,CAAC,IAAN,CAAW,OAAX,EAAoB,MAApB;AACH,KAFqD,CAAP;AAG/C,QAAI,EAAE,GAAG,IAAI,OAAJ,CAAY,QAAZ,EAAsB,IAAtB,EAA4B,KAA5B,CAAT;AACA,IAAA,qBAAqB,CAAC,EAAD,EAAK,gBAAL,CAArB;AACA,WAAO,EAAP;AACH,GAtBW;AAwBZ,EAAA,MAAM,EAAE,aAxBI;AA0BZ,EAAA,IAAI,EAAE,YAAA;AACF,QAAI,MAAM,GAAG,UAAU,CAAC,KAAX,CAAiB,IAAjB,EAAuB,SAAvB,EAAkC,GAAlC,CAAsC,wBAAtC,CAAb;AACA,WAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC/B,MAAA,MAAM,CAAC,GAAP,CAAW,UAAA,KAAA,EAAK;AAAI,eAAA,OAAO,CAAC,OAAR,CAAgB,KAAhB,EAAuB,IAAvB,CAA4B,OAA5B,EAAqC,MAArC,CAAA;AAA4C,OAAhE;AACH,KAFM,CAAP;AAGH,GA/BW;AAiCZ,EAAA,GAAG,EAAE;AACD,IAAA,GAAG,EAAE,YAAA;AAAI,aAAA,GAAA;AAAG,KADX;AAED,IAAA,GAAG,EAAE,UAAA,KAAA,EAAK;AAAI,aAAA,GAAG,GAAG,KAAN;AAAW;AAFxB,GAjCO;;;AA0CZ,EAAA,MAAM,EAAE,QA1CI;AA4CZ,EAAA,MAAM,EAAE,MA5CI;AA8CZ,EAAA,SAAS,EAAE;AACP,IAAA,GAAG,EAAE,YAAA;AAAM,aAAAA,MAAA;AAAI,KADR;AAEP,IAAA,GAAG,EAAE,UAAA,KAAA,EAAK;AAAKA,MAAAA,MAAI,GAAG,KAAPA;AAAa;AAFrB,GA9CC;AAmDZ,EAAA,eAAe,EAAE;AACb,IAAA,GAAG,EAAE,YAAA;AAAM,aAAA,eAAA;AAAe,KADb;AAEb,IAAA,GAAG,EAAE,UAAA,KAAA,EAAK;AAAK,MAAA,eAAe,GAAG,KAAlB;AAAyB,KAF3B,CAE2B;;AAF3B,GAnDL;AAwDZ,EAAA,MAAM,EAAE,UAAC,EAAD,EAAK,SAAL,EAAc;AAClB,WAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC/B,aAAO,QAAQ,CAAC,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC5B,YAAI,GAAG,GAAG,GAAV;AACA,QAAA,GAAG,CAAC,UAAJ,GAAiB,EAAjB,CAF4B,CAER;;AACpB,QAAA,GAAG,CAAC,WAAJ,GAAkB,MAAlB,CAH4B,CAGH;;AACzB,QAAA,GAAG,CAAC,QAAJ,GAAe,QAAQ,CAAC,YAAA;AAAA,cAAA,KAAA,GAAA,IAAA,CAAA;;;;;AAIpB,UAAA,wCAAwC,CAAC,YAAA;AACrC,YAAA,KAAI,CAAC,UAAL,CAAgB,MAAhB,KAA2B,CAA3B,GAA+B,OAAO,EAAtC,GAA2C,MAAM,CAAC,KAAI,CAAC,UAAL,CAAgB,CAAhB,CAAD,CAAjD;AACH,WAFuC,CAAxC;AAGH,SAPsB,EAOpB,GAAG,CAAC,QAPgB,CAAvB;AAQA,QAAA,EAAE;AACL,OAbc,EAaZ,SAbY,EAaD,OAbC,EAaQ,MAbR,CAAf;AAcH,KAfM,CAAP;AAgBH;AAzEW,CAAX,CAAL;;;;;;;;AAkFA,SAAA,kBAAA,CAA6B,OAA7B,EAAsC,EAAtC,EAAwC;;;AAGpC,MAAI;AACA,IAAA,EAAE,CAAC,UAAA,KAAA,EAAK;AACJ,UAAI,OAAO,CAAC,MAAR,KAAmB,IAAvB,EAA6B,OADzB,CACgC;;AACpC,UAAI,KAAK,KAAK,OAAd,EAAuB,MAAM,IAAI,SAAJ,CAAc,2CAAd,CAAN;AACvB,UAAI,iBAAiB,GAAG,OAAO,CAAC,IAAR,IAAgB,mBAAmB,EAA3D;;AACA,UAAI,KAAK,IAAI,OAAO,KAAK,CAAC,IAAb,KAAsB,UAAnC,EAA+C;AAC3C,QAAA,kBAAkB,CAAC,OAAD,EAAU,UAAC,OAAD,EAAU,MAAV,EAAgB;AACxC,UAAA,KAAK,YAAY,OAAjB,GACI,KAAK,CAAC,KAAN,CAAY,OAAZ,EAAqB,MAArB,CADJ,GAEI,KAAK,CAAC,IAAN,CAAW,OAAX,EAAoB,MAApB,CAFJ;AAGH,SAJiB,CAAlB;AAKH,OAND,MAMO;AACH,QAAA,OAAO,CAAC,MAAR,GAAiB,IAAjB;AACA,QAAA,OAAO,CAAC,MAAR,GAAiB,KAAjB;AACA,QAAA,qBAAqB,CAAC,OAAD,CAArB;AACH;;AACD,UAAI,iBAAJ,EAAuB,iBAAiB;AAC3C,KAhBC,EAgBC,eAAe,CAAC,IAAhB,CAAqB,IAArB,EAA2B,OAA3B,CAhBD,CAAF,CADA,CAiBwC;AAC3C,GAlBD,CAkBE,OAAO,EAAP,EAAW;AACT,IAAA,eAAe,CAAC,OAAD,EAAU,EAAV,CAAf;AACH;AACJ;;AAED,SAAA,eAAA,CAA0B,OAA1B,EAAmC,MAAnC,EAAyC;AACrC,EAAA,eAAe,CAAC,IAAhB,CAAqB,MAArB;AACA,MAAI,OAAO,CAAC,MAAR,KAAmB,IAAvB,EAA6B;AAC7B,MAAI,iBAAiB,GAAG,OAAO,CAAC,IAAR,IAAgB,mBAAmB,EAA3D;AACA,EAAA,MAAM,GAAG,eAAe,CAAC,MAAD,CAAxB;AACA,EAAA,OAAO,CAAC,MAAR,GAAiB,KAAjB;AACA,EAAA,OAAO,CAAC,MAAR,GAAiB,MAAjB;AACA,EAAA,KAAK,IAAI,MAAM,KAAK,IAApB,IAA4B,QAAO,MAAP,MAAkB,QAA9C,IAA0D,CAAC,MAAM,CAAC,QAAlE,IAA8E,QAAQ,CAAC,YAAA;AACnF,QAAI,QAAQ,GAAG,qBAAqB,CAAC,MAAD,EAAS,OAAT,CAApC;AACA,IAAA,MAAM,CAAC,QAAP,GAAkB,OAAlB;AACA,IAAA,OAAO,CAAC,MAAD,EAAS,OAAT,EAAkB;AACrB,MAAA,GAAG,EAAE,YAAA;AACD,eAAA,qBAAqB,GACjB,QAAQ,KAAK,QAAQ,CAAC,GAAT,GACD,QAAQ,CAAC,GAAT,CAAa,KAAb,CAAmB,MAAnB,CADC,GAED,QAAQ,CAAC,KAFb,CADS,GAIjB,OAAO,CAAC,KAJZ;AAIiB;AANA,KAAlB,CAAP;AAQH,GAXqF,CAAtF,CAPqC;;AAoBrC,EAAA,yBAAyB,CAAC,OAAD,CAAzB;AACA,EAAA,qBAAqB,CAAC,OAAD,CAArB;AACA,MAAI,iBAAJ,EAAuB,iBAAiB;AAC3C;;AAED,SAAA,qBAAA,CAAgC,OAAhC,EAAuC;;AAEnC,MAAI,SAAS,GAAG,OAAO,CAAC,UAAxB;AACA,EAAA,OAAO,CAAC,UAAR,GAAqB,EAArB;;AACA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,SAAS,CAAC,MAAhC,EAAwC,CAAC,GAAG,GAA5C,EAAiD,EAAE,CAAnD,EAAsD;AAClD,IAAA,mBAAmB,CAAC,OAAD,EAAU,SAAS,CAAC,CAAD,CAAnB,CAAnB;AACH;;AACD,MAAI,GAAG,GAAG,OAAO,CAAC,IAAlB;AACA,IAAE,GAAG,CAAC,GAAN,IAAa,GAAG,CAAC,QAAJ,EAAb,CARmC,CAQP;;AAC5B,MAAI,iBAAiB,KAAK,CAA1B,EAA6B;;;;;;AAMzB,MAAE,iBAAF;AACAA,IAAAA,MAAI,CAAC,YAAA;AACD,UAAI,EAAE,iBAAF,KAAwB,CAA5B,EAA+B,oBAAoB,GADlD,CACqD;AACzD,KAFG,EAED,EAFC,CAAJA;AAGH;AACJ;;AAED,SAAA,mBAAA,CAA6B,OAA7B,EAAsC,QAAtC,EAA8C;AAC1C,MAAI,OAAO,CAAC,MAAR,KAAmB,IAAvB,EAA6B;AACzB,IAAA,OAAO,CAAC,UAAR,CAAmB,IAAnB,CAAwB,QAAxB;;AACA;AACH;;AAED,MAAI,EAAE,GAAG,OAAO,CAAC,MAAR,GAAiB,QAAQ,CAAC,WAA1B,GAAwC,QAAQ,CAAC,UAA1D;;AACA,MAAI,EAAE,KAAK,IAAX,EAAiB;;AAEb,WAAO,CAAC,OAAO,CAAC,MAAR,GAAiB,QAAQ,CAAC,OAA1B,GAAoC,QAAQ,CAAC,MAA9C,EAAuD,OAAO,CAAC,MAA/D,CAAP;AACH;;AACD,IAAE,QAAQ,CAAC,GAAT,CAAa,GAAf;AACA,IAAE,iBAAF;AACAA,EAAAA,MAAI,CAAE,YAAF,EAAgB,CAAC,EAAD,EAAK,OAAL,EAAc,QAAd,CAAhB,CAAJA;AACH;;AAED,SAAA,YAAA,CAAuB,EAAvB,EAA2B,OAA3B,EAAoC,QAApC,EAA4C;AACxC,MAAI;;;AAGA,IAAA,gBAAgB,GAAG,OAAnB,CAHA;;AAMA,QAAI,GAAJ;AAAA,QAAS,KAAK,GAAG,OAAO,CAAC,MAAzB;;AAEA,QAAI,OAAO,CAAC,MAAZ,EAAoB;;AAEhB,MAAA,GAAG,GAAG,EAAE,CAAE,KAAF,CAAR;AACH,KAHD,MAGO;;AAEH,UAAI,eAAe,CAAC,MAApB,EAA4B,eAAe,GAAG,EAAlB;AAC5B,MAAA,GAAG,GAAG,EAAE,CAAC,KAAD,CAAR;AACA,UAAI,eAAe,CAAC,OAAhB,CAAwB,KAAxB,MAAmC,CAAC,CAAxC,EACI,kBAAkB,CAAC,OAAD,CAAlB,CALD,CAK6B;AACnC;;AACD,IAAA,QAAQ,CAAC,OAAT,CAAiB,GAAjB;AACH,GAnBD,CAmBE,OAAO,CAAP,EAAU;;AAER,IAAA,QAAQ,CAAC,MAAT,CAAgB,CAAhB;AACH,GAtBD,SAsBU;;AAEN,IAAA,gBAAgB,GAAG,IAAnB;AACA,QAAI,EAAE,iBAAF,KAAwB,CAA5B,EAA+B,oBAAoB;AACnD,MAAE,QAAQ,CAAC,GAAT,CAAa,GAAf,IAAsB,QAAQ,CAAC,GAAT,CAAa,QAAb,EAAtB;AACH;AACJ;;AAED,SAAA,QAAA,CAAmB,OAAnB,EAA4B,MAA5B,EAAoC,KAApC,EAAyC;AACrC,MAAI,MAAM,CAAC,MAAP,KAAkB,KAAtB,EAA6B,OAAO,MAAP;AAC7B,MAAI,KAAK,GAAG,EAAZ;;AACA,MAAI,OAAO,CAAC,MAAR,KAAmB,KAAvB,EAA8B;AAC1B,QAAI,OAAO,GAAG,OAAO,CAAC,MAAtB;AAAA,QACI,SADJ;AAAA,QAEI,OAFJ;;AAIA,QAAI,OAAO,IAAI,IAAf,EAAqB;AACjB,MAAA,SAAS,GAAG,OAAO,CAAC,IAAR,IAAgB,OAA5B;AACA,MAAA,OAAO,GAAG,OAAO,CAAC,OAAR,IAAmB,OAA7B;AACA,MAAA,KAAK,GAAG,WAAW,CAAC,OAAD,EAAU,CAAV,CAAnB;AACH,KAJD,MAIO;AACH,MAAA,SAAS,GAAG,OAAZ,CADG,CACiB;;AACpB,MAAA,OAAO,GAAG,EAAV;AACH;;AACD,IAAA,MAAM,CAAC,IAAP,CAAY,SAAS,IAAI,OAAO,GAAG,OAAO,OAAV,GAAoB,EAA/B,CAAT,GAA8C,KAA1D;AACH;;AACD,MAAI,KAAJ,EAAW;AACP,IAAA,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,YAAT,EAAuB,CAAvB,CAAnB;AACA,QAAI,KAAK,IAAI,MAAM,CAAC,OAAP,CAAe,KAAf,MAA0B,CAAC,CAAxC,EAA2C,MAAM,CAAC,IAAP,CAAY,KAAZ;AAC3C,QAAI,OAAO,CAAC,KAAZ,EAAmB,QAAQ,CAAC,OAAO,CAAC,KAAT,EAAgB,MAAhB,EAAwB,KAAxB,CAAR;AACtB;;AACD,SAAO,MAAP;AACH;;AAED,SAAA,qBAAA,CAA+B,OAA/B,EAAwC,IAAxC,EAA4C;;AAExC,MAAI,OAAO,GAAG,IAAI,GAAG,IAAI,CAAC,QAAL,GAAgB,CAAnB,GAAuB,CAAzC;;AACA,MAAI,OAAO,GAAG,sBAAd,EAAsC;AAClC,IAAA,OAAO,CAAC,KAAR,GAAgB,IAAhB;AACA,IAAA,OAAO,CAAC,QAAR,GAAmB,OAAnB;AACH;AACJ;;;;;;AAKD,SAAA,YAAA,GAAA;AACI,EAAA,mBAAmB,MAAM,iBAAiB,EAA1C;AACH;;AAED,SAAA,mBAAA,GAAA;AACI,MAAI,WAAW,GAAG,kBAAlB;AACA,EAAA,kBAAkB,GAAG,KAArB;AACA,EAAA,oBAAoB,GAAG,KAAvB;AACA,SAAO,WAAP;AACH;;;;;;;;;;;AAUD,SAAA,iBAAA,GAAA;AACI,MAAI,SAAJ,EAAe,CAAf,EAAkB,CAAlB;;AACA,KAAG;AACC,WAAO,cAAc,CAAC,MAAf,GAAwB,CAA/B,EAAkC;AAC9B,MAAA,SAAS,GAAG,cAAZ;AACA,MAAA,cAAc,GAAG,EAAjB;AACA,MAAA,CAAC,GAAG,SAAS,CAAC,MAAd;;AACA,WAAK,CAAC,GAAG,CAAT,EAAY,CAAC,GAAG,CAAhB,EAAmB,EAAE,CAArB,EAAwB;AACpB,YAAI,IAAI,GAAG,SAAS,CAAC,CAAD,CAApB;AACA,QAAA,IAAI,CAAC,CAAD,CAAJ,CAAQ,KAAR,CAAc,IAAd,EAAoB,IAAI,CAAC,CAAD,CAAxB;AACH;AACJ;AACJ,GAVD,QAUS,cAAc,CAAC,MAAf,GAAwB,CAVjC;;AAWA,EAAA,kBAAkB,GAAG,IAArB;AACA,EAAA,oBAAoB,GAAG,IAAvB;AACH;;AAED,SAAA,oBAAA,GAAA;AACI,MAAI,aAAa,GAAG,eAApB;AACA,EAAA,eAAe,GAAG,EAAlB;AACA,EAAA,aAAa,CAAC,OAAd,CAAsB,UAAA,CAAA,EAAC;AACnB,IAAA,CAAC,CAAC,IAAF,CAAO,WAAP,CAAmB,IAAnB,CAAwB,IAAxB,EAA8B,CAAC,CAAC,MAAhC,EAAwC,CAAxC;AACH,GAFD;AAGA,MAAI,UAAU,GAAG,cAAc,CAAC,KAAf,CAAqB,CAArB,CAAjB,CANJ,CAM6C;;AACzC,MAAI,CAAC,GAAG,UAAU,CAAC,MAAnB;;AACA,SAAO,CAAP;AAAU,IAAA,UAAU,CAAC,EAAE,CAAH,CAAV;AAAV;AACH;;AAED,SAAA,wCAAA,CAAmD,EAAnD,EAAqD;AACjD,WAAA,SAAA,GAAA;AACI,IAAA,EAAE;AACF,IAAA,cAAc,CAAC,MAAf,CAAsB,cAAc,CAAC,OAAf,CAAuB,SAAvB,CAAtB,EAAyD,CAAzD;AACH;;AACD,EAAA,cAAc,CAAC,IAAf,CAAoB,SAApB;AACA,IAAE,iBAAF;AACAA,EAAAA,MAAI,CAAC,YAAA;AACD,QAAI,EAAE,iBAAF,KAAwB,CAA5B,EAA+B,oBAAoB;AACtD,GAFG,EAED,EAFC,CAAJA;AAGH;;AAED,SAAA,yBAAA,CAAmC,OAAnC,EAA0C;;;;AAItC,MAAI,CAAC,eAAe,CAAC,IAAhB,CAAqB,UAAA,CAAA,EAAC;AAAI,WAAA,CAAC,CAAC,MAAF,KAAa,OAAO,CAAC,MAArB;AAA2B,GAArD,CAAL,EACI,eAAe,CAAC,IAAhB,CAAqB,OAArB;AACP;;AAED,SAAA,kBAAA,CAA4B,OAA5B,EAAmC;;;;AAI/B,MAAI,CAAC,GAAG,eAAe,CAAC,MAAxB;;AACA,SAAO,CAAP;AAAU,QAAI,eAAe,CAAC,EAAE,CAAH,CAAf,CAAqB,MAArB,KAAgC,OAAO,CAAC,MAA5C,EAAoD;;;AAG1D,MAAA,eAAe,CAAC,MAAhB,CAAuB,CAAvB,EAA0B,CAA1B;AACA;AACH;AALD;AAMH;;AAED,SAAA,aAAA,CAAwB,MAAxB,EAA8B;AAC1B,SAAO,IAAI,OAAJ,CAAY,QAAZ,EAAsB,KAAtB,EAA6B,MAA7B,CAAP;AACH;;AAED,SAAA,IAAA,CAAsB,EAAtB,EAA0B,YAA1B,EAAsC;AAClC,MAAI,GAAG,GAAG,GAAV;AACA,SAAO,YAAA;AACH,QAAI,WAAW,GAAG,mBAAmB,EAArC;AAAA,QACI,UAAU,GAAG,GADjB;;AAGA,QAAI;AACA,MAAA,YAAY,CAAC,GAAD,EAAM,IAAN,CAAZ;AACA,aAAO,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAP;AACH,KAHD,CAGE,OAAO,CAAP,EAAU;AACR,MAAA,YAAY,IAAI,YAAY,CAAC,CAAD,CAA5B;AACH,KALD,SAKU;AACN,MAAA,YAAY,CAAC,UAAD,EAAa,KAAb,CAAZ;AACA,UAAI,WAAJ,EAAiB,iBAAiB;AACrC;AACJ,GAbD;AAcH;;;;;AAMD,IAAM,IAAI,GAAG;AAAE,EAAA,MAAM,EAAE,CAAV;AAAa,EAAA,MAAM,EAAE,CAArB;AAAwB,EAAA,EAAE,EAAE;AAA5B,CAAb,EAA4C;;AAC5C,IAAI,WAAW,GAAG,CAAlB,EAAoB;;AACpB,IAAI,SAAS,GAAG,EAAhB,EAAmB;;AACnB,IAAI,UAAU,GAAG,CAAjB,EAAmB;;AACnB,IAAI,WAAW,GAAG,CAAlB,EAAoB;;AAGpB,IAAI,eAAe,GAAG,CAAtB;;AACA,SAAA,QAAA,CAA0B,EAA1B,EAA8BC,QAA9B,EAAqC,EAArC,EAAyC,EAAzC,EAA2C;AACvC,MAAI,MAAM,GAAG,GAAb;AAAA,MACI,GAAG,GAAG,MAAM,CAAC,MAAP,CAAc,MAAd,CADV;AAEA,EAAA,GAAG,CAAC,MAAJ,GAAa,MAAb;AACA,EAAA,GAAG,CAAC,GAAJ,GAAU,CAAV;AACA,EAAA,GAAG,CAAC,MAAJ,GAAa,KAAb;AACA,EAAA,GAAG,CAAC,EAAJ,GAAS,EAAE,eAAX,CANuC;;AAQvC,MAAI,SAAS,GAAG,SAAS,CAAC,GAA1B;AACA,EAAA,GAAG,CAAC,GAAJ,GAAU,kBAAkB,GAAG;AAC3B,IAAA,OAAO,EAAE,OADkB;AAE3B,IAAA,WAAW,EAAE;AAAC,MAAA,KAAK,EAAE,OAAR;AAAiB,MAAA,YAAY,EAAE,IAA/B;AAAqC,MAAA,QAAQ,EAAE;AAA/C,KAFc;AAG3B,IAAA,GAAG,EAAE,OAAO,CAAC,GAHc;AAI3B,IAAA,IAAI,EAAE,OAAO,CAAC,IAJa;AAK3B,IAAA,OAAO,EAAE,OAAO,CAAC,OALU;AAM3B,IAAA,MAAM,EAAE,OAAO,CAAC,MANW;AAO3B,IAAA,KAAK,EAAE,qBAAqB,CAAE,SAAS,CAAC,KAAZ,EAAmB,GAAnB,CAPD;AAQ3B,IAAA,KAAK,EAAE,qBAAqB,CAAE,SAAS,CAAC,KAAZ,EAAmB,GAAnB,CARD,CAQwB;;AARxB,GAAH,GASxB,EATJ;AAUA,MAAIA,QAAJ,EAAW,MAAM,CAAC,GAAD,EAAMA,QAAN,CAAN,CAnB4B;;;;;AAyBvC,IAAE,MAAM,CAAC,GAAT;;AACA,EAAA,GAAG,CAAC,QAAJ,GAAe,YAAA;AACX,MAAE,KAAK,MAAL,CAAY,GAAd,IAAqB,KAAK,MAAL,CAAY,QAAZ,EAArB;AACH,GAFD;;AAGA,MAAI,EAAE,GAAG,MAAM,CAAE,GAAF,EAAO,EAAP,EAAW,EAAX,EAAe,EAAf,CAAf;AACA,MAAI,GAAG,CAAC,GAAJ,KAAY,CAAhB,EAAmB,GAAG,CAAC,QAAJ;AACnB,SAAO,EAAP;AACH;;;;AAID,SAAA,uBAAA,GAAA;AACI,MAAI,CAAC,IAAI,CAAC,EAAV,EAAc,IAAI,CAAC,EAAL,GAAU,EAAE,WAAZ;AACd,IAAE,IAAI,CAAC,MAAP;AACA,EAAA,IAAI,CAAC,MAAL,IAAe,eAAf;AACA,SAAO,IAAI,CAAC,EAAZ;AACH;;;;;AAID,SAAA,uBAAA,CAAwC,YAAxC,EAAoD;AAChD,MAAI,CAAC,IAAI,CAAC,MAAN,IAAiB,YAAY,IAAI,YAAY,KAAK,IAAI,CAAC,EAA3D,EAAgE;AAChE,MAAI,EAAE,IAAI,CAAC,MAAP,KAAkB,CAAtB,EAAyB,IAAI,CAAC,EAAL,GAAU,CAAV;AACzB,EAAA,IAAI,CAAC,MAAL,GAAc,IAAI,CAAC,MAAL,GAAc,eAA5B,CAHgD,CAGJ;AAC/C;;;AAGD,SAAA,wBAAA,CAA0C,eAA1C,EAAyD;AACrD,MAAI,IAAI,CAAC,MAAL,IAAe,eAAf,IAAkC,eAAe,CAAC,WAAhB,KAAgC,aAAtE,EAAqF;AACjF,IAAA,uBAAuB;AACvB,WAAO,eAAe,CAAC,IAAhB,CAAqB,UAAA,CAAA,EAAC;AACzB,MAAA,uBAAuB;AACvB,aAAO,CAAP;AACH,KAHM,EAGJ,UAAA,CAAA,EAAC;AACA,MAAA,uBAAuB;AACvB,aAAO,SAAS,CAAC,CAAD,CAAhB;AACH,KANM,CAAP;AAOH;;AACD,SAAO,eAAP;AACH;;AAED,SAAA,aAAA,CAAuB,UAAvB,EAAiC;AAC7B,IAAE,WAAF;;AACA,MAAI,CAAC,IAAI,CAAC,MAAN,IAAgB,EAAE,IAAI,CAAC,MAAP,KAAkB,CAAtC,EAAyC;AACrC,IAAA,IAAI,CAAC,MAAL,GAAc,IAAI,CAAC,EAAL,GAAU,CAAxB,CADqC,CACX;AAC7B;;AAED,EAAA,SAAS,CAAC,IAAV,CAAe,GAAf;AACA,EAAA,YAAY,CAAC,UAAD,EAAa,IAAb,CAAZ;AACH;;AAED,SAAA,aAAA,GAAA;AACI,MAAI,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAV,GAAiB,CAAlB,CAApB;AACA,EAAA,SAAS,CAAC,GAAV;AACA,EAAA,YAAY,CAAC,IAAD,EAAO,KAAP,CAAZ;AACH;;AAED,SAAA,YAAA,CAAuB,UAAvB,EAAmC,aAAnC,EAAgD;AAC5C,MAAI,WAAW,GAAG,GAAlB;;AACA,MAAI,aAAa,GAAG,IAAI,CAAC,MAAL,KAAgB,CAAC,UAAU,EAAX,IAAiB,UAAU,KAAK,GAAhD,CAAH,GAA0D,UAAU,KAAK,CAAC,GAAE,UAAH,IAAiB,UAAU,KAAK,GAArC,CAArF,EAAgI;;;AAG5H,IAAA,sBAAsB,CAAC,aAAa,GAAG,aAAa,CAAC,IAAd,CAAmB,IAAnB,EAAyB,UAAzB,CAAH,GAA0C,aAAxD,CAAtB;AACH;;AACD,MAAI,UAAU,KAAK,GAAnB,EAAwB;AAExB,EAAA,GAAG,GAAG,UAAN,CAT4C,CAS3B;;;AAGjB,MAAI,WAAW,KAAK,SAApB,EAA+B,SAAS,CAAC,GAAV,GAAgB,QAAQ,EAAxB;;AAE/B,MAAI,kBAAJ,EAAwB;;AAEpB,QAAI,aAAa,GAAG,SAAS,CAAC,GAAV,CAAc,OAAlC,CAFoB;;AAIpB,QAAI,SAAS,GAAG,UAAU,CAAC,GAA3B,CAJoB;;;AAQpB,IAAA,kBAAkB,CAAC,IAAnB,GAA0B,SAAS,CAAC,KAApC;AACA,IAAA,aAAa,CAAC,SAAd,CAAwB,IAAxB,GAA+B,SAAS,CAAC,KAAzC;;AAEA,QAAI,WAAW,CAAC,MAAZ,IAAsB,UAAU,CAAC,MAArC,EAA6C;;;AAIzC,MAAA,MAAM,CAAC,cAAP,CAAsB,OAAtB,EAA+B,SAA/B,EAA0C,SAAS,CAAC,WAApD,EAJyC;;;AAQzC,MAAA,aAAa,CAAC,GAAd,GAAoB,SAAS,CAAC,GAA9B;AACA,MAAA,aAAa,CAAC,IAAd,GAAqB,SAAS,CAAC,IAA/B;AACA,MAAA,aAAa,CAAC,OAAd,GAAwB,SAAS,CAAC,OAAlC;AACA,MAAA,aAAa,CAAC,MAAd,GAAuB,SAAS,CAAC,MAAjC;AACH;AACJ;AACJ;;AAED,SAAA,QAAA,GAAA;AACI,MAAI,aAAa,GAAG,OAAO,CAAC,OAA5B;AACA,SAAO,kBAAkB,GAAG;AACxB,IAAA,OAAO,EAAE,aADe;AAExB,IAAA,WAAW,EAAE,MAAM,CAAC,wBAAP,CAAgC,OAAhC,EAAyC,SAAzC,CAFW;AAGxB,IAAA,GAAG,EAAE,aAAa,CAAC,GAHK;AAIxB,IAAA,IAAI,EAAE,aAAa,CAAC,IAJI;AAKxB,IAAA,OAAO,EAAE,aAAa,CAAC,OALC;AAMxB,IAAA,MAAM,EAAE,aAAa,CAAC,MANE;AAOxB,IAAA,KAAK,EAAE,kBAAkB,CAAC,IAPF;AAQxB,IAAA,KAAK,EAAE,aAAa,CAAC,SAAd,CAAwB;AARP,GAAH,GASrB,EATJ;AAUH;;AAED,SAAA,MAAA,CAAwB,GAAxB,EAA6B,EAA7B,EAAiC,EAAjC,EAAqC,EAArC,EAAyC,EAAzC,EAA2C;AACvC,MAAI,UAAU,GAAG,GAAjB;;AACA,MAAI;AACA,IAAA,YAAY,CAAC,GAAD,EAAM,IAAN,CAAZ;AACA,WAAO,EAAE,CAAC,EAAD,EAAK,EAAL,EAAS,EAAT,CAAT;AACH,GAHD,SAGU;AACN,IAAA,YAAY,CAAC,UAAD,EAAa,KAAb,CAAZ;AACH;AACJ;;AAED,SAAA,sBAAA,CAAiC,GAAjC,EAAoC;;;;AAIhC,EAAA,iBAAiB,CAAC,IAAlB,CAAuB,qBAAvB,EAA8C,GAA9C;AACH;;AAED,SAAA,yBAAA,CAAmC,EAAnC,EAAuC,IAAvC,EAA6C,aAA7C,EAA0D;AACtD,SAAO,OAAO,EAAP,KAAc,UAAd,GAA2B,EAA3B,GAAgC,YAAA;AACnC,QAAI,SAAS,GAAG,GAAhB;AACA,QAAI,aAAJ,EAAmB,uBAAuB;AAC1C,IAAA,YAAY,CAAC,IAAD,EAAO,IAAP,CAAZ;;AACA,QAAI;AACA,aAAO,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,SAAf,CAAP;AACH,KAFD,SAEU;AACN,MAAA,YAAY,CAAC,SAAD,EAAY,KAAZ,CAAZ;AACH;AACJ,GATD;AAUH;;AAED,SAAA,qBAAA,CAAgC,QAAhC,EAA0C,IAA1C,EAA8C;AAC1C,SAAO,UAAU,UAAV,EAAsB,UAAtB,EAAgC;AACnC,WAAO,QAAQ,CAAC,IAAT,CAAc,IAAd,EACH,yBAAyB,CAAC,UAAD,EAAa,IAAb,EAAmB,KAAnB,CADtB,EAEH,yBAAyB,CAAC,UAAD,EAAa,IAAb,EAAmB,KAAnB,CAFtB,CAAP;AAGH,GAJD;AAKH;;AAED,IAAM,kBAAkB,GAAG,oBAA3B;;AAEA,SAAA,WAAA,CAAqB,GAArB,EAA0B,OAA1B,EAAiC;AAC7B,MAAI,EAAJ;;AACA,MAAI;AACA,IAAA,EAAE,GAAG,OAAO,CAAC,WAAR,CAAoB,GAApB,CAAL;AACH,GAFD,CAEE,OAAO,CAAP,EAAU,CAAE;;AACd,MAAI,EAAE,KAAK,KAAX,EAAkB,IAAI;AAClB,QAAI,KAAJ;AAAA,QAAW,SAAS,GAAG;AAAC,MAAA,OAAO,EAAE,OAAV;AAAmB,MAAA,MAAM,EAAE;AAA3B,KAAvB;;AACA,QAAI,OAAO,CAAC,QAAR,IAAoB,QAAQ,CAAC,WAAjC,EAA8C;AAC1C,MAAA,KAAK,GAAG,QAAQ,CAAC,WAAT,CAAqB,OAArB,CAAR;AACA,MAAA,KAAK,CAAC,SAAN,CAAgB,kBAAhB,EAAoC,IAApC,EAA0C,IAA1C;AACA,MAAA,MAAM,CAAC,KAAD,EAAQ,SAAR,CAAN;AACH,KAJD,MAIO,IAAI,OAAO,CAAC,WAAZ,EAAyB;AAC5B,MAAA,KAAK,GAAG,IAAI,WAAJ,CAAgB,kBAAhB,EAAoC;AAAC,QAAA,MAAM,EAAE;AAAT,OAApC,CAAR;AACA,MAAA,MAAM,CAAC,KAAD,EAAQ,SAAR,CAAN;AACH;;AACD,QAAI,KAAK,IAAI,OAAO,CAAC,aAArB,EAAoC;AAChC,MAAA,aAAa,CAAC,KAAD,CAAb;AACA,UAAI,CAAC,OAAO,CAAC,qBAAT,IAAkC,OAAO,CAAC,oBAA9C;AAEI,YAAI;AAAC,UAAA,OAAO,CAAC,oBAAR,CAA6B,KAA7B;AAAqC,SAA1C,CAA2C,OAAO,CAAP,EAAU,CAAE;AAC9D;;AACD,QAAI,CAAC,KAAK,CAAC,gBAAX,EAA6B;AACzB,MAAA,OAAO,CAAC,IAAR,CAAa,2BAAwB,GAAG,CAAC,KAAJ,IAAa,GAArC,CAAb;AACH;AACJ,GAnBiB,CAmBhB,OAAO,CAAP,EAAU,CAAE;AACjB;;AAED,IAAW,SAAS,GAAG,OAAO,CAAC,MAA/B;;gBCx0B+B,KAAG;AAC9B,MAAI,GAAG,GAAG,EAAV;;AACA,MAAI,EAAE,GAAG,UAAU,SAAV,EAAqB,UAArB,EAA+B;AACpC,QAAI,UAAJ,EAAgB;;AAEZ,UAAI,CAAC,GAAG,SAAS,CAAC,MAAlB;AAAA,UAA0B,IAAI,GAAG,IAAI,KAAJ,CAAU,CAAC,GAAG,CAAd,CAAjC;;AACA,aAAO,EAAE,CAAT;AAAY,QAAA,IAAI,CAAC,CAAC,GAAG,CAAL,CAAJ,GAAc,SAAS,CAAC,CAAD,CAAvB;AAAZ;;AACA,MAAA,GAAG,CAAC,SAAD,CAAH,CAAe,SAAf,CAAyB,KAAzB,CAA+B,IAA/B,EAAqC,IAArC;AACA,aAAO,GAAP;AACH,KAND,MAMO,IAAI,OAAQ,SAAR,KAAuB,QAA3B,EAAqC;;AAExC,aAAO,GAAG,CAAC,SAAD,CAAV;AACH;AACJ,GAXD;;AAYA,EAAA,EAAE,CAAC,YAAH,GAAkB,GAAlB;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,SAAS,CAAC,MAA9B,EAAsC,CAAC,GAAG,CAA1C,EAA6C,EAAE,CAA/C,EAAkD;AAC9C,IAAA,GAAG,CAAC,SAAS,CAAC,CAAD,CAAV,CAAH;AACH;;AAED,SAAO,EAAP;;AAEA,WAAA,GAAA,CAAa,SAAb,EAAwB,aAAxB,EAAuC,eAAvC,EAAsD;AAClD,QAAI,QAAO,SAAP,MAAqB,QAAzB,EAAmC,OAAO,mBAAmB,CAAC,SAAD,CAA1B;AACnC,QAAI,CAAC,aAAL,EAAoB,aAAa,GAAG,0BAAhB;AACpB,QAAI,CAAC,eAAL,EAAsB,eAAe,GAAG,GAAlB;AAEtB,QAAI,OAAO,GAAG;AACV,MAAA,WAAW,EAAE,EADH;AAEV,MAAA,IAAI,EAAE,eAFI;AAGV,MAAA,SAAS,EAAE,UAAU,EAAV,EAAY;AACnB,YAAI,OAAO,CAAC,WAAR,CAAoB,OAApB,CAA4B,EAA5B,MAAoC,CAAC,CAAzC,EAA4C;AACxC,UAAA,OAAO,CAAC,WAAR,CAAoB,IAApB,CAAyB,EAAzB;AACA,UAAA,OAAO,CAAC,IAAR,GAAe,aAAa,CAAC,OAAO,CAAC,IAAT,EAAe,EAAf,CAA5B;AACH;AACJ,OARS;AASV,MAAA,WAAW,EAAE,UAAU,EAAV,EAAY;AACrB,QAAA,OAAO,CAAC,WAAR,GAAsB,OAAO,CAAC,WAAR,CAAoB,MAApB,CAA2B,UAAU,EAAV,EAAY;AAAI,iBAAO,EAAE,KAAK,EAAd;AAAmB,SAA9D,CAAtB;AACA,QAAA,OAAO,CAAC,IAAR,GAAe,OAAO,CAAC,WAAR,CAAoB,MAApB,CAA2B,aAA3B,EAA0C,eAA1C,CAAf;AACH;AAZS,KAAd;AAcA,IAAA,GAAG,CAAC,SAAD,CAAH,GAAiB,EAAE,CAAC,SAAD,CAAF,GAAgB,OAAjC;AACA,WAAO,OAAP;AACH;;AAED,WAAA,mBAAA,CAA6B,GAA7B,EAAgC;;AAE5B,IAAA,IAAI,CAAC,GAAD,CAAJ,CAAU,OAAV,CAAkB,UAAU,SAAV,EAAmB;AACjC,UAAI,IAAI,GAAG,GAAG,CAAC,SAAD,CAAd;;AACA,UAAI,OAAO,CAAC,IAAD,CAAX,EAAmB;AACf,QAAA,GAAG,CAAC,SAAD,EAAY,GAAG,CAAC,SAAD,CAAH,CAAe,CAAf,CAAZ,EAA+B,GAAG,CAAC,SAAD,CAAH,CAAe,CAAf,CAA/B,CAAH;AACH,OAFD,MAEO,IAAI,IAAI,KAAK,MAAb,EAAqB;;;AAGxB,YAAI,OAAO,GAAG,GAAG,CAAC,SAAD,EAAY,MAAZ,EAAoB,SAAA,IAAA,GAAA;;AAEjC,cAAI,CAAC,GAAG,SAAS,CAAC,MAAlB;AAAA,cAA0B,IAAI,GAAG,IAAI,KAAJ,CAAU,CAAV,CAAjC;;AACA,iBAAO,CAAC,EAAR;AAAY,YAAA,IAAI,CAAC,CAAD,CAAJ,GAAU,SAAS,CAAC,CAAD,CAAnB;AAAZ,WAHiC;;;AAKjC,UAAA,OAAO,CAAC,WAAR,CAAoB,OAApB,CAA4B,UAAU,EAAV,EAAY;AACpC,YAAA,IAAI,CAAC,SAAA,SAAA,GAAA;AACD,cAAA,EAAE,CAAC,KAAH,CAAS,IAAT,EAAe,IAAf;AACH,aAFG,CAAJ;AAGH,WAJD;AAKH,SAVgB,CAAjB;AAWH,OAdM,MAcA,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,sBAA/B,CAAN;AACV,KAnBD;AAoBH;AACJ;ACxED;;;;;;;;;;;;;;;AAcA,IAyCI,aAAa,GAAG,WAzCpB;IA0CI,SAAS,GAAG,MAAM,CAAC,YAAP,CAAoB,KAApB;;IAGZ,MAAM,GAAI,YAAA;AAAW,MAAI;AAAC,IAAA,WAAW,CAAC,IAAZ,CAAiB,CAAC,EAAD,CAAjB;AAAuB,WAAO,CAAC,EAAD,CAAP;AAAa,GAAzC,CAAyC,OAAM,CAAN,EAAQ;AAAC,WAAO,SAAP;AAAkB;AAAC,CAAjF;;IACT,MAAM,GAAG,CAAC;IACV,oBAAoB,GAAG;IACvB,eAAe,GAAG;IAClB,WAAW,GAAG;IACd,UAAU,GAAG,OAAO,SAAP,KAAqB,WAArB,IAAoC,sBAAsB,IAAtB,CAA2B,SAAS,CAAC,SAArC;IACjD,yBAAyB,GAAG;IAC5B,0BAA0B,GAAG;;IAC7B,qBAAqB,GAAG,UAAA,KAAA,EAAK;AAAI,SAAA,CAAC,6BAA6B,IAA7B,CAAkC,KAAlC,CAAD;AAAyC;;IAC1E,WAAU;;;AAGdC,QAAc,CAACC,KAAD,EAAc,qBAAd,CAAdD;;AAEA,SAAA,KAAA,CAA8B,MAA9B,EAAsC,OAAtC,EAA6C;;AAEzC,MAAI,IAAI,GAAG,KAAK,CAAC,YAAjB;AACA,MAAI,IAAI,GAAG,MAAM,CAAC;;AAEd,IAAA,MAAM,EAAE,KAAK,CAAC,MAFA;AAGd,IAAA,QAAQ,EAAE,IAHI;AAId,IAAA,SAAS,EAAE,IAAI,CAAC,SAJF;AAKd,IAAA,WAAW,EAAE,IAAI,CAAC,WALJ,CAKe;;AALf,GAAD,EAMd,OANc,CAAjB;AAOA,MAAI,MAAM,GAAG,IAAI,CAAC,MAAlB;AAAA,MACI,QAAQ,GAAG,IAAI,CAAC,QADpB;AAAA,MAEI,SAAS,GAAG,IAAI,CAAC,SAFrB;AAAA,MAGI,WAAW,GAAG,IAAI,CAAC,WAHvB;AAKA,MAAI,YAAY,GAAG,KAAK,SAAL,GAAiB,EAApC;AACA,MAAI,QAAQ,GAAG,EAAf;AACA,MAAI,YAAY,GAAG,EAAnB;AACA,MAAI,SAAS,GAAG,EAAhB,CAlByC;;AAoBzC,MAAI,KAAK,GAAG,IAAZ,CApByC,CAoBxB;;AACjB,MAAI,WAAW,GAAG,IAAlB;AACA,MAAI,aAAa,GAAG,KAApB;AACA,MAAI,iBAAiB,GAAG,IAAxB;AACA,MAAI,YAAY,GAAG,KAAnB;AACA,MAAI,QAAQ,GAAG,UAAf;AAAA,MAA2B,SAAS,GAAG,WAAvC;AACA,MAAI,EAAE,GAAG,IAAT;AACA,MAAI,cAAJ;AAAA,MACI,cAAc,GAAG,IAAI,OAAJ,CAAY,UAAA,OAAA,EAAO;AAChC,IAAA,cAAc,GAAG,OAAjB;AACH,GAFgB,CADrB;AAAA,MAII,UAJJ;AAAA,MAKI,aAAa,GAAG,IAAI,OAAJ,CAAY,UAAC,CAAD,EAAI,MAAJ,EAAU;AAClC,IAAA,UAAU,GAAG,MAAb;AACH,GAFe,CALpB;AAQA,MAAI,UAAU,GAAG,IAAjB;AACA,MAAI,yBAAyB,GAAG,CAAC,CAAC,2BAA2B,CAAC,SAAD,CAA7D;AAAA,MACI,SADJ;;AAGA,WAAA,IAAA,GAAA;;;;AAII,IAAA,EAAE,CAAC,EAAH,CAAM,eAAN,EAAuB,UAAU,EAAV,EAAY;;;;;AAK/B,UAAI,EAAE,CAAC,UAAH,GAAgB,CAApB,EACI,OAAO,CAAC,IAAR,CAAa,mDAAiD,EAAE,CAAC,IAApD,GAAwD,0CAArE,EADJ,KAGI,OAAO,CAAC,IAAR,CAAa,kDAAgD,EAAE,CAAC,IAAnD,GAAuD,iDAApE;AACJ,MAAA,EAAE,CAAC,KAAH,GAT+B;;;;;;AAgBlC,KAhBD;AAiBA,IAAA,EAAE,CAAC,EAAH,CAAM,SAAN,EAAiB,UAAA,EAAA,EAAE;AACf,UAAI,CAAC,EAAE,CAAC,UAAJ,IAAkB,EAAE,CAAC,UAAH,GAAgB,EAAE,CAAC,UAAzC,EACI,OAAO,CAAC,IAAR,CAAa,mBAAiB,EAAE,CAAC,IAApB,GAAwB,gBAArC,EADJ,KAGI,OAAO,CAAC,IAAR,CAAa,cAAY,EAAE,CAAC,IAAf,GAAmB,gDAAnB,GAAoE,EAAE,CAAC,UAAH,GAAc,EAA/F;AACP,KALD;AAMH,GAlEwC;;;;;;;;;AA4EzC,OAAK,OAAL,GAAe,UAAU,aAAV,EAAuB;;;AAGlC,QAAI,KAAK,IAAI,aAAb,EAA4B,MAAM,IAAI,UAAU,CAAC,MAAf,CAAsB,0CAAtB,CAAN;AAC5B,SAAK,KAAL,GAAa,IAAI,CAAC,GAAL,CAAS,KAAK,KAAd,EAAqB,aAArB,CAAb;AACA,QAAI,eAAe,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAU,CAAV,EAAW;AAAI,aAAO,CAAC,CAAC,IAAF,CAAO,OAAP,KAAmB,aAA1B;AAA0C,KAAzE,EAA2E,CAA3E,CAAtB;AACA,QAAI,eAAJ,EAAqB,OAAO,eAAP;AACrB,IAAA,eAAe,GAAG,IAAI,OAAJ,CAAY,aAAZ,CAAlB;AACA,IAAA,QAAQ,CAAC,IAAT,CAAc,eAAd;AACA,IAAA,QAAQ,CAAC,IAAT,CAAc,iBAAd,EATkC;;AAWlC,IAAA,UAAU,GAAG,KAAb;AACA,WAAO,eAAP;AACH,GAbD;;AAeA,WAAA,OAAA,CAAiB,aAAjB,EAA8B;AAC1B,SAAK,IAAL,GAAY;AACR,MAAA,OAAO,EAAE,aADD;AAER,MAAA,YAAY,EAAE,IAFN;AAGR,MAAA,QAAQ,EAAE,EAHF;AAIR,MAAA,MAAM,EAAE,EAJA;AAKR,MAAA,cAAc,EAAE;AALR,KAAZ;AAOA,SAAK,MAAL,CAAY,EAAZ,EAR0B,CAQV;AACnB;;AAED,EAAA,MAAM,CAAC,OAAO,CAAC,SAAT,EAAoB;AACtB,IAAA,MAAM,EAAE,UAAU,MAAV,EAAgB;;;;;;;;;;;;;;;AAepB,WAAK,IAAL,CAAU,YAAV,GAAyB,KAAK,IAAL,CAAU,YAAV,GAAyB,MAAM,CAAC,KAAK,IAAL,CAAU,YAAX,EAAyB,MAAzB,CAA/B,GAAkE,MAA3F,CAfoB;;AAkBpB,UAAI,UAAU,GAAG,EAAjB;AACA,MAAA,QAAQ,CAAC,OAAT,CAAiB,UAAU,OAAV,EAAiB;AAC9B,QAAA,MAAM,CAAC,UAAD,EAAa,OAAO,CAAC,IAAR,CAAa,YAA1B,CAAN;AACH,OAFD;AAIA,UAAI,QAAQ,GAAI,KAAK,IAAL,CAAU,QAAV,GAAqB,EAArC;;AACA,WAAK,gBAAL,CAAsB,UAAtB,EAAkC,QAAlC,EAxBoB;;;;AA2BpB,MAAA,YAAY,GAAG,EAAE,CAAC,SAAH,GAAe,QAA9B;AACA,MAAA,eAAe,CAAC,CAAC,SAAD,EAAY,EAAZ,EAAgB,WAAW,CAAC,SAA5B,CAAD,CAAf,CA5BoB,CA4BoC;;AACxD,MAAA,aAAa,CAAC,CAAC,SAAD,EAAY,EAAZ,EAAgB,WAAW,CAAC,SAA5B,EAAuC,KAAK,IAAL,CAAU,MAAjD,CAAD,EAA2D,IAAI,CAAC,QAAD,CAA/D,EAA2E,QAA3E,CAAb;AACA,MAAA,YAAY,GAAG,IAAI,CAAC,QAAD,CAAnB;AACA,aAAO,IAAP;AACH,KAjCqB;AAkCtB,IAAA,OAAO,EAAE,UAAU,eAAV,EAAyB;AAC9B,WAAK,IAAL,CAAU,cAAV,GAA2B,eAA3B;AACA,aAAO,IAAP;AACH,KArCqB;AAsCtB,IAAA,gBAAgB,EAAE,UAAU,MAAV,EAAkB,SAAlB,EAA2B;AACzC,MAAA,IAAI,CAAC,MAAD,CAAJ,CAAa,OAAb,CAAqB,UAAU,SAAV,EAAmB;AACpC,YAAI,MAAM,CAAC,SAAD,CAAN,KAAsB,IAA1B,EAAgC;AAC5B,cAAI,gBAAgB,GAAG,EAAvB;AACA,cAAI,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,SAAD,CAAP,CAA9B;AACA,cAAI,OAAO,GAAG,OAAO,CAAC,KAAR,EAAd;AACA,cAAI,OAAO,CAAC,KAAZ,EAAmB,MAAM,IAAI,UAAU,CAAC,MAAf,CAAsB,oCAAtB,CAAN;AACnB,cAAI,OAAO,CAAC,OAAZ,EAAqB,YAAY,CAAC,gBAAD,EAAmB,OAAO,CAAC,OAA3B,EAAoC,OAAO,CAAC,IAAR,GAAe,CAAf,GAAmB,OAAO,CAAC,OAA/D,CAAZ;AACrB,UAAA,OAAO,CAAC,OAAR,CAAgB,UAAU,GAAV,EAAa;AACzB,gBAAI,GAAG,CAAC,IAAR,EAAc,MAAM,IAAI,UAAU,CAAC,MAAf,CAAsB,sDAAtB,CAAN;AACd,gBAAI,CAAC,GAAG,CAAC,OAAT,EAAkB,MAAM,IAAI,UAAU,CAAC,MAAf,CAAsB,sDAAtB,CAAN;AAClB,YAAA,YAAY,CAAC,gBAAD,EAAmB,GAAG,CAAC,OAAvB,EAAgC,GAAG,CAAC,QAAJ,GAAe,GAAG,CAAC,OAAJ,CAAY,GAAZ,CAAgB,YAAA;AAAc,qBAAO,EAAP;AAAY,aAA1C,CAAf,GAA6D,EAA7F,CAAZ;AACH,WAJD;AAKA,UAAA,SAAS,CAAC,SAAD,CAAT,GAAuB,IAAI,WAAJ,CAAgB,SAAhB,EAA2B,OAA3B,EAAoC,OAApC,EAA6C,gBAA7C,CAAvB;AACH;AACJ,OAdD;AAeH;AAtDqB,GAApB,CAAN;;AAyDA,WAAA,YAAA,CAAuB,UAAvB,EAAmC,QAAnC,EAA6C,MAA7C,EAAmD;AAC/C,QAAI,KAAK,GAAG,EAAE,CAAC,kBAAH,CAAsB,SAAtB,EAAiC,YAAjC,EAA+C,YAA/C,CAAZ;;AACA,IAAA,KAAK,CAAC,MAAN,CAAa,QAAb;;AACA,IAAA,KAAK,CAAC,WAAN,CAAkB,KAAlB,CAAwB,MAAxB;;AACA,QAAI,iBAAiB,GAAG,KAAK,CAAC,OAAN,CAAc,IAAd,CAAmB,KAAnB,CAAxB;;AACA,IAAA,QAAQ,CAAC,YAAA;AACL,MAAA,GAAG,CAAC,KAAJ,GAAY,KAAZ;;AACA,UAAI,UAAU,KAAK,CAAnB,EAAsB;;AAElB,QAAA,IAAI,CAAC,YAAD,CAAJ,CAAmB,OAAnB,CAA2B,UAAU,SAAV,EAAmB;AAC1C,UAAA,WAAW,CAAC,QAAD,EAAW,SAAX,EAAsB,YAAY,CAAC,SAAD,CAAZ,CAAwB,OAA9C,EAAuD,YAAY,CAAC,SAAD,CAAZ,CAAwB,OAA/E,CAAX;AACH,SAFD;AAGA,QAAA,OAAO,CAAC,MAAR,CAAe,YAAA;AAAI,iBAAA,EAAE,CAAC,EAAH,CAAM,QAAN,CAAe,IAAf,CAAoB,KAApB,CAAA;AAA0B,SAA7C,EAA+C,KAA/C,CAAqD,iBAArD;AACH,OAND,MAOI,sBAAsB,CAAC,UAAD,EAAa,KAAb,EAAoB,QAApB,CAAtB,CAAoD,KAApD,CAA0D,iBAA1D;AACP,KAVO,CAAR;AAWH;;AAED,WAAA,sBAAA,CAAiC,UAAjC,EAA6C,KAA7C,EAAoD,QAApD,EAA4D;;;AAGxD,QAAI,KAAK,GAAG,EAAZ;AACA,QAAI,gBAAgB,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAA,OAAA,EAAO;AAAI,aAAA,OAAO,CAAC,IAAR,CAAa,OAAb,KAAyB,UAAzB;AAAmC,KAA9D,EAAgE,CAAhE,CAAvB;AACA,QAAI,CAAC,gBAAL,EAAuB,MAAM,IAAI,UAAU,CAAC,OAAf,CAAuB,kEAAvB,CAAN;AACvB,IAAA,YAAY,GAAG,EAAE,CAAC,SAAH,GAAe,gBAAgB,CAAC,IAAjB,CAAsB,QAApD;AACA,QAAI,wBAAwB,GAAG,KAA/B;AAEA,QAAI,SAAS,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAA,CAAA,EAAC;AAAI,aAAA,CAAC,CAAC,IAAF,CAAO,OAAP,GAAiB,UAAjB;AAA2B,KAAhD,CAAhB;AACA,IAAA,SAAS,CAAC,OAAV,CAAkB,UAAU,OAAV,EAAiB;;AAE/B,MAAA,KAAK,CAAC,IAAN,CAAW,YAAA;AACP,YAAI,SAAS,GAAG,YAAhB;AACA,YAAI,SAAS,GAAG,OAAO,CAAC,IAAR,CAAa,QAA7B;AACA,QAAA,0BAA0B,CAAC,SAAD,EAAY,QAAZ,CAA1B;AACA,QAAA,0BAA0B,CAAC,SAAD,EAAY,QAAZ,CAA1B;AACA,QAAA,YAAY,GAAG,EAAE,CAAC,SAAH,GAAe,SAA9B;AACA,YAAI,IAAI,GAAG,aAAa,CAAC,SAAD,EAAY,SAAZ,CAAxB,CANO;;AAQP,QAAA,IAAI,CAAC,GAAL,CAAS,OAAT,CAAiB,UAAU,KAAV,EAAe;AAC5B,UAAA,WAAW,CAAC,QAAD,EAAW,KAAK,CAAC,CAAD,CAAhB,EAAqB,KAAK,CAAC,CAAD,CAAL,CAAS,OAA9B,EAAuC,KAAK,CAAC,CAAD,CAAL,CAAS,OAAhD,CAAX;AACH,SAFD,EARO;;AAYP,QAAA,IAAI,CAAC,MAAL,CAAY,OAAZ,CAAoB,UAAU,MAAV,EAAgB;AAChC,cAAI,MAAM,CAAC,QAAX,EAAqB;AACjB,kBAAM,IAAI,UAAU,CAAC,OAAf,CAAuB,0CAAvB,CAAN;AACH,WAFD,MAEO;AACH,gBAAI,KAAK,GAAG,QAAQ,CAAC,WAAT,CAAqB,MAAM,CAAC,IAA5B,CAAZ,CADG;;AAGH,YAAA,MAAM,CAAC,GAAP,CAAW,OAAX,CAAmB,UAAU,GAAV,EAAa;AAC5B,cAAA,QAAQ,CAAC,KAAD,EAAQ,GAAR,CAAR;AACH,aAFD,EAHG;;AAOH,YAAA,MAAM,CAAC,MAAP,CAAc,OAAd,CAAsB,UAAU,GAAV,EAAa;AAC/B,cAAA,KAAK,CAAC,WAAN,CAAkB,GAAG,CAAC,IAAtB;AACA,cAAA,QAAQ,CAAC,KAAD,EAAQ,GAAR,CAAR;AACH,aAHD,EAPG;;AAYH,YAAA,MAAM,CAAC,GAAP,CAAW,OAAX,CAAmB,UAAU,OAAV,EAAiB;AAChC,cAAA,KAAK,CAAC,WAAN,CAAkB,OAAlB;AACH,aAFD;AAGH;AACJ,SAnBD;;AAoBA,YAAI,OAAO,CAAC,IAAR,CAAa,cAAjB,EAAiC;AAC7B,UAAA,wBAAwB,GAAG,IAA3B;AACA,iBAAO,OAAO,CAAC,MAAR,CAAe,YAAA;AAClB,YAAA,OAAO,CAAC,IAAR,CAAa,cAAb,CAA4B,KAA5B;AACH,WAFM,CAAP;AAGH;AACJ,OAtCD;AAuCA,MAAA,KAAK,CAAC,IAAN,CAAW,UAAU,QAAV,EAAkB;AACzB,YAAI,CAAC,wBAAD,IAA6B,CAAC,yBAAlC,EAA6D;AACzD,cAAI,SAAS,GAAG,OAAO,CAAC,IAAR,CAAa,QAA7B,CADyD;;AAGzD,UAAA,mBAAmB,CAAC,SAAD,EAAY,QAAZ,CAAnB;AACH;AACJ,OAND;AAOH,KAhDD,EAVwD;;AA6DxD,aAAA,QAAA,GAAA;AACI,aAAO,KAAK,CAAC,MAAN,GAAe,OAAO,CAAC,OAAR,CAAgB,KAAK,CAAC,KAAN,GAAc,KAAK,CAAC,QAApB,CAAhB,EAA+C,IAA/C,CAAoD,QAApD,CAAf,GACH,OAAO,CAAC,OAAR,EADJ;AAEH;;AAED,WAAO,QAAQ,GAAG,IAAX,CAAgB,YAAA;AACnB,MAAA,mBAAmB,CAAC,YAAD,EAAe,QAAf,CAAnB,CADmB,CACyB;AAC/C,KAFM,CAAP;AAGH;;AAED,WAAA,aAAA,CAAuB,SAAvB,EAAkC,SAAlC,EAA2C;AACvC,QAAI,IAAI,GAAG;AACP,MAAA,GAAG,EAAE,EADE;AAEP,MAAA,GAAG,EAAE,EAFE;AAGP,MAAA,MAAM,EAAE,EAHD,CAGG;;AAHH,KAAX;;AAKA,SAAK,IAAI,KAAT,IAAkB,SAAlB,EAA6B;AACzB,UAAI,CAAC,SAAS,CAAC,KAAD,CAAd,EAAuB,IAAI,CAAC,GAAL,CAAS,IAAT,CAAc,KAAd;AAC1B;;AACD,SAAK,KAAL,IAAc,SAAd,EAAyB;AACrB,UAAI,MAAM,GAAG,SAAS,CAAC,KAAD,CAAtB;AAAA,UACI,MAAM,GAAG,SAAS,CAAC,KAAD,CADtB;;AAEA,UAAI,CAAC,MAAL,EAAa;AACT,QAAA,IAAI,CAAC,GAAL,CAAS,IAAT,CAAc,CAAC,KAAD,EAAQ,MAAR,CAAd;AACH,OAFD,MAEO;AACH,YAAI,MAAM,GAAG;AACT,UAAA,IAAI,EAAE,KADG;AAET,UAAA,GAAG,EAAE,MAFI;AAGT,UAAA,QAAQ,EAAE,KAHD;AAIT,UAAA,GAAG,EAAE,EAJI;AAKT,UAAA,GAAG,EAAE,EALI;AAMT,UAAA,MAAM,EAAE;AANC,SAAb;;AAQA,YAAI,MAAM,CAAC,OAAP,CAAe,GAAf,KAAuB,MAAM,CAAC,OAAP,CAAe,GAA1C,EAA+C;;AAE3C,UAAA,MAAM,CAAC,QAAP,GAAkB,IAAlB;AACA,UAAA,IAAI,CAAC,MAAL,CAAY,IAAZ,CAAiB,MAAjB;AACH,SAJD,MAIO;;AAEH,cAAI,UAAU,GAAG,MAAM,CAAC,SAAxB;AACA,cAAI,UAAU,GAAG,MAAM,CAAC,SAAxB;;AACA,eAAK,IAAI,OAAT,IAAoB,UAApB,EAAgC;AAC5B,gBAAI,CAAC,UAAU,CAAC,OAAD,CAAf,EAA0B,MAAM,CAAC,GAAP,CAAW,IAAX,CAAgB,OAAhB;AAC7B;;AACD,eAAK,OAAL,IAAgB,UAAhB,EAA4B;AACxB,gBAAI,MAAM,GAAG,UAAU,CAAC,OAAD,CAAvB;AAAA,gBACI,MAAM,GAAG,UAAU,CAAC,OAAD,CADvB;AAEA,gBAAI,CAAC,MAAL,EAAa,MAAM,CAAC,GAAP,CAAW,IAAX,CAAgB,MAAhB,EAAb,KACK,IAAI,MAAM,CAAC,GAAP,KAAe,MAAM,CAAC,GAA1B,EAA+B,MAAM,CAAC,MAAP,CAAc,IAAd,CAAmB,MAAnB;AACvC;;AACD,cAAI,MAAM,CAAC,GAAP,CAAW,MAAX,GAAoB,CAApB,IAAyB,MAAM,CAAC,GAAP,CAAW,MAAX,GAAoB,CAA7C,IAAkD,MAAM,CAAC,MAAP,CAAc,MAAd,GAAuB,CAA7E,EAAgF;AAC5E,YAAA,IAAI,CAAC,MAAL,CAAY,IAAZ,CAAiB,MAAjB;AACH;AACJ;AACJ;AACJ;;AACD,WAAO,IAAP;AACH;;AAED,WAAA,WAAA,CAAqB,QAArB,EAA+B,SAA/B,EAA0C,OAA1C,EAAmD,OAAnD,EAA0D;;AAEtD,QAAI,KAAK,GAAG,QAAQ,CAAC,EAAT,CAAY,iBAAZ,CAA8B,SAA9B,EAAyC,OAAO,CAAC,OAAR,GAAkB;AAAE,MAAA,OAAO,EAAE,OAAO,CAAC,OAAnB;AAA4B,MAAA,aAAa,EAAE,OAAO,CAAC;AAAnD,KAAlB,GAA8E;AAAE,MAAA,aAAa,EAAE,OAAO,CAAC;AAAzB,KAAvH,CAAZ;AACA,IAAA,OAAO,CAAC,OAAR,CAAgB,UAAU,GAAV,EAAa;AAAI,MAAA,QAAQ,CAAC,KAAD,EAAQ,GAAR,CAAR;AAAuB,KAAxD;AACA,WAAO,KAAP;AACH;;AAED,WAAA,mBAAA,CAA6B,SAA7B,EAAwC,QAAxC,EAAgD;AAC5C,IAAA,IAAI,CAAC,SAAD,CAAJ,CAAgB,OAAhB,CAAwB,UAAU,SAAV,EAAmB;AACvC,UAAI,CAAC,QAAQ,CAAC,EAAT,CAAY,gBAAZ,CAA6B,QAA7B,CAAsC,SAAtC,CAAL,EAAuD;AACnD,QAAA,WAAW,CAAC,QAAD,EAAW,SAAX,EAAsB,SAAS,CAAC,SAAD,CAAT,CAAqB,OAA3C,EAAoD,SAAS,CAAC,SAAD,CAAT,CAAqB,OAAzE,CAAX;AACH;AACJ,KAJD;AAKH;;AAED,WAAA,mBAAA,CAA6B,SAA7B,EAAwC,QAAxC,EAAgD;AAC5C,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,QAAQ,CAAC,EAAT,CAAY,gBAAZ,CAA6B,MAAjD,EAAyD,EAAE,CAA3D,EAA8D;AAC1D,UAAI,SAAS,GAAG,QAAQ,CAAC,EAAT,CAAY,gBAAZ,CAA6B,CAA7B,CAAhB;;AACA,UAAI,SAAS,CAAC,SAAD,CAAT,IAAwB,IAA5B,EAAkC;AAC9B,QAAA,QAAQ,CAAC,EAAT,CAAY,iBAAZ,CAA8B,SAA9B;AACH;AACJ;AACJ;;AAED,WAAA,QAAA,CAAkB,KAAlB,EAAyB,GAAzB,EAA4B;AACxB,IAAA,KAAK,CAAC,WAAN,CAAkB,GAAG,CAAC,IAAtB,EAA4B,GAAG,CAAC,OAAhC,EAAyC;AAAE,MAAA,MAAM,EAAE,GAAG,CAAC,MAAd;AAAsB,MAAA,UAAU,EAAE,GAAG,CAAC;AAAtC,KAAzC;AACH,GAnUwC;;;;;;;AA2UzC,OAAK,UAAL,GAAkB,SAAlB;;AAEA,OAAK,kBAAL,GAA0B,UAAU,IAAV,EAAgB,UAAhB,EAA4B,QAA5B,EAAsC,iBAAtC,EAAuD;AAC7E,WAAO,IAAI,WAAJ,CAAgB,IAAhB,EAAsB,UAAtB,EAAkC,QAAlC,EAA4C,iBAA5C,CAAP;AACH,GAFD;;;;;AAMA,WAAA,eAAA,CAAyB,IAAzB,EAA+B,UAA/B,EAA2C,EAA3C,EAA6C;AACzC,QAAI,CAAC,YAAD,IAAkB,CAAC,GAAG,CAAC,UAA3B,EAAwC;AACpC,UAAI,CAAC,aAAL,EAAoB;AAChB,YAAI,CAAC,QAAL,EACI,OAAO,SAAS,CAAE,IAAI,UAAU,CAAC,cAAf,EAAF,CAAhB;AACJ,QAAA,EAAE,CAAC,IAAH,GAAU,KAAV,CAAgB,GAAhB,EAHgB,CAGK;AACxB;;AACD,aAAO,cAAc,CAAC,IAAf,CAAoB,YAAA;AAAI,eAAA,eAAe,CAAC,IAAD,EAAO,UAAP,EAAmB,EAAnB,CAAf;AAAqC,OAA7D,CAAP;AACH,KAPD,MAOO;AACH,UAAI,KAAK,GAAG,EAAE,CAAC,kBAAH,CAAsB,IAAtB,EAA4B,UAA5B,EAAwC,YAAxC,CAAZ;;AACA,UAAI;AAAE,QAAA,KAAK,CAAC,MAAN;AAAiB,OAAvB,CAAwB,OAAO,EAAP,EAAW;AAAE,eAAO,SAAS,CAAC,EAAD,CAAhB;AAAuB;;AAC5D,aAAO,KAAK,CAAC,QAAN,CAAe,IAAf,EAAqB,UAAU,OAAV,EAAmB,MAAnB,EAAyB;AACjD,eAAO,QAAQ,CAAC,YAAA;AACZ,UAAA,GAAG,CAAC,KAAJ,GAAY,KAAZ;AACA,iBAAO,EAAE,CAAC,OAAD,EAAU,MAAV,EAAkB,KAAlB,CAAT;AACH,SAHc,CAAf;AAIH,OALM,EAKJ,IALI,CAKC,UAAA,MAAA,EAAM;;;;;;;;;;;AAWV,eAAO,KAAK,CAAC,WAAN,CAAkB,IAAlB,CAAuB,YAAA;AAAI,iBAAA,MAAA;AAAM,SAAjC,CAAP;AACH,OAjBM,CAAP;AAiBG;;;;AAIN;AACJ;;AAED,OAAK,UAAL,GAAkB,UAAU,EAAV,EAAY;AAC1B,WAAO,YAAY,IAAI,GAAG,CAAC,UAApB,GAAiC,EAAE,EAAnC,GAAwC,IAAI,OAAJ,CAAa,UAAC,OAAD,EAAU,MAAV,EAAgB;AACxE,UAAI,CAAC,aAAL,EAAoB;AAChB,YAAI,CAAC,QAAL,EAAe;AACX,UAAA,MAAM,CAAC,IAAI,UAAU,CAAC,cAAf,EAAD,CAAN;AACA;AACH;;AACD,QAAA,EAAE,CAAC,IAAH,GAAU,KAAV,CAAgB,GAAhB,EALgB,CAKK;AACxB;;AACD,MAAA,cAAc,CAAC,IAAf,CAAoB,OAApB,EAA6B,MAA7B;AACH,KAT8C,EAS5C,IAT4C,CASvC,EATuC,CAA/C;AAUH,GAXD,CAtXyC;;;;;;;;;;AA4YzC,OAAK,KAAL,GAAa,CAAb;;AAEA,OAAK,IAAL,GAAY,YAAA;AACR,QAAI,aAAa,IAAI,KAArB,EACI,OAAO,cAAc,CAAC,IAAf,CAAoB,YAAA;AAAK,aAAA,WAAW,GAAG,SAAS,CAAE,WAAF,CAAZ,GAA6B,EAAxC;AAA0C,KAAnE,CAAP;AACJC,IAAAA,KAAW,KAAK,aAAa,CAAC,YAAd,GAA6BC,iBAAuB,EAAzD,CAAXD,CAHQ,CAGgE;;AACxE,IAAA,aAAa,GAAG,IAAhB;AACA,IAAA,WAAW,GAAG,IAAd;AACA,IAAA,YAAY,GAAG,KAAf,CANQ;;AASR,QAAI,cAAc,GAAG,cAArB;AAAA;AAEI,IAAA,kBAAkB,GAAG,IAFzB;AAIA,WAAO,OAAO,CAAC,IAAR,CAAa,CAAC,aAAD,EAAgB,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;;;;;;AAO5D,UAAI,CAAC,SAAL,EAAgB,MAAM,IAAI,UAAU,CAAC,UAAf,CAClB,yFACA,uFAFkB,CAAN;AAIhB,UAAI,GAAG,GAAG,UAAU,GAAG,SAAS,CAAC,IAAV,CAAe,MAAf,CAAH,GAA4B,SAAS,CAAC,IAAV,CAAe,MAAf,EAAuB,IAAI,CAAC,KAAL,CAAW,EAAE,CAAC,KAAH,GAAW,EAAtB,CAAvB,CAAhD;AACA,UAAI,CAAC,GAAL,EAAU,MAAM,IAAI,UAAU,CAAC,UAAf,CAA0B,6BAA1B,CAAN,CAZkD,CAYa;;AACzE,MAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,MAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,aAAD,CAApB;AACA,MAAA,GAAG,CAAC,eAAJ,GAAsB,IAAI,CAAE,UAAU,CAAV,EAAW;AACnC,QAAA,kBAAkB,GAAG,GAAG,CAAC,WAAzB;;AACA,YAAI,UAAU,IAAI,CAAC,EAAE,CAAC,aAAtB,EAAqC;;;;AAIjC,UAAA,GAAG,CAAC,OAAJ,GAAc,cAAd,CAJiC,CAIJ;;AAC7B,UAAA,kBAAkB,CAAC,KAAnB,GALiC,CAKN;;;AAE3B,UAAA,GAAG,CAAC,MAAJ,CAAW,KAAX;AACA,cAAI,MAAM,GAAG,SAAS,CAAC,cAAV,CAAyB,MAAzB,CAAb,CARiC,CAQa;;AAC9C,UAAA,MAAM,CAAC,SAAP,GAAmB,MAAM,CAAC,OAAP,GAAiB,IAAI,CAAC,YAAA;AACrC,YAAA,MAAM,CAAE,IAAI,UAAU,CAAC,cAAf,CAA8B,cAAY,MAAZ,GAAkB,eAAhD,CAAF,CAAN;AACH,WAFuC,CAAxC;AAGH,SAZD,MAYO;AACH,UAAA,kBAAkB,CAAC,OAAnB,GAA6B,kBAAkB,CAAC,MAAD,CAA/C;AACA,cAAI,MAAM,GAAG,CAAC,CAAC,UAAF,GAAe,IAAI,CAAC,GAAL,CAAS,CAAT,EAAY,EAAZ,CAAf,GAAiC,CAAjC,GAAqC,CAAC,CAAC,UAApD,CAFG,CAE4D;;AAC/D,UAAA,YAAY,CAAC,MAAM,GAAG,EAAV,EAAc,kBAAd,EAAkC,MAAlC,EAA0C,GAA1C,CAAZ;AACH;AACJ,OAnByB,EAmBvB,MAnBuB,CAA1B;AAqBA,MAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAE,YAAA;;AAElB,QAAA,kBAAkB,GAAG,IAArB;AACA,QAAA,KAAK,GAAG,GAAG,CAAC,MAAZ;AACA,QAAA,WAAW,CAAC,IAAZ,CAAiB,EAAjB,EAJkB,CAIG;;AAErB,YAAI,UAAJ,EAAgB,gBAAgB,GAAhC,KACK,IAAI,KAAK,CAAC,gBAAN,CAAuB,MAAvB,GAAgC,CAApC,EAAuC;AACxC,cAAI;AACA,YAAA,0BAA0B,CAAC,YAAD,EAAe,KAAK,CAAC,WAAN,CAAkB,mBAAmB,CAAC,KAAK,CAAC,gBAAP,CAArC,EAA+D,QAA/D,CAAf,CAA1B;AACH,WAFD,CAEE,OAAO,CAAP,EAAU;AAEX;AACJ;AAED,QAAA,KAAK,CAAC,eAAN,GAAwB,IAAI,CAAC,UAAA,EAAA,EAAE;AAC3B,UAAA,EAAE,CAAC,QAAH,GAAc,IAAd,CAD2B,CACR;;AACnB,UAAA,EAAE,CAAC,EAAH,CAAM,eAAN,EAAuB,IAAvB,CAA4B,EAA5B;AACH,SAH2B,CAA5B;;AAKA,YAAI,CAAC,yBAAD,IAA8B,MAAM,KAAK,WAA7C,EAA0D;AACtD,UAAA,SAAS,CAAC,OAAV,CAAkB,GAAlB,CAAsB;AAAC,YAAA,IAAI,EAAE;AAAP,WAAtB,EAAsC,KAAtC,CAA4C,GAA5C;AACH;;AAED,QAAA,OAAO;AAEV,OA1BmB,EA0BjB,MA1BiB,CAApB;AA2BH,KA/DmC,CAAhB,CAAb,EA+DF,IA/DE,CA+DG,YAAA;;;;;AAKN,MAAA,iBAAiB,GAAG,EAApB;AACA,aAAO,OAAO,CAAC,OAAR,CAAgB,KAAK,CAAC,GAAN,CAAU,EAAE,CAAC,EAAH,CAAM,KAAN,CAAY,IAAtB,CAAhB,EAA6C,IAA7C,CAAkD,SAAA,cAAA,GAAA;AACrD,YAAI,iBAAiB,CAAC,MAAlB,GAA2B,CAA/B,EAAkC;;AAE9B,cAAI,UAAU,GAAG,iBAAiB,CAAC,MAAlB,CAAyB,eAAzB,EAA0C,GAA1C,CAAjB;AACA,UAAA,iBAAiB,GAAG,EAApB;AACA,iBAAO,OAAO,CAAC,OAAR,CAAgB,KAAK,CAAC,GAAN,CAAU,UAAV,CAAhB,EAAuC,IAAvC,CAA4C,cAA5C,CAAP;AACH;AACJ,OAPM,CAAP;AAQH,KA7EM,EA6EJ,OA7EI,CA6EI,YAAA;AACP,MAAA,iBAAiB,GAAG,IAApB;AACH,KA/EM,EA+EJ,IA/EI,CA+EC,YAAA;;AAEJ,MAAA,aAAa,GAAG,KAAhB;AACA,aAAO,EAAP;AACH,KAnFM,EAmFJ,KAnFI,CAmFE,UAAA,GAAA,EAAG;AACR,UAAI;;AAEA,QAAA,kBAAkB,IAAI,kBAAkB,CAAC,KAAnB,EAAtB;AACH,OAHD,CAGE,OAAO,CAAP,EAAU,CAAG;;AACf,MAAA,aAAa,GAAG,KAAhB,CALQ,CAKc;;AACtB,MAAA,EAAE,CAAC,KAAH,GANQ,CAMG;;;AAEX,MAAA,WAAW,GAAG,GAAd,CARQ,CAQU;;AAClB,aAAO,SAAS,CAAE,WAAF,CAAhB;AACH,KA7FM,EA6FJ,OA7FI,CA6FI,YAAA;AACP,MAAA,YAAY,GAAG,IAAf;AACA,MAAA,cAAc,GAFP,CAEU;AACpB,KAhGM,CAAP;AAiGH,GA9GD;;AAgHA,OAAK,KAAL,GAAa,YAAA;AACT,QAAI,GAAG,GAAG,WAAW,CAAC,OAAZ,CAAoB,EAApB,CAAV;AACA,QAAI,GAAG,IAAI,CAAX,EAAc,WAAW,CAAC,MAAZ,CAAmB,GAAnB,EAAwB,CAAxB;;AACd,QAAI,KAAJ,EAAW;AACP,UAAI;AAAC,QAAA,KAAK,CAAC,KAAN;AAAe,OAApB,CAAqB,OAAM,CAAN,EAAQ,CAAE;;AAC/B,MAAA,KAAK,GAAG,IAAR;AACH;;AACD,IAAA,QAAQ,GAAG,KAAX;AACA,IAAA,WAAW,GAAG,IAAI,UAAU,CAAC,cAAf,EAAd;AACA,QAAI,aAAJ,EACI,UAAU,CAAC,WAAD,CAAV,CAVK;;AAYT,IAAA,cAAc,GAAG,IAAI,OAAJ,CAAY,UAAA,OAAA,EAAO;AAChC,MAAA,cAAc,GAAG,OAAjB;AACH,KAFgB,CAAjB;AAGA,IAAA,aAAa,GAAG,IAAI,OAAJ,CAAY,UAAC,CAAD,EAAI,MAAJ,EAAU;AAClC,MAAA,UAAU,GAAG,MAAb;AACH,KAFe,CAAhB;AAGH,GAlBD;;AAoBA,OAAK,MAAL,GAAc,YAAA;AACV,QAAI,YAAY,GAAG,SAAS,CAAC,MAAV,GAAmB,CAAtC;AACA,WAAO,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB,MAAnB,EAAyB;AACxC,UAAI,YAAJ,EAAkB,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,sCAA/B,CAAN;;AAClB,UAAI,aAAJ,EAAmB;AACf,QAAA,cAAc,CAAC,IAAf,CAAoB,QAApB;AACH,OAFD,MAEO;AACH,QAAA,QAAQ;AACX;;AACD,eAAA,QAAA,GAAA;AACI,QAAA,EAAE,CAAC,KAAH;AACA,YAAI,GAAG,GAAG,SAAS,CAAC,cAAV,CAAyB,MAAzB,CAAV;AACA,QAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,YAAA;AACjB,cAAI,CAAC,yBAAL,EAAgC;AAC5B,YAAA,SAAS,CAAC,OAAV,CAAkB,MAAlB,CAAyB,MAAzB,EAAiC,KAAjC,CAAuC,GAAvC;AACH;;AACD,UAAA,OAAO;AACV,SALmB,CAApB;AAMA,QAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,QAAA,GAAG,CAAC,SAAJ,GAAgB,aAAhB;AACH;AACJ,KAnBM,CAAP;AAoBH,GAtBD;;AAwBA,OAAK,SAAL,GAAiB,YAAA;AACb,WAAO,KAAP;AACH,GAFD;;AAIA,OAAK,MAAL,GAAc,YAAA;AACV,WAAO,KAAK,KAAK,IAAjB;AACH,GAFD;;AAGA,OAAK,aAAL,GAAqB,YAAA;AACjB,WAAO,WAAW,IAAK,WAAW,YAAY,UAAU,CAAC,cAAzD;AACH,GAFD;;AAGA,OAAK,SAAL,GAAiB,YAAA;AACb,WAAO,WAAW,KAAK,IAAvB;AACH,GAFD;;AAGA,OAAK,iBAAL,GAAyB,YAAA;AACrB,WAAO,UAAP;AACH,GAFD,CAvjByC;;;;;AA8jBzC,OAAK,IAAL,GAAY,MAAZ,CA9jByC;;AAikBzC,EAAA,KAAK,CAAC,IAAD,EAAO;AACR,IAAA,MAAM,EAAE;AACJ,MAAA,GAAG,EAAA,YAAA;;AAEC,eAAO,IAAI,CAAC,SAAD,CAAJ,CAAgB,GAAhB,CAAoB,UAAU,IAAV,EAAc;AAAI,iBAAO,SAAS,CAAC,IAAD,CAAhB;AAAyB,SAA/D,CAAP;AACH;AAJG;AADA,GAAP,CAAL,CAjkByC;;;;AA6kBzC,OAAK,EAAL,GAAU,MAAM,CAAC,IAAD,EAAO,UAAP,EAAmB,SAAnB,EAA8B,eAA9B,EAA+C;AAAC,IAAA,KAAK,EAAE,CAAC,eAAD,EAAkB,GAAlB;AAAR,GAA/C,CAAhB;AAEA,OAAK,EAAL,CAAQ,KAAR,CAAc,SAAd,GAA0B,QAAQ,CAAE,KAAK,EAAL,CAAQ,KAAR,CAAc,SAAhB,EAA2B,UAAU,SAAV,EAAmB;AAC5E,WAAO,UAAC,UAAD,EAAa,OAAb,EAAoB;AACvB,MAAA,KAAK,CAAC,GAAN,CAAU,YAAA;AACN,YAAI,YAAJ,EAAkB;;AAEd,cAAI,CAAC,WAAL,EAAkB,OAAO,CAAC,OAAR,GAAkB,IAAlB,CAAuB,UAAvB,EAFJ;;AAId,cAAI,OAAJ,EAAa,SAAS,CAAC,UAAD,CAAT;AAChB,SALD,MAKO,IAAI,iBAAJ,EAAuB;;AAE1B,UAAA,iBAAiB,CAAC,IAAlB,CAAuB,UAAvB;AACA,cAAI,OAAJ,EAAa,SAAS,CAAC,UAAD,CAAT;AAChB,SAJM,MAIA;;AAEH,UAAA,SAAS,CAAC,UAAD,CAAT,CAFG;;AAIH,cAAI,CAAC,OAAL,EAAc,SAAS,CAAC,SAAA,WAAA,GAAA;AACpB,YAAA,EAAE,CAAC,EAAH,CAAM,KAAN,CAAY,WAAZ,CAAwB,UAAxB;AACA,YAAA,EAAE,CAAC,EAAH,CAAM,KAAN,CAAY,WAAZ,CAAwB,WAAxB;AACH,WAHsB,CAAT;AAIjB;AACJ,OAnBD;AAoBH,KArBD;AAsBH,GAvBiC,CAAlC;;AAyBA,OAAK,WAAL,GAAmB,YAAA;;;;;;;AAQf,QAAI,IAAI,GAAG,sBAAsB,CAAC,KAAvB,CAA6B,IAA7B,EAAmC,SAAnC,CAAX;AACA,WAAO,KAAK,YAAL,CAAkB,KAAlB,CAAwB,IAAxB,EAA8B,IAA9B,CAAP;AACH,GAVD;;AAYA,WAAA,sBAAA,CAAiC,IAAjC,EAAuC,WAAvC,EAAoD,SAApD,EAA6D;;AAEzD,QAAI,CAAC,GAAG,SAAS,CAAC,MAAlB;AACA,QAAI,CAAC,GAAG,CAAR,EAAW,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,mBAA/B,CAAN,CAH8C;;;AAMzD,QAAI,IAAI,GAAG,IAAI,KAAJ,CAAU,CAAC,GAAG,CAAd,CAAX;;AACA,WAAO,EAAE,CAAT;AAAY,MAAA,IAAI,CAAC,CAAC,GAAC,CAAH,CAAJ,GAAY,SAAS,CAAC,CAAD,CAArB;AAAZ,KAPyD;;;AASzD,IAAA,SAAS,GAAG,IAAI,CAAC,GAAL,EAAZ;AACA,QAAI,MAAM,GAAG,OAAO,CAAC,IAAD,CAApB,CAVyD,CAU9B;;AAC3B,WAAO,CAAC,IAAD,EAAO,MAAP,EAAe,SAAf,CAAP;AACH;;AAED,OAAK,YAAL,GAAoB,UAAU,IAAV,EAAgB,MAAhB,EAAwB,SAAxB,EAAiC;AACjD,QAAI,iBAAiB,GAAG,GAAG,CAAC,KAA5B,CADiD;;AAGjD,QAAI,CAAC,iBAAD,IAAsB,iBAAiB,CAAC,EAAlB,KAAyB,EAA/C,IAAqD,IAAI,CAAC,OAAL,CAAa,GAAb,MAAsB,CAAC,CAAhF,EAAmF,iBAAiB,GAAG,IAApB;AACnF,QAAI,gBAAgB,GAAG,IAAI,CAAC,OAAL,CAAa,GAAb,MAAsB,CAAC,CAA9C;AACA,IAAA,IAAI,GAAG,IAAI,CAAC,OAAL,CAAa,GAAb,EAAkB,EAAlB,EAAsB,OAAtB,CAA8B,GAA9B,EAAmC,EAAnC,CAAP,CALiD,CAKH;;AAE9C,QAAI;;;;AAIA,UAAI,UAAU,GAAG,MAAM,CAAC,GAAP,CAAW,UAAA,KAAA,EAAK;AAC7B,YAAI,SAAS,GAAG,KAAK,YAAY,KAAjB,GAAyB,KAAK,CAAC,IAA/B,GAAsC,KAAtD;AACA,YAAI,OAAO,SAAP,KAAqB,QAAzB,EAAmC,MAAM,IAAI,SAAJ,CAAc,iFAAd,CAAN;AACnC,eAAO,SAAP;AACH,OAJgB,CAAjB,CAJA;;;;AAaA,UAAI,IAAI,IAAI,GAAR,IAAe,IAAI,IAAI,QAA3B,EACI,IAAI,GAAG,QAAP,CADJ,KAEK,IAAI,IAAI,IAAI,IAAR,IAAgB,IAAI,IAAI,SAA5B,EACD,IAAI,GAAG,SAAP,CADC,KAGD,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,+BAA+B,IAA9D,CAAN;;AAEJ,UAAI,iBAAJ,EAAuB;;AAEnB,YAAI,iBAAiB,CAAC,IAAlB,KAA2B,QAA3B,IAAuC,IAAI,KAAK,SAApD,EAA+D;AAC3D,cAAI,gBAAJ,EAAsB;;AAElB,YAAA,iBAAiB,GAAG,IAApB;AACH,WAHD,MAIK,MAAM,IAAI,UAAU,CAAC,cAAf,CAA8B,wFAA9B,CAAN;AACR;;AACD,YAAI,iBAAJ,EAAuB;AACnB,UAAA,UAAU,CAAC,OAAX,CAAmB,UAAU,SAAV,EAAmB;AAClC,gBAAI,iBAAiB,IAAI,iBAAiB,CAAC,UAAlB,CAA6B,OAA7B,CAAqC,SAArC,MAAoD,CAAC,CAA9E,EAAiF;AAC7E,kBAAI,gBAAJ,EAAsB;;AAElB,gBAAA,iBAAiB,GAAG,IAApB;AACH,eAHD,MAIK,MAAM,IAAI,UAAU,CAAC,cAAf,CAA8B,WAAW,SAAX,GACrC,sCADO,CAAN;AAER;AACJ,WATD;AAUH;;AACD,YAAI,gBAAgB,IAAI,iBAApB,IAAyC,CAAC,iBAAiB,CAAC,MAAhE,EAAwE;;AAEpE,UAAA,iBAAiB,GAAG,IAApB;AACH;AACJ;AACJ,KA9CD,CA8CE,OAAO,CAAP,EAAU;AACR,aAAO,iBAAiB,GACpB,iBAAiB,CAAC,QAAlB,CAA2B,IAA3B,EAAiC,UAAC,CAAD,EAAI,MAAJ,EAAU;AAAM,QAAA,MAAM,CAAC,CAAD,CAAN;AAAW,OAA5D,CADoB,GAEpB,SAAS,CAAE,CAAF,CAFb;AAGH,KAzDgD;;;AA2DjD,WAAQ,iBAAiB,GACrB,iBAAiB,CAAC,QAAlB,CAA2B,IAA3B,EAAiC,qBAAjC,EAAwD,MAAxD,CADqB,GAErB,GAAG,CAAC,KAAJ;;;AAII,IAAA,MAAM,CAAC,GAAG,CAAC,SAAL,EAAgB,YAAA;AAAI,aAAA,EAAE,CAAC,UAAH,CAAc,qBAAd,CAAA;AAAoC,KAAxD,CAJV,GAKI,EAAE,CAAC,UAAH,CAAe,qBAAf,CAPR;;AASA,aAAA,qBAAA,GAAA;AACI,aAAO,OAAO,CAAC,OAAR,GAAkB,IAAlB,CAAuB,YAAA;;AAE1B,YAAI,SAAS,GAAG,GAAG,CAAC,SAAJ,IAAiB,GAAjC,CAF0B;;;AAK1B,YAAI,KAAK,GAAG,EAAE,CAAC,kBAAH,CAAsB,IAAtB,EAA4B,UAA5B,EAAwC,YAAxC,EAAsD,iBAAtD,CAAZ,CAL0B;;;AAO1B,YAAI,SAAS,GAAG;AACZ,UAAA,KAAK,EAAE,KADK;AAEZ,UAAA,SAAS,EAAE;AAFC,SAAhB;;AAKA,YAAI,iBAAJ,EAAuB;;AAEnB,UAAA,KAAK,CAAC,QAAN,GAAiB,iBAAiB,CAAC,QAAnC;AACH,SAHD,MAGO;AACH,UAAA,KAAK,CAAC,MAAN,GADG,CACY;AAClB,SAjByB;;;AAoB1B,YAAI,SAAS,CAAC,WAAV,KAA0B,aAA9B,EAA6C;AACzC,UAAA,uBAAuB;AAC1B;;AAED,YAAI,WAAJ;AACA,YAAI,eAAe,GAAG,OAAO,CAAC,MAAR,CAAe,YAAA;;AAEjC,UAAA,WAAW,GAAG,SAAS,CAAC,IAAV,CAAe,KAAf,EAAsB,KAAtB,CAAd;;AACA,cAAI,WAAJ,EAAiB;AACb,gBAAI,WAAW,CAAC,WAAZ,KAA4B,aAAhC,EAA+C;AAC3C,kBAAI,WAAW,GAAG,uBAAuB,CAAC,IAAxB,CAA6B,IAA7B,EAAmC,IAAnC,CAAlB;AACA,cAAA,WAAW,CAAC,IAAZ,CAAiB,WAAjB,EAA8B,WAA9B;AACH,aAHD,MAGO,IAAI,OAAO,WAAW,CAAC,IAAnB,KAA4B,UAA5B,IAA0C,OAAO,WAAW,CAAC,KAAnB,KAA6B,UAA3E,EAAuF;;AAE1F,cAAA,WAAW,GAAG,aAAa,CAAC,WAAD,CAA3B;AACH;AACJ;AACJ,SAZqB,EAYnB,SAZmB,CAAtB;AAaA,eAAO,CAAC,WAAW,IAAI,OAAO,WAAW,CAAC,IAAnB,KAA4B,UAA3C;AAEJ,QAAA,OAAO,CAAC,OAAR,CAAgB,WAAhB,EAA6B,IAA7B,CAAkC,UAAA,CAAA,EAAC;AAAI,iBAAA,KAAK,CAAC,MAAN,GACnC,CADmC,CAClC;AADkC,YAEjC,SAAS,CAAC,IAAI,UAAU,CAAC,eAAf,CACR,4DADQ,CAAD,CAFwB;AAG+B,SAHtE,CAFI;AAAA,UAOF,eAAe,CAAC,IAAhB,CAAqB,YAAA;AAAI,iBAAA,WAAA;AAAW,SAApC,CAPC,EAQL,IARK,CAQA,UAAA,CAAA,EAAC;;AAEJ,cAAI,iBAAJ,EAAuB,KAAK,CAAC,QAAN,GAFnB;;;AAKJ,iBAAO,KAAK,CAAC,WAAN,CAAkB,IAAlB,CAAuB,YAAA;AAAI,mBAAA,CAAA;AAAC,WAA5B,CAAP;AACH,SAdM,EAcJ,KAdI,CAcG,UAAA,CAAA,EAAC;AACP,UAAA,KAAK,CAAC,OAAN,CAAc,CAAd,EADO,CACU;;;AACjB,iBAAO,SAAS,CAAC,CAAD,CAAhB;AACH,SAjBM,CAAP;AAkBH,OAxDM,CAAP;AAyDH;AACJ,GA/HD;;AAiIA,OAAK,KAAL,GAAa,UAAU,SAAV,EAAmB;;AAE5B,QAAI,CAAC,MAAM,CAAC,SAAD,EAAY,SAAZ,CAAX,EAAmC;AAAE,YAAM,IAAI,UAAU,CAAC,YAAf,CAA4B,WAAS,SAAT,GAAkB,iBAA9C,CAAN;AAAyE;;AAC9G,WAAO,SAAS,CAAC,SAAD,CAAhB;AACH,GAJD,CAnwByC;;;;;;;;;AAgxBzC,WAAA,KAAA,CAAe,IAAf,EAAqB,WAArB,EAAkC,aAAlC,EAA+C;;AAE3C,SAAK,IAAL,GAAY,IAAZ;AACA,SAAK,MAAL,GAAc,WAAd;AACA,SAAK,GAAL,GAAW,aAAX;AACA,SAAK,IAAL,GAAY,SAAS,CAAC,IAAD,CAAT,GAAkB,SAAS,CAAC,IAAD,CAAT,CAAgB,IAAlC,GAAyC,MAAM,CAAC,IAAD,EAAO;AAC9D,kBAAY,CAAC,iBAAD,EAAoB,GAApB,CADkD;AAE9D,iBAAW,CAAC,iBAAD,EAAoB,MAApB,CAFmD;AAG9D,kBAAY,CAAC,iBAAD,EAAoB,GAApB,CAHkD;AAI9D,kBAAY,CAAC,iBAAD,EAAoB,GAApB;AAJkD,KAAP,CAA3D;AAMH;;AAED,WAAA,wBAAA,CAAkC,SAAlC,EAA6C,IAA7C,EAAmD,YAAnD,EAA+D;AAC3D,WAAO,CAAC,YAAY,GAAG,wBAAH,GAA8B,kBAA3C,EAA+D,UAAA,CAAA,EAAC;AACnE,MAAA,SAAS,CAAC,IAAV,CAAe,CAAf;AACA,MAAA,IAAI,IAAI,IAAI,EAAZ;AACH,KAHM,CAAP;AAIH;;AAED,WAAA,UAAA,CAAoB,QAApB,EAA8B,KAA9B,EAAqC,YAArC,EAAmD,aAAnD,EAAkE,YAAlE,EAA8E;;;AAG1E,WAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC/B,UAAI,GAAG,GAAG,YAAY,CAAC,MAAvB;AAAA,UACI,QAAQ,GAAG,GAAG,GAAG,CADrB;AAEA,UAAI,GAAG,KAAK,CAAZ,EAAe,OAAO,OAAO,EAAd;;AACf,UAAI,CAAC,aAAL,EAAoB;AAChB,aAAK,IAAI,CAAC,GAAC,CAAX,EAAc,CAAC,GAAG,GAAlB,EAAuB,EAAE,CAAzB,EAA4B;AACxB,cAAI,GAAG,GAAG,QAAQ,CAAC,MAAT,CAAgB,YAAY,CAAC,CAAD,CAA5B,CAAV;AACA,UAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,cAAI,CAAC,KAAK,QAAV,EAAoB,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,YAAA;AAAI,mBAAA,OAAO,EAAP;AAAS,WAAd,CAApB;AACvB;AACJ,OAND,MAMO;AACH,YAAI,OAAJ;AAAA,YACI,YAAY,GAAG,wBAAwB,CAAC,MAAD,CAD3C;AAAA,YAEI,cAAc,GAAG,yBAAyB,CAAC,IAAD,CAF9C;AAGA,QAAA,QAAQ,CAAC,YAAA;AACL,eAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAApB,EAAyB,EAAE,CAA3B,EAA8B;AAC1B,YAAA,OAAO,GAAG;AAAC,cAAA,SAAS,EAAE,IAAZ;AAAkB,cAAA,OAAO,EAAE;AAA3B,aAAV;AACA,gBAAI,KAAK,GAAG,YAAY,CAAC,CAAD,CAAxB;AACA,YAAA,YAAY,CAAC,IAAb,CAAkB,OAAlB,EAA2B,KAAK,CAAC,CAAD,CAAhC,EAAqC,KAAK,CAAC,CAAD,CAA1C,EAA+C,KAA/C;AACA,gBAAI,GAAG,GAAG,QAAQ,CAAC,MAAT,CAAgB,KAAK,CAAC,CAAD,CAArB,CAAV;AACA,YAAA,GAAG,CAAC,QAAJ,GAAe,OAAf;AACA,YAAA,GAAG,CAAC,OAAJ,GAAc,YAAd;AACA,gBAAI,CAAC,KAAK,QAAV,EACI,GAAG,CAAC,SAAJ,GAAgB,yBAAyB,CAAC,OAAD,CAAzC,CADJ,KAGI,GAAG,CAAC,SAAJ,GAAgB,cAAhB;AACP;AACJ,SAbO,EAaL,UAAA,GAAA,EAAG;AACF,UAAA,OAAO,CAAC,OAAR,IAAmB,OAAO,CAAC,OAAR,CAAgB,GAAhB,CAAnB;AACA,gBAAM,GAAN;AACH,SAhBO,CAAR;AAiBH;AACJ,KAhCM,CAAP;AAiCH;;AAED,EAAA,KAAK,CAAC,KAAK,CAAC,SAAP,EAAkB;;;;AAMnB,IAAA,MAAM,EAAE,SAAA,cAAA,CAAwB,IAAxB,EAA8B,EAA9B,EAAkC,WAAlC,EAA6C;AACjD,UAAI,KAAK,GAAG,KAAK,GAAL,IAAY,GAAG,CAAC,KAA5B;AACA,aAAO,KAAK,IAAI,KAAK,CAAC,EAAN,KAAa,EAAtB,GACH,KAAK,KAAK,GAAG,CAAC,KAAd,GACI,KAAK,CAAC,QAAN,CAAgB,IAAhB,EAAsB,EAAtB,EAA0B,WAA1B,CADJ,GAEI,QAAQ,CAAC,YAAA;AAAI,eAAA,KAAK,CAAC,QAAN,CAAe,IAAf,EAAqB,EAArB,EAAyB,WAAzB,CAAA;AAAqC,OAA1C,EAA4C;AAAC,QAAA,KAAK,EAAE,KAAR;AAAe,QAAA,SAAS,EAAE,GAAG,CAAC,SAAJ,IAAiB;AAA3C,OAA5C,CAHT,GAIH,eAAe,CAAE,IAAF,EAAQ,CAAC,KAAK,IAAN,CAAR,EAAqB,EAArB,CAJnB;AAKH,KAbkB;AAcnB,IAAA,SAAS,EAAE,SAAA,iBAAA,CAA2B,IAA3B,EAAiC,EAAjC,EAAqC,WAArC,EAAgD;AACvD,UAAI,SAAS,GAAG,KAAK,IAArB;;AACA,eAAA,cAAA,CAAyB,OAAzB,EAAkC,MAAlC,EAA0C,KAA1C,EAA+C;AAC3C,YAAI,KAAK,CAAC,UAAN,CAAiB,OAAjB,CAAyB,SAAzB,MAAwC,CAAC,CAA7C,EACI,MAAM,IAAI,UAAU,CAAC,QAAf,CAAwB,UAAU,SAAV,GAAsB,0BAA9C,CAAN;AACJ,eAAO,EAAE,CAAC,OAAD,EAAU,MAAV,EAAkB,KAAK,CAAC,QAAN,CAAe,WAAf,CAA2B,SAA3B,CAAlB,EAAyD,KAAzD,CAAT;AACH;;AACD,aAAO,KAAK,MAAL,CAAY,IAAZ,EAAkB,cAAlB,EAAkC,WAAlC,CAAP;AACH,KAtBkB;;;;AA2BnB,IAAA,GAAG,EAAE,UAAU,SAAV,EAAqB,EAArB,EAAuB;AACxB,UAAI,SAAS,IAAI,SAAS,CAAC,WAAV,KAA0B,MAA3C,EACI,OAAO,KAAK,KAAL,CAAW,SAAX,EAAsB,KAAtB,CAA4B,EAA5B,CAAP;AACJ,UAAI,IAAI,GAAG,IAAX;AACA,aAAO,KAAK,SAAL,CAAe,QAAf,EAAyB,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AAC/D,YAAI,GAAG,GAAG,QAAQ,CAAC,GAAT,CAAa,SAAb,CAAV;AACA,QAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,QAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,YAAA;AACjB,UAAA,OAAO,CAAC,IAAI,CAAC,IAAL,CAAU,OAAV,CAAkB,IAAlB,CAAuB,GAAG,CAAC,MAA3B,CAAD,CAAP;AACH,SAFmB,EAEjB,MAFiB,CAApB;AAGH,OANM,EAMJ,IANI,CAMC,EAND,CAAP;AAOH,KAtCkB;AAuCnB,IAAA,KAAK,EAAE,UAAU,WAAV,EAAqB;AACxB,UAAI,OAAO,WAAP,KAAuB,QAA3B,EACI,OAAO,IAAI,WAAJ,CAAgB,IAAhB,EAAsB,WAAtB,CAAP;AACJ,UAAI,OAAO,CAAC,WAAD,CAAX,EACI,OAAO,IAAI,WAAJ,CAAgB,IAAhB,EAAsB,MAAI,WAAW,CAAC,IAAZ,CAAiB,GAAjB,CAAJ,GAAyB,GAA/C,CAAP,CAJoB;;AAMxB,UAAI,QAAQ,GAAG,IAAI,CAAC,WAAD,CAAnB;AACA,UAAI,QAAQ,CAAC,MAAT,KAAoB,CAAxB;AAEI,eAAO,KACF,KADE,CACI,QAAQ,CAAC,CAAD,CADZ,EAEF,MAFE,CAEK,WAAW,CAAC,QAAQ,CAAC,CAAD,CAAT,CAFhB,CAAP,CAToB;;;;AAgBxB,UAAI,aAAa,GAAG,KAAK,MAAL,CAAY,OAAZ,CAAoB,MAApB,CAA2B,KAAK,MAAL,CAAY,OAAvC,EAAgD,MAAhD,CAAuD,UAAA,EAAA,EAAE;AACzE,eAAA,EAAE,CAAC,QAAH,IACA,QAAQ,CAAC,KAAT,CAAe,UAAA,OAAA,EAAO;AAAI,iBAAA,EAAE,CAAC,OAAH,CAAW,OAAX,CAAmB,OAAnB,KAA+B,CAA/B;AAAgC,SAA1D,CADA,IAEA,EAAE,CAAC,OAAH,CAAW,KAAX,CAAiB,UAAA,OAAA,EAAO;AAAI,iBAAA,QAAQ,CAAC,OAAT,CAAiB,OAAjB,KAA6B,CAA7B;AAA8B,SAA1D,CAFA;AAE2D,OAH3C,EAG6C,CAH7C,CAApB;AAKA,UAAI,aAAa,IAAI,MAAM,KAAK,SAAhC;;AAGI,eAAO,KACF,KADE,CACI,aAAa,CAAC,IADlB,EAEF,MAFE,CAEK,aAAa,CAAC,OAAd,CAAsB,GAAtB,CAA0B,UAAA,EAAA,EAAE;AAAI,iBAAA,WAAW,CAAC,EAAD,CAAX;AAAe,SAA/C,CAFL,CAAP;AAIJ,UAAI,CAAC,aAAL,EAAoB,OAAO,CAAC,IAAR,CAChB,eAAa,IAAI,CAAC,SAAL,CAAe,WAAf,CAAb,GAAwC,MAAxC,GAA+C,KAAK,IAApD,GAAwD,sBAAxD,IACA,qBAAmB,QAAQ,CAAC,IAAT,CAAc,GAAd,CAAnB,GAAqC,GADrC,CADgB,EA5BI;;;AAkCxB,UAAI,SAAS,GAAG,KAAK,MAAL,CAAY,SAA5B;AACA,UAAI,WAAW,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAC,CAAD,EAAG,OAAH,EAAU;AAAG,eAAA,CAC3C,CAAC,CAAC,CAAD,CAAD,IAAQ,SAAS,CAAC,OAAD,CAD0B,EAE3C,CAAC,CAAC,CAAD,CAAD,IAAQ,CAAC,SAAS,CAAC,OAAD,CAAlB,GACI,OAAO,CACH,CAAC,CAAC,CAAD,CADE,EAEH,UAAA,CAAA,EAAC;AAAG,iBAAA,KAAG,YAAY,CAAC,CAAD,EAAI,OAAJ,CAAf,IACA,KAAG,WAAW,CAAC,OAAD,CADd;AACuB,SAHxB,CADX,GAKM,CAAC,CAAC,CAAD,CAPoC,CAAA;AAQ1C,OARa,EAQX,CAAC,IAAD,EAAO,IAAP,CARW,CAAlB;AAUA,UAAI,GAAG,GAAG,WAAW,CAAC,CAAD,CAArB;AACA,aAAO,GAAG,GACN,KAAK,KAAL,CAAW,GAAG,CAAC,IAAf,EAAqB,MAArB,CAA4B,WAAW,CAAC,GAAG,CAAC,OAAL,CAAvC,EACK,MADL,CACY,WAAW,CAAC,CAAD,CADvB,CADM,GAGN,aAAa,GACT,KAAK,MAAL,CAAY,WAAW,CAAC,CAAD,CAAvB,CADS,GACkB;AAC3B,WAAK,KAAL,CAAW,QAAX,EAAqB,MAArB,CAA4B,EAA5B,CALR,CA9CwB,CAmDgB;AAC3C,KA3FkB;AA4FnB,IAAA,KAAK,EAAE,UAAU,EAAV,EAAY;AACf,aAAO,KAAK,YAAL,GAAoB,KAApB,CAA0B,EAA1B,CAAP;AACH,KA9FkB;AA+FnB,IAAA,MAAM,EAAE,UAAU,MAAV,EAAgB;AACpB,aAAO,KAAK,YAAL,GAAoB,MAApB,CAA2B,MAA3B,CAAP;AACH,KAjGkB;AAkGnB,IAAA,KAAK,EAAE,UAAU,OAAV,EAAiB;AACpB,aAAO,KAAK,YAAL,GAAoB,KAApB,CAA0B,OAA1B,CAAP;AACH,KApGkB;AAqGnB,IAAA,OAAO,EAAE,YAAA;AACL,aAAO,KAAK,YAAL,GAAoB,OAApB,EAAP;AACH,KAvGkB;AAwGnB,IAAA,MAAM,EAAE,UAAU,cAAV,EAAwB;AAC5B,aAAO,KAAK,YAAL,GAAoB,GAApB,CAAwB,cAAxB,CAAP;AACH,KA1GkB;AA2GnB,IAAA,IAAI,EAAE,UAAU,EAAV,EAAY;AACd,aAAO,KAAK,YAAL,GAAoB,IAApB,CAAyB,EAAzB,CAAP;AACH,KA7GkB;AA8GnB,IAAA,OAAO,EAAE,UAAU,EAAV,EAAY;AACjB,aAAO,KAAK,YAAL,GAAoB,OAApB,CAA4B,EAA5B,CAAP;AACH,KAhHkB;AAiHnB,IAAA,OAAO,EAAE,UAAU,KAAV,EAAe;AACpB,aAAO,IAAI,UAAJ,CACH,IAAI,WAAJ,CAAgB,IAAhB,EAAsB,OAAO,CAAC,KAAD,CAAP,GAClB,MAAI,KAAK,CAAC,IAAN,CAAW,GAAX,CAAJ,GAAmB,GADD,GAElB,KAFJ,CADG,CAAP;AAIH,KAtHkB;AAwHnB,IAAA,YAAY,EAAE,YAAA;AACV,aAAO,IAAI,UAAJ,CAAe,IAAI,WAAJ,CAAgB,IAAhB,CAAf,CAAP;AACH,KA1HkB;AA4HnB,IAAA,UAAU,EAAE,UAAU,WAAV,EAAuB,SAAvB,EAAgC;;;;;;;;AAQxC,WAAK,MAAL,CAAY,WAAZ,GAA0B,WAA1B;AACA,UAAI,gBAAgB,GAAG,MAAM,CAAC,MAAP,CAAc,WAAW,CAAC,SAA1B,CAAvB;;AACA,UAAI,SAAJ,EAAe;;AAEX,QAAA,cAAc,CAAC,gBAAD,EAAmB,SAAnB,CAAd;AACH;;AACD,WAAK,MAAL,CAAY,gBAAZ,GAA+B,gBAA/B,CAdwC;;;AAkBxC,UAAI,QAAQ,GAAG,UAAU,GAAV,EAAa;AACxB,YAAI,CAAC,GAAL,EAAU,OAAO,GAAP,CADc,CACH;;;AAErB,YAAI,GAAG,GAAG,MAAM,CAAC,MAAP,CAAc,WAAW,CAAC,SAA1B,CAAV,CAHwB;;AAKxB,aAAK,IAAI,CAAT,IAAc,GAAd;AAAmB,cAAI,MAAM,CAAC,GAAD,EAAM,CAAN,CAAV,EAAoB,IAAI;AAAC,YAAA,GAAG,CAAC,CAAD,CAAH,GAAS,GAAG,CAAC,CAAD,CAAZ;AAAiB,WAAtB,CAAuB,OAAM,CAAN,EAAQ,CAAE;AAAxE;;AACA,eAAO,GAAP;AACH,OAPD;;AASA,UAAI,KAAK,MAAL,CAAY,QAAhB,EAA0B;AACtB,aAAK,IAAL,CAAU,OAAV,CAAkB,WAAlB,CAA8B,KAAK,MAAL,CAAY,QAA1C;AACH;;AACD,WAAK,MAAL,CAAY,QAAZ,GAAuB,QAAvB;AACA,WAAK,IAAL,CAAU,SAAV,EAAqB,QAArB;AACA,aAAO,WAAP;AACH,KA7JkB;AA8JnB,IAAA,WAAW,EAAE,UAAU,SAAV,EAAmB;;;;;;;AAO5B,aAAO,KAAK,UAAL,CAAgB,KAAK,CAAC,WAAN,CAAkB,SAAlB,CAAhB,EAA8C,SAA9C,CAAP;AACH,KAtKkB;AAwKnB,IAAA,UAAU,EAAE,UAAUE,OAAV,EAAc;AACtB,UAAI,KAAK,IAAL,CAAU,QAAV,CAAmB,IAAnB,KAA4B,GAAhC,EAAqC;AACjC,eAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAC,OAAD,EAAU,MAAV,EAAkB,QAAlB,EAA4B,KAA5B,EAAiC;AAC9D,UAAA,OAAO,CAAE,UAAU,CAAC,QAAD,EAAW,KAAX,EAAkBA,OAAlB,EAAwB,KAAxB,EAA+B,GAA/B,CAAZ,CAAP;AACH,SAFM,CAAP;AAGH,OAJD,MAIO;AACH,eAAO,KACF,KADE,CACI,KADJ,EAEF,KAFE,CAEIA,OAFJ,EAGF,MAHE,GAIF,IAJE,CAIG,YAAA,CAAM,CAJT,CAAP,CADG,CAKe;AACrB;AACJ,KApLkB;AAqLnB,IAAA,OAAO,EAAE,UAAS,OAAT,EAAkBA,OAAlB,EAAsB;AAAtB,UAAA,KAAA,GAAA,IAAA;;AACL,aAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAC,OAAD,EAAU,MAAV,EAAkB,QAAlB,EAA0B;AACvD,YAAI,CAAC,QAAQ,CAAC,OAAV,IAAqB,CAAC,KAAI,CAAC,MAAL,CAAY,OAAZ,CAAoB,IAA1C,IAAkD,CAACA,OAAvD,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,wEAA/B,CAAN;AACJ,YAAI,QAAQ,CAAC,OAAT,IAAoBA,OAAxB,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,8DAA/B,CAAN;AACJ,YAAIA,OAAI,IAAIA,OAAI,CAAC,MAALA,KAAgB,OAAO,CAAC,MAApC,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,sDAA/B,CAAN;AACJ,YAAI,OAAO,CAAC,MAAR,KAAmB,CAAvB,EAA0B,OAAO,OAAO,EAAd,CAP6B,CAOZ;;AAC3C,YAAM,IAAI,GAAG,UAAA,MAAA,EAAM;AACf,cAAI,SAAS,CAAC,MAAV,KAAqB,CAAzB,EAA4B,OAAO,CAAC,MAAD,CAAP,CAA5B,KACK,MAAM,CAAC,IAAI,SAAJ,CAAiB,KAAI,CAAC,IAAL,GAAS,cAAT,GAAwB,SAAS,CAAC,MAAlC,GAAwC,MAAxC,GAA+C,OAA/C,GAAsD,oBAAvE,EAA6F,SAA7F,CAAD,CAAN;AACR,SAHD;;AAIA,YAAI,GAAJ;AAAA,YACI,SAAS,GAAG,EADhB;AAAA,YAEI,YAFJ;AAAA,YAGI,OAAO,GAAG,OAAO,CAAC,MAHtB;AAAA,YAII,KAAK,GAAG,KAJZ;;AAKA,YAAI,KAAI,CAAC,IAAL,CAAU,QAAV,CAAmB,IAAnB,KAA4B,GAA5B,IAAmC,KAAI,CAAC,IAAL,CAAU,QAAV,CAAmB,IAAnB,KAA4B,GAAnE,EAAwE;;;;AAIpE,UAAA,YAAY,GAAG,wBAAwB,CAAC,SAAD,CAAvC;;AACA,eAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,OAAO,CAAC,MAA5B,EAAoC,CAAC,GAAG,CAAxC,EAA2C,EAAE,CAA7C,EAAgD;AAC5C,YAAA,GAAG,GAAGA,OAAI,GAAG,QAAQ,CAAC,GAAT,CAAa,OAAO,CAAC,CAAD,CAApB,EAAyBA,OAAI,CAAC,CAAD,CAA7B,CAAH,GAAuC,QAAQ,CAAC,GAAT,CAAa,OAAO,CAAC,CAAD,CAApB,CAAjD;AACA,YAAA,GAAG,CAAC,OAAJ,GAAc,YAAd;AACH,WARmE;;;;AAWpE,UAAA,GAAG,CAAC,OAAJ,GAAc,wBAAwB,CAAC,SAAD,EAAY,IAAZ,CAAtC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,mBAAmB,CAAC,IAAD,CAAnC;AACH,SAbD,MAaO;AACH,cAAI,aAAa,GAAGA,OAAI,IAAI,QAAQ,CAAC,OAAT,IAAoB,OAAO,CAAC,GAAR,CAAY,UAAA,CAAA,EAAC;AAAE,mBAAA,YAAY,CAAC,CAAD,EAAI,QAAQ,CAAC,OAAb,CAAZ;AAAiC,WAAhD,CAAhD,CADG;;AAGH,cAAI,YAAY,GAAG,aAAa,IAAI,aAAa,CAAC,aAAD,EAAgB,UAAC,GAAD,EAAM,CAAN,EAAO;AAAK,mBAAA,GAAG,IAAI,IAAP,IAAe,CAAC,GAAD,EAAM,OAAO,CAAC,CAAD,CAAb,CAAf;AAAgC,WAA5D,CAAjD;AACA,cAAI,OAAO,GAAG,CAAC,aAAD;AAGV,UAAA,KAAK,CAAC,OAAN,CAAc,OAAd,CAHU;;AAOV,UAAA,KAAK,CAAC,KAAN,CAAY,KAAZ,EAAmB,KAAnB,CAAyB,aAAa,CAAC,MAAd,CAAqB,UAAA,GAAA,EAAG;AAAI,mBAAA,GAAG,IAAI,IAAP;AAAW,WAAvC,CAAzB,EAAmE,MAAnE,CAA0E,YAAA;AACtE,iBAAK,KAAL,GAAa,YAAY,CAAC,KAAK,OAAN,CAAzB;AACA,YAAA,YAAY,CAAC,KAAK,OAAN,CAAZ,GAA6B,IAA7B,CAFsE,CAEpC;AACrC,WAHD,EAGG,KAHH,CAGS,WAHT,EAGsB,UAAA,CAAA,EAAC;AACnB,YAAA,SAAS,GAAG,CAAC,CAAC,QAAd,CADmB,CACI;AAC1B,WALD,EAKG,IALH,CAKQ,YAAA;;AAEJ,gBAAI,SAAS,GAAG,EAAhB;AAAA,gBACI,SAAS,GAAGA,OAAI,IAAI,EADxB,CAFI;;AAKJ,iBAAK,IAAI,CAAC,GAAC,aAAa,CAAC,MAAd,GAAqB,CAAhC,EAAmC,CAAC,IAAE,CAAtC,EAAyC,EAAE,CAA3C,EAA8C;AAC1C,kBAAI,GAAG,GAAG,aAAa,CAAC,CAAD,CAAvB;;AACA,kBAAI,GAAG,IAAI,IAAP,IAAe,YAAY,CAAC,GAAD,CAA/B,EAAsC;AAClC,gBAAA,SAAS,CAAC,IAAV,CAAe,OAAO,CAAC,CAAD,CAAtB;AACAA,gBAAAA,OAAI,IAAI,SAAS,CAAC,IAAV,CAAe,GAAf,CAARA;AACA,oBAAI,GAAG,IAAI,IAAX,EAAiB,YAAY,CAAC,GAAD,CAAZ,GAAoB,IAApB,CAHiB,CAGQ;AAC7C;AACJ,aAZG;;;;;;AAiBJ,YAAA,SAAS,CAAC,OAAV;AACAA,YAAAA,OAAI,IAAI,SAAS,CAAC,OAAV,EAARA;AACA,mBAAO,KAAK,CAAC,OAAN,CAAc,SAAd,EAAyB,SAAzB,CAAP;AACH,WAzBD,EAyBG,IAzBH,CAyBQ,UAAA,YAAA,EAAY;;AAEhB,gBAAI,gBAAgB,GAAG,aAAa,CAAC,aAAa,CAAC,MAAd,GAAuB,CAAxB,CAApC,CAFgB,CAE+C;;AAC/D,mBAAO,gBAAgB,IAAI,IAApB,GAA2B,gBAA3B,GAA8C,YAArD;AACH,WA7BD,CAPJ;AAsCA,UAAA,OAAO,CAAC,IAAR,CAAa,IAAb,EAAmB,KAAnB,CAAyB,SAAzB,EAAoC,UAAA,CAAA,EAAC;;AAEjC,YAAA,SAAS,GAAG,SAAS,CAAC,MAAV,CAAiB,CAAC,CAAC,QAAnB,CAAZ;AACA,YAAA,IAAI;AACP,WAJD,EAIG,KAJH,CAIS,MAJT;AAKH;AACJ,OA9EM,EA8EJ,QA9EI,CAAP,CAD2B,CA+Ed;AAChB,KArQkB;AAsQnB,IAAA,OAAO,EAAE,UAAS,OAAT,EAAkBA,OAAlB,EAAsB;AAC3B,UAAI,IAAI,GAAG,IAAX;AAAA,UACI,YAAY,GAAG,KAAK,IAAL,CAAU,QAAV,CAAmB,IADtC;AAEA,aAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAqC,KAArC,EAA0C;AACvE,YAAI,CAAC,QAAQ,CAAC,OAAV,IAAqB,CAAC,IAAI,CAAC,MAAL,CAAY,OAAZ,CAAoB,IAA1C,IAAkD,CAACA,OAAvD,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,wEAA/B,CAAN;AACJ,YAAI,QAAQ,CAAC,OAAT,IAAoBA,OAAxB,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,8DAA/B,CAAN;AACJ,YAAIA,OAAI,IAAIA,OAAI,CAAC,MAALA,KAAgB,OAAO,CAAC,MAApC,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,sDAA/B,CAAN;AACJ,YAAI,OAAO,CAAC,MAAR,KAAmB,CAAvB,EAA0B,OAAO,OAAO,EAAd,CAP6C,CAO5B;;AAC3C,iBAAA,IAAA,CAAc,MAAd,EAAoB;AAChB,cAAI,SAAS,CAAC,MAAV,KAAqB,CAAzB,EAA4B,OAAO,CAAC,MAAD,CAAP,CAA5B,KACK,MAAM,CAAC,IAAI,SAAJ,CAAiB,IAAI,CAAC,IAAL,GAAS,cAAT,GAAwB,SAAS,CAAC,MAAlC,GAAwC,MAAxC,GAA+C,OAA/C,GAAsD,oBAAvE,EAA6F,SAA7F,CAAD,CAAN;AACR;;AACD,YAAI,GAAJ;AAAA,YACI,SAAS,GAAG,EADhB;AAAA,YAEI,YAFJ;AAAA,YAGI,cAHJ;AAAA,YAII,OAAO,GAAG,OAAO,CAAC,MAJtB;;AAKA,YAAI,YAAY,KAAK,GAArB,EAA0B;;;;;AAKtB,cAAI,OAAO,GAAG,QAAQ,CAAC,OAAvB;AAAA,cACI,OADJ;AAEA,UAAA,YAAY,GAAG,wBAAwB,CAAC,SAAD,EAAY,IAAZ,EAAkB,IAAlB,CAAvC;AACA,UAAA,cAAc,GAAG,yBAAyB,CAAC,IAAD,CAA1C;AAEA,UAAA,QAAQ,CAAC,YAAA;AACL,iBAAK,IAAI,CAAC,GAAC,CAAN,EAAS,CAAC,GAAG,OAAO,CAAC,MAA1B,EAAkC,CAAC,GAAG,CAAtC,EAAyC,EAAE,CAA3C,EAA8C;AAC1C,cAAA,OAAO,GAAG;AAAE,gBAAA,OAAO,EAAE,IAAX;AAAiB,gBAAA,SAAS,EAAE;AAA5B,eAAV;AACA,kBAAI,GAAG,GAAGA,OAAI,IAAIA,OAAI,CAAC,CAAD,CAAtB;AACA,kBAAI,GAAG,GAAG,OAAO,CAAC,CAAD,CAAjB;AAAA,kBACI,YAAY,GAAGA,OAAI,GAAG,GAAH,GAAS,OAAO,GAAG,YAAY,CAAC,GAAD,EAAM,OAAN,CAAf,GAAgC,SADvE;AAAA,kBAEI,QAAQ,GAAG,YAAY,CAAC,IAAb,CAAkB,OAAlB,EAA2B,YAA3B,EAAyC,GAAzC,EAA8C,KAA9C,CAFf;;AAGA,kBAAI,YAAY,IAAI,IAAhB,IAAwB,QAAQ,IAAI,IAAxC,EAA8C;AAC1C,oBAAI,OAAJ,EAAa;AACT,kBAAA,GAAG,GAAG,SAAS,CAAC,GAAD,CAAf;AACA,kBAAA,YAAY,CAAC,GAAD,EAAM,OAAN,EAAe,QAAf,CAAZ;AACH,iBAHD,MAGO;AACH,kBAAA,GAAG,GAAG,QAAN;AACH;AACJ;;AACD,cAAA,GAAG,GAAG,GAAG,IAAI,IAAP,GAAc,QAAQ,CAAC,GAAT,CAAa,GAAb,EAAkB,GAAlB,CAAd,GAAuC,QAAQ,CAAC,GAAT,CAAa,GAAb,CAA7C;AACA,cAAA,GAAG,CAAC,QAAJ,GAAe,OAAf;;AACA,kBAAI,CAAC,GAAG,CAAC,GAAG,CAAZ,EAAe;AACX,gBAAA,GAAG,CAAC,OAAJ,GAAc,YAAd;AACA,oBAAI,OAAO,CAAC,SAAZ,EACI,GAAG,CAAC,SAAJ,GAAgB,cAAhB;AACP;AACJ;AACJ,WAvBO,EAuBL,UAAA,GAAA,EAAG;AACF,YAAA,OAAO,CAAC,OAAR,IAAmB,OAAO,CAAC,OAAR,CAAgB,GAAhB,CAAnB;AACA,kBAAM,GAAN;AACH,WA1BO,CAAR;AA4BA,UAAA,GAAG,CAAC,OAAJ,GAAc,wBAAwB,CAAC,SAAD,EAAY,IAAZ,EAAkB,IAAlB,CAAtC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,yBAAyB,CAAC,IAAD,CAAzC;AACH,SAxCD,MAwCO;;;;AAIH,UAAA,YAAY,GAAG,wBAAwB,CAAC,SAAD,CAAvC;;AACA,eAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,OAAO,CAAC,MAA5B,EAAoC,CAAC,GAAG,CAAxC,EAA2C,EAAE,CAA7C,EAAgD;AAC5C,YAAA,GAAG,GAAGA,OAAI,GAAG,QAAQ,CAAC,GAAT,CAAa,OAAO,CAAC,CAAD,CAApB,EAAyBA,OAAI,CAAC,CAAD,CAA7B,CAAH,GAAuC,QAAQ,CAAC,GAAT,CAAa,OAAO,CAAC,CAAD,CAApB,CAAjD;AACA,YAAA,GAAG,CAAC,OAAJ,GAAc,YAAd;AACH,WARE;;;;AAWH,UAAA,GAAG,CAAC,OAAJ,GAAc,wBAAwB,CAAC,SAAD,EAAY,IAAZ,CAAtC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,mBAAmB,CAAC,IAAD,CAAnC;AACH;AACJ,OAvEM,CAAP;AAwEH,KAjVkB;AAkVnB,IAAA,GAAG,EAAE,UAAU,GAAV,EAAe,GAAf,EAAkB;;;;;;AAMnB,UAAI,YAAY,GAAG,KAAK,IAAL,CAAU,QAAV,CAAmB,IAAtC;AACA,aAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAqC,KAArC,EAA0C;AACvE,YAAI,OAAO,GAAG;AAAC,UAAA,SAAS,EAAE,IAAZ;AAAkB,UAAA,OAAO,EAAE;AAA3B,SAAd;;AACA,YAAI,YAAY,KAAK,GAArB,EAA0B;AACtB,cAAI,YAAY,GAAI,GAAG,IAAI,IAAR,GAAgB,GAAhB,GAAuB,QAAQ,CAAC,OAAT,GAAmB,YAAY,CAAC,GAAD,EAAM,QAAQ,CAAC,OAAf,CAA/B,GAAyD,SAAnG;AACA,cAAI,QAAQ,GAAG,YAAY,CAAC,IAAb,CAAkB,OAAlB,EAA2B,YAA3B,EAAyC,GAAzC,EAA8C,KAA9C,CAAf,CAFsB,CAE8C;;AACpE,cAAI,YAAY,IAAI,IAAhB,IAAwB,QAAQ,IAAI,IAAxC,EAA8C;AAC1C,gBAAI,QAAQ,CAAC,OAAb,EACI,YAAY,CAAC,GAAD,EAAM,QAAQ,CAAC,OAAf,EAAwB,QAAxB,CAAZ,CADJ,KAGI,GAAG,GAAG,QAAN;AACP;AACJ;;AACD,YAAI;AACA,cAAI,GAAG,GAAG,GAAG,IAAI,IAAP,GAAc,QAAQ,CAAC,GAAT,CAAa,GAAb,EAAkB,GAAlB,CAAd,GAAuC,QAAQ,CAAC,GAAT,CAAa,GAAb,CAAjD;AACA,UAAA,GAAG,CAAC,QAAJ,GAAe,OAAf;AACA,UAAA,GAAG,CAAC,OAAJ,GAAc,wBAAwB,CAAC,MAAD,CAAtC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,yBAAyB,CAAC,UAAU,MAAV,EAAgB;;;AAGtD,gBAAI,OAAO,GAAG,QAAQ,CAAC,OAAvB;AACA,gBAAI,OAAJ,EAAa,YAAY,CAAC,GAAD,EAAM,OAAN,EAAe,MAAf,CAAZ;AACb,YAAA,OAAO,CAAC,MAAD,CAAP;AACH,WANwC,CAAzC;AAOH,SAXD,CAWE,OAAO,CAAP,EAAU;AACR,cAAI,OAAO,CAAC,OAAZ,EAAqB,OAAO,CAAC,OAAR,CAAgB,CAAhB;AACrB,gBAAM,CAAN;AACH;AACJ,OA3BM,CAAP;AA4BH,KArXkB;AAuXnB,IAAA,GAAG,EAAE,UAAU,GAAV,EAAe,GAAf,EAAkB;AAAlB,UAAA,KAAA,GAAA,IAAA,CAAkB;;;;;;;AAMnB,UAAI,YAAY,GAAG,KAAK,IAAL,CAAU,QAAV,CAAmB,IAAtC;AAAA,UACI,YAAY,GAAG,KAAK,IAAL,CAAU,QAAV,CAAmB,IADtC;;AAEA,UAAI,YAAY,KAAK,GAAjB,IAAwB,YAAY,KAAK,GAA7C,EAAkD;;;;;AAK9C,YAAI,OAAO,GAAG,KAAK,MAAL,CAAY,OAAZ,CAAoB,OAAlC;AACA,YAAI,YAAY,GAAI,GAAG,KAAK,SAAT,GAAsB,GAAtB,GAA6B,OAAO,IAAI,YAAY,CAAC,GAAD,EAAM,OAAN,CAAvE;AACA,YAAI,YAAY,IAAI,IAApB,EACI,OAAO,KAAK,GAAL,CAAS,GAAT,CAAP,CAR0C;;;;AAc9C,QAAA,GAAG,GAAG,SAAS,CAAC,GAAD,CAAf;AACA,eAAO,KAAK,MAAL,CAAY,SAAZ,EAAuB,YAAA;AAC1B,iBAAA,KAAI,CAAC,KAAL,CAAW,KAAX,EAAkB,MAAlB,CAAyB,YAAzB,EAAuC,MAAvC,CAA8C,YAAA;;;AAG1C,iBAAK,KAAL,GAAa,GAAb;AACH,WAJD,EAIG,IAJH,CAIQ,UAAA,KAAA,EAAK;AAAI,mBAAA,KAAK,KAAK,CAAV,GAAc,KAAI,CAAC,GAAL,CAAS,GAAT,EAAc,GAAd,CAAd,GAAmC,YAAnC;AAA+C,WAJhE,CAAA;AAIiE,SAL9D,EAMH,QANG,CAAP,CAf8C,CAqBhC;AACjB,OAtBD,MAsBO;;AAEH,eAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AAChE,cAAI,GAAG,GAAG,GAAG,KAAK,SAAR,GAAoB,QAAQ,CAAC,GAAT,CAAa,GAAb,EAAkB,GAAlB,CAApB,GAA6C,QAAQ,CAAC,GAAT,CAAa,GAAb,CAAvD;AACA,UAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,UAAU,EAAV,EAAY;AAC7B,gBAAI,OAAO,GAAG,QAAQ,CAAC,OAAvB;AACA,gBAAI,OAAJ,EAAa,YAAY,CAAC,GAAD,EAAM,OAAN,EAAe,EAAE,CAAC,MAAH,CAAU,MAAzB,CAAZ;AACb,YAAA,OAAO,CAAC,GAAG,CAAC,MAAL,CAAP;AACH,WAJmB,CAApB;AAKH,SARM,CAAP;AASH;AACJ,KAjakB;AAmanB,cAAU,UAAU,GAAV,EAAa;;AAEnB,UAAI,KAAK,IAAL,CAAU,QAAV,CAAmB,WAAnB,CAA+B,MAAnC,EAA2C;;;AAGvC,eAAO,KAAK,KAAL,CAAW,KAAX,EAAkB,MAAlB,CAAyB,GAAzB,EAA8B,MAA9B,EAAP;AACH,OAJD,MAIO;;AAEH,eAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AAChE,cAAI,GAAG,GAAG,QAAQ,CAAC,MAAT,CAAgB,GAAhB,CAAV;AACA,UAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,YAAA;AACjB,YAAA,OAAO,CAAC,GAAG,CAAC,MAAL,CAAP;AACH,WAFmB,CAApB;AAGH,SANM,CAAP;AAOH;AACJ,KAnbkB;AAqbnB,IAAA,KAAK,EAAE,YAAA;AACH,UAAI,KAAK,IAAL,CAAU,QAAV,CAAmB,WAAnB,CAA+B,MAAnC,EAA2C;;;AAGvC,eAAO,KAAK,YAAL,GAAoB,MAApB,EAAP;AACH,OAJD,MAIO;AACH,eAAO,KAAK,SAAL,CAAe,SAAf,EAA0B,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AAChE,cAAI,GAAG,GAAG,QAAQ,CAAC,KAAT,EAAV;AACA,UAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,UAAA,GAAG,CAAC,SAAJ,GAAgB,IAAI,CAAC,YAAA;AACjB,YAAA,OAAO,CAAC,GAAG,CAAC,MAAL,CAAP;AACH,WAFmB,CAApB;AAGH,SANM,CAAP;AAOH;AACJ,KAnckB;AAqcnB,IAAA,MAAM,EAAE,UAAU,WAAV,EAAuB,aAAvB,EAAoC;AACxC,UAAI,QAAO,aAAP,MAAyB,QAAzB,IAAqC,OAAO,CAAC,aAAD,CAAhD,EACI,MAAM,IAAI,UAAU,CAAC,eAAf,CAA+B,kCAA/B,CAAN;;AACJ,UAAI,QAAO,WAAP,MAAuB,QAAvB,IAAmC,CAAC,OAAO,CAAC,WAAD,CAA/C,EAA8D;;AAE1D,QAAA,IAAI,CAAC,aAAD,CAAJ,CAAoB,OAApB,CAA4B,UAAU,OAAV,EAAiB;AACzC,UAAA,YAAY,CAAC,WAAD,EAAc,OAAd,EAAuB,aAAa,CAAC,OAAD,CAApC,CAAZ;AACH,SAFD;AAGA,YAAI,GAAG,GAAG,YAAY,CAAC,WAAD,EAAc,KAAK,MAAL,CAAY,OAAZ,CAAoB,OAAlC,CAAtB;AACA,YAAI,GAAG,KAAK,SAAZ,EAAuB,OAAO,SAAS,CAAE,IAAI,UAAU,CAAC,eAAf,CACrC,+CADqC,CAAF,CAAhB;AAEvB,eAAO,KAAK,KAAL,CAAW,KAAX,EAAkB,MAAlB,CAAyB,GAAzB,EAA8B,MAA9B,CAAqC,aAArC,CAAP;AACH,OATD,MASO;;AAEH,eAAO,KAAK,KAAL,CAAW,KAAX,EAAkB,MAAlB,CAAyB,WAAzB,EAAsC,MAAtC,CAA6C,aAA7C,CAAP;AACH;AACJ;AArdkB,GAAlB,CAAL,CA10ByC;;;;;;;;AAyyCzC,WAAA,WAAA,CAAqB,IAArB,EAA2B,UAA3B,EAAuC,QAAvC,EAAiD,MAAjD,EAAuD;AAAvD,QAAA,KAAA,GAAA,IAAA,CAAuD;;;;;;;AAMnD,SAAK,EAAL,GAAU,EAAV;AACA,SAAK,IAAL,GAAY,IAAZ;AACA,SAAK,UAAL,GAAkB,UAAlB;AACA,SAAK,QAAL,GAAgB,IAAhB;AACA,SAAK,EAAL,GAAU,MAAM,CAAC,IAAD,EAAO,UAAP,EAAmB,OAAnB,EAA4B,OAA5B,CAAhB;AACA,SAAK,MAAL,GAAc,MAAM,IAAI,IAAxB;AACA,SAAK,MAAL,GAAc,IAAd;AACA,SAAK,SAAL,GAAiB,CAAjB;AACA,SAAK,aAAL,GAAqB,EAArB;AACA,SAAK,QAAL,GAAgB,IAAhB;AACA,SAAK,OAAL,GAAe,IAAf;AACA,SAAK,WAAL,GAAmB,IAAnB;AACA,SAAK,aAAL,GAAqB,IAArB;AACA,SAAK,UAAL,GAAkB,CAAlB,CAnBmD,CAmB/B;;AACpB,SAAK,WAAL,GAAmB,IAAI,OAAJ,CAAa,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC5C,MAAA,KAAI,CAAC,QAAL,GAAgB,OAAhB;AACA,MAAA,KAAI,CAAC,OAAL,GAAe,MAAf;AACH,KAHkB,CAAnB;;AAKA,SAAK,WAAL,CAAiB,IAAjB,CACI,YAAA;AACI,MAAA,KAAI,CAAC,MAAL,GAAc,KAAd;;AACA,MAAA,KAAI,CAAC,EAAL,CAAQ,QAAR,CAAiB,IAAjB;AACH,KAJL,EAKI,UAAA,CAAA,EAAC;AACG,UAAI,SAAS,GAAG,KAAI,CAAC,MAArB;AACA,MAAA,KAAI,CAAC,MAAL,GAAc,KAAd;;AACA,MAAA,KAAI,CAAC,EAAL,CAAQ,KAAR,CAAc,IAAd,CAAmB,CAAnB;;AACA,MAAA,KAAI,CAAC,MAAL,GACI,KAAI,CAAC,MAAL,CAAY,OAAZ,CAAoB,CAApB,CADJ,GAEI,SAAS,IAAI,KAAI,CAAC,QAAlB,IAA8B,KAAI,CAAC,QAAL,CAAc,KAAd,EAFlC;AAGA,aAAO,SAAS,CAAC,CAAD,CAAhB,CAPH,CAOuB;AACvB,KAbL;AAcH;;AAED,EAAA,KAAK,CAAC,WAAW,CAAC,SAAb,EAAwB;;;;AAIzB,IAAA,KAAK,EAAE,YAAA;AACH,MAAA,MAAM,CAAE,CAAC,GAAG,CAAC,MAAP,CAAN,CADG,CACkB;;;AAErB,QAAE,KAAK,SAAP,CAHG,CAGc;;AACjB,UAAI,KAAK,SAAL,KAAmB,CAAnB,IAAwB,CAAC,GAAG,CAAC,MAAjC,EAAyC,GAAG,CAAC,YAAJ,GAAmB,IAAnB;AACzC,aAAO,IAAP;AACH,KAVwB;AAWzB,IAAA,OAAO,EAAE,YAAA;AACL,MAAA,MAAM,CAAE,CAAC,GAAG,CAAC,MAAP,CAAN,CADK,CACgB;;AACrB,UAAI,EAAE,KAAK,SAAP,KAAqB,CAAzB,EAA4B;AACxB,YAAI,CAAC,GAAG,CAAC,MAAT,EAAiB,GAAG,CAAC,YAAJ,GAAmB,IAAnB;;AACjB,eAAO,KAAK,aAAL,CAAmB,MAAnB,GAA4B,CAA5B,IAAiC,CAAC,KAAK,OAAL,EAAzC,EAAyD;AACrD,cAAI,QAAQ,GAAG,KAAK,aAAL,CAAmB,KAAnB,EAAf;;AACA,cAAI;AAAE,YAAA,MAAM,CAAC,QAAQ,CAAC,CAAD,CAAT,EAAc,QAAQ,CAAC,CAAD,CAAtB,CAAN;AAAmC,WAAzC,CAA0C,OAAO,CAAP,EAAU,CAAG;AAC1D;AACJ;;AACD,aAAO,IAAP;AACH,KArBwB;AAsBzB,IAAA,OAAO,EAAE,YAAA;;;;;;;;;;;AAWL,aAAO,KAAK,SAAL,IAAkB,GAAG,CAAC,YAAJ,KAAqB,IAA9C;AACH,KAlCwB;AAmCzB,IAAA,MAAM,EAAE,UAAU,QAAV,EAAkB;AAAlB,UAAA,KAAA,GAAA,IAAA;;AACJ,UAAI,CAAC,KAAK,IAAV,EAAgB,OAAO,IAAP;AAChB,MAAA,MAAM,CAAC,CAAC,KAAK,QAAP,CAAN;;AACA,UAAI,CAAC,QAAD,IAAa,CAAC,KAAlB,EAAyB;AACrB,gBAAQ,WAAW,IAAI,WAAW,CAAC,IAAnC;AACI,eAAK,qBAAL;;AAEI,kBAAM,IAAI,UAAU,CAAC,cAAf,CAA8B,WAA9B,CAAN;;AACJ,eAAK,iBAAL;;AAEI,kBAAM,IAAI,UAAU,CAAC,UAAf,CAA0B,WAAW,CAAC,OAAtC,EAA+C,WAA/C,CAAN;;AACJ;;AAEI,kBAAM,IAAI,UAAU,CAAC,UAAf,CAA0B,WAA1B,CAAN;AATR;AAWH;;AACD,UAAI,CAAC,KAAK,MAAV,EAAkB,MAAM,IAAI,UAAU,CAAC,mBAAf,EAAN;AAClB,MAAA,MAAM,CAAC,KAAK,WAAL,CAAiB,MAAjB,KAA4B,IAA7B,CAAN;AAEA,MAAA,QAAQ,GAAG,KAAK,QAAL,GAAgB,QAAQ,IAAI,KAAK,CAAC,WAAN,CAAkB,mBAAmB,CAAC,KAAK,UAAN,CAArC,EAAwD,KAAK,IAA7D,CAAvC;AACA,MAAA,QAAQ,CAAC,OAAT,GAAmB,IAAI,CAAC,UAAA,EAAA,EAAE;AACtB,QAAA,cAAc,CAAC,EAAD,CAAd,CADsB,CACH;;AACnB,QAAA,KAAI,CAAC,OAAL,CAAa,QAAQ,CAAC,KAAtB;AACH,OAHsB,CAAvB;AAIA,MAAA,QAAQ,CAAC,OAAT,GAAmB,IAAI,CAAC,UAAA,EAAA,EAAE;AACtB,QAAA,cAAc,CAAC,EAAD,CAAd;AACA,QAAA,KAAI,CAAC,MAAL,IAAe,KAAI,CAAC,OAAL,CAAa,IAAI,UAAU,CAAC,KAAf,CAAqB,QAAQ,CAAC,KAA9B,CAAb,CAAf;AACA,QAAA,KAAI,CAAC,MAAL,GAAc,KAAd;;AACA,QAAA,KAAI,CAAC,EAAL,CAAQ,OAAR,EAAiB,IAAjB,CAAsB,EAAtB;AACH,OALsB,CAAvB;AAMA,MAAA,QAAQ,CAAC,UAAT,GAAsB,IAAI,CAAC,YAAA;AACvB,QAAA,KAAI,CAAC,MAAL,GAAc,KAAd;;AACA,QAAA,KAAI,CAAC,QAAL;AACH,OAHyB,CAA1B;AAIA,aAAO,IAAP;AACH,KAtEwB;AAuEzB,IAAA,QAAQ,EAAE,UAAU,IAAV,EAAgB,EAAhB,EAAoB,UAApB,EAA8B;AAA9B,UAAA,KAAA,GAAA,IAAA;;AAEN,UAAI,IAAI,KAAK,SAAT,IAAsB,KAAK,IAAL,KAAc,SAAxC,EACI,OAAO,SAAS,CAAE,IAAI,UAAU,CAAC,QAAf,CAAwB,yBAAxB,CAAF,CAAhB;AAEJ,UAAI,CAAC,KAAK,MAAV,EACI,OAAO,SAAS,CAAE,IAAI,UAAU,CAAC,mBAAf,EAAF,CAAhB;;AAEJ,UAAI,KAAK,OAAL,EAAJ,EAAoB;AAChB,eAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAC/B,UAAA,KAAI,CAAC,aAAL,CAAmB,IAAnB,CAAwB,CAAC,YAAA;AACrB,YAAA,KAAI,CAAC,QAAL,CAAc,IAAd,EAAoB,EAApB,EAAwB,UAAxB,EAAoC,IAApC,CAAyC,OAAzC,EAAkD,MAAlD;AACH,WAFuB,EAErB,GAFqB,CAAxB;AAGH,SAJM,CAAP;AAMH,OAPD,MAOO,IAAI,UAAJ,EAAgB;AACnB,eAAO,QAAQ,CAAC,YAAA;AACZ,cAAI,CAAC,GAAG,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAChC,YAAA,KAAI,CAAC,KAAL;;AACA,gBAAI,EAAE,GAAG,EAAE,CAAC,OAAD,EAAU,MAAV,EAAkB,KAAlB,CAAX;AACA,gBAAI,EAAE,IAAI,EAAE,CAAC,IAAb,EAAmB,EAAE,CAAC,IAAH,CAAQ,OAAR,EAAiB,MAAjB;AACtB,WAJO,CAAR;AAKA,UAAA,CAAC,CAAC,OAAF,CAAU,YAAA;AAAI,mBAAA,KAAI,CAAC,OAAL,EAAA;AAAc,WAA5B;AACA,UAAA,CAAC,CAAC,IAAF,GAAS,IAAT;AACA,iBAAO,CAAP;AACH,SATc,CAAf;AAWH,OAZM,MAYA;AACH,YAAI,CAAC,GAAG,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAChC,cAAI,EAAE,GAAG,EAAE,CAAC,OAAD,EAAU,MAAV,EAAkB,KAAlB,CAAX;AACA,cAAI,EAAE,IAAI,EAAE,CAAC,IAAb,EAAmB,EAAE,CAAC,IAAH,CAAQ,OAAR,EAAiB,MAAjB;AACtB,SAHO,CAAR;AAIA,QAAA,CAAC,CAAC,IAAF,GAAS,IAAT;AACA,eAAO,CAAP;AACH;AACJ,KA1GwB;AA4GzB,IAAA,KAAK,EAAE,YAAA;AACH,aAAO,KAAK,MAAL,GAAc,KAAK,MAAL,CAAY,KAAZ,EAAd,GAAoC,IAA3C;AACH,KA9GwB;AAgHzB,IAAA,OAAO,EAAA,UAAE,OAAF,EAAS;;AAEZ,UAAI,IAAI,GAAG,KAAK,KAAL,EAAX,CAFY;;;;AAKZ,MAAA,OAAO,GAAG,OAAO,CAAC,OAAR,CAAgB,OAAhB,CAAV;;AACA,UAAI,IAAI,CAAC,WAAT,EAAsB;;AAElB,QAAA,IAAI,CAAC,WAAL,GAAmB,IAAI,CAAC,WAAL,CAAiB,IAAjB,CAAsB,YAAA;AAAI,iBAAA,OAAA;AAAO,SAAjC,CAAnB;AACH,OAHD,MAGO;;AAEH,QAAA,IAAI,CAAC,WAAL,GAAmB,OAAnB;AACA,QAAA,IAAI,CAAC,aAAL,GAAqB,EAArB,CAHG;;AAKH,YAAI,KAAK,GAAG,IAAI,CAAC,QAAL,CAAc,WAAd,CAA0B,IAAI,CAAC,UAAL,CAAgB,CAAhB,CAA1B,CAAZ;;AACC,kBAAA,IAAA,GAAA;AACG,YAAE,IAAI,CAAC,UAAP,CADH,CACqB;;AAClB,iBAAO,IAAI,CAAC,aAAL,CAAmB,MAA1B;AAAmC,YAAA,IAAI,CAAC,aAAL,CAAmB,KAAnB,EAAD;AAAlC;;AACA,cAAI,IAAI,CAAC,WAAT,EAAsB,KAAK,CAAC,GAAN,CAAU,CAAC,QAAX,EAAqB,SAArB,GAAiC,IAAjC;AACzB,SAJA,GAAD;AAKH;;AACD,UAAI,kBAAkB,GAAG,IAAI,CAAC,WAA9B;AACA,aAAO,IAAI,OAAJ,CAAa,UAAC,OAAD,EAAU,MAAV,EAAgB;AAChC,QAAA,OAAO,CAAC,IAAR,CACI,UAAA,GAAA,EAAG;AAAI,iBAAA,IAAI,CAAC,aAAL,CAAmB,IAAnB,CAAwB,IAAI,CAAC,OAAO,CAAC,IAAR,CAAa,IAAb,EAAmB,GAAnB,CAAD,CAA5B,CAAA;AAAsD,SADjE,EAEI,UAAA,GAAA,EAAG;AAAI,iBAAA,IAAI,CAAC,aAAL,CAAmB,IAAnB,CAAwB,IAAI,CAAC,MAAM,CAAC,IAAP,CAAY,IAAZ,EAAkB,GAAlB,CAAD,CAA5B,CAAA;AAAqD,SAFhE,EAGE,OAHF,CAGU,YAAA;AACN,cAAI,IAAI,CAAC,WAAL,KAAqB,kBAAzB,EAA6C;;AAEzC,YAAA,IAAI,CAAC,WAAL,GAAmB,IAAnB;AACH;AACJ,SARD;AASH,OAVM,CAAP;AAWH,KAjJwB;;;;AAsJzB,IAAA,KAAK,EAAE,YAAA;AACH,WAAK,MAAL,IAAe,KAAK,OAAL,CAAa,IAAI,UAAU,CAAC,KAAf,EAAb,CAAf;AACA,WAAK,MAAL,GAAc,KAAd;AACH,KAzJwB;AA2JzB,IAAA,MAAM,EAAE;AACJ,MAAA,GAAG,EAAEC,UAAgB,CAAE,oBAAF,EAAwB,YAAA;AAAI,eAAA,SAAA;AAAS,OAArC;AADjB,KA3JiB;AA+JzB,IAAA,KAAK,EAAE,UAAU,IAAV,EAAc;AACjB,UAAI,KAAK,GAAG,EAAE,CAAC,KAAH,CAAS,IAAT,CAAZ,CADiB,CACU;;AAC3B,aAAO,IAAI,KAAJ,CAAU,IAAV,EAAgB,KAAK,CAAC,MAAtB,EAA8B,IAA9B,CAAP;AACH;AAlKwB,GAAxB,CAAL,CAl1CyC;;;;;;;;AA8/CzC,WAAA,WAAA,CAAqB,KAArB,EAA4B,KAA5B,EAAmC,YAAnC,EAA+C;;;;AAI3C,SAAK,IAAL,GAAY;AACR,MAAA,KAAK,EAAE,KADC;AAER,MAAA,KAAK,EAAE,KAAK,KAAK,KAAV,GAAkB,IAAlB,GAAyB,KAFxB;AAGR,MAAA,EAAE,EAAE;AAHI,KAAZ;AAKH;;AAED,EAAA,KAAK,CAAC,WAAW,CAAC,SAAb,EAAwB,YAAA;;AAIzB,aAAA,IAAA,CAAc,uBAAd,EAAuC,GAAvC,EAA4C,CAA5C,EAA6C;AACzC,UAAI,UAAU,GAAG,uBAAuB,YAAY,WAAnC,GACb,IAAI,UAAJ,CAAgB,uBAAhB,CADa,GAEb,uBAFJ;AAIA,MAAA,UAAU,CAAC,IAAX,CAAgB,KAAhB,GAAwB,CAAC,GAAG,IAAI,CAAJ,CAAM,GAAN,CAAH,GAAgB,IAAI,SAAJ,CAAc,GAAd,CAAzC;AACA,aAAO,UAAP;AACH;;AAED,aAAA,eAAA,CAAyB,WAAzB,EAAoC;AAChC,aAAO,IAAI,UAAJ,CAAgB,WAAhB,EAA6B,YAAA;AAAa,eAAO,WAAW,CAAC,IAAZ,CAAiB,EAAjB,CAAP;AAA8B,OAAxE,EAA0E,KAA1E,CAAgF,CAAhF,CAAP;AACH;;AAED,aAAA,YAAA,CAAsB,GAAtB,EAAyB;AACrB,aAAO,GAAG,KAAK,MAAR,GAAiB,UAAU,CAAV,EAAW;AAAI,eAAO,CAAC,CAAC,WAAF,EAAP;AAAyB,OAAzD,GAA4D,UAAU,CAAV,EAAW;AAAI,eAAO,CAAC,CAAC,WAAF,EAAP;AAAyB,OAA3G;AACH;;AACD,aAAA,YAAA,CAAsB,GAAtB,EAAyB;AACrB,aAAO,GAAG,KAAK,MAAR,GAAiB,UAAU,CAAV,EAAW;AAAI,eAAO,CAAC,CAAC,WAAF,EAAP;AAAyB,OAAzD,GAA4D,UAAU,CAAV,EAAW;AAAI,eAAO,CAAC,CAAC,WAAF,EAAP;AAAyB,OAA3G;AACH;;AACD,aAAA,UAAA,CAAoB,GAApB,EAAyB,QAAzB,EAAmC,WAAnC,EAAgD,WAAhD,EAA6D,GAA7D,EAAkE,GAAlE,EAAqE;AACjE,UAAI,MAAM,GAAG,IAAI,CAAC,GAAL,CAAS,GAAG,CAAC,MAAb,EAAqB,WAAW,CAAC,MAAjC,CAAb;AACA,UAAI,GAAG,GAAG,CAAC,CAAX;;AACA,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,MAApB,EAA4B,EAAE,CAA9B,EAAiC;AAC7B,YAAI,UAAU,GAAG,QAAQ,CAAC,CAAD,CAAzB;;AACA,YAAI,UAAU,KAAK,WAAW,CAAC,CAAD,CAA9B,EAAmC;AAC/B,cAAI,GAAG,CAAC,GAAG,CAAC,CAAD,CAAJ,EAAS,WAAW,CAAC,CAAD,CAApB,CAAH,GAA8B,CAAlC,EAAqC,OAAO,GAAG,CAAC,MAAJ,CAAW,CAAX,EAAc,CAAd,IAAmB,WAAW,CAAC,CAAD,CAA9B,GAAoC,WAAW,CAAC,MAAZ,CAAmB,CAAC,GAAG,CAAvB,CAA3C;AACrC,cAAI,GAAG,CAAC,GAAG,CAAC,CAAD,CAAJ,EAAS,WAAW,CAAC,CAAD,CAApB,CAAH,GAA8B,CAAlC,EAAqC,OAAO,GAAG,CAAC,MAAJ,CAAW,CAAX,EAAc,CAAd,IAAmB,WAAW,CAAC,CAAD,CAA9B,GAAoC,WAAW,CAAC,MAAZ,CAAmB,CAAC,GAAG,CAAvB,CAA3C;AACrC,cAAI,GAAG,IAAI,CAAX,EAAc,OAAO,GAAG,CAAC,MAAJ,CAAW,CAAX,EAAc,GAAd,IAAqB,QAAQ,CAAC,GAAD,CAA7B,GAAqC,WAAW,CAAC,MAAZ,CAAmB,GAAG,GAAG,CAAzB,CAA5C;AACd,iBAAO,IAAP;AACH;;AACD,YAAI,GAAG,CAAC,GAAG,CAAC,CAAD,CAAJ,EAAS,UAAT,CAAH,GAA0B,CAA9B,EAAiC,GAAG,GAAG,CAAN;AACpC;;AACD,UAAI,MAAM,GAAG,WAAW,CAAC,MAArB,IAA+B,GAAG,KAAK,MAA3C,EAAmD,OAAO,GAAG,GAAG,WAAW,CAAC,MAAZ,CAAmB,GAAG,CAAC,MAAvB,CAAb;AACnD,UAAI,MAAM,GAAG,GAAG,CAAC,MAAb,IAAuB,GAAG,KAAK,MAAnC,EAA2C,OAAO,GAAG,CAAC,MAAJ,CAAW,CAAX,EAAc,WAAW,CAAC,MAA1B,CAAP;AAC3C,aAAQ,GAAG,GAAG,CAAN,GAAU,IAAV,GAAiB,GAAG,CAAC,MAAJ,CAAW,CAAX,EAAc,GAAd,IAAqB,WAAW,CAAC,GAAD,CAAhC,GAAwC,WAAW,CAAC,MAAZ,CAAmB,GAAG,GAAG,CAAzB,CAAjE;AACH;;AAED,aAAA,sBAAA,CAAgC,WAAhC,EAA6C,KAA7C,EAAoD,OAApD,EAA6D,MAA7D,EAAmE;;AAE/D,UAAI,KAAJ;AAAA,UAAW,KAAX;AAAA,UAAkB,OAAlB;AAAA,UAA2B,YAA3B;AAAA,UAAyC,YAAzC;AAAA,UAAuD,SAAvD;AAAA,UAAkE,aAAlE;AAAA,UACI,UAAU,GAAG,OAAO,CAAC,MADzB;;AAEA,UAAI,CAAC,OAAO,CAAC,KAAR,CAAc,UAAA,CAAA,EAAC;AAAI,eAAA,OAAO,CAAP,KAAa,QAAb;AAAqB,OAAxC,CAAL,EAAgD;AAC5C,eAAO,IAAI,CAAC,WAAD,EAAc,eAAd,CAAX;AACH;;AACD,eAAA,aAAA,CAAuB,GAAvB,EAA0B;AACtB,QAAA,KAAK,GAAG,YAAY,CAAC,GAAD,CAApB;AACA,QAAA,KAAK,GAAG,YAAY,CAAC,GAAD,CAApB;AACA,QAAA,OAAO,GAAI,GAAG,KAAK,MAAR,GAAiB,aAAjB,GAAiC,oBAA5C;AACA,YAAI,YAAY,GAAG,OAAO,CAAC,GAAR,CAAY,UAAU,MAAV,EAAgB;AAC3C,iBAAO;AAAC,YAAA,KAAK,EAAE,KAAK,CAAC,MAAD,CAAb;AAAuB,YAAA,KAAK,EAAE,KAAK,CAAC,MAAD;AAAnC,WAAP;AACH,SAFkB,EAEhB,IAFgB,CAEX,UAAS,CAAT,EAAW,CAAX,EAAY;AAChB,iBAAO,OAAO,CAAC,CAAC,CAAC,KAAH,EAAU,CAAC,CAAC,KAAZ,CAAd;AACH,SAJkB,CAAnB;AAKA,QAAA,YAAY,GAAG,YAAY,CAAC,GAAb,CAAiB,UAAU,EAAV,EAAY;AAAG,iBAAO,EAAE,CAAC,KAAV;AAAkB,SAAlD,CAAf;AACA,QAAA,YAAY,GAAG,YAAY,CAAC,GAAb,CAAiB,UAAU,EAAV,EAAY;AAAG,iBAAO,EAAE,CAAC,KAAV;AAAkB,SAAlD,CAAf;AACA,QAAA,SAAS,GAAG,GAAZ;AACA,QAAA,aAAa,GAAI,GAAG,KAAK,MAAR,GAAiB,EAAjB,GAAsB,MAAvC;AACH;;AACD,MAAA,aAAa,CAAC,MAAD,CAAb;AAEA,UAAI,CAAC,GAAG,IAAI,UAAJ,CAAgB,WAAhB,EAA6B,YAAA;AACjC,eAAO,WAAW,CAAC,KAAZ,CAAkB,YAAY,CAAC,CAAD,CAA9B,EAAmC,YAAY,CAAC,UAAU,GAAC,CAAZ,CAAZ,GAA6B,MAAhE,CAAP;AACH,OAFO,CAAR;;AAIA,MAAA,CAAC,CAAC,kBAAF,GAAuB,UAAU,SAAV,EAAmB;;AAEtC,QAAA,aAAa,CAAC,SAAD,CAAb;AACH,OAHD;;AAKA,UAAI,mBAAmB,GAAG,CAA1B;;AAEA,MAAA,CAAC,CAAC,aAAF,CAAgB,UAAU,MAAV,EAAkB,OAAlB,EAA2B,OAA3B,EAAkC;;;;AAI9C,YAAI,GAAG,GAAG,MAAM,CAAC,GAAjB;AACA,YAAI,OAAO,GAAP,KAAe,QAAnB,EAA6B,OAAO,KAAP;AAC7B,YAAI,QAAQ,GAAG,KAAK,CAAC,GAAD,CAApB;;AACA,YAAI,KAAK,CAAC,QAAD,EAAW,YAAX,EAAyB,mBAAzB,CAAT,EAAwD;AACpD,iBAAO,IAAP;AACH,SAFD,MAEO;AACH,cAAI,oBAAoB,GAAG,IAA3B;;AACA,eAAK,IAAI,CAAC,GAAC,mBAAX,EAAgC,CAAC,GAAC,UAAlC,EAA8C,EAAE,CAAhD,EAAmD;AAC/C,gBAAI,MAAM,GAAG,UAAU,CAAC,GAAD,EAAM,QAAN,EAAgB,YAAY,CAAC,CAAD,CAA5B,EAAiC,YAAY,CAAC,CAAD,CAA7C,EAAkD,OAAlD,EAA2D,SAA3D,CAAvB;AACA,gBAAI,MAAM,KAAK,IAAX,IAAmB,oBAAoB,KAAK,IAAhD,EACI,mBAAmB,GAAG,CAAC,GAAG,CAA1B,CADJ,KAEK,IAAI,oBAAoB,KAAK,IAAzB,IAAiC,OAAO,CAAC,oBAAD,EAAuB,MAAvB,CAAP,GAAwC,CAA7E,EAAgF;AACjF,cAAA,oBAAoB,GAAG,MAAvB;AACH;AACJ;;AACD,cAAI,oBAAoB,KAAK,IAA7B,EAAmC;AAC/B,YAAA,OAAO,CAAC,YAAA;AAAc,cAAA,MAAM,CAAC,QAAP,CAAgB,oBAAoB,GAAG,aAAvC;AAAwD,aAAvE,CAAP;AACH,WAFD,MAEO;AACH,YAAA,OAAO,CAAC,OAAD,CAAP;AACH;;AACD,iBAAO,KAAP;AACH;AACJ,OA1BD;;AA2BA,aAAO,CAAP;AACH,KAvGwB;;;;;AA4GzB,WAAO;AACH,MAAA,OAAO,EAAE,UAAU,KAAV,EAAiB,KAAjB,EAAwB,YAAxB,EAAsC,YAAtC,EAAkD;;;;;;;;;AASvD,QAAA,YAAY,GAAG,YAAY,KAAK,KAAhC,CATuD,CASjB;;AACtC,QAAA,YAAY,GAAG,YAAY,KAAK,IAAhC,CAVuD,CAUlB;;AACrC,YAAI;AACA,cAAK,GAAG,CAAC,KAAD,EAAQ,KAAR,CAAH,GAAoB,CAArB,IACC,GAAG,CAAC,KAAD,EAAQ,KAAR,CAAH,KAAsB,CAAtB,KAA4B,YAAY,IAAI,YAA5C,KAA6D,EAAE,YAAY,IAAI,YAAlB,CADlE,EAEI,OAAO,eAAe,CAAC,IAAD,CAAtB,CAHJ,CAGiC;;AACjC,iBAAO,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAa,mBAAO,WAAW,CAAC,KAAZ,CAAkB,KAAlB,EAAyB,KAAzB,EAAgC,CAAC,YAAjC,EAA+C,CAAC,YAAhD,CAAP;AAAuE,WAA1G,CAAP;AACH,SALD,CAKE,OAAO,CAAP,EAAU;AACR,iBAAO,IAAI,CAAC,IAAD,EAAO,oBAAP,CAAX;AACH;AACJ,OApBE;AAqBH,MAAA,MAAM,EAAE,UAAU,KAAV,EAAe;AACnB,eAAO,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAa,iBAAO,WAAW,CAAC,IAAZ,CAAiB,KAAjB,CAAP;AAAiC,SAApE,CAAP;AACH,OAvBE;AAwBH,MAAA,KAAK,EAAE,UAAU,KAAV,EAAe;AAClB,eAAO,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAa,iBAAO,WAAW,CAAC,UAAZ,CAAuB,KAAvB,EAA8B,IAA9B,CAAP;AAA6C,SAAhF,CAAP;AACH,OA1BE;AA2BH,MAAA,YAAY,EAAE,UAAU,KAAV,EAAe;AACzB,eAAO,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAa,iBAAO,WAAW,CAAC,UAAZ,CAAuB,KAAvB,CAAP;AAAuC,SAA1E,CAAP;AACH,OA7BE;AA8BH,MAAA,KAAK,EAAE,UAAU,KAAV,EAAe;AAClB,eAAO,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAa,iBAAO,WAAW,CAAC,UAAZ,CAAuB,KAAvB,EAA8B,IAA9B,CAAP;AAA6C,SAAhF,CAAP;AACH,OAhCE;AAiCH,MAAA,YAAY,EAAE,UAAU,KAAV,EAAe;AACzB,eAAO,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAa,iBAAO,WAAW,CAAC,UAAZ,CAAuB,KAAvB,CAAP;AAAuC,SAA1E,CAAP;AACH,OAnCE;AAoCH,MAAA,UAAU,EAAE,UAAU,GAAV,EAAa;;AAErB,YAAI,OAAO,GAAP,KAAe,QAAnB,EAA6B,OAAO,IAAI,CAAC,IAAD,EAAO,eAAP,CAAX;AAC7B,eAAO,KAAK,OAAL,CAAa,GAAb,EAAkB,GAAG,GAAG,SAAxB,EAAmC,IAAnC,EAAyC,IAAzC,CAAP;AACH,OAxCE;AAyCH,MAAA,oBAAoB,EAAE,UAAU,GAAV,EAAa;;AAE/B,YAAI,GAAG,KAAK,EAAZ,EAAgB,OAAO,KAAK,UAAL,CAAgB,GAAhB,CAAP;AAChB,eAAO,sBAAsB,CAAC,IAAD,EAAO,UAAU,CAAV,EAAa,CAAb,EAAc;AAAI,iBAAO,CAAC,CAAC,OAAF,CAAU,CAAC,CAAC,CAAD,CAAX,MAAoB,CAA3B;AAA+B,SAAxD,EAA0D,CAAC,GAAD,CAA1D,EAAiE,SAAjE,CAA7B;AACH,OA7CE;AA8CH,MAAA,gBAAgB,EAAE,UAAU,GAAV,EAAa;;AAE3B,eAAO,sBAAsB,CAAC,IAAD,EAAO,UAAU,CAAV,EAAa,CAAb,EAAc;AAAI,iBAAO,CAAC,KAAK,CAAC,CAAC,CAAD,CAAd;AAAoB,SAA7C,EAA+C,CAAC,GAAD,CAA/C,EAAsD,EAAtD,CAA7B;AACH,OAjDE;AAkDH,MAAA,eAAe,EAAE,YAAA;AACb,YAAI,GAAG,GAAG,UAAU,CAAC,KAAX,CAAiB,aAAjB,EAAgC,SAAhC,CAAV;AACA,YAAI,GAAG,CAAC,MAAJ,KAAe,CAAnB,EAAsB,OAAO,eAAe,CAAC,IAAD,CAAtB;AACtB,eAAO,sBAAsB,CAAC,IAAD,EAAO,UAAU,CAAV,EAAa,CAAb,EAAc;AAAI,iBAAO,CAAC,CAAC,OAAF,CAAU,CAAV,MAAiB,CAAC,CAAzB;AAA6B,SAAtD,EAAwD,GAAxD,EAA6D,EAA7D,CAA7B;AACH,OAtDE;AAuDH,MAAA,yBAAyB,EAAE,YAAA;AACvB,YAAI,GAAG,GAAG,UAAU,CAAC,KAAX,CAAiB,aAAjB,EAAgC,SAAhC,CAAV;AACA,YAAI,GAAG,CAAC,MAAJ,KAAe,CAAnB,EAAsB,OAAO,eAAe,CAAC,IAAD,CAAtB;AACtB,eAAO,sBAAsB,CAAC,IAAD,EAAO,UAAU,CAAV,EAAa,CAAb,EAAc;AAC9C,iBAAO,CAAC,CAAC,IAAF,CAAO,UAAS,CAAT,EAAU;AACpB,mBAAO,CAAC,CAAC,OAAF,CAAU,CAAV,MAAiB,CAAxB;AACH,WAFM,CAAP;AAEI,SAHqB,EAGnB,GAHmB,EAGd,SAHc,CAA7B;AAIH,OA9DE;AA+DH,MAAA,KAAK,EAAE,YAAA;AACH,YAAI,GAAG,GAAG,UAAU,CAAC,KAAX,CAAiB,aAAjB,EAAgC,SAAhC,CAAV;AACA,YAAI,OAAO,GAAG,SAAd;;AACA,YAAI;AAAE,UAAA,GAAG,CAAC,IAAJ,CAAS,OAAT;AAAoB,SAA1B,CAA2B,OAAM,CAAN,EAAS;AAAE,iBAAO,IAAI,CAAC,IAAD,EAAO,oBAAP,CAAX;AAA0C;;AAChF,YAAI,GAAG,CAAC,MAAJ,KAAe,CAAnB,EAAsB,OAAO,eAAe,CAAC,IAAD,CAAtB;AACtB,YAAI,CAAC,GAAG,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAAc,iBAAO,WAAW,CAAC,KAAZ,CAAkB,GAAG,CAAC,CAAD,CAArB,EAA0B,GAAG,CAAC,GAAG,CAAC,MAAJ,GAAa,CAAd,CAA7B,CAAP;AAAwD,SAA5F,CAAR;;AAEA,QAAA,CAAC,CAAC,kBAAF,GAAuB,UAAU,SAAV,EAAmB;AACtC,UAAA,OAAO,GAAI,SAAS,KAAK,MAAd,GAAuB,SAAvB,GAAmC,UAA9C;AACA,UAAA,GAAG,CAAC,IAAJ,CAAS,OAAT;AACH,SAHD;;AAIA,YAAI,CAAC,GAAG,CAAR;;AACA,QAAA,CAAC,CAAC,aAAF,CAAgB,UAAU,MAAV,EAAkB,OAAlB,EAA2B,OAA3B,EAAkC;AAC9C,cAAI,GAAG,GAAG,MAAM,CAAC,GAAjB;;AACA,iBAAO,OAAO,CAAC,GAAD,EAAM,GAAG,CAAC,CAAD,CAAT,CAAP,GAAuB,CAA9B,EAAiC;;AAE7B,cAAE,CAAF;;AACA,gBAAI,CAAC,KAAK,GAAG,CAAC,MAAd,EAAsB;;AAElB,cAAA,OAAO,CAAC,OAAD,CAAP;AACA,qBAAO,KAAP;AACH;AACJ;;AACD,cAAI,OAAO,CAAC,GAAD,EAAM,GAAG,CAAC,CAAD,CAAT,CAAP,KAAyB,CAA7B,EAAgC;;AAE5B,mBAAO,IAAP;AACH,WAHD,MAGO;;AAEH,YAAA,OAAO,CAAC,YAAA;AAAc,cAAA,MAAM,CAAC,QAAP,CAAgB,GAAG,CAAC,CAAD,CAAnB;AAA0B,aAAzC,CAAP;AACA,mBAAO,KAAP;AACH;AACJ,SAnBD;;AAoBA,eAAO,CAAP;AACH,OAhGE;AAkGH,MAAA,QAAQ,EAAE,UAAS,KAAT,EAAc;AACpB,eAAO,KAAK,UAAL,CAAgB,CAAC,CAAC,MAAD,EAAS,KAAT,CAAD,EAAiB,CAAC,KAAD,EAAQ,MAAR,CAAjB,CAAhB,EAAmD;AAAC,UAAA,aAAa,EAAE,KAAhB;AAAuB,UAAA,aAAa,EAAE;AAAtC,SAAnD,CAAP;AACH,OApGE;AAsGH,MAAA,MAAM,EAAE,YAAA;AACJ,YAAI,GAAG,GAAG,UAAU,CAAC,KAAX,CAAiB,aAAjB,EAAgC,SAAhC,CAAV;AACA,YAAI,GAAG,CAAC,MAAJ,KAAe,CAAnB,EAAsB,OAAO,IAAI,UAAJ,CAAgB,IAAhB,CAAP,CAFlB,CAE+C;;AACnD,YAAI;AAAE,UAAA,GAAG,CAAC,IAAJ,CAAS,SAAT;AAAsB,SAA5B,CAA6B,OAAM,CAAN,EAAS;AAAE,iBAAO,IAAI,CAAC,IAAD,EAAO,oBAAP,CAAX;AAAyC,SAH7E;;;AAKJ,YAAI,MAAM,GAAG,GAAG,CAAC,MAAJ,CAAW,UAAU,GAAV,EAAe,GAAf,EAAkB;AAAI,iBAAO,GAAG,GAAG,GAAG,CAAC,MAAJ,CAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAJ,GAAa,CAAd,CAAH,CAAoB,CAApB,CAAD,EAAyB,GAAzB,CAAD,CAAX,CAAH,GAAiD,CAAC,CAAC,MAAD,EAAS,GAAT,CAAD,CAA3D;AAA6E,SAA9G,EAAgH,IAAhH,CAAb;AACA,QAAA,MAAM,CAAC,IAAP,CAAY,CAAC,GAAG,CAAC,GAAG,CAAC,MAAJ,GAAa,CAAd,CAAJ,EAAsB,MAAtB,CAAZ;AACA,eAAO,KAAK,UAAL,CAAgB,MAAhB,EAAwB;AAAC,UAAA,aAAa,EAAE,KAAhB;AAAuB,UAAA,aAAa,EAAE;AAAtC,SAAxB,CAAP;AACH,OA9GE;;;;;;;;;;AAwHH,MAAA,UAAU,EAAE,UAAU,MAAV,EAAkB,OAAlB,EAAyB;AACjC,YAAI,MAAM,CAAC,MAAP,KAAkB,CAAtB,EAAyB,OAAO,eAAe,CAAC,IAAD,CAAtB;;AACzB,YAAI,CAAC,MAAM,CAAC,KAAP,CAAa,UAAU,KAAV,EAAe;AAAI,iBAAO,KAAK,CAAC,CAAD,CAAL,KAAa,SAAb,IAA0B,KAAK,CAAC,CAAD,CAAL,KAAa,SAAvC,IAAoD,SAAS,CAAC,KAAK,CAAC,CAAD,CAAN,EAAW,KAAK,CAAC,CAAD,CAAhB,CAAT,IAAiC,CAA5F;AAA+F,SAA/H,CAAL,EAAuI;AACnI,iBAAO,IAAI,CAAC,IAAD,EAAO,4HAAP,EAAqI,UAAU,CAAC,eAAhJ,CAAX;AACH;;AACD,YAAI,aAAa,GAAG,CAAC,OAAD,IAAY,OAAO,CAAC,aAAR,KAA0B,KAA1D,CALiC,CAK+B;;AAChE,YAAI,aAAa,GAAG,OAAO,IAAI,OAAO,CAAC,aAAR,KAA0B,IAAzD,CANiC,CAM6B;;AAE9D,iBAAA,QAAA,CAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AAC/B,eAAK,IAAI,CAAC,GAAC,CAAN,EAAQ,CAAC,GAAC,MAAM,CAAC,MAAtB,EAA6B,CAAC,GAAC,CAA/B,EAAiC,EAAE,CAAnC,EAAsC;AAClC,gBAAI,KAAK,GAAG,MAAM,CAAC,CAAD,CAAlB;;AACA,gBAAI,GAAG,CAAC,QAAQ,CAAC,CAAD,CAAT,EAAc,KAAK,CAAC,CAAD,CAAnB,CAAH,GAA6B,CAA7B,IAAkC,GAAG,CAAC,QAAQ,CAAC,CAAD,CAAT,EAAc,KAAK,CAAC,CAAD,CAAnB,CAAH,GAA6B,CAAnE,EAAsE;AAClE,cAAA,KAAK,CAAC,CAAD,CAAL,GAAW,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,EAAW,QAAQ,CAAC,CAAD,CAAnB,CAAd;AACA,cAAA,KAAK,CAAC,CAAD,CAAL,GAAW,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,EAAW,QAAQ,CAAC,CAAD,CAAnB,CAAd;AACA;AACH;AACJ;;AACD,cAAI,CAAC,KAAK,CAAV,EACI,MAAM,CAAC,IAAP,CAAY,QAAZ;AACJ,iBAAO,MAAP;AACH;;AAED,YAAI,aAAa,GAAG,SAApB;;AACA,iBAAA,WAAA,CAAqB,CAArB,EAAuB,CAAvB,EAAwB;AAAI,iBAAO,aAAa,CAAC,CAAC,CAAC,CAAD,CAAF,EAAO,CAAC,CAAC,CAAD,CAAR,CAApB;AAAkC,SAvB7B;;;AA0BjC,YAAI,GAAJ;;AACA,YAAI;AACA,UAAA,GAAG,GAAG,MAAM,CAAC,MAAP,CAAc,QAAd,EAAwB,EAAxB,CAAN;AACA,UAAA,GAAG,CAAC,IAAJ,CAAS,WAAT;AACH,SAHD,CAGE,OAAM,EAAN,EAAU;AACR,iBAAO,IAAI,CAAC,IAAD,EAAO,oBAAP,CAAX;AACH;;AAED,YAAI,CAAC,GAAG,CAAR;AACA,YAAI,uBAAuB,GAAG,aAAa,GACvC,UAAS,GAAT,EAAY;AAAI,iBAAO,SAAS,CAAC,GAAD,EAAM,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAN,CAAT,GAA4B,CAAnC;AAAuC,SADhB,GAEvC,UAAS,GAAT,EAAY;AAAI,iBAAO,SAAS,CAAC,GAAD,EAAM,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAN,CAAT,IAA6B,CAApC;AAAwC,SAF5D;AAIA,YAAI,uBAAuB,GAAG,aAAa,GACvC,UAAS,GAAT,EAAY;AAAI,iBAAO,UAAU,CAAC,GAAD,EAAM,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAN,CAAV,GAA6B,CAApC;AAAwC,SADjB,GAEvC,UAAS,GAAT,EAAY;AAAI,iBAAO,UAAU,CAAC,GAAD,EAAM,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAN,CAAV,IAA8B,CAArC;AAAyC,SAF7D;;AAIA,iBAAA,qBAAA,CAAgC,GAAhC,EAAmC;AAC/B,iBAAO,CAAC,uBAAuB,CAAC,GAAD,CAAxB,IAAiC,CAAC,uBAAuB,CAAC,GAAD,CAAhE;AACH;;AAED,YAAI,QAAQ,GAAG,uBAAf;AAEA,YAAI,CAAC,GAAG,IAAI,UAAJ,CAAgB,IAAhB,EAAsB,YAAA;AAC1B,iBAAO,WAAW,CAAC,KAAZ,CAAkB,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAlB,EAA6B,GAAG,CAAC,GAAG,CAAC,MAAJ,GAAa,CAAd,CAAH,CAAoB,CAApB,CAA7B,EAAqD,CAAC,aAAtD,EAAqE,CAAC,aAAtE,CAAP;AACH,SAFO,CAAR;;AAIA,QAAA,CAAC,CAAC,kBAAF,GAAuB,UAAU,SAAV,EAAmB;AACtC,cAAI,SAAS,KAAK,MAAlB,EAA0B;AACtB,YAAA,QAAQ,GAAG,uBAAX;AACA,YAAA,aAAa,GAAG,SAAhB;AACH,WAHD,MAGO;AACH,YAAA,QAAQ,GAAG,uBAAX;AACA,YAAA,aAAa,GAAG,UAAhB;AACH;;AACD,UAAA,GAAG,CAAC,IAAJ,CAAS,WAAT;AACH,SATD;;AAWA,QAAA,CAAC,CAAC,aAAF,CAAgB,UAAU,MAAV,EAAkB,OAAlB,EAA2B,OAA3B,EAAkC;AAC9C,cAAI,GAAG,GAAG,MAAM,CAAC,GAAjB;;AACA,iBAAO,QAAQ,CAAC,GAAD,CAAf,EAAsB;;AAElB,cAAE,CAAF;;AACA,gBAAI,CAAC,KAAK,GAAG,CAAC,MAAd,EAAsB;;AAElB,cAAA,OAAO,CAAC,OAAD,CAAP;AACA,qBAAO,KAAP;AACH;AACJ;;AACD,cAAI,qBAAqB,CAAC,GAAD,CAAzB,EAAgC;;AAE5B,mBAAO,IAAP;AACH,WAHD,MAGO,IAAI,GAAG,CAAC,GAAD,EAAK,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAL,CAAH,KAAuB,CAAvB,IAA4B,GAAG,CAAC,GAAD,EAAK,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAL,CAAH,KAAuB,CAAvD,EAA0D;;;AAG7D,mBAAO,KAAP;AACH,WAJM,MAIA;;AAEH,YAAA,OAAO,CAAC,YAAA;AACJ,kBAAI,aAAa,KAAK,SAAtB,EAAiC,MAAM,CAAC,QAAP,CAAgB,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAhB,EAAjC,KACK,MAAM,CAAC,QAAP,CAAgB,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,CAAhB;AACR,aAHM,CAAP;AAIA,mBAAO,KAAP;AACH;AACJ,SA1BD;;AA2BA,eAAO,CAAP;AACH,OApNE;AAqNH,MAAA,eAAe,EAAE,YAAA;AACb,YAAI,GAAG,GAAG,UAAU,CAAC,KAAX,CAAiB,aAAjB,EAAgC,SAAhC,CAAV;;AAEA,YAAI,CAAC,GAAG,CAAC,KAAJ,CAAU,UAAU,CAAV,EAAW;AAAI,iBAAO,OAAO,CAAP,KAAa,QAApB;AAA+B,SAAxD,CAAL,EAAgE;AAC5D,iBAAO,IAAI,CAAC,IAAD,EAAO,2CAAP,CAAX;AACH;;AACD,YAAI,GAAG,CAAC,MAAJ,KAAe,CAAnB,EAAsB,OAAO,eAAe,CAAC,IAAD,CAAtB;AAEtB,eAAO,KAAK,UAAL,CAAgB,GAAG,CAAC,GAAJ,CAAQ,UAAS,GAAT,EAAY;AACvC,iBAAO,CAAC,GAAD,EAAM,GAAG,GAAG,SAAZ,CAAP;AACH,SAFsB,CAAhB,CAAP;AAGH;AAhOE,KAAP;AAkOH,GA9UI,CAAL,CAzgDyC;;;;;;;;AAm2DzC,WAAA,UAAA,CAAoB,WAApB,EAAiC,iBAAjC,EAAkD;;;;;;AAM9C,QAAI,QAAQ,GAAG,IAAf;AAAA,QAAqB,KAAK,GAAG,IAA7B;AACA,QAAI,iBAAJ,EAAuB,IAAI;AACvB,MAAA,QAAQ,GAAG,iBAAiB,EAA5B;AACH,KAFsB,CAErB,OAAO,EAAP,EAAW;AACT,MAAA,KAAK,GAAG,EAAR;AACH;AAED,QAAI,QAAQ,GAAG,WAAW,CAAC,IAA3B;AAAA,QACI,KAAK,GAAG,QAAQ,CAAC,KADrB;AAEA,SAAK,IAAL,GAAY;AACR,MAAA,KAAK,EAAE,KADC;AAER,MAAA,KAAK,EAAE,QAAQ,CAAC,KAFR;AAGR,MAAA,SAAS,EAAG,CAAC,QAAQ,CAAC,KAAV,IAAoB,KAAK,CAAC,MAAN,CAAa,OAAb,CAAqB,OAArB,IAAgC,QAAQ,CAAC,KAAT,KAAmB,KAAK,CAAC,MAAN,CAAa,OAAb,CAAqB,IAHhG;AAIR,MAAA,KAAK,EAAE,QAJC;AAKR,MAAA,QAAQ,EAAE,KALF;AAMR,MAAA,GAAG,EAAE,MANG;AAOR,MAAA,MAAM,EAAE,EAPA;AAQR,MAAA,SAAS,EAAE,IARH;AASR,MAAA,MAAM,EAAE,IATA;AAUR,MAAA,YAAY,EAAE,IAVN;AAWR,MAAA,SAAS,EAAE,IAXH;AAYR,MAAA,OAAO,EAAE,IAZD;AAaR,MAAA,MAAM,EAAE,CAbA;AAcR,MAAA,KAAK,EAAE,QAdC;AAeR,MAAA,KAAK,EAAE,KAfC;AAgBR,MAAA,EAAE,EAAE,QAAQ,CAAC,EAhBL;AAiBR,MAAA,WAAW,EAAE,KAAK,CAAC,IAAN,CAAW,OAAX,CAAmB;AAjBxB,KAAZ;AAmBH;;AAED,WAAA,eAAA,CAA0B,GAA1B,EAA+B,iBAA/B,EAAgD;AAC5C,WAAO,EAAE,GAAG,CAAC,MAAJ,IAAc,GAAG,CAAC,SAAlB,IAA+B,GAAG,CAAC,EAArC,MACF,iBAAiB,GAAG,GAAG,CAAC,SAAP,GAAmB,CAAC,GAAG,CAAC,YADvC,CAAP;AAEH;;AAED,EAAA,KAAK,CAAC,UAAU,CAAC,SAAZ,EAAuB,YAAA;;;;AAMxB,aAAA,SAAA,CAAmB,GAAnB,EAAwB,EAAxB,EAA0B;AACtB,MAAA,GAAG,CAAC,MAAJ,GAAa,OAAO,CAAC,GAAG,CAAC,MAAL,EAAa,EAAb,CAApB;AACH;;AAED,aAAA,eAAA,CAA0B,GAA1B,EAA+B,OAA/B,EAAwC,aAAxC,EAAqD;AACjD,UAAI,IAAI,GAAG,GAAG,CAAC,YAAf;AACA,MAAA,GAAG,CAAC,YAAJ,GAAmB,IAAI,GAAG,YAAA;AAAI,eAAA,OAAO,CAAC,IAAI,EAAL,EAAS,OAAO,EAAhB,CAAP;AAA0B,OAAjC,GAAoC,OAA3D;AACA,MAAA,GAAG,CAAC,SAAJ,GAAgB,aAAa,IAAI,CAAC,IAAlC;AACH;;AAED,aAAA,cAAA,CAAwB,GAAxB,EAA6B,EAA7B,EAA+B;AAC3B,MAAA,GAAG,CAAC,OAAJ,GAAc,OAAO,CAAC,GAAG,CAAC,OAAL,EAAc,EAAd,CAArB;AACH;;;;;;;;;;AASD,aAAA,eAAA,CAAyB,GAAzB,EAA8B,KAA9B,EAAmC;AAC/B,UAAI,GAAG,CAAC,SAAR,EAAmB,OAAO,KAAP;AACnB,UAAI,SAAS,GAAG,GAAG,CAAC,KAAJ,CAAU,MAAV,CAAiB,SAAjB,CAA2B,GAAG,CAAC,KAA/B,CAAhB;AACA,UAAI,CAAC,SAAL,EAAgB,MAAM,IAAI,UAAU,CAAC,MAAf,CAAsB,aAAa,GAAG,CAAC,KAAjB,GAAyB,mBAAzB,GAA+C,KAAK,CAAC,IAArD,GAA4D,iBAAlF,CAAN;AAChB,aAAO,KAAK,CAAC,KAAN,CAAY,SAAS,CAAC,IAAtB,CAAP;AACH;;;;;;;;;;;;AAWD,aAAA,UAAA,CAAoB,GAApB,EAAyB,KAAzB,EAA8B;AAC1B,UAAI,UAAU,GAAG,eAAe,CAAC,GAAD,EAAM,KAAN,CAAhC;AACA,aAAO,GAAG,CAAC,QAAJ,IAAgB,mBAAmB,UAAnC,GACH,UAAU,CAAC,aAAX,CAAyB,GAAG,CAAC,KAAJ,IAAa,IAAtC,EAA4C,GAAG,CAAC,GAAJ,GAAU,GAAG,CAAC,MAA1D,CADG,GAEH,UAAU,CAAC,UAAX,CAAsB,GAAG,CAAC,KAAJ,IAAa,IAAnC,EAAyC,GAAG,CAAC,GAAJ,GAAU,GAAG,CAAC,MAAvD,CAFJ;AAGH;;AAED,aAAA,IAAA,CAAc,GAAd,EAAmB,EAAnB,EAAuB,OAAvB,EAAgC,MAAhC,EAAwC,QAAxC,EAAgD;AAC5C,UAAI,MAAM,GAAG,GAAG,CAAC,YAAJ,GAAmB,OAAO,CAAC,GAAG,CAAC,MAAL,EAAa,GAAG,CAAC,YAAJ,EAAb,CAA1B,GAA6D,GAAG,CAAC,MAA9E;;AACA,UAAI,CAAC,GAAG,CAAC,EAAT,EAAa;AACT,QAAA,OAAO,CAAC,UAAU,CAAC,GAAD,EAAM,QAAN,CAAX,EAA4B,OAAO,CAAC,GAAG,CAAC,SAAL,EAAgB,MAAhB,CAAnC,EAA4D,EAA5D,EAAgE,OAAhE,EAAyE,MAAzE,EAAiF,CAAC,GAAG,CAAC,QAAL,IAAiB,GAAG,CAAC,WAAtG,CAAP;AACH,OAFD,MAEO,CAAC,YAAA;AACJ,YAAI,GAAG,GAAG,EAAV;AACA,YAAI,QAAQ,GAAG,CAAf;;AAEA,iBAAA,WAAA,GAAA;AACI,cAAI,EAAE,QAAF,KAAe,CAAnB,EAAsB,OAAO,GADjC,CACoC;AACnC;;AAED,iBAAA,KAAA,CAAe,IAAf,EAAqB,MAArB,EAA6B,OAA7B,EAAoC;AAChC,cAAI,CAAC,MAAD,IAAW,MAAM,CAAC,MAAD,EAAS,OAAT,EAAkB,WAAlB,EAA+B,MAA/B,CAArB,EAA6D;AACzD,gBAAI,UAAU,GAAG,MAAM,CAAC,UAAxB;AACA,gBAAI,GAAG,GAAG,KAAK,UAAf;AACA,gBAAI,GAAG,KAAK,sBAAZ,EAAoC,GAAG,GAAG,KAAK,IAAI,UAAJ,CAAe,UAAf,CAAX;;AACpC,gBAAI,CAAC,MAAM,CAAC,GAAD,EAAM,GAAN,CAAX,EAAuB;AACnB,cAAA,GAAG,CAAC,GAAD,CAAH,GAAW,IAAX;AACA,cAAA,EAAE,CAAC,IAAD,EAAO,MAAP,EAAe,OAAf,CAAF;AACH;AACJ;AACJ;;AAED,QAAA,GAAG,CAAC,EAAJ,CAAO,QAAP,CAAgB,KAAhB,EAAuB,WAAvB,EAAoC,MAApC,EAA4C,QAA5C;;AACA,QAAA,OAAO,CAAC,UAAU,CAAC,GAAD,EAAM,QAAN,CAAX,EAA4B,GAAG,CAAC,SAAhC,EAA2C,KAA3C,EAAkD,WAAlD,EAA+D,MAA/D,EAAuE,CAAC,GAAG,CAAC,QAAL,IAAiB,GAAG,CAAC,WAA5F,CAAP;AACH,OAtBM;AAuBV;;AAED,WAAO;;;;AAMH,MAAA,KAAK,EAAE,UAAU,EAAV,EAAc,EAAd,EAAgB;AACnB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,eAAO,GAAG,CAAC,KAAJ,GACH,GAAG,CAAC,KAAJ,CAAU,MAAV,CAAiB,IAAjB,EAAuB,SAAS,CAAC,IAAV,CAAe,IAAf,EAAqB,GAAG,CAAC,KAAzB,CAAvB,CADG,GAEH,GAAG,CAAC,KAAJ,CAAU,SAAV,CAAoB,QAApB,EAA8B,EAA9B,EAAkC,IAAlC,CAAuC,EAAvC,CAFJ;AAGH,OAXE;AAYH,MAAA,MAAM,EAAE,UAAU,EAAV,EAAY;AAChB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,eAAO,GAAG,CAAC,KAAJ,GACH,GAAG,CAAC,KAAJ,CAAU,MAAV,CAAiB,IAAjB,EAAuB,SAAS,CAAC,IAAV,CAAe,IAAf,EAAqB,GAAG,CAAC,KAAzB,CAAvB,CADG,GAEH,GAAG,CAAC,KAAJ,CAAU,SAAV,CAAoB,SAApB,EAA+B,EAA/B,EAAmC,QAAnC,CAFJ,CAFgB,CAIiC;AACpD,OAjBE;AAkBH,MAAA,aAAa,EAAE,UAAU,EAAV,EAAY;AACvB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,QAAA,GAAG,CAAC,SAAJ,GAAgB,OAAO,CAAC,GAAG,CAAC,SAAL,EAAgB,EAAhB,CAAvB;AACH,OArBE;AAuBH,MAAA,QAAQ,EAAE,UAAU,EAAV,EAAc,OAAd,EAAuB,MAAvB,EAA+B,QAA/B,EAAuC;AAC7C,eAAO,IAAI,CAAC,KAAK,IAAN,EAAY,EAAZ,EAAgB,OAAhB,EAAyB,MAAzB,EAAiC,QAAjC,CAAX;AACH,OAzBE;AA2BH,MAAA,KAAK,EAAE,UAAUL,QAAV,EAAe;AAClB,YAAI,EAAE,GAAG,MAAM,CAAC,MAAP,CAAc,KAAK,WAAL,CAAiB,SAA/B,CAAT;AAAA,YACI,GAAG,GAAG,MAAM,CAAC,MAAP,CAAc,KAAK,IAAnB,CADV;AAEA,YAAIA,QAAJ,EAAW,MAAM,CAAC,GAAD,EAAMA,QAAN,CAAN;AACX,QAAA,EAAE,CAAC,IAAH,GAAU,GAAV;AACA,eAAO,EAAP;AACH,OAjCE;AAmCH,MAAA,GAAG,EAAE,YAAA;AACD,aAAK,IAAL,CAAU,WAAV,GAAwB,IAAxB;AACA,eAAO,IAAP;AACH,OAtCE;;;;AA4CH,MAAA,IAAI,EAAE,UAAU,EAAV,EAAY;AACd,YAAI,GAAG,GAAG,KAAK,IAAf;AAEA,eAAO,KAAK,KAAL,CAAW,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AACjD,UAAA,IAAI,CAAC,GAAD,EAAM,EAAN,EAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,CAAJ;AACH,SAFM,CAAP;AAGH,OAlDE;AAoDH,MAAA,KAAK,EAAE,UAAU,EAAV,EAAY;AACf,YAAI,GAAG,GAAG,KAAK,IAAf;;AAEA,YAAI,eAAe,CAAC,GAAD,EAAM,IAAN,CAAnB,EAAgC;;AAE5B,iBAAO,KAAK,KAAL,CAAW,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AACjD,gBAAI,GAAG,GAAG,eAAe,CAAC,GAAD,EAAM,QAAN,CAAzB;AACA,gBAAI,GAAG,GAAI,GAAG,CAAC,KAAJ,GAAY,GAAG,CAAC,KAAJ,CAAU,GAAG,CAAC,KAAd,CAAZ,GAAmC,GAAG,CAAC,KAAJ,EAA9C;AACA,YAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;;AACA,YAAA,GAAG,CAAC,SAAJ,GAAgB,UAAU,CAAV,EAAW;AACvB,cAAA,OAAO,CAAC,IAAI,CAAC,GAAL,CAAS,CAAC,CAAC,MAAF,CAAS,MAAlB,EAA0B,GAAG,CAAC,KAA9B,CAAD,CAAP;AACH,aAFD;AAGH,WAPM,EAOJ,EAPI,CAAP;AAQH,SAVD,MAUO;;AAEH,cAAI,KAAK,GAAG,CAAZ;AACA,iBAAO,KAAK,KAAL,CAAW,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AACjD,YAAA,IAAI,CAAC,GAAD,EAAM,YAAA;AAAc,gBAAE,KAAF;AAAS,qBAAO,KAAP;AAAe,aAA5C,EAA8C,YAAA;AAAc,cAAA,OAAO,CAAC,KAAD,CAAP;AAAiB,aAA7E,EAA+E,MAA/E,EAAuF,QAAvF,CAAJ;AACH,WAFM,EAEJ,EAFI,CAAP;AAGH;AACJ,OAxEE;AA0EH,MAAA,MAAM,EAAE,UAAU,OAAV,EAAmB,EAAnB,EAAqB;;AAEzB,YAAI,KAAK,GAAG,OAAO,CAAC,KAAR,CAAc,GAAd,EAAmB,OAAnB,EAAZ;AAAA,YACI,QAAQ,GAAG,KAAK,CAAC,CAAD,CADpB;AAAA,YAEI,SAAS,GAAG,KAAK,CAAC,MAAN,GAAe,CAF/B;;AAGA,iBAAA,MAAA,CAAgB,GAAhB,EAAqB,CAArB,EAAsB;AAClB,cAAI,CAAJ,EAAO,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,CAAJ,EAAgB,CAAC,GAAG,CAApB,CAAb;AACP,iBAAO,GAAG,CAAC,QAAD,CAAV;AACH;;AACD,YAAI,KAAK,GAAG,KAAK,IAAL,CAAU,GAAV,KAAkB,MAAlB,GAA2B,CAA3B,GAA+B,CAAC,CAA5C;;AAEA,iBAAA,MAAA,CAAgB,CAAhB,EAAmB,CAAnB,EAAoB;AAChB,cAAI,IAAI,GAAG,MAAM,CAAC,CAAD,EAAI,SAAJ,CAAjB;AAAA,cACI,IAAI,GAAG,MAAM,CAAC,CAAD,EAAI,SAAJ,CADjB;AAEA,iBAAO,IAAI,GAAG,IAAP,GAAc,CAAC,KAAf,GAAuB,IAAI,GAAG,IAAP,GAAc,KAAd,GAAsB,CAApD;AACH;;AACD,eAAO,KAAK,OAAL,CAAa,UAAU,CAAV,EAAW;AAC3B,iBAAO,CAAC,CAAC,IAAF,CAAO,MAAP,CAAP;AACH,SAFM,EAEJ,IAFI,CAEC,EAFD,CAAP;AAGH,OA7FE;AA+FH,MAAA,OAAO,EAAE,UAAU,EAAV,EAAY;AACjB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,eAAO,KAAK,KAAL,CAAW,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAmC;AACjD,cAAI,SAAS,IAAI,GAAG,CAAC,GAAJ,KAAY,MAAzB,IAAmC,eAAe,CAAC,GAAD,EAAM,IAAN,CAAlD,IAAiE,GAAG,CAAC,KAAJ,GAAY,CAAjF,EAAoF;;;AAGhF,gBAAI,WAAW,GAAG,GAAG,CAAC,KAAJ,CAAU,IAAV,CAAe,OAAf,CAAuB,IAAzC;AACA,gBAAI,UAAU,GAAG,eAAe,CAAC,GAAD,EAAM,QAAN,CAAhC;AACA,gBAAI,GAAG,GAAG,GAAG,CAAC,KAAJ,GAAY,QAAZ,GACN,UAAU,CAAC,MAAX,CAAkB,GAAG,CAAC,KAAtB,EAA6B,GAAG,CAAC,KAAjC,CADM,GAEN,UAAU,CAAC,MAAX,CAAkB,GAAG,CAAC,KAAtB,CAFJ;AAGA,YAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,YAAA,GAAG,CAAC,SAAJ,GAAgB,WAAW,KAAK,MAAhB,GACZ,mBAAmB,CAAC,OAAD,CADP,GAEZ,mBAAmB,CAAC,UAAA,GAAA,EAAG;AACnB,kBAAI;AAAC,gBAAA,OAAO,CAAE,GAAG,CAAC,GAAJ,CAAQ,WAAR,CAAF,CAAP;AAAgC,eAArC,CAAsC,OAAM,CAAN,EAAS;AAAC,gBAAA,MAAM,CAAC,CAAD,CAAN;AAAW;AAC9D,aAFkB,CAFvB;AAKH,WAdD,MAcO;;AAEH,gBAAI,CAAC,GAAG,EAAR;AACA,YAAA,IAAI,CAAC,GAAD,EAAM,UAAU,IAAV,EAAc;AAAI,cAAA,CAAC,CAAC,IAAF,CAAO,IAAP;AAAe,aAAvC,EAAyC,SAAA,aAAA,GAAA;AACzC,cAAA,OAAO,CAAC,CAAD,CAAP;AACH,aAFG,EAED,MAFC,EAEO,QAFP,CAAJ;AAGH;AACJ,SAtBM,EAsBJ,EAtBI,CAAP;AAuBH,OAxHE;AA0HH,MAAA,MAAM,EAAE,UAAU,MAAV,EAAgB;AACpB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,YAAI,MAAM,IAAI,CAAd,EAAiB,OAAO,IAAP;AACjB,QAAA,GAAG,CAAC,MAAJ,IAAc,MAAd,CAHoB,CAGC;;AACrB,YAAI,eAAe,CAAC,GAAD,CAAnB,EAA0B;AACtB,UAAA,eAAe,CAAC,GAAD,EAAM,YAAA;AACjB,gBAAI,UAAU,GAAG,MAAjB;AACA,mBAAO,UAAC,MAAD,EAAS,OAAT,EAAgB;AACnB,kBAAI,UAAU,KAAK,CAAnB,EAAsB,OAAO,IAAP;;AACtB,kBAAI,UAAU,KAAK,CAAnB,EAAsB;AAAE,kBAAE,UAAF;AAAc,uBAAO,KAAP;AAAe;;AACrD,cAAA,OAAO,CAAC,YAAA;AACJ,gBAAA,MAAM,CAAC,OAAP,CAAe,UAAf;AACA,gBAAA,UAAU,GAAG,CAAb;AACH,eAHM,CAAP;AAIA,qBAAO,KAAP;AACH,aARD;AASH,WAXc,CAAf;AAYH,SAbD,MAaO;AACH,UAAA,eAAe,CAAC,GAAD,EAAM,YAAA;AACjB,gBAAI,UAAU,GAAG,MAAjB;AACA,mBAAO,YAAA;AAAM,qBAAC,EAAE,UAAF,GAAe,CAAhB;AAAkB,aAA/B;AACH,WAHc,CAAf;AAIH;;AACD,eAAO,IAAP;AACH,OAlJE;AAoJH,MAAA,KAAK,EAAE,UAAU,OAAV,EAAiB;AACpB,aAAK,IAAL,CAAU,KAAV,GAAkB,IAAI,CAAC,GAAL,CAAS,KAAK,IAAL,CAAU,KAAnB,EAA0B,OAA1B,CAAlB,CADoB,CACiC;;AACrD,QAAA,eAAe,CAAC,KAAK,IAAN,EAAY,YAAA;AACvB,cAAI,QAAQ,GAAG,OAAf;AACA,iBAAO,UAAU,MAAV,EAAkB,OAAlB,EAA2B,OAA3B,EAAkC;AACrC,gBAAI,EAAE,QAAF,IAAc,CAAlB,EAAqB,OAAO,CAAC,OAAD,CAAP,CADgB,CACC;;AACtC,mBAAO,QAAQ,IAAI,CAAnB,CAFqC,CAEhB;AACxB,WAHD;AAIH,SANc,EAMZ,IANY,CAAf;AAOA,eAAO,IAAP;AACH,OA9JE;AAgKH,MAAA,KAAK,EAAE,UAAU,cAAV,EAA0B,iBAA1B,EAA2C;AAC9C,QAAA,SAAS,CAAC,KAAK,IAAN,EAAY,UAAU,MAAV,EAAkB,OAAlB,EAA2B,OAA3B,EAAkC;AACnD,cAAI,cAAc,CAAC,MAAM,CAAC,KAAR,CAAlB,EAAkC;AAC9B,YAAA,OAAO,CAAC,OAAD,CAAP;AACA,mBAAO,iBAAP;AACH,WAHD,MAGO;AACH,mBAAO,IAAP;AACH;AACJ,SAPQ,CAAT;AAQA,eAAO,IAAP;AACH,OA1KE;AA4KH,MAAA,KAAK,EAAE,UAAU,EAAV,EAAY;AACf,eAAO,KAAK,KAAL,CAAW,CAAX,EAAc,OAAd,CAAsB,UAAU,CAAV,EAAW;AAAI,iBAAO,CAAC,CAAC,CAAD,CAAR;AAAc,SAAnD,EAAqD,IAArD,CAA0D,EAA1D,CAAP;AACH,OA9KE;AAgLH,MAAA,IAAI,EAAE,UAAU,EAAV,EAAY;AACd,eAAO,KAAK,OAAL,GAAe,KAAf,CAAqB,EAArB,CAAP;AACH,OAlLE;AAoLH,MAAA,MAAM,EAAE,UAAU,cAAV,EAAwB;;AAE5B,QAAA,SAAS,CAAC,KAAK,IAAN,EAAY,UAAU,MAAV,EAAgB;AACjC,iBAAO,cAAc,CAAC,MAAM,CAAC,KAAR,CAArB;AACH,SAFQ,CAAT,CAF4B;;;AAO5B,QAAA,cAAc,CAAC,KAAK,IAAN,EAAY,cAAZ,CAAd;AACA,eAAO,IAAP;AACH,OA7LE;AA+LH,MAAA,GAAG,EAAE,UAAU,cAAV,EAAwB;AACzB,eAAO,KAAK,MAAL,CAAY,cAAZ,CAAP;AACH,OAjME;AAmMH,MAAA,EAAE,EAAE,UAAU,SAAV,EAAmB;AACnB,eAAO,IAAI,WAAJ,CAAgB,KAAK,IAAL,CAAU,KAA1B,EAAiC,SAAjC,EAA4C,IAA5C,CAAP;AACH,OArME;AAuMH,MAAA,OAAO,EAAE,YAAA;AACL,aAAK,IAAL,CAAU,GAAV,GAAiB,KAAK,IAAL,CAAU,GAAV,KAAkB,MAAlB,GAA2B,MAA3B,GAAoC,MAArD;AACA,YAAI,KAAK,kBAAT,EAA6B,KAAK,kBAAL,CAAwB,KAAK,IAAL,CAAU,GAAlC;AAC7B,eAAO,IAAP;AACH,OA3ME;AA6MH,MAAA,IAAI,EAAE,YAAA;AACF,eAAO,KAAK,OAAL,EAAP;AACH,OA/ME;AAiNH,MAAA,OAAO,EAAE,UAAU,EAAV,EAAY;AACjB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,QAAA,GAAG,CAAC,QAAJ,GAAe,CAAC,GAAG,CAAC,OAApB;AACA,eAAO,KAAK,IAAL,CAAU,UAAU,GAAV,EAAe,MAAf,EAAqB;AAAI,UAAA,EAAE,CAAC,MAAM,CAAC,GAAR,EAAa,MAAb,CAAF;AAAyB,SAA5D,CAAP;AACH,OArNE;AAuNH,MAAA,aAAa,EAAE,UAAU,EAAV,EAAY;AACvB,aAAK,IAAL,CAAU,MAAV,GAAmB,QAAnB;AACA,eAAO,KAAK,OAAL,CAAa,EAAb,CAAP;AACH,OA1NE;AA4NH,MAAA,cAAc,EAAE,UAAU,EAAV,EAAY;AACxB,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,QAAA,GAAG,CAAC,QAAJ,GAAe,CAAC,GAAG,CAAC,OAApB;AACA,eAAO,KAAK,IAAL,CAAU,UAAU,GAAV,EAAe,MAAf,EAAqB;AAAI,UAAA,EAAE,CAAC,MAAM,CAAC,UAAR,EAAoB,MAApB,CAAF;AAAgC,SAAnE,CAAP;AACH,OAhOE;AAkOH,MAAA,IAAI,EAAE,UAAU,EAAV,EAAY;AACd,YAAI,GAAG,GAAG,KAAK,IAAf;AACA,QAAA,GAAG,CAAC,QAAJ,GAAe,CAAC,GAAG,CAAC,OAApB;AACA,YAAI,CAAC,GAAG,EAAR;AACA,eAAO,KAAK,IAAL,CAAU,UAAU,IAAV,EAAgB,MAAhB,EAAsB;AACnC,UAAA,CAAC,CAAC,IAAF,CAAO,MAAM,CAAC,GAAd;AACH,SAFM,EAEJ,IAFI,CAEC,YAAA;AACJ,iBAAO,CAAP;AACH,SAJM,EAIJ,IAJI,CAIC,EAJD,CAAP;AAKH,OA3OE;AA6OH,MAAA,WAAW,EAAE,UAAU,EAAV,EAAY;AACrB,YAAI,GAAG,GAAG,KAAK,IAAf;;AACA,YAAI,SAAS,IAAI,GAAG,CAAC,GAAJ,KAAY,MAAzB,IAAmC,eAAe,CAAC,GAAD,EAAM,IAAN,CAAlD,IAAiE,GAAG,CAAC,KAAJ,GAAY,CAAjF,EAAoF;;;AAGhF,iBAAO,KAAK,KAAL,CAAW,UAAC,OAAD,EAAU,MAAV,EAAkB,QAAlB,EAA0B;AACxC,gBAAI,UAAU,GAAG,eAAe,CAAC,GAAD,EAAM,QAAN,CAAhC;AACA,gBAAI,GAAG,GAAG,GAAG,CAAC,KAAJ,GAAY,QAAZ,GACN,UAAU,CAAC,UAAX,CAAsB,GAAG,CAAC,KAA1B,EAAiC,GAAG,CAAC,KAArC,CADM,GAEN,UAAU,CAAC,UAAX,CAAsB,GAAG,CAAC,KAA1B,CAFJ;AAGA,YAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACA,YAAA,GAAG,CAAC,SAAJ,GAAgB,mBAAmB,CAAC,OAAD,CAAnC;AACH,WAPM,EAOJ,IAPI,CAOC,EAPD,CAAP;AAQH;;AACD,QAAA,GAAG,CAAC,QAAJ,GAAe,CAAC,GAAG,CAAC,OAApB;AACA,YAAI,CAAC,GAAG,EAAR;AACA,eAAO,KAAK,IAAL,CAAU,UAAU,IAAV,EAAgB,MAAhB,EAAsB;AACnC,UAAA,CAAC,CAAC,IAAF,CAAO,MAAM,CAAC,UAAd;AACH,SAFM,EAEJ,IAFI,CAEC,YAAA;AACJ,iBAAO,CAAP;AACH,SAJM,EAIJ,IAJI,CAIC,EAJD,CAAP;AAKH,OAlQE;AAoQH,MAAA,UAAU,EAAE,UAAU,EAAV,EAAY;AACpB,aAAK,IAAL,CAAU,MAAV,GAAmB,QAAnB;AACA,eAAO,KAAK,IAAL,CAAU,EAAV,CAAP;AACH,OAvQE;AAyQH,MAAA,QAAQ,EAAE,UAAU,EAAV,EAAY;AAClB,eAAO,KAAK,KAAL,CAAW,CAAX,EAAc,IAAd,CAAmB,UAAU,CAAV,EAAW;AAAI,iBAAO,CAAC,CAAC,CAAD,CAAR;AAAc,SAAhD,EAAkD,IAAlD,CAAuD,EAAvD,CAAP;AACH,OA3QE;AA6QH,MAAA,OAAO,EAAE,UAAU,EAAV,EAAY;AACjB,eAAO,KAAK,OAAL,GAAe,QAAf,CAAwB,EAAxB,CAAP;AACH,OA/QE;AAiRH,MAAA,QAAQ,EAAE,YAAA;AACN,YAAI,GAAG,GAAG,KAAK,IAAf;AAAA,YACI,GAAG,GAAG,GAAG,CAAC,KAAJ,IAAa,GAAG,CAAC,KAAJ,CAAU,MAAV,CAAiB,SAAjB,CAA2B,GAAG,CAAC,KAA/B,CADvB;AAEA,YAAI,CAAC,GAAD,IAAQ,CAAC,GAAG,CAAC,KAAjB,EAAwB,OAAO,IAAP,CAHlB,CAG8B;;AACpC,YAAI,GAAG,GAAG,EAAV;AACA,QAAA,SAAS,CAAC,KAAK,IAAN,EAAY,UAAU,MAAV,EAAgB;AACjC,cAAI,MAAM,GAAG,MAAM,CAAC,UAAP,CAAkB,QAAlB,EAAb,CADiC,CACS;;AAC1C,cAAI,KAAK,GAAG,MAAM,CAAC,GAAD,EAAM,MAAN,CAAlB;AACA,UAAA,GAAG,CAAC,MAAD,CAAH,GAAc,IAAd;AACA,iBAAO,CAAC,KAAR;AACH,SALQ,CAAT;AAMA,eAAO,IAAP;AACH,OA7RE;;;;AAmSH,MAAA,MAAM,EAAE,UAAU,OAAV,EAAiB;AACrB,YAAI,IAAI,GAAG,IAAX;AAAA,YACI,GAAG,GAAG,KAAK,IADf;AAAA,YAEI,IAAI,GAAG,GAAG,CAAC,KAAJ,CAAU,IAFrB;AAAA,YAGI,YAAY,GAAG,IAAI,CAAC,QAAL,CAAc,IAHjC;AAAA,YAII,YAAY,GAAG,IAAI,CAAC,QAAL,CAAc,IAJjC;AAMA,eAAO,KAAK,MAAL,CAAY,UAAU,OAAV,EAAmB,MAAnB,EAA2B,QAA3B,EAAqC,KAArC,EAA0C;AACzD,cAAI,QAAJ;;AACA,cAAI,OAAO,OAAP,KAAmB,UAAvB,EAAmC;;AAE/B,gBAAI,YAAY,KAAK,GAAjB,IAAwB,YAAY,KAAK,GAA7C,EAAkD;;AAE9C,cAAA,QAAQ,GAAG,OAAX;AACH,aAHD,MAGO;;;;AAIH,cAAA,QAAQ,GAAG,UAAU,IAAV,EAAc;AACrB,oBAAI,QAAQ,GAAG,SAAS,CAAC,IAAD,CAAxB,CADqB,CACU;;AAC/B,oBAAI,OAAO,CAAC,IAAR,CAAa,IAAb,EAAmB,IAAnB,EAAyB,IAAzB,MAAmC,KAAvC,EAA8C,OAAO,KAAP,CAFzB,CAEsC;;AAC3D,oBAAI,CAAC,MAAM,CAAC,IAAD,EAAO,OAAP,CAAX,EAA4B;;AAExB,kBAAA,YAAY,CAAC,IAAb,CAAkB,IAAlB,EAAwB,KAAK,OAA7B,EAAsC,IAAtC,EAA4C,KAA5C;AACH,iBAHD,MAGO;;AAEH,sBAAI,UAAU,GAAG,aAAa,CAAC,QAAD,EAAW,KAAK,KAAhB,CAA9B;AACA,sBAAI,iBAAiB,GAAG,YAAY,CAAC,IAAb,CAAkB,IAAlB,EAAwB,UAAxB,EAAoC,KAAK,OAAzC,EAAkD,QAAlD,EAA4D,KAA5D,CAAxB;;AACA,sBAAI,iBAAJ,EAAuB;;AAEnB,oBAAA,IAAI,GAAG,KAAK,KAAZ;AACA,oBAAA,IAAI,CAAC,iBAAD,CAAJ,CAAwB,OAAxB,CAAgC,UAAU,OAAV,EAAiB;AAC7C,sBAAA,YAAY,CAAC,IAAD,EAAO,OAAP,EAAgB,iBAAiB,CAAC,OAAD,CAAjC,CAAZ,CAD6C,CACW;AAC3D,qBAFD;AAGH;AACJ;AACJ,eAlBD;AAmBH;AACJ,WA7BD,MA6BO,IAAI,YAAY,KAAK,GAArB,EAA0B;;AAE7B,gBAAI,QAAQ,GAAG,IAAI,CAAC,OAAD,CAAnB;AACA,gBAAI,OAAO,GAAG,QAAQ,CAAC,MAAvB;;AACA,YAAA,QAAQ,GAAG,UAAU,IAAV,EAAc;AACrB,kBAAI,gBAAgB,GAAG,KAAvB;;AACA,mBAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,OAApB,EAA6B,EAAE,CAA/B,EAAkC;AAC9B,oBAAI,OAAO,GAAG,QAAQ,CAAC,CAAD,CAAtB;AAAA,oBAA2B,GAAG,GAAG,OAAO,CAAC,OAAD,CAAxC;;AACA,oBAAI,YAAY,CAAC,IAAD,EAAO,OAAP,CAAZ,KAAgC,GAApC,EAAyC;AACrC,kBAAA,YAAY,CAAC,IAAD,EAAO,OAAP,EAAgB,GAAhB,CAAZ,CADqC,CACJ;;AACjC,kBAAA,gBAAgB,GAAG,IAAnB;AACH;AACJ;;AACD,qBAAO,gBAAP;AACH,aAVD;AAWH,WAfM,MAeA;;;AAGH,gBAAI,WAAW,GAAG,OAAlB;AACA,YAAA,OAAO,GAAG,YAAY,CAAC,WAAD,CAAtB,CAJG,CAIiC;;AACpC,YAAA,QAAQ,GAAG,UAAU,IAAV,EAAc;AACrB,kBAAI,gBAAgB,GAAG,KAAvB;AACA,kBAAI,iBAAiB,GAAG,YAAY,CAAC,IAAb,CAAkB,IAAlB,EAAwB,OAAxB,EAAiC,KAAK,OAAtC,EAA+C,SAAS,CAAC,IAAD,CAAxD,EAAgE,KAAhE,CAAxB;AACA,kBAAI,iBAAJ,EAAuB,MAAM,CAAC,OAAD,EAAU,iBAAV,CAAN;AACvB,cAAA,IAAI,CAAC,OAAD,CAAJ,CAAc,OAAd,CAAsB,UAAU,OAAV,EAAiB;AACnC,oBAAI,GAAG,GAAG,OAAO,CAAC,OAAD,CAAjB;;AACA,oBAAI,YAAY,CAAC,IAAD,EAAO,OAAP,CAAZ,KAAgC,GAApC,EAAyC;AACrC,kBAAA,YAAY,CAAC,IAAD,EAAO,OAAP,EAAgB,GAAhB,CAAZ;AACA,kBAAA,gBAAgB,GAAG,IAAnB;AACH;AACJ,eAND;AAOA,kBAAI,iBAAJ,EAAuB,OAAO,GAAG,YAAY,CAAC,WAAD,CAAtB,CAXF,CAWsC;;AAC3D,qBAAO,gBAAP;AACH,aAbD;AAcH;;AAED,cAAI,KAAK,GAAG,CAAZ;AACA,cAAI,YAAY,GAAG,CAAnB;AACA,cAAI,iBAAiB,GAAG,KAAxB;AACA,cAAI,QAAQ,GAAG,EAAf;AACA,cAAI,QAAQ,GAAG,EAAf;AACA,cAAI,UAAU,GAAG,IAAjB;;AAEA,mBAAA,UAAA,CAAoB,IAApB,EAA0B,MAA1B,EAAgC;AAC5B,YAAA,UAAU,GAAG,MAAM,CAAC,UAApB;AACA,gBAAI,WAAW,GAAG;AACd,cAAA,OAAO,EAAE,MAAM,CAAC,UADF;AAEd,cAAA,KAAK,EAAE,IAFO;AAGd,cAAA,SAAS,EAAE,IAHG;AAId,cAAA,OAAO,EAAE;AAJK,aAAlB;;AAOA,qBAAA,OAAA,CAAiB,CAAjB,EAAkB;AACd,cAAA,QAAQ,CAAC,IAAT,CAAc,CAAd;AACA,cAAA,QAAQ,CAAC,IAAT,CAAc,WAAW,CAAC,OAA1B;AACA,cAAA,aAAa;AACb,qBAAO,IAAP,CAJc,CAIF;AACf;;AAED,gBAAI,QAAQ,CAAC,IAAT,CAAc,WAAd,EAA2B,IAA3B,EAAiC,WAAjC,MAAkD,KAAtD,EAA6D;AACzD,kBAAI,OAAO,GAAG,CAAC,MAAM,CAAC,WAAD,EAAc,OAAd,CAArB;AACA,gBAAE,KAAF;AACA,cAAA,QAAQ,CAAC,YAAA;AACL,oBAAI,GAAG,GAAI,OAAO,GAAG,MAAM,CAAC,MAAP,EAAH,GAAqB,MAAM,CAAC,MAAP,CAAc,WAAW,CAAC,KAA1B,CAAvC;AACA,gBAAA,GAAG,CAAC,QAAJ,GAAe,WAAf;AACA,gBAAA,GAAG,CAAC,OAAJ,GAAc,wBAAwB,CAAC,OAAD,CAAtC;AACA,gBAAA,GAAG,CAAC,SAAJ,GAAgB,yBAAyB,CAAC,YAAA;AACtC,oBAAE,YAAF;AACA,kBAAA,aAAa;AAChB,iBAHwC,CAAzC;AAIH,eARO,EAQL,OARK,CAAR;AASH,aAZD,MAYO,IAAI,WAAW,CAAC,SAAhB,EAA2B;;AAE9B,cAAA,WAAW,CAAC,SAAZ,CAAsB,WAAW,CAAC,KAAlC;AACH;AACJ;;AAED,mBAAA,QAAA,CAAkB,CAAlB,EAAmB;AACf,gBAAI,CAAJ,EAAO;AACH,cAAA,QAAQ,CAAC,IAAT,CAAc,CAAd;AACA,cAAA,QAAQ,CAAC,IAAT,CAAc,UAAd;AACH;;AACD,mBAAO,MAAM,CAAC,IAAI,WAAJ,CAAgB,qCAAhB,EAAuD,QAAvD,EAAiE,YAAjE,EAA+E,QAA/E,CAAD,CAAb;AACH;;AAED,mBAAA,aAAA,GAAA;AACI,gBAAI,iBAAiB,IAAI,YAAY,GAAG,QAAQ,CAAC,MAAxB,KAAmC,KAA5D,EAAmE;AAC/D,kBAAI,QAAQ,CAAC,MAAT,GAAkB,CAAtB,EACI,QAAQ,GADZ,KAGI,OAAO,CAAC,YAAD,CAAP;AACP;AACJ;;AACD,UAAA,IAAI,CAAC,KAAL,GAAa,GAAb,GAAmB,QAAnB,CAA4B,UAA5B,EAAwC,YAAA;AACpC,YAAA,iBAAiB,GAAG,IAApB;AACA,YAAA,aAAa;AAChB,WAHD,EAGG,QAHH,EAGa,QAHb;AAIH,SAhIM,CAAP;AAiIH,OA3aE;AA6aH,gBAAU,YAAA;AAAA,YAAA,KAAA,GAAA,IAAA;;AACN,YAAI,GAAG,GAAG,KAAK,IAAf;AAAA,YACI,KAAK,GAAG,GAAG,CAAC,KADhB;AAAA,YAEI,YAAY,GAAG,GAAG,CAAC,KAAJ,CAAU,IAAV,CAAe,QAAf,CAAwB,IAF3C;AAAA,YAGI,aAAa,GAAG,YAAY,KAAK,GAHrC;;AAIA,YAAI,CAAC,aAAD,IACA,eAAe,CAAC,GAAD,CADf,KAEE,GAAG,CAAC,SAAJ,IAAiB,CAAC,0BAAnB,IAAkD,CAAC,KAFpD,CAAJ,EAGA;;;;;AAKI,iBAAO,KAAK,MAAL,CAAY,UAAC,OAAD,EAAU,MAAV,EAAkB,QAAlB,EAA0B;;AAEzC,gBAAI,OAAO,GAAG,kBAAkB,CAAC,MAAD,CAAhC;AAAA,gBACI,QAAQ,GAAI,KAAK,GAAG,QAAQ,CAAC,KAAT,CAAe,KAAf,CAAH,GAA2B,QAAQ,CAAC,KAAT,EADhD;AAEA,YAAA,QAAQ,CAAC,OAAT,GAAmB,OAAnB;;AACA,YAAA,QAAQ,CAAC,SAAT,GAAqB,YAAA;AACjB,kBAAI,KAAK,GAAG,QAAQ,CAAC,MAArB;AACA,cAAA,QAAQ,CAAC,YAAA;AACL,oBAAI,MAAM,GAAI,KAAK,GAAG,QAAQ,CAAC,MAAT,CAAgB,KAAhB,CAAH,GAA4B,QAAQ,CAAC,KAAT,EAA/C;AACA,gBAAA,MAAM,CAAC,OAAP,GAAiB,OAAjB;;AACA,gBAAA,MAAM,CAAC,SAAP,GAAmB,YAAA;AAAM,yBAAA,OAAO,CAAC,KAAD,CAAP;AAAc,iBAAvC;AACH,eAJO,EAIL,UAAA,GAAA,EAAG;AAAI,uBAAA,MAAM,CAAC,GAAD,CAAN;AAAW,eAJb,CAAR;AAKH,aAPD;AAQH,WAbM,CAAP;AAcH,SA3BK;;;;;;AAiCN,YAAM,SAAS,GAAG,aAAa,GAAG,IAAH,GAAU,KAAzC;AAEA,eAAO,KAAK,MAAL,CAAY,UAAC,OAAD,EAAU,MAAV,EAAkB,QAAlB,EAA4B,KAA5B,EAAiC;AAChD,cAAI,UAAU,GAAG,CAAjB,CADgD;;AAGhD,cAAI,UAAU,GAAG,KAAI,CAChB,KADY,CACN;AACH,YAAA,QAAQ,EAAE,CAAC,GAAG,CAAC,OAAL,IAAgB,CAAC;AADxB,WADM,EAEiC;AAFjC,WAGZ,QAHY,GAGF;AAHE,WAKZ,KALY,CAKN,SALM,EAMZ,GANY,EAAjB,CAHgD,CASrC;;;AAEX,cAAI,YAAY,GAAG,EAAnB,CAXgD;;;AAehD,cAAM,SAAS,GAAG,YAAA;AAAM,mBAAA,UAAU,CAAC,IAAX,CAAgB,aAAa,GAAG,UAAC,GAAD,EAAM,MAAN,EAAY;;;AAGhE,cAAA,YAAY,CAAC,IAAb,CAAkB,CAAC,MAAM,CAAC,UAAR,EAAoB,MAAM,CAAC,KAA3B,CAAlB;AACH,aAJoD,GAIjD,UAAC,GAAD,EAAM,MAAN,EAAY;;AAEZ,cAAA,YAAY,CAAC,IAAb,CAAkB,MAAM,CAAC,UAAzB;AACH,aAPuB,EAOrB,IAPqB,CAOhB,YAAA;;AAEJ,cAAA,aAAa,GACT,YAAY,CAAC,IAAb,CAAkB,UAAC,CAAD,EAAI,CAAJ,EAAK;AAAG,uBAAA,SAAS,CAAC,CAAC,CAAC,CAAD,CAAF,EAAO,CAAC,CAAC,CAAD,CAAR,CAAT;AAAqB,eAA/C,CADS,GAET,YAAY,CAAC,IAAb,CAAkB,SAAlB,CAFJ;AAGA,qBAAO,UAAU,CAAC,QAAD,EAAW,KAAX,EAAkB,YAAlB,EAAgC,aAAhC,EAA+C,YAA/C,CAAjB;AAEH,aAduB,EAcrB,IAdqB,CAchB,YAAA;AACJ,kBAAI,KAAK,GAAG,YAAY,CAAC,MAAzB;AACA,cAAA,UAAU,IAAI,KAAd;AACA,cAAA,YAAY,GAAG,EAAf;AACA,qBAAO,KAAK,GAAG,SAAR,GAAoB,UAApB,GAAiC,SAAS,EAAjD;AACH,aAnBuB,CAAA;AAmBtB,WAnBF;;AAqBA,UAAA,OAAO,CAAE,SAAS,EAAX,CAAP;AACH,SArCM,CAAP;AAsCH;AAtfE,KAAP;AAwfH,GAvkBI,CAAL,CA54DyC;;;;;;;;AA89EzC,WAAA,iBAAA,CAA2B,CAA3B,EAA8B,CAA9B,EAA+B;AAC3B,WAAO,CAAC,CAAC,IAAF,CAAO,OAAP,GAAiB,CAAC,CAAC,IAAF,CAAO,OAA/B;AACH;;AAED,WAAA,aAAA,CAAuB,IAAvB,EAA6B,UAA7B,EAAyC,QAAzC,EAAiD;AAC7C,IAAA,UAAU,CAAC,OAAX,CAAmB,UAAU,SAAV,EAAmB;AAClC,UAAI,MAAM,GAAG,QAAQ,CAAC,SAAD,CAArB;AACA,MAAA,IAAI,CAAC,OAAL,CAAa,UAAA,GAAA,EAAG;AACZ,YAAI,EAAE,SAAS,IAAI,GAAf,CAAJ,EAAyB;AACrB,cAAI,GAAG,KAAK,WAAW,CAAC,SAApB,IAAiC,GAAG,YAAY,WAApD,EAAiE;;;AAG7D,YAAA,OAAO,CAAC,GAAD,EAAM,SAAN,EAAiB;AAAC,cAAA,GAAG,EAAA,YAAA;AAAK,uBAAO,KAAK,KAAL,CAAW,SAAX,CAAP;AAA+B;AAAxC,aAAjB,CAAP;AACH,WAJD,MAIO;;AAEH,YAAA,GAAG,CAAC,SAAD,CAAH,GAAiB,IAAI,KAAJ,CAAU,SAAV,EAAqB,MAArB,CAAjB;AACH;AACJ;AACJ,OAXD;AAYH,KAdD;AAeH;;AAED,WAAA,eAAA,CAAyB,IAAzB,EAA6B;AACzB,IAAA,IAAI,CAAC,OAAL,CAAa,UAAU,GAAV,EAAa;AACtB,WAAK,IAAI,GAAT,IAAgB,GAAhB,EAAqB;AACjB,YAAI,GAAG,CAAC,GAAD,CAAH,YAAoB,KAAxB,EAA+B,OAAO,GAAG,CAAC,GAAD,CAAV;AAClC;AACJ,KAJD;AAKH;;AAED,WAAA,OAAA,CAAiB,GAAjB,EAAsB,MAAtB,EAA8B,EAA9B,EAAkC,OAAlC,EAA2C,MAA3C,EAAmD,WAAnD,EAA8D;;AAG1D,QAAI,QAAQ,GAAG,WAAW,GAAG,UAAC,CAAD,EAAG,CAAH,EAAK,CAAL,EAAM;AAAK,aAAA,EAAE,CAAC,WAAW,CAAC,CAAD,CAAZ,EAAgB,CAAhB,EAAkB,CAAlB,CAAF;AAAsB,KAApC,GAAuC,EAAjE,CAH0D;;AAK1D,QAAI,SAAS,GAAG,IAAI,CAAC,QAAD,EAAW,MAAX,CAApB;AAEA,QAAI,CAAC,GAAG,CAAC,OAAT,EAAkB,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;;AAClB,QAAI,MAAJ,EAAY;AACR,MAAA,GAAG,CAAC,SAAJ,GAAgB,UAAU,CAAC,SAAA,aAAA,GAAA;AACvB,YAAI,MAAM,GAAG,GAAG,CAAC,MAAjB;;AACA,YAAI,MAAJ,EAAY;AACR,cAAI,CAAC,GAAG,YAAA;AAAc,YAAA,MAAM,CAAC,QAAP;AAAoB,WAA1C;;AACA,cAAI,MAAM,CAAC,MAAD,EAAS,UAAU,QAAV,EAAkB;AAAI,YAAA,CAAC,GAAG,QAAJ;AAAe,WAA9C,EAAgD,OAAhD,EAAyD,MAAzD,CAAV,EACI,SAAS,CAAC,MAAM,CAAC,KAAR,EAAe,MAAf,EAAuB,UAAU,QAAV,EAAkB;AAAI,YAAA,CAAC,GAAG,QAAJ;AAAe,WAA5D,CAAT;AACJ,UAAA,CAAC;AACJ,SALD,MAKO;AACH,UAAA,OAAO;AACV;AACJ,OAVyB,EAUvB,MAVuB,CAA1B;AAWH,KAZD,MAYO;AACH,MAAA,GAAG,CAAC,SAAJ,GAAgB,UAAU,CAAC,SAAA,aAAA,GAAA;AACvB,YAAI,MAAM,GAAG,GAAG,CAAC,MAAjB;;AACA,YAAI,MAAJ,EAAY;AACR,cAAI,CAAC,GAAG,YAAA;AAAc,YAAA,MAAM,CAAC,QAAP;AAAoB,WAA1C;;AACA,UAAA,SAAS,CAAC,MAAM,CAAC,KAAR,EAAe,MAAf,EAAuB,UAAU,QAAV,EAAkB;AAAI,YAAA,CAAC,GAAG,QAAJ;AAAe,WAA5D,CAAT;AACA,UAAA,CAAC;AACJ,SAJD,MAIO;AACH,UAAA,OAAO;AACV;AACJ,OATyB,EASvB,MATuB,CAA1B;AAUH;AACJ;;AAED,WAAA,gBAAA,CAA0B,OAA1B,EAAiC;;;AAG7B,QAAI,EAAE,GAAG,EAAT;AACA,IAAA,OAAO,CAAC,KAAR,CAAc,GAAd,EAAmB,OAAnB,CAA2B,UAAU,KAAV,EAAe;AACtC,MAAA,KAAK,GAAG,KAAK,CAAC,IAAN,EAAR;AACA,UAAI,IAAI,GAAG,KAAK,CAAC,OAAN,CAAc,cAAd,EAA8B,EAA9B,CAAX,CAFsC,CAEO;;;AAE7C,UAAI,OAAO,GAAG,MAAM,IAAN,CAAW,IAAX,IAAmB,IAAI,CAAC,KAAL,CAAW,YAAX,EAAyB,CAAzB,EAA4B,KAA5B,CAAkC,GAAlC,CAAnB,GAA4D,IAA1E;AAEA,MAAA,EAAE,CAAC,IAAH,CAAQ,IAAI,SAAJ,CACJ,IADI,EAEJ,OAAO,IAAI,IAFP,EAGJ,KAAK,IAAL,CAAU,KAAV,CAHI,EAIJ,KAAK,IAAL,CAAU,KAAV,CAJI,EAKJ,OAAO,IAAP,CAAY,KAAZ,CALI,EAMJ,OAAO,CAAC,OAAD,CANH,EAOJ,KAAK,IAAL,CAAU,KAAV,CAPI,CAAR;AASH,KAfD;AAgBA,WAAO,EAAP;AACH;;AAED,WAAA,GAAA,CAAa,IAAb,EAAmB,IAAnB,EAAuB;AACnB,WAAO,SAAS,CAAC,GAAV,CAAc,IAAd,EAAoB,IAApB,CAAP;AACH;;AAED,WAAA,GAAA,CAAa,CAAb,EAAgB,CAAhB,EAAiB;AACb,WAAO,GAAG,CAAC,CAAD,EAAI,CAAJ,CAAH,GAAY,CAAZ,GAAgB,CAAhB,GAAoB,CAA3B;AACH;;AAED,WAAA,GAAA,CAAa,CAAb,EAAgB,CAAhB,EAAiB;AACb,WAAO,GAAG,CAAC,CAAD,EAAI,CAAJ,CAAH,GAAY,CAAZ,GAAgB,CAAhB,GAAoB,CAA3B;AACH;;AAED,WAAA,SAAA,CAAmB,CAAnB,EAAqB,CAArB,EAAsB;AAClB,WAAO,SAAS,CAAC,GAAV,CAAc,CAAd,EAAgB,CAAhB,CAAP;AACH;;AAED,WAAA,UAAA,CAAoB,CAApB,EAAuB,CAAvB,EAAwB;AACpB,WAAO,SAAS,CAAC,GAAV,CAAc,CAAd,EAAgB,CAAhB,CAAP;AACH;;AAED,WAAA,aAAA,CAAuB,CAAvB,EAA0B,CAA1B,EAA2B;AACvB,WAAO,CAAC,GAAG,CAAJ,GAAQ,CAAC,CAAT,GAAa,CAAC,KAAK,CAAN,GAAU,CAAV,GAAc,CAAlC;AACH;;AAED,WAAA,oBAAA,CAA8B,CAA9B,EAAiC,CAAjC,EAAkC;AAC9B,WAAO,CAAC,GAAG,CAAJ,GAAQ,CAAC,CAAT,GAAa,CAAC,KAAK,CAAN,GAAU,CAAV,GAAc,CAAlC;AACH;;AAED,WAAA,OAAA,CAAiB,OAAjB,EAA0B,OAA1B,EAAiC;AAC7B,WAAO,OAAO,GACV,OAAO,GACH,YAAA;AAAc,aAAO,OAAO,CAAC,KAAR,CAAc,IAAd,EAAoB,SAApB,KAAkC,OAAO,CAAC,KAAR,CAAc,IAAd,EAAoB,SAApB,CAAzC;AAA0E,KADrF,GAEH,OAHM,GAIV,OAJJ;AAKH;;AAED,WAAA,gBAAA,GAAA;AACI,IAAA,EAAE,CAAC,KAAH,GAAW,KAAK,CAAC,OAAN,GAAgB,EAA3B;AACA,IAAA,EAAE,CAAC,SAAH,GAAe,YAAY,GAAG,EAA9B;AACA,IAAA,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,gBAAP,EAAyB,CAAzB,CAApB;AACA,QAAI,YAAY,CAAC,MAAb,KAAwB,CAA5B,EAA+B,OAJnC,CAI0C;;AACtC,QAAI,KAAK,GAAG,KAAK,CAAC,WAAN,CAAkB,mBAAmB,CAAC,YAAD,CAArC,EAAqD,UAArD,CAAZ;AACA,IAAA,YAAY,CAAC,OAAb,CAAqB,UAAU,SAAV,EAAmB;AACpC,UAAI,KAAK,GAAG,KAAK,CAAC,WAAN,CAAkB,SAAlB,CAAZ;AAAA,UACI,OAAO,GAAG,KAAK,CAAC,OADpB;AAAA,UAEI,MAAM,GAAG,OAAO,IAAI,OAAO,OAAP,KAAmB,QAA9B,IAA0C,OAAO,CAAC,OAAR,CAAgB,GAAhB,MAAyB,CAAC,CAFjF;AAGA,UAAI,OAAO,GAAG,IAAI,SAAJ,CAAc,OAAd,EAAuB,OAAO,IAAI,EAAlC,EAAsC,KAAtC,EAA6C,KAA7C,EAAoD,CAAC,CAAC,KAAK,CAAC,aAA5D,EAA2E,OAAO,IAAI,OAAO,OAAP,KAAmB,QAAzG,EAAmH,MAAnH,CAAd;AACA,UAAI,OAAO,GAAG,EAAd;;AACA,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,CAAC,UAAN,CAAiB,MAArC,EAA6C,EAAE,CAA/C,EAAkD;AAC9C,YAAI,QAAQ,GAAG,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,UAAN,CAAiB,CAAjB,CAAZ,CAAf;AACA,QAAA,OAAO,GAAG,QAAQ,CAAC,OAAnB;AACA,QAAA,MAAM,GAAG,OAAO,IAAI,OAAO,OAAP,KAAmB,QAA9B,IAA0C,OAAO,CAAC,OAAR,CAAgB,GAAhB,MAAyB,CAAC,CAA7E;AACA,YAAI,KAAK,GAAG,IAAI,SAAJ,CAAc,QAAQ,CAAC,IAAvB,EAA6B,OAA7B,EAAsC,CAAC,CAAC,QAAQ,CAAC,MAAjD,EAAyD,CAAC,CAAC,QAAQ,CAAC,UAApE,EAAgF,KAAhF,EAAuF,OAAO,IAAI,OAAO,OAAP,KAAmB,QAArH,EAA+H,MAA/H,CAAZ;AACA,QAAA,OAAO,CAAC,IAAR,CAAa,KAAb;AACH;;AACD,MAAA,YAAY,CAAC,SAAD,CAAZ,GAA0B,IAAI,WAAJ,CAAgB,SAAhB,EAA2B,OAA3B,EAAoC,OAApC,EAA6C,EAA7C,CAA1B;AACH,KAdD;AAeA,IAAA,aAAa,CAAC,CAAC,SAAD,CAAD,EAAc,IAAI,CAAC,YAAD,CAAlB,EAAkC,YAAlC,CAAb;AACH;;AAED,WAAA,0BAAA,CAAoC,MAApC,EAA4C,QAA5C,EAAoD;;;;;;AAMhD,QAAI,UAAU,GAAG,QAAQ,CAAC,EAAT,CAAY,gBAA7B;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,UAAU,CAAC,MAA/B,EAAuC,EAAE,CAAzC,EAA4C;AACxC,UAAI,SAAS,GAAG,UAAU,CAAC,CAAD,CAA1B;AACA,UAAI,KAAK,GAAG,QAAQ,CAAC,WAAT,CAAqB,SAArB,CAAZ;AACA,MAAA,SAAS,GAAG,YAAY,KAAxB;;AAEA,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,CAAC,UAAN,CAAiB,MAArC,EAA6C,EAAE,CAA/C,EAAkD;AAC9C,YAAI,SAAS,GAAG,KAAK,CAAC,UAAN,CAAiB,CAAjB,CAAhB;AACA,YAAI,OAAO,GAAG,KAAK,CAAC,KAAN,CAAY,SAAZ,EAAuB,OAArC;AACA,YAAI,SAAS,GAAG,OAAO,OAAP,KAAmB,QAAnB,GAA8B,OAA9B,GAAwC,MAAM,KAAK,CAAC,OAAD,CAAL,CAAe,IAAf,CAAoB,GAApB,CAAN,GAAiC,GAAzF;;AACA,YAAI,MAAM,CAAC,SAAD,CAAV,EAAuB;AACnB,cAAI,SAAS,GAAG,MAAM,CAAC,SAAD,CAAN,CAAkB,SAAlB,CAA4B,SAA5B,CAAhB;AACA,cAAI,SAAJ,EAAe,SAAS,CAAC,IAAV,GAAiB,SAAjB;AAClB;AACJ;AACJ,KAtB+C;;;AAyBhD,QAAI,SAAS,IAAT,CAAc,SAAS,CAAC,SAAxB,KACA,CAAC,oBAAoB,IAApB,CAAyB,SAAS,CAAC,SAAnC,CADD,IAEA,OAAO,CAAC,iBAFR,IAE6B,OAAO,YAAY,OAAO,CAAC,iBAFxD,IAGA,GAAG,MAAH,CAAU,SAAS,CAAC,SAAV,CAAoB,KAApB,CAA0B,eAA1B,CAAV,EAAsD,CAAtD,IAA2D,GAH/D,EAIA;AACI,MAAA,SAAS,GAAG,KAAZ;AACH;AACJ;;AAED,WAAA,aAAA,CAAuB,EAAvB,EAAyB;AACrB,IAAA,EAAE,CAAC,EAAH,CAAM,SAAN,EAAiB,IAAjB,CAAsB,EAAtB,EADqB;;AAGrB,IAAA,WAAW,CACN,MADL,CACY,UAAA,CAAA,EAAC;AAAE,aAAA,CAAC,CAAC,IAAF,KAAW,EAAE,CAAC,IAAd,IAAsB,CAAC,KAAK,EAA5B,IAAkC,CAAC,CAAC,CAAC,QAArC;AAA6C,KAD5D,EAEK,GAFL,CAES,UAAA,CAAA,EAAC;AAAI,aAAA,CAAC,CAAC,EAAF,CAAK,eAAL,EAAsB,IAAtB,CAA2B,EAA3B,CAAA;AAA8B,KAF5C;AAGH;;AAED,EAAA,MAAM,CAAC,IAAD,EAAO;AACT,IAAA,UAAU,EAAE,UADH;AAET,IAAA,KAAK,EAAE,KAFE;AAGT,IAAA,WAAW,EAAE,WAHJ;AAIT,IAAA,OAAO,EAAE,OAJA;AAKT,IAAA,WAAW,EAAE;AALJ,GAAP,CAAN;AAQA,EAAA,IAAI;AAEJ,EAAA,MAAM,CAAC,OAAP,CAAe,UAAU,EAAV,EAAY;AACvB,IAAA,EAAE,CAAC,EAAD,CAAF;AACH,GAFD;AAGH;;AAED,SAAA,SAAA,CAAmB,IAAnB,EAAuB;AACnB,MAAI,OAAO,IAAP,KAAgB,UAApB,EAAgC;AAC5B,WAAO,IAAI,IAAJ,EAAP;AACH,GAFD,MAEO,IAAI,OAAO,CAAC,IAAD,CAAX,EAAmB;AACtB,WAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAD,CAAL,CAAV,CAAP;AACH,GAFM,MAEA,IAAI,IAAI,IAAI,QAAO,IAAP,MAAgB,QAA5B,EAAsC;AACzC,QAAI,EAAE,GAAG,EAAT;AACA,IAAA,cAAc,CAAC,EAAD,EAAK,IAAL,CAAd;AACA,WAAO,EAAP;AACH,GAJM,MAIA;AACH,WAAO,IAAP;AACH;AACJ;;AAED,SAAA,cAAA,CAAwB,GAAxB,EAA6B,SAA7B,EAAsC;AAClC,EAAA,IAAI,CAAC,SAAD,CAAJ,CAAgB,OAAhB,CAAwB,UAAU,MAAV,EAAgB;AACpC,QAAI,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,MAAD,CAAV,CAArB;AACA,IAAA,GAAG,CAAC,MAAD,CAAH,GAAc,KAAd;AACH,GAHD;AAIA,SAAO,GAAP;AACH;;AAED,SAAA,yBAAA,CAAmC,OAAnC,EAA0C;;;;;;;;;;AAUtC,SAAO,IAAI,CAAC,UAAS,KAAT,EAAc;AACtB,QAAI,GAAG,GAAG,KAAK,CAAC,MAAhB;AAAA,QACI,GAAG,GAAG,GAAG,CAAC,QADd;AAAA,QACsB;AAClB,IAAA,MAAM,GAAG,GAAG,CAAC,KAAJ,IAAa,GAAG,CAAC,MAF9B;AAAA,QAEoC;AAChC,IAAA,kBAAkB,GAAG,GAAG,IAAI,GAAG,CAAC,SAHpC;AAIA,IAAA,kBAAkB,IAAI,kBAAkB,CAAC,MAAD,CAAxC;AACA,IAAA,OAAO,IAAI,OAAO,CAAC,MAAD,CAAlB;AACH,GAPU,EAOR,OAPQ,CAAX;AAQH;;AAED,SAAA,kBAAA,CAA4B,MAA5B,EAAkC;AAC9B,SAAO,IAAI,CAAC,UAAU,KAAV,EAAe;AACvB,IAAA,cAAc,CAAC,KAAD,CAAd;AACA,IAAA,MAAM,CAAE,KAAK,CAAC,MAAN,CAAa,KAAf,CAAN;AACA,WAAO,KAAP;AACH,GAJU,CAAX;AAKH;;AAED,SAAA,mBAAA,CAA8B,OAA9B,EAAqC;AACjC,SAAO,IAAI,CAAC,UAAU,KAAV,EAAe;AACvB,IAAA,OAAO,CAAC,KAAK,CAAC,MAAN,CAAa,MAAd,CAAP;AACH,GAFU,CAAX;AAGH;;AAED,SAAA,wBAAA,CAAmC,MAAnC,EAAyC;AACrC,SAAO,IAAI,CAAC,UAAU,KAAV,EAAe;;AAGvB,QAAI,GAAG,GAAG,KAAK,CAAC,MAAhB;AAAA,QACI,GAAG,GAAG,GAAG,CAAC,KADd;AAAA,QAEI,GAAG,GAAG,GAAG,CAAC,QAFd;AAAA,QAEsB;AAClB,IAAA,gBAAgB,GAAG,GAAG,IAAI,GAAG,CAAC,OAHlC;AAIA,IAAA,gBAAgB,IAAI,gBAAgB,CAAC,GAAD,CAApC;AACA,IAAA,cAAc,CAAC,KAAD,CAAd;AACA,IAAA,MAAM,CAAE,GAAF,CAAN;AACA,WAAO,KAAP;AACH,GAXU,CAAX;AAYH;;AAED,SAAA,cAAA,CAAwB,KAAxB,EAA6B;AACzB,MAAI,KAAK,CAAC,eAAV,EACI,KAAK,CAAC,eAAN;AACJ,MAAI,KAAK,CAAC,cAAV,EACI,KAAK,CAAC,cAAN;AACP;;AAED,SAAA,aAAA,CAAwB,QAAxB,EAAgC;AAC5B,MAAI,QAAQ,GAAG,UAAA,MAAA,EAAM;AAAI,WAAA,QAAQ,CAAC,IAAT,CAAc,MAAd,CAAA;AAAqB,GAA9C;AAAA,MACI,OAAO,GAAG,UAAA,KAAA,EAAK;AAAI,WAAA,QAAQ,CAAC,KAAT,CAAe,KAAf,CAAA;AAAqB,GAD5C;AAAA,MAEI,SAAS,GAAG,IAAI,CAAC,QAAD,CAFpB;AAAA,MAGI,OAAO,GAAG,IAAI,CAAC,OAAD,CAHlB;;AAKA,WAAA,IAAA,CAAc,OAAd,EAAqB;AACjB,WAAO,UAAA,GAAA,EAAG;AACN,UAAI,IAAI,GAAG,OAAO,CAAC,GAAD,CAAlB;AAAA,UACI,KAAK,GAAG,IAAI,CAAC,KADjB;AAGA,aAAO,IAAI,CAAC,IAAL,GAAY,KAAZ,GACF,CAAC,KAAD,IAAU,OAAO,KAAK,CAAC,IAAb,KAAsB,UAAhC,GACG,OAAO,CAAC,KAAD,CAAP,GAAiB,OAAO,CAAC,GAAR,CAAY,KAAZ,EAAmB,IAAnB,CAAwB,SAAxB,EAAmC,OAAnC,CAAjB,GAA+D,SAAS,CAAC,KAAD,CAD3E,GAEG,KAAK,CAAC,IAAN,CAAW,SAAX,EAAsB,OAAtB,CAHR;AAIH,KARD;AASH;;AAED,SAAO,IAAI,CAAC,QAAD,CAAJ,EAAP;AACH;;;;;AAKD,SAAA,SAAA,CAAmB,IAAnB,EAAyB,OAAzB,EAAkC,MAAlC,EAA0C,KAA1C,EAAiD,IAAjD,EAAuD,QAAvD,EAAiE,MAAjE,EAAuE;;;;;;;;AAQnE,OAAK,IAAL,GAAY,IAAZ;AACA,OAAK,OAAL,GAAe,OAAf;AACA,OAAK,MAAL,GAAc,MAAd;AACA,OAAK,KAAL,GAAa,KAAb;AACA,OAAK,IAAL,GAAY,IAAZ;AACA,OAAK,QAAL,GAAgB,QAAhB;AACA,OAAK,MAAL,GAAc,MAAd;AACA,MAAI,UAAU,GAAG,OAAO,OAAP,KAAmB,QAAnB,GAA8B,OAA9B,GAAwC,OAAO,IAAK,MAAM,GAAG,IAAH,CAAQ,IAAR,CAAa,OAAb,EAAsB,GAAtB,CAAN,GAAmC,GAAxG;AACA,OAAK,GAAL,GAAW,CAAC,MAAM,GAAG,GAAH,GAAS,EAAhB,KAAuB,KAAK,GAAG,GAAH,GAAS,EAArC,KAA4C,IAAI,GAAG,IAAH,GAAU,EAA1D,IAAgE,UAA3E;AACH;;;;;AAKD,SAAA,WAAA,CAAqB,IAArB,EAA2B,OAA3B,EAAoC,OAApC,EAA6C,gBAA7C,EAA6D;;;;;AAKzD,OAAK,IAAL,GAAY,IAAZ;AACA,OAAK,OAAL,GAAe,OAAO,IAAI,IAAI,SAAJ,EAA1B;AACA,OAAK,OAAL,GAAe,OAAO,IAAI,CAAC,IAAI,SAAJ,EAAD,CAA1B;AACA,OAAK,gBAAL,GAAwB,gBAAxB;AACA,OAAK,WAAL,GAAmB,IAAnB;AACA,OAAK,SAAL,GAAiB,aAAa,CAAC,OAAD,EAAU,UAAA,KAAA,EAAK;AAAI,WAAA,CAAC,KAAK,CAAC,IAAP,EAAa,KAAb,CAAA;AAAmB,GAAtC,CAA9B;AACH;;AAED,SAAA,mBAAA,CAA6B,UAA7B,EAAuC;AACnC,SAAO,UAAU,CAAC,MAAX,KAAsB,CAAtB,GAA0B,UAAU,CAAC,CAAD,CAApC,GAA0C,UAAjD;AACH;;AAED,SAAA,2BAAA,CAAqC,SAArC,EAA8C;AAC1C,MAAI,EAAE,GAAG,SAAS,KAAK,SAAS,CAAC,gBAAV,IAA8B,SAAS,CAAC,sBAA7C,CAAlB;AACA,SAAO,EAAE,IAAI,EAAE,CAAC,IAAH,CAAQ,SAAR,CAAb;AACH;;;AAGD,KAAK,CAAC,KAAD,EAAQ,kBAAR,CAAL,EAAiC;;;;;AAKjC,KAAK,CAAC,KAAD,EAAQ;;;;AAKT,EAAA,MAAM,EAAE,UAAU,YAAV,EAAsB;AAC1B,QAAI,EAAE,GAAG,IAAI,KAAJ,CAAU,YAAV,CAAT;AAAA,QACI,OAAO,GAAG,EAAE,CAAC,MAAH,EADd;;AAEA,IAAA,OAAO,CAAC,SAAR,GAAoB,UAAU,EAAV,EAAY;AAC5B,MAAA,EAAE,CAAC,EAAH,CAAM,SAAN,EAAiB,EAAjB;AACA,aAAO,IAAP;AACH,KAHD;;AAIA,WAAO,OAAP;AACH,GAbQ;;;;AAkBT,EAAA,MAAM,EAAE,UAAS,IAAT,EAAa;AACjB,WAAO,IAAI,KAAJ,CAAU,IAAV,EAAgB,IAAhB,GAAuB,IAAvB,CAA4B,UAAA,EAAA,EAAE;AACjC,MAAA,EAAE,CAAC,KAAH;AACA,aAAO,IAAP;AACH,KAHM,EAGJ,KAHI,CAGE,KAAK,CAAC,mBAHR,EAG6B,YAAA;AAAM,aAAA,KAAA;AAAK,KAHxC,CAAP;AAIH,GAvBQ;;;;AA4BT,EAAA,gBAAgB,EAAE,UAAU,EAAV,EAAY;AAC1B,QAAI,gBAAgB,GAAG,2BAA2B,CAAC,KAAK,CAAC,YAAN,CAAmB,SAApB,CAAlD;AACA,WAAO,gBAAgB,GAAG,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AAClD,UAAI,GAAG,GAAG,gBAAgB,EAA1B;;AACA,MAAA,GAAG,CAAC,SAAJ,GAAgB,UAAU,KAAV,EAAe;AAC3B,QAAA,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAN,CAAa,MAAd,EAAsB,CAAtB,CAAN,CAAP,CAD2B,CACY;AAC1C,OAFD;;AAGA,MAAA,GAAG,CAAC,OAAJ,GAAc,kBAAkB,CAAC,MAAD,CAAhC;AACH,KANyB,EAMvB,IANuB,CAMlB,EANkB,CAAH,GAMT,SAAS,CAAC,OAAV,CAAkB,YAAlB,GAAiC,WAAjC,CAA6C,EAA7C,CANd;AAOH,GArCQ;AAuCT,EAAA,WAAW,EAAE,YAAA;;AAET,aAAA,KAAA,CAAe,UAAf,EAAyB;;;AAGrB,UAAI,UAAJ,EAAgB,MAAM,CAAC,IAAD,EAAO,UAAP,CAAN;AACnB;;AACD,WAAO,KAAP;AACH,GA/CQ;AAiDT,EAAA,cAAc,EAAE,cAjDP;AAmDT,EAAA,iBAAiB,EAAE,UAAU,SAAV,EAAmB;;;;;;;;;;;;;;;;;;;;;;AAsBlC,WAAO,GAAG,CAAC,KAAJ,GACH,MAAM,CAAC,GAAG,CAAC,SAAL,EAAgB,SAAhB,CADH,GAC6B;AAChC,IAAA,SAAS,EAFb,CAtBkC,CAwBlB;AACnB,GA5EQ;AA8ET,EAAA,GAAG,EAAE,UAAU,EAAV,EAAY;;;;;;;;;AASb,WAAO,QAAQ,CAAC,YAAA;AACZ,MAAA,GAAG,CAAC,UAAJ,GAAiB,IAAjB,CADY,CACU;;AACtB,aAAO,EAAE,EAAT;AACH,KAHc,CAAf;AAIH,GA3FQ;AA6FT,EAAA,KAAK,EAAE,UAAU,WAAV,EAAqB;AACxB,WAAO,YAAA;AACH,UAAI;AACA,YAAI,EAAE,GAAG,aAAa,CAAC,WAAW,CAAC,KAAZ,CAAkB,IAAlB,EAAwB,SAAxB,CAAD,CAAtB;AACA,YAAI,CAAC,EAAD,IAAO,OAAO,EAAE,CAAC,IAAV,KAAmB,UAA9B,EACI,OAAO,OAAO,CAAC,OAAR,CAAgB,EAAhB,CAAP;AACJ,eAAO,EAAP;AACH,OALD,CAKE,OAAO,CAAP,EAAU;AACR,eAAO,SAAS,CAAE,CAAF,CAAhB;AACH;AACJ,KATD;AAUH,GAxGQ;AA0GT,EAAA,KAAK,EAAE,UAAU,WAAV,EAAuB,IAAvB,EAA6B,IAA7B,EAAiC;AACpC,QAAI;AACA,UAAI,EAAE,GAAG,aAAa,CAAC,WAAW,CAAC,KAAZ,CAAkB,IAAlB,EAAwB,IAAI,IAAI,EAAhC,CAAD,CAAtB;AACA,UAAI,CAAC,EAAD,IAAO,OAAO,EAAE,CAAC,IAAV,KAAmB,UAA9B,EACI,OAAO,OAAO,CAAC,OAAR,CAAgB,EAAhB,CAAP;AACJ,aAAO,EAAP;AACH,KALD,CAKE,OAAO,CAAP,EAAU;AACR,aAAO,SAAS,CAAC,CAAD,CAAhB;AACH;AACJ,GAnHQ;;AAsHT,EAAA,kBAAkB,EAAE;AAChB,IAAA,GAAG,EAAE,YAAA;AAAM,aAAA,GAAG,CAAC,KAAJ,IAAa,IAAb;AAAiB;AADZ,GAtHX;AA0HT,EAAA,OAAO,EAAE,UAAU,iBAAV,EAA6B,eAA7B,EAA4C;;AAEjD,QAAI,OAAO,GAAG,OAAO,CAAC,OAAR,CACV,OAAO,iBAAP,KAA6B,UAA7B,GAA0C,KAAK,CAAC,iBAAN,CAAwB,iBAAxB,CAA1C,GAAuF,iBAD7E,EAET,OAFS,CAED,eAAe,IAAI,KAFlB,CAAd,CAFiD,CAIV;;;;AAIvC,WAAO,GAAG,CAAC,KAAJ,GAAY,GAAG,CAAC,KAAJ,CAAU,OAAV,CAAkB,OAAlB,CAAZ,GAAyC,OAAhD;AACH,GAnIQ;;AAsIT,EAAA,OAAO,EAAE,OAtIA;;;;;AA4IT,EAAA,KAAK,EAAE;AACH,IAAA,GAAG,EAAE,YAAA;AAAM,aAAAE,KAAA;AAAW,KADnB;AAEH,IAAA,GAAG,EAAE,UAAA,KAAA,EAAK;AACND,MAAAA,QAAc,CAAC,KAAD,EAAQ,KAAK,KAAK,OAAV,GAAoB,YAAA;AAAI,eAAA,IAAA;AAAI,OAA5B,GAA+B,qBAAvC,CAAdA;AACH;AAJE,GA5IE;;AAoJT,EAAA,MAAM,EAAE,MApJC;AAqJT,EAAA,MAAM,EAAE,MArJC;AAsJT,EAAA,KAAK,EAAE,KAtJE;AAuJT,EAAA,QAAQ,EAAE,QAvJD;;AAyJT,EAAA,MAAM,EAAE,MAzJC;;AA2JT,EAAA,YAAY,EAAE,YA3JL;AA4JT,EAAA,YAAY,EAAE,YA5JL;AA6JT,EAAA,YAAY,EAAE,YA7JL;AA8JT,EAAA,YAAY,EAAE,YA9JL;AA+JT,EAAA,SAAS,EAAE,SA/JF;AAgKT,EAAA,aAAa,EAAE,aAhKN;AAiKT,EAAA,IAAI,EAAE,IAjKG;AAkKT,EAAA,MAAM,EAAE,MAlKC;AAmKT,EAAA,MAAM,EAAE,MAnKC;;AAqKT,EAAA,MAAM,EAAE,EArKC;;AAuKT,EAAA,WAAW,EAAE,WAvKJ;AAyKT,EAAA,gBAAgB,EAAE,UAAU,CAAC,MAzKpB;AA0KT,EAAA,QAAQ,EAAE,QA1KD;;AA6KT,EAAA,SAAS,EAAE,SA7KF;AA8KT,EAAA,WAAW,EAAE,WA9KJ;;;;;;;;;AAwLT,EAAA,YAAY,EAAG,YAAA;AACX,QAAI;AACA,aAAO;;AAEH,QAAA,SAAS,EAAE,OAAO,CAAC,SAAR,IAAqB,OAAO,CAAC,YAA7B,IAA6C,OAAO,CAAC,eAArD,IAAwE,OAAO,CAAC,WAFxF;AAGH,QAAA,WAAW,EAAE,OAAO,CAAC,WAAR,IAAuB,OAAO,CAAC;AAHzC,OAAP;AAKH,KAND,CAME,OAAO,CAAP,EAAU;AACR,aAAO;AACH,QAAA,SAAS,EAAE,IADR;AAEH,QAAA,WAAW,EAAE;AAFV,OAAP;AAIH;AACJ,GAba,EAxLL;;AAwMT,EAAA,MAAM,EAAE,aAxMC;AAyMT,EAAA,OAAO,EAAE,aAAa,CAAC,KAAd,CAAoB,GAApB,EACJ,GADI,CACA,UAAA,CAAA,EAAC;AAAI,WAAA,QAAQ,CAAC,CAAD,CAAR;AAAW,GADhB,EAEJ,MAFI,CAEG,UAAC,CAAD,EAAG,CAAH,EAAK,CAAL,EAAM;AAAK,WAAA,CAAC,GAAI,CAAC,GAAC,IAAI,CAAC,GAAL,CAAS,EAAT,EAAY,CAAC,GAAC,CAAd,CAAP;AAAwB,GAFtC,CAzMA;;;;AAgNT,EAAA,OAAO,EAAE,KAhNA;;;;;;AAsNT,EAAA,KAAK,EAAE;AAtNE,CAAR,CAAL;;AA0NA,OAAO,CAAC,eAAR,GAA0B,QAA1B;;AAGA,SAAS,GAAG,IAAI,KAAJ,CAAU,WAAV,CAAZ;AACA,SAAS,CAAC,OAAV,CAAkB,CAAlB,EAAqB,MAArB,CAA4B;AAAC,EAAA,OAAO,EAAE;AAAV,CAA5B;;AAEA,CAAC,YAAA;;AAEG,MAAI,OAAO,GAAG,qBAAd;;AACA,MAAI;AACA,QAAI,QAAO,YAAP,yCAAO,YAAP,OAAwB,SAAxB,IAAqC,OAAO,CAAC,QAAR,KAAqB,SAA9D,EAAyE;;AAErE,MAAA,IAAI,CAAC,KAAL,CAAW,YAAY,CAAC,OAAb,CAAqB,OAArB,KAAiC,IAA5C,EACK,OADL,CACa,UAAA,IAAA,EAAI;AAAI,eAAA,SAAS,CAAC,OAAV,CAAkB,GAAlB,CAAsB;AAAC,UAAA,IAAI,EAAE;AAAP,SAAtB,EAAoC,KAApC,CAA0C,GAA1C,CAAA;AAA8C,OADnE;AAEA,MAAA,YAAY,CAAC,UAAb,CAAwB,OAAxB;AACH;AACJ,GAPD,CAOE,OAAO,EAAP,EAAW,CAAE;AAClB,CAXD;;;;;;;AC3mGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;ACzBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACv4BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA,SAAS/G,YAAT,GAAwB;AACtB,OAAKoH,OAAL,GAAe,KAAKA,OAAL,IAAgB,EAA/B;AACA,OAAKC,aAAL,GAAqB,KAAKA,aAAL,IAAsBC,SAA3C;AACD;;AACDC,MAAM,CAACC,OAAP,GAAiBxH,YAAjB,EAEA;;AACAA,YAAY,CAACA,YAAb,GAA4BA,YAA5B;AAEAA,YAAY,CAACyH,SAAb,CAAuBL,OAAvB,GAAiCE,SAAjC;AACAtH,YAAY,CAACyH,SAAb,CAAuBJ,aAAvB,GAAuCC,SAAvC,EAEA;AACA;;AACAtH,YAAY,CAAC0H,mBAAb,GAAmC,EAAnC,EAEA;AACA;;AACA1H,YAAY,CAACyH,SAAb,CAAuBE,eAAvB,GAAyC,UAASC,CAAT,EAAY;AACnD,MAAI,CAACC,QAAQ,CAACD,CAAD,CAAT,IAAgBA,CAAC,GAAG,CAApB,IAAyBE,KAAK,CAACF,CAAD,CAAlC,EACE,MAAMG,SAAS,CAAC,6BAAD,CAAf;AACF,OAAKV,aAAL,GAAqBO,CAArB;AACA,SAAO,IAAP;AACD,CALD;;AAOA5H,YAAY,CAACyH,SAAb,CAAuBO,IAAvB,GAA8B,UAASC,IAAT,EAAe;AAC3C,MAAIC,EAAJ,EAAQC,OAAR,EAAiBC,GAAjB,EAAsBnH,IAAtB,EAA4BH,CAA5B,EAA+Bb,SAA/B;AAEA,MAAI,CAAC,KAAKmH,OAAV,EACE,KAAKA,OAAL,GAAe,EAAf,CAJyC,CAM3C;;AACA,MAAIa,IAAI,KAAK,OAAb,EAAsB;AACpB,QAAI,CAAC,KAAKb,OAAL,CAAaiB,KAAd,IACCC,QAAQ,CAAC,KAAKlB,OAAL,CAAaiB,KAAd,CAAR,IAAgC,CAAC,KAAKjB,OAAL,CAAaiB,KAAb,CAAmBzH,MADzD,EACkE;AAChEsH,MAAAA,EAAE,GAAGK,SAAS,CAAC,CAAD,CAAd;;AACA,UAAIL,EAAE,YAAY1D,KAAlB,EAAyB;AACvB,cAAM0D,EAAN,CADuB,CACb;AACX,OAFD,MAEO;AACL;AACA,YAAIM,GAAG,GAAG,IAAIhE,KAAJ,CAAU,2CAA2C0D,EAA3C,GAAgD,GAA1D,CAAV;AACAM,QAAAA,GAAG,CAACC,OAAJ,GAAcP,EAAd;AACA,cAAMM,GAAN;AACD;AACF;AACF;;AAEDL,EAAAA,OAAO,GAAG,KAAKf,OAAL,CAAaa,IAAb,CAAV;AAEA,MAAIS,WAAW,CAACP,OAAD,CAAf,EACE,OAAO,KAAP;;AAEF,MAAI1H,UAAU,CAAC0H,OAAD,CAAd,EAAyB;AACvB,YAAQI,SAAS,CAAC3H,MAAlB;AACE;AACA,WAAK,CAAL;AACEuH,QAAAA,OAAO,CAACQ,IAAR,CAAa,IAAb;AACA;;AACF,WAAK,CAAL;AACER,QAAAA,OAAO,CAACQ,IAAR,CAAa,IAAb,EAAmBJ,SAAS,CAAC,CAAD,CAA5B;AACA;;AACF,WAAK,CAAL;AACEJ,QAAAA,OAAO,CAACQ,IAAR,CAAa,IAAb,EAAmBJ,SAAS,CAAC,CAAD,CAA5B,EAAiCA,SAAS,CAAC,CAAD,CAA1C;AACA;AACF;;AACA;AACEtH,QAAAA,IAAI,GAAG2H,KAAK,CAACnB,SAAN,CAAgBoB,KAAhB,CAAsBF,IAAtB,CAA2BJ,SAA3B,EAAsC,CAAtC,CAAP;AACAJ,QAAAA,OAAO,CAACW,KAAR,CAAc,IAAd,EAAoB7H,IAApB;AAdJ;AAgBD,GAjBD,MAiBO,IAAIqH,QAAQ,CAACH,OAAD,CAAZ,EAAuB;AAC5BlH,IAAAA,IAAI,GAAG2H,KAAK,CAACnB,SAAN,CAAgBoB,KAAhB,CAAsBF,IAAtB,CAA2BJ,SAA3B,EAAsC,CAAtC,CAAP;AACAtI,IAAAA,SAAS,GAAGkI,OAAO,CAACU,KAAR,EAAZ;AACAT,IAAAA,GAAG,GAAGnI,SAAS,CAACW,MAAhB;;AACA,SAAKE,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGsH,GAAhB,EAAqBtH,CAAC,EAAtB,EACEb,SAAS,CAACa,CAAD,CAAT,CAAagI,KAAb,CAAmB,IAAnB,EAAyB7H,IAAzB;AACH;;AAED,SAAO,IAAP;AACD,CArDD;;AAuDAjB,YAAY,CAACyH,SAAb,CAAuBsB,WAAvB,GAAqC,UAASd,IAAT,EAAelH,QAAf,EAAyB;AAC5D,MAAIiI,CAAJ;AAEA,MAAI,CAACvI,UAAU,CAACM,QAAD,CAAf,EACE,MAAMgH,SAAS,CAAC,6BAAD,CAAf;AAEF,MAAI,CAAC,KAAKX,OAAV,EACE,KAAKA,OAAL,GAAe,EAAf,CAP0D,CAS5D;AACA;;AACA,MAAI,KAAKA,OAAL,CAAa6B,WAAjB,EACE,KAAKjB,IAAL,CAAU,aAAV,EAAyBC,IAAzB,EACUxH,UAAU,CAACM,QAAQ,CAACA,QAAV,CAAV,GACAA,QAAQ,CAACA,QADT,GACoBA,QAF9B;AAIF,MAAI,CAAC,KAAKqG,OAAL,CAAaa,IAAb,CAAL,EACE;AACA,SAAKb,OAAL,CAAaa,IAAb,IAAqBlH,QAArB,CAFF,KAGK,IAAIuH,QAAQ,CAAC,KAAKlB,OAAL,CAAaa,IAAb,CAAD,CAAZ,EACH;AACA,SAAKb,OAAL,CAAaa,IAAb,EAAmBzH,IAAnB,CAAwBO,QAAxB,EAFG,KAIH;AACA,SAAKqG,OAAL,CAAaa,IAAb,IAAqB,CAAC,KAAKb,OAAL,CAAaa,IAAb,CAAD,EAAqBlH,QAArB,CAArB,CAxB0D,CA0B5D;;AACA,MAAIuH,QAAQ,CAAC,KAAKlB,OAAL,CAAaa,IAAb,CAAD,CAAR,IAAgC,CAAC,KAAKb,OAAL,CAAaa,IAAb,EAAmBiB,MAAxD,EAAgE;AAC9D,QAAI,CAACR,WAAW,CAAC,KAAKrB,aAAN,CAAhB,EAAsC;AACpC2B,MAAAA,CAAC,GAAG,KAAK3B,aAAT;AACD,KAFD,MAEO;AACL2B,MAAAA,CAAC,GAAGhJ,YAAY,CAAC0H,mBAAjB;AACD;;AAED,QAAIsB,CAAC,IAAIA,CAAC,GAAG,CAAT,IAAc,KAAK5B,OAAL,CAAaa,IAAb,EAAmBrH,MAAnB,GAA4BoI,CAA9C,EAAiD;AAC/C,WAAK5B,OAAL,CAAaa,IAAb,EAAmBiB,MAAnB,GAA4B,IAA5B;AACAC,MAAAA,OAAO,CAACd,KAAR,CAAc,kDACA,qCADA,GAEA,kDAFd,EAGc,KAAKjB,OAAL,CAAaa,IAAb,EAAmBrH,MAHjC;;AAIA,UAAI,OAAOuI,OAAO,CAACC,KAAf,KAAyB,UAA7B,EAAyC;AACvC;AACAD,QAAAA,OAAO,CAACC,KAAR;AACD;AACF;AACF;;AAED,SAAO,IAAP;AACD,CAhDD;;AAkDApJ,YAAY,CAACyH,SAAb,CAAuB4B,EAAvB,GAA4BrJ,YAAY,CAACyH,SAAb,CAAuBsB,WAAnD;;AAEA/I,YAAY,CAACyH,SAAb,CAAuB6B,IAAvB,GAA8B,UAASrB,IAAT,EAAelH,QAAf,EAAyB;AACrD,MAAI,CAACN,UAAU,CAACM,QAAD,CAAf,EACE,MAAMgH,SAAS,CAAC,6BAAD,CAAf;AAEF,MAAIwB,KAAK,GAAG,KAAZ;;AAEA,WAASC,CAAT,GAAa;AACX,SAAKC,cAAL,CAAoBxB,IAApB,EAA0BuB,CAA1B;;AAEA,QAAI,CAACD,KAAL,EAAY;AACVA,MAAAA,KAAK,GAAG,IAAR;AACAxI,MAAAA,QAAQ,CAAC+H,KAAT,CAAe,IAAf,EAAqBP,SAArB;AACD;AACF;;AAEDiB,EAAAA,CAAC,CAACzI,QAAF,GAAaA,QAAb;AACA,OAAKsI,EAAL,CAAQpB,IAAR,EAAcuB,CAAd;AAEA,SAAO,IAAP;AACD,CAnBD,EAqBA;;;AACAxJ,YAAY,CAACyH,SAAb,CAAuBgC,cAAvB,GAAwC,UAASxB,IAAT,EAAelH,QAAf,EAAyB;AAC/D,MAAI2I,IAAJ,EAAUC,QAAV,EAAoB/I,MAApB,EAA4BE,CAA5B;AAEA,MAAI,CAACL,UAAU,CAACM,QAAD,CAAf,EACE,MAAMgH,SAAS,CAAC,6BAAD,CAAf;AAEF,MAAI,CAAC,KAAKX,OAAN,IAAiB,CAAC,KAAKA,OAAL,CAAaa,IAAb,CAAtB,EACE,OAAO,IAAP;AAEFyB,EAAAA,IAAI,GAAG,KAAKtC,OAAL,CAAaa,IAAb,CAAP;AACArH,EAAAA,MAAM,GAAG8I,IAAI,CAAC9I,MAAd;AACA+I,EAAAA,QAAQ,GAAG,CAAC,CAAZ;;AAEA,MAAID,IAAI,KAAK3I,QAAT,IACCN,UAAU,CAACiJ,IAAI,CAAC3I,QAAN,CAAV,IAA6B2I,IAAI,CAAC3I,QAAL,KAAkBA,QADpD,EAC+D;AAC7D,WAAO,KAAKqG,OAAL,CAAaa,IAAb,CAAP;AACA,QAAI,KAAKb,OAAL,CAAaqC,cAAjB,EACE,KAAKzB,IAAL,CAAU,gBAAV,EAA4BC,IAA5B,EAAkClH,QAAlC;AAEH,GAND,MAMO,IAAIuH,QAAQ,CAACoB,IAAD,CAAZ,EAAoB;AACzB,SAAK5I,CAAC,GAAGF,MAAT,EAAiBE,CAAC,KAAK,CAAvB,GAA2B;AACzB,UAAI4I,IAAI,CAAC5I,CAAD,CAAJ,KAAYC,QAAZ,IACC2I,IAAI,CAAC5I,CAAD,CAAJ,CAAQC,QAAR,IAAoB2I,IAAI,CAAC5I,CAAD,CAAJ,CAAQC,QAAR,KAAqBA,QAD9C,EACyD;AACvD4I,QAAAA,QAAQ,GAAG7I,CAAX;AACA;AACD;AACF;;AAED,QAAI6I,QAAQ,GAAG,CAAf,EACE,OAAO,IAAP;;AAEF,QAAID,IAAI,CAAC9I,MAAL,KAAgB,CAApB,EAAuB;AACrB8I,MAAAA,IAAI,CAAC9I,MAAL,GAAc,CAAd;AACA,aAAO,KAAKwG,OAAL,CAAaa,IAAb,CAAP;AACD,KAHD,MAGO;AACLyB,MAAAA,IAAI,CAAC1I,MAAL,CAAY2I,QAAZ,EAAsB,CAAtB;AACD;;AAED,QAAI,KAAKvC,OAAL,CAAaqC,cAAjB,EACE,KAAKzB,IAAL,CAAU,gBAAV,EAA4BC,IAA5B,EAAkClH,QAAlC;AACH;;AAED,SAAO,IAAP;AACD,CA3CD;;AA6CAf,YAAY,CAACyH,SAAb,CAAuBmC,kBAAvB,GAA4C,UAAS3B,IAAT,EAAe;AACzD,MAAI4B,GAAJ,EAAS5J,SAAT;AAEA,MAAI,CAAC,KAAKmH,OAAV,EACE,OAAO,IAAP,CAJuD,CAMzD;;AACA,MAAI,CAAC,KAAKA,OAAL,CAAaqC,cAAlB,EAAkC;AAChC,QAAIlB,SAAS,CAAC3H,MAAV,KAAqB,CAAzB,EACE,KAAKwG,OAAL,GAAe,EAAf,CADF,KAEK,IAAI,KAAKA,OAAL,CAAaa,IAAb,CAAJ,EACH,OAAO,KAAKb,OAAL,CAAaa,IAAb,CAAP;AACF,WAAO,IAAP;AACD,GAbwD,CAezD;;;AACA,MAAIM,SAAS,CAAC3H,MAAV,KAAqB,CAAzB,EAA4B;AAC1B,SAAKiJ,GAAL,IAAY,KAAKzC,OAAjB,EAA0B;AACxB,UAAIyC,GAAG,KAAK,gBAAZ,EAA8B;AAC9B,WAAKD,kBAAL,CAAwBC,GAAxB;AACD;;AACD,SAAKD,kBAAL,CAAwB,gBAAxB;AACA,SAAKxC,OAAL,GAAe,EAAf;AACA,WAAO,IAAP;AACD;;AAEDnH,EAAAA,SAAS,GAAG,KAAKmH,OAAL,CAAaa,IAAb,CAAZ;;AAEA,MAAIxH,UAAU,CAACR,SAAD,CAAd,EAA2B;AACzB,SAAKwJ,cAAL,CAAoBxB,IAApB,EAA0BhI,SAA1B;AACD,GAFD,MAEO,IAAIA,SAAJ,EAAe;AACpB;AACA,WAAOA,SAAS,CAACW,MAAjB,EACE,KAAK6I,cAAL,CAAoBxB,IAApB,EAA0BhI,SAAS,CAACA,SAAS,CAACW,MAAV,GAAmB,CAApB,CAAnC;AACH;;AACD,SAAO,KAAKwG,OAAL,CAAaa,IAAb,CAAP;AAEA,SAAO,IAAP;AACD,CAtCD;;AAwCAjI,YAAY,CAACyH,SAAb,CAAuBxH,SAAvB,GAAmC,UAASgI,IAAT,EAAe;AAChD,MAAI6B,GAAJ;AACA,MAAI,CAAC,KAAK1C,OAAN,IAAiB,CAAC,KAAKA,OAAL,CAAaa,IAAb,CAAtB,EACE6B,GAAG,GAAG,EAAN,CADF,KAEK,IAAIrJ,UAAU,CAAC,KAAK2G,OAAL,CAAaa,IAAb,CAAD,CAAd,EACH6B,GAAG,GAAG,CAAC,KAAK1C,OAAL,CAAaa,IAAb,CAAD,CAAN,CADG,KAGH6B,GAAG,GAAG,KAAK1C,OAAL,CAAaa,IAAb,EAAmBY,KAAnB,EAAN;AACF,SAAOiB,GAAP;AACD,CATD;;AAWA9J,YAAY,CAACyH,SAAb,CAAuBsC,aAAvB,GAAuC,UAAS9B,IAAT,EAAe;AACpD,MAAI,KAAKb,OAAT,EAAkB;AAChB,QAAI4C,UAAU,GAAG,KAAK5C,OAAL,CAAaa,IAAb,CAAjB;AAEA,QAAIxH,UAAU,CAACuJ,UAAD,CAAd,EACE,OAAO,CAAP,CADF,KAEK,IAAIA,UAAJ,EACH,OAAOA,UAAU,CAACpJ,MAAlB;AACH;;AACD,SAAO,CAAP;AACD,CAVD;;AAYAZ,YAAY,CAAC+J,aAAb,GAA6B,UAASE,OAAT,EAAkBhC,IAAlB,EAAwB;AACnD,SAAOgC,OAAO,CAACF,aAAR,CAAsB9B,IAAtB,CAAP;AACD,CAFD;;AAIA,SAASxH,UAAT,CAAoByJ,GAApB,EAAyB;AACvB,SAAO,OAAOA,GAAP,KAAe,UAAtB;AACD;;AAED,SAASrC,QAAT,CAAkBqC,GAAlB,EAAuB;AACrB,SAAO,OAAOA,GAAP,KAAe,QAAtB;AACD;;AAED,SAAS5B,QAAT,CAAkB4B,GAAlB,EAAuB;AACrB,SAAO,OAAOA,GAAP,KAAe,QAAf,IAA2BA,GAAG,KAAK,IAA1C;AACD;;AAED,SAASxB,WAAT,CAAqBwB,GAArB,EAA0B;AACxB,SAAOA,GAAG,KAAK,KAAK,CAApB;AACD;;AC7SD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/WA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACfA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzNA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;AC/FA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvJA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpFA;AACA;AACA;AACA;AACA;AACA;;;;ACLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AC7vDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AC9DA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;ACvSA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACtEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC7EA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/FA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC7IA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpEA3C,MAAM,CAACC,OAAP,GAAiB2C,MAAjB;AAEA,IAAIC,cAAc,GAAGC,MAAM,CAAC5C,SAAP,CAAiB2C,cAAtC;;AAEA,SAASD,MAAT,GAAkB;AACd,MAAIG,MAAM,GAAG,EAAb;;AAEA,OAAK,IAAIxJ,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGyH,SAAS,CAAC3H,MAA9B,EAAsCE,CAAC,EAAvC,EAA2C;AACvC,QAAIyJ,MAAM,GAAGhC,SAAS,CAACzH,CAAD,CAAtB;;AAEA,SAAK,IAAI+I,GAAT,IAAgBU,MAAhB,EAAwB;AACpB,UAAIH,cAAc,CAACzB,IAAf,CAAoB4B,MAApB,EAA4BV,GAA5B,CAAJ,EAAsC;AAClCS,QAAAA,MAAM,CAACT,GAAD,CAAN,GAAcU,MAAM,CAACV,GAAD,CAApB;AACH;AACJ;AACJ;;AAED,SAAOS,MAAP;AACH;;;AClBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;ACtKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;ACptDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC36DA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/FA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3IA;;AACA/C,MAAM,CAACC,OAAP,GAAiBgD,MAAM,CAAC1C,KAAP,IAAgB,UAAU2C,CAAV,EAAa;AAC7C,SAAOA,CAAC,KAAKA,CAAb;AACA,CAFD;;;ACDA,cAEA;AAEA;;AACA,SAASC,SAAT,CAAmBC,GAAnB,EAAwB;AACvB,MAAIb,GAAG,GAAG,EAAV;;AAEA,OAAK,IAAIhJ,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG6J,GAAG,CAAC/J,MAAxB,EAAgCE,CAAC,EAAjC,EAAqC;AACpC,QAAIgJ,GAAG,CAACc,OAAJ,CAAYD,GAAG,CAAC7J,CAAD,CAAf,MAAwB,CAAC,CAA7B,EAAgC;AAC/BgJ,MAAAA,GAAG,CAACtJ,IAAJ,CAASmK,GAAG,CAAC7J,CAAD,CAAZ;AACA;AACD;;AAED,SAAOgJ,GAAP;AACA,EAED;;;AACA,SAASe,OAAT,CAAiBF,GAAjB,EAAsB;AACrB,MAAIG,IAAI,GAAG,IAAIC,GAAJ,EAAX;AACA,SAAOJ,GAAG,CAACK,MAAJ,CAAW,UAAUC,EAAV,EAAc;AAC/B,QAAI,CAACH,IAAI,CAACzK,GAAL,CAAS4K,EAAT,CAAL,EAAmB;AAClBH,MAAAA,IAAI,CAACI,GAAL,CAASD,EAAT;AACA,aAAO,IAAP;AACA;;AAED,WAAO,KAAP;AACA,GAPM,CAAP;AAQA,EAED;;;AACA,SAASE,kBAAT,CAA4BR,GAA5B,EAAiC;AAChC,MAAIb,GAAG,GAAG,EAAV;AAEC,MAAIiB,GAAJ,CAAQJ,GAAR,CAAD,CAAezJ,OAAf,CAAuB,UAAU+J,EAAV,EAAc;AACpCnB,IAAAA,GAAG,CAACtJ,IAAJ,CAASyK,EAAT;AACA,GAFD;AAIA,SAAOnB,GAAP;AACA,EAED;AACA;;;AACA,SAASsB,uBAAT,GAAmC;AAClC,MAAItB,GAAG,GAAG,KAAV;AAEC,MAAIiB,GAAJ,CAAQ,CAAC,IAAD,CAAR,CAAD,CAAkB7J,OAAlB,CAA0B,UAAU+J,EAAV,EAAc;AACvCnB,IAAAA,GAAG,GAAGmB,EAAN;AACA,GAFD;AAIA,SAAOnB,GAAG,KAAK,IAAf;AACA;;AAED,IAAI,SAASuB,MAAb,EAAqB;AACpB,MAAI,OAAON,GAAG,CAACtD,SAAJ,CAAcvG,OAArB,KAAiC,UAAjC,IAA+CkK,uBAAuB,EAA1E,EAA8E;AAC7E7D,IAAAA,MAAM,CAACC,OAAP,GAAiB2D,kBAAjB;AACA,GAFD,MAEO;AACN5D,IAAAA,MAAM,CAACC,OAAP,GAAiBqD,OAAjB;AACA;AACD,CAND,MAMO;AACNtD,EAAAA,MAAM,CAACC,OAAP,GAAiBkD,SAAjB;AACA;;AC7DD;;AACA,IAAIY,WAAW,GAAGC,OAAO,CAAC,eAAD,CAAzB;;AACA,IAAIC,SAAS,GAAGD,OAAO,CAAC,YAAD,CAAvB;;AACA,IAAIE,KAAK,GAAG,OAAZ;;AAEA,SAASC,UAAT,CAAoBf,GAApB,EAAyB;AACxB,SAAOA,GAAG,CAACgB,IAAJ,GAAWX,MAAX,CAAkB,UAAUC,EAAV,EAAcnK,CAAd,EAAiB;AACzC,WAAOqD,IAAI,CAACC,SAAL,CAAe6G,EAAf,MAAuB9G,IAAI,CAACC,SAAL,CAAeuG,GAAG,CAAC7J,CAAC,GAAG,CAAL,CAAlB,CAA9B;AACA,GAFM,CAAP;AAGA;;AAED0G,OAAO,CAACoE,KAAR,GAAgB,UAAUC,GAAV,EAAe;AAC9B,SAAOH,UAAU,CAACG,GAAG,CAACC,KAAJ,CAAU,GAAV,EAAeC,GAAf,CAAmB,UAAUd,EAAV,EAAc;AAClD,QAAInB,GAAG,GAAG,EAAV;AAEAmB,IAAAA,EAAE,CAACe,IAAH,GAAUF,KAAV,CAAgB,KAAhB,EAAuB5K,OAAvB,CAA+B,UAAU+J,EAAV,EAAcnK,CAAd,EAAiB;AAC/C,UAAIA,CAAC,KAAK,CAAV,EAAa;AACZ,eAAOgJ,GAAG,CAACzF,GAAJ,GAAU4G,EAAjB;AACA;;AAED,UAAIgB,KAAK,GAAGhB,EAAE,CAACiB,SAAH,CAAa,CAAb,EAAgBjB,EAAE,CAACrK,MAAH,GAAY,CAA5B,CAAZ;AACA,UAAIuL,OAAO,GAAGlB,EAAE,CAACA,EAAE,CAACrK,MAAH,GAAY,CAAb,CAAhB;AACA,UAAIwL,MAAM,GAAGC,QAAQ,CAACJ,KAAD,EAAQ,EAAR,CAArB;AACA,UAAIK,QAAQ,GAAGC,UAAU,CAACN,KAAD,CAAzB;;AAEA,UAAIE,OAAO,KAAK,GAAZ,IAAmBV,KAAK,CAACe,IAAN,CAAWP,KAAX,CAAvB,EAA0C;AACzCnC,QAAAA,GAAG,CAAC2C,KAAJ,GAAYL,MAAZ;AACA,OAFD,MAEO,IAAID,OAAO,KAAK,GAAZ,IAAmBV,KAAK,CAACe,IAAN,CAAWP,KAAX,CAAvB,EAA0C;AAChDnC,QAAAA,GAAG,CAAC4C,MAAJ,GAAaN,MAAb;AACA,OAFM,MAEA,IAAID,OAAO,KAAK,GAAZ,IAAmB,CAACb,WAAW,CAACgB,QAAD,CAAnC,EAA+C;AACrDxC,QAAAA,GAAG,CAAC6C,OAAJ,GAAcL,QAAd;AACA,OAFM,MAEA;AACN,cAAM,IAAI9H,KAAJ,CAAU,gCAAgCyG,EAAhC,GAAqC,GAA/C,CAAN;AACA;AACD,KAnBD;AAqBA,WAAOnB,GAAP;AACA,GAzBiB,CAAD,CAAjB;AA0BA,CA3BD;;AA6BAtC,OAAO,CAACpD,SAAR,GAAoB,UAAUuG,GAAV,EAAe;AAClC,SAAOa,SAAS,CAACb,GAAG,CAACoB,GAAJ,CAAQ,UAAUd,EAAV,EAAc;AACtC,QAAI,CAACA,EAAE,CAAC5G,GAAR,EAAa;AACZ,YAAM,IAAIG,KAAJ,CAAU,kBAAV,CAAN;AACA;;AAED,QAAIsF,GAAG,GAAG,CAACmB,EAAE,CAAC5G,GAAJ,CAAV;;AAEA,QAAI4G,EAAE,CAACwB,KAAP,EAAc;AACb3C,MAAAA,GAAG,CAACtJ,IAAJ,CAASyK,EAAE,CAACwB,KAAH,GAAW,GAApB;AACA;;AAED,QAAIxB,EAAE,CAACyB,MAAP,EAAe;AACd5C,MAAAA,GAAG,CAACtJ,IAAJ,CAASyK,EAAE,CAACyB,MAAH,GAAY,GAArB;AACA;;AAED,QAAIzB,EAAE,CAAC0B,OAAP,EAAgB;AACf7C,MAAAA,GAAG,CAACtJ,IAAJ,CAASyK,EAAE,CAAC0B,OAAH,GAAa,GAAtB;AACA;;AAED,WAAO7C,GAAG,CAAC8C,IAAJ,CAAS,GAAT,CAAP;AACA,GApBgB,CAAD,CAAT,CAoBHA,IApBG,CAoBE,IApBF,CAAP;AAqBA,CAtBD;;;;;kBCfwBC;AAzBxB,IAAMC,YAAAA,GAAAA,EAAN;AACA,IAAMC,YAAAA,GAAAA,EAAN;AACA,IAAMC,SAAAA,GAAAA,EAAN;AACA,IAAMC,KAAAA,GAAAA,EAAN;AACA,IAAMC,OAAAA,GAAAA,EAAN;AACA,IAAMC,KAAAA,GAAAA,EAAN;AACA,IAAMC,IAAAA,GAAAA,EAAN;AACA,IAAMC,GAAAA,GAAAA,CAAN;AACA,IAAMC,EAAAA,GAAAA,EAAN;AACA,IAAMC,WAAAA,GAAAA,EAAN;AACA,IAAMC,YAAAA,GAAAA,EAAN;AACA,IAAMC,gBAAAA,GAAAA,EAAN;AACA,IAAMC,iBAAAA,GAAAA,EAAN;AACA,IAAMC,UAAAA,GAAAA,GAAN;AACA,IAAMC,WAAAA,GAAAA,GAAN;AACA,IAAMC,SAAAA,GAAAA,EAAN;AACA,IAAMC,QAAAA,GAAAA,EAAN;AACA,IAAMC,KAAAA,GAAAA,EAAN;AACA,IAAMC,EAAAA,GAAAA,EAAN;AAEA,IAAMC,SAAAA,GAAiB,iCAAvB;AACA,IAAMC,WAAAA,GAAiB,4CAAvB;AACA,IAAMC,cAAAA,GAAiB,eAAvB;AACA,IAAMC,aAAAA,GAAiB,WAAvB;;AAEe,SAASvB,SAAT,CAAmBwB,KAAnB,EAAwC;AAAA,MAAdC,OAAc,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAJ,EAAI;AACnD,MAAIC,GAAAA,GAAMF,KAAAA,CAAME,GAANF,CAAUG,OAAVH,EAAV;AACA,MAAII,MAAAA,GAASH,OAAAA,CAAQI,YAArB;AAEA,MAAIC,IAAAA,GAAAA,KAAAA,CAAJ;AAAA,MAAUC,IAAAA,GAAAA,KAAAA,CAAV;AAAA,MAAgBC,KAAAA,GAAAA,KAAAA,CAAhB;AAAA,MAAuBC,KAAAA,GAAAA,KAAAA,CAAvB;AAAA,MAA8BC,IAAAA,GAAAA,KAAAA,CAA9B;AAAA,MAAoCC,OAAAA,GAAAA,KAAAA,CAApC;AAAA,MAA6CC,MAAAA,GAAAA,KAAAA,CAA7C;AAAA,MACIC,QAAAA,GAAAA,KAAAA,CADJ;AAAA,MACcC,UAAAA,GAAAA,KAAAA,CADd;AAAA,MAC0BC,OAAAA,GAAAA,KAAAA,CAD1B;AAAA,MACmCC,SAAAA,GAAAA,KAAAA,CADnC;AAAA,MAC8CC,IAAAA,GAAAA,KAAAA,CAD9C;AAAA,MACoD1H,CAAAA,GAAAA,KAAAA,CADpD;AAAA,MACuD2H,YAAAA,GAAAA,KAAAA,CADvD;AAGA,MAAI3O,MAAAA,GAAS2N,GAAAA,CAAI3N,MAAjB;AACA,MAAI4O,MAAAA,GAAS,CAAC,CAAd;AACA,MAAIC,IAAAA,GAAO,CAAX;AACA,MAAIC,GAAAA,GAAM,CAAV;AACA,MAAIC,MAAAA,GAAS,EAAb;AACA,MAAIC,QAAAA,GAAW,EAAf;;AAEA,WAASC,QAAT,CAAkBC,IAAlB,EAAwB;AACpB,UAAMzB,KAAAA,CAAMhG,KAANgG,CAAY,cAAcyB,IAA1BzB,EAAgCoB,IAAhCpB,EAAsCqB,GAAAA,GAAMF,MAA5CnB,CAAN;AACH;;AAED,WAAS0B,SAAT,GAAqB;AACjB,WAAOH,QAAAA,CAAShP,MAATgP,KAAoB,CAApBA,IAAyBF,GAAAA,IAAO9O,MAAvC;AACH;;AAED,WAASoP,SAAT,GAAqB;AACjB,QAAKJ,QAAAA,CAAShP,MAAd,EAAuB,OAAOgP,QAAAA,CAASK,GAATL,EAAP;AACvB,QAAKF,GAAAA,IAAO9O,MAAZ,EAAqB;AAErB+N,IAAAA,IAAAA,GAAOJ,GAAAA,CAAI2B,UAAJ3B,CAAemB,GAAfnB,CAAPI;;AACA,QAAKA,IAAAA,KAASzB,OAATyB,IAAoBA,IAAAA,KAASvB,IAA7BuB,IACAA,IAAAA,KAASrB,EAATqB,IAAeJ,GAAAA,CAAI2B,UAAJ3B,CAAemB,GAAAA,GAAM,CAArBnB,MAA4BrB,OADhD,EAC0D;AACtDsC,MAAAA,MAAAA,GAASE,GAATF;AACAC,MAAAA,IAAAA,IAAQ,CAARA;AACH;;AAED,YAASd,IAAT;AACA,WAAKzB,OAAL;AACA,WAAKC,KAAL;AACA,WAAKE,GAAL;AACA,WAAKC,EAAL;AACA,WAAKF,IAAL;AACIwB,QAAAA,IAAAA,GAAOc,GAAPd;;AACA,WAAG;AACCA,UAAAA,IAAAA,IAAQ,CAARA;AACAD,UAAAA,IAAAA,GAAOJ,GAAAA,CAAI2B,UAAJ3B,CAAeK,IAAfL,CAAPI;;AACA,cAAKA,IAAAA,KAASzB,OAAd,EAAwB;AACpBsC,YAAAA,MAAAA,GAASZ,IAATY;AACAC,YAAAA,IAAAA,IAAQ,CAARA;AACH;AANL,SAAA,QAOUd,IAAAA,KAASxB,KAATwB,IACAA,IAAAA,KAASzB,OADTyB,IAEAA,IAAAA,KAAStB,GAFTsB,IAGAA,IAAAA,KAASrB,EAHTqB,IAIAA,IAAAA,KAASvB,IAXnB;;AAaAmC,QAAAA,YAAAA,GAAe,CAAC,OAAD,EAAUhB,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAfL,CAAV,CAAfgB;AACAG,QAAAA,GAAAA,GAAMd,IAAAA,GAAO,CAAbc;AACA;;AAEJ,WAAKnC,WAAL;AACIgC,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAK/B,YAAL;AACI+B,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAK5B,UAAL;AACI4B,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAK3B,WAAL;AACI2B,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAKxB,KAAL;AACIwB,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAK1B,SAAL;AACI0B,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAK9B,gBAAL;AACI6B,QAAAA,IAAAA,GAAOK,MAAAA,CAAO/O,MAAP+O,GAAgBA,MAAAA,CAAOM,GAAPN,GAAa,CAAbA,CAAhBA,GAAkC,EAAzCL;AACA1H,QAAAA,CAAAA,GAAO2G,GAAAA,CAAI2B,UAAJ3B,CAAemB,GAAAA,GAAM,CAArBnB,CAAP3G;;AACA,YAAK0H,IAAAA,KAAS,KAATA,IACA1H,CAAAA,KAAMkF,YADNwC,IACsB1H,CAAAA,KAAMmF,YAD5BuC,IAEA1H,CAAAA,KAAMuF,KAFNmC,IAEe1H,CAAAA,KAAMsF,OAFrBoC,IAEgC1H,CAAAA,KAAMyF,GAFtCiC,IAGA1H,CAAAA,KAAMwF,IAHNkC,IAGc1H,CAAAA,KAAM0F,EAHzB,EAG8B;AAC1BsB,UAAAA,IAAAA,GAAOc,GAAPd;;AACA,aAAG;AACCQ,YAAAA,OAAAA,GAAU,KAAVA;AACAR,YAAAA,IAAAA,GAAUL,GAAAA,CAAI3D,OAAJ2D,CAAY,GAAZA,EAAiBK,IAAAA,GAAO,CAAxBL,CAAVK;;AACA,gBAAKA,IAAAA,KAAS,CAAC,CAAf,EAAmB;AACf,kBAAKH,MAAL,EAAc;AACVG,gBAAAA,IAAAA,GAAOc,GAAPd;AACA;AAFJ,eAAA,MAGO;AACHiB,gBAAAA,QAAAA,CAAS,SAATA,CAAAA;AACH;AACJ;;AACDR,YAAAA,SAAAA,GAAYT,IAAZS;;AACA,mBAAQd,GAAAA,CAAI2B,UAAJ3B,CAAec,SAAAA,GAAY,CAA3Bd,MAAkCvB,SAA1C,EAAsD;AAClDqC,cAAAA,SAAAA,IAAa,CAAbA;AACAD,cAAAA,OAAAA,GAAU,CAACA,OAAXA;AACH;AAfL,WAAA,QAgBUA,OAhBV;;AAkBAG,UAAAA,YAAAA,GAAe,CAAC,UAAD,EAAahB,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAb,EACXkB,IADW,EACLC,GAAAA,GAAOF,MADF,EAEXC,IAFW,EAELb,IAAAA,GAAOY,MAFF,CAAfD;AAKAG,UAAAA,GAAAA,GAAMd,IAANc;AA5BJ,SAAA,MA8BO;AACHd,UAAAA,IAAAA,GAAUL,GAAAA,CAAI3D,OAAJ2D,CAAY,GAAZA,EAAiBmB,GAAAA,GAAM,CAAvBnB,CAAVK;AACAI,UAAAA,OAAAA,GAAUT,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAVS;;AAEA,cAAKJ,IAAAA,KAAS,CAAC,CAAVA,IAAeT,cAAAA,CAAe3B,IAAf2B,CAAoBa,OAApBb,CAApB,EAAmD;AAC/CoB,YAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AADJ,WAAA,MAEO;AACHA,YAAAA,YAAAA,GAAe,CAAC,UAAD,EAAaP,OAAb,EACXS,IADW,EACLC,GAAAA,GAAOF,MADF,EAEXC,IAFW,EAELb,IAAAA,GAAOY,MAFF,CAAfD;AAIAG,YAAAA,GAAAA,GAAMd,IAANc;AACH;AACJ;;AAED;;AAEJ,WAAKhC,iBAAL;AACI6B,QAAAA,YAAAA,GAAe,CAAC,GAAD,EAAM,GAAN,EAAWE,IAAX,EAAiBC,GAAAA,GAAMF,MAAvB,CAAfD;AACA;;AAEJ,WAAKzC,YAAL;AACA,WAAKC,YAAL;AACI8B,QAAAA,KAAAA,GAAQF,IAAAA,KAAS7B,YAAT6B,GAAwB,IAAxBA,GAA+B,GAAvCE;AACAD,QAAAA,IAAAA,GAAQc,GAARd;;AACA,WAAG;AACCQ,UAAAA,OAAAA,GAAU,KAAVA;AACAR,UAAAA,IAAAA,GAAUL,GAAAA,CAAI3D,OAAJ2D,CAAYM,KAAZN,EAAmBK,IAAAA,GAAO,CAA1BL,CAAVK;;AACA,cAAKA,IAAAA,KAAS,CAAC,CAAf,EAAmB;AACf,gBAAKH,MAAL,EAAc;AACVG,cAAAA,IAAAA,GAAOc,GAAAA,GAAM,CAAbd;AACA;AAFJ,aAAA,MAGO;AACHiB,cAAAA,QAAAA,CAAS,QAATA,CAAAA;AACH;AACJ;;AACDR,UAAAA,SAAAA,GAAYT,IAAZS;;AACA,iBAAQd,GAAAA,CAAI2B,UAAJ3B,CAAec,SAAAA,GAAY,CAA3Bd,MAAkCvB,SAA1C,EAAsD;AAClDqC,YAAAA,SAAAA,IAAa,CAAbA;AACAD,YAAAA,OAAAA,GAAU,CAACA,OAAXA;AACH;AAfL,SAAA,QAgBUA,OAhBV;;AAkBAJ,QAAAA,OAAAA,GAAUT,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAVS;AACAF,QAAAA,KAAAA,GAAUE,OAAAA,CAAQlD,KAARkD,CAAc,IAAdA,CAAVF;AACAC,QAAAA,IAAAA,GAAUD,KAAAA,CAAMlO,MAANkO,GAAe,CAAzBC;;AAEA,YAAKA,IAAAA,GAAO,CAAZ,EAAgB;AACZG,UAAAA,QAAAA,GAAaO,IAAAA,GAAOV,IAApBG;AACAC,UAAAA,UAAAA,GAAaP,IAAAA,GAAOE,KAAAA,CAAMC,IAAND,CAAAA,CAAYlO,MAAhCuO;AAFJ,SAAA,MAGO;AACHD,UAAAA,QAAAA,GAAaO,IAAbP;AACAC,UAAAA,UAAAA,GAAaK,MAAbL;AACH;;AAEDI,QAAAA,YAAAA,GAAe,CAAC,QAAD,EAAWhB,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAX,EACXkB,IADW,EACLC,GAAAA,GAAOF,MADF,EAEXN,QAFW,EAEDN,IAAAA,GAAOO,UAFN,CAAfI;AAKAC,QAAAA,MAAAA,GAASL,UAATK;AACAC,QAAAA,IAAAA,GAASP,QAATO;AACAC,QAAAA,GAAAA,GAASd,IAATc;AACA;;AAEJ,WAAK1B,EAAL;AACIC,QAAAA,SAAAA,CAAUkC,SAAVlC,GAAsByB,GAAAA,GAAM,CAA5BzB;AACAA,QAAAA,SAAAA,CAAUzB,IAAVyB,CAAeM,GAAfN;;AACA,YAAKA,SAAAA,CAAUkC,SAAVlC,KAAwB,CAA7B,EAAiC;AAC7BW,UAAAA,IAAAA,GAAOL,GAAAA,CAAI3N,MAAJ2N,GAAa,CAApBK;AADJ,SAAA,MAEO;AACHA,UAAAA,IAAAA,GAAOX,SAAAA,CAAUkC,SAAVlC,GAAsB,CAA7BW;AACH;;AAEDW,QAAAA,YAAAA,GAAe,CAAC,SAAD,EAAYhB,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAZ,EACXkB,IADW,EACLC,GAAAA,GAAOF,MADF,EAEXC,IAFW,EAELb,IAAAA,GAAOY,MAFF,CAAfD;AAKAG,QAAAA,GAAAA,GAAMd,IAANc;AACA;;AAEJ,WAAK1C,SAAL;AACI4B,QAAAA,IAAAA,GAASc,GAATd;AACAK,QAAAA,MAAAA,GAAS,IAATA;;AACA,eAAQV,GAAAA,CAAI2B,UAAJ3B,CAAeK,IAAAA,GAAO,CAAtBL,MAA6BvB,SAArC,EAAiD;AAC7C4B,UAAAA,IAAAA,IAAS,CAATA;AACAK,UAAAA,MAAAA,GAAS,CAACA,MAAVA;AACH;;AACDN,QAAAA,IAAAA,GAAOJ,GAAAA,CAAI2B,UAAJ3B,CAAeK,IAAAA,GAAO,CAAtBL,CAAPI;;AACA,YAAKM,MAAAA,IAAWN,IAAAA,KAAS1B,KAApBgC,IACWN,IAAAA,KAASxB,KADpB8B,IAEWN,IAAAA,KAASzB,OAFpB+B,IAGWN,IAAAA,KAAStB,GAHpB4B,IAIWN,IAAAA,KAASrB,EAJpB2B,IAKWN,IAAAA,KAASvB,IALzB,EAKkC;AAC9BwB,UAAAA,IAAAA,IAAQ,CAARA;;AACA,cAAKR,aAAAA,CAAc5B,IAAd4B,CAAmBG,GAAAA,CAAI6B,MAAJ7B,CAAWK,IAAXL,CAAnBH,CAAL,EAA4C;AACxC,mBAAQA,aAAAA,CAAc5B,IAAd4B,CAAmBG,GAAAA,CAAI6B,MAAJ7B,CAAWK,IAAAA,GAAO,CAAlBL,CAAnBH,CAAR,EAAmD;AAC/CQ,cAAAA,IAAAA,IAAQ,CAARA;AACH;;AACD,gBAAKL,GAAAA,CAAI2B,UAAJ3B,CAAeK,IAAAA,GAAO,CAAtBL,MAA6BpB,KAAlC,EAA0C;AACtCyB,cAAAA,IAAAA,IAAQ,CAARA;AACH;AACJ;AACJ;;AAEDW,QAAAA,YAAAA,GAAe,CAAC,MAAD,EAAShB,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAT,EACXkB,IADW,EACLC,GAAAA,GAAOF,MADF,EAEXC,IAFW,EAELb,IAAAA,GAAOY,MAFF,CAAfD;AAKAG,QAAAA,GAAAA,GAAMd,IAANc;AACA;;AAEJ;AACI,YAAKf,IAAAA,KAAS1B,KAAT0B,IAAkBJ,GAAAA,CAAI2B,UAAJ3B,CAAemB,GAAAA,GAAM,CAArBnB,MAA4BT,QAAnD,EAA8D;AAC1Dc,UAAAA,IAAAA,GAAOL,GAAAA,CAAI3D,OAAJ2D,CAAY,IAAZA,EAAkBmB,GAAAA,GAAM,CAAxBnB,IAA6B,CAApCK;;AACA,cAAKA,IAAAA,KAAS,CAAd,EAAkB;AACd,gBAAKH,MAAL,EAAc;AACVG,cAAAA,IAAAA,GAAOL,GAAAA,CAAI3N,MAAXgO;AADJ,aAAA,MAEO;AACHiB,cAAAA,QAAAA,CAAS,SAATA,CAAAA;AACH;AACJ;;AAEDb,UAAAA,OAAAA,GAAUT,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAVS;AACAF,UAAAA,KAAAA,GAAUE,OAAAA,CAAQlD,KAARkD,CAAc,IAAdA,CAAVF;AACAC,UAAAA,IAAAA,GAAUD,KAAAA,CAAMlO,MAANkO,GAAe,CAAzBC;;AAEA,cAAKA,IAAAA,GAAO,CAAZ,EAAgB;AACZG,YAAAA,QAAAA,GAAaO,IAAAA,GAAOV,IAApBG;AACAC,YAAAA,UAAAA,GAAaP,IAAAA,GAAOE,KAAAA,CAAMC,IAAND,CAAAA,CAAYlO,MAAhCuO;AAFJ,WAAA,MAGO;AACHD,YAAAA,QAAAA,GAAaO,IAAbP;AACAC,YAAAA,UAAAA,GAAaK,MAAbL;AACH;;AAEDI,UAAAA,YAAAA,GAAe,CAAC,SAAD,EAAYP,OAAZ,EACXS,IADW,EACDC,GAAAA,GAAOF,MADN,EAEXN,QAFW,EAEDN,IAAAA,GAAOO,UAFN,CAAfI;AAKAC,UAAAA,MAAAA,GAASL,UAATK;AACAC,UAAAA,IAAAA,GAASP,QAATO;AACAC,UAAAA,GAAAA,GAASd,IAATc;AA7BJ,SAAA,MA+BO;AACHxB,UAAAA,WAAAA,CAAYiC,SAAZjC,GAAwBwB,GAAAA,GAAM,CAA9BxB;AACAA,UAAAA,WAAAA,CAAY1B,IAAZ0B,CAAiBK,GAAjBL;;AACA,cAAKA,WAAAA,CAAYiC,SAAZjC,KAA0B,CAA/B,EAAmC;AAC/BU,YAAAA,IAAAA,GAAOL,GAAAA,CAAI3N,MAAJ2N,GAAa,CAApBK;AADJ,WAAA,MAEO;AACHA,YAAAA,IAAAA,GAAOV,WAAAA,CAAYiC,SAAZjC,GAAwB,CAA/BU;AACH;;AAEDW,UAAAA,YAAAA,GAAe,CAAC,MAAD,EAAShB,GAAAA,CAAI1F,KAAJ0F,CAAUmB,GAAVnB,EAAeK,IAAAA,GAAO,CAAtBL,CAAT,EACXkB,IADW,EACLC,GAAAA,GAAOF,MADF,EAEXC,IAFW,EAELb,IAAAA,GAAOY,MAFF,CAAfD;AAKAI,UAAAA,MAAAA,CAAOnP,IAAPmP,CAAYJ,YAAZI;AAEAD,UAAAA,GAAAA,GAAMd,IAANc;AACH;;AAED;AAvPJ;;AA0PAA,IAAAA,GAAAA;AACA,WAAOH,YAAP;AACH;;AAED,WAASc,IAAT,CAAcC,KAAd,EAAqB;AACjBV,IAAAA,QAAAA,CAASpP,IAAToP,CAAcU,KAAdV;AACH;;AAED,SAAO;AACHS,IAAAA,IAAAA,EAAAA,IADG;AAEHL,IAAAA,SAAAA,EAAAA,SAFG;AAGHD,IAAAA,SAAAA,EAAAA;AAHG,GAAP;AAKH;;;;ACjUD;;AACA;;;;;AAMA,IAAIQ,YAAY,GAAG,mEAAmEzE,KAAnE,CAAyE,EAAzE,CAAnB;AAEA;;;;AAGAtE,OAAO,CAACgJ,MAAR,GAAiB,UAAUC,MAAV,EAAkB;AACjC,MAAI,KAAKA,MAAL,IAAeA,MAAM,GAAGF,YAAY,CAAC3P,MAAzC,EAAiD;AAC/C,WAAO2P,YAAY,CAACE,MAAD,CAAnB;AACD;;AACD,QAAM,IAAI1I,SAAJ,CAAc,+BAA+B0I,MAA7C,CAAN;AACD,CALD;AAOA;;;;;;AAIAjJ,OAAO,CAACkJ,MAAR,GAAiB,UAAUC,QAAV,EAAoB;AACnC,MAAIC,IAAI,GAAG,EAAX,CADmC,CAChB;;AACnB,MAAIC,IAAI,GAAG,EAAX,CAFmC,CAEhB;;AAEnB,MAAIC,OAAO,GAAG,EAAd,CAJmC,CAIhB;;AACnB,MAAIC,OAAO,GAAG,GAAd,CALmC,CAKhB;;AAEnB,MAAIC,IAAI,GAAG,EAAX,CAPmC,CAOhB;;AACnB,MAAIC,IAAI,GAAG,EAAX,CARmC,CAQhB;;AAEnB,MAAIC,IAAI,GAAG,EAAX,CAVmC,CAUhB;;AACnB,MAAIC,KAAK,GAAG,EAAZ,CAXmC,CAWhB;;AAEnB,MAAIC,YAAY,GAAG,EAAnB;AACA,MAAIC,YAAY,GAAG,EAAnB,CAdmC,CAgBnC;;AACA,MAAIT,IAAI,IAAID,QAAR,IAAoBA,QAAQ,IAAIE,IAApC,EAA0C;AACxC,WAAQF,QAAQ,GAAGC,IAAnB;AACD,GAnBkC,CAqBnC;;;AACA,MAAIE,OAAO,IAAIH,QAAX,IAAuBA,QAAQ,IAAII,OAAvC,EAAgD;AAC9C,WAAQJ,QAAQ,GAAGG,OAAX,GAAqBM,YAA7B;AACD,GAxBkC,CA0BnC;;;AACA,MAAIJ,IAAI,IAAIL,QAAR,IAAoBA,QAAQ,IAAIM,IAApC,EAA0C;AACxC,WAAQN,QAAQ,GAAGK,IAAX,GAAkBK,YAA1B;AACD,GA7BkC,CA+BnC;;;AACA,MAAIV,QAAQ,IAAIO,IAAhB,EAAsB;AACpB,WAAO,EAAP;AACD,GAlCkC,CAoCnC;;;AACA,MAAIP,QAAQ,IAAIQ,KAAhB,EAAuB;AACrB,WAAO,EAAP;AACD,GAvCkC,CAyCnC;;;AACA,SAAO,CAAC,CAAR;AACD,CA3CD;;ACvBA;;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIG,MAAM,GAAG/F,OAAO,CAAC,UAAD,CAApB,EAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAEA,IAAIgG,cAAc,GAAG,CAArB,EAEA;;AACA,IAAIC,QAAQ,GAAG,KAAKD,cAApB,EAEA;;AACA,IAAIE,aAAa,GAAGD,QAAQ,GAAG,CAA/B,EAEA;;AACA,IAAIE,oBAAoB,GAAGF,QAA3B;AAEA;;;;;;;AAMA,SAASG,WAAT,CAAqBC,MAArB,EAA6B;AAC3B,SAAOA,MAAM,GAAG,CAAT,GACH,CAAE,CAACA,MAAF,IAAa,CAAd,IAAmB,CADhB,GAEH,CAACA,MAAM,IAAI,CAAX,IAAgB,CAFpB;AAGD;AAED;;;;;;;;AAMA,SAASC,aAAT,CAAuBD,MAAvB,EAA+B;AAC7B,MAAIE,UAAU,GAAG,CAACF,MAAM,GAAG,CAAV,MAAiB,CAAlC;AACA,MAAIG,OAAO,GAAGH,MAAM,IAAI,CAAxB;AACA,SAAOE,UAAU,GACb,CAACC,OADY,GAEbA,OAFJ;AAGD;AAED;;;;;AAGAvK,OAAO,CAACgJ,MAAR,GAAiB,SAASwB,gBAAT,CAA0BJ,MAA1B,EAAkC;AACjD,MAAIK,OAAO,GAAG,EAAd;AACA,MAAIC,KAAJ;AAEA,MAAIC,GAAG,GAAGR,WAAW,CAACC,MAAD,CAArB;;AAEA,KAAG;AACDM,IAAAA,KAAK,GAAGC,GAAG,GAAGV,aAAd;AACAU,IAAAA,GAAG,MAAMZ,cAAT;;AACA,QAAIY,GAAG,GAAG,CAAV,EAAa;AACX;AACA;AACAD,MAAAA,KAAK,IAAIR,oBAAT;AACD;;AACDO,IAAAA,OAAO,IAAIX,MAAM,CAACd,MAAP,CAAc0B,KAAd,CAAX;AACD,GATD,QASSC,GAAG,GAAG,CATf;;AAWA,SAAOF,OAAP;AACD,CAlBD;AAoBA;;;;;;AAIAzK,OAAO,CAACkJ,MAAR,GAAiB,SAAS0B,gBAAT,CAA0BC,IAA1B,EAAgCC,MAAhC,EAAwCC,SAAxC,EAAmD;AAClE,MAAIC,MAAM,GAAGH,IAAI,CAACzR,MAAlB;AACA,MAAI6R,MAAM,GAAG,CAAb;AACA,MAAIC,KAAK,GAAG,CAAZ;AACA,MAAIC,YAAJ,EAAkBT,KAAlB;;AAEA,KAAG;AACD,QAAII,MAAM,IAAIE,MAAd,EAAsB;AACpB,YAAM,IAAIhO,KAAJ,CAAU,4CAAV,CAAN;AACD;;AAED0N,IAAAA,KAAK,GAAGZ,MAAM,CAACZ,MAAP,CAAc2B,IAAI,CAACnC,UAAL,CAAgBoC,MAAM,EAAtB,CAAd,CAAR;;AACA,QAAIJ,KAAK,KAAK,CAAC,CAAf,EAAkB;AAChB,YAAM,IAAI1N,KAAJ,CAAU,2BAA2B6N,IAAI,CAACjC,MAAL,CAAYkC,MAAM,GAAG,CAArB,CAArC,CAAN;AACD;;AAEDK,IAAAA,YAAY,GAAG,CAAC,EAAET,KAAK,GAAGR,oBAAV,CAAhB;AACAQ,IAAAA,KAAK,IAAIT,aAAT;AACAgB,IAAAA,MAAM,GAAGA,MAAM,IAAIP,KAAK,IAAIQ,KAAb,CAAf;AACAA,IAAAA,KAAK,IAAInB,cAAT;AACD,GAdD,QAcSoB,YAdT;;AAgBAJ,EAAAA,SAAS,CAACtG,KAAV,GAAkB4F,aAAa,CAACY,MAAD,CAA/B;AACAF,EAAAA,SAAS,CAACK,IAAV,GAAiBN,MAAjB;AACD,CAxBD;;ACnHA;;AACA;;;;;;AAMA;;;;;;;;;;AAUA,SAASO,MAAT,CAAgBC,KAAhB,EAAuBC,KAAvB,EAA8BC,aAA9B,EAA6C;AAC3C,MAAID,KAAK,IAAID,KAAb,EAAoB;AAClB,WAAOA,KAAK,CAACC,KAAD,CAAZ;AACD,GAFD,MAEO,IAAIxK,SAAS,CAAC3H,MAAV,KAAqB,CAAzB,EAA4B;AACjC,WAAOoS,aAAP;AACD,GAFM,MAEA;AACL,UAAM,IAAIxO,KAAJ,CAAU,MAAMuO,KAAN,GAAc,2BAAxB,CAAN;AACD;AACF;;AACDvL,OAAO,CAACqL,MAAR,GAAiBA,MAAjB;AAEA,IAAII,SAAS,GAAG,gEAAhB;AACA,IAAIC,aAAa,GAAG,eAApB;;AAEA,SAASC,QAAT,CAAkBC,IAAlB,EAAwB;AACtB,MAAIC,KAAK,GAAGD,IAAI,CAACC,KAAL,CAAWJ,SAAX,CAAZ;;AACA,MAAI,CAACI,KAAL,EAAY;AACV,WAAO,IAAP;AACD;;AACD,SAAO;AACLC,IAAAA,MAAM,EAAED,KAAK,CAAC,CAAD,CADR;AAELE,IAAAA,IAAI,EAAEF,KAAK,CAAC,CAAD,CAFN;AAGLG,IAAAA,IAAI,EAAEH,KAAK,CAAC,CAAD,CAHN;AAILI,IAAAA,IAAI,EAAEJ,KAAK,CAAC,CAAD,CAJN;AAKLK,IAAAA,IAAI,EAAEL,KAAK,CAAC,CAAD;AALN,GAAP;AAOD;;AACD7L,OAAO,CAAC2L,QAAR,GAAmBA,QAAnB;;AAEA,SAASQ,WAAT,CAAqBC,UAArB,EAAiC;AAC/B,MAAIvP,GAAG,GAAG,EAAV;;AACA,MAAIuP,UAAU,CAACN,MAAf,EAAuB;AACrBjP,IAAAA,GAAG,IAAIuP,UAAU,CAACN,MAAX,GAAoB,GAA3B;AACD;;AACDjP,EAAAA,GAAG,IAAI,IAAP;;AACA,MAAIuP,UAAU,CAACL,IAAf,EAAqB;AACnBlP,IAAAA,GAAG,IAAIuP,UAAU,CAACL,IAAX,GAAkB,GAAzB;AACD;;AACD,MAAIK,UAAU,CAACJ,IAAf,EAAqB;AACnBnP,IAAAA,GAAG,IAAIuP,UAAU,CAACJ,IAAlB;AACD;;AACD,MAAII,UAAU,CAACH,IAAf,EAAqB;AACnBpP,IAAAA,GAAG,IAAI,MAAMuP,UAAU,CAACH,IAAxB;AACD;;AACD,MAAIG,UAAU,CAACF,IAAf,EAAqB;AACnBrP,IAAAA,GAAG,IAAIuP,UAAU,CAACF,IAAlB;AACD;;AACD,SAAOrP,GAAP;AACD;;AACDmD,OAAO,CAACmM,WAAR,GAAsBA,WAAtB;AAEA;;;;;;;;;;;;AAWA,SAASE,SAAT,CAAmBC,KAAnB,EAA0B;AACxB,MAAIJ,IAAI,GAAGI,KAAX;AACA,MAAIzP,GAAG,GAAG8O,QAAQ,CAACW,KAAD,CAAlB;;AACA,MAAIzP,GAAJ,EAAS;AACP,QAAI,CAACA,GAAG,CAACqP,IAAT,EAAe;AACb,aAAOI,KAAP;AACD;;AACDJ,IAAAA,IAAI,GAAGrP,GAAG,CAACqP,IAAX;AACD;;AACD,MAAIK,UAAU,GAAGvM,OAAO,CAACuM,UAAR,CAAmBL,IAAnB,CAAjB;AAEA,MAAIM,KAAK,GAAGN,IAAI,CAAC5H,KAAL,CAAW,KAAX,CAAZ;;AACA,OAAK,IAAImI,IAAJ,EAAUC,EAAE,GAAG,CAAf,EAAkBpT,CAAC,GAAGkT,KAAK,CAACpT,MAAN,GAAe,CAA1C,EAA6CE,CAAC,IAAI,CAAlD,EAAqDA,CAAC,EAAtD,EAA0D;AACxDmT,IAAAA,IAAI,GAAGD,KAAK,CAAClT,CAAD,CAAZ;;AACA,QAAImT,IAAI,KAAK,GAAb,EAAkB;AAChBD,MAAAA,KAAK,CAAChT,MAAN,CAAaF,CAAb,EAAgB,CAAhB;AACD,KAFD,MAEO,IAAImT,IAAI,KAAK,IAAb,EAAmB;AACxBC,MAAAA,EAAE;AACH,KAFM,MAEA,IAAIA,EAAE,GAAG,CAAT,EAAY;AACjB,UAAID,IAAI,KAAK,EAAb,EAAiB;AACf;AACA;AACA;AACAD,QAAAA,KAAK,CAAChT,MAAN,CAAaF,CAAC,GAAG,CAAjB,EAAoBoT,EAApB;AACAA,QAAAA,EAAE,GAAG,CAAL;AACD,OAND,MAMO;AACLF,QAAAA,KAAK,CAAChT,MAAN,CAAaF,CAAb,EAAgB,CAAhB;AACAoT,QAAAA,EAAE;AACH;AACF;AACF;;AACDR,EAAAA,IAAI,GAAGM,KAAK,CAACpH,IAAN,CAAW,GAAX,CAAP;;AAEA,MAAI8G,IAAI,KAAK,EAAb,EAAiB;AACfA,IAAAA,IAAI,GAAGK,UAAU,GAAG,GAAH,GAAS,GAA1B;AACD;;AAED,MAAI1P,GAAJ,EAAS;AACPA,IAAAA,GAAG,CAACqP,IAAJ,GAAWA,IAAX;AACA,WAAOC,WAAW,CAACtP,GAAD,CAAlB;AACD;;AACD,SAAOqP,IAAP;AACD;;AACDlM,OAAO,CAACqM,SAAR,GAAoBA,SAApB;AAEA;;;;;;;;;;;;;;;;;AAgBA,SAASjH,IAAT,CAAcuH,KAAd,EAAqBL,KAArB,EAA4B;AAC1B,MAAIK,KAAK,KAAK,EAAd,EAAkB;AAChBA,IAAAA,KAAK,GAAG,GAAR;AACD;;AACD,MAAIL,KAAK,KAAK,EAAd,EAAkB;AAChBA,IAAAA,KAAK,GAAG,GAAR;AACD;;AACD,MAAIM,QAAQ,GAAGjB,QAAQ,CAACW,KAAD,CAAvB;AACA,MAAIO,QAAQ,GAAGlB,QAAQ,CAACgB,KAAD,CAAvB;;AACA,MAAIE,QAAJ,EAAc;AACZF,IAAAA,KAAK,GAAGE,QAAQ,CAACX,IAAT,IAAiB,GAAzB;AACD,GAXyB,CAa1B;;;AACA,MAAIU,QAAQ,IAAI,CAACA,QAAQ,CAACd,MAA1B,EAAkC;AAChC,QAAIe,QAAJ,EAAc;AACZD,MAAAA,QAAQ,CAACd,MAAT,GAAkBe,QAAQ,CAACf,MAA3B;AACD;;AACD,WAAOK,WAAW,CAACS,QAAD,CAAlB;AACD;;AAED,MAAIA,QAAQ,IAAIN,KAAK,CAACT,KAAN,CAAYH,aAAZ,CAAhB,EAA4C;AAC1C,WAAOY,KAAP;AACD,GAvByB,CAyB1B;;;AACA,MAAIO,QAAQ,IAAI,CAACA,QAAQ,CAACb,IAAtB,IAA8B,CAACa,QAAQ,CAACX,IAA5C,EAAkD;AAChDW,IAAAA,QAAQ,CAACb,IAAT,GAAgBM,KAAhB;AACA,WAAOH,WAAW,CAACU,QAAD,CAAlB;AACD;;AAED,MAAIC,MAAM,GAAGR,KAAK,CAAC1D,MAAN,CAAa,CAAb,MAAoB,GAApB,GACT0D,KADS,GAETD,SAAS,CAACM,KAAK,CAAC/N,OAAN,CAAc,MAAd,EAAsB,EAAtB,IAA4B,GAA5B,GAAkC0N,KAAnC,CAFb;;AAIA,MAAIO,QAAJ,EAAc;AACZA,IAAAA,QAAQ,CAACX,IAAT,GAAgBY,MAAhB;AACA,WAAOX,WAAW,CAACU,QAAD,CAAlB;AACD;;AACD,SAAOC,MAAP;AACD;;AACD9M,OAAO,CAACoF,IAAR,GAAeA,IAAf;;AAEApF,OAAO,CAACuM,UAAR,GAAqB,UAAUD,KAAV,EAAiB;AACpC,SAAOA,KAAK,CAAC1D,MAAN,CAAa,CAAb,MAAoB,GAApB,IAA2B6C,SAAS,CAACzG,IAAV,CAAesH,KAAf,CAAlC;AACD,CAFD;AAIA;;;;;;;;AAMA,SAASS,QAAT,CAAkBJ,KAAlB,EAAyBL,KAAzB,EAAgC;AAC9B,MAAIK,KAAK,KAAK,EAAd,EAAkB;AAChBA,IAAAA,KAAK,GAAG,GAAR;AACD;;AAEDA,EAAAA,KAAK,GAAGA,KAAK,CAAC/N,OAAN,CAAc,KAAd,EAAqB,EAArB,CAAR,CAL8B,CAO9B;AACA;AACA;AACA;;AACA,MAAIoO,KAAK,GAAG,CAAZ;;AACA,SAAOV,KAAK,CAAClJ,OAAN,CAAcuJ,KAAK,GAAG,GAAtB,MAA+B,CAAtC,EAAyC;AACvC,QAAIxT,KAAK,GAAGwT,KAAK,CAACM,WAAN,CAAkB,GAAlB,CAAZ;;AACA,QAAI9T,KAAK,GAAG,CAAZ,EAAe;AACb,aAAOmT,KAAP;AACD,KAJsC,CAMvC;AACA;AACA;;;AACAK,IAAAA,KAAK,GAAGA,KAAK,CAACtL,KAAN,CAAY,CAAZ,EAAelI,KAAf,CAAR;;AACA,QAAIwT,KAAK,CAACd,KAAN,CAAY,mBAAZ,CAAJ,EAAsC;AACpC,aAAOS,KAAP;AACD;;AAED,MAAEU,KAAF;AACD,GA3B6B,CA6B9B;;;AACA,SAAO5L,KAAK,CAAC4L,KAAK,GAAG,CAAT,CAAL,CAAiB5H,IAAjB,CAAsB,KAAtB,IAA+BkH,KAAK,CAACY,MAAN,CAAaP,KAAK,CAACvT,MAAN,GAAe,CAA5B,CAAtC;AACD;;AACD4G,OAAO,CAAC+M,QAAR,GAAmBA,QAAnB;;AAEA,IAAII,iBAAiB,GAAI,YAAY;AACnC,MAAIjU,GAAG,GAAG2J,MAAM,CAACuK,MAAP,CAAc,IAAd,CAAV;AACA,SAAO,EAAE,eAAelU,GAAjB,CAAP;AACD,CAHwB,EAAzB;;AAKA,SAASmU,QAAT,CAAmBC,CAAnB,EAAsB;AACpB,SAAOA,CAAP;AACD;AAED;;;;;;;;;;;AASA,SAASC,WAAT,CAAqB1C,IAArB,EAA2B;AACzB,MAAI2C,aAAa,CAAC3C,IAAD,CAAjB,EAAyB;AACvB,WAAO,MAAMA,IAAb;AACD;;AAED,SAAOA,IAAP;AACD;;AACD7K,OAAO,CAACuN,WAAR,GAAsBJ,iBAAiB,GAAGE,QAAH,GAAcE,WAArD;;AAEA,SAASE,aAAT,CAAuB5C,IAAvB,EAA6B;AAC3B,MAAI2C,aAAa,CAAC3C,IAAD,CAAjB,EAAyB;AACvB,WAAOA,IAAI,CAACxJ,KAAL,CAAW,CAAX,CAAP;AACD;;AAED,SAAOwJ,IAAP;AACD;;AACD7K,OAAO,CAACyN,aAAR,GAAwBN,iBAAiB,GAAGE,QAAH,GAAcI,aAAvD;;AAEA,SAASD,aAAT,CAAuBF,CAAvB,EAA0B;AACxB,MAAI,CAACA,CAAL,EAAQ;AACN,WAAO,KAAP;AACD;;AAED,MAAIlU,MAAM,GAAGkU,CAAC,CAAClU,MAAf;;AAEA,MAAIA,MAAM,GAAG;AAAE;AAAf,IAAyC;AACvC,aAAO,KAAP;AACD;;AAED,MAAIkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AAAjC,KACAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AADjC,KAEAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AAFjC,KAGAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AAHjC,KAIAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AAJjC,KAKAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AALjC,KAMAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AANjC,KAOAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AAPjC,KAQAkU,CAAC,CAAC5E,UAAF,CAAatP,MAAM,GAAG,CAAtB,MAA6B;AAAI;AARrC,IAQgD;AAC9C,aAAO,KAAP;AACD;;AAED,OAAK,IAAIE,CAAC,GAAGF,MAAM,GAAG,EAAtB,EAA0BE,CAAC,IAAI,CAA/B,EAAkCA,CAAC,EAAnC,EAAuC;AACrC,QAAIgU,CAAC,CAAC5E,UAAF,CAAapP,CAAb,MAAoB;AAAG;AAA3B,MAAsC;AACpC,eAAO,KAAP;AACD;AACF;;AAED,SAAO,IAAP;AACD;AAED;;;;;;;;;;AAQA,SAASoU,0BAAT,CAAoCC,QAApC,EAA8CC,QAA9C,EAAwDC,mBAAxD,EAA6E;AAC3E,MAAIC,GAAG,GAAGC,MAAM,CAACJ,QAAQ,CAAC5K,MAAV,EAAkB6K,QAAQ,CAAC7K,MAA3B,CAAhB;;AACA,MAAI+K,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACK,YAAT,GAAwBJ,QAAQ,CAACI,YAAvC;;AACA,MAAIF,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACM,cAAT,GAA0BL,QAAQ,CAACK,cAAzC;;AACA,MAAIH,GAAG,KAAK,CAAR,IAAaD,mBAAjB,EAAsC;AACpC,WAAOC,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACO,eAAT,GAA2BN,QAAQ,CAACM,eAA1C;;AACA,MAAIJ,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACQ,aAAT,GAAyBP,QAAQ,CAACO,aAAxC;;AACA,MAAIL,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAED,SAAOC,MAAM,CAACJ,QAAQ,CAACS,IAAV,EAAgBR,QAAQ,CAACQ,IAAzB,CAAb;AACD;;AACDpO,OAAO,CAAC0N,0BAAR,GAAqCA,0BAArC;AAEA;;;;;;;;;;AASA,SAASW,mCAAT,CAA6CV,QAA7C,EAAuDC,QAAvD,EAAiEU,oBAAjE,EAAuF;AACrF,MAAIR,GAAG,GAAGH,QAAQ,CAACQ,aAAT,GAAyBP,QAAQ,CAACO,aAA5C;;AACA,MAAIL,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACO,eAAT,GAA2BN,QAAQ,CAACM,eAA1C;;AACA,MAAIJ,GAAG,KAAK,CAAR,IAAaQ,oBAAjB,EAAuC;AACrC,WAAOR,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGC,MAAM,CAACJ,QAAQ,CAAC5K,MAAV,EAAkB6K,QAAQ,CAAC7K,MAA3B,CAAZ;;AACA,MAAI+K,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACK,YAAT,GAAwBJ,QAAQ,CAACI,YAAvC;;AACA,MAAIF,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACM,cAAT,GAA0BL,QAAQ,CAACK,cAAzC;;AACA,MAAIH,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAED,SAAOC,MAAM,CAACJ,QAAQ,CAACS,IAAV,EAAgBR,QAAQ,CAACQ,IAAzB,CAAb;AACD;;AACDpO,OAAO,CAACqO,mCAAR,GAA8CA,mCAA9C;;AAEA,SAASN,MAAT,CAAgBQ,KAAhB,EAAuBC,KAAvB,EAA8B;AAC5B,MAAID,KAAK,KAAKC,KAAd,EAAqB;AACnB,WAAO,CAAP;AACD;;AAED,MAAID,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,CAAP,CADkB,CACR;AACX;;AAED,MAAIC,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,CAAC,CAAR,CADkB,CACP;AACZ;;AAED,MAAID,KAAK,GAAGC,KAAZ,EAAmB;AACjB,WAAO,CAAP;AACD;;AAED,SAAO,CAAC,CAAR;AACD;AAED;;;;;;AAIA,SAASC,mCAAT,CAA6Cd,QAA7C,EAAuDC,QAAvD,EAAiE;AAC/D,MAAIE,GAAG,GAAGH,QAAQ,CAACQ,aAAT,GAAyBP,QAAQ,CAACO,aAA5C;;AACA,MAAIL,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACO,eAAT,GAA2BN,QAAQ,CAACM,eAA1C;;AACA,MAAIJ,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGC,MAAM,CAACJ,QAAQ,CAAC5K,MAAV,EAAkB6K,QAAQ,CAAC7K,MAA3B,CAAZ;;AACA,MAAI+K,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACK,YAAT,GAAwBJ,QAAQ,CAACI,YAAvC;;AACA,MAAIF,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAEDA,EAAAA,GAAG,GAAGH,QAAQ,CAACM,cAAT,GAA0BL,QAAQ,CAACK,cAAzC;;AACA,MAAIH,GAAG,KAAK,CAAZ,EAAe;AACb,WAAOA,GAAP;AACD;;AAED,SAAOC,MAAM,CAACJ,QAAQ,CAACS,IAAV,EAAgBR,QAAQ,CAACQ,IAAzB,CAAb;AACD;;AACDpO,OAAO,CAACyO,mCAAR,GAA8CA,mCAA9C;AAEA;;;;;;AAKA,SAASC,mBAAT,CAA6BrK,GAA7B,EAAkC;AAChC,SAAO1H,IAAI,CAACyH,KAAL,CAAWC,GAAG,CAACzF,OAAJ,CAAY,gBAAZ,EAA8B,EAA9B,CAAX,CAAP;AACD;;AACDoB,OAAO,CAAC0O,mBAAR,GAA8BA,mBAA9B;AAEA;;;;;AAIA,SAASC,gBAAT,CAA0BC,UAA1B,EAAsCC,SAAtC,EAAiDC,YAAjD,EAA+D;AAC7DD,EAAAA,SAAS,GAAGA,SAAS,IAAI,EAAzB;;AAEA,MAAID,UAAJ,EAAgB;AACd;AACA,QAAIA,UAAU,CAACA,UAAU,CAACxV,MAAX,GAAoB,CAArB,CAAV,KAAsC,GAAtC,IAA6CyV,SAAS,CAAC,CAAD,CAAT,KAAiB,GAAlE,EAAuE;AACrED,MAAAA,UAAU,IAAI,GAAd;AACD,KAJa,CAKd;AACA;AACA;AACA;AACA;;;AACAC,IAAAA,SAAS,GAAGD,UAAU,GAAGC,SAAzB;AACD,GAd4D,CAgB7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AACA,MAAIC,YAAJ,EAAkB;AAChB,QAAIC,MAAM,GAAGpD,QAAQ,CAACmD,YAAD,CAArB;;AACA,QAAI,CAACC,MAAL,EAAa;AACX,YAAM,IAAI/R,KAAJ,CAAU,kCAAV,CAAN;AACD;;AACD,QAAI+R,MAAM,CAAC7C,IAAX,EAAiB;AACf;AACA,UAAI/S,KAAK,GAAG4V,MAAM,CAAC7C,IAAP,CAAYe,WAAZ,CAAwB,GAAxB,CAAZ;;AACA,UAAI9T,KAAK,IAAI,CAAb,EAAgB;AACd4V,QAAAA,MAAM,CAAC7C,IAAP,GAAc6C,MAAM,CAAC7C,IAAP,CAAYxH,SAAZ,CAAsB,CAAtB,EAAyBvL,KAAK,GAAG,CAAjC,CAAd;AACD;AACF;;AACD0V,IAAAA,SAAS,GAAGzJ,IAAI,CAAC+G,WAAW,CAAC4C,MAAD,CAAZ,EAAsBF,SAAtB,CAAhB;AACD;;AAED,SAAOxC,SAAS,CAACwC,SAAD,CAAhB;AACD;;AACD7O,OAAO,CAAC2O,gBAAR,GAA2BA,gBAA3B;;ACveA;;AACA;;;;;AAMA,IAAIK,IAAI,GAAGjL,OAAO,CAAC,QAAD,CAAlB;;AACA,IAAIlL,GAAG,GAAGgK,MAAM,CAAC5C,SAAP,CAAiB2C,cAA3B;AACA,IAAIqM,YAAY,GAAG,OAAOvW,GAAP,KAAe,WAAlC;AAEA;;;;;;;AAMA,SAASwW,QAAT,GAAoB;AAClB,OAAKC,MAAL,GAAc,EAAd;AACA,OAAKC,IAAL,GAAYH,YAAY,GAAG,IAAIvW,GAAJ,EAAH,GAAemK,MAAM,CAACuK,MAAP,CAAc,IAAd,CAAvC;AACD;AAED;;;;;AAGA8B,QAAQ,CAACG,SAAT,GAAqB,SAASC,kBAAT,CAA4BC,MAA5B,EAAoCC,gBAApC,EAAsD;AACzE,MAAI1W,GAAG,GAAG,IAAIoW,QAAJ,EAAV;;AACA,OAAK,IAAI5V,CAAC,GAAG,CAAR,EAAWsH,GAAG,GAAG2O,MAAM,CAACnW,MAA7B,EAAqCE,CAAC,GAAGsH,GAAzC,EAA8CtH,CAAC,EAA/C,EAAmD;AACjDR,IAAAA,GAAG,CAAC4K,GAAJ,CAAQ6L,MAAM,CAACjW,CAAD,CAAd,EAAmBkW,gBAAnB;AACD;;AACD,SAAO1W,GAAP;AACD,CAND;AAQA;;;;;;;;AAMAoW,QAAQ,CAACjP,SAAT,CAAmBwP,IAAnB,GAA0B,SAASC,aAAT,GAAyB;AACjD,SAAOT,YAAY,GAAG,KAAKG,IAAL,CAAUK,IAAb,GAAoB5M,MAAM,CAAC8M,mBAAP,CAA2B,KAAKP,IAAhC,EAAsChW,MAA7E;AACD,CAFD;AAIA;;;;;;;AAKA8V,QAAQ,CAACjP,SAAT,CAAmByD,GAAnB,GAAyB,SAASkM,YAAT,CAAsB/E,IAAtB,EAA4B2E,gBAA5B,EAA8C;AACrE,MAAIK,IAAI,GAAGZ,YAAY,GAAGpE,IAAH,GAAUmE,IAAI,CAACzB,WAAL,CAAiB1C,IAAjB,CAAjC;AACA,MAAIiF,WAAW,GAAGb,YAAY,GAAG,KAAKpW,GAAL,CAASgS,IAAT,CAAH,GAAoBhS,GAAG,CAACsI,IAAJ,CAAS,KAAKiO,IAAd,EAAoBS,IAApB,CAAlD;AACA,MAAIE,GAAG,GAAG,KAAKZ,MAAL,CAAY/V,MAAtB;;AACA,MAAI,CAAC0W,WAAD,IAAgBN,gBAApB,EAAsC;AACpC,SAAKL,MAAL,CAAYnW,IAAZ,CAAiB6R,IAAjB;AACD;;AACD,MAAI,CAACiF,WAAL,EAAkB;AAChB,QAAIb,YAAJ,EAAkB;AAChB,WAAKG,IAAL,CAAUtW,GAAV,CAAc+R,IAAd,EAAoBkF,GAApB;AACD,KAFD,MAEO;AACL,WAAKX,IAAL,CAAUS,IAAV,IAAkBE,GAAlB;AACD;AACF;AACF,CAdD;AAgBA;;;;;;;AAKAb,QAAQ,CAACjP,SAAT,CAAmBpH,GAAnB,GAAyB,SAASmX,YAAT,CAAsBnF,IAAtB,EAA4B;AACnD,MAAIoE,YAAJ,EAAkB;AAChB,WAAO,KAAKG,IAAL,CAAUvW,GAAV,CAAcgS,IAAd,CAAP;AACD,GAFD,MAEO;AACL,QAAIgF,IAAI,GAAGb,IAAI,CAACzB,WAAL,CAAiB1C,IAAjB,CAAX;AACA,WAAOhS,GAAG,CAACsI,IAAJ,CAAS,KAAKiO,IAAd,EAAoBS,IAApB,CAAP;AACD;AACF,CAPD;AASA;;;;;;;AAKAX,QAAQ,CAACjP,SAAT,CAAmBmD,OAAnB,GAA6B,SAAS6M,gBAAT,CAA0BpF,IAA1B,EAAgC;AAC3D,MAAIoE,YAAJ,EAAkB;AAChB,QAAIc,GAAG,GAAG,KAAKX,IAAL,CAAUrW,GAAV,CAAc8R,IAAd,CAAV;;AACA,QAAIkF,GAAG,IAAI,CAAX,EAAc;AACV,aAAOA,GAAP;AACH;AACF,GALD,MAKO;AACL,QAAIF,IAAI,GAAGb,IAAI,CAACzB,WAAL,CAAiB1C,IAAjB,CAAX;;AACA,QAAIhS,GAAG,CAACsI,IAAJ,CAAS,KAAKiO,IAAd,EAAoBS,IAApB,CAAJ,EAA+B;AAC7B,aAAO,KAAKT,IAAL,CAAUS,IAAV,CAAP;AACD;AACF;;AAED,QAAM,IAAI7S,KAAJ,CAAU,MAAM6N,IAAN,GAAa,sBAAvB,CAAN;AACD,CAdD;AAgBA;;;;;;;AAKAqE,QAAQ,CAACjP,SAAT,CAAmBiQ,EAAnB,GAAwB,SAASC,WAAT,CAAqBC,IAArB,EAA2B;AACjD,MAAIA,IAAI,IAAI,CAAR,IAAaA,IAAI,GAAG,KAAKjB,MAAL,CAAY/V,MAApC,EAA4C;AAC1C,WAAO,KAAK+V,MAAL,CAAYiB,IAAZ,CAAP;AACD;;AACD,QAAM,IAAIpT,KAAJ,CAAU,2BAA2BoT,IAArC,CAAN;AACD,CALD;AAOA;;;;;;;AAKAlB,QAAQ,CAACjP,SAAT,CAAmBoQ,OAAnB,GAA6B,SAASC,gBAAT,GAA4B;AACvD,SAAO,KAAKnB,MAAL,CAAY9N,KAAZ,EAAP;AACD,CAFD;;AAIArB,OAAO,CAACkP,QAAR,GAAmBA,QAAnB;;ACxHA;;AACA;;;;;AAMA,IAAIF,IAAI,GAAGjL,OAAO,CAAC,QAAD,CAAlB;AAEA;;;;;;AAIA,SAASwM,sBAAT,CAAgC5C,QAAhC,EAA0CC,QAA1C,EAAoD;AAClD;AACA,MAAI4C,KAAK,GAAG7C,QAAQ,CAACQ,aAArB;AACA,MAAIsC,KAAK,GAAG7C,QAAQ,CAACO,aAArB;AACA,MAAIuC,OAAO,GAAG/C,QAAQ,CAACO,eAAvB;AACA,MAAIyC,OAAO,GAAG/C,QAAQ,CAACM,eAAvB;AACA,SAAOuC,KAAK,GAAGD,KAAR,IAAiBC,KAAK,IAAID,KAAT,IAAkBG,OAAO,IAAID,OAA9C,IACA1B,IAAI,CAACP,mCAAL,CAAyCd,QAAzC,EAAmDC,QAAnD,KAAgE,CADvE;AAED;AAED;;;;;;;AAKA,SAASgD,WAAT,GAAuB;AACrB,OAAKzB,MAAL,GAAc,EAAd;AACA,OAAK0B,OAAL,GAAe,IAAf,CAFqB,CAGrB;;AACA,OAAKC,KAAL,GAAa;AAAC3C,IAAAA,aAAa,EAAE,CAAC,CAAjB;AAAoBD,IAAAA,eAAe,EAAE;AAArC,GAAb;AACD;AAED;;;;;;;;AAMA0C,WAAW,CAAC3Q,SAAZ,CAAsB8Q,eAAtB,GACE,SAASC,mBAAT,CAA6BC,SAA7B,EAAwCC,QAAxC,EAAkD;AAChD,OAAK/B,MAAL,CAAYzV,OAAZ,CAAoBuX,SAApB,EAA+BC,QAA/B;AACD,CAHH;AAKA;;;;;;;AAKAN,WAAW,CAAC3Q,SAAZ,CAAsByD,GAAtB,GAA4B,SAASyN,eAAT,CAAyBC,QAAzB,EAAmC;AAC7D,MAAIb,sBAAsB,CAAC,KAAKO,KAAN,EAAaM,QAAb,CAA1B,EAAkD;AAChD,SAAKN,KAAL,GAAaM,QAAb;;AACA,SAAKjC,MAAL,CAAYnW,IAAZ,CAAiBoY,QAAjB;AACD,GAHD,MAGO;AACL,SAAKP,OAAL,GAAe,KAAf;;AACA,SAAK1B,MAAL,CAAYnW,IAAZ,CAAiBoY,QAAjB;AACD;AACF,CARD;AAUA;;;;;;;;;;;AASAR,WAAW,CAAC3Q,SAAZ,CAAsBoQ,OAAtB,GAAgC,SAASgB,mBAAT,GAA+B;AAC7D,MAAI,CAAC,KAAKR,OAAV,EAAmB;AACjB,SAAK1B,MAAL,CAAYhL,IAAZ,CAAiB6K,IAAI,CAACP,mCAAtB;;AACA,SAAKoC,OAAL,GAAe,IAAf;AACD;;AACD,SAAO,KAAK1B,MAAZ;AACD,CAND;;AAQAnP,OAAO,CAAC4Q,WAAR,GAAsBA,WAAtB;;AC9EA;;AACA;;;;;AAMA,IAAIU,SAAS,GAAGvN,OAAO,CAAC,cAAD,CAAvB;;AACA,IAAIiL,IAAI,GAAGjL,OAAO,CAAC,QAAD,CAAlB;;AACA,IAAImL,QAAQ,GAAGnL,OAAO,CAAC,aAAD,CAAP,CAAuBmL,QAAtC;;AACA,IAAI0B,WAAW,GAAG7M,OAAO,CAAC,gBAAD,CAAP,CAA0B6M,WAA5C;AAEA;;;;;;;;;;AAQA,SAASW,kBAAT,CAA4BjG,KAA5B,EAAmC;AACjC,MAAI,CAACA,KAAL,EAAY;AACVA,IAAAA,KAAK,GAAG,EAAR;AACD;;AACD,OAAKkG,KAAL,GAAaxC,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,EAA2B,IAA3B,CAAb;AACA,OAAKmG,WAAL,GAAmBzC,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,YAAnB,EAAiC,IAAjC,CAAnB;AACA,OAAKoG,eAAL,GAAuB1C,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,gBAAnB,EAAqC,KAArC,CAAvB;AACA,OAAKqG,QAAL,GAAgB,IAAIzC,QAAJ,EAAhB;AACA,OAAK0C,MAAL,GAAc,IAAI1C,QAAJ,EAAd;AACA,OAAK2C,SAAL,GAAiB,IAAIjB,WAAJ,EAAjB;AACA,OAAKkB,gBAAL,GAAwB,IAAxB;AACD;;AAEDP,kBAAkB,CAACtR,SAAnB,CAA6B8R,QAA7B,GAAwC,CAAxC;AAEA;;;;;;AAKAR,kBAAkB,CAACS,aAAnB,GACE,SAASC,gCAAT,CAA0CC,kBAA1C,EAA8D;AAC5D,MAAItD,UAAU,GAAGsD,kBAAkB,CAACtD,UAApC;AACA,MAAIuD,SAAS,GAAG,IAAIZ,kBAAJ,CAAuB;AACrCa,IAAAA,IAAI,EAAEF,kBAAkB,CAACE,IADY;AAErCxD,IAAAA,UAAU,EAAEA;AAFyB,GAAvB,CAAhB;AAIAsD,EAAAA,kBAAkB,CAACG,WAAnB,CAA+B,UAAUC,OAAV,EAAmB;AAChD,QAAIC,UAAU,GAAG;AACfC,MAAAA,SAAS,EAAE;AACTvK,QAAAA,IAAI,EAAEqK,OAAO,CAACnE,aADL;AAETsE,QAAAA,MAAM,EAAEH,OAAO,CAACpE;AAFP;AADI,KAAjB;;AAOA,QAAIoE,OAAO,CAACvP,MAAR,IAAkB,IAAtB,EAA4B;AAC1BwP,MAAAA,UAAU,CAACxP,MAAX,GAAoBuP,OAAO,CAACvP,MAA5B;;AACA,UAAI6L,UAAU,IAAI,IAAlB,EAAwB;AACtB2D,QAAAA,UAAU,CAACxP,MAAX,GAAoBiM,IAAI,CAACjC,QAAL,CAAc6B,UAAd,EAA0B2D,UAAU,CAACxP,MAArC,CAApB;AACD;;AAEDwP,MAAAA,UAAU,CAACG,QAAX,GAAsB;AACpBzK,QAAAA,IAAI,EAAEqK,OAAO,CAACtE,YADM;AAEpByE,QAAAA,MAAM,EAAEH,OAAO,CAACrE;AAFI,OAAtB;;AAKA,UAAIqE,OAAO,CAAClE,IAAR,IAAgB,IAApB,EAA0B;AACxBmE,QAAAA,UAAU,CAACnE,IAAX,GAAkBkE,OAAO,CAAClE,IAA1B;AACD;AACF;;AAED+D,IAAAA,SAAS,CAACQ,UAAV,CAAqBJ,UAArB;AACD,GAzBD;AA0BAL,EAAAA,kBAAkB,CAACU,OAAnB,CAA2BlZ,OAA3B,CAAmC,UAAUmZ,UAAV,EAAsB;AACvD,QAAIC,cAAc,GAAGD,UAArB;;AACA,QAAIjE,UAAU,KAAK,IAAnB,EAAyB;AACvBkE,MAAAA,cAAc,GAAG9D,IAAI,CAACjC,QAAL,CAAc6B,UAAd,EAA0BiE,UAA1B,CAAjB;AACD;;AAED,QAAI,CAACV,SAAS,CAACR,QAAV,CAAmB9Y,GAAnB,CAAuBia,cAAvB,CAAL,EAA6C;AAC3CX,MAAAA,SAAS,CAACR,QAAV,CAAmBjO,GAAnB,CAAuBoP,cAAvB;AACD;;AAED,QAAItL,OAAO,GAAG0K,kBAAkB,CAACa,gBAAnB,CAAoCF,UAApC,CAAd;;AACA,QAAIrL,OAAO,IAAI,IAAf,EAAqB;AACnB2K,MAAAA,SAAS,CAACa,gBAAV,CAA2BH,UAA3B,EAAuCrL,OAAvC;AACD;AACF,GAdD;AAeA,SAAO2K,SAAP;AACD,CAjDH;AAmDA;;;;;;;;;;;;AAUAZ,kBAAkB,CAACtR,SAAnB,CAA6B0S,UAA7B,GACE,SAASM,6BAAT,CAAuC3H,KAAvC,EAA8C;AAC5C,MAAIkH,SAAS,GAAGxD,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,WAAnB,CAAhB;AACA,MAAIoH,QAAQ,GAAG1D,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,UAAnB,EAA+B,IAA/B,CAAf;AACA,MAAIvI,MAAM,GAAGiM,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB,EAA6B,IAA7B,CAAb;AACA,MAAI8C,IAAI,GAAGY,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,EAA2B,IAA3B,CAAX;;AAEA,MAAI,CAAC,KAAKoG,eAAV,EAA2B;AACzB,SAAKwB,gBAAL,CAAsBV,SAAtB,EAAiCE,QAAjC,EAA2C3P,MAA3C,EAAmDqL,IAAnD;AACD;;AAED,MAAIrL,MAAM,IAAI,IAAd,EAAoB;AAClBA,IAAAA,MAAM,GAAGoQ,MAAM,CAACpQ,MAAD,CAAf;;AACA,QAAI,CAAC,KAAK4O,QAAL,CAAc9Y,GAAd,CAAkBkK,MAAlB,CAAL,EAAgC;AAC9B,WAAK4O,QAAL,CAAcjO,GAAd,CAAkBX,MAAlB;AACD;AACF;;AAED,MAAIqL,IAAI,IAAI,IAAZ,EAAkB;AAChBA,IAAAA,IAAI,GAAG+E,MAAM,CAAC/E,IAAD,CAAb;;AACA,QAAI,CAAC,KAAKwD,MAAL,CAAY/Y,GAAZ,CAAgBuV,IAAhB,CAAL,EAA4B;AAC1B,WAAKwD,MAAL,CAAYlO,GAAZ,CAAgB0K,IAAhB;AACD;AACF;;AAED,OAAKyD,SAAL,CAAenO,GAAf,CAAmB;AACjByK,IAAAA,aAAa,EAAEqE,SAAS,CAACvK,IADR;AAEjBiG,IAAAA,eAAe,EAAEsE,SAAS,CAACC,MAFV;AAGjBzE,IAAAA,YAAY,EAAE0E,QAAQ,IAAI,IAAZ,IAAoBA,QAAQ,CAACzK,IAH1B;AAIjBgG,IAAAA,cAAc,EAAEyE,QAAQ,IAAI,IAAZ,IAAoBA,QAAQ,CAACD,MAJ5B;AAKjB1P,IAAAA,MAAM,EAAEA,MALS;AAMjBqL,IAAAA,IAAI,EAAEA;AANW,GAAnB;AAQD,CAjCH;AAmCA;;;;;AAGAmD,kBAAkB,CAACtR,SAAnB,CAA6B+S,gBAA7B,GACE,SAASI,mCAAT,CAA6CC,WAA7C,EAA0DC,cAA1D,EAA0E;AACxE,MAAIvQ,MAAM,GAAGsQ,WAAb;;AACA,MAAI,KAAK5B,WAAL,IAAoB,IAAxB,EAA8B;AAC5B1O,IAAAA,MAAM,GAAGiM,IAAI,CAACjC,QAAL,CAAc,KAAK0E,WAAnB,EAAgC1O,MAAhC,CAAT;AACD;;AAED,MAAIuQ,cAAc,IAAI,IAAtB,EAA4B;AAC1B;AACA;AACA,QAAI,CAAC,KAAKxB,gBAAV,EAA4B;AAC1B,WAAKA,gBAAL,GAAwBjP,MAAM,CAACuK,MAAP,CAAc,IAAd,CAAxB;AACD;;AACD,SAAK0E,gBAAL,CAAsB9C,IAAI,CAACzB,WAAL,CAAiBxK,MAAjB,CAAtB,IAAkDuQ,cAAlD;AACD,GAPD,MAOO,IAAI,KAAKxB,gBAAT,EAA2B;AAChC;AACA;AACA,WAAO,KAAKA,gBAAL,CAAsB9C,IAAI,CAACzB,WAAL,CAAiBxK,MAAjB,CAAtB,CAAP;;AACA,QAAIF,MAAM,CAACnD,IAAP,CAAY,KAAKoS,gBAAjB,EAAmC1Y,MAAnC,KAA8C,CAAlD,EAAqD;AACnD,WAAK0Y,gBAAL,GAAwB,IAAxB;AACD;AACF;AACF,CAtBH;AAwBA;;;;;;;;;;;;;;;;;;AAgBAP,kBAAkB,CAACtR,SAAnB,CAA6BsT,cAA7B,GACE,SAASC,iCAAT,CAA2CtB,kBAA3C,EAA+DmB,WAA/D,EAA4EI,cAA5E,EAA4F;AAC1F,MAAIZ,UAAU,GAAGQ,WAAjB,CAD0F,CAE1F;;AACA,MAAIA,WAAW,IAAI,IAAnB,EAAyB;AACvB,QAAInB,kBAAkB,CAACE,IAAnB,IAA2B,IAA/B,EAAqC;AACnC,YAAM,IAAIpV,KAAJ,CACJ,0FACA,0DAFI,CAAN;AAID;;AACD6V,IAAAA,UAAU,GAAGX,kBAAkB,CAACE,IAAhC;AACD;;AACD,MAAIxD,UAAU,GAAG,KAAK6C,WAAtB,CAZ0F,CAa1F;;AACA,MAAI7C,UAAU,IAAI,IAAlB,EAAwB;AACtBiE,IAAAA,UAAU,GAAG7D,IAAI,CAACjC,QAAL,CAAc6B,UAAd,EAA0BiE,UAA1B,CAAb;AACD,GAhByF,CAiB1F;AACA;;;AACA,MAAIa,UAAU,GAAG,IAAIxE,QAAJ,EAAjB;AACA,MAAIyE,QAAQ,GAAG,IAAIzE,QAAJ,EAAf,CApB0F,CAsB1F;;AACA,OAAK2C,SAAL,CAAed,eAAf,CAA+B,UAAUuB,OAAV,EAAmB;AAChD,QAAIA,OAAO,CAACvP,MAAR,KAAmB8P,UAAnB,IAAiCP,OAAO,CAACtE,YAAR,IAAwB,IAA7D,EAAmE;AACjE;AACA,UAAI0E,QAAQ,GAAGR,kBAAkB,CAAC0B,mBAAnB,CAAuC;AACpD3L,QAAAA,IAAI,EAAEqK,OAAO,CAACtE,YADsC;AAEpDyE,QAAAA,MAAM,EAAEH,OAAO,CAACrE;AAFoC,OAAvC,CAAf;;AAIA,UAAIyE,QAAQ,CAAC3P,MAAT,IAAmB,IAAvB,EAA6B;AAC3B;AACAuP,QAAAA,OAAO,CAACvP,MAAR,GAAiB2P,QAAQ,CAAC3P,MAA1B;;AACA,YAAI0Q,cAAc,IAAI,IAAtB,EAA4B;AAC1BnB,UAAAA,OAAO,CAACvP,MAAR,GAAiBiM,IAAI,CAAC5J,IAAL,CAAUqO,cAAV,EAA0BnB,OAAO,CAACvP,MAAlC,CAAjB;AACD;;AACD,YAAI6L,UAAU,IAAI,IAAlB,EAAwB;AACtB0D,UAAAA,OAAO,CAACvP,MAAR,GAAiBiM,IAAI,CAACjC,QAAL,CAAc6B,UAAd,EAA0B0D,OAAO,CAACvP,MAAlC,CAAjB;AACD;;AACDuP,QAAAA,OAAO,CAACtE,YAAR,GAAuB0E,QAAQ,CAACzK,IAAhC;AACAqK,QAAAA,OAAO,CAACrE,cAAR,GAAyByE,QAAQ,CAACD,MAAlC;;AACA,YAAIC,QAAQ,CAACtE,IAAT,IAAiB,IAArB,EAA2B;AACzBkE,UAAAA,OAAO,CAAClE,IAAR,GAAesE,QAAQ,CAACtE,IAAxB;AACD;AACF;AACF;;AAED,QAAIrL,MAAM,GAAGuP,OAAO,CAACvP,MAArB;;AACA,QAAIA,MAAM,IAAI,IAAV,IAAkB,CAAC2Q,UAAU,CAAC7a,GAAX,CAAekK,MAAf,CAAvB,EAA+C;AAC7C2Q,MAAAA,UAAU,CAAChQ,GAAX,CAAeX,MAAf;AACD;;AAED,QAAIqL,IAAI,GAAGkE,OAAO,CAAClE,IAAnB;;AACA,QAAIA,IAAI,IAAI,IAAR,IAAgB,CAACuF,QAAQ,CAAC9a,GAAT,CAAauV,IAAb,CAArB,EAAyC;AACvCuF,MAAAA,QAAQ,CAACjQ,GAAT,CAAa0K,IAAb;AACD;AAEF,GAlCD,EAkCG,IAlCH;;AAmCA,OAAKuD,QAAL,GAAgB+B,UAAhB;AACA,OAAK9B,MAAL,GAAc+B,QAAd,CA3D0F,CA6D1F;;AACAzB,EAAAA,kBAAkB,CAACU,OAAnB,CAA2BlZ,OAA3B,CAAmC,UAAUmZ,UAAV,EAAsB;AACvD,QAAIrL,OAAO,GAAG0K,kBAAkB,CAACa,gBAAnB,CAAoCF,UAApC,CAAd;;AACA,QAAIrL,OAAO,IAAI,IAAf,EAAqB;AACnB,UAAIiM,cAAc,IAAI,IAAtB,EAA4B;AAC1BZ,QAAAA,UAAU,GAAG7D,IAAI,CAAC5J,IAAL,CAAUqO,cAAV,EAA0BZ,UAA1B,CAAb;AACD;;AACD,UAAIjE,UAAU,IAAI,IAAlB,EAAwB;AACtBiE,QAAAA,UAAU,GAAG7D,IAAI,CAACjC,QAAL,CAAc6B,UAAd,EAA0BiE,UAA1B,CAAb;AACD;;AACD,WAAKG,gBAAL,CAAsBH,UAAtB,EAAkCrL,OAAlC;AACD;AACF,GAXD,EAWG,IAXH;AAYD,CA3EH;AA6EA;;;;;;;;;;;;;AAWA+J,kBAAkB,CAACtR,SAAnB,CAA6BiT,gBAA7B,GACE,SAASW,kCAAT,CAA4CC,UAA5C,EAAwDC,SAAxD,EAAmEC,OAAnE,EAC4CzI,KAD5C,EACmD;AACjD;AACA;AACA;AACA;AACA,MAAIwI,SAAS,IAAI,OAAOA,SAAS,CAAC9L,IAAjB,KAA0B,QAAvC,IAAmD,OAAO8L,SAAS,CAACtB,MAAjB,KAA4B,QAAnF,EAA6F;AACzF,UAAM,IAAIzV,KAAJ,CACF,qFACA,iFADA,GAEA,+EAHE,CAAN;AAKH;;AAED,MAAI8W,UAAU,IAAI,UAAUA,UAAxB,IAAsC,YAAYA,UAAlD,IACGA,UAAU,CAAC7L,IAAX,GAAkB,CADrB,IAC0B6L,UAAU,CAACrB,MAAX,IAAqB,CAD/C,IAEG,CAACsB,SAFJ,IAEiB,CAACC,OAFlB,IAE6B,CAACzI,KAFlC,EAEyC;AACvC;AACA;AACD,GALD,MAMK,IAAIuI,UAAU,IAAI,UAAUA,UAAxB,IAAsC,YAAYA,UAAlD,IACGC,SADH,IACgB,UAAUA,SAD1B,IACuC,YAAYA,SADnD,IAEGD,UAAU,CAAC7L,IAAX,GAAkB,CAFrB,IAE0B6L,UAAU,CAACrB,MAAX,IAAqB,CAF/C,IAGGsB,SAAS,CAAC9L,IAAV,GAAiB,CAHpB,IAGyB8L,SAAS,CAACtB,MAAV,IAAoB,CAH7C,IAIGuB,OAJP,EAIgB;AACnB;AACA;AACD,GAPI,MAQA;AACH,UAAM,IAAIhX,KAAJ,CAAU,sBAAsBL,IAAI,CAACC,SAAL,CAAe;AACnD4V,MAAAA,SAAS,EAAEsB,UADwC;AAEnD/Q,MAAAA,MAAM,EAAEiR,OAF2C;AAGnDtB,MAAAA,QAAQ,EAAEqB,SAHyC;AAInD3F,MAAAA,IAAI,EAAE7C;AAJ6C,KAAf,CAAhC,CAAN;AAMD;AACF,CArCH;AAuCA;;;;;;AAIAgG,kBAAkB,CAACtR,SAAnB,CAA6BgU,kBAA7B,GACE,SAASC,oCAAT,GAAgD;AAC9C,MAAIC,uBAAuB,GAAG,CAA9B;AACA,MAAIC,qBAAqB,GAAG,CAA5B;AACA,MAAIC,sBAAsB,GAAG,CAA7B;AACA,MAAIC,oBAAoB,GAAG,CAA3B;AACA,MAAIC,YAAY,GAAG,CAAnB;AACA,MAAIC,cAAc,GAAG,CAArB;AACA,MAAIvJ,MAAM,GAAG,EAAb;AACA,MAAI7D,IAAJ;AACA,MAAIkL,OAAJ;AACA,MAAImC,OAAJ;AACA,MAAIC,SAAJ;;AAEA,MAAIC,QAAQ,GAAG,KAAK9C,SAAL,CAAexB,OAAf,EAAf;;AACA,OAAK,IAAI/W,CAAC,GAAG,CAAR,EAAWsH,GAAG,GAAG+T,QAAQ,CAACvb,MAA/B,EAAuCE,CAAC,GAAGsH,GAA3C,EAAgDtH,CAAC,EAAjD,EAAqD;AACnDgZ,IAAAA,OAAO,GAAGqC,QAAQ,CAACrb,CAAD,CAAlB;AACA8N,IAAAA,IAAI,GAAG,EAAP;;AAEA,QAAIkL,OAAO,CAACnE,aAAR,KAA0BiG,qBAA9B,EAAqD;AACnDD,MAAAA,uBAAuB,GAAG,CAA1B;;AACA,aAAO7B,OAAO,CAACnE,aAAR,KAA0BiG,qBAAjC,EAAwD;AACtDhN,QAAAA,IAAI,IAAI,GAAR;AACAgN,QAAAA,qBAAqB;AACtB;AACF,KAND,MAOK;AACH,UAAI9a,CAAC,GAAG,CAAR,EAAW;AACT,YAAI,CAAC0V,IAAI,CAACP,mCAAL,CAAyC6D,OAAzC,EAAkDqC,QAAQ,CAACrb,CAAC,GAAG,CAAL,CAA1D,CAAL,EAAyE;AACvE;AACD;;AACD8N,QAAAA,IAAI,IAAI,GAAR;AACD;AACF;;AAEDA,IAAAA,IAAI,IAAIkK,SAAS,CAACtI,MAAV,CAAiBsJ,OAAO,CAACpE,eAAR,GACIiG,uBADrB,CAAR;AAEAA,IAAAA,uBAAuB,GAAG7B,OAAO,CAACpE,eAAlC;;AAEA,QAAIoE,OAAO,CAACvP,MAAR,IAAkB,IAAtB,EAA4B;AAC1B2R,MAAAA,SAAS,GAAG,KAAK/C,QAAL,CAAcvO,OAAd,CAAsBkP,OAAO,CAACvP,MAA9B,CAAZ;AACAqE,MAAAA,IAAI,IAAIkK,SAAS,CAACtI,MAAV,CAAiB0L,SAAS,GAAGF,cAA7B,CAAR;AACAA,MAAAA,cAAc,GAAGE,SAAjB,CAH0B,CAK1B;;AACAtN,MAAAA,IAAI,IAAIkK,SAAS,CAACtI,MAAV,CAAiBsJ,OAAO,CAACtE,YAAR,GAAuB,CAAvB,GACIsG,oBADrB,CAAR;AAEAA,MAAAA,oBAAoB,GAAGhC,OAAO,CAACtE,YAAR,GAAuB,CAA9C;AAEA5G,MAAAA,IAAI,IAAIkK,SAAS,CAACtI,MAAV,CAAiBsJ,OAAO,CAACrE,cAAR,GACIoG,sBADrB,CAAR;AAEAA,MAAAA,sBAAsB,GAAG/B,OAAO,CAACrE,cAAjC;;AAEA,UAAIqE,OAAO,CAAClE,IAAR,IAAgB,IAApB,EAA0B;AACxBqG,QAAAA,OAAO,GAAG,KAAK7C,MAAL,CAAYxO,OAAZ,CAAoBkP,OAAO,CAAClE,IAA5B,CAAV;AACAhH,QAAAA,IAAI,IAAIkK,SAAS,CAACtI,MAAV,CAAiByL,OAAO,GAAGF,YAA3B,CAAR;AACAA,QAAAA,YAAY,GAAGE,OAAf;AACD;AACF;;AAEDxJ,IAAAA,MAAM,IAAI7D,IAAV;AACD;;AAED,SAAO6D,MAAP;AACD,CAhEH;;AAkEAsG,kBAAkB,CAACtR,SAAnB,CAA6B2U,uBAA7B,GACE,SAASC,yCAAT,CAAmDC,QAAnD,EAA6DC,WAA7D,EAA0E;AACxE,SAAOD,QAAQ,CAACvQ,GAAT,CAAa,UAAUxB,MAAV,EAAkB;AACpC,QAAI,CAAC,KAAK+O,gBAAV,EAA4B;AAC1B,aAAO,IAAP;AACD;;AACD,QAAIiD,WAAW,IAAI,IAAnB,EAAyB;AACvBhS,MAAAA,MAAM,GAAGiM,IAAI,CAACjC,QAAL,CAAcgI,WAAd,EAA2BhS,MAA3B,CAAT;AACD;;AACD,QAAIV,GAAG,GAAG2M,IAAI,CAACzB,WAAL,CAAiBxK,MAAjB,CAAV;AACA,WAAOF,MAAM,CAAC5C,SAAP,CAAiB2C,cAAjB,CAAgCzB,IAAhC,CAAqC,KAAK2Q,gBAA1C,EAA4DzP,GAA5D,IACH,KAAKyP,gBAAL,CAAsBzP,GAAtB,CADG,GAEH,IAFJ;AAGD,GAXM,EAWJ,IAXI,CAAP;AAYD,CAdH;AAgBA;;;;;AAGAkP,kBAAkB,CAACtR,SAAnB,CAA6B+U,MAA7B,GACE,SAASC,yBAAT,GAAqC;AACnC,MAAI1Q,GAAG,GAAG;AACR2Q,IAAAA,OAAO,EAAE,KAAKnD,QADN;AAERa,IAAAA,OAAO,EAAE,KAAKjB,QAAL,CAActB,OAAd,EAFD;AAGR8E,IAAAA,KAAK,EAAE,KAAKvD,MAAL,CAAYvB,OAAZ,EAHC;AAIRsE,IAAAA,QAAQ,EAAE,KAAKV,kBAAL;AAJF,GAAV;;AAMA,MAAI,KAAKzC,KAAL,IAAc,IAAlB,EAAwB;AACtBjN,IAAAA,GAAG,CAAC6N,IAAJ,GAAW,KAAKZ,KAAhB;AACD;;AACD,MAAI,KAAKC,WAAL,IAAoB,IAAxB,EAA8B;AAC5BlN,IAAAA,GAAG,CAACqK,UAAJ,GAAiB,KAAK6C,WAAtB;AACD;;AACD,MAAI,KAAKK,gBAAT,EAA2B;AACzBvN,IAAAA,GAAG,CAAC6Q,cAAJ,GAAqB,KAAKR,uBAAL,CAA6BrQ,GAAG,CAACqO,OAAjC,EAA0CrO,GAAG,CAACqK,UAA9C,CAArB;AACD;;AAED,SAAOrK,GAAP;AACD,CAnBH;AAqBA;;;;;AAGAgN,kBAAkB,CAACtR,SAAnB,CAA6BhB,QAA7B,GACE,SAASoW,2BAAT,GAAuC;AACrC,SAAO1Y,IAAI,CAACC,SAAL,CAAe,KAAKoY,MAAL,EAAf,CAAP;AACD,CAHH;;AAKAhV,OAAO,CAACuR,kBAAR,GAA6BA,kBAA7B;;ACxaA;;AACA;;;;;AAMAvR,OAAO,CAACsV,oBAAR,GAA+B,CAA/B;AACAtV,OAAO,CAACuV,iBAAR,GAA4B,CAA5B;AAEA;;;;;;;;;;;;;;AAaA,SAASC,eAAT,CAAyBC,IAAzB,EAA+BC,KAA/B,EAAsCC,OAAtC,EAA+CC,SAA/C,EAA0DC,QAA1D,EAAoEC,KAApE,EAA2E;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAIC,GAAG,GAAG9X,IAAI,CAAC+X,KAAL,CAAW,CAACN,KAAK,GAAGD,IAAT,IAAiB,CAA5B,IAAiCA,IAA3C;AACA,MAAI3H,GAAG,GAAG+H,QAAQ,CAACF,OAAD,EAAUC,SAAS,CAACG,GAAD,CAAnB,EAA0B,IAA1B,CAAlB;;AACA,MAAIjI,GAAG,KAAK,CAAZ,EAAe;AACb;AACA,WAAOiI,GAAP;AACD,GAHD,MAIK,IAAIjI,GAAG,GAAG,CAAV,EAAa;AAChB;AACA,QAAI4H,KAAK,GAAGK,GAAR,GAAc,CAAlB,EAAqB;AACnB;AACA,aAAOP,eAAe,CAACO,GAAD,EAAML,KAAN,EAAaC,OAAb,EAAsBC,SAAtB,EAAiCC,QAAjC,EAA2CC,KAA3C,CAAtB;AACD,KALe,CAOhB;AACA;;;AACA,QAAIA,KAAK,IAAI9V,OAAO,CAACuV,iBAArB,EAAwC;AACtC,aAAOG,KAAK,GAAGE,SAAS,CAACxc,MAAlB,GAA2Bsc,KAA3B,GAAmC,CAAC,CAA3C;AACD,KAFD,MAEO;AACL,aAAOK,GAAP;AACD;AACF,GAdI,MAeA;AACH;AACA,QAAIA,GAAG,GAAGN,IAAN,GAAa,CAAjB,EAAoB;AAClB;AACA,aAAOD,eAAe,CAACC,IAAD,EAAOM,GAAP,EAAYJ,OAAZ,EAAqBC,SAArB,EAAgCC,QAAhC,EAA0CC,KAA1C,CAAtB;AACD,KALE,CAOH;;;AACA,QAAIA,KAAK,IAAI9V,OAAO,CAACuV,iBAArB,EAAwC;AACtC,aAAOQ,GAAP;AACD,KAFD,MAEO;AACL,aAAON,IAAI,GAAG,CAAP,GAAW,CAAC,CAAZ,GAAgBA,IAAvB;AACD;AACF;AACF;AAED;;;;;;;;;;;;;;;;;;;;AAkBAzV,OAAO,CAACiW,MAAR,GAAiB,SAASA,MAAT,CAAgBN,OAAhB,EAAyBC,SAAzB,EAAoCC,QAApC,EAA8CC,KAA9C,EAAqD;AACpE,MAAIF,SAAS,CAACxc,MAAV,KAAqB,CAAzB,EAA4B;AAC1B,WAAO,CAAC,CAAR;AACD;;AAED,MAAID,KAAK,GAAGqc,eAAe,CAAC,CAAC,CAAF,EAAKI,SAAS,CAACxc,MAAf,EAAuBuc,OAAvB,EAAgCC,SAAhC,EACCC,QADD,EACWC,KAAK,IAAI9V,OAAO,CAACsV,oBAD5B,CAA3B;;AAEA,MAAInc,KAAK,GAAG,CAAZ,EAAe;AACb,WAAO,CAAC,CAAR;AACD,GATmE,CAWpE;AACA;AACA;;;AACA,SAAOA,KAAK,GAAG,CAAR,IAAa,CAApB,EAAuB;AACrB,QAAI0c,QAAQ,CAACD,SAAS,CAACzc,KAAD,CAAV,EAAmByc,SAAS,CAACzc,KAAK,GAAG,CAAT,CAA5B,EAAyC,IAAzC,CAAR,KAA2D,CAA/D,EAAkE;AAChE;AACD;;AACD,MAAEA,KAAF;AACD;;AAED,SAAOA,KAAP;AACD,CAtBD;;ACxFA;;AACA;;;;;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;AAUA,SAAS+c,IAAT,CAAcC,GAAd,EAAmBlT,CAAnB,EAAsBmT,CAAtB,EAAyB;AACvB,MAAIC,IAAI,GAAGF,GAAG,CAAClT,CAAD,CAAd;AACAkT,EAAAA,GAAG,CAAClT,CAAD,CAAH,GAASkT,GAAG,CAACC,CAAD,CAAZ;AACAD,EAAAA,GAAG,CAACC,CAAD,CAAH,GAASC,IAAT;AACD;AAED;;;;;;;;;;AAQA,SAASC,gBAAT,CAA0BC,GAA1B,EAA+BC,IAA/B,EAAqC;AACnC,SAAOvY,IAAI,CAACwY,KAAL,CAAWF,GAAG,GAAItY,IAAI,CAACyY,MAAL,MAAiBF,IAAI,GAAGD,GAAxB,CAAlB,CAAP;AACD;AAED;;;;;;;;;;;;;;AAYA,SAASI,WAAT,CAAqBR,GAArB,EAA0BS,UAA1B,EAAsCC,CAAtC,EAAyCC,CAAzC,EAA4C;AAC1C;AACA;AACA;AAEA,MAAID,CAAC,GAAGC,CAAR,EAAW;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;AACA;AACA,QAAIC,UAAU,GAAGT,gBAAgB,CAACO,CAAD,EAAIC,CAAJ,CAAjC;AACA,QAAIxd,CAAC,GAAGud,CAAC,GAAG,CAAZ;AAEAX,IAAAA,IAAI,CAACC,GAAD,EAAMY,UAAN,EAAkBD,CAAlB,CAAJ;AACA,QAAIE,KAAK,GAAGb,GAAG,CAACW,CAAD,CAAf,CAhBS,CAkBT;AACA;AACA;AACA;AACA;AACA;;AACA,SAAK,IAAIG,CAAC,GAAGJ,CAAb,EAAgBI,CAAC,GAAGH,CAApB,EAAuBG,CAAC,EAAxB,EAA4B;AAC1B,UAAIL,UAAU,CAACT,GAAG,CAACc,CAAD,CAAJ,EAASD,KAAT,CAAV,IAA6B,CAAjC,EAAoC;AAClC1d,QAAAA,CAAC,IAAI,CAAL;AACA4c,QAAAA,IAAI,CAACC,GAAD,EAAM7c,CAAN,EAAS2d,CAAT,CAAJ;AACD;AACF;;AAEDf,IAAAA,IAAI,CAACC,GAAD,EAAM7c,CAAC,GAAG,CAAV,EAAa2d,CAAb,CAAJ;AACA,QAAIC,CAAC,GAAG5d,CAAC,GAAG,CAAZ,CAhCS,CAkCT;;AAEAqd,IAAAA,WAAW,CAACR,GAAD,EAAMS,UAAN,EAAkBC,CAAlB,EAAqBK,CAAC,GAAG,CAAzB,CAAX;AACAP,IAAAA,WAAW,CAACR,GAAD,EAAMS,UAAN,EAAkBM,CAAC,GAAG,CAAtB,EAAyBJ,CAAzB,CAAX;AACD;AACF;AAED;;;;;;;;;;AAQA9W,OAAO,CAACmX,SAAR,GAAoB,UAAUhB,GAAV,EAAeS,UAAf,EAA2B;AAC7CD,EAAAA,WAAW,CAACR,GAAD,EAAMS,UAAN,EAAkB,CAAlB,EAAqBT,GAAG,CAAC/c,MAAJ,GAAa,CAAlC,CAAX;AACD,CAFD;;AC/GA;;AACA;;;;;AAMA,IAAI4V,IAAI,GAAGjL,OAAO,CAAC,QAAD,CAAlB;;AACA,IAAIqT,YAAY,GAAGrT,OAAO,CAAC,iBAAD,CAA1B;;AACA,IAAImL,QAAQ,GAAGnL,OAAO,CAAC,aAAD,CAAP,CAAuBmL,QAAtC;;AACA,IAAIoC,SAAS,GAAGvN,OAAO,CAAC,cAAD,CAAvB;;AACA,IAAIoT,SAAS,GAAGpT,OAAO,CAAC,cAAD,CAAP,CAAwBoT,SAAxC;;AAEA,SAASE,iBAAT,CAA2BC,UAA3B,EAAuCC,aAAvC,EAAsD;AACpD,MAAIC,SAAS,GAAGF,UAAhB;;AACA,MAAI,OAAOA,UAAP,KAAsB,QAA1B,EAAoC;AAClCE,IAAAA,SAAS,GAAGxI,IAAI,CAACN,mBAAL,CAAyB4I,UAAzB,CAAZ;AACD;;AAED,SAAOE,SAAS,CAACC,QAAV,IAAsB,IAAtB,GACH,IAAIC,wBAAJ,CAA6BF,SAA7B,EAAwCD,aAAxC,CADG,GAEH,IAAII,sBAAJ,CAA2BH,SAA3B,EAAsCD,aAAtC,CAFJ;AAGD;;AAEDF,iBAAiB,CAACrF,aAAlB,GAAkC,UAASsF,UAAT,EAAqBC,aAArB,EAAoC;AACpE,SAAOI,sBAAsB,CAAC3F,aAAvB,CAAqCsF,UAArC,EAAiDC,aAAjD,CAAP;AACD,CAFD;AAIA;;;;;AAGAF,iBAAiB,CAACpX,SAAlB,CAA4B8R,QAA5B,GAAuC,CAAvC,EAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEAsF,iBAAiB,CAACpX,SAAlB,CAA4B2X,mBAA5B,GAAkD,IAAlD;AACA/U,MAAM,CAACgV,cAAP,CAAsBR,iBAAiB,CAACpX,SAAxC,EAAmD,oBAAnD,EAAyE;AACvE6X,EAAAA,YAAY,EAAE,IADyD;AAEvEC,EAAAA,UAAU,EAAE,IAF2D;AAGvEhf,EAAAA,GAAG,EAAE,YAAY;AACf,QAAI,CAAC,KAAK6e,mBAAV,EAA+B;AAC7B,WAAKI,cAAL,CAAoB,KAAKnG,SAAzB,EAAoC,KAAKjD,UAAzC;AACD;;AAED,WAAO,KAAKgJ,mBAAZ;AACD;AATsE,CAAzE;AAYAP,iBAAiB,CAACpX,SAAlB,CAA4BgY,kBAA5B,GAAiD,IAAjD;AACApV,MAAM,CAACgV,cAAP,CAAsBR,iBAAiB,CAACpX,SAAxC,EAAmD,mBAAnD,EAAwE;AACtE6X,EAAAA,YAAY,EAAE,IADwD;AAEtEC,EAAAA,UAAU,EAAE,IAF0D;AAGtEhf,EAAAA,GAAG,EAAE,YAAY;AACf,QAAI,CAAC,KAAKkf,kBAAV,EAA8B;AAC5B,WAAKD,cAAL,CAAoB,KAAKnG,SAAzB,EAAoC,KAAKjD,UAAzC;AACD;;AAED,WAAO,KAAKqJ,kBAAZ;AACD;AATqE,CAAxE;;AAYAZ,iBAAiB,CAACpX,SAAlB,CAA4BiY,uBAA5B,GACE,SAASC,wCAAT,CAAkDtN,IAAlD,EAAwD1R,KAAxD,EAA+D;AAC7D,MAAIif,CAAC,GAAGvN,IAAI,CAACjC,MAAL,CAAYzP,KAAZ,CAAR;AACA,SAAOif,CAAC,KAAK,GAAN,IAAaA,CAAC,KAAK,GAA1B;AACD,CAJH;AAMA;;;;;;;AAKAf,iBAAiB,CAACpX,SAAlB,CAA4B+X,cAA5B,GACE,SAASK,+BAAT,CAAyCxN,IAAzC,EAA+CkK,WAA/C,EAA4D;AAC1D,QAAM,IAAI/X,KAAJ,CAAU,0CAAV,CAAN;AACD,CAHH;;AAKAqa,iBAAiB,CAACiB,eAAlB,GAAoC,CAApC;AACAjB,iBAAiB,CAACkB,cAAlB,GAAmC,CAAnC;AAEAlB,iBAAiB,CAAC/B,oBAAlB,GAAyC,CAAzC;AACA+B,iBAAiB,CAAC9B,iBAAlB,GAAsC,CAAtC;AAEA;;;;;;;;;;;;;;;;;AAgBA8B,iBAAiB,CAACpX,SAAlB,CAA4BoS,WAA5B,GACE,SAASmG,6BAAT,CAAuCvH,SAAvC,EAAkDwH,QAAlD,EAA4DC,MAA5D,EAAoE;AAClE,MAAIzX,OAAO,GAAGwX,QAAQ,IAAI,IAA1B;AACA,MAAIE,KAAK,GAAGD,MAAM,IAAIrB,iBAAiB,CAACiB,eAAxC;AAEA,MAAI3D,QAAJ;;AACA,UAAQgE,KAAR;AACA,SAAKtB,iBAAiB,CAACiB,eAAvB;AACE3D,MAAAA,QAAQ,GAAG,KAAKiE,kBAAhB;AACA;;AACF,SAAKvB,iBAAiB,CAACkB,cAAvB;AACE5D,MAAAA,QAAQ,GAAG,KAAKkE,iBAAhB;AACA;;AACF;AACE,YAAM,IAAI7b,KAAJ,CAAU,6BAAV,CAAN;AARF;;AAWA,MAAI4R,UAAU,GAAG,KAAKA,UAAtB;AACA+F,EAAAA,QAAQ,CAACpQ,GAAT,CAAa,UAAU+N,OAAV,EAAmB;AAC9B,QAAIvP,MAAM,GAAGuP,OAAO,CAACvP,MAAR,KAAmB,IAAnB,GAA0B,IAA1B,GAAiC,KAAK4O,QAAL,CAAczB,EAAd,CAAiBoC,OAAO,CAACvP,MAAzB,CAA9C;AACAA,IAAAA,MAAM,GAAGiM,IAAI,CAACL,gBAAL,CAAsBC,UAAtB,EAAkC7L,MAAlC,EAA0C,KAAK+V,aAA/C,CAAT;AACA,WAAO;AACL/V,MAAAA,MAAM,EAAEA,MADH;AAELoL,MAAAA,aAAa,EAAEmE,OAAO,CAACnE,aAFlB;AAGLD,MAAAA,eAAe,EAAEoE,OAAO,CAACpE,eAHpB;AAILF,MAAAA,YAAY,EAAEsE,OAAO,CAACtE,YAJjB;AAKLC,MAAAA,cAAc,EAAEqE,OAAO,CAACrE,cALnB;AAMLG,MAAAA,IAAI,EAAEkE,OAAO,CAAClE,IAAR,KAAiB,IAAjB,GAAwB,IAAxB,GAA+B,KAAKwD,MAAL,CAAY1B,EAAZ,CAAeoC,OAAO,CAAClE,IAAvB;AANhC,KAAP;AAQD,GAXD,EAWG,IAXH,EAWS1U,OAXT,CAWiBuX,SAXjB,EAW4BhQ,OAX5B;AAYD,CA9BH;AAgCA;;;;;;;;;;;;;;;;;;;;;;;;AAsBAoW,iBAAiB,CAACpX,SAAlB,CAA4B8Y,wBAA5B,GACE,SAASC,0CAAT,CAAoD1N,KAApD,EAA2D;AACzD,MAAIrD,IAAI,GAAG+G,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,CAAX,CADyD,CAGzD;AACA;AACA;AACA;;AACA,MAAI2N,MAAM,GAAG;AACXlW,IAAAA,MAAM,EAAEiM,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB,CADG;AAEX0C,IAAAA,YAAY,EAAE/F,IAFH;AAGXgG,IAAAA,cAAc,EAAEe,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB,EAA6B,CAA7B;AAHL,GAAb;AAMA2N,EAAAA,MAAM,CAAClW,MAAP,GAAgB,KAAKmW,gBAAL,CAAsBD,MAAM,CAAClW,MAA7B,CAAhB;;AACA,MAAIkW,MAAM,CAAClW,MAAP,GAAgB,CAApB,EAAuB;AACrB,WAAO,EAAP;AACD;;AAED,MAAI4R,QAAQ,GAAG,EAAf;;AAEA,MAAIxb,KAAK,GAAG,KAAKggB,YAAL,CAAkBF,MAAlB,EACkB,KAAKJ,iBADvB,EAEkB,cAFlB,EAGkB,gBAHlB,EAIkB7J,IAAI,CAACtB,0BAJvB,EAKkB0J,YAAY,CAAC7B,iBAL/B,CAAZ;;AAMA,MAAIpc,KAAK,IAAI,CAAb,EAAgB;AACd,QAAImZ,OAAO,GAAG,KAAKuG,iBAAL,CAAuB1f,KAAvB,CAAd;;AAEA,QAAImS,KAAK,CAACmH,MAAN,KAAiB3S,SAArB,EAAgC;AAC9B,UAAIkO,YAAY,GAAGsE,OAAO,CAACtE,YAA3B,CAD8B,CAG9B;AACA;AACA;AACA;;AACA,aAAOsE,OAAO,IAAIA,OAAO,CAACtE,YAAR,KAAyBA,YAA3C,EAAyD;AACvD2G,QAAAA,QAAQ,CAAC3b,IAAT,CAAc;AACZiP,UAAAA,IAAI,EAAE+G,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,eAArB,EAAsC,IAAtC,CADM;AAEZG,UAAAA,MAAM,EAAEzD,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,iBAArB,EAAwC,IAAxC,CAFI;AAGZ8G,UAAAA,UAAU,EAAEpK,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,qBAArB,EAA4C,IAA5C;AAHA,SAAd;AAMAA,QAAAA,OAAO,GAAG,KAAKuG,iBAAL,CAAuB,EAAE1f,KAAzB,CAAV;AACD;AACF,KAhBD,MAgBO;AACL,UAAI8U,cAAc,GAAGqE,OAAO,CAACrE,cAA7B,CADK,CAGL;AACA;AACA;AACA;;AACA,aAAOqE,OAAO,IACPA,OAAO,CAACtE,YAAR,KAAyB/F,IADzB,IAEAqK,OAAO,CAACrE,cAAR,IAA0BA,cAFjC,EAEiD;AAC/C0G,QAAAA,QAAQ,CAAC3b,IAAT,CAAc;AACZiP,UAAAA,IAAI,EAAE+G,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,eAArB,EAAsC,IAAtC,CADM;AAEZG,UAAAA,MAAM,EAAEzD,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,iBAArB,EAAwC,IAAxC,CAFI;AAGZ8G,UAAAA,UAAU,EAAEpK,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,qBAArB,EAA4C,IAA5C;AAHA,SAAd;AAMAA,QAAAA,OAAO,GAAG,KAAKuG,iBAAL,CAAuB,EAAE1f,KAAzB,CAAV;AACD;AACF;AACF;;AAED,SAAOwb,QAAP;AACD,CApEH;;AAsEA3U,OAAO,CAACqX,iBAAR,GAA4BA,iBAA5B;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCA,SAASM,sBAAT,CAAgCL,UAAhC,EAA4CC,aAA5C,EAA2D;AACzD,MAAIC,SAAS,GAAGF,UAAhB;;AACA,MAAI,OAAOA,UAAP,KAAsB,QAA1B,EAAoC;AAClCE,IAAAA,SAAS,GAAGxI,IAAI,CAACN,mBAAL,CAAyB4I,UAAzB,CAAZ;AACD;;AAED,MAAIpC,OAAO,GAAGlG,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,SAAvB,CAAd;AACA,MAAI5E,OAAO,GAAG5D,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,SAAvB,CAAd,CAPyD,CAQzD;AACA;;AACA,MAAIrC,KAAK,GAAGnG,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,OAAvB,EAAgC,EAAhC,CAAZ;AACA,MAAI5I,UAAU,GAAGI,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,YAAvB,EAAqC,IAArC,CAAjB;AACA,MAAIpC,cAAc,GAAGpG,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,gBAAvB,EAAyC,IAAzC,CAArB;AACA,MAAI7C,QAAQ,GAAG3F,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,UAAvB,CAAf;AACA,MAAIpF,IAAI,GAAGpD,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,MAAvB,EAA+B,IAA/B,CAAX,CAdyD,CAgBzD;AACA;;AACA,MAAItC,OAAO,IAAI,KAAKnD,QAApB,EAA8B;AAC5B,UAAM,IAAI/U,KAAJ,CAAU,0BAA0BkY,OAApC,CAAN;AACD;;AAED,MAAItG,UAAJ,EAAgB;AACdA,IAAAA,UAAU,GAAGI,IAAI,CAAC3C,SAAL,CAAeuC,UAAf,CAAb;AACD;;AAEDgE,EAAAA,OAAO,GAAGA,OAAO,CACdrO,GADO,CACH4O,MADG,EAER;AACA;AACA;AAJQ,GAKP5O,GALO,CAKHyK,IAAI,CAAC3C,SALF,EAMR;AACA;AACA;AACA;AATQ,GAUP9H,GAVO,CAUH,UAAUxB,MAAV,EAAkB;AACrB,WAAO6L,UAAU,IAAII,IAAI,CAACzC,UAAL,CAAgBqC,UAAhB,CAAd,IAA6CI,IAAI,CAACzC,UAAL,CAAgBxJ,MAAhB,CAA7C,GACHiM,IAAI,CAACjC,QAAL,CAAc6B,UAAd,EAA0B7L,MAA1B,CADG,GAEHA,MAFJ;AAGD,GAdO,CAAV,CA1ByD,CA0CzD;AACA;AACA;AACA;;AACA,OAAK6O,MAAL,GAAc1C,QAAQ,CAACG,SAAT,CAAmB8F,KAAK,CAAC5Q,GAAN,CAAU4O,MAAV,CAAnB,EAAsC,IAAtC,CAAd;AACA,OAAKxB,QAAL,GAAgBzC,QAAQ,CAACG,SAAT,CAAmBuD,OAAnB,EAA4B,IAA5B,CAAhB;AAEA,OAAKyG,gBAAL,GAAwB,KAAK1H,QAAL,CAActB,OAAd,GAAwB9L,GAAxB,CAA4B,UAAU+I,CAAV,EAAa;AAC/D,WAAO0B,IAAI,CAACL,gBAAL,CAAsBC,UAAtB,EAAkCtB,CAAlC,EAAqCiK,aAArC,CAAP;AACD,GAFuB,CAAxB;AAIA,OAAK3I,UAAL,GAAkBA,UAAlB;AACA,OAAKwG,cAAL,GAAsBA,cAAtB;AACA,OAAKvD,SAAL,GAAiB8C,QAAjB;AACA,OAAKmE,aAAL,GAAqBvB,aAArB;AACA,OAAKnF,IAAL,GAAYA,IAAZ;AACD;;AAEDuF,sBAAsB,CAAC1X,SAAvB,GAAmC4C,MAAM,CAACuK,MAAP,CAAciK,iBAAiB,CAACpX,SAAhC,CAAnC;AACA0X,sBAAsB,CAAC1X,SAAvB,CAAiCqZ,QAAjC,GAA4CjC,iBAA5C;AAEA;;;;;AAIAM,sBAAsB,CAAC1X,SAAvB,CAAiCiZ,gBAAjC,GAAoD,UAASlF,OAAT,EAAkB;AACpE,MAAIuF,cAAc,GAAGvF,OAArB;;AACA,MAAI,KAAKpF,UAAL,IAAmB,IAAvB,EAA6B;AAC3B2K,IAAAA,cAAc,GAAGvK,IAAI,CAACjC,QAAL,CAAc,KAAK6B,UAAnB,EAA+B2K,cAA/B,CAAjB;AACD;;AAED,MAAI,KAAK5H,QAAL,CAAc9Y,GAAd,CAAkB0gB,cAAlB,CAAJ,EAAuC;AACrC,WAAO,KAAK5H,QAAL,CAAcvO,OAAd,CAAsBmW,cAAtB,CAAP;AACD,GARmE,CAUpE;AACA;;;AACA,MAAIjgB,CAAJ;;AACA,OAAKA,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAG,KAAK+f,gBAAL,CAAsBjgB,MAAtC,EAA8C,EAAEE,CAAhD,EAAmD;AACjD,QAAI,KAAK+f,gBAAL,CAAsB/f,CAAtB,KAA4B0a,OAAhC,EAAyC;AACvC,aAAO1a,CAAP;AACD;AACF;;AAED,SAAO,CAAC,CAAR;AACD,CApBD;AAsBA;;;;;;;;;;;AASAqe,sBAAsB,CAAC3F,aAAvB,GACE,SAASwH,+BAAT,CAAyClC,UAAzC,EAAqDC,aAArD,EAAoE;AAClE,MAAIkC,GAAG,GAAG5W,MAAM,CAACuK,MAAP,CAAcuK,sBAAsB,CAAC1X,SAArC,CAAV;AAEA,MAAIkV,KAAK,GAAGsE,GAAG,CAAC7H,MAAJ,GAAa1C,QAAQ,CAACG,SAAT,CAAmBiI,UAAU,CAAC1F,MAAX,CAAkBvB,OAAlB,EAAnB,EAAgD,IAAhD,CAAzB;AACA,MAAIuC,OAAO,GAAG6G,GAAG,CAAC9H,QAAJ,GAAezC,QAAQ,CAACG,SAAT,CAAmBiI,UAAU,CAAC3F,QAAX,CAAoBtB,OAApB,EAAnB,EAAkD,IAAlD,CAA7B;AACAoJ,EAAAA,GAAG,CAAC7K,UAAJ,GAAiB0I,UAAU,CAAC7F,WAA5B;AACAgI,EAAAA,GAAG,CAACrE,cAAJ,GAAqBkC,UAAU,CAAC1C,uBAAX,CAAmC6E,GAAG,CAAC9H,QAAJ,CAAatB,OAAb,EAAnC,EACmCoJ,GAAG,CAAC7K,UADvC,CAArB;AAEA6K,EAAAA,GAAG,CAACrH,IAAJ,GAAWkF,UAAU,CAAC9F,KAAtB;AACAiI,EAAAA,GAAG,CAACX,aAAJ,GAAoBvB,aAApB;AACAkC,EAAAA,GAAG,CAACJ,gBAAJ,GAAuBI,GAAG,CAAC9H,QAAJ,CAAatB,OAAb,GAAuB9L,GAAvB,CAA2B,UAAU+I,CAAV,EAAa;AAC7D,WAAO0B,IAAI,CAACL,gBAAL,CAAsB8K,GAAG,CAAC7K,UAA1B,EAAsCtB,CAAtC,EAAyCiK,aAAzC,CAAP;AACD,GAFsB,CAAvB,CAVkE,CAclE;AACA;AACA;AACA;;AAEA,MAAImC,iBAAiB,GAAGpC,UAAU,CAACzF,SAAX,CAAqBxB,OAArB,GAA+BhP,KAA/B,EAAxB;;AACA,MAAIsY,qBAAqB,GAAGF,GAAG,CAAC7B,mBAAJ,GAA0B,EAAtD;AACA,MAAIgC,oBAAoB,GAAGH,GAAG,CAACxB,kBAAJ,GAAyB,EAApD;;AAEA,OAAK,IAAI3e,CAAC,GAAG,CAAR,EAAWF,MAAM,GAAGsgB,iBAAiB,CAACtgB,MAA3C,EAAmDE,CAAC,GAAGF,MAAvD,EAA+DE,CAAC,EAAhE,EAAoE;AAClE,QAAIugB,UAAU,GAAGH,iBAAiB,CAACpgB,CAAD,CAAlC;AACA,QAAIwgB,WAAW,GAAG,IAAIC,OAAJ,EAAlB;AACAD,IAAAA,WAAW,CAAC3L,aAAZ,GAA4B0L,UAAU,CAAC1L,aAAvC;AACA2L,IAAAA,WAAW,CAAC5L,eAAZ,GAA8B2L,UAAU,CAAC3L,eAAzC;;AAEA,QAAI2L,UAAU,CAAC9W,MAAf,EAAuB;AACrB+W,MAAAA,WAAW,CAAC/W,MAAZ,GAAqB6P,OAAO,CAACxP,OAAR,CAAgByW,UAAU,CAAC9W,MAA3B,CAArB;AACA+W,MAAAA,WAAW,CAAC9L,YAAZ,GAA2B6L,UAAU,CAAC7L,YAAtC;AACA8L,MAAAA,WAAW,CAAC7L,cAAZ,GAA6B4L,UAAU,CAAC5L,cAAxC;;AAEA,UAAI4L,UAAU,CAACzL,IAAf,EAAqB;AACnB0L,QAAAA,WAAW,CAAC1L,IAAZ,GAAmB+G,KAAK,CAAC/R,OAAN,CAAcyW,UAAU,CAACzL,IAAzB,CAAnB;AACD;;AAEDwL,MAAAA,oBAAoB,CAAC5gB,IAArB,CAA0B8gB,WAA1B;AACD;;AAEDH,IAAAA,qBAAqB,CAAC3gB,IAAtB,CAA2B8gB,WAA3B;AACD;;AAED3C,EAAAA,SAAS,CAACsC,GAAG,CAACxB,kBAAL,EAAyBjJ,IAAI,CAACtB,0BAA9B,CAAT;AAEA,SAAO+L,GAAP;AACD,CAhDH;AAkDA;;;;;AAGA9B,sBAAsB,CAAC1X,SAAvB,CAAiC8R,QAAjC,GAA4C,CAA5C;AAEA;;;;AAGAlP,MAAM,CAACgV,cAAP,CAAsBF,sBAAsB,CAAC1X,SAA7C,EAAwD,SAAxD,EAAmE;AACjElH,EAAAA,GAAG,EAAE,YAAY;AACf,WAAO,KAAKsgB,gBAAL,CAAsBhY,KAAtB,EAAP;AACD;AAHgE,CAAnE;AAMA;;;;AAGA,SAAS0Y,OAAT,GAAmB;AACjB,OAAK5L,aAAL,GAAqB,CAArB;AACA,OAAKD,eAAL,GAAuB,CAAvB;AACA,OAAKnL,MAAL,GAAc,IAAd;AACA,OAAKiL,YAAL,GAAoB,IAApB;AACA,OAAKC,cAAL,GAAsB,IAAtB;AACA,OAAKG,IAAL,GAAY,IAAZ;AACD;AAED;;;;;;;AAKAuJ,sBAAsB,CAAC1X,SAAvB,CAAiC+X,cAAjC,GACE,SAASK,+BAAT,CAAyCxN,IAAzC,EAA+CkK,WAA/C,EAA4D;AAC1D,MAAI5G,aAAa,GAAG,CAApB;AACA,MAAIgG,uBAAuB,GAAG,CAA9B;AACA,MAAIG,oBAAoB,GAAG,CAA3B;AACA,MAAID,sBAAsB,GAAG,CAA7B;AACA,MAAIG,cAAc,GAAG,CAArB;AACA,MAAID,YAAY,GAAG,CAAnB;AACA,MAAInb,MAAM,GAAGyR,IAAI,CAACzR,MAAlB;AACA,MAAID,KAAK,GAAG,CAAZ;AACA,MAAI6gB,cAAc,GAAG,EAArB;AACA,MAAI3D,IAAI,GAAG,EAAX;AACA,MAAI4D,gBAAgB,GAAG,EAAvB;AACA,MAAIP,iBAAiB,GAAG,EAAxB;AACA,MAAIpH,OAAJ,EAAajO,GAAb,EAAkB6V,OAAlB,EAA2BC,GAA3B,EAAgC1V,KAAhC;;AAEA,SAAOtL,KAAK,GAAGC,MAAf,EAAuB;AACrB,QAAIyR,IAAI,CAACjC,MAAL,CAAYzP,KAAZ,MAAuB,GAA3B,EAAgC;AAC9BgV,MAAAA,aAAa;AACbhV,MAAAA,KAAK;AACLgb,MAAAA,uBAAuB,GAAG,CAA1B;AACD,KAJD,MAKK,IAAItJ,IAAI,CAACjC,MAAL,CAAYzP,KAAZ,MAAuB,GAA3B,EAAgC;AACnCA,MAAAA,KAAK;AACN,KAFI,MAGA;AACHmZ,MAAAA,OAAO,GAAG,IAAIyH,OAAJ,EAAV;AACAzH,MAAAA,OAAO,CAACnE,aAAR,GAAwBA,aAAxB,CAFG,CAIH;AACA;AACA;AACA;AACA;;AACA,WAAKgM,GAAG,GAAGhhB,KAAX,EAAkBghB,GAAG,GAAG/gB,MAAxB,EAAgC+gB,GAAG,EAAnC,EAAuC;AACrC,YAAI,KAAKjC,uBAAL,CAA6BrN,IAA7B,EAAmCsP,GAAnC,CAAJ,EAA6C;AAC3C;AACD;AACF;;AACD9V,MAAAA,GAAG,GAAGwG,IAAI,CAACxJ,KAAL,CAAWlI,KAAX,EAAkBghB,GAAlB,CAAN;AAEAD,MAAAA,OAAO,GAAGF,cAAc,CAAC3V,GAAD,CAAxB;;AACA,UAAI6V,OAAJ,EAAa;AACX/gB,QAAAA,KAAK,IAAIkL,GAAG,CAACjL,MAAb;AACD,OAFD,MAEO;AACL8gB,QAAAA,OAAO,GAAG,EAAV;;AACA,eAAO/gB,KAAK,GAAGghB,GAAf,EAAoB;AAClB7I,UAAAA,SAAS,CAACpI,MAAV,CAAiB2B,IAAjB,EAAuB1R,KAAvB,EAA8Bkd,IAA9B;AACA5R,UAAAA,KAAK,GAAG4R,IAAI,CAAC5R,KAAb;AACAtL,UAAAA,KAAK,GAAGkd,IAAI,CAACjL,IAAb;AACA8O,UAAAA,OAAO,CAAClhB,IAAR,CAAayL,KAAb;AACD;;AAED,YAAIyV,OAAO,CAAC9gB,MAAR,KAAmB,CAAvB,EAA0B;AACxB,gBAAM,IAAI4D,KAAJ,CAAU,wCAAV,CAAN;AACD;;AAED,YAAIkd,OAAO,CAAC9gB,MAAR,KAAmB,CAAvB,EAA0B;AACxB,gBAAM,IAAI4D,KAAJ,CAAU,wCAAV,CAAN;AACD;;AAEDgd,QAAAA,cAAc,CAAC3V,GAAD,CAAd,GAAsB6V,OAAtB;AACD,OArCE,CAuCH;;;AACA5H,MAAAA,OAAO,CAACpE,eAAR,GAA0BiG,uBAAuB,GAAG+F,OAAO,CAAC,CAAD,CAA3D;AACA/F,MAAAA,uBAAuB,GAAG7B,OAAO,CAACpE,eAAlC;;AAEA,UAAIgM,OAAO,CAAC9gB,MAAR,GAAiB,CAArB,EAAwB;AACtB;AACAkZ,QAAAA,OAAO,CAACvP,MAAR,GAAiByR,cAAc,GAAG0F,OAAO,CAAC,CAAD,CAAzC;AACA1F,QAAAA,cAAc,IAAI0F,OAAO,CAAC,CAAD,CAAzB,CAHsB,CAKtB;;AACA5H,QAAAA,OAAO,CAACtE,YAAR,GAAuBsG,oBAAoB,GAAG4F,OAAO,CAAC,CAAD,CAArD;AACA5F,QAAAA,oBAAoB,GAAGhC,OAAO,CAACtE,YAA/B,CAPsB,CAQtB;;AACAsE,QAAAA,OAAO,CAACtE,YAAR,IAAwB,CAAxB,CATsB,CAWtB;;AACAsE,QAAAA,OAAO,CAACrE,cAAR,GAAyBoG,sBAAsB,GAAG6F,OAAO,CAAC,CAAD,CAAzD;AACA7F,QAAAA,sBAAsB,GAAG/B,OAAO,CAACrE,cAAjC;;AAEA,YAAIiM,OAAO,CAAC9gB,MAAR,GAAiB,CAArB,EAAwB;AACtB;AACAkZ,UAAAA,OAAO,CAAClE,IAAR,GAAemG,YAAY,GAAG2F,OAAO,CAAC,CAAD,CAArC;AACA3F,UAAAA,YAAY,IAAI2F,OAAO,CAAC,CAAD,CAAvB;AACD;AACF;;AAEDR,MAAAA,iBAAiB,CAAC1gB,IAAlB,CAAuBsZ,OAAvB;;AACA,UAAI,OAAOA,OAAO,CAACtE,YAAf,KAAgC,QAApC,EAA8C;AAC5CiM,QAAAA,gBAAgB,CAACjhB,IAAjB,CAAsBsZ,OAAtB;AACD;AACF;AACF;;AAED6E,EAAAA,SAAS,CAACuC,iBAAD,EAAoB1K,IAAI,CAACX,mCAAzB,CAAT;AACA,OAAKuJ,mBAAL,GAA2B8B,iBAA3B;AAEAvC,EAAAA,SAAS,CAAC8C,gBAAD,EAAmBjL,IAAI,CAACtB,0BAAxB,CAAT;AACA,OAAKuK,kBAAL,GAA0BgC,gBAA1B;AACD,CAtGH;AAwGA;;;;;;AAIAtC,sBAAsB,CAAC1X,SAAvB,CAAiCkZ,YAAjC,GACE,SAASiB,6BAAT,CAAuCzE,OAAvC,EAAgD0E,SAAhD,EAA2DC,SAA3D,EACuCC,WADvC,EACoDC,WADpD,EACiE1E,KADjE,EACwE;AACtE;AACA;AACA;AACA;AAEA,MAAIH,OAAO,CAAC2E,SAAD,CAAP,IAAsB,CAA1B,EAA6B;AAC3B,UAAM,IAAI/Z,SAAJ,CAAc,kDACEoV,OAAO,CAAC2E,SAAD,CADvB,CAAN;AAED;;AACD,MAAI3E,OAAO,CAAC4E,WAAD,CAAP,GAAuB,CAA3B,EAA8B;AAC5B,UAAM,IAAIha,SAAJ,CAAc,oDACEoV,OAAO,CAAC4E,WAAD,CADvB,CAAN;AAED;;AAED,SAAOnD,YAAY,CAACnB,MAAb,CAAoBN,OAApB,EAA6B0E,SAA7B,EAAwCG,WAAxC,EAAqD1E,KAArD,CAAP;AACD,CAlBH;AAoBA;;;;;;AAIA6B,sBAAsB,CAAC1X,SAAvB,CAAiCwa,kBAAjC,GACE,SAASC,oCAAT,GAAgD;AAC9C,OAAK,IAAIvhB,KAAK,GAAG,CAAjB,EAAoBA,KAAK,GAAG,KAAKyf,kBAAL,CAAwBxf,MAApD,EAA4D,EAAED,KAA9D,EAAqE;AACnE,QAAImZ,OAAO,GAAG,KAAKsG,kBAAL,CAAwBzf,KAAxB,CAAd,CADmE,CAGnE;AACA;AACA;AACA;;AACA,QAAIA,KAAK,GAAG,CAAR,GAAY,KAAKyf,kBAAL,CAAwBxf,MAAxC,EAAgD;AAC9C,UAAIuhB,WAAW,GAAG,KAAK/B,kBAAL,CAAwBzf,KAAK,GAAG,CAAhC,CAAlB;;AAEA,UAAImZ,OAAO,CAACnE,aAAR,KAA0BwM,WAAW,CAACxM,aAA1C,EAAyD;AACvDmE,QAAAA,OAAO,CAACsI,mBAAR,GAA8BD,WAAW,CAACzM,eAAZ,GAA8B,CAA5D;AACA;AACD;AACF,KAdkE,CAgBnE;;;AACAoE,IAAAA,OAAO,CAACsI,mBAAR,GAA8BC,QAA9B;AACD;AACF,CArBH;AAuBA;;;;;;;;;;;;;;;;;;;;;;;;;;AAwBAlD,sBAAsB,CAAC1X,SAAvB,CAAiC2T,mBAAjC,GACE,SAASkH,qCAAT,CAA+CxP,KAA/C,EAAsD;AACpD,MAAI2N,MAAM,GAAG;AACX9K,IAAAA,aAAa,EAAEa,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,CADJ;AAEX4C,IAAAA,eAAe,EAAEc,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB;AAFN,GAAb;;AAKA,MAAInS,KAAK,GAAG,KAAKggB,YAAL,CACVF,MADU,EAEV,KAAKL,kBAFK,EAGV,eAHU,EAIV,iBAJU,EAKV5J,IAAI,CAACX,mCALK,EAMVW,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,EAA2B+L,iBAAiB,CAAC/B,oBAA7C,CANU,CAAZ;;AASA,MAAInc,KAAK,IAAI,CAAb,EAAgB;AACd,QAAImZ,OAAO,GAAG,KAAKsG,kBAAL,CAAwBzf,KAAxB,CAAd;;AAEA,QAAImZ,OAAO,CAACnE,aAAR,KAA0B8K,MAAM,CAAC9K,aAArC,EAAoD;AAClD,UAAIpL,MAAM,GAAGiM,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,QAArB,EAA+B,IAA/B,CAAb;;AACA,UAAIvP,MAAM,KAAK,IAAf,EAAqB;AACnBA,QAAAA,MAAM,GAAG,KAAK4O,QAAL,CAAczB,EAAd,CAAiBnN,MAAjB,CAAT;AACAA,QAAAA,MAAM,GAAGiM,IAAI,CAACL,gBAAL,CAAsB,KAAKC,UAA3B,EAAuC7L,MAAvC,EAA+C,KAAK+V,aAApD,CAAT;AACD;;AACD,UAAI1K,IAAI,GAAGY,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,MAArB,EAA6B,IAA7B,CAAX;;AACA,UAAIlE,IAAI,KAAK,IAAb,EAAmB;AACjBA,QAAAA,IAAI,GAAG,KAAKwD,MAAL,CAAY1B,EAAZ,CAAe9B,IAAf,CAAP;AACD;;AACD,aAAO;AACLrL,QAAAA,MAAM,EAAEA,MADH;AAELkF,QAAAA,IAAI,EAAE+G,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,cAArB,EAAqC,IAArC,CAFD;AAGLG,QAAAA,MAAM,EAAEzD,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,gBAArB,EAAuC,IAAvC,CAHH;AAILlE,QAAAA,IAAI,EAAEA;AAJD,OAAP;AAMD;AACF;;AAED,SAAO;AACLrL,IAAAA,MAAM,EAAE,IADH;AAELkF,IAAAA,IAAI,EAAE,IAFD;AAGLwK,IAAAA,MAAM,EAAE,IAHH;AAILrE,IAAAA,IAAI,EAAE;AAJD,GAAP;AAMD,CA5CH;AA8CA;;;;;;AAIAuJ,sBAAsB,CAAC1X,SAAvB,CAAiC8a,uBAAjC,GACE,SAASC,8CAAT,GAA0D;AACxD,MAAI,CAAC,KAAK5F,cAAV,EAA0B;AACxB,WAAO,KAAP;AACD;;AACD,SAAO,KAAKA,cAAL,CAAoBhc,MAApB,IAA8B,KAAKuY,QAAL,CAAclC,IAAd,EAA9B,IACL,CAAC,KAAK2F,cAAL,CAAoB6F,IAApB,CAAyB,UAAUC,EAAV,EAAc;AAAE,WAAOA,EAAE,IAAI,IAAb;AAAoB,GAA7D,CADH;AAED,CAPH;AASA;;;;;;;AAKAvD,sBAAsB,CAAC1X,SAAvB,CAAiC8S,gBAAjC,GACE,SAASoI,kCAAT,CAA4CnH,OAA5C,EAAqDoH,aAArD,EAAoE;AAClE,MAAI,CAAC,KAAKhG,cAAV,EAA0B;AACxB,WAAO,IAAP;AACD;;AAED,MAAIjc,KAAK,GAAG,KAAK+f,gBAAL,CAAsBlF,OAAtB,CAAZ;;AACA,MAAI7a,KAAK,IAAI,CAAb,EAAgB;AACd,WAAO,KAAKic,cAAL,CAAoBjc,KAApB,CAAP;AACD;;AAED,MAAIogB,cAAc,GAAGvF,OAArB;;AACA,MAAI,KAAKpF,UAAL,IAAmB,IAAvB,EAA6B;AAC3B2K,IAAAA,cAAc,GAAGvK,IAAI,CAACjC,QAAL,CAAc,KAAK6B,UAAnB,EAA+B2K,cAA/B,CAAjB;AACD;;AAED,MAAI1c,GAAJ;;AACA,MAAI,KAAK+R,UAAL,IAAmB,IAAnB,KACI/R,GAAG,GAAGmS,IAAI,CAACrD,QAAL,CAAc,KAAKiD,UAAnB,CADV,CAAJ,EAC+C;AAC7C;AACA;AACA;AACA;AACA,QAAIyM,cAAc,GAAG9B,cAAc,CAAC3a,OAAf,CAAuB,YAAvB,EAAqC,EAArC,CAArB;;AACA,QAAI/B,GAAG,CAACiP,MAAJ,IAAc,MAAd,IACG,KAAK6F,QAAL,CAAc9Y,GAAd,CAAkBwiB,cAAlB,CADP,EAC0C;AACxC,aAAO,KAAKjG,cAAL,CAAoB,KAAKzD,QAAL,CAAcvO,OAAd,CAAsBiY,cAAtB,CAApB,CAAP;AACD;;AAED,QAAI,CAAC,CAACxe,GAAG,CAACqP,IAAL,IAAarP,GAAG,CAACqP,IAAJ,IAAY,GAA1B,KACG,KAAKyF,QAAL,CAAc9Y,GAAd,CAAkB,MAAM0gB,cAAxB,CADP,EACgD;AAC9C,aAAO,KAAKnE,cAAL,CAAoB,KAAKzD,QAAL,CAAcvO,OAAd,CAAsB,MAAMmW,cAA5B,CAApB,CAAP;AACD;AACF,GAhCiE,CAkClE;AACA;AACA;AACA;;;AACA,MAAI6B,aAAJ,EAAmB;AACjB,WAAO,IAAP;AACD,GAFD,MAGK;AACH,UAAM,IAAIpe,KAAJ,CAAU,MAAMuc,cAAN,GAAuB,4BAAjC,CAAN;AACD;AACF,CA7CH;AA+CA;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA5B,sBAAsB,CAAC1X,SAAvB,CAAiCqb,oBAAjC,GACE,SAASC,sCAAT,CAAgDjQ,KAAhD,EAAuD;AACrD,MAAIvI,MAAM,GAAGiM,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB,CAAb;AACAvI,EAAAA,MAAM,GAAG,KAAKmW,gBAAL,CAAsBnW,MAAtB,CAAT;;AACA,MAAIA,MAAM,GAAG,CAAb,EAAgB;AACd,WAAO;AACLkF,MAAAA,IAAI,EAAE,IADD;AAELwK,MAAAA,MAAM,EAAE,IAFH;AAGL2G,MAAAA,UAAU,EAAE;AAHP,KAAP;AAKD;;AAED,MAAIH,MAAM,GAAG;AACXlW,IAAAA,MAAM,EAAEA,MADG;AAEXiL,IAAAA,YAAY,EAAEgB,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,CAFH;AAGX2C,IAAAA,cAAc,EAAEe,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB;AAHL,GAAb;;AAMA,MAAInS,KAAK,GAAG,KAAKggB,YAAL,CACVF,MADU,EAEV,KAAKJ,iBAFK,EAGV,cAHU,EAIV,gBAJU,EAKV7J,IAAI,CAACtB,0BALK,EAMVsB,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,EAA2B+L,iBAAiB,CAAC/B,oBAA7C,CANU,CAAZ;;AASA,MAAInc,KAAK,IAAI,CAAb,EAAgB;AACd,QAAImZ,OAAO,GAAG,KAAKuG,iBAAL,CAAuB1f,KAAvB,CAAd;;AAEA,QAAImZ,OAAO,CAACvP,MAAR,KAAmBkW,MAAM,CAAClW,MAA9B,EAAsC;AACpC,aAAO;AACLkF,QAAAA,IAAI,EAAE+G,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,eAArB,EAAsC,IAAtC,CADD;AAELG,QAAAA,MAAM,EAAEzD,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,iBAArB,EAAwC,IAAxC,CAFH;AAGL8G,QAAAA,UAAU,EAAEpK,IAAI,CAAC3D,MAAL,CAAYiH,OAAZ,EAAqB,qBAArB,EAA4C,IAA5C;AAHP,OAAP;AAKD;AACF;;AAED,SAAO;AACLrK,IAAAA,IAAI,EAAE,IADD;AAELwK,IAAAA,MAAM,EAAE,IAFH;AAGL2G,IAAAA,UAAU,EAAE;AAHP,GAAP;AAKD,CA5CH;;AA8CApZ,OAAO,CAAC2X,sBAAR,GAAiCA,sBAAjC;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiDA,SAASD,wBAAT,CAAkCJ,UAAlC,EAA8CC,aAA9C,EAA6D;AAC3D,MAAIC,SAAS,GAAGF,UAAhB;;AACA,MAAI,OAAOA,UAAP,KAAsB,QAA1B,EAAoC;AAClCE,IAAAA,SAAS,GAAGxI,IAAI,CAACN,mBAAL,CAAyB4I,UAAzB,CAAZ;AACD;;AAED,MAAIpC,OAAO,GAAGlG,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,SAAvB,CAAd;AACA,MAAIC,QAAQ,GAAGzI,IAAI,CAAC3D,MAAL,CAAYmM,SAAZ,EAAuB,UAAvB,CAAf;;AAEA,MAAItC,OAAO,IAAI,KAAKnD,QAApB,EAA8B;AAC5B,UAAM,IAAI/U,KAAJ,CAAU,0BAA0BkY,OAApC,CAAN;AACD;;AAED,OAAKvD,QAAL,GAAgB,IAAIzC,QAAJ,EAAhB;AACA,OAAK0C,MAAL,GAAc,IAAI1C,QAAJ,EAAd;AAEA,MAAIsM,UAAU,GAAG;AACfvT,IAAAA,IAAI,EAAE,CAAC,CADQ;AAEfwK,IAAAA,MAAM,EAAE;AAFO,GAAjB;AAIA,OAAKgJ,SAAL,GAAiBhE,QAAQ,CAAClT,GAAT,CAAa,UAAU+I,CAAV,EAAa;AACzC,QAAIA,CAAC,CAACzQ,GAAN,EAAW;AACT;AACA;AACA,YAAM,IAAIG,KAAJ,CAAU,oDAAV,CAAN;AACD;;AACD,QAAIgL,MAAM,GAAGgH,IAAI,CAAC3D,MAAL,CAAYiC,CAAZ,EAAe,QAAf,CAAb;AACA,QAAIoO,UAAU,GAAG1M,IAAI,CAAC3D,MAAL,CAAYrD,MAAZ,EAAoB,MAApB,CAAjB;AACA,QAAI2T,YAAY,GAAG3M,IAAI,CAAC3D,MAAL,CAAYrD,MAAZ,EAAoB,QAApB,CAAnB;;AAEA,QAAI0T,UAAU,GAAGF,UAAU,CAACvT,IAAxB,IACCyT,UAAU,KAAKF,UAAU,CAACvT,IAA1B,IAAkC0T,YAAY,GAAGH,UAAU,CAAC/I,MADjE,EAC0E;AACxE,YAAM,IAAIzV,KAAJ,CAAU,sDAAV,CAAN;AACD;;AACDwe,IAAAA,UAAU,GAAGxT,MAAb;AAEA,WAAO;AACL4T,MAAAA,eAAe,EAAE;AACf;AACA;AACAzN,QAAAA,aAAa,EAAEuN,UAAU,GAAG,CAHb;AAIfxN,QAAAA,eAAe,EAAEyN,YAAY,GAAG;AAJjB,OADZ;AAOLrC,MAAAA,QAAQ,EAAE,IAAIjC,iBAAJ,CAAsBrI,IAAI,CAAC3D,MAAL,CAAYiC,CAAZ,EAAe,KAAf,CAAtB,EAA6CiK,aAA7C;AAPL,KAAP;AASD,GAzBgB,CAAjB;AA0BD;;AAEDG,wBAAwB,CAACzX,SAAzB,GAAqC4C,MAAM,CAACuK,MAAP,CAAciK,iBAAiB,CAACpX,SAAhC,CAArC;AACAyX,wBAAwB,CAACzX,SAAzB,CAAmC4b,WAAnC,GAAiDxE,iBAAjD;AAEA;;;;AAGAK,wBAAwB,CAACzX,SAAzB,CAAmC8R,QAAnC,GAA8C,CAA9C;AAEA;;;;AAGAlP,MAAM,CAACgV,cAAP,CAAsBH,wBAAwB,CAACzX,SAA/C,EAA0D,SAA1D,EAAqE;AACnElH,EAAAA,GAAG,EAAE,YAAY;AACf,QAAI6Z,OAAO,GAAG,EAAd;;AACA,SAAK,IAAItZ,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,KAAKmiB,SAAL,CAAeriB,MAAnC,EAA2CE,CAAC,EAA5C,EAAgD;AAC9C,WAAK,IAAI2d,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,KAAKwE,SAAL,CAAeniB,CAAf,EAAkBggB,QAAlB,CAA2B1G,OAA3B,CAAmCxZ,MAAvD,EAA+D6d,CAAC,EAAhE,EAAoE;AAClErE,QAAAA,OAAO,CAAC5Z,IAAR,CAAa,KAAKyiB,SAAL,CAAeniB,CAAf,EAAkBggB,QAAlB,CAA2B1G,OAA3B,CAAmCqE,CAAnC,CAAb;AACD;AACF;;AACD,WAAOrE,OAAP;AACD;AATkE,CAArE;AAYA;;;;;;;;;;;;;;;;;;;;AAmBA8E,wBAAwB,CAACzX,SAAzB,CAAmC2T,mBAAnC,GACE,SAASkI,4CAAT,CAAsDxQ,KAAtD,EAA6D;AAC3D,MAAI2N,MAAM,GAAG;AACX9K,IAAAA,aAAa,EAAEa,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,MAAnB,CADJ;AAEX4C,IAAAA,eAAe,EAAEc,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB;AAFN,GAAb,CAD2D,CAM3D;AACA;;AACA,MAAIyQ,YAAY,GAAG3E,YAAY,CAACnB,MAAb,CAAoBgD,MAApB,EAA4B,KAAKwC,SAAjC,EACjB,UAASxC,MAAT,EAAiB+C,OAAjB,EAA0B;AACxB,QAAIlO,GAAG,GAAGmL,MAAM,CAAC9K,aAAP,GAAuB6N,OAAO,CAACJ,eAAR,CAAwBzN,aAAzD;;AACA,QAAIL,GAAJ,EAAS;AACP,aAAOA,GAAP;AACD;;AAED,WAAQmL,MAAM,CAAC/K,eAAP,GACA8N,OAAO,CAACJ,eAAR,CAAwB1N,eADhC;AAED,GATgB,CAAnB;AAUA,MAAI8N,OAAO,GAAG,KAAKP,SAAL,CAAeM,YAAf,CAAd;;AAEA,MAAI,CAACC,OAAL,EAAc;AACZ,WAAO;AACLjZ,MAAAA,MAAM,EAAE,IADH;AAELkF,MAAAA,IAAI,EAAE,IAFD;AAGLwK,MAAAA,MAAM,EAAE,IAHH;AAILrE,MAAAA,IAAI,EAAE;AAJD,KAAP;AAMD;;AAED,SAAO4N,OAAO,CAAC1C,QAAR,CAAiB1F,mBAAjB,CAAqC;AAC1C3L,IAAAA,IAAI,EAAEgR,MAAM,CAAC9K,aAAP,IACH6N,OAAO,CAACJ,eAAR,CAAwBzN,aAAxB,GAAwC,CADrC,CADoC;AAG1CsE,IAAAA,MAAM,EAAEwG,MAAM,CAAC/K,eAAP,IACL8N,OAAO,CAACJ,eAAR,CAAwBzN,aAAxB,KAA0C8K,MAAM,CAAC9K,aAAjD,GACE6N,OAAO,CAACJ,eAAR,CAAwB1N,eAAxB,GAA0C,CAD5C,GAEE,CAHG,CAHkC;AAO1C+N,IAAAA,IAAI,EAAE3Q,KAAK,CAAC2Q;AAP8B,GAArC,CAAP;AASD,CAvCH;AAyCA;;;;;;AAIAvE,wBAAwB,CAACzX,SAAzB,CAAmC8a,uBAAnC,GACE,SAASmB,gDAAT,GAA4D;AAC1D,SAAO,KAAKT,SAAL,CAAeU,KAAf,CAAqB,UAAU7O,CAAV,EAAa;AACvC,WAAOA,CAAC,CAACgM,QAAF,CAAWyB,uBAAX,EAAP;AACD,GAFM,CAAP;AAGD,CALH;AAOA;;;;;;;AAKArD,wBAAwB,CAACzX,SAAzB,CAAmC8S,gBAAnC,GACE,SAASqJ,yCAAT,CAAmDpI,OAAnD,EAA4DoH,aAA5D,EAA2E;AACzE,OAAK,IAAI9hB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,KAAKmiB,SAAL,CAAeriB,MAAnC,EAA2CE,CAAC,EAA5C,EAAgD;AAC9C,QAAI0iB,OAAO,GAAG,KAAKP,SAAL,CAAeniB,CAAf,CAAd;AAEA,QAAIkO,OAAO,GAAGwU,OAAO,CAAC1C,QAAR,CAAiBvG,gBAAjB,CAAkCiB,OAAlC,EAA2C,IAA3C,CAAd;;AACA,QAAIxM,OAAJ,EAAa;AACX,aAAOA,OAAP;AACD;AACF;;AACD,MAAI4T,aAAJ,EAAmB;AACjB,WAAO,IAAP;AACD,GAFD,MAGK;AACH,UAAM,IAAIpe,KAAJ,CAAU,MAAMgX,OAAN,GAAgB,4BAA1B,CAAN;AACD;AACF,CAhBH;AAkBA;;;;;;;;;;;;;;;;;;;;AAkBA0D,wBAAwB,CAACzX,SAAzB,CAAmCqb,oBAAnC,GACE,SAASe,6CAAT,CAAuD/Q,KAAvD,EAA8D;AAC5D,OAAK,IAAIhS,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,KAAKmiB,SAAL,CAAeriB,MAAnC,EAA2CE,CAAC,EAA5C,EAAgD;AAC9C,QAAI0iB,OAAO,GAAG,KAAKP,SAAL,CAAeniB,CAAf,CAAd,CAD8C,CAG9C;AACA;;AACA,QAAI0iB,OAAO,CAAC1C,QAAR,CAAiBJ,gBAAjB,CAAkClK,IAAI,CAAC3D,MAAL,CAAYC,KAAZ,EAAmB,QAAnB,CAAlC,MAAoE,CAAC,CAAzE,EAA4E;AAC1E;AACD;;AACD,QAAIgR,iBAAiB,GAAGN,OAAO,CAAC1C,QAAR,CAAiBgC,oBAAjB,CAAsChQ,KAAtC,CAAxB;;AACA,QAAIgR,iBAAJ,EAAuB;AACrB,UAAIha,GAAG,GAAG;AACR2F,QAAAA,IAAI,EAAEqU,iBAAiB,CAACrU,IAAlB,IACH+T,OAAO,CAACJ,eAAR,CAAwBzN,aAAxB,GAAwC,CADrC,CADE;AAGRsE,QAAAA,MAAM,EAAE6J,iBAAiB,CAAC7J,MAAlB,IACLuJ,OAAO,CAACJ,eAAR,CAAwBzN,aAAxB,KAA0CmO,iBAAiB,CAACrU,IAA5D,GACE+T,OAAO,CAACJ,eAAR,CAAwB1N,eAAxB,GAA0C,CAD5C,GAEE,CAHG;AAHA,OAAV;AAQA,aAAO5L,GAAP;AACD;AACF;;AAED,SAAO;AACL2F,IAAAA,IAAI,EAAE,IADD;AAELwK,IAAAA,MAAM,EAAE;AAFH,GAAP;AAID,CA5BH;AA8BA;;;;;;;AAKAiF,wBAAwB,CAACzX,SAAzB,CAAmC+X,cAAnC,GACE,SAASuE,sCAAT,CAAgD1R,IAAhD,EAAsDkK,WAAtD,EAAmE;AACjE,OAAK6C,mBAAL,GAA2B,EAA3B;AACA,OAAKK,kBAAL,GAA0B,EAA1B;;AACA,OAAK,IAAI3e,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,KAAKmiB,SAAL,CAAeriB,MAAnC,EAA2CE,CAAC,EAA5C,EAAgD;AAC9C,QAAI0iB,OAAO,GAAG,KAAKP,SAAL,CAAeniB,CAAf,CAAd;AACA,QAAIkjB,eAAe,GAAGR,OAAO,CAAC1C,QAAR,CAAiBV,kBAAvC;;AACA,SAAK,IAAI3B,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGuF,eAAe,CAACpjB,MAApC,EAA4C6d,CAAC,EAA7C,EAAiD;AAC/C,UAAI3E,OAAO,GAAGkK,eAAe,CAACvF,CAAD,CAA7B;;AAEA,UAAIlU,MAAM,GAAGiZ,OAAO,CAAC1C,QAAR,CAAiB3H,QAAjB,CAA0BzB,EAA1B,CAA6BoC,OAAO,CAACvP,MAArC,CAAb;;AACAA,MAAAA,MAAM,GAAGiM,IAAI,CAACL,gBAAL,CAAsBqN,OAAO,CAAC1C,QAAR,CAAiB1K,UAAvC,EAAmD7L,MAAnD,EAA2D,KAAK+V,aAAhE,CAAT;;AACA,WAAKnH,QAAL,CAAcjO,GAAd,CAAkBX,MAAlB;;AACAA,MAAAA,MAAM,GAAG,KAAK4O,QAAL,CAAcvO,OAAd,CAAsBL,MAAtB,CAAT;AAEA,UAAIqL,IAAI,GAAG,IAAX;;AACA,UAAIkE,OAAO,CAAClE,IAAZ,EAAkB;AAChBA,QAAAA,IAAI,GAAG4N,OAAO,CAAC1C,QAAR,CAAiB1H,MAAjB,CAAwB1B,EAAxB,CAA2BoC,OAAO,CAAClE,IAAnC,CAAP;;AACA,aAAKwD,MAAL,CAAYlO,GAAZ,CAAgB0K,IAAhB;;AACAA,QAAAA,IAAI,GAAG,KAAKwD,MAAL,CAAYxO,OAAZ,CAAoBgL,IAApB,CAAP;AACD,OAb8C,CAe/C;AACA;AACA;AACA;;;AACA,UAAIqO,eAAe,GAAG;AACpB1Z,QAAAA,MAAM,EAAEA,MADY;AAEpBoL,QAAAA,aAAa,EAAEmE,OAAO,CAACnE,aAAR,IACZ6N,OAAO,CAACJ,eAAR,CAAwBzN,aAAxB,GAAwC,CAD5B,CAFK;AAIpBD,QAAAA,eAAe,EAAEoE,OAAO,CAACpE,eAAR,IACd8N,OAAO,CAACJ,eAAR,CAAwBzN,aAAxB,KAA0CmE,OAAO,CAACnE,aAAlD,GACC6N,OAAO,CAACJ,eAAR,CAAwB1N,eAAxB,GAA0C,CAD3C,GAEC,CAHa,CAJG;AAQpBF,QAAAA,YAAY,EAAEsE,OAAO,CAACtE,YARF;AASpBC,QAAAA,cAAc,EAAEqE,OAAO,CAACrE,cATJ;AAUpBG,QAAAA,IAAI,EAAEA;AAVc,OAAtB;;AAaA,WAAKwJ,mBAAL,CAAyB5e,IAAzB,CAA8ByjB,eAA9B;;AACA,UAAI,OAAOA,eAAe,CAACzO,YAAvB,KAAwC,QAA5C,EAAsD;AACpD,aAAKiK,kBAAL,CAAwBjf,IAAxB,CAA6ByjB,eAA7B;AACD;AACF;AACF;;AAEDtF,EAAAA,SAAS,CAAC,KAAKS,mBAAN,EAA2B5I,IAAI,CAACX,mCAAhC,CAAT;AACA8I,EAAAA,SAAS,CAAC,KAAKc,kBAAN,EAA0BjJ,IAAI,CAACtB,0BAA/B,CAAT;AACD,CAhDH;;AAkDA1N,OAAO,CAAC0X,wBAAR,GAAmCA,wBAAnC;;ACxnCA;;AACA;;;;;AAMA,IAAInG,kBAAkB,GAAGxN,OAAO,CAAC,wBAAD,CAAP,CAAkCwN,kBAA3D;;AACA,IAAIvC,IAAI,GAAGjL,OAAO,CAAC,QAAD,CAAlB,EAEA;AACA;;;AACA,IAAI2Y,aAAa,GAAG,SAApB,EAEA;;AACA,IAAIC,YAAY,GAAG,EAAnB,EAEA;AACA;AACA;;AACA,IAAIC,YAAY,GAAG,oBAAnB;AAEA;;;;;;;;;;;;;AAYA,SAASC,UAAT,CAAoBC,KAApB,EAA2BC,OAA3B,EAAoC/I,OAApC,EAA6CgJ,OAA7C,EAAsDzR,KAAtD,EAA6D;AAC3D,OAAK0R,QAAL,GAAgB,EAAhB;AACA,OAAKC,cAAL,GAAsB,EAAtB;AACA,OAAKjV,IAAL,GAAY6U,KAAK,IAAI,IAAT,GAAgB,IAAhB,GAAuBA,KAAnC;AACA,OAAKrK,MAAL,GAAcsK,OAAO,IAAI,IAAX,GAAkB,IAAlB,GAAyBA,OAAvC;AACA,OAAKha,MAAL,GAAciR,OAAO,IAAI,IAAX,GAAkB,IAAlB,GAAyBA,OAAvC;AACA,OAAK5F,IAAL,GAAY7C,KAAK,IAAI,IAAT,GAAgB,IAAhB,GAAuBA,KAAnC;AACA,OAAKqR,YAAL,IAAqB,IAArB;AACA,MAAII,OAAO,IAAI,IAAf,EAAqB,KAAKtZ,GAAL,CAASsZ,OAAT;AACtB;AAED;;;;;;;;;;AAQAH,UAAU,CAACM,uBAAX,GACE,SAASC,kCAAT,CAA4CC,cAA5C,EAA4DnL,kBAA5D,EAAgFoL,aAAhF,EAA+F;AAC7F;AACA;AACA,MAAIC,IAAI,GAAG,IAAIV,UAAJ,EAAX,CAH6F,CAK7F;AACA;AACA;AACA;;AACA,MAAIW,cAAc,GAAGH,cAAc,CAAC/Y,KAAf,CAAqBoY,aAArB,CAArB;AACA,MAAIe,mBAAmB,GAAG,CAA1B;;AACA,MAAIC,aAAa,GAAG,YAAW;AAC7B,QAAIC,YAAY,GAAGC,WAAW,EAA9B,CAD6B,CAE7B;;AACA,QAAIC,OAAO,GAAGD,WAAW,MAAM,EAA/B;AACA,WAAOD,YAAY,GAAGE,OAAtB;;AAEA,aAASD,WAAT,GAAuB;AACrB,aAAOH,mBAAmB,GAAGD,cAAc,CAACpkB,MAArC,GACHokB,cAAc,CAACC,mBAAmB,EAApB,CADX,GACqC3d,SAD5C;AAED;AACF,GAVD,CAX6F,CAuB7F;;;AACA,MAAIge,iBAAiB,GAAG,CAAxB;AAAA,MAA2BlD,mBAAmB,GAAG,CAAjD,CAxB6F,CA0B7F;AACA;AACA;;AACA,MAAImD,WAAW,GAAG,IAAlB;AAEA7L,EAAAA,kBAAkB,CAACG,WAAnB,CAA+B,UAAUC,OAAV,EAAmB;AAChD,QAAIyL,WAAW,KAAK,IAApB,EAA0B;AACxB;AACA;AACA,UAAID,iBAAiB,GAAGxL,OAAO,CAACnE,aAAhC,EAA+C;AAC7C;AACA6P,QAAAA,kBAAkB,CAACD,WAAD,EAAcL,aAAa,EAA3B,CAAlB;AACAI,QAAAA,iBAAiB;AACjBlD,QAAAA,mBAAmB,GAAG,CAAtB,CAJ6C,CAK7C;AACD,OAND,MAMO;AACL;AACA;AACA;AACA,YAAIlT,QAAQ,GAAG8V,cAAc,CAACC,mBAAD,CAAd,IAAuC,EAAtD;AACA,YAAItW,IAAI,GAAGO,QAAQ,CAACwF,MAAT,CAAgB,CAAhB,EAAmBoF,OAAO,CAACpE,eAAR,GACA0M,mBADnB,CAAX;AAEA4C,QAAAA,cAAc,CAACC,mBAAD,CAAd,GAAsC/V,QAAQ,CAACwF,MAAT,CAAgBoF,OAAO,CAACpE,eAAR,GAClB0M,mBADE,CAAtC;AAEAA,QAAAA,mBAAmB,GAAGtI,OAAO,CAACpE,eAA9B;AACA8P,QAAAA,kBAAkB,CAACD,WAAD,EAAc5W,IAAd,CAAlB,CAVK,CAWL;;AACA4W,QAAAA,WAAW,GAAGzL,OAAd;AACA;AACD;AACF,KAzB+C,CA0BhD;AACA;AACA;;;AACA,WAAOwL,iBAAiB,GAAGxL,OAAO,CAACnE,aAAnC,EAAkD;AAChDoP,MAAAA,IAAI,CAAC7Z,GAAL,CAASga,aAAa,EAAtB;AACAI,MAAAA,iBAAiB;AAClB;;AACD,QAAIlD,mBAAmB,GAAGtI,OAAO,CAACpE,eAAlC,EAAmD;AACjD,UAAIxG,QAAQ,GAAG8V,cAAc,CAACC,mBAAD,CAAd,IAAuC,EAAtD;AACAF,MAAAA,IAAI,CAAC7Z,GAAL,CAASgE,QAAQ,CAACwF,MAAT,CAAgB,CAAhB,EAAmBoF,OAAO,CAACpE,eAA3B,CAAT;AACAsP,MAAAA,cAAc,CAACC,mBAAD,CAAd,GAAsC/V,QAAQ,CAACwF,MAAT,CAAgBoF,OAAO,CAACpE,eAAxB,CAAtC;AACA0M,MAAAA,mBAAmB,GAAGtI,OAAO,CAACpE,eAA9B;AACD;;AACD6P,IAAAA,WAAW,GAAGzL,OAAd;AACD,GAxCD,EAwCG,IAxCH,EA/B6F,CAwE7F;;AACA,MAAImL,mBAAmB,GAAGD,cAAc,CAACpkB,MAAzC,EAAiD;AAC/C,QAAI2kB,WAAJ,EAAiB;AACf;AACAC,MAAAA,kBAAkB,CAACD,WAAD,EAAcL,aAAa,EAA3B,CAAlB;AACD,KAJ8C,CAK/C;;;AACAH,IAAAA,IAAI,CAAC7Z,GAAL,CAAS8Z,cAAc,CAAChkB,MAAf,CAAsBikB,mBAAtB,EAA2CrY,IAA3C,CAAgD,EAAhD,CAAT;AACD,GAhF4F,CAkF7F;;;AACA8M,EAAAA,kBAAkB,CAACU,OAAnB,CAA2BlZ,OAA3B,CAAmC,UAAUmZ,UAAV,EAAsB;AACvD,QAAIrL,OAAO,GAAG0K,kBAAkB,CAACa,gBAAnB,CAAoCF,UAApC,CAAd;;AACA,QAAIrL,OAAO,IAAI,IAAf,EAAqB;AACnB,UAAI8V,aAAa,IAAI,IAArB,EAA2B;AACzBzK,QAAAA,UAAU,GAAG7D,IAAI,CAAC5J,IAAL,CAAUkY,aAAV,EAAyBzK,UAAzB,CAAb;AACD;;AACD0K,MAAAA,IAAI,CAACvK,gBAAL,CAAsBH,UAAtB,EAAkCrL,OAAlC;AACD;AACF,GARD;AAUA,SAAO+V,IAAP;;AAEA,WAASS,kBAAT,CAA4B1L,OAA5B,EAAqCnL,IAArC,EAA2C;AACzC,QAAImL,OAAO,KAAK,IAAZ,IAAoBA,OAAO,CAACvP,MAAR,KAAmBjD,SAA3C,EAAsD;AACpDyd,MAAAA,IAAI,CAAC7Z,GAAL,CAASyD,IAAT;AACD,KAFD,MAEO;AACL,UAAIpE,MAAM,GAAGua,aAAa,GACtBtO,IAAI,CAAC5J,IAAL,CAAUkY,aAAV,EAAyBhL,OAAO,CAACvP,MAAjC,CADsB,GAEtBuP,OAAO,CAACvP,MAFZ;AAGAwa,MAAAA,IAAI,CAAC7Z,GAAL,CAAS,IAAImZ,UAAJ,CAAevK,OAAO,CAACtE,YAAvB,EACesE,OAAO,CAACrE,cADvB,EAEelL,MAFf,EAGeoE,IAHf,EAIemL,OAAO,CAAClE,IAJvB,CAAT;AAKD;AACF;AACF,CA9GH;AAgHA;;;;;;;;AAMAyO,UAAU,CAAC5c,SAAX,CAAqByD,GAArB,GAA2B,SAASua,cAAT,CAAwBC,MAAxB,EAAgC;AACzD,MAAI9c,KAAK,CAAC+c,OAAN,CAAcD,MAAd,CAAJ,EAA2B;AACzBA,IAAAA,MAAM,CAACxkB,OAAP,CAAe,UAAU0kB,KAAV,EAAiB;AAC9B,WAAK1a,GAAL,CAAS0a,KAAT;AACD,KAFD,EAEG,IAFH;AAGD,GAJD,MAKK,IAAIF,MAAM,CAACtB,YAAD,CAAN,IAAwB,OAAOsB,MAAP,KAAkB,QAA9C,EAAwD;AAC3D,QAAIA,MAAJ,EAAY;AACV,WAAKjB,QAAL,CAAcjkB,IAAd,CAAmBklB,MAAnB;AACD;AACF,GAJI,MAKA;AACH,UAAM,IAAI3d,SAAJ,CACJ,gFAAgF2d,MAD5E,CAAN;AAGD;;AACD,SAAO,IAAP;AACD,CAjBD;AAmBA;;;;;;;;AAMArB,UAAU,CAAC5c,SAAX,CAAqBoe,OAArB,GAA+B,SAASC,kBAAT,CAA4BJ,MAA5B,EAAoC;AACjE,MAAI9c,KAAK,CAAC+c,OAAN,CAAcD,MAAd,CAAJ,EAA2B;AACzB,SAAK,IAAI5kB,CAAC,GAAG4kB,MAAM,CAAC9kB,MAAP,GAAc,CAA3B,EAA8BE,CAAC,IAAI,CAAnC,EAAsCA,CAAC,EAAvC,EAA2C;AACzC,WAAK+kB,OAAL,CAAaH,MAAM,CAAC5kB,CAAD,CAAnB;AACD;AACF,GAJD,MAKK,IAAI4kB,MAAM,CAACtB,YAAD,CAAN,IAAwB,OAAOsB,MAAP,KAAkB,QAA9C,EAAwD;AAC3D,SAAKjB,QAAL,CAAcsB,OAAd,CAAsBL,MAAtB;AACD,GAFI,MAGA;AACH,UAAM,IAAI3d,SAAJ,CACJ,gFAAgF2d,MAD5E,CAAN;AAGD;;AACD,SAAO,IAAP;AACD,CAfD;AAiBA;;;;;;;;;AAOArB,UAAU,CAAC5c,SAAX,CAAqBue,IAArB,GAA4B,SAASC,eAAT,CAAyBC,GAAzB,EAA8B;AACxD,MAAIN,KAAJ;;AACA,OAAK,IAAI9kB,CAAC,GAAG,CAAR,EAAWsH,GAAG,GAAG,KAAKqc,QAAL,CAAc7jB,MAApC,EAA4CE,CAAC,GAAGsH,GAAhD,EAAqDtH,CAAC,EAAtD,EAA0D;AACxD8kB,IAAAA,KAAK,GAAG,KAAKnB,QAAL,CAAc3jB,CAAd,CAAR;;AACA,QAAI8kB,KAAK,CAACxB,YAAD,CAAT,EAAyB;AACvBwB,MAAAA,KAAK,CAACI,IAAN,CAAWE,GAAX;AACD,KAFD,MAGK;AACH,UAAIN,KAAK,KAAK,EAAd,EAAkB;AAChBM,QAAAA,GAAG,CAACN,KAAD,EAAQ;AAAErb,UAAAA,MAAM,EAAE,KAAKA,MAAf;AACEkF,UAAAA,IAAI,EAAE,KAAKA,IADb;AAEEwK,UAAAA,MAAM,EAAE,KAAKA,MAFf;AAGErE,UAAAA,IAAI,EAAE,KAAKA;AAHb,SAAR,CAAH;AAID;AACF;AACF;AACF,CAhBD;AAkBA;;;;;;;;AAMAyO,UAAU,CAAC5c,SAAX,CAAqBmF,IAArB,GAA4B,SAASuZ,eAAT,CAAyBC,IAAzB,EAA+B;AACzD,MAAIC,WAAJ;AACA,MAAIvlB,CAAJ;AACA,MAAIsH,GAAG,GAAG,KAAKqc,QAAL,CAAc7jB,MAAxB;;AACA,MAAIwH,GAAG,GAAG,CAAV,EAAa;AACXie,IAAAA,WAAW,GAAG,EAAd;;AACA,SAAKvlB,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGsH,GAAG,GAAC,CAApB,EAAuBtH,CAAC,EAAxB,EAA4B;AAC1BulB,MAAAA,WAAW,CAAC7lB,IAAZ,CAAiB,KAAKikB,QAAL,CAAc3jB,CAAd,CAAjB;AACAulB,MAAAA,WAAW,CAAC7lB,IAAZ,CAAiB4lB,IAAjB;AACD;;AACDC,IAAAA,WAAW,CAAC7lB,IAAZ,CAAiB,KAAKikB,QAAL,CAAc3jB,CAAd,CAAjB;AACA,SAAK2jB,QAAL,GAAgB4B,WAAhB;AACD;;AACD,SAAO,IAAP;AACD,CAdD;AAgBA;;;;;;;;;AAOAhC,UAAU,CAAC5c,SAAX,CAAqB6e,YAArB,GAAoC,SAASC,uBAAT,CAAiCC,QAAjC,EAA2CC,YAA3C,EAAyD;AAC3F,MAAIC,SAAS,GAAG,KAAKjC,QAAL,CAAc,KAAKA,QAAL,CAAc7jB,MAAd,GAAuB,CAArC,CAAhB;;AACA,MAAI8lB,SAAS,CAACtC,YAAD,CAAb,EAA6B;AAC3BsC,IAAAA,SAAS,CAACJ,YAAV,CAAuBE,QAAvB,EAAiCC,YAAjC;AACD,GAFD,MAGK,IAAI,OAAOC,SAAP,KAAqB,QAAzB,EAAmC;AACtC,SAAKjC,QAAL,CAAc,KAAKA,QAAL,CAAc7jB,MAAd,GAAuB,CAArC,IAA0C8lB,SAAS,CAACtgB,OAAV,CAAkBogB,QAAlB,EAA4BC,YAA5B,CAA1C;AACD,GAFI,MAGA;AACH,SAAKhC,QAAL,CAAcjkB,IAAd,CAAmB,GAAG4F,OAAH,CAAWogB,QAAX,EAAqBC,YAArB,CAAnB;AACD;;AACD,SAAO,IAAP;AACD,CAZD;AAcA;;;;;;;;;AAOApC,UAAU,CAAC5c,SAAX,CAAqB+S,gBAArB,GACE,SAASmM,2BAAT,CAAqC9L,WAArC,EAAkDC,cAAlD,EAAkE;AAChE,OAAK4J,cAAL,CAAoBlO,IAAI,CAACzB,WAAL,CAAiB8F,WAAjB,CAApB,IAAqDC,cAArD;AACD,CAHH;AAKA;;;;;;;;AAMAuJ,UAAU,CAAC5c,SAAX,CAAqBmf,kBAArB,GACE,SAASC,6BAAT,CAAuCX,GAAvC,EAA4C;AAC1C,OAAK,IAAIplB,CAAC,GAAG,CAAR,EAAWsH,GAAG,GAAG,KAAKqc,QAAL,CAAc7jB,MAApC,EAA4CE,CAAC,GAAGsH,GAAhD,EAAqDtH,CAAC,EAAtD,EAA0D;AACxD,QAAI,KAAK2jB,QAAL,CAAc3jB,CAAd,EAAiBsjB,YAAjB,CAAJ,EAAoC;AAClC,WAAKK,QAAL,CAAc3jB,CAAd,EAAiB8lB,kBAAjB,CAAoCV,GAApC;AACD;AACF;;AAED,MAAI9L,OAAO,GAAG/P,MAAM,CAACnD,IAAP,CAAY,KAAKwd,cAAjB,CAAd;;AACA,OAAK,IAAI5jB,CAAC,GAAG,CAAR,EAAWsH,GAAG,GAAGgS,OAAO,CAACxZ,MAA9B,EAAsCE,CAAC,GAAGsH,GAA1C,EAA+CtH,CAAC,EAAhD,EAAoD;AAClDolB,IAAAA,GAAG,CAAC1P,IAAI,CAACvB,aAAL,CAAmBmF,OAAO,CAACtZ,CAAD,CAA1B,CAAD,EAAiC,KAAK4jB,cAAL,CAAoBtK,OAAO,CAACtZ,CAAD,CAA3B,CAAjC,CAAH;AACD;AACF,CAZH;AAcA;;;;;;AAIAujB,UAAU,CAAC5c,SAAX,CAAqBhB,QAArB,GAAgC,SAASqgB,mBAAT,GAA+B;AAC7D,MAAIjb,GAAG,GAAG,EAAV;AACA,OAAKma,IAAL,CAAU,UAAUJ,KAAV,EAAiB;AACzB/Z,IAAAA,GAAG,IAAI+Z,KAAP;AACD,GAFD;AAGA,SAAO/Z,GAAP;AACD,CAND;AAQA;;;;;;AAIAwY,UAAU,CAAC5c,SAAX,CAAqBsf,qBAArB,GAA6C,SAASC,gCAAT,CAA0ClU,KAA1C,EAAiD;AAC5F,MAAIkH,SAAS,GAAG;AACdrL,IAAAA,IAAI,EAAE,EADQ;AAEdc,IAAAA,IAAI,EAAE,CAFQ;AAGdwK,IAAAA,MAAM,EAAE;AAHM,GAAhB;AAKA,MAAIlO,GAAG,GAAG,IAAIgN,kBAAJ,CAAuBjG,KAAvB,CAAV;AACA,MAAImU,mBAAmB,GAAG,KAA1B;AACA,MAAIC,kBAAkB,GAAG,IAAzB;AACA,MAAIC,gBAAgB,GAAG,IAAvB;AACA,MAAIC,kBAAkB,GAAG,IAAzB;AACA,MAAIC,gBAAgB,GAAG,IAAvB;AACA,OAAKrB,IAAL,CAAU,UAAUJ,KAAV,EAAiB1L,QAAjB,EAA2B;AACnCF,IAAAA,SAAS,CAACrL,IAAV,IAAkBiX,KAAlB;;AACA,QAAI1L,QAAQ,CAAC3P,MAAT,KAAoB,IAApB,IACG2P,QAAQ,CAACzK,IAAT,KAAkB,IADrB,IAEGyK,QAAQ,CAACD,MAAT,KAAoB,IAF3B,EAEiC;AAC/B,UAAGiN,kBAAkB,KAAKhN,QAAQ,CAAC3P,MAAhC,IACG4c,gBAAgB,KAAKjN,QAAQ,CAACzK,IADjC,IAEG2X,kBAAkB,KAAKlN,QAAQ,CAACD,MAFnC,IAGGoN,gBAAgB,KAAKnN,QAAQ,CAACtE,IAHpC,EAG0C;AACxC7J,QAAAA,GAAG,CAACoO,UAAJ,CAAe;AACb5P,UAAAA,MAAM,EAAE2P,QAAQ,CAAC3P,MADJ;AAEb2P,UAAAA,QAAQ,EAAE;AACRzK,YAAAA,IAAI,EAAEyK,QAAQ,CAACzK,IADP;AAERwK,YAAAA,MAAM,EAAEC,QAAQ,CAACD;AAFT,WAFG;AAMbD,UAAAA,SAAS,EAAE;AACTvK,YAAAA,IAAI,EAAEuK,SAAS,CAACvK,IADP;AAETwK,YAAAA,MAAM,EAAED,SAAS,CAACC;AAFT,WANE;AAUbrE,UAAAA,IAAI,EAAEsE,QAAQ,CAACtE;AAVF,SAAf;AAYD;;AACDsR,MAAAA,kBAAkB,GAAGhN,QAAQ,CAAC3P,MAA9B;AACA4c,MAAAA,gBAAgB,GAAGjN,QAAQ,CAACzK,IAA5B;AACA2X,MAAAA,kBAAkB,GAAGlN,QAAQ,CAACD,MAA9B;AACAoN,MAAAA,gBAAgB,GAAGnN,QAAQ,CAACtE,IAA5B;AACAqR,MAAAA,mBAAmB,GAAG,IAAtB;AACD,KAzBD,MAyBO,IAAIA,mBAAJ,EAAyB;AAC9Blb,MAAAA,GAAG,CAACoO,UAAJ,CAAe;AACbH,QAAAA,SAAS,EAAE;AACTvK,UAAAA,IAAI,EAAEuK,SAAS,CAACvK,IADP;AAETwK,UAAAA,MAAM,EAAED,SAAS,CAACC;AAFT;AADE,OAAf;AAMAiN,MAAAA,kBAAkB,GAAG,IAArB;AACAD,MAAAA,mBAAmB,GAAG,KAAtB;AACD;;AACD,SAAK,IAAI1P,GAAG,GAAG,CAAV,EAAa3W,MAAM,GAAGglB,KAAK,CAAChlB,MAAjC,EAAyC2W,GAAG,GAAG3W,MAA/C,EAAuD2W,GAAG,EAA1D,EAA8D;AAC5D,UAAIqO,KAAK,CAAC1V,UAAN,CAAiBqH,GAAjB,MAA0B4M,YAA9B,EAA4C;AAC1CnK,QAAAA,SAAS,CAACvK,IAAV;AACAuK,QAAAA,SAAS,CAACC,MAAV,GAAmB,CAAnB,CAF0C,CAG1C;;AACA,YAAI1C,GAAG,GAAG,CAAN,KAAY3W,MAAhB,EAAwB;AACtBsmB,UAAAA,kBAAkB,GAAG,IAArB;AACAD,UAAAA,mBAAmB,GAAG,KAAtB;AACD,SAHD,MAGO,IAAIA,mBAAJ,EAAyB;AAC9Blb,UAAAA,GAAG,CAACoO,UAAJ,CAAe;AACb5P,YAAAA,MAAM,EAAE2P,QAAQ,CAAC3P,MADJ;AAEb2P,YAAAA,QAAQ,EAAE;AACRzK,cAAAA,IAAI,EAAEyK,QAAQ,CAACzK,IADP;AAERwK,cAAAA,MAAM,EAAEC,QAAQ,CAACD;AAFT,aAFG;AAMbD,YAAAA,SAAS,EAAE;AACTvK,cAAAA,IAAI,EAAEuK,SAAS,CAACvK,IADP;AAETwK,cAAAA,MAAM,EAAED,SAAS,CAACC;AAFT,aANE;AAUbrE,YAAAA,IAAI,EAAEsE,QAAQ,CAACtE;AAVF,WAAf;AAYD;AACF,OArBD,MAqBO;AACLoE,QAAAA,SAAS,CAACC,MAAV;AACD;AACF;AACF,GA/DD;AAgEA,OAAK2M,kBAAL,CAAwB,UAAUvM,UAAV,EAAsBiN,aAAtB,EAAqC;AAC3Dvb,IAAAA,GAAG,CAACyO,gBAAJ,CAAqBH,UAArB,EAAiCiN,aAAjC;AACD,GAFD;AAIA,SAAO;AAAE3Y,IAAAA,IAAI,EAAEqL,SAAS,CAACrL,IAAlB;AAAwB5C,IAAAA,GAAG,EAAEA;AAA7B,GAAP;AACD,CAjFD;;AAmFAvE,OAAO,CAAC6c,UAAR,GAAqBA,UAArB;;AC5ZA;;;;;AAKA7c,OAAO,CAACuR,kBAAR,GAA6BxN,OAAO,CAAC,4BAAD,CAAP,CAAsCwN,kBAAnE;AACAvR,OAAO,CAACqX,iBAAR,GAA4BtT,OAAO,CAAC,2BAAD,CAAP,CAAqCsT,iBAAjE;AACArX,OAAO,CAAC6c,UAAR,GAAqB9Y,OAAO,CAAC,mBAAD,CAAP,CAA6B8Y,UAAlD;;;ACPA;AACA,IAAIkD,OAAO,GAAGhgB,MAAM,CAACC,OAAP,GAAiB,EAA/B,EAEA;AACA;AACA;AACA;;AAEA,IAAIggB,gBAAJ;AACA,IAAIC,kBAAJ;;AAEA,SAASC,gBAAT,GAA4B;AACxB,QAAM,IAAIljB,KAAJ,CAAU,iCAAV,CAAN;AACH;;AACD,SAASmjB,mBAAT,GAAgC;AAC5B,QAAM,IAAInjB,KAAJ,CAAU,mCAAV,CAAN;AACH;;AACA,aAAY;AACT,MAAI;AACA,QAAI,OAAOojB,UAAP,KAAsB,UAA1B,EAAsC;AAClCJ,MAAAA,gBAAgB,GAAGI,UAAnB;AACH,KAFD,MAEO;AACHJ,MAAAA,gBAAgB,GAAGE,gBAAnB;AACH;AACJ,GAND,CAME,OAAO3jB,CAAP,EAAU;AACRyjB,IAAAA,gBAAgB,GAAGE,gBAAnB;AACH;;AACD,MAAI;AACA,QAAI,OAAOG,YAAP,KAAwB,UAA5B,EAAwC;AACpCJ,MAAAA,kBAAkB,GAAGI,YAArB;AACH,KAFD,MAEO;AACHJ,MAAAA,kBAAkB,GAAGE,mBAArB;AACH;AACJ,GAND,CAME,OAAO5jB,CAAP,EAAU;AACR0jB,IAAAA,kBAAkB,GAAGE,mBAArB;AACH;AACJ,CAnBA,GAAD;;AAoBA,SAASG,UAAT,CAAoBC,GAApB,EAAyB;AACrB,MAAIP,gBAAgB,KAAKI,UAAzB,EAAqC;AACjC;AACA,WAAOA,UAAU,CAACG,GAAD,EAAM,CAAN,CAAjB;AACH,GAJoB,CAKrB;;;AACA,MAAI,CAACP,gBAAgB,KAAKE,gBAArB,IAAyC,CAACF,gBAA3C,KAAgEI,UAApE,EAAgF;AAC5EJ,IAAAA,gBAAgB,GAAGI,UAAnB;AACA,WAAOA,UAAU,CAACG,GAAD,EAAM,CAAN,CAAjB;AACH;;AACD,MAAI;AACA;AACA,WAAOP,gBAAgB,CAACO,GAAD,EAAM,CAAN,CAAvB;AACH,GAHD,CAGE,OAAMhkB,CAAN,EAAQ;AACN,QAAI;AACA;AACA,aAAOyjB,gBAAgB,CAAC7e,IAAjB,CAAsB,IAAtB,EAA4Bof,GAA5B,EAAiC,CAAjC,CAAP;AACH,KAHD,CAGE,OAAMhkB,CAAN,EAAQ;AACN;AACA,aAAOyjB,gBAAgB,CAAC7e,IAAjB,CAAsB,IAAtB,EAA4Bof,GAA5B,EAAiC,CAAjC,CAAP;AACH;AACJ;AAGJ;;AACD,SAASC,eAAT,CAAyBC,MAAzB,EAAiC;AAC7B,MAAIR,kBAAkB,KAAKI,YAA3B,EAAyC;AACrC;AACA,WAAOA,YAAY,CAACI,MAAD,CAAnB;AACH,GAJ4B,CAK7B;;;AACA,MAAI,CAACR,kBAAkB,KAAKE,mBAAvB,IAA8C,CAACF,kBAAhD,KAAuEI,YAA3E,EAAyF;AACrFJ,IAAAA,kBAAkB,GAAGI,YAArB;AACA,WAAOA,YAAY,CAACI,MAAD,CAAnB;AACH;;AACD,MAAI;AACA;AACA,WAAOR,kBAAkB,CAACQ,MAAD,CAAzB;AACH,GAHD,CAGE,OAAOlkB,CAAP,EAAS;AACP,QAAI;AACA;AACA,aAAO0jB,kBAAkB,CAAC9e,IAAnB,CAAwB,IAAxB,EAA8Bsf,MAA9B,CAAP;AACH,KAHD,CAGE,OAAOlkB,CAAP,EAAS;AACP;AACA;AACA,aAAO0jB,kBAAkB,CAAC9e,IAAnB,CAAwB,IAAxB,EAA8Bsf,MAA9B,CAAP;AACH;AACJ;AAIJ;;AACD,IAAIC,KAAK,GAAG,EAAZ;AACA,IAAIC,QAAQ,GAAG,KAAf;AACA,IAAIC,YAAJ;AACA,IAAIC,UAAU,GAAG,CAAC,CAAlB;;AAEA,SAASC,eAAT,GAA2B;AACvB,MAAI,CAACH,QAAD,IAAa,CAACC,YAAlB,EAAgC;AAC5B;AACH;;AACDD,EAAAA,QAAQ,GAAG,KAAX;;AACA,MAAIC,YAAY,CAACxnB,MAAjB,EAAyB;AACrBsnB,IAAAA,KAAK,GAAGE,YAAY,CAACzhB,MAAb,CAAoBuhB,KAApB,CAAR;AACH,GAFD,MAEO;AACHG,IAAAA,UAAU,GAAG,CAAC,CAAd;AACH;;AACD,MAAIH,KAAK,CAACtnB,MAAV,EAAkB;AACd2nB,IAAAA,UAAU;AACb;AACJ;;AAED,SAASA,UAAT,GAAsB;AAClB,MAAIJ,QAAJ,EAAc;AACV;AACH;;AACD,MAAIK,OAAO,GAAGV,UAAU,CAACQ,eAAD,CAAxB;AACAH,EAAAA,QAAQ,GAAG,IAAX;AAEA,MAAI/f,GAAG,GAAG8f,KAAK,CAACtnB,MAAhB;;AACA,SAAMwH,GAAN,EAAW;AACPggB,IAAAA,YAAY,GAAGF,KAAf;AACAA,IAAAA,KAAK,GAAG,EAAR;;AACA,WAAO,EAAEG,UAAF,GAAejgB,GAAtB,EAA2B;AACvB,UAAIggB,YAAJ,EAAkB;AACdA,QAAAA,YAAY,CAACC,UAAD,CAAZ,CAAyBI,GAAzB;AACH;AACJ;;AACDJ,IAAAA,UAAU,GAAG,CAAC,CAAd;AACAjgB,IAAAA,GAAG,GAAG8f,KAAK,CAACtnB,MAAZ;AACH;;AACDwnB,EAAAA,YAAY,GAAG,IAAf;AACAD,EAAAA,QAAQ,GAAG,KAAX;AACAH,EAAAA,eAAe,CAACQ,OAAD,CAAf;AACH;;AAEDjB,OAAO,CAACmB,QAAR,GAAmB,UAAUX,GAAV,EAAe;AAC9B,MAAI9mB,IAAI,GAAG,IAAI2H,KAAJ,CAAUL,SAAS,CAAC3H,MAAV,GAAmB,CAA7B,CAAX;;AACA,MAAI2H,SAAS,CAAC3H,MAAV,GAAmB,CAAvB,EAA0B;AACtB,SAAK,IAAIE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGyH,SAAS,CAAC3H,MAA9B,EAAsCE,CAAC,EAAvC,EAA2C;AACvCG,MAAAA,IAAI,CAACH,CAAC,GAAG,CAAL,CAAJ,GAAcyH,SAAS,CAACzH,CAAD,CAAvB;AACH;AACJ;;AACDonB,EAAAA,KAAK,CAAC1nB,IAAN,CAAW,IAAImoB,IAAJ,CAASZ,GAAT,EAAc9mB,IAAd,CAAX;;AACA,MAAIinB,KAAK,CAACtnB,MAAN,KAAiB,CAAjB,IAAsB,CAACunB,QAA3B,EAAqC;AACjCL,IAAAA,UAAU,CAACS,UAAD,CAAV;AACH;AACJ,CAXD,EAaA;;;AACA,SAASI,IAAT,CAAcZ,GAAd,EAAmBa,KAAnB,EAA0B;AACtB,OAAKb,GAAL,GAAWA,GAAX;AACA,OAAKa,KAAL,GAAaA,KAAb;AACH;;AACDD,IAAI,CAAClhB,SAAL,CAAeghB,GAAf,GAAqB,YAAY;AAC7B,OAAKV,GAAL,CAASjf,KAAT,CAAe,IAAf,EAAqB,KAAK8f,KAA1B;AACH,CAFD;;AAGArB,OAAO,CAACsB,KAAR,GAAgB,SAAhB;AACAtB,OAAO,CAACuB,OAAR,GAAkB,IAAlB;AACAvB,OAAO,CAACwB,GAAR,GAAc,EAAd;AACAxB,OAAO,CAACyB,IAAR,GAAe,EAAf;AACAzB,OAAO,CAAC7K,OAAR,GAAkB,EAAlB,EAAsB;;AACtB6K,OAAO,CAAC0B,QAAR,GAAmB,EAAnB;;AAEA,SAASC,IAAT,GAAgB,CAAE;;AAElB3B,OAAO,CAACle,EAAR,GAAa6f,IAAb;AACA3B,OAAO,CAACxe,WAAR,GAAsBmgB,IAAtB;AACA3B,OAAO,CAACje,IAAR,GAAe4f,IAAf;AACA3B,OAAO,CAAC4B,GAAR,GAAcD,IAAd;AACA3B,OAAO,CAAC9d,cAAR,GAAyByf,IAAzB;AACA3B,OAAO,CAAC3d,kBAAR,GAA6Bsf,IAA7B;AACA3B,OAAO,CAACvf,IAAR,GAAekhB,IAAf;AACA3B,OAAO,CAAC6B,eAAR,GAA0BF,IAA1B;AACA3B,OAAO,CAAC8B,mBAAR,GAA8BH,IAA9B;;AAEA3B,OAAO,CAACtnB,SAAR,GAAoB,UAAU2V,IAAV,EAAgB;AAAE,SAAO,EAAP;AAAW,CAAjD;;AAEA2R,OAAO,CAAC+B,OAAR,GAAkB,UAAU1T,IAAV,EAAgB;AAC9B,QAAM,IAAIpR,KAAJ,CAAU,kCAAV,CAAN;AACH,CAFD;;AAIA+iB,OAAO,CAACgC,GAAR,GAAc,YAAY;AAAE,SAAO,GAAP;AAAY,CAAxC;;AACAhC,OAAO,CAACiC,KAAR,GAAgB,UAAUC,GAAV,EAAe;AAC3B,QAAM,IAAIjlB,KAAJ,CAAU,gCAAV,CAAN;AACH,CAFD;;AAGA+iB,OAAO,CAACmC,KAAR,GAAgB,YAAW;AAAE,SAAO,CAAP;AAAW,CAAxC;;;ACvLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;AChOA,IAAA,UAAA,GAAA,OAAA,CAAA,YAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,MAAA,CAAA;;;;AACA,IAAA,GAAA,GAAA,OAAA,CAAA,IAAA,CAAA;;;;;;;;;;;;;;;;AAEA,SAASC,UAAT,CAAoB9d,GAApB,EAAyB;AACrB,MAAK+d,MAAL,EAAc;AACV,QAAKA,MAAAA,CAAOC,IAAPD,IAAeA,MAAAA,CAAOC,IAAPD,KAAgBE,UAAAA,CAAWD,IAA/C,EAAsD;AAClD,aAAOD,MAAAA,CAAOC,IAAPD,CAAY/d,GAAZ+d,EAAiB,QAAjBA,EAA2BnjB,QAA3BmjB,EAAP;AADJ,KAAA,MAEO;AACH,aAAO,IAAIA,MAAJ,CAAW/d,GAAX,EAAgB,QAAhB,EAA0BpF,QAA1B,EAAP;AACH;AALL,GAAA,MAMO;AACH,WAAOpB,MAAAA,CAAO0kB,IAAP1kB,CAAYwG,GAAZxG,CAAP;AACH;AACJ;AAED;;;;;;;;;;;;;IAWM2kB;AAEF;;;;AAIA,WAAA,WAAA,CAAYzb,GAAZ,EAAiB0b,IAAjB,EAAuB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,WAAA,CAAA;;AACnB,SAAKC,cAAL,CAAoB3b,GAApB;AACA;;;;AAGA,SAAK4b,MAAL,GAAc,KAAKC,SAAL,CAAe,KAAKC,UAApB,EAAgC,OAAhC,CAAd;AAEA,QAAI/a,IAAAA,GAAO2a,IAAAA,CAAKle,GAALke,GAAWA,IAAAA,CAAKle,GAALke,CAAS3a,IAApB2a,GAA2B3iB,SAAtC;AACA,QAAIgjB,IAAAA,GAAO,KAAKC,OAAL,CAAaN,IAAAA,CAAKJ,IAAlB,EAAwBva,IAAxB,CAAX;AACA,QAAKgb,IAAL,EAAY,KAAKA,IAAL,GAAYA,IAAZ;AACf;AAED;;;;;;;;;;;wBASAxJ,+BAAW;AACP,QAAK,CAAC,KAAK0J,aAAX,EAA2B;AACvB,WAAKA,aAAL,GAAqB,IAAIC,WAAAA,CAAAA,OAAAA,CAAQ5L,iBAAZ,CAA8B,KAAKyL,IAAnC,CAArB;AACH;;AACD,WAAO,KAAKE,aAAZ;;AAGJ;;;;;;;wBAKAE,qCAAc;AACV,WAAO,CAAC,EAAE,KAAK5J,QAAL,GAAgBlE,cAAhB,IACA,KAAKkE,QAAL,GAAgBlE,cAAhB,CAA+Bhc,MAA/B,GAAwC,CAD1C,CAAR;;;wBAIJwpB,+BAAUlkB,QAAQykB,OAAO;AACrB,QAAK,CAACzkB,MAAN,EAAe,OAAO,KAAP;AACf,WAAOA,MAAAA,CAAOwO,MAAPxO,CAAc,CAAdA,EAAiBykB,KAAAA,CAAM/pB,MAAvBsF,MAAmCykB,KAA1C;;;wBAGJT,yCAAe3b,KAAK;AAChB,QAAI8E,KAAAA,GAAQ9E,GAAAA,CAAI8E,KAAJ9E,CAAU,uCAAVA,CAAZ;AACA,QAAK8E,KAAL,EAAa,KAAKgX,UAAL,GAAkBhX,KAAAA,CAAM,CAANA,CAAAA,CAASrH,IAATqH,EAAlB;;;wBAGjBuX,qCAAaN,MAAM;AACf;AACA;AACA;AACA,QAAIO,OAAAA,GAAU,qDAAd;AACA,QAAIC,GAAAA,GAAU,wBAAd;;AAEA,QAAK,KAAKV,SAAL,CAAeE,IAAf,EAAqBQ,GAArB,CAAL,EAAiC;AAC7B,aAAOC,kBAAAA,CAAoBT,IAAAA,CAAK5V,MAAL4V,CAAYQ,GAAAA,CAAIlqB,MAAhB0pB,CAApBS,CAAP;AADJ,KAAA,MAGO,IAAKF,OAAAA,CAAQre,IAARqe,CAAaP,IAAbO,CAAL,EAA0B;AAC7B,aAAOlB,UAAAA,CAAWW,IAAAA,CAAK5V,MAAL4V,CAAYU,MAAAA,CAAOC,SAAPD,CAAiBpqB,MAA7B0pB,CAAXX,CAAP;AADG,KAAA,MAGA;AACH,UAAIuB,QAAAA,GAAWZ,IAAAA,CAAKjX,KAALiX,CAAW,iCAAXA,EAA8C,CAA9CA,CAAf;AACA,YAAM,IAAI9lB,KAAJ,CAAU,qCAAqC0mB,QAA/C,CAAN;AACH;;;wBAGLX,2BAAQ3Q,MAAMtK,MAAM;AAChB,QAAKA,IAAAA,KAAS,KAAd,EAAsB,OAAO,KAAP;;AAEtB,QAAKA,IAAL,EAAY;AACR,UAAK,OAAOA,IAAP,KAAgB,QAArB,EAAgC;AAC5B,eAAOA,IAAP;AADJ,OAAA,MAEO,IAAK,OAAOA,IAAP,KAAgB,UAArB,EAAkC;AACrC,YAAI6b,QAAAA,GAAW7b,IAAAA,CAAKsK,IAALtK,CAAf;;AACA,YAAK6b,QAAAA,IAAYC,IAAAA,CAAAA,OAAAA,CAAGC,UAAfF,IAA6BC,IAAAA,CAAAA,OAAAA,CAAGC,UAAHD,CAAcD,QAAdC,CAAlC,EAA4D;AACxD,iBAAOA,IAAAA,CAAAA,OAAAA,CAAGE,YAAHF,CAAgBD,QAAhBC,EAA0B,OAA1BA,EAAmC3kB,QAAnC2kB,GAA8Cpf,IAA9Cof,EAAP;AADJ,SAAA,MAEO;AACH,gBAAM,IAAI5mB,KAAJ,CAAU,yCAChB2mB,QAAAA,CAAS1kB,QAAT0kB,EADM,CAAN;AAEH;AAPE,OAAA,MAQA,IAAK7b,IAAAA,YAAgBmb,WAAAA,CAAAA,OAAAA,CAAQ5L,iBAA7B,EAAiD;AACpD,eAAO4L,WAAAA,CAAAA,OAAAA,CAAQ1R,kBAAR0R,CACFjR,aADEiR,CACYnb,IADZmb,EACkBhkB,QADlBgkB,EAAP;AADG,OAAA,MAGA,IAAKnb,IAAAA,YAAgBmb,WAAAA,CAAAA,OAAAA,CAAQ1R,kBAA7B,EAAkD;AACrD,eAAOzJ,IAAAA,CAAK7I,QAAL6I,EAAP;AADG,OAAA,MAEA,IAAK,KAAKic,KAAL,CAAWjc,IAAX,CAAL,EAAwB;AAC3B,eAAOnL,IAAAA,CAAKC,SAALD,CAAemL,IAAfnL,CAAP;AADG,OAAA,MAEA;AACH,cAAM,IAAIK,KAAJ,CAAU,6CACZ8K,IAAAA,CAAK7I,QAAL6I,EADE,CAAN;AAEH;AArBL,KAAA,MAuBO,IAAK,KAAK6a,MAAV,EAAmB;AACtB,aAAO,KAAKS,YAAL,CAAkB,KAAKP,UAAvB,CAAP;AADG,KAAA,MAGA,IAAK,KAAKA,UAAV,EAAuB;AAC1B,UAAIte,GAAAA,GAAM,KAAKse,UAAf;AACA,UAAKzQ,IAAL,EAAY7N,GAAAA,GAAM2H,MAAAA,CAAAA,OAAAA,CAAK9G,IAAL8G,CAAUA,MAAAA,CAAAA,OAAAA,CAAK8X,OAAL9X,CAAakG,IAAblG,CAAVA,EAA8B3H,GAA9B2H,CAAN3H;AAEZ,WAAK0f,IAAL,GAAY/X,MAAAA,CAAAA,OAAAA,CAAK8X,OAAL9X,CAAa3H,GAAb2H,CAAZ;;AACA,UAAK0X,IAAAA,CAAAA,OAAAA,CAAGC,UAAHD,IAAiBA,IAAAA,CAAAA,OAAAA,CAAGC,UAAHD,CAAcrf,GAAdqf,CAAtB,EAA2C;AACvC,eAAOA,IAAAA,CAAAA,OAAAA,CAAGE,YAAHF,CAAgBrf,GAAhBqf,EAAqB,OAArBA,EAA8B3kB,QAA9B2kB,GAAyCpf,IAAzCof,EAAP;AADJ,OAAA,MAEO;AACH,eAAO,KAAP;AACH;AACJ;;;wBAGLG,uBAAMxf,KAAK;AACP,QAAK,CAAA,OAAOA,GAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,GAAP,CAAA,MAAe,QAApB,EAA+B,OAAO,KAAP;AAC/B,WAAO,OAAOA,GAAAA,CAAIoQ,QAAX,KAAwB,QAAxB,IACA,OAAOpQ,GAAAA,CAAIsN,SAAX,KAAyB,QADhC;;;;;;kBAKO2Q;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrJf,IAAA,eAAA,GAAA,OAAA,CAAA,oBAAA,CAAA;;;;AACA,IAAA,YAAA,GAAA,OAAA,CAAA,gBAAA,CAAA;;;;AAEA,IAAA,KAAA,GAAA,OAAA,CAAA,MAAA,CAAA;;;;;;;;;;;;;;;;AAEA,IAAI0B,QAAAA,GAAW,CAAf;AAEA;;;;;;;;IAOMC;AAEF;;;;AAIA,WAAA,KAAA,CAAYpd,GAAZ,EAA6B;AAAA,QAAZ0b,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,KAAA,CAAA;;AACzB,QAAK1b,GAAAA,KAAQ,IAARA,IAAgB,CAAA,OAAOA,GAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,GAAP,CAAA,MAAe,QAAf,IAA2B,CAACA,GAAAA,CAAI9H,QAArD,EAAgE;AAC5D,YAAM,IAAIjC,KAAJ,CAAA,sBAA+B+J,GAA/B,GAAA,wBAAA,CAAN;AACH;AAED;;;;;;;;;AAOA,SAAKA,GAAL,GAAWA,GAAAA,CAAI9H,QAAJ8H,EAAX;;AAEA,QAAK,KAAKA,GAAL,CAAS,CAAT,MAAgB,QAAhB,IAA4B,KAAKA,GAAL,CAAS,CAAT,MAAgB,QAAjD,EAA4D;AACxD,WAAKA,GAAL,GAAW,KAAKA,GAAL,CAAS1F,KAAT,CAAe,CAAf,CAAX;AACH;;AAED,QAAKohB,IAAAA,CAAKJ,IAAV,EAAiB;AACb,UAAK,YAAYrd,IAAZ,CAAiByd,IAAAA,CAAKJ,IAAtB,CAAL,EAAmC;AAC/B;;;;;;;;AAQA,aAAKjQ,IAAL,GAAYqQ,IAAAA,CAAKJ,IAAjB;AATJ,OAAA,MAUO;AACH,aAAKjQ,IAAL,GAAYlG,MAAAA,CAAAA,OAAAA,CAAKpQ,OAALoQ,CAAauW,IAAAA,CAAKJ,IAAlBnW,CAAZ;AACH;AACJ;;AAED,QAAI3H,GAAAA,GAAM,IAAIie,aAAAA,CAAAA,OAAJ,CAAgB,KAAKzb,GAArB,EAA0B0b,IAA1B,CAAV;;AACA,QAAKle,GAAAA,CAAIue,IAAT,EAAgB;AACZ;;;;;;;;AAQA,WAAKve,GAAL,GAAWA,GAAX;AACA,UAAI6N,IAAAA,GAAO7N,GAAAA,CAAI+U,QAAJ/U,GAAe6N,IAA1B;AACA,UAAK,CAAC,KAAKA,IAAN,IAAcA,IAAnB,EAA0B,KAAKA,IAAL,GAAY,KAAKgS,UAAL,CAAgBhS,IAAhB,CAAZ;AAC7B;;AAED,QAAK,CAAC,KAAKA,IAAX,EAAkB;AACd8R,MAAAA,QAAAA,IAAY,CAAZA;AACA;;;;;;;;;;;AAUA,WAAKG,EAAL,GAAY,gBAAgBH,QAAhB,GAA2B,GAAvC;AACH;;AACD,QAAK,KAAK3f,GAAV,EAAgB,KAAKA,GAAL,CAAS6N,IAAT,GAAgB,KAAKiQ,IAArB;AACnB;;kBAEDxhB,uBAAMyjB,SAASrc,MAAMwK,QAAoB;AAAA,QAAZgQ,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;AACrC,QAAIxX,MAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAIsZ,MAAAA,GAAS,KAAKA,MAAL,CAAYtc,IAAZ,EAAkBwK,MAAlB,CAAb;;AACA,QAAK8R,MAAL,EAAc;AACVtZ,MAAAA,MAAAA,GAAS,IAAIuZ,gBAAAA,CAAAA,OAAJ,CAAmBF,OAAnB,EAA4BC,MAAAA,CAAOtc,IAAnC,EAAyCsc,MAAAA,CAAO9R,MAAhD,EACL8R,MAAAA,CAAOxhB,MADF,EACUwhB,MAAAA,CAAOnS,IADjB,EACuBqQ,IAAAA,CAAKgC,MAD5B,CAATxZ;AADJ,KAAA,MAGO;AACHA,MAAAA,MAAAA,GAAS,IAAIuZ,gBAAAA,CAAAA,OAAJ,CAAmBF,OAAnB,EAA4Brc,IAA5B,EAAkCwK,MAAlC,EACL,KAAK1L,GADA,EACK,KAAKqL,IADV,EACgBqQ,IAAAA,CAAKgC,MADrB,CAATxZ;AAEH;;AAEDA,IAAAA,MAAAA,CAAOpE,KAAPoE,GAAe;AAAEhD,MAAAA,IAAAA,EAAAA,IAAF;AAAQwK,MAAAA,MAAAA,EAAAA,MAAR;AAAgB1P,MAAAA,MAAAA,EAAQ,KAAKgE;AAA7B,KAAfkE;AACA,QAAK,KAAKmH,IAAV,EAAiBnH,MAAAA,CAAOpE,KAAPoE,CAAamH,IAAbnH,GAAoB,KAAKmH,IAAzBnH;AAEjB,WAAOA,MAAP;;AAGJ;;;;;;;;;;;;;;;kBAaAsZ,yBAAOtc,MAAMwK,QAAQ;AACjB,QAAK,CAAC,KAAKlO,GAAX,EAAiB,OAAO,KAAP;AACjB,QAAI+U,QAAAA,GAAW,KAAK/U,GAAL,CAAS+U,QAAT,EAAf;AAEA,QAAI+I,IAAAA,GAAO/I,QAAAA,CAAS1F,mBAAT0F,CAA6B;AAAErR,MAAAA,IAAAA,EAAAA,IAAF;AAAQwK,MAAAA,MAAAA,EAAAA;AAAR,KAA7B6G,CAAX;AACA,QAAK,CAAC+I,IAAAA,CAAKtf,MAAX,EAAoB,OAAO,KAAP;AAEpB,QAAIkI,MAAAA,GAAS;AACTmH,MAAAA,IAAAA,EAAQ,KAAKgS,UAAL,CAAgB/B,IAAAA,CAAKtf,MAArB,CADC;AAETkF,MAAAA,IAAAA,EAAQoa,IAAAA,CAAKpa,IAFJ;AAGTwK,MAAAA,MAAAA,EAAQ4P,IAAAA,CAAK5P;AAHJ,KAAb;AAMA,QAAI1P,MAAAA,GAASuW,QAAAA,CAASvG,gBAATuG,CAA0B+I,IAAAA,CAAKtf,MAA/BuW,CAAb;AACA,QAAKvW,MAAL,EAAckI,MAAAA,CAAOlI,MAAPkI,GAAgBlI,MAAhBkI;AAEd,WAAOA,MAAP;;;kBAGJmZ,iCAAWhS,MAAM;AACb,QAAK,YAAYpN,IAAZ,CAAiBoN,IAAjB,CAAL,EAA8B;AAC1B,aAAOA,IAAP;AADJ,KAAA,MAEO;AACH,aAAOlG,MAAAA,CAAAA,OAAAA,CAAKpQ,OAALoQ,CAAa,KAAK3H,GAAL,CAAS+U,QAAT,GAAoB1K,UAApB,IAAkC,GAA/C1C,EAAoDkG,IAApDlG,CAAP;AACH;;AAGL;;;;;;;;;;;;;;;;wBAYW;AACP,aAAO,KAAKkG,IAAL,IAAa,KAAKiS,EAAzB;AACH;;;;;;kBAIUF;AAEf;;;;;;;;;;;;;ACnKA,IAAA,MAAA,GAAA,OAAA,CAAA,OAAA,CAAA;;;;AAEA,IAAA,SAAA,GAAA,OAAA,CAAA,YAAA,CAAA;;;;AACA,IAAA,MAAA,GAAA,OAAA,CAAA,SAAA,CAAA;;;;;;;;;;AAEA,IAAMO,eAAAA,GAAkB;AACpB,cAAYC,OAAAA,CAAAA,OAAAA,CAAMC,IADE;AAEpB,aAAYD,OAAAA,CAAAA,OAAAA,CAAMC,IAFE;AAGpB,UAAYD,OAAAA,CAAAA,OAAAA,CAAMC,IAHE;AAIpB,aAAYD,OAAAA,CAAAA,OAAAA,CAAME,IAJE;AAKpB,YAAYF,OAAAA,CAAAA,OAAAA,CAAMG,KALE;AAMpB,WAAYH,OAAAA,CAAAA,OAAAA,CAAMI,MANE;AAOpB,UAAYJ,OAAAA,CAAAA,OAAAA,CAAMK,OAPE;AAQpB,OAAYL,OAAAA,CAAAA,OAAAA,CAAMC,IARE;AASpB,OAAYD,OAAAA,CAAAA,OAAAA,CAAMC,IATE;AAUpB,OAAYD,OAAAA,CAAAA,OAAAA,CAAMI,MAVE;AAWpB,OAAYJ,OAAAA,CAAAA,OAAAA,CAAMI,MAXE;AAYpB,OAAYJ,OAAAA,CAAAA,OAAAA,CAAMI,MAZE;AAapB,OAAYJ,OAAAA,CAAAA,OAAAA,CAAMI,MAbE;AAcpB,OAAYJ,OAAAA,CAAAA,OAAAA,CAAMI,MAdE;AAepB,OAAYJ,OAAAA,CAAAA,OAAAA,CAAMI;AAfE,CAAxB;;AAkBA,SAASE,YAAT,CAAA,IAAA,EAAqCC,SAArC,EAAgD;AAAA,MAAzBzkB,IAAyB,GAAA,IAAA,CAAA,CAAA,CAAA;AAAA,MAAnBgE,KAAmB,GAAA,IAAA,CAAA,CAAA,CAAA;;AAC5C,MAAKhE,IAAAA,KAAS,MAAd,EAAuB;AACnB,QAAKgE,KAAAA,CAAM,CAANA,CAAAA,KAAa,GAAlB,EAAwB;AACpB,aAAO,OAAP;AACH;;AACD,QAAKA,KAAAA,CAAM,CAANA,CAAAA,KAAa,GAAlB,EAAwB;AACpB,aAAO,MAAP;AACH;AACJ;;AAED,MAAK,CAACygB,SAAAA,CAAU3c,SAAV2c,EAAN,EAA8B;AAC1B,QAAI9d,IAAAA,GAAO8d,SAAAA,CAAU1c,SAAV0c,EAAX;AACAA,IAAAA,SAAAA,CAAUrc,IAAVqc,CAAe9d,IAAf8d;AACA,QAAK9d,IAAAA,CAAK,CAALA,CAAAA,KAAY,UAAZA,IAA0BA,IAAAA,CAAK,CAALA,CAAAA,KAAY,GAA3C,EAAiD,OAAO,MAAP;AACpD;;AAED,SAAO3G,IAAP;AACH;;AAED,SAAS0kB,iBAAT,CAA2Bpe,GAA3B,EAAgC;AAC5B,MAAIme,SAAAA,GAAY,CAAA,GAAA,UAAA,CAAA,OAAA,EAAU,IAAIf,OAAAA,CAAAA,OAAJ,CAAUpd,GAAV,CAAV,EAA0B;AAAEG,IAAAA,YAAAA,EAAc;AAAhB,GAA1B,CAAhB;AACA,MAAI+D,MAAAA,GAAS,EAAb;;AAF4B,MAAA,KAAA,GAAA,SAAA,KAAA,GAAA;AAIxB,QAAInC,KAAAA,GAAQoc,SAAAA,CAAU1c,SAAV0c,EAAZ;AACA,QAAIE,KAAAA,GAAQV,eAAAA,CAAgBO,YAAAA,CAAanc,KAAbmc,EAAoBC,SAApBD,CAAhBP,CAAZ;;AACA,QAAKU,KAAL,EAAa;AACTna,MAAAA,MAAAA,IAAUnC,KAAAA,CAAM,CAANA,CAAAA,CAASxE,KAATwE,CAAe,OAAfA,EACLvE,GADKuE,CACA,UAAA,CAAA,EAAA;AAAA,eAAKsc,KAAAA,CAAM9rB,CAAN8rB,CAAL;AADA,OAAAtc,EAEL1D,IAFK0D,CAEA,IAFAA,CAAVmC;AADJ,KAAA,MAIO;AACHA,MAAAA,MAAAA,IAAUnC,KAAAA,CAAM,CAANA,CAAVmC;AACH;AAZuB,GAAA;;AAG5B,SAAQ,CAACia,SAAAA,CAAU3c,SAAV2c,EAAT,EAAiC;AAAA,IAAA,KAAA;AAUhC;;AACD,SAAOja,MAAP;AACH;;kBAEcka;;;;;;;AC3Df,IAAA,cAAA,GAAA,OAAA,CAAA,gBAAA,CAAA;;;;AACA,IAAA,MAAA,GAAA,OAAA,CAAA,OAAA,CAAA;;;;AAEA,IAAA,kBAAA,GAAA,OAAA,CAAA,sBAAA,CAAA;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IA2BMX;AAEF;;;;;;;;AAQA,WAAA,cAAA,CAAYF,OAAZ,EAAqBrc,IAArB,EAA2BwK,MAA3B,EAAmC1P,MAAnC,EAA2CqP,IAA3C,EAAiDqS,MAAjD,EAAyD;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,cAAA,CAAA;AACrD;;;;;;;;;;;;;;AAYA,SAAKrW,IAAL,GAAY,gBAAZ;AACA;;;;;;;AAMA,SAAKiX,MAAL,GAAcf,OAAd;;AAEA,QAAKlS,IAAL,EAAY;AACR;;;;;;;AAOA,WAAKA,IAAL,GAAYA,IAAZ;AACH;;AACD,QAAKrP,MAAL,EAAc;AACV;;;;;;;AAOA,WAAKA,MAAL,GAAcA,MAAd;AACH;;AACD,QAAK0hB,MAAL,EAAc;AACV;;;;;;AAMA,WAAKA,MAAL,GAAcA,MAAd;AACH;;AACD,QAAK,OAAOxc,IAAP,KAAgB,WAAhB,IAA+B,OAAOwK,MAAP,KAAkB,WAAtD,EAAoE;AAChE;;;;;;;AAOA,WAAKxK,IAAL,GAAcA,IAAd;AACA;;;;;;;;AAOA,WAAKwK,MAAL,GAAcA,MAAd;AACH;;AAED,SAAK6S,UAAL;;AAEA,QAAKtoB,KAAAA,CAAMuoB,iBAAX,EAA+B;AAC3BvoB,MAAAA,KAAAA,CAAMuoB,iBAANvoB,CAAwB,IAAxBA,EAA8BwnB,cAA9BxnB;AACH;AACJ;;2BAEDsoB,mCAAa;AACT;;;;;;;AAOA,SAAKhB,OAAL,GAAgB,KAAKG,MAAL,GAAc,KAAKA,MAAL,GAAc,IAA5B,GAAmC,EAAnD;AACA,SAAKH,OAAL,IAAgB,KAAKlS,IAAL,GAAY,KAAKA,IAAjB,GAAwB,aAAxC;;AACA,QAAK,OAAO,KAAKnK,IAAZ,KAAqB,WAA1B,EAAwC;AACpC,WAAKqc,OAAL,IAAgB,MAAM,KAAKrc,IAAX,GAAkB,GAAlB,GAAwB,KAAKwK,MAA7C;AACH;;AACD,SAAK6R,OAAL,IAAgB,OAAO,KAAKe,MAA5B;;AAGJ;;;;;;;;;;;;;;;;;;;;;;;2BAqBAG,yCAAeJ,OAAO;AAAA,QAAA,KAAA,GAAA,IAAA;;AAClB,QAAK,CAAC,KAAKriB,MAAX,EAAoB,OAAO,EAAP;AAEpB,QAAIgE,GAAAA,GAAM,KAAKhE,MAAf;AACA,QAAK,OAAOqiB,KAAP,KAAiB,WAAtB,EAAoCA,KAAAA,GAAQK,eAAAA,CAAAA,OAAAA,CAAcC,MAAtBN;AACpC,QAAKA,KAAL,EAAare,GAAAA,GAAM,CAAA,GAAA,mBAAA,CAAA,OAAA,EAAkBA,GAAlB,CAANA;AAEb,QAAIO,KAAAA,GAAQP,GAAAA,CAAIzC,KAAJyC,CAAU,OAAVA,CAAZ;AACA,QAAIoc,KAAAA,GAAQllB,IAAAA,CAAK0nB,GAAL1nB,CAAS,KAAKgK,IAAL,GAAY,CAArBhK,EAAwB,CAAxBA,CAAZ;AACA,QAAIkc,GAAAA,GAAQlc,IAAAA,CAAK2nB,GAAL3nB,CAAS,KAAKgK,IAAL,GAAY,CAArBhK,EAAwBqJ,KAAAA,CAAMlO,MAA9B6E,CAAZ;AAEA,QAAI4nB,QAAAA,GAAW1S,MAAAA,CAAOgH,GAAPhH,CAAAA,CAAY/Z,MAA3B;;AAEA,aAAS0sB,IAAT,CAAchD,IAAd,EAAoB;AAChB,UAAKsC,KAAAA,IAAST,OAAAA,CAAAA,OAAAA,CAAMoB,GAApB,EAA0B;AACtB,eAAOpB,OAAAA,CAAAA,OAAAA,CAAMoB,GAANpB,CAAUqB,IAAVrB,CAAe7B,IAAf6B,CAAP;AADJ,OAAA,MAEO;AACH,eAAO7B,IAAP;AACH;AACJ;;AACD,aAASmD,KAAT,CAAenD,IAAf,EAAqB;AACjB,UAAKsC,KAAAA,IAAST,OAAAA,CAAAA,OAAAA,CAAME,IAApB,EAA2B;AACvB,eAAOF,OAAAA,CAAAA,OAAAA,CAAME,IAANF,CAAW7B,IAAX6B,CAAP;AADJ,OAAA,MAEO;AACH,eAAO7B,IAAP;AACH;AACJ;;AAED,WAAOxb,KAAAA,CAAMjG,KAANiG,CAAY6b,KAAZ7b,EAAmB6S,GAAnB7S,EAAwB/C,GAAxB+C,CAA6B,UAACW,IAAD,EAAO9O,KAAP,EAAiB;AACjD,UAAI8P,MAAAA,GAASka,KAAAA,GAAQ,CAARA,GAAYhqB,KAAzB;AACA,UAAI+sB,MAAAA,GAAS,MAAM,CAAC,MAAMjd,MAAP,EAAe5H,KAAf,CAAqB,CAACwkB,QAAtB,CAAN,GAAwC,KAArD;;AACA,UAAK5c,MAAAA,KAAW,KAAA,CAAKhB,IAArB,EAA4B;AACxB,YAAIke,OAAAA,GACAF,KAAAA,CAAMC,MAAAA,CAAOtnB,OAAPsnB,CAAe,KAAfA,EAAsB,GAAtBA,CAAND,CAAAA,GACAhe,IAAAA,CAAK5G,KAAL4G,CAAW,CAAXA,EAAc,KAAA,CAAKwK,MAAL,GAAc,CAA5BxK,EAA+BrJ,OAA/BqJ,CAAuC,QAAvCA,EAAiD,GAAjDA,CAFJ;AAGA,eAAO6d,IAAAA,CAAK,GAALA,CAAAA,GAAYG,KAAAA,CAAMC,MAAND,CAAZH,GAA4B7d,IAA5B6d,GAAmC,KAAnCA,GACAK,OADAL,GACUA,IAAAA,CAAK,GAALA,CADjB;AAJJ,OAAA,MAMO;AACH,eAAO,MAAMG,KAAAA,CAAMC,MAAND,CAAN,GAAsBhe,IAA7B;AACH;AAXE,KAAAX,EAYJlC,IAZIkC,CAYC,IAZDA,CAAP;;AAeJ;;;;;;;;;;;;2BAUArI,+BAAW;AACP,QAAIkI,IAAAA,GAAO,KAAKqe,cAAL,EAAX;;AACA,QAAKre,IAAL,EAAY;AACRA,MAAAA,IAAAA,GAAO,SAASA,IAAT,GAAgB,IAAvBA;AACH;;AACD,WAAO,KAAKiH,IAAL,GAAY,IAAZ,GAAmB,KAAKkW,OAAxB,GAAkCnd,IAAzC;;AAGJ;;;;;;;;;;;;;;;;;kBAeWqd;;;;;;;;;;;;;ACxOf,IAAM4B,UAAAA,GAAa;AACfC,EAAAA,KAAAA,EAAe,IADA;AAEfC,EAAAA,MAAAA,EAAe,MAFA;AAGfC,EAAAA,UAAAA,EAAe,IAHA;AAIfC,EAAAA,UAAAA,EAAe,IAJA;AAKfC,EAAAA,UAAAA,EAAe,GALA;AAMfC,EAAAA,WAAAA,EAAe,IANA;AAOfC,EAAAA,aAAAA,EAAe,IAPA;AAQfC,EAAAA,KAAAA,EAAe,IARA;AASfC,EAAAA,SAAAA,EAAe,EATA;AAUfC,EAAAA,WAAAA,EAAe,GAVA;AAWfC,EAAAA,YAAAA,EAAe;AAXA,CAAnB;;AAcA,SAASC,UAAT,CAAoB3iB,GAApB,EAAyB;AACrB,SAAOA,GAAAA,CAAI,CAAJA,CAAAA,CAAO4iB,WAAP5iB,KAAuBA,GAAAA,CAAIhD,KAAJgD,CAAU,CAAVA,CAA9B;AACH;;IAEK6iB;AAEF,WAAA,WAAA,CAAYC,OAAZ,EAAqB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,WAAA,CAAA;;AACjB,SAAKA,OAAL,GAAeA,OAAf;AACH;;wBAEDvqB,+BAAU2gB,MAAM6J,WAAW;AACvB,SAAK7J,IAAAA,CAAK9c,IAAV,EAAgB8c,IAAhB,EAAsB6J,SAAtB;;;wBAGJnD,qBAAK1G,MAAM;AACP,SAAKngB,IAAL,CAAUmgB,IAAV;AACA,QAAKA,IAAAA,CAAK8J,IAAL9J,CAAUqJ,KAAf,EAAuB,KAAKO,OAAL,CAAa5J,IAAAA,CAAK8J,IAAL9J,CAAUqJ,KAAvB;;;wBAG3BU,2BAAQ/J,MAAM;AACV,QAAIgK,IAAAA,GAAQ,KAAKC,GAAL,CAASjK,IAAT,EAAe,MAAf,EAAwB,aAAxB,CAAZ;AACA,QAAIkK,KAAAA,GAAQ,KAAKD,GAAL,CAASjK,IAAT,EAAe,OAAf,EAAwB,cAAxB,CAAZ;AACA,SAAK4J,OAAL,CAAa,OAAOI,IAAP,GAAchK,IAAAA,CAAKuF,IAAnB,GAA0B2E,KAA1B,GAAkC,IAA/C,EAAqDlK,IAArD;;;wBAGJmK,qBAAKnK,MAAM6J,WAAW;AAClB,QAAIO,OAAAA,GAAU,KAAKH,GAAL,CAASjK,IAAT,EAAe,SAAf,EAA0B,OAA1B,CAAd;AACA,QAAI7e,MAAAA,GAAU6e,IAAAA,CAAKqK,IAALrK,GAAYoK,OAAZpK,GAAsB,KAAKsK,QAAL,CAActK,IAAd,EAAoB,OAApB,CAApC;;AAEA,QAAKA,IAAAA,CAAKuK,SAAV,EAAsB;AAClBppB,MAAAA,MAAAA,IAAU6e,IAAAA,CAAK8J,IAAL9J,CAAUuK,SAAVvK,IAAuB,aAAjC7e;AACH;;AAED,QAAK0oB,SAAL,EAAiB1oB,MAAAA,IAAU,GAAVA;AACjB,SAAKyoB,OAAL,CAAazoB,MAAb,EAAqB6e,IAArB;;;wBAGJwK,qBAAKxK,MAAM;AACP,SAAKyK,KAAL,CAAWzK,IAAX,EAAiB,KAAKsK,QAAL,CAActK,IAAd,EAAoB,UAApB,CAAjB;;AACA,QAAKA,IAAAA,CAAK8J,IAAL9J,CAAU0K,YAAf,EAA8B;AAC1B,WAAKd,OAAL,CAAa5J,IAAAA,CAAK8J,IAAL9J,CAAU0K,YAAvB,EAAqC1K,IAArC,EAA2C,KAA3C;AACH;;;wBAGL2K,yBAAO3K,MAAM6J,WAAW;AACpB,QAAIhZ,IAAAA,GAAS,MAAMmP,IAAAA,CAAKnP,IAAxB;AACA,QAAI+Z,MAAAA,GAAS5K,IAAAA,CAAK4K,MAAL5K,GAAc,KAAKsK,QAAL,CAActK,IAAd,EAAoB,QAApB,CAAdA,GAA8C,EAA3D;;AAEA,QAAK,OAAOA,IAAAA,CAAK8J,IAAL9J,CAAU6K,SAAjB,KAA+B,WAApC,EAAkD;AAC9Cha,MAAAA,IAAAA,IAAQmP,IAAAA,CAAK8J,IAAL9J,CAAU6K,SAAlBha;AADJ,KAAA,MAEO,IAAK+Z,MAAL,EAAc;AACjB/Z,MAAAA,IAAAA,IAAQ,GAARA;AACH;;AAED,QAAKmP,IAAAA,CAAK8K,KAAV,EAAkB;AACd,WAAKL,KAAL,CAAWzK,IAAX,EAAiBnP,IAAAA,GAAO+Z,MAAxB;AADJ,KAAA,MAEO;AACH,UAAIhO,GAAAA,GAAM,CAACoD,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,IAAqB,EAAtB,KAA6B6J,SAAAA,GAAY,GAAZA,GAAkB,EAA/C,CAAV;AACA,WAAKD,OAAL,CAAa/Y,IAAAA,GAAO+Z,MAAP/Z,GAAgB+L,GAA7B,EAAkCoD,IAAlC;AACH;;;wBAGLngB,qBAAKmgB,MAAM;AACP,QAAIhW,IAAAA,GAAOgW,IAAAA,CAAK8K,KAAL9K,CAAWnkB,MAAXmkB,GAAoB,CAA/B;;AACA,WAAQhW,IAAAA,GAAO,CAAf,EAAmB;AACf,UAAKgW,IAAAA,CAAK8K,KAAL9K,CAAWhW,IAAXgW,EAAiB9c,IAAjB8c,KAA0B,SAA/B,EAA2C;AAC3ChW,MAAAA,IAAAA,IAAQ,CAARA;AACH;;AAED,QAAI6f,SAAAA,GAAY,KAAKI,GAAL,CAASjK,IAAT,EAAe,WAAf,CAAhB;;AACA,SAAM,IAAIjkB,CAAAA,GAAI,CAAd,EAAiBA,CAAAA,GAAIikB,IAAAA,CAAK8K,KAAL9K,CAAWnkB,MAAhC,EAAwCE,CAAAA,EAAxC,EAA8C;AAC1C,UAAIgvB,KAAAA,GAAS/K,IAAAA,CAAK8K,KAAL9K,CAAWjkB,CAAXikB,CAAb;AACA,UAAIgL,MAAAA,GAAS,KAAKf,GAAL,CAASc,KAAT,EAAgB,QAAhB,CAAb;AACA,UAAKC,MAAL,EAAc,KAAKpB,OAAL,CAAaoB,MAAb;AACd,WAAK3rB,SAAL,CAAe0rB,KAAf,EAAsB/gB,IAAAA,KAASjO,CAATiO,IAAc6f,SAApC;AACH;;;wBAGLY,uBAAMzK,MAAM4F,OAAO;AACf,QAAIwE,OAAAA,GAAU,KAAKH,GAAL,CAASjK,IAAT,EAAe,SAAf,EAA0B,YAA1B,CAAd;AACA,SAAK4J,OAAL,CAAahE,KAAAA,GAAQwE,OAARxE,GAAkB,GAA/B,EAAoC5F,IAApC,EAA0C,OAA1C;AAEA,QAAIqJ,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,QAAKrJ,IAAAA,CAAK8K,KAAL9K,IAAcA,IAAAA,CAAK8K,KAAL9K,CAAWnkB,MAA9B,EAAuC;AACnC,WAAKgE,IAAL,CAAUmgB,IAAV;AACAqJ,MAAAA,KAAAA,GAAQ,KAAKY,GAAL,CAASjK,IAAT,EAAe,OAAf,CAARqJ;AAFJ,KAAA,MAGO;AACHA,MAAAA,KAAAA,GAAQ,KAAKY,GAAL,CAASjK,IAAT,EAAe,OAAf,EAAwB,WAAxB,CAARqJ;AACH;;AAED,QAAKA,KAAL,EAAa,KAAKO,OAAL,CAAaP,KAAb;AACb,SAAKO,OAAL,CAAa,GAAb,EAAkB5J,IAAlB,EAAwB,KAAxB;;;wBAGJiK,mBAAIjK,MAAMiL,KAAKC,QAAQ;AACnB,QAAIhkB,KAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAK,CAACgkB,MAAN,EAAeA,MAAAA,GAASD,GAATC,CAFI,CAInB;;AACA,QAAKD,GAAL,EAAW;AACP/jB,MAAAA,KAAAA,GAAQ8Y,IAAAA,CAAK8J,IAAL9J,CAAUiL,GAAVjL,CAAR9Y;AACA,UAAK,OAAOA,KAAP,KAAiB,WAAtB,EAAoC,OAAOA,KAAP;AACvC;;AAED,QAAIikB,MAAAA,GAASnL,IAAAA,CAAKmL,MAAlB,CAVmB,CAYnB;;AACA,QAAKD,MAAAA,KAAW,QAAhB,EAA2B;AACvB,UAAK,CAACC,MAAD,IAAWA,MAAAA,CAAOjoB,IAAPioB,KAAgB,MAAhBA,IAA0BA,MAAAA,CAAOC,KAAPD,KAAiBnL,IAA3D,EAAkE;AAC9D,eAAO,EAAP;AACH;AACJ,KAjBkB,CAmBnB;;;AACA,QAAK,CAACmL,MAAN,EAAe,OAAOtC,UAAAA,CAAWqC,MAAXrC,CAAP,CApBI,CAsBnB;;AACA,QAAInC,IAAAA,GAAO1G,IAAAA,CAAK0G,IAAL1G,EAAX;AACA,QAAK,CAAC0G,IAAAA,CAAK2E,QAAX,EAAsB3E,IAAAA,CAAK2E,QAAL3E,GAAgB,EAAhBA;;AACtB,QAAK,OAAOA,IAAAA,CAAK2E,QAAL3E,CAAcwE,MAAdxE,CAAP,KAAiC,WAAtC,EAAoD;AAChD,aAAOA,IAAAA,CAAK2E,QAAL3E,CAAcwE,MAAdxE,CAAP;AACH;;AAED,QAAKwE,MAAAA,KAAW,QAAXA,IAAuBA,MAAAA,KAAW,OAAvC,EAAiD;AAC7C,aAAO,KAAKI,WAAL,CAAiBtL,IAAjB,EAAuBkL,MAAvB,CAAP;AADJ,KAAA,MAEO;AACH,UAAIK,MAAAA,GAAS,QAAQ9B,UAAAA,CAAWyB,MAAXzB,CAArB;;AACA,UAAK,KAAK8B,MAAL,CAAL,EAAoB;AAChBrkB,QAAAA,KAAAA,GAAQ,KAAKqkB,MAAL,EAAa7E,IAAb,EAAmB1G,IAAnB,CAAR9Y;AADJ,OAAA,MAEO;AACHwf,QAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZxf,UAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOkvB,GAAPlvB,CAARmL;AACA,cAAK,OAAOA,KAAP,KAAiB,WAAtB,EAAoC,OAAO,KAAP;AAFxC,SAAAwf;AAIH;AACJ;;AAED,QAAK,OAAOxf,KAAP,KAAiB,WAAtB,EAAoCA,KAAAA,GAAQ2hB,UAAAA,CAAWqC,MAAXrC,CAAR3hB;AAEpCwf,IAAAA,IAAAA,CAAK2E,QAAL3E,CAAcwE,MAAdxE,IAAwBxf,KAAxBwf;AACA,WAAOxf,KAAP;;;wBAGJskB,qCAAa9E,MAAM;AACf,QAAIxf,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZ,UAAK3qB,CAAAA,CAAE+uB,KAAF/uB,IAAWA,CAAAA,CAAE+uB,KAAF/uB,CAAQF,MAAnBE,IAA6BA,CAAAA,CAAEiO,IAAFjO,CAAOmH,IAAPnH,KAAgB,MAAlD,EAA2D;AACvDmL,QAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAO8tB,SAAf3iB;AACA,YAAK,OAAOA,KAAP,KAAiB,WAAtB,EAAoC,OAAO,KAAP;AACvC;AAJL,KAAAwf;AAMA,WAAOxf,KAAP;;;wBAGJukB,qCAAa/E,MAAM;AACf,QAAIxf,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZ,UAAK3qB,CAAAA,CAAE+uB,KAAF/uB,IAAWA,CAAAA,CAAE+uB,KAAF/uB,CAAQF,MAARE,KAAmB,CAAnC,EAAuC;AACnCmL,QAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOstB,KAAfniB;AACA,YAAK,OAAOA,KAAP,KAAiB,WAAtB,EAAoC,OAAO,KAAP;AACvC;AAJL,KAAAwf;AAMA,WAAOxf,KAAP;;;wBAGJwkB,+BAAUhF,MAAM;AACZ,QAAKA,IAAAA,CAAKoD,IAALpD,CAAUqC,MAAf,EAAwB,OAAOrC,IAAAA,CAAKoD,IAALpD,CAAUqC,MAAjB;AACxB,QAAI7hB,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZ,UAAIpN,CAAAA,GAAIvd,CAAAA,CAAEovB,MAAV;;AACA,UAAK7R,CAAAA,IAAKA,CAAAA,KAAMoN,IAAXpN,IAAmBA,CAAAA,CAAE6R,MAArB7R,IAA+BA,CAAAA,CAAE6R,MAAF7R,KAAaoN,IAAjD,EAAwD;AACpD,YAAK,OAAO3qB,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAd,KAAyB,WAA9B,EAA4C;AACxC,cAAI/b,KAAAA,GAAQlT,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAPjvB,CAAcgL,KAAdhL,CAAoB,IAApBA,CAAZ;AACAmL,UAAAA,KAAAA,GAAQ+H,KAAAA,CAAMA,KAAAA,CAAMpT,MAANoT,GAAe,CAArBA,CAAR/H;AACAA,UAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,QAAdA,EAAwB,EAAxBA,CAARA;AACA,iBAAO,KAAP;AACH;AACJ;AATL,KAAAwf;AAWA,WAAOxf,KAAP;;;wBAGJykB,6CAAiBjF,MAAM1G,MAAM;AACzB,QAAI9Y,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKkF,YAALlF,CAAmB,UAAA,CAAA,EAAK;AACpB,UAAK,OAAO3qB,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAd,KAAyB,WAA9B,EAA4C;AACxC9jB,QAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAf9jB;;AACA,YAAKA,KAAAA,CAAMrB,OAANqB,CAAc,IAAdA,MAAwB,CAAC,CAA9B,EAAkC;AAC9BA,UAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,SAAdA,EAAyB,EAAzBA,CAARA;AACH;;AACD,eAAO,KAAP;AACH;AAPL,KAAAwf;;AASA,QAAK,OAAOxf,KAAP,KAAiB,WAAtB,EAAoC;AAChCA,MAAAA,KAAAA,GAAQ,KAAK+iB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,YAArB,CAAR9Y;AADJ,KAAA,MAEO,IAAKA,KAAL,EAAa;AAChBA,MAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,QAAdA,EAAwB,EAAxBA,CAARA;AACH;;AACD,WAAOA,KAAP;;;wBAGJ2kB,uCAAcnF,MAAM1G,MAAM;AACtB,QAAI9Y,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKoF,SAALpF,CAAgB,UAAA,CAAA,EAAK;AACjB,UAAK,OAAO3qB,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAd,KAAyB,WAA9B,EAA4C;AACxC9jB,QAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAf9jB;;AACA,YAAKA,KAAAA,CAAMrB,OAANqB,CAAc,IAAdA,MAAwB,CAAC,CAA9B,EAAkC;AAC9BA,UAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,SAAdA,EAAyB,EAAzBA,CAARA;AACH;;AACD,eAAO,KAAP;AACH;AAPL,KAAAwf;;AASA,QAAK,OAAOxf,KAAP,KAAiB,WAAtB,EAAoC;AAChCA,MAAAA,KAAAA,GAAQ,KAAK+iB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,YAArB,CAAR9Y;AADJ,KAAA,MAEO,IAAKA,KAAL,EAAa;AAChBA,MAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,QAAdA,EAAwB,EAAxBA,CAARA;AACH;;AACD,WAAOA,KAAP;;;wBAGJ6kB,uCAAcrF,MAAM;AAChB,QAAIxf,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZ,UAAK3qB,CAAAA,CAAE+uB,KAAF/uB,KAAYA,CAAAA,CAAEovB,MAAFpvB,KAAa2qB,IAAb3qB,IAAqB2qB,IAAAA,CAAK0E,KAAL1E,KAAe3qB,CAAhDA,CAAL,EAA0D;AACtD,YAAK,OAAOA,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAd,KAAyB,WAA9B,EAA4C;AACxC9jB,UAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAf9jB;;AACA,cAAKA,KAAAA,CAAMrB,OAANqB,CAAc,IAAdA,MAAwB,CAAC,CAA9B,EAAkC;AAC9BA,YAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,SAAdA,EAAyB,EAAzBA,CAARA;AACH;;AACD,iBAAO,KAAP;AACH;AACJ;AATL,KAAAwf;AAWA,QAAKxf,KAAL,EAAaA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,QAAdA,EAAwB,EAAxBA,CAARA;AACb,WAAOA,KAAP;;;wBAGJ8kB,yCAAetF,MAAM;AACjB,QAAIxf,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZ,UAAK3qB,CAAAA,CAAE+uB,KAAF/uB,IAAWA,CAAAA,CAAE+uB,KAAF/uB,CAAQF,MAARE,GAAiB,CAAjC,EAAqC;AACjC,YAAK,OAAOA,CAAAA,CAAE+tB,IAAF/tB,CAAOstB,KAAd,KAAwB,WAA7B,EAA2C;AACvCniB,UAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOstB,KAAfniB;;AACA,cAAKA,KAAAA,CAAMrB,OAANqB,CAAc,IAAdA,MAAwB,CAAC,CAA9B,EAAkC;AAC9BA,YAAAA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,SAAdA,EAAyB,EAAzBA,CAARA;AACH;;AACD,iBAAO,KAAP;AACH;AACJ;AATL,KAAAwf;AAWA,QAAKxf,KAAL,EAAaA,KAAAA,GAAQA,KAAAA,CAAM7F,OAAN6F,CAAc,QAAdA,EAAwB,EAAxBA,CAARA;AACb,WAAOA,KAAP;;;wBAGJ+kB,uCAAcvF,MAAM;AAChB,QAAIxf,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKzF,IAALyF,CAAW,UAAA,CAAA,EAAK;AACZ,UAAK3qB,CAAAA,CAAEmH,IAAFnH,KAAW,MAAhB,EAAyB;AACrBmL,QAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOquB,OAAfljB;AACA,YAAK,OAAOA,KAAP,KAAiB,WAAtB,EAAoC,OAAO,KAAP;AACvC;AAJL,KAAAwf;AAMA,WAAOxf,KAAP;;;wBAGJglB,6BAASxF,MAAM;AACX,QAAIxf,KAAAA,GAAAA,KAAAA,CAAJ;AACAwf,IAAAA,IAAAA,CAAKoF,SAALpF,CAAgB,UAAA,CAAA,EAAK;AACjB,UAAK,OAAO3qB,CAAAA,CAAE+tB,IAAF/tB,CAAOquB,OAAd,KAA0B,WAA/B,EAA6C;AACzCljB,QAAAA,KAAAA,GAAQnL,CAAAA,CAAE+tB,IAAF/tB,CAAOquB,OAAPruB,CAAesF,OAAftF,CAAuB,SAAvBA,EAAkC,EAAlCA,CAARmL;AACA,eAAO,KAAP;AACH;AAJL,KAAAwf;AAMA,WAAOxf,KAAP;;;wBAGJokB,mCAAYtL,MAAMkL,QAAQ;AACtB,QAAIhkB,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,QAAK8Y,IAAAA,CAAK9c,IAAL8c,KAAc,MAAnB,EAA4B;AACxB9Y,MAAAA,KAAAA,GAAQ,KAAK+iB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,YAArB,CAAR9Y;AADJ,KAAA,MAEO,IAAK8Y,IAAAA,CAAK9c,IAAL8c,KAAc,SAAnB,EAA+B;AAClC9Y,MAAAA,KAAAA,GAAQ,KAAK+iB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,eAArB,CAAR9Y;AADG,KAAA,MAEA,IAAKgkB,MAAAA,KAAW,QAAhB,EAA2B;AAC9BhkB,MAAAA,KAAAA,GAAQ,KAAK+iB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,YAArB,CAAR9Y;AADG,KAAA,MAEA;AACHA,MAAAA,KAAAA,GAAQ,KAAK+iB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,aAArB,CAAR9Y;AACH;;AAED,QAAIilB,GAAAA,GAAQnM,IAAAA,CAAKmL,MAAjB;AACA,QAAIiB,KAAAA,GAAQ,CAAZ;;AACA,WAAQD,GAAAA,IAAOA,GAAAA,CAAIjpB,IAAJipB,KAAa,MAA5B,EAAqC;AACjCC,MAAAA,KAAAA,IAAS,CAATA;AACAD,MAAAA,GAAAA,GAAMA,GAAAA,CAAIhB,MAAVgB;AACH;;AAED,QAAKjlB,KAAAA,CAAMrB,OAANqB,CAAc,IAAdA,MAAwB,CAAC,CAA9B,EAAkC;AAC9B,UAAI6hB,MAAAA,GAAS,KAAKkB,GAAL,CAASjK,IAAT,EAAe,IAAf,EAAqB,QAArB,CAAb;;AACA,UAAK+I,MAAAA,CAAOltB,MAAZ,EAAqB;AACjB,aAAM,IAAIwwB,IAAAA,GAAO,CAAjB,EAAoBA,IAAAA,GAAOD,KAA3B,EAAkCC,IAAAA,EAAlC,EAAA;AAA2CnlB,UAAAA,KAAAA,IAAS6hB,MAAT7hB;AAA3C;AACH;AACJ;;AAED,WAAOA,KAAP;;;wBAGJojB,6BAAStK,MAAMqK,MAAM;AACjB,QAAInjB,KAAAA,GAAQ8Y,IAAAA,CAAKqK,IAALrK,CAAZ;AACA,QAAIiK,GAAAA,GAAQjK,IAAAA,CAAK8J,IAAL9J,CAAUqK,IAAVrK,CAAZ;;AACA,QAAKiK,GAAAA,IAAOA,GAAAA,CAAI/iB,KAAJ+iB,KAAc/iB,KAA1B,EAAkC;AAC9B,aAAO+iB,GAAAA,CAAIA,GAAX;AADJ,KAAA,MAEO;AACH,aAAO/iB,KAAP;AACH;;;;;;kBAKMyiB;;;;;;kBCzUStqB;;AAFxB,IAAA,YAAA,GAAA,OAAA,CAAA,eAAA,CAAA;;;;;;;;;;AAEe,SAASA,SAAT,CAAmB2gB,IAAnB,EAAyB4J,OAAzB,EAAkC;AAC7C,MAAI9iB,GAAAA,GAAM,IAAI6iB,aAAAA,CAAAA,OAAJ,CAAgBC,OAAhB,CAAV;AACA9iB,EAAAA,GAAAA,CAAIzH,SAAJyH,CAAckZ,IAAdlZ;AACH;;;;;;;kBCHuBwlB;AAFxB,IAAIC,OAAAA,GAAU,EAAd;;AAEe,SAASD,QAAT,CAAkBvF,OAAlB,EAA2B;AACtC,MAAKwF,OAAAA,CAAQxF,OAARwF,CAAL,EAAwB;AACxBA,EAAAA,OAAAA,CAAQxF,OAARwF,CAAAA,GAAmB,IAAnBA;AAEA,MAAK,OAAOnoB,OAAP,KAAmB,WAAnB,IAAkCA,OAAAA,CAAQooB,IAA/C,EAAsDpoB,OAAAA,CAAQooB,IAARpoB,CAAa2iB,OAAb3iB;AACzD;;;;;;;;;;;;;;;;ACPD,IAAA,eAAA,GAAA,OAAA,CAAA,oBAAA,CAAA;;;;AACA,IAAA,YAAA,GAAA,OAAA,CAAA,eAAA,CAAA;;;;AACA,IAAA,UAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;AACA,IAAA,SAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;;;;;;;;;;;;;AAEA,IAAIqoB,SAAAA,GAAY,SAAZA,SAAY,CAAU9wB,GAAV,EAAewvB,MAAf,EAAuB;AACnC,MAAIuB,MAAAA,GAAS,IAAI/wB,GAAAA,CAAI2iB,WAAR,EAAb;;AAEA,OAAM,IAAIviB,CAAV,IAAeJ,GAAf,EAAqB;AACjB,QAAK,CAACA,GAAAA,CAAI0J,cAAJ1J,CAAmBI,CAAnBJ,CAAN,EAA8B;AAC9B,QAAIuL,KAAAA,GAAQvL,GAAAA,CAAII,CAAJJ,CAAZ;AACA,QAAIuH,IAAAA,GAAAA,OAAegE,KAAfhE,KAAA,WAAAA,GAAA,WAAAA,GAAA,OAAA,CAAegE,KAAf,CAAJ;;AAEA,QAAKnL,CAAAA,KAAM,QAANA,IAAkBmH,IAAAA,KAAS,QAAhC,EAA2C;AACvC,UAAIioB,MAAJ,EAAYuB,MAAAA,CAAO3wB,CAAP2wB,CAAAA,GAAYvB,MAAZuB;AADhB,KAAA,MAEO,IAAK3wB,CAAAA,KAAM,QAAX,EAAsB;AACzB2wB,MAAAA,MAAAA,CAAO3wB,CAAP2wB,CAAAA,GAAYxlB,KAAZwlB;AADG,KAAA,MAEA,IAAKxlB,KAAAA,YAAiBrD,KAAtB,EAA8B;AACjC6oB,MAAAA,MAAAA,CAAO3wB,CAAP2wB,CAAAA,GAAYxlB,KAAAA,CAAMF,GAANE,CAAW,UAAA,CAAA,EAAA;AAAA,eAAKulB,SAAAA,CAAU/S,CAAV+S,EAAaC,MAAbD,CAAL;AAAX,OAAAvlB,CAAZwlB;AADG,KAAA,MAEA;AACH,UAAKxpB,IAAAA,KAAS,QAATA,IAAqBgE,KAAAA,KAAU,IAApC,EAA2CA,KAAAA,GAAQulB,SAAAA,CAAUvlB,KAAVulB,CAARvlB;AAC3CwlB,MAAAA,MAAAA,CAAO3wB,CAAP2wB,CAAAA,GAAYxlB,KAAZwlB;AACH;AACJ;;AAED,SAAOA,MAAP;AApBJ,CAAA;AAuBA;;;;;;;IAKMC;AAEF;;;AAGA,WAAA,IAAA,GAA4B;AAAA,QAAhBC,QAAgB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,IAAA,CAAA;;AACxB,SAAK9C,IAAL,GAAY,EAAZ;;AACA,QAAK,CAAA,OAAO8C,QAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,QAAP,CAAA,MAAoB,QAApB,IAAgC,OAAOA,QAAP,KAAoB,WAAzD,EAAuE;AACnE,YAAM,IAAIntB,KAAJ,CACF,mDACAL,IAAAA,CAAKC,SAALD,CAAewtB,QAAfxtB,CAFE,CAAN;AAGH;;AACD,SAAM,IAAIyR,IAAV,IAAkB+b,QAAlB,EAA6B;AACzB,WAAK/b,IAAL,IAAa+b,QAAAA,CAAS/b,IAAT+b,CAAb;AACH;AACJ;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAgCAtpB,uBAAMyjB,SAAqB;AAAA,QAAZ7B,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;;AACvB,QAAK,KAAK1f,MAAV,EAAmB;AACf,UAAImF,GAAAA,GAAM,KAAKkiB,UAAL,CAAgB3H,IAAhB,CAAV;AACA,aAAO,KAAK1f,MAAL,CAAY8D,KAAZ,CAAkBhG,KAAlB,CAAwByjB,OAAxB,EAAiCpc,GAAAA,CAAID,IAArC,EAA2CC,GAAAA,CAAIuK,MAA/C,EAAuDgQ,IAAvD,CAAP;AAFJ,KAAA,MAGO;AACH,aAAO,IAAI+B,gBAAAA,CAAAA,OAAJ,CAAmBF,OAAnB,CAAP;AACH;;AAGL;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAyBAyF,qBAAK9e,QAAQ6X,MAAML,MAAM;AACrB,QAAI4H,IAAAA,GAAO;AAAE9M,MAAAA,IAAAA,EAAM;AAAR,KAAX;;AACA,SAAM,IAAIjkB,CAAV,IAAempB,IAAf,EAAA;AAAsB4H,MAAAA,IAAAA,CAAK/wB,CAAL+wB,CAAAA,GAAU5H,IAAAA,CAAKnpB,CAALmpB,CAAV4H;AACtB;;AAAA,WAAOpf,MAAAA,CAAO8e,IAAP9e,CAAY6X,IAAZ7X,EAAkBof,IAAlBpf,CAAP;;AAGJ;;;;;;;;;;;;;iBAWAqf,2BAAS;AACL,QAAK,KAAK5B,MAAV,EAAmB;AACf,WAAKA,MAAL,CAAY6B,WAAZ,CAAwB,IAAxB;AACH;;AACD,SAAK7B,MAAL,GAAc5oB,SAAd;AACA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;iBAWAb,+BAAkC;AAAA,QAAzBurB,WAAyB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAX5tB,WAAAA,CAAAA,OAAW;AAC9B,QAAK4tB,WAAAA,CAAY5tB,SAAjB,EAA6B4tB,WAAAA,GAAcA,WAAAA,CAAY5tB,SAA1B4tB;AAC7B,QAAIvf,MAAAA,GAAU,EAAd;AACAuf,IAAAA,WAAAA,CAAY,IAAZA,EAAkB,UAAA,CAAA,EAAK;AACnBvf,MAAAA,MAAAA,IAAU3R,CAAV2R;AADJ,KAAAuf,CAAAA;AAGA,WAAOvf,MAAP;;AAGJ;;;;;;;;;;;;;;;;;;iBAgBAwf,yBAAuB;AAAA,QAAjBC,SAAiB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;AACnB,QAAIT,MAAAA,GAASD,SAAAA,CAAU,IAAVA,CAAb;;AACA,SAAM,IAAI5b,IAAV,IAAkBsc,SAAlB,EAA8B;AAC1BT,MAAAA,MAAAA,CAAO7b,IAAP6b,CAAAA,GAAeS,SAAAA,CAAUtc,IAAVsc,CAAfT;AACH;;AACD,WAAOA,MAAP;;AAGJ;;;;;;;;;;;;;iBAWAU,qCAA6B;AAAA,QAAjBD,SAAiB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;AACzB,QAAIT,MAAAA,GAAS,KAAKQ,KAAL,CAAWC,SAAX,CAAb;AACA,SAAKhC,MAAL,CAAYkC,YAAZ,CAAyB,IAAzB,EAA+BX,MAA/B;AACA,WAAOA,MAAP;;AAGJ;;;;;;;;;;iBAQAY,mCAA4B;AAAA,QAAjBH,SAAiB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;AACxB,QAAIT,MAAAA,GAAS,KAAKQ,KAAL,CAAWC,SAAX,CAAb;AACA,SAAKhC,MAAL,CAAYoC,WAAZ,CAAwB,IAAxB,EAA8Bb,MAA9B;AACA,WAAOA,MAAP;;AAGJ;;;;;;;;;;;;;;iBAYAc,qCAAsB;AAClB,QAAI,KAAKrC,MAAT,EAAiB;AAAA,WAAA,IAAA,IAAA,GAAA,SAAA,CAAA,MAAA,EADNL,KACM,GAAA,KAAA,CAAA,IAAA,CAAA,EAAA,IAAA,GAAA,CAAA,EAAA,IAAA,GAAA,IAAA,EAAA,IAAA,EAAA,EAAA;AADNA,QAAAA,KACM,CAAA,IAAA,CADNA,GACM,SAAA,CAAA,IAAA,CADNA;AACM;;AACb,WAAA,IAAA,SAAA,GAAiBA,KAAjB,EAAA,QAAA,GAAA,KAAA,CAAA,OAAA,CAAA,SAAA,CAAA,EAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,QAAA,GAAA,SAAA,GAAA,SAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAwB;AAAA,YAAA,IAAA;;AAAA,YAAA,QAAA,EAAA;AAAA,cAAA,EAAA,IAAA,SAAA,CAAA,MAAA,EAAA;AAAA,UAAA,IAAA,GAAA,SAAA,CAAA,EAAA,EAAA,CAAA;AAAA,SAAA,MAAA;AAAA,UAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA;AAAA,cAAA,EAAA,CAAA,IAAA,EAAA;AAAA,UAAA,IAAA,GAAA,EAAA,CAAA,KAAA;AAAA;;AAAA,YAAf9K,IAAe,GAAA,IAAA;AACpB,aAAKmL,MAAL,CAAYkC,YAAZ,CAAyB,IAAzB,EAA+BrN,IAA/B;AACH;;AAED,WAAK+M,MAAL;AACH;;AAED,WAAO,IAAP;;;iBAGJU,yBAAOC,WAAW;AACd,KAAA,GAAA,UAAA,CAAA,OAAA,EAAS,mDAAT;AACA,SAAKC,SAAL,CAAe,KAAKjH,IAAL,OAAgBgH,SAAAA,CAAUhH,IAAVgH,EAA/B;AACA,SAAKX,MAAL;AACAW,IAAAA,SAAAA,CAAUE,MAAVF,CAAiB,IAAjBA;AACA,WAAO,IAAP;;;iBAGJG,iCAAWC,WAAW;AAClB,KAAA,GAAA,UAAA,CAAA,OAAA,EAAS,kDAAT;AACA,SAAKH,SAAL,CAAe,KAAKjH,IAAL,OAAgBoH,SAAAA,CAAUpH,IAAVoH,EAA/B;AACA,SAAKf,MAAL;AACAe,IAAAA,SAAAA,CAAU3C,MAAV2C,CAAiBT,YAAjBS,CAA8BA,SAA9BA,EAAyC,IAAzCA;AACA,WAAO,IAAP;;;iBAGJC,+BAAUD,WAAW;AACjB,KAAA,GAAA,UAAA,CAAA,OAAA,EAAS,gDAAT;AACA,SAAKH,SAAL,CAAe,KAAKjH,IAAL,OAAgBoH,SAAAA,CAAUpH,IAAVoH,EAA/B;AACA,SAAKf,MAAL;AACAe,IAAAA,SAAAA,CAAU3C,MAAV2C,CAAiBP,WAAjBO,CAA6BA,SAA7BA,EAAwC,IAAxCA;AACA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;;;iBAcAjkB,uBAAO;AACH,QAAK,CAAC,KAAKshB,MAAX,EAAoB,OAAO5oB,SAAP;AACpB,QAAI3G,KAAAA,GAAQ,KAAKuvB,MAAL,CAAYvvB,KAAZ,CAAkB,IAAlB,CAAZ;AACA,WAAO,KAAKuvB,MAAL,CAAYL,KAAZ,CAAkBlvB,KAAAA,GAAQ,CAA1B,CAAP;;AAGJ;;;;;;;;;;;;;;iBAYA2O,uBAAO;AACH,QAAK,CAAC,KAAK4gB,MAAX,EAAoB,OAAO5oB,SAAP;AACpB,QAAI3G,KAAAA,GAAQ,KAAKuvB,MAAL,CAAYvvB,KAAZ,CAAkB,IAAlB,CAAZ;AACA,WAAO,KAAKuvB,MAAL,CAAYL,KAAZ,CAAkBlvB,KAAAA,GAAQ,CAA1B,CAAP;;AAGJ;;;;;;;;;;;;;;iBAYAovB,yBAAO7kB,KAAK;AACR,SAAKglB,MAAL,CAAYkC,YAAZ,CAAyB,IAAzB,EAA+BlnB,GAA/B;AACA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;iBAYAkjB,uBAAMljB,KAAK;AACP,SAAKglB,MAAL,CAAYoC,WAAZ,CAAwB,IAAxB,EAA8BpnB,GAA9B;AACA,WAAO,IAAP;;;iBAGJsR,2BAAS;AACL,QAAIuW,KAAAA,GAAQ,EAAZ;;AAEA,SAAM,IAAInd,IAAV,IAAkB,IAAlB,EAAyB;AACrB,UAAK,CAAC,KAAKxL,cAAL,CAAoBwL,IAApB,CAAN,EAAkC;AAClC,UAAKA,IAAAA,KAAS,QAAd,EAAyB;AACzB,UAAI3J,KAAAA,GAAQ,KAAK2J,IAAL,CAAZ;;AAEA,UAAK3J,KAAAA,YAAiBrD,KAAtB,EAA8B;AAC1BmqB,QAAAA,KAAAA,CAAMnd,IAANmd,CAAAA,GAAc9mB,KAAAA,CAAMF,GAANE,CAAW,UAAA,CAAA,EAAK;AAC1B,cAAK,CAAA,OAAOnL,CAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,CAAP,CAAA,MAAa,QAAb,IAAyBA,CAAAA,CAAE0b,MAAhC,EAAyC;AACrC,mBAAO1b,CAAAA,CAAE0b,MAAF1b,EAAP;AADJ,WAAA,MAEO;AACH,mBAAOA,CAAP;AACH;AALS,SAAAmL,CAAd8mB;AADJ,OAAA,MAQO,IAAK,CAAA,OAAO9mB,KAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,KAAP,CAAA,MAAiB,QAAjB,IAA6BA,KAAAA,CAAMuQ,MAAxC,EAAiD;AACpDuW,QAAAA,KAAAA,CAAMnd,IAANmd,CAAAA,GAAc9mB,KAAAA,CAAMuQ,MAANvQ,EAAd8mB;AADG,OAAA,MAEA;AACHA,QAAAA,KAAAA,CAAMnd,IAANmd,CAAAA,GAAc9mB,KAAd8mB;AACH;AACJ;;AAED,WAAOA,KAAP;;AAGJ;;;;;;;;;;;;;;;;;;;;iBAkBA/D,mBAAII,MAAM4D,aAAa;AACnB,QAAInnB,GAAAA,GAAM,IAAI6iB,aAAAA,CAAAA,OAAJ,EAAV;AACA,WAAO7iB,GAAAA,CAAImjB,GAAJnjB,CAAQ,IAARA,EAAcujB,IAAdvjB,EAAoBmnB,WAApBnnB,CAAP;;AAGJ;;;;;;;;;;iBAQA4f,uBAAO;AACH,QAAIhZ,MAAAA,GAAS,IAAb;;AACA,WAAQA,MAAAA,CAAOyd,MAAf,EAAA;AAAwBzd,MAAAA,MAAAA,GAASA,MAAAA,CAAOyd,MAAhBzd;AACxB;;AAAA,WAAOA,MAAP;;;iBAGJigB,+BAAUO,aAAa;AACnB,WAAO,KAAKpE,IAAL,CAAUkB,MAAjB;AACA,WAAO,KAAKlB,IAAL,CAAUT,KAAjB;AACA,QAAK,CAAC6E,WAAN,EAAoB,OAAO,KAAKpE,IAAL,CAAUM,OAAjB;;;iBAGxB+D,yCAAevyB,OAAO;AAClB,QAAIuF,MAAAA,GAAS,KAAKO,QAAL,EAAb;AACA,QAAIwT,MAAAA,GAAS,KAAK1P,MAAL,CAAYogB,KAAZ,CAAkB1Q,MAA/B;AACA,QAAIxK,IAAAA,GAAS,KAAKlF,MAAL,CAAYogB,KAAZ,CAAkBlb,IAA/B;;AAEA,SAAM,IAAI3O,CAAAA,GAAI,CAAd,EAAiBA,CAAAA,GAAIH,KAArB,EAA4BG,CAAAA,EAA5B,EAAkC;AAC9B,UAAKoF,MAAAA,CAAOpF,CAAPoF,CAAAA,KAAc,IAAnB,EAA0B;AACtB+T,QAAAA,MAAAA,GAAS,CAATA;AACAxK,QAAAA,IAAAA,IAAS,CAATA;AAFJ,OAAA,MAGO;AACHwK,QAAAA,MAAAA,IAAU,CAAVA;AACH;AACJ;;AAED,WAAO;AAAExK,MAAAA,IAAAA,EAAAA,IAAF;AAAQwK,MAAAA,MAAAA,EAAAA;AAAR,KAAP;;;iBAGJ2X,iCAAW3H,MAAM;AACb,QAAIva,GAAAA,GAAM,KAAKnF,MAAL,CAAYogB,KAAtB;;AACA,QAAKV,IAAAA,CAAKtpB,KAAV,EAAkB;AACd+O,MAAAA,GAAAA,GAAM,KAAKwjB,cAAL,CAAoBjJ,IAAAA,CAAKtpB,KAAzB,CAAN+O;AADJ,KAAA,MAEO,IAAKua,IAAAA,CAAKkJ,IAAV,EAAiB;AACpB,UAAIxyB,KAAAA,GAAQ,KAAK8F,QAAL,GAAgBmE,OAAhB,CAAwBqf,IAAAA,CAAKkJ,IAA7B,CAAZ;AACA,UAAKxyB,KAAAA,KAAU,CAAC,CAAhB,EAAoB+O,GAAAA,GAAM,KAAKwjB,cAAL,CAAoBvyB,KAApB,CAAN+O;AACvB;;AACD,WAAOA,GAAP;;AAGJ;;;;;;;;;;AAUA;;;;;;;;AAQA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBAoCWgiB;AAEf;;;;;;AAMA;;;;;;;;;;;;;;;ACphBA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;;;IAWM0B;;;AAEF,WAAA,WAAA,CAAYzB,QAAZ,EAAsB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,WAAA,CAAA;;AAAA,QAAA,KAAA,GAAA,0BAAA,CAAA,IAAA,EAClB,KAAA,CAAA,IAAA,CAAA,IAAA,EAAMA,QAAN,CADkB,CAAA;;AAElB,IAAA,KAAA,CAAK1pB,IAAL,GAAY,MAAZ;AAFkB,WAAA,KAAA;AAGrB;AAED;;;;;;;;;;AAUA;;;;;;;;;;AAUA;;;;;;;;;;;AAWA;;;;;;;;;;;;;;;;;;;;;;;;;;;EAtCsBypB,MAAAA,CAAAA;;kBAiEX0B;;;;;;;;AC9Ef,IAAA,UAAA,GAAA,OAAA,CAAA,YAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,MAAA,CAAA;;;;;;;;;;;;;;;;IAEqBC;AAEjB,WAAA,YAAA,CAAYjvB,SAAZ,EAAuBqnB,IAAvB,EAA6BxB,IAA7B,EAAmC;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,YAAA,CAAA;;AAC/B,SAAK7lB,SAAL,GAAiBA,SAAjB;AACA,SAAKkvB,OAAL,GAAiBrJ,IAAAA,CAAKle,GAALke,IAAY,EAA7B;AACA,SAAKwB,IAAL,GAAiBA,IAAjB;AACA,SAAKxB,IAAL,GAAiBA,IAAjB;AACH;;yBAEDsB,yBAAQ;AACJ,QAAK,OAAO,KAAKtB,IAAL,CAAUle,GAAjB,KAAyB,WAA9B,EAA4C;AACxC,aAAO,CAAC,CAAC,KAAKke,IAAL,CAAUle,GAAnB;AADJ,KAAA,MAEO;AACH,aAAO,KAAKwnB,QAAL,GAAgB3yB,MAAhB,GAAyB,CAAhC;AACH;;;yBAGL2yB,+BAAW;AAAA,QAAA,KAAA,GAAA,IAAA;;AACP,QAAK,CAAC,KAAKC,YAAX,EAA0B;AACtB,WAAKA,YAAL,GAAoB,EAApB;AACA,WAAK/H,IAAL,CAAUzF,IAAV,CAAgB,UAAA,IAAA,EAAQ;AACpB,YAAKjB,IAAAA,CAAKxa,MAALwa,IAAeA,IAAAA,CAAKxa,MAALwa,CAAY1W,KAAZ0W,CAAkBhZ,GAAtC,EAA4C;AACxC,cAAIA,GAAAA,GAAMgZ,IAAAA,CAAKxa,MAALwa,CAAY1W,KAAZ0W,CAAkBhZ,GAA5B;;AACA,cAAK,KAAA,CAAKynB,YAAL,CAAkB5oB,OAAlB,CAA0BmB,GAA1B,MAAmC,CAAC,CAAzC,EAA6C;AACzC,YAAA,KAAA,CAAKynB,YAAL,CAAkBhzB,IAAlB,CAAuBuL,GAAvB;AACH;AACJ;AANL,OAAA;AAQH;;AAED,WAAO,KAAKynB,YAAZ;;;yBAGJC,+BAAW;AACP,QAAK,OAAO,KAAKH,OAAL,CAAanJ,MAApB,KAA+B,WAApC,EAAkD;AAC9C,aAAO,KAAKmJ,OAAL,CAAanJ,MAApB;AACH;;AAED,QAAIE,UAAAA,GAAa,KAAKiJ,OAAL,CAAajJ,UAA9B;;AACA,QAAK,OAAOA,UAAP,KAAsB,WAAtB,IAAqCA,UAAAA,KAAe,IAAzD,EAAgE;AAC5D,aAAO,KAAP;AACH;;AAED,QAAK,KAAKkJ,QAAL,GAAgB3yB,MAArB,EAA8B;AAC1B,aAAO,KAAK2yB,QAAL,GAAgB9Q,IAAhB,CAAsB,UAAA,CAAA,EAAA;AAAA,eAAK3hB,CAAAA,CAAEqpB,MAAP;AAAtB,OAAA,CAAP;AADJ,KAAA,MAEO;AACH,aAAO,IAAP;AACH;;;yBAGLuJ,+CAAmB;AACf,QAAK,OAAO,KAAKJ,OAAL,CAAa1W,cAApB,KAAuC,WAA5C,EAA0D;AACtD,aAAO,KAAK0W,OAAL,CAAa1W,cAApB;AACH;;AACD,QAAK,KAAK2W,QAAL,GAAgB3yB,MAArB,EAA8B;AAC1B,aAAO,KAAK2yB,QAAL,GAAgB9Q,IAAhB,CAAsB,UAAA,CAAA,EAAA;AAAA,eAAK3hB,CAAAA,CAAE4pB,WAAF5pB,EAAL;AAAtB,OAAA,CAAP;AADJ,KAAA,MAEO;AACH,aAAO,IAAP;AACH;;;yBAGL6yB,6CAAkB;AACd,QAAK,KAAKL,OAAL,CAAajJ,UAAb,KAA4B,KAAjC,EAAyC;AAEzC,QAAItF,IAAAA,GAAAA,KAAAA,CAAJ;;AACA,SAAM,IAAIjkB,CAAAA,GAAI,KAAK2qB,IAAL,CAAUoE,KAAV,CAAgBjvB,MAAhB,GAAyB,CAAvC,EAA0CE,CAAAA,IAAK,CAA/C,EAAkDA,CAAAA,EAAlD,EAAwD;AACpDikB,MAAAA,IAAAA,GAAO,KAAK0G,IAAL,CAAUoE,KAAV,CAAgB/uB,CAAhB,CAAPikB;AACA,UAAKA,IAAAA,CAAK9c,IAAL8c,KAAc,SAAnB,EAA+B;;AAC/B,UAAKA,IAAAA,CAAKuF,IAALvF,CAAUna,OAAVma,CAAkB,qBAAlBA,MAA6C,CAAlD,EAAsD;AAClD,aAAK0G,IAAL,CAAUsG,WAAV,CAAsBjxB,CAAtB;AACH;AACJ;;;yBAGL8yB,iDAAoB;AAAA,QAAA,MAAA,GAAA,IAAA;;AAChB,QAAIC,OAAAA,GAAU,EAAd;AACA,SAAKpI,IAAL,CAAUzF,IAAV,CAAgB,UAAA,IAAA,EAAQ;AACpB,UAAKjB,IAAAA,CAAKxa,MAAV,EAAmB;AACf,YAAIsf,IAAAA,GAAO9E,IAAAA,CAAKxa,MAALwa,CAAY1W,KAAZ0W,CAAkB8E,IAA7B;;AACA,YAAKA,IAAAA,IAAQ,CAACgK,OAAAA,CAAQhK,IAARgK,CAAd,EAA8B;AAC1BA,UAAAA,OAAAA,CAAQhK,IAARgK,CAAAA,GAAgB,IAAhBA;;AACA,cAAItf,QAAAA,GAAW,MAAA,CAAKA,QAAL,CAAcsV,IAAd,CAAf;;AACA,UAAA,MAAA,CAAK9d,GAAL,CAASyO,gBAAT,CAA0BjG,QAA1B,EAAoCwQ,IAAAA,CAAKxa,MAALwa,CAAY1W,KAAZ0W,CAAkBxW,GAAtD;AACH;AACJ;AARL,KAAA;;;yBAYJulB,yCAAgB;AACZ,SAAA,IAAA,SAAA,GAAkB,KAAKP,QAAL,EAAlB,EAAA,QAAA,GAAA,KAAA,CAAA,OAAA,CAAA,SAAA,CAAA,EAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,QAAA,GAAA,SAAA,GAAA,SAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAoC;AAAA,UAAA,IAAA;;AAAA,UAAA,QAAA,EAAA;AAAA,YAAA,EAAA,IAAA,SAAA,CAAA,MAAA,EAAA;AAAA,QAAA,IAAA,GAAA,SAAA,CAAA,EAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA;AAAA,YAAA,EAAA,CAAA,IAAA,EAAA;AAAA,QAAA,IAAA,GAAA,EAAA,CAAA,KAAA;AAAA;;AAAA,UAA1BjkB,IAA0B,GAAA,IAAA;AAChC,UAAIua,IAAAA,GAAO,KAAKtV,QAAL,CAAcjF,IAAAA,CAAKsK,IAAnB,CAAX;;AACA,UAAI6R,IAAAA,GAAOnc,IAAAA,CAAKmc,IAALnc,IAAaoE,MAAAA,CAAAA,OAAAA,CAAK8X,OAAL9X,CAAapE,IAAAA,CAAKsK,IAAlBlG,CAAxB;;AACA,UAAI3H,GAAAA,GAAAA,KAAAA,CAAJ;;AAEA,UAAK,KAAKunB,OAAL,CAAa1W,cAAb,KAAgC,KAArC,EAA6C;AACzC7Q,QAAAA,GAAAA,GAAM,IAAI0e,WAAAA,CAAAA,OAAAA,CAAQ5L,iBAAZ,CAA8BvP,IAAAA,CAAKgb,IAAnC,CAANve;;AACA,YAAKA,GAAAA,CAAI6Q,cAAT,EAA0B;AACtB7Q,UAAAA,GAAAA,CAAI6Q,cAAJ7Q,GAAqBA,GAAAA,CAAI6Q,cAAJ7Q,CAAmBA,GAAnBA,CAAwB,YAAA;AAAA,mBAAM,IAAN;AAAxB,WAAAA,CAArBA;AACH;AAJL,OAAA,MAKO;AACHA,QAAAA,GAAAA,GAAMuD,IAAAA,CAAKwR,QAALxR,EAANvD;AACH;;AAED,WAAKA,GAAL,CAASgP,cAAT,CAAwBhP,GAAxB,EAA6B8d,IAA7B,EAAmC,KAAKtV,QAAL,CAAckX,IAAd,CAAnC;AACH;;;yBAGLsI,uCAAe;AACX,QAAK,KAAKN,QAAL,EAAL,EAAuB;AACnB,aAAO,IAAP;AADJ,KAAA,MAEO,IAAK,OAAO,KAAKH,OAAL,CAAajJ,UAApB,KAAmC,WAAxC,EAAsD;AACzD,aAAO,KAAKiJ,OAAL,CAAajJ,UAApB;AADG,KAAA,MAEA,IAAK,KAAKkJ,QAAL,GAAgB3yB,MAArB,EAA8B;AACjC,aAAO,KAAK2yB,QAAL,GAAgB9Q,IAAhB,CAAsB,UAAA,CAAA,EAAA;AAAA,eAAK3hB,CAAAA,CAAEupB,UAAP;AAAtB,OAAA,CAAP;AADG,KAAA,MAEA;AACH,aAAO,IAAP;AACH;;;yBAGL2J,6BAASnoB,KAAK;AACV,QAAK+d,MAAL,EAAc;AACV,UAAKA,MAAAA,CAAOC,IAAPD,IAAeA,MAAAA,CAAOC,IAAPD,KAAgBE,UAAAA,CAAWD,IAA/C,EAAsD;AAClD,eAAOD,MAAAA,CAAOC,IAAPD,CAAY/d,GAAZ+d,EAAiBnjB,QAAjBmjB,CAA0B,QAA1BA,CAAP;AADJ,OAAA,MAEO;AACH,eAAO,IAAIA,MAAJ,CAAW/d,GAAX,EAAgBpF,QAAhB,CAAyB,QAAzB,CAAP;AACH;AALL,KAAA,MAMO;AACH,aAAOpB,MAAAA,CAAO4uB,IAAP5uB,CAAY6uB,QAAAA,CAASC,kBAAAA,CAAmBtoB,GAAnBsoB,CAATD,CAAZ7uB,CAAP;AACH;;;yBAGL+uB,yCAAgB;AACZ,QAAIplB,OAAAA,GAAAA,KAAAA,CAAJ;;AAEA,QAAK,KAAKykB,QAAL,EAAL,EAAuB;AAEnBzkB,MAAAA,OAAAA,GAAU,kCACN,KAAKglB,QAAL,CAAc,KAAKjoB,GAAL,CAAStF,QAAT,EAAd,CADJuI;AAFJ,KAAA,MAKO,IAAK,OAAO,KAAKskB,OAAL,CAAajJ,UAApB,KAAmC,QAAxC,EAAmD;AACtDrb,MAAAA,OAAAA,GAAU,KAAKskB,OAAL,CAAajJ,UAAvBrb;AADG,KAAA,MAGA;AACHA,MAAAA,OAAAA,GAAU,KAAKqlB,UAAL,KAAoB,MAA9BrlB;AACH;;AAED,QAAIslB,GAAAA,GAAQ,IAAZ;AACA,QAAK,KAAK/lB,GAAL,CAAS3D,OAAT,CAAiB,MAAjB,MAA6B,CAAC,CAAnC,EAAuC0pB,GAAAA,GAAM,MAANA;AAEvC,SAAK/lB,GAAL,IAAY+lB,GAAAA,GAAM,uBAANA,GAAgCtlB,OAAhCslB,GAA0C,KAAtD;;;yBAGJD,mCAAa;AACT,QAAK,KAAKpK,IAAL,CAAUsK,EAAf,EAAoB;AAChB,aAAO,KAAKhgB,QAAL,CAAc,KAAK0V,IAAL,CAAUsK,EAAxB,CAAP;AADJ,KAAA,MAEO,IAAK,KAAKtK,IAAL,CAAUJ,IAAf,EAAsB;AACzB,aAAO,KAAKtV,QAAL,CAAc,KAAK0V,IAAL,CAAUJ,IAAxB,CAAP;AADG,KAAA,MAEA;AACH,aAAO,QAAP;AACH;;;yBAGL2K,qCAAc;AACV,SAAKC,cAAL;AACA,QAAK,KAAKf,gBAAL,EAAL,EAAkC,KAAKE,iBAAL;AAClC,QAAK,KAAKL,QAAL,GAAgB3yB,MAAhB,GAAyB,CAA9B,EAAkC,KAAKkzB,aAAL;AAClC,QAAK,KAAKC,YAAL,EAAL,EAAkC,KAAKK,aAAL;;AAElC,QAAK,KAAKX,QAAL,EAAL,EAAuB;AACnB,aAAO,CAAC,KAAKllB,GAAN,CAAP;AADJ,KAAA,MAEO;AACH,aAAO,CAAC,KAAKA,GAAN,EAAW,KAAKxC,GAAhB,CAAP;AACH;;;yBAGLwI,6BAASqF,MAAM;AACX,QAAKA,IAAAA,CAAKhP,OAALgP,CAAa,GAAbA,MAAsB,CAA3B,EAA+B,OAAOA,IAAP;AAC/B,QAAK,YAAYpN,IAAZ,CAAiBoN,IAAjB,CAAL,EAA8B,OAAOA,IAAP;AAE9B,QAAIiQ,IAAAA,GAAO,KAAKI,IAAL,CAAUsK,EAAV,GAAe7gB,MAAAA,CAAAA,OAAAA,CAAK8X,OAAL9X,CAAa,KAAKuW,IAAL,CAAUsK,EAAvB7gB,CAAf,GAA4C,GAAvD;;AAEA,QAAK,OAAO,KAAK4f,OAAL,CAAajJ,UAApB,KAAmC,QAAxC,EAAmD;AAC/CR,MAAAA,IAAAA,GAAOnW,MAAAA,CAAAA,OAAAA,CAAK8X,OAAL9X,CAAcA,MAAAA,CAAAA,OAAAA,CAAKpQ,OAALoQ,CAAamW,IAAbnW,EAAmB,KAAK4f,OAAL,CAAajJ,UAAhC3W,CAAdA,CAAPmW;AACH;;AAEDjQ,IAAAA,IAAAA,GAAOlG,MAAAA,CAAAA,OAAAA,CAAKa,QAALb,CAAcmW,IAAdnW,EAAoBkG,IAApBlG,CAAPkG;;AACA,QAAKlG,MAAAA,CAAAA,OAAAA,CAAKghB,GAALhhB,KAAa,IAAlB,EAAyB;AACrB,aAAOkG,IAAAA,CAAKxT,OAALwT,CAAa,KAAbA,EAAoB,GAApBA,CAAP;AADJ,KAAA,MAEO;AACH,aAAOA,IAAP;AACH;;;yBAGL+a,iCAAW5P,MAAM;AACb,QAAK,KAAKuO,OAAL,CAAazJ,IAAlB,EAAyB;AACrB,aAAO,KAAKyJ,OAAL,CAAazJ,IAApB;AADJ,KAAA,MAEO;AACH,aAAO,KAAKtV,QAAL,CAAcwQ,IAAAA,CAAKxa,MAALwa,CAAY1W,KAAZ0W,CAAkB8E,IAAhC,CAAP;AACH;;;yBAGL4K,2CAAiB;AAAA,QAAA,MAAA,GAAA,IAAA;;AACb,SAAKlmB,GAAL,GAAW,EAAX;AACA,SAAKxC,GAAL,GAAW,IAAI0e,WAAAA,CAAAA,OAAAA,CAAQ1R,kBAAZ,CAA+B;AAAEa,MAAAA,IAAAA,EAAM,KAAKya,UAAL;AAAR,KAA/B,CAAX;AAEA,QAAI5kB,IAAAA,GAAS,CAAb;AACA,QAAIwK,MAAAA,GAAS,CAAb;AAEA,QAAInL,KAAAA,GAAAA,KAAAA,CAAJ;AAAA,QAAWC,IAAAA,GAAAA,KAAAA,CAAX;AACA,SAAK3K,SAAL,CAAe,KAAKqnB,IAApB,EAA0B,UAAC5f,GAAD,EAAMkZ,IAAN,EAAY9c,IAAZ,EAAqB;AAC3C,MAAA,MAAA,CAAKsG,GAAL,IAAY1C,GAAZ;;AAEA,UAAKkZ,IAAAA,IAAQ9c,IAAAA,KAAS,KAAtB,EAA8B;AAC1B,YAAK8c,IAAAA,CAAKxa,MAALwa,IAAeA,IAAAA,CAAKxa,MAALwa,CAAY4F,KAAhC,EAAwC;AACpC,UAAA,MAAA,CAAK5e,GAAL,CAASoO,UAAT,CAAoB;AAChB5P,YAAAA,MAAAA,EAAW,MAAA,CAAKoqB,UAAL,CAAgB5P,IAAhB,CADK;AAEhB/K,YAAAA,SAAAA,EAAW;AAAEvK,cAAAA,IAAAA,EAAAA,IAAF;AAAQwK,cAAAA,MAAAA,EAAQA,MAAAA,GAAS;AAAzB,aAFK;AAGhBC,YAAAA,QAAAA,EAAW;AACPzK,cAAAA,IAAAA,EAAQsV,IAAAA,CAAKxa,MAALwa,CAAY4F,KAAZ5F,CAAkBtV,IADnB;AAEPwK,cAAAA,MAAAA,EAAQ8K,IAAAA,CAAKxa,MAALwa,CAAY4F,KAAZ5F,CAAkB9K,MAAlB8K,GAA2B;AAF5B;AAHK,WAApB;AADJ,SAAA,MASO;AACH,UAAA,MAAA,CAAKhZ,GAAL,CAASoO,UAAT,CAAoB;AAChB5P,YAAAA,MAAAA,EAAW,aADK;AAEhB2P,YAAAA,QAAAA,EAAW;AAAEzK,cAAAA,IAAAA,EAAM,CAAR;AAAWwK,cAAAA,MAAAA,EAAQ;AAAnB,aAFK;AAGhBD,YAAAA,SAAAA,EAAW;AAAEvK,cAAAA,IAAAA,EAAAA,IAAF;AAAQwK,cAAAA,MAAAA,EAAQA,MAAAA,GAAS;AAAzB;AAHK,WAApB;AAKH;AACJ;;AAEDnL,MAAAA,KAAAA,GAAQjD,GAAAA,CAAIwH,KAAJxH,CAAU,KAAVA,CAARiD;;AACA,UAAKA,KAAL,EAAa;AACTW,QAAAA,IAAAA,IAASX,KAAAA,CAAMlO,MAAf6O;AACAV,QAAAA,IAAAA,GAASlD,GAAAA,CAAI4I,WAAJ5I,CAAgB,IAAhBA,CAATkD;AACAkL,QAAAA,MAAAA,GAASpO,GAAAA,CAAIjL,MAAJiL,GAAakD,IAAtBkL;AAHJ,OAAA,MAIO;AACHA,QAAAA,MAAAA,IAAUpO,GAAAA,CAAIjL,MAAdqZ;AACH;;AAED,UAAK8K,IAAAA,IAAQ9c,IAAAA,KAAS,OAAtB,EAAgC;AAC5B,YAAK8c,IAAAA,CAAKxa,MAALwa,IAAeA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAhC,EAAsC;AAClC,UAAA,MAAA,CAAK5V,GAAL,CAASoO,UAAT,CAAoB;AAChB5P,YAAAA,MAAAA,EAAW,MAAA,CAAKoqB,UAAL,CAAgB5P,IAAhB,CADK;AAEhB/K,YAAAA,SAAAA,EAAW;AAAEvK,cAAAA,IAAAA,EAAAA,IAAF;AAAQwK,cAAAA,MAAAA,EAAQA,MAAAA,GAAS;AAAzB,aAFK;AAGhBC,YAAAA,QAAAA,EAAW;AACPzK,cAAAA,IAAAA,EAAQsV,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,CAAgBtV,IADjB;AAEPwK,cAAAA,MAAAA,EAAQ8K,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,CAAgB9K;AAFjB;AAHK,WAApB;AADJ,SAAA,MASO;AACH,UAAA,MAAA,CAAKlO,GAAL,CAASoO,UAAT,CAAoB;AAChB5P,YAAAA,MAAAA,EAAW,aADK;AAEhB2P,YAAAA,QAAAA,EAAW;AAAEzK,cAAAA,IAAAA,EAAM,CAAR;AAAWwK,cAAAA,MAAAA,EAAQ;AAAnB,aAFK;AAGhBD,YAAAA,SAAAA,EAAW;AAAEvK,cAAAA,IAAAA,EAAAA,IAAF;AAAQwK,cAAAA,MAAAA,EAAQA,MAAAA,GAAS;AAAzB;AAHK,WAApB;AAKH;AACJ;AAhDL,KAAA;;;yBAoDJ2a,+BAAW;AACP,SAAKjB,eAAL;;AAEA,QAAK,KAAKpI,KAAL,EAAL,EAAoB;AAChB,aAAO,KAAKiJ,WAAL,EAAP;AADJ,KAAA,MAEO;AACH,UAAI/hB,MAAAA,GAAS,EAAb;AACA,WAAKrO,SAAL,CAAe,KAAKqnB,IAApB,EAA0B,UAAA,CAAA,EAAK;AAC3BhZ,QAAAA,MAAAA,IAAU3R,CAAV2R;AADJ,OAAA;AAGA,aAAO,CAACA,MAAD,CAAP;AACH;;;;;;kBAhRY4gB;;;;;;;;;;;;ACHrB;;;;;;;;;;IAQMwB;AAEF;;;;;;;;;;;AAWA,WAAA,OAAA,CAAYvK,IAAZ,EAA8B;AAAA,QAAZL,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,OAAA,CAAA;AAC1B;;;;;;;;;;AAQA,SAAKhiB,IAAL,GAAY,SAAZ;AACA;;;;;;;AAMA,SAAKqiB,IAAL,GAAYA,IAAZ;;AAEA,QAAKL,IAAAA,CAAKlF,IAALkF,IAAaA,IAAAA,CAAKlF,IAALkF,CAAU1f,MAA5B,EAAqC;AACjC,UAAImF,GAAAA,GAAUua,IAAAA,CAAKlF,IAALkF,CAAU2H,UAAV3H,CAAqBA,IAArBA,CAAd;AACA;;;;;;;;AAOA,WAAKxa,IAAL,GAAcC,GAAAA,CAAID,IAAlB;AACA;;;;;;;;AAOA,WAAKwK,MAAL,GAAcvK,GAAAA,CAAIuK,MAAlB;AACH;;AAED,SAAM,IAAI6a,GAAV,IAAiB7K,IAAjB,EAAA;AAAwB,WAAK6K,GAAL,IAAY7K,IAAAA,CAAK6K,GAAL7K,CAAZ;AAAxB;AACH;AAED;;;;;;;;;;oBAQAxjB,+BAAW;AACP,QAAK,KAAKse,IAAV,EAAiB;AACb,aAAO,KAAKA,IAAL,CAAU1c,KAAV,CAAgB,KAAKiiB,IAArB,EAA2B;AAC9B2B,QAAAA,MAAAA,EAAQ,KAAKA,MADiB;AAE9BtrB,QAAAA,KAAAA,EAAQ,KAAKA,KAFiB;AAG9BwyB,QAAAA,IAAAA,EAAQ,KAAKA;AAHiB,OAA3B,EAIJrH,OAJH;AADJ,KAAA,MAMO,IAAK,KAAKG,MAAV,EAAmB;AACtB,aAAO,KAAKA,MAAL,GAAc,IAAd,GAAqB,KAAK3B,IAAjC;AADG,KAAA,MAEA;AACH,aAAO,KAAKA,IAAZ;AACH;;AAGL;;;;;;;;;;AAUA;;;;;;;;;;;;kBAUWuK;;;;;;;;;;;;;;;;;;;;;;;;;ACxGf,IAAA,QAAA,GAAA,OAAA,CAAA,WAAA,CAAA;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;;;;;;IAcME;AAEF;;;;;;AAMA,WAAA,MAAA,CAAYrI,SAAZ,EAAuBjB,IAAvB,EAA6BxB,IAA7B,EAAmC;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,MAAA,CAAA;AAC/B;;;;;;;;;;;;;AAWA,SAAKyC,SAAL,GAAiBA,SAAjB;AACA;;;;;;;;;;;;;;;;;;;AAkBA,SAAKsI,QAAL,GAAgB,EAAhB;AACA;;;;;;;AAMA,SAAKvJ,IAAL,GAAYA,IAAZ;AACA;;;;;;;;;AAQA,SAAKxB,IAAL,GAAYA,IAAZ;AACA;;;;;;;AAMA,SAAK1b,GAAL,GAAWjH,SAAX;AACA;;;;;;;;;;;;;;;AAcA,SAAKyE,GAAL,GAAWzE,SAAX;AACH;AAED;;;;;;;;;;mBAQAb,+BAAW;AACP,WAAO,KAAK8H,GAAZ;;AAGJ;;;;;;;;;;;;;;;;;;mBAgBAgjB,qBAAKjH,MAAkB;AAAA,QAAZL,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;;AACnB,QAAK,CAACA,IAAAA,CAAKgC,MAAX,EAAoB;AAChB,UAAK,KAAKgJ,UAAL,IAAmB,KAAKA,UAAL,CAAgBC,aAAxC,EAAwD;AACpDjL,QAAAA,IAAAA,CAAKgC,MAALhC,GAAc,KAAKgL,UAAL,CAAgBC,aAA9BjL;AACH;AACJ;;AAED,QAAIkL,OAAAA,GAAU,IAAIN,SAAAA,CAAAA,OAAJ,CAAYvK,IAAZ,EAAkBL,IAAlB,CAAd;AACA,SAAK+K,QAAL,CAAcx0B,IAAd,CAAmB20B,OAAnB;AAEA,WAAOA,OAAP;;AAGJ;;;;;;;;;;;;;mBAWAC,+BAAW;AACP,WAAO,KAAKJ,QAAL,CAAchqB,MAAd,CAAsB,UAAA,CAAA,EAAA;AAAA,aAAKlK,CAAAA,CAAEmH,IAAFnH,KAAW,SAAhB;AAAtB,KAAA,CAAP;;AAGJ;;;;;;;;;;;;wBAQc;AACV,aAAO,KAAKyN,GAAZ;AACH;;;;;;kBAIUwmB;AAEf;;;;;;;;;;;;;;ACxKA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA;;;;;;;;;;IAQMM;;;AAEF,WAAA,OAAA,CAAY1D,QAAZ,EAAsB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,OAAA,CAAA;;AAAA,QAAA,KAAA,GAAA,0BAAA,CAAA,IAAA,EAClB,KAAA,CAAA,IAAA,CAAA,IAAA,EAAMA,QAAN,CADkB,CAAA;;AAElB,IAAA,KAAA,CAAK1pB,IAAL,GAAY,SAAZ;AAFkB,WAAA,KAAA;AAGrB;AAED;;;;;AAKA;;;;;;;;;;;;;;;EAZkBypB,MAAAA,CAAAA;;kBA0BP2D;;;;;;ACpCf;;;;;;;;;;AASA,IAAI3rB,IAAAA,GAAO;AAEPoC,EAAAA,KAFO,EAAA,SAAA,KAAA,CAED5F,MAFC,EAEOovB,UAFP,EAEmBvmB,IAFnB,EAEyB;AAC5B,QAAI6Z,KAAAA,GAAU,EAAd;AACA,QAAI2M,OAAAA,GAAU,EAAd;AACA,QAAIzpB,KAAAA,GAAU,KAAd;AAEA,QAAI0pB,IAAAA,GAAU,CAAd;AACA,QAAI3mB,KAAAA,GAAU,KAAd;AACA,QAAII,MAAAA,GAAU,KAAd;;AAEA,SAAM,IAAInO,CAAAA,GAAI,CAAd,EAAiBA,CAAAA,GAAIoF,MAAAA,CAAOtF,MAA5B,EAAoCE,CAAAA,EAApC,EAA0C;AACtC,UAAI20B,MAAAA,GAASvvB,MAAAA,CAAOpF,CAAPoF,CAAb;;AAEA,UAAK2I,KAAL,EAAa;AACT,YAAKI,MAAL,EAAc;AACVA,UAAAA,MAAAA,GAAS,KAATA;AADJ,SAAA,MAEO,IAAKwmB,MAAAA,KAAW,IAAhB,EAAuB;AAC1BxmB,UAAAA,MAAAA,GAAS,IAATA;AADG,SAAA,MAEA,IAAKwmB,MAAAA,KAAW5mB,KAAhB,EAAwB;AAC3BA,UAAAA,KAAAA,GAAQ,KAARA;AACH;AAPL,OAAA,MAQO,IAAK4mB,MAAAA,KAAW,GAAXA,IAAkBA,MAAAA,KAAW,IAAlC,EAAyC;AAC5C5mB,QAAAA,KAAAA,GAAQ4mB,MAAR5mB;AADG,OAAA,MAEA,IAAK4mB,MAAAA,KAAW,GAAhB,EAAsB;AACzBD,QAAAA,IAAAA,IAAQ,CAARA;AADG,OAAA,MAEA,IAAKC,MAAAA,KAAW,GAAhB,EAAsB;AACzB,YAAKD,IAAAA,GAAO,CAAZ,EAAgBA,IAAAA,IAAQ,CAARA;AADb,OAAA,MAEA,IAAKA,IAAAA,KAAS,CAAd,EAAkB;AACrB,YAAKF,UAAAA,CAAW1qB,OAAX0qB,CAAmBG,MAAnBH,MAA+B,CAAC,CAArC,EAAyCxpB,KAAAA,GAAQ,IAARA;AAC5C;;AAED,UAAKA,KAAL,EAAa;AACT,YAAKypB,OAAAA,KAAY,EAAjB,EAAsB3M,KAAAA,CAAMpoB,IAANooB,CAAW2M,OAAAA,CAAQvpB,IAARupB,EAAX3M;AACtB2M,QAAAA,OAAAA,GAAU,EAAVA;AACAzpB,QAAAA,KAAAA,GAAU,KAAVA;AAHJ,OAAA,MAIO;AACHypB,QAAAA,OAAAA,IAAWE,MAAXF;AACH;AACJ;;AAED,QAAKxmB,IAAAA,IAAQwmB,OAAAA,KAAY,EAAzB,EAA8B3M,KAAAA,CAAMpoB,IAANooB,CAAW2M,OAAAA,CAAQvpB,IAARupB,EAAX3M;AAC9B,WAAOA,KAAP;AA1CG,GAAA;;AA6CP;;;;;;;;;;;AAWA8M,EAAAA,KAxDO,EAAA,SAAA,KAAA,CAwDDxvB,MAxDC,EAwDO;AACV,QAAIyvB,MAAAA,GAAS,CAAC,GAAD,EAAM,IAAN,EAAY,IAAZ,CAAb;AACA,WAAOjsB,IAAAA,CAAKoC,KAALpC,CAAWxD,MAAXwD,EAAmBisB,MAAnBjsB,CAAP;AA1DG,GAAA;;AA6DP;;;;;;;;;;;;AAYAksB,EAAAA,KAzEO,EAAA,SAAA,KAAA,CAyED1vB,MAzEC,EAyEO;AACV,QAAI0vB,KAAAA,GAAQ,GAAZ;AACA,WAAOlsB,IAAAA,CAAKoC,KAALpC,CAAWxD,MAAXwD,EAAmB,CAACksB,KAAD,CAAnBlsB,EAA4B,IAA5BA,CAAP;AACH;AA5EM,CAAX;kBAgFeA;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzFf,IAAA,UAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;;;IAWMmsB;;;AAEF,WAAA,IAAA,CAAYlE,QAAZ,EAAsB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,IAAA,CAAA;;AAAA,QAAA,KAAA,GAAA,0BAAA,CAAA,IAAA,EAClB,UAAA,CAAA,IAAA,CAAA,IAAA,EAAMA,QAAN,CADkB,CAAA;;AAElB,IAAA,KAAA,CAAK1pB,IAAL,GAAY,MAAZ;AACA,QAAK,CAAC,KAAA,CAAK4nB,KAAX,EAAmB,KAAA,CAAKA,KAAL,GAAa,EAAb;AAHD,WAAA,KAAA;AAIrB;AAED;;;;;;;;;;;;;;;;;;;;wBAgBgB;AACZ,aAAOnmB,MAAAA,CAAAA,OAAAA,CAAKksB,KAALlsB,CAAW,KAAKosB,QAAhBpsB,CAAP;;sBAGUqsB,QAAQ;AAClB,UAAI1iB,KAAAA,GAAQ,KAAKyiB,QAAL,GAAgB,KAAKA,QAAL,CAAcziB,KAAd,CAAoB,MAApB,CAAhB,GAA8C,IAA1D;AACA,UAAIqhB,GAAAA,GAAQrhB,KAAAA,GAAQA,KAAAA,CAAM,CAANA,CAARA,GAAmB,MAAM,KAAK2b,GAAL,CAAS,SAAT,EAAoB,YAApB,CAArC;AACA,WAAK8G,QAAL,GAAgBC,MAAAA,CAAOnpB,IAAPmpB,CAAYrB,GAAZqB,CAAhB;AACH;AAED;;;;;;;;;;;AAWA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA7CeC,WAAAA,CAAAA;;kBA4EJH;;;;;;;;;AC1Ff,IAAA,UAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;;IAUMI;;;AAEF,WAAA,IAAA,CAAYtE,QAAZ,EAAsB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,IAAA,CAAA;;AAAA,QAAA,KAAA,GAAA,0BAAA,CAAA,IAAA,EAClB,UAAA,CAAA,IAAA,CAAA,IAAA,EAAMA,QAAN,CADkB,CAAA;;AAElB,IAAA,KAAA,CAAK1pB,IAAL,GAAY,MAAZ;AACA,QAAK,CAAC,KAAA,CAAK4nB,KAAX,EAAmB,KAAA,CAAKA,KAAL,GAAa,EAAb;AAHD,WAAA,KAAA;AAIrB;;iBAEDkC,mCAAYjC,OAAOrhB,QAAQ;AACvB,QAAM9N,KAAAA,GAAQ,KAAKA,KAAL,CAAWmvB,KAAX,CAAd;;AAEA,QAAK,CAACrhB,MAAD,IAAW9N,KAAAA,KAAU,CAArB,IAA0B,KAAKkvB,KAAL,CAAWjvB,MAAX,GAAoB,CAAnD,EAAuD;AACnD,WAAKivB,KAAL,CAAW,CAAX,EAAchB,IAAd,CAAmBkB,MAAnB,GAA4B,KAAKF,KAAL,CAAWlvB,KAAX,EAAkBkuB,IAAlB,CAAuBkB,MAAnD;AACH;;AAED,WAAO,UAAA,CAAA,SAAA,CAAMgC,WAAN,CAAA,IAAA,CAAA,IAAA,EAAkBjC,KAAlB,CAAP;;;iBAGJjc,+BAAUic,OAAOoG,QAAQjuB,MAAM;AAC3B,QAAI4nB,KAAAA,GAAQ,UAAA,CAAA,SAAA,CAAMhc,SAAN,CAAA,IAAA,CAAA,IAAA,EAAgBic,KAAhB,CAAZ;;AAEA,QAAKoG,MAAL,EAAc;AACV,UAAKjuB,IAAAA,KAAS,SAAd,EAA0B;AACtB,YAAK,KAAK4nB,KAAL,CAAWjvB,MAAX,GAAoB,CAAzB,EAA6B;AACzBs1B,UAAAA,MAAAA,CAAOrH,IAAPqH,CAAYnG,MAAZmG,GAAqB,KAAKrG,KAAL,CAAW,CAAX,EAAchB,IAAd,CAAmBkB,MAAxCmG;AADJ,SAAA,MAEO;AACH,iBAAOA,MAAAA,CAAOrH,IAAPqH,CAAYnG,MAAnB;AACH;AALL,OAAA,MAMO,IAAK,KAAKI,KAAL,KAAe+F,MAApB,EAA6B;AAChC,aAAA,IAAA,SAAA,GAAkBrG,KAAlB,EAAA,QAAA,GAAA,KAAA,CAAA,OAAA,CAAA,SAAA,CAAA,EAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,QAAA,GAAA,SAAA,GAAA,SAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAA0B;AAAA,cAAA,IAAA;;AAAA,cAAA,QAAA,EAAA;AAAA,gBAAA,EAAA,IAAA,SAAA,CAAA,MAAA,EAAA;AAAA,YAAA,IAAA,GAAA,SAAA,CAAA,EAAA,EAAA,CAAA;AAAA,WAAA,MAAA;AAAA,YAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA;AAAA,gBAAA,EAAA,CAAA,IAAA,EAAA;AAAA,YAAA,IAAA,GAAA,EAAA,CAAA,KAAA;AAAA;;AAAA,cAAhB9K,IAAgB,GAAA,IAAA;AACtBA,UAAAA,IAAAA,CAAK8J,IAAL9J,CAAUgL,MAAVhL,GAAmBmR,MAAAA,CAAOrH,IAAPqH,CAAYnG,MAA/BhL;AACH;AACJ;AACJ;;AAED,WAAO8K,KAAP;;AAGJ;;;;;;;;;;;;;;;iBAaAsG,+BAAqB;AAAA,QAAZlM,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;;AACjB,QAAImM,UAAAA,GAAa7qB,OAAAA,CAAQ,eAARA,CAAjB;;AACA,QAAI8qB,SAAAA,GAAa9qB,OAAAA,CAAQ,aAARA,CAAjB;;AAEA,QAAI+qB,IAAAA,GAAO,IAAIF,UAAJ,CAAe,IAAIC,SAAJ,EAAf,EAAgC,IAAhC,EAAsCpM,IAAtC,CAAX;AACA,WAAOqM,IAAAA,CAAKlyB,SAALkyB,EAAP;;AAGJ;;;;;;;;;;;;;;;;;;EA3DeN,WAAAA,CAAAA;;kBA6EJC;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzFf,IAAA,YAAA,GAAA,OAAA,CAAA,eAAA,CAAA;;;;AACA,IAAA,QAAA,GAAA,OAAA,CAAA,WAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAASM,WAAT,CAAqB1G,KAArB,EAA4B;AACxB,SAAOA,KAAAA,CAAM9jB,GAAN8jB,CAAW,UAAA,CAAA,EAAK;AACnB,QAAK/uB,CAAAA,CAAE+uB,KAAP,EAAe/uB,CAAAA,CAAE+uB,KAAF/uB,GAAUy1B,WAAAA,CAAYz1B,CAAAA,CAAE+uB,KAAd0G,CAAVz1B;AACf,WAAOA,CAAAA,CAAEyJ,MAAT;AACA,WAAOzJ,CAAP;AAHG,GAAA+uB,CAAP;AAKH;AAED;;;;;;;;;;;;IAUMmG;;;;;;;;;sBAEFx1B,qBAAKsvB,OAAO;AACRA,IAAAA,KAAAA,CAAMI,MAANJ,GAAe,IAAfA;AACA,SAAKD,KAAL,CAAWrvB,IAAX,CAAgBsvB,KAAhB;AACA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBAiCA0G,qBAAKp2B,UAAU;AACX,QAAK,CAAC,KAAKq2B,QAAX,EAAsB,KAAKA,QAAL,GAAgB,CAAhB;AACtB,QAAK,CAAC,KAAKC,OAAX,EAAqB,KAAKA,OAAL,GAAe,EAAf;AAErB,SAAKD,QAAL,IAAiB,CAAjB;AACA,QAAI5K,EAAAA,GAAK,KAAK4K,QAAd;AACA,SAAKC,OAAL,CAAa7K,EAAb,IAAmB,CAAnB;AAEA,QAAK,CAAC,KAAKgE,KAAX,EAAmB,OAAOvoB,SAAP;AAEnB,QAAI3G,KAAAA,GAAAA,KAAAA,CAAJ;AAAA,QAAW8R,MAAAA,GAAAA,KAAAA,CAAX;;AACA,WAAQ,KAAKikB,OAAL,CAAa7K,EAAb,IAAmB,KAAKgE,KAAL,CAAWjvB,MAAtC,EAA+C;AAC3CD,MAAAA,KAAAA,GAAS,KAAK+1B,OAAL,CAAa7K,EAAb,CAATlrB;AACA8R,MAAAA,MAAAA,GAASrS,QAAAA,CAAS,KAAKyvB,KAAL,CAAWlvB,KAAX,CAATP,EAA4BO,KAA5BP,CAATqS;AACA,UAAKA,MAAAA,KAAW,KAAhB,EAAwB;AAExB,WAAKikB,OAAL,CAAa7K,EAAb,KAAoB,CAApB;AACH;;AAED,WAAO,KAAK6K,OAAL,CAAa7K,EAAb,CAAP;AAEA,WAAOpZ,MAAP;;AAGJ;;;;;;;;;;;;;;;;;;;;;sBAmBAuT,qBAAK5lB,UAAU;AACX,WAAO,KAAKo2B,IAAL,CAAW,UAAC1G,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,UAAI2R,MAAAA,GAASrS,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAb;;AACA,UAAKqS,MAAAA,KAAW,KAAXA,IAAoBqd,KAAAA,CAAM9J,IAA/B,EAAsC;AAClCvT,QAAAA,MAAAA,GAASqd,KAAAA,CAAM9J,IAAN8J,CAAW1vB,QAAX0vB,CAATrd;AACH;;AACD,aAAOA,MAAP;AALG,KAAA,CAAP;;AASJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBA6BAoe,+BAAUzB,MAAMhvB,UAAU;AACtB,QAAK,CAACA,QAAN,EAAiB;AACbA,MAAAA,QAAAA,GAAWgvB,IAAXhvB;AACA,aAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,MAApB,EAA6B;AACzB,iBAAO1vB,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AAFJ,KAAA,MAOO,IAAKgvB,IAAAA,YAAgBpE,MAArB,EAA8B;AACjC,aAAO,KAAKhF,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,MAAfA,IAAyBV,IAAAA,CAAK5iB,IAAL4iB,CAAUU,KAAAA,CAAMV,IAAhBA,CAA9B,EAAsD;AAClD,iBAAOhvB,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AADG,KAAA,MAMA;AACH,aAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,MAAfA,IAAyBA,KAAAA,CAAMV,IAANU,KAAeV,IAA7C,EAAoD;AAChD,iBAAOhvB,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AAKH;;AAGL;;;;;;;;;;;;;;;;;;;;;;;;;sBAuBAu2B,+BAAUb,UAAU11B,UAAU;AAC1B,QAAK,CAACA,QAAN,EAAiB;AACbA,MAAAA,QAAAA,GAAW01B,QAAX11B;AAEA,aAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,MAApB,EAA6B;AACzB,iBAAO1vB,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AAHJ,KAAA,MAQO,IAAK01B,QAAAA,YAAoB9K,MAAzB,EAAkC;AACrC,aAAO,KAAKhF,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,MAAfA,IAAyBgG,QAAAA,CAAStpB,IAATspB,CAAchG,KAAAA,CAAMgG,QAApBA,CAA9B,EAA8D;AAC1D,iBAAO11B,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AADG,KAAA,MAMA;AACH,aAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,MAAfA,IAAyBA,KAAAA,CAAMgG,QAANhG,KAAmBgG,QAAjD,EAA4D;AACxD,iBAAO11B,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AAKH;;AAGL;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBA8BAw2B,mCAAYhhB,MAAMxV,UAAU;AACxB,QAAK,CAACA,QAAN,EAAiB;AACbA,MAAAA,QAAAA,GAAWwV,IAAXxV;AACA,aAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,QAApB,EAA+B;AAC3B,iBAAO1vB,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AAFJ,KAAA,MAOO,IAAKwV,IAAAA,YAAgBoV,MAArB,EAA8B;AACjC,aAAO,KAAKhF,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,QAAfA,IAA2Bla,IAAAA,CAAKpJ,IAALoJ,CAAUka,KAAAA,CAAMla,IAAhBA,CAAhC,EAAwD;AACpD,iBAAOxV,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AADG,KAAA,MAMA;AACH,aAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,YAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,QAAfA,IAA2BA,KAAAA,CAAMla,IAANka,KAAela,IAA/C,EAAsD;AAClD,iBAAOxV,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,OAAA,CAAP;AAKH;;AAGL;;;;;;;;;;;;;;;;;;sBAgBAuwB,qCAAavwB,UAAU;AACnB,WAAO,KAAK4lB,IAAL,CAAW,UAAC8J,KAAD,EAAQhvB,CAAR,EAAc;AAC5B,UAAKgvB,KAAAA,CAAM7nB,IAAN6nB,KAAe,SAApB,EAAgC;AAC5B,eAAO1vB,QAAAA,CAAS0vB,KAAT1vB,EAAgBU,CAAhBV,CAAP;AACH;AAHE,KAAA,CAAP;;AAOJ;;;;;;;;;;;;;;;;;;;;;;sBAoBAuyB,2BAAoB;AAAA,SAAA,IAAA,IAAA,GAAA,SAAA,CAAA,MAAA,EAAVlO,QAAU,GAAA,KAAA,CAAA,IAAA,CAAA,EAAA,IAAA,GAAA,CAAA,EAAA,IAAA,GAAA,IAAA,EAAA,IAAA,EAAA,EAAA;AAAVA,MAAAA,QAAU,CAAA,IAAA,CAAVA,GAAU,SAAA,CAAA,IAAA,CAAVA;AAAU;;AAChB,SAAA,IAAA,SAAA,GAAmBA,QAAnB,EAAA,QAAA,GAAA,KAAA,CAAA,OAAA,CAAA,SAAA,CAAA,EAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,QAAA,GAAA,SAAA,GAAA,SAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAA8B;AAAA,UAAA,IAAA;;AAAA,UAAA,QAAA,EAAA;AAAA,YAAA,EAAA,IAAA,SAAA,CAAA,MAAA,EAAA;AAAA,QAAA,IAAA,GAAA,SAAA,CAAA,EAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA;AAAA,YAAA,EAAA,CAAA,IAAA,EAAA;AAAA,QAAA,IAAA,GAAA,EAAA,CAAA,KAAA;AAAA;;AAAA,UAApBqL,KAAoB,GAAA,IAAA;AAC1B,UAAID,KAAAA,GAAQ,KAAKhc,SAAL,CAAeic,KAAf,EAAsB,KAAK/gB,IAA3B,CAAZ;;AACA,WAAA,IAAA,UAAA,GAAkB8gB,KAAlB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAA;AAAA,YAAA,KAAA;;AAAA,YAAA,SAAA,EAAA;AAAA,cAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,UAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,SAAA,MAAA;AAAA,UAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,cAAA,GAAA,CAAA,IAAA,EAAA;AAAA,UAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,YAAU9K,IAAV,GAAA,KAAA;AAA0B,aAAK8K,KAAL,CAAWrvB,IAAX,CAAgBukB,IAAhB;AAA1B;AACH;;AACD,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;;;;;;;;;sBAoBAc,6BAAqB;AAAA,SAAA,IAAA,KAAA,GAAA,SAAA,CAAA,MAAA,EAAVpB,QAAU,GAAA,KAAA,CAAA,KAAA,CAAA,EAAA,KAAA,GAAA,CAAA,EAAA,KAAA,GAAA,KAAA,EAAA,KAAA,EAAA,EAAA;AAAVA,MAAAA,QAAU,CAAA,KAAA,CAAVA,GAAU,SAAA,CAAA,KAAA,CAAVA;AAAU;;AACjBA,IAAAA,QAAAA,GAAWA,QAAAA,CAASoS,OAATpS,EAAXA;;AACA,SAAA,IAAA,UAAA,GAAmBA,QAAnB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAA8B;AAAA,UAAA,KAAA;;AAAA,UAAA,SAAA,EAAA;AAAA,YAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,QAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,YAAA,GAAA,CAAA,IAAA,EAAA;AAAA,QAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,UAApBqL,KAAoB,GAAA,KAAA;AAC1B,UAAID,KAAAA,GAAQ,KAAKhc,SAAL,CAAeic,KAAf,EAAsB,KAAKK,KAA3B,EAAkC,SAAlC,EAA6C0G,OAA7C,EAAZ;;AACA,WAAA,IAAA,UAAA,GAAkBhH,KAAlB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAA;AAAA,YAAA,KAAA;;AAAA,YAAA,SAAA,EAAA;AAAA,cAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,UAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,SAAA,MAAA;AAAA,UAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,cAAA,GAAA,CAAA,IAAA,EAAA;AAAA,UAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,YAAU9K,IAAV,GAAA,KAAA;AAA0B,aAAK8K,KAAL,CAAW9J,OAAX,CAAmBhB,IAAnB;AAC1B;;AAAA,WAAM,IAAI8G,EAAV,IAAgB,KAAK6K,OAArB,EAA+B;AAC3B,aAAKA,OAAL,CAAa7K,EAAb,IAAmB,KAAK6K,OAAL,CAAa7K,EAAb,IAAmBgE,KAAAA,CAAMjvB,MAA5C;AACH;AACJ;;AACD,WAAO,IAAP;;;sBAGJ8xB,+BAAUO,aAAa;AACnB,IAAA,KAAA,CAAA,SAAA,CAAMP,SAAN,CAAA,IAAA,CAAA,IAAA,EAAgBO,WAAhB;;AACA,QAAK,KAAKpD,KAAV,EAAkB;AACd,WAAA,IAAA,UAAA,GAAkB,KAAKA,KAAvB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAA;AAAA,YAAA,KAAA;;AAAA,YAAA,SAAA,EAAA;AAAA,cAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,UAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,SAAA,MAAA;AAAA,UAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,cAAA,GAAA,CAAA,IAAA,EAAA;AAAA,UAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,YAAU9K,IAAV,GAAA,KAAA;AAA+BA,QAAAA,IAAAA,CAAK2N,SAAL3N,CAAekO,WAAflO;AAA/B;AACH;;AAGL;;;;;;;;;;;;;sBAWAqN,qCAAa0E,OAAO5rB,KAAK;AACrB4rB,IAAAA,KAAAA,GAAQ,KAAKn2B,KAAL,CAAWm2B,KAAX,CAARA;AAEA,QAAI7uB,IAAAA,GAAQ6uB,KAAAA,KAAU,CAAVA,GAAc,SAAdA,GAA0B,KAAtC;AACA,QAAIjH,KAAAA,GAAQ,KAAKhc,SAAL,CAAe3I,GAAf,EAAoB,KAAK2kB,KAAL,CAAWiH,KAAX,CAApB,EAAuC7uB,IAAvC,EAA6C4uB,OAA7C,EAAZ;;AACA,SAAA,IAAA,UAAA,GAAkBhH,KAAlB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAA;AAAA,UAAA,KAAA;;AAAA,UAAA,SAAA,EAAA;AAAA,YAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,QAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,YAAA,GAAA,CAAA,IAAA,EAAA;AAAA,QAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,UAAU9K,IAAV,GAAA,KAAA;AAA0B,WAAK8K,KAAL,CAAW7uB,MAAX,CAAkB81B,KAAlB,EAAyB,CAAzB,EAA4B/R,IAA5B;AAE1B;;AAAA,QAAIpkB,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,SAAM,IAAIkrB,EAAV,IAAgB,KAAK6K,OAArB,EAA+B;AAC3B/1B,MAAAA,KAAAA,GAAQ,KAAK+1B,OAAL,CAAa7K,EAAb,CAARlrB;;AACA,UAAKm2B,KAAAA,IAASn2B,KAAd,EAAsB;AAClB,aAAK+1B,OAAL,CAAa7K,EAAb,IAAmBlrB,KAAAA,GAAQkvB,KAAAA,CAAMjvB,MAAjC;AACH;AACJ;;AAED,WAAO,IAAP;;AAGJ;;;;;;;;;;sBAQA0xB,mCAAYwE,OAAO5rB,KAAK;AACpB4rB,IAAAA,KAAAA,GAAQ,KAAKn2B,KAAL,CAAWm2B,KAAX,CAARA;AAEA,QAAIjH,KAAAA,GAAQ,KAAKhc,SAAL,CAAe3I,GAAf,EAAoB,KAAK2kB,KAAL,CAAWiH,KAAX,CAApB,EAAuCD,OAAvC,EAAZ;;AACA,SAAA,IAAA,UAAA,GAAkBhH,KAAlB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAA;AAAA,UAAA,KAAA;;AAAA,UAAA,SAAA,EAAA;AAAA,YAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,QAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,YAAA,GAAA,CAAA,IAAA,EAAA;AAAA,QAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,UAAU9K,IAAV,GAAA,KAAA;AAA0B,WAAK8K,KAAL,CAAW7uB,MAAX,CAAkB81B,KAAAA,GAAQ,CAA1B,EAA6B,CAA7B,EAAgC/R,IAAhC;AAE1B;;AAAA,QAAIpkB,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,SAAM,IAAIkrB,EAAV,IAAgB,KAAK6K,OAArB,EAA+B;AAC3B/1B,MAAAA,KAAAA,GAAQ,KAAK+1B,OAAL,CAAa7K,EAAb,CAARlrB;;AACA,UAAKm2B,KAAAA,GAAQn2B,KAAb,EAAqB;AACjB,aAAK+1B,OAAL,CAAa7K,EAAb,IAAmBlrB,KAAAA,GAAQkvB,KAAAA,CAAMjvB,MAAjC;AACH;AACJ;;AAED,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;;;sBAcAmxB,mCAAYjC,OAAO;AACfA,IAAAA,KAAAA,GAAQ,KAAKnvB,KAAL,CAAWmvB,KAAX,CAARA;AACA,SAAKD,KAAL,CAAWC,KAAX,EAAkBI,MAAlB,GAA2B5oB,SAA3B;AACA,SAAKuoB,KAAL,CAAW7uB,MAAX,CAAkB8uB,KAAlB,EAAyB,CAAzB;AAEA,QAAInvB,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,SAAM,IAAIkrB,EAAV,IAAgB,KAAK6K,OAArB,EAA+B;AAC3B/1B,MAAAA,KAAAA,GAAQ,KAAK+1B,OAAL,CAAa7K,EAAb,CAARlrB;;AACA,UAAKA,KAAAA,IAASmvB,KAAd,EAAsB;AAClB,aAAK4G,OAAL,CAAa7K,EAAb,IAAmBlrB,KAAAA,GAAQ,CAA3B;AACH;AACJ;;AAED,WAAO,IAAP;;AAGJ;;;;;;;;;;;;sBAUAo2B,iCAAY;AACR,SAAA,IAAA,UAAA,GAAkB,KAAKlH,KAAvB,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAA;AAAA,UAAA,KAAA;;AAAA,UAAA,SAAA,EAAA;AAAA,YAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,QAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,YAAA,GAAA,CAAA,IAAA,EAAA;AAAA,QAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,UAAU9K,IAAV,GAAA,KAAA;AAA+BA,MAAAA,IAAAA,CAAKmL,MAALnL,GAAczd,SAAdyd;AAC/B;;AAAA,SAAK8K,KAAL,GAAa,EAAb;AACA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBA6BAmH,uCAAcC,SAAShN,MAAM7pB,UAAU;AACnC,QAAK,CAACA,QAAN,EAAiB;AACbA,MAAAA,QAAAA,GAAW6pB,IAAX7pB;AACA6pB,MAAAA,IAAAA,GAAO,EAAPA;AACH;;AAED,SAAK4G,SAAL,CAAgB,UAAA,IAAA,EAAQ;AACpB,UAAK5G,IAAAA,CAAKnjB,KAALmjB,IAAcA,IAAAA,CAAKnjB,KAALmjB,CAAWrf,OAAXqf,CAAmBiF,IAAAA,CAAKE,IAAxBnF,MAAkC,CAAC,CAAtD,EAA0D;AAC1D,UAAKA,IAAAA,CAAKiN,IAALjN,IAAciF,IAAAA,CAAKjjB,KAALijB,CAAWtkB,OAAXskB,CAAmBjF,IAAAA,CAAKiN,IAAxBhI,MAAkC,CAAC,CAAtD,EAA0D;AAE1DA,MAAAA,IAAAA,CAAKjjB,KAALijB,GAAaA,IAAAA,CAAKjjB,KAALijB,CAAW9oB,OAAX8oB,CAAmB+H,OAAnB/H,EAA4B9uB,QAA5B8uB,CAAbA;AAJJ,KAAA;AAOA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;sBAWAvL,uBAAMwT,WAAW;AACb,WAAO,KAAKtH,KAAL,CAAWlM,KAAX,CAAiBwT,SAAjB,CAAP;;AAGJ;;;;;;;;;;;;;sBAWA1U,qBAAK0U,WAAW;AACZ,WAAO,KAAKtH,KAAL,CAAWpN,IAAX,CAAgB0U,SAAhB,CAAP;;AAGJ;;;;;;;;;;;;sBAUAx2B,uBAAMmvB,OAAO;AACT,QAAK,OAAOA,KAAP,KAAiB,QAAtB,EAAiC;AAC7B,aAAOA,KAAP;AADJ,KAAA,MAEO;AACH,aAAO,KAAKD,KAAL,CAAWjlB,OAAX,CAAmBklB,KAAnB,CAAP;AACH;;AAGL;;;;;;;;;;sBA0BAjc,+BAAUgc,OAAOqG,QAAQ;AAAA,QAAA,MAAA,GAAA,IAAA;;AACrB,QAAK,OAAOrG,KAAP,KAAiB,QAAtB,EAAiC;AAC7B,UAAIjkB,KAAAA,GAAQL,OAAAA,CAAQ,SAARA,CAAZ;;AACAskB,MAAAA,KAAAA,GAAQ0G,WAAAA,CAAY3qB,KAAAA,CAAMikB,KAANjkB,CAAAA,CAAaikB,KAAzB0G,CAAR1G;AAFJ,KAAA,MAGO,IAAKjnB,KAAAA,CAAM+c,OAAN/c,CAAcinB,KAAdjnB,CAAL,EAA4B;AAC/BinB,MAAAA,KAAAA,GAAQA,KAAAA,CAAMhnB,KAANgnB,CAAY,CAAZA,CAARA;;AACA,WAAA,IAAA,UAAA,GAAeA,KAAf,EAAA,SAAA,GAAA,KAAA,CAAA,OAAA,CAAA,UAAA,CAAA,EAAA,GAAA,GAAA,CAAA,EAAA,UAAA,GAAA,SAAA,GAAA,UAAA,GAAA,UAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAuB;AAAA,YAAA,KAAA;;AAAA,YAAA,SAAA,EAAA;AAAA,cAAA,GAAA,IAAA,UAAA,CAAA,MAAA,EAAA;AAAA,UAAA,KAAA,GAAA,UAAA,CAAA,GAAA,EAAA,CAAA;AAAA,SAAA,MAAA;AAAA,UAAA,GAAA,GAAA,UAAA,CAAA,IAAA,EAAA;AAAA,cAAA,GAAA,CAAA,IAAA,EAAA;AAAA,UAAA,KAAA,GAAA,GAAA,CAAA,KAAA;AAAA;;AAAA,YAAb/uB,CAAa,GAAA,KAAA;AACnB,YAAKA,CAAAA,CAAEovB,MAAP,EAAgBpvB,CAAAA,CAAEovB,MAAFpvB,CAASixB,WAATjxB,CAAqBA,CAArBA,EAAwB,QAAxBA;AACnB;AAJE,KAAA,MAKA,IAAK+uB,KAAAA,CAAM5nB,IAAN4nB,KAAe,MAApB,EAA6B;AAChCA,MAAAA,KAAAA,GAAQA,KAAAA,CAAMA,KAANA,CAAYhnB,KAAZgnB,CAAkB,CAAlBA,CAARA;;AACA,WAAA,IAAA,WAAA,GAAeA,KAAf,EAAA,UAAA,GAAA,KAAA,CAAA,OAAA,CAAA,WAAA,CAAA,EAAA,IAAA,GAAA,CAAA,EAAA,WAAA,GAAA,UAAA,GAAA,WAAA,GAAA,WAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAuB;AAAA,YAAA,MAAA;;AAAA,YAAA,UAAA,EAAA;AAAA,cAAA,IAAA,IAAA,WAAA,CAAA,MAAA,EAAA;AAAA,UAAA,MAAA,GAAA,WAAA,CAAA,IAAA,EAAA,CAAA;AAAA,SAAA,MAAA;AAAA,UAAA,IAAA,GAAA,WAAA,CAAA,IAAA,EAAA;AAAA,cAAA,IAAA,CAAA,IAAA,EAAA;AAAA,UAAA,MAAA,GAAA,IAAA,CAAA,KAAA;AAAA;;AAAA,YAAb/uB,IAAa,GAAA,MAAA;AACnB,YAAKA,IAAAA,CAAEovB,MAAP,EAAgBpvB,IAAAA,CAAEovB,MAAFpvB,CAASixB,WAATjxB,CAAqBA,IAArBA,EAAwB,QAAxBA;AACnB;AAJE,KAAA,MAKA,IAAK+uB,KAAAA,CAAM5nB,IAAX,EAAkB;AACrB4nB,MAAAA,KAAAA,GAAQ,CAACA,KAAD,CAARA;AADG,KAAA,MAEA,IAAKA,KAAAA,CAAMT,IAAX,EAAkB;AACrB,UAAK,OAAOS,KAAAA,CAAM5jB,KAAb,KAAuB,WAA5B,EAA0C;AACtC,cAAM,IAAIzH,KAAJ,CAAU,wCAAV,CAAN;AADJ,OAAA,MAEO,IAAK,OAAOqrB,KAAAA,CAAM5jB,KAAb,KAAuB,QAA5B,EAAuC;AAC1C4jB,QAAAA,KAAAA,CAAM5jB,KAAN4jB,GAAclV,MAAAA,CAAOkV,KAAAA,CAAM5jB,KAAb0O,CAAdkV;AACH;;AACDA,MAAAA,KAAAA,GAAQ,CAAC,IAAIuD,aAAAA,CAAAA,OAAJ,CAAgBvD,KAAhB,CAAD,CAARA;AANG,KAAA,MAOA,IAAKA,KAAAA,CAAMiG,QAAX,EAAsB;AACzB,UAAID,IAAAA,GAAOtqB,OAAAA,CAAQ,QAARA,CAAX;;AACAskB,MAAAA,KAAAA,GAAQ,CAAC,IAAIgG,IAAJ,CAAShG,KAAT,CAAD,CAARA;AAFG,KAAA,MAGA,IAAKA,KAAAA,CAAMja,IAAX,EAAkB;AACrB,UAAIwhB,MAAAA,GAAS7rB,OAAAA,CAAQ,WAARA,CAAb;;AACAskB,MAAAA,KAAAA,GAAQ,CAAC,IAAIuH,MAAJ,CAAWvH,KAAX,CAAD,CAARA;AAFG,KAAA,MAGA,IAAKA,KAAAA,CAAMvF,IAAX,EAAkB;AACrBuF,MAAAA,KAAAA,GAAQ,CAAC,IAAIwF,SAAAA,CAAAA,OAAJ,CAAYxF,KAAZ,CAAD,CAARA;AADG,KAAA,MAEA;AACH,YAAM,IAAIrrB,KAAJ,CAAU,oCAAV,CAAN;AACH;;AAED,QAAI6yB,SAAAA,GAAYxH,KAAAA,CAAM9jB,GAAN8jB,CAAW,UAAA,CAAA,EAAK;AAC5B,UAAK,OAAO/uB,CAAAA,CAAEivB,MAAT,KAAoB,UAAzB,EAAsCjvB,CAAAA,GAAI,MAAA,CAAKw2B,OAAL,CAAax2B,CAAb,CAAJA;AAEtC,UAAKA,CAAAA,CAAEovB,MAAP,EAAgBpvB,CAAAA,CAAEovB,MAAFpvB,CAASixB,WAATjxB,CAAqBA,CAArBA;;AAChB,UAAK,OAAOA,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAd,KAAyB,WAA9B,EAA4C;AACxC,YAAKmG,MAAAA,IAAU,OAAOA,MAAAA,CAAOrH,IAAPqH,CAAYnG,MAAnB,KAA8B,WAA7C,EAA2D;AACvDjvB,UAAAA,CAAAA,CAAE+tB,IAAF/tB,CAAOivB,MAAPjvB,GAAgBo1B,MAAAA,CAAOrH,IAAPqH,CAAYnG,MAAZmG,CAAmB9vB,OAAnB8vB,CAA2B,QAA3BA,EAAqC,EAArCA,CAAhBp1B;AACH;AACJ;;AACDA,MAAAA,CAAAA,CAAEovB,MAAFpvB,GAAW,MAAXA;AACA,aAAOA,CAAP;AAVY,KAAA+uB,CAAhB;AAaA,WAAOwH,SAAP;;;sBAGJC,2BAAQvS,MAAMmL,QAAQ;AAAA,QAAA,MAAA,GAAA,IAAA;;AAClB,QAAIqH,GAAAA,GAAAA,KAAAA,CAAJ;;AACA,QAAKxS,IAAAA,CAAK9c,IAAL8c,KAAc,MAAnB,EAA4B;AACxB,UAAIkR,IAAAA,GAAO1qB,OAAAA,CAAQ,QAARA,CAAX;;AACAgsB,MAAAA,GAAAA,GAAM,IAAItB,IAAJ,EAANsB;AAFJ,KAAA,MAGO,IAAKxS,IAAAA,CAAK9c,IAAL8c,KAAc,QAAnB,EAA8B;AACjC,UAAIqS,MAAAA,GAAS7rB,OAAAA,CAAQ,WAARA,CAAb;;AACAgsB,MAAAA,GAAAA,GAAM,IAAIH,MAAJ,EAANG;AAFG,KAAA,MAGA,IAAKxS,IAAAA,CAAK9c,IAAL8c,KAAc,MAAnB,EAA4B;AAC/B,UAAI8Q,IAAAA,GAAOtqB,OAAAA,CAAQ,QAARA,CAAX;;AACAgsB,MAAAA,GAAAA,GAAM,IAAI1B,IAAJ,EAAN0B;AAFG,KAAA,MAGA,IAAKxS,IAAAA,CAAK9c,IAAL8c,KAAc,MAAnB,EAA4B;AAC/BwS,MAAAA,GAAAA,GAAM,IAAInE,aAAAA,CAAAA,OAAJ,EAANmE;AADG,KAAA,MAEA,IAAKxS,IAAAA,CAAK9c,IAAL8c,KAAc,SAAnB,EAA+B;AAClCwS,MAAAA,GAAAA,GAAM,IAAIlC,SAAAA,CAAAA,OAAJ,EAANkC;AACH;;AAED,SAAM,IAAIz2B,CAAV,IAAeikB,IAAf,EAAsB;AAClB,UAAKjkB,CAAAA,KAAM,OAAX,EAAqB;AACjBy2B,QAAAA,GAAAA,CAAI1H,KAAJ0H,GAAYxS,IAAAA,CAAK8K,KAAL9K,CAAWhZ,GAAXgZ,CAAgB,UAAA,CAAA,EAAA;AAAA,iBAAK,MAAA,CAAKuS,OAAL,CAAa7Y,CAAb,EAAgB8Y,GAAhB,CAAL;AAAhB,SAAAxS,CAAZwS;AADJ,OAAA,MAEO,IAAKz2B,CAAAA,KAAM,QAANA,IAAkBovB,MAAvB,EAAgC;AACnCqH,QAAAA,GAAAA,CAAIrH,MAAJqH,GAAarH,MAAbqH;AADG,OAAA,MAEA,IAAKxS,IAAAA,CAAK3a,cAAL2a,CAAoBjkB,CAApBikB,CAAL,EAA8B;AACjCwS,QAAAA,GAAAA,CAAIz2B,CAAJy2B,CAAAA,GAASxS,IAAAA,CAAKjkB,CAALikB,CAATwS;AACH;AACJ;;AAED,WAAOA,GAAP;;AAGJ;;;;;;;;;;;;;;wBAnGY;AACR,UAAK,CAAC,KAAK1H,KAAX,EAAmB,OAAOvoB,SAAP;AACnB,aAAO,KAAKuoB,KAAL,CAAW,CAAX,CAAP;AACH;AAED;;;;;;;;;;;wBAQW;AACP,UAAK,CAAC,KAAKA,KAAX,EAAmB,OAAOvoB,SAAP;AACnB,aAAO,KAAKuoB,KAAL,CAAW,KAAKA,KAAL,CAAWjvB,MAAX,GAAoB,CAA/B,CAAP;AACH;;;;EA1iBmB8wB,MAAAA,CAAAA;;kBA0oBTsE;AAGf;;;;;;;;AAQA;;;;;;;;;;;;;;;AC3qBA,IAAA,UAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;;;;;;;;;;IAkBMoB;;;AAEF,WAAA,MAAA,CAAYzF,QAAZ,EAAsB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,MAAA,CAAA;;AAAA,QAAA,KAAA,GAAA,0BAAA,CAAA,IAAA,EAClB,UAAA,CAAA,IAAA,CAAA,IAAA,EAAMA,QAAN,CADkB,CAAA;;AAElB,IAAA,KAAA,CAAK1pB,IAAL,GAAY,QAAZ;AAFkB,WAAA,KAAA;AAGrB;;mBAED0qB,2BAAoB;AAAA,QAAA,qBAAA;;AAChB,QAAK,CAAC,KAAK9C,KAAX,EAAmB,KAAKA,KAAL,GAAa,EAAb;;AADH,SAAA,IAAA,IAAA,GAAA,SAAA,CAAA,MAAA,EAAVpL,QAAU,GAAA,KAAA,CAAA,IAAA,CAAA,EAAA,IAAA,GAAA,CAAA,EAAA,IAAA,GAAA,IAAA,EAAA,IAAA,EAAA,EAAA;AAAVA,MAAAA,QAAU,CAAA,IAAA,CAAVA,GAAU,SAAA,CAAA,IAAA,CAAVA;AAAU;;AAEhB,WAAO,CAAA,qBAAA,GAAA,UAAA,CAAA,SAAA,CAAMkO,MAAN,EAAA,IAAA,CAAA,KAAA,CAAA,qBAAA,EAAA,CAAA,IAAA,EAAA,MAAA,CAAgBlO,QAAhB,CAAA,CAAP;;;mBAGJoB,6BAAqB;AAAA,QAAA,sBAAA;;AACjB,QAAK,CAAC,KAAKgK,KAAX,EAAmB,KAAKA,KAAL,GAAa,EAAb;;AADF,SAAA,IAAA,KAAA,GAAA,SAAA,CAAA,MAAA,EAAVpL,QAAU,GAAA,KAAA,CAAA,KAAA,CAAA,EAAA,KAAA,GAAA,CAAA,EAAA,KAAA,GAAA,KAAA,EAAA,KAAA,EAAA,EAAA;AAAVA,MAAAA,QAAU,CAAA,KAAA,CAAVA,GAAU,SAAA,CAAA,KAAA,CAAVA;AAAU;;AAEjB,WAAO,CAAA,sBAAA,GAAA,UAAA,CAAA,SAAA,CAAMoB,OAAN,EAAA,IAAA,CAAA,KAAA,CAAA,sBAAA,EAAA,CAAA,IAAA,EAAA,MAAA,CAAiBpB,QAAjB,CAAA,CAAP;;AAGJ;;;;;;;;;;AAUA;;;;;;;;;;;;AAYA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAvCiBuR,WAAAA,CAAAA;;kBAwENoB;;;;;;;AC5Ff,IAAA,YAAA,GAAA,OAAA,CAAA,eAAA,CAAA;;;;AACA,IAAA,SAAA,GAAA,OAAA,CAAA,YAAA,CAAA;;;;AACA,IAAA,QAAA,GAAA,OAAA,CAAA,WAAA,CAAA;;;;AACA,IAAA,OAAA,GAAA,OAAA,CAAA,WAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;;;;;;;;;;;;;IAEqBI;AAEjB,WAAA,MAAA,CAAYnpB,KAAZ,EAAmB;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,MAAA,CAAA;;AACf,SAAKA,KAAL,GAAaA,KAAb;AAEA,SAAKod,IAAL,GAAiB,IAAIwK,MAAAA,CAAAA,OAAJ,EAAjB;AACA,SAAKV,OAAL,GAAiB,KAAK9J,IAAtB;AACA,SAAKkK,MAAL,GAAiB,EAAjB;AACA,SAAK/G,SAAL,GAAiB,KAAjB;AAEA,SAAK6I,eAAL;AACA,SAAKhM,IAAL,CAAUlhB,MAAV,GAAmB;AAAE8D,MAAAA,KAAAA,EAAAA,KAAF;AAASsc,MAAAA,KAAAA,EAAO;AAAElb,QAAAA,IAAAA,EAAM,CAAR;AAAWwK,QAAAA,MAAAA,EAAQ;AAAnB;AAAhB,KAAnB;AACH;;mBAEDwd,6CAAkB;AACd,SAAK5qB,SAAL,GAAiB,CAAA,GAAA,UAAA,CAAA,OAAA,EAAU,KAAKwB,KAAf,CAAjB;;;mBAGJzC,yBAAQ;AACJ,QAAI0E,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,WAAQ,CAAC,KAAKzD,SAAL,CAAekD,SAAf,EAAT,EAAsC;AAClCO,MAAAA,KAAAA,GAAQ,KAAKzD,SAAL,CAAemD,SAAf,EAARM;;AAEA,cAASA,KAAAA,CAAM,CAANA,CAAT;AAEA,aAAK,OAAL;AACI,eAAKqlB,MAAL,IAAerlB,KAAAA,CAAM,CAANA,CAAf;AACA;;AAEJ,aAAK,GAAL;AACI,eAAKonB,aAAL,CAAmBpnB,KAAnB;AACA;;AAEJ,aAAK,GAAL;AACI,eAAKqR,GAAL,CAASrR,KAAT;AACA;;AAEJ,aAAK,SAAL;AACI,eAAKwe,OAAL,CAAaxe,KAAb;AACA;;AAEJ,aAAK,SAAL;AACI,eAAKof,MAAL,CAAYpf,KAAZ;AACA;;AAEJ,aAAK,GAAL;AACI,eAAKqnB,SAAL,CAAernB,KAAf;AACA;;AAEJ;AACI,eAAKsnB,KAAL,CAAWtnB,KAAX;AACA;AA5BJ;AA8BH;;AACD,SAAKunB,OAAL;;;mBAGJ/I,2BAAQxe,OAAO;AACX,QAAIyU,IAAAA,GAAO,IAAIsQ,SAAAA,CAAAA,OAAJ,EAAX;AACA,SAAKyC,IAAL,CAAU/S,IAAV,EAAgBzU,KAAAA,CAAM,CAANA,CAAhB,EAA0BA,KAAAA,CAAM,CAANA,CAA1B;AACAyU,IAAAA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,GAAkB;AAAEtV,MAAAA,IAAAA,EAAMa,KAAAA,CAAM,CAANA,CAAR;AAAkB2J,MAAAA,MAAAA,EAAQ3J,KAAAA,CAAM,CAANA;AAA1B,KAAlByU;AAEA,QAAIuF,IAAAA,GAAOha,KAAAA,CAAM,CAANA,CAAAA,CAASzH,KAATyH,CAAe,CAAfA,EAAkB,CAAC,CAAnBA,CAAX;;AACA,QAAK,QAAQ9D,IAAR,CAAa8d,IAAb,CAAL,EAA0B;AACtBvF,MAAAA,IAAAA,CAAKuF,IAALvF,GAAkB,EAAlBA;AACAA,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUgK,IAAVhK,GAAkBuF,IAAlBvF;AACAA,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUkK,KAAVlK,GAAkB,EAAlBA;AAHJ,KAAA,MAIO;AACH,UAAI1R,KAAAA,GAAQiX,IAAAA,CAAKjX,KAALiX,CAAW,yBAAXA,CAAZ;AACAvF,MAAAA,IAAAA,CAAKuF,IAALvF,GAAkB1R,KAAAA,CAAM,CAANA,CAAlB0R;AACAA,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUgK,IAAVhK,GAAkB1R,KAAAA,CAAM,CAANA,CAAlB0R;AACAA,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUkK,KAAVlK,GAAkB1R,KAAAA,CAAM,CAANA,CAAlB0R;AACH;;;mBAGL4S,+BAAUrnB,OAAO;AACb,QAAIyU,IAAAA,GAAO,IAAI8Q,MAAAA,CAAAA,OAAJ,EAAX;AACA,SAAKiC,IAAL,CAAU/S,IAAV,EAAgBzU,KAAAA,CAAM,CAANA,CAAhB,EAA0BA,KAAAA,CAAM,CAANA,CAA1B;AACAyU,IAAAA,IAAAA,CAAK+Q,QAAL/Q,GAAgB,EAAhBA;AACAA,IAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,GAAoB,EAApBA;AACA,SAAKwQ,OAAL,GAAexQ,IAAf;;;mBAGJ6S,uBAAMjN,OAAO;AACT,QAAIhJ,GAAAA,GAAW,KAAf;AACA,QAAI1Z,IAAAA,GAAW,IAAf;AACA,QAAI4lB,KAAAA,GAAW,KAAf;AACA,QAAIkK,OAAAA,GAAW,IAAf;AACA,QAAIC,QAAAA,GAAW,EAAf;AAEA,QAAIC,MAAAA,GAAS,EAAb;AACA,QAAI3nB,KAAAA,GAAQqa,KAAZ;;AACA,WAAQra,KAAR,EAAgB;AACZrI,MAAAA,IAAAA,GAAOqI,KAAAA,CAAM,CAANA,CAAPrI;AACAgwB,MAAAA,MAAAA,CAAOz3B,IAAPy3B,CAAY3nB,KAAZ2nB;;AAEA,UAAKhwB,IAAAA,KAAS,GAATA,IAAgBA,IAAAA,KAAS,GAA9B,EAAoC;AAChC,YAAK,CAAC8vB,OAAN,EAAgBA,OAAAA,GAAUznB,KAAVynB;AAChBC,QAAAA,QAAAA,CAASx3B,IAATw3B,CAAc/vB,IAAAA,KAAS,GAATA,GAAe,GAAfA,GAAqB,GAAnC+vB;AAFJ,OAAA,MAIO,IAAKA,QAAAA,CAASp3B,MAATo3B,KAAoB,CAAzB,EAA6B;AAChC,YAAK/vB,IAAAA,KAAS,GAAd,EAAoB;AAChB,cAAK4lB,KAAL,EAAa;AACT,iBAAKqB,IAAL,CAAU+I,MAAV;AACA;AAFJ,WAAA,MAGO;AACH;AACH;AANL,SAAA,MAQO,IAAKhwB,IAAAA,KAAS,GAAd,EAAoB;AACvB,eAAKsnB,IAAL,CAAU0I,MAAV;AACA;AAFG,SAAA,MAIA,IAAKhwB,IAAAA,KAAS,GAAd,EAAoB;AACvB,eAAK4E,SAAL,CAAewD,IAAf,CAAoB4nB,MAAAA,CAAOhoB,GAAPgoB,EAApB;AACAtW,UAAAA,GAAAA,GAAM,IAANA;AACA;AAHG,SAAA,MAKA,IAAK1Z,IAAAA,KAAS,GAAd,EAAoB;AACvB4lB,UAAAA,KAAAA,GAAQ,IAARA;AACH;AApBE,OAAA,MAsBA,IAAK5lB,IAAAA,KAAS+vB,QAAAA,CAASA,QAAAA,CAASp3B,MAATo3B,GAAkB,CAA3BA,CAAd,EAA8C;AACjDA,QAAAA,QAAAA,CAAS/nB,GAAT+nB;AACA,YAAKA,QAAAA,CAASp3B,MAATo3B,KAAoB,CAAzB,EAA6BD,OAAAA,GAAU,IAAVA;AAChC;;AAEDznB,MAAAA,KAAAA,GAAQ,KAAKzD,SAAL,CAAemD,SAAf,EAARM;AACH;;AAED,QAAK,KAAKzD,SAAL,CAAekD,SAAf,EAAL,EAAkC4R,GAAAA,GAAM,IAANA;AAClC,QAAKqW,QAAAA,CAASp3B,MAATo3B,GAAkB,CAAvB,EAA2B,KAAKE,eAAL,CAAqBH,OAArB;;AAE3B,QAAKpW,GAAAA,IAAOkM,KAAZ,EAAoB;AAChB,aAAQoK,MAAAA,CAAOr3B,MAAf,EAAwB;AACpB0P,QAAAA,KAAAA,GAAQ2nB,MAAAA,CAAOA,MAAAA,CAAOr3B,MAAPq3B,GAAgB,CAAvBA,CAAAA,CAA0B,CAA1BA,CAAR3nB;AACA,YAAKA,KAAAA,KAAU,OAAVA,IAAqBA,KAAAA,KAAU,SAApC,EAAgD;AAChD,aAAKzD,SAAL,CAAewD,IAAf,CAAoB4nB,MAAAA,CAAOhoB,GAAPgoB,EAApB;AACH;;AACD,WAAK/I,IAAL,CAAU+I,MAAV;AACA;AAPJ,KAAA,MAQO;AACH,WAAKE,WAAL,CAAiBF,MAAjB;AACH;;;mBAGL1I,qBAAK0I,QAAQ;AACTA,IAAAA,MAAAA,CAAOhoB,GAAPgoB;AAEA,QAAIlT,IAAAA,GAAO,IAAI8Q,MAAAA,CAAAA,OAAJ,EAAX;AACA,SAAKiC,IAAL,CAAU/S,IAAV,EAAgBkT,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAAhB,EAA8BA,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAA9B;AAEAlT,IAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,GAAoB,KAAKqT,wBAAL,CAA8BH,MAA9B,CAApBlT;AACA,SAAKiK,GAAL,CAASjK,IAAT,EAAe,UAAf,EAA2BkT,MAA3B;AACA,SAAK1C,OAAL,GAAexQ,IAAf;;;mBAGJmK,qBAAK+I,QAAQ;AACT,QAAIlT,IAAAA,GAAO,IAAIqO,aAAAA,CAAAA,OAAJ,EAAX;AACA,SAAK0E,IAAL,CAAU/S,IAAV;AAEA,QAAIhW,IAAAA,GAAOkpB,MAAAA,CAAOA,MAAAA,CAAOr3B,MAAPq3B,GAAgB,CAAvBA,CAAX;;AACA,QAAKlpB,IAAAA,CAAK,CAALA,CAAAA,KAAY,GAAjB,EAAuB;AACnB,WAAK6f,SAAL,GAAiB,IAAjB;AACAqJ,MAAAA,MAAAA,CAAOhoB,GAAPgoB;AACH;;AACD,QAAKlpB,IAAAA,CAAK,CAALA,CAAL,EAAe;AACXgW,MAAAA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,GAAkB;AAAEtV,QAAAA,IAAAA,EAAMV,IAAAA,CAAK,CAALA,CAAR;AAAiBkL,QAAAA,MAAAA,EAAQlL,IAAAA,CAAK,CAALA;AAAzB,OAAlBgW;AADJ,KAAA,MAEO;AACHA,MAAAA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,GAAkB;AAAEtV,QAAAA,IAAAA,EAAMV,IAAAA,CAAK,CAALA,CAAR;AAAiBkL,QAAAA,MAAAA,EAAQlL,IAAAA,CAAK,CAALA;AAAzB,OAAlBgW;AACH;;AAED,WAAQkT,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,MAAiB,MAAzB,EAAkC;AAC9B,UAAKA,MAAAA,CAAOr3B,MAAPq3B,KAAkB,CAAvB,EAA2B,KAAKE,WAAL,CAAiBF,MAAjB;AAC3BlT,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUgL,MAAVhL,IAAoBkT,MAAAA,CAAOvlB,KAAPulB,GAAe,CAAfA,CAApBlT;AACH;;AACDA,IAAAA,IAAAA,CAAKxa,MAALwa,CAAY4F,KAAZ5F,GAAoB;AAAEtV,MAAAA,IAAAA,EAAMwoB,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAAR;AAAsBhe,MAAAA,MAAAA,EAAQge,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA;AAA9B,KAApBlT;AAEAA,IAAAA,IAAAA,CAAKqK,IAALrK,GAAY,EAAZA;;AACA,WAAQkT,MAAAA,CAAOr3B,MAAf,EAAwB;AACpB,UAAIqH,IAAAA,GAAOgwB,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAAX;;AACA,UAAKhwB,IAAAA,KAAS,GAATA,IAAgBA,IAAAA,KAAS,OAAzBA,IAAoCA,IAAAA,KAAS,SAAlD,EAA8D;AAC1D;AACH;;AACD8c,MAAAA,IAAAA,CAAKqK,IAALrK,IAAakT,MAAAA,CAAOvlB,KAAPulB,GAAe,CAAfA,CAAblT;AACH;;AAEDA,IAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,GAAoB,EAApBA;AAEA,QAAIzU,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,WAAQ2nB,MAAAA,CAAOr3B,MAAf,EAAwB;AACpB0P,MAAAA,KAAAA,GAAQ2nB,MAAAA,CAAOvlB,KAAPulB,EAAR3nB;;AAEA,UAAKA,KAAAA,CAAM,CAANA,CAAAA,KAAa,GAAlB,EAAwB;AACpByU,QAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,IAAqBzU,KAAAA,CAAM,CAANA,CAArByU;AACA;AAFJ,OAAA,MAGO;AACHA,QAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,IAAqBzU,KAAAA,CAAM,CAANA,CAArByU;AACH;AACJ;;AAED,QAAKA,IAAAA,CAAKqK,IAALrK,CAAU,CAAVA,MAAiB,GAAjBA,IAAwBA,IAAAA,CAAKqK,IAALrK,CAAU,CAAVA,MAAiB,GAA9C,EAAoD;AAChDA,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUgL,MAAVhL,IAAoBA,IAAAA,CAAKqK,IAALrK,CAAU,CAAVA,CAApBA;AACAA,MAAAA,IAAAA,CAAKqK,IAALrK,GAAYA,IAAAA,CAAKqK,IAALrK,CAAUlc,KAAVkc,CAAgB,CAAhBA,CAAZA;AACH;;AACDA,IAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,IAAqB,KAAKsT,0BAAL,CAAgCJ,MAAhC,CAArBlT;AACA,SAAKuT,uBAAL,CAA6BL,MAA7B;;AAEA,SAAM,IAAIn3B,CAAAA,GAAIm3B,MAAAA,CAAOr3B,MAAPq3B,GAAgB,CAA9B,EAAiCn3B,CAAAA,GAAI,CAArC,EAAwCA,CAAAA,EAAxC,EAA8C;AAC1CwP,MAAAA,KAAAA,GAAQ2nB,MAAAA,CAAOn3B,CAAPm3B,CAAR3nB;;AACA,UAAKA,KAAAA,CAAM,CAANA,CAAAA,CAASjK,WAATiK,OAA2B,YAAhC,EAA+C;AAC3CyU,QAAAA,IAAAA,CAAKuK,SAALvK,GAAiB,IAAjBA;AACA,YAAI7e,MAAAA,GAAS,KAAKqyB,UAAL,CAAgBN,MAAhB,EAAwBn3B,CAAxB,CAAb;AACAoF,QAAAA,MAAAA,GAAS,KAAKsyB,aAAL,CAAmBP,MAAnB,IAA6B/xB,MAAtCA;AACA,YAAKA,MAAAA,KAAW,aAAhB,EAAgC6e,IAAAA,CAAK8J,IAAL9J,CAAUuK,SAAVvK,GAAsB7e,MAAtB6e;AAChC;AALJ,OAAA,MAOO,IAAIzU,KAAAA,CAAM,CAANA,CAAAA,CAASjK,WAATiK,OAA2B,WAA/B,EAA4C;AAC/C,YAAImoB,KAAAA,GAAQR,MAAAA,CAAOpvB,KAAPovB,CAAa,CAAbA,CAAZ;AACA,YAAIpsB,GAAAA,GAAQ,EAAZ;;AACA,aAAM,IAAI4S,CAAAA,GAAI3d,CAAd,EAAiB2d,CAAAA,GAAI,CAArB,EAAwBA,CAAAA,EAAxB,EAA8B;AAC1B,cAAIxW,KAAAA,GAAOwwB,KAAAA,CAAMha,CAANga,CAAAA,CAAS,CAATA,CAAX;;AACA,cAAK5sB,GAAAA,CAAIG,IAAJH,GAAWjB,OAAXiB,CAAmB,GAAnBA,MAA4B,CAA5BA,IAAiC5D,KAAAA,KAAS,OAA/C,EAAyD;AACrD;AACH;;AACD4D,UAAAA,GAAAA,GAAM4sB,KAAAA,CAAMxoB,GAANwoB,GAAY,CAAZA,IAAiB5sB,GAAvBA;AACH;;AACD,YAAKA,GAAAA,CAAIG,IAAJH,GAAWjB,OAAXiB,CAAmB,GAAnBA,MAA4B,CAAjC,EAAqC;AACjCkZ,UAAAA,IAAAA,CAAKuK,SAALvK,GAAiB,IAAjBA;AACAA,UAAAA,IAAAA,CAAK8J,IAAL9J,CAAUuK,SAAVvK,GAAsBlZ,GAAtBkZ;AACAkT,UAAAA,MAAAA,GAASQ,KAATR;AACH;AACJ;;AAED,UAAK3nB,KAAAA,CAAM,CAANA,CAAAA,KAAa,OAAbA,IAAwBA,KAAAA,CAAM,CAANA,CAAAA,KAAa,SAA1C,EAAsD;AAClD;AACH;AACJ;;AAED,SAAK0e,GAAL,CAASjK,IAAT,EAAe,OAAf,EAAwBkT,MAAxB;AAEA,QAAKlT,IAAAA,CAAK9Y,KAAL8Y,CAAWna,OAAXma,CAAmB,GAAnBA,MAA4B,CAAC,CAAlC,EAAsC,KAAK2T,oBAAL,CAA0BT,MAA1B;;;mBAG1CvI,yBAAOpf,OAAO;AACV,QAAIyU,IAAAA,GAAQ,IAAIqS,QAAAA,CAAAA,OAAJ,EAAZ;AACArS,IAAAA,IAAAA,CAAKnP,IAALmP,GAAYzU,KAAAA,CAAM,CAANA,CAAAA,CAASzH,KAATyH,CAAe,CAAfA,CAAZyU;;AACA,QAAKA,IAAAA,CAAKnP,IAALmP,KAAc,EAAnB,EAAwB;AACpB,WAAK4T,aAAL,CAAmB5T,IAAnB,EAAyBzU,KAAzB;AACH;;AACD,SAAKwnB,IAAL,CAAU/S,IAAV,EAAgBzU,KAAAA,CAAM,CAANA,CAAhB,EAA0BA,KAAAA,CAAM,CAANA,CAA1B;AAEA,QAAIhB,IAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAIoD,KAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAI3D,IAAAA,GAAS,KAAb;AACA,QAAIlL,IAAAA,GAAS,KAAb;AACA,QAAI8rB,MAAAA,GAAS,EAAb;;AAEA,WAAQ,CAAC,KAAK9iB,SAAL,CAAekD,SAAf,EAAT,EAAsC;AAClCO,MAAAA,KAAAA,GAAQ,KAAKzD,SAAL,CAAemD,SAAf,EAARM;;AAEA,UAAKA,KAAAA,CAAM,CAANA,CAAAA,KAAa,GAAlB,EAAwB;AACpByU,QAAAA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,GAAkB;AAAEtV,UAAAA,IAAAA,EAAMa,KAAAA,CAAM,CAANA,CAAR;AAAkB2J,UAAAA,MAAAA,EAAQ3J,KAAAA,CAAM,CAANA;AAA1B,SAAlByU;AACA,aAAK6J,SAAL,GAAiB,IAAjB;AACA;AAHJ,OAAA,MAIO,IAAKte,KAAAA,CAAM,CAANA,CAAAA,KAAa,GAAlB,EAAwB;AAC3BzM,QAAAA,IAAAA,GAAO,IAAPA;AACA;AAFG,OAAA,MAGA,IAAKyM,KAAAA,CAAM,CAANA,CAAAA,KAAa,GAAlB,EAAuB;AAC1B,YAAKqf,MAAAA,CAAO/uB,MAAP+uB,GAAgB,CAArB,EAAyB;AACrBjd,UAAAA,KAAAA,GAAQid,MAAAA,CAAO/uB,MAAP+uB,GAAgB,CAAxBjd;AACApD,UAAAA,IAAAA,GAAOqgB,MAAAA,CAAOjd,KAAPid,CAAPrgB;;AACA,iBAAQA,IAAAA,IAAQA,IAAAA,CAAK,CAALA,CAAAA,KAAY,OAA5B,EAAsC;AAClCA,YAAAA,IAAAA,GAAOqgB,MAAAA,CAAO,EAAEjd,KAATid,CAAPrgB;AACH;;AACD,cAAKA,IAAL,EAAY;AACRyV,YAAAA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,GAAkB;AAAEtV,cAAAA,IAAAA,EAAMH,IAAAA,CAAK,CAALA,CAAR;AAAiB2K,cAAAA,MAAAA,EAAQ3K,IAAAA,CAAK,CAALA;AAAzB,aAAlByV;AACH;AACJ;;AACD,aAAKpD,GAAL,CAASrR,KAAT;AACA;AAZG,OAAA,MAaA;AACHqf,QAAAA,MAAAA,CAAOnvB,IAAPmvB,CAAYrf,KAAZqf;AACH;;AAED,UAAK,KAAK9iB,SAAL,CAAekD,SAAf,EAAL,EAAkC;AAC9BhB,QAAAA,IAAAA,GAAO,IAAPA;AACA;AACH;AACJ;;AAEDgW,IAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,GAAoB,KAAKqT,wBAAL,CAA8BzI,MAA9B,CAApB5K;;AACA,QAAK4K,MAAAA,CAAO/uB,MAAZ,EAAqB;AACjBmkB,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAU6K,SAAV7K,GAAsB,KAAKsT,0BAAL,CAAgC1I,MAAhC,CAAtB5K;AACA,WAAKiK,GAAL,CAASjK,IAAT,EAAe,QAAf,EAAyB4K,MAAzB;;AACA,UAAK5gB,IAAL,EAAY;AACRuB,QAAAA,KAAAA,GAAQqf,MAAAA,CAAOA,MAAAA,CAAO/uB,MAAP+uB,GAAgB,CAAvBA,CAARrf;AACAyU,QAAAA,IAAAA,CAAKxa,MAALwa,CAAYpD,GAAZoD,GAAoB;AAAEtV,UAAAA,IAAAA,EAAMa,KAAAA,CAAM,CAANA,CAAR;AAAkB2J,UAAAA,MAAAA,EAAQ3J,KAAAA,CAAM,CAANA;AAA1B,SAApByU;AACA,aAAK4Q,MAAL,GAAoB5Q,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAA9B;AACApK,QAAAA,IAAAA,CAAK8J,IAAL9J,CAAUoK,OAAVpK,GAAoB,EAApBA;AACH;AARL,KAAA,MASO;AACHA,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAU6K,SAAV7K,GAAsB,EAAtBA;AACAA,MAAAA,IAAAA,CAAK4K,MAAL5K,GAAsB,EAAtBA;AACH;;AAED,QAAKlhB,IAAL,EAAY;AACRkhB,MAAAA,IAAAA,CAAK8K,KAAL9K,GAAe,EAAfA;AACA,WAAKwQ,OAAL,GAAexQ,IAAf;AACH;;;mBAGLpD,mBAAIrR,OAAO;AACP,QAAK,KAAKilB,OAAL,CAAa1F,KAAb,IAAsB,KAAK0F,OAAL,CAAa1F,KAAb,CAAmBjvB,MAA9C,EAAuD;AACnD,WAAK20B,OAAL,CAAa1G,IAAb,CAAkBD,SAAlB,GAA8B,KAAKA,SAAnC;AACH;;AACD,SAAKA,SAAL,GAAiB,KAAjB;AAEA,SAAK2G,OAAL,CAAa1G,IAAb,CAAkBT,KAAlB,GAA0B,CAAC,KAAKmH,OAAL,CAAa1G,IAAb,CAAkBT,KAAlB,IAA2B,EAA5B,IAAkC,KAAKuH,MAAjE;AACA,SAAKA,MAAL,GAAc,EAAd;;AAEA,QAAK,KAAKJ,OAAL,CAAarF,MAAlB,EAA2B;AACvB,WAAKqF,OAAL,CAAahrB,MAAb,CAAoBoX,GAApB,GAA0B;AAAElS,QAAAA,IAAAA,EAAMa,KAAAA,CAAM,CAANA,CAAR;AAAkB2J,QAAAA,MAAAA,EAAQ3J,KAAAA,CAAM,CAANA;AAA1B,OAA1B;AACA,WAAKilB,OAAL,GAAe,KAAKA,OAAL,CAAarF,MAA5B;AAFJ,KAAA,MAGO;AACH,WAAK0I,eAAL,CAAqBtoB,KAArB;AACH;;;mBAGLunB,6BAAU;AACN,QAAK,KAAKtC,OAAL,CAAarF,MAAlB,EAA2B,KAAK2I,aAAL;;AAC3B,QAAK,KAAKtD,OAAL,CAAa1F,KAAb,IAAsB,KAAK0F,OAAL,CAAa1F,KAAb,CAAmBjvB,MAA9C,EAAuD;AACnD,WAAK20B,OAAL,CAAa1G,IAAb,CAAkBD,SAAlB,GAA8B,KAAKA,SAAnC;AACH;;AACD,SAAK2G,OAAL,CAAa1G,IAAb,CAAkBT,KAAlB,GAA0B,CAAC,KAAKmH,OAAL,CAAa1G,IAAb,CAAkBT,KAAlB,IAA2B,EAA5B,IAAkC,KAAKuH,MAAjE;;;mBAGJ+B,uCAAcpnB,OAAO;AACjB,SAAKqlB,MAAL,IAAerlB,KAAAA,CAAM,CAANA,CAAf;;AACA,QAAK,KAAKilB,OAAL,CAAa1F,KAAlB,EAA0B;AACtB,UAAIvgB,IAAAA,GAAO,KAAKimB,OAAL,CAAa1F,KAAb,CAAmB,KAAK0F,OAAL,CAAa1F,KAAb,CAAmBjvB,MAAnB,GAA4B,CAA/C,CAAX;;AACA,UAAK0O,IAAAA,IAAQA,IAAAA,CAAKrH,IAALqH,KAAc,MAAtBA,IAAgC,CAACA,IAAAA,CAAKuf,IAALvf,CAAUmgB,YAAhD,EAA+D;AAC3DngB,QAAAA,IAAAA,CAAKuf,IAALvf,CAAUmgB,YAAVngB,GAAyB,KAAKqmB,MAA9BrmB;AACA,aAAKqmB,MAAL,GAAc,EAAd;AACH;AACJ;KAGL;;;mBAEAmC,qBAAK/S,MAAMtV,MAAMwK,QAAQ;AACrB,SAAKsb,OAAL,CAAa/0B,IAAb,CAAkBukB,IAAlB;AAEAA,IAAAA,IAAAA,CAAKxa,MAALwa,GAAc;AAAE4F,MAAAA,KAAAA,EAAO;AAAElb,QAAAA,IAAAA,EAAAA,IAAF;AAAQwK,QAAAA,MAAAA,EAAAA;AAAR,OAAT;AAA2B5L,MAAAA,KAAAA,EAAO,KAAKA;AAAvC,KAAd0W;AACAA,IAAAA,IAAAA,CAAK8J,IAAL9J,CAAUgL,MAAVhL,GAAmB,KAAK4Q,MAAxB5Q;AACA,SAAK4Q,MAAL,GAAc,EAAd;AACA,QAAK5Q,IAAAA,CAAK9c,IAAL8c,KAAc,SAAnB,EAA+B,KAAK6J,SAAL,GAAiB,KAAjB;;;mBAGnCI,mBAAIjK,MAAMqK,MAAM6I,QAAQ;AACpB,QAAI3nB,KAAAA,GAAAA,KAAAA,CAAJ;AAAA,QAAWrI,IAAAA,GAAAA,KAAAA,CAAX;AACA,QAAIrH,MAAAA,GAASq3B,MAAAA,CAAOr3B,MAApB;AACA,QAAIqL,KAAAA,GAAS,EAAb;AACA,QAAI9F,KAAAA,GAAS,IAAb;AACA,QAAIyI,IAAAA,GAAAA,KAAAA,CAAJ;AAAA,QAAUU,IAAAA,GAAAA,KAAAA,CAAV;AACA,QAAM2nB,OAAAA,GAAU,mBAAhB;;AAEA,SAAM,IAAIn2B,CAAAA,GAAI,CAAd,EAAiBA,CAAAA,GAAIF,MAArB,EAA6BE,CAAAA,IAAK,CAAlC,EAAsC;AAClCwP,MAAAA,KAAAA,GAAQ2nB,MAAAA,CAAOn3B,CAAPm3B,CAAR3nB;AACArI,MAAAA,IAAAA,GAAQqI,KAAAA,CAAM,CAANA,CAARrI;;AAEA,UAAKA,IAAAA,KAAS,SAATA,IAAsB8c,IAAAA,CAAK9c,IAAL8c,KAAc,MAAzC,EAAkD;AAC9CzV,QAAAA,IAAAA,GAAO2oB,MAAAA,CAAOn3B,CAAAA,GAAI,CAAXm3B,CAAP3oB;AACAV,QAAAA,IAAAA,GAAOqpB,MAAAA,CAAOn3B,CAAAA,GAAI,CAAXm3B,CAAPrpB;;AAEA,YACIU,IAAAA,CAAK,CAALA,CAAAA,KAAY,OAAZA,IACAV,IAAAA,CAAK,CAALA,CAAAA,KAAY,OADZU,IAEA2nB,OAAAA,CAAQzqB,IAARyqB,CAAa3nB,IAAAA,CAAK,CAALA,CAAb2nB,CAFA3nB,IAGA2nB,OAAAA,CAAQzqB,IAARyqB,CAAaroB,IAAAA,CAAK,CAALA,CAAbqoB,CAJJ,EAKE;AACEhrB,UAAAA,KAAAA,IAASqE,KAAAA,CAAM,CAANA,CAATrE;AANJ,SAAA,MAOO;AACH9F,UAAAA,KAAAA,GAAQ,KAARA;AACH;;AAED;AACH;;AAED,UAAK8B,IAAAA,KAAS,SAATA,IAAsBA,IAAAA,KAAS,OAATA,IAAoBnH,CAAAA,KAAMF,MAAAA,GAAS,CAA9D,EAAkE;AAC9DuF,QAAAA,KAAAA,GAAQ,KAARA;AADJ,OAAA,MAEO;AACH8F,QAAAA,KAAAA,IAASqE,KAAAA,CAAM,CAANA,CAATrE;AACH;AACJ;;AACD,QAAK,CAAC9F,KAAN,EAAc;AACV,UAAI6oB,GAAAA,GAAMiJ,MAAAA,CAAOp3B,MAAPo3B,CAAe,UAACa,GAAD,EAAMh4B,CAAN,EAAA;AAAA,eAAYg4B,GAAAA,GAAMh4B,CAAAA,CAAE,CAAFA,CAAlB;AAAf,OAAAm3B,EAAuC,EAAvCA,CAAV;AACAlT,MAAAA,IAAAA,CAAK8J,IAAL9J,CAAUqK,IAAVrK,IAAkB;AAAE9Y,QAAAA,KAAAA,EAAAA,KAAF;AAAS+iB,QAAAA,GAAAA,EAAAA;AAAT,OAAlBjK;AACH;;AACDA,IAAAA,IAAAA,CAAKqK,IAALrK,CAAAA,GAAa9Y,KAAb8Y;;;mBAGJqT,6DAAyBH,QAAQ;AAC7B,QAAIc,aAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAIpD,MAAAA,GAAS,EAAb;;AACA,WAAQsC,MAAAA,CAAOr3B,MAAf,EAAwB;AACpBm4B,MAAAA,aAAAA,GAAgBd,MAAAA,CAAOA,MAAAA,CAAOr3B,MAAPq3B,GAAgB,CAAvBA,CAAAA,CAA0B,CAA1BA,CAAhBc;AACA,UAAKA,aAAAA,KAAkB,OAAlBA,IACDA,aAAAA,KAAkB,SADtB,EACkC;AAClCpD,MAAAA,MAAAA,GAASsC,MAAAA,CAAOhoB,GAAPgoB,GAAa,CAAbA,IAAkBtC,MAA3BA;AACH;;AACD,WAAOA,MAAP;;;mBAGJ0C,iEAA2BJ,QAAQ;AAC/B,QAAIrpB,IAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAI+mB,MAAAA,GAAS,EAAb;;AACA,WAAQsC,MAAAA,CAAOr3B,MAAf,EAAwB;AACpBgO,MAAAA,IAAAA,GAAOqpB,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAAPrpB;AACA,UAAKA,IAAAA,KAAS,OAATA,IAAoBA,IAAAA,KAAS,SAAlC,EAA8C;AAC9C+mB,MAAAA,MAAAA,IAAUsC,MAAAA,CAAOvlB,KAAPulB,GAAe,CAAfA,CAAVtC;AACH;;AACD,WAAOA,MAAP;;;mBAGJ6C,uCAAcP,QAAQ;AAClB,QAAIc,aAAAA,GAAAA,KAAAA,CAAJ;AACA,QAAIpD,MAAAA,GAAS,EAAb;;AACA,WAAQsC,MAAAA,CAAOr3B,MAAf,EAAwB;AACpBm4B,MAAAA,aAAAA,GAAgBd,MAAAA,CAAOA,MAAAA,CAAOr3B,MAAPq3B,GAAgB,CAAvBA,CAAAA,CAA0B,CAA1BA,CAAhBc;AACA,UAAKA,aAAAA,KAAkB,OAAvB,EAAiC;AACjCpD,MAAAA,MAAAA,GAASsC,MAAAA,CAAOhoB,GAAPgoB,GAAa,CAAbA,IAAkBtC,MAA3BA;AACH;;AACD,WAAOA,MAAP;;;mBAGJ4C,iCAAWN,QAAQpO,MAAM;AACrB,QAAIpX,MAAAA,GAAS,EAAb;;AACA,SAAM,IAAI3R,CAAAA,GAAI+oB,IAAd,EAAoB/oB,CAAAA,GAAIm3B,MAAAA,CAAOr3B,MAA/B,EAAuCE,CAAAA,EAAvC,EAA6C;AACzC2R,MAAAA,MAAAA,IAAUwlB,MAAAA,CAAOn3B,CAAPm3B,CAAAA,CAAU,CAAVA,CAAVxlB;AACH;;AACDwlB,IAAAA,MAAAA,CAAOj3B,MAAPi3B,CAAcpO,IAAdoO,EAAoBA,MAAAA,CAAOr3B,MAAPq3B,GAAgBpO,IAApCoO;AACA,WAAOxlB,MAAP;;;mBAGJob,uBAAMoK,QAAQ;AACV,QAAID,QAAAA,GAAW,CAAf;AACA,QAAI1nB,KAAAA,GAAAA,KAAAA,CAAJ;AAAA,QAAWrI,IAAAA,GAAAA,KAAAA,CAAX;AAAA,QAAiBqH,IAAAA,GAAAA,KAAAA,CAAjB;;AACA,SAAM,IAAIxO,CAAAA,GAAI,CAAd,EAAiBA,CAAAA,GAAIm3B,MAAAA,CAAOr3B,MAA5B,EAAoCE,CAAAA,EAApC,EAA0C;AACtCwP,MAAAA,KAAAA,GAAQ2nB,MAAAA,CAAOn3B,CAAPm3B,CAAR3nB;AACArI,MAAAA,IAAAA,GAAQqI,KAAAA,CAAM,CAANA,CAARrI;;AAEA,UAAKA,IAAAA,KAAS,GAAd,EAAoB;AAChB+vB,QAAAA,QAAAA,IAAY,CAAZA;AADJ,OAAA,MAEO,IAAK/vB,IAAAA,KAAS,GAAd,EAAoB;AACvB+vB,QAAAA,QAAAA,IAAY,CAAZA;AADG,OAAA,MAEA,IAAKA,QAAAA,KAAa,CAAbA,IAAkB/vB,IAAAA,KAAS,GAAhC,EAAsC;AACzC,YAAK,CAACqH,IAAN,EAAa;AACT,eAAK0pB,WAAL,CAAiB1oB,KAAjB;AADJ,SAAA,MAEO,IAAKhB,IAAAA,CAAK,CAALA,CAAAA,KAAY,MAAZA,IAAsBA,IAAAA,CAAK,CAALA,CAAAA,KAAY,QAAvC,EAAkD;AACrD;AADG,SAAA,MAEA;AACH,iBAAOxO,CAAP;AACH;AACJ;;AAEDwO,MAAAA,IAAAA,GAAOgB,KAAPhB;AACH;;AACD,WAAO,KAAP;KAGJ;;;mBAEA4oB,2CAAgBH,SAAS;AACrB,UAAM,KAAK1pB,KAAL,CAAWhG,KAAX,CAAiB,kBAAjB,EAAqC0vB,OAAAA,CAAQ,CAARA,CAArC,EAAiDA,OAAAA,CAAQ,CAARA,CAAjD,CAAN;;;mBAGJI,mCAAYF,QAAQ;AAChB,UAAM,KAAK5pB,KAAL,CAAWhG,KAAX,CAAiB,cAAjB,EAAiC4vB,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAAjC,EAA+CA,MAAAA,CAAO,CAAPA,CAAAA,CAAU,CAAVA,CAA/C,CAAN;;;mBAGJW,2CAAgBtoB,OAAO;AACnB,UAAM,KAAKjC,KAAL,CAAWhG,KAAX,CAAiB,cAAjB,EAAiCiI,KAAAA,CAAM,CAANA,CAAjC,EAA2CA,KAAAA,CAAM,CAANA,CAA3C,CAAN;;;mBAGJuoB,yCAAgB;AACZ,QAAInpB,GAAAA,GAAM,KAAK6lB,OAAL,CAAahrB,MAAb,CAAoBogB,KAA9B;AACA,UAAM,KAAKtc,KAAL,CAAWhG,KAAX,CAAiB,gBAAjB,EAAmCqH,GAAAA,CAAID,IAAvC,EAA6CC,GAAAA,CAAIuK,MAAjD,CAAN;;;mBAGJ+e,mCAAY1oB,OAAO;AACf,UAAM,KAAKjC,KAAL,CAAWhG,KAAX,CAAiB,cAAjB,EAAiCiI,KAAAA,CAAM,CAANA,CAAjC,EAA2CA,KAAAA,CAAM,CAANA,CAA3C,CAAN;;;mBAGJqoB,uCAAc5T,MAAMzU,OAAO;AACvB,UAAM,KAAKjC,KAAL,CAAWhG,KAAX,CAAiB,sBAAjB,EAAyCiI,KAAAA,CAAM,CAANA,CAAzC,EAAmDA,KAAAA,CAAM,CAANA,CAAnD,CAAN;;;mBAGJgoB,2DAAwBL,QAAQ;AAC5B;AACAA,IAAAA,MAAAA;;;mBAGJS,qDAAqBT,QAAQ;AACzB,QAAIpK,KAAAA,GAAQ,KAAKA,KAAL,CAAWoK,MAAX,CAAZ;AACA,QAAKpK,KAAAA,KAAU,KAAf,EAAuB;AAEvB,QAAIoL,OAAAA,GAAU,CAAd;AACA,QAAI3oB,KAAAA,GAAAA,KAAAA,CAAJ;;AACA,SAAM,IAAImO,CAAAA,GAAIoP,KAAAA,GAAQ,CAAtB,EAAyBpP,CAAAA,IAAK,CAA9B,EAAiCA,CAAAA,EAAjC,EAAuC;AACnCnO,MAAAA,KAAAA,GAAQ2nB,MAAAA,CAAOxZ,CAAPwZ,CAAR3nB;;AACA,UAAKA,KAAAA,CAAM,CAANA,CAAAA,KAAa,OAAlB,EAA4B;AACxB2oB,QAAAA,OAAAA,IAAW,CAAXA;AACA,YAAKA,OAAAA,KAAY,CAAjB,EAAqB;AACxB;AACJ;;AACD,UAAM,KAAK5qB,KAAL,CAAWhG,KAAX,CAAiB,kBAAjB,EAAqCiI,KAAAA,CAAM,CAANA,CAArC,EAA+CA,KAAAA,CAAM,CAANA,CAA/C,CAAN;;;;;;kBApgBaknB;;;;;;kBCJG5rB;;AAHxB,IAAA,OAAA,GAAA,OAAA,CAAA,UAAA,CAAA;;;;AACA,IAAA,MAAA,GAAA,OAAA,CAAA,SAAA,CAAA;;;;;;;;;;AAEe,SAASA,KAAT,CAAe2C,GAAf,EAAoB0b,IAApB,EAA0B;AACrC,MAAKA,IAAAA,IAAQA,IAAAA,CAAKiP,IAAlB,EAAyB;AACrB,UAAM,IAAI10B,KAAJ,CAAU,8BACA,4CADV,CAAN;AAEH;;AAED,MAAI6J,KAAAA,GAAQ,IAAIsd,OAAAA,CAAAA,OAAJ,CAAUpd,GAAV,EAAe0b,IAAf,CAAZ;AACA,MAAIkP,MAAAA,GAAS,IAAI3B,QAAAA,CAAAA,OAAJ,CAAWnpB,KAAX,CAAb;;AACA,MAAI;AACA8qB,IAAAA,MAAAA,CAAOvtB,KAAPutB;AADJ,GAAA,CAEE,OAAOp1B,CAAP,EAAU;AACR,QAAKA,CAAAA,CAAE6R,IAAF7R,KAAW,gBAAXA,IAA+BkmB,IAA/BlmB,IAAuCkmB,IAAAA,CAAKJ,IAAjD,EAAwD;AACpD,UAAK,WAAWrd,IAAX,CAAgByd,IAAAA,CAAKJ,IAArB,CAAL,EAAkC;AAC9B9lB,QAAAA,CAAAA,CAAE+nB,OAAF/nB,IAAa,oCACA,2BADA,GAEA,wCAFbA;AADJ,OAAA,MAIO,IAAK,UAAUyI,IAAV,CAAeyd,IAAAA,CAAKJ,IAApB,CAAL,EAAiC;AACpC9lB,QAAAA,CAAAA,CAAE+nB,OAAF/nB,IAAa,oCACA,2BADA,GAEA,wCAFbA;AADG,OAAA,MAIA,IAAK,WAAWyI,IAAX,CAAgByd,IAAAA,CAAKJ,IAArB,CAAL,EAAkC;AACrC9lB,QAAAA,CAAAA,CAAE+nB,OAAF/nB,IAAa,oCACA,2BADA,GAEA,wCAFbA;AAGH;AACJ;;AACD,UAAMA,CAAN;AACH;;AAED,SAAOo1B,MAAAA,CAAO1N,IAAd;AACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACjCD,IAAA,aAAA,GAAA,OAAA,CAAA,iBAAA,CAAA;;;;AACA,IAAA,WAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;AACA,IAAA,SAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;AACA,IAAA,OAAA,GAAA,OAAA,CAAA,UAAA,CAAA;;;;AACA,IAAA,MAAA,GAAA,OAAA,CAAA,SAAA,CAAA;;;;;;;;;;;;;;;;AAEA,SAAS2N,SAAT,CAAmB14B,GAAnB,EAAwB;AACpB,SAAO,CAAA,OAAOA,GAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,GAAP,CAAA,MAAe,QAAf,IAA2B,OAAOA,GAAAA,CAAIyE,IAAX,KAAoB,UAAtD;AACH;AAED;;;;;;;;;;IAQMixB;AAEF,WAAA,UAAA,CAAY1J,SAAZ,EAAuBne,GAAvB,EAA4B0b,IAA5B,EAAkC;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,UAAA,CAAA;;AAC9B,SAAKoP,WAAL,GAAmB,KAAnB;AACA,SAAKhC,SAAL,GAAmB,KAAnB;AAEA,QAAI5L,IAAAA,GAAAA,KAAAA,CAAJ;;AACA,QAAK,CAAA,OAAOld,GAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,GAAP,CAAA,MAAe,QAAf,IAA2BA,GAAAA,KAAQ,IAAnC,IAA2CA,GAAAA,CAAItG,IAAJsG,KAAa,MAA7D,EAAsE;AAClEkd,MAAAA,IAAAA,GAAOld,GAAPkd;AADJ,KAAA,MAEO,IAAKld,GAAAA,YAAe6nB,UAAf7nB,IAA6BA,GAAAA,YAAewmB,QAAAA,CAAAA,OAAjD,EAA0D;AAC7DtJ,MAAAA,IAAAA,GAAOld,GAAAA,CAAIkd,IAAXA;;AACA,UAAKld,GAAAA,CAAIxC,GAAT,EAAe;AACX,YAAK,OAAOke,IAAAA,CAAKle,GAAZ,KAAoB,WAAzB,EAAuCke,IAAAA,CAAKle,GAALke,GAAW,EAAXA;AACvC,YAAK,CAACA,IAAAA,CAAKle,GAALke,CAASE,MAAf,EAAwBF,IAAAA,CAAKle,GAALke,CAASE,MAATF,GAAkB,KAAlBA;AACxBA,QAAAA,IAAAA,CAAKle,GAALke,CAAS3a,IAAT2a,GAAgB1b,GAAAA,CAAIxC,GAApBke;AACH;AANE,KAAA,MAOA;AACH,UAAIkP,MAAAA,GAASvtB,OAAAA,CAAAA,OAAb;AACA,UAAKqe,IAAAA,CAAKqP,MAAV,EAAoBH,MAAAA,GAASlP,IAAAA,CAAKqP,MAALrP,CAAYre,KAArButB;AACpB,UAAKlP,IAAAA,CAAKkP,MAAV,EAAoBA,MAAAA,GAASlP,IAAAA,CAAKkP,MAAdA;AACpB,UAAKA,MAAAA,CAAOvtB,KAAZ,EAAoButB,MAAAA,GAASA,MAAAA,CAAOvtB,KAAhButB;;AAEpB,UAAI;AACA1N,QAAAA,IAAAA,GAAO0N,MAAAA,CAAO5qB,GAAP4qB,EAAYlP,IAAZkP,CAAP1N;AADJ,OAAA,CAEE,OAAOpjB,KAAP,EAAc;AACZ,aAAKA,KAAL,GAAaA,KAAb;AACH;AACJ;;AAED,SAAKoK,MAAL,GAAc,IAAIsiB,QAAAA,CAAAA,OAAJ,CAAWrI,SAAX,EAAsBjB,IAAtB,EAA4BxB,IAA5B,CAAd;AACH;AAED;;;;;;AAmGA;;;;;;;;uBAMAmL,+BAAW;AACP,WAAO,KAAKmE,IAAL,GAAYnE,QAAZ,EAAP;;AAGJ;;;;;;;;;;uBAQA3uB,+BAAW;AACP,WAAO,KAAK8H,GAAZ;;AAGJ;;;;;;;;;;;;;;;;;;;;uBAkBApJ,qBAAKq0B,aAAaC,YAAY;AAC1B,QAAI,EAAE,UAAU,KAAKxP,IAAjB,CAAJ,EAA4B;AACxB,OAAA,GAAA,UAAA,CAAA,OAAA,EACI,wDACA,oDADA,GAEA,uDAFA,GAGA,eAJJ;AAMH;;AACD,WAAO,KAAKyP,KAAL,GAAav0B,IAAb,CAAkBq0B,WAAlB,EAA+BC,UAA/B,CAAP;;AAGJ;;;;;;;;;;;;;;;;;;;uBAiBAE,wBAAMF,YAAY;AACd,WAAO,KAAKC,KAAL,GAAaC,KAAb,CAAmBF,UAAnB,CAAP;;;uBAGJG,mCAAYvxB,OAAO4jB,QAAQ;AACvB,QAAI;AACA,WAAK5jB,KAAL,GAAaA,KAAb;;AACA,UAAKA,KAAAA,CAAMuN,IAANvN,KAAe,gBAAfA,IAAmC,CAACA,KAAAA,CAAM4jB,MAA/C,EAAwD;AACpD5jB,QAAAA,KAAAA,CAAM4jB,MAAN5jB,GAAe4jB,MAAAA,CAAOiJ,aAAtB7sB;AACAA,QAAAA,KAAAA,CAAMykB,UAANzkB;AAFJ,OAAA,MAGO,IAAK4jB,MAAAA,CAAO4N,cAAZ,EAA6B;AAChC,YAAIC,UAAAA,GAAa7N,MAAAA,CAAOiJ,aAAxB;AACA,YAAI6E,SAAAA,GAAa9N,MAAAA,CAAO4N,cAAxB;AACA,YAAIG,UAAAA,GAAa,KAAKvnB,MAAL,CAAYia,SAAZ,CAAsBhQ,OAAvC;AACA,YAAIud,CAAAA,GAAIF,SAAAA,CAAUjuB,KAAViuB,CAAgB,GAAhBA,CAAR;AACA,YAAIG,CAAAA,GAAIF,UAAAA,CAAWluB,KAAXkuB,CAAiB,GAAjBA,CAAR;;AAEA,YAAKC,CAAAA,CAAE,CAAFA,CAAAA,KAASC,CAAAA,CAAE,CAAFA,CAATD,IAAiB5tB,QAAAA,CAAS4tB,CAAAA,CAAE,CAAFA,CAAT5tB,CAAAA,GAAiBA,QAAAA,CAAS6tB,CAAAA,CAAE,CAAFA,CAAT7tB,CAAvC,EAAwD;AACpDlD,UAAAA,OAAAA,CAAQd,KAARc,CACI,wCACA,+BADA,GAEA,KAFA,GAEQ6wB,UAFR,GAEqB,QAFrB,GAEgCF,UAFhC,GAE6C,GAF7C,GAGA,OAHA,GAGUC,SAHV,GAGsB,oBAHtB,GAIA,gCALJ5wB;AAMH;AACJ;AApBL,KAAA,CAqBE,OAAOX,GAAP,EAAY;AACV,UAAKW,OAAAA,IAAWA,OAAAA,CAAQd,KAAxB,EAAgCc,OAAAA,CAAQd,KAARc,CAAcX,GAAdW;AACnC;;;uBAGLgxB,+BAAU72B,SAASC,QAAQ;AAAA,QAAA,KAAA,GAAA,IAAA;;AACvB,QAAK,KAAK0oB,MAAL,IAAe,KAAKS,SAAL,CAAe0N,OAAf,CAAuBx5B,MAA3C,EAAoD;AAChD,WAAKy2B,SAAL,GAAiB,IAAjB;AACA,aAAO/zB,OAAAA,EAAP;AACH;;AAED,QAAI;AACA,UAAI2oB,MAAAA,GAAU,KAAKS,SAAL,CAAe0N,OAAf,CAAuB,KAAKnO,MAA5B,CAAd;AACA,UAAIoO,OAAAA,GAAU,KAAK5R,GAAL,CAASwD,MAAT,CAAd;AACA,WAAKA,MAAL,IAAe,CAAf;;AAEA,UAAKmN,SAAAA,CAAUiB,OAAVjB,CAAL,EAA0B;AACtBiB,QAAAA,OAAAA,CAAQl1B,IAARk1B,CAAc,YAAM;AAChB,UAAA,KAAA,CAAKF,SAAL,CAAe72B,OAAf,EAAwBC,MAAxB;AADJ,SAAA82B,EAEGV,KAFHU,CAEU,UAAA,KAAA,EAAS;AACf,UAAA,KAAA,CAAKT,WAAL,CAAiBvxB,KAAjB,EAAwB4jB,MAAxB;;AACA,UAAA,KAAA,CAAKoL,SAAL,GAAiB,IAAjB;AACA9zB,UAAAA,MAAAA,CAAO8E,KAAP9E,CAAAA;AALJ,SAAA82B;AADJ,OAAA,MAQO;AACH,aAAKF,SAAL,CAAe72B,OAAf,EAAwBC,MAAxB;AACH;AAfL,KAAA,CAiBE,OAAO8E,KAAP,EAAc;AACZ,WAAKgvB,SAAL,GAAiB,IAAjB;AACA9zB,MAAAA,MAAAA,CAAO8E,KAAP9E,CAAAA;AACH;;;uBAGLm2B,yBAAQ;AAAA,QAAA,MAAA,GAAA,IAAA;;AACJ,QAAK,KAAKrC,SAAV,EAAsB;AAClB,aAAO,IAAIh0B,OAAJ,CAAa,UAACC,OAAD,EAAUC,MAAV,EAAqB;AACrC,YAAK,MAAA,CAAK8E,KAAV,EAAkB;AACd9E,UAAAA,MAAAA,CAAO,MAAA,CAAK8E,KAAZ9E,CAAAA;AADJ,SAAA,MAEO;AACHD,UAAAA,OAAAA,CAAQ,MAAA,CAAKc,SAAL,EAARd,CAAAA;AACH;AALE,OAAA,CAAP;AAOH;;AACD,QAAK,KAAKg3B,UAAV,EAAuB;AACnB,aAAO,KAAKA,UAAZ;AACH;;AAED,SAAKA,UAAL,GAAkB,IAAIj3B,OAAJ,CAAa,UAACC,OAAD,EAAUC,MAAV,EAAqB;AAChD,UAAK,MAAA,CAAK8E,KAAV,EAAkB,OAAO9E,MAAAA,CAAO,MAAA,CAAK8E,KAAZ9E,CAAP;AAClB,MAAA,MAAA,CAAK0oB,MAAL,GAAc,CAAd;;AACA,MAAA,MAAA,CAAKkO,SAAL,CAAe72B,OAAf,EAAwBC,MAAxB;AAHc,KAAA,EAIf4B,IAJe,CAIT,YAAM;AACX,MAAA,MAAA,CAAKkyB,SAAL,GAAiB,IAAjB;AACA,aAAO,MAAA,CAAKjzB,SAAL,EAAP;AANc,KAAA,CAAlB;AASA,WAAO,KAAKk2B,UAAZ;;;uBAGJf,uBAAO;AACH,QAAK,KAAKlC,SAAV,EAAsB,OAAO,KAAK5kB,MAAZ;AACtB,SAAK4kB,SAAL,GAAiB,IAAjB;;AAEA,QAAK,KAAKiD,UAAV,EAAuB;AACnB,YAAM,IAAI91B,KAAJ,CACF,sDADE,CAAN;AAEH;;AAED,QAAK,KAAK6D,KAAV,EAAkB,MAAM,KAAKA,KAAX;;AAElB,SAAA,IAAA,SAAA,GAAoB,KAAKoK,MAAL,CAAYia,SAAZ,CAAsB0N,OAA1C,EAAA,QAAA,GAAA,KAAA,CAAA,OAAA,CAAA,SAAA,CAAA,EAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,QAAA,GAAA,SAAA,GAAA,SAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAoD;AAAA,UAAA,IAAA;;AAAA,UAAA,QAAA,EAAA;AAAA,YAAA,EAAA,IAAA,SAAA,CAAA,MAAA,EAAA;AAAA,QAAA,IAAA,GAAA,SAAA,CAAA,EAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA;AAAA,YAAA,EAAA,CAAA,IAAA,EAAA;AAAA,QAAA,IAAA,GAAA,EAAA,CAAA,KAAA;AAAA;;AAAA,UAA1CnO,MAA0C,GAAA,IAAA;AAChD,UAAIoO,OAAAA,GAAU,KAAK5R,GAAL,CAASwD,MAAT,CAAd;;AACA,UAAKmN,SAAAA,CAAUiB,OAAVjB,CAAL,EAA0B;AACtB,cAAM,IAAI50B,KAAJ,CACF,sDADE,CAAN;AAEH;AACJ;;AAED,WAAO,KAAKiO,MAAZ;;;uBAGJgW,mBAAIwD,QAAQ;AACR,SAAKxZ,MAAL,CAAYwiB,UAAZ,GAAyBhJ,MAAzB;;AAEA,QAAI;AACA,aAAOA,MAAAA,CAAO,KAAKxZ,MAAL,CAAYgZ,IAAnBQ,EAAyB,KAAKxZ,MAA9BwZ,CAAP;AADJ,KAAA,CAEE,OAAO5jB,KAAP,EAAc;AACZ,WAAKuxB,WAAL,CAAiBvxB,KAAjB,EAAwB4jB,MAAxB;AACA,YAAM5jB,KAAN;AACH;;;uBAGLjE,iCAAY;AACR,QAAK,KAAKi1B,WAAV,EAAwB,OAAO,KAAK5mB,MAAZ;AACxB,SAAK4mB,WAAL,GAAmB,IAAnB;AAEA,SAAKE,IAAL;AAEA,QAAItP,IAAAA,GAAO,KAAKxX,MAAL,CAAYwX,IAAvB;AACA,QAAIpe,GAAAA,GAAOzH,WAAAA,CAAAA,OAAX;AACA,QAAK6lB,IAAAA,CAAKqP,MAAV,EAAwBztB,GAAAA,GAAMoe,IAAAA,CAAKqP,MAALrP,CAAY7lB,SAAlByH;AACxB,QAAKoe,IAAAA,CAAK+H,WAAV,EAAwBnmB,GAAAA,GAAMoe,IAAAA,CAAK+H,WAAXnmB;AACxB,QAAKA,GAAAA,CAAIzH,SAAT,EAAwByH,GAAAA,GAAMA,GAAAA,CAAIzH,SAAVyH;AAExB,QAAIE,GAAAA,GAAO,IAAIsnB,cAAAA,CAAAA,OAAJ,CAAiBxnB,GAAjB,EAAsB,KAAK4G,MAAL,CAAYgZ,IAAlC,EAAwC,KAAKhZ,MAAL,CAAYwX,IAApD,CAAX;AACA,QAAI4H,IAAAA,GAAO9lB,GAAAA,CAAI6oB,QAAJ7oB,EAAX;AACA,SAAK0G,MAAL,CAAYlE,GAAZ,GAAkBsjB,IAAAA,CAAK,CAALA,CAAlB;AACA,SAAKpf,MAAL,CAAY1G,GAAZ,GAAkB8lB,IAAAA,CAAK,CAALA,CAAlB;AAEA,WAAO,KAAKpf,MAAZ;;;;;wBA3SY;AACZ,aAAO,KAAKA,MAAL,CAAYia,SAAnB;AACH;AAED;;;;;;;wBAIW;AACP,aAAO,KAAKja,MAAL,CAAYwX,IAAnB;AACH;AAED;;;;;;;;;;;;;;;wBAYU;AACN,aAAO,KAAK7lB,SAAL,GAAiBmK,GAAxB;AACH;AAED;;;;;;;;;;;;;;;wBAYc;AACV,aAAO,KAAKnK,SAAL,GAAiB4K,OAAxB;AACH;AAED;;;;;;;;;;;;;;;wBAYU;AACN,aAAO,KAAK5K,SAAL,GAAiB2H,GAAxB;AACH;AAED;;;;;;;;;;;;;;;;wBAaW;AACP,aAAO,KAAKwtB,IAAL,GAAY9N,IAAnB;AACH;AAED;;;;;;;;;;;;;;;;wBAae;AACX,aAAO,KAAK8N,IAAL,GAAYvE,QAAnB;AACH;;;;;;kBAoNUoB;AAEf;;;;;AAKA;;;;;;;;;;;;;;;;;;;AC9WA,IAAA,WAAA,GAAA,OAAA,CAAA,eAAA,CAAA;;;;;;;;;;;;;;;AAEA;;;;;;;;;;;IASMC;AAEF;;;;AAIA,WAAA,SAAA,GAA0B;AAAA,QAAd+D,OAAc,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAJ,EAAI;;AAAA,IAAA,eAAA,CAAA,IAAA,EAAA,SAAA,CAAA;AACtB;;;;;;;;;;AAQA,SAAK1d,OAAL,GAAe,QAAf;AACA;;;;;;;;AAOA,SAAK0d,OAAL,GAAe,KAAKvmB,SAAL,CAAeumB,OAAf,CAAf;AACH;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;sBA6BAG,mBAAItO,QAAQ;AACR,SAAKmO,OAAL,GAAe,KAAKA,OAAL,CAAazzB,MAAb,CAAoB,KAAKkN,SAAL,CAAe,CAACoY,MAAD,CAAf,CAApB,CAAf;AACA,WAAO,IAAP;;AAGJ;;;;;;;;;;;;;;;;;;;;;;;;sBAsBA1E,2BAAQhZ,KAAiB;AAAA,QAAZ0b,IAAY,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAL,EAAK;AACrB,WAAO,IAAImM,YAAAA,CAAAA,OAAJ,CAAe,IAAf,EAAqB7nB,GAArB,EAA0B0b,IAA1B,CAAP;;;sBAGJpW,+BAAUumB,SAAS;AACf,QAAII,UAAAA,GAAa,EAAjB;;AACA,SAAA,IAAA,SAAA,GAAeJ,OAAf,EAAA,QAAA,GAAA,KAAA,CAAA,OAAA,CAAA,SAAA,CAAA,EAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,QAAA,GAAA,SAAA,GAAA,SAAA,CAAA,MAAA,CAAA,QAAA,CAAA,EAAA,IAAyB;AAAA,UAAA,IAAA;;AAAA,UAAA,QAAA,EAAA;AAAA,YAAA,EAAA,IAAA,SAAA,CAAA,MAAA,EAAA;AAAA,QAAA,IAAA,GAAA,SAAA,CAAA,EAAA,EAAA,CAAA;AAAA,OAAA,MAAA;AAAA,QAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA;AAAA,YAAA,EAAA,CAAA,IAAA,EAAA;AAAA,QAAA,IAAA,GAAA,EAAA,CAAA,KAAA;AAAA;;AAAA,UAAft5B,CAAe,GAAA,IAAA;AACrB,UAAKA,CAAAA,CAAE25B,OAAP,EAAiB35B,CAAAA,GAAIA,CAAAA,CAAE25B,OAAN35B;;AAEjB,UAAK,CAAA,OAAOA,CAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,CAAP,CAAA,MAAa,QAAb,IAAyB8H,KAAAA,CAAM+c,OAAN/c,CAAc9H,CAAAA,CAAEs5B,OAAhBxxB,CAA9B,EAAyD;AACrD4xB,QAAAA,UAAAA,GAAaA,UAAAA,CAAW7zB,MAAX6zB,CAAkB15B,CAAAA,CAAEs5B,OAApBI,CAAbA;AADJ,OAAA,MAEO,IAAK,OAAO15B,CAAP,KAAa,UAAlB,EAA+B;AAClC05B,QAAAA,UAAAA,CAAWh6B,IAAXg6B,CAAgB15B,CAAhB05B;AADG,OAAA,MAEA,IAAK,CAAA,OAAO15B,CAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,CAAP,CAAA,MAAa,QAAb,KAA0BA,CAAAA,CAAE8K,KAAF9K,IAAWA,CAAAA,CAAEsD,SAAvC,CAAL,EAAyD;AAC5D,cAAM,IAAII,KAAJ,CAAU,iDACA,iCADA,GAEA,uCAFA,GAGA,2BAHA,GAIA,uBAJV,CAAN;AADG,OAAA,MAMA;AACH,cAAM,IAAIA,KAAJ,CAAU1D,CAAAA,GAAI,0BAAd,CAAN;AACH;AACJ;;AACD,WAAO05B,UAAP;;;;;;kBAKOnE;AAEf;;;;;;;AAOA;;;;;;;;;;AAUA;;;;;;;;;;AAUA;;;;;;AAMA;;;;;AAKA;;;;;;AAMA;;;;;AAKA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5KA;;;;;;;;;AAQA,IAAIqE,MAAAA,GAAS;AAET;;;;;;;;;;;AAWAC,EAAAA,MAbS,EAAA,SAAA,MAAA,CAaFvL,IAbE,EAaI;AACT,QAAI/b,KAAAA,GAAQ+b,IAAAA,CAAK/b,KAAL+b,CAAW,UAAXA,CAAZ;;AACA,QAAK/b,KAAL,EAAa;AACT,aAAOA,KAAAA,CAAM,CAANA,CAAP;AADJ,KAAA,MAEO;AACH,aAAO,EAAP;AACH;AAnBI,GAAA;;AAsBT;;;;;;;;;;AAUAunB,EAAAA,UAhCS,EAAA,SAAA,UAAA,CAgCExL,IAhCF,EAgCQ;AACb,WAAOA,IAAAA,CAAKhpB,OAALgpB,CAAa,QAAbA,EAAuB,EAAvBA,CAAP;AACH;AAlCQ,CAAb;kBAsCesL;;;;;;;AC9Cf,IAAA,YAAA,GAAA,OAAA,CAAA,eAAA,CAAA;;;;AACA,IAAA,UAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;AACA,IAAA,UAAA,GAAA,OAAA,CAAA,aAAA,CAAA;;;;AACA,IAAA,QAAA,GAAA,OAAA,CAAA,WAAA,CAAA;;;;AACA,IAAA,OAAA,GAAA,OAAA,CAAA,WAAA,CAAA;;;;AACA,IAAA,OAAA,GAAA,OAAA,CAAA,UAAA,CAAA;;;;AACA,IAAA,MAAA,GAAA,OAAA,CAAA,SAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;AACA,IAAA,KAAA,GAAA,OAAA,CAAA,QAAA,CAAA;;;;;;;;;AAEA;;;;;;;;;;;;;;;;;;;;AAkBA,SAASD,OAAT,GAA6B;AAAA,OAAA,IAAA,IAAA,GAAA,SAAA,CAAA,MAAA,EAATL,OAAS,GAAA,KAAA,CAAA,IAAA,CAAA,EAAA,IAAA,GAAA,CAAA,EAAA,IAAA,GAAA,IAAA,EAAA,IAAA,EAAA,EAAA;AAATA,IAAAA,OAAS,CAAA,IAAA,CAATA,GAAS,SAAA,CAAA,IAAA,CAATA;AAAS;;AACzB,MAAKA,OAAAA,CAAQx5B,MAARw5B,KAAmB,CAAnBA,IAAwBxxB,KAAAA,CAAM+c,OAAN/c,CAAcwxB,OAAAA,CAAQ,CAARA,CAAdxxB,CAA7B,EAAyD;AACrDwxB,IAAAA,OAAAA,GAAUA,OAAAA,CAAQ,CAARA,CAAVA;AACH;;AACD,SAAO,IAAI/D,WAAAA,CAAAA,OAAJ,CAAc+D,OAAd,CAAP;AACH;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwEAK,OAAAA,CAAQxO,MAARwO,GAAiB,SAASxO,MAAT,CAAgBrW,IAAhB,EAAsBilB,WAAtB,EAAmC;AAChD,MAAIC,OAAAA,GAAU,SAAVA,OAAU,GAAmB;AAC7B,QAAIC,WAAAA,GAAcF,WAAAA,CAAAA,KAAAA,CAAAA,SAAAA,EAAAA,SAAAA,CAAlB;AACAE,IAAAA,WAAAA,CAAY7F,aAAZ6F,GAA6BnlB,IAA7BmlB;AACAA,IAAAA,WAAAA,CAAYlB,cAAZkB,GAA8B,IAAI1E,WAAAA,CAAAA,OAAJ,GAAiB3Z,OAA/Cqe;AACA,WAAOA,WAAP;AAJJ,GAAA;;AAOA,MAAItC,KAAAA,GAAAA,KAAAA,CAAJ;AACApuB,EAAAA,MAAAA,CAAOgV,cAAPhV,CAAsBywB,OAAtBzwB,EAA+B,SAA/BA,EAA0C;AACtC9J,IAAAA,GADsC,EAAA,SAAA,GAAA,GAChC;AACF,UAAK,CAACk4B,KAAN,EAAcA,KAAAA,GAAQqC,OAAAA,EAARrC;AACd,aAAOA,KAAP;AACH;AAJqC,GAA1CpuB;;AAOAywB,EAAAA,OAAAA,CAAQvT,OAARuT,GAAkB,UAAUvsB,GAAV,EAAeysB,WAAf,EAA4BC,UAA5B,EAAwC;AACtD,WAAOR,OAAAA,CAAQ,CAAEK,OAAAA,CAAQG,UAARH,CAAF,CAARL,CAAAA,CAAiClT,OAAjCkT,CAAyClsB,GAAzCksB,EAA8CO,WAA9CP,CAAP;AADJ,GAAAK;;AAIA,SAAOA,OAAP;AApBJ,CAAAL;AAuBA;;;;;;;;;;;;;AAWAA,OAAAA,CAAQr2B,SAARq2B,GAAoBr2B,WAAAA,CAAAA,OAApBq2B;AAEA;;;;;;;;;;;;;;;;;;;AAkBAA,OAAAA,CAAQ7uB,KAAR6uB,GAAgB7uB,OAAAA,CAAAA,OAAhB6uB;AAEA;;;;;;;AAMAA,OAAAA,CAAQC,MAARD,GAAiBC,QAAAA,CAAAA,OAAjBD;AAEA;;;;;;;AAMAA,OAAAA,CAAQ/wB,IAAR+wB,GAAe/wB,MAAAA,CAAAA,OAAf+wB;AAEA;;;;;;;;;;;AAUAA,OAAAA,CAAQ3L,OAAR2L,GAAkB,UAAA,QAAA,EAAA;AAAA,SAAY,IAAIpF,SAAAA,CAAAA,OAAJ,CAAY1D,QAAZ,CAAZ;AAAlB,CAAA8I;AAEA;;;;;;;;;;;;AAUAA,OAAAA,CAAQS,MAART,GAAiB,UAAA,QAAA,EAAA;AAAA,SAAY,IAAIrD,QAAAA,CAAAA,OAAJ,CAAWzF,QAAX,CAAZ;AAAjB,CAAA8I;AAEA;;;;;;;;;;;;AAUAA,OAAAA,CAAQvL,IAARuL,GAAe,UAAA,QAAA,EAAA;AAAA,SAAY,IAAIrH,aAAAA,CAAAA,OAAJ,CAAgBzB,QAAhB,CAAZ;AAAf,CAAA8I;AAEA;;;;;;;;;;;;AAUAA,OAAAA,CAAQlL,IAARkL,GAAe,UAAA,QAAA,EAAA;AAAA,SAAY,IAAI5E,MAAAA,CAAAA,OAAJ,CAASlE,QAAT,CAAZ;AAAf,CAAA8I;AAEA;;;;;;;;;;;;AAUAA,OAAAA,CAAQhP,IAARgP,GAAe,UAAA,QAAA,EAAA;AAAA,SAAY,IAAIxE,MAAAA,CAAAA,OAAJ,CAAStE,QAAT,CAAZ;AAAf,CAAA8I;;kBAEeA;;;;;AChPf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrhBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA,cAEA;AACA;AACA;;AACA,SAASrwB,cAAT,CAAwB1J,GAAxB,EAA6B0uB,IAA7B,EAAmC;AACjC,SAAO/kB,MAAM,CAAC5C,SAAP,CAAiB2C,cAAjB,CAAgCzB,IAAhC,CAAqCjI,GAArC,EAA0C0uB,IAA1C,CAAP;AACD;;AAED7nB,MAAM,CAACC,OAAP,GAAiB,UAAS2zB,EAAT,EAAazG,GAAb,EAAkB0G,EAAlB,EAAsB9sB,OAAtB,EAA+B;AAC9ComB,EAAAA,GAAG,GAAGA,GAAG,IAAI,GAAb;AACA0G,EAAAA,EAAE,GAAGA,EAAE,IAAI,GAAX;AACA,MAAI16B,GAAG,GAAG,EAAV;;AAEA,MAAI,OAAOy6B,EAAP,KAAc,QAAd,IAA0BA,EAAE,CAACv6B,MAAH,KAAc,CAA5C,EAA+C;AAC7C,WAAOF,GAAP;AACD;;AAED,MAAI26B,MAAM,GAAG,KAAb;AACAF,EAAAA,EAAE,GAAGA,EAAE,CAACrvB,KAAH,CAAS4oB,GAAT,CAAL;AAEA,MAAI4G,OAAO,GAAG,IAAd;;AACA,MAAIhtB,OAAO,IAAI,OAAOA,OAAO,CAACgtB,OAAf,KAA2B,QAA1C,EAAoD;AAClDA,IAAAA,OAAO,GAAGhtB,OAAO,CAACgtB,OAAlB;AACD;;AAED,MAAIlzB,GAAG,GAAG+yB,EAAE,CAACv6B,MAAb,CAjB8C,CAkB9C;;AACA,MAAI06B,OAAO,GAAG,CAAV,IAAelzB,GAAG,GAAGkzB,OAAzB,EAAkC;AAChClzB,IAAAA,GAAG,GAAGkzB,OAAN;AACD;;AAED,OAAK,IAAIx6B,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGsH,GAApB,EAAyB,EAAEtH,CAA3B,EAA8B;AAC5B,QAAI2J,CAAC,GAAG0wB,EAAE,CAACr6B,CAAD,CAAF,CAAMsF,OAAN,CAAci1B,MAAd,EAAsB,KAAtB,CAAR;AAAA,QACI9jB,GAAG,GAAG9M,CAAC,CAACG,OAAF,CAAUwwB,EAAV,CADV;AAAA,QAEIG,IAFJ;AAAA,QAEUC,IAFV;AAAA,QAEgBC,CAFhB;AAAA,QAEmBC,CAFnB;;AAIA,QAAInkB,GAAG,IAAI,CAAX,EAAc;AACZgkB,MAAAA,IAAI,GAAG9wB,CAAC,CAACiK,MAAF,CAAS,CAAT,EAAY6C,GAAZ,CAAP;AACAikB,MAAAA,IAAI,GAAG/wB,CAAC,CAACiK,MAAF,CAAS6C,GAAG,GAAG,CAAf,CAAP;AACD,KAHD,MAGO;AACLgkB,MAAAA,IAAI,GAAG9wB,CAAP;AACA+wB,MAAAA,IAAI,GAAG,EAAP;AACD;;AAEDC,IAAAA,CAAC,GAAG1Q,kBAAkB,CAACwQ,IAAD,CAAtB;AACAG,IAAAA,CAAC,GAAG3Q,kBAAkB,CAACyQ,IAAD,CAAtB;;AAEA,QAAI,CAACpxB,cAAc,CAAC1J,GAAD,EAAM+6B,CAAN,CAAnB,EAA6B;AAC3B/6B,MAAAA,GAAG,CAAC+6B,CAAD,CAAH,GAASC,CAAT;AACD,KAFD,MAEO,IAAI/V,OAAO,CAACjlB,GAAG,CAAC+6B,CAAD,CAAJ,CAAX,EAAqB;AAC1B/6B,MAAAA,GAAG,CAAC+6B,CAAD,CAAH,CAAOj7B,IAAP,CAAYk7B,CAAZ;AACD,KAFM,MAEA;AACLh7B,MAAAA,GAAG,CAAC+6B,CAAD,CAAH,GAAS,CAAC/6B,GAAG,CAAC+6B,CAAD,CAAJ,EAASC,CAAT,CAAT;AACD;AACF;;AAED,SAAOh7B,GAAP;AACD,CAjDD;;AAmDA,IAAIilB,OAAO,GAAG/c,KAAK,CAAC+c,OAAN,IAAiB,UAAUgW,EAAV,EAAc;AAC3C,SAAOtxB,MAAM,CAAC5C,SAAP,CAAiBhB,QAAjB,CAA0BkC,IAA1B,CAA+BgzB,EAA/B,MAAuC,gBAA9C;AACD,CAFD;;ACjFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;;AAEA,IAAIC,kBAAkB,GAAG,UAASF,CAAT,EAAY;AACnC,UAAQ,OAAOA,CAAf;AACE,SAAK,QAAL;AACE,aAAOA,CAAP;;AAEF,SAAK,SAAL;AACE,aAAOA,CAAC,GAAG,MAAH,GAAY,OAApB;;AAEF,SAAK,QAAL;AACE,aAAOG,QAAQ,CAACH,CAAD,CAAR,GAAcA,CAAd,GAAkB,EAAzB;;AAEF;AACE,aAAO,EAAP;AAXJ;AAaD,CAdD;;AAgBAn0B,MAAM,CAACC,OAAP,GAAiB,UAAS9G,GAAT,EAAcg0B,GAAd,EAAmB0G,EAAnB,EAAuBxlB,IAAvB,EAA6B;AAC5C8e,EAAAA,GAAG,GAAGA,GAAG,IAAI,GAAb;AACA0G,EAAAA,EAAE,GAAGA,EAAE,IAAI,GAAX;;AACA,MAAI16B,GAAG,KAAK,IAAZ,EAAkB;AAChBA,IAAAA,GAAG,GAAG4G,SAAN;AACD;;AAED,MAAI,OAAO5G,GAAP,KAAe,QAAnB,EAA6B;AAC3B,WAAOqL,GAAG,CAAC+vB,UAAU,CAACp7B,GAAD,CAAX,EAAkB,UAAS+6B,CAAT,EAAY;AACtC,UAAIM,EAAE,GAAG5H,kBAAkB,CAACyH,kBAAkB,CAACH,CAAD,CAAnB,CAAlB,GAA4CL,EAArD;;AACA,UAAIzV,OAAO,CAACjlB,GAAG,CAAC+6B,CAAD,CAAJ,CAAX,EAAqB;AACnB,eAAO1vB,GAAG,CAACrL,GAAG,CAAC+6B,CAAD,CAAJ,EAAS,UAASC,CAAT,EAAY;AAC7B,iBAAOK,EAAE,GAAG5H,kBAAkB,CAACyH,kBAAkB,CAACF,CAAD,CAAnB,CAA9B;AACD,SAFS,CAAH,CAEJ9uB,IAFI,CAEC8nB,GAFD,CAAP;AAGD,OAJD,MAIO;AACL,eAAOqH,EAAE,GAAG5H,kBAAkB,CAACyH,kBAAkB,CAACl7B,GAAG,CAAC+6B,CAAD,CAAJ,CAAnB,CAA9B;AACD;AACF,KATS,CAAH,CASJ7uB,IATI,CASC8nB,GATD,CAAP;AAWD;;AAED,MAAI,CAAC9e,IAAL,EAAW,OAAO,EAAP;AACX,SAAOue,kBAAkB,CAACyH,kBAAkB,CAAChmB,IAAD,CAAnB,CAAlB,GAA+CwlB,EAA/C,GACAjH,kBAAkB,CAACyH,kBAAkB,CAACl7B,GAAD,CAAnB,CADzB;AAED,CAxBD;;AA0BA,IAAIilB,OAAO,GAAG/c,KAAK,CAAC+c,OAAN,IAAiB,UAAUgW,EAAV,EAAc;AAC3C,SAAOtxB,MAAM,CAAC5C,SAAP,CAAiBhB,QAAjB,CAA0BkC,IAA1B,CAA+BgzB,EAA/B,MAAuC,gBAA9C;AACD,CAFD;;AAIA,SAAS5vB,GAAT,CAAc4vB,EAAd,EAAkBK,CAAlB,EAAqB;AACnB,MAAIL,EAAE,CAAC5vB,GAAP,EAAY,OAAO4vB,EAAE,CAAC5vB,GAAH,CAAOiwB,CAAP,CAAP;AACZ,MAAIC,GAAG,GAAG,EAAV;;AACA,OAAK,IAAIn7B,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG66B,EAAE,CAAC/6B,MAAvB,EAA+BE,CAAC,EAAhC,EAAoC;AAClCm7B,IAAAA,GAAG,CAACz7B,IAAJ,CAASw7B,CAAC,CAACL,EAAE,CAAC76B,CAAD,CAAH,EAAQA,CAAR,CAAV;AACD;;AACD,SAAOm7B,GAAP;AACD;;AAED,IAAIH,UAAU,GAAGzxB,MAAM,CAACnD,IAAP,IAAe,UAAUxG,GAAV,EAAe;AAC7C,MAAIu7B,GAAG,GAAG,EAAV;;AACA,OAAK,IAAIpyB,GAAT,IAAgBnJ,GAAhB,EAAqB;AACnB,QAAI2J,MAAM,CAAC5C,SAAP,CAAiB2C,cAAjB,CAAgCzB,IAAhC,CAAqCjI,GAArC,EAA0CmJ,GAA1C,CAAJ,EAAoDoyB,GAAG,CAACz7B,IAAJ,CAASqJ,GAAT;AACrD;;AACD,SAAOoyB,GAAP;AACD,CAND;;AC9EA;;AAEAz0B,OAAO,CAACkJ,MAAR,GAAiBlJ,OAAO,CAACoE,KAAR,GAAgBL,OAAO,CAAC,UAAD,CAAxC;AACA/D,OAAO,CAACgJ,MAAR,GAAiBhJ,OAAO,CAACpD,SAAR,GAAoBmH,OAAO,CAAC,UAAD,CAA5C;;ACHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5tBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;IC7nBM2wB;;;AAEF;AACA;AACA;AACA,uBAAc;AAAA;AAAE,IAEhB;AACA;AACA;;;;;gCACY;AACR,UAAIC,IAAI,GAAG,IAAIC,IAAJ,CAAS,IAAIA,IAAJ,GAAWC,WAAX,EAAT,EAAmC,IAAID,IAAJ,GAAWE,QAAX,EAAnC,EAA0D,IAAIF,IAAJ,GAAWG,OAAX,EAA1D,EAAgF,IAAIH,IAAJ,GAAWI,QAAX,EAAhF,EAAuG,IAAIJ,IAAJ,GAAWK,UAAX,EAAvG,EAAgI,IAAIL,IAAJ,GAAWM,UAAX,EAAhI,EAAyJ,CAAzJ,EAA4JC,OAA5J,KAAwK,IAAnL;AACA,aAAOR,IAAP;AACH;;;kCAEaS,SAAS;AACnB,UAAIC,IAAI,GAAG,IAAIT,IAAJ,CAASQ,OAAO,GAAG,IAAnB,CAAX;AACA,aAAOC,IAAP;AACH;;;4BAEO50B,MAAM60B,SAAS;AACnB,UAAIC,GAAG,GAAKD,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBE,UAAlB,EAAD,CAA3C,GAA8EriB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWY,UAAX,EAAD,CAA/F;AACA,UAAIC,KAAK,GAAKH,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBI,WAAlB,KAAkC,CAAnC,CAA3C,GAAmFviB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWc,WAAX,KAA2B,CAA5B,CAAtG;AACA,UAAIC,IAAI,GAAKL,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBM,cAAlB,EAAD,CAA3C,GAAkFziB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWgB,cAAX,EAAD,CAApG;AACA,UAAIC,IAAI,GAAKP,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBQ,WAAlB,EAAD,CAA3C,GAA+E3iB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWkB,WAAX,EAAD,CAAjG;AACA,UAAIC,MAAM,GAAKT,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBU,aAAlB,EAAD,CAA3C,GAAiF7iB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWoB,aAAX,EAAD,CAArG;AACA,UAAIZ,OAAO,GAAKE,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBW,aAAlB,EAAD,CAA3C,GAAiF9iB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWqB,aAAX,EAAD,CAAtG;AACA,UAAIC,WAAW,GAAKZ,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBa,kBAAlB,EAAD,CAA3C,GAAsFhjB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWuB,kBAAX,EAAD,CAA/G;AACA,UAAInuB,MAAM,GAAKstB,OAAO,IAAI,IAAX,IAAmBA,OAAO,IAAI,EAA/B,GAAqCniB,MAAM,CAAC,IAAIyhB,IAAJ,CAASU,OAAT,EAAkBc,iBAAlB,EAAD,CAA3C,GAAqFjjB,MAAM,CAAC,IAAIyhB,IAAJ,GAAWwB,iBAAX,EAAD,CAAzG;AACA,UAAIb,GAAG,CAACn8B,MAAJ,IAAc,CAAlB,EACIm8B,GAAG,GAAGpiB,MAAM,CAAC,MAAMoiB,GAAP,CAAZ;AACJ,UAAIE,KAAK,CAACr8B,MAAN,IAAgB,CAApB,EACIq8B,KAAK,GAAGtiB,MAAM,CAAC,MAAMsiB,KAAP,CAAd;AACJztB,MAAAA,MAAM,GAAGmL,MAAM,CAACnL,MAAM,GAAG,EAAV,CAAf;AACA,UAAIA,MAAM,CAAC5O,MAAP,IAAiB,CAArB,EACI4O,MAAM,GAAGmL,MAAM,CAAC,MAAMnL,MAAP,CAAf;;AACJ,cAAQvH,IAAR;AACI,aAAK,KAAL;AACI,iBAAO80B,GAAP;AACA;;AACJ,aAAK,OAAL;AACI,iBAAOE,KAAP;AACA;;AACJ,aAAK,MAAL;AACI,iBAAOE,IAAP;AACA;;AACJ,aAAK,OAAL;AACI,iBAAOxiB,MAAM,CAACwiB,IAAI,GAAG,GAAP,GAAaF,KAAb,GAAqB,GAArB,GAA2BF,GAA3B,GAAiC,GAAjC,GAAuCM,IAAvC,GAA8C,GAA9C,GAAoDE,MAApD,GAA6D,GAA7D,GAAmEX,OAAnE,GAA6E,GAA7E,GAAmFc,WAAnF,GAAiG,GAAjG,GAAwGluB,MAAzG,CAAb;AACA;;AACJ;AACI,iBAAOmL,MAAM,CAACwiB,IAAI,GAAG,GAAP,GAAaF,KAAb,GAAqB,GAArB,GAA2BF,GAA5B,CAAb;AACA;AAfR;AAiBH,MAED;AACA;AACA;;;;;;;eAGWb;;;AC5Df;;;;;;;AACA;;AAUA;;AACA;;;;;;;;;;;;AACO,IAAI2B,KAAJ;;AACA,IAAIC,SAAJ;;;IACcC;;;AAEjB;AACA;AACA;AACA,qBACA;AAAA;;AACI,SAAKC,SAAL,GAAiB,IAAIl7B,kBAAJ,EAAjB;AACA,SAAKm7B,EAAL,GAAU,IAAIC,cAAJ,CAAU,cAAV,CAAV;AACA,SAAKD,EAAL,CAAQvhB,OAAR,CAAgB,CAAhB,EAAmByhB,MAAnB,CACA;AACIC,MAAAA,QAAQ,EAAE;AADd,KADA;AAIA,SAAKH,EAAL,CAAQG,QAAR,CAAiBvmB,OAAjB,CAAyB,UAAA+Q,KAAK,EAC9B;AACI,sBAAAiV,KAAK,GAAGjV,KAAK,CAAChoB,MAAd;AACA,0BAAAk9B,SAAS,GAAGlV,KAAK,CAACiV,KAAK,GAAG,CAAT,CAAL,CAAiBhS,EAA7B;AACH,KAJD;AAKH,IACD;AACA;AACA;;;;;2BACOA,IAAIwS,UACX;AACI,UAAIt7B,IAAI,GAAG,IAAX;AACA,UAAIu7B,OAAJ;AACA,aAAO,IAAIj7B,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACI,YAAIsoB,EAAE,IAAI,IAAV,EACA;AACI9oB,UAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBG,GAAjB,CAAqBF,QAArB,EAA+Bl5B,IAA/B,CAAoC,UAAAq5B,KAAK,EACzC;AACIF,YAAAA,OAAO,GAAGE,KAAV;AACH,WAHD,EAGG7E,KAHH,CAGS,UAAA51B,CAAC,EACV;AACI,gBAAIyE,GAAG,GAAG;AACNsjB,cAAAA,OAAO,EAAE,WADH;AAENzjB,cAAAA,KAAK,EAAEtE;AAFD,aAAV;AAIH,WATD;AAUH,SAZD,MAcA;AACIhB,UAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBK,MAAjB,CAAwBj0B,MAAM,CAACqhB,EAAD,CAA9B,EACA;AACI6S,YAAAA,IAAI,EAAEL;AADV,WADA,EAGGl5B,IAHH,CAGQ,UAAAw5B,OAAO,EACf,CAAE,CAJF,EAIIhF,KAJJ,CAIU,UAAA51B,CAAC,EACX;AACI66B,YAAAA,MAAM,CAACC,GAAP,CAAW,OAAX,EAAoB96B,CAApB;AACA,gBAAIyE,GAAG,GAAG;AACNsjB,cAAAA,OAAO,EAAE,cADH;AAENzjB,cAAAA,KAAK,EAAEtE;AAFD,aAAV;AAIH,WAXD;AAYH;;AACDhB,QAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBvmB,OAAjB,CAAyB,UAAA+Q,KAAK,EAC9B;AACI7lB,UAAAA,IAAI,CAAC+7B,UAAL,CAAgBlW,KAAhB,EAAuB0V,OAAvB,EAAgCn5B,IAAhC,CAAqC,UAAAZ,QAAQ,EAC7C;AACIjB,YAAAA,OAAO,CACP;AACIiB,cAAAA,QAAQ,EAARA;AADJ,aADO,CAAP;AAIH,WAND,EAMGo1B,KANH,CAMS,UAAAnxB,GAAG,EACZ;AACIjF,YAAAA,MAAM,CACN;AACIiF,cAAAA,GAAG,EAAHA;AADJ,aADM,CAAN;AAIH,WAZD;AAaH,SAfD;AAgBH,OA9CM,CAAP;AA+CH;;;8BACSogB,OACV;AACI,UAAI7lB,IAAI,GAAG,IAAX;AACA,aAAO,IAAIM,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACIR,QAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBW,KAAjB,GAAyB55B,IAAzB,CAA8B,UAAAsN,MAAM,EACpC;AACI1P,UAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBY,OAAjB,CAAyBpW,KAAzB,EAAgCzjB,IAAhC,CAAqC,UAAA0E,GAAG,EACxC;AACI9G,YAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBvmB,OAAjB,CAAyB,UAAA+Q,KAAK,EAC9B;AACI,kBAAIqW,KAAK,GAAG18B,SAAS,CAACD,cAAtB;AACAgB,cAAAA,OAAO,CACP;AACI27B,gBAAAA,KAAK,EAALA;AADJ,eADO,CAAP;AAIH,aAPD;AAQH,WAVD,EAUGtF,KAVH,CAUSuE,eAAMgB,SAVf,EAU0B,UAAAn7B,CAAC,EAC3B;AACIR,YAAAA,MAAM,CACN;AACIQ,cAAAA,CAAC,EAADA;AADJ,aADM,CAAN;AAIH,WAhBD;AAiBH,SAnBD;AAoBH,OAtBM,CAAP;AAuBH;;;+BACUk6B,IAAIkB,WACf;AACI,UAAIp8B,IAAI,GAAG,IAAX;AACA,aAAO,IAAIM,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACIR,QAAAA,IAAI,CAACi7B,SAAL,CAAex6B,OAAf,CAAuB,gBAAvB,EAAyCjB,SAAS,CAACF,YAAnD,EAAiEG,4BAAjE,EAAoFI,4BAApF,EAAuGq7B,EAAvG,EAA2G94B,IAA3G,CAAgH,UAACZ,QAAD,EAChH;AACI,cAAI66B,MAAM,GAAG;AACTtT,YAAAA,OAAO,EAAEvnB,QADA;AAET86B,YAAAA,OAAO,EAAEF;AAFA,WAAb;AAIA77B,UAAAA,OAAO,CAAC87B,MAAD,CAAP;AACH,SAPD,EAOGzF,KAPH,CAOS,UAACnxB,GAAD,EACT;AACIjF,UAAAA,MAAM,CAACiF,GAAD,CAAN;AACH,SAVD;AAWH,OAbM,CAAP;AAcH;;;4BACOqjB,IACR;AACI,UAAI9oB,IAAI,GAAG,IAAX;;AACA,UAAI8oB,EAAE,IAAI,IAAV,EACA;AACI,eAAO,IAAIxoB,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACIR,UAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBvmB,OAAjB,CAAyB,UAAA+Q,KAAK,EAC9B;AACItlB,YAAAA,OAAO,CAACslB,KAAD,CAAP;AACH,WAHD,EAGG+Q,KAHH,CAGS,UAAAnxB,GAAG,EACZ;AACIjF,YAAAA,MAAM,CAACiF,GAAD,CAAN;AACH,WAND;AAOH,SATM,CAAP;AAUH,OAZD,MAcA;AACI,eAAO,IAAInF,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACIR,UAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiB79B,GAAjB,CAAqBiK,MAAM,CAACqhB,EAAD,CAA3B,EAAiC1mB,IAAjC,CAAsC,UAAAzE,GAAG,EACzC;AACI4C,YAAAA,OAAO,CAAC5C,GAAD,CAAP;AACH,WAHD,EAGGi5B,KAHH,CAGS,UAAAnxB,GAAG,EACZ;AACIjF,YAAAA,MAAM,CAACiF,GAAD,CAAN;AACH,WAND;AAOH,SATM,CAAP;AAUH;AACJ;;;gCACWqjB,IAAIyT,SAChB;AACI,UAAIv8B,IAAI,GAAG,IAAX;AACA,aAAO,IAAIM,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACIR,QAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBK,MAAjB,CAAwBj0B,MAAM,CAACqhB,EAAD,CAA9B,EACA;AACI6S,UAAAA,IAAI,EAAEY;AADV,SADA,EAGGn6B,IAHH,CAGQ,UAAAo6B,OAAO,EACf;AACIx8B,UAAAA,IAAI,CAACk7B,EAAL,CAAQG,QAAR,CAAiBvmB,OAAjB,CAAyB,UAAA+Q,KAAK,EAC9B;AACI7lB,YAAAA,IAAI,CAAC+7B,UAAL,CAAgBlW,KAAhB,EAAuB,IAAvB,EAA6BzjB,IAA7B,CAAkC,UAAAZ,QAAQ,EAC1C;AACIjB,cAAAA,OAAO,CACP;AACIiB,gBAAAA,QAAQ,EAARA;AADJ,eADO,CAAP;AAIH,aAND,EAMGo1B,KANH,CAMS,UAAAnxB,GAAG,EACZ;AACIjF,cAAAA,MAAM,CACN;AACIiF,gBAAAA,GAAG,EAAHA;AADJ,eADM,CAAN;AAIH,aAZD;AAaH,WAfD;AAgBH,SArBD,EAqBGmxB,KArBH,CAqBS,UAAA51B,CAAC,EACV;AACIoF,UAAAA,OAAO,CAAC01B,GAAR,CAAY,OAAZ,EAAqB96B,CAArB;AACH,SAxBD;AAyBH,OA3BM,CAAP;AA4BH,MACD;AACA;AACA;;;;;;;;;ACtMJ;AACA;AACA;AACA;AACA;AACA;AACA;;ACNA;;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1HA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxTA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACPA;;ACAA;;ACAA;;ACAA;;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACPA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACnRA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACPA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/UA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChWA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACnMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1DA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC9FA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC7RA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC7CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACtMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACnFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1EA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACtOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1HA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/HA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACtJA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxJA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC7nBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC9DA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrkBA;AACA;AACA;AACA;AACA;;ACJA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;AC7BA;;AAUA;;AACA;;AACA;;AACA;;AACA;;AACA;;;;;;;;;;;;AACA,IAAIy7B,EAAE,GAAGj0B,OAAO,CAAC,aAAD,CAAP,CAAuB,YAAvB,CAAT;;AACA,IAAIk0B,MAAM,GAAGl0B,OAAO,CAAC,SAAD,CAApB;;IACqBm0B;;;AAEjB;AACA;AACA;AACA,yBACA;AAAA;;AACI,SAAK1B,SAAL,GAAiB,IAAIl7B,kBAAJ,EAAjB;AACA,SAAK68B,SAAL,GAAiB,IAAIzD,kBAAJ,EAAjB;AACA,SAAK0D,OAAL,GAAe,IAAI7B,gBAAJ,EAAf;AACH,IACD;AACA;AACA;;;;;2BACOlS,IAAIgG,MAAMgO,OAAOC,SACxB;AACI,UAAI/8B,IAAI,GAAG,IAAX;AACA,UAAIg9B,SAAJ;AACA,aAAO,IAAI18B,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EACnB;AACI,YAAIy8B,GAAG,GAAGn7B,QAAQ,CAACo7B,aAAT,CAAuB,UAAvB,CAAV;AACAD,QAAAA,GAAG,CAACE,SAAJ,GAAgBr7B,QAAQ,CAACs7B,cAAT,CAAwB,gBAAxB,EAA0CD,SAA1D;AACA,YAAIE,IAAI,GAAGJ,GAAG,CAAC/zB,KAAf;AACAm0B,QAAAA,IAAI,GAAGA,IAAI,CAACh6B,OAAL,CAAa,iBAAb,EAAgC,EAAhC,CAAP,CAJJ,CAIgD;;AAC5C,YAAIi6B,MAAM,GAAG,2BAASD,IAAT,EACb;AACIE,UAAAA,WAAW,EAAE,CAAC,KAAD,EAAQ,GAAR,EAAa,QAAb,EAAuB,KAAvB,CADjB;AAEIC,UAAAA,iBAAiB,EACjB;AACItG,YAAAA,CAAC,EAAE,CAAC,MAAD,EAAS,MAAT,EAAiB,QAAjB,CADP;AAEIuG,YAAAA,GAAG,EAAE,CAAC,KAAD,CAFT;AAGIC,YAAAA,MAAM,EAAE,CAAC,QAAD,EAAW,OAAX,EAAoB,KAApB,EAA2B,aAA3B,EAA0C,OAA1C,EAAmD,iBAAnD;AAHZ;AAHJ,SADa,CAAb;AAUAJ,QAAAA,MAAM,GAAG,IAAIp6B,oBAAJ,GAAkBy6B,UAAlB,CAA6BL,MAA7B,CAAT;AACAxO,QAAAA,IAAI,CAAChJ,KAAL,GAAahkB,QAAQ,CAACs7B,cAAT,CAAwB,YAAxB,EAAsCl0B,KAAnD;AACA4lB,QAAAA,IAAI,CAAC8O,IAAL,GAAY,IAAI16B,oBAAJ,GAAkB26B,WAAlB,CAA8B/7B,QAAQ,CAACs7B,cAAT,CAAwB,YAAxB,EAAsCl0B,KAApE,CAAZ;AACA4lB,QAAAA,IAAI,CAACgP,SAAL,GAAiBR,MAAjB;AACAxO,QAAAA,IAAI,CAACuO,IAAL,GAAYZ,EAAE,CAACsB,MAAH,CAAUT,MAAV,EACZ;AACID,UAAAA,IAAI,EAAE,IADV;AAEIW,UAAAA,QAAQ,EAAE;AAFd,SADY,CAAZ;AAKAlP,QAAAA,IAAI,CAACmP,OAAL,GAAen8B,QAAQ,CAACs7B,cAAT,CAAwB,WAAxB,EAAqCl0B,KAApD;AACA4lB,QAAAA,IAAI,CAACoP,IAAL,GAAYp8B,QAAQ,CAACs7B,cAAT,CAAwB,WAAxB,EAAqCl0B,KAAjD;AACA4lB,QAAAA,IAAI,CAACqP,IAAL,GAAYr8B,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCgB,YAAvC,CAAoD,aAApD,CAAZ;AACAtP,QAAAA,IAAI,CAACuP,QAAL,GAAgBv8B,QAAQ,CAACs7B,cAAT,CAAwB,gBAAxB,EAA0CgB,YAA1C,CAAuD,aAAvD,CAAhB;AACAtP,QAAAA,IAAI,CAACwP,SAAL,GAAiBx8B,QAAQ,CAACs7B,cAAT,CAAwB,kBAAxB,EAA4CgB,YAA5C,CAAyD,aAAzD,CAAjB;;AACA,YAAItB,KAAK,CAACj/B,MAAN,IAAgB,CAApB,EACA;AACI,eAAK,IAAIE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG++B,KAAK,CAACj/B,MAA1B,EAAkCE,CAAC,EAAnC,EACA;AACI,gBAAI8Y,IAAI,GAAGimB,KAAK,CAAC/+B,CAAD,CAAhB,CADJ,CAEI;;AACA,gBAAI,CAAC8Y,IAAI,CAAC3R,IAAL,CAAUoL,KAAV,CAAgB,SAAhB,CAAL,EACA;AACI;AACH;;AACDwe,YAAAA,IAAI,CAACyP,OAAL,GAAe,0BAA0Bv+B,IAAI,CAAC48B,SAAL,CAAepD,OAAf,CAAuB,MAAvB,EAA+B,IAAIH,IAAJ,EAA/B,CAA1B,GAAuE,GAAvE,GAA6Er5B,IAAI,CAAC48B,SAAL,CAAepD,OAAf,CAAuB,OAAvB,EAAgC,IAAIH,IAAJ,EAAhC,CAA7E,GAA2H,GAA3H,GAAiIxiB,IAAI,CAAChE,IAArJ;AACH;AACJ,SAZD,MAcA;AACI,cAAI,OAAOic,IAAI,CAACyP,OAAZ,IAAuB,WAA3B,EACIzP,IAAI,CAACyP,OAAL,GAAe,EAAf;AACP;;AACD,YAAIzV,EAAE,IAAI,IAAV,EACA;AACIkU,UAAAA,SAAS,GAAG;AACRlU,YAAAA,EAAE,EAAEiU,OAAO,GAAG,CADN;AAERpB,YAAAA,IAAI,EACJ;AACI6C,cAAAA,IAAI,EAAE9B,MAAM,EADhB;AAEI5W,cAAAA,KAAK,EAAEgJ,IAAI,CAAChJ,KAFhB;AAGI8X,cAAAA,IAAI,EAAE9O,IAAI,CAAC8O,IAHf;AAIIE,cAAAA,SAAS,EAAEhP,IAAI,CAACgP,SAJpB;AAKIT,cAAAA,IAAI,EAAEvO,IAAI,CAACuO,IALf;AAMIkB,cAAAA,OAAO,EAAEzP,IAAI,CAACyP,OANlB;AAOIN,cAAAA,OAAO,EAAEnP,IAAI,CAACmP,OAPlB;AAQIC,cAAAA,IAAI,EAAEpP,IAAI,CAACoP,IARf;AASIC,cAAAA,IAAI,EAAErP,IAAI,CAACqP,IATf;AAUIE,cAAAA,QAAQ,EAAEvP,IAAI,CAACuP,QAVnB;AAWIC,cAAAA,SAAS,EAAExP,IAAI,CAACwP,SAXpB;AAYI9B,cAAAA,OAAO,EAAE,EAZb;AAaIiC,cAAAA,MAAM,EAAE;AAbZ;AAHQ,WAAZ;AAmBH,SArBD,MAuBA;AACIzB,UAAAA,SAAS,GAAGlO,IAAZ;AACH;;AACD9uB,QAAAA,IAAI,CAAC68B,OAAL,CAAa6B,MAAb,CAAoB5V,EAApB,EAAwBkU,SAAxB,EAAmC56B,IAAnC,CAAwC,UAACZ,QAAD,EACxC;AACIjB,UAAAA,OAAO,CAACiB,QAAD,CAAP;AACH,SAHD,EAGGo1B,KAHH,CAGS,UAACnxB,GAAD,EACT;AACIjF,UAAAA,MAAM,CAACiF,GAAD,CAAN;AACH,SAND;AAOH,OAjFM,CAAP;AAkFH;;;+BACUqjB,IAAIjnB,MACf;AACI,UAAI7B,IAAI,GAAG,IAAX;AAEA6B,MAAAA,IAAI,CAAC26B,OAAL,GAAe,IAAInD,IAAJ,GAAW31B,QAAX,EAAf;AACA,aAAO,IAAIpD,OAAJ,CAAY,UAASC,OAAT,EAAkBC,MAAlB,EAAyB;AACxCR,QAAAA,IAAI,CAAC68B,OAAL,CAAa8B,WAAb,CAAyB7V,EAAzB,EAA6BjnB,IAA7B,EAAmCO,IAAnC,CAAwC,UAAAZ,QAAQ,EAAE;AAC9C4E,UAAAA,OAAO,CAAC01B,GAAR,CAAYt6B,QAAZ;AACAjB,UAAAA,OAAO,CAACiB,QAAD,CAAP;AACH,SAHD,EAGGo1B,KAHH,CAGS,UAAAnxB,GAAG,EAAE;AACVW,UAAAA,OAAO,CAAC01B,GAAR,CAAYr2B,GAAZ;AACAjF,UAAAA,MAAM,CAAC8E,KAAD,CAAN;AACH,SAND;AAOH,OARM,CAAP;AASH,MACD;AACA;AACA;;;;;;;;;;;;;;;;;;ACxIG,IAAMs5B,aAAa,GAAG,cAAtB;;AACA,IAAMC,wBAAwB,GAAG,mBAAjC;;AACA,IAAMC,WAAW,GAAG,YAApB;;AACA,IAAMC,aAAa,GAAG,cAAtB;;;IAEDC;;;;eAaS,IAAIA,WAAJ;;;;;;AClBf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACjrCA,IAAMC,UAAAA,GAAa,CACjB,mBADiB,EAEjB,iBAFiB,EAGjB,kBAHiB,EAIjB,gBAJiB,EAKjB,kBALiB,EAMjB,mBANiB,EAOjB,iBAPiB,EAQjB,gBARiB,EASjB,WATiB,EAUjB,YAViB,EAWjB,UAXiB,EAYjB,YAZiB,EAajB,QAbiB,EAcjB,eAdiB,EAejB,YAfiB,EAgBjB,cAhBiB,EAiBjB,YAjBiB,EAkBjB,aAlBiB,EAmBjB,WAnBiB,EAoBjB,cApBiB,EAqBjB,UArBiB,EAsBjB,WAtBiB,EAuBjB,WAvBiB,EAwBjB,eAxBiB,EAyBjB,aAzBiB,EA0BjB,cA1BiB,EA2BjB,YA3BiB,EA4BjB,WA5BiB,EA6BjB,cA7BiB,EA8BjB,eA9BiB,EA+BjB,YA/BiB,EAgCjB,WAhCiB,EAiCjB,UAjCiB,CAAnB;;;;;;;;;;AA4CA,IAAMC,YAAAA,GAAe,SAAfA,YAAe,CAACC,OAAD,EAAU9B,IAAV,EAAmB;;;;MAKhC+B,MAAAA,GAASt9B,QAAAA,CAASo7B,aAATp7B,CAAuB,KAAvBA;;;;;;;MAOTu9B,SAAAA,GAAY,SAAZA,SAAY,GAAM;QAChB7zB,GAAAA,GAAM;gBACA,UADA;YAEJ,CAAC,IAFG;WAGL,CAHK;cAIF,CAAC;AAJC;;QAOR2zB,OAAAA,CAAQG,OAARH,KAAoB,YAAY;iBACvB1hC,KAAK;;;eAGPU,QAAQ,UAACohC,IAAD,EAAU;UACvBA,QAAQC,gBAAAA,CAAiBL,OAAjBK,CAAAA,CAA0BD,IAA1BC;AADd;WAIOh0B;AAhBT;;;;;;;;;;MA0BMi0B,UAAAA,GAAa,SAAbA,UAAa,CAACpC,IAAD,EAAU;QACrBqC,MAAAA,GAASL,SAAAA;WACRl7B,KAAKu7B,QAAQvhC,QAAQ,UAAA,GAAA,EAAO;aAC1BwhC,MAAM74B,OAAO44B,MAAAA,CAAO54B,GAAP44B;AADtB;WAGOvC,YAAYE;YACXuC,WAAWvQ,aAAa+P,QAAQD,OAAAA,CAAQU;AANlD;;;;;;;;MAcMC,IAAAA,GAAO,SAAPA,IAAO,GAAM;QACX5a,MAAAA,GAASka,MAAAA,CAAOW,aAAPX,CAAqBhC,cAArBgC,CAAoC,uBAApCA;QACTY,YAAAA,GAAe;YACb9a,MAAAA,CAAO+a,UADM;WAEd/a,MAAAA,CAAOgb,SAFO;cAGXhb,MAAAA,CAAOib;AAHI;WAKdP,WAAW5Q,YAAYoQ;WAEvBY;AATT;;aAYW3C;SAEJ;;AAAA;AAlET,CAAA;;;;;;;AC5CA;;;;;;;;;AAOA,IAAa+C,iBAAAA,GAAoB,SAApBA,iBAAoB,CAACjB,OAAD,EAAA;SAAa,CAAC,EAC7CA,OAAAA,CAAQkB,eAARlB,IACAA,OAAAA,CAAQkB,eAARlB,KAA4B,MAFiB;AAAxC,CAAP;;;;;;;;;;AAYA,IAAamB,UAAAA,GAAa,SAAbA,UAAa,GAAmB;MAAlBC,QAAkB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAP;MAC5BC,SADmC,GACED,QADF,CACnCC;MAAW9C,MADwB,GACE6C,QADF,CACxB7C;MAAQ+C,aADgB,GACEF,QADF,CAChBE;;MACvB/C,QAAQ;WACH;oBAAA;cAEGA,MAAAA,CAAOgD,aAFV;gBAGKhD,MAAAA,CAAOiD,eAAPjD,IAA0BA,MAAAA,CAAOgD,aAAPhD,CAAqB57B,QAHpD;kCAAA;;AAAA;;;SASF;kBAAA;sBAAA;gCAAA;;AAAA;AAZF,CAAP;;;;;;;;;;;AA4BA,IAAa8+B,SAAAA,GAAY,SAAZA,SAAY,CAACzB,OAAD,EAAU0B,GAAV,EAAkB;MACnCC,GAAAA,GAAMD,GAAAA,IAAOA,GAAAA,CAAIv+B,MAAXu+B,IAAqBv+B;MAC3By+B,GAAAA,GAAMF,GAAAA,IAAOA,GAAAA,CAAI/+B,QAAX++B,IAAuB/+B;MAC7Bg+B,IAAAA,GAAOX,OAAAA,CAAQ6B,qBAAR7B;MACP8B,KAAAA,GAAQF,GAAAA,CAAIG;MACZC,UAAAA,GAAaL,GAAAA,CAAIM,WAAJN,IAAmBG,KAAAA,CAAME;MACtCE,SAAAA,GAAYP,GAAAA,CAAIQ,WAAJR,IAAmBG,KAAAA,CAAMI;SAEpC;SACAvB,IAAAA,CAAKyB,GAALzB,GAAWuB,SADX;UAECvB,IAAAA,CAAK9T,IAAL8T,GAAYqB;AAFb;AARF,CAAP;;;;;;;;;;;;AAqBA,IAAa57B,QAAAA,GAAW,SAAXA,QAAW,CAAC2D,KAAD,EAAA;SAAW,CAAA,OAAOA,KAAP,KAAA,WAAA,GAAA,WAAA,GAAA,OAAA,CAAOA,KAAP,CAAA,MAAiB,QAAjB,IAA6BA,KAAAA,KAAU;AAAnE,CAAP;ACjEA;;;;;;;;AAMA,IAAMs4B,gBAAAA,GAAmB,SAAnBA,gBAAmB,CAACrC,OAAD,EAAU0B,GAAV,EAAkB;;;;;;MAOnCY,MAAAA,GAAS,SAATA,MAAS,GAAM;WACZtC,OAAAA,CAAQuC;AADjB;;;;;;;;;;MAWMC,MAAAA,GAAS,SAATA,MAAS,CAACh1B,GAAD,EAAS;YACdi1B,kBAAkBj1B,KAAKA;WAExBwyB;AAHT;;;;;;;;;;MAaMyB,YAAAA,GAAY,SAAZA,YAAY,CAACj0B,GAAD,EAAS;QACnBmzB,IAAAA,GAAO+B,SAAAA,CAAc1C,OAAd0C;QACPj7B,QAAAA,GAAWk7B,WAAAA,CAAYn1B,GAAZm1B;WAEV;WACAhC,IAAAA,CAAKyB,GAALzB,GAAWl5B,QAAAA,CAAS26B,GAApBzB,GAA0Be,GAAAA,CAAI/+B,QAAJ++B,CAAah/B,IAAbg/B,CAAkBQ,SAD5C;YAECvB,IAAAA,CAAK9T,IAAL8T,GAAYl5B,QAAAA,CAASolB,IAArB8T,GAA4Be,GAAAA,CAAI/+B,QAAJ++B,CAAah/B,IAAbg/B,CAAkBM,UAF/C;cAGGv6B,QAAAA,CAAS+C;AAHZ;AAJT;;;;;;;;;;MAkBMm4B,WAAAA,GAAc,SAAdA,WAAc,CAACn1B,GAAD,EAAS;QACrBo1B,MAAAA,GAAS,SAATA,MAAS,CAACC,GAAD,EAAS;UAClB94B,KAAAA,GAAQ84B,GAAAA,CAAI3+B,OAAJ2+B,CAAY,YAAZA,EAA0B,GAA1BA,EACT3+B,OADS2+B,CACD,aADCA,EACa,OADbA;aAEL94B;AAHT;;QAMI23B,GAAAA,CAAIL,SAAJK,IAAiBA,GAAAA,CAAIL,SAAJK,KAAkB,GAAG;YAClCA,GAAAA,CAAIL;;;QAGN55B,QAAAA,GAAW+F,GAAAA,KAAQpI,SAARoI,GAAoB80B,MAAAA,EAApB90B,GAA+BA;QAC1Cs1B,UAAAA,GAAa9C,OAAAA,CAAQj2B,KAARi2B,CAAcr5B,KAAdq5B,CAAoB,CAApBA,EAAuBv4B,QAAvBu4B;QACb+C,QAAAA,GAAW/C,OAAAA,CAAQj2B,KAARi2B,CAAcr5B,KAAdq5B,CAAoBv4B,QAApBu4B;QACb9B,IAAAA,GAAAA,wDAA6D0E,MAAAA,CAAOE,UAAPF,CAA7D1E,GAAA;YACI;oEACsD0E,MAAAA,CAAOG,QAAPH,IAA9D;QAEM3C,MAAAA,GAASF,YAAAA,CAAaC,OAAbD,EAAsB7B,IAAtB6B;QACTY,IAAAA,GAAOV,MAAAA,CAAOU,IAAPV;SACRzyB,MAAM80B,MAAAA;WAEJ3B;AAtBT;;SAyBO;kBAAA;kBAAA;2BAAA;;AAAA;AA1ET,CAAA;ACTA;;;;;;;;;AAOA,IAAMqC,mBAAAA,GAAsB,SAAtBA,mBAAsB,CAAChD,OAAD,EAAU0B,GAAV,EAAkB;;;;;;;;MAStCc,MAAAA,GAAS,SAATA,MAAS,CAACh1B,GAAD,EAAS;QAChBy1B,GAAAA,GAAMvB,GAAAA,CAAIv+B,MAAJu+B,CAAWwB,YAAXxB;;QACRuB,KAAK;UACH31B,MAAAA,GAAS;UACT61B,KAAAA,GAAQ;;UACNC,IAAAA,GAAO,SAAPA,IAAO,CAAC37B,QAAD,EAAWumB,MAAX,EAAsB;aAC5B,IAAIpvB,CAAAA,GAAI,GAAGA,CAAAA,GAAIovB,MAAAA,CAAOqV,UAAPrV,CAAkBtvB,QAAQE,CAAAA,IAAK;cAC3CikB,IAAAA,GAAOmL,MAAAA,CAAOqV,UAAPrV,CAAkBpvB,CAAlBovB;;cACTmV,OAAO;;;;cAGPtgB,IAAAA,CAAKygB,QAALzgB,KAAkB,GAAG;gBACnBvV,MAAAA,GAASuV,IAAAA,CAAKnkB,MAAd4O,IAAwB7F,UAAU;sBAC5B;kBACF87B,KAAAA,GAAQ7B,GAAAA,CAAI/+B,QAAJ++B,CAAa8B,WAAb9B;oBACR+B,SAAS5gB,MAAMpb,QAAAA,GAAW6F;kBAC5Bo2B;kBACAC,SAASJ;;AALf,mBAOO;wBACK1gB,IAAAA,CAAKnkB;;AATnB,iBAWO;iBACA8O,KAAKqV;;;AAlBhB;;WAsBKrV,KAAKwyB;;;WAGLA;AA9BT;;;;;;;;MAsCMyB,SAAAA,GAAY,SAAZA,SAAY,GAAM;QAChB8B,KAAAA,GAAQK,QAAAA;QACVt2B,MAAAA,GAAS;cACH,CADG;YAEL,CAFK;aAGJ;AAHI;;QAMT,CAACi2B,OAAO;aACHj2B;;;QAGHu2B,YAAAA,GAAenC,GAAAA,CAAIL,SAAJK,IAAiBA,GAAAA,CAAIL,SAAJK,KAAkB,EAZlC;;;QAgBjB6B,KAAAA,CAAMO,SAANP,GAAkB,CAAlBA,GAAsB,CAAtBA,IAA2BA,KAAAA,CAAMQ,YAANR,KAAuBvD,OAAlDuD,IAA8DM,cAAc;UACzEG,WAAAA,GAAcT,KAAAA,CAAMU,UAANV;UACdW,aAAAA,GAAgBL,YAAAA,GAAenC,GAAAA,CAAIL,SAAnBwC,GAA+BN,KAAAA,CAAMO;kBAC/CL,SAASF,KAAAA,CAAMQ,cAAcG,aAAAA,GAAgB,CAAhBA,GAAoB,CAApBA,GAAwB,CAAxBA,GAA4BA,aAAAA,GAAgB;kBACzEC,OAAOZ,KAAAA,CAAMQ,cAAcG;UACjCvD,IAAAA,GAAOqD,WAAAA,CAAYnC,qBAAZmC;eACJ;gBACCrD,IAAAA,CAAKn2B,MADN;cAEDm2B,IAAAA,CAAK9T,IAAL8T,GAAYA,IAAAA,CAAKp2B,KAFhB;aAGFo2B,IAAAA,CAAKyB;AAHH;kBAKGgC;;;QAGV,CAAC,CAAC92B,MAAD,IAAYA,MAAAA,IAAUA,MAAAA,CAAO9C,MAAP8C,KAAkB,CAAzC,KAAgD,CAACo0B,GAAAA,CAAIJ,eAAe;UAChE0C,YAAAA,GAAcT,KAAAA,CAAMU,UAANV;;UACdc,WAAAA,GAAc3C,GAAAA,CAAI/+B,QAAJ++B,CAAa4C,cAAb5C,CAA4B,GAA5BA;;mBACR6C,WAAWF;;mBACXG,WAAWH;;UACjB1D,KAAAA,GAAOqD,YAAAA,CAAYnC,qBAAZmC;;eACJ;gBACCrD,KAAAA,CAAKn2B,MADN;cAEDm2B,KAAAA,CAAK9T,IAFJ;aAGF8T,KAAAA,CAAKyB;AAHH;kBAKG3B,WAAW5Q,YAAYwU;;mBACvBD;;;QAGV92B,QAAQ;UACJs0B,GAAAA,GAAMF,GAAAA,CAAI/+B,QAAJ++B,CAAaK;aAClBK,OAAOV,GAAAA,CAAIv+B,MAAJu+B,CAAWS,WAAXT,IAA0BE,GAAAA,CAAI6C,SAAJ7C,IAAiB,CAA3CF;aACP7U,QAAQ6U,GAAAA,CAAIv+B,MAAJu+B,CAAWO,WAAXP,IAA0BE,GAAAA,CAAI8C,UAAJ9C,IAAkB,CAA5CF;;;WAGVp0B;AAnDT;;;;;;;;MA2DMq1B,WAAAA,GAAc,SAAdA,WAAc,GAAM;QAClBr1B,MAAAA,GAASm0B,SAAAA;QACTj0B,GAAAA,GAAM80B,MAAAA;QACN3B,IAAAA,GAAOX,OAAAA,CAAQ6B,qBAAR7B;QACP2E,WAAAA,GAAc;WACbhE,IAAAA,CAAKyB,GAALzB,GAAWe,GAAAA,CAAI/+B,QAAJ++B,CAAah/B,IAAbg/B,CAAkBQ,SADhB;YAEZvB,IAAAA,CAAK9T,IAAL8T,GAAYe,GAAAA,CAAI/+B,QAAJ++B,CAAah/B,IAAbg/B,CAAkBM;AAFlB;WAIbnV,QAAQ8X,WAAAA,CAAY9X;WACpBuV,OAAOuC,WAAAA,CAAYvC;WACnB50B,MAAMA;WAENF;AAZT;;;;;;;;MAoBMs2B,QAAAA,GAAW,SAAXA,QAAW,GAAM;QACjB,CAAClC,GAAAA,CAAIv+B,MAAJu+B,CAAWwB,cAAc;;;;QAGxBD,GAAAA,GAAMvB,GAAAA,CAAIv+B,MAAJu+B,CAAWwB,YAAXxB;WAELuB,GAAAA,CAAI2B,UAAJ3B,GAAiB,CAAjBA,GAAqBA,GAAAA,CAAI4B,UAAJ5B,CAAe,CAAfA,CAArBA,GAAyC;AANlD;;;;;;;;MAcMX,MAAAA,GAAS,SAATA,MAAS,GAAM;QACbiB,KAAAA,GAAQK,QAAAA;QACRI,WAAAA,GAAcT,KAAAA,CAAMU,UAANV;gBACRuB,mBAAmB9E;gBACnBmE,OAAOZ,KAAAA,CAAMQ,cAAcR,KAAAA,CAAMO;QACvCt2B,GAAAA,GAAMw2B,WAAAA,CAAYz/B,QAAZy/B,GAAuBtlC;gBACvB0lC;WAEL52B;AART;;SAWO;kBAAA;kBAAA;4BAAA;wBAAA;;AAAA;AAvJT,CAAA;;ACGA,IAAMu3B,WAAAA,GAAc,SAAdA,WAAc,CAAC/E,OAAD,EAAU0B,GAAV,EAAkB;MAChCT,iBAAAA,CAAkBjB,OAAlBiB,GAA4B;WACvB+B,mBAAAA,CAAoBhD,OAApBgD,EAA6BtB,GAA7BsB;;;SAGFX,gBAAAA,CAAiBrC,OAAjBqC,EAA0BX,GAA1BW;AALT,CAAA;;AAQA,IAAa56B,QAAAA,GAAW,SAAXA,QAAW,CAACu4B,OAAD,EAAUj2B,KAAV,EAAmC;MAAlBq3B,QAAkB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAP;MAC9Ch1B,OAAAA,GAAUg1B;;MACVh7B,QAAAA,CAAS2D,KAAT3D,GAAiB;cACT2D;YACF;;;MAEJ23B,GAAAA,GAAMP,UAAAA,CAAW/0B,OAAX+0B;MACN6D,KAAAA,GAAQD,WAAAA,CAAY/E,OAAZ+E,EAAqBrD,GAArBqD;;MAEVh7B,KAAAA,IAASA,KAAAA,KAAU,GAAG;WACjBi7B,KAAAA,CAAMxC,MAANwC,CAAaj7B,KAAbi7B;;;SAGFA,KAAAA,CAAMrC,WAANqC;AAbF,CAAP;;;;;;;;;;;AAsBA,IAAa13B,MAAAA,GAAS,SAATA,MAAS,CAAC0yB,OAAD,EAAUj2B,KAAV,EAAmC;MAAlBq3B,QAAkB,GAAA,SAAA,CAAA,MAAA,GAAA,CAAA,IAAA,SAAA,CAAA,CAAA,CAAA,KAAA,SAAA,GAAA,SAAA,CAAA,CAAA,CAAA,GAAP;MAC5Ch1B,OAAAA,GAAUg1B;;MACVh7B,QAAAA,CAAS2D,KAAT3D,GAAiB;cACT2D;YACF;;;MAGJ23B,GAAAA,GAAMP,UAAAA,CAAW/0B,OAAX+0B;MACN6D,KAAAA,GAAQD,WAAAA,CAAY/E,OAAZ+E,EAAqBrD,GAArBqD;SACPC,KAAAA,CAAMvD,SAANuD,CAAgBj7B,KAAhBi7B;AATF,CAAP;;;;;;;;;;;ACxCA;;AACA;;AACA;;AAMA;;AACA;;;;;;;;;;;;;;;;;;;;;;;;IACMC;;;;;AAEF;;;;;;AAMA;AACA;AACA;AACA,sBAAYC,UAAZ,EAAwBC,WAAxB,EACA;AAAA;;AAAA;;AACI;AACAC,IAAAA,IAAI,CAACC,sBAAL;AACA,UAAK5H,SAAL,GAAiB,IAAIzD,kBAAJ,EAAjB;AACA,UAAKkL,UAAL,GAAkBA,UAAlB;AACA,UAAKI,QAAL,GAAgBH,WAAhB;AACA,UAAKI,QAAL,GAAgB,IAAhB;AACA,UAAKpjC,GAAL,GAAW,EAAX;;AACA,QAAItB,IAAI,wDAAR;;AACA,UAAK2kC,SAAL;;AACAriC,IAAAA,MAAM,CAACsiC,gBAAP,CAAwB,QAAxB,EAAkC,UAAA3L,CAAC,EACnC;AACI,UAAIwL,QAAQ,GAAG,MAAKA,QAApB;;AACA,UAAIniC,MAAM,CAACg/B,WAAP,IAAsBmD,QAA1B,EACA;AACI3iC,QAAAA,QAAQ,CAACs7B,cAAT,CAAwB,cAAxB,EAAwCuC,KAAxC,CAA8C/4B,QAA9C,GAAyD,OAAzD;AACH,OAHD,MAKA;AACI9E,QAAAA,QAAQ,CAACs7B,cAAT,CAAwB,cAAxB,EAAwCuC,KAAxC,CAA8C/4B,QAA9C,GAAyD,UAAzD;AACH;AACJ,KAXD;;AAYA,UAAKi+B,OAAL;;AAtBJ;AAuBC,IACD;AACA;AACA;;;;;gCAEA;AAAA;;AACI,UAAI7kC,IAAI,GAAG,IAAX;AACA,UAAI8kC,aAAa,GAAGhjC,QAAQ,CAACijC,gBAAT,CAA0B,gBAA1B,CAApB;;AACA,WAAK,IAAIhnC,CAAC,GAAG,CAAR,EAAWF,MAAM,GAAGinC,aAAa,CAACjnC,MAAvC,EAA+CE,CAAC,GAAGF,MAAnD,EAA2DE,CAAC,EAA5D,EACA;AACI+mC,QAAAA,aAAa,CAAC/mC,CAAD,CAAb,CAAiB6mC,gBAAjB,CAAkC,OAAlC,EAA2C,UAAA5jC,CAAC;AAAA,iBAAI,MAAI,CAACgkC,kBAAL,CAAwBhkC,CAAxB,CAAJ;AAAA,SAA5C,EAA4E,KAA5E;AACH;;AACD,WAAKqjC,UAAL,CAAgBO,gBAAhB,CAAiC,OAAjC,EAA0C,UAAA3L,CAAC,EAC3C;AACI,YAAIA,CAAC,CAACgM,SAAF,IAAe,iBAAnB,EACA;AACI,cAAId,KAAK,GAAG,wBAASnkC,IAAI,CAACqkC,UAAd,EAA0B13B,GAA1B,GAAgC,CAA5C;AACA,cAAIu4B,OAAO,GAAGX,IAAI,CAACY,SAAL,CAAe,UAAf,EAA2BnlC,IAAI,CAACqkC,UAAL,CAAgBe,SAA3C,EAAsDl8B,KAApE;AACA,cAAI4R,IAAI,GAAGhZ,QAAQ,CAACo7B,aAAT,CAAuB,KAAvB,CAAX;AACApiB,UAAAA,IAAI,CAACsqB,SAAL,GAAiBF,OAAjB;AACAllC,UAAAA,IAAI,CAACqkC,UAAL,CAAgBlH,SAAhB,GAA4BriB,IAAI,CAACsqB,SAAjC;AACA,kCAASplC,IAAI,CAACqkC,UAAd,EAA0BF,KAA1B;AACH,SARD,MAUA;AACInkC,UAAAA,IAAI,CAAC6kC,OAAL;AACH;AACJ,OAfD;AAgBH;;;8BAED;AACI,UAAIV,KAAK,GAAG,wBAAS,KAAKE,UAAd,EAA0B13B,GAAtC;AACA,UAAIu4B,OAAO,GAAGX,IAAI,CAACY,SAAL,CAAe,UAAf,EAA2B,KAAKd,UAAL,CAAgBe,SAA3C,EAAsDl8B,KAApE;AACA,UAAI4R,IAAI,GAAGhZ,QAAQ,CAACo7B,aAAT,CAAuB,KAAvB,CAAX;AACApiB,MAAAA,IAAI,CAACsqB,SAAL,GAAiBF,OAAjB;AACA,WAAKb,UAAL,CAAgBlH,SAAhB,GAA4BriB,IAAI,CAACsqB,SAAjC;AACA,8BAAS,KAAKf,UAAd,EAA0BF,KAA1B;AACH;;;2BACMj/B,MAAM4pB,MACb;AACI,cAAQ5pB,IAAR;AAEI,aAAK1F,SAAS,CAACJ,YAAf;AACI0C,UAAAA,QAAQ,CAACs7B,cAAT,CAAwB,eAAxB,EAAyCiI,SAAzC,CAAmDl9B,GAAnD,CAAuD,WAAvD;AACArG,UAAAA,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCiI,SAAvC,CAAiDtW,MAAjD,CAAwD,WAAxD;AACAjtB,UAAAA,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCiI,SAAvC,CAAiDtW,MAAjD,CAAwD,cAAxD;AACAjtB,UAAAA,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCiI,SAAvC,CAAiDl9B,GAAjD,CAAqD,aAArD;AACA0c,UAAAA,UAAU,CAAC,UAAAoU,CAAC,EACZ;AACIn3B,YAAAA,QAAQ,CAACs7B,cAAT,CAAwB,eAAxB,EAAyCiI,SAAzC,CAAmDtW,MAAnD,CAA0D,WAA1D;AACAjtB,YAAAA,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCiI,SAAvC,CAAiDl9B,GAAjD,CAAqD,WAArD;AACArG,YAAAA,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCiI,SAAvC,CAAiDl9B,GAAjD,CAAqD,cAArD;AACArG,YAAAA,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuCiI,SAAvC,CAAiDtW,MAAjD,CAAwD,aAAxD;AACH,WANS,EAMP,IANO,CAAV;AAOA;;AACJ,aAAKvvB,SAAS,CAACL,UAAf;AACI;AACA;;AACJ,aAAK6/B,WAAW,CAACH,wBAAjB;AACI,kCAAS,KAAKwF,UAAd,EAA0B,KAAKK,QAA/B;AACA,cAAItC,GAAJ,EAASM,KAAT,EAAgB4C,MAAhB;AACAlD,UAAAA,GAAG,GAAG9/B,MAAM,CAAC+/B,YAAP,EAAN,CAHJ,CAGiC;AAC7B;;AACA,cAAID,GAAG,CAAC2B,UAAR,EACA;AACIrB,YAAAA,KAAK,GAAGN,GAAG,CAAC4B,UAAJ,CAAe,CAAf,CAAR;AACAsB,YAAAA,MAAM,GAAGlD,GAAG,CAAC4B,UAAJ,CAAe,CAAf,EAAkBtgC,QAAlB,EAAT;AACAg/B,YAAAA,KAAK,CAAC6C,cAAN;AACA7C,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,uBAAuB3U,IAAvB,GAA8B,iBAAtD,CAAjB;AACH;;AACD,eAAK+V,OAAL;AACA;AA/BR;AAiCH,MACD;AACA;AACA;;;;uCACmB7jC,GACnB;AACIA,MAAAA,CAAC,CAACwkC,cAAF;AACA,UAAIxlC,IAAI,GAAG,IAAX;AACA,UAAIoiC,GAAJ,EAASM,KAAT,EAAgB4C,MAAhB;AACAlD,MAAAA,GAAG,GAAG9/B,MAAM,CAAC+/B,YAAP,EAAN,CAJJ,CAIiC;;AAC7B,UAAID,GAAG,CAAC2B,UAAR,EACA;AACIrB,QAAAA,KAAK,GAAGN,GAAG,CAAC4B,UAAJ,CAAe,CAAf,CAAR;AACAsB,QAAAA,MAAM,GAAGlD,GAAG,CAAC4B,UAAJ,CAAe,CAAf,EAAkBtgC,QAAlB,EAAT;AACAg/B,QAAAA,KAAK,CAAC6C,cAAN;;AACA,gBAAQvkC,CAAC,CAACuG,MAAF,CAASuhB,EAAjB;AAEI,eAAK,WAAL;AACI4Z,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,OAAO6B,MAAP,GAAgB,IAAxC,CAAjB;AACA;;AACJ,eAAK,aAAL;AACI5C,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,MAAM6B,MAAN,GAAe,GAAvC,CAAjB;AACA;;AACJ,eAAK,oBAAL;AACI5C,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,UAAU6B,MAAV,GAAmB,QAA3C,CAAjB;AACA;;AACJ,eAAK,cAAL;AACI5C,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,OAAO6B,MAA/B,CAAjB;AACA;;AACJ,eAAK,cAAL;AACI5C,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,QAAQ6B,MAAhC,CAAjB;AACA;;AACJ,eAAK,cAAL;AACI5C,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,SAAS6B,MAAjC,CAAjB;AACA;;AACJ,eAAK,YAAL;AACI,iBAAKZ,QAAL,GAAgB,wBAAS,KAAKL,UAAd,EAA0B13B,GAA1C;AACA,iBAAK84B,SAAL,CAAezG,WAAW,CAACH,wBAA3B;AACA;;AACJ,eAAK,aAAL;AACA,eAAK,WAAL;AACI,iBAAK4G,SAAL,CAAezG,WAAW,CAACF,WAA3B;AACA;;AACJ,eAAK,eAAL;AACA,eAAK,aAAL;AACI,iBAAK2G,SAAL,CAAezG,WAAW,CAACD,aAA3B;AACA;;AACJ,eAAK,WAAL;AACI2D,YAAAA,KAAK,CAACgB,UAAN,CAAiB5hC,QAAQ,CAAC2hC,cAAT,CAAwB,MAAM6B,MAAN,GAAe,mBAAvC,CAAjB;AACA;;AACJ,eAAK,aAAL;AACI,iBAAKG,SAAL,CAAezG,WAAW,CAACJ,aAA3B;AACA;;AACJ;AACI;AACA;AAxCR;AA0CH;;AACD,WAAKiG,OAAL;AACH;;;;EAvKoB5nC;;eAyKVmnC;;;;;;;;;;AClLf;;AAUA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;;;;;;;;;;;IACqBsB;;;AAEjB;AACA;AACA;AACA,wBACA;AAAA;;AAAA;;AACI,QAAI1lC,IAAI,GAAG,IAAX;AACA,SAAK2lC,IAAL,GAAY,IAAI7iC,gBAAJ,EAAZ;AACA,SAAKm4B,SAAL,GAAiB,IAAIl7B,kBAAJ,EAAjB;AACA,SAAK68B,SAAL,GAAiB,IAAIzD,kBAAJ,EAAjB;AACA,SAAKyM,SAAL,GAAiB9jC,QAAQ,CAACS,GAAT,CAAawG,KAAb,CAAmB,GAAnB,CAAjB;AACA,SAAK8zB,OAAL,GAAe,IAAI7B,gBAAJ,EAAf;AACA,SAAKW,IAAL,GAAY,EAAZ;AACA,SAAKkK,MAAL,GAAc,IAAd;;AAEA,QAAI/jC,QAAQ,CAACs7B,cAAT,CAAwB,iBAAxB,EAA2CgB,YAA3C,CAAwD,YAAxD,CAAJ,EACA;AACI,WAAKyH,MAAL,GAAc/jC,QAAQ,CAACs7B,cAAT,CAAwB,iBAAxB,EAA2CgB,YAA3C,CAAwD,YAAxD,CAAd;AACA,WAAKvB,OAAL,CAAaiJ,OAAb,CAAqB,KAAKD,MAA1B,EAAkCzjC,IAAlC,CAAuC,UAAAP,IAAI,EAAE;AACzC7B,QAAAA,IAAI,CAAC27B,IAAL,GAAY95B,IAAI,CAAC85B,IAAjB;;AACA,QAAA,KAAI,CAAC/T,KAAL;AACH,OAHD,EAGGgP,KAHH,CAGS,UAAAnxB,GAAG,EAAE,CACV;AACH,OALD;AAMH,KATD,MASK;AACD,WAAKmiB,KAAL;AACH;;AACD,QAAI9lB,QAAQ,CAACs7B,cAAT,CAAwB,gBAAxB,CAAJ,EACA;AACI,WAAK2I,MAAL,GAAc,IAAI3B,mBAAJ,CAAetiC,QAAQ,CAACs7B,cAAT,CAAwB,gBAAxB,CAAf,EAA0Dt7B,QAAQ,CAACs7B,cAAT,CAAwB,QAAxB,EAAkC+C,YAAlC,GAAiDr+B,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,EAAuC+C,YAAxF,GAAuGr+B,QAAQ,CAACs7B,cAAT,CAAwB,cAAxB,EAAwC+C,YAAzM,CAAd;AACA,WAAK4F,MAAL,CAAY//B,WAAZ,CAAwBg5B,WAAW,CAACJ,aAApC,EAAmD,UAAA3F,CAAC;AAAA,eAAI,KAAI,CAAC+M,mBAAL,CAAyBhH,WAAW,CAACJ,aAArC,CAAJ;AAAA,OAApD,EAA6G,KAA7G;AACA,WAAKmH,MAAL,CAAY//B,WAAZ,CAAwBg5B,WAAW,CAACH,wBAApC,EAA8D,UAAA5F,CAAC;AAAA,eAAI,KAAI,CAAC+M,mBAAL,CAAyBhH,WAAW,CAACH,wBAArC,CAAJ;AAAA,OAA/D,EAAmI,KAAnI;AACA,WAAKkH,MAAL,CAAY//B,WAAZ,CAAwBg5B,WAAW,CAACD,aAApC,EAAmD,UAAA9F,CAAC;AAAA,eAAI,KAAI,CAAC+M,mBAAL,CAAyBhH,WAAW,CAACD,aAArC,CAAJ;AAAA,OAApD,EAA6G,KAA7G;AACA,WAAKgH,MAAL,CAAY//B,WAAZ,CAAwBg5B,WAAW,CAACF,WAApC,EAAiD,UAAA7F,CAAC;AAAA,eAAI,KAAI,CAAC+M,mBAAL,CAAyBhH,WAAW,CAACF,WAArC,CAAJ;AAAA,OAAlD,EAAyG,KAAzG;AACAh9B,MAAAA,QAAQ,CAACs7B,cAAT,CAAwB,mBAAxB,EAA6CwH,gBAA7C,CAA8D,QAA9D,EAAwE,UAAA5jC,CAAC,EACzE;AACIhB,QAAAA,IAAI,CAACimC,iBAAL,CAAuBjlC,CAAC,CAACuG,MAAF,CAASuhB,EAAhC,EAAoC9nB,CAAC,CAACuG,MAAF,CAASu1B,KAA7C;AACH,OAHD,EAGG,KAHH;AAIA,mCAAeh7B,QAAQ,CAACs7B,cAAT,CAAwB,WAAxB,CAAf,EACA;AACI8I,QAAAA,IAAI,EAAE,UADV;AAEInE,QAAAA,MAFJ,kBAEWjI,IAFX,EAGI;AACI;AACA,iBAAO95B,IAAI,CAAC48B,SAAL,CAAepD,OAAf,CAAuB,QAAvB,EAAiCM,IAAjC,CAAP;AACH;AANL,OADA;AASH;AACJ,IACD;AACA;AACA;;;;;4BAEA;AAAA;;AACI,UAAI95B,IAAI,GAAG,IAAX;;AACA,UAAI8B,QAAQ,CAACs7B,cAAT,CAAwB,qBAAxB,CAAJ,EACA;AACIt7B,QAAAA,QAAQ,CAACs7B,cAAT,CAAwB,qBAAxB,EAA+CwH,gBAA/C,CAAgE,UAAhE,EAA4E,KAAKuB,kBAAjF,EAAqG,KAArG;AACArkC,QAAAA,QAAQ,CAACs7B,cAAT,CAAwB,qBAAxB,EAA+CwH,gBAA/C,CAAgE,MAAhE,EAAwE,KAAKuB,kBAA7E,EAAiG,KAAjG;AACArkC,QAAAA,QAAQ,CAACs7B,cAAT,CAAwB,uBAAxB,EAAiDwH,gBAAjD,CAAkE,QAAlE,EAA4E,UAAA5jC,CAAC;AAAA,iBAAI,MAAI,CAACmlC,kBAAL,CAAwBnlC,CAAxB,CAAJ;AAAA,SAA7E,EAA6G,KAA7G;;AACA,YAAIc,QAAQ,CAACs7B,cAAT,CAAwB,oBAAxB,CAAJ,EACA;AACIt7B,UAAAA,QAAQ,CAACs7B,cAAT,CAAwB,oBAAxB,EAA8CwH,gBAA9C,CAA+D,OAA/D,EAAwE,UAAA5jC,CAAC,EACzE;AACIc,YAAAA,QAAQ,CAACs7B,cAAT,CAAwB,uBAAxB,EAAiDgJ,KAAjD;AACH,WAHD;AAIH;;AACD,YAAIC,aAAa,GAAGvkC,QAAQ,CAACijC,gBAAT,CAA0B,kBAA1B,CAApB;;AACA,aAAK,IAAIhnC,CAAC,GAAG,CAAR,EAAWF,MAAM,GAAGwoC,aAAa,CAACxoC,MAAvC,EAA+CE,CAAC,GAAGF,MAAnD,EAA2DE,CAAC,EAA5D,EACA;AACIsoC,UAAAA,aAAa,CAACtoC,CAAD,CAAb,CAAiB6mC,gBAAjB,CAAkC,OAAlC,EAA2C,UAAA5jC,CAAC;AAAA,mBAAI,MAAI,CAACslC,iBAAL,CAAuBtlC,CAAvB,CAAJ;AAAA,WAA5C,EAA2E,KAA3E;AACH;AACJ;AACJ,MACD;AACA;AACA;;;;sCACkBA,GAClB;AACI,UAAIulC,aAAJ;;AACA,cAAQvlC,CAAC,CAACuG,MAAF,CAASuhB,EAAjB;AAEI,aAAK,kBAAL;AACA,aAAK,aAAL;AACIyd,UAAAA,aAAa,GAAGzkC,QAAQ,CAACs7B,cAAT,CAAwB,aAAxB,CAAhB;AACA;;AACJ,aAAK,qBAAL;AACA,aAAK,gBAAL;AACImJ,UAAAA,aAAa,GAAGzkC,QAAQ,CAACs7B,cAAT,CAAwB,gBAAxB,CAAhB;AACA;;AACJ,aAAK,uBAAL;AACA,aAAK,kBAAL;AACImJ,UAAAA,aAAa,GAAGzkC,QAAQ,CAACs7B,cAAT,CAAwB,kBAAxB,CAAhB;AACA;AAbR;;AAeA,UAAIoJ,MAAM,GAAGD,aAAa,CAACnI,YAAd,CAA2B,aAA3B,CAAb;AACCoI,MAAAA,MAAM,IAAI,OAAX,GAAsBD,aAAa,CAACE,YAAd,CAA2B,aAA3B,EAA0C,MAA1C,CAAtB,GAAyEF,aAAa,CAACE,YAAd,CAA2B,aAA3B,EAA0C,OAA1C,CAAzE;AACH;;;wCACmBzlC,GACpB;AAAA;;AACI,UAAIhB,IAAI,GAAG,IAAX;;AACA,cAAQgB,CAAR;AAEI,aAAKg+B,WAAW,CAACF,WAAjB;AACI,cAAInC,oBAAJ,GAAkBjB,MAAlB,CAAyB,KAAKmK,MAA9B,EAAsC,KAAKlK,IAA3C,EAAiD+J,UAAU,CAACgB,WAA5D,EAAyE3L,kBAAzE,EAAoF34B,IAApF,CAAyF,UAAAZ,QAAQ,EACjG;AACIqjB,YAAAA,UAAU,CAAC,UAAAoU,CAAC,EACZ;AACIj5B,cAAAA,IAAI,CAAC68B,OAAL,CAAaiJ,OAAb,CAAqBr+B,MAAM,CAACjG,QAAQ,CAACA,QAAT,CAAkB86B,OAAnB,CAA3B,EAAwDl6B,IAAxD,CAA6D,UAAAmZ,CAAC,EAAE;AAC5DjZ,gBAAAA,MAAM,CAACqkC,QAAP,GAAkB,6BAA6BprB,CAAC,CAACogB,IAAF,CAAOiC,IAAtD;AACH,eAFD;AAIH,aANS,EAMP,GANO,CAAV;AAOH,WATD,EASGhH,KATH,CASS,UAAAnxB,GAAG,EACZ,CACI;AACH,WAZD;AAaA;;AACJ,aAAKu5B,WAAW,CAACD,aAAjB;AACI,cAAIpC,oBAAJ,GAAkBjB,MAAlB,CAAyB,KAAKmK,MAA9B,EAAsC,KAAKlK,IAA3C,EAAiD+J,UAAU,CAACgB,WAA5D,EAAyE3L,kBAAzE,EAAoF34B,IAApF,CAAyF,UAAAZ,QAAQ,EACjG;AACI,YAAA,MAAI,CAACukC,MAAL,CAAYa,MAAZ,CAAmBpnC,SAAS,CAACJ,YAA7B,EAA2C,MAAI,CAACymC,MAAhD;AACH,WAHD,EAGGjP,KAHH,CAGS,UAAAnxB,GAAG,EACZ,CACI;AACH,WAND;AAOA;;AACJ,aAAKu5B,WAAW,CAACJ,aAAjB;AACI,cAAIiI,OAAO,CAAC,kDAAD,CAAX,EACA;AACI,gBAAIlK,oBAAJ,GAAkBmK,UAAlB,CAA6B,KAAKjB,MAAlC,EAA0C,KAAKlK,IAA/C,EAAqDv5B,IAArD,CAA0D,UAACZ,QAAD,EAC1D;AACIqjB,cAAAA,UAAU,CAAC,UAAAoU,CAAC,EACR;AACI32B,gBAAAA,MAAM,CAACqkC,QAAP,GAAkB,qBAAlB;AAEH,eAJK,EAIH,GAJG,CAAV;AAKH,aAPD,EAOG/P,KAPH,CAOS,UAACnxB,GAAD,EACT;AACIW,cAAAA,OAAO,CAAC01B,GAAR,CAAYr2B,GAAZ;AACH,aAVD;AAWH,WAbD,MAeA,CACI;AACH;;AACD;;AACJ,aAAKu5B,WAAW,CAACH,wBAAjB;AACI/8B,UAAAA,QAAQ,CAACs7B,cAAT,CAAwB,mBAAxB,EAA6CgJ,KAA7C;AACA;AAhDR;AAkDH;;;uCACkBplC,GACnB;AACIA,MAAAA,CAAC,CAAC+lC,eAAF;AACA/lC,MAAAA,CAAC,CAACwkC,cAAF;AACA,UAAIxlC,IAAI,GAAG,IAAX;;AACA,cAAQgB,CAAC,CAACkE,IAAV;AAEI,aAAK,UAAL;AACIlE,UAAAA,CAAC,CAACgmC,YAAF,CAAeC,UAAf,GAA4B,MAA5B,CADJ,CACwC;;AACpC;;AACJ,aAAK,QAAL;AACA,aAAK,MAAL;AACKjmC,UAAAA,CAAC,CAACkE,IAAF,IAAU,MAAX,GAAqBwgC,UAAU,CAACgB,WAAX,GAAyB1lC,CAAC,CAACgmC,YAAF,CAAelK,KAA7D,GAAoE4I,UAAU,CAACgB,WAAX,GAAyB1lC,CAAC,CAACuG,MAAF,CAASu1B,KAAtG;;AACA,eAAK,IAAI/+B,CAAC,GAAG,CAAR,EAAWk7B,CAAhB,EAAmBA,CAAC,GAAGyM,UAAU,CAACgB,WAAX,CAAuB3oC,CAAvB,CAAvB,EAAkDA,CAAC,EAAnD,EACA;AACI;AACA,gBAAI,CAACk7B,CAAC,CAAC/zB,IAAF,CAAOoL,KAAP,CAAa,SAAb,CAAL,EACA;AACI;AACH;;AACD,gBAAI42B,MAAM,GAAG,IAAIC,UAAJ,EAAb,CANJ,CAOI;;AACAD,YAAAA,MAAM,CAACnmC,MAAP,GAAiB,UAASqmC,OAAT,EACjB;AACI,qBAAO,UAASnO,CAAT,EACP;AACI;AACA,oBAAIoO,KAAK,GAAGvlC,QAAQ,CAACo7B,aAAT,CAAuB,KAAvB,CAAZ;AACAmK,gBAAAA,KAAK,CAACzlC,GAAN,GAAYq3B,CAAC,CAAC1xB,MAAF,CAASmI,MAArB;AACA23B,gBAAAA,KAAK,CAACvhB,KAAN,GAAc5Z,MAAM,CAACk7B,OAAO,CAACv0B,IAAT,CAApB;AACA,oBAAIy0B,IAAI,GAAGxlC,QAAQ,CAACo7B,aAAT,CAAuB,KAAvB,CAAX;AACAoK,gBAAAA,IAAI,CAACnK,SAAL,GAAiB,CAAC,YAAD,EACblE,CAAC,CAAC1xB,MAAF,CAASmI,MADI,EACI,WADJ,EAEbxD,MAAM,CAACk7B,OAAO,CAACv0B,IAAT,CAFO,EAES,KAFT,EAGfhJ,IAHe,CAGV,EAHU,CAAjB,CANJ,CAUI;;AACA/H,gBAAAA,QAAQ,CAACs7B,cAAT,CAAwB,qBAAxB,EAA+CD,SAA/C,GAA2D,EAA3D;AACAr7B,gBAAAA,QAAQ,CAACs7B,cAAT,CAAwB,qBAAxB,EAA+CmK,WAA/C,CAA2DF,KAA3D;AACH,eAdD;AAeH,aAjBe,CAiBbpO,CAjBa,CAAhB,CARJ,CA0BI;;;AACAiO,YAAAA,MAAM,CAACM,aAAP,CAAqBvO,CAArB;AACH;;AACD,cAAIj4B,CAAC,CAACuG,MAAF,CAASuhB,EAAT,IAAe,uBAAnB,EAA4C,KAAKmd,iBAAL,CAAuBjlC,CAAC,CAACuG,MAAF,CAASuhB,EAAhC,EAAoC4c,UAAU,CAACgB,WAA/C;AAC5C;AAvCR;AAyCH;;;sCACiBxhC,MAAM43B,OACxB;AACI,UAAIx7B,GAAG,GAAG,EAAV;AACA,UAAIpB,SAAS,GAAG,EAAhB;AACA,UAAIF,IAAI,GAAG,IAAX;AACCkF,MAAAA,IAAI,IAAI,uBAAT,GAAoC5D,GAAG,GAAG,6BAA1C,GAAyEA,GAAG,GAAG,0BAA/E;AACC4D,MAAAA,IAAI,IAAI,uBAAT,GAAoChF,SAAS,GAAGV,SAAS,CAACP,mBAA1D,GAA+EiB,SAAS,GAAGV,SAAS,CAACR,gBAArG;AACA,UAAIyoC,SAAS,GAAG,IAAIC,QAAJ,EAAhB;;AACA,WAAK,IAAI3pC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG++B,KAAK,CAACj/B,MAA1B,EAAkCE,CAAC,EAAnC,EACA;AACI,YAAI8Y,IAAI,GAAGimB,KAAK,CAAC/+B,CAAD,CAAhB,CADJ,CAEI;;AACA,YAAI,CAAC8Y,IAAI,CAAC3R,IAAL,CAAUoL,KAAV,CAAgB,SAAhB,CAAL,EACA;AACI;AACH;;AACApL,QAAAA,IAAI,IAAI,uBAAT,GAAoCuiC,SAAS,CAAC7X,MAAV,CAAiB,eAAjB,EAAkC/Y,IAAlC,EAAwCA,IAAI,CAAChE,IAA7C,CAApC,GAAwF40B,SAAS,CAAC7X,MAAV,CAAiB,YAAjB,EAA+B/Y,IAA/B,EAAqCA,IAAI,CAAChE,IAA1C,CAAxF;AACH;;AACD,WAAKooB,SAAL,CAAex6B,OAAf,CAAuBa,GAAvB,EAA4BpB,SAA5B,EAAuCT,4BAAvC,EAA0DK,4BAA1D,EAA6E2nC,SAA7E,EAAwFrlC,IAAxF,CAA6F,UAACZ,QAAD,EAC7F;AACI,YAAI+Z,CAAC,GAAGna,IAAI,CAACyH,KAAL,CAAWrH,QAAQ,CAACf,OAAT,CAAiB,UAAjB,CAAX,CAAR;AACA,YAAI8a,CAAC,CAACwN,OAAF,IAAavpB,SAAS,CAACR,gBAA3B,EAA6CgB,IAAI,CAAC+lC,MAAL,CAAYa,MAAZ,CAAmB5H,WAAW,CAACH,wBAA/B,EAAyDtjB,CAAC,CAACja,GAA3D;AAChD,OAJD,EAIGs1B,KAJH,CAIS,UAACnxB,GAAD,EACT,CACI;AACH,OAPD;AAQH;;;;;;;AAELigC,UAAU,CAACgB,WAAX,GAAyB,EAAzB;;;;;;;;;ACxPA;;AACA;;;;;;;;;;IACqBiB;;;AAEjB;AACA;AACA;AACA,qBAAYxJ,IAAZ,EACA;AAAA;;AACI,SAAKyJ,WAAL,GAAmB,IAAnB;AACA,SAAKC,UAAL,CAAgB1J,IAAhB;AACA,SAAKvW,KAAL;AACH,IACD;AACA;AACA;;;;;4BAEA;AACI,UAAI5nB,IAAI,GAAG,IAAX;AACH;;;+BACUm+B,MACX;AACI,WAAKyJ,WAAL,GAAmB,EAAnB;;AACA,cAAQzJ,IAAR;AAEI,aAAK,MAAL;AACA,aAAK,KAAL;AACI,eAAKyJ,WAAL,GAAmB,IAAIlC,mBAAJ,EAAnB;AACA;;AACJ;AACI;AACA;AARR;AAUH,MACD;AACA;AACA;;;;;;;;;;;;;;;;ACpCJ;;AACA;;AACA;;;;;;;;;;IAEqBoC;;;AACjB;AACA;AACA;AACA,yBAAc;AAAA;;AACV,SAAKC,cAAL,GAAsB,EAAtB;AACA,SAAKnC,SAAL,GAAiB9jC,QAAQ,CAACS,GAAT,CAAawG,KAAb,CAAmB,GAAnB,CAAjB;AACA,SAAKi/B,aAAL,CAAmB,KAAKpC,SAAL,CAAe,CAAf,CAAnB,EAAsC,KAAKA,SAAL,CAAe,CAAf,CAAtC;AACH,IACD;AACA;AACA;;;;;4BACQ;AACJ,UAAI5lC,IAAI,GAAG,IAAX;AAEH;;;kCAEaygB,SAAS0d,MAAM;AACzB,WAAK4J,cAAL,GAAsB,EAAtB;;AACA,cAAQtnB,OAAR;AACI,aAAK,OAAL;AACI,eAAKsnB,cAAL,GAAsB,IAAIJ,kBAAJ,CAAcxJ,IAAd,CAAtB;AACA;;AAEJ;AACI;AACA;AAPR;;AASA,WAAKvW,KAAL;AAEH,MACD;AACA;AACA;;;;;;;;;;;;;;;;ACrCJ;;AAUA;;AACA;;AACA;;;;;;;;;;;;IACqBqgB;;;AAEjB;AACA;AACA;AACA,kBACA;AAAA;;AACI,QAAIjoC,IAAI,GAAG,IAAX;AACA,SAAKkoC,WAAL,GAAmB,EAAnB;AACA,SAAKjN,SAAL,GAAiB,IAAIl7B,kBAAJ,EAAjB;AACA,SAAK88B,OAAL,GAAe,IAAI7B,gBAAJ,EAAf;AACA,SAAKuF,QAAL,GAAgB,EAAhB;AACA,SAAK4H,WAAL;AACA,SAAKC,cAAL;AACH;;;;4BAED;AACI,WAAKF,WAAL,GAAmB,IAAIJ,oBAAJ,EAAnB;AACH,MACD;AACA;AACA;;;;qCAEA;AACI,UAAI9nC,IAAI,GAAG,IAAX;AACA,WAAKi7B,SAAL,CAAex6B,OAAf,CAAuB,gBAAvB,EAAyCjB,SAAS,CAAChB,eAAnD,EAAoE4D,IAApE,CAAyE,UAACZ,QAAD,EACzE;AACI,YAAI6mC,KAAK,GAAGjnC,IAAI,CAACyH,KAAL,CAAWrH,QAAQ,CAACf,OAAT,CAAiB,UAAjB,CAAX,CAAZ;AAEA,YAAIkG,IAAI,GAAG,EAAX;;AACA,aAAK,IAAI/I,KAAK,GAAG,CAAjB,EAAoBA,KAAK,GAAGyqC,KAAK,CAACxqC,MAAlC,EAA0CD,KAAK,EAA/C,EAAmD;AAC/C+I,UAAAA,IAAI,CAAClJ,IAAL,CAAU;AAACqrB,YAAAA,EAAE,EAACuf,KAAK,CAACzqC,KAAD,CAAL,CAAakrB,EAAjB;AAAqB6S,YAAAA,IAAI,EAAC0M,KAAK,CAACzqC,KAAD,CAAL,CAAa+9B;AAAvC,WAAV;AACH;;AACD37B,QAAAA,IAAI,CAAC68B,OAAL,CAAayL,SAAb,CAAuB3hC,IAAvB,EAA6BvE,IAA7B,CAAkC,UAAAmZ,CAAC,EAAE;AACjCvb,UAAAA,IAAI,CAAC4nB,KAAL;AACH,SAFD,EAEGgP,KAFH,CAES,UAAAnxB,GAAG,EAAE;AACVW,UAAAA,OAAO,CAAC01B,GAAR,CAAYr2B,GAAZ;AACH,SAJD;AAKH,OAbD,EAaGmxB,KAbH,CAaS,UAACnxB,GAAD,EACT;AACIW,QAAAA,OAAO,CAAC01B,GAAR,CAAYr2B,GAAZ;AACH,OAhBD;AAiBH;;;kCAGD;AACI,UAAI,mBAAmB8iC,SAAvB,EACA;AACIjmC,QAAAA,MAAM,CAACsiC,gBAAP,CAAwB,MAAxB,EAAgC,YAChC;AACI2D,UAAAA,SAAS,CAACC,aAAV,CAAwBC,QAAxB,CAAiC,wCAAsC/lC,IAAI,CAACwY,KAAL,CAAW,IAAIme,IAAJ,GAAWO,OAAX,KAAqB,IAAhC,CAAvE,EAA8Gx3B,IAA9G,CAAmH,UAASsmC,YAAT,EACnH,CACI;AACH,WAHD,EAGG9R,KAHH,CAGS,UAAStxB,KAAT,EACT,CACI;AACH,WAND;AAOH,SATD;AAUH,OAZD,MAcA,CACI;AACH;AACJ,MACD;AACA;AACA;;;;;;;;;;;AC/EJ;;;;AAEAxD,QAAQ,CAAC8iC,gBAAT,CAA0B,kBAA1B,EAA8C,YAAW;AAErD,MAAI+D,IAAI,GAAG,IAAIV,aAAJ,EAAX;AACH,CAHD,EAGG,KAHH","file":"dash.min.map","sourceRoot":"../../src/com","sourcesContent":["class EventEmitter\n{\n\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {\n this.listeners = new Map();\n }\n //--------------------------\n // methods\n //--------------------------\n addListener(label, callback) {\n this.listeners.has(label) || this.listeners.set(label, []);\n this.listeners.get(label).push(callback);\n }\n\n removeListener(label, callback) {\n var isFunction = function(obj) {\n return typeof obj == 'function' || false;\n };\n\n var listeners = this.listeners.get(label),\n index;\n\n if (listeners && listeners.length) {\n index = listeners.reduce((i, listener, index) => {\n return (isFunction(listener) && listener === callback)\n ? i = index\n : i;\n }, -1);\n\n if (index > -1) {\n listeners.splice(index, 1);\n this.listeners.set(label, listeners);\n return true;\n }\n }\n return false;\n }\n\n emitEvent(label, ...args) {\n var listeners = this.listeners.get(label);\n if (listeners && listeners.length) {\n listeners.forEach((listener) => {\n listener(...args);\n });\n return true;\n }\n return false;\n }\n //--------------------------\n // event handlers\n //--------------------------\n}\nexport default EventEmitter\n","export const REQUEST_GOOD = 'requestGood';\nexport const REQUEST_LAME = 'requestLame';\nexport const IMG_REQUEST_GOOD = 'imgRequestGood';\nexport const IMG_REQUEST_LAME = 'imgRequestLame';\nexport const SETTINGS_LOADED = 'dataLoaded';\nexport const HTML_LOADED = 'htmlLoaded';\nexport const ARCHIVES_JSON_LOADED = 'archivesJSONLoaded';\nexport const ARCHIVES_PAGE_LOADED = 'archivesPAGELoaded';\nexport const ARCHIVES_ENTRY_LOADED = 'archivesEntryLoaded';\nexport const PROJECT_UPDATED = 'projectUpdated';\nexport const PROJECT_ADDED = 'projectAdded';\nexport const PROJECTS_SORTED = 'projectsSorted';\nexport const POST_IMAGE_ADDED = 'postImageAdded';\nexport const FEATURE_IMAGE_ADDED = 'featureImageAdded';\nexport const POST_ERROR = 'postError';\nexport const POST_ADDED = 'postAdded';\nexport const POST_UPDATED = 'postUpdated';\nexport const POST_DELETED = 'postImageAdded';\nexport const POSTS_SYNCED = 'postsSynced';\nexport const LOCAL_DB_READY = 'localDBReady';\n\nclass DataEvent\n{\n\n //--------------------------\n // methods\n //--------------------------\n\n\n\n //--------------------------\n // event handlers\n //--------------------------\n}\nexport default new DataEvent\n","export const REQUEST_TYPE_POST = \"POST\";\nexport const REQUEST_TYPE_GET = \"GET\";\nexport const REQUEST_TYPE_PUT = \"PUT\";\nexport const REQUEST_TYPE_DELETE = \"DELETE\";\nexport const CONTENT_TYPE_JSON = 'json';\nexport const CONTENT_TYPE_FORM = 'x-www-form-urlencoded';\nimport EventEmitter from '../events/EventEmitter';\nimport * as DataEvent from '../events/DataEvent';\nclass DataUtils extends EventEmitter\n{\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {\n super();\n var self = this;\n }\n //--------------------------\n // methods\n //--------------------------\n request(requestURL, eventType, requestType = REQUEST_TYPE_GET, contentType = CONTENT_TYPE_JSON, requestData = null)\n {\n var self = this;\n return new Promise(function(resolve, reject)\n {\n var request = new XMLHttpRequest();\n request.upload.onprogress = self.handleLoadProgress;\n request.open(requestType, requestURL, true);\n request.onload = function(e)\n {\n if (request.status == 200)\n {\n resolve(\n {\n request,\n eventType\n });\n }\n else\n {\n reject(\n {\n request,\n eventType\n });\n };\n };\n if (requestType == REQUEST_TYPE_PUT || requestType == REQUEST_TYPE_POST)\n {\n switch (contentType)\n {\n case CONTENT_TYPE_JSON:\n request.setRequestHeader(\"Content-type\", \"application/\" + contentType);\n request.send(JSON.stringify(requestData));\n break;\n case CONTENT_TYPE_FORM:\n request.send(requestData);\n break;\n }\n }\n else\n {\n request.send();\n }\n })\n }\n imgLoad(url)\n {\n 'use strict';\n // Create new promise with the Promise() constructor;\n // This has as its argument a function with two parameters, resolve and reject\n return new Promise(function(resolve, reject)\n {\n // Standard XHR to load an image\n var request = new XMLHttpRequest();\n request.open('GET', url);\n request.responseType = 'blob';\n // When the request loads, check whether it was successful\n request.onload = function()\n {\n if (request.status === 200)\n {\n // If successful, resolve the promise by passing back the request response\n resolve(request.response);\n }\n else\n {\n // If it fails, reject the promise with a error message\n reject(new Error('Image didn\\'t load successfully; error code:' + request.statusText));\n }\n };\n request.onerror = function()\n {\n // Also deal with the case when the entire request fails to begin with\n // This is probably a network error, so reject the promise with an appropriate message\n reject(new Error('There was a network error.'));\n };\n // Send the request\n request.send();\n });\n }\n loadImage(src)\n {\n 'use strict';\n let self = this;\n return new Promise(function(resolve, reject)\n {\n // Get a reference to the body element, and create a new image object\n var body = document.querySelector('body'),\n myImage = new Image();\n myImage.crossOrigin = \"\"; // or \"anonymous\"\n // Call the function with the URL we want to load, but then chain the\n // promise then() method on to the end of it. This contains two callbacks\n self.imgLoad(src).then(function(response)\n {\n // The first runs when the promise resolves, with the request.reponse specified within the resolve() method.\n var imageURL = window.URL.createObjectURL(response);\n resolve(imageURL);\n //$('background-content').setStyle('background-image', 'url('+imageURL+')') //myImage.src = imageURL;\n //console.log(imageURL);\n //body.appendChild(myImage);\n // The second runs when the promise is rejected, and logs the Error specified with the reject() method.\n }, function(Error)\n {\n reject(Error)\n });\n });\n }\n //--------------------------\n // event handlers\n //--------------------------\n handleLoadProgress(e)\n {\n var percentComplete = Math.ceil((e.loaded / e.total) * 100);\n //console.log(percentComplete);\n }\n}\nexport default DataUtils;","import EventEmitter from '../events/EventEmitter';\n\nclass Animate extends EventEmitter {\n //--------------------------\n // constructor\n //--------------------------\n constructor() {\n super();\n }\n //--------------------------\n // methods\n //--------------------------\n object(properties) {\n var animation = anime(\n properties\n );\n //animation.start(properties);\n }\n //--------------------------\n // event handlers\n //--------------------------\n}\nexport default Animate\n","class StringUtils\n{\n\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {}\n //--------------------------\n // methods\n //--------------------------\n cleanString(string)\n {\n var clean = string.replace(/(^\\-+|[^a-zA-Z0-9\\/_| -]+|\\-+$)/g, '').toLowerCase().replace(/[\\/_| -]+/g, '-');\n return clean;\n }\n\n decodeHTML(string, quote_style) {\n var optTemp = 0,\n i = 0,\n noquotes = false;\n if (typeof quote_style === 'undefined') {\n quote_style = 2;\n }\n string = string.toString().replace(/&lt;/g, '<').replace(/&gt;/g, '>');\n var OPTS = {\n 'ENT_NOQUOTES': 0,\n 'ENT_HTML_QUOTE_SINGLE': 1,\n 'ENT_HTML_QUOTE_DOUBLE': 2,\n 'ENT_COMPAT': 2,\n 'ENT_QUOTES': 3,\n 'ENT_IGNORE': 4\n };\n if (quote_style === 0) {\n noquotes = true;\n }\n if (typeof quote_style !== 'number') { // Allow for a single string or an array of string flags\n quote_style = [].concat(quote_style);\n for (i = 0; i < quote_style.length; i++) {\n // Resolve string input to bitwise e.g. 'PATHINFO_EXTENSION' becomes 4\n if (OPTS[quote_style[i]] === 0) {\n noquotes = true;\n } else if (OPTS[quote_style[i]]) {\n optTemp = optTemp | OPTS[quote_style[i]];\n }\n }\n quote_style = optTemp;\n }\n if (quote_style & OPTS.ENT_HTML_QUOTE_SINGLE) {\n string = string.replace(/&#0*39;/g, \"'\"); // PHP doesn't currently escape if more than one 0, but it should\n // string = string.replace(/&apos;|&#x0*27;/g, \"'\"); // This would also be useful here, but not a part of PHP\n }\n if (!noquotes) {\n string = string.replace(/&quot;/g, '\"');\n }\n // Put this in last place to avoid escape being double-decoded\n string = string.replace(/&amp;/g, '&');\n return string;\n }\n\n //--------------------------\n // event handlers\n //--------------------------\n}\nexport default StringUtils\n","export var keys = Object.keys;\nexport var isArray = Array.isArray;\nexport var _global =\n typeof self !== 'undefined' ? self :\n typeof window !== 'undefined' ? window :\n global;\n\nexport function extend(obj, extension) {\n if (typeof extension !== 'object') return obj;\n keys(extension).forEach(function (key) {\n obj[key] = extension[key];\n });\n return obj;\n}\n\nexport const getProto = Object.getPrototypeOf;\nexport const _hasOwn = {}.hasOwnProperty;\nexport function hasOwn(obj, prop) {\n return _hasOwn.call(obj, prop);\n}\n\nexport function props (proto, extension) {\n if (typeof extension === 'function') extension = extension(getProto(proto));\n keys(extension).forEach(key => {\n setProp(proto, key, extension[key]);\n });\n}\n\nexport const defineProperty = Object.defineProperty;\n\nexport function setProp(obj, prop, functionOrGetSet, options) {\n defineProperty(obj, prop, extend(functionOrGetSet && hasOwn(functionOrGetSet, \"get\") && typeof functionOrGetSet.get === 'function' ?\n {get: functionOrGetSet.get, set: functionOrGetSet.set, configurable: true} :\n {value: functionOrGetSet, configurable: true, writable: true}, options));\n}\n\nexport function derive(Child) {\n return {\n from: function (Parent) {\n Child.prototype = Object.create(Parent.prototype);\n setProp(Child.prototype, \"constructor\", Child);\n return {\n extend: props.bind(null, Child.prototype)\n };\n }\n };\n}\n\nexport const getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\nexport function getPropertyDescriptor(obj, prop) {\n var pd = getOwnPropertyDescriptor(obj, prop),\n proto;\n return pd || (proto = getProto(obj)) && getPropertyDescriptor (proto, prop);\n}\n\nvar _slice = [].slice;\nexport function slice(args, start, end) {\n return _slice.call(args, start, end);\n}\n\nexport function override(origFunc, overridedFactory) {\n return overridedFactory(origFunc);\n}\n\nexport function assert (b) {\n if (!b) throw new Error(\"Assertion Failed\");\n}\n\nexport function asap(fn) {\n if (_global.setImmediate) setImmediate(fn); else setTimeout(fn, 0);\n}\n\nexport function getUniqueArray(a) {\n return a.filter((value, index, self) => self.indexOf(value) === index);\n}\n\n/** Generate an object (hash map) based on given array.\n * @param extractor Function taking an array item and its index and returning an array of 2 items ([key, value]) to\n * instert on the resulting object for each item in the array. If this function returns a falsy value, the\n * current item wont affect the resulting object.\n */\nexport function arrayToObject (array, extractor) {\n return array.reduce((result, item, i) => {\n var nameAndValue = extractor(item, i);\n if (nameAndValue) result[nameAndValue[0]] = nameAndValue[1];\n return result;\n }, {});\n}\n\nexport function trycatcher(fn, reject) {\n return function () {\n try {\n fn.apply(this, arguments);\n } catch (e) {\n reject(e);\n }\n };\n}\n\nexport function tryCatch(fn, onerror, args) {\n try {\n fn.apply(null, args);\n } catch (ex) {\n onerror && onerror(ex);\n }\n}\n\nexport function getByKeyPath(obj, keyPath) {\n // http://www.w3.org/TR/IndexedDB/#steps-for-extracting-a-key-from-a-value-using-a-key-path\n if (hasOwn(obj, keyPath)) return obj[keyPath]; // This line is moved from last to first for optimization purpose.\n if (!keyPath) return obj;\n if (typeof keyPath !== 'string') {\n var rv = [];\n for (var i = 0, l = keyPath.length; i < l; ++i) {\n var val = getByKeyPath(obj, keyPath[i]);\n rv.push(val);\n }\n return rv;\n }\n var period = keyPath.indexOf('.');\n if (period !== -1) {\n var innerObj = obj[keyPath.substr(0, period)];\n return innerObj === undefined ? undefined : getByKeyPath(innerObj, keyPath.substr(period + 1));\n }\n return undefined;\n}\n\nexport function setByKeyPath(obj, keyPath, value) {\n if (!obj || keyPath === undefined) return;\n if ('isFrozen' in Object && Object.isFrozen(obj)) return;\n if (typeof keyPath !== 'string' && 'length' in keyPath) {\n assert(typeof value !== 'string' && 'length' in value);\n for (var i = 0, l = keyPath.length; i < l; ++i) {\n setByKeyPath(obj, keyPath[i], value[i]);\n }\n } else {\n var period = keyPath.indexOf('.');\n if (period !== -1) {\n var currentKeyPath = keyPath.substr(0, period);\n var remainingKeyPath = keyPath.substr(period + 1);\n if (remainingKeyPath === \"\")\n if (value === undefined) delete obj[currentKeyPath]; else obj[currentKeyPath] = value;\n else {\n var innerObj = obj[currentKeyPath];\n if (!innerObj) innerObj = (obj[currentKeyPath] = {});\n setByKeyPath(innerObj, remainingKeyPath, value);\n }\n } else {\n if (value === undefined) delete obj[keyPath]; else obj[keyPath] = value;\n }\n }\n}\n\nexport function delByKeyPath(obj, keyPath) {\n if (typeof keyPath === 'string')\n setByKeyPath(obj, keyPath, undefined);\n else if ('length' in keyPath)\n [].map.call(keyPath, function(kp) {\n setByKeyPath(obj, kp, undefined);\n });\n}\n\nexport function shallowClone(obj) {\n var rv = {};\n for (var m in obj) {\n if (hasOwn(obj, m)) rv[m] = obj[m];\n }\n return rv;\n}\n\nconst concat = [].concat;\nexport function flatten (a) {\n return concat.apply([], a);\n}\n\n//https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Structured_clone_algorithm\nvar intrinsicTypes =\n \"Boolean,String,Date,RegExp,Blob,File,FileList,ArrayBuffer,DataView,Uint8ClampedArray,ImageData,Map,Set\"\n .split(',').concat(\n flatten([8,16,32,64].map(num=>[\"Int\",\"Uint\",\"Float\"].map(t=>t+num+\"Array\")))\n ).filter(t=>_global[t]).map(t=>_global[t])\n\nexport function deepClone(any) {\n if (!any || typeof any !== 'object') return any;\n var rv;\n if (isArray(any)) {\n rv = [];\n for (var i = 0, l = any.length; i < l; ++i) {\n rv.push(deepClone(any[i]));\n }\n } else if (intrinsicTypes.indexOf(any.constructor) >= 0) {\n rv = any;\n } else {\n rv = any.constructor ? Object.create(any.constructor.prototype) : {};\n for (var prop in any) {\n if (hasOwn(any, prop)) {\n rv[prop] = deepClone(any[prop]);\n }\n }\n }\n return rv;\n}\n\nexport function getObjectDiff(a, b, rv, prfx) {\n // Compares objects a and b and produces a diff object.\n rv = rv || {};\n prfx = prfx || '';\n keys(a).forEach(prop => {\n if (!hasOwn(b, prop))\n rv[prfx+prop] = undefined; // Property removed\n else {\n var ap = a[prop],\n bp = b[prop];\n if (typeof ap === 'object' && typeof bp === 'object' &&\n ap && bp &&\n // Now compare constructors are same (not equal because wont work in Safari)\n (''+ap.constructor) === (''+bp.constructor))\n // Same type of object but its properties may have changed\n getObjectDiff (ap, bp, rv, prfx + prop + \".\");\n else if (ap !== bp)\n rv[prfx + prop] = b[prop];// Primitive value changed\n }\n });\n keys(b).forEach(prop => {\n if (!hasOwn(a, prop)) {\n rv[prfx+prop] = b[prop]; // Property added\n }\n });\n return rv;\n}\n\n// If first argument is iterable or array-like, return it as an array\nexport const iteratorSymbol = typeof Symbol !== 'undefined' && Symbol.iterator;\nexport const getIteratorOf = iteratorSymbol ? function(x) {\n var i;\n return x != null && (i = x[iteratorSymbol]) && i.apply(x);\n} : function () { return null; };\n\nexport const NO_CHAR_ARRAY = {};\n// Takes one or several arguments and returns an array based on the following criteras:\n// * If several arguments provided, return arguments converted to an array in a way that\n// still allows javascript engine to optimize the code.\n// * If single argument is an array, return a clone of it.\n// * If this-pointer equals NO_CHAR_ARRAY, don't accept strings as valid iterables as a special\n// case to the two bullets below.\n// * If single argument is an iterable, convert it to an array and return the resulting array.\n// * If single argument is array-like (has length of type number), convert it to an array.\nexport function getArrayOf (arrayLike) {\n var i, a, x, it;\n if (arguments.length === 1) {\n if (isArray(arrayLike)) return arrayLike.slice();\n if (this === NO_CHAR_ARRAY && typeof arrayLike === 'string') return [arrayLike];\n if ((it = getIteratorOf(arrayLike))) {\n a = [];\n while ((x = it.next()), !x.done) a.push(x.value);\n return a;\n }\n if (arrayLike == null) return [arrayLike];\n i = arrayLike.length;\n if (typeof i === 'number') {\n a = new Array(i);\n while (i--) a[i] = arrayLike[i];\n return a;\n }\n return [arrayLike];\n }\n i = arguments.length;\n a = new Array(i);\n while (i--) a[i] = arguments[i];\n return a;\n}\n","// By default, debug will be true only if platform is a web platform and its page is served from localhost.\n// When debug = true, error's stacks will contain asyncronic long stacks.\nexport var debug = typeof location !== 'undefined' &&\n // By default, use debug mode if served from localhost.\n /^(http|https):\\/\\/(localhost|127\\.0\\.0\\.1)/.test(location.href);\n\nexport function setDebug(value, filter) {\n debug = value;\n libraryFilter = filter;\n}\n\nexport var libraryFilter = () => true;\n\nexport const NEEDS_THROW_FOR_STACK = !new Error(\"\").stack;\n\nexport function getErrorWithStack() {\n \"use strict\";\n if (NEEDS_THROW_FOR_STACK) try {\n // Doing something naughty in strict mode here to trigger a specific error\n // that can be explicitely ignored in debugger's exception settings.\n // If we'd just throw new Error() here, IE's debugger's exception settings\n // will just consider it as \"exception thrown by javascript code\" which is\n // something you wouldn't want it to ignore.\n getErrorWithStack.arguments;\n throw new Error(); // Fallback if above line don't throw.\n } catch(e) {\n return e;\n }\n return new Error();\n}\n\nexport function prettyStack(exception, numIgnoredFrames) {\n var stack = exception.stack;\n if (!stack) return \"\";\n numIgnoredFrames = (numIgnoredFrames || 0);\n if (stack.indexOf(exception.name) === 0)\n numIgnoredFrames += (exception.name + exception.message).split('\\n').length;\n return stack.split('\\n')\n .slice(numIgnoredFrames)\n .filter(libraryFilter)\n .map(frame => \"\\n\" + frame)\n .join('');\n}\n\nexport function deprecated (what, fn) {\n return function () {\n console.warn(`${what} is deprecated. See https://github.com/dfahlander/Dexie.js/wiki/Deprecations. ${prettyStack(getErrorWithStack(), 1)}`);\n return fn.apply(this, arguments);\n }\n}\n","import { derive, setProp } from './utils';\nimport { getErrorWithStack, prettyStack } from './debug';\n\nvar dexieErrorNames = [\n 'Modify',\n 'Bulk',\n 'OpenFailed',\n 'VersionChange',\n 'Schema',\n 'Upgrade',\n 'InvalidTable',\n 'MissingAPI',\n 'NoSuchDatabase',\n 'InvalidArgument',\n 'SubTransaction',\n 'Unsupported',\n 'Internal',\n 'DatabaseClosed',\n 'PrematureCommit',\n 'ForeignAwait'\n];\n\nvar idbDomErrorNames = [\n 'Unknown',\n 'Constraint',\n 'Data',\n 'TransactionInactive',\n 'ReadOnly',\n 'Version',\n 'NotFound',\n 'InvalidState',\n 'InvalidAccess',\n 'Abort',\n 'Timeout',\n 'QuotaExceeded',\n 'Syntax',\n 'DataClone'\n];\n\nvar errorList = dexieErrorNames.concat(idbDomErrorNames);\n\nvar defaultTexts = {\n VersionChanged: \"Database version changed by other database connection\",\n DatabaseClosed: \"Database has been closed\",\n Abort: \"Transaction aborted\",\n TransactionInactive: \"Transaction has already completed or failed\"\n};\n\n//\n// DexieError - base class of all out exceptions.\n//\nexport function DexieError (name, msg) {\n // Reason we don't use ES6 classes is because:\n // 1. It bloats transpiled code and increases size of minified code.\n // 2. It doesn't give us much in this case.\n // 3. It would require sub classes to call super(), which\n // is not needed when deriving from Error.\n this._e = getErrorWithStack();\n this.name = name;\n this.message = msg;\n}\n\nderive(DexieError).from(Error).extend({\n stack: {\n get: function() {\n return this._stack ||\n (this._stack = this.name + \": \" + this.message + prettyStack(this._e, 2));\n }\n },\n toString: function(){ return this.name + \": \" + this.message; }\n});\n\nfunction getMultiErrorMessage (msg, failures) {\n return msg + \". Errors: \" + failures\n .map(f=>f.toString())\n .filter((v,i,s)=>s.indexOf(v) === i) // Only unique error strings\n .join('\\n');\n}\n\n//\n// ModifyError - thrown in Collection.modify()\n// Specific constructor because it contains members failures and failedKeys.\n//\nexport function ModifyError (msg, failures, successCount, failedKeys) {\n this._e = getErrorWithStack();\n this.failures = failures;\n this.failedKeys = failedKeys;\n this.successCount = successCount;\n}\nderive(ModifyError).from(DexieError);\n\nexport function BulkError (msg, failures) {\n this._e = getErrorWithStack();\n this.name = \"BulkError\";\n this.failures = failures;\n this.message = getMultiErrorMessage(msg, failures);\n}\nderive(BulkError).from(DexieError);\n\n//\n//\n// Dynamically generate error names and exception classes based\n// on the names in errorList.\n//\n//\n\n// Map of {ErrorName -> ErrorName + \"Error\"}\nexport var errnames = errorList.reduce((obj,name)=>(obj[name]=name+\"Error\",obj),{});\n\n// Need an alias for DexieError because we're gonna create subclasses with the same name.\nconst BaseException = DexieError;\n// Map of {ErrorName -> exception constructor}\nexport var exceptions = errorList.reduce((obj,name)=>{\n // Let the name be \"DexieError\" because this name may\n // be shown in call stack and when debugging. DexieError is\n // the most true name because it derives from DexieError,\n // and we cannot change Function.name programatically without\n // dynamically create a Function object, which would be considered\n // 'eval-evil'.\n var fullName = name + \"Error\";\n function DexieError (msgOrInner, inner){\n this._e = getErrorWithStack();\n this.name = fullName;\n if (!msgOrInner) {\n this.message = defaultTexts[name] || fullName;\n this.inner = null;\n } else if (typeof msgOrInner === 'string') {\n this.message = msgOrInner;\n this.inner = inner || null;\n } else if (typeof msgOrInner === 'object') {\n this.message = `${msgOrInner.name} ${msgOrInner.message}`;\n this.inner = msgOrInner;\n }\n }\n derive(DexieError).from(BaseException);\n obj[name]=DexieError;\n return obj;\n},{});\n\n// Use ECMASCRIPT standard exceptions where applicable:\nexceptions.Syntax = SyntaxError;\nexceptions.Type = TypeError;\nexceptions.Range = RangeError;\n\nexport var exceptionMap = idbDomErrorNames.reduce((obj, name)=>{\n obj[name + \"Error\"] = exceptions[name];\n return obj;\n}, {});\n\nexport function mapError (domError, message) {\n if (!domError || domError instanceof DexieError || domError instanceof TypeError || domError instanceof SyntaxError || !domError.name || !exceptionMap[domError.name])\n return domError;\n var rv = new exceptionMap[domError.name](message || domError.message, domError);\n if (\"stack\" in domError) {\n // Derive stack from inner exception if it has a stack\n setProp(rv, \"stack\", {get: function(){\n return this.inner.stack;\n }});\n }\n return rv;\n}\n\nexport var fullNameExceptions = errorList.reduce((obj, name)=>{\n if ([\"Syntax\",\"Type\",\"Range\"].indexOf(name) === -1)\n obj[name + \"Error\"] = exceptions[name];\n return obj;\n}, {});\n\nfullNameExceptions.ModifyError = ModifyError;\nfullNameExceptions.DexieError = DexieError;\nfullNameExceptions.BulkError = BulkError;\n","import {extend} from './utils';\n\nexport function nop() { }\nexport function mirror(val) { return val; }\nexport function pureFunctionChain(f1, f2) {\n // Enables chained events that takes ONE argument and returns it to the next function in chain.\n // This pattern is used in the hook(\"reading\") event.\n if (f1 == null || f1 === mirror) return f2;\n return function (val) {\n return f2(f1(val));\n };\n}\n\nexport function callBoth(on1, on2) {\n return function () {\n on1.apply(this, arguments);\n on2.apply(this, arguments);\n };\n}\n\nexport function hookCreatingChain(f1, f2) {\n // Enables chained events that takes several arguments and may modify first argument by making a modification and then returning the same instance.\n // This pattern is used in the hook(\"creating\") event.\n if (f1 === nop) return f2;\n return function () {\n var res = f1.apply(this, arguments);\n if (res !== undefined) arguments[0] = res;\n var onsuccess = this.onsuccess, // In case event listener has set this.onsuccess\n onerror = this.onerror; // In case event listener has set this.onerror\n this.onsuccess = null;\n this.onerror = null;\n var res2 = f2.apply(this, arguments);\n if (onsuccess) this.onsuccess = this.onsuccess ? callBoth(onsuccess, this.onsuccess) : onsuccess;\n if (onerror) this.onerror = this.onerror ? callBoth(onerror, this.onerror) : onerror;\n return res2 !== undefined ? res2 : res;\n };\n}\n\nexport function hookDeletingChain(f1, f2) {\n if (f1 === nop) return f2;\n return function () {\n f1.apply(this, arguments);\n var onsuccess = this.onsuccess, // In case event listener has set this.onsuccess\n onerror = this.onerror; // In case event listener has set this.onerror\n this.onsuccess = this.onerror = null;\n f2.apply(this, arguments);\n if (onsuccess) this.onsuccess = this.onsuccess ? callBoth(onsuccess, this.onsuccess) : onsuccess;\n if (onerror) this.onerror = this.onerror ? callBoth(onerror, this.onerror) : onerror;\n };\n}\n\nexport function hookUpdatingChain(f1, f2) {\n if (f1 === nop) return f2;\n return function (modifications) {\n var res = f1.apply(this, arguments);\n extend(modifications, res); // If f1 returns new modifications, extend caller's modifications with the result before calling next in chain.\n var onsuccess = this.onsuccess, // In case event listener has set this.onsuccess\n onerror = this.onerror; // In case event listener has set this.onerror\n this.onsuccess = null;\n this.onerror = null;\n var res2 = f2.apply(this, arguments);\n if (onsuccess) this.onsuccess = this.onsuccess ? callBoth(onsuccess, this.onsuccess) : onsuccess;\n if (onerror) this.onerror = this.onerror ? callBoth(onerror, this.onerror) : onerror;\n return res === undefined ?\n (res2 === undefined ? undefined : res2) :\n (extend(res, res2));\n };\n}\n\nexport function reverseStoppableEventChain(f1, f2) {\n if (f1 === nop) return f2;\n return function () {\n if (f2.apply(this, arguments) === false) return false;\n return f1.apply(this, arguments);\n };\n}\n\nexport function nonStoppableEventChain(f1, f2) {\n if (f1 === nop) return f2;\n return function () {\n f1.apply(this, arguments);\n f2.apply(this, arguments);\n };\n}\n\nexport function promisableChain(f1, f2) {\n if (f1 === nop) return f2;\n return function () {\n var res = f1.apply(this, arguments);\n if (res && typeof res.then === 'function') {\n var thiz = this,\n i = arguments.length,\n args = new Array(i);\n while (i--) args[i] = arguments[i];\n return res.then(function () {\n return f2.apply(thiz, args);\n });\n }\n return f2.apply(this, arguments);\n };\n}\n","/*\n * Copyright (c) 2014-2017 David Fahlander\n * Apache License Version 2.0, January 2004, http://www.apache.org/licenses/LICENSE-2.0\n */\nimport {tryCatch, props, setProp, _global,\n getPropertyDescriptor, getArrayOf, extend} from './utils';\nimport {nop, callBoth, mirror} from './chaining-functions';\nimport {debug, prettyStack, getErrorWithStack} from './debug';\nimport {exceptions} from './errors';\n\n//\n// Promise and Zone (PSD) for Dexie library\n//\n// I started out writing this Promise class by copying promise-light (https://github.com/taylorhakes/promise-light) by\n// https://github.com/taylorhakes - an A+ and ECMASCRIPT 6 compliant Promise implementation.\n//\n// In previous versions this was fixed by not calling setTimeout when knowing that the resolve() or reject() came from another\n// tick. In Dexie v1.4.0, I've rewritten the Promise class entirely. Just some fragments of promise-light is left. I use\n// another strategy now that simplifies everything a lot: to always execute callbacks in a new micro-task, but have an own micro-task\n// engine that is indexedDB compliant across all browsers.\n// Promise class has also been optimized a lot with inspiration from bluebird - to avoid closures as much as possible.\n// Also with inspiration from bluebird, asyncronic stacks in debug mode.\n//\n// Specific non-standard features of this Promise class:\n// * Custom zone support (a.k.a. PSD) with ability to keep zones also when using native promises as well as\n// native async / await.\n// * Promise.follow() method built upon the custom zone engine, that allows user to track all promises created from current stack frame\n// and below + all promises that those promises creates or awaits.\n// * Detect any unhandled promise in a PSD-scope (PSD.onunhandled). \n//\n// David Fahlander, https://github.com/dfahlander\n//\n\n// Just a pointer that only this module knows about.\n// Used in Promise constructor to emulate a private constructor.\nvar INTERNAL = {};\n\n// Async stacks (long stacks) must not grow infinitely.\nconst\n LONG_STACKS_CLIP_LIMIT = 100,\n // When calling error.stack or promise.stack, limit the number of asyncronic stacks to print out. \n MAX_LONG_STACKS = 20,\n ZONE_ECHO_LIMIT = 7,\n nativePromiseInstanceAndProto = (()=>{\n try {\n // Be able to patch native async functions\n return new Function(`let F=async ()=>{},p=F();return [p,Object.getPrototypeOf(p),Promise.resolve(),F.constructor];`)();\n } catch(e) {\n var P = _global.Promise;\n return P ?\n [P.resolve(), P.prototype, P.resolve()] :\n []; \n }\n })(),\n resolvedNativePromise = nativePromiseInstanceAndProto[0],\n nativePromiseProto = nativePromiseInstanceAndProto[1],\n resolvedGlobalPromise = nativePromiseInstanceAndProto[2],\n nativePromiseThen = nativePromiseProto && nativePromiseProto.then;\n\nexport const NativePromise = resolvedNativePromise && resolvedNativePromise.constructor;\nexport const AsyncFunction = nativePromiseInstanceAndProto[3];\nconst patchGlobalPromise = !!resolvedGlobalPromise;\n\nvar stack_being_generated = false;\n\n/* The default function used only for the very first promise in a promise chain.\n As soon as then promise is resolved or rejected, all next tasks will be executed in micro ticks\n emulated in this module. For indexedDB compatibility, this means that every method needs to \n execute at least one promise before doing an indexedDB operation. Dexie will always call \n db.ready().then() for every operation to make sure the indexedDB event is started in an\n indexedDB-compatible emulated micro task loop.\n*/\nvar schedulePhysicalTick = resolvedGlobalPromise ?\n () => {resolvedGlobalPromise.then(physicalTick);}\n :\n _global.setImmediate ? \n // setImmediate supported. Those modern platforms also supports Function.bind().\n setImmediate.bind(null, physicalTick) :\n _global.MutationObserver ?\n // MutationObserver supported\n () => {\n var hiddenDiv = document.createElement(\"div\");\n (new MutationObserver(() => {\n physicalTick();\n hiddenDiv = null;\n })).observe(hiddenDiv, { attributes: true });\n hiddenDiv.setAttribute('i', '1');\n } :\n // No support for setImmediate or MutationObserver. No worry, setTimeout is only called\n // once time. Every tick that follows will be our emulated micro tick.\n // Could have uses setTimeout.bind(null, 0, physicalTick) if it wasnt for that FF13 and below has a bug \n ()=>{setTimeout(physicalTick,0);};\n\n// Configurable through Promise.scheduler.\n// Don't export because it would be unsafe to let unknown\n// code call it unless they do try..catch within their callback.\n// This function can be retrieved through getter of Promise.scheduler though,\n// but users must not do Promise.scheduler = myFuncThatThrowsException\nvar asap = function (callback, args) {\n microtickQueue.push([callback, args]);\n if (needsNewPhysicalTick) {\n schedulePhysicalTick();\n needsNewPhysicalTick = false;\n }\n};\n\nvar isOutsideMicroTick = true, // True when NOT in a virtual microTick.\n needsNewPhysicalTick = true, // True when a push to microtickQueue must also schedulePhysicalTick()\n unhandledErrors = [], // Rejected promises that has occured. Used for triggering 'unhandledrejection'.\n rejectingErrors = [], // Tracks if errors are being re-rejected during onRejected callback.\n currentFulfiller = null,\n rejectionMapper = mirror; // Remove in next major when removing error mapping of DOMErrors and DOMExceptions\n \nexport var globalPSD = {\n id: 'global',\n global: true,\n ref: 0,\n unhandleds: [],\n onunhandled: globalError,\n pgp: false,\n env: {},\n finalize: function () {\n this.unhandleds.forEach(uh => {\n try {\n globalError(uh[0], uh[1]);\n } catch (e) {}\n });\n }\n};\n\nexport var PSD = globalPSD;\n\nexport var microtickQueue = []; // Callbacks to call in this or next physical tick.\nexport var numScheduledCalls = 0; // Number of listener-calls left to do in this physical tick.\nexport var tickFinalizers = []; // Finalizers to call when there are no more async calls scheduled within current physical tick.\n\nexport default function Promise(fn) {\n if (typeof this !== 'object') throw new TypeError('Promises must be constructed via new'); \n this._listeners = [];\n this.onuncatched = nop; // Deprecate in next major. Not needed. Better to use global error handler.\n \n // A library may set `promise._lib = true;` after promise is created to make resolve() or reject()\n // execute the microtask engine implicitely within the call to resolve() or reject().\n // To remain A+ compliant, a library must only set `_lib=true` if it can guarantee that the stack\n // only contains library code when calling resolve() or reject().\n // RULE OF THUMB: ONLY set _lib = true for promises explicitely resolving/rejecting directly from\n // global scope (event handler, timer etc)!\n this._lib = false;\n // Current async scope\n var psd = (this._PSD = PSD);\n\n if (debug) {\n this._stackHolder = getErrorWithStack();\n this._prev = null;\n this._numPrev = 0; // Number of previous promises (for long stacks)\n }\n \n if (typeof fn !== 'function') {\n if (fn !== INTERNAL) throw new TypeError('Not a function');\n // Private constructor (INTERNAL, state, value).\n // Used internally by Promise.resolve() and Promise.reject().\n this._state = arguments[1];\n this._value = arguments[2];\n if (this._state === false)\n handleRejection(this, this._value); // Map error, set stack and addPossiblyUnhandledError().\n return;\n }\n \n this._state = null; // null (=pending), false (=rejected) or true (=resolved)\n this._value = null; // error or result\n ++psd.ref; // Refcounting current scope\n executePromiseTask(this, fn);\n}\n\n// Prepare a property descriptor to put onto Promise.prototype.then\nconst thenProp = {\n get: function() {\n var psd = PSD, microTaskId = totalEchoes;\n\n function then (onFulfilled, onRejected) {\n var possibleAwait = !psd.global && (psd !== PSD || microTaskId !== totalEchoes);\n if (possibleAwait) decrementExpectedAwaits();\n var rv = new Promise((resolve, reject) => {\n propagateToListener(this, new Listener(\n nativeAwaitCompatibleWrap(onFulfilled, psd, possibleAwait),\n nativeAwaitCompatibleWrap(onRejected, psd, possibleAwait),\n resolve,\n reject,\n psd));\n });\n debug && linkToPreviousPromise(rv, this);\n return rv;\n }\n\n then.prototype = INTERNAL; // For idempotense, see setter below.\n\n return then;\n },\n // Be idempotent and allow another framework (such as zone.js or another instance of a Dexie.Promise module) to replace Promise.prototype.then\n // and when that framework wants to restore the original property, we must identify that and restore the original property descriptor.\n set: function (value) {\n setProp (this, 'then', value && value.prototype === INTERNAL ?\n thenProp : // Restore to original property descriptor.\n {\n get: function(){\n return value; // Getter returning provided value (behaves like value is just changed)\n },\n set: thenProp.set // Keep a setter that is prepared to restore original.\n }\n );\n }\n};\n\nprops(Promise.prototype, {\n then: thenProp, // Defined above.\n _then: function (onFulfilled, onRejected) {\n // A little tinier version of then() that don't have to create a resulting promise.\n propagateToListener(this, new Listener(null, null, onFulfilled, onRejected, PSD)); \n },\n\n catch: function (onRejected) {\n if (arguments.length === 1) return this.then(null, onRejected);\n // First argument is the Error type to catch\n var type = arguments[0],\n handler = arguments[1];\n return typeof type === 'function' ? this.then(null, err =>\n // Catching errors by its constructor type (similar to java / c++ / c#)\n // Sample: promise.catch(TypeError, function (e) { ... });\n err instanceof type ? handler(err) : PromiseReject(err))\n : this.then(null, err =>\n // Catching errors by the error.name property. Makes sense for indexedDB where error type\n // is always DOMError but where e.name tells the actual error type.\n // Sample: promise.catch('ConstraintError', function (e) { ... });\n err && err.name === type ? handler(err) : PromiseReject(err));\n },\n\n finally: function (onFinally) {\n return this.then(value => {\n onFinally();\n return value;\n }, err => {\n onFinally();\n return PromiseReject(err);\n });\n },\n \n stack: {\n get: function() {\n if (this._stack) return this._stack;\n try {\n stack_being_generated = true;\n var stacks = getStack (this, [], MAX_LONG_STACKS);\n var stack = stacks.join(\"\\nFrom previous: \");\n if (this._state !== null) this._stack = stack; // Stack may be updated on reject.\n return stack;\n } finally {\n stack_being_generated = false;\n }\n }\n },\n\n timeout: function (ms, msg) {\n return ms < Infinity ?\n new Promise((resolve, reject) => {\n var handle = setTimeout(() => reject(new exceptions.Timeout(msg)), ms);\n this.then(resolve, reject).finally(clearTimeout.bind(null, handle));\n }) : this;\n }\n});\n\nif (typeof Symbol !== 'undefined' && Symbol.toStringTag)\n setProp(Promise.prototype, Symbol.toStringTag, 'Promise');\n\n// Now that Promise.prototype is defined, we have all it takes to set globalPSD.env.\n// Environment globals snapshotted on leaving global zone\nglobalPSD.env = snapShot();\n\nfunction Listener(onFulfilled, onRejected, resolve, reject, zone) {\n this.onFulfilled = typeof onFulfilled === 'function' ? onFulfilled : null;\n this.onRejected = typeof onRejected === 'function' ? onRejected : null;\n this.resolve = resolve;\n this.reject = reject;\n this.psd = zone;\n}\n\n// Promise Static Properties\nprops (Promise, {\n all: function () {\n var values = getArrayOf.apply(null, arguments) // Supports iterables, implicit arguments and array-like.\n .map(onPossibleParallellAsync); // Handle parallell async/awaits \n return new Promise(function (resolve, reject) {\n if (values.length === 0) resolve([]);\n var remaining = values.length;\n values.forEach((a,i) => Promise.resolve(a).then(x => {\n values[i] = x;\n if (!--remaining) resolve(values);\n }, reject));\n });\n },\n \n resolve: value => {\n if (value instanceof Promise) return value;\n if (value && typeof value.then === 'function') return new Promise((resolve, reject)=>{\n value.then(resolve, reject);\n });\n var rv = new Promise(INTERNAL, true, value);\n linkToPreviousPromise(rv, currentFulfiller);\n return rv;\n },\n \n reject: PromiseReject,\n \n race: function () {\n var values = getArrayOf.apply(null, arguments).map(onPossibleParallellAsync);\n return new Promise((resolve, reject) => {\n values.map(value => Promise.resolve(value).then(resolve, reject));\n });\n },\n\n PSD: {\n get: ()=>PSD,\n set: value => PSD = value\n },\n\n //totalEchoes: {get: ()=>totalEchoes},\n\n //task: {get: ()=>task},\n \n newPSD: newScope,\n \n usePSD: usePSD,\n \n scheduler: {\n get: () => asap,\n set: value => {asap = value}\n },\n \n rejectionMapper: {\n get: () => rejectionMapper,\n set: value => {rejectionMapper = value;} // Map reject failures\n },\n \n follow: (fn, zoneProps) => {\n return new Promise((resolve, reject) => {\n return newScope((resolve, reject) => {\n var psd = PSD;\n psd.unhandleds = []; // For unhandled standard- or 3rd party Promises. Checked at psd.finalize()\n psd.onunhandled = reject; // Triggered directly on unhandled promises of this library.\n psd.finalize = callBoth(function () {\n // Unhandled standard or 3rd part promises are put in PSD.unhandleds and\n // examined upon scope completion while unhandled rejections in this Promise\n // will trigger directly through psd.onunhandled\n run_at_end_of_this_or_next_physical_tick(()=>{\n this.unhandleds.length === 0 ? resolve() : reject(this.unhandleds[0]);\n });\n }, psd.finalize);\n fn();\n }, zoneProps, resolve, reject);\n });\n }\n});\n\n/**\n* Take a potentially misbehaving resolver function and make sure\n* onFulfilled and onRejected are only called once.\n*\n* Makes no guarantees about asynchrony.\n*/\nfunction executePromiseTask (promise, fn) {\n // Promise Resolution Procedure:\n // https://github.com/promises-aplus/promises-spec#the-promise-resolution-procedure\n try {\n fn(value => {\n if (promise._state !== null) return; // Already settled\n if (value === promise) throw new TypeError('A promise cannot be resolved with itself.');\n var shouldExecuteTick = promise._lib && beginMicroTickScope();\n if (value && typeof value.then === 'function') {\n executePromiseTask(promise, (resolve, reject) => {\n value instanceof Promise ?\n value._then(resolve, reject) :\n value.then(resolve, reject);\n });\n } else {\n promise._state = true;\n promise._value = value;\n propagateAllListeners(promise);\n }\n if (shouldExecuteTick) endMicroTickScope();\n }, handleRejection.bind(null, promise)); // If Function.bind is not supported. Exception is handled in catch below\n } catch (ex) {\n handleRejection(promise, ex);\n }\n}\n\nfunction handleRejection (promise, reason) {\n rejectingErrors.push(reason);\n if (promise._state !== null) return;\n var shouldExecuteTick = promise._lib && beginMicroTickScope();\n reason = rejectionMapper(reason);\n promise._state = false;\n promise._value = reason;\n debug && reason !== null && typeof reason === 'object' && !reason._promise && tryCatch(()=>{\n var origProp = getPropertyDescriptor(reason, \"stack\"); \n reason._promise = promise; \n setProp(reason, \"stack\", {\n get: () =>\n stack_being_generated ?\n origProp && (origProp.get ?\n origProp.get.apply(reason) :\n origProp.value) :\n promise.stack\n });\n });\n // Add the failure to a list of possibly uncaught errors\n addPossiblyUnhandledError(promise);\n propagateAllListeners(promise);\n if (shouldExecuteTick) endMicroTickScope();\n}\n\nfunction propagateAllListeners (promise) {\n //debug && linkToPreviousPromise(promise);\n var listeners = promise._listeners;\n promise._listeners = [];\n for (var i = 0, len = listeners.length; i < len; ++i) {\n propagateToListener(promise, listeners[i]);\n }\n var psd = promise._PSD;\n --psd.ref || psd.finalize(); // if psd.ref reaches zero, call psd.finalize();\n if (numScheduledCalls === 0) {\n // If numScheduledCalls is 0, it means that our stack is not in a callback of a scheduled call,\n // and that no deferreds where listening to this rejection or success.\n // Since there is a risk that our stack can contain application code that may\n // do stuff after this code is finished that may generate new calls, we cannot\n // call finalizers here.\n ++numScheduledCalls;\n asap(()=>{\n if (--numScheduledCalls === 0) finalizePhysicalTick(); // Will detect unhandled errors\n }, []);\n }\n}\n\nfunction propagateToListener(promise, listener) {\n if (promise._state === null) {\n promise._listeners.push(listener);\n return;\n }\n\n var cb = promise._state ? listener.onFulfilled : listener.onRejected;\n if (cb === null) {\n // This Listener doesnt have a listener for the event being triggered (onFulfilled or onReject) so lets forward the event to any eventual listeners on the Promise instance returned by then() or catch()\n return (promise._state ? listener.resolve : listener.reject) (promise._value);\n }\n ++listener.psd.ref;\n ++numScheduledCalls;\n asap (callListener, [cb, promise, listener]);\n}\n\nfunction callListener (cb, promise, listener) {\n try {\n // Set static variable currentFulfiller to the promise that is being fullfilled,\n // so that we connect the chain of promises (for long stacks support)\n currentFulfiller = promise;\n \n // Call callback and resolve our listener with it's return value.\n var ret, value = promise._value;\n \n if (promise._state) {\n // cb is onResolved\n ret = cb (value);\n } else {\n // cb is onRejected\n if (rejectingErrors.length) rejectingErrors = [];\n ret = cb(value);\n if (rejectingErrors.indexOf(value) === -1)\n markErrorAsHandled(promise); // Callback didnt do Promise.reject(err) nor reject(err) onto another promise.\n }\n listener.resolve(ret);\n } catch (e) {\n // Exception thrown in callback. Reject our listener.\n listener.reject(e);\n } finally {\n // Restore env and currentFulfiller.\n currentFulfiller = null;\n if (--numScheduledCalls === 0) finalizePhysicalTick();\n --listener.psd.ref || listener.psd.finalize();\n }\n}\n\nfunction getStack (promise, stacks, limit) {\n if (stacks.length === limit) return stacks;\n var stack = \"\";\n if (promise._state === false) {\n var failure = promise._value,\n errorName,\n message;\n \n if (failure != null) {\n errorName = failure.name || \"Error\";\n message = failure.message || failure;\n stack = prettyStack(failure, 0);\n } else {\n errorName = failure; // If error is undefined or null, show that.\n message = \"\";\n }\n stacks.push(errorName + (message ? \": \" + message : \"\") + stack);\n }\n if (debug) {\n stack = prettyStack(promise._stackHolder, 2);\n if (stack && stacks.indexOf(stack) === -1) stacks.push(stack);\n if (promise._prev) getStack(promise._prev, stacks, limit);\n }\n return stacks;\n}\n\nfunction linkToPreviousPromise(promise, prev) {\n // Support long stacks by linking to previous completed promise.\n var numPrev = prev ? prev._numPrev + 1 : 0;\n if (numPrev < LONG_STACKS_CLIP_LIMIT) { // Prohibit infinite Promise loops to get an infinite long memory consuming \"tail\".\n promise._prev = prev;\n promise._numPrev = numPrev;\n }\n}\n\n/* The callback to schedule with setImmediate() or setTimeout().\n It runs a virtual microtick and executes any callback registered in microtickQueue.\n */\nfunction physicalTick() {\n beginMicroTickScope() && endMicroTickScope();\n}\n\nfunction beginMicroTickScope() {\n var wasRootExec = isOutsideMicroTick;\n isOutsideMicroTick = false;\n needsNewPhysicalTick = false;\n return wasRootExec;\n}\n\n/* Executes micro-ticks without doing try..catch.\n This can be possible because we only use this internally and\n the registered functions are exception-safe (they do try..catch\n internally before calling any external method). If registering\n functions in the microtickQueue that are not exception-safe, this\n would destroy the framework and make it instable. So we don't export\n our asap method.\n*/\nfunction endMicroTickScope() {\n var callbacks, i, l;\n do {\n while (microtickQueue.length > 0) {\n callbacks = microtickQueue;\n microtickQueue = [];\n l = callbacks.length;\n for (i = 0; i < l; ++i) {\n var item = callbacks[i];\n item[0].apply(null, item[1]);\n }\n }\n } while (microtickQueue.length > 0);\n isOutsideMicroTick = true;\n needsNewPhysicalTick = true;\n}\n\nfunction finalizePhysicalTick() {\n var unhandledErrs = unhandledErrors;\n unhandledErrors = [];\n unhandledErrs.forEach(p => {\n p._PSD.onunhandled.call(null, p._value, p);\n });\n var finalizers = tickFinalizers.slice(0); // Clone first because finalizer may remove itself from list.\n var i = finalizers.length;\n while (i) finalizers[--i](); \n}\n\nfunction run_at_end_of_this_or_next_physical_tick (fn) {\n function finalizer() {\n fn();\n tickFinalizers.splice(tickFinalizers.indexOf(finalizer), 1);\n }\n tickFinalizers.push(finalizer);\n ++numScheduledCalls;\n asap(()=>{\n if (--numScheduledCalls === 0) finalizePhysicalTick();\n }, []);\n}\n\nfunction addPossiblyUnhandledError(promise) {\n // Only add to unhandledErrors if not already there. The first one to add to this list\n // will be upon the first rejection so that the root cause (first promise in the\n // rejection chain) is the one listed.\n if (!unhandledErrors.some(p => p._value === promise._value))\n unhandledErrors.push(promise);\n}\n\nfunction markErrorAsHandled(promise) {\n // Called when a reject handled is actually being called.\n // Search in unhandledErrors for any promise whos _value is this promise_value (list\n // contains only rejected promises, and only one item per error)\n var i = unhandledErrors.length;\n while (i) if (unhandledErrors[--i]._value === promise._value) {\n // Found a promise that failed with this same error object pointer,\n // Remove that since there is a listener that actually takes care of it.\n unhandledErrors.splice(i, 1);\n return;\n }\n}\n\nfunction PromiseReject (reason) {\n return new Promise(INTERNAL, false, reason);\n}\n\nexport function wrap (fn, errorCatcher) {\n var psd = PSD;\n return function() {\n var wasRootExec = beginMicroTickScope(),\n outerScope = PSD;\n\n try {\n switchToZone(psd, true);\n return fn.apply(this, arguments);\n } catch (e) {\n errorCatcher && errorCatcher(e);\n } finally {\n switchToZone(outerScope, false);\n if (wasRootExec) endMicroTickScope();\n }\n };\n}\n\n\n//\n// variables used for native await support\n//\nconst task = { awaits: 0, echoes: 0, id: 0}; // The ongoing macro-task when using zone-echoing.\nvar taskCounter = 0; // ID counter for macro tasks.\nvar zoneStack = []; // Stack of left zones to restore asynchronically.\nvar zoneEchoes = 0; // zoneEchoes is a must in order to persist zones between native await expressions.\nvar totalEchoes = 0; // ID counter for micro-tasks. Used to detect possible native await in our Promise.prototype.then.\n\n\nvar zone_id_counter = 0;\nexport function newScope (fn, props, a1, a2) {\n var parent = PSD,\n psd = Object.create(parent);\n psd.parent = parent;\n psd.ref = 0;\n psd.global = false;\n psd.id = ++zone_id_counter;\n // Prepare for promise patching (done in usePSD):\n var globalEnv = globalPSD.env;\n psd.env = patchGlobalPromise ? {\n Promise: Promise, // Changing window.Promise could be omitted for Chrome and Edge, where IDB+Promise plays well!\n PromiseProp: {value: Promise, configurable: true, writable: true},\n all: Promise.all,\n race: Promise.race,\n resolve: Promise.resolve,\n reject: Promise.reject,\n nthen: getPatchedPromiseThen (globalEnv.nthen, psd), // native then\n gthen: getPatchedPromiseThen (globalEnv.gthen, psd) // global then\n } : {};\n if (props) extend(psd, props);\n \n // unhandleds and onunhandled should not be specifically set here.\n // Leave them on parent prototype.\n // unhandleds.push(err) will push to parent's prototype\n // onunhandled() will call parents onunhandled (with this scope's this-pointer though!)\n ++parent.ref;\n psd.finalize = function () {\n --this.parent.ref || this.parent.finalize();\n }\n var rv = usePSD (psd, fn, a1, a2);\n if (psd.ref === 0) psd.finalize();\n return rv;\n}\n\n// Function to call if scopeFunc returns NativePromise\n// Also for each NativePromise in the arguments to Promise.all()\nexport function incrementExpectedAwaits() {\n if (!task.id) task.id = ++taskCounter;\n ++task.awaits;\n task.echoes += ZONE_ECHO_LIMIT;\n return task.id;\n}\n// Function to call when 'then' calls back on a native promise where onAwaitExpected() had been called.\n// Also call this when a native await calls then method on a promise. In that case, don't supply\n// sourceTaskId because we already know it refers to current task.\nexport function decrementExpectedAwaits(sourceTaskId) {\n if (!task.awaits || (sourceTaskId && sourceTaskId !== task.id)) return;\n if (--task.awaits === 0) task.id = 0;\n task.echoes = task.awaits * ZONE_ECHO_LIMIT; // Will reset echoes to 0 if awaits is 0.\n}\n\n// Call from Promise.all() and Promise.race()\nexport function onPossibleParallellAsync (possiblePromise) {\n if (task.echoes && possiblePromise && possiblePromise.constructor === NativePromise) {\n incrementExpectedAwaits(); \n return possiblePromise.then(x => {\n decrementExpectedAwaits();\n return x;\n }, e => {\n decrementExpectedAwaits();\n return rejection(e);\n });\n }\n return possiblePromise;\n}\n\nfunction zoneEnterEcho(targetZone) {\n ++totalEchoes;\n if (!task.echoes || --task.echoes === 0) {\n task.echoes = task.id = 0; // Cancel zone echoing.\n }\n\n zoneStack.push(PSD);\n switchToZone(targetZone, true);\n}\n\nfunction zoneLeaveEcho() {\n var zone = zoneStack[zoneStack.length-1];\n zoneStack.pop();\n switchToZone(zone, false);\n}\n\nfunction switchToZone (targetZone, bEnteringZone) {\n var currentZone = PSD;\n if (bEnteringZone ? task.echoes && (!zoneEchoes++ || targetZone !== PSD) : zoneEchoes && (!--zoneEchoes || targetZone !== PSD)) {\n // Enter or leave zone asynchronically as well, so that tasks initiated during current tick\n // will be surrounded by the zone when they are invoked.\n enqueueNativeMicroTask(bEnteringZone ? zoneEnterEcho.bind(null, targetZone) : zoneLeaveEcho);\n }\n if (targetZone === PSD) return;\n\n PSD = targetZone; // The actual zone switch occurs at this line.\n\n // Snapshot on every leave from global zone.\n if (currentZone === globalPSD) globalPSD.env = snapShot();\n\n if (patchGlobalPromise) {\n // Let's patch the global and native Promises (may be same or may be different)\n var GlobalPromise = globalPSD.env.Promise;\n // Swich environments (may be PSD-zone or the global zone. Both apply.)\n var targetEnv = targetZone.env;\n\n // Change Promise.prototype.then for native and global Promise (they MAY differ on polyfilled environments, but both can be accessed)\n // Must be done on each zone change because the patched method contains targetZone in its closure.\n nativePromiseProto.then = targetEnv.nthen;\n GlobalPromise.prototype.then = targetEnv.gthen;\n\n if (currentZone.global || targetZone.global) {\n // Leaving or entering global zone. It's time to patch / restore global Promise.\n\n // Set this Promise to window.Promise so that transiled async functions will work on Firefox, Safari and IE, as well as with Zonejs and angular.\n Object.defineProperty(_global, 'Promise', targetEnv.PromiseProp);\n\n // Support Promise.all() etc to work indexedDB-safe also when people are including es6-promise as a module (they might\n // not be accessing global.Promise but a local reference to it)\n GlobalPromise.all = targetEnv.all;\n GlobalPromise.race = targetEnv.race;\n GlobalPromise.resolve = targetEnv.resolve;\n GlobalPromise.reject = targetEnv.reject;\n }\n }\n}\n\nfunction snapShot () {\n var GlobalPromise = _global.Promise;\n return patchGlobalPromise ? {\n Promise: GlobalPromise,\n PromiseProp: Object.getOwnPropertyDescriptor(_global, \"Promise\"),\n all: GlobalPromise.all,\n race: GlobalPromise.race,\n resolve: GlobalPromise.resolve,\n reject: GlobalPromise.reject,\n nthen: nativePromiseProto.then,\n gthen: GlobalPromise.prototype.then\n } : {};\n}\n\nexport function usePSD (psd, fn, a1, a2, a3) {\n var outerScope = PSD;\n try {\n switchToZone(psd, true);\n return fn(a1, a2, a3);\n } finally {\n switchToZone(outerScope, false);\n }\n}\n\nfunction enqueueNativeMicroTask (job) {\n //\n // Precondition: nativePromiseThen !== undefined\n //\n nativePromiseThen.call(resolvedNativePromise, job);\n}\n\nfunction nativeAwaitCompatibleWrap(fn, zone, possibleAwait) {\n return typeof fn !== 'function' ? fn : function () {\n var outerZone = PSD;\n if (possibleAwait) incrementExpectedAwaits();\n switchToZone(zone, true);\n try {\n return fn.apply(this, arguments);\n } finally {\n switchToZone(outerZone, false);\n }\n };\n}\n\nfunction getPatchedPromiseThen (origThen, zone) {\n return function (onResolved, onRejected) {\n return origThen.call(this,\n nativeAwaitCompatibleWrap(onResolved, zone, false),\n nativeAwaitCompatibleWrap(onRejected, zone, false));\n };\n}\n\nconst UNHANDLEDREJECTION = \"unhandledrejection\";\n\nfunction globalError(err, promise) {\n var rv;\n try {\n rv = promise.onuncatched(err);\n } catch (e) {}\n if (rv !== false) try {\n var event, eventData = {promise: promise, reason: err};\n if (_global.document && document.createEvent) {\n event = document.createEvent('Event');\n event.initEvent(UNHANDLEDREJECTION, true, true);\n extend(event, eventData);\n } else if (_global.CustomEvent) {\n event = new CustomEvent(UNHANDLEDREJECTION, {detail: eventData});\n extend(event, eventData);\n }\n if (event && _global.dispatchEvent) {\n dispatchEvent(event);\n if (!_global.PromiseRejectionEvent && _global.onunhandledrejection)\n // No native support for PromiseRejectionEvent but user has set window.onunhandledrejection. Manually call it.\n try {_global.onunhandledrejection(event);} catch (_) {}\n }\n if (!event.defaultPrevented) {\n console.warn(`Unhandled rejection: ${err.stack || err}`);\n }\n } catch (e) {}\n}\n\nexport var rejection = Promise.reject;\n","import {keys, isArray, asap} from './utils';\nimport {nop, mirror, reverseStoppableEventChain} from './chaining-functions';\nimport {exceptions} from './errors';\n\nexport default function Events(ctx) {\n var evs = {};\n var rv = function (eventName, subscriber) {\n if (subscriber) {\n // Subscribe. If additional arguments than just the subscriber was provided, forward them as well.\n var i = arguments.length, args = new Array(i - 1);\n while (--i) args[i - 1] = arguments[i];\n evs[eventName].subscribe.apply(null, args);\n return ctx;\n } else if (typeof (eventName) === 'string') {\n // Return interface allowing to fire or unsubscribe from event\n return evs[eventName];\n }\n };\n rv.addEventType = add;\n \n for (var i = 1, l = arguments.length; i < l; ++i) {\n add(arguments[i]);\n }\n \n return rv;\n\n function add(eventName, chainFunction, defaultFunction) {\n if (typeof eventName === 'object') return addConfiguredEvents(eventName);\n if (!chainFunction) chainFunction = reverseStoppableEventChain;\n if (!defaultFunction) defaultFunction = nop;\n\n var context = {\n subscribers: [],\n fire: defaultFunction,\n subscribe: function (cb) {\n if (context.subscribers.indexOf(cb) === -1) {\n context.subscribers.push(cb);\n context.fire = chainFunction(context.fire, cb);\n }\n },\n unsubscribe: function (cb) {\n context.subscribers = context.subscribers.filter(function (fn) { return fn !== cb; });\n context.fire = context.subscribers.reduce(chainFunction, defaultFunction);\n }\n };\n evs[eventName] = rv[eventName] = context;\n return context;\n }\n\n function addConfiguredEvents(cfg) {\n // events(this, {reading: [functionChain, nop]});\n keys(cfg).forEach(function (eventName) {\n var args = cfg[eventName];\n if (isArray(args)) {\n add(eventName, cfg[eventName][0], cfg[eventName][1]);\n } else if (args === 'asap') {\n // Rather than approaching event subscription using a functional approach, we here do it in a for-loop where subscriber is executed in its own stack\n // enabling that any exception that occur wont disturb the initiator and also not nescessary be catched and forgotten.\n var context = add(eventName, mirror, function fire() {\n // Optimazation-safe cloning of arguments into args.\n var i = arguments.length, args = new Array(i);\n while (i--) args[i] = arguments[i];\n // All each subscriber:\n context.subscribers.forEach(function (fn) {\n asap(function fireEvent() {\n fn.apply(null, args);\n });\n });\n });\n } else throw new exceptions.InvalidArgument(\"Invalid event config\");\n });\n }\n}\n","/*\n * Dexie.js - a minimalistic wrapper for IndexedDB\n * ===============================================\n *\n * Copyright (c) 2014-2017 David Fahlander\n *\n * Version {version}, {date}\n *\n * http://dexie.org\n * \n * Apache License Version 2.0, January 2004, http://www.apache.org/licenses/LICENSE-2.0\n * \n */\n\nimport {\n keys,\n setProp,\n isArray,\n extend,\n props,\n derive,\n slice,\n override,\n _global,\n asap,\n trycatcher,\n tryCatch,\n getByKeyPath,\n setByKeyPath,\n delByKeyPath,\n shallowClone,\n deepClone,\n getObjectDiff,\n assert,\n NO_CHAR_ARRAY,\n getArrayOf,\n arrayToObject,\n hasOwn,\n flatten\n} from './utils';\nimport { ModifyError, BulkError, errnames, exceptions, fullNameExceptions, mapError } from './errors';\nimport Promise, {wrap, PSD, newScope, usePSD, rejection, NativePromise,\n incrementExpectedAwaits, decrementExpectedAwaits, AsyncFunction} from './Promise';\nimport Events from './Events';\nimport {\n nop,\n mirror,\n pureFunctionChain,\n hookCreatingChain,\n hookUpdatingChain,\n hookDeletingChain,\n promisableChain\n} from './chaining-functions';\nimport * as Debug from './debug';\n\nvar DEXIE_VERSION = '{version}',\n maxString = String.fromCharCode(65535),\n // maxKey is an Array<Array> if indexedDB implementations supports array keys (not supported by IE,Edge or Safari at the moment)\n // Otherwise maxKey is maxString. This is handy when needing an open upper border without limit.\n maxKey = (function(){try {IDBKeyRange.only([[]]);return [[]];}catch(e){return maxString;}})(),\n minKey = -Infinity,\n INVALID_KEY_ARGUMENT = \"Invalid key provided. Keys must be of type string, number, Date or Array<string | number | Date>.\",\n STRING_EXPECTED = \"String expected.\",\n connections = [],\n isIEOrEdge = typeof navigator !== 'undefined' && /(MSIE|Trident|Edge)/.test(navigator.userAgent),\n hasIEDeleteObjectStoreBug = isIEOrEdge,\n hangsOnDeleteLargeKeyRange = isIEOrEdge,\n dexieStackFrameFilter = frame => !/(dexie\\.js|dexie\\.min\\.js)/.test(frame),\n dbNamesDB;// Global database for backing Dexie.getDatabaseNames() on browser without indexedDB.webkitGetDatabaseNames() \n\n// Init debug\nDebug.setDebug(Debug.debug, dexieStackFrameFilter);\n\nexport default function Dexie(dbName, options) {\n /// <param name=\"options\" type=\"Object\" optional=\"true\">Specify only if you wich to control which addons that should run on this instance</param>\n var deps = Dexie.dependencies;\n var opts = extend({\n // Default Options\n addons: Dexie.addons, // Pick statically registered addons by default\n autoOpen: true, // Don't require db.open() explicitely.\n indexedDB: deps.indexedDB, // Backend IndexedDB api. Default to browser env.\n IDBKeyRange: deps.IDBKeyRange // Backend IDBKeyRange api. Default to browser env.\n }, options);\n var addons = opts.addons,\n autoOpen = opts.autoOpen,\n indexedDB = opts.indexedDB,\n IDBKeyRange = opts.IDBKeyRange;\n\n var globalSchema = this._dbSchema = {};\n var versions = [];\n var dbStoreNames = [];\n var allTables = {};\n ///<var type=\"IDBDatabase\" />\n var idbdb = null; // Instance of IDBDatabase\n var dbOpenError = null;\n var isBeingOpened = false;\n var onReadyBeingFired = null;\n var openComplete = false;\n var READONLY = \"readonly\", READWRITE = \"readwrite\";\n var db = this;\n var dbReadyResolve,\n dbReadyPromise = new Promise(resolve => {\n dbReadyResolve = resolve;\n }),\n cancelOpen,\n openCanceller = new Promise((_, reject) => {\n cancelOpen = reject;\n });\n var autoSchema = true;\n var hasNativeGetDatabaseNames = !!getNativeGetDatabaseNamesFn(indexedDB),\n hasGetAll;\n\n function init() {\n // Default subscribers to \"versionchange\" and \"blocked\".\n // Can be overridden by custom handlers. If custom handlers return false, these default\n // behaviours will be prevented.\n db.on(\"versionchange\", function (ev) {\n // Default behavior for versionchange event is to close database connection.\n // Caller can override this behavior by doing db.on(\"versionchange\", function(){ return false; });\n // Let's not block the other window from making it's delete() or open() call.\n // NOTE! This event is never fired in IE,Edge or Safari.\n if (ev.newVersion > 0)\n console.warn(`Another connection wants to upgrade database '${db.name}'. Closing db now to resume the upgrade.`);\n else\n console.warn(`Another connection wants to delete database '${db.name}'. Closing db now to resume the delete request.`);\n db.close();\n // In many web applications, it would be recommended to force window.reload()\n // when this event occurs. To do that, subscribe to the versionchange event\n // and call window.location.reload(true) if ev.newVersion > 0 (not a deletion)\n // The reason for this is that your current web app obviously has old schema code that needs\n // to be updated. Another window got a newer version of the app and needs to upgrade DB but\n // your window is blocking it unless we close it here.\n });\n db.on(\"blocked\", ev => {\n if (!ev.newVersion || ev.newVersion < ev.oldVersion)\n console.warn(`Dexie.delete('${db.name}') was blocked`);\n else\n console.warn(`Upgrade '${db.name}' blocked by other connection holding version ${ev.oldVersion/10}`);\n });\n }\n\n //\n //\n //\n // ------------------------- Versioning Framework---------------------------\n //\n //\n //\n\n this.version = function (versionNumber) {\n /// <param name=\"versionNumber\" type=\"Number\"></param>\n /// <returns type=\"Version\"></returns>\n if (idbdb || isBeingOpened) throw new exceptions.Schema(\"Cannot add version when database is open\");\n this.verno = Math.max(this.verno, versionNumber);\n var versionInstance = versions.filter(function (v) { return v._cfg.version === versionNumber; })[0];\n if (versionInstance) return versionInstance;\n versionInstance = new Version(versionNumber);\n versions.push(versionInstance);\n versions.sort(lowerVersionFirst);\n // Disable autoschema mode, as at least one version is specified.\n autoSchema = false;\n return versionInstance;\n };\n\n function Version(versionNumber) {\n this._cfg = {\n version: versionNumber,\n storesSource: null,\n dbschema: {},\n tables: {},\n contentUpgrade: null\n };\n this.stores({}); // Derive earlier schemas by default.\n }\n\n extend(Version.prototype, {\n stores: function (stores) {\n /// <summary>\n /// Defines the schema for a particular version\n /// </summary>\n /// <param name=\"stores\" type=\"Object\">\n /// Example: <br/>\n /// {users: \"id++,first,last,&amp;username,*email\", <br/>\n /// passwords: \"id++,&amp;username\"}<br/>\n /// <br/>\n /// Syntax: {Table: \"[primaryKey][++],[&amp;][*]index1,[&amp;][*]index2,...\"}<br/><br/>\n /// Special characters:<br/>\n /// \"&amp;\" means unique key, <br/>\n /// \"*\" means value is multiEntry, <br/>\n /// \"++\" means auto-increment and only applicable for primary key <br/>\n /// </param>\n this._cfg.storesSource = this._cfg.storesSource ? extend(this._cfg.storesSource, stores) : stores;\n\n // Derive stores from earlier versions if they are not explicitely specified as null or a new syntax.\n var storesSpec = {};\n versions.forEach(function (version) { // 'versions' is always sorted by lowest version first.\n extend(storesSpec, version._cfg.storesSource);\n });\n\n var dbschema = (this._cfg.dbschema = {});\n this._parseStoresSpec(storesSpec, dbschema);\n // Update the latest schema to this version\n // Update API\n globalSchema = db._dbSchema = dbschema;\n removeTablesApi([allTables, db, Transaction.prototype]); // Keep Transaction.prototype even though it should be depr.\n setApiOnPlace([allTables, db, Transaction.prototype, this._cfg.tables], keys(dbschema), dbschema);\n dbStoreNames = keys(dbschema);\n return this;\n },\n upgrade: function (upgradeFunction) {\n this._cfg.contentUpgrade = upgradeFunction;\n return this;\n },\n _parseStoresSpec: function (stores, outSchema) {\n keys(stores).forEach(function (tableName) {\n if (stores[tableName] !== null) {\n var instanceTemplate = {};\n var indexes = parseIndexSyntax(stores[tableName]);\n var primKey = indexes.shift();\n if (primKey.multi) throw new exceptions.Schema(\"Primary key cannot be multi-valued\");\n if (primKey.keyPath) setByKeyPath(instanceTemplate, primKey.keyPath, primKey.auto ? 0 : primKey.keyPath);\n indexes.forEach(function (idx) {\n if (idx.auto) throw new exceptions.Schema(\"Only primary key can be marked as autoIncrement (++)\");\n if (!idx.keyPath) throw new exceptions.Schema(\"Index must have a name and cannot be an empty string\");\n setByKeyPath(instanceTemplate, idx.keyPath, idx.compound ? idx.keyPath.map(function () { return \"\"; }) : \"\");\n });\n outSchema[tableName] = new TableSchema(tableName, primKey, indexes, instanceTemplate);\n }\n });\n }\n });\n \n function runUpgraders (oldVersion, idbtrans, reject) {\n var trans = db._createTransaction(READWRITE, dbStoreNames, globalSchema);\n trans.create(idbtrans);\n trans._completion.catch(reject);\n var rejectTransaction = trans._reject.bind(trans);\n newScope(function () {\n PSD.trans = trans;\n if (oldVersion === 0) {\n // Create tables:\n keys(globalSchema).forEach(function (tableName) {\n createTable(idbtrans, tableName, globalSchema[tableName].primKey, globalSchema[tableName].indexes);\n });\n Promise.follow(()=>db.on.populate.fire(trans)).catch(rejectTransaction);\n } else\n updateTablesAndIndexes(oldVersion, trans, idbtrans).catch(rejectTransaction);\n });\n }\n\n function updateTablesAndIndexes (oldVersion, trans, idbtrans) {\n // Upgrade version to version, step-by-step from oldest to newest version.\n // Each transaction object will contain the table set that was current in that version (but also not-yet-deleted tables from its previous version)\n var queue = [];\n var oldVersionStruct = versions.filter(version => version._cfg.version === oldVersion)[0];\n if (!oldVersionStruct) throw new exceptions.Upgrade(\"Dexie specification of currently installed DB version is missing\");\n globalSchema = db._dbSchema = oldVersionStruct._cfg.dbschema;\n var anyContentUpgraderHasRun = false;\n\n var versToRun = versions.filter(v => v._cfg.version > oldVersion);\n versToRun.forEach(function (version) {\n /// <param name=\"version\" type=\"Version\"></param>\n queue.push(()=>{\n var oldSchema = globalSchema;\n var newSchema = version._cfg.dbschema;\n adjustToExistingIndexNames(oldSchema, idbtrans);\n adjustToExistingIndexNames(newSchema, idbtrans);\n globalSchema = db._dbSchema = newSchema;\n var diff = getSchemaDiff(oldSchema, newSchema); \n // Add tables \n diff.add.forEach(function (tuple) {\n createTable(idbtrans, tuple[0], tuple[1].primKey, tuple[1].indexes);\n });\n // Change tables\n diff.change.forEach(function (change) {\n if (change.recreate) {\n throw new exceptions.Upgrade(\"Not yet support for changing primary key\");\n } else {\n var store = idbtrans.objectStore(change.name);\n // Add indexes\n change.add.forEach(function (idx) {\n addIndex(store, idx);\n });\n // Update indexes\n change.change.forEach(function (idx) {\n store.deleteIndex(idx.name);\n addIndex(store, idx);\n });\n // Delete indexes\n change.del.forEach(function (idxName) {\n store.deleteIndex(idxName);\n });\n }\n });\n if (version._cfg.contentUpgrade) {\n anyContentUpgraderHasRun = true;\n return Promise.follow(()=>{\n version._cfg.contentUpgrade(trans);\n });\n }\n });\n queue.push(function (idbtrans) {\n if (!anyContentUpgraderHasRun || !hasIEDeleteObjectStoreBug) { // Dont delete old tables if ieBug is present and a content upgrader has run. Let tables be left in DB so far. This needs to be taken care of.\n var newSchema = version._cfg.dbschema;\n // Delete old tables\n deleteRemovedTables(newSchema, idbtrans);\n }\n });\n });\n\n // Now, create a queue execution engine\n function runQueue () {\n return queue.length ? Promise.resolve(queue.shift()(trans.idbtrans)).then(runQueue) :\n Promise.resolve();\n }\n \n return runQueue().then(()=>{\n createMissingTables(globalSchema, idbtrans); // At last, make sure to create any missing tables. (Needed by addons that add stores to DB without specifying version)\n });\n }\n\n function getSchemaDiff(oldSchema, newSchema) {\n var diff = {\n del: [], // Array of table names\n add: [], // Array of [tableName, newDefinition]\n change: [] // Array of {name: tableName, recreate: newDefinition, del: delIndexNames, add: newIndexDefs, change: changedIndexDefs}\n };\n for (var table in oldSchema) {\n if (!newSchema[table]) diff.del.push(table);\n }\n for (table in newSchema) {\n var oldDef = oldSchema[table],\n newDef = newSchema[table];\n if (!oldDef) {\n diff.add.push([table, newDef]);\n } else {\n var change = {\n name: table,\n def: newDef,\n recreate: false,\n del: [],\n add: [],\n change: []\n };\n if (oldDef.primKey.src !== newDef.primKey.src) {\n // Primary key has changed. Remove and re-add table.\n change.recreate = true;\n diff.change.push(change);\n } else {\n // Same primary key. Just find out what differs:\n var oldIndexes = oldDef.idxByName;\n var newIndexes = newDef.idxByName;\n for (var idxName in oldIndexes) {\n if (!newIndexes[idxName]) change.del.push(idxName);\n }\n for (idxName in newIndexes) {\n var oldIdx = oldIndexes[idxName],\n newIdx = newIndexes[idxName];\n if (!oldIdx) change.add.push(newIdx);\n else if (oldIdx.src !== newIdx.src) change.change.push(newIdx);\n }\n if (change.del.length > 0 || change.add.length > 0 || change.change.length > 0) {\n diff.change.push(change);\n }\n }\n }\n }\n return diff;\n }\n\n function createTable(idbtrans, tableName, primKey, indexes) {\n /// <param name=\"idbtrans\" type=\"IDBTransaction\"></param>\n var store = idbtrans.db.createObjectStore(tableName, primKey.keyPath ? { keyPath: primKey.keyPath, autoIncrement: primKey.auto } : { autoIncrement: primKey.auto });\n indexes.forEach(function (idx) { addIndex(store, idx); });\n return store;\n }\n\n function createMissingTables(newSchema, idbtrans) {\n keys(newSchema).forEach(function (tableName) {\n if (!idbtrans.db.objectStoreNames.contains(tableName)) {\n createTable(idbtrans, tableName, newSchema[tableName].primKey, newSchema[tableName].indexes);\n }\n });\n }\n\n function deleteRemovedTables(newSchema, idbtrans) {\n for (var i = 0; i < idbtrans.db.objectStoreNames.length; ++i) {\n var storeName = idbtrans.db.objectStoreNames[i];\n if (newSchema[storeName] == null) {\n idbtrans.db.deleteObjectStore(storeName);\n }\n }\n }\n\n function addIndex(store, idx) {\n store.createIndex(idx.name, idx.keyPath, { unique: idx.unique, multiEntry: idx.multi });\n }\n\n //\n //\n // Dexie Protected API\n //\n //\n\n this._allTables = allTables;\n\n this._createTransaction = function (mode, storeNames, dbschema, parentTransaction) {\n return new Transaction(mode, storeNames, dbschema, parentTransaction);\n };\n\n /* Generate a temporary transaction when db operations are done outside a transaction scope.\n */\n function tempTransaction(mode, storeNames, fn) { // Last argument is \"writeLocked\". But this doesnt apply to oneshot direct db operations, so we ignore it.\n if (!openComplete && (!PSD.letThrough)) {\n if (!isBeingOpened) {\n if (!autoOpen)\n return rejection (new exceptions.DatabaseClosed());\n db.open().catch(nop); // Open in background. If if fails, it will be catched by the final promise anyway.\n }\n return dbReadyPromise.then(()=>tempTransaction(mode, storeNames, fn));\n } else {\n var trans = db._createTransaction(mode, storeNames, globalSchema);\n try { trans.create(); } catch (ex) { return rejection(ex); }\n return trans._promise(mode, function (resolve, reject) {\n return newScope(function () { // OPTIMIZATION POSSIBLE? newScope() not needed because it's already done in _promise.\n PSD.trans = trans;\n return fn(resolve, reject, trans);\n });\n }).then(result => {\n // Instead of resolving value directly, wait with resolving it until transaction has completed.\n // Otherwise the data would not be in the DB if requesting it in the then() operation.\n // Specifically, to ensure that the following expression will work:\n //\n // db.friends.put({name: \"Arne\"}).then(function () {\n // db.friends.where(\"name\").equals(\"Arne\").count(function(count) {\n // assert (count === 1);\n // });\n // });\n //\n return trans._completion.then(()=>result);\n });/*.catch(err => { // Don't do this as of now. If would affect bulk- and modify methods in a way that could be more intuitive. But wait! Maybe change in next major.\n trans._reject(err);\n return rejection(err);\n });*/\n }\n }\n\n this._whenReady = function (fn) {\n return openComplete || PSD.letThrough ? fn() : new Promise ((resolve, reject) => {\n if (!isBeingOpened) {\n if (!autoOpen) {\n reject(new exceptions.DatabaseClosed());\n return;\n }\n db.open().catch(nop); // Open in background. If if fails, it will be catched by the final promise anyway.\n }\n dbReadyPromise.then(resolve, reject);\n }).then(fn);\n };\n \n //\n //\n //\n //\n // Dexie API\n //\n //\n //\n\n this.verno = 0;\n\n this.open = function () {\n if (isBeingOpened || idbdb)\n return dbReadyPromise.then(()=> dbOpenError ? rejection (dbOpenError) : db);\n Debug.debug && (openCanceller._stackHolder = Debug.getErrorWithStack()); // Let stacks point to when open() was called rather than where new Dexie() was called.\n isBeingOpened = true;\n dbOpenError = null;\n openComplete = false;\n \n // Function pointers to call when the core opening process completes.\n var resolveDbReady = dbReadyResolve,\n // upgradeTransaction to abort on failure.\n upgradeTransaction = null;\n \n return Promise.race([openCanceller, new Promise((resolve, reject) => {\n // Multiply db.verno with 10 will be needed to workaround upgrading bug in IE:\n // IE fails when deleting objectStore after reading from it.\n // A future version of Dexie.js will stopover an intermediate version to workaround this.\n // At that point, we want to be backward compatible. Could have been multiplied with 2, but by using 10, it is easier to map the number to the real version number.\n \n // If no API, throw!\n if (!indexedDB) throw new exceptions.MissingAPI(\n \"indexedDB API not found. If using IE10+, make sure to run your code on a server URL \"+\n \"(not locally). If using old Safari versions, make sure to include indexedDB polyfill.\");\n \n var req = autoSchema ? indexedDB.open(dbName) : indexedDB.open(dbName, Math.round(db.verno * 10));\n if (!req) throw new exceptions.MissingAPI(\"IndexedDB API not available\"); // May happen in Safari private mode, see https://github.com/dfahlander/Dexie.js/issues/134\n req.onerror = eventRejectHandler(reject);\n req.onblocked = wrap(fireOnBlocked);\n req.onupgradeneeded = wrap (function (e) {\n upgradeTransaction = req.transaction;\n if (autoSchema && !db._allowEmptyDB) { // Unless an addon has specified db._allowEmptyDB, lets make the call fail.\n // Caller did not specify a version or schema. Doing that is only acceptable for opening alread existing databases.\n // If onupgradeneeded is called it means database did not exist. Reject the open() promise and make sure that we\n // do not create a new database by accident here.\n req.onerror = preventDefault; // Prohibit onabort error from firing before we're done!\n upgradeTransaction.abort(); // Abort transaction (would hope that this would make DB disappear but it doesnt.)\n // Close database and delete it.\n req.result.close();\n var delreq = indexedDB.deleteDatabase(dbName); // The upgrade transaction is atomic, and javascript is single threaded - meaning that there is no risk that we delete someone elses database here!\n delreq.onsuccess = delreq.onerror = wrap(function () {\n reject (new exceptions.NoSuchDatabase(`Database ${dbName} doesnt exist`));\n });\n } else {\n upgradeTransaction.onerror = eventRejectHandler(reject);\n var oldVer = e.oldVersion > Math.pow(2, 62) ? 0 : e.oldVersion; // Safari 8 fix.\n runUpgraders(oldVer / 10, upgradeTransaction, reject, req);\n }\n }, reject);\n \n req.onsuccess = wrap (function () {\n // Core opening procedure complete. Now let's just record some stuff.\n upgradeTransaction = null;\n idbdb = req.result;\n connections.push(db); // Used for emulating versionchange event on IE/Edge/Safari.\n\n if (autoSchema) readGlobalSchema();\n else if (idbdb.objectStoreNames.length > 0) {\n try {\n adjustToExistingIndexNames(globalSchema, idbdb.transaction(safariMultiStoreFix(idbdb.objectStoreNames), READONLY));\n } catch (e) {\n // Safari may bail out if > 1 store names. However, this shouldnt be a showstopper. Issue #120.\n }\n }\n \n idbdb.onversionchange = wrap(ev => {\n db._vcFired = true; // detect implementations that not support versionchange (IE/Edge/Safari)\n db.on(\"versionchange\").fire(ev);\n });\n \n if (!hasNativeGetDatabaseNames && dbName !== '__dbnames') {\n dbNamesDB.dbnames.put({name: dbName}).catch(nop);\n }\n\n resolve();\n\n }, reject);\n })]).then(() => {\n // Before finally resolving the dbReadyPromise and this promise,\n // call and await all on('ready') subscribers:\n // Dexie.vip() makes subscribers able to use the database while being opened.\n // This is a must since these subscribers take part of the opening procedure.\n onReadyBeingFired = [];\n return Promise.resolve(Dexie.vip(db.on.ready.fire)).then(function fireRemainders() {\n if (onReadyBeingFired.length > 0) {\n // In case additional subscribers to db.on('ready') were added during the time db.on.ready.fire was executed.\n let remainders = onReadyBeingFired.reduce(promisableChain, nop);\n onReadyBeingFired = [];\n return Promise.resolve(Dexie.vip(remainders)).then(fireRemainders)\n }\n });\n }).finally(()=>{\n onReadyBeingFired = null;\n }).then(()=>{\n // Resolve the db.open() with the db instance.\n isBeingOpened = false;\n return db;\n }).catch(err => {\n try {\n // Did we fail within onupgradeneeded? Make sure to abort the upgrade transaction so it doesnt commit.\n upgradeTransaction && upgradeTransaction.abort();\n } catch (e) { }\n isBeingOpened = false; // Set before calling db.close() so that it doesnt reject openCanceller again (leads to unhandled rejection event).\n db.close(); // Closes and resets idbdb, removes connections, resets dbReadyPromise and openCanceller so that a later db.open() is fresh.\n // A call to db.close() may have made on-ready subscribers fail. Use dbOpenError if set, since err could be a follow-up error on that.\n dbOpenError = err; // Record the error. It will be used to reject further promises of db operations.\n return rejection (dbOpenError);\n }).finally(()=>{\n openComplete = true;\n resolveDbReady(); // dbReadyPromise is resolved no matter if open() rejects or resolved. It's just to wake up waiters.\n });\n };\n \n this.close = function () {\n var idx = connections.indexOf(db);\n if (idx >= 0) connections.splice(idx, 1); \n if (idbdb) {\n try {idbdb.close();} catch(e){}\n idbdb = null;\n }\n autoOpen = false;\n dbOpenError = new exceptions.DatabaseClosed();\n if (isBeingOpened)\n cancelOpen(dbOpenError);\n // Reset dbReadyPromise promise:\n dbReadyPromise = new Promise(resolve => {\n dbReadyResolve = resolve;\n });\n openCanceller = new Promise((_, reject) => {\n cancelOpen = reject;\n });\n };\n \n this.delete = function () {\n var hasArguments = arguments.length > 0;\n return new Promise(function (resolve, reject) {\n if (hasArguments) throw new exceptions.InvalidArgument(\"Arguments not allowed in db.delete()\");\n if (isBeingOpened) {\n dbReadyPromise.then(doDelete);\n } else {\n doDelete();\n }\n function doDelete() {\n db.close();\n var req = indexedDB.deleteDatabase(dbName);\n req.onsuccess = wrap(function () {\n if (!hasNativeGetDatabaseNames) {\n dbNamesDB.dbnames.delete(dbName).catch(nop);\n }\n resolve();\n });\n req.onerror = eventRejectHandler(reject);\n req.onblocked = fireOnBlocked;\n }\n });\n };\n\n this.backendDB = function () {\n return idbdb;\n };\n\n this.isOpen = function () {\n return idbdb !== null;\n };\n this.hasBeenClosed = function () {\n return dbOpenError && (dbOpenError instanceof exceptions.DatabaseClosed);\n }\n this.hasFailed = function () {\n return dbOpenError !== null;\n };\n this.dynamicallyOpened = function() {\n return autoSchema;\n };\n\n //\n // Properties\n //\n this.name = dbName;\n\n // db.tables - an array of all Table instances.\n props(this, {\n tables: {\n get () {\n /// <returns type=\"Array\" elementType=\"Table\" />\n return keys(allTables).map(function (name) { return allTables[name]; });\n }\n }\n });\n\n //\n // Events\n //\n this.on = Events(this, \"populate\", \"blocked\", \"versionchange\", {ready: [promisableChain, nop]});\n\n this.on.ready.subscribe = override (this.on.ready.subscribe, function (subscribe) {\n return (subscriber, bSticky) => {\n Dexie.vip(()=>{\n if (openComplete) {\n // Database already open. Call subscriber asap.\n if (!dbOpenError) Promise.resolve().then(subscriber);\n // bSticky: Also subscribe to future open sucesses (after close / reopen) \n if (bSticky) subscribe(subscriber);\n } else if (onReadyBeingFired) {\n // db.on('ready') subscribers are currently being executed and have not yet resolved or rejected\n onReadyBeingFired.push(subscriber);\n if (bSticky) subscribe(subscriber);\n } else {\n // Database not yet open. Subscribe to it.\n subscribe(subscriber);\n // If bSticky is falsy, make sure to unsubscribe subscriber when fired once.\n if (!bSticky) subscribe(function unsubscribe() {\n db.on.ready.unsubscribe(subscriber);\n db.on.ready.unsubscribe(unsubscribe);\n });\n }\n });\n }\n });\n\n this.transaction = function () {\n /// <summary>\n ///\n /// </summary>\n /// <param name=\"mode\" type=\"String\">\"r\" for readonly, or \"rw\" for readwrite</param>\n /// <param name=\"tableInstances\">Table instance, Array of Table instances, String or String Array of object stores to include in the transaction</param>\n /// <param name=\"scopeFunc\" type=\"Function\">Function to execute with transaction</param>\n\n var args = extractTransactionArgs.apply(this, arguments);\n return this._transaction.apply(this, args);\n }\n \n function extractTransactionArgs (mode, _tableArgs_, scopeFunc) {\n // Let table arguments be all arguments between mode and last argument.\n var i = arguments.length;\n if (i < 2) throw new exceptions.InvalidArgument(\"Too few arguments\");\n // Prevent optimzation killer (https://github.com/petkaantonov/bluebird/wiki/Optimization-killers#32-leaking-arguments)\n // and clone arguments except the first one into local var 'args'.\n var args = new Array(i - 1);\n while (--i) args[i-1] = arguments[i];\n // Let scopeFunc be the last argument and pop it so that args now only contain the table arguments.\n scopeFunc = args.pop();\n var tables = flatten(args); // Support using array as middle argument, or a mix of arrays and non-arrays.\n return [mode, tables, scopeFunc];\n }\n\n this._transaction = function (mode, tables, scopeFunc) {\n var parentTransaction = PSD.trans;\n // Check if parent transactions is bound to this db instance, and if caller wants to reuse it\n if (!parentTransaction || parentTransaction.db !== db || mode.indexOf('!') !== -1) parentTransaction = null;\n var onlyIfCompatible = mode.indexOf('?') !== -1;\n mode = mode.replace('!', '').replace('?', ''); // Ok. Will change arguments[0] as well but we wont touch arguments henceforth.\n \n try {\n //\n // Get storeNames from arguments. Either through given table instances, or through given table names.\n //\n var storeNames = tables.map(table => {\n var storeName = table instanceof Table ? table.name : table;\n if (typeof storeName !== 'string') throw new TypeError(\"Invalid table argument to Dexie.transaction(). Only Table or String are allowed\");\n return storeName;\n });\n\n //\n // Resolve mode. Allow shortcuts \"r\" and \"rw\".\n //\n if (mode == \"r\" || mode == READONLY)\n mode = READONLY;\n else if (mode == \"rw\" || mode == READWRITE)\n mode = READWRITE;\n else\n throw new exceptions.InvalidArgument(\"Invalid transaction mode: \" + mode);\n\n if (parentTransaction) {\n // Basic checks\n if (parentTransaction.mode === READONLY && mode === READWRITE) {\n if (onlyIfCompatible) {\n // Spawn new transaction instead.\n parentTransaction = null; \n }\n else throw new exceptions.SubTransaction(\"Cannot enter a sub-transaction with READWRITE mode when parent transaction is READONLY\");\n }\n if (parentTransaction) {\n storeNames.forEach(function (storeName) {\n if (parentTransaction && parentTransaction.storeNames.indexOf(storeName) === -1) {\n if (onlyIfCompatible) {\n // Spawn new transaction instead.\n parentTransaction = null; \n }\n else throw new exceptions.SubTransaction(\"Table \" + storeName +\n \" not included in parent transaction.\");\n }\n });\n }\n if (onlyIfCompatible && parentTransaction && !parentTransaction.active) {\n // '?' mode should not keep using an inactive transaction.\n parentTransaction = null;\n }\n }\n } catch (e) {\n return parentTransaction ?\n parentTransaction._promise(null, (_, reject) => {reject(e);}) :\n rejection (e);\n }\n // If this is a sub-transaction, lock the parent and then launch the sub-transaction.\n return (parentTransaction ?\n parentTransaction._promise(mode, enterTransactionScope, \"lock\") :\n PSD.trans ?\n // no parent transaction despite PSD.trans exists. Make sure also\n // that the zone we create is not a sub-zone of current, because\n // Promise.follow() should not wait for it if so.\n usePSD(PSD.transless, ()=>db._whenReady(enterTransactionScope)) :\n db._whenReady (enterTransactionScope));\n \n function enterTransactionScope() {\n return Promise.resolve().then(()=>{\n // Keep a pointer to last non-transactional PSD to use if someone calls Dexie.ignoreTransaction().\n var transless = PSD.transless || PSD;\n // Our transaction.\n //return new Promise((resolve, reject) => {\n var trans = db._createTransaction(mode, storeNames, globalSchema, parentTransaction);\n // Let the transaction instance be part of a Promise-specific data (PSD) value.\n var zoneProps = {\n trans: trans,\n transless: transless\n };\n\n if (parentTransaction) {\n // Emulate transaction commit awareness for inner transaction (must 'commit' when the inner transaction has no more operations ongoing)\n trans.idbtrans = parentTransaction.idbtrans;\n } else {\n trans.create(); // Create the backend transaction so that complete() or error() will trigger even if no operation is made upon it.\n }\n\n // Support for native async await.\n if (scopeFunc.constructor === AsyncFunction) {\n incrementExpectedAwaits();\n }\n\n var returnValue;\n var promiseFollowed = Promise.follow(()=>{\n // Finally, call the scope function with our table and transaction arguments.\n returnValue = scopeFunc.call(trans, trans);\n if (returnValue) {\n if (returnValue.constructor === NativePromise) {\n var decrementor = decrementExpectedAwaits.bind(null, null);\n returnValue.then(decrementor, decrementor);\n } else if (typeof returnValue.next === 'function' && typeof returnValue.throw === 'function') {\n // scopeFunc returned an iterator with throw-support. Handle yield as await.\n returnValue = awaitIterator(returnValue);\n }\n }\n }, zoneProps);\n return (returnValue && typeof returnValue.then === 'function' ?\n // Promise returned. User uses promise-style transactions.\n Promise.resolve(returnValue).then(x => trans.active ?\n x // Transaction still active. Continue.\n : rejection(new exceptions.PrematureCommit(\n \"Transaction committed too early. See http://bit.ly/2kdckMn\")))\n // No promise returned. Wait for all outstanding promises before continuing. \n : promiseFollowed.then(()=>returnValue)\n ).then(x => {\n // sub transactions don't react to idbtrans.oncomplete. We must trigger a completion:\n if (parentTransaction) trans._resolve();\n // wait for trans._completion\n // (if root transaction, this means 'complete' event. If sub-transaction, we've just fired it ourselves)\n return trans._completion.then(()=>x);\n }).catch (e => {\n trans._reject(e); // Yes, above then-handler were maybe not called because of an unhandled rejection in scopeFunc!\n return rejection(e);\n });\n });\n }\n };\n\n this.table = function (tableName) {\n /// <returns type=\"Table\"></returns>\n if (!hasOwn(allTables, tableName)) { throw new exceptions.InvalidTable(`Table ${tableName} does not exist`); }\n return allTables[tableName];\n };\n\n //\n //\n //\n // Table Class\n //\n //\n //\n function Table(name, tableSchema, optionalTrans) {\n /// <param name=\"name\" type=\"String\"></param>\n this.name = name;\n this.schema = tableSchema;\n this._tx = optionalTrans;\n this.hook = allTables[name] ? allTables[name].hook : Events(null, {\n \"creating\": [hookCreatingChain, nop],\n \"reading\": [pureFunctionChain, mirror],\n \"updating\": [hookUpdatingChain, nop],\n \"deleting\": [hookDeletingChain, nop]\n });\n }\n\n function BulkErrorHandlerCatchAll(errorList, done, supportHooks) {\n return (supportHooks ? hookedEventRejectHandler : eventRejectHandler)(e => {\n errorList.push(e);\n done && done();\n });\n }\n\n function bulkDelete(idbstore, trans, keysOrTuples, hasDeleteHook, deletingHook) {\n // If hasDeleteHook, keysOrTuples must be an array of tuples: [[key1, value2],[key2,value2],...],\n // else keysOrTuples must be just an array of keys: [key1, key2, ...].\n return new Promise((resolve, reject)=>{\n var len = keysOrTuples.length,\n lastItem = len - 1;\n if (len === 0) return resolve();\n if (!hasDeleteHook) {\n for (var i=0; i < len; ++i) {\n var req = idbstore.delete(keysOrTuples[i]);\n req.onerror = eventRejectHandler(reject);\n if (i === lastItem) req.onsuccess = wrap(()=>resolve());\n }\n } else {\n var hookCtx,\n errorHandler = hookedEventRejectHandler(reject),\n successHandler = hookedEventSuccessHandler(null);\n tryCatch(()=> {\n for (var i = 0; i < len; ++i) {\n hookCtx = {onsuccess: null, onerror: null};\n var tuple = keysOrTuples[i];\n deletingHook.call(hookCtx, tuple[0], tuple[1], trans);\n var req = idbstore.delete(tuple[0]);\n req._hookCtx = hookCtx;\n req.onerror = errorHandler;\n if (i === lastItem)\n req.onsuccess = hookedEventSuccessHandler(resolve);\n else\n req.onsuccess = successHandler;\n }\n }, err=>{\n hookCtx.onerror && hookCtx.onerror(err);\n throw err;\n });\n }\n });\n } \n\n props(Table.prototype, {\n\n //\n // Table Protected Methods\n //\n\n _trans: function getTransaction(mode, fn, writeLocked) {\n var trans = this._tx || PSD.trans;\n return trans && trans.db === db ?\n trans === PSD.trans ?\n trans._promise (mode, fn, writeLocked) :\n newScope(()=>trans._promise(mode, fn, writeLocked), {trans: trans, transless: PSD.transless || PSD}) :\n tempTransaction (mode, [this.name], fn);\n },\n _idbstore: function getIDBObjectStore(mode, fn, writeLocked) {\n var tableName = this.name;\n function supplyIdbStore (resolve, reject, trans) {\n if (trans.storeNames.indexOf(tableName) === -1)\n throw new exceptions.NotFound(\"Table\" + tableName + \" not part of transaction\");\n return fn(resolve, reject, trans.idbtrans.objectStore(tableName), trans);\n }\n return this._trans(mode, supplyIdbStore, writeLocked);\n },\n\n //\n // Table Public Methods\n //\n get: function (keyOrCrit, cb) {\n if (keyOrCrit && keyOrCrit.constructor === Object)\n return this.where(keyOrCrit).first(cb);\n var self = this;\n return this._idbstore(READONLY, function (resolve, reject, idbstore) {\n var req = idbstore.get(keyOrCrit);\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = wrap(function () {\n resolve(self.hook.reading.fire(req.result));\n }, reject);\n }).then(cb);\n },\n where: function (indexOrCrit) {\n if (typeof indexOrCrit === 'string')\n return new WhereClause(this, indexOrCrit);\n if (isArray(indexOrCrit))\n return new WhereClause(this, `[${indexOrCrit.join('+')}]`);\n // indexOrCrit is an object map of {[keyPath]:value} \n var keyPaths = keys(indexOrCrit);\n if (keyPaths.length === 1)\n // Only one critera. This was the easy case:\n return this\n .where(keyPaths[0])\n .equals(indexOrCrit[keyPaths[0]]);\n \n // Multiple criterias.\n // Let's try finding a compound index that matches all keyPaths in\n // arbritary order:\n var compoundIndex = this.schema.indexes.concat(this.schema.primKey).filter(ix =>\n ix.compound &&\n keyPaths.every(keyPath => ix.keyPath.indexOf(keyPath) >= 0) &&\n ix.keyPath.every(keyPath => keyPaths.indexOf(keyPath) >= 0))[0];\n\n if (compoundIndex && maxKey !== maxString)\n // Cool! We found such compound index\n // and this browser supports compound indexes (maxKey !== maxString)!\n return this\n .where(compoundIndex.name)\n .equals(compoundIndex.keyPath.map(kp => indexOrCrit[kp]));\n\n if (!compoundIndex) console.warn(\n `The query ${JSON.stringify(indexOrCrit)} on ${this.name} would benefit of a ` +\n `compound index [${keyPaths.join('+')}]`);\n \n // Ok, now let's fallback to finding at least one matching index\n // and filter the rest.\n var idxByName = this.schema.idxByName;\n var simpleIndex = keyPaths.reduce((r,keyPath)=>[\n r[0] || idxByName[keyPath],\n r[0] || !idxByName[keyPath] ?\n combine(\n r[1],\n x =>''+getByKeyPath(x, keyPath) ==\n ''+indexOrCrit[keyPath])\n : r[1]\n ], [null, null]);\n \n var idx = simpleIndex[0];\n return idx ?\n this.where(idx.name).equals(indexOrCrit[idx.keyPath])\n .filter(simpleIndex[1]) :\n compoundIndex ?\n this.filter(simpleIndex[1]) : // Has compound but browser bad. Allow filter.\n this.where(keyPaths).equals(''); // No index at all. Fail lazily.\n },\n count: function (cb) {\n return this.toCollection().count(cb);\n },\n offset: function (offset) {\n return this.toCollection().offset(offset);\n },\n limit: function (numRows) {\n return this.toCollection().limit(numRows);\n },\n reverse: function () {\n return this.toCollection().reverse();\n },\n filter: function (filterFunction) {\n return this.toCollection().and(filterFunction);\n },\n each: function (fn) {\n return this.toCollection().each(fn);\n },\n toArray: function (cb) {\n return this.toCollection().toArray(cb);\n },\n orderBy: function (index) {\n return new Collection(\n new WhereClause(this, isArray(index) ?\n `[${index.join('+')}]` :\n index));\n },\n\n toCollection: function () {\n return new Collection(new WhereClause(this));\n },\n\n mapToClass: function (constructor, structure) {\n /// <summary>\n /// Map table to a javascript constructor function. Objects returned from the database will be instances of this class, making\n /// it possible to the instanceOf operator as well as extending the class using constructor.prototype.method = function(){...}.\n /// </summary>\n /// <param name=\"constructor\">Constructor function representing the class.</param>\n /// <param name=\"structure\" optional=\"true\">Helps IDE code completion by knowing the members that objects contain and not just the indexes. Also\n /// know what type each member has. Example: {name: String, emailAddresses: [String], password}</param>\n this.schema.mappedClass = constructor;\n var instanceTemplate = Object.create(constructor.prototype);\n if (structure) {\n // structure and instanceTemplate is for IDE code competion only while constructor.prototype is for actual inheritance.\n applyStructure(instanceTemplate, structure);\n }\n this.schema.instanceTemplate = instanceTemplate;\n\n // Now, subscribe to the when(\"reading\") event to make all objects that come out from this table inherit from given class\n // no matter which method to use for reading (Table.get() or Table.where(...)... )\n var readHook = function (obj) {\n if (!obj) return obj; // No valid object. (Value is null). Return as is.\n // Create a new object that derives from constructor:\n var res = Object.create(constructor.prototype);\n // Clone members:\n for (var m in obj) if (hasOwn(obj, m)) try {res[m] = obj[m];} catch(_){}\n return res;\n };\n\n if (this.schema.readHook) {\n this.hook.reading.unsubscribe(this.schema.readHook);\n }\n this.schema.readHook = readHook;\n this.hook(\"reading\", readHook);\n return constructor;\n },\n defineClass: function (structure) {\n /// <summary>\n /// Define all members of the class that represents the table. This will help code completion of when objects are read from the database\n /// as well as making it possible to extend the prototype of the returned constructor function.\n /// </summary>\n /// <param name=\"structure\">Helps IDE code completion by knowing the members that objects contain and not just the indexes. Also\n /// know what type each member has. Example: {name: String, emailAddresses: [String], properties: {shoeSize: Number}}</param>\n return this.mapToClass(Dexie.defineClass(structure), structure);\n },\n\n bulkDelete: function (keys) {\n if (this.hook.deleting.fire === nop) {\n return this._idbstore(READWRITE, (resolve, reject, idbstore, trans) => {\n resolve (bulkDelete(idbstore, trans, keys, false, nop));\n });\n } else {\n return this\n .where(':id')\n .anyOf(keys)\n .delete()\n .then(()=>{}); // Resolve with undefined.\n }\n },\n bulkPut: function(objects, keys) {\n return this._idbstore(READWRITE, (resolve, reject, idbstore) => {\n if (!idbstore.keyPath && !this.schema.primKey.auto && !keys)\n throw new exceptions.InvalidArgument(\"bulkPut() with non-inbound keys requires keys array in second argument\");\n if (idbstore.keyPath && keys)\n throw new exceptions.InvalidArgument(\"bulkPut(): keys argument invalid on tables with inbound keys\");\n if (keys && keys.length !== objects.length)\n throw new exceptions.InvalidArgument(\"Arguments objects and keys must have the same length\");\n if (objects.length === 0) return resolve(); // Caller provided empty list.\n const done = result => {\n if (errorList.length === 0) resolve(result);\n else reject(new BulkError(`${this.name}.bulkPut(): ${errorList.length} of ${numObjs} operations failed`, errorList));\n };\n var req,\n errorList = [],\n errorHandler,\n numObjs = objects.length,\n table = this;\n if (this.hook.creating.fire === nop && this.hook.updating.fire === nop) {\n //\n // Standard Bulk (no 'creating' or 'updating' hooks to care about)\n //\n errorHandler = BulkErrorHandlerCatchAll(errorList);\n for (var i = 0, l = objects.length; i < l; ++i) {\n req = keys ? idbstore.put(objects[i], keys[i]) : idbstore.put(objects[i]);\n req.onerror = errorHandler;\n }\n // Only need to catch success or error on the last operation\n // according to the IDB spec.\n req.onerror = BulkErrorHandlerCatchAll(errorList, done);\n req.onsuccess = eventSuccessHandler(done);\n } else {\n var effectiveKeys = keys || idbstore.keyPath && objects.map(o=>getByKeyPath(o, idbstore.keyPath));\n // Generate map of {[key]: object}\n var objectLookup = effectiveKeys && arrayToObject(effectiveKeys, (key, i) => key != null && [key, objects[i]]); \n var promise = !effectiveKeys ?\n\n // Auto-incremented key-less objects only without any keys argument.\n table.bulkAdd(objects) :\n\n // Keys provided. Either as inbound in provided objects, or as a keys argument.\n // Begin with updating those that exists in DB:\n table.where(':id').anyOf(effectiveKeys.filter(key => key != null)).modify(function () {\n this.value = objectLookup[this.primKey];\n objectLookup[this.primKey] = null; // Mark as \"don't add this\"\n }).catch(ModifyError, e => {\n errorList = e.failures; // No need to concat here. These are the first errors added.\n }).then(()=> {\n // Now, let's examine which items didnt exist so we can add them:\n var objsToAdd = [],\n keysToAdd = keys && [];\n // Iterate backwards. Why? Because if same key was used twice, just add the last one.\n for (var i=effectiveKeys.length-1; i>=0; --i) {\n var key = effectiveKeys[i];\n if (key == null || objectLookup[key]) {\n objsToAdd.push(objects[i]);\n keys && keysToAdd.push(key);\n if (key != null) objectLookup[key] = null; // Mark as \"dont add again\"\n }\n }\n // The items are in reverse order so reverse them before adding.\n // Could be important in order to get auto-incremented keys the way the caller\n // would expect. Could have used unshift instead of push()/reverse(),\n // but: http://jsperf.com/unshift-vs-reverse\n objsToAdd.reverse();\n keys && keysToAdd.reverse();\n return table.bulkAdd(objsToAdd, keysToAdd);\n }).then(lastAddedKey => {\n // Resolve with key of the last object in given arguments to bulkPut():\n var lastEffectiveKey = effectiveKeys[effectiveKeys.length - 1]; // Key was provided.\n return lastEffectiveKey != null ? lastEffectiveKey : lastAddedKey;\n });\n\n promise.then(done).catch(BulkError, e => {\n // Concat failure from ModifyError and reject using our 'done' method.\n errorList = errorList.concat(e.failures);\n done();\n }).catch(reject);\n }\n }, \"locked\"); // If called from transaction scope, lock transaction til all steps are done.\n },\n bulkAdd: function(objects, keys) {\n var self = this,\n creatingHook = this.hook.creating.fire;\n return this._idbstore(READWRITE, function (resolve, reject, idbstore, trans) {\n if (!idbstore.keyPath && !self.schema.primKey.auto && !keys)\n throw new exceptions.InvalidArgument(\"bulkAdd() with non-inbound keys requires keys array in second argument\");\n if (idbstore.keyPath && keys)\n throw new exceptions.InvalidArgument(\"bulkAdd(): keys argument invalid on tables with inbound keys\");\n if (keys && keys.length !== objects.length)\n throw new exceptions.InvalidArgument(\"Arguments objects and keys must have the same length\");\n if (objects.length === 0) return resolve(); // Caller provided empty list.\n function done(result) {\n if (errorList.length === 0) resolve(result);\n else reject(new BulkError(`${self.name}.bulkAdd(): ${errorList.length} of ${numObjs} operations failed`, errorList));\n }\n var req,\n errorList = [],\n errorHandler,\n successHandler,\n numObjs = objects.length;\n if (creatingHook !== nop) {\n //\n // There are subscribers to hook('creating')\n // Must behave as documented.\n //\n var keyPath = idbstore.keyPath,\n hookCtx;\n errorHandler = BulkErrorHandlerCatchAll(errorList, null, true);\n successHandler = hookedEventSuccessHandler(null);\n\n tryCatch(() => {\n for (var i=0, l = objects.length; i < l; ++i) {\n hookCtx = { onerror: null, onsuccess: null };\n var key = keys && keys[i];\n var obj = objects[i],\n effectiveKey = keys ? key : keyPath ? getByKeyPath(obj, keyPath) : undefined,\n keyToUse = creatingHook.call(hookCtx, effectiveKey, obj, trans);\n if (effectiveKey == null && keyToUse != null) {\n if (keyPath) {\n obj = deepClone(obj);\n setByKeyPath(obj, keyPath, keyToUse);\n } else {\n key = keyToUse;\n }\n }\n req = key != null ? idbstore.add(obj, key) : idbstore.add(obj);\n req._hookCtx = hookCtx;\n if (i < l - 1) {\n req.onerror = errorHandler;\n if (hookCtx.onsuccess)\n req.onsuccess = successHandler;\n }\n }\n }, err => {\n hookCtx.onerror && hookCtx.onerror(err);\n throw err;\n });\n\n req.onerror = BulkErrorHandlerCatchAll(errorList, done, true);\n req.onsuccess = hookedEventSuccessHandler(done);\n } else {\n //\n // Standard Bulk (no 'creating' hook to care about)\n //\n errorHandler = BulkErrorHandlerCatchAll(errorList);\n for (var i = 0, l = objects.length; i < l; ++i) {\n req = keys ? idbstore.add(objects[i], keys[i]) : idbstore.add(objects[i]);\n req.onerror = errorHandler;\n }\n // Only need to catch success or error on the last operation\n // according to the IDB spec.\n req.onerror = BulkErrorHandlerCatchAll(errorList, done);\n req.onsuccess = eventSuccessHandler(done);\n }\n });\n },\n add: function (obj, key) {\n /// <summary>\n /// Add an object to the database. In case an object with same primary key already exists, the object will not be added.\n /// </summary>\n /// <param name=\"obj\" type=\"Object\">A javascript object to insert</param>\n /// <param name=\"key\" optional=\"true\">Primary key</param>\n var creatingHook = this.hook.creating.fire;\n return this._idbstore(READWRITE, function (resolve, reject, idbstore, trans) {\n var hookCtx = {onsuccess: null, onerror: null};\n if (creatingHook !== nop) {\n var effectiveKey = (key != null) ? key : (idbstore.keyPath ? getByKeyPath(obj, idbstore.keyPath) : undefined);\n var keyToUse = creatingHook.call(hookCtx, effectiveKey, obj, trans); // Allow subscribers to when(\"creating\") to generate the key.\n if (effectiveKey == null && keyToUse != null) { // Using \"==\" and \"!=\" to check for either null or undefined!\n if (idbstore.keyPath)\n setByKeyPath(obj, idbstore.keyPath, keyToUse);\n else\n key = keyToUse;\n }\n }\n try {\n var req = key != null ? idbstore.add(obj, key) : idbstore.add(obj);\n req._hookCtx = hookCtx;\n req.onerror = hookedEventRejectHandler(reject);\n req.onsuccess = hookedEventSuccessHandler(function (result) {\n // TODO: Remove these two lines in next major release (2.0?)\n // It's no good practice to have side effects on provided parameters\n var keyPath = idbstore.keyPath;\n if (keyPath) setByKeyPath(obj, keyPath, result);\n resolve(result);\n });\n } catch (e) {\n if (hookCtx.onerror) hookCtx.onerror(e);\n throw e;\n }\n });\n },\n\n put: function (obj, key) {\n /// <summary>\n /// Add an object to the database but in case an object with same primary key alread exists, the existing one will get updated.\n /// </summary>\n /// <param name=\"obj\" type=\"Object\">A javascript object to insert or update</param>\n /// <param name=\"key\" optional=\"true\">Primary key</param>\n var creatingHook = this.hook.creating.fire,\n updatingHook = this.hook.updating.fire;\n if (creatingHook !== nop || updatingHook !== nop) {\n //\n // People listens to when(\"creating\") or when(\"updating\") events!\n // We must know whether the put operation results in an CREATE or UPDATE.\n //\n var keyPath = this.schema.primKey.keyPath;\n var effectiveKey = (key !== undefined) ? key : (keyPath && getByKeyPath(obj, keyPath));\n if (effectiveKey == null) // \"== null\" means checking for either null or undefined.\n return this.add(obj);\n \n // Since key is optional, make sure we get it from obj if not provided\n \n // Primary key exist. Lock transaction and try modifying existing. If nothing modified, call add().\n // clone obj before this async call. If caller modifies obj the line after put(), the IDB spec requires that it should not affect operation.\n obj = deepClone(obj);\n return this._trans(READWRITE, () =>\n this.where(\":id\").equals(effectiveKey).modify(function () {\n // Replace extisting value with our object\n // CRUD event firing handled in Collection.modify()\n this.value = obj;\n }).then(count => count === 0 ? this.add(obj, key) : effectiveKey),\n \"locked\"); // Lock needed because operation is splitted into modify() and add().\n } else {\n // Use the standard IDB put() method.\n return this._idbstore(READWRITE, function (resolve, reject, idbstore) {\n var req = key !== undefined ? idbstore.put(obj, key) : idbstore.put(obj);\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = wrap(function (ev) {\n var keyPath = idbstore.keyPath;\n if (keyPath) setByKeyPath(obj, keyPath, ev.target.result);\n resolve(req.result);\n });\n });\n }\n },\n\n 'delete': function (key) {\n /// <param name=\"key\">Primary key of the object to delete</param>\n if (this.hook.deleting.subscribers.length) {\n // People listens to when(\"deleting\") event. Must implement delete using Collection.delete() that will\n // call the CRUD event. Only Collection.delete() will know whether an object was actually deleted.\n return this.where(\":id\").equals(key).delete();\n } else {\n // No one listens. Use standard IDB delete() method.\n return this._idbstore(READWRITE, function (resolve, reject, idbstore) {\n var req = idbstore.delete(key);\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = wrap(function () {\n resolve(req.result);\n });\n });\n }\n },\n\n clear: function () {\n if (this.hook.deleting.subscribers.length) {\n // People listens to when(\"deleting\") event. Must implement delete using Collection.delete() that will\n // call the CRUD event. Only Collection.delete() will knows which objects that are actually deleted.\n return this.toCollection().delete();\n } else {\n return this._idbstore(READWRITE, function (resolve, reject, idbstore) {\n var req = idbstore.clear();\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = wrap(function () {\n resolve(req.result);\n });\n });\n }\n },\n\n update: function (keyOrObject, modifications) {\n if (typeof modifications !== 'object' || isArray(modifications))\n throw new exceptions.InvalidArgument(\"Modifications must be an object.\");\n if (typeof keyOrObject === 'object' && !isArray(keyOrObject)) {\n // object to modify. Also modify given object with the modifications:\n keys(modifications).forEach(function (keyPath) {\n setByKeyPath(keyOrObject, keyPath, modifications[keyPath]);\n });\n var key = getByKeyPath(keyOrObject, this.schema.primKey.keyPath);\n if (key === undefined) return rejection (new exceptions.InvalidArgument(\n \"Given object does not contain its primary key\"));\n return this.where(\":id\").equals(key).modify(modifications);\n } else {\n // key to modify\n return this.where(\":id\").equals(keyOrObject).modify(modifications);\n }\n }\n });\n \n //\n //\n //\n // Transaction Class\n //\n //\n //\n function Transaction(mode, storeNames, dbschema, parent) {\n /// <summary>\n /// Transaction class. Represents a database transaction. All operations on db goes through a Transaction.\n /// </summary>\n /// <param name=\"mode\" type=\"String\">Any of \"readwrite\" or \"readonly\"</param>\n /// <param name=\"storeNames\" type=\"Array\">Array of table names to operate on</param>\n this.db = db;\n this.mode = mode;\n this.storeNames = storeNames;\n this.idbtrans = null;\n this.on = Events(this, \"complete\", \"error\", \"abort\");\n this.parent = parent || null;\n this.active = true;\n this._reculock = 0;\n this._blockedFuncs = [];\n this._resolve = null;\n this._reject = null;\n this._waitingFor = null;\n this._waitingQueue = null;\n this._spinCount = 0; // Just for debugging waitFor()\n this._completion = new Promise ((resolve, reject) => {\n this._resolve = resolve;\n this._reject = reject;\n });\n \n this._completion.then(\n ()=> {\n this.active = false;\n this.on.complete.fire();\n },\n e => {\n var wasActive = this.active;\n this.active = false;\n this.on.error.fire(e);\n this.parent ?\n this.parent._reject(e) :\n wasActive && this.idbtrans && this.idbtrans.abort();\n return rejection(e); // Indicate we actually DO NOT catch this error.\n });\n }\n\n props(Transaction.prototype, {\n //\n // Transaction Protected Methods (not required by API users, but needed internally and eventually by dexie extensions)\n //\n _lock: function () {\n assert (!PSD.global); // Locking and unlocking reuires to be within a PSD scope.\n // Temporary set all requests into a pending queue if they are called before database is ready.\n ++this._reculock; // Recursive read/write lock pattern using PSD (Promise Specific Data) instead of TLS (Thread Local Storage)\n if (this._reculock === 1 && !PSD.global) PSD.lockOwnerFor = this;\n return this;\n },\n _unlock: function () {\n assert (!PSD.global); // Locking and unlocking reuires to be within a PSD scope.\n if (--this._reculock === 0) {\n if (!PSD.global) PSD.lockOwnerFor = null;\n while (this._blockedFuncs.length > 0 && !this._locked()) {\n var fnAndPSD = this._blockedFuncs.shift();\n try { usePSD(fnAndPSD[1], fnAndPSD[0]); } catch (e) { }\n }\n }\n return this;\n },\n _locked: function () {\n // Checks if any write-lock is applied on this transaction.\n // To simplify the Dexie API for extension implementations, we support recursive locks.\n // This is accomplished by using \"Promise Specific Data\" (PSD).\n // PSD data is bound to a Promise and any child Promise emitted through then() or resolve( new Promise() ).\n // PSD is local to code executing on top of the call stacks of any of any code executed by Promise():\n // * callback given to the Promise() constructor (function (resolve, reject){...})\n // * callbacks given to then()/catch()/finally() methods (function (value){...})\n // If creating a new independant Promise instance from within a Promise call stack, the new Promise will derive the PSD from the call stack of the parent Promise.\n // Derivation is done so that the inner PSD __proto__ points to the outer PSD.\n // PSD.lockOwnerFor will point to current transaction object if the currently executing PSD scope owns the lock.\n return this._reculock && PSD.lockOwnerFor !== this;\n },\n create: function (idbtrans) {\n if (!this.mode) return this;\n assert(!this.idbtrans);\n if (!idbtrans && !idbdb) {\n switch (dbOpenError && dbOpenError.name) {\n case \"DatabaseClosedError\":\n // Errors where it is no difference whether it was caused by the user operation or an earlier call to db.open()\n throw new exceptions.DatabaseClosed(dbOpenError);\n case \"MissingAPIError\":\n // Errors where it is no difference whether it was caused by the user operation or an earlier call to db.open()\n throw new exceptions.MissingAPI(dbOpenError.message, dbOpenError);\n default:\n // Make it clear that the user operation was not what caused the error - the error had occurred earlier on db.open()!\n throw new exceptions.OpenFailed(dbOpenError);\n }\n }\n if (!this.active) throw new exceptions.TransactionInactive();\n assert(this._completion._state === null);\n\n idbtrans = this.idbtrans = idbtrans || idbdb.transaction(safariMultiStoreFix(this.storeNames), this.mode);\n idbtrans.onerror = wrap(ev => {\n preventDefault(ev);// Prohibit default bubbling to window.error\n this._reject(idbtrans.error);\n });\n idbtrans.onabort = wrap(ev => {\n preventDefault(ev);\n this.active && this._reject(new exceptions.Abort(idbtrans.error));\n this.active = false;\n this.on(\"abort\").fire(ev);\n });\n idbtrans.oncomplete = wrap(() => {\n this.active = false;\n this._resolve();\n });\n return this;\n },\n _promise: function (mode, fn, bWriteLock) {\n\n if (mode === READWRITE && this.mode !== READWRITE)\n return rejection (new exceptions.ReadOnly(\"Transaction is readonly\"));\n\n if (!this.active)\n return rejection (new exceptions.TransactionInactive());\n\n if (this._locked()) {\n return new Promise((resolve, reject) => {\n this._blockedFuncs.push([() => {\n this._promise(mode, fn, bWriteLock).then(resolve, reject);\n }, PSD]);\n });\n\n } else if (bWriteLock) {\n return newScope(()=>{\n var p = new Promise((resolve, reject) => {\n this._lock();\n var rv = fn(resolve, reject, this);\n if (rv && rv.then) rv.then(resolve, reject);\n });\n p.finally(()=>this._unlock());\n p._lib = true;\n return p;\n });\n\n } else {\n var p = new Promise((resolve, reject) => {\n var rv = fn(resolve, reject, this);\n if (rv && rv.then) rv.then(resolve, reject);\n });\n p._lib = true;\n return p;\n }\n },\n\n _root: function () {\n return this.parent ? this.parent._root() : this;\n },\n\n waitFor (promise) {\n // Always operate on the root transaction (in case this is a sub stransaction)\n var root = this._root();\n // For stability reasons, convert parameter to promise no matter what type is passed to waitFor().\n // (We must be able to call .then() on it.)\n promise = Promise.resolve(promise);\n if (root._waitingFor) {\n // Already called waitFor(). Wait for both to complete.\n root._waitingFor = root._waitingFor.then(()=>promise);\n } else {\n // We're not in waiting state. Start waiting state.\n root._waitingFor = promise;\n root._waitingQueue = [];\n // Start interacting with indexedDB until promise completes:\n var store = root.idbtrans.objectStore(root.storeNames[0]);\n (function spin(){\n ++root._spinCount; // For debugging only\n while (root._waitingQueue.length) (root._waitingQueue.shift())();\n if (root._waitingFor) store.get(-Infinity).onsuccess = spin;\n }());\n }\n var currentWaitPromise = root._waitingFor;\n return new Promise ((resolve, reject) => {\n promise.then (\n res => root._waitingQueue.push(wrap(resolve.bind(null, res))),\n err => root._waitingQueue.push(wrap(reject.bind(null, err)))\n ).finally(() => {\n if (root._waitingFor === currentWaitPromise) {\n // No one added a wait after us. Safe to stop the spinning.\n root._waitingFor = null;\n }\n });\n });\n },\n\n //\n // Transaction Public Properties and Methods\n //\n abort: function () {\n this.active && this._reject(new exceptions.Abort());\n this.active = false;\n },\n\n tables: {\n get: Debug.deprecated (\"Transaction.tables\", ()=>allTables)\n },\n\n table: function (name) {\n var table = db.table(name); // Don't check that table is part of transaction. It must fail lazily!\n return new Table(name, table.schema, this);\n }\n });\n\n //\n //\n //\n // WhereClause\n //\n //\n //\n function WhereClause(table, index, orCollection) {\n /// <param name=\"table\" type=\"Table\"></param>\n /// <param name=\"index\" type=\"String\" optional=\"true\"></param>\n /// <param name=\"orCollection\" type=\"Collection\" optional=\"true\"></param>\n this._ctx = {\n table: table,\n index: index === \":id\" ? null : index,\n or: orCollection\n };\n }\n\n props(WhereClause.prototype, function () {\n\n // WhereClause private methods\n\n function fail(collectionOrWhereClause, err, T) {\n var collection = collectionOrWhereClause instanceof WhereClause ?\n new Collection (collectionOrWhereClause) :\n collectionOrWhereClause;\n \n collection._ctx.error = T ? new T(err) : new TypeError(err);\n return collection;\n }\n\n function emptyCollection(whereClause) {\n return new Collection (whereClause, function() { return IDBKeyRange.only(\"\"); }).limit(0);\n }\n\n function upperFactory(dir) {\n return dir === \"next\" ? function (s) { return s.toUpperCase(); } : function (s) { return s.toLowerCase(); };\n }\n function lowerFactory(dir) {\n return dir === \"next\" ? function (s) { return s.toLowerCase(); } : function (s) { return s.toUpperCase(); };\n }\n function nextCasing(key, lowerKey, upperNeedle, lowerNeedle, cmp, dir) {\n var length = Math.min(key.length, lowerNeedle.length);\n var llp = -1;\n for (var i = 0; i < length; ++i) {\n var lwrKeyChar = lowerKey[i];\n if (lwrKeyChar !== lowerNeedle[i]) {\n if (cmp(key[i], upperNeedle[i]) < 0) return key.substr(0, i) + upperNeedle[i] + upperNeedle.substr(i + 1);\n if (cmp(key[i], lowerNeedle[i]) < 0) return key.substr(0, i) + lowerNeedle[i] + upperNeedle.substr(i + 1);\n if (llp >= 0) return key.substr(0, llp) + lowerKey[llp] + upperNeedle.substr(llp + 1);\n return null;\n }\n if (cmp(key[i], lwrKeyChar) < 0) llp = i;\n }\n if (length < lowerNeedle.length && dir === \"next\") return key + upperNeedle.substr(key.length);\n if (length < key.length && dir === \"prev\") return key.substr(0, upperNeedle.length);\n return (llp < 0 ? null : key.substr(0, llp) + lowerNeedle[llp] + upperNeedle.substr(llp + 1));\n }\n\n function addIgnoreCaseAlgorithm(whereClause, match, needles, suffix) {\n /// <param name=\"needles\" type=\"Array\" elementType=\"String\"></param>\n var upper, lower, compare, upperNeedles, lowerNeedles, direction, nextKeySuffix,\n needlesLen = needles.length;\n if (!needles.every(s => typeof s === 'string')) {\n return fail(whereClause, STRING_EXPECTED);\n }\n function initDirection(dir) {\n upper = upperFactory(dir);\n lower = lowerFactory(dir);\n compare = (dir === \"next\" ? simpleCompare : simpleCompareReverse);\n var needleBounds = needles.map(function (needle){\n return {lower: lower(needle), upper: upper(needle)};\n }).sort(function(a,b) {\n return compare(a.lower, b.lower);\n });\n upperNeedles = needleBounds.map(function (nb){ return nb.upper; });\n lowerNeedles = needleBounds.map(function (nb){ return nb.lower; });\n direction = dir;\n nextKeySuffix = (dir === \"next\" ? \"\" : suffix);\n }\n initDirection(\"next\");\n\n var c = new Collection (whereClause, function() {\n return IDBKeyRange.bound(upperNeedles[0], lowerNeedles[needlesLen-1] + suffix);\n });\n\n c._ondirectionchange = function (direction) {\n // This event onlys occur before filter is called the first time.\n initDirection(direction);\n };\n\n var firstPossibleNeedle = 0;\n\n c._addAlgorithm(function (cursor, advance, resolve) {\n /// <param name=\"cursor\" type=\"IDBCursor\"></param>\n /// <param name=\"advance\" type=\"Function\"></param>\n /// <param name=\"resolve\" type=\"Function\"></param>\n var key = cursor.key;\n if (typeof key !== 'string') return false;\n var lowerKey = lower(key);\n if (match(lowerKey, lowerNeedles, firstPossibleNeedle)) {\n return true;\n } else {\n var lowestPossibleCasing = null;\n for (var i=firstPossibleNeedle; i<needlesLen; ++i) {\n var casing = nextCasing(key, lowerKey, upperNeedles[i], lowerNeedles[i], compare, direction);\n if (casing === null && lowestPossibleCasing === null)\n firstPossibleNeedle = i + 1;\n else if (lowestPossibleCasing === null || compare(lowestPossibleCasing, casing) > 0) {\n lowestPossibleCasing = casing;\n }\n }\n if (lowestPossibleCasing !== null) {\n advance(function () { cursor.continue(lowestPossibleCasing + nextKeySuffix); });\n } else {\n advance(resolve);\n }\n return false;\n }\n });\n return c;\n }\n\n //\n // WhereClause public methods\n //\n return {\n between: function (lower, upper, includeLower, includeUpper) {\n /// <summary>\n /// Filter out records whose where-field lays between given lower and upper values. Applies to Strings, Numbers and Dates.\n /// </summary>\n /// <param name=\"lower\"></param>\n /// <param name=\"upper\"></param>\n /// <param name=\"includeLower\" optional=\"true\">Whether items that equals lower should be included. Default true.</param>\n /// <param name=\"includeUpper\" optional=\"true\">Whether items that equals upper should be included. Default false.</param>\n /// <returns type=\"Collection\"></returns>\n includeLower = includeLower !== false; // Default to true\n includeUpper = includeUpper === true; // Default to false\n try {\n if ((cmp(lower, upper) > 0) ||\n (cmp(lower, upper) === 0 && (includeLower || includeUpper) && !(includeLower && includeUpper)))\n return emptyCollection(this); // Workaround for idiotic W3C Specification that DataError must be thrown if lower > upper. The natural result would be to return an empty collection.\n return new Collection (this, function() { return IDBKeyRange.bound(lower, upper, !includeLower, !includeUpper); });\n } catch (e) {\n return fail(this, INVALID_KEY_ARGUMENT);\n }\n },\n equals: function (value) {\n return new Collection (this, function() { return IDBKeyRange.only(value); });\n },\n above: function (value) {\n return new Collection (this, function() { return IDBKeyRange.lowerBound(value, true); });\n },\n aboveOrEqual: function (value) {\n return new Collection (this, function() { return IDBKeyRange.lowerBound(value); });\n },\n below: function (value) {\n return new Collection (this, function() { return IDBKeyRange.upperBound(value, true); });\n },\n belowOrEqual: function (value) {\n return new Collection (this, function() { return IDBKeyRange.upperBound(value); });\n },\n startsWith: function (str) {\n /// <param name=\"str\" type=\"String\"></param>\n if (typeof str !== 'string') return fail(this, STRING_EXPECTED);\n return this.between(str, str + maxString, true, true);\n },\n startsWithIgnoreCase: function (str) {\n /// <param name=\"str\" type=\"String\"></param>\n if (str === \"\") return this.startsWith(str);\n return addIgnoreCaseAlgorithm(this, function (x, a) { return x.indexOf(a[0]) === 0; }, [str], maxString);\n },\n equalsIgnoreCase: function (str) {\n /// <param name=\"str\" type=\"String\"></param>\n return addIgnoreCaseAlgorithm(this, function (x, a) { return x === a[0]; }, [str], \"\");\n },\n anyOfIgnoreCase: function () {\n var set = getArrayOf.apply(NO_CHAR_ARRAY, arguments);\n if (set.length === 0) return emptyCollection(this);\n return addIgnoreCaseAlgorithm(this, function (x, a) { return a.indexOf(x) !== -1; }, set, \"\");\n },\n startsWithAnyOfIgnoreCase: function () {\n var set = getArrayOf.apply(NO_CHAR_ARRAY, arguments);\n if (set.length === 0) return emptyCollection(this);\n return addIgnoreCaseAlgorithm(this, function (x, a) {\n return a.some(function(n){\n return x.indexOf(n) === 0;\n });}, set, maxString);\n },\n anyOf: function () {\n var set = getArrayOf.apply(NO_CHAR_ARRAY, arguments);\n var compare = ascending;\n try { set.sort(compare); } catch(e) { return fail(this, INVALID_KEY_ARGUMENT); }\n if (set.length === 0) return emptyCollection(this);\n var c = new Collection (this, function () { return IDBKeyRange.bound(set[0], set[set.length - 1]); });\n\n c._ondirectionchange = function (direction) {\n compare = (direction === \"next\" ? ascending : descending);\n set.sort(compare);\n };\n var i = 0;\n c._addAlgorithm(function (cursor, advance, resolve) {\n var key = cursor.key;\n while (compare(key, set[i]) > 0) {\n // The cursor has passed beyond this key. Check next.\n ++i;\n if (i === set.length) {\n // There is no next. Stop searching.\n advance(resolve);\n return false;\n }\n }\n if (compare(key, set[i]) === 0) {\n // The current cursor value should be included and we should continue a single step in case next item has the same key or possibly our next key in set.\n return true;\n } else {\n // cursor.key not yet at set[i]. Forward cursor to the next key to hunt for.\n advance(function () { cursor.continue(set[i]); });\n return false;\n }\n });\n return c;\n },\n\n notEqual: function(value) {\n return this.inAnyRange([[minKey, value],[value, maxKey]], {includeLowers: false, includeUppers: false});\n },\n\n noneOf: function() {\n var set = getArrayOf.apply(NO_CHAR_ARRAY, arguments);\n if (set.length === 0) return new Collection (this); // Return entire collection.\n try { set.sort(ascending); } catch(e) { return fail(this, INVALID_KEY_ARGUMENT);}\n // Transform [\"a\",\"b\",\"c\"] to a set of ranges for between/above/below: [[minKey,\"a\"], [\"a\",\"b\"], [\"b\",\"c\"], [\"c\",maxKey]]\n var ranges = set.reduce(function (res, val) { return res ? res.concat([[res[res.length - 1][1], val]]) : [[minKey, val]]; }, null);\n ranges.push([set[set.length - 1], maxKey]);\n return this.inAnyRange(ranges, {includeLowers: false, includeUppers: false});\n },\n\n /** Filter out values withing given set of ranges.\n * Example, give children and elders a rebate of 50%:\n *\n * db.friends.where('age').inAnyRange([[0,18],[65,Infinity]]).modify({Rebate: 1/2});\n *\n * @param {(string|number|Date|Array)[][]} ranges\n * @param {{includeLowers: boolean, includeUppers: boolean}} options\n */\n inAnyRange: function (ranges, options) {\n if (ranges.length === 0) return emptyCollection(this);\n if (!ranges.every(function (range) { return range[0] !== undefined && range[1] !== undefined && ascending(range[0], range[1]) <= 0;})) {\n return fail(this, \"First argument to inAnyRange() must be an Array of two-value Arrays [lower,upper] where upper must not be lower than lower\", exceptions.InvalidArgument);\n }\n var includeLowers = !options || options.includeLowers !== false; // Default to true\n var includeUppers = options && options.includeUppers === true; // Default to false\n\n function addRange (ranges, newRange) {\n for (var i=0,l=ranges.length;i<l;++i) {\n var range = ranges[i];\n if (cmp(newRange[0], range[1]) < 0 && cmp(newRange[1], range[0]) > 0) {\n range[0] = min(range[0], newRange[0]);\n range[1] = max(range[1], newRange[1]);\n break;\n }\n }\n if (i === l)\n ranges.push(newRange);\n return ranges;\n }\n\n var sortDirection = ascending;\n function rangeSorter(a,b) { return sortDirection(a[0], b[0]);}\n\n // Join overlapping ranges\n var set;\n try {\n set = ranges.reduce(addRange, []);\n set.sort(rangeSorter);\n } catch(ex) {\n return fail(this, INVALID_KEY_ARGUMENT);\n }\n\n var i = 0;\n var keyIsBeyondCurrentEntry = includeUppers ?\n function(key) { return ascending(key, set[i][1]) > 0; } :\n function(key) { return ascending(key, set[i][1]) >= 0; };\n\n var keyIsBeforeCurrentEntry = includeLowers ?\n function(key) { return descending(key, set[i][0]) > 0; } :\n function(key) { return descending(key, set[i][0]) >= 0; };\n\n function keyWithinCurrentRange (key) {\n return !keyIsBeyondCurrentEntry(key) && !keyIsBeforeCurrentEntry(key);\n }\n\n var checkKey = keyIsBeyondCurrentEntry;\n\n var c = new Collection (this, function () {\n return IDBKeyRange.bound(set[0][0], set[set.length - 1][1], !includeLowers, !includeUppers);\n });\n\n c._ondirectionchange = function (direction) {\n if (direction === \"next\") {\n checkKey = keyIsBeyondCurrentEntry;\n sortDirection = ascending;\n } else {\n checkKey = keyIsBeforeCurrentEntry;\n sortDirection = descending;\n }\n set.sort(rangeSorter);\n };\n\n c._addAlgorithm(function (cursor, advance, resolve) {\n var key = cursor.key;\n while (checkKey(key)) {\n // The cursor has passed beyond this key. Check next.\n ++i;\n if (i === set.length) {\n // There is no next. Stop searching.\n advance(resolve);\n return false;\n }\n }\n if (keyWithinCurrentRange(key)) {\n // The current cursor value should be included and we should continue a single step in case next item has the same key or possibly our next key in set.\n return true;\n } else if (cmp(key,set[i][1]) === 0 || cmp(key,set[i][0]) === 0) {\n // includeUpper or includeLower is false so keyWithinCurrentRange() returns false even though we are at range border.\n // Continue to next key but don't include this one.\n return false;\n } else {\n // cursor.key not yet at set[i]. Forward cursor to the next key to hunt for.\n advance(function() {\n if (sortDirection === ascending) cursor.continue(set[i][0]);\n else cursor.continue(set[i][1]);\n });\n return false;\n }\n });\n return c;\n },\n startsWithAnyOf: function () {\n var set = getArrayOf.apply(NO_CHAR_ARRAY, arguments);\n\n if (!set.every(function (s) { return typeof s === 'string'; })) {\n return fail(this, \"startsWithAnyOf() only works with strings\");\n }\n if (set.length === 0) return emptyCollection(this);\n\n return this.inAnyRange(set.map(function(str) {\n return [str, str + maxString];\n }));\n }\n };\n });\n\n\n\n\n //\n //\n //\n // Collection Class\n //\n //\n //\n function Collection(whereClause, keyRangeGenerator) {\n /// <summary>\n ///\n /// </summary>\n /// <param name=\"whereClause\" type=\"WhereClause\">Where clause instance</param>\n /// <param name=\"keyRangeGenerator\" value=\"function(){ return IDBKeyRange.bound(0,1);}\" optional=\"true\"></param>\n var keyRange = null, error = null;\n if (keyRangeGenerator) try {\n keyRange = keyRangeGenerator();\n } catch (ex) {\n error = ex;\n }\n\n var whereCtx = whereClause._ctx,\n table = whereCtx.table;\n this._ctx = {\n table: table,\n index: whereCtx.index,\n isPrimKey: (!whereCtx.index || (table.schema.primKey.keyPath && whereCtx.index === table.schema.primKey.name)),\n range: keyRange,\n keysOnly: false,\n dir: \"next\",\n unique: \"\",\n algorithm: null,\n filter: null,\n replayFilter: null,\n justLimit: true, // True if a replayFilter is just a filter that performs a \"limit\" operation (or none at all)\n isMatch: null,\n offset: 0,\n limit: Infinity,\n error: error, // If set, any promise must be rejected with this error\n or: whereCtx.or,\n valueMapper: table.hook.reading.fire\n };\n }\n \n function isPlainKeyRange (ctx, ignoreLimitFilter) {\n return !(ctx.filter || ctx.algorithm || ctx.or) &&\n (ignoreLimitFilter ? ctx.justLimit : !ctx.replayFilter);\n } \n\n props(Collection.prototype, function () {\n\n //\n // Collection Private Functions\n //\n\n function addFilter(ctx, fn) {\n ctx.filter = combine(ctx.filter, fn);\n }\n\n function addReplayFilter (ctx, factory, isLimitFilter) {\n var curr = ctx.replayFilter;\n ctx.replayFilter = curr ? ()=>combine(curr(), factory()) : factory;\n ctx.justLimit = isLimitFilter && !curr;\n }\n\n function addMatchFilter(ctx, fn) {\n ctx.isMatch = combine(ctx.isMatch, fn);\n }\n\n /** @param ctx {\n * isPrimKey: boolean,\n * table: Table,\n * index: string\n * }\n * @param store IDBObjectStore\n **/\n function getIndexOrStore(ctx, store) {\n if (ctx.isPrimKey) return store;\n var indexSpec = ctx.table.schema.idxByName[ctx.index];\n if (!indexSpec) throw new exceptions.Schema(\"KeyPath \" + ctx.index + \" on object store \" + store.name + \" is not indexed\");\n return store.index(indexSpec.name);\n }\n\n /** @param ctx {\n * isPrimKey: boolean,\n * table: Table,\n * index: string,\n * keysOnly: boolean,\n * range?: IDBKeyRange,\n * dir: \"next\" | \"prev\"\n * }\n */\n function openCursor(ctx, store) {\n var idxOrStore = getIndexOrStore(ctx, store);\n return ctx.keysOnly && 'openKeyCursor' in idxOrStore ?\n idxOrStore.openKeyCursor(ctx.range || null, ctx.dir + ctx.unique) :\n idxOrStore.openCursor(ctx.range || null, ctx.dir + ctx.unique);\n }\n\n function iter(ctx, fn, resolve, reject, idbstore) {\n var filter = ctx.replayFilter ? combine(ctx.filter, ctx.replayFilter()) : ctx.filter;\n if (!ctx.or) {\n iterate(openCursor(ctx, idbstore), combine(ctx.algorithm, filter), fn, resolve, reject, !ctx.keysOnly && ctx.valueMapper);\n } else (()=>{\n var set = {};\n var resolved = 0;\n\n function resolveboth() {\n if (++resolved === 2) resolve(); // Seems like we just support or btwn max 2 expressions, but there are no limit because we do recursion.\n }\n\n function union(item, cursor, advance) {\n if (!filter || filter(cursor, advance, resolveboth, reject)) {\n var primaryKey = cursor.primaryKey;\n var key = '' + primaryKey;\n if (key === '[object ArrayBuffer]') key = '' + new Uint8Array(primaryKey);\n if (!hasOwn(set, key)) {\n set[key] = true;\n fn(item, cursor, advance);\n }\n }\n }\n\n ctx.or._iterate(union, resolveboth, reject, idbstore);\n iterate(openCursor(ctx, idbstore), ctx.algorithm, union, resolveboth, reject, !ctx.keysOnly && ctx.valueMapper);\n })();\n }\n \n return {\n\n //\n // Collection Protected Functions\n //\n\n _read: function (fn, cb) {\n var ctx = this._ctx;\n return ctx.error ?\n ctx.table._trans(null, rejection.bind(null, ctx.error)) :\n ctx.table._idbstore(READONLY, fn).then(cb);\n },\n _write: function (fn) {\n var ctx = this._ctx;\n return ctx.error ?\n ctx.table._trans(null, rejection.bind(null, ctx.error)) :\n ctx.table._idbstore(READWRITE, fn, \"locked\"); // When doing write operations on collections, always lock the operation so that upcoming operations gets queued.\n },\n _addAlgorithm: function (fn) {\n var ctx = this._ctx;\n ctx.algorithm = combine(ctx.algorithm, fn);\n },\n\n _iterate: function (fn, resolve, reject, idbstore) {\n return iter(this._ctx, fn, resolve, reject, idbstore);\n },\n\n clone: function (props) {\n var rv = Object.create(this.constructor.prototype),\n ctx = Object.create(this._ctx);\n if (props) extend(ctx, props);\n rv._ctx = ctx;\n return rv;\n },\n\n raw: function () {\n this._ctx.valueMapper = null;\n return this;\n },\n\n //\n // Collection Public methods\n //\n\n each: function (fn) {\n var ctx = this._ctx;\n\n return this._read(function (resolve, reject, idbstore) {\n iter(ctx, fn, resolve, reject, idbstore);\n });\n },\n\n count: function (cb) {\n var ctx = this._ctx;\n\n if (isPlainKeyRange(ctx, true)) {\n // This is a plain key range. We can use the count() method if the index.\n return this._read(function (resolve, reject, idbstore) {\n var idx = getIndexOrStore(ctx, idbstore);\n var req = (ctx.range ? idx.count(ctx.range) : idx.count());\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = function (e) {\n resolve(Math.min(e.target.result, ctx.limit));\n };\n }, cb);\n } else {\n // Algorithms, filters or expressions are applied. Need to count manually.\n var count = 0;\n return this._read(function (resolve, reject, idbstore) {\n iter(ctx, function () { ++count; return false; }, function () { resolve(count); }, reject, idbstore);\n }, cb);\n }\n },\n\n sortBy: function (keyPath, cb) {\n /// <param name=\"keyPath\" type=\"String\"></param>\n var parts = keyPath.split('.').reverse(),\n lastPart = parts[0],\n lastIndex = parts.length - 1;\n function getval(obj, i) {\n if (i) return getval(obj[parts[i]], i - 1);\n return obj[lastPart];\n }\n var order = this._ctx.dir === \"next\" ? 1 : -1;\n\n function sorter(a, b) {\n var aVal = getval(a, lastIndex),\n bVal = getval(b, lastIndex);\n return aVal < bVal ? -order : aVal > bVal ? order : 0;\n }\n return this.toArray(function (a) {\n return a.sort(sorter);\n }).then(cb);\n },\n\n toArray: function (cb) {\n var ctx = this._ctx;\n return this._read(function (resolve, reject, idbstore) {\n if (hasGetAll && ctx.dir === 'next' && isPlainKeyRange(ctx, true) && ctx.limit > 0) {\n // Special optimation if we could use IDBObjectStore.getAll() or\n // IDBKeyRange.getAll():\n var readingHook = ctx.table.hook.reading.fire;\n var idxOrStore = getIndexOrStore(ctx, idbstore);\n var req = ctx.limit < Infinity ?\n idxOrStore.getAll(ctx.range, ctx.limit) :\n idxOrStore.getAll(ctx.range);\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = readingHook === mirror ?\n eventSuccessHandler(resolve) :\n eventSuccessHandler(res => {\n try {resolve (res.map(readingHook));} catch(e) {reject(e);}\n });\n } else {\n // Getting array through a cursor.\n var a = [];\n iter(ctx, function (item) { a.push(item); }, function arrayComplete() {\n resolve(a);\n }, reject, idbstore);\n }\n }, cb);\n },\n\n offset: function (offset) {\n var ctx = this._ctx;\n if (offset <= 0) return this;\n ctx.offset += offset; // For count()\n if (isPlainKeyRange(ctx)) {\n addReplayFilter(ctx, ()=> {\n var offsetLeft = offset;\n return (cursor, advance) => {\n if (offsetLeft === 0) return true;\n if (offsetLeft === 1) { --offsetLeft; return false; }\n advance(()=> {\n cursor.advance(offsetLeft);\n offsetLeft = 0;\n });\n return false;\n };\n });\n } else {\n addReplayFilter(ctx, ()=> {\n var offsetLeft = offset;\n return () => (--offsetLeft < 0);\n });\n }\n return this;\n },\n\n limit: function (numRows) {\n this._ctx.limit = Math.min(this._ctx.limit, numRows); // For count()\n addReplayFilter(this._ctx, ()=> {\n var rowsLeft = numRows;\n return function (cursor, advance, resolve) {\n if (--rowsLeft <= 0) advance(resolve); // Stop after this item has been included\n return rowsLeft >= 0; // If numRows is already below 0, return false because then 0 was passed to numRows initially. Otherwise we wouldnt come here.\n };\n }, true);\n return this;\n },\n\n until: function (filterFunction, bIncludeStopEntry) {\n addFilter(this._ctx, function (cursor, advance, resolve) {\n if (filterFunction(cursor.value)) {\n advance(resolve);\n return bIncludeStopEntry;\n } else {\n return true;\n }\n });\n return this;\n },\n\n first: function (cb) {\n return this.limit(1).toArray(function (a) { return a[0]; }).then(cb);\n },\n\n last: function (cb) {\n return this.reverse().first(cb);\n },\n\n filter: function (filterFunction) {\n /// <param name=\"jsFunctionFilter\" type=\"Function\">function(val){return true/false}</param>\n addFilter(this._ctx, function (cursor) {\n return filterFunction(cursor.value);\n });\n // match filters not used in Dexie.js but can be used by 3rd part libraries to test a\n // collection for a match without querying DB. Used by Dexie.Observable.\n addMatchFilter(this._ctx, filterFunction); \n return this;\n },\n \n and: function (filterFunction) {\n return this.filter(filterFunction);\n },\n\n or: function (indexName) {\n return new WhereClause(this._ctx.table, indexName, this);\n },\n\n reverse: function () {\n this._ctx.dir = (this._ctx.dir === \"prev\" ? \"next\" : \"prev\");\n if (this._ondirectionchange) this._ondirectionchange(this._ctx.dir);\n return this;\n },\n\n desc: function () {\n return this.reverse();\n },\n\n eachKey: function (cb) {\n var ctx = this._ctx;\n ctx.keysOnly = !ctx.isMatch;\n return this.each(function (val, cursor) { cb(cursor.key, cursor); });\n },\n\n eachUniqueKey: function (cb) {\n this._ctx.unique = \"unique\";\n return this.eachKey(cb);\n },\n \n eachPrimaryKey: function (cb) {\n var ctx = this._ctx;\n ctx.keysOnly = !ctx.isMatch;\n return this.each(function (val, cursor) { cb(cursor.primaryKey, cursor); });\n },\n\n keys: function (cb) {\n var ctx = this._ctx;\n ctx.keysOnly = !ctx.isMatch;\n var a = [];\n return this.each(function (item, cursor) {\n a.push(cursor.key);\n }).then(function () {\n return a;\n }).then(cb);\n },\n \n primaryKeys: function (cb) {\n var ctx = this._ctx;\n if (hasGetAll && ctx.dir === 'next' && isPlainKeyRange(ctx, true) && ctx.limit > 0) {\n // Special optimation if we could use IDBObjectStore.getAllKeys() or\n // IDBKeyRange.getAllKeys():\n return this._read((resolve, reject, idbstore) =>{\n var idxOrStore = getIndexOrStore(ctx, idbstore);\n var req = ctx.limit < Infinity ?\n idxOrStore.getAllKeys(ctx.range, ctx.limit) :\n idxOrStore.getAllKeys(ctx.range);\n req.onerror = eventRejectHandler(reject);\n req.onsuccess = eventSuccessHandler(resolve);\n }).then(cb);\n }\n ctx.keysOnly = !ctx.isMatch;\n var a = [];\n return this.each(function (item, cursor) {\n a.push(cursor.primaryKey);\n }).then(function () {\n return a;\n }).then(cb);\n },\n\n uniqueKeys: function (cb) {\n this._ctx.unique = \"unique\";\n return this.keys(cb);\n },\n\n firstKey: function (cb) {\n return this.limit(1).keys(function (a) { return a[0]; }).then(cb);\n },\n\n lastKey: function (cb) {\n return this.reverse().firstKey(cb);\n },\n\n distinct: function () {\n var ctx = this._ctx,\n idx = ctx.index && ctx.table.schema.idxByName[ctx.index];\n if (!idx || !idx.multi) return this; // distinct() only makes differencies on multiEntry indexes.\n var set = {};\n addFilter(this._ctx, function (cursor) {\n var strKey = cursor.primaryKey.toString(); // Converts any Date to String, String to String, Number to String and Array to comma-separated string\n var found = hasOwn(set, strKey);\n set[strKey] = true;\n return !found;\n });\n return this;\n },\n\n //\n // Methods that mutate storage\n //\n\n modify: function (changes) {\n var self = this,\n ctx = this._ctx,\n hook = ctx.table.hook,\n updatingHook = hook.updating.fire,\n deletingHook = hook.deleting.fire;\n\n return this._write(function (resolve, reject, idbstore, trans) {\n var modifyer;\n if (typeof changes === 'function') {\n // Changes is a function that may update, add or delete propterties or even require a deletion the object itself (delete this.item)\n if (updatingHook === nop && deletingHook === nop) {\n // Noone cares about what is being changed. Just let the modifier function be the given argument as is.\n modifyer = changes;\n } else {\n // People want to know exactly what is being modified or deleted.\n // Let modifyer be a proxy function that finds out what changes the caller is actually doing\n // and call the hooks accordingly!\n modifyer = function (item) {\n var origItem = deepClone(item); // Clone the item first so we can compare laters.\n if (changes.call(this, item, this) === false) return false; // Call the real modifyer function (If it returns false explicitely, it means it dont want to modify anyting on this object)\n if (!hasOwn(this, \"value\")) {\n // The real modifyer function requests a deletion of the object. Inform the deletingHook that a deletion is taking place.\n deletingHook.call(this, this.primKey, item, trans);\n } else {\n // No deletion. Check what was changed\n var objectDiff = getObjectDiff(origItem, this.value);\n var additionalChanges = updatingHook.call(this, objectDiff, this.primKey, origItem, trans);\n if (additionalChanges) {\n // Hook want to apply additional modifications. Make sure to fullfill the will of the hook.\n item = this.value;\n keys(additionalChanges).forEach(function (keyPath) {\n setByKeyPath(item, keyPath, additionalChanges[keyPath]); // Adding {keyPath: undefined} means that the keyPath should be deleted. Handled by setByKeyPath\n });\n }\n }\n };\n }\n } else if (updatingHook === nop) {\n // changes is a set of {keyPath: value} and no one is listening to the updating hook.\n var keyPaths = keys(changes);\n var numKeys = keyPaths.length;\n modifyer = function (item) {\n var anythingModified = false;\n for (var i = 0; i < numKeys; ++i) {\n var keyPath = keyPaths[i], val = changes[keyPath];\n if (getByKeyPath(item, keyPath) !== val) {\n setByKeyPath(item, keyPath, val); // Adding {keyPath: undefined} means that the keyPath should be deleted. Handled by setByKeyPath\n anythingModified = true;\n }\n }\n return anythingModified;\n };\n } else {\n // changes is a set of {keyPath: value} and people are listening to the updating hook so we need to call it and\n // allow it to add additional modifications to make.\n var origChanges = changes;\n changes = shallowClone(origChanges); // Let's work with a clone of the changes keyPath/value set so that we can restore it in case a hook extends it.\n modifyer = function (item) {\n var anythingModified = false;\n var additionalChanges = updatingHook.call(this, changes, this.primKey, deepClone(item), trans);\n if (additionalChanges) extend(changes, additionalChanges);\n keys(changes).forEach(function (keyPath) {\n var val = changes[keyPath];\n if (getByKeyPath(item, keyPath) !== val) {\n setByKeyPath(item, keyPath, val);\n anythingModified = true;\n }\n });\n if (additionalChanges) changes = shallowClone(origChanges); // Restore original changes for next iteration\n return anythingModified;\n };\n }\n\n var count = 0;\n var successCount = 0;\n var iterationComplete = false;\n var failures = [];\n var failKeys = [];\n var currentKey = null;\n\n function modifyItem(item, cursor) {\n currentKey = cursor.primaryKey;\n var thisContext = {\n primKey: cursor.primaryKey,\n value: item,\n onsuccess: null,\n onerror: null\n };\n\n function onerror(e) {\n failures.push(e);\n failKeys.push(thisContext.primKey);\n checkFinished();\n return true; // Catch these errors and let a final rejection decide whether or not to abort entire transaction\n }\n\n if (modifyer.call(thisContext, item, thisContext) !== false) { // If a callback explicitely returns false, do not perform the update!\n var bDelete = !hasOwn(thisContext, \"value\");\n ++count;\n tryCatch(function () {\n var req = (bDelete ? cursor.delete() : cursor.update(thisContext.value));\n req._hookCtx = thisContext;\n req.onerror = hookedEventRejectHandler(onerror);\n req.onsuccess = hookedEventSuccessHandler(function () {\n ++successCount;\n checkFinished();\n });\n }, onerror);\n } else if (thisContext.onsuccess) {\n // Hook will expect either onerror or onsuccess to always be called!\n thisContext.onsuccess(thisContext.value);\n }\n }\n\n function doReject(e) {\n if (e) {\n failures.push(e);\n failKeys.push(currentKey);\n }\n return reject(new ModifyError(\"Error modifying one or more objects\", failures, successCount, failKeys));\n }\n\n function checkFinished() {\n if (iterationComplete && successCount + failures.length === count) {\n if (failures.length > 0)\n doReject();\n else\n resolve(successCount);\n }\n }\n self.clone().raw()._iterate(modifyItem, function () {\n iterationComplete = true;\n checkFinished();\n }, doReject, idbstore);\n });\n },\n\n 'delete': function () {\n var ctx = this._ctx,\n range = ctx.range,\n deletingHook = ctx.table.hook.deleting.fire,\n hasDeleteHook = deletingHook !== nop;\n if (!hasDeleteHook &&\n isPlainKeyRange(ctx) &&\n ((ctx.isPrimKey && !hangsOnDeleteLargeKeyRange) || !range)) // if no range, we'll use clear().\n {\n // May use IDBObjectStore.delete(IDBKeyRange) in this case (Issue #208)\n // For chromium, this is the way most optimized version.\n // For IE/Edge, this could hang the indexedDB engine and make operating system instable\n // (https://gist.github.com/dfahlander/5a39328f029de18222cf2125d56c38f7)\n return this._write((resolve, reject, idbstore) => {\n // Our API contract is to return a count of deleted items, so we have to count() before delete().\n var onerror = eventRejectHandler(reject),\n countReq = (range ? idbstore.count(range) : idbstore.count());\n countReq.onerror = onerror;\n countReq.onsuccess = () => {\n var count = countReq.result;\n tryCatch(()=> {\n var delReq = (range ? idbstore.delete(range) : idbstore.clear());\n delReq.onerror = onerror;\n delReq.onsuccess = () => resolve(count);\n }, err => reject(err));\n };\n });\n }\n\n // Default version to use when collection is not a vanilla IDBKeyRange on the primary key.\n // Divide into chunks to not starve RAM.\n // If has delete hook, we will have to collect not just keys but also objects, so it will use\n // more memory and need lower chunk size.\n const CHUNKSIZE = hasDeleteHook ? 2000 : 10000;\n\n return this._write((resolve, reject, idbstore, trans) => {\n var totalCount = 0;\n // Clone collection and change its table and set a limit of CHUNKSIZE on the cloned Collection instance.\n var collection = this\n .clone({\n keysOnly: !ctx.isMatch && !hasDeleteHook}) // load just keys (unless filter() or and() or deleteHook has subscribers)\n .distinct() // In case multiEntry is used, never delete same key twice because resulting count\n // would become larger than actual delete count.\n .limit(CHUNKSIZE)\n .raw(); // Don't filter through reading-hooks (like mapped classes etc)\n\n var keysOrTuples = [];\n\n // We're gonna do things on as many chunks that are needed.\n // Use recursion of nextChunk function:\n const nextChunk = () => collection.each(hasDeleteHook ? (val, cursor) => {\n // Somebody subscribes to hook('deleting'). Collect all primary keys and their values,\n // so that the hook can be called with its values in bulkDelete().\n keysOrTuples.push([cursor.primaryKey, cursor.value]);\n } : (val, cursor) => {\n // No one subscribes to hook('deleting'). Collect only primary keys:\n keysOrTuples.push(cursor.primaryKey);\n }).then(() => {\n // Chromium deletes faster when doing it in sort order.\n hasDeleteHook ?\n keysOrTuples.sort((a, b)=>ascending(a[0], b[0])) :\n keysOrTuples.sort(ascending);\n return bulkDelete(idbstore, trans, keysOrTuples, hasDeleteHook, deletingHook);\n\n }).then(()=> {\n var count = keysOrTuples.length;\n totalCount += count;\n keysOrTuples = [];\n return count < CHUNKSIZE ? totalCount : nextChunk();\n });\n\n resolve (nextChunk());\n });\n }\n };\n });\n\n\n //\n //\n //\n // ------------------------- Help functions ---------------------------\n //\n //\n //\n\n function lowerVersionFirst(a, b) {\n return a._cfg.version - b._cfg.version;\n }\n\n function setApiOnPlace(objs, tableNames, dbschema) {\n tableNames.forEach(function (tableName) {\n var schema = dbschema[tableName];\n objs.forEach(obj => {\n if (!(tableName in obj)) {\n if (obj === Transaction.prototype || obj instanceof Transaction) {\n // obj is a Transaction prototype (or prototype of a subclass to Transaction)\n // Make the API a getter that returns this.table(tableName)\n setProp(obj, tableName, {get() { return this.table(tableName); }});\n } else {\n // Table will not be bound to a transaction (will use Dexie.currentTransaction)\n obj[tableName] = new Table(tableName, schema);\n }\n }\n });\n });\n }\n\n function removeTablesApi(objs) {\n objs.forEach(function (obj) {\n for (var key in obj) {\n if (obj[key] instanceof Table) delete obj[key];\n }\n });\n }\n\n function iterate(req, filter, fn, resolve, reject, valueMapper) {\n \n // Apply valueMapper (hook('reading') or mappped class)\n var mappedFn = valueMapper ? (x,c,a) => fn(valueMapper(x),c,a) : fn;\n // Wrap fn with PSD and microtick stuff from Promise.\n var wrappedFn = wrap(mappedFn, reject);\n \n if (!req.onerror) req.onerror = eventRejectHandler(reject);\n if (filter) {\n req.onsuccess = trycatcher(function filter_record() {\n var cursor = req.result;\n if (cursor) {\n var c = function () { cursor.continue(); };\n if (filter(cursor, function (advancer) { c = advancer; }, resolve, reject))\n wrappedFn(cursor.value, cursor, function (advancer) { c = advancer; });\n c();\n } else {\n resolve();\n }\n }, reject);\n } else {\n req.onsuccess = trycatcher(function filter_record() {\n var cursor = req.result;\n if (cursor) {\n var c = function () { cursor.continue(); };\n wrappedFn(cursor.value, cursor, function (advancer) { c = advancer; });\n c();\n } else {\n resolve();\n }\n }, reject);\n }\n }\n\n function parseIndexSyntax(indexes) {\n /// <param name=\"indexes\" type=\"String\"></param>\n /// <returns type=\"Array\" elementType=\"IndexSpec\"></returns>\n var rv = [];\n indexes.split(',').forEach(function (index) {\n index = index.trim();\n var name = index.replace(/([&*]|\\+\\+)/g, \"\"); // Remove \"&\", \"++\" and \"*\"\n // Let keyPath of \"[a+b]\" be [\"a\",\"b\"]:\n var keyPath = /^\\[/.test(name) ? name.match(/^\\[(.*)\\]$/)[1].split('+') : name;\n\n rv.push(new IndexSpec(\n name,\n keyPath || null,\n /\\&/.test(index),\n /\\*/.test(index),\n /\\+\\+/.test(index),\n isArray(keyPath),\n /\\./.test(index)\n ));\n });\n return rv;\n }\n\n function cmp(key1, key2) {\n return indexedDB.cmp(key1, key2);\n }\n\n function min(a, b) {\n return cmp(a, b) < 0 ? a : b;\n }\n\n function max(a, b) {\n return cmp(a, b) > 0 ? a : b;\n }\n\n function ascending(a,b) {\n return indexedDB.cmp(a,b);\n }\n\n function descending(a, b) {\n return indexedDB.cmp(b,a);\n }\n\n function simpleCompare(a, b) {\n return a < b ? -1 : a === b ? 0 : 1;\n }\n\n function simpleCompareReverse(a, b) {\n return a > b ? -1 : a === b ? 0 : 1;\n }\n\n function combine(filter1, filter2) {\n return filter1 ?\n filter2 ?\n function () { return filter1.apply(this, arguments) && filter2.apply(this, arguments); } :\n filter1 :\n filter2;\n }\n\n function readGlobalSchema() {\n db.verno = idbdb.version / 10;\n db._dbSchema = globalSchema = {};\n dbStoreNames = slice(idbdb.objectStoreNames, 0);\n if (dbStoreNames.length === 0) return; // Database contains no stores.\n var trans = idbdb.transaction(safariMultiStoreFix(dbStoreNames), 'readonly');\n dbStoreNames.forEach(function (storeName) {\n var store = trans.objectStore(storeName),\n keyPath = store.keyPath,\n dotted = keyPath && typeof keyPath === 'string' && keyPath.indexOf('.') !== -1;\n var primKey = new IndexSpec(keyPath, keyPath || \"\", false, false, !!store.autoIncrement, keyPath && typeof keyPath !== 'string', dotted);\n var indexes = [];\n for (var j = 0; j < store.indexNames.length; ++j) {\n var idbindex = store.index(store.indexNames[j]);\n keyPath = idbindex.keyPath;\n dotted = keyPath && typeof keyPath === 'string' && keyPath.indexOf('.') !== -1;\n var index = new IndexSpec(idbindex.name, keyPath, !!idbindex.unique, !!idbindex.multiEntry, false, keyPath && typeof keyPath !== 'string', dotted);\n indexes.push(index);\n }\n globalSchema[storeName] = new TableSchema(storeName, primKey, indexes, {});\n });\n setApiOnPlace([allTables], keys(globalSchema), globalSchema);\n }\n\n function adjustToExistingIndexNames(schema, idbtrans) {\n /// <summary>\n /// Issue #30 Problem with existing db - adjust to existing index names when migrating from non-dexie db\n /// </summary>\n /// <param name=\"schema\" type=\"Object\">Map between name and TableSchema</param>\n /// <param name=\"idbtrans\" type=\"IDBTransaction\"></param>\n var storeNames = idbtrans.db.objectStoreNames;\n\n for (var i = 0; i < storeNames.length; ++i) {\n var storeName = storeNames[i];\n var store = idbtrans.objectStore(storeName);\n hasGetAll = 'getAll' in store;\n \n for (var j = 0; j < store.indexNames.length; ++j) {\n var indexName = store.indexNames[j];\n var keyPath = store.index(indexName).keyPath;\n var dexieName = typeof keyPath === 'string' ? keyPath : \"[\" + slice(keyPath).join('+') + \"]\";\n if (schema[storeName]) {\n var indexSpec = schema[storeName].idxByName[dexieName];\n if (indexSpec) indexSpec.name = indexName;\n }\n }\n }\n\n // Bug with getAll() on Safari ver<604 on Workers only, see discussion following PR #579\n if (/Safari/.test(navigator.userAgent) &&\n !/(Chrome\\/|Edge\\/)/.test(navigator.userAgent) &&\n _global.WorkerGlobalScope && _global instanceof _global.WorkerGlobalScope &&\n [].concat(navigator.userAgent.match(/Safari\\/(\\d*)/))[1] < 604)\n {\n hasGetAll = false;\n } \n }\n\n function fireOnBlocked(ev) {\n db.on(\"blocked\").fire(ev);\n // Workaround (not fully*) for missing \"versionchange\" event in IE,Edge and Safari:\n connections\n .filter(c=>c.name === db.name && c !== db && !c._vcFired)\n .map(c => c.on(\"versionchange\").fire(ev));\n }\n\n extend(this, {\n Collection: Collection,\n Table: Table,\n Transaction: Transaction,\n Version: Version,\n WhereClause: WhereClause\n });\n\n init();\n\n addons.forEach(function (fn) {\n fn(db);\n });\n}\n\nfunction parseType(type) {\n if (typeof type === 'function') {\n return new type();\n } else if (isArray(type)) {\n return [parseType(type[0])];\n } else if (type && typeof type === 'object') {\n var rv = {};\n applyStructure(rv, type);\n return rv;\n } else {\n return type;\n }\n}\n\nfunction applyStructure(obj, structure) {\n keys(structure).forEach(function (member) {\n var value = parseType(structure[member]);\n obj[member] = value;\n });\n return obj;\n}\n\nfunction hookedEventSuccessHandler(resolve) {\n // wrap() is needed when calling hooks because the rare scenario of:\n // * hook does a db operation that fails immediately (IDB throws exception)\n // For calling db operations on correct transaction, wrap makes sure to set PSD correctly.\n // wrap() will also execute in a virtual tick.\n // * If not wrapped in a virtual tick, direct exception will launch a new physical tick.\n // * If this was the last event in the bulk, the promise will resolve after a physical tick\n // and the transaction will have committed already.\n // If no hook, the virtual tick will be executed in the reject()/resolve of the final promise,\n // because it is always marked with _lib = true when created using Transaction._promise().\n return wrap(function(event) {\n var req = event.target,\n ctx = req._hookCtx,// Contains the hook error handler. Put here instead of closure to boost performance.\n result = ctx.value || req.result, // Pass the object value on updates. The result from IDB is the primary key.\n hookSuccessHandler = ctx && ctx.onsuccess;\n hookSuccessHandler && hookSuccessHandler(result);\n resolve && resolve(result);\n }, resolve);\n}\n\nfunction eventRejectHandler(reject) {\n return wrap(function (event) {\n preventDefault(event);\n reject (event.target.error);\n return false;\n });\n}\n\nfunction eventSuccessHandler (resolve) {\n return wrap(function (event){\n resolve(event.target.result);\n });\n}\n\nfunction hookedEventRejectHandler (reject) {\n return wrap(function (event) {\n // See comment on hookedEventSuccessHandler() why wrap() is needed only when supporting hooks.\n \n var req = event.target,\n err = req.error,\n ctx = req._hookCtx,// Contains the hook error handler. Put here instead of closure to boost performance.\n hookErrorHandler = ctx && ctx.onerror;\n hookErrorHandler && hookErrorHandler(err);\n preventDefault(event);\n reject (err);\n return false;\n });\n}\n\nfunction preventDefault(event) {\n if (event.stopPropagation) // IndexedDBShim doesnt support this on Safari 8 and below.\n event.stopPropagation();\n if (event.preventDefault) // IndexedDBShim doesnt support this on Safari 8 and below.\n event.preventDefault();\n}\n\nfunction awaitIterator (iterator) {\n var callNext = result => iterator.next(result),\n doThrow = error => iterator.throw(error),\n onSuccess = step(callNext),\n onError = step(doThrow);\n\n function step(getNext) {\n return val => {\n var next = getNext(val),\n value = next.value;\n\n return next.done ? value :\n (!value || typeof value.then !== 'function' ?\n isArray(value) ? Promise.all(value).then(onSuccess, onError) : onSuccess(value) :\n value.then(onSuccess, onError));\n };\n }\n\n return step(callNext)();\n}\n\n//\n// IndexSpec struct\n//\nfunction IndexSpec(name, keyPath, unique, multi, auto, compound, dotted) {\n /// <param name=\"name\" type=\"String\"></param>\n /// <param name=\"keyPath\" type=\"String\"></param>\n /// <param name=\"unique\" type=\"Boolean\"></param>\n /// <param name=\"multi\" type=\"Boolean\"></param>\n /// <param name=\"auto\" type=\"Boolean\"></param>\n /// <param name=\"compound\" type=\"Boolean\"></param>\n /// <param name=\"dotted\" type=\"Boolean\"></param>\n this.name = name;\n this.keyPath = keyPath;\n this.unique = unique;\n this.multi = multi;\n this.auto = auto;\n this.compound = compound;\n this.dotted = dotted;\n var keyPathSrc = typeof keyPath === 'string' ? keyPath : keyPath && ('[' + [].join.call(keyPath, '+') + ']');\n this.src = (unique ? '&' : '') + (multi ? '*' : '') + (auto ? \"++\" : \"\") + keyPathSrc;\n}\n\n//\n// TableSchema struct\n//\nfunction TableSchema(name, primKey, indexes, instanceTemplate) {\n /// <param name=\"name\" type=\"String\"></param>\n /// <param name=\"primKey\" type=\"IndexSpec\"></param>\n /// <param name=\"indexes\" type=\"Array\" elementType=\"IndexSpec\"></param>\n /// <param name=\"instanceTemplate\" type=\"Object\"></param>\n this.name = name;\n this.primKey = primKey || new IndexSpec();\n this.indexes = indexes || [new IndexSpec()];\n this.instanceTemplate = instanceTemplate;\n this.mappedClass = null;\n this.idxByName = arrayToObject(indexes, index => [index.name, index]);\n}\n\nfunction safariMultiStoreFix(storeNames) {\n return storeNames.length === 1 ? storeNames[0] : storeNames;\n}\n\nfunction getNativeGetDatabaseNamesFn(indexedDB) {\n var fn = indexedDB && (indexedDB.getDatabaseNames || indexedDB.webkitGetDatabaseNames);\n return fn && fn.bind(indexedDB);\n}\n\n// Export Error classes\nprops(Dexie, fullNameExceptions); // Dexie.XXXError = class XXXError {...};\n\n//\n// Static methods and properties\n// \nprops(Dexie, {\n \n //\n // Static delete() method.\n //\n delete: function (databaseName) {\n var db = new Dexie(databaseName),\n promise = db.delete();\n promise.onblocked = function (fn) {\n db.on(\"blocked\", fn);\n return this;\n };\n return promise;\n },\n \n //\n // Static exists() method.\n //\n exists: function(name) {\n return new Dexie(name).open().then(db=>{\n db.close();\n return true;\n }).catch(Dexie.NoSuchDatabaseError, () => false);\n },\n \n //\n // Static method for retrieving a list of all existing databases at current host.\n //\n getDatabaseNames: function (cb) {\n var getDatabaseNames = getNativeGetDatabaseNamesFn(Dexie.dependencies.indexedDB);\n return getDatabaseNames ? new Promise((resolve, reject) => {\n var req = getDatabaseNames();\n req.onsuccess = function (event) {\n resolve(slice(event.target.result, 0)); // Converst DOMStringList to Array<String>\n };\n req.onerror = eventRejectHandler(reject);\n }).then(cb) : dbNamesDB.dbnames.toCollection().primaryKeys(cb);\n },\n \n defineClass: function () {\n // Default constructor able to copy given properties into this object.\n function Class(properties) {\n /// <param name=\"properties\" type=\"Object\" optional=\"true\">Properties to initialize object with.\n /// </param>\n if (properties) extend(this, properties);\n }\n return Class;\n },\n \n applyStructure: applyStructure,\n \n ignoreTransaction: function (scopeFunc) {\n // In case caller is within a transaction but needs to create a separate transaction.\n // Example of usage:\n //\n // Let's say we have a logger function in our app. Other application-logic should be unaware of the\n // logger function and not need to include the 'logentries' table in all transaction it performs.\n // The logging should always be done in a separate transaction and not be dependant on the current\n // running transaction context. Then you could use Dexie.ignoreTransaction() to run code that starts a new transaction.\n //\n // Dexie.ignoreTransaction(function() {\n // db.logentries.add(newLogEntry);\n // });\n //\n // Unless using Dexie.ignoreTransaction(), the above example would try to reuse the current transaction\n // in current Promise-scope.\n //\n // An alternative to Dexie.ignoreTransaction() would be setImmediate() or setTimeout(). The reason we still provide an\n // API for this because\n // 1) The intention of writing the statement could be unclear if using setImmediate() or setTimeout().\n // 2) setTimeout() would wait unnescessary until firing. This is however not the case with setImmediate().\n // 3) setImmediate() is not supported in the ES standard.\n // 4) You might want to keep other PSD state that was set in a parent PSD, such as PSD.letThrough.\n return PSD.trans ?\n usePSD(PSD.transless, scopeFunc) : // Use the closest parent that was non-transactional.\n scopeFunc(); // No need to change scope because there is no ongoing transaction.\n },\n \n vip: function (fn) {\n // To be used by subscribers to the on('ready') event.\n // This will let caller through to access DB even when it is blocked while the db.ready() subscribers are firing.\n // This would have worked automatically if we were certain that the Provider was using Dexie.Promise for all asyncronic operations. The promise PSD\n // from the provider.connect() call would then be derived all the way to when provider would call localDatabase.applyChanges(). But since\n // the provider more likely is using non-promise async APIs or other thenable implementations, we cannot assume that.\n // Note that this method is only useful for on('ready') subscribers that is returning a Promise from the event. If not using vip()\n // the database could deadlock since it wont open until the returned Promise is resolved, and any non-VIPed operation started by\n // the caller will not resolve until database is opened.\n return newScope(function () {\n PSD.letThrough = true; // Make sure we are let through if still blocking db due to onready is firing.\n return fn();\n });\n },\n\n async: function (generatorFn) {\n return function () {\n try {\n var rv = awaitIterator(generatorFn.apply(this, arguments));\n if (!rv || typeof rv.then !== 'function')\n return Promise.resolve(rv);\n return rv;\n } catch (e) {\n return rejection (e);\n }\n };\n },\n\n spawn: function (generatorFn, args, thiz) {\n try {\n var rv = awaitIterator(generatorFn.apply(thiz, args || []));\n if (!rv || typeof rv.then !== 'function')\n return Promise.resolve(rv);\n return rv;\n } catch (e) {\n return rejection(e);\n }\n },\n \n // Dexie.currentTransaction property\n currentTransaction: {\n get: () => PSD.trans || null\n },\n\n waitFor: function (promiseOrFunction, optionalTimeout) {\n // If a function is provided, invoke it and pass the returning value to Transaction.waitFor()\n var promise = Promise.resolve(\n typeof promiseOrFunction === 'function' ? Dexie.ignoreTransaction(promiseOrFunction) : promiseOrFunction)\n .timeout(optionalTimeout || 60000); // Default the timeout to one minute. Caller may specify Infinity if required. \n\n // Run given promise on current transaction. If no current transaction, just return a Dexie promise based\n // on given value.\n return PSD.trans ? PSD.trans.waitFor(promise) : promise;\n },\n \n // Export our Promise implementation since it can be handy as a standalone Promise implementation\n Promise: Promise,\n \n // Dexie.debug proptery:\n // Dexie.debug = false\n // Dexie.debug = true\n // Dexie.debug = \"dexie\" - don't hide dexie's stack frames.\n debug: {\n get: () => Debug.debug,\n set: value => {\n Debug.setDebug(value, value === 'dexie' ? ()=>true : dexieStackFrameFilter);\n }\n },\n \n // Export our derive/extend/override methodology\n derive: derive,\n extend: extend,\n props: props,\n override: override,\n // Export our Events() function - can be handy as a toolkit\n Events: Events,\n // Utilities\n getByKeyPath: getByKeyPath,\n setByKeyPath: setByKeyPath,\n delByKeyPath: delByKeyPath,\n shallowClone: shallowClone,\n deepClone: deepClone,\n getObjectDiff: getObjectDiff,\n asap: asap,\n maxKey: maxKey,\n minKey: minKey,\n // Addon registry\n addons: [],\n // Global DB connection list\n connections: connections,\n \n MultiModifyError: exceptions.Modify, // Backward compatibility 0.9.8. Deprecate.\n errnames: errnames,\n \n // Export other static classes\n IndexSpec: IndexSpec,\n TableSchema: TableSchema,\n \n //\n // Dependencies\n //\n // These will automatically work in browsers with indexedDB support, or where an indexedDB polyfill has been included.\n //\n // In node.js, however, these properties must be set \"manually\" before instansiating a new Dexie().\n // For node.js, you need to require indexeddb-js or similar and then set these deps.\n //\n dependencies: (()=>{\n try {\n return {\n // Required:\n indexedDB: _global.indexedDB || _global.mozIndexedDB || _global.webkitIndexedDB || _global.msIndexedDB,\n IDBKeyRange: _global.IDBKeyRange || _global.webkitIDBKeyRange\n };\n } catch (e) {\n return {\n indexedDB: null,\n IDBKeyRange: null\n };\n }\n })(),\n \n // API Version Number: Type Number, make sure to always set a version number that can be comparable correctly. Example: 0.9, 0.91, 0.92, 1.0, 1.01, 1.1, 1.2, 1.21, etc.\n semVer: DEXIE_VERSION,\n version: DEXIE_VERSION.split('.')\n .map(n => parseInt(n))\n .reduce((p,c,i) => p + (c/Math.pow(10,i*2))),\n \n // https://github.com/dfahlander/Dexie.js/issues/186\n // typescript compiler tsc in mode ts-->es5 & commonJS, will expect require() to return\n // x.default. Workaround: Set Dexie.default = Dexie.\n default: Dexie,\n // Make it possible to import {Dexie} (non-default import)\n // Reason 1: May switch to that in future.\n // Reason 2: We declare it both default and named exported in d.ts to make it possible\n // to let addons extend the Dexie interface with Typescript 2.1 (works only when explicitely\n // exporting the symbol, not just default exporting)\n Dexie: Dexie\n});\n\n// Map DOMErrors and DOMExceptions to corresponding Dexie errors. May change in Dexie v2.0.\nPromise.rejectionMapper = mapError;\n\n// Initialize dbNamesDB (won't ever be opened on chromium browsers')\ndbNamesDB = new Dexie('__dbnames'); \ndbNamesDB.version(1).stores({dbnames: 'name'});\n\n(()=>{\n // Migrate from Dexie 1.x database names stored in localStorage:\n var DBNAMES = 'Dexie.DatabaseNames';\n try { // https://github.com/dfahlander/Dexie.js/issues/617\n if (typeof localStorage !== undefined && _global.document !== undefined) {\n // Have localStorage and is not executing in a worker. Lets migrate from Dexie 1.x.\n JSON.parse(localStorage.getItem(DBNAMES) || \"[]\")\n .forEach(name => dbNamesDB.dbnames.put({name: name}).catch(nop));\n localStorage.removeItem(DBNAMES);\n }\n } catch (_e) {}\n})();\n","var decodeMap = require(\"../maps/decode.json\");\n\nmodule.exports = decodeCodePoint;\n\n// modified version of https://github.com/mathiasbynens/he/blob/master/src/he.js#L94-L119\nfunction decodeCodePoint(codePoint) {\n if ((codePoint >= 0xd800 && codePoint <= 0xdfff) || codePoint > 0x10ffff) {\n return \"\\uFFFD\";\n }\n\n if (codePoint in decodeMap) {\n codePoint = decodeMap[codePoint];\n }\n\n var output = \"\";\n\n if (codePoint > 0xffff) {\n codePoint -= 0x10000;\n output += String.fromCharCode(((codePoint >>> 10) & 0x3ff) | 0xd800);\n codePoint = 0xdc00 | (codePoint & 0x3ff);\n }\n\n output += String.fromCharCode(codePoint);\n return output;\n}\n","module.exports = Tokenizer;\n\nvar decodeCodePoint = require(\"entities/lib/decode_codepoint.js\");\nvar entityMap = require(\"entities/maps/entities.json\");\nvar legacyMap = require(\"entities/maps/legacy.json\");\nvar xmlMap = require(\"entities/maps/xml.json\");\n\nvar i = 0;\n\nvar TEXT = i++;\nvar BEFORE_TAG_NAME = i++; //after <\nvar IN_TAG_NAME = i++;\nvar IN_SELF_CLOSING_TAG = i++;\nvar BEFORE_CLOSING_TAG_NAME = i++;\nvar IN_CLOSING_TAG_NAME = i++;\nvar AFTER_CLOSING_TAG_NAME = i++;\n\n//attributes\nvar BEFORE_ATTRIBUTE_NAME = i++;\nvar IN_ATTRIBUTE_NAME = i++;\nvar AFTER_ATTRIBUTE_NAME = i++;\nvar BEFORE_ATTRIBUTE_VALUE = i++;\nvar IN_ATTRIBUTE_VALUE_DQ = i++; // \"\nvar IN_ATTRIBUTE_VALUE_SQ = i++; // '\nvar IN_ATTRIBUTE_VALUE_NQ = i++;\n\n//declarations\nvar BEFORE_DECLARATION = i++; // !\nvar IN_DECLARATION = i++;\n\n//processing instructions\nvar IN_PROCESSING_INSTRUCTION = i++; // ?\n\n//comments\nvar BEFORE_COMMENT = i++;\nvar IN_COMMENT = i++;\nvar AFTER_COMMENT_1 = i++;\nvar AFTER_COMMENT_2 = i++;\n\n//cdata\nvar BEFORE_CDATA_1 = i++; // [\nvar BEFORE_CDATA_2 = i++; // C\nvar BEFORE_CDATA_3 = i++; // D\nvar BEFORE_CDATA_4 = i++; // A\nvar BEFORE_CDATA_5 = i++; // T\nvar BEFORE_CDATA_6 = i++; // A\nvar IN_CDATA = i++; // [\nvar AFTER_CDATA_1 = i++; // ]\nvar AFTER_CDATA_2 = i++; // ]\n\n//special tags\nvar BEFORE_SPECIAL = i++; //S\nvar BEFORE_SPECIAL_END = i++; //S\n\nvar BEFORE_SCRIPT_1 = i++; //C\nvar BEFORE_SCRIPT_2 = i++; //R\nvar BEFORE_SCRIPT_3 = i++; //I\nvar BEFORE_SCRIPT_4 = i++; //P\nvar BEFORE_SCRIPT_5 = i++; //T\nvar AFTER_SCRIPT_1 = i++; //C\nvar AFTER_SCRIPT_2 = i++; //R\nvar AFTER_SCRIPT_3 = i++; //I\nvar AFTER_SCRIPT_4 = i++; //P\nvar AFTER_SCRIPT_5 = i++; //T\n\nvar BEFORE_STYLE_1 = i++; //T\nvar BEFORE_STYLE_2 = i++; //Y\nvar BEFORE_STYLE_3 = i++; //L\nvar BEFORE_STYLE_4 = i++; //E\nvar AFTER_STYLE_1 = i++; //T\nvar AFTER_STYLE_2 = i++; //Y\nvar AFTER_STYLE_3 = i++; //L\nvar AFTER_STYLE_4 = i++; //E\n\nvar BEFORE_ENTITY = i++; //&\nvar BEFORE_NUMERIC_ENTITY = i++; //#\nvar IN_NAMED_ENTITY = i++;\nvar IN_NUMERIC_ENTITY = i++;\nvar IN_HEX_ENTITY = i++; //X\n\nvar j = 0;\n\nvar SPECIAL_NONE = j++;\nvar SPECIAL_SCRIPT = j++;\nvar SPECIAL_STYLE = j++;\n\nfunction whitespace(c){\n\treturn c === \" \" || c === \"\\n\" || c === \"\\t\" || c === \"\\f\" || c === \"\\r\";\n}\n\nfunction ifElseState(upper, SUCCESS, FAILURE){\n\tvar lower = upper.toLowerCase();\n\n\tif(upper === lower){\n\t\treturn function(c){\n\t\t\tif(c === lower){\n\t\t\t\tthis._state = SUCCESS;\n\t\t\t} else {\n\t\t\t\tthis._state = FAILURE;\n\t\t\t\tthis._index--;\n\t\t\t}\n\t\t};\n\t} else {\n\t\treturn function(c){\n\t\t\tif(c === lower || c === upper){\n\t\t\t\tthis._state = SUCCESS;\n\t\t\t} else {\n\t\t\t\tthis._state = FAILURE;\n\t\t\t\tthis._index--;\n\t\t\t}\n\t\t};\n\t}\n}\n\nfunction consumeSpecialNameChar(upper, NEXT_STATE){\n\tvar lower = upper.toLowerCase();\n\n\treturn function(c){\n\t\tif(c === lower || c === upper){\n\t\t\tthis._state = NEXT_STATE;\n\t\t} else {\n\t\t\tthis._state = IN_TAG_NAME;\n\t\t\tthis._index--; //consume the token again\n\t\t}\n\t};\n}\n\nfunction Tokenizer(options, cbs){\n\tthis._state = TEXT;\n\tthis._buffer = \"\";\n\tthis._sectionStart = 0;\n\tthis._index = 0;\n\tthis._bufferOffset = 0; //chars removed from _buffer\n\tthis._baseState = TEXT;\n\tthis._special = SPECIAL_NONE;\n\tthis._cbs = cbs;\n\tthis._running = true;\n\tthis._ended = false;\n\tthis._xmlMode = !!(options && options.xmlMode);\n\tthis._decodeEntities = !!(options && options.decodeEntities);\n}\n\nTokenizer.prototype._stateText = function(c){\n\tif(c === \"<\"){\n\t\tif(this._index > this._sectionStart){\n\t\t\tthis._cbs.ontext(this._getSection());\n\t\t}\n\t\tthis._state = BEFORE_TAG_NAME;\n\t\tthis._sectionStart = this._index;\n\t} else if(this._decodeEntities && this._special === SPECIAL_NONE && c === \"&\"){\n\t\tif(this._index > this._sectionStart){\n\t\t\tthis._cbs.ontext(this._getSection());\n\t\t}\n\t\tthis._baseState = TEXT;\n\t\tthis._state = BEFORE_ENTITY;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateBeforeTagName = function(c){\n\tif(c === \"/\"){\n\t\tthis._state = BEFORE_CLOSING_TAG_NAME;\n\t} else if(c === \"<\"){\n\t\tthis._cbs.ontext(this._getSection());\n\t\tthis._sectionStart = this._index;\n\t} else if(c === \">\" || this._special !== SPECIAL_NONE || whitespace(c)) {\n\t\tthis._state = TEXT;\n\t} else if(c === \"!\"){\n\t\tthis._state = BEFORE_DECLARATION;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(c === \"?\"){\n\t\tthis._state = IN_PROCESSING_INSTRUCTION;\n\t\tthis._sectionStart = this._index + 1;\n\t} else {\n\t\tthis._state = (!this._xmlMode && (c === \"s\" || c === \"S\")) ?\n\t\t\tBEFORE_SPECIAL : IN_TAG_NAME;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateInTagName = function(c){\n\tif(c === \"/\" || c === \">\" || whitespace(c)){\n\t\tthis._emitToken(\"onopentagname\");\n\t\tthis._state = BEFORE_ATTRIBUTE_NAME;\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._stateBeforeCloseingTagName = function(c){\n\tif(whitespace(c));\n\telse if(c === \">\"){\n\t\tthis._state = TEXT;\n\t} else if(this._special !== SPECIAL_NONE){\n\t\tif(c === \"s\" || c === \"S\"){\n\t\t\tthis._state = BEFORE_SPECIAL_END;\n\t\t} else {\n\t\t\tthis._state = TEXT;\n\t\t\tthis._index--;\n\t\t}\n\t} else {\n\t\tthis._state = IN_CLOSING_TAG_NAME;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateInCloseingTagName = function(c){\n\tif(c === \">\" || whitespace(c)){\n\t\tthis._emitToken(\"onclosetag\");\n\t\tthis._state = AFTER_CLOSING_TAG_NAME;\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._stateAfterCloseingTagName = function(c){\n\t//skip everything until \">\"\n\tif(c === \">\"){\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t}\n};\n\nTokenizer.prototype._stateBeforeAttributeName = function(c){\n\tif(c === \">\"){\n\t\tthis._cbs.onopentagend();\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(c === \"/\"){\n\t\tthis._state = IN_SELF_CLOSING_TAG;\n\t} else if(!whitespace(c)){\n\t\tthis._state = IN_ATTRIBUTE_NAME;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateInSelfClosingTag = function(c){\n\tif(c === \">\"){\n\t\tthis._cbs.onselfclosingtag();\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(!whitespace(c)){\n\t\tthis._state = BEFORE_ATTRIBUTE_NAME;\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._stateInAttributeName = function(c){\n\tif(c === \"=\" || c === \"/\" || c === \">\" || whitespace(c)){\n\t\tthis._cbs.onattribname(this._getSection());\n\t\tthis._sectionStart = -1;\n\t\tthis._state = AFTER_ATTRIBUTE_NAME;\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._stateAfterAttributeName = function(c){\n\tif(c === \"=\"){\n\t\tthis._state = BEFORE_ATTRIBUTE_VALUE;\n\t} else if(c === \"/\" || c === \">\"){\n\t\tthis._cbs.onattribend();\n\t\tthis._state = BEFORE_ATTRIBUTE_NAME;\n\t\tthis._index--;\n\t} else if(!whitespace(c)){\n\t\tthis._cbs.onattribend();\n\t\tthis._state = IN_ATTRIBUTE_NAME;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateBeforeAttributeValue = function(c){\n\tif(c === \"\\\"\"){\n\t\tthis._state = IN_ATTRIBUTE_VALUE_DQ;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(c === \"'\"){\n\t\tthis._state = IN_ATTRIBUTE_VALUE_SQ;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(!whitespace(c)){\n\t\tthis._state = IN_ATTRIBUTE_VALUE_NQ;\n\t\tthis._sectionStart = this._index;\n\t\tthis._index--; //reconsume token\n\t}\n};\n\nTokenizer.prototype._stateInAttributeValueDoubleQuotes = function(c){\n\tif(c === \"\\\"\"){\n\t\tthis._emitToken(\"onattribdata\");\n\t\tthis._cbs.onattribend();\n\t\tthis._state = BEFORE_ATTRIBUTE_NAME;\n\t} else if(this._decodeEntities && c === \"&\"){\n\t\tthis._emitToken(\"onattribdata\");\n\t\tthis._baseState = this._state;\n\t\tthis._state = BEFORE_ENTITY;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateInAttributeValueSingleQuotes = function(c){\n\tif(c === \"'\"){\n\t\tthis._emitToken(\"onattribdata\");\n\t\tthis._cbs.onattribend();\n\t\tthis._state = BEFORE_ATTRIBUTE_NAME;\n\t} else if(this._decodeEntities && c === \"&\"){\n\t\tthis._emitToken(\"onattribdata\");\n\t\tthis._baseState = this._state;\n\t\tthis._state = BEFORE_ENTITY;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateInAttributeValueNoQuotes = function(c){\n\tif(whitespace(c) || c === \">\"){\n\t\tthis._emitToken(\"onattribdata\");\n\t\tthis._cbs.onattribend();\n\t\tthis._state = BEFORE_ATTRIBUTE_NAME;\n\t\tthis._index--;\n\t} else if(this._decodeEntities && c === \"&\"){\n\t\tthis._emitToken(\"onattribdata\");\n\t\tthis._baseState = this._state;\n\t\tthis._state = BEFORE_ENTITY;\n\t\tthis._sectionStart = this._index;\n\t}\n};\n\nTokenizer.prototype._stateBeforeDeclaration = function(c){\n\tthis._state = c === \"[\" ? BEFORE_CDATA_1 :\n\t\tc === \"-\" ? BEFORE_COMMENT :\n\t\t\tIN_DECLARATION;\n};\n\nTokenizer.prototype._stateInDeclaration = function(c){\n\tif(c === \">\"){\n\t\tthis._cbs.ondeclaration(this._getSection());\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t}\n};\n\nTokenizer.prototype._stateInProcessingInstruction = function(c){\n\tif(c === \">\"){\n\t\tthis._cbs.onprocessinginstruction(this._getSection());\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t}\n};\n\nTokenizer.prototype._stateBeforeComment = function(c){\n\tif(c === \"-\"){\n\t\tthis._state = IN_COMMENT;\n\t\tthis._sectionStart = this._index + 1;\n\t} else {\n\t\tthis._state = IN_DECLARATION;\n\t}\n};\n\nTokenizer.prototype._stateInComment = function(c){\n\tif(c === \"-\") this._state = AFTER_COMMENT_1;\n};\n\nTokenizer.prototype._stateAfterComment1 = function(c){\n\tif(c === \"-\"){\n\t\tthis._state = AFTER_COMMENT_2;\n\t} else {\n\t\tthis._state = IN_COMMENT;\n\t}\n};\n\nTokenizer.prototype._stateAfterComment2 = function(c){\n\tif(c === \">\"){\n\t\t//remove 2 trailing chars\n\t\tthis._cbs.oncomment(this._buffer.substring(this._sectionStart, this._index - 2));\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(c !== \"-\"){\n\t\tthis._state = IN_COMMENT;\n\t}\n\t// else: stay in AFTER_COMMENT_2 (`--->`)\n};\n\nTokenizer.prototype._stateBeforeCdata1 = ifElseState(\"C\", BEFORE_CDATA_2, IN_DECLARATION);\nTokenizer.prototype._stateBeforeCdata2 = ifElseState(\"D\", BEFORE_CDATA_3, IN_DECLARATION);\nTokenizer.prototype._stateBeforeCdata3 = ifElseState(\"A\", BEFORE_CDATA_4, IN_DECLARATION);\nTokenizer.prototype._stateBeforeCdata4 = ifElseState(\"T\", BEFORE_CDATA_5, IN_DECLARATION);\nTokenizer.prototype._stateBeforeCdata5 = ifElseState(\"A\", BEFORE_CDATA_6, IN_DECLARATION);\n\nTokenizer.prototype._stateBeforeCdata6 = function(c){\n\tif(c === \"[\"){\n\t\tthis._state = IN_CDATA;\n\t\tthis._sectionStart = this._index + 1;\n\t} else {\n\t\tthis._state = IN_DECLARATION;\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._stateInCdata = function(c){\n\tif(c === \"]\") this._state = AFTER_CDATA_1;\n};\n\nTokenizer.prototype._stateAfterCdata1 = function(c){\n\tif(c === \"]\") this._state = AFTER_CDATA_2;\n\telse this._state = IN_CDATA;\n};\n\nTokenizer.prototype._stateAfterCdata2 = function(c){\n\tif(c === \">\"){\n\t\t//remove 2 trailing chars\n\t\tthis._cbs.oncdata(this._buffer.substring(this._sectionStart, this._index - 2));\n\t\tthis._state = TEXT;\n\t\tthis._sectionStart = this._index + 1;\n\t} else if(c !== \"]\") {\n\t\tthis._state = IN_CDATA;\n\t}\n\t//else: stay in AFTER_CDATA_2 (`]]]>`)\n};\n\nTokenizer.prototype._stateBeforeSpecial = function(c){\n\tif(c === \"c\" || c === \"C\"){\n\t\tthis._state = BEFORE_SCRIPT_1;\n\t} else if(c === \"t\" || c === \"T\"){\n\t\tthis._state = BEFORE_STYLE_1;\n\t} else {\n\t\tthis._state = IN_TAG_NAME;\n\t\tthis._index--; //consume the token again\n\t}\n};\n\nTokenizer.prototype._stateBeforeSpecialEnd = function(c){\n\tif(this._special === SPECIAL_SCRIPT && (c === \"c\" || c === \"C\")){\n\t\tthis._state = AFTER_SCRIPT_1;\n\t} else if(this._special === SPECIAL_STYLE && (c === \"t\" || c === \"T\")){\n\t\tthis._state = AFTER_STYLE_1;\n\t}\n\telse this._state = TEXT;\n};\n\nTokenizer.prototype._stateBeforeScript1 = consumeSpecialNameChar(\"R\", BEFORE_SCRIPT_2);\nTokenizer.prototype._stateBeforeScript2 = consumeSpecialNameChar(\"I\", BEFORE_SCRIPT_3);\nTokenizer.prototype._stateBeforeScript3 = consumeSpecialNameChar(\"P\", BEFORE_SCRIPT_4);\nTokenizer.prototype._stateBeforeScript4 = consumeSpecialNameChar(\"T\", BEFORE_SCRIPT_5);\n\nTokenizer.prototype._stateBeforeScript5 = function(c){\n\tif(c === \"/\" || c === \">\" || whitespace(c)){\n\t\tthis._special = SPECIAL_SCRIPT;\n\t}\n\tthis._state = IN_TAG_NAME;\n\tthis._index--; //consume the token again\n};\n\nTokenizer.prototype._stateAfterScript1 = ifElseState(\"R\", AFTER_SCRIPT_2, TEXT);\nTokenizer.prototype._stateAfterScript2 = ifElseState(\"I\", AFTER_SCRIPT_3, TEXT);\nTokenizer.prototype._stateAfterScript3 = ifElseState(\"P\", AFTER_SCRIPT_4, TEXT);\nTokenizer.prototype._stateAfterScript4 = ifElseState(\"T\", AFTER_SCRIPT_5, TEXT);\n\nTokenizer.prototype._stateAfterScript5 = function(c){\n\tif(c === \">\" || whitespace(c)){\n\t\tthis._special = SPECIAL_NONE;\n\t\tthis._state = IN_CLOSING_TAG_NAME;\n\t\tthis._sectionStart = this._index - 6;\n\t\tthis._index--; //reconsume the token\n\t}\n\telse this._state = TEXT;\n};\n\nTokenizer.prototype._stateBeforeStyle1 = consumeSpecialNameChar(\"Y\", BEFORE_STYLE_2);\nTokenizer.prototype._stateBeforeStyle2 = consumeSpecialNameChar(\"L\", BEFORE_STYLE_3);\nTokenizer.prototype._stateBeforeStyle3 = consumeSpecialNameChar(\"E\", BEFORE_STYLE_4);\n\nTokenizer.prototype._stateBeforeStyle4 = function(c){\n\tif(c === \"/\" || c === \">\" || whitespace(c)){\n\t\tthis._special = SPECIAL_STYLE;\n\t}\n\tthis._state = IN_TAG_NAME;\n\tthis._index--; //consume the token again\n};\n\nTokenizer.prototype._stateAfterStyle1 = ifElseState(\"Y\", AFTER_STYLE_2, TEXT);\nTokenizer.prototype._stateAfterStyle2 = ifElseState(\"L\", AFTER_STYLE_3, TEXT);\nTokenizer.prototype._stateAfterStyle3 = ifElseState(\"E\", AFTER_STYLE_4, TEXT);\n\nTokenizer.prototype._stateAfterStyle4 = function(c){\n\tif(c === \">\" || whitespace(c)){\n\t\tthis._special = SPECIAL_NONE;\n\t\tthis._state = IN_CLOSING_TAG_NAME;\n\t\tthis._sectionStart = this._index - 5;\n\t\tthis._index--; //reconsume the token\n\t}\n\telse this._state = TEXT;\n};\n\nTokenizer.prototype._stateBeforeEntity = ifElseState(\"#\", BEFORE_NUMERIC_ENTITY, IN_NAMED_ENTITY);\nTokenizer.prototype._stateBeforeNumericEntity = ifElseState(\"X\", IN_HEX_ENTITY, IN_NUMERIC_ENTITY);\n\n//for entities terminated with a semicolon\nTokenizer.prototype._parseNamedEntityStrict = function(){\n\t//offset = 1\n\tif(this._sectionStart + 1 < this._index){\n\t\tvar entity = this._buffer.substring(this._sectionStart + 1, this._index),\n\t\t map = this._xmlMode ? xmlMap : entityMap;\n\n\t\tif(map.hasOwnProperty(entity)){\n\t\t\tthis._emitPartial(map[entity]);\n\t\t\tthis._sectionStart = this._index + 1;\n\t\t}\n\t}\n};\n\n\n//parses legacy entities (without trailing semicolon)\nTokenizer.prototype._parseLegacyEntity = function(){\n\tvar start = this._sectionStart + 1,\n\t limit = this._index - start;\n\n\tif(limit > 6) limit = 6; //the max length of legacy entities is 6\n\n\twhile(limit >= 2){ //the min length of legacy entities is 2\n\t\tvar entity = this._buffer.substr(start, limit);\n\n\t\tif(legacyMap.hasOwnProperty(entity)){\n\t\t\tthis._emitPartial(legacyMap[entity]);\n\t\t\tthis._sectionStart += limit + 1;\n\t\t\treturn;\n\t\t} else {\n\t\t\tlimit--;\n\t\t}\n\t}\n};\n\nTokenizer.prototype._stateInNamedEntity = function(c){\n\tif(c === \";\"){\n\t\tthis._parseNamedEntityStrict();\n\t\tif(this._sectionStart + 1 < this._index && !this._xmlMode){\n\t\t\tthis._parseLegacyEntity();\n\t\t}\n\t\tthis._state = this._baseState;\n\t} else if((c < \"a\" || c > \"z\") && (c < \"A\" || c > \"Z\") && (c < \"0\" || c > \"9\")){\n\t\tif(this._xmlMode);\n\t\telse if(this._sectionStart + 1 === this._index);\n\t\telse if(this._baseState !== TEXT){\n\t\t\tif(c !== \"=\"){\n\t\t\t\tthis._parseNamedEntityStrict();\n\t\t\t}\n\t\t} else {\n\t\t\tthis._parseLegacyEntity();\n\t\t}\n\n\t\tthis._state = this._baseState;\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._decodeNumericEntity = function(offset, base){\n\tvar sectionStart = this._sectionStart + offset;\n\n\tif(sectionStart !== this._index){\n\t\t//parse entity\n\t\tvar entity = this._buffer.substring(sectionStart, this._index);\n\t\tvar parsed = parseInt(entity, base);\n\n\t\tthis._emitPartial(decodeCodePoint(parsed));\n\t\tthis._sectionStart = this._index;\n\t} else {\n\t\tthis._sectionStart--;\n\t}\n\n\tthis._state = this._baseState;\n};\n\nTokenizer.prototype._stateInNumericEntity = function(c){\n\tif(c === \";\"){\n\t\tthis._decodeNumericEntity(2, 10);\n\t\tthis._sectionStart++;\n\t} else if(c < \"0\" || c > \"9\"){\n\t\tif(!this._xmlMode){\n\t\t\tthis._decodeNumericEntity(2, 10);\n\t\t} else {\n\t\t\tthis._state = this._baseState;\n\t\t}\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._stateInHexEntity = function(c){\n\tif(c === \";\"){\n\t\tthis._decodeNumericEntity(3, 16);\n\t\tthis._sectionStart++;\n\t} else if((c < \"a\" || c > \"f\") && (c < \"A\" || c > \"F\") && (c < \"0\" || c > \"9\")){\n\t\tif(!this._xmlMode){\n\t\t\tthis._decodeNumericEntity(3, 16);\n\t\t} else {\n\t\t\tthis._state = this._baseState;\n\t\t}\n\t\tthis._index--;\n\t}\n};\n\nTokenizer.prototype._cleanup = function (){\n\tif(this._sectionStart < 0){\n\t\tthis._buffer = \"\";\n\t\tthis._bufferOffset += this._index;\n\t\tthis._index = 0;\n\t} else if(this._running){\n\t\tif(this._state === TEXT){\n\t\t\tif(this._sectionStart !== this._index){\n\t\t\t\tthis._cbs.ontext(this._buffer.substr(this._sectionStart));\n\t\t\t}\n\t\t\tthis._buffer = \"\";\n\t\t\tthis._bufferOffset += this._index;\n\t\t\tthis._index = 0;\n\t\t} else if(this._sectionStart === this._index){\n\t\t\t//the section just started\n\t\t\tthis._buffer = \"\";\n\t\t\tthis._bufferOffset += this._index;\n\t\t\tthis._index = 0;\n\t\t} else {\n\t\t\t//remove everything unnecessary\n\t\t\tthis._buffer = this._buffer.substr(this._sectionStart);\n\t\t\tthis._index -= this._sectionStart;\n\t\t\tthis._bufferOffset += this._sectionStart;\n\t\t}\n\n\t\tthis._sectionStart = 0;\n\t}\n};\n\n//TODO make events conditional\nTokenizer.prototype.write = function(chunk){\n\tif(this._ended) this._cbs.onerror(Error(\".write() after done!\"));\n\n\tthis._buffer += chunk;\n\tthis._parse();\n};\n\nTokenizer.prototype._parse = function(){\n\twhile(this._index < this._buffer.length && this._running){\n\t\tvar c = this._buffer.charAt(this._index);\n\t\tif(this._state === TEXT) {\n\t\t\tthis._stateText(c);\n\t\t} else if(this._state === BEFORE_TAG_NAME){\n\t\t\tthis._stateBeforeTagName(c);\n\t\t} else if(this._state === IN_TAG_NAME) {\n\t\t\tthis._stateInTagName(c);\n\t\t} else if(this._state === BEFORE_CLOSING_TAG_NAME){\n\t\t\tthis._stateBeforeCloseingTagName(c);\n\t\t} else if(this._state === IN_CLOSING_TAG_NAME){\n\t\t\tthis._stateInCloseingTagName(c);\n\t\t} else if(this._state === AFTER_CLOSING_TAG_NAME){\n\t\t\tthis._stateAfterCloseingTagName(c);\n\t\t} else if(this._state === IN_SELF_CLOSING_TAG){\n\t\t\tthis._stateInSelfClosingTag(c);\n\t\t}\n\n\t\t/*\n\t\t*\tattributes\n\t\t*/\n\t\telse if(this._state === BEFORE_ATTRIBUTE_NAME){\n\t\t\tthis._stateBeforeAttributeName(c);\n\t\t} else if(this._state === IN_ATTRIBUTE_NAME){\n\t\t\tthis._stateInAttributeName(c);\n\t\t} else if(this._state === AFTER_ATTRIBUTE_NAME){\n\t\t\tthis._stateAfterAttributeName(c);\n\t\t} else if(this._state === BEFORE_ATTRIBUTE_VALUE){\n\t\t\tthis._stateBeforeAttributeValue(c);\n\t\t} else if(this._state === IN_ATTRIBUTE_VALUE_DQ){\n\t\t\tthis._stateInAttributeValueDoubleQuotes(c);\n\t\t} else if(this._state === IN_ATTRIBUTE_VALUE_SQ){\n\t\t\tthis._stateInAttributeValueSingleQuotes(c);\n\t\t} else if(this._state === IN_ATTRIBUTE_VALUE_NQ){\n\t\t\tthis._stateInAttributeValueNoQuotes(c);\n\t\t}\n\n\t\t/*\n\t\t*\tdeclarations\n\t\t*/\n\t\telse if(this._state === BEFORE_DECLARATION){\n\t\t\tthis._stateBeforeDeclaration(c);\n\t\t} else if(this._state === IN_DECLARATION){\n\t\t\tthis._stateInDeclaration(c);\n\t\t}\n\n\t\t/*\n\t\t*\tprocessing instructions\n\t\t*/\n\t\telse if(this._state === IN_PROCESSING_INSTRUCTION){\n\t\t\tthis._stateInProcessingInstruction(c);\n\t\t}\n\n\t\t/*\n\t\t*\tcomments\n\t\t*/\n\t\telse if(this._state === BEFORE_COMMENT){\n\t\t\tthis._stateBeforeComment(c);\n\t\t} else if(this._state === IN_COMMENT){\n\t\t\tthis._stateInComment(c);\n\t\t} else if(this._state === AFTER_COMMENT_1){\n\t\t\tthis._stateAfterComment1(c);\n\t\t} else if(this._state === AFTER_COMMENT_2){\n\t\t\tthis._stateAfterComment2(c);\n\t\t}\n\n\t\t/*\n\t\t*\tcdata\n\t\t*/\n\t\telse if(this._state === BEFORE_CDATA_1){\n\t\t\tthis._stateBeforeCdata1(c);\n\t\t} else if(this._state === BEFORE_CDATA_2){\n\t\t\tthis._stateBeforeCdata2(c);\n\t\t} else if(this._state === BEFORE_CDATA_3){\n\t\t\tthis._stateBeforeCdata3(c);\n\t\t} else if(this._state === BEFORE_CDATA_4){\n\t\t\tthis._stateBeforeCdata4(c);\n\t\t} else if(this._state === BEFORE_CDATA_5){\n\t\t\tthis._stateBeforeCdata5(c);\n\t\t} else if(this._state === BEFORE_CDATA_6){\n\t\t\tthis._stateBeforeCdata6(c);\n\t\t} else if(this._state === IN_CDATA){\n\t\t\tthis._stateInCdata(c);\n\t\t} else if(this._state === AFTER_CDATA_1){\n\t\t\tthis._stateAfterCdata1(c);\n\t\t} else if(this._state === AFTER_CDATA_2){\n\t\t\tthis._stateAfterCdata2(c);\n\t\t}\n\n\t\t/*\n\t\t* special tags\n\t\t*/\n\t\telse if(this._state === BEFORE_SPECIAL){\n\t\t\tthis._stateBeforeSpecial(c);\n\t\t} else if(this._state === BEFORE_SPECIAL_END){\n\t\t\tthis._stateBeforeSpecialEnd(c);\n\t\t}\n\n\t\t/*\n\t\t* script\n\t\t*/\n\t\telse if(this._state === BEFORE_SCRIPT_1){\n\t\t\tthis._stateBeforeScript1(c);\n\t\t} else if(this._state === BEFORE_SCRIPT_2){\n\t\t\tthis._stateBeforeScript2(c);\n\t\t} else if(this._state === BEFORE_SCRIPT_3){\n\t\t\tthis._stateBeforeScript3(c);\n\t\t} else if(this._state === BEFORE_SCRIPT_4){\n\t\t\tthis._stateBeforeScript4(c);\n\t\t} else if(this._state === BEFORE_SCRIPT_5){\n\t\t\tthis._stateBeforeScript5(c);\n\t\t}\n\n\t\telse if(this._state === AFTER_SCRIPT_1){\n\t\t\tthis._stateAfterScript1(c);\n\t\t} else if(this._state === AFTER_SCRIPT_2){\n\t\t\tthis._stateAfterScript2(c);\n\t\t} else if(this._state === AFTER_SCRIPT_3){\n\t\t\tthis._stateAfterScript3(c);\n\t\t} else if(this._state === AFTER_SCRIPT_4){\n\t\t\tthis._stateAfterScript4(c);\n\t\t} else if(this._state === AFTER_SCRIPT_5){\n\t\t\tthis._stateAfterScript5(c);\n\t\t}\n\n\t\t/*\n\t\t* style\n\t\t*/\n\t\telse if(this._state === BEFORE_STYLE_1){\n\t\t\tthis._stateBeforeStyle1(c);\n\t\t} else if(this._state === BEFORE_STYLE_2){\n\t\t\tthis._stateBeforeStyle2(c);\n\t\t} else if(this._state === BEFORE_STYLE_3){\n\t\t\tthis._stateBeforeStyle3(c);\n\t\t} else if(this._state === BEFORE_STYLE_4){\n\t\t\tthis._stateBeforeStyle4(c);\n\t\t}\n\n\t\telse if(this._state === AFTER_STYLE_1){\n\t\t\tthis._stateAfterStyle1(c);\n\t\t} else if(this._state === AFTER_STYLE_2){\n\t\t\tthis._stateAfterStyle2(c);\n\t\t} else if(this._state === AFTER_STYLE_3){\n\t\t\tthis._stateAfterStyle3(c);\n\t\t} else if(this._state === AFTER_STYLE_4){\n\t\t\tthis._stateAfterStyle4(c);\n\t\t}\n\n\t\t/*\n\t\t* entities\n\t\t*/\n\t\telse if(this._state === BEFORE_ENTITY){\n\t\t\tthis._stateBeforeEntity(c);\n\t\t} else if(this._state === BEFORE_NUMERIC_ENTITY){\n\t\t\tthis._stateBeforeNumericEntity(c);\n\t\t} else if(this._state === IN_NAMED_ENTITY){\n\t\t\tthis._stateInNamedEntity(c);\n\t\t} else if(this._state === IN_NUMERIC_ENTITY){\n\t\t\tthis._stateInNumericEntity(c);\n\t\t} else if(this._state === IN_HEX_ENTITY){\n\t\t\tthis._stateInHexEntity(c);\n\t\t}\n\n\t\telse {\n\t\t\tthis._cbs.onerror(Error(\"unknown _state\"), this._state);\n\t\t}\n\n\t\tthis._index++;\n\t}\n\n\tthis._cleanup();\n};\n\nTokenizer.prototype.pause = function(){\n\tthis._running = false;\n};\nTokenizer.prototype.resume = function(){\n\tthis._running = true;\n\n\tif(this._index < this._buffer.length){\n\t\tthis._parse();\n\t}\n\tif(this._ended){\n\t\tthis._finish();\n\t}\n};\n\nTokenizer.prototype.end = function(chunk){\n\tif(this._ended) this._cbs.onerror(Error(\".end() after done!\"));\n\tif(chunk) this.write(chunk);\n\n\tthis._ended = true;\n\n\tif(this._running) this._finish();\n};\n\nTokenizer.prototype._finish = function(){\n\t//if there is remaining data, emit it in a reasonable way\n\tif(this._sectionStart < this._index){\n\t\tthis._handleTrailingData();\n\t}\n\n\tthis._cbs.onend();\n};\n\nTokenizer.prototype._handleTrailingData = function(){\n\tvar data = this._buffer.substr(this._sectionStart);\n\n\tif(this._state === IN_CDATA || this._state === AFTER_CDATA_1 || this._state === AFTER_CDATA_2){\n\t\tthis._cbs.oncdata(data);\n\t} else if(this._state === IN_COMMENT || this._state === AFTER_COMMENT_1 || this._state === AFTER_COMMENT_2){\n\t\tthis._cbs.oncomment(data);\n\t} else if(this._state === IN_NAMED_ENTITY && !this._xmlMode){\n\t\tthis._parseLegacyEntity();\n\t\tif(this._sectionStart < this._index){\n\t\t\tthis._state = this._baseState;\n\t\t\tthis._handleTrailingData();\n\t\t}\n\t} else if(this._state === IN_NUMERIC_ENTITY && !this._xmlMode){\n\t\tthis._decodeNumericEntity(2, 10);\n\t\tif(this._sectionStart < this._index){\n\t\t\tthis._state = this._baseState;\n\t\t\tthis._handleTrailingData();\n\t\t}\n\t} else if(this._state === IN_HEX_ENTITY && !this._xmlMode){\n\t\tthis._decodeNumericEntity(3, 16);\n\t\tif(this._sectionStart < this._index){\n\t\t\tthis._state = this._baseState;\n\t\t\tthis._handleTrailingData();\n\t\t}\n\t} else if(\n\t\tthis._state !== IN_TAG_NAME &&\n\t\tthis._state !== BEFORE_ATTRIBUTE_NAME &&\n\t\tthis._state !== BEFORE_ATTRIBUTE_VALUE &&\n\t\tthis._state !== AFTER_ATTRIBUTE_NAME &&\n\t\tthis._state !== IN_ATTRIBUTE_NAME &&\n\t\tthis._state !== IN_ATTRIBUTE_VALUE_SQ &&\n\t\tthis._state !== IN_ATTRIBUTE_VALUE_DQ &&\n\t\tthis._state !== IN_ATTRIBUTE_VALUE_NQ &&\n\t\tthis._state !== IN_CLOSING_TAG_NAME\n\t){\n\t\tthis._cbs.ontext(data);\n\t}\n\t//else, ignore remaining data\n\t//TODO add a way to remove current tag\n};\n\nTokenizer.prototype.reset = function(){\n\tTokenizer.call(this, {xmlMode: this._xmlMode, decodeEntities: this._decodeEntities}, this._cbs);\n};\n\nTokenizer.prototype.getAbsoluteIndex = function(){\n\treturn this._bufferOffset + this._index;\n};\n\nTokenizer.prototype._getSection = function(){\n\treturn this._buffer.substring(this._sectionStart, this._index);\n};\n\nTokenizer.prototype._emitToken = function(name){\n\tthis._cbs[name](this._getSection());\n\tthis._sectionStart = -1;\n};\n\nTokenizer.prototype._emitPartial = function(value){\n\tif(this._baseState !== TEXT){\n\t\tthis._cbs.onattribdata(value); //TODO implement the new event\n\t} else {\n\t\tthis._cbs.ontext(value);\n\t}\n};\n","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nfunction EventEmitter() {\n this._events = this._events || {};\n this._maxListeners = this._maxListeners || undefined;\n}\nmodule.exports = EventEmitter;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nEventEmitter.defaultMaxListeners = 10;\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function(n) {\n if (!isNumber(n) || n < 0 || isNaN(n))\n throw TypeError('n must be a positive number');\n this._maxListeners = n;\n return this;\n};\n\nEventEmitter.prototype.emit = function(type) {\n var er, handler, len, args, i, listeners;\n\n if (!this._events)\n this._events = {};\n\n // If there is no 'error' event listener then throw.\n if (type === 'error') {\n if (!this._events.error ||\n (isObject(this._events.error) && !this._events.error.length)) {\n er = arguments[1];\n if (er instanceof Error) {\n throw er; // Unhandled 'error' event\n } else {\n // At least give some kind of context to the user\n var err = new Error('Uncaught, unspecified \"error\" event. (' + er + ')');\n err.context = er;\n throw err;\n }\n }\n }\n\n handler = this._events[type];\n\n if (isUndefined(handler))\n return false;\n\n if (isFunction(handler)) {\n switch (arguments.length) {\n // fast cases\n case 1:\n handler.call(this);\n break;\n case 2:\n handler.call(this, arguments[1]);\n break;\n case 3:\n handler.call(this, arguments[1], arguments[2]);\n break;\n // slower\n default:\n args = Array.prototype.slice.call(arguments, 1);\n handler.apply(this, args);\n }\n } else if (isObject(handler)) {\n args = Array.prototype.slice.call(arguments, 1);\n listeners = handler.slice();\n len = listeners.length;\n for (i = 0; i < len; i++)\n listeners[i].apply(this, args);\n }\n\n return true;\n};\n\nEventEmitter.prototype.addListener = function(type, listener) {\n var m;\n\n if (!isFunction(listener))\n throw TypeError('listener must be a function');\n\n if (!this._events)\n this._events = {};\n\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (this._events.newListener)\n this.emit('newListener', type,\n isFunction(listener.listener) ?\n listener.listener : listener);\n\n if (!this._events[type])\n // Optimize the case of one listener. Don't need the extra array object.\n this._events[type] = listener;\n else if (isObject(this._events[type]))\n // If we've already got an array, just append.\n this._events[type].push(listener);\n else\n // Adding the second element, need to change to array.\n this._events[type] = [this._events[type], listener];\n\n // Check for listener leak\n if (isObject(this._events[type]) && !this._events[type].warned) {\n if (!isUndefined(this._maxListeners)) {\n m = this._maxListeners;\n } else {\n m = EventEmitter.defaultMaxListeners;\n }\n\n if (m && m > 0 && this._events[type].length > m) {\n this._events[type].warned = true;\n console.error('(node) warning: possible EventEmitter memory ' +\n 'leak detected. %d listeners added. ' +\n 'Use emitter.setMaxListeners() to increase limit.',\n this._events[type].length);\n if (typeof console.trace === 'function') {\n // not supported in IE 10\n console.trace();\n }\n }\n }\n\n return this;\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.once = function(type, listener) {\n if (!isFunction(listener))\n throw TypeError('listener must be a function');\n\n var fired = false;\n\n function g() {\n this.removeListener(type, g);\n\n if (!fired) {\n fired = true;\n listener.apply(this, arguments);\n }\n }\n\n g.listener = listener;\n this.on(type, g);\n\n return this;\n};\n\n// emits a 'removeListener' event iff the listener was removed\nEventEmitter.prototype.removeListener = function(type, listener) {\n var list, position, length, i;\n\n if (!isFunction(listener))\n throw TypeError('listener must be a function');\n\n if (!this._events || !this._events[type])\n return this;\n\n list = this._events[type];\n length = list.length;\n position = -1;\n\n if (list === listener ||\n (isFunction(list.listener) && list.listener === listener)) {\n delete this._events[type];\n if (this._events.removeListener)\n this.emit('removeListener', type, listener);\n\n } else if (isObject(list)) {\n for (i = length; i-- > 0;) {\n if (list[i] === listener ||\n (list[i].listener && list[i].listener === listener)) {\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (list.length === 1) {\n list.length = 0;\n delete this._events[type];\n } else {\n list.splice(position, 1);\n }\n\n if (this._events.removeListener)\n this.emit('removeListener', type, listener);\n }\n\n return this;\n};\n\nEventEmitter.prototype.removeAllListeners = function(type) {\n var key, listeners;\n\n if (!this._events)\n return this;\n\n // not listening for removeListener, no need to emit\n if (!this._events.removeListener) {\n if (arguments.length === 0)\n this._events = {};\n else if (this._events[type])\n delete this._events[type];\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n for (key in this._events) {\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = {};\n return this;\n }\n\n listeners = this._events[type];\n\n if (isFunction(listeners)) {\n this.removeListener(type, listeners);\n } else if (listeners) {\n // LIFO order\n while (listeners.length)\n this.removeListener(type, listeners[listeners.length - 1]);\n }\n delete this._events[type];\n\n return this;\n};\n\nEventEmitter.prototype.listeners = function(type) {\n var ret;\n if (!this._events || !this._events[type])\n ret = [];\n else if (isFunction(this._events[type]))\n ret = [this._events[type]];\n else\n ret = this._events[type].slice();\n return ret;\n};\n\nEventEmitter.prototype.listenerCount = function(type) {\n if (this._events) {\n var evlistener = this._events[type];\n\n if (isFunction(evlistener))\n return 1;\n else if (evlistener)\n return evlistener.length;\n }\n return 0;\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n return emitter.listenerCount(type);\n};\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\n","var Tokenizer = require(\"./Tokenizer.js\");\n\n/*\n\tOptions:\n\n\txmlMode: Disables the special behavior for script/style tags (false by default)\n\tlowerCaseAttributeNames: call .toLowerCase for each attribute name (true if xmlMode is `false`)\n\tlowerCaseTags: call .toLowerCase for each tag name (true if xmlMode is `false`)\n*/\n\n/*\n\tCallbacks:\n\n\toncdataend,\n\toncdatastart,\n\tonclosetag,\n\toncomment,\n\toncommentend,\n\tonerror,\n\tonopentag,\n\tonprocessinginstruction,\n\tonreset,\n\tontext\n*/\n\nvar formTags = {\n\tinput: true,\n\toption: true,\n\toptgroup: true,\n\tselect: true,\n\tbutton: true,\n\tdatalist: true,\n\ttextarea: true\n};\n\nvar openImpliesClose = {\n\ttr : { tr:true, th:true, td:true },\n\tth : { th:true },\n\ttd : { thead:true, th:true, td:true },\n\tbody : { head:true, link:true, script:true },\n\tli : { li:true },\n\tp : { p:true },\n\th1 : { p:true },\n\th2 : { p:true },\n\th3 : { p:true },\n\th4 : { p:true },\n\th5 : { p:true },\n\th6 : { p:true },\n\tselect : formTags,\n\tinput : formTags,\n\toutput : formTags,\n\tbutton : formTags,\n\tdatalist: formTags,\n\ttextarea: formTags,\n\toption : { option:true },\n\toptgroup: { optgroup:true }\n};\n\nvar voidElements = {\n\t__proto__: null,\n\tarea: true,\n\tbase: true,\n\tbasefont: true,\n\tbr: true,\n\tcol: true,\n\tcommand: true,\n\tembed: true,\n\tframe: true,\n\thr: true,\n\timg: true,\n\tinput: true,\n\tisindex: true,\n\tkeygen: true,\n\tlink: true,\n\tmeta: true,\n\tparam: true,\n\tsource: true,\n\ttrack: true,\n\twbr: true,\n};\n\nvar foreignContextElements = {\n\t__proto__: null,\n\tmath: true,\n\tsvg: true\n}\nvar htmlIntegrationElements = {\n\t__proto__: null,\n\tmi: true,\n\tmo: true,\n\tmn: true,\n\tms: true,\n\tmtext: true,\n\t\"annotation-xml\": true,\n\tforeignObject: true,\n\tdesc: true,\n\ttitle: true\n}\n\nvar re_nameEnd = /\\s|\\//;\n\nfunction Parser(cbs, options){\n\tthis._options = options || {};\n\tthis._cbs = cbs || {};\n\n\tthis._tagname = \"\";\n\tthis._attribname = \"\";\n\tthis._attribvalue = \"\";\n\tthis._attribs = null;\n\tthis._stack = [];\n\tthis._foreignContext = [];\n\n\tthis.startIndex = 0;\n\tthis.endIndex = null;\n\n\tthis._lowerCaseTagNames = \"lowerCaseTags\" in this._options ?\n\t\t!!this._options.lowerCaseTags :\n\t\t!this._options.xmlMode;\n\tthis._lowerCaseAttributeNames = \"lowerCaseAttributeNames\" in this._options ?\n\t\t!!this._options.lowerCaseAttributeNames :\n\t\t!this._options.xmlMode;\n\n\tif(this._options.Tokenizer) {\n\t\tTokenizer = this._options.Tokenizer;\n\t}\n\tthis._tokenizer = new Tokenizer(this._options, this);\n\n\tif(this._cbs.onparserinit) this._cbs.onparserinit(this);\n}\n\nrequire(\"inherits\")(Parser, require(\"events\").EventEmitter);\n\nParser.prototype._updatePosition = function(initialOffset){\n\tif(this.endIndex === null){\n\t\tif(this._tokenizer._sectionStart <= initialOffset){\n\t\t\tthis.startIndex = 0;\n\t\t} else {\n\t\t\tthis.startIndex = this._tokenizer._sectionStart - initialOffset;\n\t\t}\n\t}\n\telse this.startIndex = this.endIndex + 1;\n\tthis.endIndex = this._tokenizer.getAbsoluteIndex();\n};\n\n//Tokenizer event handlers\nParser.prototype.ontext = function(data){\n\tthis._updatePosition(1);\n\tthis.endIndex--;\n\n\tif(this._cbs.ontext) this._cbs.ontext(data);\n};\n\nParser.prototype.onopentagname = function(name){\n\tif(this._lowerCaseTagNames){\n\t\tname = name.toLowerCase();\n\t}\n\n\tthis._tagname = name;\n\n\tif(!this._options.xmlMode && name in openImpliesClose) {\n\t\tfor(\n\t\t\tvar el;\n\t\t\t(el = this._stack[this._stack.length - 1]) in openImpliesClose[name];\n\t\t\tthis.onclosetag(el)\n\t\t);\n\t}\n\n\tif(this._options.xmlMode || !(name in voidElements)){\n\t\tthis._stack.push(name);\n\t\tif(name in foreignContextElements) this._foreignContext.push(true);\n\t\telse if(name in htmlIntegrationElements) this._foreignContext.push(false);\n\t}\n\n\tif(this._cbs.onopentagname) this._cbs.onopentagname(name);\n\tif(this._cbs.onopentag) this._attribs = {};\n};\n\nParser.prototype.onopentagend = function(){\n\tthis._updatePosition(1);\n\n\tif(this._attribs){\n\t\tif(this._cbs.onopentag) this._cbs.onopentag(this._tagname, this._attribs);\n\t\tthis._attribs = null;\n\t}\n\n\tif(!this._options.xmlMode && this._cbs.onclosetag && this._tagname in voidElements){\n\t\tthis._cbs.onclosetag(this._tagname);\n\t}\n\n\tthis._tagname = \"\";\n};\n\nParser.prototype.onclosetag = function(name){\n\tthis._updatePosition(1);\n\n\tif(this._lowerCaseTagNames){\n\t\tname = name.toLowerCase();\n\t}\n\n\tif(this._stack.length && (!(name in voidElements) || this._options.xmlMode)){\n\t\tvar pos = this._stack.lastIndexOf(name);\n\t\tif(pos !== -1){\n\t\t\tif(this._cbs.onclosetag){\n\t\t\t\tpos = this._stack.length - pos;\n\t\t\t\twhile(pos--) this._cbs.onclosetag(this._stack.pop());\n\t\t\t}\n\t\t\telse this._stack.length = pos;\n\t\t} else if(name === \"p\" && !this._options.xmlMode){\n\t\t\tthis.onopentagname(name);\n\t\t\tthis._closeCurrentTag();\n\t\t}\n\t} else if(!this._options.xmlMode && (name === \"br\" || name === \"p\")){\n\t\tthis.onopentagname(name);\n\t\tthis._closeCurrentTag();\n\t}\n};\n\nParser.prototype.onselfclosingtag = function(){\n\tif(this._options.xmlMode || this._options.recognizeSelfClosing\n\t\t|| this._foreignContext[this._foreignContext.length - 1]){\n\t\tthis._closeCurrentTag();\n\t} else {\n\t\tthis.onopentagend();\n\t}\n};\n\nParser.prototype._closeCurrentTag = function(){\n\tvar name = this._tagname;\n\n\tthis.onopentagend();\n\n\t//self-closing tags will be on the top of the stack\n\t//(cheaper check than in onclosetag)\n\tif(this._stack[this._stack.length - 1] === name){\n\t\tif(this._cbs.onclosetag){\n\t\t\tthis._cbs.onclosetag(name);\n\t\t}\n\t\tthis._stack.pop();\n\t\tif((name in foreignContextElements) || (name in htmlIntegrationElements)){\n\t\t\tthis._foreignContext.pop();\n\t\t}\n\t}\n};\n\nParser.prototype.onattribname = function(name){\n\tif(this._lowerCaseAttributeNames){\n\t\tname = name.toLowerCase();\n\t}\n\tthis._attribname = name;\n};\n\nParser.prototype.onattribdata = function(value){\n\tthis._attribvalue += value;\n};\n\nParser.prototype.onattribend = function(){\n\tif(this._cbs.onattribute) this._cbs.onattribute(this._attribname, this._attribvalue);\n\tif(\n\t\tthis._attribs &&\n\t\t!Object.prototype.hasOwnProperty.call(this._attribs, this._attribname)\n\t){\n\t\tthis._attribs[this._attribname] = this._attribvalue;\n\t}\n\tthis._attribname = \"\";\n\tthis._attribvalue = \"\";\n};\n\nParser.prototype._getInstructionName = function(value){\n\tvar idx = value.search(re_nameEnd),\n\t name = idx < 0 ? value : value.substr(0, idx);\n\n\tif(this._lowerCaseTagNames){\n\t\tname = name.toLowerCase();\n\t}\n\n\treturn name;\n};\n\nParser.prototype.ondeclaration = function(value){\n\tif(this._cbs.onprocessinginstruction){\n\t\tvar name = this._getInstructionName(value);\n\t\tthis._cbs.onprocessinginstruction(\"!\" + name, \"!\" + value);\n\t}\n};\n\nParser.prototype.onprocessinginstruction = function(value){\n\tif(this._cbs.onprocessinginstruction){\n\t\tvar name = this._getInstructionName(value);\n\t\tthis._cbs.onprocessinginstruction(\"?\" + name, \"?\" + value);\n\t}\n};\n\nParser.prototype.oncomment = function(value){\n\tthis._updatePosition(4);\n\n\tif(this._cbs.oncomment) this._cbs.oncomment(value);\n\tif(this._cbs.oncommentend) this._cbs.oncommentend();\n};\n\nParser.prototype.oncdata = function(value){\n\tthis._updatePosition(1);\n\n\tif(this._options.xmlMode || this._options.recognizeCDATA){\n\t\tif(this._cbs.oncdatastart) this._cbs.oncdatastart();\n\t\tif(this._cbs.ontext) this._cbs.ontext(value);\n\t\tif(this._cbs.oncdataend) this._cbs.oncdataend();\n\t} else {\n\t\tthis.oncomment(\"[CDATA[\" + value + \"]]\");\n\t}\n};\n\nParser.prototype.onerror = function(err){\n\tif(this._cbs.onerror) this._cbs.onerror(err);\n};\n\nParser.prototype.onend = function(){\n\tif(this._cbs.onclosetag){\n\t\tfor(\n\t\t\tvar i = this._stack.length;\n\t\t\ti > 0;\n\t\t\tthis._cbs.onclosetag(this._stack[--i])\n\t\t);\n\t}\n\tif(this._cbs.onend) this._cbs.onend();\n};\n\n\n//Resets the parser to a blank state, ready to parse a new HTML document\nParser.prototype.reset = function(){\n\tif(this._cbs.onreset) this._cbs.onreset();\n\tthis._tokenizer.reset();\n\n\tthis._tagname = \"\";\n\tthis._attribname = \"\";\n\tthis._attribs = null;\n\tthis._stack = [];\n\n\tif(this._cbs.onparserinit) this._cbs.onparserinit(this);\n};\n\n//Parses a complete HTML document and pushes it to the handler\nParser.prototype.parseComplete = function(data){\n\tthis.reset();\n\tthis.end(data);\n};\n\nParser.prototype.write = function(chunk){\n\tthis._tokenizer.write(chunk);\n};\n\nParser.prototype.end = function(chunk){\n\tthis._tokenizer.end(chunk);\n};\n\nParser.prototype.pause = function(){\n\tthis._tokenizer.pause();\n};\n\nParser.prototype.resume = function(){\n\tthis._tokenizer.resume();\n};\n\n//alias for backwards compat\nParser.prototype.parseChunk = Parser.prototype.write;\nParser.prototype.done = Parser.prototype.end;\n\nmodule.exports = Parser;\n","//Types of elements found in the DOM\nmodule.exports = {\n\tText: \"text\", //Text\n\tDirective: \"directive\", //<? ... ?>\n\tComment: \"comment\", //<!-- ... -->\n\tScript: \"script\", //<script> tags\n\tStyle: \"style\", //<style> tags\n\tTag: \"tag\", //Any tag\n\tCDATA: \"cdata\", //<![CDATA[ ... ]]>\n\tDoctype: \"doctype\",\n\n\tisTag: function(elem){\n\t\treturn elem.type === \"tag\" || elem.type === \"script\" || elem.type === \"style\";\n\t}\n};\n","// This object will be used as the prototype for Nodes when creating a\n// DOM-Level-1-compliant structure.\nvar NodePrototype = module.exports = {\n\tget firstChild() {\n\t\tvar children = this.children;\n\t\treturn children && children[0] || null;\n\t},\n\tget lastChild() {\n\t\tvar children = this.children;\n\t\treturn children && children[children.length - 1] || null;\n\t},\n\tget nodeType() {\n\t\treturn nodeTypes[this.type] || nodeTypes.element;\n\t}\n};\n\nvar domLvl1 = {\n\ttagName: \"name\",\n\tchildNodes: \"children\",\n\tparentNode: \"parent\",\n\tpreviousSibling: \"prev\",\n\tnextSibling: \"next\",\n\tnodeValue: \"data\"\n};\n\nvar nodeTypes = {\n\telement: 1,\n\ttext: 3,\n\tcdata: 4,\n\tcomment: 8\n};\n\nObject.keys(domLvl1).forEach(function(key) {\n\tvar shorthand = domLvl1[key];\n\tObject.defineProperty(NodePrototype, key, {\n\t\tget: function() {\n\t\t\treturn this[shorthand] || null;\n\t\t},\n\t\tset: function(val) {\n\t\t\tthis[shorthand] = val;\n\t\t\treturn val;\n\t\t}\n\t});\n});\n","// DOM-Level-1-compliant structure\nvar NodePrototype = require('./node');\nvar ElementPrototype = module.exports = Object.create(NodePrototype);\n\nvar domLvl1 = {\n\ttagName: \"name\"\n};\n\nObject.keys(domLvl1).forEach(function(key) {\n\tvar shorthand = domLvl1[key];\n\tObject.defineProperty(ElementPrototype, key, {\n\t\tget: function() {\n\t\t\treturn this[shorthand] || null;\n\t\t},\n\t\tset: function(val) {\n\t\t\tthis[shorthand] = val;\n\t\t\treturn val;\n\t\t}\n\t});\n});\n","var ElementType = require(\"domelementtype\");\n\nvar re_whitespace = /\\s+/g;\nvar NodePrototype = require(\"./lib/node\");\nvar ElementPrototype = require(\"./lib/element\");\n\nfunction DomHandler(callback, options, elementCB){\n\tif(typeof callback === \"object\"){\n\t\telementCB = options;\n\t\toptions = callback;\n\t\tcallback = null;\n\t} else if(typeof options === \"function\"){\n\t\telementCB = options;\n\t\toptions = defaultOpts;\n\t}\n\tthis._callback = callback;\n\tthis._options = options || defaultOpts;\n\tthis._elementCB = elementCB;\n\tthis.dom = [];\n\tthis._done = false;\n\tthis._tagStack = [];\n\tthis._parser = this._parser || null;\n}\n\n//default options\nvar defaultOpts = {\n\tnormalizeWhitespace: false, //Replace all whitespace with single spaces\n\twithStartIndices: false, //Add startIndex properties to nodes\n\twithEndIndices: false, //Add endIndex properties to nodes\n};\n\nDomHandler.prototype.onparserinit = function(parser){\n\tthis._parser = parser;\n};\n\n//Resets the handler back to starting state\nDomHandler.prototype.onreset = function(){\n\tDomHandler.call(this, this._callback, this._options, this._elementCB);\n};\n\n//Signals the handler that parsing is done\nDomHandler.prototype.onend = function(){\n\tif(this._done) return;\n\tthis._done = true;\n\tthis._parser = null;\n\tthis._handleCallback(null);\n};\n\nDomHandler.prototype._handleCallback =\nDomHandler.prototype.onerror = function(error){\n\tif(typeof this._callback === \"function\"){\n\t\tthis._callback(error, this.dom);\n\t} else {\n\t\tif(error) throw error;\n\t}\n};\n\nDomHandler.prototype.onclosetag = function(){\n\t//if(this._tagStack.pop().name !== name) this._handleCallback(Error(\"Tagname didn't match!\"));\n\t\n\tvar elem = this._tagStack.pop();\n\n\tif(this._options.withEndIndices && elem){\n\t\telem.endIndex = this._parser.endIndex;\n\t}\n\n\tif(this._elementCB) this._elementCB(elem);\n};\n\nDomHandler.prototype._createDomElement = function(properties){\n\tif (!this._options.withDomLvl1) return properties;\n\n\tvar element;\n\tif (properties.type === \"tag\") {\n\t\telement = Object.create(ElementPrototype);\n\t} else {\n\t\telement = Object.create(NodePrototype);\n\t}\n\n\tfor (var key in properties) {\n\t\tif (properties.hasOwnProperty(key)) {\n\t\t\telement[key] = properties[key];\n\t\t}\n\t}\n\n\treturn element;\n};\n\nDomHandler.prototype._addDomElement = function(element){\n\tvar parent = this._tagStack[this._tagStack.length - 1];\n\tvar siblings = parent ? parent.children : this.dom;\n\tvar previousSibling = siblings[siblings.length - 1];\n\n\telement.next = null;\n\n\tif(this._options.withStartIndices){\n\t\telement.startIndex = this._parser.startIndex;\n\t}\n\tif(this._options.withEndIndices){\n\t\telement.endIndex = this._parser.endIndex;\n\t}\n\n\tif(previousSibling){\n\t\telement.prev = previousSibling;\n\t\tpreviousSibling.next = element;\n\t} else {\n\t\telement.prev = null;\n\t}\n\n\tsiblings.push(element);\n\telement.parent = parent || null;\n};\n\nDomHandler.prototype.onopentag = function(name, attribs){\n\tvar properties = {\n\t\ttype: name === \"script\" ? ElementType.Script : name === \"style\" ? ElementType.Style : ElementType.Tag,\n\t\tname: name,\n\t\tattribs: attribs,\n\t\tchildren: []\n\t};\n\n\tvar element = this._createDomElement(properties);\n\n\tthis._addDomElement(element);\n\n\tthis._tagStack.push(element);\n};\n\nDomHandler.prototype.ontext = function(data){\n\t//the ignoreWhitespace is officially dropped, but for now,\n\t//it's an alias for normalizeWhitespace\n\tvar normalize = this._options.normalizeWhitespace || this._options.ignoreWhitespace;\n\n\tvar lastTag;\n\n\tif(!this._tagStack.length && this.dom.length && (lastTag = this.dom[this.dom.length-1]).type === ElementType.Text){\n\t\tif(normalize){\n\t\t\tlastTag.data = (lastTag.data + data).replace(re_whitespace, \" \");\n\t\t} else {\n\t\t\tlastTag.data += data;\n\t\t}\n\t} else {\n\t\tif(\n\t\t\tthis._tagStack.length &&\n\t\t\t(lastTag = this._tagStack[this._tagStack.length - 1]) &&\n\t\t\t(lastTag = lastTag.children[lastTag.children.length - 1]) &&\n\t\t\tlastTag.type === ElementType.Text\n\t\t){\n\t\t\tif(normalize){\n\t\t\t\tlastTag.data = (lastTag.data + data).replace(re_whitespace, \" \");\n\t\t\t} else {\n\t\t\t\tlastTag.data += data;\n\t\t\t}\n\t\t} else {\n\t\t\tif(normalize){\n\t\t\t\tdata = data.replace(re_whitespace, \" \");\n\t\t\t}\n\n\t\t\tvar element = this._createDomElement({\n\t\t\t\tdata: data,\n\t\t\t\ttype: ElementType.Text\n\t\t\t});\n\n\t\t\tthis._addDomElement(element);\n\t\t}\n\t}\n};\n\nDomHandler.prototype.oncomment = function(data){\n\tvar lastTag = this._tagStack[this._tagStack.length - 1];\n\n\tif(lastTag && lastTag.type === ElementType.Comment){\n\t\tlastTag.data += data;\n\t\treturn;\n\t}\n\n\tvar properties = {\n\t\tdata: data,\n\t\ttype: ElementType.Comment\n\t};\n\n\tvar element = this._createDomElement(properties);\n\n\tthis._addDomElement(element);\n\tthis._tagStack.push(element);\n};\n\nDomHandler.prototype.oncdatastart = function(){\n\tvar properties = {\n\t\tchildren: [{\n\t\t\tdata: \"\",\n\t\t\ttype: ElementType.Text\n\t\t}],\n\t\ttype: ElementType.CDATA\n\t};\n\n\tvar element = this._createDomElement(properties);\n\n\tthis._addDomElement(element);\n\tthis._tagStack.push(element);\n};\n\nDomHandler.prototype.oncommentend = DomHandler.prototype.oncdataend = function(){\n\tthis._tagStack.pop();\n};\n\nDomHandler.prototype.onprocessinginstruction = function(name, data){\n\tvar element = this._createDomElement({\n\t\tname: name,\n\t\tdata: data,\n\t\ttype: ElementType.Directive\n\t});\n\n\tthis._addDomElement(element);\n};\n\nmodule.exports = DomHandler;\n","var index = require(\"./index.js\");\nvar DomHandler = index.DomHandler;\nvar DomUtils = index.DomUtils;\n\n//TODO: make this a streamable handler\nfunction FeedHandler(callback, options){\n\tthis.init(callback, options);\n}\n\nrequire(\"inherits\")(FeedHandler, DomHandler);\n\nFeedHandler.prototype.init = DomHandler;\n\nfunction getElements(what, where){\n\treturn DomUtils.getElementsByTagName(what, where, true);\n}\nfunction getOneElement(what, where){\n\treturn DomUtils.getElementsByTagName(what, where, true, 1)[0];\n}\nfunction fetch(what, where, recurse){\n\treturn DomUtils.getText(\n\t\tDomUtils.getElementsByTagName(what, where, recurse, 1)\n\t).trim();\n}\n\nfunction addConditionally(obj, prop, what, where, recurse){\n\tvar tmp = fetch(what, where, recurse);\n\tif(tmp) obj[prop] = tmp;\n}\n\nvar isValidFeed = function(value){\n\treturn value === \"rss\" || value === \"feed\" || value === \"rdf:RDF\";\n};\n\nFeedHandler.prototype.onend = function(){\n\tvar feed = {},\n\t feedRoot = getOneElement(isValidFeed, this.dom),\n\t tmp, childs;\n\n\tif(feedRoot){\n\t\tif(feedRoot.name === \"feed\"){\n\t\t\tchilds = feedRoot.children;\n\n\t\t\tfeed.type = \"atom\";\n\t\t\taddConditionally(feed, \"id\", \"id\", childs);\n\t\t\taddConditionally(feed, \"title\", \"title\", childs);\n\t\t\tif((tmp = getOneElement(\"link\", childs)) && (tmp = tmp.attribs) && (tmp = tmp.href)) feed.link = tmp;\n\t\t\taddConditionally(feed, \"description\", \"subtitle\", childs);\n\t\t\tif((tmp = fetch(\"updated\", childs))) feed.updated = new Date(tmp);\n\t\t\taddConditionally(feed, \"author\", \"email\", childs, true);\n\n\t\t\tfeed.items = getElements(\"entry\", childs).map(function(item){\n\t\t\t\tvar entry = {}, tmp;\n\n\t\t\t\titem = item.children;\n\n\t\t\t\taddConditionally(entry, \"id\", \"id\", item);\n\t\t\t\taddConditionally(entry, \"title\", \"title\", item);\n\t\t\t\tif((tmp = getOneElement(\"link\", item)) && (tmp = tmp.attribs) && (tmp = tmp.href)) entry.link = tmp;\n\t\t\t\tif((tmp = fetch(\"summary\", item) || fetch(\"content\", item))) entry.description = tmp;\n\t\t\t\tif((tmp = fetch(\"updated\", item))) entry.pubDate = new Date(tmp);\n\t\t\t\treturn entry;\n\t\t\t});\n\t\t} else {\n\t\t\tchilds = getOneElement(\"channel\", feedRoot.children).children;\n\n\t\t\tfeed.type = feedRoot.name.substr(0, 3);\n\t\t\tfeed.id = \"\";\n\t\t\taddConditionally(feed, \"title\", \"title\", childs);\n\t\t\taddConditionally(feed, \"link\", \"link\", childs);\n\t\t\taddConditionally(feed, \"description\", \"description\", childs);\n\t\t\tif((tmp = fetch(\"lastBuildDate\", childs))) feed.updated = new Date(tmp);\n\t\t\taddConditionally(feed, \"author\", \"managingEditor\", childs, true);\n\n\t\t\tfeed.items = getElements(\"item\", feedRoot.children).map(function(item){\n\t\t\t\tvar entry = {}, tmp;\n\n\t\t\t\titem = item.children;\n\n\t\t\t\taddConditionally(entry, \"id\", \"guid\", item);\n\t\t\t\taddConditionally(entry, \"title\", \"title\", item);\n\t\t\t\taddConditionally(entry, \"link\", \"link\", item);\n\t\t\t\taddConditionally(entry, \"description\", \"description\", item);\n\t\t\t\tif((tmp = fetch(\"pubDate\", item))) entry.pubDate = new Date(tmp);\n\t\t\t\treturn entry;\n\t\t\t});\n\t\t}\n\t}\n\tthis.dom = feed;\n\tDomHandler.prototype._handleCallback.call(\n\t\tthis, feedRoot ? null : Error(\"couldn't find root of feed\")\n\t);\n};\n\nmodule.exports = FeedHandler;\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n for (var i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(\n uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)\n ))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","exports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","var toString = {}.toString;\n\nmodule.exports = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar isArray = require('isarray')\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n * incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n ? global.TYPED_ARRAY_SUPPORT\n : typedArraySupport()\n\n/*\n * Export kMaxLength after typed array support is determined.\n */\nexports.kMaxLength = kMaxLength()\n\nfunction typedArraySupport () {\n try {\n var arr = new Uint8Array(1)\n arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }}\n return arr.foo() === 42 && // typed array instances can be augmented\n typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`\n } catch (e) {\n return false\n }\n}\n\nfunction kMaxLength () {\n return Buffer.TYPED_ARRAY_SUPPORT\n ? 0x7fffffff\n : 0x3fffffff\n}\n\nfunction createBuffer (that, length) {\n if (kMaxLength() < length) {\n throw new RangeError('Invalid typed array length')\n }\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = new Uint8Array(length)\n that.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n if (that === null) {\n that = new Buffer(length)\n }\n that.length = length\n }\n\n return that\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\n// TODO: Legacy, not needed anymore. Remove in next major version.\nBuffer._augment = function (arr) {\n arr.__proto__ = Buffer.prototype\n return arr\n}\n\nfunction from (that, value, encodingOrOffset, length) {\n if (typeof value === 'number') {\n throw new TypeError('\"value\" argument must not be a number')\n }\n\n if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n return fromArrayBuffer(that, value, encodingOrOffset, length)\n }\n\n if (typeof value === 'string') {\n return fromString(that, value, encodingOrOffset)\n }\n\n return fromObject(that, value)\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(null, value, encodingOrOffset, length)\n}\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n Buffer.prototype.__proto__ = Uint8Array.prototype\n Buffer.__proto__ = Uint8Array\n if (typeof Symbol !== 'undefined' && Symbol.species &&\n Buffer[Symbol.species] === Buffer) {\n // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true\n })\n }\n}\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n } else if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n}\n\nfunction alloc (that, size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(that, size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpretted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(that, size).fill(fill, encoding)\n : createBuffer(that, size).fill(fill)\n }\n return createBuffer(that, size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(null, size, fill, encoding)\n}\n\nfunction allocUnsafe (that, size) {\n assertSize(size)\n that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n that[i] = 0\n }\n }\n return that\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(null, size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(null, size)\n}\n\nfunction fromString (that, string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('\"encoding\" must be a valid string encoding')\n }\n\n var length = byteLength(string, encoding) | 0\n that = createBuffer(that, length)\n\n var actual = that.write(string, encoding)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n that = that.slice(0, actual)\n }\n\n return that\n}\n\nfunction fromArrayLike (that, array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0\n that = createBuffer(that, length)\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255\n }\n return that\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n array.byteLength // this throws if `array` is not a valid ArrayBuffer\n\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\\'offset\\' is out of bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\\'length\\' is out of bounds')\n }\n\n if (byteOffset === undefined && length === undefined) {\n array = new Uint8Array(array)\n } else if (length === undefined) {\n array = new Uint8Array(array, byteOffset)\n } else {\n array = new Uint8Array(array, byteOffset, length)\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = array\n that.__proto__ = Buffer.prototype\n } else {\n // Fallback: Return an object instance of the Buffer class\n that = fromArrayLike(that, array)\n }\n return that\n}\n\nfunction fromObject (that, obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0\n that = createBuffer(that, len)\n\n if (that.length === 0) {\n return that\n }\n\n obj.copy(that, 0, 0, len)\n return that\n }\n\n if (obj) {\n if ((typeof ArrayBuffer !== 'undefined' &&\n obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n if (typeof obj.length !== 'number' || isnan(obj.length)) {\n return createBuffer(that, 0)\n }\n return fromArrayLike(that, obj)\n }\n\n if (obj.type === 'Buffer' && isArray(obj.data)) {\n return fromArrayLike(that, obj.data)\n }\n }\n\n throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction checked (length) {\n // Note: cannot use `length < kMaxLength()` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= kMaxLength()) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength().toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return !!(b != null && b._isBuffer)\n}\n\nBuffer.compare = function compare (a, b) {\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError('Arguments must be Buffers')\n }\n\n if (a === b) return 0\n\n var x = a.length\n var y = b.length\n\n for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n var i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n var buffer = Buffer.allocUnsafe(length)\n var pos = 0\n for (i = 0; i < list.length; ++i) {\n var buf = list[i]\n if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n buf.copy(buffer, pos)\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n string = '' + string\n }\n\n var len = string.length\n if (len === 0) return 0\n\n // Use a for loop to avoid recursion\n var loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n case undefined:\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) return utf8ToBytes(string).length // assume utf8\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n var loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n var i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n var len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (var i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n var len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (var i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n var len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (var i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n var length = this.length | 0\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n var str = ''\n var max = exports.INSPECT_MAX_BYTES\n if (this.length > 0) {\n str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')\n if (this.length > max) str += ' ... '\n }\n return '<Buffer ' + str + '>'\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (!Buffer.isBuffer(target)) {\n throw new TypeError('Argument must be a Buffer')\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n var x = thisEnd - thisStart\n var y = end - start\n var len = Math.min(x, y)\n\n var thisCopy = this.slice(thisStart, thisEnd)\n var targetCopy = target.slice(start, end)\n\n for (var i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (isNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (Buffer.TYPED_ARRAY_SUPPORT &&\n typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n var indexSize = 1\n var arrLength = arr.length\n var valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n var i\n if (dir) {\n var foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n var found = true\n for (var j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n var remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n // must be an even number of digits\n var strLen = string.length\n if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n for (var i = 0; i < length; ++i) {\n var parsed = parseInt(string.substr(i * 2, 2), 16)\n if (isNaN(parsed)) return i\n buf[offset + i] = parsed\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset | 0\n if (isFinite(length)) {\n length = length | 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n // legacy write(string, encoding, offset, length) - remove in v0.13\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n var remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8'\n\n var loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n return asciiWrite(this, string, offset, length)\n\n case 'latin1':\n case 'binary':\n return latin1Write(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n var res = []\n\n var i = start\n while (i < end) {\n var firstByte = buf[i]\n var codePoint = null\n var bytesPerSequence = (firstByte > 0xEF) ? 4\n : (firstByte > 0xDF) ? 3\n : (firstByte > 0xBF) ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n var secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n var len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n var res = ''\n var i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n var ret = ''\n end = Math.min(buf.length, end)\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n var ret = ''\n end = Math.min(buf.length, end)\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n var len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n var out = ''\n for (var i = start; i < end; ++i) {\n out += toHex(buf[i])\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n var bytes = buf.slice(start, end)\n var res = ''\n for (var i = 0; i < bytes.length; i += 2) {\n res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n var len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n var newBuf\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n newBuf = this.subarray(start, end)\n newBuf.__proto__ = Buffer.prototype\n } else {\n var sliceLen = end - start\n newBuf = new Buffer(sliceLen, undefined)\n for (var i = 0; i < sliceLen; ++i) {\n newBuf[i] = this[i + start]\n }\n }\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n var val = this[offset]\n var mul = 1\n var i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n var val = this[offset + --byteLength]\n var mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n var val = this[offset]\n var mul = 1\n var i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n var i = byteLength\n var mul = 1\n var val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n var val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length)\n var val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n var mul = 1\n var i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n byteLength = byteLength | 0\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n var i = byteLength - 1\n var mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffff + value + 1\n for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n (littleEndian ? i : 1 - i) * 8\n }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n } else {\n objectWriteUInt16(this, value, offset, true)\n }\n return offset + 2\n}\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n } else {\n objectWriteUInt16(this, value, offset, false)\n }\n return offset + 2\n}\n\nfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffffffff + value + 1\n for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff\n }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n } else {\n objectWriteUInt32(this, value, offset, true)\n }\n return offset + 4\n}\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n } else {\n objectWriteUInt32(this, value, offset, false)\n }\n return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n var i = 0\n var mul = 1\n var sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n var i = byteLength - 1\n var mul = 1\n var sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n } else {\n objectWriteUInt16(this, value, offset, true)\n }\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n } else {\n objectWriteUInt16(this, value, offset, false)\n }\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n } else {\n objectWriteUInt32(this, value, offset, true)\n }\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset | 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n } else {\n objectWriteUInt32(this, value, offset, false)\n }\n return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n var len = end - start\n var i\n\n if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start]\n }\n } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n // ascending copy from start\n for (i = 0; i < len; ++i) {\n target[i + targetStart] = this[i + start]\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, start + len),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\n end = this.length\n }\n if (val.length === 1) {\n var code = val.charCodeAt(0)\n if (code < 256) {\n val = code\n }\n }\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n } else if (typeof val === 'number') {\n val = val & 255\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n var i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n var bytes = Buffer.isBuffer(val)\n ? val\n : utf8ToBytes(new Buffer(val, encoding).toString())\n var len = bytes.length\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = stringtrim(str).replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction stringtrim (str) {\n if (str.trim) return str.trim()\n return str.replace(/^\\s+|\\s+$/g, '')\n}\n\nfunction toHex (n) {\n if (n < 16) return '0' + n.toString(16)\n return n.toString(16)\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n var codePoint\n var length = string.length\n var leadSurrogate = null\n var bytes = []\n\n for (var i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n var byteArray = []\n for (var i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n var c, hi, lo\n var byteArray = []\n for (var i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n for (var i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\nfunction isnan (val) {\n return val !== val // eslint-disable-line no-self-compare\n}\n","/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\n/*</replacement>*/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\n enc = ('' + enc).toLowerCase();\n retried = true;\n }\n }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n if (buf.length === 0) return '';\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return '';\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xC0) !== 0x80) {\n self.lastNeed = 2;\n return '\\ufffd';\n }\n }\n }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString('utf8', i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xD800 && c <= 0xDBFF) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\n }\n return r;\n}\n\nfunction base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString('base64', i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","module.exports = Stream;\n\nvar Parser = require(\"./Parser.js\");\nvar WritableStream = require(\"readable-stream\").Writable;\nvar StringDecoder = require(\"string_decoder\").StringDecoder;\nvar Buffer = require(\"buffer\").Buffer;\n\nfunction Stream(cbs, options){\n\tvar parser = this._parser = new Parser(cbs, options);\n\tvar decoder = this._decoder = new StringDecoder();\n\n\tWritableStream.call(this, {decodeStrings: false});\n\n\tthis.once(\"finish\", function(){\n\t\tparser.end(decoder.end());\n\t});\n}\n\nrequire(\"inherits\")(Stream, WritableStream);\n\nWritableStream.prototype._write = function(chunk, encoding, cb){\n\tif(chunk instanceof Buffer) chunk = this._decoder.write(chunk);\n\tthis._parser.write(chunk);\n\tcb();\n};\n","module.exports = Stream;\n\nvar Parser = require(\"./WritableStream.js\");\n\nfunction Stream(options){\n\tParser.call(this, new Cbs(this), options);\n}\n\nrequire(\"inherits\")(Stream, Parser);\n\nStream.prototype.readable = true;\n\nfunction Cbs(scope){\n\tthis.scope = scope;\n}\n\nvar EVENTS = require(\"../\").EVENTS;\n\nObject.keys(EVENTS).forEach(function(name){\n\tif(EVENTS[name] === 0){\n\t\tCbs.prototype[\"on\" + name] = function(){\n\t\t\tthis.scope.emit(name);\n\t\t};\n\t} else if(EVENTS[name] === 1){\n\t\tCbs.prototype[\"on\" + name] = function(a){\n\t\t\tthis.scope.emit(name, a);\n\t\t};\n\t} else if(EVENTS[name] === 2){\n\t\tCbs.prototype[\"on\" + name] = function(a, b){\n\t\t\tthis.scope.emit(name, a, b);\n\t\t};\n\t} else {\n\t\tthrow Error(\"wrong number of arguments!\");\n\t}\n});","module.exports = ProxyHandler;\n\nfunction ProxyHandler(cbs){\n\tthis._cbs = cbs || {};\n}\n\nvar EVENTS = require(\"./\").EVENTS;\nObject.keys(EVENTS).forEach(function(name){\n\tif(EVENTS[name] === 0){\n\t\tname = \"on\" + name;\n\t\tProxyHandler.prototype[name] = function(){\n\t\t\tif(this._cbs[name]) this._cbs[name]();\n\t\t};\n\t} else if(EVENTS[name] === 1){\n\t\tname = \"on\" + name;\n\t\tProxyHandler.prototype[name] = function(a){\n\t\t\tif(this._cbs[name]) this._cbs[name](a);\n\t\t};\n\t} else if(EVENTS[name] === 2){\n\t\tname = \"on\" + name;\n\t\tProxyHandler.prototype[name] = function(a, b){\n\t\t\tif(this._cbs[name]) this._cbs[name](a, b);\n\t\t};\n\t} else {\n\t\tthrow Error(\"wrong number of arguments\");\n\t}\n});","//Types of elements found in the DOM\nmodule.exports = {\n\tText: \"text\", //Text\n\tDirective: \"directive\", //<? ... ?>\n\tComment: \"comment\", //<!-- ... -->\n\tScript: \"script\", //<script> tags\n\tStyle: \"style\", //<style> tags\n\tTag: \"tag\", //Any tag\n\tCDATA: \"cdata\", //<![CDATA[ ... ]]>\n\n\tisTag: function(elem){\n\t\treturn elem.type === \"tag\" || elem.type === \"script\" || elem.type === \"style\";\n\t}\n};","var inverseXML = getInverseObj(require(\"../maps/xml.json\")),\n xmlReplacer = getInverseReplacer(inverseXML);\n\nexports.XML = getInverse(inverseXML, xmlReplacer);\n\nvar inverseHTML = getInverseObj(require(\"../maps/entities.json\")),\n htmlReplacer = getInverseReplacer(inverseHTML);\n\nexports.HTML = getInverse(inverseHTML, htmlReplacer);\n\nfunction getInverseObj(obj) {\n return Object.keys(obj)\n .sort()\n .reduce(function(inverse, name) {\n inverse[obj[name]] = \"&\" + name + \";\";\n return inverse;\n }, {});\n}\n\nfunction getInverseReplacer(inverse) {\n var single = [],\n multiple = [];\n\n Object.keys(inverse).forEach(function(k) {\n if (k.length === 1) {\n single.push(\"\\\\\" + k);\n } else {\n multiple.push(k);\n }\n });\n\n //TODO add ranges\n multiple.unshift(\"[\" + single.join(\"\") + \"]\");\n\n return new RegExp(multiple.join(\"|\"), \"g\");\n}\n\nvar re_nonASCII = /[^\\0-\\x7F]/g,\n re_astralSymbols = /[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]/g;\n\nfunction singleCharReplacer(c) {\n return (\n \"&#x\" +\n c\n .charCodeAt(0)\n .toString(16)\n .toUpperCase() +\n \";\"\n );\n}\n\nfunction astralReplacer(c) {\n // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae\n var high = c.charCodeAt(0);\n var low = c.charCodeAt(1);\n var codePoint = (high - 0xd800) * 0x400 + low - 0xdc00 + 0x10000;\n return \"&#x\" + codePoint.toString(16).toUpperCase() + \";\";\n}\n\nfunction getInverse(inverse, re) {\n function func(name) {\n return inverse[name];\n }\n\n return function(data) {\n return data\n .replace(re, func)\n .replace(re_astralSymbols, astralReplacer)\n .replace(re_nonASCII, singleCharReplacer);\n };\n}\n\nvar re_xmlChars = getInverseReplacer(inverseXML);\n\nfunction escapeXML(data) {\n return data\n .replace(re_xmlChars, singleCharReplacer)\n .replace(re_astralSymbols, astralReplacer)\n .replace(re_nonASCII, singleCharReplacer);\n}\n\nexports.escape = escapeXML;\n","var entityMap = require(\"../maps/entities.json\"),\n legacyMap = require(\"../maps/legacy.json\"),\n xmlMap = require(\"../maps/xml.json\"),\n decodeCodePoint = require(\"./decode_codepoint.js\");\n\nvar decodeXMLStrict = getStrictDecoder(xmlMap),\n decodeHTMLStrict = getStrictDecoder(entityMap);\n\nfunction getStrictDecoder(map) {\n var keys = Object.keys(map).join(\"|\"),\n replace = getReplacer(map);\n\n keys += \"|#[xX][\\\\da-fA-F]+|#\\\\d+\";\n\n var re = new RegExp(\"&(?:\" + keys + \");\", \"g\");\n\n return function(str) {\n return String(str).replace(re, replace);\n };\n}\n\nvar decodeHTML = (function() {\n var legacy = Object.keys(legacyMap).sort(sorter);\n\n var keys = Object.keys(entityMap).sort(sorter);\n\n for (var i = 0, j = 0; i < keys.length; i++) {\n if (legacy[j] === keys[i]) {\n keys[i] += \";?\";\n j++;\n } else {\n keys[i] += \";\";\n }\n }\n\n var re = new RegExp(\"&(?:\" + keys.join(\"|\") + \"|#[xX][\\\\da-fA-F]+;?|#\\\\d+;?)\", \"g\"),\n replace = getReplacer(entityMap);\n\n function replacer(str) {\n if (str.substr(-1) !== \";\") str += \";\";\n return replace(str);\n }\n\n //TODO consider creating a merged map\n return function(str) {\n return String(str).replace(re, replacer);\n };\n})();\n\nfunction sorter(a, b) {\n return a < b ? 1 : -1;\n}\n\nfunction getReplacer(map) {\n return function replace(str) {\n if (str.charAt(1) === \"#\") {\n if (str.charAt(2) === \"X\" || str.charAt(2) === \"x\") {\n return decodeCodePoint(parseInt(str.substr(3), 16));\n }\n return decodeCodePoint(parseInt(str.substr(2), 10));\n }\n return map[str.slice(1, -1)];\n };\n}\n\nmodule.exports = {\n XML: decodeXMLStrict,\n HTML: decodeHTML,\n HTMLStrict: decodeHTMLStrict\n};\n","var encode = require(\"./lib/encode.js\"),\n decode = require(\"./lib/decode.js\");\n\nexports.decode = function(data, level) {\n return (!level || level <= 0 ? decode.XML : decode.HTML)(data);\n};\n\nexports.decodeStrict = function(data, level) {\n return (!level || level <= 0 ? decode.XML : decode.HTMLStrict)(data);\n};\n\nexports.encode = function(data, level) {\n return (!level || level <= 0 ? encode.XML : encode.HTML)(data);\n};\n\nexports.encodeXML = encode.XML;\n\nexports.encodeHTML4 = exports.encodeHTML5 = exports.encodeHTML = encode.HTML;\n\nexports.decodeXML = exports.decodeXMLStrict = decode.XML;\n\nexports.decodeHTML4 = exports.decodeHTML5 = exports.decodeHTML = decode.HTML;\n\nexports.decodeHTML4Strict = exports.decodeHTML5Strict = exports.decodeHTMLStrict = decode.HTMLStrict;\n\nexports.escape = encode.escape;\n","/*\n Module dependencies\n*/\nvar ElementType = require('domelementtype');\nvar entities = require('entities');\n\n/*\n Boolean Attributes\n*/\nvar booleanAttributes = {\n __proto__: null,\n allowfullscreen: true,\n async: true,\n autofocus: true,\n autoplay: true,\n checked: true,\n controls: true,\n default: true,\n defer: true,\n disabled: true,\n hidden: true,\n ismap: true,\n loop: true,\n multiple: true,\n muted: true,\n open: true,\n readonly: true,\n required: true,\n reversed: true,\n scoped: true,\n seamless: true,\n selected: true,\n typemustmatch: true\n};\n\nvar unencodedElements = {\n __proto__: null,\n style: true,\n script: true,\n xmp: true,\n iframe: true,\n noembed: true,\n noframes: true,\n plaintext: true,\n noscript: true\n};\n\n/*\n Format attributes\n*/\nfunction formatAttrs(attributes, opts) {\n if (!attributes) return;\n\n var output = '',\n value;\n\n // Loop through the attributes\n for (var key in attributes) {\n value = attributes[key];\n if (output) {\n output += ' ';\n }\n\n if (!value && booleanAttributes[key]) {\n output += key;\n } else {\n output += key + '=\"' + (opts.decodeEntities ? entities.encodeXML(value) : value) + '\"';\n }\n }\n\n return output;\n}\n\n/*\n Self-enclosing tags (stolen from node-htmlparser)\n*/\nvar singleTag = {\n __proto__: null,\n area: true,\n base: true,\n basefont: true,\n br: true,\n col: true,\n command: true,\n embed: true,\n frame: true,\n hr: true,\n img: true,\n input: true,\n isindex: true,\n keygen: true,\n link: true,\n meta: true,\n param: true,\n source: true,\n track: true,\n wbr: true,\n};\n\n\nvar render = module.exports = function(dom, opts) {\n if (!Array.isArray(dom) && !dom.cheerio) dom = [dom];\n opts = opts || {};\n\n var output = '';\n\n for(var i = 0; i < dom.length; i++){\n var elem = dom[i];\n\n if (elem.type === 'root')\n output += render(elem.children, opts);\n else if (ElementType.isTag(elem))\n output += renderTag(elem, opts);\n else if (elem.type === ElementType.Directive)\n output += renderDirective(elem);\n else if (elem.type === ElementType.Comment)\n output += renderComment(elem);\n else if (elem.type === ElementType.CDATA)\n output += renderCdata(elem);\n else\n output += renderText(elem, opts);\n }\n\n return output;\n};\n\nfunction renderTag(elem, opts) {\n // Handle SVG\n if (elem.name === \"svg\") opts = {decodeEntities: opts.decodeEntities, xmlMode: true};\n\n var tag = '<' + elem.name,\n attribs = formatAttrs(elem.attribs, opts);\n\n if (attribs) {\n tag += ' ' + attribs;\n }\n\n if (\n opts.xmlMode\n && (!elem.children || elem.children.length === 0)\n ) {\n tag += '/>';\n } else {\n tag += '>';\n if (elem.children) {\n tag += render(elem.children, opts);\n }\n\n if (!singleTag[elem.name] || opts.xmlMode) {\n tag += '</' + elem.name + '>';\n }\n }\n\n return tag;\n}\n\nfunction renderDirective(elem) {\n return '<' + elem.data + '>';\n}\n\nfunction renderText(elem, opts) {\n var data = elem.data || '';\n\n // if entities weren't decoded, no need to encode them back\n if (opts.decodeEntities && !(elem.parent && elem.parent.name in unencodedElements)) {\n data = entities.encodeXML(data);\n }\n\n return data;\n}\n\nfunction renderCdata(elem) {\n return '<![CDATA[' + elem.children[0].data + ']]>';\n}\n\nfunction renderComment(elem) {\n return '<!--' + elem.data + '-->';\n}\n","var ElementType = require(\"domelementtype\"),\n getOuterHTML = require(\"dom-serializer\"),\n isTag = ElementType.isTag;\n\nmodule.exports = {\n\tgetInnerHTML: getInnerHTML,\n\tgetOuterHTML: getOuterHTML,\n\tgetText: getText\n};\n\nfunction getInnerHTML(elem, opts){\n\treturn elem.children ? elem.children.map(function(elem){\n\t\treturn getOuterHTML(elem, opts);\n\t}).join(\"\") : \"\";\n}\n\nfunction getText(elem){\n\tif(Array.isArray(elem)) return elem.map(getText).join(\"\");\n\tif(isTag(elem)) return elem.name === \"br\" ? \"\\n\" : getText(elem.children);\n\tif(elem.type === ElementType.CDATA) return getText(elem.children);\n\tif(elem.type === ElementType.Text) return elem.data;\n\treturn \"\";\n}\n","var getChildren = exports.getChildren = function(elem){\n\treturn elem.children;\n};\n\nvar getParent = exports.getParent = function(elem){\n\treturn elem.parent;\n};\n\nexports.getSiblings = function(elem){\n\tvar parent = getParent(elem);\n\treturn parent ? getChildren(parent) : [elem];\n};\n\nexports.getAttributeValue = function(elem, name){\n\treturn elem.attribs && elem.attribs[name];\n};\n\nexports.hasAttrib = function(elem, name){\n\treturn !!elem.attribs && hasOwnProperty.call(elem.attribs, name);\n};\n\nexports.getName = function(elem){\n\treturn elem.name;\n};\n","exports.removeElement = function(elem){\n\tif(elem.prev) elem.prev.next = elem.next;\n\tif(elem.next) elem.next.prev = elem.prev;\n\n\tif(elem.parent){\n\t\tvar childs = elem.parent.children;\n\t\tchilds.splice(childs.lastIndexOf(elem), 1);\n\t}\n};\n\nexports.replaceElement = function(elem, replacement){\n\tvar prev = replacement.prev = elem.prev;\n\tif(prev){\n\t\tprev.next = replacement;\n\t}\n\n\tvar next = replacement.next = elem.next;\n\tif(next){\n\t\tnext.prev = replacement;\n\t}\n\n\tvar parent = replacement.parent = elem.parent;\n\tif(parent){\n\t\tvar childs = parent.children;\n\t\tchilds[childs.lastIndexOf(elem)] = replacement;\n\t}\n};\n\nexports.appendChild = function(elem, child){\n\tchild.parent = elem;\n\n\tif(elem.children.push(child) !== 1){\n\t\tvar sibling = elem.children[elem.children.length - 2];\n\t\tsibling.next = child;\n\t\tchild.prev = sibling;\n\t\tchild.next = null;\n\t}\n};\n\nexports.append = function(elem, next){\n\tvar parent = elem.parent,\n\t\tcurrNext = elem.next;\n\n\tnext.next = currNext;\n\tnext.prev = elem;\n\telem.next = next;\n\tnext.parent = parent;\n\n\tif(currNext){\n\t\tcurrNext.prev = next;\n\t\tif(parent){\n\t\t\tvar childs = parent.children;\n\t\t\tchilds.splice(childs.lastIndexOf(currNext), 0, next);\n\t\t}\n\t} else if(parent){\n\t\tparent.children.push(next);\n\t}\n};\n\nexports.prepend = function(elem, prev){\n\tvar parent = elem.parent;\n\tif(parent){\n\t\tvar childs = parent.children;\n\t\tchilds.splice(childs.lastIndexOf(elem), 0, prev);\n\t}\n\n\tif(elem.prev){\n\t\telem.prev.next = prev;\n\t}\n\t\n\tprev.parent = parent;\n\tprev.prev = elem.prev;\n\tprev.next = elem;\n\telem.prev = prev;\n};\n\n\n","var isTag = require(\"domelementtype\").isTag;\n\nmodule.exports = {\n\tfilter: filter,\n\tfind: find,\n\tfindOneChild: findOneChild,\n\tfindOne: findOne,\n\texistsOne: existsOne,\n\tfindAll: findAll\n};\n\nfunction filter(test, element, recurse, limit){\n\tif(!Array.isArray(element)) element = [element];\n\n\tif(typeof limit !== \"number\" || !isFinite(limit)){\n\t\tlimit = Infinity;\n\t}\n\treturn find(test, element, recurse !== false, limit);\n}\n\nfunction find(test, elems, recurse, limit){\n\tvar result = [], childs;\n\n\tfor(var i = 0, j = elems.length; i < j; i++){\n\t\tif(test(elems[i])){\n\t\t\tresult.push(elems[i]);\n\t\t\tif(--limit <= 0) break;\n\t\t}\n\n\t\tchilds = elems[i].children;\n\t\tif(recurse && childs && childs.length > 0){\n\t\t\tchilds = find(test, childs, recurse, limit);\n\t\t\tresult = result.concat(childs);\n\t\t\tlimit -= childs.length;\n\t\t\tif(limit <= 0) break;\n\t\t}\n\t}\n\n\treturn result;\n}\n\nfunction findOneChild(test, elems){\n\tfor(var i = 0, l = elems.length; i < l; i++){\n\t\tif(test(elems[i])) return elems[i];\n\t}\n\n\treturn null;\n}\n\nfunction findOne(test, elems){\n\tvar elem = null;\n\n\tfor(var i = 0, l = elems.length; i < l && !elem; i++){\n\t\tif(!isTag(elems[i])){\n\t\t\tcontinue;\n\t\t} else if(test(elems[i])){\n\t\t\telem = elems[i];\n\t\t} else if(elems[i].children.length > 0){\n\t\t\telem = findOne(test, elems[i].children);\n\t\t}\n\t}\n\n\treturn elem;\n}\n\nfunction existsOne(test, elems){\n\tfor(var i = 0, l = elems.length; i < l; i++){\n\t\tif(\n\t\t\tisTag(elems[i]) && (\n\t\t\t\ttest(elems[i]) || (\n\t\t\t\t\telems[i].children.length > 0 &&\n\t\t\t\t\texistsOne(test, elems[i].children)\n\t\t\t\t)\n\t\t\t)\n\t\t){\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nfunction findAll(test, rootElems){\n\tvar result = [];\n\tvar stack = rootElems.slice();\n\twhile(stack.length){\n\t\tvar elem = stack.shift();\n\t\tif(!isTag(elem)) continue;\n\t\tif (elem.children && elem.children.length > 0) {\n\t\t\tstack.unshift.apply(stack, elem.children);\n\t\t}\n\t\tif(test(elem)) result.push(elem);\n\t}\n\treturn result;\n}\n","var ElementType = require(\"domelementtype\");\nvar isTag = exports.isTag = ElementType.isTag;\n\nexports.testElement = function(options, element){\n\tfor(var key in options){\n\t\tif(!options.hasOwnProperty(key));\n\t\telse if(key === \"tag_name\"){\n\t\t\tif(!isTag(element) || !options.tag_name(element.name)){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t} else if(key === \"tag_type\"){\n\t\t\tif(!options.tag_type(element.type)) return false;\n\t\t} else if(key === \"tag_contains\"){\n\t\t\tif(isTag(element) || !options.tag_contains(element.data)){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t} else if(!element.attribs || !options[key](element.attribs[key])){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n};\n\nvar Checks = {\n\ttag_name: function(name){\n\t\tif(typeof name === \"function\"){\n\t\t\treturn function(elem){ return isTag(elem) && name(elem.name); };\n\t\t} else if(name === \"*\"){\n\t\t\treturn isTag;\n\t\t} else {\n\t\t\treturn function(elem){ return isTag(elem) && elem.name === name; };\n\t\t}\n\t},\n\ttag_type: function(type){\n\t\tif(typeof type === \"function\"){\n\t\t\treturn function(elem){ return type(elem.type); };\n\t\t} else {\n\t\t\treturn function(elem){ return elem.type === type; };\n\t\t}\n\t},\n\ttag_contains: function(data){\n\t\tif(typeof data === \"function\"){\n\t\t\treturn function(elem){ return !isTag(elem) && data(elem.data); };\n\t\t} else {\n\t\t\treturn function(elem){ return !isTag(elem) && elem.data === data; };\n\t\t}\n\t}\n};\n\nfunction getAttribCheck(attrib, value){\n\tif(typeof value === \"function\"){\n\t\treturn function(elem){ return elem.attribs && value(elem.attribs[attrib]); };\n\t} else {\n\t\treturn function(elem){ return elem.attribs && elem.attribs[attrib] === value; };\n\t}\n}\n\nfunction combineFuncs(a, b){\n\treturn function(elem){\n\t\treturn a(elem) || b(elem);\n\t};\n}\n\nexports.getElements = function(options, element, recurse, limit){\n\tvar funcs = Object.keys(options).map(function(key){\n\t\tvar value = options[key];\n\t\treturn key in Checks ? Checks[key](value) : getAttribCheck(key, value);\n\t});\n\n\treturn funcs.length === 0 ? [] : this.filter(\n\t\tfuncs.reduce(combineFuncs),\n\t\telement, recurse, limit\n\t);\n};\n\nexports.getElementById = function(id, element, recurse){\n\tif(!Array.isArray(element)) element = [element];\n\treturn this.findOne(getAttribCheck(\"id\", id), element, recurse !== false);\n};\n\nexports.getElementsByTagName = function(name, element, recurse, limit){\n\treturn this.filter(Checks.tag_name(name), element, recurse, limit);\n};\n\nexports.getElementsByTagType = function(type, element, recurse, limit){\n\treturn this.filter(Checks.tag_type(type), element, recurse, limit);\n};\n","// removeSubsets\n// Given an array of nodes, remove any member that is contained by another.\nexports.removeSubsets = function(nodes) {\n\tvar idx = nodes.length, node, ancestor, replace;\n\n\t// Check if each node (or one of its ancestors) is already contained in the\n\t// array.\n\twhile (--idx > -1) {\n\t\tnode = ancestor = nodes[idx];\n\n\t\t// Temporarily remove the node under consideration\n\t\tnodes[idx] = null;\n\t\treplace = true;\n\n\t\twhile (ancestor) {\n\t\t\tif (nodes.indexOf(ancestor) > -1) {\n\t\t\t\treplace = false;\n\t\t\t\tnodes.splice(idx, 1);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tancestor = ancestor.parent;\n\t\t}\n\n\t\t// If the node has been found to be unique, re-insert it.\n\t\tif (replace) {\n\t\t\tnodes[idx] = node;\n\t\t}\n\t}\n\n\treturn nodes;\n};\n\n// Source: http://dom.spec.whatwg.org/#dom-node-comparedocumentposition\nvar POSITION = {\n\tDISCONNECTED: 1,\n\tPRECEDING: 2,\n\tFOLLOWING: 4,\n\tCONTAINS: 8,\n\tCONTAINED_BY: 16\n};\n\n// Compare the position of one node against another node in any other document.\n// The return value is a bitmask with the following values:\n//\n// document order:\n// > There is an ordering, document order, defined on all the nodes in the\n// > document corresponding to the order in which the first character of the\n// > XML representation of each node occurs in the XML representation of the\n// > document after expansion of general entities. Thus, the document element\n// > node will be the first node. Element nodes occur before their children.\n// > Thus, document order orders element nodes in order of the occurrence of\n// > their start-tag in the XML (after expansion of entities). The attribute\n// > nodes of an element occur after the element and before its children. The\n// > relative order of attribute nodes is implementation-dependent./\n// Source:\n// http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order\n//\n// @argument {Node} nodaA The first node to use in the comparison\n// @argument {Node} nodeB The second node to use in the comparison\n//\n// @return {Number} A bitmask describing the input nodes' relative position.\n// See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for\n// a description of these values.\nvar comparePos = exports.compareDocumentPosition = function(nodeA, nodeB) {\n\tvar aParents = [];\n\tvar bParents = [];\n\tvar current, sharedParent, siblings, aSibling, bSibling, idx;\n\n\tif (nodeA === nodeB) {\n\t\treturn 0;\n\t}\n\n\tcurrent = nodeA;\n\twhile (current) {\n\t\taParents.unshift(current);\n\t\tcurrent = current.parent;\n\t}\n\tcurrent = nodeB;\n\twhile (current) {\n\t\tbParents.unshift(current);\n\t\tcurrent = current.parent;\n\t}\n\n\tidx = 0;\n\twhile (aParents[idx] === bParents[idx]) {\n\t\tidx++;\n\t}\n\n\tif (idx === 0) {\n\t\treturn POSITION.DISCONNECTED;\n\t}\n\n\tsharedParent = aParents[idx - 1];\n\tsiblings = sharedParent.children;\n\taSibling = aParents[idx];\n\tbSibling = bParents[idx];\n\n\tif (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) {\n\t\tif (sharedParent === nodeB) {\n\t\t\treturn POSITION.FOLLOWING | POSITION.CONTAINED_BY;\n\t\t}\n\t\treturn POSITION.FOLLOWING;\n\t} else {\n\t\tif (sharedParent === nodeA) {\n\t\t\treturn POSITION.PRECEDING | POSITION.CONTAINS;\n\t\t}\n\t\treturn POSITION.PRECEDING;\n\t}\n};\n\n// Sort an array of nodes based on their relative position in the document and\n// remove any duplicate nodes. If the array contains nodes that do not belong\n// to the same document, sort order is unspecified.\n//\n// @argument {Array} nodes Array of DOM nodes\n//\n// @returns {Array} collection of unique nodes, sorted in document order\nexports.uniqueSort = function(nodes) {\n\tvar idx = nodes.length, node, position;\n\n\tnodes = nodes.slice();\n\n\twhile (--idx > -1) {\n\t\tnode = nodes[idx];\n\t\tposition = nodes.indexOf(node);\n\t\tif (position > -1 && position < idx) {\n\t\t\tnodes.splice(idx, 1);\n\t\t}\n\t}\n\tnodes.sort(function(a, b) {\n\t\tvar relative = comparePos(a, b);\n\t\tif (relative & POSITION.PRECEDING) {\n\t\t\treturn -1;\n\t\t} else if (relative & POSITION.FOLLOWING) {\n\t\t\treturn 1;\n\t\t}\n\t\treturn 0;\n\t});\n\n\treturn nodes;\n};\n","var DomUtils = module.exports;\n\n[\n\trequire(\"./lib/stringify\"),\n\trequire(\"./lib/traversal\"),\n\trequire(\"./lib/manipulation\"),\n\trequire(\"./lib/querying\"),\n\trequire(\"./lib/legacy\"),\n\trequire(\"./lib/helpers\")\n].forEach(function(ext){\n\tObject.keys(ext).forEach(function(key){\n\t\tDomUtils[key] = ext[key].bind(DomUtils);\n\t});\n});\n","module.exports = CollectingHandler;\n\nfunction CollectingHandler(cbs){\n\tthis._cbs = cbs || {};\n\tthis.events = [];\n}\n\nvar EVENTS = require(\"./\").EVENTS;\nObject.keys(EVENTS).forEach(function(name){\n\tif(EVENTS[name] === 0){\n\t\tname = \"on\" + name;\n\t\tCollectingHandler.prototype[name] = function(){\n\t\t\tthis.events.push([name]);\n\t\t\tif(this._cbs[name]) this._cbs[name]();\n\t\t};\n\t} else if(EVENTS[name] === 1){\n\t\tname = \"on\" + name;\n\t\tCollectingHandler.prototype[name] = function(a){\n\t\t\tthis.events.push([name, a]);\n\t\t\tif(this._cbs[name]) this._cbs[name](a);\n\t\t};\n\t} else if(EVENTS[name] === 2){\n\t\tname = \"on\" + name;\n\t\tCollectingHandler.prototype[name] = function(a, b){\n\t\t\tthis.events.push([name, a, b]);\n\t\t\tif(this._cbs[name]) this._cbs[name](a, b);\n\t\t};\n\t} else {\n\t\tthrow Error(\"wrong number of arguments\");\n\t}\n});\n\nCollectingHandler.prototype.onreset = function(){\n\tthis.events = [];\n\tif(this._cbs.onreset) this._cbs.onreset();\n};\n\nCollectingHandler.prototype.restart = function(){\n\tif(this._cbs.onreset) this._cbs.onreset();\n\n\tfor(var i = 0, len = this.events.length; i < len; i++){\n\t\tif(this._cbs[this.events[i][0]]){\n\n\t\t\tvar num = this.events[i].length;\n\n\t\t\tif(num === 1){\n\t\t\t\tthis._cbs[this.events[i][0]]();\n\t\t\t} else if(num === 2){\n\t\t\t\tthis._cbs[this.events[i][0]](this.events[i][1]);\n\t\t\t} else {\n\t\t\t\tthis._cbs[this.events[i][0]](this.events[i][1], this.events[i][2]);\n\t\t\t}\n\t\t}\n\t}\n};\n","var Parser = require(\"./Parser.js\");\nvar DomHandler = require(\"domhandler\");\n\nfunction defineProp(name, value){\n\tdelete module.exports[name];\n\tmodule.exports[name] = value;\n\treturn value;\n}\n\nmodule.exports = {\n\tParser: Parser,\n\tTokenizer: require(\"./Tokenizer.js\"),\n\tElementType: require(\"domelementtype\"),\n\tDomHandler: DomHandler,\n\tget FeedHandler(){\n\t\treturn defineProp(\"FeedHandler\", require(\"./FeedHandler.js\"));\n\t},\n\tget Stream(){\n\t\treturn defineProp(\"Stream\", require(\"./Stream.js\"));\n\t},\n\tget WritableStream(){\n\t\treturn defineProp(\"WritableStream\", require(\"./WritableStream.js\"));\n\t},\n\tget ProxyHandler(){\n\t\treturn defineProp(\"ProxyHandler\", require(\"./ProxyHandler.js\"));\n\t},\n\tget DomUtils(){\n\t\treturn defineProp(\"DomUtils\", require(\"domutils\"));\n\t},\n\tget CollectingHandler(){\n\t\treturn defineProp(\"CollectingHandler\", require(\"./CollectingHandler.js\"));\n\t},\n\t// For legacy support\n\tDefaultHandler: DomHandler,\n\tget RssHandler(){\n\t\treturn defineProp(\"RssHandler\", this.FeedHandler);\n\t},\n\t//helper methods\n\tparseDOM: function(data, options){\n\t\tvar handler = new DomHandler(options);\n\t\tnew Parser(handler, options).end(data);\n\t\treturn handler.dom;\n\t},\n\tparseFeed: function(feed, options){\n\t\tvar handler = new module.exports.FeedHandler(options);\n\t\tnew Parser(handler, options).end(feed);\n\t\treturn handler.dom;\n\t},\n\tcreateDomStream: function(cb, options, elementCb){\n\t\tvar handler = new DomHandler(cb, options, elementCb);\n\t\treturn new Parser(handler, options);\n\t},\n\t// List of all events that the parser emits\n\tEVENTS: { /* Format: eventname: number of arguments */\n\t\tattribute: 2,\n\t\tcdatastart: 0,\n\t\tcdataend: 0,\n\t\ttext: 1,\n\t\tprocessinginstruction: 2,\n\t\tcomment: 1,\n\t\tcommentend: 0,\n\t\tclosetag: 1,\n\t\topentag: 2,\n\t\topentagname: 1,\n\t\terror: 1,\n\t\tend: 0\n\t}\n};\n","module.exports = extend\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction extend() {\n var target = {}\n\n for (var i = 0; i < arguments.length; i++) {\n var source = arguments[i]\n\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n target[key] = source[key]\n }\n }\n }\n\n return target\n}\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\n/**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\nfunction escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n}\n\nmodule.exports = escapeRegExp;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/**\n * Adds the key-value `pair` to `map`.\n *\n * @private\n * @param {Object} map The map to modify.\n * @param {Array} pair The key-value pair to add.\n * @returns {Object} Returns `map`.\n */\nfunction addMapEntry(map, pair) {\n // Don't return `map.set` because it's not chainable in IE 11.\n map.set(pair[0], pair[1]);\n return map;\n}\n\n/**\n * Adds `value` to `set`.\n *\n * @private\n * @param {Object} set The set to modify.\n * @param {*} value The value to add.\n * @returns {Object} Returns `set`.\n */\nfunction addSetEntry(set, value) {\n // Don't return `set.add` because it's not chainable in IE 11.\n set.add(value);\n return set;\n}\n\n/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array ? array.length : 0;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\n/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n}\n\n/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array ? array.length : 0;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n // Many host objects are `Object` objects that can coerce to strings\n // despite having improperly defined `toString` methods.\n var result = false;\n if (value != null && typeof value.toString != 'function') {\n try {\n result = !!(value + '');\n } catch (e) {}\n }\n return result;\n}\n\n/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n Symbol = root.Symbol,\n Uint8Array = root.Uint8Array,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeKeys = overArg(Object.keys, Object);\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView'),\n Map = getNative(root, 'Map'),\n Promise = getNative(root, 'Promise'),\n Set = getNative(root, 'Set'),\n WeakMap = getNative(root, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n return this.has(key) && delete this.__data__[key];\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n var data = this.__data__;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n this.__data__ = [];\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n var index = -1,\n length = entries ? entries.length : 0;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n return getMapData(this, key)['delete'](key);\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n getMapData(this, key).set(key, value);\n return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n this.__data__ = new ListCache(entries);\n}\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n this.__data__ = new ListCache;\n}\n\n/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n return this.__data__['delete'](key);\n}\n\n/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\n/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n return this.__data__.has(key);\n}\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n var cache = this.__data__;\n if (cache instanceof ListCache) {\n var pairs = cache.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n return this;\n }\n cache = this.__data__ = new MapCache(pairs);\n }\n cache.set(key, value);\n return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n // Safari 9 makes `arguments.length` enumerable in strict mode.\n var result = (isArray(value) || isArguments(value))\n ? baseTimes(value.length, String)\n : [];\n\n var length = result.length,\n skipIndexes = !!length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (key == 'length' || isIndex(key, length)))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n object[key] = value;\n }\n}\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n}\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @param {boolean} [isFull] Specify a clone including symbols.\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, isDeep, isFull, customizer, key, object, stack) {\n var result;\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n if (isHostObject(value)) {\n return object ? value : {};\n }\n result = initCloneObject(isFunc ? {} : value);\n if (!isDeep) {\n return copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, baseClone, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (!isArr) {\n var props = isFull ? getAllKeys(value) : keys(value);\n }\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));\n });\n return result;\n}\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} prototype The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nfunction baseCreate(proto) {\n return isObject(proto) ? objectCreate(proto) : {};\n}\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\n/**\n * The base implementation of `getTag`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n return objectToString.call(value);\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\nfunction baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n}\n\n/**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var result = new buffer.constructor(buffer.length);\n buffer.copy(result);\n return result;\n}\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n}\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\n/**\n * Creates a clone of `map`.\n *\n * @private\n * @param {Object} map The map to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned map.\n */\nfunction cloneMap(map, isDeep, cloneFunc) {\n var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);\n return arrayReduce(array, addMapEntry, new map.constructor);\n}\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n}\n\n/**\n * Creates a clone of `set`.\n *\n * @private\n * @param {Object} set The set to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned set.\n */\nfunction cloneSet(set, isDeep, cloneFunc) {\n var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);\n return arrayReduce(array, addSetEntry, new set.constructor);\n}\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n}\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n assignValue(object, key, newValue === undefined ? source[key] : newValue);\n }\n return object;\n}\n\n/**\n * Copies own symbol properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n}\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * Creates an array of the own enumerable symbol properties of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = nativeGetSymbols ? overArg(nativeGetSymbols, Object) : stubArray;\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11,\n// for data views in Edge < 14, and promises in Node.js.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = objectToString.call(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : undefined;\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n}\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n var length = array.length,\n result = array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n}\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n}\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, cloneFunc, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return cloneMap(object, isDeep, cloneFunc);\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return cloneSet(object, isDeep, cloneFunc);\n\n case symbolTag:\n return cloneSymbol(object);\n }\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n length = length == null ? MAX_SAFE_INTEGER : length;\n return !!length &&\n (typeof value == 'number' || reIsUint.test(value)) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to process.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n return baseClone(value, true, true);\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 8-9 which returns 'object' for typed array and other constructors.\n var tag = isObject(value) ? objectToString.call(value) : '';\n return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n var type = typeof value;\n return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\n/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n return [];\n}\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n return false;\n}\n\nmodule.exports = cloneDeep;\n","/**\n * Lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright JS Foundation and other contributors <https://js.foundation/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n try {\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n}());\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n}\n\n/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n return function(value) {\n return func(value);\n };\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/**\n * Gets the value at `key`, unless `key` is \"__proto__\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction safeGet(object, key) {\n return key == '__proto__'\n ? undefined\n : object[key];\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n Symbol = root.Symbol,\n Uint8Array = root.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\nvar defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n}());\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeMax = Math.max,\n nativeNow = Date.now;\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map'),\n nativeCreate = getNative(Object, 'create');\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n}());\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n}\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n}\n\n/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n}\n\n/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\n/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n return this.__data__.has(key);\n}\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n}\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n}\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n}\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n}\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\nfunction baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n}\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n if (isObject(srcValue)) {\n stack || (stack = new Stack);\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n}\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n}\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n}\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n};\n\n/**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n}\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n}\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n}\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n}\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n}\n\n/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n}\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n}\n\n/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n}\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n}\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n};\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n}\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n return copyObject(value, keysIn(value));\n}\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\n/**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\nvar mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n});\n\n/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n return function() {\n return value;\n };\n}\n\n/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n return value;\n}\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n return false;\n}\n\nmodule.exports = mergeWith;\n","/**\n * lodash 4.0.1 (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n * Available under MIT license <https://lodash.com/license>\n */\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @type Function\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);\n}\n\nmodule.exports = isString;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n // Many host objects are `Object` objects that can coerce to strings\n // despite having improperly defined `toString` methods.\n var result = false;\n if (value != null && typeof value.toString != 'function') {\n try {\n result = !!(value + '');\n } catch (e) {}\n }\n return result;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n if (!isObjectLike(value) ||\n objectToString.call(value) != objectTag || isHostObject(value)) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return (typeof Ctor == 'function' &&\n Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString);\n}\n\nmodule.exports = isPlainObject;\n","'use strict';\nmodule.exports = Number.isNaN || function (x) {\n\treturn x !== x;\n};\n","'use strict';\n\n// there's 3 implementations written in increasing order of efficiency\n\n// 1 - no Set type is defined\nfunction uniqNoSet(arr) {\n\tvar ret = [];\n\n\tfor (var i = 0; i < arr.length; i++) {\n\t\tif (ret.indexOf(arr[i]) === -1) {\n\t\t\tret.push(arr[i]);\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n// 2 - a simple Set type is defined\nfunction uniqSet(arr) {\n\tvar seen = new Set();\n\treturn arr.filter(function (el) {\n\t\tif (!seen.has(el)) {\n\t\t\tseen.add(el);\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t});\n}\n\n// 3 - a standard Set type is defined and it has a forEach method\nfunction uniqSetWithForEach(arr) {\n\tvar ret = [];\n\n\t(new Set(arr)).forEach(function (el) {\n\t\tret.push(el);\n\t});\n\n\treturn ret;\n}\n\n// V8 currently has a broken implementation\n// https://github.com/joyent/node/issues/8449\nfunction doesForEachActuallyWork() {\n\tvar ret = false;\n\n\t(new Set([true])).forEach(function (el) {\n\t\tret = el;\n\t});\n\n\treturn ret === true;\n}\n\nif ('Set' in global) {\n\tif (typeof Set.prototype.forEach === 'function' && doesForEachActuallyWork()) {\n\t\tmodule.exports = uniqSetWithForEach;\n\t} else {\n\t\tmodule.exports = uniqSet;\n\t}\n} else {\n\tmodule.exports = uniqNoSet;\n}\n","'use strict';\nvar numberIsNan = require('number-is-nan');\nvar arrayUniq = require('array-uniq');\nvar reInt = /^\\d+$/;\n\nfunction deepUnique(arr) {\n\treturn arr.sort().filter(function (el, i) {\n\t\treturn JSON.stringify(el) !== JSON.stringify(arr[i - 1]);\n\t});\n}\n\nexports.parse = function (str) {\n\treturn deepUnique(str.split(',').map(function (el) {\n\t\tvar ret = {};\n\n\t\tel.trim().split(/\\s+/).forEach(function (el, i) {\n\t\t\tif (i === 0) {\n\t\t\t\treturn ret.url = el;\n\t\t\t}\n\n\t\t\tvar value = el.substring(0, el.length - 1);\n\t\t\tvar postfix = el[el.length - 1];\n\t\t\tvar intVal = parseInt(value, 10);\n\t\t\tvar floatVal = parseFloat(value);\n\n\t\t\tif (postfix === 'w' && reInt.test(value)) {\n\t\t\t\tret.width = intVal;\n\t\t\t} else if (postfix === 'h' && reInt.test(value)) {\n\t\t\t\tret.height = intVal;\n\t\t\t} else if (postfix === 'x' && !numberIsNan(floatVal)) {\n\t\t\t\tret.density = floatVal;\n\t\t\t} else {\n\t\t\t\tthrow new Error('Invalid srcset descriptor: ' + el + '.');\n\t\t\t}\n\t\t});\n\n\t\treturn ret;\n\t}));\n}\n\nexports.stringify = function (arr) {\n\treturn arrayUniq(arr.map(function (el) {\n\t\tif (!el.url) {\n\t\t\tthrow new Error('URL is required.');\n\t\t}\n\n\t\tvar ret = [el.url];\n\n\t\tif (el.width) {\n\t\t\tret.push(el.width + 'w');\n\t\t}\n\n\t\tif (el.height) {\n\t\t\tret.push(el.height + 'h');\n\t\t}\n\n\t\tif (el.density) {\n\t\t\tret.push(el.density + 'x');\n\t\t}\n\n\t\treturn ret.join(' ');\n\t})).join(', ');\n}\n","const SINGLE_QUOTE = '\\''.charCodeAt(0);\nconst DOUBLE_QUOTE = '\"'.charCodeAt(0);\nconst BACKSLASH = '\\\\'.charCodeAt(0);\nconst SLASH = '/'.charCodeAt(0);\nconst NEWLINE = '\\n'.charCodeAt(0);\nconst SPACE = ' '.charCodeAt(0);\nconst FEED = '\\f'.charCodeAt(0);\nconst TAB = '\\t'.charCodeAt(0);\nconst CR = '\\r'.charCodeAt(0);\nconst OPEN_SQUARE = '['.charCodeAt(0);\nconst CLOSE_SQUARE = ']'.charCodeAt(0);\nconst OPEN_PARENTHESES = '('.charCodeAt(0);\nconst CLOSE_PARENTHESES = ')'.charCodeAt(0);\nconst OPEN_CURLY = '{'.charCodeAt(0);\nconst CLOSE_CURLY = '}'.charCodeAt(0);\nconst SEMICOLON = ';'.charCodeAt(0);\nconst ASTERISK = '*'.charCodeAt(0);\nconst COLON = ':'.charCodeAt(0);\nconst AT = '@'.charCodeAt(0);\n\nconst RE_AT_END = /[ \\n\\t\\r\\f\\{\\}\\(\\)'\"\\\\;/\\[\\]#]/g;\nconst RE_WORD_END = /[ \\n\\t\\r\\f\\(\\)\\{\\}:;@!'\"\\\\\\]\\[#]|\\/(?=\\*)/g;\nconst RE_BAD_BRACKET = /.[\\\\\\/\\(\"'\\n]/;\nconst RE_HEX_ESCAPE = /[a-f0-9]/i;\n\nexport default function tokenizer(input, options = {}) {\n let css = input.css.valueOf();\n let ignore = options.ignoreErrors;\n\n let code, next, quote, lines, last, content, escape,\n nextLine, nextOffset, escaped, escapePos, prev, n, currentToken;\n\n let length = css.length;\n let offset = -1;\n let line = 1;\n let pos = 0;\n let buffer = [];\n let returned = [];\n\n function unclosed(what) {\n throw input.error('Unclosed ' + what, line, pos - offset);\n }\n\n function endOfFile() {\n return returned.length === 0 && pos >= length;\n }\n\n function nextToken() {\n if ( returned.length ) return returned.pop();\n if ( pos >= length ) return;\n\n code = css.charCodeAt(pos);\n if ( code === NEWLINE || code === FEED ||\n code === CR && css.charCodeAt(pos + 1) !== NEWLINE ) {\n offset = pos;\n line += 1;\n }\n\n switch ( code ) {\n case NEWLINE:\n case SPACE:\n case TAB:\n case CR:\n case FEED:\n next = pos;\n do {\n next += 1;\n code = css.charCodeAt(next);\n if ( code === NEWLINE ) {\n offset = next;\n line += 1;\n }\n } while ( code === SPACE ||\n code === NEWLINE ||\n code === TAB ||\n code === CR ||\n code === FEED );\n\n currentToken = ['space', css.slice(pos, next)];\n pos = next - 1;\n break;\n\n case OPEN_SQUARE:\n currentToken = ['[', '[', line, pos - offset];\n break;\n\n case CLOSE_SQUARE:\n currentToken = [']', ']', line, pos - offset];\n break;\n\n case OPEN_CURLY:\n currentToken = ['{', '{', line, pos - offset];\n break;\n\n case CLOSE_CURLY:\n currentToken = ['}', '}', line, pos - offset];\n break;\n\n case COLON:\n currentToken = [':', ':', line, pos - offset];\n break;\n\n case SEMICOLON:\n currentToken = [';', ';', line, pos - offset];\n break;\n\n case OPEN_PARENTHESES:\n prev = buffer.length ? buffer.pop()[1] : '';\n n = css.charCodeAt(pos + 1);\n if ( prev === 'url' &&\n n !== SINGLE_QUOTE && n !== DOUBLE_QUOTE &&\n n !== SPACE && n !== NEWLINE && n !== TAB &&\n n !== FEED && n !== CR ) {\n next = pos;\n do {\n escaped = false;\n next = css.indexOf(')', next + 1);\n if ( next === -1 ) {\n if ( ignore ) {\n next = pos;\n break;\n } else {\n unclosed('bracket');\n }\n }\n escapePos = next;\n while ( css.charCodeAt(escapePos - 1) === BACKSLASH ) {\n escapePos -= 1;\n escaped = !escaped;\n }\n } while ( escaped );\n\n currentToken = ['brackets', css.slice(pos, next + 1),\n line, pos - offset,\n line, next - offset\n ];\n\n pos = next;\n\n } else {\n next = css.indexOf(')', pos + 1);\n content = css.slice(pos, next + 1);\n\n if ( next === -1 || RE_BAD_BRACKET.test(content) ) {\n currentToken = ['(', '(', line, pos - offset];\n } else {\n currentToken = ['brackets', content,\n line, pos - offset,\n line, next - offset\n ];\n pos = next;\n }\n }\n\n break;\n\n case CLOSE_PARENTHESES:\n currentToken = [')', ')', line, pos - offset];\n break;\n\n case SINGLE_QUOTE:\n case DOUBLE_QUOTE:\n quote = code === SINGLE_QUOTE ? '\\'' : '\"';\n next = pos;\n do {\n escaped = false;\n next = css.indexOf(quote, next + 1);\n if ( next === -1 ) {\n if ( ignore ) {\n next = pos + 1;\n break;\n } else {\n unclosed('string');\n }\n }\n escapePos = next;\n while ( css.charCodeAt(escapePos - 1) === BACKSLASH ) {\n escapePos -= 1;\n escaped = !escaped;\n }\n } while ( escaped );\n\n content = css.slice(pos, next + 1);\n lines = content.split('\\n');\n last = lines.length - 1;\n\n if ( last > 0 ) {\n nextLine = line + last;\n nextOffset = next - lines[last].length;\n } else {\n nextLine = line;\n nextOffset = offset;\n }\n\n currentToken = ['string', css.slice(pos, next + 1),\n line, pos - offset,\n nextLine, next - nextOffset\n ];\n\n offset = nextOffset;\n line = nextLine;\n pos = next;\n break;\n\n case AT:\n RE_AT_END.lastIndex = pos + 1;\n RE_AT_END.test(css);\n if ( RE_AT_END.lastIndex === 0 ) {\n next = css.length - 1;\n } else {\n next = RE_AT_END.lastIndex - 2;\n }\n\n currentToken = ['at-word', css.slice(pos, next + 1),\n line, pos - offset,\n line, next - offset\n ];\n\n pos = next;\n break;\n\n case BACKSLASH:\n next = pos;\n escape = true;\n while ( css.charCodeAt(next + 1) === BACKSLASH ) {\n next += 1;\n escape = !escape;\n }\n code = css.charCodeAt(next + 1);\n if ( escape && (code !== SLASH &&\n code !== SPACE &&\n code !== NEWLINE &&\n code !== TAB &&\n code !== CR &&\n code !== FEED ) ) {\n next += 1;\n if ( RE_HEX_ESCAPE.test(css.charAt(next)) ) {\n while ( RE_HEX_ESCAPE.test(css.charAt(next + 1)) ) {\n next += 1;\n }\n if ( css.charCodeAt(next + 1) === SPACE ) {\n next += 1;\n }\n }\n }\n\n currentToken = ['word', css.slice(pos, next + 1),\n line, pos - offset,\n line, next - offset\n ];\n\n pos = next;\n break;\n\n default:\n if ( code === SLASH && css.charCodeAt(pos + 1) === ASTERISK ) {\n next = css.indexOf('*/', pos + 2) + 1;\n if ( next === 0 ) {\n if ( ignore ) {\n next = css.length;\n } else {\n unclosed('comment');\n }\n }\n\n content = css.slice(pos, next + 1);\n lines = content.split('\\n');\n last = lines.length - 1;\n\n if ( last > 0 ) {\n nextLine = line + last;\n nextOffset = next - lines[last].length;\n } else {\n nextLine = line;\n nextOffset = offset;\n }\n\n currentToken = ['comment', content,\n line, pos - offset,\n nextLine, next - nextOffset\n ];\n\n offset = nextOffset;\n line = nextLine;\n pos = next;\n\n } else {\n RE_WORD_END.lastIndex = pos + 1;\n RE_WORD_END.test(css);\n if ( RE_WORD_END.lastIndex === 0 ) {\n next = css.length - 1;\n } else {\n next = RE_WORD_END.lastIndex - 2;\n }\n\n currentToken = ['word', css.slice(pos, next + 1),\n line, pos - offset,\n line, next - offset\n ];\n\n buffer.push(currentToken);\n\n pos = next;\n }\n\n break;\n }\n\n pos++;\n return currentToken;\n }\n\n function back(token) {\n returned.push(token);\n }\n\n return {\n back,\n nextToken,\n endOfFile\n };\n}\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n if (0 <= number && number < intToCharMap.length) {\n return intToCharMap[number];\n }\n throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n var bigA = 65; // 'A'\n var bigZ = 90; // 'Z'\n\n var littleA = 97; // 'a'\n var littleZ = 122; // 'z'\n\n var zero = 48; // '0'\n var nine = 57; // '9'\n\n var plus = 43; // '+'\n var slash = 47; // '/'\n\n var littleOffset = 26;\n var numberOffset = 52;\n\n // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n if (bigA <= charCode && charCode <= bigZ) {\n return (charCode - bigA);\n }\n\n // 26 - 51: abcdefghijklmnopqrstuvwxyz\n if (littleA <= charCode && charCode <= littleZ) {\n return (charCode - littleA + littleOffset);\n }\n\n // 52 - 61: 0123456789\n if (zero <= charCode && charCode <= nine) {\n return (charCode - zero + numberOffset);\n }\n\n // 62: +\n if (charCode == plus) {\n return 62;\n }\n\n // 63: /\n if (charCode == slash) {\n return 63;\n }\n\n // Invalid base64 digit.\n return -1;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided\n * with the distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n// Continuation\n// | Sign\n// | |\n// V V\n// 101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n * 2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n return aValue < 0\n ? ((-aValue) << 1) + 1\n : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n * 4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n var isNegative = (aValue & 1) === 1;\n var shifted = aValue >> 1;\n return isNegative\n ? -shifted\n : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n var encoded = \"\";\n var digit;\n\n var vlq = toVLQSigned(aValue);\n\n do {\n digit = vlq & VLQ_BASE_MASK;\n vlq >>>= VLQ_BASE_SHIFT;\n if (vlq > 0) {\n // There are still more digits in this value, so we must make sure the\n // continuation bit is marked.\n digit |= VLQ_CONTINUATION_BIT;\n }\n encoded += base64.encode(digit);\n } while (vlq > 0);\n\n return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n var strLen = aStr.length;\n var result = 0;\n var shift = 0;\n var continuation, digit;\n\n do {\n if (aIndex >= strLen) {\n throw new Error(\"Expected more digits in base 64 VLQ value.\");\n }\n\n digit = base64.decode(aStr.charCodeAt(aIndex++));\n if (digit === -1) {\n throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n }\n\n continuation = !!(digit & VLQ_CONTINUATION_BIT);\n digit &= VLQ_BASE_MASK;\n result = result + (digit << shift);\n shift += VLQ_BASE_SHIFT;\n } while (continuation);\n\n aOutParam.value = fromVLQSigned(result);\n aOutParam.rest = aIndex;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n if (aName in aArgs) {\n return aArgs[aName];\n } else if (arguments.length === 3) {\n return aDefaultValue;\n } else {\n throw new Error('\"' + aName + '\" is a required argument.');\n }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n var match = aUrl.match(urlRegexp);\n if (!match) {\n return null;\n }\n return {\n scheme: match[1],\n auth: match[2],\n host: match[3],\n port: match[4],\n path: match[5]\n };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n var url = '';\n if (aParsedUrl.scheme) {\n url += aParsedUrl.scheme + ':';\n }\n url += '//';\n if (aParsedUrl.auth) {\n url += aParsedUrl.auth + '@';\n }\n if (aParsedUrl.host) {\n url += aParsedUrl.host;\n }\n if (aParsedUrl.port) {\n url += \":\" + aParsedUrl.port\n }\n if (aParsedUrl.path) {\n url += aParsedUrl.path;\n }\n return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n var path = aPath;\n var url = urlParse(aPath);\n if (url) {\n if (!url.path) {\n return aPath;\n }\n path = url.path;\n }\n var isAbsolute = exports.isAbsolute(path);\n\n var parts = path.split(/\\/+/);\n for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n part = parts[i];\n if (part === '.') {\n parts.splice(i, 1);\n } else if (part === '..') {\n up++;\n } else if (up > 0) {\n if (part === '') {\n // The first part is blank if the path is absolute. Trying to go\n // above the root is a no-op. Therefore we can remove all '..' parts\n // directly after the root.\n parts.splice(i + 1, up);\n up = 0;\n } else {\n parts.splice(i, 2);\n up--;\n }\n }\n }\n path = parts.join('/');\n\n if (path === '') {\n path = isAbsolute ? '/' : '.';\n }\n\n if (url) {\n url.path = path;\n return urlGenerate(url);\n }\n return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n * scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n * first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n * is updated with the result and aRoot is returned. Otherwise the result\n * is returned.\n * - If aPath is absolute, the result is aPath.\n * - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n if (aPath === \"\") {\n aPath = \".\";\n }\n var aPathUrl = urlParse(aPath);\n var aRootUrl = urlParse(aRoot);\n if (aRootUrl) {\n aRoot = aRootUrl.path || '/';\n }\n\n // `join(foo, '//www.example.org')`\n if (aPathUrl && !aPathUrl.scheme) {\n if (aRootUrl) {\n aPathUrl.scheme = aRootUrl.scheme;\n }\n return urlGenerate(aPathUrl);\n }\n\n if (aPathUrl || aPath.match(dataUrlRegexp)) {\n return aPath;\n }\n\n // `join('http://', 'www.example.com')`\n if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n aRootUrl.host = aPath;\n return urlGenerate(aRootUrl);\n }\n\n var joined = aPath.charAt(0) === '/'\n ? aPath\n : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n if (aRootUrl) {\n aRootUrl.path = joined;\n return urlGenerate(aRootUrl);\n }\n return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n\n aRoot = aRoot.replace(/\\/$/, '');\n\n // It is possible for the path to be above the root. In this case, simply\n // checking whether the root is a prefix of the path won't work. Instead, we\n // need to remove components from the root one by one, until either we find\n // a prefix that fits, or we run out of components to remove.\n var level = 0;\n while (aPath.indexOf(aRoot + '/') !== 0) {\n var index = aRoot.lastIndexOf(\"/\");\n if (index < 0) {\n return aPath;\n }\n\n // If the only part of the root that is left is the scheme (i.e. http://,\n // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n // have exhausted all components, so the path is not relative to the root.\n aRoot = aRoot.slice(0, index);\n if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n return aPath;\n }\n\n ++level;\n }\n\n // Make sure we add a \"../\" for each component we removed from the root.\n return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n var obj = Object.create(null);\n return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n if (isProtoString(aStr)) {\n return '$' + aStr;\n }\n\n return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n if (isProtoString(aStr)) {\n return aStr.slice(1);\n }\n\n return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n if (!s) {\n return false;\n }\n\n var length = s.length;\n\n if (length < 9 /* \"__proto__\".length */) {\n return false;\n }\n\n if (s.charCodeAt(length - 1) !== 95 /* '_' */ ||\n s.charCodeAt(length - 2) !== 95 /* '_' */ ||\n s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n s.charCodeAt(length - 8) !== 95 /* '_' */ ||\n s.charCodeAt(length - 9) !== 95 /* '_' */) {\n return false;\n }\n\n for (var i = length - 10; i >= 0; i--) {\n if (s.charCodeAt(i) !== 36 /* '$' */) {\n return false;\n }\n }\n\n return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n var cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0 || onlyCompareOriginal) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0 || onlyCompareGenerated) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n if (aStr1 === aStr2) {\n return 0;\n }\n\n if (aStr1 === null) {\n return 1; // aStr2 !== null\n }\n\n if (aStr2 === null) {\n return -1; // aStr1 !== null\n }\n\n if (aStr1 > aStr2) {\n return 1;\n }\n\n return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n sourceURL = sourceURL || '';\n\n if (sourceRoot) {\n // This follows what Chrome does.\n if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n sourceRoot += '/';\n }\n // The spec says:\n // Line 4: An optional source root, useful for relocating source\n // files on a server or removing repeated values in the\n // “sources” entry. This value is prepended to the individual\n // entries in the “source” field.\n sourceURL = sourceRoot + sourceURL;\n }\n\n // Historically, SourceMapConsumer did not take the sourceMapURL as\n // a parameter. This mode is still somewhat supported, which is why\n // this code block is conditional. However, it's preferable to pass\n // the source map URL to SourceMapConsumer, so that this function\n // can implement the source URL resolution algorithm as outlined in\n // the spec. This block is basically the equivalent of:\n // new URL(sourceURL, sourceMapURL).toString()\n // ... except it avoids using URL, which wasn't available in the\n // older releases of node still supported by this library.\n //\n // The spec says:\n // If the sources are not absolute URLs after prepending of the\n // “sourceRoot”, the sources are resolved relative to the\n // SourceMap (like resolving script src in a html document).\n if (sourceMapURL) {\n var parsed = urlParse(sourceMapURL);\n if (!parsed) {\n throw new Error(\"sourceMapURL could not be parsed\");\n }\n if (parsed.path) {\n // Strip the last path component, but keep the \"/\".\n var index = parsed.path.lastIndexOf('/');\n if (index >= 0) {\n parsed.path = parsed.path.substring(0, index + 1);\n }\n }\n sourceURL = join(urlGenerate(parsed), sourceURL);\n }\n\n return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n this._array = [];\n this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n var set = new ArraySet();\n for (var i = 0, len = aArray.length; i < len; i++) {\n set.add(aArray[i], aAllowDuplicates);\n }\n return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n var idx = this._array.length;\n if (!isDuplicate || aAllowDuplicates) {\n this._array.push(aStr);\n }\n if (!isDuplicate) {\n if (hasNativeMap) {\n this._set.set(aStr, idx);\n } else {\n this._set[sStr] = idx;\n }\n }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n if (hasNativeMap) {\n return this._set.has(aStr);\n } else {\n var sStr = util.toSetString(aStr);\n return has.call(this._set, sStr);\n }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n if (hasNativeMap) {\n var idx = this._set.get(aStr);\n if (idx >= 0) {\n return idx;\n }\n } else {\n var sStr = util.toSetString(aStr);\n if (has.call(this._set, sStr)) {\n return this._set[sStr];\n }\n }\n\n throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n if (aIdx >= 0 && aIdx < this._array.length) {\n return this._array[aIdx];\n }\n throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n // Optimized for most common case\n var lineA = mappingA.generatedLine;\n var lineB = mappingB.generatedLine;\n var columnA = mappingA.generatedColumn;\n var columnB = mappingB.generatedColumn;\n return lineB > lineA || lineB == lineA && columnB >= columnA ||\n util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n this._array = [];\n this._sorted = true;\n // Serves as infimum\n this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n function MappingList_forEach(aCallback, aThisArg) {\n this._array.forEach(aCallback, aThisArg);\n };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n if (generatedPositionAfter(this._last, aMapping)) {\n this._last = aMapping;\n this._array.push(aMapping);\n } else {\n this._sorted = false;\n this._array.push(aMapping);\n }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n if (!this._sorted) {\n this._array.sort(util.compareByGeneratedPositionsInflated);\n this._sorted = true;\n }\n return this._array;\n};\n\nexports.MappingList = MappingList;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n * - file: The filename of the generated source.\n * - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n if (!aArgs) {\n aArgs = {};\n }\n this._file = util.getArg(aArgs, 'file', null);\n this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n this._sources = new ArraySet();\n this._names = new ArraySet();\n this._mappings = new MappingList();\n this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n var sourceRoot = aSourceMapConsumer.sourceRoot;\n var generator = new SourceMapGenerator({\n file: aSourceMapConsumer.file,\n sourceRoot: sourceRoot\n });\n aSourceMapConsumer.eachMapping(function (mapping) {\n var newMapping = {\n generated: {\n line: mapping.generatedLine,\n column: mapping.generatedColumn\n }\n };\n\n if (mapping.source != null) {\n newMapping.source = mapping.source;\n if (sourceRoot != null) {\n newMapping.source = util.relative(sourceRoot, newMapping.source);\n }\n\n newMapping.original = {\n line: mapping.originalLine,\n column: mapping.originalColumn\n };\n\n if (mapping.name != null) {\n newMapping.name = mapping.name;\n }\n }\n\n generator.addMapping(newMapping);\n });\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var sourceRelative = sourceFile;\n if (sourceRoot !== null) {\n sourceRelative = util.relative(sourceRoot, sourceFile);\n }\n\n if (!generator._sources.has(sourceRelative)) {\n generator._sources.add(sourceRelative);\n }\n\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n generator.setSourceContent(sourceFile, content);\n }\n });\n return generator;\n };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n * - generated: An object with the generated line and column positions.\n * - original: An object with the original line and column positions.\n * - source: The original source file (relative to the sourceRoot).\n * - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n function SourceMapGenerator_addMapping(aArgs) {\n var generated = util.getArg(aArgs, 'generated');\n var original = util.getArg(aArgs, 'original', null);\n var source = util.getArg(aArgs, 'source', null);\n var name = util.getArg(aArgs, 'name', null);\n\n if (!this._skipValidation) {\n this._validateMapping(generated, original, source, name);\n }\n\n if (source != null) {\n source = String(source);\n if (!this._sources.has(source)) {\n this._sources.add(source);\n }\n }\n\n if (name != null) {\n name = String(name);\n if (!this._names.has(name)) {\n this._names.add(name);\n }\n }\n\n this._mappings.add({\n generatedLine: generated.line,\n generatedColumn: generated.column,\n originalLine: original != null && original.line,\n originalColumn: original != null && original.column,\n source: source,\n name: name\n });\n };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n var source = aSourceFile;\n if (this._sourceRoot != null) {\n source = util.relative(this._sourceRoot, source);\n }\n\n if (aSourceContent != null) {\n // Add the source content to the _sourcesContents map.\n // Create a new _sourcesContents map if the property is null.\n if (!this._sourcesContents) {\n this._sourcesContents = Object.create(null);\n }\n this._sourcesContents[util.toSetString(source)] = aSourceContent;\n } else if (this._sourcesContents) {\n // Remove the source file from the _sourcesContents map.\n // If the _sourcesContents map is empty, set the property to null.\n delete this._sourcesContents[util.toSetString(source)];\n if (Object.keys(this._sourcesContents).length === 0) {\n this._sourcesContents = null;\n }\n }\n };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n * If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n * to be applied. If relative, it is relative to the SourceMapConsumer.\n * This parameter is needed when the two source maps aren't in the same\n * directory, and the source map to be applied contains relative source\n * paths. If so, those relative source paths need to be rewritten\n * relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n var sourceFile = aSourceFile;\n // If aSourceFile is omitted, we will use the file property of the SourceMap\n if (aSourceFile == null) {\n if (aSourceMapConsumer.file == null) {\n throw new Error(\n 'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n 'or the source map\\'s \"file\" property. Both were omitted.'\n );\n }\n sourceFile = aSourceMapConsumer.file;\n }\n var sourceRoot = this._sourceRoot;\n // Make \"sourceFile\" relative if an absolute Url is passed.\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n // Applying the SourceMap can add and remove items from the sources and\n // the names array.\n var newSources = new ArraySet();\n var newNames = new ArraySet();\n\n // Find mappings for the \"sourceFile\"\n this._mappings.unsortedForEach(function (mapping) {\n if (mapping.source === sourceFile && mapping.originalLine != null) {\n // Check if it can be mapped by the source map, then update the mapping.\n var original = aSourceMapConsumer.originalPositionFor({\n line: mapping.originalLine,\n column: mapping.originalColumn\n });\n if (original.source != null) {\n // Copy mapping\n mapping.source = original.source;\n if (aSourceMapPath != null) {\n mapping.source = util.join(aSourceMapPath, mapping.source)\n }\n if (sourceRoot != null) {\n mapping.source = util.relative(sourceRoot, mapping.source);\n }\n mapping.originalLine = original.line;\n mapping.originalColumn = original.column;\n if (original.name != null) {\n mapping.name = original.name;\n }\n }\n }\n\n var source = mapping.source;\n if (source != null && !newSources.has(source)) {\n newSources.add(source);\n }\n\n var name = mapping.name;\n if (name != null && !newNames.has(name)) {\n newNames.add(name);\n }\n\n }, this);\n this._sources = newSources;\n this._names = newNames;\n\n // Copy sourcesContents of applied map.\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aSourceMapPath != null) {\n sourceFile = util.join(aSourceMapPath, sourceFile);\n }\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n this.setSourceContent(sourceFile, content);\n }\n }, this);\n };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n * 1. Just the generated position.\n * 2. The Generated position, original position, and original source.\n * 3. Generated and original position, original source, as well as a name\n * token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n aName) {\n // When aOriginal is truthy but has empty values for .line and .column,\n // it is most likely a programmer error. In this case we throw a very\n // specific error message to try to guide them the right way.\n // For example: https://github.com/Polymer/polymer-bundler/pull/519\n if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n throw new Error(\n 'original.line and original.column are not numbers -- you probably meant to omit ' +\n 'the original mapping entirely and only map the generated position. If so, pass ' +\n 'null for the original mapping instead of an object with empty or null values.'\n );\n }\n\n if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aGenerated.line > 0 && aGenerated.column >= 0\n && !aOriginal && !aSource && !aName) {\n // Case 1.\n return;\n }\n else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n && aGenerated.line > 0 && aGenerated.column >= 0\n && aOriginal.line > 0 && aOriginal.column >= 0\n && aSource) {\n // Cases 2 and 3.\n return;\n }\n else {\n throw new Error('Invalid mapping: ' + JSON.stringify({\n generated: aGenerated,\n source: aSource,\n original: aOriginal,\n name: aName\n }));\n }\n };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n function SourceMapGenerator_serializeMappings() {\n var previousGeneratedColumn = 0;\n var previousGeneratedLine = 1;\n var previousOriginalColumn = 0;\n var previousOriginalLine = 0;\n var previousName = 0;\n var previousSource = 0;\n var result = '';\n var next;\n var mapping;\n var nameIdx;\n var sourceIdx;\n\n var mappings = this._mappings.toArray();\n for (var i = 0, len = mappings.length; i < len; i++) {\n mapping = mappings[i];\n next = ''\n\n if (mapping.generatedLine !== previousGeneratedLine) {\n previousGeneratedColumn = 0;\n while (mapping.generatedLine !== previousGeneratedLine) {\n next += ';';\n previousGeneratedLine++;\n }\n }\n else {\n if (i > 0) {\n if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n continue;\n }\n next += ',';\n }\n }\n\n next += base64VLQ.encode(mapping.generatedColumn\n - previousGeneratedColumn);\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (mapping.source != null) {\n sourceIdx = this._sources.indexOf(mapping.source);\n next += base64VLQ.encode(sourceIdx - previousSource);\n previousSource = sourceIdx;\n\n // lines are stored 0-based in SourceMap spec version 3\n next += base64VLQ.encode(mapping.originalLine - 1\n - previousOriginalLine);\n previousOriginalLine = mapping.originalLine - 1;\n\n next += base64VLQ.encode(mapping.originalColumn\n - previousOriginalColumn);\n previousOriginalColumn = mapping.originalColumn;\n\n if (mapping.name != null) {\n nameIdx = this._names.indexOf(mapping.name);\n next += base64VLQ.encode(nameIdx - previousName);\n previousName = nameIdx;\n }\n }\n\n result += next;\n }\n\n return result;\n };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n return aSources.map(function (source) {\n if (!this._sourcesContents) {\n return null;\n }\n if (aSourceRoot != null) {\n source = util.relative(aSourceRoot, source);\n }\n var key = util.toSetString(source);\n return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n ? this._sourcesContents[key]\n : null;\n }, this);\n };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n function SourceMapGenerator_toJSON() {\n var map = {\n version: this._version,\n sources: this._sources.toArray(),\n names: this._names.toArray(),\n mappings: this._serializeMappings()\n };\n if (this._file != null) {\n map.file = this._file;\n }\n if (this._sourceRoot != null) {\n map.sourceRoot = this._sourceRoot;\n }\n if (this._sourcesContents) {\n map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n }\n\n return map;\n };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n function SourceMapGenerator_toString() {\n return JSON.stringify(this.toJSON());\n };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n // This function terminates when one of the following is true:\n //\n // 1. We find the exact element we are looking for.\n //\n // 2. We did not find the exact element, but we can return the index of\n // the next-closest element.\n //\n // 3. We did not find the exact element, and there is no next-closest\n // element than the one we are searching for, so we return -1.\n var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n var cmp = aCompare(aNeedle, aHaystack[mid], true);\n if (cmp === 0) {\n // Found the element we are looking for.\n return mid;\n }\n else if (cmp > 0) {\n // Our needle is greater than aHaystack[mid].\n if (aHigh - mid > 1) {\n // The element is in the upper half.\n return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // The exact needle element was not found in this haystack. Determine if\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return aHigh < aHaystack.length ? aHigh : -1;\n } else {\n return mid;\n }\n }\n else {\n // Our needle is less than aHaystack[mid].\n if (mid - aLow > 1) {\n // The element is in the lower half.\n return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return mid;\n } else {\n return aLow < 0 ? -1 : aLow;\n }\n }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n * array and returns -1, 0, or 1 depending on whether the needle is less\n * than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n if (aHaystack.length === 0) {\n return -1;\n }\n\n var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n if (index < 0) {\n return -1;\n }\n\n // We have found either the exact element, or the next-closest element than\n // the one we are searching for. However, there may be more than one such\n // element. Make sure we always return the smallest of these.\n while (index - 1 >= 0) {\n if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n break;\n }\n --index;\n }\n\n return index;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n * The array.\n * @param {Number} x\n * The index of the first item.\n * @param {Number} y\n * The index of the second item.\n */\nfunction swap(ary, x, y) {\n var temp = ary[x];\n ary[x] = ary[y];\n ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n * The lower bound on the range.\n * @param {Number} high\n * The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n * @param {Number} p\n * Start index of the array\n * @param {Number} r\n * End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n // If our lower bound is less than our upper bound, we (1) partition the\n // array into two pieces and (2) recurse on each half. If it is not, this is\n // the empty array and our base case.\n\n if (p < r) {\n // (1) Partitioning.\n //\n // The partitioning chooses a pivot between `p` and `r` and moves all\n // elements that are less than or equal to the pivot to the before it, and\n // all the elements that are greater than it after it. The effect is that\n // once partition is done, the pivot is in the exact place it will be when\n // the array is put in sorted order, and it will not need to be moved\n // again. This runs in O(n) time.\n\n // Always choose a random pivot so that an input array which is reverse\n // sorted does not cause O(n^2) running time.\n var pivotIndex = randomIntInRange(p, r);\n var i = p - 1;\n\n swap(ary, pivotIndex, r);\n var pivot = ary[r];\n\n // Immediately after `j` is incremented in this loop, the following hold\n // true:\n //\n // * Every element in `ary[p .. i]` is less than or equal to the pivot.\n //\n // * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n for (var j = p; j < r; j++) {\n if (comparator(ary[j], pivot) <= 0) {\n i += 1;\n swap(ary, i, j);\n }\n }\n\n swap(ary, i + 1, j);\n var q = i + 1;\n\n // (2) Recurse on each half.\n\n doQuickSort(ary, comparator, p, q - 1);\n doQuickSort(ary, comparator, q + 1, r);\n }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n return sourceMap.sections != null\n ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n// {\n// generatedLine: The line number in the generated code,\n// generatedColumn: The column number in the generated code,\n// source: The path to the original source file that generated this\n// chunk of code,\n// originalLine: The line number in the original source that\n// corresponds to this chunk of generated code,\n// originalColumn: The column number in the original source that\n// corresponds to this chunk of generated code,\n// name: The name of the original symbol which generated this chunk of\n// code.\n// }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n configurable: true,\n enumerable: true,\n get: function () {\n if (!this.__generatedMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__generatedMappings;\n }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n configurable: true,\n enumerable: true,\n get: function () {\n if (!this.__originalMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__originalMappings;\n }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n var c = aStr.charAt(index);\n return c === \";\" || c === \",\";\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n throw new Error(\"Subclasses must implement _parseMappings\");\n };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n * The function that is called with each mapping.\n * @param Object aContext\n * Optional. If specified, this object will be the value of `this` every\n * time that `aCallback` is called.\n * @param aOrder\n * Either `SourceMapConsumer.GENERATED_ORDER` or\n * `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n * iterate over the mappings sorted by the generated file's line/column\n * order or the original's source/line/column order, respectively. Defaults to\n * `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n var context = aContext || null;\n var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n var mappings;\n switch (order) {\n case SourceMapConsumer.GENERATED_ORDER:\n mappings = this._generatedMappings;\n break;\n case SourceMapConsumer.ORIGINAL_ORDER:\n mappings = this._originalMappings;\n break;\n default:\n throw new Error(\"Unknown order of iteration.\");\n }\n\n var sourceRoot = this.sourceRoot;\n mappings.map(function (mapping) {\n var source = mapping.source === null ? null : this._sources.at(mapping.source);\n source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n return {\n source: source,\n generatedLine: mapping.generatedLine,\n generatedColumn: mapping.generatedColumn,\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: mapping.name === null ? null : this._names.at(mapping.name)\n };\n }, this).forEach(aCallback, context);\n };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number is 1-based.\n * - column: Optional. the column number in the original source.\n * The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n var line = util.getArg(aArgs, 'line');\n\n // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n // returns the index of the closest mapping less than the needle. By\n // setting needle.originalColumn to 0, we thus find the last mapping for\n // the given line, provided such a mapping exists.\n var needle = {\n source: util.getArg(aArgs, 'source'),\n originalLine: line,\n originalColumn: util.getArg(aArgs, 'column', 0)\n };\n\n needle.source = this._findSourceIndex(needle.source);\n if (needle.source < 0) {\n return [];\n }\n\n var mappings = [];\n\n var index = this._findMapping(needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n binarySearch.LEAST_UPPER_BOUND);\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (aArgs.column === undefined) {\n var originalLine = mapping.originalLine;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we found. Since\n // mappings are sorted, this is guaranteed to find all mappings for\n // the line we found.\n while (mapping && mapping.originalLine === originalLine) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n } else {\n var originalColumn = mapping.originalColumn;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we were searching for.\n // Since mappings are sorted, this is guaranteed to find all mappings for\n // the line we are searching for.\n while (mapping &&\n mapping.originalLine === line &&\n mapping.originalColumn == originalColumn) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n }\n }\n\n return mappings;\n };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - sources: An array of URLs to the original source files.\n * - names: An array of identifiers which can be referrenced by individual mappings.\n * - sourceRoot: Optional. The URL root from which all sources are relative.\n * - sourcesContent: Optional. An array of contents of the original source files.\n * - mappings: A string of base64 VLQs which contain the actual mappings.\n * - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n * {\n * version : 3,\n * file: \"out.js\",\n * sourceRoot : \"\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AA,AB;;ABCDE;\"\n * }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found. This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sources = util.getArg(sourceMap, 'sources');\n // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n // requires the array) to play nice here.\n var names = util.getArg(sourceMap, 'names', []);\n var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n var mappings = util.getArg(sourceMap, 'mappings');\n var file = util.getArg(sourceMap, 'file', null);\n\n // Once again, Sass deviates from the spec and supplies the version as a\n // string rather than a number, so we use loose equality checking here.\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n if (sourceRoot) {\n sourceRoot = util.normalize(sourceRoot);\n }\n\n sources = sources\n .map(String)\n // Some source maps produce relative source paths like \"./foo.js\" instead of\n // \"foo.js\". Normalize these first so that future comparisons will succeed.\n // See bugzil.la/1090768.\n .map(util.normalize)\n // Always ensure that absolute sources are internally stored relative to\n // the source root, if the source root is absolute. Not doing this would\n // be particularly problematic when the source root is a prefix of the\n // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n .map(function (source) {\n return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n ? util.relative(sourceRoot, source)\n : source;\n });\n\n // Pass `true` below to allow duplicate names and sources. While source maps\n // are intended to be compressed and deduplicated, the TypeScript compiler\n // sometimes generates source maps with duplicates in them. See Github issue\n // #72 and bugzil.la/889492.\n this._names = ArraySet.fromArray(names.map(String), true);\n this._sources = ArraySet.fromArray(sources, true);\n\n this._absoluteSources = this._sources.toArray().map(function (s) {\n return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n });\n\n this.sourceRoot = sourceRoot;\n this.sourcesContent = sourcesContent;\n this._mappings = mappings;\n this._sourceMapURL = aSourceMapURL;\n this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source. Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n var relativeSource = aSource;\n if (this.sourceRoot != null) {\n relativeSource = util.relative(this.sourceRoot, relativeSource);\n }\n\n if (this._sources.has(relativeSource)) {\n return this._sources.indexOf(relativeSource);\n }\n\n // Maybe aSource is an absolute URL as returned by |sources|. In\n // this case we can't simply undo the transform.\n var i;\n for (i = 0; i < this._absoluteSources.length; ++i) {\n if (this._absoluteSources[i] == aSource) {\n return i;\n }\n }\n\n return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n * The source map that will be consumed.\n * @param String aSourceMapURL\n * The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n smc.sourceRoot = aSourceMap._sourceRoot;\n smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n smc.sourceRoot);\n smc.file = aSourceMap._file;\n smc._sourceMapURL = aSourceMapURL;\n smc._absoluteSources = smc._sources.toArray().map(function (s) {\n return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n });\n\n // Because we are modifying the entries (by converting string sources and\n // names to indices into the sources and names ArraySets), we have to make\n // a copy of the entry or else bad things happen. Shared mutable state\n // strikes again! See github issue #191.\n\n var generatedMappings = aSourceMap._mappings.toArray().slice();\n var destGeneratedMappings = smc.__generatedMappings = [];\n var destOriginalMappings = smc.__originalMappings = [];\n\n for (var i = 0, length = generatedMappings.length; i < length; i++) {\n var srcMapping = generatedMappings[i];\n var destMapping = new Mapping;\n destMapping.generatedLine = srcMapping.generatedLine;\n destMapping.generatedColumn = srcMapping.generatedColumn;\n\n if (srcMapping.source) {\n destMapping.source = sources.indexOf(srcMapping.source);\n destMapping.originalLine = srcMapping.originalLine;\n destMapping.originalColumn = srcMapping.originalColumn;\n\n if (srcMapping.name) {\n destMapping.name = names.indexOf(srcMapping.name);\n }\n\n destOriginalMappings.push(destMapping);\n }\n\n destGeneratedMappings.push(destMapping);\n }\n\n quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n return smc;\n };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n get: function () {\n return this._absoluteSources.slice();\n }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n this.generatedLine = 0;\n this.generatedColumn = 0;\n this.source = null;\n this.originalLine = null;\n this.originalColumn = null;\n this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n var generatedLine = 1;\n var previousGeneratedColumn = 0;\n var previousOriginalLine = 0;\n var previousOriginalColumn = 0;\n var previousSource = 0;\n var previousName = 0;\n var length = aStr.length;\n var index = 0;\n var cachedSegments = {};\n var temp = {};\n var originalMappings = [];\n var generatedMappings = [];\n var mapping, str, segment, end, value;\n\n while (index < length) {\n if (aStr.charAt(index) === ';') {\n generatedLine++;\n index++;\n previousGeneratedColumn = 0;\n }\n else if (aStr.charAt(index) === ',') {\n index++;\n }\n else {\n mapping = new Mapping();\n mapping.generatedLine = generatedLine;\n\n // Because each offset is encoded relative to the previous one,\n // many segments often have the same encoding. We can exploit this\n // fact by caching the parsed variable length fields of each segment,\n // allowing us to avoid a second parse if we encounter the same\n // segment again.\n for (end = index; end < length; end++) {\n if (this._charIsMappingSeparator(aStr, end)) {\n break;\n }\n }\n str = aStr.slice(index, end);\n\n segment = cachedSegments[str];\n if (segment) {\n index += str.length;\n } else {\n segment = [];\n while (index < end) {\n base64VLQ.decode(aStr, index, temp);\n value = temp.value;\n index = temp.rest;\n segment.push(value);\n }\n\n if (segment.length === 2) {\n throw new Error('Found a source, but no line and column');\n }\n\n if (segment.length === 3) {\n throw new Error('Found a source and line, but no column');\n }\n\n cachedSegments[str] = segment;\n }\n\n // Generated column.\n mapping.generatedColumn = previousGeneratedColumn + segment[0];\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (segment.length > 1) {\n // Original source.\n mapping.source = previousSource + segment[1];\n previousSource += segment[1];\n\n // Original line.\n mapping.originalLine = previousOriginalLine + segment[2];\n previousOriginalLine = mapping.originalLine;\n // Lines are stored 0-based\n mapping.originalLine += 1;\n\n // Original column.\n mapping.originalColumn = previousOriginalColumn + segment[3];\n previousOriginalColumn = mapping.originalColumn;\n\n if (segment.length > 4) {\n // Original name.\n mapping.name = previousName + segment[4];\n previousName += segment[4];\n }\n }\n\n generatedMappings.push(mapping);\n if (typeof mapping.originalLine === 'number') {\n originalMappings.push(mapping);\n }\n }\n }\n\n quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n this.__generatedMappings = generatedMappings;\n\n quickSort(originalMappings, util.compareByOriginalPositions);\n this.__originalMappings = originalMappings;\n };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n aColumnName, aComparator, aBias) {\n // To return the position we are searching for, we must first find the\n // mapping for the given position and then return the opposite position it\n // points to. Because the mappings are sorted, we can use binary search to\n // find the best mapping.\n\n if (aNeedle[aLineName] <= 0) {\n throw new TypeError('Line must be greater than or equal to 1, got '\n + aNeedle[aLineName]);\n }\n if (aNeedle[aColumnName] < 0) {\n throw new TypeError('Column must be greater than or equal to 0, got '\n + aNeedle[aColumnName]);\n }\n\n return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n function SourceMapConsumer_computeColumnSpans() {\n for (var index = 0; index < this._generatedMappings.length; ++index) {\n var mapping = this._generatedMappings[index];\n\n // Mappings do not contain a field for the last generated columnt. We\n // can come up with an optimistic estimate, however, by assuming that\n // mappings are contiguous (i.e. given two consecutive mappings, the\n // first mapping ends where the second one starts).\n if (index + 1 < this._generatedMappings.length) {\n var nextMapping = this._generatedMappings[index + 1];\n\n if (mapping.generatedLine === nextMapping.generatedLine) {\n mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n continue;\n }\n }\n\n // The last mapping for each line spans the entire line.\n mapping.lastGeneratedColumn = Infinity;\n }\n };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source. The line number\n * is 1-based.\n * - column: The column number in the generated source. The column\n * number is 0-based.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null. The\n * line number is 1-based.\n * - column: The column number in the original source, or null. The\n * column number is 0-based.\n * - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n function SourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._generatedMappings,\n \"generatedLine\",\n \"generatedColumn\",\n util.compareByGeneratedPositionsDeflated,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._generatedMappings[index];\n\n if (mapping.generatedLine === needle.generatedLine) {\n var source = util.getArg(mapping, 'source', null);\n if (source !== null) {\n source = this._sources.at(source);\n source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n }\n var name = util.getArg(mapping, 'name', null);\n if (name !== null) {\n name = this._names.at(name);\n }\n return {\n source: source,\n line: util.getArg(mapping, 'originalLine', null),\n column: util.getArg(mapping, 'originalColumn', null),\n name: name\n };\n }\n }\n\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n function BasicSourceMapConsumer_hasContentsOfAllSources() {\n if (!this.sourcesContent) {\n return false;\n }\n return this.sourcesContent.length >= this._sources.size() &&\n !this.sourcesContent.some(function (sc) { return sc == null; });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n if (!this.sourcesContent) {\n return null;\n }\n\n var index = this._findSourceIndex(aSource);\n if (index >= 0) {\n return this.sourcesContent[index];\n }\n\n var relativeSource = aSource;\n if (this.sourceRoot != null) {\n relativeSource = util.relative(this.sourceRoot, relativeSource);\n }\n\n var url;\n if (this.sourceRoot != null\n && (url = util.urlParse(this.sourceRoot))) {\n // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n // many users. We can help them out when they expect file:// URIs to\n // behave like it would if they were running a local HTTP server. See\n // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n if (url.scheme == \"file\"\n && this._sources.has(fileUriAbsPath)) {\n return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n }\n\n if ((!url.path || url.path == \"/\")\n && this._sources.has(\"/\" + relativeSource)) {\n return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n }\n }\n\n // This function is used recursively from\n // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n // don't want to throw if we can't find the source - we just want to\n // return null, so we provide a flag to exit gracefully.\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number\n * is 1-based.\n * - column: The column number in the original source. The column\n * number is 0-based.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n function SourceMapConsumer_generatedPositionFor(aArgs) {\n var source = util.getArg(aArgs, 'source');\n source = this._findSourceIndex(source);\n if (source < 0) {\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n }\n\n var needle = {\n source: source,\n originalLine: util.getArg(aArgs, 'line'),\n originalColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (mapping.source === needle.source) {\n return {\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n };\n }\n }\n\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - file: Optional. The generated file this source map is associated with.\n * - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n * - offset: The offset into the original specified at which this section\n * begins to apply, defined as an object with a \"line\" and \"column\"\n * field.\n * - map: A source map definition. This source map could also be indexed,\n * but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n * {\n * version : 3,\n * file: \"app.js\",\n * sections: [{\n * offset: {line:100, column:10},\n * map: {\n * version : 3,\n * file: \"section.js\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AAAA,E;;ABCDE;\"\n * }\n * }],\n * }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found. This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sections = util.getArg(sourceMap, 'sections');\n\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n this._sources = new ArraySet();\n this._names = new ArraySet();\n\n var lastOffset = {\n line: -1,\n column: 0\n };\n this._sections = sections.map(function (s) {\n if (s.url) {\n // The url field will require support for asynchronicity.\n // See https://github.com/mozilla/source-map/issues/16\n throw new Error('Support for url field in sections not implemented.');\n }\n var offset = util.getArg(s, 'offset');\n var offsetLine = util.getArg(offset, 'line');\n var offsetColumn = util.getArg(offset, 'column');\n\n if (offsetLine < lastOffset.line ||\n (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n throw new Error('Section offsets must be ordered and non-overlapping.');\n }\n lastOffset = offset;\n\n return {\n generatedOffset: {\n // The offset fields are 0-based, but we use 1-based indices when\n // encoding/decoding from VLQ.\n generatedLine: offsetLine + 1,\n generatedColumn: offsetColumn + 1\n },\n consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n }\n });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n get: function () {\n var sources = [];\n for (var i = 0; i < this._sections.length; i++) {\n for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n sources.push(this._sections[i].consumer.sources[j]);\n }\n }\n return sources;\n }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source. The line number\n * is 1-based.\n * - column: The column number in the generated source. The column\n * number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null. The\n * line number is 1-based.\n * - column: The column number in the original source, or null. The\n * column number is 0-based.\n * - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n // Find the section containing the generated position we're trying to map\n // to an original position.\n var sectionIndex = binarySearch.search(needle, this._sections,\n function(needle, section) {\n var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n if (cmp) {\n return cmp;\n }\n\n return (needle.generatedColumn -\n section.generatedOffset.generatedColumn);\n });\n var section = this._sections[sectionIndex];\n\n if (!section) {\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n }\n\n return section.consumer.originalPositionFor({\n line: needle.generatedLine -\n (section.generatedOffset.generatedLine - 1),\n column: needle.generatedColumn -\n (section.generatedOffset.generatedLine === needle.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n bias: aArgs.bias\n });\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n return this._sections.every(function (s) {\n return s.consumer.hasContentsOfAllSources();\n });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n var content = section.consumer.sourceContentFor(aSource, true);\n if (content) {\n return content;\n }\n }\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number\n * is 1-based.\n * - column: The column number in the original source. The column\n * number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based. \n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n // Only consider this section if the requested source is in the list of\n // sources of the consumer.\n if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n continue;\n }\n var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n if (generatedPosition) {\n var ret = {\n line: generatedPosition.line +\n (section.generatedOffset.generatedLine - 1),\n column: generatedPosition.column +\n (section.generatedOffset.generatedLine === generatedPosition.line\n ? section.generatedOffset.generatedColumn - 1\n : 0)\n };\n return ret;\n }\n }\n\n return {\n line: null,\n column: null\n };\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n this.__generatedMappings = [];\n this.__originalMappings = [];\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n var sectionMappings = section.consumer._generatedMappings;\n for (var j = 0; j < sectionMappings.length; j++) {\n var mapping = sectionMappings[j];\n\n var source = section.consumer._sources.at(mapping.source);\n source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n this._sources.add(source);\n source = this._sources.indexOf(source);\n\n var name = null;\n if (mapping.name) {\n name = section.consumer._names.at(mapping.name);\n this._names.add(name);\n name = this._names.indexOf(name);\n }\n\n // The mappings coming from the consumer for the section have\n // generated positions relative to the start of the section, so we\n // need to offset them to be relative to the start of the concatenated\n // generated file.\n var adjustedMapping = {\n source: source,\n generatedLine: mapping.generatedLine +\n (section.generatedOffset.generatedLine - 1),\n generatedColumn: mapping.generatedColumn +\n (section.generatedOffset.generatedLine === mapping.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: name\n };\n\n this.__generatedMappings.push(adjustedMapping);\n if (typeof adjustedMapping.originalLine === 'number') {\n this.__originalMappings.push(adjustedMapping);\n }\n }\n }\n\n quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n quickSort(this.__originalMappings, util.compareByOriginalPositions);\n };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n * generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n this.children = [];\n this.sourceContents = {};\n this.line = aLine == null ? null : aLine;\n this.column = aColumn == null ? null : aColumn;\n this.source = aSource == null ? null : aSource;\n this.name = aName == null ? null : aName;\n this[isSourceNode] = true;\n if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n * SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n // The SourceNode we want to fill with the generated code\n // and the SourceMap\n var node = new SourceNode();\n\n // All even indices of this array are one line of the generated code,\n // while all odd indices are the newlines between two adjacent lines\n // (since `REGEX_NEWLINE` captures its match).\n // Processed fragments are accessed by calling `shiftNextLine`.\n var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n var remainingLinesIndex = 0;\n var shiftNextLine = function() {\n var lineContents = getNextLine();\n // The last line of a file might not have a newline.\n var newLine = getNextLine() || \"\";\n return lineContents + newLine;\n\n function getNextLine() {\n return remainingLinesIndex < remainingLines.length ?\n remainingLines[remainingLinesIndex++] : undefined;\n }\n };\n\n // We need to remember the position of \"remainingLines\"\n var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n // The generate SourceNodes we need a code range.\n // To extract it current and last mapping is used.\n // Here we store the last mapping.\n var lastMapping = null;\n\n aSourceMapConsumer.eachMapping(function (mapping) {\n if (lastMapping !== null) {\n // We add the code from \"lastMapping\" to \"mapping\":\n // First check if there is a new line in between.\n if (lastGeneratedLine < mapping.generatedLine) {\n // Associate first line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n lastGeneratedLine++;\n lastGeneratedColumn = 0;\n // The remaining code is added without mapping\n } else {\n // There is no new line in between.\n // Associate the code between \"lastGeneratedColumn\" and\n // \"mapping.generatedColumn\" with \"lastMapping\"\n var nextLine = remainingLines[remainingLinesIndex] || '';\n var code = nextLine.substr(0, mapping.generatedColumn -\n lastGeneratedColumn);\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n lastGeneratedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n addMappingWithCode(lastMapping, code);\n // No more remaining code, continue\n lastMapping = mapping;\n return;\n }\n }\n // We add the generated code until the first mapping\n // to the SourceNode without any mapping.\n // Each line is added as separate string.\n while (lastGeneratedLine < mapping.generatedLine) {\n node.add(shiftNextLine());\n lastGeneratedLine++;\n }\n if (lastGeneratedColumn < mapping.generatedColumn) {\n var nextLine = remainingLines[remainingLinesIndex] || '';\n node.add(nextLine.substr(0, mapping.generatedColumn));\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n }\n lastMapping = mapping;\n }, this);\n // We have processed all mappings.\n if (remainingLinesIndex < remainingLines.length) {\n if (lastMapping) {\n // Associate the remaining code in the current line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n }\n // and add the remaining lines without any mapping\n node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n }\n\n // Copy sourcesContent into SourceNode\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aRelativePath != null) {\n sourceFile = util.join(aRelativePath, sourceFile);\n }\n node.setSourceContent(sourceFile, content);\n }\n });\n\n return node;\n\n function addMappingWithCode(mapping, code) {\n if (mapping === null || mapping.source === undefined) {\n node.add(code);\n } else {\n var source = aRelativePath\n ? util.join(aRelativePath, mapping.source)\n : mapping.source;\n node.add(new SourceNode(mapping.originalLine,\n mapping.originalColumn,\n source,\n code,\n mapping.name));\n }\n }\n };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n if (Array.isArray(aChunk)) {\n aChunk.forEach(function (chunk) {\n this.add(chunk);\n }, this);\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n if (aChunk) {\n this.children.push(aChunk);\n }\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n if (Array.isArray(aChunk)) {\n for (var i = aChunk.length-1; i >= 0; i--) {\n this.prepend(aChunk[i]);\n }\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n this.children.unshift(aChunk);\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n var chunk;\n for (var i = 0, len = this.children.length; i < len; i++) {\n chunk = this.children[i];\n if (chunk[isSourceNode]) {\n chunk.walk(aFn);\n }\n else {\n if (chunk !== '') {\n aFn(chunk, { source: this.source,\n line: this.line,\n column: this.column,\n name: this.name });\n }\n }\n }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n var newChildren;\n var i;\n var len = this.children.length;\n if (len > 0) {\n newChildren = [];\n for (i = 0; i < len-1; i++) {\n newChildren.push(this.children[i]);\n newChildren.push(aSep);\n }\n newChildren.push(this.children[i]);\n this.children = newChildren;\n }\n return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n var lastChild = this.children[this.children.length - 1];\n if (lastChild[isSourceNode]) {\n lastChild.replaceRight(aPattern, aReplacement);\n }\n else if (typeof lastChild === 'string') {\n this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n }\n else {\n this.children.push(''.replace(aPattern, aReplacement));\n }\n return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n function SourceNode_walkSourceContents(aFn) {\n for (var i = 0, len = this.children.length; i < len; i++) {\n if (this.children[i][isSourceNode]) {\n this.children[i].walkSourceContents(aFn);\n }\n }\n\n var sources = Object.keys(this.sourceContents);\n for (var i = 0, len = sources.length; i < len; i++) {\n aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n }\n };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n var str = \"\";\n this.walk(function (chunk) {\n str += chunk;\n });\n return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n var generated = {\n code: \"\",\n line: 1,\n column: 0\n };\n var map = new SourceMapGenerator(aArgs);\n var sourceMappingActive = false;\n var lastOriginalSource = null;\n var lastOriginalLine = null;\n var lastOriginalColumn = null;\n var lastOriginalName = null;\n this.walk(function (chunk, original) {\n generated.code += chunk;\n if (original.source !== null\n && original.line !== null\n && original.column !== null) {\n if(lastOriginalSource !== original.source\n || lastOriginalLine !== original.line\n || lastOriginalColumn !== original.column\n || lastOriginalName !== original.name) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n lastOriginalSource = original.source;\n lastOriginalLine = original.line;\n lastOriginalColumn = original.column;\n lastOriginalName = original.name;\n sourceMappingActive = true;\n } else if (sourceMappingActive) {\n map.addMapping({\n generated: {\n line: generated.line,\n column: generated.column\n }\n });\n lastOriginalSource = null;\n sourceMappingActive = false;\n }\n for (var idx = 0, length = chunk.length; idx < length; idx++) {\n if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n generated.line++;\n generated.column = 0;\n // Mappings end at eol\n if (idx + 1 === length) {\n lastOriginalSource = null;\n sourceMappingActive = false;\n } else if (sourceMappingActive) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n } else {\n generated.column++;\n }\n }\n });\n this.walkSourceContents(function (sourceFile, sourceContent) {\n map.setSourceContent(sourceFile, sourceContent);\n });\n\n return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n","/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// resolves . and .. elements in a path array with directory names there\n// must be no slashes, empty elements, or device names (c:\\) in the array\n// (so also no leading and trailing slashes - it does not distinguish\n// relative and absolute paths)\nfunction normalizeArray(parts, allowAboveRoot) {\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = parts.length - 1; i >= 0; i--) {\n var last = parts[i];\n if (last === '.') {\n parts.splice(i, 1);\n } else if (last === '..') {\n parts.splice(i, 1);\n up++;\n } else if (up) {\n parts.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (allowAboveRoot) {\n for (; up--; up) {\n parts.unshift('..');\n }\n }\n\n return parts;\n}\n\n// Split a filename into [root, dir, basename, ext], unix version\n// 'root' is just a slash, or nothing.\nvar splitPathRe =\n /^(\\/?|)([\\s\\S]*?)((?:\\.{1,2}|[^\\/]+?|)(\\.[^.\\/]*|))(?:[\\/]*)$/;\nvar splitPath = function(filename) {\n return splitPathRe.exec(filename).slice(1);\n};\n\n// path.resolve([from ...], to)\n// posix version\nexports.resolve = function() {\n var resolvedPath = '',\n resolvedAbsolute = false;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path = (i >= 0) ? arguments[i] : process.cwd();\n\n // Skip empty and invalid entries\n if (typeof path !== 'string') {\n throw new TypeError('Arguments to path.resolve must be strings');\n } else if (!path) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charAt(0) === '/';\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {\n return !!p;\n }), !resolvedAbsolute).join('/');\n\n return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';\n};\n\n// path.normalize(path)\n// posix version\nexports.normalize = function(path) {\n var isAbsolute = exports.isAbsolute(path),\n trailingSlash = substr(path, -1) === '/';\n\n // Normalize the path\n path = normalizeArray(filter(path.split('/'), function(p) {\n return !!p;\n }), !isAbsolute).join('/');\n\n if (!path && !isAbsolute) {\n path = '.';\n }\n if (path && trailingSlash) {\n path += '/';\n }\n\n return (isAbsolute ? '/' : '') + path;\n};\n\n// posix version\nexports.isAbsolute = function(path) {\n return path.charAt(0) === '/';\n};\n\n// posix version\nexports.join = function() {\n var paths = Array.prototype.slice.call(arguments, 0);\n return exports.normalize(filter(paths, function(p, index) {\n if (typeof p !== 'string') {\n throw new TypeError('Arguments to path.join must be strings');\n }\n return p;\n }).join('/'));\n};\n\n\n// path.relative(from, to)\n// posix version\nexports.relative = function(from, to) {\n from = exports.resolve(from).substr(1);\n to = exports.resolve(to).substr(1);\n\n function trim(arr) {\n var start = 0;\n for (; start < arr.length; start++) {\n if (arr[start] !== '') break;\n }\n\n var end = arr.length - 1;\n for (; end >= 0; end--) {\n if (arr[end] !== '') break;\n }\n\n if (start > end) return [];\n return arr.slice(start, end - start + 1);\n }\n\n var fromParts = trim(from.split('/'));\n var toParts = trim(to.split('/'));\n\n var length = Math.min(fromParts.length, toParts.length);\n var samePartsLength = length;\n for (var i = 0; i < length; i++) {\n if (fromParts[i] !== toParts[i]) {\n samePartsLength = i;\n break;\n }\n }\n\n var outputParts = [];\n for (var i = samePartsLength; i < fromParts.length; i++) {\n outputParts.push('..');\n }\n\n outputParts = outputParts.concat(toParts.slice(samePartsLength));\n\n return outputParts.join('/');\n};\n\nexports.sep = '/';\nexports.delimiter = ':';\n\nexports.dirname = function(path) {\n var result = splitPath(path),\n root = result[0],\n dir = result[1];\n\n if (!root && !dir) {\n // No dirname whatsoever\n return '.';\n }\n\n if (dir) {\n // It has a dirname, strip trailing slash\n dir = dir.substr(0, dir.length - 1);\n }\n\n return root + dir;\n};\n\n\nexports.basename = function(path, ext) {\n var f = splitPath(path)[2];\n // TODO: make this comparison case-insensitive on windows?\n if (ext && f.substr(-1 * ext.length) === ext) {\n f = f.substr(0, f.length - ext.length);\n }\n return f;\n};\n\n\nexports.extname = function(path) {\n return splitPath(path)[3];\n};\n\nfunction filter (xs, f) {\n if (xs.filter) return xs.filter(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n if (f(xs[i], i, xs)) res.push(xs[i]);\n }\n return res;\n}\n\n// String.prototype.substr - negative index don't work in IE8\nvar substr = 'ab'.substr(-1) === 'b'\n ? function (str, start, len) { return str.substr(start, len) }\n : function (str, start, len) {\n if (start < 0) start = str.length + start;\n return str.substr(start, len);\n }\n;\n","import mozilla from 'source-map';\nimport path from 'path';\nimport fs from 'fs';\n\nfunction fromBase64(str) {\n if ( Buffer ) {\n if ( Buffer.from && Buffer.from !== Uint8Array.from ) {\n return Buffer.from(str, 'base64').toString();\n } else {\n return new Buffer(str, 'base64').toString();\n }\n } else {\n return window.atob(str);\n }\n}\n\n/**\n * Source map information from input CSS.\n * For example, source map after Sass compiler.\n *\n * This class will automatically find source map in input CSS or in file system\n * near input file (according `from` option).\n *\n * @example\n * const root = postcss.parse(css, { from: 'a.sass.css' });\n * root.input.map //=> PreviousMap\n */\nclass PreviousMap {\n\n /**\n * @param {string} css - input CSS source\n * @param {processOptions} [opts] - {@link Processor#process} options\n */\n constructor(css, opts) {\n this.loadAnnotation(css);\n /**\n * @member {boolean} - Was source map inlined by data-uri to input CSS.\n */\n this.inline = this.startWith(this.annotation, 'data:');\n\n let prev = opts.map ? opts.map.prev : undefined;\n let text = this.loadMap(opts.from, prev);\n if ( text ) this.text = text;\n }\n\n /**\n * Create a instance of `SourceMapGenerator` class\n * from the `source-map` library to work with source map information.\n *\n * It is lazy method, so it will create object only on first call\n * and then it will use cache.\n *\n * @return {SourceMapGenerator} object with source map information\n */\n consumer() {\n if ( !this.consumerCache ) {\n this.consumerCache = new mozilla.SourceMapConsumer(this.text);\n }\n return this.consumerCache;\n }\n\n /**\n * Does source map contains `sourcesContent` with input source text.\n *\n * @return {boolean} Is `sourcesContent` present\n */\n withContent() {\n return !!(this.consumer().sourcesContent &&\n this.consumer().sourcesContent.length > 0);\n }\n\n startWith(string, start) {\n if ( !string ) return false;\n return string.substr(0, start.length) === start;\n }\n\n loadAnnotation(css) {\n let match = css.match(/\\/\\*\\s*# sourceMappingURL=(.*)\\s*\\*\\//);\n if ( match ) this.annotation = match[1].trim();\n }\n\n decodeInline(text) {\n // data:application/json;charset=utf-8;base64,\n // data:application/json;charset=utf8;base64,\n // data:application/json;base64,\n let baseUri = /^data:application\\/json;(?:charset=utf-?8;)?base64,/;\n let uri = 'data:application/json,';\n\n if ( this.startWith(text, uri) ) {\n return decodeURIComponent( text.substr(uri.length) );\n\n } else if ( baseUri.test(text) ) {\n return fromBase64(text.substr(RegExp.lastMatch.length));\n\n } else {\n let encoding = text.match(/data:application\\/json;([^,]+),/)[1];\n throw new Error('Unsupported source map encoding ' + encoding);\n }\n }\n\n loadMap(file, prev) {\n if ( prev === false ) return false;\n\n if ( prev ) {\n if ( typeof prev === 'string' ) {\n return prev;\n } else if ( typeof prev === 'function' ) {\n let prevPath = prev(file);\n if ( prevPath && fs.existsSync && fs.existsSync(prevPath) ) {\n return fs.readFileSync(prevPath, 'utf-8').toString().trim();\n } else {\n throw new Error('Unable to load previous source map: ' +\n prevPath.toString());\n }\n } else if ( prev instanceof mozilla.SourceMapConsumer ) {\n return mozilla.SourceMapGenerator\n .fromSourceMap(prev).toString();\n } else if ( prev instanceof mozilla.SourceMapGenerator ) {\n return prev.toString();\n } else if ( this.isMap(prev) ) {\n return JSON.stringify(prev);\n } else {\n throw new Error('Unsupported previous source map format: ' +\n prev.toString());\n }\n\n } else if ( this.inline ) {\n return this.decodeInline(this.annotation);\n\n } else if ( this.annotation ) {\n let map = this.annotation;\n if ( file ) map = path.join(path.dirname(file), map);\n\n this.root = path.dirname(map);\n if ( fs.existsSync && fs.existsSync(map) ) {\n return fs.readFileSync(map, 'utf-8').toString().trim();\n } else {\n return false;\n }\n }\n }\n\n isMap(map) {\n if ( typeof map !== 'object' ) return false;\n return typeof map.mappings === 'string' ||\n typeof map._mappings === 'string';\n }\n}\n\nexport default PreviousMap;\n","import CssSyntaxError from './css-syntax-error';\nimport PreviousMap from './previous-map';\n\nimport path from 'path';\n\nlet sequence = 0;\n\n/**\n * Represents the source CSS.\n *\n * @example\n * const root = postcss.parse(css, { from: file });\n * const input = root.source.input;\n */\nclass Input {\n\n /**\n * @param {string} css - input CSS source\n * @param {object} [opts] - {@link Processor#process} options\n */\n constructor(css, opts = { }) {\n if ( css === null || typeof css === 'object' && !css.toString ) {\n throw new Error(`PostCSS received ${ css } instead of CSS string`);\n }\n\n /**\n * @member {string} - input CSS source\n *\n * @example\n * const input = postcss.parse('a{}', { from: file }).input;\n * input.css //=> \"a{}\";\n */\n this.css = css.toString();\n\n if ( this.css[0] === '\\uFEFF' || this.css[0] === '\\uFFFE' ) {\n this.css = this.css.slice(1);\n }\n\n if ( opts.from ) {\n if ( /^\\w+:\\/\\//.test(opts.from) ) {\n /**\n * @member {string} - The absolute path to the CSS source file\n * defined with the `from` option.\n *\n * @example\n * const root = postcss.parse(css, { from: 'a.css' });\n * root.source.input.file //=> '/home/ai/a.css'\n */\n this.file = opts.from;\n } else {\n this.file = path.resolve(opts.from);\n }\n }\n\n let map = new PreviousMap(this.css, opts);\n if ( map.text ) {\n /**\n * @member {PreviousMap} - The input source map passed from\n * a compilation step before PostCSS\n * (for example, from Sass compiler).\n *\n * @example\n * root.source.input.map.consumer().sources //=> ['a.sass']\n */\n this.map = map;\n let file = map.consumer().file;\n if ( !this.file && file ) this.file = this.mapResolve(file);\n }\n\n if ( !this.file ) {\n sequence += 1;\n /**\n * @member {string} - The unique ID of the CSS source. It will be\n * created if `from` option is not provided\n * (because PostCSS does not know the file path).\n *\n * @example\n * const root = postcss.parse(css);\n * root.source.input.file //=> undefined\n * root.source.input.id //=> \"<input css 1>\"\n */\n this.id = '<input css ' + sequence + '>';\n }\n if ( this.map ) this.map.file = this.from;\n }\n\n error(message, line, column, opts = { }) {\n let result;\n let origin = this.origin(line, column);\n if ( origin ) {\n result = new CssSyntaxError(message, origin.line, origin.column,\n origin.source, origin.file, opts.plugin);\n } else {\n result = new CssSyntaxError(message, line, column,\n this.css, this.file, opts.plugin);\n }\n\n result.input = { line, column, source: this.css };\n if ( this.file ) result.input.file = this.file;\n\n return result;\n }\n\n /**\n * Reads the input source map and returns a symbol position\n * in the input source (e.g., in a Sass file that was compiled\n * to CSS before being passed to PostCSS).\n *\n * @param {number} line - line in input CSS\n * @param {number} column - column in input CSS\n *\n * @return {filePosition} position in input source\n *\n * @example\n * root.source.input.origin(1, 1) //=> { file: 'a.css', line: 3, column: 1 }\n */\n origin(line, column) {\n if ( !this.map ) return false;\n let consumer = this.map.consumer();\n\n let from = consumer.originalPositionFor({ line, column });\n if ( !from.source ) return false;\n\n let result = {\n file: this.mapResolve(from.source),\n line: from.line,\n column: from.column\n };\n\n let source = consumer.sourceContentFor(from.source);\n if ( source ) result.source = source;\n\n return result;\n }\n\n mapResolve(file) {\n if ( /^\\w+:\\/\\//.test(file) ) {\n return file;\n } else {\n return path.resolve(this.map.consumer().sourceRoot || '.', file);\n }\n }\n\n /**\n * The CSS source identifier. Contains {@link Input#file} if the user\n * set the `from` option, or {@link Input#id} if they did not.\n * @type {string}\n *\n * @example\n * const root = postcss.parse(css, { from: 'a.css' });\n * root.source.input.from //=> \"/home/ai/a.css\"\n *\n * const root = postcss.parse(css);\n * root.source.input.from //=> \"<input css 1>\"\n */\n get from() {\n return this.file || this.id;\n }\n\n}\n\nexport default Input;\n\n/**\n * @typedef {object} filePosition\n * @property {string} file - path to file\n * @property {number} line - source line in file\n * @property {number} column - source column in file\n */\n","import chalk from 'chalk';\n\nimport tokenizer from './tokenize';\nimport Input from './input';\n\nconst HIGHLIGHT_THEME = {\n 'brackets': chalk.cyan,\n 'at-word': chalk.cyan,\n 'call': chalk.cyan,\n 'comment': chalk.gray,\n 'string': chalk.green,\n 'class': chalk.yellow,\n 'hash': chalk.magenta,\n '(': chalk.cyan,\n ')': chalk.cyan,\n '{': chalk.yellow,\n '}': chalk.yellow,\n '[': chalk.yellow,\n ']': chalk.yellow,\n ':': chalk.yellow,\n ';': chalk.yellow\n};\n\nfunction getTokenType([type, value], processor) {\n if ( type === 'word' ) {\n if ( value[0] === '.' ) {\n return 'class';\n }\n if ( value[0] === '#' ) {\n return 'hash';\n }\n }\n\n if ( !processor.endOfFile() ) {\n let next = processor.nextToken();\n processor.back(next);\n if ( next[0] === 'brackets' || next[0] === '(' ) return 'call';\n }\n\n return type;\n}\n\nfunction terminalHighlight(css) {\n let processor = tokenizer(new Input(css), { ignoreErrors: true });\n let result = '';\n while ( !processor.endOfFile() ) {\n let token = processor.nextToken();\n let color = HIGHLIGHT_THEME[getTokenType(token, processor)];\n if ( color ) {\n result += token[1].split(/\\r?\\n/)\n .map( i => color(i) )\n .join('\\n');\n } else {\n result += token[1];\n }\n }\n return result;\n}\n\nexport default terminalHighlight;\n","import supportsColor from 'supports-color';\nimport chalk from 'chalk';\n\nimport terminalHighlight from './terminal-highlight';\n\n/**\n * The CSS parser throws this error for broken CSS.\n *\n * Custom parsers can throw this error for broken custom syntax using\n * the {@link Node#error} method.\n *\n * PostCSS will use the input source map to detect the original error location.\n * If you wrote a Sass file, compiled it to CSS and then parsed it with PostCSS,\n * PostCSS will show the original position in the Sass file.\n *\n * If you need the position in the PostCSS input\n * (e.g., to debug the previous compiler), use `error.input.file`.\n *\n * @example\n * // Catching and checking syntax error\n * try {\n * postcss.parse('a{')\n * } catch (error) {\n * if ( error.name === 'CssSyntaxError' ) {\n * error //=> CssSyntaxError\n * }\n * }\n *\n * @example\n * // Raising error from plugin\n * throw node.error('Unknown variable', { plugin: 'postcss-vars' });\n */\nclass CssSyntaxError {\n\n /**\n * @param {string} message - error message\n * @param {number} [line] - source line of the error\n * @param {number} [column] - source column of the error\n * @param {string} [source] - source code of the broken file\n * @param {string} [file] - absolute path to the broken file\n * @param {string} [plugin] - PostCSS plugin name, if error came from plugin\n */\n constructor(message, line, column, source, file, plugin) {\n /**\n * @member {string} - Always equal to `'CssSyntaxError'`. You should\n * always check error type\n * by `error.name === 'CssSyntaxError'` instead of\n * `error instanceof CssSyntaxError`, because\n * npm could have several PostCSS versions.\n *\n * @example\n * if ( error.name === 'CssSyntaxError' ) {\n * error //=> CssSyntaxError\n * }\n */\n this.name = 'CssSyntaxError';\n /**\n * @member {string} - Error message.\n *\n * @example\n * error.message //=> 'Unclosed block'\n */\n this.reason = message;\n\n if ( file ) {\n /**\n * @member {string} - Absolute path to the broken file.\n *\n * @example\n * error.file //=> 'a.sass'\n * error.input.file //=> 'a.css'\n */\n this.file = file;\n }\n if ( source ) {\n /**\n * @member {string} - Source code of the broken file.\n *\n * @example\n * error.source //=> 'a { b {} }'\n * error.input.column //=> 'a b { }'\n */\n this.source = source;\n }\n if ( plugin ) {\n /**\n * @member {string} - Plugin name, if error came from plugin.\n *\n * @example\n * error.plugin //=> 'postcss-vars'\n */\n this.plugin = plugin;\n }\n if ( typeof line !== 'undefined' && typeof column !== 'undefined' ) {\n /**\n * @member {number} - Source line of the error.\n *\n * @example\n * error.line //=> 2\n * error.input.line //=> 4\n */\n this.line = line;\n /**\n * @member {number} - Source column of the error.\n *\n * @example\n * error.column //=> 1\n * error.input.column //=> 4\n */\n this.column = column;\n }\n\n this.setMessage();\n\n if ( Error.captureStackTrace ) {\n Error.captureStackTrace(this, CssSyntaxError);\n }\n }\n\n setMessage() {\n /**\n * @member {string} - Full error text in the GNU error format\n * with plugin, file, line and column.\n *\n * @example\n * error.message //=> 'a.css:1:1: Unclosed block'\n */\n this.message = this.plugin ? this.plugin + ': ' : '';\n this.message += this.file ? this.file : '<css input>';\n if ( typeof this.line !== 'undefined' ) {\n this.message += ':' + this.line + ':' + this.column;\n }\n this.message += ': ' + this.reason;\n }\n\n /**\n * Returns a few lines of CSS source that caused the error.\n *\n * If the CSS has an input source map without `sourceContent`,\n * this method will return an empty string.\n *\n * @param {boolean} [color] whether arrow will be colored red by terminal\n * color codes. By default, PostCSS will detect\n * color support by `process.stdout.isTTY`\n * and `process.env.NODE_DISABLE_COLORS`.\n *\n * @example\n * error.showSourceCode() //=> \" 4 | }\n * // 5 | a {\n * // > 6 | bad\n * // | ^\n * // 7 | }\n * // 8 | b {\"\n *\n * @return {string} few lines of CSS source that caused the error\n */\n showSourceCode(color) {\n if ( !this.source ) return '';\n\n let css = this.source;\n if ( typeof color === 'undefined' ) color = supportsColor.stdout;\n if ( color ) css = terminalHighlight(css);\n\n let lines = css.split(/\\r?\\n/);\n let start = Math.max(this.line - 3, 0);\n let end = Math.min(this.line + 2, lines.length);\n\n let maxWidth = String(end).length;\n\n function mark(text) {\n if ( color && chalk.red ) {\n return chalk.red.bold(text);\n } else {\n return text;\n }\n }\n function aside(text) {\n if ( color && chalk.gray ) {\n return chalk.gray(text);\n } else {\n return text;\n }\n }\n\n return lines.slice(start, end).map( (line, index) => {\n let number = start + 1 + index;\n let gutter = ' ' + (' ' + number).slice(-maxWidth) + ' | ';\n if ( number === this.line ) {\n let spacing =\n aside(gutter.replace(/\\d/g, ' ')) +\n line.slice(0, this.column - 1).replace(/[^\\t]/g, ' ');\n return mark('>') + aside(gutter) + line + '\\n ' +\n spacing + mark('^');\n } else {\n return ' ' + aside(gutter) + line;\n }\n }).join('\\n');\n }\n\n /**\n * Returns error position, message and source code of the broken part.\n *\n * @example\n * error.toString() //=> \"CssSyntaxError: app.css:1:1: Unclosed block\n * // > 1 | a {\n * // | ^\"\n *\n * @return {string} error position, message and source code\n */\n toString() {\n let code = this.showSourceCode();\n if ( code ) {\n code = '\\n\\n' + code + '\\n';\n }\n return this.name + ': ' + this.message + code;\n }\n\n /**\n * @memberof CssSyntaxError#\n * @member {Input} input - Input object with PostCSS internal information\n * about input file. If input has source map\n * from previous tool, PostCSS will use origin\n * (for example, Sass) source. You can use this\n * object to get PostCSS input source.\n *\n * @example\n * error.input.file //=> 'a.css'\n * error.file //=> 'a.sass'\n */\n\n}\n\nexport default CssSyntaxError;\n","const defaultRaw = {\n colon: ': ',\n indent: ' ',\n beforeDecl: '\\n',\n beforeRule: '\\n',\n beforeOpen: ' ',\n beforeClose: '\\n',\n beforeComment: '\\n',\n after: '\\n',\n emptyBody: '',\n commentLeft: ' ',\n commentRight: ' '\n};\n\nfunction capitalize(str) {\n return str[0].toUpperCase() + str.slice(1);\n}\n\nclass Stringifier {\n\n constructor(builder) {\n this.builder = builder;\n }\n\n stringify(node, semicolon) {\n this[node.type](node, semicolon);\n }\n\n root(node) {\n this.body(node);\n if ( node.raws.after ) this.builder(node.raws.after);\n }\n\n comment(node) {\n let left = this.raw(node, 'left', 'commentLeft');\n let right = this.raw(node, 'right', 'commentRight');\n this.builder('/*' + left + node.text + right + '*/', node);\n }\n\n decl(node, semicolon) {\n let between = this.raw(node, 'between', 'colon');\n let string = node.prop + between + this.rawValue(node, 'value');\n\n if ( node.important ) {\n string += node.raws.important || ' !important';\n }\n\n if ( semicolon ) string += ';';\n this.builder(string, node);\n }\n\n rule(node) {\n this.block(node, this.rawValue(node, 'selector'));\n if ( node.raws.ownSemicolon ) {\n this.builder(node.raws.ownSemicolon, node, 'end');\n }\n }\n\n atrule(node, semicolon) {\n let name = '@' + node.name;\n let params = node.params ? this.rawValue(node, 'params') : '';\n\n if ( typeof node.raws.afterName !== 'undefined' ) {\n name += node.raws.afterName;\n } else if ( params ) {\n name += ' ';\n }\n\n if ( node.nodes ) {\n this.block(node, name + params);\n } else {\n let end = (node.raws.between || '') + (semicolon ? ';' : '');\n this.builder(name + params + end, node);\n }\n }\n\n body(node) {\n let last = node.nodes.length - 1;\n while ( last > 0 ) {\n if ( node.nodes[last].type !== 'comment' ) break;\n last -= 1;\n }\n\n let semicolon = this.raw(node, 'semicolon');\n for ( let i = 0; i < node.nodes.length; i++ ) {\n let child = node.nodes[i];\n let before = this.raw(child, 'before');\n if ( before ) this.builder(before);\n this.stringify(child, last !== i || semicolon);\n }\n }\n\n block(node, start) {\n let between = this.raw(node, 'between', 'beforeOpen');\n this.builder(start + between + '{', node, 'start');\n\n let after;\n if ( node.nodes && node.nodes.length ) {\n this.body(node);\n after = this.raw(node, 'after');\n } else {\n after = this.raw(node, 'after', 'emptyBody');\n }\n\n if ( after ) this.builder(after);\n this.builder('}', node, 'end');\n }\n\n raw(node, own, detect) {\n let value;\n if ( !detect ) detect = own;\n\n // Already had\n if ( own ) {\n value = node.raws[own];\n if ( typeof value !== 'undefined' ) return value;\n }\n\n let parent = node.parent;\n\n // Hack for first rule in CSS\n if ( detect === 'before' ) {\n if ( !parent || parent.type === 'root' && parent.first === node ) {\n return '';\n }\n }\n\n // Floating child without parent\n if ( !parent ) return defaultRaw[detect];\n\n // Detect style by other nodes\n let root = node.root();\n if ( !root.rawCache ) root.rawCache = { };\n if ( typeof root.rawCache[detect] !== 'undefined' ) {\n return root.rawCache[detect];\n }\n\n if ( detect === 'before' || detect === 'after' ) {\n return this.beforeAfter(node, detect);\n } else {\n let method = 'raw' + capitalize(detect);\n if ( this[method] ) {\n value = this[method](root, node);\n } else {\n root.walk( i => {\n value = i.raws[own];\n if ( typeof value !== 'undefined' ) return false;\n });\n }\n }\n\n if ( typeof value === 'undefined' ) value = defaultRaw[detect];\n\n root.rawCache[detect] = value;\n return value;\n }\n\n rawSemicolon(root) {\n let value;\n root.walk( i => {\n if ( i.nodes && i.nodes.length && i.last.type === 'decl' ) {\n value = i.raws.semicolon;\n if ( typeof value !== 'undefined' ) return false;\n }\n });\n return value;\n }\n\n rawEmptyBody(root) {\n let value;\n root.walk( i => {\n if ( i.nodes && i.nodes.length === 0 ) {\n value = i.raws.after;\n if ( typeof value !== 'undefined' ) return false;\n }\n });\n return value;\n }\n\n rawIndent(root) {\n if ( root.raws.indent ) return root.raws.indent;\n let value;\n root.walk( i => {\n let p = i.parent;\n if ( p && p !== root && p.parent && p.parent === root ) {\n if ( typeof i.raws.before !== 'undefined' ) {\n let parts = i.raws.before.split('\\n');\n value = parts[parts.length - 1];\n value = value.replace(/[^\\s]/g, '');\n return false;\n }\n }\n });\n return value;\n }\n\n rawBeforeComment(root, node) {\n let value;\n root.walkComments( i => {\n if ( typeof i.raws.before !== 'undefined' ) {\n value = i.raws.before;\n if ( value.indexOf('\\n') !== -1 ) {\n value = value.replace(/[^\\n]+$/, '');\n }\n return false;\n }\n });\n if ( typeof value === 'undefined' ) {\n value = this.raw(node, null, 'beforeDecl');\n } else if ( value ) {\n value = value.replace(/[^\\s]/g, '');\n }\n return value;\n }\n\n rawBeforeDecl(root, node) {\n let value;\n root.walkDecls( i => {\n if ( typeof i.raws.before !== 'undefined' ) {\n value = i.raws.before;\n if ( value.indexOf('\\n') !== -1 ) {\n value = value.replace(/[^\\n]+$/, '');\n }\n return false;\n }\n });\n if ( typeof value === 'undefined' ) {\n value = this.raw(node, null, 'beforeRule');\n } else if ( value ) {\n value = value.replace(/[^\\s]/g, '');\n }\n return value;\n }\n\n rawBeforeRule(root) {\n let value;\n root.walk( i => {\n if ( i.nodes && (i.parent !== root || root.first !== i) ) {\n if ( typeof i.raws.before !== 'undefined' ) {\n value = i.raws.before;\n if ( value.indexOf('\\n') !== -1 ) {\n value = value.replace(/[^\\n]+$/, '');\n }\n return false;\n }\n }\n });\n if ( value ) value = value.replace(/[^\\s]/g, '');\n return value;\n }\n\n rawBeforeClose(root) {\n let value;\n root.walk( i => {\n if ( i.nodes && i.nodes.length > 0 ) {\n if ( typeof i.raws.after !== 'undefined' ) {\n value = i.raws.after;\n if ( value.indexOf('\\n') !== -1 ) {\n value = value.replace(/[^\\n]+$/, '');\n }\n return false;\n }\n }\n });\n if ( value ) value = value.replace(/[^\\s]/g, '');\n return value;\n }\n\n rawBeforeOpen(root) {\n let value;\n root.walk( i => {\n if ( i.type !== 'decl' ) {\n value = i.raws.between;\n if ( typeof value !== 'undefined' ) return false;\n }\n });\n return value;\n }\n\n rawColon(root) {\n let value;\n root.walkDecls( i => {\n if ( typeof i.raws.between !== 'undefined' ) {\n value = i.raws.between.replace(/[^\\s:]/g, '');\n return false;\n }\n });\n return value;\n }\n\n beforeAfter(node, detect) {\n let value;\n if ( node.type === 'decl' ) {\n value = this.raw(node, null, 'beforeDecl');\n } else if ( node.type === 'comment' ) {\n value = this.raw(node, null, 'beforeComment');\n } else if ( detect === 'before' ) {\n value = this.raw(node, null, 'beforeRule');\n } else {\n value = this.raw(node, null, 'beforeClose');\n }\n\n let buf = node.parent;\n let depth = 0;\n while ( buf && buf.type !== 'root' ) {\n depth += 1;\n buf = buf.parent;\n }\n\n if ( value.indexOf('\\n') !== -1 ) {\n let indent = this.raw(node, null, 'indent');\n if ( indent.length ) {\n for ( let step = 0; step < depth; step++ ) value += indent;\n }\n }\n\n return value;\n }\n\n rawValue(node, prop) {\n let value = node[prop];\n let raw = node.raws[prop];\n if ( raw && raw.value === value ) {\n return raw.raw;\n } else {\n return value;\n }\n }\n\n}\n\nexport default Stringifier;\n","import Stringifier from './stringifier';\n\nexport default function stringify(node, builder) {\n let str = new Stringifier(builder);\n str.stringify(node);\n}\n","let printed = { };\n\nexport default function warnOnce(message) {\n if ( printed[message] ) return;\n printed[message] = true;\n\n if ( typeof console !== 'undefined' && console.warn ) console.warn(message);\n}\n","import CssSyntaxError from './css-syntax-error';\nimport Stringifier from './stringifier';\nimport stringify from './stringify';\nimport warnOnce from './warn-once';\n\nlet cloneNode = function (obj, parent) {\n let cloned = new obj.constructor();\n\n for ( let i in obj ) {\n if ( !obj.hasOwnProperty(i) ) continue;\n let value = obj[i];\n let type = typeof value;\n\n if ( i === 'parent' && type === 'object' ) {\n if (parent) cloned[i] = parent;\n } else if ( i === 'source' ) {\n cloned[i] = value;\n } else if ( value instanceof Array ) {\n cloned[i] = value.map( j => cloneNode(j, cloned) );\n } else {\n if ( type === 'object' && value !== null ) value = cloneNode(value);\n cloned[i] = value;\n }\n }\n\n return cloned;\n};\n\n/**\n * All node classes inherit the following common methods.\n *\n * @abstract\n */\nclass Node {\n\n /**\n * @param {object} [defaults] - value for node properties\n */\n constructor(defaults = { }) {\n this.raws = { };\n if ( typeof defaults !== 'object' && typeof defaults !== 'undefined' ) {\n throw new Error(\n 'PostCSS nodes constructor accepts object, not ' +\n JSON.stringify(defaults));\n }\n for ( let name in defaults ) {\n this[name] = defaults[name];\n }\n }\n\n /**\n * Returns a CssSyntaxError instance containing the original position\n * of the node in the source, showing line and column numbers and also\n * a small excerpt to facilitate debugging.\n *\n * If present, an input source map will be used to get the original position\n * of the source, even from a previous compilation step\n * (e.g., from Sass compilation).\n *\n * This method produces very useful error messages.\n *\n * @param {string} message - error description\n * @param {object} [opts] - options\n * @param {string} opts.plugin - plugin name that created this error.\n * PostCSS will set it automatically.\n * @param {string} opts.word - a word inside a node’s string that should\n * be highlighted as the source of the error\n * @param {number} opts.index - an index inside a node’s string that should\n * be highlighted as the source of the error\n *\n * @return {CssSyntaxError} error object to throw it\n *\n * @example\n * if ( !variables[name] ) {\n * throw decl.error('Unknown variable ' + name, { word: name });\n * // CssSyntaxError: postcss-vars:a.sass:4:3: Unknown variable $black\n * // color: $black\n * // a\n * // ^\n * // background: white\n * }\n */\n error(message, opts = { }) {\n if ( this.source ) {\n let pos = this.positionBy(opts);\n return this.source.input.error(message, pos.line, pos.column, opts);\n } else {\n return new CssSyntaxError(message);\n }\n }\n\n /**\n * This method is provided as a convenience wrapper for {@link Result#warn}.\n *\n * @param {Result} result - the {@link Result} instance\n * that will receive the warning\n * @param {string} text - warning message\n * @param {object} [opts] - options\n * @param {string} opts.plugin - plugin name that created this warning.\n * PostCSS will set it automatically.\n * @param {string} opts.word - a word inside a node’s string that should\n * be highlighted as the source of the warning\n * @param {number} opts.index - an index inside a node’s string that should\n * be highlighted as the source of the warning\n *\n * @return {Warning} created warning object\n *\n * @example\n * const plugin = postcss.plugin('postcss-deprecated', () => {\n * return (root, result) => {\n * root.walkDecls('bad', decl => {\n * decl.warn(result, 'Deprecated property bad');\n * });\n * };\n * });\n */\n warn(result, text, opts) {\n let data = { node: this };\n for ( let i in opts ) data[i] = opts[i];\n return result.warn(text, data);\n }\n\n /**\n * Removes the node from its parent and cleans the parent properties\n * from the node and its children.\n *\n * @example\n * if ( decl.prop.match(/^-webkit-/) ) {\n * decl.remove();\n * }\n *\n * @return {Node} node to make calls chain\n */\n remove() {\n if ( this.parent ) {\n this.parent.removeChild(this);\n }\n this.parent = undefined;\n return this;\n }\n\n /**\n * Returns a CSS string representing the node.\n *\n * @param {stringifier|syntax} [stringifier] - a syntax to use\n * in string generation\n *\n * @return {string} CSS string of this node\n *\n * @example\n * postcss.rule({ selector: 'a' }).toString() //=> \"a {}\"\n */\n toString(stringifier = stringify) {\n if ( stringifier.stringify ) stringifier = stringifier.stringify;\n let result = '';\n stringifier(this, i => {\n result += i;\n });\n return result;\n }\n\n /**\n * Returns a clone of the node.\n *\n * The resulting cloned node and its (cloned) children will have\n * a clean parent and code style properties.\n *\n * @param {object} [overrides] - new properties to override in the clone.\n *\n * @example\n * const cloned = decl.clone({ prop: '-moz-' + decl.prop });\n * cloned.raws.before //=> undefined\n * cloned.parent //=> undefined\n * cloned.toString() //=> -moz-transform: scale(0)\n *\n * @return {Node} clone of the node\n */\n clone(overrides = { }) {\n let cloned = cloneNode(this);\n for ( let name in overrides ) {\n cloned[name] = overrides[name];\n }\n return cloned;\n }\n\n /**\n * Shortcut to clone the node and insert the resulting cloned node\n * before the current node.\n *\n * @param {object} [overrides] - new properties to override in the clone.\n *\n * @example\n * decl.cloneBefore({ prop: '-moz-' + decl.prop });\n *\n * @return {Node} - new node\n */\n cloneBefore(overrides = { }) {\n let cloned = this.clone(overrides);\n this.parent.insertBefore(this, cloned);\n return cloned;\n }\n\n /**\n * Shortcut to clone the node and insert the resulting cloned node\n * after the current node.\n *\n * @param {object} [overrides] - new properties to override in the clone.\n *\n * @return {Node} - new node\n */\n cloneAfter(overrides = { }) {\n let cloned = this.clone(overrides);\n this.parent.insertAfter(this, cloned);\n return cloned;\n }\n\n /**\n * Inserts node(s) before the current node and removes the current node.\n *\n * @param {...Node} nodes - node(s) to replace current one\n *\n * @example\n * if ( atrule.name == 'mixin' ) {\n * atrule.replaceWith(mixinRules[atrule.params]);\n * }\n *\n * @return {Node} current node to methods chain\n */\n replaceWith(...nodes) {\n if (this.parent) {\n for (let node of nodes) {\n this.parent.insertBefore(this, node);\n }\n\n this.remove();\n }\n\n return this;\n }\n\n moveTo(newParent) {\n warnOnce('Node#moveTo was deprecated. Use Container#append.');\n this.cleanRaws(this.root() === newParent.root());\n this.remove();\n newParent.append(this);\n return this;\n }\n\n moveBefore(otherNode) {\n warnOnce('Node#moveBefore was deprecated. Use Node#before.');\n this.cleanRaws(this.root() === otherNode.root());\n this.remove();\n otherNode.parent.insertBefore(otherNode, this);\n return this;\n }\n\n moveAfter(otherNode) {\n warnOnce('Node#moveAfter was deprecated. Use Node#after.');\n this.cleanRaws(this.root() === otherNode.root());\n this.remove();\n otherNode.parent.insertAfter(otherNode, this);\n return this;\n }\n\n /**\n * Returns the next child of the node’s parent.\n * Returns `undefined` if the current node is the last child.\n *\n * @return {Node|undefined} next node\n *\n * @example\n * if ( comment.text === 'delete next' ) {\n * const next = comment.next();\n * if ( next ) {\n * next.remove();\n * }\n * }\n */\n next() {\n if ( !this.parent ) return undefined;\n let index = this.parent.index(this);\n return this.parent.nodes[index + 1];\n }\n\n /**\n * Returns the previous child of the node’s parent.\n * Returns `undefined` if the current node is the first child.\n *\n * @return {Node|undefined} previous node\n *\n * @example\n * const annotation = decl.prev();\n * if ( annotation.type == 'comment' ) {\n * readAnnotation(annotation.text);\n * }\n */\n prev() {\n if ( !this.parent ) return undefined;\n let index = this.parent.index(this);\n return this.parent.nodes[index - 1];\n }\n\n /**\n * Insert new node before current node to current node’s parent.\n *\n * Just alias for `node.parent.insertBefore(node, add)`.\n *\n * @param {Node|object|string|Node[]} add - new node\n *\n * @return {Node} this node for methods chain.\n *\n * @example\n * decl.before('content: \"\"');\n */\n before(add) {\n this.parent.insertBefore(this, add);\n return this;\n }\n\n /**\n * Insert new node after current node to current node’s parent.\n *\n * Just alias for `node.parent.insertAfter(node, add)`.\n *\n * @param {Node|object|string|Node[]} add - new node\n *\n * @return {Node} this node for methods chain.\n *\n * @example\n * decl.after('color: black');\n */\n after(add) {\n this.parent.insertAfter(this, add);\n return this;\n }\n\n toJSON() {\n let fixed = { };\n\n for ( let name in this ) {\n if ( !this.hasOwnProperty(name) ) continue;\n if ( name === 'parent' ) continue;\n let value = this[name];\n\n if ( value instanceof Array ) {\n fixed[name] = value.map( i => {\n if ( typeof i === 'object' && i.toJSON ) {\n return i.toJSON();\n } else {\n return i;\n }\n });\n } else if ( typeof value === 'object' && value.toJSON ) {\n fixed[name] = value.toJSON();\n } else {\n fixed[name] = value;\n }\n }\n\n return fixed;\n }\n\n /**\n * Returns a {@link Node#raws} value. If the node is missing\n * the code style property (because the node was manually built or cloned),\n * PostCSS will try to autodetect the code style property by looking\n * at other nodes in the tree.\n *\n * @param {string} prop - name of code style property\n * @param {string} [defaultType] - name of default value, it can be missed\n * if the value is the same as prop\n *\n * @example\n * const root = postcss.parse('a { background: white }');\n * root.nodes[0].append({ prop: 'color', value: 'black' });\n * root.nodes[0].nodes[1].raws.before //=> undefined\n * root.nodes[0].nodes[1].raw('before') //=> ' '\n *\n * @return {string} code style value\n */\n raw(prop, defaultType) {\n let str = new Stringifier();\n return str.raw(this, prop, defaultType);\n }\n\n /**\n * Finds the Root instance of the node’s tree.\n *\n * @example\n * root.nodes[0].nodes[0].root() === root\n *\n * @return {Root} root parent\n */\n root() {\n let result = this;\n while ( result.parent ) result = result.parent;\n return result;\n }\n\n cleanRaws(keepBetween) {\n delete this.raws.before;\n delete this.raws.after;\n if ( !keepBetween ) delete this.raws.between;\n }\n\n positionInside(index) {\n let string = this.toString();\n let column = this.source.start.column;\n let line = this.source.start.line;\n\n for ( let i = 0; i < index; i++ ) {\n if ( string[i] === '\\n' ) {\n column = 1;\n line += 1;\n } else {\n column += 1;\n }\n }\n\n return { line, column };\n }\n\n positionBy(opts) {\n let pos = this.source.start;\n if ( opts.index ) {\n pos = this.positionInside(opts.index);\n } else if ( opts.word ) {\n let index = this.toString().indexOf(opts.word);\n if ( index !== -1 ) pos = this.positionInside(index);\n }\n return pos;\n }\n\n /**\n * @memberof Node#\n * @member {string} type - String representing the node’s type.\n * Possible values are `root`, `atrule`, `rule`,\n * `decl`, or `comment`.\n *\n * @example\n * postcss.decl({ prop: 'color', value: 'black' }).type //=> 'decl'\n */\n\n /**\n * @memberof Node#\n * @member {Container} parent - the node’s parent node.\n *\n * @example\n * root.nodes[0].parent == root;\n */\n\n /**\n * @memberof Node#\n * @member {source} source - the input source of the node\n *\n * The property is used in source map generation.\n *\n * If you create a node manually (e.g., with `postcss.decl()`),\n * that node will not have a `source` property and will be absent\n * from the source map. For this reason, the plugin developer should\n * consider cloning nodes to create new ones (in which case the new node’s\n * source will reference the original, cloned node) or setting\n * the `source` property manually.\n *\n * ```js\n * // Bad\n * const prefixed = postcss.decl({\n * prop: '-moz-' + decl.prop,\n * value: decl.value\n * });\n *\n * // Good\n * const prefixed = decl.clone({ prop: '-moz-' + decl.prop });\n * ```\n *\n * ```js\n * if ( atrule.name == 'add-link' ) {\n * const rule = postcss.rule({ selector: 'a', source: atrule.source });\n * atrule.parent.insertBefore(atrule, rule);\n * }\n * ```\n *\n * @example\n * decl.source.input.from //=> '/home/ai/a.sass'\n * decl.source.start //=> { line: 10, column: 2 }\n * decl.source.end //=> { line: 10, column: 12 }\n */\n\n /**\n * @memberof Node#\n * @member {object} raws - Information to generate byte-to-byte equal\n * node string as it was in the origin input.\n *\n * Every parser saves its own properties,\n * but the default CSS parser uses:\n *\n * * `before`: the space symbols before the node. It also stores `*`\n * and `_` symbols before the declaration (IE hack).\n * * `after`: the space symbols after the last child of the node\n * to the end of the node.\n * * `between`: the symbols between the property and value\n * for declarations, selector and `{` for rules, or last parameter\n * and `{` for at-rules.\n * * `semicolon`: contains true if the last child has\n * an (optional) semicolon.\n * * `afterName`: the space between the at-rule name and its parameters.\n * * `left`: the space symbols between `/*` and the comment’s text.\n * * `right`: the space symbols between the comment’s text\n * and <code>*&#47;</code>.\n * * `important`: the content of the important statement,\n * if it is not just `!important`.\n *\n * PostCSS cleans selectors, declaration values and at-rule parameters\n * from comments and extra spaces, but it stores origin content in raws\n * properties. As such, if you don’t change a declaration’s value,\n * PostCSS will use the raw value with comments.\n *\n * @example\n * const root = postcss.parse('a {\\n color:black\\n}')\n * root.first.first.raws //=> { before: '\\n ', between: ':' }\n */\n\n}\n\nexport default Node;\n\n/**\n * @typedef {object} position\n * @property {number} line - source line in file\n * @property {number} column - source column in file\n */\n\n/**\n * @typedef {object} source\n * @property {Input} input - {@link Input} with input file\n * @property {position} start - The starting position of the node’s source\n * @property {position} end - The ending position of the node’s source\n */\n","import Node from './node';\n\n/**\n * Represents a CSS declaration.\n *\n * @extends Node\n *\n * @example\n * const root = postcss.parse('a { color: black }');\n * const decl = root.first.first;\n * decl.type //=> 'decl'\n * decl.toString() //=> ' color: black'\n */\nclass Declaration extends Node {\n\n constructor(defaults) {\n super(defaults);\n this.type = 'decl';\n }\n\n /**\n * @memberof Declaration#\n * @member {string} prop - the declaration’s property name\n *\n * @example\n * const root = postcss.parse('a { color: black }');\n * const decl = root.first.first;\n * decl.prop //=> 'color'\n */\n\n /**\n * @memberof Declaration#\n * @member {string} value - the declaration’s value\n *\n * @example\n * const root = postcss.parse('a { color: black }');\n * const decl = root.first.first;\n * decl.value //=> 'black'\n */\n\n /**\n * @memberof Declaration#\n * @member {boolean} important - `true` if the declaration\n * has an !important annotation.\n *\n * @example\n * const root = postcss.parse('a { color: black !important; color: red }');\n * root.first.first.important //=> true\n * root.first.last.important //=> undefined\n */\n\n /**\n * @memberof Declaration#\n * @member {object} raws - Information to generate byte-to-byte equal\n * node string as it was in the origin input.\n *\n * Every parser saves its own properties,\n * but the default CSS parser uses:\n *\n * * `before`: the space symbols before the node. It also stores `*`\n * and `_` symbols before the declaration (IE hack).\n * * `between`: the symbols between the property and value\n * for declarations.\n * * `important`: the content of the important statement,\n * if it is not just `!important`.\n *\n * PostCSS cleans declaration from comments and extra spaces,\n * but it stores origin content in raws properties.\n * As such, if you don’t change a declaration’s value,\n * PostCSS will use the raw value with comments.\n *\n * @example\n * const root = postcss.parse('a {\\n color:black\\n}')\n * root.first.first.raws //=> { before: '\\n ', between: ':' }\n */\n\n}\n\nexport default Declaration;\n","import mozilla from 'source-map';\nimport path from 'path';\n\nexport default class MapGenerator {\n\n constructor(stringify, root, opts) {\n this.stringify = stringify;\n this.mapOpts = opts.map || { };\n this.root = root;\n this.opts = opts;\n }\n\n isMap() {\n if ( typeof this.opts.map !== 'undefined' ) {\n return !!this.opts.map;\n } else {\n return this.previous().length > 0;\n }\n }\n\n previous() {\n if ( !this.previousMaps ) {\n this.previousMaps = [];\n this.root.walk( node => {\n if ( node.source && node.source.input.map ) {\n let map = node.source.input.map;\n if ( this.previousMaps.indexOf(map) === -1 ) {\n this.previousMaps.push(map);\n }\n }\n });\n }\n\n return this.previousMaps;\n }\n\n isInline() {\n if ( typeof this.mapOpts.inline !== 'undefined' ) {\n return this.mapOpts.inline;\n }\n\n let annotation = this.mapOpts.annotation;\n if ( typeof annotation !== 'undefined' && annotation !== true ) {\n return false;\n }\n\n if ( this.previous().length ) {\n return this.previous().some( i => i.inline );\n } else {\n return true;\n }\n }\n\n isSourcesContent() {\n if ( typeof this.mapOpts.sourcesContent !== 'undefined' ) {\n return this.mapOpts.sourcesContent;\n }\n if ( this.previous().length ) {\n return this.previous().some( i => i.withContent() );\n } else {\n return true;\n }\n }\n\n clearAnnotation() {\n if ( this.mapOpts.annotation === false ) return;\n\n let node;\n for ( let i = this.root.nodes.length - 1; i >= 0; i-- ) {\n node = this.root.nodes[i];\n if ( node.type !== 'comment' ) continue;\n if ( node.text.indexOf('# sourceMappingURL=') === 0 ) {\n this.root.removeChild(i);\n }\n }\n }\n\n setSourcesContent() {\n let already = { };\n this.root.walk( node => {\n if ( node.source ) {\n let from = node.source.input.from;\n if ( from && !already[from] ) {\n already[from] = true;\n let relative = this.relative(from);\n this.map.setSourceContent(relative, node.source.input.css);\n }\n }\n });\n }\n\n applyPrevMaps() {\n for ( let prev of this.previous() ) {\n let from = this.relative(prev.file);\n let root = prev.root || path.dirname(prev.file);\n let map;\n\n if ( this.mapOpts.sourcesContent === false ) {\n map = new mozilla.SourceMapConsumer(prev.text);\n if ( map.sourcesContent ) {\n map.sourcesContent = map.sourcesContent.map( () => null );\n }\n } else {\n map = prev.consumer();\n }\n\n this.map.applySourceMap(map, from, this.relative(root));\n }\n }\n\n isAnnotation() {\n if ( this.isInline() ) {\n return true;\n } else if ( typeof this.mapOpts.annotation !== 'undefined' ) {\n return this.mapOpts.annotation;\n } else if ( this.previous().length ) {\n return this.previous().some( i => i.annotation );\n } else {\n return true;\n }\n }\n\n toBase64(str) {\n if ( Buffer ) {\n if ( Buffer.from && Buffer.from !== Uint8Array.from ) {\n return Buffer.from(str).toString('base64');\n } else {\n return new Buffer(str).toString('base64');\n }\n } else {\n return window.btoa(unescape(encodeURIComponent(str)));\n }\n }\n\n addAnnotation() {\n let content;\n\n if ( this.isInline() ) {\n\n content = 'data:application/json;base64,' +\n this.toBase64(this.map.toString());\n\n } else if ( typeof this.mapOpts.annotation === 'string' ) {\n content = this.mapOpts.annotation;\n\n } else {\n content = this.outputFile() + '.map';\n }\n\n let eol = '\\n';\n if ( this.css.indexOf('\\r\\n') !== -1 ) eol = '\\r\\n';\n\n this.css += eol + '/*# sourceMappingURL=' + content + ' */';\n }\n\n outputFile() {\n if ( this.opts.to ) {\n return this.relative(this.opts.to);\n } else if ( this.opts.from ) {\n return this.relative(this.opts.from);\n } else {\n return 'to.css';\n }\n }\n\n generateMap() {\n this.generateString();\n if ( this.isSourcesContent() ) this.setSourcesContent();\n if ( this.previous().length > 0 ) this.applyPrevMaps();\n if ( this.isAnnotation() ) this.addAnnotation();\n\n if ( this.isInline() ) {\n return [this.css];\n } else {\n return [this.css, this.map];\n }\n }\n\n relative(file) {\n if ( file.indexOf('<') === 0 ) return file;\n if ( /^\\w+:\\/\\//.test(file) ) return file;\n\n let from = this.opts.to ? path.dirname(this.opts.to) : '.';\n\n if ( typeof this.mapOpts.annotation === 'string' ) {\n from = path.dirname( path.resolve(from, this.mapOpts.annotation) );\n }\n\n file = path.relative(from, file);\n if ( path.sep === '\\\\' ) {\n return file.replace(/\\\\/g, '/');\n } else {\n return file;\n }\n }\n\n sourcePath(node) {\n if ( this.mapOpts.from ) {\n return this.mapOpts.from;\n } else {\n return this.relative(node.source.input.from);\n }\n }\n\n generateString() {\n this.css = '';\n this.map = new mozilla.SourceMapGenerator({ file: this.outputFile() });\n\n let line = 1;\n let column = 1;\n\n let lines, last;\n this.stringify(this.root, (str, node, type) => {\n this.css += str;\n\n if ( node && type !== 'end' ) {\n if ( node.source && node.source.start ) {\n this.map.addMapping({\n source: this.sourcePath(node),\n generated: { line, column: column - 1 },\n original: {\n line: node.source.start.line,\n column: node.source.start.column - 1\n }\n });\n } else {\n this.map.addMapping({\n source: '<no source>',\n original: { line: 1, column: 0 },\n generated: { line, column: column - 1 }\n });\n }\n }\n\n lines = str.match(/\\n/g);\n if ( lines ) {\n line += lines.length;\n last = str.lastIndexOf('\\n');\n column = str.length - last;\n } else {\n column += str.length;\n }\n\n if ( node && type !== 'start' ) {\n if ( node.source && node.source.end ) {\n this.map.addMapping({\n source: this.sourcePath(node),\n generated: { line, column: column - 1 },\n original: {\n line: node.source.end.line,\n column: node.source.end.column\n }\n });\n } else {\n this.map.addMapping({\n source: '<no source>',\n original: { line: 1, column: 0 },\n generated: { line, column: column - 1 }\n });\n }\n }\n });\n }\n\n generate() {\n this.clearAnnotation();\n\n if ( this.isMap() ) {\n return this.generateMap();\n } else {\n let result = '';\n this.stringify(this.root, i => {\n result += i;\n });\n return [result];\n }\n }\n\n}\n","/**\n * Represents a plugin’s warning. It can be created using {@link Node#warn}.\n *\n * @example\n * if ( decl.important ) {\n * decl.warn(result, 'Avoid !important', { word: '!important' });\n * }\n */\nclass Warning {\n\n /**\n * @param {string} text - warning message\n * @param {Object} [opts] - warning options\n * @param {Node} opts.node - CSS node that caused the warning\n * @param {string} opts.word - word in CSS source that caused the warning\n * @param {number} opts.index - index in CSS node string that caused\n * the warning\n * @param {string} opts.plugin - name of the plugin that created\n * this warning. {@link Result#warn} fills\n * this property automatically.\n */\n constructor(text, opts = { }) {\n /**\n * @member {string} - Type to filter warnings from\n * {@link Result#messages}. Always equal\n * to `\"warning\"`.\n *\n * @example\n * const nonWarning = result.messages.filter(i => i.type !== 'warning')\n */\n this.type = 'warning';\n /**\n * @member {string} - The warning message.\n *\n * @example\n * warning.text //=> 'Try to avoid !important'\n */\n this.text = text;\n\n if ( opts.node && opts.node.source ) {\n let pos = opts.node.positionBy(opts);\n /**\n * @member {number} - Line in the input file\n * with this warning’s source\n *\n * @example\n * warning.line //=> 5\n */\n this.line = pos.line;\n /**\n * @member {number} - Column in the input file\n * with this warning’s source.\n *\n * @example\n * warning.column //=> 6\n */\n this.column = pos.column;\n }\n\n for ( let opt in opts ) this[opt] = opts[opt];\n }\n\n /**\n * Returns a warning position and message.\n *\n * @example\n * warning.toString() //=> 'postcss-lint:a.css:10:14: Avoid !important'\n *\n * @return {string} warning position and message\n */\n toString() {\n if ( this.node ) {\n return this.node.error(this.text, {\n plugin: this.plugin,\n index: this.index,\n word: this.word\n }).message;\n } else if ( this.plugin ) {\n return this.plugin + ': ' + this.text;\n } else {\n return this.text;\n }\n }\n\n /**\n * @memberof Warning#\n * @member {string} plugin - The name of the plugin that created\n * it will fill this property automatically.\n * this warning. When you call {@link Node#warn}\n *\n * @example\n * warning.plugin //=> 'postcss-important'\n */\n\n /**\n * @memberof Warning#\n * @member {Node} node - Contains the CSS node that caused the warning.\n *\n * @example\n * warning.node.toString() //=> 'color: white !important'\n */\n\n}\n\nexport default Warning;\n","import Warning from './warning';\n\n/**\n * Provides the result of the PostCSS transformations.\n *\n * A Result instance is returned by {@link LazyResult#then}\n * or {@link Root#toResult} methods.\n *\n * @example\n * postcss([cssnext]).process(css).then(function (result) {\n * console.log(result.css);\n * });\n *\n * @example\n * var result2 = postcss.parse(css).toResult();\n */\nclass Result {\n\n /**\n * @param {Processor} processor - processor used for this transformation.\n * @param {Root} root - Root node after all transformations.\n * @param {processOptions} opts - options from the {@link Processor#process}\n * or {@link Root#toResult}\n */\n constructor(processor, root, opts) {\n /**\n * @member {Processor} - The Processor instance used\n * for this transformation.\n *\n * @example\n * for ( let plugin of result.processor.plugins) {\n * if ( plugin.postcssPlugin === 'postcss-bad' ) {\n * throw 'postcss-good is incompatible with postcss-bad';\n * }\n * });\n */\n this.processor = processor;\n /**\n * @member {Message[]} - Contains messages from plugins\n * (e.g., warnings or custom messages).\n * Each message should have type\n * and plugin properties.\n *\n * @example\n * postcss.plugin('postcss-min-browser', () => {\n * return (root, result) => {\n * var browsers = detectMinBrowsersByCanIUse(root);\n * result.messages.push({\n * type: 'min-browser',\n * plugin: 'postcss-min-browser',\n * browsers: browsers\n * });\n * };\n * });\n */\n this.messages = [];\n /**\n * @member {Root} - Root node after all transformations.\n *\n * @example\n * root.toResult().root == root;\n */\n this.root = root;\n /**\n * @member {processOptions} - Options from the {@link Processor#process}\n * or {@link Root#toResult} call\n * that produced this Result instance.\n *\n * @example\n * root.toResult(opts).opts == opts;\n */\n this.opts = opts;\n /**\n * @member {string} - A CSS string representing of {@link Result#root}.\n *\n * @example\n * postcss.parse('a{}').toResult().css //=> \"a{}\"\n */\n this.css = undefined;\n /**\n * @member {SourceMapGenerator} - An instance of `SourceMapGenerator`\n * class from the `source-map` library,\n * representing changes\n * to the {@link Result#root} instance.\n *\n * @example\n * result.map.toJSON() //=> { version: 3, file: 'a.css', … }\n *\n * @example\n * if ( result.map ) {\n * fs.writeFileSync(result.opts.to + '.map', result.map.toString());\n * }\n */\n this.map = undefined;\n }\n\n /**\n * Returns for @{link Result#css} content.\n *\n * @example\n * result + '' === result.css\n *\n * @return {string} string representing of {@link Result#root}\n */\n toString() {\n return this.css;\n }\n\n /**\n * Creates an instance of {@link Warning} and adds it\n * to {@link Result#messages}.\n *\n * @param {string} text - warning message\n * @param {Object} [opts] - warning options\n * @param {Node} opts.node - CSS node that caused the warning\n * @param {string} opts.word - word in CSS source that caused the warning\n * @param {number} opts.index - index in CSS node string that caused\n * the warning\n * @param {string} opts.plugin - name of the plugin that created\n * this warning. {@link Result#warn} fills\n * this property automatically.\n *\n * @return {Warning} created warning\n */\n warn(text, opts = { }) {\n if ( !opts.plugin ) {\n if ( this.lastPlugin && this.lastPlugin.postcssPlugin ) {\n opts.plugin = this.lastPlugin.postcssPlugin;\n }\n }\n\n let warning = new Warning(text, opts);\n this.messages.push(warning);\n\n return warning;\n }\n\n /**\n * Returns warnings from plugins. Filters {@link Warning} instances\n * from {@link Result#messages}.\n *\n * @example\n * result.warnings().forEach(warn => {\n * console.warn(warn.toString());\n * });\n *\n * @return {Warning[]} warnings from plugins\n */\n warnings() {\n return this.messages.filter( i => i.type === 'warning' );\n }\n\n /**\n * An alias for the {@link Result#css} property.\n * Use it with syntaxes that generate non-CSS output.\n * @type {string}\n *\n * @example\n * result.css === result.content;\n */\n get content() {\n return this.css;\n }\n\n}\n\nexport default Result;\n\n/**\n * @typedef {object} Message\n * @property {string} type - message type\n * @property {string} plugin - source PostCSS plugin name\n */\n","import Node from './node';\n\n/**\n * Represents a comment between declarations or statements (rule and at-rules).\n *\n * Comments inside selectors, at-rule parameters, or declaration values\n * will be stored in the `raws` properties explained above.\n *\n * @extends Node\n */\nclass Comment extends Node {\n\n constructor(defaults) {\n super(defaults);\n this.type = 'comment';\n }\n\n /**\n * @memberof Comment#\n * @member {string} text - the comment’s text\n */\n\n /**\n * @memberof Comment#\n * @member {object} raws - Information to generate byte-to-byte equal\n * node string as it was in the origin input.\n *\n * Every parser saves its own properties,\n * but the default CSS parser uses:\n *\n * * `before`: the space symbols before the node.\n * * `left`: the space symbols between `/*` and the comment’s text.\n * * `right`: the space symbols between the comment’s text.\n */\n}\n\nexport default Comment;\n","/**\n * Contains helpers for safely splitting lists of CSS values,\n * preserving parentheses and quotes.\n *\n * @example\n * const list = postcss.list;\n *\n * @namespace list\n */\nlet list = {\n\n split(string, separators, last) {\n let array = [];\n let current = '';\n let split = false;\n\n let func = 0;\n let quote = false;\n let escape = false;\n\n for ( let i = 0; i < string.length; i++ ) {\n let letter = string[i];\n\n if ( quote ) {\n if ( escape ) {\n escape = false;\n } else if ( letter === '\\\\' ) {\n escape = true;\n } else if ( letter === quote ) {\n quote = false;\n }\n } else if ( letter === '\"' || letter === '\\'' ) {\n quote = letter;\n } else if ( letter === '(' ) {\n func += 1;\n } else if ( letter === ')' ) {\n if ( func > 0 ) func -= 1;\n } else if ( func === 0 ) {\n if ( separators.indexOf(letter) !== -1 ) split = true;\n }\n\n if ( split ) {\n if ( current !== '' ) array.push(current.trim());\n current = '';\n split = false;\n } else {\n current += letter;\n }\n }\n\n if ( last || current !== '' ) array.push(current.trim());\n return array;\n },\n\n /**\n * Safely splits space-separated values (such as those for `background`,\n * `border-radius`, and other shorthand properties).\n *\n * @param {string} string - space-separated values\n *\n * @return {string[]} split values\n *\n * @example\n * postcss.list.space('1px calc(10% + 1px)') //=> ['1px', 'calc(10% + 1px)']\n */\n space(string) {\n let spaces = [' ', '\\n', '\\t'];\n return list.split(string, spaces);\n },\n\n /**\n * Safely splits comma-separated values (such as those for `transition-*`\n * and `background` properties).\n *\n * @param {string} string - comma-separated values\n *\n * @return {string[]} split values\n *\n * @example\n * postcss.list.comma('black, linear-gradient(white, black)')\n * //=> ['black', 'linear-gradient(white, black)']\n */\n comma(string) {\n let comma = ',';\n return list.split(string, [comma], true);\n }\n\n};\n\nexport default list;\n","import Container from './container';\nimport list from './list';\n\n/**\n * Represents a CSS rule: a selector followed by a declaration block.\n *\n * @extends Container\n *\n * @example\n * const root = postcss.parse('a{}');\n * const rule = root.first;\n * rule.type //=> 'rule'\n * rule.toString() //=> 'a{}'\n */\nclass Rule extends Container {\n\n constructor(defaults) {\n super(defaults);\n this.type = 'rule';\n if ( !this.nodes ) this.nodes = [];\n }\n\n /**\n * An array containing the rule’s individual selectors.\n * Groups of selectors are split at commas.\n *\n * @type {string[]}\n *\n * @example\n * const root = postcss.parse('a, b { }');\n * const rule = root.first;\n *\n * rule.selector //=> 'a, b'\n * rule.selectors //=> ['a', 'b']\n *\n * rule.selectors = ['a', 'strong'];\n * rule.selector //=> 'a, strong'\n */\n get selectors() {\n return list.comma(this.selector);\n }\n\n set selectors(values) {\n let match = this.selector ? this.selector.match(/,\\s*/) : null;\n let sep = match ? match[0] : ',' + this.raw('between', 'beforeOpen');\n this.selector = values.join(sep);\n }\n\n /**\n * @memberof Rule#\n * @member {string} selector - the rule’s full selector represented\n * as a string\n *\n * @example\n * const root = postcss.parse('a, b { }');\n * const rule = root.first;\n * rule.selector //=> 'a, b'\n */\n\n /**\n * @memberof Rule#\n * @member {object} raws - Information to generate byte-to-byte equal\n * node string as it was in the origin input.\n *\n * Every parser saves its own properties,\n * but the default CSS parser uses:\n *\n * * `before`: the space symbols before the node. It also stores `*`\n * and `_` symbols before the declaration (IE hack).\n * * `after`: the space symbols after the last child of the node\n * to the end of the node.\n * * `between`: the symbols between the property and value\n * for declarations, selector and `{` for rules, or last parameter\n * and `{` for at-rules.\n * * `semicolon`: contains `true` if the last child has\n * an (optional) semicolon.\n * * `ownSemicolon`: contains `true` if there is semicolon after rule.\n *\n * PostCSS cleans selectors from comments and extra spaces,\n * but it stores origin content in raws properties.\n * As such, if you don’t change a declaration’s value,\n * PostCSS will use the raw value with comments.\n *\n * @example\n * const root = postcss.parse('a {\\n color:black\\n}')\n * root.first.first.raws //=> { before: '', between: ' ', after: '\\n' }\n */\n\n}\n\nexport default Rule;\n","import Container from './container';\n\n/**\n * Represents a CSS file and contains all its parsed nodes.\n *\n * @extends Container\n *\n * @example\n * const root = postcss.parse('a{color:black} b{z-index:2}');\n * root.type //=> 'root'\n * root.nodes.length //=> 2\n */\nclass Root extends Container {\n\n constructor(defaults) {\n super(defaults);\n this.type = 'root';\n if ( !this.nodes ) this.nodes = [];\n }\n\n removeChild(child, ignore) {\n const index = this.index(child);\n\n if ( !ignore && index === 0 && this.nodes.length > 1 ) {\n this.nodes[1].raws.before = this.nodes[index].raws.before;\n }\n\n return super.removeChild(child);\n }\n\n normalize(child, sample, type) {\n let nodes = super.normalize(child);\n\n if ( sample ) {\n if ( type === 'prepend' ) {\n if ( this.nodes.length > 1 ) {\n sample.raws.before = this.nodes[1].raws.before;\n } else {\n delete sample.raws.before;\n }\n } else if ( this.first !== sample ) {\n for ( let node of nodes ) {\n node.raws.before = sample.raws.before;\n }\n }\n }\n\n return nodes;\n }\n\n /**\n * Returns a {@link Result} instance representing the root’s CSS.\n *\n * @param {processOptions} [opts] - options with only `to` and `map` keys\n *\n * @return {Result} result with current root’s CSS\n *\n * @example\n * const root1 = postcss.parse(css1, { from: 'a.css' });\n * const root2 = postcss.parse(css2, { from: 'b.css' });\n * root1.append(root2);\n * const result = root1.toResult({ to: 'all.css', map: true });\n */\n toResult(opts = { }) {\n let LazyResult = require('./lazy-result');\n let Processor = require('./processor');\n\n let lazy = new LazyResult(new Processor(), this, opts);\n return lazy.stringify();\n }\n\n /**\n * @memberof Root#\n * @member {object} raws - Information to generate byte-to-byte equal\n * node string as it was in the origin input.\n *\n * Every parser saves its own properties,\n * but the default CSS parser uses:\n *\n * * `after`: the space symbols after the last child to the end of file.\n * * `semicolon`: is the last child has an (optional) semicolon.\n *\n * @example\n * postcss.parse('a {}\\n').raws //=> { after: '\\n' }\n * postcss.parse('a {}').raws //=> { after: '' }\n */\n\n}\n\nexport default Root;\n","import Declaration from './declaration';\nimport Comment from './comment';\nimport Node from './node';\n\nfunction cleanSource(nodes) {\n return nodes.map( i => {\n if ( i.nodes ) i.nodes = cleanSource(i.nodes);\n delete i.source;\n return i;\n });\n}\n\n/**\n * The {@link Root}, {@link AtRule}, and {@link Rule} container nodes\n * inherit some common methods to help work with their children.\n *\n * Note that all containers can store any content. If you write a rule inside\n * a rule, PostCSS will parse it.\n *\n * @extends Node\n * @abstract\n */\nclass Container extends Node {\n\n push(child) {\n child.parent = this;\n this.nodes.push(child);\n return this;\n }\n\n /**\n * Iterates through the container’s immediate children,\n * calling `callback` for each child.\n *\n * Returning `false` in the callback will break iteration.\n *\n * This method only iterates through the container’s immediate children.\n * If you need to recursively iterate through all the container’s descendant\n * nodes, use {@link Container#walk}.\n *\n * Unlike the for `{}`-cycle or `Array#forEach` this iterator is safe\n * if you are mutating the array of child nodes during iteration.\n * PostCSS will adjust the current index to match the mutations.\n *\n * @param {childIterator} callback - iterator receives each node and index\n *\n * @return {false|undefined} returns `false` if iteration was broke\n *\n * @example\n * const root = postcss.parse('a { color: black; z-index: 1 }');\n * const rule = root.first;\n *\n * for ( let decl of rule.nodes ) {\n * decl.cloneBefore({ prop: '-webkit-' + decl.prop });\n * // Cycle will be infinite, because cloneBefore moves the current node\n * // to the next index\n * }\n *\n * rule.each(decl => {\n * decl.cloneBefore({ prop: '-webkit-' + decl.prop });\n * // Will be executed only for color and z-index\n * });\n */\n each(callback) {\n if ( !this.lastEach ) this.lastEach = 0;\n if ( !this.indexes ) this.indexes = { };\n\n this.lastEach += 1;\n let id = this.lastEach;\n this.indexes[id] = 0;\n\n if ( !this.nodes ) return undefined;\n\n let index, result;\n while ( this.indexes[id] < this.nodes.length ) {\n index = this.indexes[id];\n result = callback(this.nodes[index], index);\n if ( result === false ) break;\n\n this.indexes[id] += 1;\n }\n\n delete this.indexes[id];\n\n return result;\n }\n\n /**\n * Traverses the container’s descendant nodes, calling callback\n * for each node.\n *\n * Like container.each(), this method is safe to use\n * if you are mutating arrays during iteration.\n *\n * If you only need to iterate through the container’s immediate children,\n * use {@link Container#each}.\n *\n * @param {childIterator} callback - iterator receives each node and index\n *\n * @return {false|undefined} returns `false` if iteration was broke\n *\n * @example\n * root.walk(node => {\n * // Traverses all descendant nodes.\n * });\n */\n walk(callback) {\n return this.each( (child, i) => {\n let result = callback(child, i);\n if ( result !== false && child.walk ) {\n result = child.walk(callback);\n }\n return result;\n });\n }\n\n /**\n * Traverses the container’s descendant nodes, calling callback\n * for each declaration node.\n *\n * If you pass a filter, iteration will only happen over declarations\n * with matching properties.\n *\n * Like {@link Container#each}, this method is safe\n * to use if you are mutating arrays during iteration.\n *\n * @param {string|RegExp} [prop] - string or regular expression\n * to filter declarations by property name\n * @param {childIterator} callback - iterator receives each node and index\n *\n * @return {false|undefined} returns `false` if iteration was broke\n *\n * @example\n * root.walkDecls(decl => {\n * checkPropertySupport(decl.prop);\n * });\n *\n * root.walkDecls('border-radius', decl => {\n * decl.remove();\n * });\n *\n * root.walkDecls(/^background/, decl => {\n * decl.value = takeFirstColorFromGradient(decl.value);\n * });\n */\n walkDecls(prop, callback) {\n if ( !callback ) {\n callback = prop;\n return this.walk( (child, i) => {\n if ( child.type === 'decl' ) {\n return callback(child, i);\n }\n });\n } else if ( prop instanceof RegExp ) {\n return this.walk( (child, i) => {\n if ( child.type === 'decl' && prop.test(child.prop) ) {\n return callback(child, i);\n }\n });\n } else {\n return this.walk( (child, i) => {\n if ( child.type === 'decl' && child.prop === prop ) {\n return callback(child, i);\n }\n });\n }\n }\n\n /**\n * Traverses the container’s descendant nodes, calling callback\n * for each rule node.\n *\n * If you pass a filter, iteration will only happen over rules\n * with matching selectors.\n *\n * Like {@link Container#each}, this method is safe\n * to use if you are mutating arrays during iteration.\n *\n * @param {string|RegExp} [selector] - string or regular expression\n * to filter rules by selector\n * @param {childIterator} callback - iterator receives each node and index\n *\n * @return {false|undefined} returns `false` if iteration was broke\n *\n * @example\n * const selectors = [];\n * root.walkRules(rule => {\n * selectors.push(rule.selector);\n * });\n * console.log(`Your CSS uses ${selectors.length} selectors`);\n */\n walkRules(selector, callback) {\n if ( !callback ) {\n callback = selector;\n\n return this.walk( (child, i) => {\n if ( child.type === 'rule' ) {\n return callback(child, i);\n }\n });\n } else if ( selector instanceof RegExp ) {\n return this.walk( (child, i) => {\n if ( child.type === 'rule' && selector.test(child.selector) ) {\n return callback(child, i);\n }\n });\n } else {\n return this.walk( (child, i) => {\n if ( child.type === 'rule' && child.selector === selector ) {\n return callback(child, i);\n }\n });\n }\n }\n\n /**\n * Traverses the container’s descendant nodes, calling callback\n * for each at-rule node.\n *\n * If you pass a filter, iteration will only happen over at-rules\n * that have matching names.\n *\n * Like {@link Container#each}, this method is safe\n * to use if you are mutating arrays during iteration.\n *\n * @param {string|RegExp} [name] - string or regular expression\n * to filter at-rules by name\n * @param {childIterator} callback - iterator receives each node and index\n *\n * @return {false|undefined} returns `false` if iteration was broke\n *\n * @example\n * root.walkAtRules(rule => {\n * if ( isOld(rule.name) ) rule.remove();\n * });\n *\n * let first = false;\n * root.walkAtRules('charset', rule => {\n * if ( !first ) {\n * first = true;\n * } else {\n * rule.remove();\n * }\n * });\n */\n walkAtRules(name, callback) {\n if ( !callback ) {\n callback = name;\n return this.walk( (child, i) => {\n if ( child.type === 'atrule' ) {\n return callback(child, i);\n }\n });\n } else if ( name instanceof RegExp ) {\n return this.walk( (child, i) => {\n if ( child.type === 'atrule' && name.test(child.name) ) {\n return callback(child, i);\n }\n });\n } else {\n return this.walk( (child, i) => {\n if ( child.type === 'atrule' && child.name === name ) {\n return callback(child, i);\n }\n });\n }\n }\n\n /**\n * Traverses the container’s descendant nodes, calling callback\n * for each comment node.\n *\n * Like {@link Container#each}, this method is safe\n * to use if you are mutating arrays during iteration.\n *\n * @param {childIterator} callback - iterator receives each node and index\n *\n * @return {false|undefined} returns `false` if iteration was broke\n *\n * @example\n * root.walkComments(comment => {\n * comment.remove();\n * });\n */\n walkComments(callback) {\n return this.walk( (child, i) => {\n if ( child.type === 'comment' ) {\n return callback(child, i);\n }\n });\n }\n\n /**\n * Inserts new nodes to the end of the container.\n *\n * @param {...(Node|object|string|Node[])} children - new nodes\n *\n * @return {Node} this node for methods chain\n *\n * @example\n * const decl1 = postcss.decl({ prop: 'color', value: 'black' });\n * const decl2 = postcss.decl({ prop: 'background-color', value: 'white' });\n * rule.append(decl1, decl2);\n *\n * root.append({ name: 'charset', params: '\"UTF-8\"' }); // at-rule\n * root.append({ selector: 'a' }); // rule\n * rule.append({ prop: 'color', value: 'black' }); // declaration\n * rule.append({ text: 'Comment' }) // comment\n *\n * root.append('a {}');\n * root.first.append('color: black; z-index: 1');\n */\n append(...children) {\n for ( let child of children ) {\n let nodes = this.normalize(child, this.last);\n for ( let node of nodes ) this.nodes.push(node);\n }\n return this;\n }\n\n /**\n * Inserts new nodes to the start of the container.\n *\n * @param {...(Node|object|string|Node[])} children - new nodes\n *\n * @return {Node} this node for methods chain\n *\n * @example\n * const decl1 = postcss.decl({ prop: 'color', value: 'black' });\n * const decl2 = postcss.decl({ prop: 'background-color', value: 'white' });\n * rule.prepend(decl1, decl2);\n *\n * root.append({ name: 'charset', params: '\"UTF-8\"' }); // at-rule\n * root.append({ selector: 'a' }); // rule\n * rule.append({ prop: 'color', value: 'black' }); // declaration\n * rule.append({ text: 'Comment' }) // comment\n *\n * root.append('a {}');\n * root.first.append('color: black; z-index: 1');\n */\n prepend(...children) {\n children = children.reverse();\n for ( let child of children ) {\n let nodes = this.normalize(child, this.first, 'prepend').reverse();\n for ( let node of nodes ) this.nodes.unshift(node);\n for ( let id in this.indexes ) {\n this.indexes[id] = this.indexes[id] + nodes.length;\n }\n }\n return this;\n }\n\n cleanRaws(keepBetween) {\n super.cleanRaws(keepBetween);\n if ( this.nodes ) {\n for ( let node of this.nodes ) node.cleanRaws(keepBetween);\n }\n }\n\n /**\n * Insert new node before old node within the container.\n *\n * @param {Node|number} exist - child or child’s index.\n * @param {Node|object|string|Node[]} add - new node\n *\n * @return {Node} this node for methods chain\n *\n * @example\n * rule.insertBefore(decl, decl.clone({ prop: '-webkit-' + decl.prop }));\n */\n insertBefore(exist, add) {\n exist = this.index(exist);\n\n let type = exist === 0 ? 'prepend' : false;\n let nodes = this.normalize(add, this.nodes[exist], type).reverse();\n for ( let node of nodes ) this.nodes.splice(exist, 0, node);\n\n let index;\n for ( let id in this.indexes ) {\n index = this.indexes[id];\n if ( exist <= index ) {\n this.indexes[id] = index + nodes.length;\n }\n }\n\n return this;\n }\n\n /**\n * Insert new node after old node within the container.\n *\n * @param {Node|number} exist - child or child’s index\n * @param {Node|object|string|Node[]} add - new node\n *\n * @return {Node} this node for methods chain\n */\n insertAfter(exist, add) {\n exist = this.index(exist);\n\n let nodes = this.normalize(add, this.nodes[exist]).reverse();\n for ( let node of nodes ) this.nodes.splice(exist + 1, 0, node);\n\n let index;\n for ( let id in this.indexes ) {\n index = this.indexes[id];\n if ( exist < index ) {\n this.indexes[id] = index + nodes.length;\n }\n }\n\n return this;\n }\n\n /**\n * Removes node from the container and cleans the parent properties\n * from the node and its children.\n *\n * @param {Node|number} child - child or child’s index\n *\n * @return {Node} this node for methods chain\n *\n * @example\n * rule.nodes.length //=> 5\n * rule.removeChild(decl);\n * rule.nodes.length //=> 4\n * decl.parent //=> undefined\n */\n removeChild(child) {\n child = this.index(child);\n this.nodes[child].parent = undefined;\n this.nodes.splice(child, 1);\n\n let index;\n for ( let id in this.indexes ) {\n index = this.indexes[id];\n if ( index >= child ) {\n this.indexes[id] = index - 1;\n }\n }\n\n return this;\n }\n\n /**\n * Removes all children from the container\n * and cleans their parent properties.\n *\n * @return {Node} this node for methods chain\n *\n * @example\n * rule.removeAll();\n * rule.nodes.length //=> 0\n */\n removeAll() {\n for ( let node of this.nodes ) node.parent = undefined;\n this.nodes = [];\n return this;\n }\n\n /**\n * Passes all declaration values within the container that match pattern\n * through callback, replacing those values with the returned result\n * of callback.\n *\n * This method is useful if you are using a custom unit or function\n * and need to iterate through all values.\n *\n * @param {string|RegExp} pattern - replace pattern\n * @param {object} opts - options to speed up the search\n * @param {string|string[]} opts.props - an array of property names\n * @param {string} opts.fast - string that’s used\n * to narrow down values and speed up\n the regexp search\n * @param {function|string} callback - string to replace pattern\n * or callback that returns a new\n * value.\n * The callback will receive\n * the same arguments as those\n * passed to a function parameter\n * of `String#replace`.\n *\n * @return {Node} this node for methods chain\n *\n * @example\n * root.replaceValues(/\\d+rem/, { fast: 'rem' }, string => {\n * return 15 * parseInt(string) + 'px';\n * });\n */\n replaceValues(pattern, opts, callback) {\n if ( !callback ) {\n callback = opts;\n opts = { };\n }\n\n this.walkDecls( decl => {\n if ( opts.props && opts.props.indexOf(decl.prop) === -1 ) return;\n if ( opts.fast && decl.value.indexOf(opts.fast) === -1 ) return;\n\n decl.value = decl.value.replace(pattern, callback);\n });\n\n return this;\n }\n\n /**\n * Returns `true` if callback returns `true`\n * for all of the container’s children.\n *\n * @param {childCondition} condition - iterator returns true or false.\n *\n * @return {boolean} is every child pass condition\n *\n * @example\n * const noPrefixes = rule.every(i => i.prop[0] !== '-');\n */\n every(condition) {\n return this.nodes.every(condition);\n }\n\n /**\n * Returns `true` if callback returns `true` for (at least) one\n * of the container’s children.\n *\n * @param {childCondition} condition - iterator returns true or false.\n *\n * @return {boolean} is some child pass condition\n *\n * @example\n * const hasPrefix = rule.some(i => i.prop[0] === '-');\n */\n some(condition) {\n return this.nodes.some(condition);\n }\n\n /**\n * Returns a `child`’s index within the {@link Container#nodes} array.\n *\n * @param {Node} child - child of the current container.\n *\n * @return {number} child index\n *\n * @example\n * rule.index( rule.nodes[2] ) //=> 2\n */\n index(child) {\n if ( typeof child === 'number' ) {\n return child;\n } else {\n return this.nodes.indexOf(child);\n }\n }\n\n /**\n * The container’s first child.\n *\n * @type {Node}\n *\n * @example\n * rule.first == rules.nodes[0];\n */\n get first() {\n if ( !this.nodes ) return undefined;\n return this.nodes[0];\n }\n\n /**\n * The container’s last child.\n *\n * @type {Node}\n *\n * @example\n * rule.last == rule.nodes[rule.nodes.length - 1];\n */\n get last() {\n if ( !this.nodes ) return undefined;\n return this.nodes[this.nodes.length - 1];\n }\n\n normalize(nodes, sample) {\n if ( typeof nodes === 'string' ) {\n let parse = require('./parse');\n nodes = cleanSource(parse(nodes).nodes);\n } else if ( Array.isArray(nodes) ) {\n nodes = nodes.slice(0);\n for ( let i of nodes ) {\n if ( i.parent ) i.parent.removeChild(i, 'ignore');\n }\n } else if ( nodes.type === 'root' ) {\n nodes = nodes.nodes.slice(0);\n for ( let i of nodes ) {\n if ( i.parent ) i.parent.removeChild(i, 'ignore');\n }\n } else if ( nodes.type ) {\n nodes = [nodes];\n } else if ( nodes.prop ) {\n if ( typeof nodes.value === 'undefined' ) {\n throw new Error('Value field is missed in node creation');\n } else if ( typeof nodes.value !== 'string' ) {\n nodes.value = String(nodes.value);\n }\n nodes = [new Declaration(nodes)];\n } else if ( nodes.selector ) {\n let Rule = require('./rule');\n nodes = [new Rule(nodes)];\n } else if ( nodes.name ) {\n let AtRule = require('./at-rule');\n nodes = [new AtRule(nodes)];\n } else if ( nodes.text ) {\n nodes = [new Comment(nodes)];\n } else {\n throw new Error('Unknown node type in node creation');\n }\n\n let processed = nodes.map( i => {\n if ( typeof i.before !== 'function' ) i = this.rebuild(i);\n\n if ( i.parent ) i.parent.removeChild(i);\n if ( typeof i.raws.before === 'undefined' ) {\n if ( sample && typeof sample.raws.before !== 'undefined' ) {\n i.raws.before = sample.raws.before.replace(/[^\\s]/g, '');\n }\n }\n i.parent = this;\n return i;\n });\n\n return processed;\n }\n\n rebuild(node, parent) {\n let fix;\n if ( node.type === 'root' ) {\n let Root = require('./root');\n fix = new Root();\n } else if ( node.type === 'atrule' ) {\n let AtRule = require('./at-rule');\n fix = new AtRule();\n } else if ( node.type === 'rule' ) {\n let Rule = require('./rule');\n fix = new Rule();\n } else if ( node.type === 'decl' ) {\n fix = new Declaration();\n } else if ( node.type === 'comment' ) {\n fix = new Comment();\n }\n\n for ( let i in node ) {\n if ( i === 'nodes' ) {\n fix.nodes = node.nodes.map( j => this.rebuild(j, fix) );\n } else if ( i === 'parent' && parent ) {\n fix.parent = parent;\n } else if ( node.hasOwnProperty(i) ) {\n fix[i] = node[i];\n }\n }\n\n return fix;\n }\n\n /**\n * @memberof Container#\n * @member {Node[]} nodes - an array containing the container’s children\n *\n * @example\n * const root = postcss.parse('a { color: black }');\n * root.nodes.length //=> 1\n * root.nodes[0].selector //=> 'a'\n * root.nodes[0].nodes[0].prop //=> 'color'\n */\n\n}\n\nexport default Container;\n\n\n/**\n * @callback childCondition\n * @param {Node} node - container child\n * @param {number} index - child index\n * @param {Node[]} nodes - all container children\n * @return {boolean}\n */\n\n/**\n * @callback childIterator\n * @param {Node} node - container child\n * @param {number} index - child index\n * @return {false|undefined} returning `false` will break iteration\n */\n","import Container from './container';\n\n/**\n * Represents an at-rule.\n *\n * If it’s followed in the CSS by a {} block, this node will have\n * a nodes property representing its children.\n *\n * @extends Container\n *\n * @example\n * const root = postcss.parse('@charset \"UTF-8\"; @media print {}');\n *\n * const charset = root.first;\n * charset.type //=> 'atrule'\n * charset.nodes //=> undefined\n *\n * const media = root.last;\n * media.nodes //=> []\n */\nclass AtRule extends Container {\n\n constructor(defaults) {\n super(defaults);\n this.type = 'atrule';\n }\n\n append(...children) {\n if ( !this.nodes ) this.nodes = [];\n return super.append(...children);\n }\n\n prepend(...children) {\n if ( !this.nodes ) this.nodes = [];\n return super.prepend(...children);\n }\n\n /**\n * @memberof AtRule#\n * @member {string} name - the at-rule’s name immediately follows the `@`\n *\n * @example\n * const root = postcss.parse('@media print {}');\n * media.name //=> 'media'\n * const media = root.first;\n */\n\n /**\n * @memberof AtRule#\n * @member {string} params - the at-rule’s parameters, the values\n * that follow the at-rule’s name but precede\n * any {} block\n *\n * @example\n * const root = postcss.parse('@media print, screen {}');\n * const media = root.first;\n * media.params //=> 'print, screen'\n */\n\n /**\n * @memberof AtRule#\n * @member {object} raws - Information to generate byte-to-byte equal\n * node string as it was in the origin input.\n *\n * Every parser saves its own properties,\n * but the default CSS parser uses:\n *\n * * `before`: the space symbols before the node. It also stores `*`\n * and `_` symbols before the declaration (IE hack).\n * * `after`: the space symbols after the last child of the node\n * to the end of the node.\n * * `between`: the symbols between the property and value\n * for declarations, selector and `{` for rules, or last parameter\n * and `{` for at-rules.\n * * `semicolon`: contains true if the last child has\n * an (optional) semicolon.\n * * `afterName`: the space between the at-rule name and its parameters.\n *\n * PostCSS cleans at-rule parameters from comments and extra spaces,\n * but it stores origin content in raws properties.\n * As such, if you don’t change a declaration’s value,\n * PostCSS will use the raw value with comments.\n *\n * @example\n * const root = postcss.parse(' @media\\nprint {\\n}')\n * root.first.first.raws //=> { before: ' ',\n * // between: ' ',\n * // afterName: '\\n',\n * // after: '\\n' }\n */\n}\n\nexport default AtRule;\n","import Declaration from './declaration';\nimport tokenizer from './tokenize';\nimport Comment from './comment';\nimport AtRule from './at-rule';\nimport Root from './root';\nimport Rule from './rule';\n\nexport default class Parser {\n\n constructor(input) {\n this.input = input;\n\n this.root = new Root();\n this.current = this.root;\n this.spaces = '';\n this.semicolon = false;\n\n this.createTokenizer();\n this.root.source = { input, start: { line: 1, column: 1 } };\n }\n\n createTokenizer() {\n this.tokenizer = tokenizer(this.input);\n }\n\n parse() {\n let token;\n while ( !this.tokenizer.endOfFile() ) {\n token = this.tokenizer.nextToken();\n\n switch ( token[0] ) {\n\n case 'space':\n this.spaces += token[1];\n break;\n\n case ';':\n this.freeSemicolon(token);\n break;\n\n case '}':\n this.end(token);\n break;\n\n case 'comment':\n this.comment(token);\n break;\n\n case 'at-word':\n this.atrule(token);\n break;\n\n case '{':\n this.emptyRule(token);\n break;\n\n default:\n this.other(token);\n break;\n }\n }\n this.endFile();\n }\n\n comment(token) {\n let node = new Comment();\n this.init(node, token[2], token[3]);\n node.source.end = { line: token[4], column: token[5] };\n\n let text = token[1].slice(2, -2);\n if ( /^\\s*$/.test(text) ) {\n node.text = '';\n node.raws.left = text;\n node.raws.right = '';\n } else {\n let match = text.match(/^(\\s*)([^]*[^\\s])(\\s*)$/);\n node.text = match[2];\n node.raws.left = match[1];\n node.raws.right = match[3];\n }\n }\n\n emptyRule(token) {\n let node = new Rule();\n this.init(node, token[2], token[3]);\n node.selector = '';\n node.raws.between = '';\n this.current = node;\n }\n\n other(start) {\n let end = false;\n let type = null;\n let colon = false;\n let bracket = null;\n let brackets = [];\n\n let tokens = [];\n let token = start;\n while ( token ) {\n type = token[0];\n tokens.push(token);\n\n if ( type === '(' || type === '[' ) {\n if ( !bracket ) bracket = token;\n brackets.push(type === '(' ? ')' : ']');\n\n } else if ( brackets.length === 0 ) {\n if ( type === ';' ) {\n if ( colon ) {\n this.decl(tokens);\n return;\n } else {\n break;\n }\n\n } else if ( type === '{' ) {\n this.rule(tokens);\n return;\n\n } else if ( type === '}' ) {\n this.tokenizer.back(tokens.pop());\n end = true;\n break;\n\n } else if ( type === ':' ) {\n colon = true;\n }\n\n } else if ( type === brackets[brackets.length - 1] ) {\n brackets.pop();\n if ( brackets.length === 0 ) bracket = null;\n }\n\n token = this.tokenizer.nextToken();\n }\n\n if ( this.tokenizer.endOfFile() ) end = true;\n if ( brackets.length > 0 ) this.unclosedBracket(bracket);\n\n if ( end && colon ) {\n while ( tokens.length ) {\n token = tokens[tokens.length - 1][0];\n if ( token !== 'space' && token !== 'comment' ) break;\n this.tokenizer.back(tokens.pop());\n }\n this.decl(tokens);\n return;\n } else {\n this.unknownWord(tokens);\n }\n }\n\n rule(tokens) {\n tokens.pop();\n\n let node = new Rule();\n this.init(node, tokens[0][2], tokens[0][3]);\n\n node.raws.between = this.spacesAndCommentsFromEnd(tokens);\n this.raw(node, 'selector', tokens);\n this.current = node;\n }\n\n decl(tokens) {\n let node = new Declaration();\n this.init(node);\n\n let last = tokens[tokens.length - 1];\n if ( last[0] === ';' ) {\n this.semicolon = true;\n tokens.pop();\n }\n if ( last[4] ) {\n node.source.end = { line: last[4], column: last[5] };\n } else {\n node.source.end = { line: last[2], column: last[3] };\n }\n\n while ( tokens[0][0] !== 'word' ) {\n if ( tokens.length === 1 ) this.unknownWord(tokens);\n node.raws.before += tokens.shift()[1];\n }\n node.source.start = { line: tokens[0][2], column: tokens[0][3] };\n\n node.prop = '';\n while ( tokens.length ) {\n let type = tokens[0][0];\n if ( type === ':' || type === 'space' || type === 'comment' ) {\n break;\n }\n node.prop += tokens.shift()[1];\n }\n\n node.raws.between = '';\n\n let token;\n while ( tokens.length ) {\n token = tokens.shift();\n\n if ( token[0] === ':' ) {\n node.raws.between += token[1];\n break;\n } else {\n node.raws.between += token[1];\n }\n }\n\n if ( node.prop[0] === '_' || node.prop[0] === '*' ) {\n node.raws.before += node.prop[0];\n node.prop = node.prop.slice(1);\n }\n node.raws.between += this.spacesAndCommentsFromStart(tokens);\n this.precheckMissedSemicolon(tokens);\n\n for ( let i = tokens.length - 1; i > 0; i-- ) {\n token = tokens[i];\n if ( token[1].toLowerCase() === '!important' ) {\n node.important = true;\n let string = this.stringFrom(tokens, i);\n string = this.spacesFromEnd(tokens) + string;\n if ( string !== ' !important' ) node.raws.important = string;\n break;\n\n } else if (token[1].toLowerCase() === 'important') {\n let cache = tokens.slice(0);\n let str = '';\n for ( let j = i; j > 0; j-- ) {\n let type = cache[j][0];\n if ( str.trim().indexOf('!') === 0 && type !== 'space' ) {\n break;\n }\n str = cache.pop()[1] + str;\n }\n if ( str.trim().indexOf('!') === 0 ) {\n node.important = true;\n node.raws.important = str;\n tokens = cache;\n }\n }\n\n if ( token[0] !== 'space' && token[0] !== 'comment' ) {\n break;\n }\n }\n\n this.raw(node, 'value', tokens);\n\n if ( node.value.indexOf(':') !== -1 ) this.checkMissedSemicolon(tokens);\n }\n\n atrule(token) {\n let node = new AtRule();\n node.name = token[1].slice(1);\n if ( node.name === '' ) {\n this.unnamedAtrule(node, token);\n }\n this.init(node, token[2], token[3]);\n\n let prev;\n let shift;\n let last = false;\n let open = false;\n let params = [];\n\n while ( !this.tokenizer.endOfFile() ) {\n token = this.tokenizer.nextToken();\n\n if ( token[0] === ';' ) {\n node.source.end = { line: token[2], column: token[3] };\n this.semicolon = true;\n break;\n } else if ( token[0] === '{' ) {\n open = true;\n break;\n } else if ( token[0] === '}') {\n if ( params.length > 0 ) {\n shift = params.length - 1;\n prev = params[shift];\n while ( prev && prev[0] === 'space' ) {\n prev = params[--shift];\n }\n if ( prev ) {\n node.source.end = { line: prev[4], column: prev[5] };\n }\n }\n this.end(token);\n break;\n } else {\n params.push(token);\n }\n\n if ( this.tokenizer.endOfFile() ) {\n last = true;\n break;\n }\n }\n\n node.raws.between = this.spacesAndCommentsFromEnd(params);\n if ( params.length ) {\n node.raws.afterName = this.spacesAndCommentsFromStart(params);\n this.raw(node, 'params', params);\n if ( last ) {\n token = params[params.length - 1];\n node.source.end = { line: token[4], column: token[5] };\n this.spaces = node.raws.between;\n node.raws.between = '';\n }\n } else {\n node.raws.afterName = '';\n node.params = '';\n }\n\n if ( open ) {\n node.nodes = [];\n this.current = node;\n }\n }\n\n end(token) {\n if ( this.current.nodes && this.current.nodes.length ) {\n this.current.raws.semicolon = this.semicolon;\n }\n this.semicolon = false;\n\n this.current.raws.after = (this.current.raws.after || '') + this.spaces;\n this.spaces = '';\n\n if ( this.current.parent ) {\n this.current.source.end = { line: token[2], column: token[3] };\n this.current = this.current.parent;\n } else {\n this.unexpectedClose(token);\n }\n }\n\n endFile() {\n if ( this.current.parent ) this.unclosedBlock();\n if ( this.current.nodes && this.current.nodes.length ) {\n this.current.raws.semicolon = this.semicolon;\n }\n this.current.raws.after = (this.current.raws.after || '') + this.spaces;\n }\n\n freeSemicolon(token) {\n this.spaces += token[1];\n if ( this.current.nodes ) {\n let prev = this.current.nodes[this.current.nodes.length - 1];\n if ( prev && prev.type === 'rule' && !prev.raws.ownSemicolon ) {\n prev.raws.ownSemicolon = this.spaces;\n this.spaces = '';\n }\n }\n }\n\n // Helpers\n\n init(node, line, column) {\n this.current.push(node);\n\n node.source = { start: { line, column }, input: this.input };\n node.raws.before = this.spaces;\n this.spaces = '';\n if ( node.type !== 'comment' ) this.semicolon = false;\n }\n\n raw(node, prop, tokens) {\n let token, type;\n let length = tokens.length;\n let value = '';\n let clean = true;\n let next, prev;\n const pattern = /^([.|#])?([\\w])+/i;\n\n for ( let i = 0; i < length; i += 1 ) {\n token = tokens[i];\n type = token[0];\n\n if ( type === 'comment' && node.type === 'rule' ) {\n prev = tokens[i - 1];\n next = tokens[i + 1];\n\n if (\n prev[0] !== 'space' &&\n next[0] !== 'space' &&\n pattern.test(prev[1]) &&\n pattern.test(next[1])\n ) {\n value += token[1];\n } else {\n clean = false;\n }\n\n continue;\n }\n\n if ( type === 'comment' || type === 'space' && i === length - 1 ) {\n clean = false;\n } else {\n value += token[1];\n }\n }\n if ( !clean ) {\n let raw = tokens.reduce( (all, i) => all + i[1], '');\n node.raws[prop] = { value, raw };\n }\n node[prop] = value;\n }\n\n spacesAndCommentsFromEnd(tokens) {\n let lastTokenType;\n let spaces = '';\n while ( tokens.length ) {\n lastTokenType = tokens[tokens.length - 1][0];\n if ( lastTokenType !== 'space' &&\n lastTokenType !== 'comment' ) break;\n spaces = tokens.pop()[1] + spaces;\n }\n return spaces;\n }\n\n spacesAndCommentsFromStart(tokens) {\n let next;\n let spaces = '';\n while ( tokens.length ) {\n next = tokens[0][0];\n if ( next !== 'space' && next !== 'comment' ) break;\n spaces += tokens.shift()[1];\n }\n return spaces;\n }\n\n spacesFromEnd(tokens) {\n let lastTokenType;\n let spaces = '';\n while ( tokens.length ) {\n lastTokenType = tokens[tokens.length - 1][0];\n if ( lastTokenType !== 'space' ) break;\n spaces = tokens.pop()[1] + spaces;\n }\n return spaces;\n }\n\n stringFrom(tokens, from) {\n let result = '';\n for ( let i = from; i < tokens.length; i++ ) {\n result += tokens[i][1];\n }\n tokens.splice(from, tokens.length - from);\n return result;\n }\n\n colon(tokens) {\n let brackets = 0;\n let token, type, prev;\n for ( let i = 0; i < tokens.length; i++ ) {\n token = tokens[i];\n type = token[0];\n\n if ( type === '(' ) {\n brackets += 1;\n } else if ( type === ')' ) {\n brackets -= 1;\n } else if ( brackets === 0 && type === ':' ) {\n if ( !prev ) {\n this.doubleColon(token);\n } else if ( prev[0] === 'word' && prev[1] === 'progid' ) {\n continue;\n } else {\n return i;\n }\n }\n\n prev = token;\n }\n return false;\n }\n\n // Errors\n\n unclosedBracket(bracket) {\n throw this.input.error('Unclosed bracket', bracket[2], bracket[3]);\n }\n\n unknownWord(tokens) {\n throw this.input.error('Unknown word', tokens[0][2], tokens[0][3]);\n }\n\n unexpectedClose(token) {\n throw this.input.error('Unexpected }', token[2], token[3]);\n }\n\n unclosedBlock() {\n let pos = this.current.source.start;\n throw this.input.error('Unclosed block', pos.line, pos.column);\n }\n\n doubleColon(token) {\n throw this.input.error('Double colon', token[2], token[3]);\n }\n\n unnamedAtrule(node, token) {\n throw this.input.error('At-rule without name', token[2], token[3]);\n }\n\n precheckMissedSemicolon(tokens) {\n // Hook for Safe Parser\n tokens;\n }\n\n checkMissedSemicolon(tokens) {\n let colon = this.colon(tokens);\n if ( colon === false ) return;\n\n let founded = 0;\n let token;\n for ( let j = colon - 1; j >= 0; j-- ) {\n token = tokens[j];\n if ( token[0] !== 'space' ) {\n founded += 1;\n if ( founded === 2 ) break;\n }\n }\n throw this.input.error('Missed semicolon', token[2], token[3]);\n }\n\n}\n","import Parser from './parser';\nimport Input from './input';\n\nexport default function parse(css, opts) {\n if ( opts && opts.safe ) {\n throw new Error('Option safe was removed. ' +\n 'Use parser: require(\"postcss-safe-parser\")');\n }\n\n let input = new Input(css, opts);\n let parser = new Parser(input);\n try {\n parser.parse();\n } catch (e) {\n if ( e.name === 'CssSyntaxError' && opts && opts.from ) {\n if ( /\\.scss$/i.test(opts.from) ) {\n e.message += '\\nYou tried to parse SCSS with ' +\n 'the standard CSS parser; ' +\n 'try again with the postcss-scss parser';\n } else if ( /\\.sass/i.test(opts.from) ) {\n e.message += '\\nYou tried to parse Sass with ' +\n 'the standard CSS parser; ' +\n 'try again with the postcss-sass parser';\n } else if ( /\\.less$/i.test(opts.from) ) {\n e.message += '\\nYou tried to parse Less with ' +\n 'the standard CSS parser; ' +\n 'try again with the postcss-less parser';\n }\n }\n throw e;\n }\n\n return parser.root;\n}\n","import MapGenerator from './map-generator';\nimport stringify from './stringify';\nimport warnOnce from './warn-once';\nimport Result from './result';\nimport parse from './parse';\n\nfunction isPromise(obj) {\n return typeof obj === 'object' && typeof obj.then === 'function';\n}\n\n/**\n * A Promise proxy for the result of PostCSS transformations.\n *\n * A `LazyResult` instance is returned by {@link Processor#process}.\n *\n * @example\n * const lazy = postcss([cssnext]).process(css);\n */\nclass LazyResult {\n\n constructor(processor, css, opts) {\n this.stringified = false;\n this.processed = false;\n\n let root;\n if ( typeof css === 'object' && css !== null && css.type === 'root' ) {\n root = css;\n } else if ( css instanceof LazyResult || css instanceof Result ) {\n root = css.root;\n if ( css.map ) {\n if ( typeof opts.map === 'undefined' ) opts.map = { };\n if ( !opts.map.inline ) opts.map.inline = false;\n opts.map.prev = css.map;\n }\n } else {\n let parser = parse;\n if ( opts.syntax ) parser = opts.syntax.parse;\n if ( opts.parser ) parser = opts.parser;\n if ( parser.parse ) parser = parser.parse;\n\n try {\n root = parser(css, opts);\n } catch (error) {\n this.error = error;\n }\n }\n\n this.result = new Result(processor, root, opts);\n }\n\n /**\n * Returns a {@link Processor} instance, which will be used\n * for CSS transformations.\n * @type {Processor}\n */\n get processor() {\n return this.result.processor;\n }\n\n /**\n * Options from the {@link Processor#process} call.\n * @type {processOptions}\n */\n get opts() {\n return this.result.opts;\n }\n\n /**\n * Processes input CSS through synchronous plugins, converts `Root`\n * to a CSS string and returns {@link Result#css}.\n *\n * This property will only work with synchronous plugins.\n * If the processor contains any asynchronous plugins\n * it will throw an error. This is why this method is only\n * for debug purpose, you should always use {@link LazyResult#then}.\n *\n * @type {string}\n * @see Result#css\n */\n get css() {\n return this.stringify().css;\n }\n\n /**\n * An alias for the `css` property. Use it with syntaxes\n * that generate non-CSS output.\n *\n * This property will only work with synchronous plugins.\n * If the processor contains any asynchronous plugins\n * it will throw an error. This is why this method is only\n * for debug purpose, you should always use {@link LazyResult#then}.\n *\n * @type {string}\n * @see Result#content\n */\n get content() {\n return this.stringify().content;\n }\n\n /**\n * Processes input CSS through synchronous plugins\n * and returns {@link Result#map}.\n *\n * This property will only work with synchronous plugins.\n * If the processor contains any asynchronous plugins\n * it will throw an error. This is why this method is only\n * for debug purpose, you should always use {@link LazyResult#then}.\n *\n * @type {SourceMapGenerator}\n * @see Result#map\n */\n get map() {\n return this.stringify().map;\n }\n\n /**\n * Processes input CSS through synchronous plugins\n * and returns {@link Result#root}.\n *\n * This property will only work with synchronous plugins. If the processor\n * contains any asynchronous plugins it will throw an error.\n *\n * This is why this method is only for debug purpose,\n * you should always use {@link LazyResult#then}.\n *\n * @type {Root}\n * @see Result#root\n */\n get root() {\n return this.sync().root;\n }\n\n /**\n * Processes input CSS through synchronous plugins\n * and returns {@link Result#messages}.\n *\n * This property will only work with synchronous plugins. If the processor\n * contains any asynchronous plugins it will throw an error.\n *\n * This is why this method is only for debug purpose,\n * you should always use {@link LazyResult#then}.\n *\n * @type {Message[]}\n * @see Result#messages\n */\n get messages() {\n return this.sync().messages;\n }\n\n /**\n * Processes input CSS through synchronous plugins\n * and calls {@link Result#warnings()}.\n *\n * @return {Warning[]} warnings from plugins\n */\n warnings() {\n return this.sync().warnings();\n }\n\n /**\n * Alias for the {@link LazyResult#css} property.\n *\n * @example\n * lazy + '' === lazy.css;\n *\n * @return {string} output CSS\n */\n toString() {\n return this.css;\n }\n\n /**\n * Processes input CSS through synchronous and asynchronous plugins\n * and calls `onFulfilled` with a Result instance. If a plugin throws\n * an error, the `onRejected` callback will be executed.\n *\n * It implements standard Promise API.\n *\n * @param {onFulfilled} onFulfilled - callback will be executed\n * when all plugins will finish work\n * @param {onRejected} onRejected - callback will be executed on any error\n *\n * @return {Promise} Promise API to make queue\n *\n * @example\n * postcss([cssnext]).process(css, { from: cssPath }).then(result => {\n * console.log(result.css);\n * });\n */\n then(onFulfilled, onRejected) {\n if (!('from' in this.opts)) {\n warnOnce(\n 'Without `from` option PostCSS could generate wrong ' +\n 'source map and will not find Browserslist config. ' +\n 'Set it to CSS file path or to `undefined` to prevent ' +\n 'this warning.'\n );\n }\n return this.async().then(onFulfilled, onRejected);\n }\n\n /**\n * Processes input CSS through synchronous and asynchronous plugins\n * and calls onRejected for each error thrown in any plugin.\n *\n * It implements standard Promise API.\n *\n * @param {onRejected} onRejected - callback will be executed on any error\n *\n * @return {Promise} Promise API to make queue\n *\n * @example\n * postcss([cssnext]).process(css).then(result => {\n * console.log(result.css);\n * }).catch(error => {\n * console.error(error);\n * });\n */\n catch(onRejected) {\n return this.async().catch(onRejected);\n }\n\n handleError(error, plugin) {\n try {\n this.error = error;\n if ( error.name === 'CssSyntaxError' && !error.plugin ) {\n error.plugin = plugin.postcssPlugin;\n error.setMessage();\n } else if ( plugin.postcssVersion ) {\n let pluginName = plugin.postcssPlugin;\n let pluginVer = plugin.postcssVersion;\n let runtimeVer = this.result.processor.version;\n let a = pluginVer.split('.');\n let b = runtimeVer.split('.');\n\n if ( a[0] !== b[0] || parseInt(a[1]) > parseInt(b[1]) ) {\n console.error(\n 'Unknown error from PostCSS plugin. ' +\n 'Your current PostCSS version ' +\n 'is ' + runtimeVer + ', but ' + pluginName + ' ' +\n 'uses ' + pluginVer + '. Perhaps this is ' +\n 'the source of the error below.');\n }\n }\n } catch (err) {\n if ( console && console.error ) console.error(err);\n }\n }\n\n asyncTick(resolve, reject) {\n if ( this.plugin >= this.processor.plugins.length ) {\n this.processed = true;\n return resolve();\n }\n\n try {\n let plugin = this.processor.plugins[this.plugin];\n let promise = this.run(plugin);\n this.plugin += 1;\n\n if ( isPromise(promise) ) {\n promise.then( () => {\n this.asyncTick(resolve, reject);\n }).catch( error => {\n this.handleError(error, plugin);\n this.processed = true;\n reject(error);\n });\n } else {\n this.asyncTick(resolve, reject);\n }\n\n } catch (error) {\n this.processed = true;\n reject(error);\n }\n }\n\n async() {\n if ( this.processed ) {\n return new Promise( (resolve, reject) => {\n if ( this.error ) {\n reject(this.error);\n } else {\n resolve(this.stringify());\n }\n });\n }\n if ( this.processing ) {\n return this.processing;\n }\n\n this.processing = new Promise( (resolve, reject) => {\n if ( this.error ) return reject(this.error);\n this.plugin = 0;\n this.asyncTick(resolve, reject);\n }).then( () => {\n this.processed = true;\n return this.stringify();\n });\n\n return this.processing;\n }\n\n sync() {\n if ( this.processed ) return this.result;\n this.processed = true;\n\n if ( this.processing ) {\n throw new Error(\n 'Use process(css).then(cb) to work with async plugins');\n }\n\n if ( this.error ) throw this.error;\n\n for ( let plugin of this.result.processor.plugins ) {\n let promise = this.run(plugin);\n if ( isPromise(promise) ) {\n throw new Error(\n 'Use process(css).then(cb) to work with async plugins');\n }\n }\n\n return this.result;\n }\n\n run(plugin) {\n this.result.lastPlugin = plugin;\n\n try {\n return plugin(this.result.root, this.result);\n } catch (error) {\n this.handleError(error, plugin);\n throw error;\n }\n }\n\n stringify() {\n if ( this.stringified ) return this.result;\n this.stringified = true;\n\n this.sync();\n\n let opts = this.result.opts;\n let str = stringify;\n if ( opts.syntax ) str = opts.syntax.stringify;\n if ( opts.stringifier ) str = opts.stringifier;\n if ( str.stringify ) str = str.stringify;\n\n let map = new MapGenerator(str, this.result.root, this.result.opts);\n let data = map.generate();\n this.result.css = data[0];\n this.result.map = data[1];\n\n return this.result;\n }\n\n}\n\nexport default LazyResult;\n\n/**\n * @callback onFulfilled\n * @param {Result} result\n */\n\n/**\n * @callback onRejected\n * @param {Error} error\n */\n","import LazyResult from './lazy-result';\n\n/**\n * Contains plugins to process CSS. Create one `Processor` instance,\n * initialize its plugins, and then use that instance on numerous CSS files.\n *\n * @example\n * const processor = postcss([autoprefixer, precss]);\n * processor.process(css1).then(result => console.log(result.css));\n * processor.process(css2).then(result => console.log(result.css));\n */\nclass Processor {\n\n /**\n * @param {Array.<Plugin|pluginFunction>|Processor} plugins - PostCSS\n * plugins. See {@link Processor#use} for plugin format.\n */\n constructor(plugins = []) {\n /**\n * @member {string} - Current PostCSS version.\n *\n * @example\n * if ( result.processor.version.split('.')[0] !== '6' ) {\n * throw new Error('This plugin works only with PostCSS 6');\n * }\n */\n this.version = '6.0.23';\n /**\n * @member {pluginFunction[]} - Plugins added to this processor.\n *\n * @example\n * const processor = postcss([autoprefixer, precss]);\n * processor.plugins.length //=> 2\n */\n this.plugins = this.normalize(plugins);\n }\n\n /**\n * Adds a plugin to be used as a CSS processor.\n *\n * PostCSS plugin can be in 4 formats:\n * * A plugin created by {@link postcss.plugin} method.\n * * A function. PostCSS will pass the function a @{link Root}\n * as the first argument and current {@link Result} instance\n * as the second.\n * * An object with a `postcss` method. PostCSS will use that method\n * as described in #2.\n * * Another {@link Processor} instance. PostCSS will copy plugins\n * from that instance into this one.\n *\n * Plugins can also be added by passing them as arguments when creating\n * a `postcss` instance (see [`postcss(plugins)`]).\n *\n * Asynchronous plugins should return a `Promise` instance.\n *\n * @param {Plugin|pluginFunction|Processor} plugin - PostCSS plugin\n * or {@link Processor}\n * with plugins\n *\n * @example\n * const processor = postcss()\n * .use(autoprefixer)\n * .use(precss);\n *\n * @return {Processes} current processor to make methods chain\n */\n use(plugin) {\n this.plugins = this.plugins.concat(this.normalize([plugin]));\n return this;\n }\n\n /**\n * Parses source CSS and returns a {@link LazyResult} Promise proxy.\n * Because some plugins can be asynchronous it doesn’t make\n * any transformations. Transformations will be applied\n * in the {@link LazyResult} methods.\n *\n * @param {string|toString|Result} css - String with input CSS or\n * any object with a `toString()`\n * method, like a Buffer.\n * Optionally, send a {@link Result}\n * instance and the processor will\n * take the {@link Root} from it.\n * @param {processOptions} [opts] - options\n *\n * @return {LazyResult} Promise proxy\n *\n * @example\n * processor.process(css, { from: 'a.css', to: 'a.out.css' })\n * .then(result => {\n * console.log(result.css);\n * });\n */\n process(css, opts = { }) {\n return new LazyResult(this, css, opts);\n }\n\n normalize(plugins) {\n let normalized = [];\n for ( let i of plugins ) {\n if ( i.postcss ) i = i.postcss;\n\n if ( typeof i === 'object' && Array.isArray(i.plugins) ) {\n normalized = normalized.concat(i.plugins);\n } else if ( typeof i === 'function' ) {\n normalized.push(i);\n } else if ( typeof i === 'object' && (i.parse || i.stringify) ) {\n throw new Error('PostCSS syntaxes cannot be used as plugins. ' +\n 'Instead, please use one of the ' +\n 'syntax/parser/stringifier options as ' +\n 'outlined in your PostCSS ' +\n 'runner documentation.');\n } else {\n throw new Error(i + ' is not a PostCSS plugin');\n }\n }\n return normalized;\n }\n\n}\n\nexport default Processor;\n\n/**\n * @callback builder\n * @param {string} part - part of generated CSS connected to this node\n * @param {Node} node - AST node\n * @param {\"start\"|\"end\"} [type] - node’s part type\n */\n\n/**\n * @callback parser\n *\n * @param {string|toString} css - string with input CSS or any object\n * with toString() method, like a Buffer\n * @param {processOptions} [opts] - options with only `from` and `map` keys\n *\n * @return {Root} PostCSS AST\n */\n\n/**\n * @callback stringifier\n *\n * @param {Node} node - start node for stringifing. Usually {@link Root}.\n * @param {builder} builder - function to concatenate CSS from node’s parts\n * or generate string and source map\n *\n * @return {void}\n */\n\n/**\n * @typedef {object} syntax\n * @property {parser} parse - function to generate AST by string\n * @property {stringifier} stringify - function to generate string by AST\n */\n\n/**\n * @typedef {object} toString\n * @property {function} toString\n */\n\n/**\n * @callback pluginFunction\n * @param {Root} root - parsed input CSS\n * @param {Result} result - result to set warnings or check other plugins\n */\n\n/**\n * @typedef {object} Plugin\n * @property {function} postcss - PostCSS plugin function\n */\n\n/**\n * @typedef {object} processOptions\n * @property {string} from - the path of the CSS source file.\n * You should always set `from`,\n * because it is used in source map\n * generation and syntax error messages.\n * @property {string} to - the path where you’ll put the output\n * CSS file. You should always set `to`\n * to generate correct source maps.\n * @property {parser} parser - function to generate AST by string\n * @property {stringifier} stringifier - class to generate string by AST\n * @property {syntax} syntax - object with `parse` and `stringify`\n * @property {object} map - source map options\n * @property {boolean} map.inline - does source map should\n * be embedded in the output\n * CSS as a base64-encoded\n * comment\n * @property {string|object|false|function} map.prev - source map content\n * from a previous\n * processing step\n * (for example, Sass).\n * PostCSS will try to find\n * previous map\n * automatically, so you\n * could disable it by\n * `false` value.\n * @property {boolean} map.sourcesContent - does PostCSS should set\n * the origin content to map\n * @property {string|false} map.annotation - does PostCSS should set\n * annotation comment to map\n * @property {string} map.from - override `from` in map’s\n * `sources`\n */\n","/**\n * Contains helpers for working with vendor prefixes.\n *\n * @example\n * const vendor = postcss.vendor;\n *\n * @namespace vendor\n */\nlet vendor = {\n\n /**\n * Returns the vendor prefix extracted from an input string.\n *\n * @param {string} prop - string with or without vendor prefix\n *\n * @return {string} vendor prefix or empty string\n *\n * @example\n * postcss.vendor.prefix('-moz-tab-size') //=> '-moz-'\n * postcss.vendor.prefix('tab-size') //=> ''\n */\n prefix(prop) {\n let match = prop.match(/^(-\\w+-)/);\n if ( match ) {\n return match[0];\n } else {\n return '';\n }\n },\n\n /**\n * Returns the input string stripped of its vendor prefix.\n *\n * @param {string} prop - string with or without vendor prefix\n *\n * @return {string} string name without vendor prefixes\n *\n * @example\n * postcss.vendor.unprefixed('-moz-tab-size') //=> 'tab-size'\n */\n unprefixed(prop) {\n return prop.replace(/^-\\w+-/, '');\n }\n\n};\n\nexport default vendor;\n","import Declaration from './declaration';\nimport Processor from './processor';\nimport stringify from './stringify';\nimport Comment from './comment';\nimport AtRule from './at-rule';\nimport vendor from './vendor';\nimport parse from './parse';\nimport list from './list';\nimport Rule from './rule';\nimport Root from './root';\n\n/**\n * Create a new {@link Processor} instance that will apply `plugins`\n * as CSS processors.\n *\n * @param {Array.<Plugin|pluginFunction>|Processor} plugins - PostCSS\n * plugins. See {@link Processor#use} for plugin format.\n *\n * @return {Processor} Processor to process multiple CSS\n *\n * @example\n * import postcss from 'postcss';\n *\n * postcss(plugins).process(css, { from, to }).then(result => {\n * console.log(result.css);\n * });\n *\n * @namespace postcss\n */\nfunction postcss(...plugins) {\n if ( plugins.length === 1 && Array.isArray(plugins[0]) ) {\n plugins = plugins[0];\n }\n return new Processor(plugins);\n}\n\n/**\n * Creates a PostCSS plugin with a standard API.\n *\n * The newly-wrapped function will provide both the name and PostCSS\n * version of the plugin.\n *\n * ```js\n * const processor = postcss([replace]);\n * processor.plugins[0].postcssPlugin //=> 'postcss-replace'\n * processor.plugins[0].postcssVersion //=> '5.1.0'\n * ```\n *\n * The plugin function receives 2 arguments: {@link Root}\n * and {@link Result} instance. The function should mutate the provided\n * `Root` node. Alternatively, you can create a new `Root` node\n * and override the `result.root` property.\n *\n * ```js\n * const cleaner = postcss.plugin('postcss-cleaner', () => {\n * return (root, result) => {\n * result.root = postcss.root();\n * };\n * });\n * ```\n *\n * As a convenience, plugins also expose a `process` method so that you can use\n * them as standalone tools.\n *\n * ```js\n * cleaner.process(css, processOpts, pluginOpts);\n * // This is equivalent to:\n * postcss([ cleaner(pluginOpts) ]).process(css, processOpts);\n * ```\n *\n * Asynchronous plugins should return a `Promise` instance.\n *\n * ```js\n * postcss.plugin('postcss-import', () => {\n * return (root, result) => {\n * return new Promise( (resolve, reject) => {\n * fs.readFile('base.css', (base) => {\n * root.prepend(base);\n * resolve();\n * });\n * });\n * };\n * });\n * ```\n *\n * Add warnings using the {@link Node#warn} method.\n * Send data to other plugins using the {@link Result#messages} array.\n *\n * ```js\n * postcss.plugin('postcss-caniuse-test', () => {\n * return (root, result) => {\n * root.walkDecls(decl => {\n * if ( !caniuse.support(decl.prop) ) {\n * decl.warn(result, 'Some browsers do not support ' + decl.prop);\n * }\n * });\n * };\n * });\n * ```\n *\n * @param {string} name - PostCSS plugin name. Same as in `name`\n * property in `package.json`. It will be saved\n * in `plugin.postcssPlugin` property.\n * @param {function} initializer - will receive plugin options\n * and should return {@link pluginFunction}\n *\n * @return {Plugin} PostCSS plugin\n */\npostcss.plugin = function plugin(name, initializer) {\n let creator = function (...args) {\n let transformer = initializer(...args);\n transformer.postcssPlugin = name;\n transformer.postcssVersion = (new Processor()).version;\n return transformer;\n };\n\n let cache;\n Object.defineProperty(creator, 'postcss', {\n get() {\n if ( !cache ) cache = creator();\n return cache;\n }\n });\n\n creator.process = function (css, processOpts, pluginOpts) {\n return postcss([ creator(pluginOpts) ]).process(css, processOpts);\n };\n\n return creator;\n};\n\n/**\n * Default function to convert a node tree into a CSS string.\n *\n * @param {Node} node - start node for stringifing. Usually {@link Root}.\n * @param {builder} builder - function to concatenate CSS from node’s parts\n * or generate string and source map\n *\n * @return {void}\n *\n * @function\n */\npostcss.stringify = stringify;\n\n/**\n * Parses source css and returns a new {@link Root} node,\n * which contains the source CSS nodes.\n *\n * @param {string|toString} css - string with input CSS or any object\n * with toString() method, like a Buffer\n * @param {processOptions} [opts] - options with only `from` and `map` keys\n *\n * @return {Root} PostCSS AST\n *\n * @example\n * // Simple CSS concatenation with source map support\n * const root1 = postcss.parse(css1, { from: file1 });\n * const root2 = postcss.parse(css2, { from: file2 });\n * root1.append(root2).toResult().css;\n *\n * @function\n */\npostcss.parse = parse;\n\n/**\n * @member {vendor} - Contains the {@link vendor} module.\n *\n * @example\n * postcss.vendor.unprefixed('-moz-tab') //=> ['tab']\n */\npostcss.vendor = vendor;\n\n/**\n * @member {list} - Contains the {@link list} module.\n *\n * @example\n * postcss.list.space('5px calc(10% + 5px)') //=> ['5px', 'calc(10% + 5px)']\n */\npostcss.list = list;\n\n/**\n * Creates a new {@link Comment} node.\n *\n * @param {object} [defaults] - properties for the new node.\n *\n * @return {Comment} new Comment node\n *\n * @example\n * postcss.comment({ text: 'test' })\n */\npostcss.comment = defaults => new Comment(defaults);\n\n/**\n * Creates a new {@link AtRule} node.\n *\n * @param {object} [defaults] - properties for the new node.\n *\n * @return {AtRule} new AtRule node\n *\n * @example\n * postcss.atRule({ name: 'charset' }).toString() //=> \"@charset\"\n */\npostcss.atRule = defaults => new AtRule(defaults);\n\n/**\n * Creates a new {@link Declaration} node.\n *\n * @param {object} [defaults] - properties for the new node.\n *\n * @return {Declaration} new Declaration node\n *\n * @example\n * postcss.decl({ prop: 'color', value: 'red' }).toString() //=> \"color: red\"\n */\npostcss.decl = defaults => new Declaration(defaults);\n\n/**\n * Creates a new {@link Rule} node.\n *\n * @param {object} [defaults] - properties for the new node.\n *\n * @return {Rule} new Rule node\n *\n * @example\n * postcss.rule({ selector: 'a' }).toString() //=> \"a {\\n}\"\n */\npostcss.rule = defaults => new Rule(defaults);\n\n/**\n * Creates a new {@link Root} node.\n *\n * @param {object} [defaults] - properties for the new node.\n *\n * @return {Root} new Root node\n *\n * @example\n * postcss.root({ after: '\\n' }).toString() //=> \"\\n\"\n */\npostcss.root = defaults => new Root(defaults);\n\nexport default postcss;\n","/*! https://mths.be/punycode v1.4.1 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow new RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t counter = 0,\n\t\t length = string.length,\n\t\t value,\n\t\t extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t// 0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * https://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t inputLength = input.length,\n\t\t out,\n\t\t i = 0,\n\t\t n = initialN,\n\t\t bias = initialBias,\n\t\t basic,\n\t\t j,\n\t\t index,\n\t\t oldi,\n\t\t w,\n\t\t k,\n\t\t digit,\n\t\t t,\n\t\t /** Cached calculation results */\n\t\t baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t delta,\n\t\t handledCPCount,\n\t\t basicLength,\n\t\t bias,\n\t\t j,\n\t\t m,\n\t\t q,\n\t\t k,\n\t\t t,\n\t\t currentValue,\n\t\t output = [],\n\t\t /** `inputLength` will hold the number of code points in `input`. */\n\t\t inputLength,\n\t\t /** Cached calculation results */\n\t\t handledCPCountPlusOne,\n\t\t baseMinusT,\n\t\t qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.4.1',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) {\n\t\t\t// in Node.js, io.js, or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else {\n\t\t\t// in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\n","'use strict';\n\nmodule.exports = {\n isString: function(arg) {\n return typeof(arg) === 'string';\n },\n isObject: function(arg) {\n return typeof(arg) === 'object' && arg !== null;\n },\n isNull: function(arg) {\n return arg === null;\n },\n isNullOrUndefined: function(arg) {\n return arg == null;\n }\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n// If obj.hasOwnProperty has been overridden, then calling\n// obj.hasOwnProperty(prop) will break.\n// See: https://github.com/joyent/node/issues/1707\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = function(qs, sep, eq, options) {\n sep = sep || '&';\n eq = eq || '=';\n var obj = {};\n\n if (typeof qs !== 'string' || qs.length === 0) {\n return obj;\n }\n\n var regexp = /\\+/g;\n qs = qs.split(sep);\n\n var maxKeys = 1000;\n if (options && typeof options.maxKeys === 'number') {\n maxKeys = options.maxKeys;\n }\n\n var len = qs.length;\n // maxKeys <= 0 means that we should not limit keys count\n if (maxKeys > 0 && len > maxKeys) {\n len = maxKeys;\n }\n\n for (var i = 0; i < len; ++i) {\n var x = qs[i].replace(regexp, '%20'),\n idx = x.indexOf(eq),\n kstr, vstr, k, v;\n\n if (idx >= 0) {\n kstr = x.substr(0, idx);\n vstr = x.substr(idx + 1);\n } else {\n kstr = x;\n vstr = '';\n }\n\n k = decodeURIComponent(kstr);\n v = decodeURIComponent(vstr);\n\n if (!hasOwnProperty(obj, k)) {\n obj[k] = v;\n } else if (isArray(obj[k])) {\n obj[k].push(v);\n } else {\n obj[k] = [obj[k], v];\n }\n }\n\n return obj;\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar stringifyPrimitive = function(v) {\n switch (typeof v) {\n case 'string':\n return v;\n\n case 'boolean':\n return v ? 'true' : 'false';\n\n case 'number':\n return isFinite(v) ? v : '';\n\n default:\n return '';\n }\n};\n\nmodule.exports = function(obj, sep, eq, name) {\n sep = sep || '&';\n eq = eq || '=';\n if (obj === null) {\n obj = undefined;\n }\n\n if (typeof obj === 'object') {\n return map(objectKeys(obj), function(k) {\n var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n if (isArray(obj[k])) {\n return map(obj[k], function(v) {\n return ks + encodeURIComponent(stringifyPrimitive(v));\n }).join(sep);\n } else {\n return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n }\n }).join(sep);\n\n }\n\n if (!name) return '';\n return encodeURIComponent(stringifyPrimitive(name)) + eq +\n encodeURIComponent(stringifyPrimitive(obj));\n};\n\nvar isArray = Array.isArray || function (xs) {\n return Object.prototype.toString.call(xs) === '[object Array]';\n};\n\nfunction map (xs, f) {\n if (xs.map) return xs.map(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n res.push(f(xs[i], i));\n }\n return res;\n}\n\nvar objectKeys = Object.keys || function (obj) {\n var res = [];\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) res.push(key);\n }\n return res;\n};\n","'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar punycode = require('punycode');\nvar util = require('./util');\n\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\n\nfunction Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.host = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.query = null;\n this.pathname = null;\n this.path = null;\n this.href = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape),\n hostEndingChars = ['/', '?', '#'],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n unsafeProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that never have a hostname.\n hostlessProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n 'http': true,\n 'https': true,\n 'ftp': true,\n 'gopher': true,\n 'file': true,\n 'http:': true,\n 'https:': true,\n 'ftp:': true,\n 'gopher:': true,\n 'file:': true\n },\n querystring = require('querystring');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && util.isObject(url) && url instanceof Url) return url;\n\n var u = new Url;\n u.parse(url, parseQueryString, slashesDenoteHost);\n return u;\n}\n\nUrl.prototype.parse = function(url, parseQueryString, slashesDenoteHost) {\n if (!util.isString(url)) {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\n\n // Copy chrome, IE, opera backslash-handling behavior.\n // Back slashes before the query string get converted to forward slashes\n // See: https://code.google.com/p/chromium/issues/detail?id=25916\n var queryIndex = url.indexOf('?'),\n splitter =\n (queryIndex !== -1 && queryIndex < url.indexOf('#')) ? '?' : '#',\n uSplit = url.split(splitter),\n slashRegex = /\\\\/g;\n uSplit[0] = uSplit[0].replace(slashRegex, '/');\n url = uSplit.join(splitter);\n\n var rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split('#').length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.path = rest;\n this.href = rest;\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n if (parseQueryString) {\n this.query = querystring.parse(this.search.substr(1));\n } else {\n this.query = this.search.substr(1);\n }\n } else if (parseQueryString) {\n this.search = '';\n this.query = {};\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n var lowerProto = proto.toLowerCase();\n this.protocol = lowerProto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n var slashes = rest.substr(0, 2) === '//';\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (!hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))) {\n\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (var i = 0; i < hostEndingChars.length; i++) {\n var hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = decodeURIComponent(auth);\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (var i = 0; i < nonHostChars.length; i++) {\n var hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1)\n hostEnd = rest.length;\n\n this.host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost();\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || '';\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname = this.hostname[0] === '[' &&\n this.hostname[this.hostname.length - 1] === ']';\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (var i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) continue;\n if (!part.match(hostnamePartPattern)) {\n var newpart = '';\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += 'x';\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = '/' + notHost.join('.') + rest;\n }\n this.hostname = validParts.join('.');\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = '';\n } else {\n // hostnames are always lower case.\n this.hostname = this.hostname.toLowerCase();\n }\n\n if (!ipv6Hostname) {\n // IDNA Support: Returns a punycoded representation of \"domain\".\n // It only converts parts of the domain name that\n // have non-ASCII characters, i.e. it doesn't matter if\n // you call it with a domain that already is ASCII-only.\n this.hostname = punycode.toASCII(this.hostname);\n }\n\n var p = this.port ? ':' + this.port : '';\n var h = this.hostname || '';\n this.host = h + p;\n this.href += this.host;\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n if (rest[0] !== '/') {\n rest = '/' + rest;\n }\n }\n }\n\n // now rest is set to the post-host stuff.\n // chop off any delim chars.\n if (!unsafeProtocol[lowerProto]) {\n\n // First, make 100% sure that any \"autoEscape\" chars get\n // escaped, even if encodeURIComponent doesn't think they\n // need to be.\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1)\n continue;\n var esc = encodeURIComponent(ae);\n if (esc === ae) {\n esc = escape(ae);\n }\n rest = rest.split(ae).join(esc);\n }\n }\n\n\n // chop off from the tail first.\n var hash = rest.indexOf('#');\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf('?');\n if (qm !== -1) {\n this.search = rest.substr(qm);\n this.query = rest.substr(qm + 1);\n if (parseQueryString) {\n this.query = querystring.parse(this.query);\n }\n rest = rest.slice(0, qm);\n } else if (parseQueryString) {\n // no query string, but parseQueryString still requested\n this.search = '';\n this.query = {};\n }\n if (rest) this.pathname = rest;\n if (slashedProtocol[lowerProto] &&\n this.hostname && !this.pathname) {\n this.pathname = '/';\n }\n\n //to support http.request\n if (this.pathname || this.search) {\n var p = this.pathname || '';\n var s = this.search || '';\n this.path = p + s;\n }\n\n // finally, reconstruct the href based on what has been validated.\n this.href = this.format();\n return this;\n};\n\n// format a parsed object into a url string\nfunction urlFormat(obj) {\n // ensure it's an object, and not a string url.\n // If it's an obj, this is a no-op.\n // this way, you can call url_format() on strings\n // to clean up potentially wonky urls.\n if (util.isString(obj)) obj = urlParse(obj);\n if (!(obj instanceof Url)) return Url.prototype.format.call(obj);\n return obj.format();\n}\n\nUrl.prototype.format = function() {\n var auth = this.auth || '';\n if (auth) {\n auth = encodeURIComponent(auth);\n auth = auth.replace(/%3A/i, ':');\n auth += '@';\n }\n\n var protocol = this.protocol || '',\n pathname = this.pathname || '',\n hash = this.hash || '',\n host = false,\n query = '';\n\n if (this.host) {\n host = auth + this.host;\n } else if (this.hostname) {\n host = auth + (this.hostname.indexOf(':') === -1 ?\n this.hostname :\n '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query &&\n util.isObject(this.query) &&\n Object.keys(this.query).length) {\n query = querystring.stringify(this.query);\n }\n\n var search = this.search || (query && ('?' + query)) || '';\n\n if (protocol && protocol.substr(-1) !== ':') protocol += ':';\n\n // only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n // unless they had them to begin with.\n if (this.slashes ||\n (!protocol || slashedProtocol[protocol]) && host !== false) {\n host = '//' + (host || '');\n if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname;\n } else if (!host) {\n host = '';\n }\n\n if (hash && hash.charAt(0) !== '#') hash = '#' + hash;\n if (search && search.charAt(0) !== '?') search = '?' + search;\n\n pathname = pathname.replace(/[?#]/g, function(match) {\n return encodeURIComponent(match);\n });\n search = search.replace('#', '%23');\n\n return protocol + host + pathname + search + hash;\n};\n\nfunction urlResolve(source, relative) {\n return urlParse(source, false, true).resolve(relative);\n}\n\nUrl.prototype.resolve = function(relative) {\n return this.resolveObject(urlParse(relative, false, true)).format();\n};\n\nfunction urlResolveObject(source, relative) {\n if (!source) return relative;\n return urlParse(source, false, true).resolveObject(relative);\n}\n\nUrl.prototype.resolveObject = function(relative) {\n if (util.isString(relative)) {\n var rel = new Url();\n rel.parse(relative, false, true);\n relative = rel;\n }\n\n var result = new Url();\n var tkeys = Object.keys(this);\n for (var tk = 0; tk < tkeys.length; tk++) {\n var tkey = tkeys[tk];\n result[tkey] = this[tkey];\n }\n\n // hash is always overridden, no matter what.\n // even href=\"\" will remove it.\n result.hash = relative.hash;\n\n // if the relative url is empty, then there's nothing left to do here.\n if (relative.href === '') {\n result.href = result.format();\n return result;\n }\n\n // hrefs like //foo/bar always cut to the protocol.\n if (relative.slashes && !relative.protocol) {\n // take everything except the protocol from relative\n var rkeys = Object.keys(relative);\n for (var rk = 0; rk < rkeys.length; rk++) {\n var rkey = rkeys[rk];\n if (rkey !== 'protocol')\n result[rkey] = relative[rkey];\n }\n\n //urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] &&\n result.hostname && !result.pathname) {\n result.path = result.pathname = '/';\n }\n\n result.href = result.format();\n return result;\n }\n\n if (relative.protocol && relative.protocol !== result.protocol) {\n // if it's a known url protocol, then changing\n // the protocol does weird things\n // first, if it's not file:, then we MUST have a host,\n // and if there was a path\n // to begin with, then we MUST have a path.\n // if it is file:, then the host is dropped,\n // because that's known to be hostless.\n // anything else is assumed to be absolute.\n if (!slashedProtocol[relative.protocol]) {\n var keys = Object.keys(relative);\n for (var v = 0; v < keys.length; v++) {\n var k = keys[v];\n result[k] = relative[k];\n }\n result.href = result.format();\n return result;\n }\n\n result.protocol = relative.protocol;\n if (!relative.host && !hostlessProtocol[relative.protocol]) {\n var relPath = (relative.pathname || '').split('/');\n while (relPath.length && !(relative.host = relPath.shift()));\n if (!relative.host) relative.host = '';\n if (!relative.hostname) relative.hostname = '';\n if (relPath[0] !== '') relPath.unshift('');\n if (relPath.length < 2) relPath.unshift('');\n result.pathname = relPath.join('/');\n } else {\n result.pathname = relative.pathname;\n }\n result.search = relative.search;\n result.query = relative.query;\n result.host = relative.host || '';\n result.auth = relative.auth;\n result.hostname = relative.hostname || relative.host;\n result.port = relative.port;\n // to support http.request\n if (result.pathname || result.search) {\n var p = result.pathname || '';\n var s = result.search || '';\n result.path = p + s;\n }\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n }\n\n var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'),\n isRelAbs = (\n relative.host ||\n relative.pathname && relative.pathname.charAt(0) === '/'\n ),\n mustEndAbs = (isRelAbs || isSourceAbs ||\n (result.host && relative.pathname)),\n removeAllDots = mustEndAbs,\n srcPath = result.pathname && result.pathname.split('/') || [],\n relPath = relative.pathname && relative.pathname.split('/') || [],\n psychotic = result.protocol && !slashedProtocol[result.protocol];\n\n // if the url is a non-slashed url, then relative\n // links like ../.. should be able\n // to crawl up to the hostname, as well. This is strange.\n // result.protocol has already been set by now.\n // Later on, put the first path part into the host field.\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') srcPath[0] = result.host;\n else srcPath.unshift(result.host);\n }\n result.host = '';\n if (relative.protocol) {\n relative.hostname = null;\n relative.port = null;\n if (relative.host) {\n if (relPath[0] === '') relPath[0] = relative.host;\n else relPath.unshift(relative.host);\n }\n relative.host = null;\n }\n mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === '');\n }\n\n if (isRelAbs) {\n // it's absolute.\n result.host = (relative.host || relative.host === '') ?\n relative.host : result.host;\n result.hostname = (relative.hostname || relative.hostname === '') ?\n relative.hostname : result.hostname;\n result.search = relative.search;\n result.query = relative.query;\n srcPath = relPath;\n // fall through to the dot-handling below.\n } else if (relPath.length) {\n // it's relative\n // throw away the existing file, and take the new path instead.\n if (!srcPath) srcPath = [];\n srcPath.pop();\n srcPath = srcPath.concat(relPath);\n result.search = relative.search;\n result.query = relative.query;\n } else if (!util.isNullOrUndefined(relative.search)) {\n // just pull out the search.\n // like href='?foo'.\n // Put this after the other two cases because it simplifies the booleans\n if (psychotic) {\n result.hostname = result.host = srcPath.shift();\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n //to support http.request\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n // no path at all. easy.\n // we've already handled the other stuff above.\n result.pathname = null;\n //to support http.request\n if (result.search) {\n result.path = '/' + result.search;\n } else {\n result.path = null;\n }\n result.href = result.format();\n return result;\n }\n\n // if a url ENDs in . or .., then it must get a trailing slash.\n // however, if it ends in anything else non-slashy,\n // then it must NOT get a trailing slash.\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (\n (result.host || relative.host || srcPath.length > 1) &&\n (last === '.' || last === '..') || last === '');\n\n // strip single dots, resolve double dots to parent dir\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = srcPath.length; i >= 0; i--) {\n last = srcPath[i];\n if (last === '.') {\n srcPath.splice(i, 1);\n } else if (last === '..') {\n srcPath.splice(i, 1);\n up++;\n } else if (up) {\n srcPath.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (!mustEndAbs && !removeAllDots) {\n for (; up--; up) {\n srcPath.unshift('..');\n }\n }\n\n if (mustEndAbs && srcPath[0] !== '' &&\n (!srcPath[0] || srcPath[0].charAt(0) !== '/')) {\n srcPath.unshift('');\n }\n\n if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) {\n srcPath.push('');\n }\n\n var isAbsolute = srcPath[0] === '' ||\n (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = result.host = isAbsolute ? '' :\n srcPath.length ? srcPath.shift() : '';\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (!srcPath.length) {\n result.pathname = null;\n result.path = null;\n } else {\n result.pathname = srcPath.join('/');\n }\n\n //to support request.http\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.auth = relative.auth || result.auth;\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n};\n\nUrl.prototype.parseHost = function() {\n var host = this.host;\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== ':') {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) this.hostname = host;\n};\n","'use strict';\n\nvar htmlparser = require('htmlparser2');\nvar extend = require('xtend');\nvar quoteRegexp = require('lodash.escaperegexp');\nvar cloneDeep = require('lodash.clonedeep');\nvar mergeWith = require('lodash.mergewith');\nvar isString = require('lodash.isstring');\nvar isPlainObject = require('lodash.isplainobject');\nvar srcset = require('srcset');\nvar postcss = require('postcss');\nvar url = require('url');\n\nfunction each(obj, cb) {\n if (obj) Object.keys(obj).forEach(function (key) {\n cb(obj[key], key);\n });\n}\n\n// Avoid false positives with .__proto__, .hasOwnProperty, etc.\nfunction has(obj, key) {\n return {}.hasOwnProperty.call(obj, key);\n}\n\n// Returns those elements of `a` for which `cb(a)` returns truthy\nfunction filter(a, cb) {\n var n = [];\n each(a, function (v) {\n if (cb(v)) {\n n.push(v);\n }\n });\n return n;\n}\n\nmodule.exports = sanitizeHtml;\n\n// A valid attribute name.\n// We use a tolerant definition based on the set of strings defined by\n// html.spec.whatwg.org/multipage/parsing.html#before-attribute-name-state\n// and html.spec.whatwg.org/multipage/parsing.html#attribute-name-state .\n// The characters accepted are ones which can be appended to the attribute\n// name buffer without triggering a parse error:\n// * unexpected-equals-sign-before-attribute-name\n// * unexpected-null-character\n// * unexpected-character-in-attribute-name\n// We exclude the empty string because it's impossible to get to the after\n// attribute name state with an empty attribute name buffer.\nvar VALID_HTML_ATTRIBUTE_NAME = /^[^\\0\\t\\n\\f\\r /<=>]+$/;\n\n// Ignore the _recursing flag; it's there for recursive\n// invocation as a guard against this exploit:\n// https://github.com/fb55/htmlparser2/issues/105\n\nfunction sanitizeHtml(html, options, _recursing) {\n var result = '';\n\n function Frame(tag, attribs) {\n var that = this;\n this.tag = tag;\n this.attribs = attribs || {};\n this.tagPosition = result.length;\n this.text = ''; // Node inner text\n\n this.updateParentNodeText = function () {\n if (stack.length) {\n var parentFrame = stack[stack.length - 1];\n parentFrame.text += that.text;\n }\n };\n }\n\n if (!options) {\n options = sanitizeHtml.defaults;\n options.parser = htmlParserDefaults;\n } else {\n options = extend(sanitizeHtml.defaults, options);\n if (options.parser) {\n options.parser = extend(htmlParserDefaults, options.parser);\n } else {\n options.parser = htmlParserDefaults;\n }\n }\n\n // Tags that contain something other than HTML, or where discarding\n // the text when the tag is disallowed makes sense for other reasons.\n // If we are not allowing these tags, we should drop their content too.\n // For other tags you would drop the tag but keep its content.\n var nonTextTagsArray = options.nonTextTags || ['script', 'style', 'textarea'];\n var allowedAttributesMap;\n var allowedAttributesGlobMap;\n if (options.allowedAttributes) {\n allowedAttributesMap = {};\n allowedAttributesGlobMap = {};\n each(options.allowedAttributes, function (attributes, tag) {\n allowedAttributesMap[tag] = [];\n var globRegex = [];\n attributes.forEach(function (obj) {\n if (isString(obj) && obj.indexOf('*') >= 0) {\n globRegex.push(quoteRegexp(obj).replace(/\\\\\\*/g, '.*'));\n } else {\n allowedAttributesMap[tag].push(obj);\n }\n });\n allowedAttributesGlobMap[tag] = new RegExp('^(' + globRegex.join('|') + ')$');\n });\n }\n var allowedClassesMap = {};\n each(options.allowedClasses, function (classes, tag) {\n // Implicitly allows the class attribute\n if (allowedAttributesMap) {\n if (!has(allowedAttributesMap, tag)) {\n allowedAttributesMap[tag] = [];\n }\n allowedAttributesMap[tag].push('class');\n }\n\n allowedClassesMap[tag] = classes;\n });\n\n var transformTagsMap = {};\n var transformTagsAll;\n each(options.transformTags, function (transform, tag) {\n var transFun;\n if (typeof transform === 'function') {\n transFun = transform;\n } else if (typeof transform === \"string\") {\n transFun = sanitizeHtml.simpleTransform(transform);\n }\n if (tag === '*') {\n transformTagsAll = transFun;\n } else {\n transformTagsMap[tag] = transFun;\n }\n });\n\n var depth = 0;\n var stack = [];\n var skipMap = {};\n var transformMap = {};\n var skipText = false;\n var skipTextDepth = 0;\n\n var parser = new htmlparser.Parser({\n onopentag: function onopentag(name, attribs) {\n if (skipText) {\n skipTextDepth++;\n return;\n }\n var frame = new Frame(name, attribs);\n stack.push(frame);\n\n var skip = false;\n var hasText = frame.text ? true : false;\n var transformedTag;\n if (has(transformTagsMap, name)) {\n transformedTag = transformTagsMap[name](name, attribs);\n\n frame.attribs = attribs = transformedTag.attribs;\n\n if (transformedTag.text !== undefined) {\n frame.innerText = transformedTag.text;\n }\n\n if (name !== transformedTag.tagName) {\n frame.name = name = transformedTag.tagName;\n transformMap[depth] = transformedTag.tagName;\n }\n }\n if (transformTagsAll) {\n transformedTag = transformTagsAll(name, attribs);\n\n frame.attribs = attribs = transformedTag.attribs;\n if (name !== transformedTag.tagName) {\n frame.name = name = transformedTag.tagName;\n transformMap[depth] = transformedTag.tagName;\n }\n }\n\n if (options.allowedTags && options.allowedTags.indexOf(name) === -1) {\n skip = true;\n if (nonTextTagsArray.indexOf(name) !== -1) {\n skipText = true;\n skipTextDepth = 1;\n }\n skipMap[depth] = true;\n }\n depth++;\n if (skip) {\n // We want the contents but not this tag\n return;\n }\n result += '<' + name;\n if (!allowedAttributesMap || has(allowedAttributesMap, name) || allowedAttributesMap['*']) {\n each(attribs, function (value, a) {\n if (!VALID_HTML_ATTRIBUTE_NAME.test(a)) {\n // This prevents part of an attribute name in the output from being\n // interpreted as the end of an attribute, or end of a tag.\n delete frame.attribs[a];\n return;\n }\n var parsed;\n // check allowedAttributesMap for the element and attribute and modify the value\n // as necessary if there are specific values defined.\n var passedAllowedAttributesMapCheck = false;\n if (!allowedAttributesMap || has(allowedAttributesMap, name) && allowedAttributesMap[name].indexOf(a) !== -1 || allowedAttributesMap['*'] && allowedAttributesMap['*'].indexOf(a) !== -1 || has(allowedAttributesGlobMap, name) && allowedAttributesGlobMap[name].test(a) || allowedAttributesGlobMap['*'] && allowedAttributesGlobMap['*'].test(a)) {\n passedAllowedAttributesMapCheck = true;\n } else if (allowedAttributesMap && allowedAttributesMap[name]) {\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = allowedAttributesMap[name][Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var o = _step.value;\n\n if (isPlainObject(o) && o.name && o.name === a) {\n passedAllowedAttributesMapCheck = true;\n var newValue = '';\n if (o.multiple === true) {\n // verify the values that are allowed\n var splitStrArray = value.split(' ');\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = splitStrArray[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var s = _step2.value;\n\n if (o.values.indexOf(s) !== -1) {\n if (newValue === '') {\n newValue = s;\n } else {\n newValue += ' ' + s;\n }\n }\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n } else if (o.values.indexOf(value) >= 0) {\n // verified an allowed value matches the entire attribute value\n newValue = value;\n }\n value = newValue;\n }\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n }\n if (passedAllowedAttributesMapCheck) {\n if (options.allowedSchemesAppliedToAttributes.indexOf(a) !== -1) {\n if (naughtyHref(name, value)) {\n delete frame.attribs[a];\n return;\n }\n }\n if (name === 'iframe' && a === 'src') {\n var allowed = true;\n try {\n // naughtyHref is in charge of whether protocol relative URLs\n // are cool. We should just accept them\n parsed = url.parse(value, false, true);\n var isRelativeUrl = parsed && parsed.host === null && parsed.protocol === null;\n if (isRelativeUrl) {\n // default value of allowIframeRelativeUrls is true unless allowIframeHostnames specified\n allowed = has(options, \"allowIframeRelativeUrls\") ? options.allowIframeRelativeUrls : !options.allowedIframeHostnames;\n } else if (options.allowedIframeHostnames) {\n allowed = options.allowedIframeHostnames.find(function (hostname) {\n return hostname === parsed.hostname;\n });\n }\n } catch (e) {\n // Unparseable iframe src\n allowed = false;\n }\n if (!allowed) {\n delete frame.attribs[a];\n return;\n }\n }\n if (a === 'srcset') {\n try {\n parsed = srcset.parse(value);\n each(parsed, function (value) {\n if (naughtyHref('srcset', value.url)) {\n value.evil = true;\n }\n });\n parsed = filter(parsed, function (v) {\n return !v.evil;\n });\n if (!parsed.length) {\n delete frame.attribs[a];\n return;\n } else {\n value = srcset.stringify(filter(parsed, function (v) {\n return !v.evil;\n }));\n frame.attribs[a] = value;\n }\n } catch (e) {\n // Unparseable srcset\n delete frame.attribs[a];\n return;\n }\n }\n if (a === 'class') {\n value = filterClasses(value, allowedClassesMap[name]);\n if (!value.length) {\n delete frame.attribs[a];\n return;\n }\n }\n if (a === 'style') {\n try {\n var abstractSyntaxTree = postcss.parse(name + \" {\" + value + \"}\");\n var filteredAST = filterCss(abstractSyntaxTree, options.allowedStyles);\n\n value = stringifyStyleAttributes(filteredAST);\n\n if (value.length === 0) {\n delete frame.attribs[a];\n return;\n }\n } catch (e) {\n delete frame.attribs[a];\n return;\n }\n }\n result += ' ' + a;\n if (value.length) {\n result += '=\"' + escapeHtml(value, true) + '\"';\n }\n } else {\n delete frame.attribs[a];\n }\n });\n }\n if (options.selfClosing.indexOf(name) !== -1) {\n result += \" />\";\n } else {\n result += \">\";\n if (frame.innerText && !hasText && !options.textFilter) {\n result += frame.innerText;\n }\n }\n },\n ontext: function ontext(text) {\n if (skipText) {\n return;\n }\n var lastFrame = stack[stack.length - 1];\n var tag;\n\n if (lastFrame) {\n tag = lastFrame.tag;\n // If inner text was set by transform function then let's use it\n text = lastFrame.innerText !== undefined ? lastFrame.innerText : text;\n }\n\n if (tag === 'script' || tag === 'style') {\n // htmlparser2 gives us these as-is. Escaping them ruins the content. Allowing\n // script tags is, by definition, game over for XSS protection, so if that's\n // your concern, don't allow them. The same is essentially true for style tags\n // which have their own collection of XSS vectors.\n result += text;\n } else {\n var escaped = escapeHtml(text, false);\n if (options.textFilter) {\n result += options.textFilter(escaped);\n } else {\n result += escaped;\n }\n }\n if (stack.length) {\n var frame = stack[stack.length - 1];\n frame.text += text;\n }\n },\n onclosetag: function onclosetag(name) {\n\n if (skipText) {\n skipTextDepth--;\n if (!skipTextDepth) {\n skipText = false;\n } else {\n return;\n }\n }\n\n var frame = stack.pop();\n if (!frame) {\n // Do not crash on bad markup\n return;\n }\n skipText = false;\n depth--;\n if (skipMap[depth]) {\n delete skipMap[depth];\n frame.updateParentNodeText();\n return;\n }\n\n if (transformMap[depth]) {\n name = transformMap[depth];\n delete transformMap[depth];\n }\n\n if (options.exclusiveFilter && options.exclusiveFilter(frame)) {\n result = result.substr(0, frame.tagPosition);\n return;\n }\n\n frame.updateParentNodeText();\n\n if (options.selfClosing.indexOf(name) !== -1) {\n // Already output />\n return;\n }\n\n result += \"</\" + name + \">\";\n }\n }, options.parser);\n parser.write(html);\n parser.end();\n\n return result;\n\n function escapeHtml(s, quote) {\n if (typeof s !== 'string') {\n s = s + '';\n }\n if (options.parser.decodeEntities) {\n s = s.replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/\\>/g, '&gt;');\n if (quote) {\n s = s.replace(/\\\"/g, '&quot;');\n }\n }\n // TODO: this is inadequate because it will pass `&0;`. This approach\n // will not work, each & must be considered with regard to whether it\n // is followed by a 100% syntactically valid entity or not, and escaped\n // if it is not. If this bothers you, don't set parser.decodeEntities\n // to false. (The default is true.)\n s = s.replace(/&(?![a-zA-Z0-9#]{1,20};)/g, '&amp;') // Match ampersands not part of existing HTML entity\n .replace(/</g, '&lt;').replace(/\\>/g, '&gt;');\n if (quote) {\n s = s.replace(/\\\"/g, '&quot;');\n }\n return s;\n }\n\n function naughtyHref(name, href) {\n // Browsers ignore character codes of 32 (space) and below in a surprising\n // number of situations. Start reading here:\n // https://www.owasp.org/index.php/XSS_Filter_Evasion_Cheat_Sheet#Embedded_tab\n href = href.replace(/[\\x00-\\x20]+/g, '');\n // Clobber any comments in URLs, which the browser might\n // interpret inside an XML data island, allowing\n // a javascript: URL to be snuck through\n href = href.replace(/<\\!\\-\\-.*?\\-\\-\\>/g, '');\n // Case insensitive so we don't get faked out by JAVASCRIPT #1\n var matches = href.match(/^([a-zA-Z]+)\\:/);\n if (!matches) {\n // Protocol-relative URL starting with any combination of '/' and '\\'\n if (href.match(/^[\\/\\\\]{2}/)) {\n return !options.allowProtocolRelative;\n }\n\n // No scheme\n return false;\n }\n var scheme = matches[1].toLowerCase();\n\n if (has(options.allowedSchemesByTag, name)) {\n return options.allowedSchemesByTag[name].indexOf(scheme) === -1;\n }\n\n return !options.allowedSchemes || options.allowedSchemes.indexOf(scheme) === -1;\n }\n\n /**\n * Filters user input css properties by whitelisted regex attributes.\n *\n * @param {object} abstractSyntaxTree - Object representation of CSS attributes.\n * @property {array[Declaration]} abstractSyntaxTree.nodes[0] - Each object cointains prop and value key, i.e { prop: 'color', value: 'red' }.\n * @param {object} allowedStyles - Keys are properties (i.e color), value is list of permitted regex rules (i.e /green/i).\n * @return {object} - Abstract Syntax Tree with filtered style attributes.\n */\n function filterCss(abstractSyntaxTree, allowedStyles) {\n if (!allowedStyles) {\n return abstractSyntaxTree;\n }\n\n var filteredAST = cloneDeep(abstractSyntaxTree);\n var astRules = abstractSyntaxTree.nodes[0];\n var selectedRule;\n\n // Merge global and tag-specific styles into new AST.\n if (allowedStyles[astRules.selector] && allowedStyles['*']) {\n selectedRule = mergeWith(cloneDeep(allowedStyles[astRules.selector]), allowedStyles['*'], function (objValue, srcValue) {\n if (Array.isArray(objValue)) {\n return objValue.concat(srcValue);\n }\n });\n } else {\n selectedRule = allowedStyles[astRules.selector] || allowedStyles['*'];\n }\n\n if (selectedRule) {\n filteredAST.nodes[0].nodes = astRules.nodes.reduce(filterDeclarations(selectedRule), []);\n }\n\n return filteredAST;\n }\n\n /**\n * Extracts the style attribues from an AbstractSyntaxTree and formats those\n * values in the inline style attribute format.\n *\n * @param {AbstractSyntaxTree} filteredAST\n * @return {string} - Example: \"color:yellow;text-align:center;font-family:helvetica;\"\n */\n function stringifyStyleAttributes(filteredAST) {\n return filteredAST.nodes[0].nodes.reduce(function (extractedAttributes, attributeObject) {\n extractedAttributes.push(attributeObject.prop + ':' + attributeObject.value + ';');\n return extractedAttributes;\n }, []).join('');\n }\n\n /**\n * Filters the existing attributes for the given property. Discards any attributes\n * which don't match the whitelist.\n *\n * @param {object} selectedRule - Example: { color: red, font-family: helvetica }\n * @param {array} allowedDeclarationsList - List of declarations which pass whitelisting.\n * @param {object} attributeObject - Object representing the current css property.\n * @property {string} attributeObject.type - Typically 'declaration'.\n * @property {string} attributeObject.prop - The CSS property, i.e 'color'.\n * @property {string} attributeObject.value - The corresponding value to the css property, i.e 'red'.\n * @return {function} - When used in Array.reduce, will return an array of Declaration objects\n */\n function filterDeclarations(selectedRule) {\n return function (allowedDeclarationsList, attributeObject) {\n // If this property is whitelisted...\n if (selectedRule.hasOwnProperty(attributeObject.prop)) {\n var matchesRegex = selectedRule[attributeObject.prop].some(function (regularExpression) {\n return regularExpression.test(attributeObject.value);\n });\n\n if (matchesRegex) {\n allowedDeclarationsList.push(attributeObject);\n }\n }\n return allowedDeclarationsList;\n };\n }\n\n function filterClasses(classes, allowed) {\n if (!allowed) {\n // The class attribute is allowed without filtering on this tag\n return classes;\n }\n classes = classes.split(/\\s+/);\n return classes.filter(function (clss) {\n return allowed.indexOf(clss) !== -1;\n }).join(' ');\n }\n}\n\n// Defaults are accessible to you so that you can use them as a starting point\n// programmatically if you wish\n\nvar htmlParserDefaults = {\n decodeEntities: true\n};\nsanitizeHtml.defaults = {\n allowedTags: ['h3', 'h4', 'h5', 'h6', 'blockquote', 'p', 'a', 'ul', 'ol', 'nl', 'li', 'b', 'i', 'strong', 'em', 'strike', 'code', 'hr', 'br', 'div', 'table', 'thead', 'caption', 'tbody', 'tr', 'th', 'td', 'pre', 'iframe'],\n allowedAttributes: {\n a: ['href', 'name', 'target'],\n // We don't currently allow img itself by default, but this\n // would make sense if we did. You could add srcset here,\n // and if you do the URL is checked for safety\n img: ['src']\n },\n // Lots of these won't come up by default because we don't allow them\n selfClosing: ['img', 'br', 'hr', 'area', 'base', 'basefont', 'input', 'link', 'meta'],\n // URL schemes we permit\n allowedSchemes: ['http', 'https', 'ftp', 'mailto'],\n allowedSchemesByTag: {},\n allowedSchemesAppliedToAttributes: ['href', 'src', 'cite'],\n allowProtocolRelative: true\n};\n\nsanitizeHtml.simpleTransform = function (newTagName, newAttribs, merge) {\n merge = merge === undefined ? true : merge;\n newAttribs = newAttribs || {};\n\n return function (tagName, attribs) {\n var attrib;\n if (merge) {\n for (attrib in newAttribs) {\n attribs[attrib] = newAttribs[attrib];\n }\n } else {\n attribs = newAttribs;\n }\n\n return {\n tagName: newTagName,\n attribs: attribs\n };\n };\n};","class DateUtils {\n\n //--------------------------\n // constructor\n //--------------------------\n constructor() {}\n\n //--------------------------\n // methods\n //--------------------------\n getMKtime() {\n var time = new Date(new Date().getFullYear(), new Date().getMonth(), new Date().getDate(), new Date().getHours(), new Date().getMinutes(), new Date().getSeconds(), 0).getTime() / 1000;\n return time;\n }\n\n convertMKtime(seconds) {\n var date = new Date(seconds * 1000);\n return date;\n }\n\n getDate(type, rawdate) {\n var day = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCDate()) : String(new Date().getUTCDate()));\n var month = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCMonth() + 1) : String(new Date().getUTCMonth() + 1));\n var year = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCFullYear()) : String(new Date().getUTCFullYear()));\n var hour = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCHours()) : String(new Date().getUTCHours()));\n var minute = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCMinutes()) : String(new Date().getUTCMinutes()));\n var seconds = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCSeconds()) : String(new Date().getUTCSeconds()));\n var millisecond = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getUTCMilliseconds()) : String(new Date().getUTCMilliseconds()));\n var offset = ((rawdate != null || rawdate != '') ? String(new Date(rawdate).getTimezoneOffset()) : String(new Date().getTimezoneOffset()));\n if (day.length == 1)\n day = String(\"0\" + day);\n if (month.length == 1)\n month = String(\"0\" + month);\n offset = String(offset / 60);\n if (offset.length == 1)\n offset = String(\"0\" + offset);\n switch (type) {\n case \"day\":\n return day;\n break;\n case \"month\":\n return month;\n break;\n case \"year\":\n return year;\n break;\n case \"stamp\":\n return String(year + \"-\" + month + \"-\" + day + \" \" + hour + \":\" + minute + \":\" + seconds + \".\" + millisecond + \"-\" + (offset));\n break\n default:\n return String(year + \"-\" + month + \"-\" + day);\n break;\n }\n }\n\n //--------------------------\n // event handlers\n //--------------------------\n}\n\nexport default DateUtils","\"use strict\";\nimport DataUtils,\n{\n REQUEST_TYPE_GET,\n REQUEST_TYPE_PUT,\n REQUEST_TYPE_POST,\n REQUEST_TYPE_DELETE,\n CONTENT_TYPE_JSON,\n CONTENT_TYPE_FORM\n}\nfrom '../utilities/DataUtils';\nimport Dexie from 'dexie';\nimport * as DataEvent from '../events/DataEvent';\nexport var COUNT;\nexport var FINAL_KEY;\nexport default class DBUtils\n{\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {\n this.dataUtils = new DataUtils();\n this.db = new Dexie(\"fipamo_posts\");\n this.db.version(1).stores(\n {\n postList: 'id,post'\n });\n this.db.postList.toArray(array =>\n {\n COUNT = array.length;\n FINAL_KEY = array[COUNT - 1].id;\n })\n }\n //--------------------------\n // methods\n //--------------------------\n modify(id, postData)\n {\n let self = this;\n let freshID;\n return new Promise(function(resolve, reject)\n {\n if (id == null)\n {\n self.db.postList.put(postData).then(fresh =>\n {\n freshID = fresh;\n }).catch(e =>\n {\n let err = {\n message: \"PUT ERROR\",\n error: e\n }\n });\n }\n else\n {\n self.db.postList.update(Number(id),\n {\n post: postData\n }).then(updated =>\n {}).catch(e =>\n {\n consol.log(\"ERROR\", e)\n let err = {\n message: \"UPDATE ERROR\",\n error: e\n }\n });\n }\n self.db.postList.toArray(array =>\n {\n self.syncRemote(array, freshID).then(response =>\n {\n resolve(\n {\n response\n })\n }).catch(err =>\n {\n reject(\n {\n err\n });\n });\n })\n })\n }\n syncLocal(array)\n {\n let self = this;\n return new Promise(function(resolve, reject)\n {\n self.db.postList.clear().then(result =>\n {\n self.db.postList.bulkAdd(array).then(key =>\n {\n self.db.postList.toArray(array =>\n {\n let event = DataEvent.LOCAL_DB_READY\n resolve(\n {\n event\n })\n })\n }).catch(Dexie.BulkError, e =>\n {\n reject(\n {\n e\n })\n })\n })\n })\n }\n syncRemote(db, newPostId)\n {\n let self = this;\n return new Promise(function(resolve, reject)\n {\n self.dataUtils.request('/api/post/sync', DataEvent.POSTS_SYNCED, REQUEST_TYPE_POST, CONTENT_TYPE_JSON, db).then((response) =>\n {\n let bounce = {\n message: response,\n newPost: newPostId\n }\n resolve(bounce)\n }).catch((err) =>\n {\n reject(err);\n })\n })\n }\n getPost(id)\n {\n let self = this;\n if (id == null)\n {\n return new Promise(function(resolve, reject)\n {\n self.db.postList.toArray(array =>\n {\n resolve(array)\n }).catch(err =>\n {\n reject(err)\n })\n })\n }\n else\n {\n return new Promise(function(resolve, reject)\n {\n self.db.postList.get(Number(id)).then(obj =>\n {\n resolve(obj)\n }).catch(err =>\n {\n reject(err)\n })\n })\n }\n }\n archivePost(id, archive)\n {\n let self = this;\n return new Promise(function(resolve, reject)\n {\n self.db.postList.update(Number(id),\n {\n post: archive\n }).then(deleted =>\n {\n self.db.postList.toArray(array =>\n {\n self.syncRemote(array, null).then(response =>\n {\n resolve(\n {\n response\n })\n }).catch(err =>\n {\n reject(\n {\n err\n });\n });\n })\n }).catch(e =>\n {\n console.log(\"ERROR\", e)\n });\n })\n }\n //--------------------------\n // event handlers\n //--------------------------\n}","// HTML5 entities map: { name -> utf16string }\n//\n'use strict';\n\n/*eslint quotes:0*/\nmodule.exports = require('entities/maps/entities.json');\n","module.exports=/[!-#%-\\*,-/:;\\?@\\[-\\]_\\{\\}\\xA1\\xA7\\xAB\\xB6\\xB7\\xBB\\xBF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u09FD\\u0AF0\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166D\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2308-\\u230B\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E49\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA8FC\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]|\\uD800[\\uDD00-\\uDD02\\uDF9F\\uDFD0]|\\uD801\\uDD6F|\\uD802[\\uDC57\\uDD1F\\uDD3F\\uDE50-\\uDE58\\uDE7F\\uDEF0-\\uDEF6\\uDF39-\\uDF3F\\uDF99-\\uDF9C]|\\uD804[\\uDC47-\\uDC4D\\uDCBB\\uDCBC\\uDCBE-\\uDCC1\\uDD40-\\uDD43\\uDD74\\uDD75\\uDDC5-\\uDDC9\\uDDCD\\uDDDB\\uDDDD-\\uDDDF\\uDE38-\\uDE3D\\uDEA9]|\\uD805[\\uDC4B-\\uDC4F\\uDC5B\\uDC5D\\uDCC6\\uDDC1-\\uDDD7\\uDE41-\\uDE43\\uDE60-\\uDE6C\\uDF3C-\\uDF3E]|\\uD806[\\uDE3F-\\uDE46\\uDE9A-\\uDE9C\\uDE9E-\\uDEA2]|\\uD807[\\uDC41-\\uDC45\\uDC70\\uDC71]|\\uD809[\\uDC70-\\uDC74]|\\uD81A[\\uDE6E\\uDE6F\\uDEF5\\uDF37-\\uDF3B\\uDF44]|\\uD82F\\uDC9F|\\uD836[\\uDE87-\\uDE8B]|\\uD83A[\\uDD5E\\uDD5F]/","\n'use strict';\n\n\nvar encodeCache = {};\n\n\n// Create a lookup array where anything but characters in `chars` string\n// and alphanumeric chars is percent-encoded.\n//\nfunction getEncodeCache(exclude) {\n var i, ch, cache = encodeCache[exclude];\n if (cache) { return cache; }\n\n cache = encodeCache[exclude] = [];\n\n for (i = 0; i < 128; i++) {\n ch = String.fromCharCode(i);\n\n if (/^[0-9a-z]$/i.test(ch)) {\n // always allow unencoded alphanumeric characters\n cache.push(ch);\n } else {\n cache.push('%' + ('0' + i.toString(16).toUpperCase()).slice(-2));\n }\n }\n\n for (i = 0; i < exclude.length; i++) {\n cache[exclude.charCodeAt(i)] = exclude[i];\n }\n\n return cache;\n}\n\n\n// Encode unsafe characters with percent-encoding, skipping already\n// encoded sequences.\n//\n// - string - string to encode\n// - exclude - list of characters to ignore (in addition to a-zA-Z0-9)\n// - keepEscaped - don't encode '%' in a correct escape sequence (default: true)\n//\nfunction encode(string, exclude, keepEscaped) {\n var i, l, code, nextCode, cache,\n result = '';\n\n if (typeof exclude !== 'string') {\n // encode(string, keepEscaped)\n keepEscaped = exclude;\n exclude = encode.defaultChars;\n }\n\n if (typeof keepEscaped === 'undefined') {\n keepEscaped = true;\n }\n\n cache = getEncodeCache(exclude);\n\n for (i = 0, l = string.length; i < l; i++) {\n code = string.charCodeAt(i);\n\n if (keepEscaped && code === 0x25 /* % */ && i + 2 < l) {\n if (/^[0-9a-f]{2}$/i.test(string.slice(i + 1, i + 3))) {\n result += string.slice(i, i + 3);\n i += 2;\n continue;\n }\n }\n\n if (code < 128) {\n result += cache[code];\n continue;\n }\n\n if (code >= 0xD800 && code <= 0xDFFF) {\n if (code >= 0xD800 && code <= 0xDBFF && i + 1 < l) {\n nextCode = string.charCodeAt(i + 1);\n if (nextCode >= 0xDC00 && nextCode <= 0xDFFF) {\n result += encodeURIComponent(string[i] + string[i + 1]);\n i++;\n continue;\n }\n }\n result += '%EF%BF%BD';\n continue;\n }\n\n result += encodeURIComponent(string[i]);\n }\n\n return result;\n}\n\nencode.defaultChars = \";/?:@&=+$,-_.!~*'()#\";\nencode.componentChars = \"-_.!~*'()\";\n\n\nmodule.exports = encode;\n","\n'use strict';\n\n\n/* eslint-disable no-bitwise */\n\nvar decodeCache = {};\n\nfunction getDecodeCache(exclude) {\n var i, ch, cache = decodeCache[exclude];\n if (cache) { return cache; }\n\n cache = decodeCache[exclude] = [];\n\n for (i = 0; i < 128; i++) {\n ch = String.fromCharCode(i);\n cache.push(ch);\n }\n\n for (i = 0; i < exclude.length; i++) {\n ch = exclude.charCodeAt(i);\n cache[ch] = '%' + ('0' + ch.toString(16).toUpperCase()).slice(-2);\n }\n\n return cache;\n}\n\n\n// Decode percent-encoded string.\n//\nfunction decode(string, exclude) {\n var cache;\n\n if (typeof exclude !== 'string') {\n exclude = decode.defaultChars;\n }\n\n cache = getDecodeCache(exclude);\n\n return string.replace(/(%[a-f0-9]{2})+/gi, function(seq) {\n var i, l, b1, b2, b3, b4, chr,\n result = '';\n\n for (i = 0, l = seq.length; i < l; i += 3) {\n b1 = parseInt(seq.slice(i + 1, i + 3), 16);\n\n if (b1 < 0x80) {\n result += cache[b1];\n continue;\n }\n\n if ((b1 & 0xE0) === 0xC0 && (i + 3 < l)) {\n // 110xxxxx 10xxxxxx\n b2 = parseInt(seq.slice(i + 4, i + 6), 16);\n\n if ((b2 & 0xC0) === 0x80) {\n chr = ((b1 << 6) & 0x7C0) | (b2 & 0x3F);\n\n if (chr < 0x80) {\n result += '\\ufffd\\ufffd';\n } else {\n result += String.fromCharCode(chr);\n }\n\n i += 3;\n continue;\n }\n }\n\n if ((b1 & 0xF0) === 0xE0 && (i + 6 < l)) {\n // 1110xxxx 10xxxxxx 10xxxxxx\n b2 = parseInt(seq.slice(i + 4, i + 6), 16);\n b3 = parseInt(seq.slice(i + 7, i + 9), 16);\n\n if ((b2 & 0xC0) === 0x80 && (b3 & 0xC0) === 0x80) {\n chr = ((b1 << 12) & 0xF000) | ((b2 << 6) & 0xFC0) | (b3 & 0x3F);\n\n if (chr < 0x800 || (chr >= 0xD800 && chr <= 0xDFFF)) {\n result += '\\ufffd\\ufffd\\ufffd';\n } else {\n result += String.fromCharCode(chr);\n }\n\n i += 6;\n continue;\n }\n }\n\n if ((b1 & 0xF8) === 0xF0 && (i + 9 < l)) {\n // 111110xx 10xxxxxx 10xxxxxx 10xxxxxx\n b2 = parseInt(seq.slice(i + 4, i + 6), 16);\n b3 = parseInt(seq.slice(i + 7, i + 9), 16);\n b4 = parseInt(seq.slice(i + 10, i + 12), 16);\n\n if ((b2 & 0xC0) === 0x80 && (b3 & 0xC0) === 0x80 && (b4 & 0xC0) === 0x80) {\n chr = ((b1 << 18) & 0x1C0000) | ((b2 << 12) & 0x3F000) | ((b3 << 6) & 0xFC0) | (b4 & 0x3F);\n\n if (chr < 0x10000 || chr > 0x10FFFF) {\n result += '\\ufffd\\ufffd\\ufffd\\ufffd';\n } else {\n chr -= 0x10000;\n result += String.fromCharCode(0xD800 + (chr >> 10), 0xDC00 + (chr & 0x3FF));\n }\n\n i += 9;\n continue;\n }\n }\n\n result += '\\ufffd';\n }\n\n return result;\n });\n}\n\n\ndecode.defaultChars = ';/?:@&=+$,#';\ndecode.componentChars = '';\n\n\nmodule.exports = decode;\n","\n'use strict';\n\n\nmodule.exports = function format(url) {\n var result = '';\n\n result += url.protocol || '';\n result += url.slashes ? '//' : '';\n result += url.auth ? url.auth + '@' : '';\n\n if (url.hostname && url.hostname.indexOf(':') !== -1) {\n // ipv6 address\n result += '[' + url.hostname + ']';\n } else {\n result += url.hostname || '';\n }\n\n result += url.port ? ':' + url.port : '';\n result += url.pathname || '';\n result += url.search || '';\n result += url.hash || '';\n\n return result;\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n//\n// Changes from joyent/node:\n//\n// 1. No leading slash in paths,\n// e.g. in `url.parse('http://foo?bar')` pathname is ``, not `/`\n//\n// 2. Backslashes are not replaced with slashes,\n// so `http:\\\\example.org\\` is treated like a relative path\n//\n// 3. Trailing colon is treated like a part of the path,\n// i.e. in `http://example.org:foo` pathname is `:foo`\n//\n// 4. Nothing is URL-encoded in the resulting object,\n// (in joyent/node some chars in auth and paths are encoded)\n//\n// 5. `url.parse()` does not have `parseQueryString` argument\n//\n// 6. Removed extraneous result properties: `host`, `path`, `query`, etc.,\n// which can be constructed using other parts of the url.\n//\n\n\nfunction Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.pathname = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = [ '<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t' ],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = [ '{', '}', '|', '\\\\', '^', '`' ].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = [ '\\'' ].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = [ '%', '/', '?', ';', '#' ].concat(autoEscape),\n hostEndingChars = [ '/', '?', '#' ],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n /* eslint-disable no-script-url */\n // protocols that never have a hostname.\n hostlessProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n 'http': true,\n 'https': true,\n 'ftp': true,\n 'gopher': true,\n 'file': true,\n 'http:': true,\n 'https:': true,\n 'ftp:': true,\n 'gopher:': true,\n 'file:': true\n };\n /* eslint-enable no-script-url */\n\nfunction urlParse(url, slashesDenoteHost) {\n if (url && url instanceof Url) { return url; }\n\n var u = new Url();\n u.parse(url, slashesDenoteHost);\n return u;\n}\n\nUrl.prototype.parse = function(url, slashesDenoteHost) {\n var i, l, lowerProto, hec, slashes,\n rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split('#').length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n lowerProto = proto.toLowerCase();\n this.protocol = proto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n slashes = rest.substr(0, 2) === '//';\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (!hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))) {\n\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (i = 0; i < hostEndingChars.length; i++) {\n hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n hostEnd = hec;\n }\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = auth;\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (i = 0; i < nonHostChars.length; i++) {\n hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n hostEnd = hec;\n }\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1) {\n hostEnd = rest.length;\n }\n\n if (rest[hostEnd - 1] === ':') { hostEnd--; }\n var host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost(host);\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || '';\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname = this.hostname[0] === '[' &&\n this.hostname[this.hostname.length - 1] === ']';\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) { continue; }\n if (!part.match(hostnamePartPattern)) {\n var newpart = '';\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += 'x';\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = notHost.join('.') + rest;\n }\n this.hostname = validParts.join('.');\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = '';\n }\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n }\n }\n\n // chop off from the tail first.\n var hash = rest.indexOf('#');\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf('?');\n if (qm !== -1) {\n this.search = rest.substr(qm);\n rest = rest.slice(0, qm);\n }\n if (rest) { this.pathname = rest; }\n if (slashedProtocol[lowerProto] &&\n this.hostname && !this.pathname) {\n this.pathname = '';\n }\n\n return this;\n};\n\nUrl.prototype.parseHost = function(host) {\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== ':') {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) { this.hostname = host; }\n};\n\nmodule.exports = urlParse;\n","'use strict';\n\n\nmodule.exports.encode = require('./encode');\nmodule.exports.decode = require('./decode');\nmodule.exports.format = require('./format');\nmodule.exports.parse = require('./parse');\n","module.exports=/[\\0-\\uD7FF\\uE000-\\uFFFF]|[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/","module.exports=/[\\0-\\x1F\\x7F-\\x9F]/","module.exports=/[\\xAD\\u0600-\\u0605\\u061C\\u06DD\\u070F\\u08E2\\u180E\\u200B-\\u200F\\u202A-\\u202E\\u2060-\\u2064\\u2066-\\u206F\\uFEFF\\uFFF9-\\uFFFB]|\\uD804\\uDCBD|\\uD82F[\\uDCA0-\\uDCA3]|\\uD834[\\uDD73-\\uDD7A]|\\uDB40[\\uDC01\\uDC20-\\uDC7F]/","module.exports=/[ \\xA0\\u1680\\u2000-\\u200A\\u202F\\u205F\\u3000]/","'use strict';\n\nexports.Any = require('./properties/Any/regex');\nexports.Cc = require('./categories/Cc/regex');\nexports.Cf = require('./categories/Cf/regex');\nexports.P = require('./categories/P/regex');\nexports.Z = require('./categories/Z/regex');\n","// Utilities\n//\n'use strict';\n\n\nfunction _class(obj) { return Object.prototype.toString.call(obj); }\n\nfunction isString(obj) { return _class(obj) === '[object String]'; }\n\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction has(object, key) {\n return _hasOwnProperty.call(object, key);\n}\n\n// Merge objects\n//\nfunction assign(obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n\n sources.forEach(function (source) {\n if (!source) { return; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be object');\n }\n\n Object.keys(source).forEach(function (key) {\n obj[key] = source[key];\n });\n });\n\n return obj;\n}\n\n// Remove element from array and put another array at those position.\n// Useful for some operations with tokens\nfunction arrayReplaceAt(src, pos, newElements) {\n return [].concat(src.slice(0, pos), newElements, src.slice(pos + 1));\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nfunction isValidEntityCode(c) {\n /*eslint no-bitwise:0*/\n // broken sequence\n if (c >= 0xD800 && c <= 0xDFFF) { return false; }\n // never used\n if (c >= 0xFDD0 && c <= 0xFDEF) { return false; }\n if ((c & 0xFFFF) === 0xFFFF || (c & 0xFFFF) === 0xFFFE) { return false; }\n // control codes\n if (c >= 0x00 && c <= 0x08) { return false; }\n if (c === 0x0B) { return false; }\n if (c >= 0x0E && c <= 0x1F) { return false; }\n if (c >= 0x7F && c <= 0x9F) { return false; }\n // out of range\n if (c > 0x10FFFF) { return false; }\n return true;\n}\n\nfunction fromCodePoint(c) {\n /*eslint no-bitwise:0*/\n if (c > 0xffff) {\n c -= 0x10000;\n var surrogate1 = 0xd800 + (c >> 10),\n surrogate2 = 0xdc00 + (c & 0x3ff);\n\n return String.fromCharCode(surrogate1, surrogate2);\n }\n return String.fromCharCode(c);\n}\n\n\nvar UNESCAPE_MD_RE = /\\\\([!\"#$%&'()*+,\\-.\\/:;<=>?@[\\\\\\]^_`{|}~])/g;\nvar ENTITY_RE = /&([a-z#][a-z0-9]{1,31});/gi;\nvar UNESCAPE_ALL_RE = new RegExp(UNESCAPE_MD_RE.source + '|' + ENTITY_RE.source, 'gi');\n\nvar DIGITAL_ENTITY_TEST_RE = /^#((?:x[a-f0-9]{1,8}|[0-9]{1,8}))/i;\n\nvar entities = require('./entities');\n\nfunction replaceEntityPattern(match, name) {\n var code = 0;\n\n if (has(entities, name)) {\n return entities[name];\n }\n\n if (name.charCodeAt(0) === 0x23/* # */ && DIGITAL_ENTITY_TEST_RE.test(name)) {\n code = name[1].toLowerCase() === 'x' ?\n parseInt(name.slice(2), 16)\n :\n parseInt(name.slice(1), 10);\n if (isValidEntityCode(code)) {\n return fromCodePoint(code);\n }\n }\n\n return match;\n}\n\n/*function replaceEntities(str) {\n if (str.indexOf('&') < 0) { return str; }\n\n return str.replace(ENTITY_RE, replaceEntityPattern);\n}*/\n\nfunction unescapeMd(str) {\n if (str.indexOf('\\\\') < 0) { return str; }\n return str.replace(UNESCAPE_MD_RE, '$1');\n}\n\nfunction unescapeAll(str) {\n if (str.indexOf('\\\\') < 0 && str.indexOf('&') < 0) { return str; }\n\n return str.replace(UNESCAPE_ALL_RE, function (match, escaped, entity) {\n if (escaped) { return escaped; }\n return replaceEntityPattern(match, entity);\n });\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nvar HTML_ESCAPE_TEST_RE = /[&<>\"]/;\nvar HTML_ESCAPE_REPLACE_RE = /[&<>\"]/g;\nvar HTML_REPLACEMENTS = {\n '&': '&amp;',\n '<': '&lt;',\n '>': '&gt;',\n '\"': '&quot;'\n};\n\nfunction replaceUnsafeChar(ch) {\n return HTML_REPLACEMENTS[ch];\n}\n\nfunction escapeHtml(str) {\n if (HTML_ESCAPE_TEST_RE.test(str)) {\n return str.replace(HTML_ESCAPE_REPLACE_RE, replaceUnsafeChar);\n }\n return str;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nvar REGEXP_ESCAPE_RE = /[.?*+^$[\\]\\\\(){}|-]/g;\n\nfunction escapeRE(str) {\n return str.replace(REGEXP_ESCAPE_RE, '\\\\$&');\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\nfunction isSpace(code) {\n switch (code) {\n case 0x09:\n case 0x20:\n return true;\n }\n return false;\n}\n\n// Zs (unicode class) || [\\t\\f\\v\\r\\n]\nfunction isWhiteSpace(code) {\n if (code >= 0x2000 && code <= 0x200A) { return true; }\n switch (code) {\n case 0x09: // \\t\n case 0x0A: // \\n\n case 0x0B: // \\v\n case 0x0C: // \\f\n case 0x0D: // \\r\n case 0x20:\n case 0xA0:\n case 0x1680:\n case 0x202F:\n case 0x205F:\n case 0x3000:\n return true;\n }\n return false;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\n/*eslint-disable max-len*/\nvar UNICODE_PUNCT_RE = require('uc.micro/categories/P/regex');\n\n// Currently without astral characters support.\nfunction isPunctChar(ch) {\n return UNICODE_PUNCT_RE.test(ch);\n}\n\n\n// Markdown ASCII punctuation characters.\n//\n// !, \", #, $, %, &, ', (, ), *, +, ,, -, ., /, :, ;, <, =, >, ?, @, [, \\, ], ^, _, `, {, |, }, or ~\n// http://spec.commonmark.org/0.15/#ascii-punctuation-character\n//\n// Don't confuse with unicode punctuation !!! It lacks some chars in ascii range.\n//\nfunction isMdAsciiPunct(ch) {\n switch (ch) {\n case 0x21/* ! */:\n case 0x22/* \" */:\n case 0x23/* # */:\n case 0x24/* $ */:\n case 0x25/* % */:\n case 0x26/* & */:\n case 0x27/* ' */:\n case 0x28/* ( */:\n case 0x29/* ) */:\n case 0x2A/* * */:\n case 0x2B/* + */:\n case 0x2C/* , */:\n case 0x2D/* - */:\n case 0x2E/* . */:\n case 0x2F/* / */:\n case 0x3A/* : */:\n case 0x3B/* ; */:\n case 0x3C/* < */:\n case 0x3D/* = */:\n case 0x3E/* > */:\n case 0x3F/* ? */:\n case 0x40/* @ */:\n case 0x5B/* [ */:\n case 0x5C/* \\ */:\n case 0x5D/* ] */:\n case 0x5E/* ^ */:\n case 0x5F/* _ */:\n case 0x60/* ` */:\n case 0x7B/* { */:\n case 0x7C/* | */:\n case 0x7D/* } */:\n case 0x7E/* ~ */:\n return true;\n default:\n return false;\n }\n}\n\n// Hepler to unify [reference labels].\n//\nfunction normalizeReference(str) {\n // use .toUpperCase() instead of .toLowerCase()\n // here to avoid a conflict with Object.prototype\n // members (most notably, `__proto__`)\n return str.trim().replace(/\\s+/g, ' ').toUpperCase();\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\n// Re-export libraries commonly used in both markdown-it and its plugins,\n// so plugins won't have to depend on them explicitly, which reduces their\n// bundled size (e.g. a browser build).\n//\nexports.lib = {};\nexports.lib.mdurl = require('mdurl');\nexports.lib.ucmicro = require('uc.micro');\n\nexports.assign = assign;\nexports.isString = isString;\nexports.has = has;\nexports.unescapeMd = unescapeMd;\nexports.unescapeAll = unescapeAll;\nexports.isValidEntityCode = isValidEntityCode;\nexports.fromCodePoint = fromCodePoint;\n// exports.replaceEntities = replaceEntities;\nexports.escapeHtml = escapeHtml;\nexports.arrayReplaceAt = arrayReplaceAt;\nexports.isSpace = isSpace;\nexports.isWhiteSpace = isWhiteSpace;\nexports.isMdAsciiPunct = isMdAsciiPunct;\nexports.isPunctChar = isPunctChar;\nexports.escapeRE = escapeRE;\nexports.normalizeReference = normalizeReference;\n","// Parse link label\n//\n// this function assumes that first character (\"[\") already matches;\n// returns the end of the label\n//\n'use strict';\n\nmodule.exports = function parseLinkLabel(state, start, disableNested) {\n var level, found, marker, prevPos,\n labelEnd = -1,\n max = state.posMax,\n oldPos = state.pos;\n\n state.pos = start + 1;\n level = 1;\n\n while (state.pos < max) {\n marker = state.src.charCodeAt(state.pos);\n if (marker === 0x5D /* ] */) {\n level--;\n if (level === 0) {\n found = true;\n break;\n }\n }\n\n prevPos = state.pos;\n state.md.inline.skipToken(state);\n if (marker === 0x5B /* [ */) {\n if (prevPos === state.pos - 1) {\n // increase level if we find text `[`, which is not a part of any token\n level++;\n } else if (disableNested) {\n state.pos = oldPos;\n return -1;\n }\n }\n }\n\n if (found) {\n labelEnd = state.pos;\n }\n\n // restore old state\n state.pos = oldPos;\n\n return labelEnd;\n};\n","// Parse link destination\n//\n'use strict';\n\n\nvar isSpace = require('../common/utils').isSpace;\nvar unescapeAll = require('../common/utils').unescapeAll;\n\n\nmodule.exports = function parseLinkDestination(str, pos, max) {\n var code, level,\n lines = 0,\n start = pos,\n result = {\n ok: false,\n pos: 0,\n lines: 0,\n str: ''\n };\n\n if (str.charCodeAt(pos) === 0x3C /* < */) {\n pos++;\n while (pos < max) {\n code = str.charCodeAt(pos);\n if (code === 0x0A /* \\n */ || isSpace(code)) { return result; }\n if (code === 0x3E /* > */) {\n result.pos = pos + 1;\n result.str = unescapeAll(str.slice(start + 1, pos));\n result.ok = true;\n return result;\n }\n if (code === 0x5C /* \\ */ && pos + 1 < max) {\n pos += 2;\n continue;\n }\n\n pos++;\n }\n\n // no closing '>'\n return result;\n }\n\n // this should be ... } else { ... branch\n\n level = 0;\n while (pos < max) {\n code = str.charCodeAt(pos);\n\n if (code === 0x20) { break; }\n\n // ascii control characters\n if (code < 0x20 || code === 0x7F) { break; }\n\n if (code === 0x5C /* \\ */ && pos + 1 < max) {\n pos += 2;\n continue;\n }\n\n if (code === 0x28 /* ( */) {\n level++;\n }\n\n if (code === 0x29 /* ) */) {\n if (level === 0) { break; }\n level--;\n }\n\n pos++;\n }\n\n if (start === pos) { return result; }\n if (level !== 0) { return result; }\n\n result.str = unescapeAll(str.slice(start, pos));\n result.lines = lines;\n result.pos = pos;\n result.ok = true;\n return result;\n};\n","// Parse link title\n//\n'use strict';\n\n\nvar unescapeAll = require('../common/utils').unescapeAll;\n\n\nmodule.exports = function parseLinkTitle(str, pos, max) {\n var code,\n marker,\n lines = 0,\n start = pos,\n result = {\n ok: false,\n pos: 0,\n lines: 0,\n str: ''\n };\n\n if (pos >= max) { return result; }\n\n marker = str.charCodeAt(pos);\n\n if (marker !== 0x22 /* \" */ && marker !== 0x27 /* ' */ && marker !== 0x28 /* ( */) { return result; }\n\n pos++;\n\n // if opening marker is \"(\", switch it to closing marker \")\"\n if (marker === 0x28) { marker = 0x29; }\n\n while (pos < max) {\n code = str.charCodeAt(pos);\n if (code === marker) {\n result.pos = pos + 1;\n result.lines = lines;\n result.str = unescapeAll(str.slice(start + 1, pos));\n result.ok = true;\n return result;\n } else if (code === 0x0A) {\n lines++;\n } else if (code === 0x5C /* \\ */ && pos + 1 < max) {\n pos++;\n if (str.charCodeAt(pos) === 0x0A) {\n lines++;\n }\n }\n\n pos++;\n }\n\n return result;\n};\n","// Just a shortcut for bulk export\n'use strict';\n\n\nexports.parseLinkLabel = require('./parse_link_label');\nexports.parseLinkDestination = require('./parse_link_destination');\nexports.parseLinkTitle = require('./parse_link_title');\n","/**\n * class Renderer\n *\n * Generates HTML from parsed token stream. Each instance has independent\n * copy of rules. Those can be rewritten with ease. Also, you can add new\n * rules if you create plugin and adds new token types.\n **/\n'use strict';\n\n\nvar assign = require('./common/utils').assign;\nvar unescapeAll = require('./common/utils').unescapeAll;\nvar escapeHtml = require('./common/utils').escapeHtml;\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nvar default_rules = {};\n\n\ndefault_rules.code_inline = function (tokens, idx, options, env, slf) {\n var token = tokens[idx];\n\n return '<code' + slf.renderAttrs(token) + '>' +\n escapeHtml(tokens[idx].content) +\n '</code>';\n};\n\n\ndefault_rules.code_block = function (tokens, idx, options, env, slf) {\n var token = tokens[idx];\n\n return '<pre' + slf.renderAttrs(token) + '><code>' +\n escapeHtml(tokens[idx].content) +\n '</code></pre>\\n';\n};\n\n\ndefault_rules.fence = function (tokens, idx, options, env, slf) {\n var token = tokens[idx],\n info = token.info ? unescapeAll(token.info).trim() : '',\n langName = '',\n highlighted, i, tmpAttrs, tmpToken;\n\n if (info) {\n langName = info.split(/\\s+/g)[0];\n }\n\n if (options.highlight) {\n highlighted = options.highlight(token.content, langName) || escapeHtml(token.content);\n } else {\n highlighted = escapeHtml(token.content);\n }\n\n if (highlighted.indexOf('<pre') === 0) {\n return highlighted + '\\n';\n }\n\n // If language exists, inject class gently, without modifying original token.\n // May be, one day we will add .clone() for token and simplify this part, but\n // now we prefer to keep things local.\n if (info) {\n i = token.attrIndex('class');\n tmpAttrs = token.attrs ? token.attrs.slice() : [];\n\n if (i < 0) {\n tmpAttrs.push([ 'class', options.langPrefix + langName ]);\n } else {\n tmpAttrs[i][1] += ' ' + options.langPrefix + langName;\n }\n\n // Fake token just to render attributes\n tmpToken = {\n attrs: tmpAttrs\n };\n\n return '<pre><code' + slf.renderAttrs(tmpToken) + '>'\n + highlighted\n + '</code></pre>\\n';\n }\n\n\n return '<pre><code' + slf.renderAttrs(token) + '>'\n + highlighted\n + '</code></pre>\\n';\n};\n\n\ndefault_rules.image = function (tokens, idx, options, env, slf) {\n var token = tokens[idx];\n\n // \"alt\" attr MUST be set, even if empty. Because it's mandatory and\n // should be placed on proper position for tests.\n //\n // Replace content with actual value\n\n token.attrs[token.attrIndex('alt')][1] =\n slf.renderInlineAsText(token.children, options, env);\n\n return slf.renderToken(tokens, idx, options);\n};\n\n\ndefault_rules.hardbreak = function (tokens, idx, options /*, env */) {\n return options.xhtmlOut ? '<br />\\n' : '<br>\\n';\n};\ndefault_rules.softbreak = function (tokens, idx, options /*, env */) {\n return options.breaks ? (options.xhtmlOut ? '<br />\\n' : '<br>\\n') : '\\n';\n};\n\n\ndefault_rules.text = function (tokens, idx /*, options, env */) {\n return escapeHtml(tokens[idx].content);\n};\n\n\ndefault_rules.html_block = function (tokens, idx /*, options, env */) {\n return tokens[idx].content;\n};\ndefault_rules.html_inline = function (tokens, idx /*, options, env */) {\n return tokens[idx].content;\n};\n\n\n/**\n * new Renderer()\n *\n * Creates new [[Renderer]] instance and fill [[Renderer#rules]] with defaults.\n **/\nfunction Renderer() {\n\n /**\n * Renderer#rules -> Object\n *\n * Contains render rules for tokens. Can be updated and extended.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.renderer.rules.strong_open = function () { return '<b>'; };\n * md.renderer.rules.strong_close = function () { return '</b>'; };\n *\n * var result = md.renderInline(...);\n * ```\n *\n * Each rule is called as independent static function with fixed signature:\n *\n * ```javascript\n * function my_token_render(tokens, idx, options, env, renderer) {\n * // ...\n * return renderedHTML;\n * }\n * ```\n *\n * See [source code](https://github.com/markdown-it/markdown-it/blob/master/lib/renderer.js)\n * for more details and examples.\n **/\n this.rules = assign({}, default_rules);\n}\n\n\n/**\n * Renderer.renderAttrs(token) -> String\n *\n * Render token attributes to string.\n **/\nRenderer.prototype.renderAttrs = function renderAttrs(token) {\n var i, l, result;\n\n if (!token.attrs) { return ''; }\n\n result = '';\n\n for (i = 0, l = token.attrs.length; i < l; i++) {\n result += ' ' + escapeHtml(token.attrs[i][0]) + '=\"' + escapeHtml(token.attrs[i][1]) + '\"';\n }\n\n return result;\n};\n\n\n/**\n * Renderer.renderToken(tokens, idx, options) -> String\n * - tokens (Array): list of tokens\n * - idx (Numbed): token index to render\n * - options (Object): params of parser instance\n *\n * Default token renderer. Can be overriden by custom function\n * in [[Renderer#rules]].\n **/\nRenderer.prototype.renderToken = function renderToken(tokens, idx, options) {\n var nextToken,\n result = '',\n needLf = false,\n token = tokens[idx];\n\n // Tight list paragraphs\n if (token.hidden) {\n return '';\n }\n\n // Insert a newline between hidden paragraph and subsequent opening\n // block-level tag.\n //\n // For example, here we should insert a newline before blockquote:\n // - a\n // >\n //\n if (token.block && token.nesting !== -1 && idx && tokens[idx - 1].hidden) {\n result += '\\n';\n }\n\n // Add token name, e.g. `<img`\n result += (token.nesting === -1 ? '</' : '<') + token.tag;\n\n // Encode attributes, e.g. `<img src=\"foo\"`\n result += this.renderAttrs(token);\n\n // Add a slash for self-closing tags, e.g. `<img src=\"foo\" /`\n if (token.nesting === 0 && options.xhtmlOut) {\n result += ' /';\n }\n\n // Check if we need to add a newline after this tag\n if (token.block) {\n needLf = true;\n\n if (token.nesting === 1) {\n if (idx + 1 < tokens.length) {\n nextToken = tokens[idx + 1];\n\n if (nextToken.type === 'inline' || nextToken.hidden) {\n // Block-level tag containing an inline tag.\n //\n needLf = false;\n\n } else if (nextToken.nesting === -1 && nextToken.tag === token.tag) {\n // Opening tag + closing tag of the same type. E.g. `<li></li>`.\n //\n needLf = false;\n }\n }\n }\n }\n\n result += needLf ? '>\\n' : '>';\n\n return result;\n};\n\n\n/**\n * Renderer.renderInline(tokens, options, env) -> String\n * - tokens (Array): list on block tokens to renter\n * - options (Object): params of parser instance\n * - env (Object): additional data from parsed input (references, for example)\n *\n * The same as [[Renderer.render]], but for single token of `inline` type.\n **/\nRenderer.prototype.renderInline = function (tokens, options, env) {\n var type,\n result = '',\n rules = this.rules;\n\n for (var i = 0, len = tokens.length; i < len; i++) {\n type = tokens[i].type;\n\n if (typeof rules[type] !== 'undefined') {\n result += rules[type](tokens, i, options, env, this);\n } else {\n result += this.renderToken(tokens, i, options);\n }\n }\n\n return result;\n};\n\n\n/** internal\n * Renderer.renderInlineAsText(tokens, options, env) -> String\n * - tokens (Array): list on block tokens to renter\n * - options (Object): params of parser instance\n * - env (Object): additional data from parsed input (references, for example)\n *\n * Special kludge for image `alt` attributes to conform CommonMark spec.\n * Don't try to use it! Spec requires to show `alt` content with stripped markup,\n * instead of simple escaping.\n **/\nRenderer.prototype.renderInlineAsText = function (tokens, options, env) {\n var result = '';\n\n for (var i = 0, len = tokens.length; i < len; i++) {\n if (tokens[i].type === 'text') {\n result += tokens[i].content;\n } else if (tokens[i].type === 'image') {\n result += this.renderInlineAsText(tokens[i].children, options, env);\n }\n }\n\n return result;\n};\n\n\n/**\n * Renderer.render(tokens, options, env) -> String\n * - tokens (Array): list on block tokens to renter\n * - options (Object): params of parser instance\n * - env (Object): additional data from parsed input (references, for example)\n *\n * Takes token stream and generates HTML. Probably, you will never need to call\n * this method directly.\n **/\nRenderer.prototype.render = function (tokens, options, env) {\n var i, len, type,\n result = '',\n rules = this.rules;\n\n for (i = 0, len = tokens.length; i < len; i++) {\n type = tokens[i].type;\n\n if (type === 'inline') {\n result += this.renderInline(tokens[i].children, options, env);\n } else if (typeof rules[type] !== 'undefined') {\n result += rules[tokens[i].type](tokens, i, options, env, this);\n } else {\n result += this.renderToken(tokens, i, options, env);\n }\n }\n\n return result;\n};\n\nmodule.exports = Renderer;\n","/**\n * class Ruler\n *\n * Helper class, used by [[MarkdownIt#core]], [[MarkdownIt#block]] and\n * [[MarkdownIt#inline]] to manage sequences of functions (rules):\n *\n * - keep rules in defined order\n * - assign the name to each rule\n * - enable/disable rules\n * - add/replace rules\n * - allow assign rules to additional named chains (in the same)\n * - cacheing lists of active rules\n *\n * You will not need use this class directly until write plugins. For simple\n * rules control use [[MarkdownIt.disable]], [[MarkdownIt.enable]] and\n * [[MarkdownIt.use]].\n **/\n'use strict';\n\n\n/**\n * new Ruler()\n **/\nfunction Ruler() {\n // List of added rules. Each element is:\n //\n // {\n // name: XXX,\n // enabled: Boolean,\n // fn: Function(),\n // alt: [ name2, name3 ]\n // }\n //\n this.__rules__ = [];\n\n // Cached rule chains.\n //\n // First level - chain name, '' for default.\n // Second level - diginal anchor for fast filtering by charcodes.\n //\n this.__cache__ = null;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n// Helper methods, should not be used directly\n\n\n// Find rule index by name\n//\nRuler.prototype.__find__ = function (name) {\n for (var i = 0; i < this.__rules__.length; i++) {\n if (this.__rules__[i].name === name) {\n return i;\n }\n }\n return -1;\n};\n\n\n// Build rules lookup cache\n//\nRuler.prototype.__compile__ = function () {\n var self = this;\n var chains = [ '' ];\n\n // collect unique names\n self.__rules__.forEach(function (rule) {\n if (!rule.enabled) { return; }\n\n rule.alt.forEach(function (altName) {\n if (chains.indexOf(altName) < 0) {\n chains.push(altName);\n }\n });\n });\n\n self.__cache__ = {};\n\n chains.forEach(function (chain) {\n self.__cache__[chain] = [];\n self.__rules__.forEach(function (rule) {\n if (!rule.enabled) { return; }\n\n if (chain && rule.alt.indexOf(chain) < 0) { return; }\n\n self.__cache__[chain].push(rule.fn);\n });\n });\n};\n\n\n/**\n * Ruler.at(name, fn [, options])\n * - name (String): rule name to replace.\n * - fn (Function): new rule function.\n * - options (Object): new rule options (not mandatory).\n *\n * Replace rule by name with new function & options. Throws error if name not\n * found.\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * Replace existing typographer replacement rule with new one:\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.core.ruler.at('replacements', function replace(state) {\n * //...\n * });\n * ```\n **/\nRuler.prototype.at = function (name, fn, options) {\n var index = this.__find__(name);\n var opt = options || {};\n\n if (index === -1) { throw new Error('Parser rule not found: ' + name); }\n\n this.__rules__[index].fn = fn;\n this.__rules__[index].alt = opt.alt || [];\n this.__cache__ = null;\n};\n\n\n/**\n * Ruler.before(beforeName, ruleName, fn [, options])\n * - beforeName (String): new rule will be added before this one.\n * - ruleName (String): name of added rule.\n * - fn (Function): rule function.\n * - options (Object): rule options (not mandatory).\n *\n * Add new rule to chain before one with given name. See also\n * [[Ruler.after]], [[Ruler.push]].\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.block.ruler.before('paragraph', 'my_rule', function replace(state) {\n * //...\n * });\n * ```\n **/\nRuler.prototype.before = function (beforeName, ruleName, fn, options) {\n var index = this.__find__(beforeName);\n var opt = options || {};\n\n if (index === -1) { throw new Error('Parser rule not found: ' + beforeName); }\n\n this.__rules__.splice(index, 0, {\n name: ruleName,\n enabled: true,\n fn: fn,\n alt: opt.alt || []\n });\n\n this.__cache__ = null;\n};\n\n\n/**\n * Ruler.after(afterName, ruleName, fn [, options])\n * - afterName (String): new rule will be added after this one.\n * - ruleName (String): name of added rule.\n * - fn (Function): rule function.\n * - options (Object): rule options (not mandatory).\n *\n * Add new rule to chain after one with given name. See also\n * [[Ruler.before]], [[Ruler.push]].\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.inline.ruler.after('text', 'my_rule', function replace(state) {\n * //...\n * });\n * ```\n **/\nRuler.prototype.after = function (afterName, ruleName, fn, options) {\n var index = this.__find__(afterName);\n var opt = options || {};\n\n if (index === -1) { throw new Error('Parser rule not found: ' + afterName); }\n\n this.__rules__.splice(index + 1, 0, {\n name: ruleName,\n enabled: true,\n fn: fn,\n alt: opt.alt || []\n });\n\n this.__cache__ = null;\n};\n\n/**\n * Ruler.push(ruleName, fn [, options])\n * - ruleName (String): name of added rule.\n * - fn (Function): rule function.\n * - options (Object): rule options (not mandatory).\n *\n * Push new rule to the end of chain. See also\n * [[Ruler.before]], [[Ruler.after]].\n *\n * ##### Options:\n *\n * - __alt__ - array with names of \"alternate\" chains.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * md.core.ruler.push('my_rule', function replace(state) {\n * //...\n * });\n * ```\n **/\nRuler.prototype.push = function (ruleName, fn, options) {\n var opt = options || {};\n\n this.__rules__.push({\n name: ruleName,\n enabled: true,\n fn: fn,\n alt: opt.alt || []\n });\n\n this.__cache__ = null;\n};\n\n\n/**\n * Ruler.enable(list [, ignoreInvalid]) -> Array\n * - list (String|Array): list of rule names to enable.\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Enable rules with given names. If any rule name not found - throw Error.\n * Errors can be disabled by second param.\n *\n * Returns list of found rule names (if no exception happened).\n *\n * See also [[Ruler.disable]], [[Ruler.enableOnly]].\n **/\nRuler.prototype.enable = function (list, ignoreInvalid) {\n if (!Array.isArray(list)) { list = [ list ]; }\n\n var result = [];\n\n // Search by name and enable\n list.forEach(function (name) {\n var idx = this.__find__(name);\n\n if (idx < 0) {\n if (ignoreInvalid) { return; }\n throw new Error('Rules manager: invalid rule name ' + name);\n }\n this.__rules__[idx].enabled = true;\n result.push(name);\n }, this);\n\n this.__cache__ = null;\n return result;\n};\n\n\n/**\n * Ruler.enableOnly(list [, ignoreInvalid])\n * - list (String|Array): list of rule names to enable (whitelist).\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Enable rules with given names, and disable everything else. If any rule name\n * not found - throw Error. Errors can be disabled by second param.\n *\n * See also [[Ruler.disable]], [[Ruler.enable]].\n **/\nRuler.prototype.enableOnly = function (list, ignoreInvalid) {\n if (!Array.isArray(list)) { list = [ list ]; }\n\n this.__rules__.forEach(function (rule) { rule.enabled = false; });\n\n this.enable(list, ignoreInvalid);\n};\n\n\n/**\n * Ruler.disable(list [, ignoreInvalid]) -> Array\n * - list (String|Array): list of rule names to disable.\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Disable rules with given names. If any rule name not found - throw Error.\n * Errors can be disabled by second param.\n *\n * Returns list of found rule names (if no exception happened).\n *\n * See also [[Ruler.enable]], [[Ruler.enableOnly]].\n **/\nRuler.prototype.disable = function (list, ignoreInvalid) {\n if (!Array.isArray(list)) { list = [ list ]; }\n\n var result = [];\n\n // Search by name and disable\n list.forEach(function (name) {\n var idx = this.__find__(name);\n\n if (idx < 0) {\n if (ignoreInvalid) { return; }\n throw new Error('Rules manager: invalid rule name ' + name);\n }\n this.__rules__[idx].enabled = false;\n result.push(name);\n }, this);\n\n this.__cache__ = null;\n return result;\n};\n\n\n/**\n * Ruler.getRules(chainName) -> Array\n *\n * Return array of active functions (rules) for given chain name. It analyzes\n * rules configuration, compiles caches if not exists and returns result.\n *\n * Default chain name is `''` (empty string). It can't be skipped. That's\n * done intentionally, to keep signature monomorphic for high speed.\n **/\nRuler.prototype.getRules = function (chainName) {\n if (this.__cache__ === null) {\n this.__compile__();\n }\n\n // Chain can be empty, if rules disabled. But we still have to return Array.\n return this.__cache__[chainName] || [];\n};\n\nmodule.exports = Ruler;\n","// Normalize input string\n\n'use strict';\n\n\nvar NEWLINES_RE = /\\r[\\n\\u0085]?|[\\u2424\\u2028\\u0085]/g;\nvar NULL_RE = /\\u0000/g;\n\n\nmodule.exports = function inline(state) {\n var str;\n\n // Normalize newlines\n str = state.src.replace(NEWLINES_RE, '\\n');\n\n // Replace NULL characters\n str = str.replace(NULL_RE, '\\uFFFD');\n\n state.src = str;\n};\n","'use strict';\n\n\nmodule.exports = function block(state) {\n var token;\n\n if (state.inlineMode) {\n token = new state.Token('inline', '', 0);\n token.content = state.src;\n token.map = [ 0, 1 ];\n token.children = [];\n state.tokens.push(token);\n } else {\n state.md.block.parse(state.src, state.md, state.env, state.tokens);\n }\n};\n","'use strict';\n\nmodule.exports = function inline(state) {\n var tokens = state.tokens, tok, i, l;\n\n // Parse inlines\n for (i = 0, l = tokens.length; i < l; i++) {\n tok = tokens[i];\n if (tok.type === 'inline') {\n state.md.inline.parse(tok.content, state.md, state.env, tok.children);\n }\n }\n};\n","// Replace link-like texts with link nodes.\n//\n// Currently restricted by `md.validateLink()` to http/https/ftp\n//\n'use strict';\n\n\nvar arrayReplaceAt = require('../common/utils').arrayReplaceAt;\n\n\nfunction isLinkOpen(str) {\n return /^<a[>\\s]/i.test(str);\n}\nfunction isLinkClose(str) {\n return /^<\\/a\\s*>/i.test(str);\n}\n\n\nmodule.exports = function linkify(state) {\n var i, j, l, tokens, token, currentToken, nodes, ln, text, pos, lastPos,\n level, htmlLinkLevel, url, fullUrl, urlText,\n blockTokens = state.tokens,\n links;\n\n if (!state.md.options.linkify) { return; }\n\n for (j = 0, l = blockTokens.length; j < l; j++) {\n if (blockTokens[j].type !== 'inline' ||\n !state.md.linkify.pretest(blockTokens[j].content)) {\n continue;\n }\n\n tokens = blockTokens[j].children;\n\n htmlLinkLevel = 0;\n\n // We scan from the end, to keep position when new tags added.\n // Use reversed logic in links start/end match\n for (i = tokens.length - 1; i >= 0; i--) {\n currentToken = tokens[i];\n\n // Skip content of markdown links\n if (currentToken.type === 'link_close') {\n i--;\n while (tokens[i].level !== currentToken.level && tokens[i].type !== 'link_open') {\n i--;\n }\n continue;\n }\n\n // Skip content of html tag links\n if (currentToken.type === 'html_inline') {\n if (isLinkOpen(currentToken.content) && htmlLinkLevel > 0) {\n htmlLinkLevel--;\n }\n if (isLinkClose(currentToken.content)) {\n htmlLinkLevel++;\n }\n }\n if (htmlLinkLevel > 0) { continue; }\n\n if (currentToken.type === 'text' && state.md.linkify.test(currentToken.content)) {\n\n text = currentToken.content;\n links = state.md.linkify.match(text);\n\n // Now split string to nodes\n nodes = [];\n level = currentToken.level;\n lastPos = 0;\n\n for (ln = 0; ln < links.length; ln++) {\n\n url = links[ln].url;\n fullUrl = state.md.normalizeLink(url);\n if (!state.md.validateLink(fullUrl)) { continue; }\n\n urlText = links[ln].text;\n\n // Linkifier might send raw hostnames like \"example.com\", where url\n // starts with domain name. So we prepend http:// in those cases,\n // and remove it afterwards.\n //\n if (!links[ln].schema) {\n urlText = state.md.normalizeLinkText('http://' + urlText).replace(/^http:\\/\\//, '');\n } else if (links[ln].schema === 'mailto:' && !/^mailto:/i.test(urlText)) {\n urlText = state.md.normalizeLinkText('mailto:' + urlText).replace(/^mailto:/, '');\n } else {\n urlText = state.md.normalizeLinkText(urlText);\n }\n\n pos = links[ln].index;\n\n if (pos > lastPos) {\n token = new state.Token('text', '', 0);\n token.content = text.slice(lastPos, pos);\n token.level = level;\n nodes.push(token);\n }\n\n token = new state.Token('link_open', 'a', 1);\n token.attrs = [ [ 'href', fullUrl ] ];\n token.level = level++;\n token.markup = 'linkify';\n token.info = 'auto';\n nodes.push(token);\n\n token = new state.Token('text', '', 0);\n token.content = urlText;\n token.level = level;\n nodes.push(token);\n\n token = new state.Token('link_close', 'a', -1);\n token.level = --level;\n token.markup = 'linkify';\n token.info = 'auto';\n nodes.push(token);\n\n lastPos = links[ln].lastIndex;\n }\n if (lastPos < text.length) {\n token = new state.Token('text', '', 0);\n token.content = text.slice(lastPos);\n token.level = level;\n nodes.push(token);\n }\n\n // replace current node\n blockTokens[j].children = tokens = arrayReplaceAt(tokens, i, nodes);\n }\n }\n }\n};\n","// Simple typographyc replacements\n//\n// (c) (C) → ©\n// (tm) (TM) → ™\n// (r) (R) → ®\n// +- → ±\n// (p) (P) -> §\n// ... → … (also ?.... → ?.., !.... → !..)\n// ???????? → ???, !!!!! → !!!, `,,` → `,`\n// -- → &ndash;, --- → &mdash;\n//\n'use strict';\n\n// TODO:\n// - fractionals 1/2, 1/4, 3/4 -> ½, ¼, ¾\n// - miltiplication 2 x 4 -> 2 × 4\n\nvar RARE_RE = /\\+-|\\.\\.|\\?\\?\\?\\?|!!!!|,,|--/;\n\n// Workaround for phantomjs - need regex without /g flag,\n// or root check will fail every second time\nvar SCOPED_ABBR_TEST_RE = /\\((c|tm|r|p)\\)/i;\n\nvar SCOPED_ABBR_RE = /\\((c|tm|r|p)\\)/ig;\nvar SCOPED_ABBR = {\n c: '©',\n r: '®',\n p: '§',\n tm: '™'\n};\n\nfunction replaceFn(match, name) {\n return SCOPED_ABBR[name.toLowerCase()];\n}\n\nfunction replace_scoped(inlineTokens) {\n var i, token, inside_autolink = 0;\n\n for (i = inlineTokens.length - 1; i >= 0; i--) {\n token = inlineTokens[i];\n\n if (token.type === 'text' && !inside_autolink) {\n token.content = token.content.replace(SCOPED_ABBR_RE, replaceFn);\n }\n\n if (token.type === 'link_open' && token.info === 'auto') {\n inside_autolink--;\n }\n\n if (token.type === 'link_close' && token.info === 'auto') {\n inside_autolink++;\n }\n }\n}\n\nfunction replace_rare(inlineTokens) {\n var i, token, inside_autolink = 0;\n\n for (i = inlineTokens.length - 1; i >= 0; i--) {\n token = inlineTokens[i];\n\n if (token.type === 'text' && !inside_autolink) {\n if (RARE_RE.test(token.content)) {\n token.content = token.content\n .replace(/\\+-/g, '±')\n // .., ..., ....... -> …\n // but ?..... & !..... -> ?.. & !..\n .replace(/\\.{2,}/g, '…').replace(/([?!])…/g, '$1..')\n .replace(/([?!]){4,}/g, '$1$1$1').replace(/,{2,}/g, ',')\n // em-dash\n .replace(/(^|[^-])---([^-]|$)/mg, '$1\\u2014$2')\n // en-dash\n .replace(/(^|\\s)--(\\s|$)/mg, '$1\\u2013$2')\n .replace(/(^|[^-\\s])--([^-\\s]|$)/mg, '$1\\u2013$2');\n }\n }\n\n if (token.type === 'link_open' && token.info === 'auto') {\n inside_autolink--;\n }\n\n if (token.type === 'link_close' && token.info === 'auto') {\n inside_autolink++;\n }\n }\n}\n\n\nmodule.exports = function replace(state) {\n var blkIdx;\n\n if (!state.md.options.typographer) { return; }\n\n for (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {\n\n if (state.tokens[blkIdx].type !== 'inline') { continue; }\n\n if (SCOPED_ABBR_TEST_RE.test(state.tokens[blkIdx].content)) {\n replace_scoped(state.tokens[blkIdx].children);\n }\n\n if (RARE_RE.test(state.tokens[blkIdx].content)) {\n replace_rare(state.tokens[blkIdx].children);\n }\n\n }\n};\n","// Convert straight quotation marks to typographic ones\n//\n'use strict';\n\n\nvar isWhiteSpace = require('../common/utils').isWhiteSpace;\nvar isPunctChar = require('../common/utils').isPunctChar;\nvar isMdAsciiPunct = require('../common/utils').isMdAsciiPunct;\n\nvar QUOTE_TEST_RE = /['\"]/;\nvar QUOTE_RE = /['\"]/g;\nvar APOSTROPHE = '\\u2019'; /* ’ */\n\n\nfunction replaceAt(str, index, ch) {\n return str.substr(0, index) + ch + str.substr(index + 1);\n}\n\nfunction process_inlines(tokens, state) {\n var i, token, text, t, pos, max, thisLevel, item, lastChar, nextChar,\n isLastPunctChar, isNextPunctChar, isLastWhiteSpace, isNextWhiteSpace,\n canOpen, canClose, j, isSingle, stack, openQuote, closeQuote;\n\n stack = [];\n\n for (i = 0; i < tokens.length; i++) {\n token = tokens[i];\n\n thisLevel = tokens[i].level;\n\n for (j = stack.length - 1; j >= 0; j--) {\n if (stack[j].level <= thisLevel) { break; }\n }\n stack.length = j + 1;\n\n if (token.type !== 'text') { continue; }\n\n text = token.content;\n pos = 0;\n max = text.length;\n\n /*eslint no-labels:0,block-scoped-var:0*/\n OUTER:\n while (pos < max) {\n QUOTE_RE.lastIndex = pos;\n t = QUOTE_RE.exec(text);\n if (!t) { break; }\n\n canOpen = canClose = true;\n pos = t.index + 1;\n isSingle = (t[0] === \"'\");\n\n // Find previous character,\n // default to space if it's the beginning of the line\n //\n lastChar = 0x20;\n\n if (t.index - 1 >= 0) {\n lastChar = text.charCodeAt(t.index - 1);\n } else {\n for (j = i - 1; j >= 0; j--) {\n if (tokens[j].type === 'softbreak' || tokens[j].type === 'hardbreak') break; // lastChar defaults to 0x20\n if (tokens[j].type !== 'text') continue;\n\n lastChar = tokens[j].content.charCodeAt(tokens[j].content.length - 1);\n break;\n }\n }\n\n // Find next character,\n // default to space if it's the end of the line\n //\n nextChar = 0x20;\n\n if (pos < max) {\n nextChar = text.charCodeAt(pos);\n } else {\n for (j = i + 1; j < tokens.length; j++) {\n if (tokens[j].type === 'softbreak' || tokens[j].type === 'hardbreak') break; // nextChar defaults to 0x20\n if (tokens[j].type !== 'text') continue;\n\n nextChar = tokens[j].content.charCodeAt(0);\n break;\n }\n }\n\n isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctChar(String.fromCharCode(lastChar));\n isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctChar(String.fromCharCode(nextChar));\n\n isLastWhiteSpace = isWhiteSpace(lastChar);\n isNextWhiteSpace = isWhiteSpace(nextChar);\n\n if (isNextWhiteSpace) {\n canOpen = false;\n } else if (isNextPunctChar) {\n if (!(isLastWhiteSpace || isLastPunctChar)) {\n canOpen = false;\n }\n }\n\n if (isLastWhiteSpace) {\n canClose = false;\n } else if (isLastPunctChar) {\n if (!(isNextWhiteSpace || isNextPunctChar)) {\n canClose = false;\n }\n }\n\n if (nextChar === 0x22 /* \" */ && t[0] === '\"') {\n if (lastChar >= 0x30 /* 0 */ && lastChar <= 0x39 /* 9 */) {\n // special case: 1\"\" - count first quote as an inch\n canClose = canOpen = false;\n }\n }\n\n if (canOpen && canClose) {\n // treat this as the middle of the word\n canOpen = false;\n canClose = isNextPunctChar;\n }\n\n if (!canOpen && !canClose) {\n // middle of word\n if (isSingle) {\n token.content = replaceAt(token.content, t.index, APOSTROPHE);\n }\n continue;\n }\n\n if (canClose) {\n // this could be a closing quote, rewind the stack to get a match\n for (j = stack.length - 1; j >= 0; j--) {\n item = stack[j];\n if (stack[j].level < thisLevel) { break; }\n if (item.single === isSingle && stack[j].level === thisLevel) {\n item = stack[j];\n\n if (isSingle) {\n openQuote = state.md.options.quotes[2];\n closeQuote = state.md.options.quotes[3];\n } else {\n openQuote = state.md.options.quotes[0];\n closeQuote = state.md.options.quotes[1];\n }\n\n // replace token.content *before* tokens[item.token].content,\n // because, if they are pointing at the same token, replaceAt\n // could mess up indices when quote length != 1\n token.content = replaceAt(token.content, t.index, closeQuote);\n tokens[item.token].content = replaceAt(\n tokens[item.token].content, item.pos, openQuote);\n\n pos += closeQuote.length - 1;\n if (item.token === i) { pos += openQuote.length - 1; }\n\n text = token.content;\n max = text.length;\n\n stack.length = j;\n continue OUTER;\n }\n }\n }\n\n if (canOpen) {\n stack.push({\n token: i,\n pos: t.index,\n single: isSingle,\n level: thisLevel\n });\n } else if (canClose && isSingle) {\n token.content = replaceAt(token.content, t.index, APOSTROPHE);\n }\n }\n }\n}\n\n\nmodule.exports = function smartquotes(state) {\n /*eslint max-depth:0*/\n var blkIdx;\n\n if (!state.md.options.typographer) { return; }\n\n for (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {\n\n if (state.tokens[blkIdx].type !== 'inline' ||\n !QUOTE_TEST_RE.test(state.tokens[blkIdx].content)) {\n continue;\n }\n\n process_inlines(state.tokens[blkIdx].children, state);\n }\n};\n","// Token class\n\n'use strict';\n\n\n/**\n * class Token\n **/\n\n/**\n * new Token(type, tag, nesting)\n *\n * Create new token and fill passed properties.\n **/\nfunction Token(type, tag, nesting) {\n /**\n * Token#type -> String\n *\n * Type of the token (string, e.g. \"paragraph_open\")\n **/\n this.type = type;\n\n /**\n * Token#tag -> String\n *\n * html tag name, e.g. \"p\"\n **/\n this.tag = tag;\n\n /**\n * Token#attrs -> Array\n *\n * Html attributes. Format: `[ [ name1, value1 ], [ name2, value2 ] ]`\n **/\n this.attrs = null;\n\n /**\n * Token#map -> Array\n *\n * Source map info. Format: `[ line_begin, line_end ]`\n **/\n this.map = null;\n\n /**\n * Token#nesting -> Number\n *\n * Level change (number in {-1, 0, 1} set), where:\n *\n * - `1` means the tag is opening\n * - `0` means the tag is self-closing\n * - `-1` means the tag is closing\n **/\n this.nesting = nesting;\n\n /**\n * Token#level -> Number\n *\n * nesting level, the same as `state.level`\n **/\n this.level = 0;\n\n /**\n * Token#children -> Array\n *\n * An array of child nodes (inline and img tokens)\n **/\n this.children = null;\n\n /**\n * Token#content -> String\n *\n * In a case of self-closing tag (code, html, fence, etc.),\n * it has contents of this tag.\n **/\n this.content = '';\n\n /**\n * Token#markup -> String\n *\n * '*' or '_' for emphasis, fence string for fence, etc.\n **/\n this.markup = '';\n\n /**\n * Token#info -> String\n *\n * fence infostring\n **/\n this.info = '';\n\n /**\n * Token#meta -> Object\n *\n * A place for plugins to store an arbitrary data\n **/\n this.meta = null;\n\n /**\n * Token#block -> Boolean\n *\n * True for block-level tokens, false for inline tokens.\n * Used in renderer to calculate line breaks\n **/\n this.block = false;\n\n /**\n * Token#hidden -> Boolean\n *\n * If it's true, ignore this element when rendering. Used for tight lists\n * to hide paragraphs.\n **/\n this.hidden = false;\n}\n\n\n/**\n * Token.attrIndex(name) -> Number\n *\n * Search attribute index by name.\n **/\nToken.prototype.attrIndex = function attrIndex(name) {\n var attrs, i, len;\n\n if (!this.attrs) { return -1; }\n\n attrs = this.attrs;\n\n for (i = 0, len = attrs.length; i < len; i++) {\n if (attrs[i][0] === name) { return i; }\n }\n return -1;\n};\n\n\n/**\n * Token.attrPush(attrData)\n *\n * Add `[ name, value ]` attribute to list. Init attrs if necessary\n **/\nToken.prototype.attrPush = function attrPush(attrData) {\n if (this.attrs) {\n this.attrs.push(attrData);\n } else {\n this.attrs = [ attrData ];\n }\n};\n\n\n/**\n * Token.attrSet(name, value)\n *\n * Set `name` attribute to `value`. Override old value if exists.\n **/\nToken.prototype.attrSet = function attrSet(name, value) {\n var idx = this.attrIndex(name),\n attrData = [ name, value ];\n\n if (idx < 0) {\n this.attrPush(attrData);\n } else {\n this.attrs[idx] = attrData;\n }\n};\n\n\n/**\n * Token.attrGet(name)\n *\n * Get the value of attribute `name`, or null if it does not exist.\n **/\nToken.prototype.attrGet = function attrGet(name) {\n var idx = this.attrIndex(name), value = null;\n if (idx >= 0) {\n value = this.attrs[idx][1];\n }\n return value;\n};\n\n\n/**\n * Token.attrJoin(name, value)\n *\n * Join value to existing attribute via space. Or create new attribute if not\n * exists. Useful to operate with token classes.\n **/\nToken.prototype.attrJoin = function attrJoin(name, value) {\n var idx = this.attrIndex(name);\n\n if (idx < 0) {\n this.attrPush([ name, value ]);\n } else {\n this.attrs[idx][1] = this.attrs[idx][1] + ' ' + value;\n }\n};\n\n\nmodule.exports = Token;\n","// Core state object\n//\n'use strict';\n\nvar Token = require('../token');\n\n\nfunction StateCore(src, md, env) {\n this.src = src;\n this.env = env;\n this.tokens = [];\n this.inlineMode = false;\n this.md = md; // link to parser instance\n}\n\n// re-export Token class to use in core rules\nStateCore.prototype.Token = Token;\n\n\nmodule.exports = StateCore;\n","/** internal\n * class Core\n *\n * Top-level rules executor. Glues block/inline parsers and does intermediate\n * transformations.\n **/\n'use strict';\n\n\nvar Ruler = require('./ruler');\n\n\nvar _rules = [\n [ 'normalize', require('./rules_core/normalize') ],\n [ 'block', require('./rules_core/block') ],\n [ 'inline', require('./rules_core/inline') ],\n [ 'linkify', require('./rules_core/linkify') ],\n [ 'replacements', require('./rules_core/replacements') ],\n [ 'smartquotes', require('./rules_core/smartquotes') ]\n];\n\n\n/**\n * new Core()\n **/\nfunction Core() {\n /**\n * Core#ruler -> Ruler\n *\n * [[Ruler]] instance. Keep configuration of core rules.\n **/\n this.ruler = new Ruler();\n\n for (var i = 0; i < _rules.length; i++) {\n this.ruler.push(_rules[i][0], _rules[i][1]);\n }\n}\n\n\n/**\n * Core.process(state)\n *\n * Executes core chain rules.\n **/\nCore.prototype.process = function (state) {\n var i, l, rules;\n\n rules = this.ruler.getRules('');\n\n for (i = 0, l = rules.length; i < l; i++) {\n rules[i](state);\n }\n};\n\nCore.prototype.State = require('./rules_core/state_core');\n\n\nmodule.exports = Core;\n","// GFM table, non-standard\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nfunction getLine(state, line) {\n var pos = state.bMarks[line] + state.blkIndent,\n max = state.eMarks[line];\n\n return state.src.substr(pos, max - pos);\n}\n\nfunction escapedSplit(str) {\n var result = [],\n pos = 0,\n max = str.length,\n ch,\n escapes = 0,\n lastPos = 0,\n backTicked = false,\n lastBackTick = 0;\n\n ch = str.charCodeAt(pos);\n\n while (pos < max) {\n if (ch === 0x60/* ` */) {\n if (backTicked) {\n // make \\` close code sequence, but not open it;\n // the reason is: `\\` is correct code block\n backTicked = false;\n lastBackTick = pos;\n } else if (escapes % 2 === 0) {\n backTicked = true;\n lastBackTick = pos;\n }\n } else if (ch === 0x7c/* | */ && (escapes % 2 === 0) && !backTicked) {\n result.push(str.substring(lastPos, pos));\n lastPos = pos + 1;\n }\n\n if (ch === 0x5c/* \\ */) {\n escapes++;\n } else {\n escapes = 0;\n }\n\n pos++;\n\n // If there was an un-closed backtick, go back to just after\n // the last backtick, but as if it was a normal character\n if (pos === max && backTicked) {\n backTicked = false;\n pos = lastBackTick + 1;\n }\n\n ch = str.charCodeAt(pos);\n }\n\n result.push(str.substring(lastPos));\n\n return result;\n}\n\n\nmodule.exports = function table(state, startLine, endLine, silent) {\n var ch, lineText, pos, i, nextLine, columns, columnCount, token,\n aligns, t, tableLines, tbodyLines;\n\n // should have at least two lines\n if (startLine + 2 > endLine) { return false; }\n\n nextLine = startLine + 1;\n\n if (state.sCount[nextLine] < state.blkIndent) { return false; }\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[nextLine] - state.blkIndent >= 4) { return false; }\n\n // first character of the second line should be '|', '-', ':',\n // and no other characters are allowed but spaces;\n // basically, this is the equivalent of /^[-:|][-:|\\s]*$/ regexp\n\n pos = state.bMarks[nextLine] + state.tShift[nextLine];\n if (pos >= state.eMarks[nextLine]) { return false; }\n\n ch = state.src.charCodeAt(pos++);\n if (ch !== 0x7C/* | */ && ch !== 0x2D/* - */ && ch !== 0x3A/* : */) { return false; }\n\n while (pos < state.eMarks[nextLine]) {\n ch = state.src.charCodeAt(pos);\n\n if (ch !== 0x7C/* | */ && ch !== 0x2D/* - */ && ch !== 0x3A/* : */ && !isSpace(ch)) { return false; }\n\n pos++;\n }\n\n lineText = getLine(state, startLine + 1);\n\n columns = lineText.split('|');\n aligns = [];\n for (i = 0; i < columns.length; i++) {\n t = columns[i].trim();\n if (!t) {\n // allow empty columns before and after table, but not in between columns;\n // e.g. allow ` |---| `, disallow ` ---||--- `\n if (i === 0 || i === columns.length - 1) {\n continue;\n } else {\n return false;\n }\n }\n\n if (!/^:?-+:?$/.test(t)) { return false; }\n if (t.charCodeAt(t.length - 1) === 0x3A/* : */) {\n aligns.push(t.charCodeAt(0) === 0x3A/* : */ ? 'center' : 'right');\n } else if (t.charCodeAt(0) === 0x3A/* : */) {\n aligns.push('left');\n } else {\n aligns.push('');\n }\n }\n\n lineText = getLine(state, startLine).trim();\n if (lineText.indexOf('|') === -1) { return false; }\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n columns = escapedSplit(lineText.replace(/^\\||\\|$/g, ''));\n\n // header row will define an amount of columns in the entire table,\n // and align row shouldn't be smaller than that (the rest of the rows can)\n columnCount = columns.length;\n if (columnCount > aligns.length) { return false; }\n\n if (silent) { return true; }\n\n token = state.push('table_open', 'table', 1);\n token.map = tableLines = [ startLine, 0 ];\n\n token = state.push('thead_open', 'thead', 1);\n token.map = [ startLine, startLine + 1 ];\n\n token = state.push('tr_open', 'tr', 1);\n token.map = [ startLine, startLine + 1 ];\n\n for (i = 0; i < columns.length; i++) {\n token = state.push('th_open', 'th', 1);\n token.map = [ startLine, startLine + 1 ];\n if (aligns[i]) {\n token.attrs = [ [ 'style', 'text-align:' + aligns[i] ] ];\n }\n\n token = state.push('inline', '', 0);\n token.content = columns[i].trim();\n token.map = [ startLine, startLine + 1 ];\n token.children = [];\n\n token = state.push('th_close', 'th', -1);\n }\n\n token = state.push('tr_close', 'tr', -1);\n token = state.push('thead_close', 'thead', -1);\n\n token = state.push('tbody_open', 'tbody', 1);\n token.map = tbodyLines = [ startLine + 2, 0 ];\n\n for (nextLine = startLine + 2; nextLine < endLine; nextLine++) {\n if (state.sCount[nextLine] < state.blkIndent) { break; }\n\n lineText = getLine(state, nextLine).trim();\n if (lineText.indexOf('|') === -1) { break; }\n if (state.sCount[nextLine] - state.blkIndent >= 4) { break; }\n columns = escapedSplit(lineText.replace(/^\\||\\|$/g, ''));\n\n token = state.push('tr_open', 'tr', 1);\n for (i = 0; i < columnCount; i++) {\n token = state.push('td_open', 'td', 1);\n if (aligns[i]) {\n token.attrs = [ [ 'style', 'text-align:' + aligns[i] ] ];\n }\n\n token = state.push('inline', '', 0);\n token.content = columns[i] ? columns[i].trim() : '';\n token.children = [];\n\n token = state.push('td_close', 'td', -1);\n }\n token = state.push('tr_close', 'tr', -1);\n }\n token = state.push('tbody_close', 'tbody', -1);\n token = state.push('table_close', 'table', -1);\n\n tableLines[1] = tbodyLines[1] = nextLine;\n state.line = nextLine;\n return true;\n};\n","// Code block (4 spaces padded)\n\n'use strict';\n\n\nmodule.exports = function code(state, startLine, endLine/*, silent*/) {\n var nextLine, last, token;\n\n if (state.sCount[startLine] - state.blkIndent < 4) { return false; }\n\n last = nextLine = startLine + 1;\n\n while (nextLine < endLine) {\n if (state.isEmpty(nextLine)) {\n nextLine++;\n continue;\n }\n\n if (state.sCount[nextLine] - state.blkIndent >= 4) {\n nextLine++;\n last = nextLine;\n continue;\n }\n break;\n }\n\n state.line = last;\n\n token = state.push('code_block', 'code', 0);\n token.content = state.getLines(startLine, last, 4 + state.blkIndent, true);\n token.map = [ startLine, state.line ];\n\n return true;\n};\n","// fences (``` lang, ~~~ lang)\n\n'use strict';\n\n\nmodule.exports = function fence(state, startLine, endLine, silent) {\n var marker, len, params, nextLine, mem, token, markup,\n haveEndMarker = false,\n pos = state.bMarks[startLine] + state.tShift[startLine],\n max = state.eMarks[startLine];\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n if (pos + 3 > max) { return false; }\n\n marker = state.src.charCodeAt(pos);\n\n if (marker !== 0x7E/* ~ */ && marker !== 0x60 /* ` */) {\n return false;\n }\n\n // scan marker length\n mem = pos;\n pos = state.skipChars(pos, marker);\n\n len = pos - mem;\n\n if (len < 3) { return false; }\n\n markup = state.src.slice(mem, pos);\n params = state.src.slice(pos, max);\n\n if (params.indexOf(String.fromCharCode(marker)) >= 0) { return false; }\n\n // Since start is found, we can report success here in validation mode\n if (silent) { return true; }\n\n // search end of block\n nextLine = startLine;\n\n for (;;) {\n nextLine++;\n if (nextLine >= endLine) {\n // unclosed block should be autoclosed by end of document.\n // also block seems to be autoclosed by end of parent\n break;\n }\n\n pos = mem = state.bMarks[nextLine] + state.tShift[nextLine];\n max = state.eMarks[nextLine];\n\n if (pos < max && state.sCount[nextLine] < state.blkIndent) {\n // non-empty line with negative indent should stop the list:\n // - ```\n // test\n break;\n }\n\n if (state.src.charCodeAt(pos) !== marker) { continue; }\n\n if (state.sCount[nextLine] - state.blkIndent >= 4) {\n // closing fence should be indented less than 4 spaces\n continue;\n }\n\n pos = state.skipChars(pos, marker);\n\n // closing code fence must be at least as long as the opening one\n if (pos - mem < len) { continue; }\n\n // make sure tail has spaces only\n pos = state.skipSpaces(pos);\n\n if (pos < max) { continue; }\n\n haveEndMarker = true;\n // found!\n break;\n }\n\n // If a fence has heading spaces, they should be removed from its inner block\n len = state.sCount[startLine];\n\n state.line = nextLine + (haveEndMarker ? 1 : 0);\n\n token = state.push('fence', 'code', 0);\n token.info = params;\n token.content = state.getLines(startLine + 1, nextLine, len, true);\n token.markup = markup;\n token.map = [ startLine, state.line ];\n\n return true;\n};\n","// Block quotes\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function blockquote(state, startLine, endLine, silent) {\n var adjustTab,\n ch,\n i,\n initial,\n l,\n lastLineEmpty,\n lines,\n nextLine,\n offset,\n oldBMarks,\n oldBSCount,\n oldIndent,\n oldParentType,\n oldSCount,\n oldTShift,\n spaceAfterMarker,\n terminate,\n terminatorRules,\n token,\n wasOutdented,\n oldLineMax = state.lineMax,\n pos = state.bMarks[startLine] + state.tShift[startLine],\n max = state.eMarks[startLine];\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n // check the block quote marker\n if (state.src.charCodeAt(pos++) !== 0x3E/* > */) { return false; }\n\n // we know that it's going to be a valid blockquote,\n // so no point trying to find the end of it in silent mode\n if (silent) { return true; }\n\n // skip spaces after \">\" and re-calculate offset\n initial = offset = state.sCount[startLine] + pos - (state.bMarks[startLine] + state.tShift[startLine]);\n\n // skip one optional space after '>'\n if (state.src.charCodeAt(pos) === 0x20 /* space */) {\n // ' > test '\n // ^ -- position start of line here:\n pos++;\n initial++;\n offset++;\n adjustTab = false;\n spaceAfterMarker = true;\n } else if (state.src.charCodeAt(pos) === 0x09 /* tab */) {\n spaceAfterMarker = true;\n\n if ((state.bsCount[startLine] + offset) % 4 === 3) {\n // ' >\\t test '\n // ^ -- position start of line here (tab has width===1)\n pos++;\n initial++;\n offset++;\n adjustTab = false;\n } else {\n // ' >\\t test '\n // ^ -- position start of line here + shift bsCount slightly\n // to make extra space appear\n adjustTab = true;\n }\n } else {\n spaceAfterMarker = false;\n }\n\n oldBMarks = [ state.bMarks[startLine] ];\n state.bMarks[startLine] = pos;\n\n while (pos < max) {\n ch = state.src.charCodeAt(pos);\n\n if (isSpace(ch)) {\n if (ch === 0x09) {\n offset += 4 - (offset + state.bsCount[startLine] + (adjustTab ? 1 : 0)) % 4;\n } else {\n offset++;\n }\n } else {\n break;\n }\n\n pos++;\n }\n\n oldBSCount = [ state.bsCount[startLine] ];\n state.bsCount[startLine] = state.sCount[startLine] + 1 + (spaceAfterMarker ? 1 : 0);\n\n lastLineEmpty = pos >= max;\n\n oldSCount = [ state.sCount[startLine] ];\n state.sCount[startLine] = offset - initial;\n\n oldTShift = [ state.tShift[startLine] ];\n state.tShift[startLine] = pos - state.bMarks[startLine];\n\n terminatorRules = state.md.block.ruler.getRules('blockquote');\n\n oldParentType = state.parentType;\n state.parentType = 'blockquote';\n wasOutdented = false;\n\n // Search the end of the block\n //\n // Block ends with either:\n // 1. an empty line outside:\n // ```\n // > test\n //\n // ```\n // 2. an empty line inside:\n // ```\n // >\n // test\n // ```\n // 3. another tag:\n // ```\n // > test\n // - - -\n // ```\n for (nextLine = startLine + 1; nextLine < endLine; nextLine++) {\n // check if it's outdented, i.e. it's inside list item and indented\n // less than said list item:\n //\n // ```\n // 1. anything\n // > current blockquote\n // 2. checking this line\n // ```\n if (state.sCount[nextLine] < state.blkIndent) wasOutdented = true;\n\n pos = state.bMarks[nextLine] + state.tShift[nextLine];\n max = state.eMarks[nextLine];\n\n if (pos >= max) {\n // Case 1: line is not inside the blockquote, and this line is empty.\n break;\n }\n\n if (state.src.charCodeAt(pos++) === 0x3E/* > */ && !wasOutdented) {\n // This line is inside the blockquote.\n\n // skip spaces after \">\" and re-calculate offset\n initial = offset = state.sCount[nextLine] + pos - (state.bMarks[nextLine] + state.tShift[nextLine]);\n\n // skip one optional space after '>'\n if (state.src.charCodeAt(pos) === 0x20 /* space */) {\n // ' > test '\n // ^ -- position start of line here:\n pos++;\n initial++;\n offset++;\n adjustTab = false;\n spaceAfterMarker = true;\n } else if (state.src.charCodeAt(pos) === 0x09 /* tab */) {\n spaceAfterMarker = true;\n\n if ((state.bsCount[nextLine] + offset) % 4 === 3) {\n // ' >\\t test '\n // ^ -- position start of line here (tab has width===1)\n pos++;\n initial++;\n offset++;\n adjustTab = false;\n } else {\n // ' >\\t test '\n // ^ -- position start of line here + shift bsCount slightly\n // to make extra space appear\n adjustTab = true;\n }\n } else {\n spaceAfterMarker = false;\n }\n\n oldBMarks.push(state.bMarks[nextLine]);\n state.bMarks[nextLine] = pos;\n\n while (pos < max) {\n ch = state.src.charCodeAt(pos);\n\n if (isSpace(ch)) {\n if (ch === 0x09) {\n offset += 4 - (offset + state.bsCount[nextLine] + (adjustTab ? 1 : 0)) % 4;\n } else {\n offset++;\n }\n } else {\n break;\n }\n\n pos++;\n }\n\n lastLineEmpty = pos >= max;\n\n oldBSCount.push(state.bsCount[nextLine]);\n state.bsCount[nextLine] = state.sCount[nextLine] + 1 + (spaceAfterMarker ? 1 : 0);\n\n oldSCount.push(state.sCount[nextLine]);\n state.sCount[nextLine] = offset - initial;\n\n oldTShift.push(state.tShift[nextLine]);\n state.tShift[nextLine] = pos - state.bMarks[nextLine];\n continue;\n }\n\n // Case 2: line is not inside the blockquote, and the last line was empty.\n if (lastLineEmpty) { break; }\n\n // Case 3: another tag found.\n terminate = false;\n for (i = 0, l = terminatorRules.length; i < l; i++) {\n if (terminatorRules[i](state, nextLine, endLine, true)) {\n terminate = true;\n break;\n }\n }\n\n if (terminate) {\n // Quirk to enforce \"hard termination mode\" for paragraphs;\n // normally if you call `tokenize(state, startLine, nextLine)`,\n // paragraphs will look below nextLine for paragraph continuation,\n // but if blockquote is terminated by another tag, they shouldn't\n state.lineMax = nextLine;\n\n if (state.blkIndent !== 0) {\n // state.blkIndent was non-zero, we now set it to zero,\n // so we need to re-calculate all offsets to appear as\n // if indent wasn't changed\n oldBMarks.push(state.bMarks[nextLine]);\n oldBSCount.push(state.bsCount[nextLine]);\n oldTShift.push(state.tShift[nextLine]);\n oldSCount.push(state.sCount[nextLine]);\n state.sCount[nextLine] -= state.blkIndent;\n }\n\n break;\n }\n\n oldBMarks.push(state.bMarks[nextLine]);\n oldBSCount.push(state.bsCount[nextLine]);\n oldTShift.push(state.tShift[nextLine]);\n oldSCount.push(state.sCount[nextLine]);\n\n // A negative indentation means that this is a paragraph continuation\n //\n state.sCount[nextLine] = -1;\n }\n\n oldIndent = state.blkIndent;\n state.blkIndent = 0;\n\n token = state.push('blockquote_open', 'blockquote', 1);\n token.markup = '>';\n token.map = lines = [ startLine, 0 ];\n\n state.md.block.tokenize(state, startLine, nextLine);\n\n token = state.push('blockquote_close', 'blockquote', -1);\n token.markup = '>';\n\n state.lineMax = oldLineMax;\n state.parentType = oldParentType;\n lines[1] = state.line;\n\n // Restore original tShift; this might not be necessary since the parser\n // has already been here, but just to make sure we can do that.\n for (i = 0; i < oldTShift.length; i++) {\n state.bMarks[i + startLine] = oldBMarks[i];\n state.tShift[i + startLine] = oldTShift[i];\n state.sCount[i + startLine] = oldSCount[i];\n state.bsCount[i + startLine] = oldBSCount[i];\n }\n state.blkIndent = oldIndent;\n\n return true;\n};\n","// Horizontal rule\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function hr(state, startLine, endLine, silent) {\n var marker, cnt, ch, token,\n pos = state.bMarks[startLine] + state.tShift[startLine],\n max = state.eMarks[startLine];\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n marker = state.src.charCodeAt(pos++);\n\n // Check hr marker\n if (marker !== 0x2A/* * */ &&\n marker !== 0x2D/* - */ &&\n marker !== 0x5F/* _ */) {\n return false;\n }\n\n // markers can be mixed with spaces, but there should be at least 3 of them\n\n cnt = 1;\n while (pos < max) {\n ch = state.src.charCodeAt(pos++);\n if (ch !== marker && !isSpace(ch)) { return false; }\n if (ch === marker) { cnt++; }\n }\n\n if (cnt < 3) { return false; }\n\n if (silent) { return true; }\n\n state.line = startLine + 1;\n\n token = state.push('hr', 'hr', 0);\n token.map = [ startLine, state.line ];\n token.markup = Array(cnt + 1).join(String.fromCharCode(marker));\n\n return true;\n};\n","// Lists\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\n// Search `[-+*][\\n ]`, returns next pos after marker on success\n// or -1 on fail.\nfunction skipBulletListMarker(state, startLine) {\n var marker, pos, max, ch;\n\n pos = state.bMarks[startLine] + state.tShift[startLine];\n max = state.eMarks[startLine];\n\n marker = state.src.charCodeAt(pos++);\n // Check bullet\n if (marker !== 0x2A/* * */ &&\n marker !== 0x2D/* - */ &&\n marker !== 0x2B/* + */) {\n return -1;\n }\n\n if (pos < max) {\n ch = state.src.charCodeAt(pos);\n\n if (!isSpace(ch)) {\n // \" -test \" - is not a list item\n return -1;\n }\n }\n\n return pos;\n}\n\n// Search `\\d+[.)][\\n ]`, returns next pos after marker on success\n// or -1 on fail.\nfunction skipOrderedListMarker(state, startLine) {\n var ch,\n start = state.bMarks[startLine] + state.tShift[startLine],\n pos = start,\n max = state.eMarks[startLine];\n\n // List marker should have at least 2 chars (digit + dot)\n if (pos + 1 >= max) { return -1; }\n\n ch = state.src.charCodeAt(pos++);\n\n if (ch < 0x30/* 0 */ || ch > 0x39/* 9 */) { return -1; }\n\n for (;;) {\n // EOL -> fail\n if (pos >= max) { return -1; }\n\n ch = state.src.charCodeAt(pos++);\n\n if (ch >= 0x30/* 0 */ && ch <= 0x39/* 9 */) {\n\n // List marker should have no more than 9 digits\n // (prevents integer overflow in browsers)\n if (pos - start >= 10) { return -1; }\n\n continue;\n }\n\n // found valid marker\n if (ch === 0x29/* ) */ || ch === 0x2e/* . */) {\n break;\n }\n\n return -1;\n }\n\n\n if (pos < max) {\n ch = state.src.charCodeAt(pos);\n\n if (!isSpace(ch)) {\n // \" 1.test \" - is not a list item\n return -1;\n }\n }\n return pos;\n}\n\nfunction markTightParagraphs(state, idx) {\n var i, l,\n level = state.level + 2;\n\n for (i = idx + 2, l = state.tokens.length - 2; i < l; i++) {\n if (state.tokens[i].level === level && state.tokens[i].type === 'paragraph_open') {\n state.tokens[i + 2].hidden = true;\n state.tokens[i].hidden = true;\n i += 2;\n }\n }\n}\n\n\nmodule.exports = function list(state, startLine, endLine, silent) {\n var ch,\n contentStart,\n i,\n indent,\n indentAfterMarker,\n initial,\n isOrdered,\n itemLines,\n l,\n listLines,\n listTokIdx,\n markerCharCode,\n markerValue,\n max,\n nextLine,\n offset,\n oldIndent,\n oldLIndent,\n oldParentType,\n oldTShift,\n oldTight,\n pos,\n posAfterMarker,\n prevEmptyEnd,\n start,\n terminate,\n terminatorRules,\n token,\n isTerminatingParagraph = false,\n tight = true;\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n // limit conditions when list can interrupt\n // a paragraph (validation mode only)\n if (silent && state.parentType === 'paragraph') {\n // Next list item should still terminate previous list item;\n //\n // This code can fail if plugins use blkIndent as well as lists,\n // but I hope the spec gets fixed long before that happens.\n //\n if (state.tShift[startLine] >= state.blkIndent) {\n isTerminatingParagraph = true;\n }\n }\n\n // Detect list type and position after marker\n if ((posAfterMarker = skipOrderedListMarker(state, startLine)) >= 0) {\n isOrdered = true;\n start = state.bMarks[startLine] + state.tShift[startLine];\n markerValue = Number(state.src.substr(start, posAfterMarker - start - 1));\n\n // If we're starting a new ordered list right after\n // a paragraph, it should start with 1.\n if (isTerminatingParagraph && markerValue !== 1) return false;\n\n } else if ((posAfterMarker = skipBulletListMarker(state, startLine)) >= 0) {\n isOrdered = false;\n\n } else {\n return false;\n }\n\n // If we're starting a new unordered list right after\n // a paragraph, first line should not be empty.\n if (isTerminatingParagraph) {\n if (state.skipSpaces(posAfterMarker) >= state.eMarks[startLine]) return false;\n }\n\n // We should terminate list on style change. Remember first one to compare.\n markerCharCode = state.src.charCodeAt(posAfterMarker - 1);\n\n // For validation mode we can terminate immediately\n if (silent) { return true; }\n\n // Start list\n listTokIdx = state.tokens.length;\n\n if (isOrdered) {\n token = state.push('ordered_list_open', 'ol', 1);\n if (markerValue !== 1) {\n token.attrs = [ [ 'start', markerValue ] ];\n }\n\n } else {\n token = state.push('bullet_list_open', 'ul', 1);\n }\n\n token.map = listLines = [ startLine, 0 ];\n token.markup = String.fromCharCode(markerCharCode);\n\n //\n // Iterate list items\n //\n\n nextLine = startLine;\n prevEmptyEnd = false;\n terminatorRules = state.md.block.ruler.getRules('list');\n\n oldParentType = state.parentType;\n state.parentType = 'list';\n\n while (nextLine < endLine) {\n pos = posAfterMarker;\n max = state.eMarks[nextLine];\n\n initial = offset = state.sCount[nextLine] + posAfterMarker - (state.bMarks[startLine] + state.tShift[startLine]);\n\n while (pos < max) {\n ch = state.src.charCodeAt(pos);\n\n if (ch === 0x09) {\n offset += 4 - (offset + state.bsCount[nextLine]) % 4;\n } else if (ch === 0x20) {\n offset++;\n } else {\n break;\n }\n\n pos++;\n }\n\n contentStart = pos;\n\n if (contentStart >= max) {\n // trimming space in \"- \\n 3\" case, indent is 1 here\n indentAfterMarker = 1;\n } else {\n indentAfterMarker = offset - initial;\n }\n\n // If we have more than 4 spaces, the indent is 1\n // (the rest is just indented code block)\n if (indentAfterMarker > 4) { indentAfterMarker = 1; }\n\n // \" - test\"\n // ^^^^^ - calculating total length of this thing\n indent = initial + indentAfterMarker;\n\n // Run subparser & write tokens\n token = state.push('list_item_open', 'li', 1);\n token.markup = String.fromCharCode(markerCharCode);\n token.map = itemLines = [ startLine, 0 ];\n\n oldIndent = state.blkIndent;\n oldTight = state.tight;\n oldTShift = state.tShift[startLine];\n oldLIndent = state.sCount[startLine];\n state.blkIndent = indent;\n state.tight = true;\n state.tShift[startLine] = contentStart - state.bMarks[startLine];\n state.sCount[startLine] = offset;\n\n if (contentStart >= max && state.isEmpty(startLine + 1)) {\n // workaround for this case\n // (list item is empty, list terminates before \"foo\"):\n // ~~~~~~~~\n // -\n //\n // foo\n // ~~~~~~~~\n state.line = Math.min(state.line + 2, endLine);\n } else {\n state.md.block.tokenize(state, startLine, endLine, true);\n }\n\n // If any of list item is tight, mark list as tight\n if (!state.tight || prevEmptyEnd) {\n tight = false;\n }\n // Item become loose if finish with empty line,\n // but we should filter last element, because it means list finish\n prevEmptyEnd = (state.line - startLine) > 1 && state.isEmpty(state.line - 1);\n\n state.blkIndent = oldIndent;\n state.tShift[startLine] = oldTShift;\n state.sCount[startLine] = oldLIndent;\n state.tight = oldTight;\n\n token = state.push('list_item_close', 'li', -1);\n token.markup = String.fromCharCode(markerCharCode);\n\n nextLine = startLine = state.line;\n itemLines[1] = nextLine;\n contentStart = state.bMarks[startLine];\n\n if (nextLine >= endLine) { break; }\n\n //\n // Try to check if list is terminated or continued.\n //\n if (state.sCount[nextLine] < state.blkIndent) { break; }\n\n // fail if terminating block found\n terminate = false;\n for (i = 0, l = terminatorRules.length; i < l; i++) {\n if (terminatorRules[i](state, nextLine, endLine, true)) {\n terminate = true;\n break;\n }\n }\n if (terminate) { break; }\n\n // fail if list has another type\n if (isOrdered) {\n posAfterMarker = skipOrderedListMarker(state, nextLine);\n if (posAfterMarker < 0) { break; }\n } else {\n posAfterMarker = skipBulletListMarker(state, nextLine);\n if (posAfterMarker < 0) { break; }\n }\n\n if (markerCharCode !== state.src.charCodeAt(posAfterMarker - 1)) { break; }\n }\n\n // Finalize list\n if (isOrdered) {\n token = state.push('ordered_list_close', 'ol', -1);\n } else {\n token = state.push('bullet_list_close', 'ul', -1);\n }\n token.markup = String.fromCharCode(markerCharCode);\n\n listLines[1] = nextLine;\n state.line = nextLine;\n\n state.parentType = oldParentType;\n\n // mark paragraphs tight if needed\n if (tight) {\n markTightParagraphs(state, listTokIdx);\n }\n\n return true;\n};\n","'use strict';\n\n\nvar normalizeReference = require('../common/utils').normalizeReference;\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function reference(state, startLine, _endLine, silent) {\n var ch,\n destEndPos,\n destEndLineNo,\n endLine,\n href,\n i,\n l,\n label,\n labelEnd,\n oldParentType,\n res,\n start,\n str,\n terminate,\n terminatorRules,\n title,\n lines = 0,\n pos = state.bMarks[startLine] + state.tShift[startLine],\n max = state.eMarks[startLine],\n nextLine = startLine + 1;\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n if (state.src.charCodeAt(pos) !== 0x5B/* [ */) { return false; }\n\n // Simple check to quickly interrupt scan on [link](url) at the start of line.\n // Can be useful on practice: https://github.com/markdown-it/markdown-it/issues/54\n while (++pos < max) {\n if (state.src.charCodeAt(pos) === 0x5D /* ] */ &&\n state.src.charCodeAt(pos - 1) !== 0x5C/* \\ */) {\n if (pos + 1 === max) { return false; }\n if (state.src.charCodeAt(pos + 1) !== 0x3A/* : */) { return false; }\n break;\n }\n }\n\n endLine = state.lineMax;\n\n // jump line-by-line until empty one or EOF\n terminatorRules = state.md.block.ruler.getRules('reference');\n\n oldParentType = state.parentType;\n state.parentType = 'reference';\n\n for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n // this would be a code block normally, but after paragraph\n // it's considered a lazy continuation regardless of what's there\n if (state.sCount[nextLine] - state.blkIndent > 3) { continue; }\n\n // quirk for blockquotes, this line should already be checked by that rule\n if (state.sCount[nextLine] < 0) { continue; }\n\n // Some tags can terminate paragraph without empty line.\n terminate = false;\n for (i = 0, l = terminatorRules.length; i < l; i++) {\n if (terminatorRules[i](state, nextLine, endLine, true)) {\n terminate = true;\n break;\n }\n }\n if (terminate) { break; }\n }\n\n str = state.getLines(startLine, nextLine, state.blkIndent, false).trim();\n max = str.length;\n\n for (pos = 1; pos < max; pos++) {\n ch = str.charCodeAt(pos);\n if (ch === 0x5B /* [ */) {\n return false;\n } else if (ch === 0x5D /* ] */) {\n labelEnd = pos;\n break;\n } else if (ch === 0x0A /* \\n */) {\n lines++;\n } else if (ch === 0x5C /* \\ */) {\n pos++;\n if (pos < max && str.charCodeAt(pos) === 0x0A) {\n lines++;\n }\n }\n }\n\n if (labelEnd < 0 || str.charCodeAt(labelEnd + 1) !== 0x3A/* : */) { return false; }\n\n // [label]: destination 'title'\n // ^^^ skip optional whitespace here\n for (pos = labelEnd + 2; pos < max; pos++) {\n ch = str.charCodeAt(pos);\n if (ch === 0x0A) {\n lines++;\n } else if (isSpace(ch)) {\n /*eslint no-empty:0*/\n } else {\n break;\n }\n }\n\n // [label]: destination 'title'\n // ^^^^^^^^^^^ parse this\n res = state.md.helpers.parseLinkDestination(str, pos, max);\n if (!res.ok) { return false; }\n\n href = state.md.normalizeLink(res.str);\n if (!state.md.validateLink(href)) { return false; }\n\n pos = res.pos;\n lines += res.lines;\n\n // save cursor state, we could require to rollback later\n destEndPos = pos;\n destEndLineNo = lines;\n\n // [label]: destination 'title'\n // ^^^ skipping those spaces\n start = pos;\n for (; pos < max; pos++) {\n ch = str.charCodeAt(pos);\n if (ch === 0x0A) {\n lines++;\n } else if (isSpace(ch)) {\n /*eslint no-empty:0*/\n } else {\n break;\n }\n }\n\n // [label]: destination 'title'\n // ^^^^^^^ parse this\n res = state.md.helpers.parseLinkTitle(str, pos, max);\n if (pos < max && start !== pos && res.ok) {\n title = res.str;\n pos = res.pos;\n lines += res.lines;\n } else {\n title = '';\n pos = destEndPos;\n lines = destEndLineNo;\n }\n\n // skip trailing spaces until the rest of the line\n while (pos < max) {\n ch = str.charCodeAt(pos);\n if (!isSpace(ch)) { break; }\n pos++;\n }\n\n if (pos < max && str.charCodeAt(pos) !== 0x0A) {\n if (title) {\n // garbage at the end of the line after title,\n // but it could still be a valid reference if we roll back\n title = '';\n pos = destEndPos;\n lines = destEndLineNo;\n while (pos < max) {\n ch = str.charCodeAt(pos);\n if (!isSpace(ch)) { break; }\n pos++;\n }\n }\n }\n\n if (pos < max && str.charCodeAt(pos) !== 0x0A) {\n // garbage at the end of the line\n return false;\n }\n\n label = normalizeReference(str.slice(1, labelEnd));\n if (!label) {\n // CommonMark 0.20 disallows empty labels\n return false;\n }\n\n // Reference can not terminate anything. This check is for safety only.\n /*istanbul ignore if*/\n if (silent) { return true; }\n\n if (typeof state.env.references === 'undefined') {\n state.env.references = {};\n }\n if (typeof state.env.references[label] === 'undefined') {\n state.env.references[label] = { title: title, href: href };\n }\n\n state.parentType = oldParentType;\n\n state.line = startLine + lines + 1;\n return true;\n};\n","// heading (#, ##, ...)\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function heading(state, startLine, endLine, silent) {\n var ch, level, tmp, token,\n pos = state.bMarks[startLine] + state.tShift[startLine],\n max = state.eMarks[startLine];\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n ch = state.src.charCodeAt(pos);\n\n if (ch !== 0x23/* # */ || pos >= max) { return false; }\n\n // count heading level\n level = 1;\n ch = state.src.charCodeAt(++pos);\n while (ch === 0x23/* # */ && pos < max && level <= 6) {\n level++;\n ch = state.src.charCodeAt(++pos);\n }\n\n if (level > 6 || (pos < max && !isSpace(ch))) { return false; }\n\n if (silent) { return true; }\n\n // Let's cut tails like ' ### ' from the end of string\n\n max = state.skipSpacesBack(max, pos);\n tmp = state.skipCharsBack(max, 0x23, pos); // #\n if (tmp > pos && isSpace(state.src.charCodeAt(tmp - 1))) {\n max = tmp;\n }\n\n state.line = startLine + 1;\n\n token = state.push('heading_open', 'h' + String(level), 1);\n token.markup = '########'.slice(0, level);\n token.map = [ startLine, state.line ];\n\n token = state.push('inline', '', 0);\n token.content = state.src.slice(pos, max).trim();\n token.map = [ startLine, state.line ];\n token.children = [];\n\n token = state.push('heading_close', 'h' + String(level), -1);\n token.markup = '########'.slice(0, level);\n\n return true;\n};\n","// lheading (---, ===)\n\n'use strict';\n\n\nmodule.exports = function lheading(state, startLine, endLine/*, silent*/) {\n var content, terminate, i, l, token, pos, max, level, marker,\n nextLine = startLine + 1, oldParentType,\n terminatorRules = state.md.block.ruler.getRules('paragraph');\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n oldParentType = state.parentType;\n state.parentType = 'paragraph'; // use paragraph to match terminatorRules\n\n // jump line-by-line until empty one or EOF\n for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n // this would be a code block normally, but after paragraph\n // it's considered a lazy continuation regardless of what's there\n if (state.sCount[nextLine] - state.blkIndent > 3) { continue; }\n\n //\n // Check for underline in setext header\n //\n if (state.sCount[nextLine] >= state.blkIndent) {\n pos = state.bMarks[nextLine] + state.tShift[nextLine];\n max = state.eMarks[nextLine];\n\n if (pos < max) {\n marker = state.src.charCodeAt(pos);\n\n if (marker === 0x2D/* - */ || marker === 0x3D/* = */) {\n pos = state.skipChars(pos, marker);\n pos = state.skipSpaces(pos);\n\n if (pos >= max) {\n level = (marker === 0x3D/* = */ ? 1 : 2);\n break;\n }\n }\n }\n }\n\n // quirk for blockquotes, this line should already be checked by that rule\n if (state.sCount[nextLine] < 0) { continue; }\n\n // Some tags can terminate paragraph without empty line.\n terminate = false;\n for (i = 0, l = terminatorRules.length; i < l; i++) {\n if (terminatorRules[i](state, nextLine, endLine, true)) {\n terminate = true;\n break;\n }\n }\n if (terminate) { break; }\n }\n\n if (!level) {\n // Didn't find valid underline\n return false;\n }\n\n content = state.getLines(startLine, nextLine, state.blkIndent, false).trim();\n\n state.line = nextLine + 1;\n\n token = state.push('heading_open', 'h' + String(level), 1);\n token.markup = String.fromCharCode(marker);\n token.map = [ startLine, state.line ];\n\n token = state.push('inline', '', 0);\n token.content = content;\n token.map = [ startLine, state.line - 1 ];\n token.children = [];\n\n token = state.push('heading_close', 'h' + String(level), -1);\n token.markup = String.fromCharCode(marker);\n\n state.parentType = oldParentType;\n\n return true;\n};\n","// List of valid html blocks names, accorting to commonmark spec\n// http://jgm.github.io/CommonMark/spec.html#html-blocks\n\n'use strict';\n\n\nmodule.exports = [\n 'address',\n 'article',\n 'aside',\n 'base',\n 'basefont',\n 'blockquote',\n 'body',\n 'caption',\n 'center',\n 'col',\n 'colgroup',\n 'dd',\n 'details',\n 'dialog',\n 'dir',\n 'div',\n 'dl',\n 'dt',\n 'fieldset',\n 'figcaption',\n 'figure',\n 'footer',\n 'form',\n 'frame',\n 'frameset',\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'head',\n 'header',\n 'hr',\n 'html',\n 'iframe',\n 'legend',\n 'li',\n 'link',\n 'main',\n 'menu',\n 'menuitem',\n 'meta',\n 'nav',\n 'noframes',\n 'ol',\n 'optgroup',\n 'option',\n 'p',\n 'param',\n 'section',\n 'source',\n 'summary',\n 'table',\n 'tbody',\n 'td',\n 'tfoot',\n 'th',\n 'thead',\n 'title',\n 'tr',\n 'track',\n 'ul'\n];\n","// Regexps to match html elements\n\n'use strict';\n\nvar attr_name = '[a-zA-Z_:][a-zA-Z0-9:._-]*';\n\nvar unquoted = '[^\"\\'=<>`\\\\x00-\\\\x20]+';\nvar single_quoted = \"'[^']*'\";\nvar double_quoted = '\"[^\"]*\"';\n\nvar attr_value = '(?:' + unquoted + '|' + single_quoted + '|' + double_quoted + ')';\n\nvar attribute = '(?:\\\\s+' + attr_name + '(?:\\\\s*=\\\\s*' + attr_value + ')?)';\n\nvar open_tag = '<[A-Za-z][A-Za-z0-9\\\\-]*' + attribute + '*\\\\s*\\\\/?>';\n\nvar close_tag = '<\\\\/[A-Za-z][A-Za-z0-9\\\\-]*\\\\s*>';\nvar comment = '<!---->|<!--(?:-?[^>-])(?:-?[^-])*-->';\nvar processing = '<[?].*?[?]>';\nvar declaration = '<![A-Z]+\\\\s+[^>]*>';\nvar cdata = '<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?\\\\]\\\\]>';\n\nvar HTML_TAG_RE = new RegExp('^(?:' + open_tag + '|' + close_tag + '|' + comment +\n '|' + processing + '|' + declaration + '|' + cdata + ')');\nvar HTML_OPEN_CLOSE_TAG_RE = new RegExp('^(?:' + open_tag + '|' + close_tag + ')');\n\nmodule.exports.HTML_TAG_RE = HTML_TAG_RE;\nmodule.exports.HTML_OPEN_CLOSE_TAG_RE = HTML_OPEN_CLOSE_TAG_RE;\n","// HTML block\n\n'use strict';\n\n\nvar block_names = require('../common/html_blocks');\nvar HTML_OPEN_CLOSE_TAG_RE = require('../common/html_re').HTML_OPEN_CLOSE_TAG_RE;\n\n// An array of opening and corresponding closing sequences for html tags,\n// last argument defines whether it can terminate a paragraph or not\n//\nvar HTML_SEQUENCES = [\n [ /^<(script|pre|style)(?=(\\s|>|$))/i, /<\\/(script|pre|style)>/i, true ],\n [ /^<!--/, /-->/, true ],\n [ /^<\\?/, /\\?>/, true ],\n [ /^<![A-Z]/, />/, true ],\n [ /^<!\\[CDATA\\[/, /\\]\\]>/, true ],\n [ new RegExp('^</?(' + block_names.join('|') + ')(?=(\\\\s|/?>|$))', 'i'), /^$/, true ],\n [ new RegExp(HTML_OPEN_CLOSE_TAG_RE.source + '\\\\s*$'), /^$/, false ]\n];\n\n\nmodule.exports = function html_block(state, startLine, endLine, silent) {\n var i, nextLine, token, lineText,\n pos = state.bMarks[startLine] + state.tShift[startLine],\n max = state.eMarks[startLine];\n\n // if it's indented more than 3 spaces, it should be a code block\n if (state.sCount[startLine] - state.blkIndent >= 4) { return false; }\n\n if (!state.md.options.html) { return false; }\n\n if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false; }\n\n lineText = state.src.slice(pos, max);\n\n for (i = 0; i < HTML_SEQUENCES.length; i++) {\n if (HTML_SEQUENCES[i][0].test(lineText)) { break; }\n }\n\n if (i === HTML_SEQUENCES.length) { return false; }\n\n if (silent) {\n // true if this sequence can be a terminator, false otherwise\n return HTML_SEQUENCES[i][2];\n }\n\n nextLine = startLine + 1;\n\n // If we are here - we detected HTML block.\n // Let's roll down till block end.\n if (!HTML_SEQUENCES[i][1].test(lineText)) {\n for (; nextLine < endLine; nextLine++) {\n if (state.sCount[nextLine] < state.blkIndent) { break; }\n\n pos = state.bMarks[nextLine] + state.tShift[nextLine];\n max = state.eMarks[nextLine];\n lineText = state.src.slice(pos, max);\n\n if (HTML_SEQUENCES[i][1].test(lineText)) {\n if (lineText.length !== 0) { nextLine++; }\n break;\n }\n }\n }\n\n state.line = nextLine;\n\n token = state.push('html_block', '', 0);\n token.map = [ startLine, nextLine ];\n token.content = state.getLines(startLine, nextLine, state.blkIndent, true);\n\n return true;\n};\n","// Paragraph\n\n'use strict';\n\n\nmodule.exports = function paragraph(state, startLine/*, endLine*/) {\n var content, terminate, i, l, token, oldParentType,\n nextLine = startLine + 1,\n terminatorRules = state.md.block.ruler.getRules('paragraph'),\n endLine = state.lineMax;\n\n oldParentType = state.parentType;\n state.parentType = 'paragraph';\n\n // jump line-by-line until empty one or EOF\n for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {\n // this would be a code block normally, but after paragraph\n // it's considered a lazy continuation regardless of what's there\n if (state.sCount[nextLine] - state.blkIndent > 3) { continue; }\n\n // quirk for blockquotes, this line should already be checked by that rule\n if (state.sCount[nextLine] < 0) { continue; }\n\n // Some tags can terminate paragraph without empty line.\n terminate = false;\n for (i = 0, l = terminatorRules.length; i < l; i++) {\n if (terminatorRules[i](state, nextLine, endLine, true)) {\n terminate = true;\n break;\n }\n }\n if (terminate) { break; }\n }\n\n content = state.getLines(startLine, nextLine, state.blkIndent, false).trim();\n\n state.line = nextLine;\n\n token = state.push('paragraph_open', 'p', 1);\n token.map = [ startLine, state.line ];\n\n token = state.push('inline', '', 0);\n token.content = content;\n token.map = [ startLine, state.line ];\n token.children = [];\n\n token = state.push('paragraph_close', 'p', -1);\n\n state.parentType = oldParentType;\n\n return true;\n};\n","// Parser state class\n\n'use strict';\n\nvar Token = require('../token');\nvar isSpace = require('../common/utils').isSpace;\n\n\nfunction StateBlock(src, md, env, tokens) {\n var ch, s, start, pos, len, indent, offset, indent_found;\n\n this.src = src;\n\n // link to parser instance\n this.md = md;\n\n this.env = env;\n\n //\n // Internal state vartiables\n //\n\n this.tokens = tokens;\n\n this.bMarks = []; // line begin offsets for fast jumps\n this.eMarks = []; // line end offsets for fast jumps\n this.tShift = []; // offsets of the first non-space characters (tabs not expanded)\n this.sCount = []; // indents for each line (tabs expanded)\n\n // An amount of virtual spaces (tabs expanded) between beginning\n // of each line (bMarks) and real beginning of that line.\n //\n // It exists only as a hack because blockquotes override bMarks\n // losing information in the process.\n //\n // It's used only when expanding tabs, you can think about it as\n // an initial tab length, e.g. bsCount=21 applied to string `\\t123`\n // means first tab should be expanded to 4-21%4 === 3 spaces.\n //\n this.bsCount = [];\n\n // block parser variables\n this.blkIndent = 0; // required block content indent\n // (for example, if we are in list)\n this.line = 0; // line index in src\n this.lineMax = 0; // lines count\n this.tight = false; // loose/tight mode for lists\n this.ddIndent = -1; // indent of the current dd block (-1 if there isn't any)\n\n // can be 'blockquote', 'list', 'root', 'paragraph' or 'reference'\n // used in lists to determine if they interrupt a paragraph\n this.parentType = 'root';\n\n this.level = 0;\n\n // renderer\n this.result = '';\n\n // Create caches\n // Generate markers.\n s = this.src;\n indent_found = false;\n\n for (start = pos = indent = offset = 0, len = s.length; pos < len; pos++) {\n ch = s.charCodeAt(pos);\n\n if (!indent_found) {\n if (isSpace(ch)) {\n indent++;\n\n if (ch === 0x09) {\n offset += 4 - offset % 4;\n } else {\n offset++;\n }\n continue;\n } else {\n indent_found = true;\n }\n }\n\n if (ch === 0x0A || pos === len - 1) {\n if (ch !== 0x0A) { pos++; }\n this.bMarks.push(start);\n this.eMarks.push(pos);\n this.tShift.push(indent);\n this.sCount.push(offset);\n this.bsCount.push(0);\n\n indent_found = false;\n indent = 0;\n offset = 0;\n start = pos + 1;\n }\n }\n\n // Push fake entry to simplify cache bounds checks\n this.bMarks.push(s.length);\n this.eMarks.push(s.length);\n this.tShift.push(0);\n this.sCount.push(0);\n this.bsCount.push(0);\n\n this.lineMax = this.bMarks.length - 1; // don't count last fake line\n}\n\n// Push new token to \"stream\".\n//\nStateBlock.prototype.push = function (type, tag, nesting) {\n var token = new Token(type, tag, nesting);\n token.block = true;\n\n if (nesting < 0) { this.level--; }\n token.level = this.level;\n if (nesting > 0) { this.level++; }\n\n this.tokens.push(token);\n return token;\n};\n\nStateBlock.prototype.isEmpty = function isEmpty(line) {\n return this.bMarks[line] + this.tShift[line] >= this.eMarks[line];\n};\n\nStateBlock.prototype.skipEmptyLines = function skipEmptyLines(from) {\n for (var max = this.lineMax; from < max; from++) {\n if (this.bMarks[from] + this.tShift[from] < this.eMarks[from]) {\n break;\n }\n }\n return from;\n};\n\n// Skip spaces from given position.\nStateBlock.prototype.skipSpaces = function skipSpaces(pos) {\n var ch;\n\n for (var max = this.src.length; pos < max; pos++) {\n ch = this.src.charCodeAt(pos);\n if (!isSpace(ch)) { break; }\n }\n return pos;\n};\n\n// Skip spaces from given position in reverse.\nStateBlock.prototype.skipSpacesBack = function skipSpacesBack(pos, min) {\n if (pos <= min) { return pos; }\n\n while (pos > min) {\n if (!isSpace(this.src.charCodeAt(--pos))) { return pos + 1; }\n }\n return pos;\n};\n\n// Skip char codes from given position\nStateBlock.prototype.skipChars = function skipChars(pos, code) {\n for (var max = this.src.length; pos < max; pos++) {\n if (this.src.charCodeAt(pos) !== code) { break; }\n }\n return pos;\n};\n\n// Skip char codes reverse from given position - 1\nStateBlock.prototype.skipCharsBack = function skipCharsBack(pos, code, min) {\n if (pos <= min) { return pos; }\n\n while (pos > min) {\n if (code !== this.src.charCodeAt(--pos)) { return pos + 1; }\n }\n return pos;\n};\n\n// cut lines range from source.\nStateBlock.prototype.getLines = function getLines(begin, end, indent, keepLastLF) {\n var i, lineIndent, ch, first, last, queue, lineStart,\n line = begin;\n\n if (begin >= end) {\n return '';\n }\n\n queue = new Array(end - begin);\n\n for (i = 0; line < end; line++, i++) {\n lineIndent = 0;\n lineStart = first = this.bMarks[line];\n\n if (line + 1 < end || keepLastLF) {\n // No need for bounds check because we have fake entry on tail.\n last = this.eMarks[line] + 1;\n } else {\n last = this.eMarks[line];\n }\n\n while (first < last && lineIndent < indent) {\n ch = this.src.charCodeAt(first);\n\n if (isSpace(ch)) {\n if (ch === 0x09) {\n lineIndent += 4 - (lineIndent + this.bsCount[line]) % 4;\n } else {\n lineIndent++;\n }\n } else if (first - lineStart < this.tShift[line]) {\n // patched tShift masked characters to look like spaces (blockquotes, list markers)\n lineIndent++;\n } else {\n break;\n }\n\n first++;\n }\n\n if (lineIndent > indent) {\n // partially expanding tabs in code blocks, e.g '\\t\\tfoobar'\n // with indent=2 becomes ' \\tfoobar'\n queue[i] = new Array(lineIndent - indent + 1).join(' ') + this.src.slice(first, last);\n } else {\n queue[i] = this.src.slice(first, last);\n }\n }\n\n return queue.join('');\n};\n\n// re-export Token class to use in block rules\nStateBlock.prototype.Token = Token;\n\n\nmodule.exports = StateBlock;\n","/** internal\n * class ParserBlock\n *\n * Block-level tokenizer.\n **/\n'use strict';\n\n\nvar Ruler = require('./ruler');\n\n\nvar _rules = [\n // First 2 params - rule name & source. Secondary array - list of rules,\n // which can be terminated by this one.\n [ 'table', require('./rules_block/table'), [ 'paragraph', 'reference' ] ],\n [ 'code', require('./rules_block/code') ],\n [ 'fence', require('./rules_block/fence'), [ 'paragraph', 'reference', 'blockquote', 'list' ] ],\n [ 'blockquote', require('./rules_block/blockquote'), [ 'paragraph', 'reference', 'blockquote', 'list' ] ],\n [ 'hr', require('./rules_block/hr'), [ 'paragraph', 'reference', 'blockquote', 'list' ] ],\n [ 'list', require('./rules_block/list'), [ 'paragraph', 'reference', 'blockquote' ] ],\n [ 'reference', require('./rules_block/reference') ],\n [ 'heading', require('./rules_block/heading'), [ 'paragraph', 'reference', 'blockquote' ] ],\n [ 'lheading', require('./rules_block/lheading') ],\n [ 'html_block', require('./rules_block/html_block'), [ 'paragraph', 'reference', 'blockquote' ] ],\n [ 'paragraph', require('./rules_block/paragraph') ]\n];\n\n\n/**\n * new ParserBlock()\n **/\nfunction ParserBlock() {\n /**\n * ParserBlock#ruler -> Ruler\n *\n * [[Ruler]] instance. Keep configuration of block rules.\n **/\n this.ruler = new Ruler();\n\n for (var i = 0; i < _rules.length; i++) {\n this.ruler.push(_rules[i][0], _rules[i][1], { alt: (_rules[i][2] || []).slice() });\n }\n}\n\n\n// Generate tokens for input range\n//\nParserBlock.prototype.tokenize = function (state, startLine, endLine) {\n var ok, i,\n rules = this.ruler.getRules(''),\n len = rules.length,\n line = startLine,\n hasEmptyLines = false,\n maxNesting = state.md.options.maxNesting;\n\n while (line < endLine) {\n state.line = line = state.skipEmptyLines(line);\n if (line >= endLine) { break; }\n\n // Termination condition for nested calls.\n // Nested calls currently used for blockquotes & lists\n if (state.sCount[line] < state.blkIndent) { break; }\n\n // If nesting level exceeded - skip tail to the end. That's not ordinary\n // situation and we should not care about content.\n if (state.level >= maxNesting) {\n state.line = endLine;\n break;\n }\n\n // Try all possible rules.\n // On success, rule should:\n //\n // - update `state.line`\n // - update `state.tokens`\n // - return true\n\n for (i = 0; i < len; i++) {\n ok = rules[i](state, line, endLine, false);\n if (ok) { break; }\n }\n\n // set state.tight if we had an empty line before current tag\n // i.e. latest empty line should not count\n state.tight = !hasEmptyLines;\n\n // paragraph might \"eat\" one newline after it in nested lists\n if (state.isEmpty(state.line - 1)) {\n hasEmptyLines = true;\n }\n\n line = state.line;\n\n if (line < endLine && state.isEmpty(line)) {\n hasEmptyLines = true;\n line++;\n state.line = line;\n }\n }\n};\n\n\n/**\n * ParserBlock.parse(str, md, env, outTokens)\n *\n * Process input string and push block tokens into `outTokens`\n **/\nParserBlock.prototype.parse = function (src, md, env, outTokens) {\n var state;\n\n if (!src) { return; }\n\n state = new this.State(src, md, env, outTokens);\n\n this.tokenize(state, state.line, state.lineMax);\n};\n\n\nParserBlock.prototype.State = require('./rules_block/state_block');\n\n\nmodule.exports = ParserBlock;\n","// Skip text characters for text token, place those to pending buffer\n// and increment current pos\n\n'use strict';\n\n\n// Rule to skip pure text\n// '{}$%@~+=:' reserved for extentions\n\n// !, \", #, $, %, &, ', (, ), *, +, ,, -, ., /, :, ;, <, =, >, ?, @, [, \\, ], ^, _, `, {, |, }, or ~\n\n// !!!! Don't confuse with \"Markdown ASCII Punctuation\" chars\n// http://spec.commonmark.org/0.15/#ascii-punctuation-character\nfunction isTerminatorChar(ch) {\n switch (ch) {\n case 0x0A/* \\n */:\n case 0x21/* ! */:\n case 0x23/* # */:\n case 0x24/* $ */:\n case 0x25/* % */:\n case 0x26/* & */:\n case 0x2A/* * */:\n case 0x2B/* + */:\n case 0x2D/* - */:\n case 0x3A/* : */:\n case 0x3C/* < */:\n case 0x3D/* = */:\n case 0x3E/* > */:\n case 0x40/* @ */:\n case 0x5B/* [ */:\n case 0x5C/* \\ */:\n case 0x5D/* ] */:\n case 0x5E/* ^ */:\n case 0x5F/* _ */:\n case 0x60/* ` */:\n case 0x7B/* { */:\n case 0x7D/* } */:\n case 0x7E/* ~ */:\n return true;\n default:\n return false;\n }\n}\n\nmodule.exports = function text(state, silent) {\n var pos = state.pos;\n\n while (pos < state.posMax && !isTerminatorChar(state.src.charCodeAt(pos))) {\n pos++;\n }\n\n if (pos === state.pos) { return false; }\n\n if (!silent) { state.pending += state.src.slice(state.pos, pos); }\n\n state.pos = pos;\n\n return true;\n};\n\n// Alternative implementation, for memory.\n//\n// It costs 10% of performance, but allows extend terminators list, if place it\n// to `ParcerInline` property. Probably, will switch to it sometime, such\n// flexibility required.\n\n/*\nvar TERMINATOR_RE = /[\\n!#$%&*+\\-:<=>@[\\\\\\]^_`{}~]/;\n\nmodule.exports = function text(state, silent) {\n var pos = state.pos,\n idx = state.src.slice(pos).search(TERMINATOR_RE);\n\n // first char is terminator -> empty text\n if (idx === 0) { return false; }\n\n // no terminator -> text till end of string\n if (idx < 0) {\n if (!silent) { state.pending += state.src.slice(pos); }\n state.pos = state.src.length;\n return true;\n }\n\n if (!silent) { state.pending += state.src.slice(pos, pos + idx); }\n\n state.pos += idx;\n\n return true;\n};*/\n","// Proceess '\\n'\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function newline(state, silent) {\n var pmax, max, pos = state.pos;\n\n if (state.src.charCodeAt(pos) !== 0x0A/* \\n */) { return false; }\n\n pmax = state.pending.length - 1;\n max = state.posMax;\n\n // ' \\n' -> hardbreak\n // Lookup in pending chars is bad practice! Don't copy to other rules!\n // Pending string is stored in concat mode, indexed lookups will cause\n // convertion to flat mode.\n if (!silent) {\n if (pmax >= 0 && state.pending.charCodeAt(pmax) === 0x20) {\n if (pmax >= 1 && state.pending.charCodeAt(pmax - 1) === 0x20) {\n state.pending = state.pending.replace(/ +$/, '');\n state.push('hardbreak', 'br', 0);\n } else {\n state.pending = state.pending.slice(0, -1);\n state.push('softbreak', 'br', 0);\n }\n\n } else {\n state.push('softbreak', 'br', 0);\n }\n }\n\n pos++;\n\n // skip heading spaces for next line\n while (pos < max && isSpace(state.src.charCodeAt(pos))) { pos++; }\n\n state.pos = pos;\n return true;\n};\n","// Process escaped chars and hardbreaks\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\nvar ESCAPED = [];\n\nfor (var i = 0; i < 256; i++) { ESCAPED.push(0); }\n\n'\\\\!\"#$%&\\'()*+,./:;<=>?@[]^_`{|}~-'\n .split('').forEach(function (ch) { ESCAPED[ch.charCodeAt(0)] = 1; });\n\n\nmodule.exports = function escape(state, silent) {\n var ch, pos = state.pos, max = state.posMax;\n\n if (state.src.charCodeAt(pos) !== 0x5C/* \\ */) { return false; }\n\n pos++;\n\n if (pos < max) {\n ch = state.src.charCodeAt(pos);\n\n if (ch < 256 && ESCAPED[ch] !== 0) {\n if (!silent) { state.pending += state.src[pos]; }\n state.pos += 2;\n return true;\n }\n\n if (ch === 0x0A) {\n if (!silent) {\n state.push('hardbreak', 'br', 0);\n }\n\n pos++;\n // skip leading whitespaces from next line\n while (pos < max) {\n ch = state.src.charCodeAt(pos);\n if (!isSpace(ch)) { break; }\n pos++;\n }\n\n state.pos = pos;\n return true;\n }\n }\n\n if (!silent) { state.pending += '\\\\'; }\n state.pos++;\n return true;\n};\n","// Parse backticks\n\n'use strict';\n\nmodule.exports = function backtick(state, silent) {\n var start, max, marker, matchStart, matchEnd, token,\n pos = state.pos,\n ch = state.src.charCodeAt(pos);\n\n if (ch !== 0x60/* ` */) { return false; }\n\n start = pos;\n pos++;\n max = state.posMax;\n\n while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++; }\n\n marker = state.src.slice(start, pos);\n\n matchStart = matchEnd = pos;\n\n while ((matchStart = state.src.indexOf('`', matchEnd)) !== -1) {\n matchEnd = matchStart + 1;\n\n while (matchEnd < max && state.src.charCodeAt(matchEnd) === 0x60/* ` */) { matchEnd++; }\n\n if (matchEnd - matchStart === marker.length) {\n if (!silent) {\n token = state.push('code_inline', 'code', 0);\n token.markup = marker;\n token.content = state.src.slice(pos, matchStart)\n .replace(/[ \\n]+/g, ' ')\n .trim();\n }\n state.pos = matchEnd;\n return true;\n }\n }\n\n if (!silent) { state.pending += marker; }\n state.pos += marker.length;\n return true;\n};\n","// ~~strike through~~\n//\n'use strict';\n\n\n// Insert each marker as a separate text token, and add it to delimiter list\n//\nmodule.exports.tokenize = function strikethrough(state, silent) {\n var i, scanned, token, len, ch,\n start = state.pos,\n marker = state.src.charCodeAt(start);\n\n if (silent) { return false; }\n\n if (marker !== 0x7E/* ~ */) { return false; }\n\n scanned = state.scanDelims(state.pos, true);\n len = scanned.length;\n ch = String.fromCharCode(marker);\n\n if (len < 2) { return false; }\n\n if (len % 2) {\n token = state.push('text', '', 0);\n token.content = ch;\n len--;\n }\n\n for (i = 0; i < len; i += 2) {\n token = state.push('text', '', 0);\n token.content = ch + ch;\n\n state.delimiters.push({\n marker: marker,\n jump: i,\n token: state.tokens.length - 1,\n level: state.level,\n end: -1,\n open: scanned.can_open,\n close: scanned.can_close\n });\n }\n\n state.pos += scanned.length;\n\n return true;\n};\n\n\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function strikethrough(state) {\n var i, j,\n startDelim,\n endDelim,\n token,\n loneMarkers = [],\n delimiters = state.delimiters,\n max = state.delimiters.length;\n\n for (i = 0; i < max; i++) {\n startDelim = delimiters[i];\n\n if (startDelim.marker !== 0x7E/* ~ */) {\n continue;\n }\n\n if (startDelim.end === -1) {\n continue;\n }\n\n endDelim = delimiters[startDelim.end];\n\n token = state.tokens[startDelim.token];\n token.type = 's_open';\n token.tag = 's';\n token.nesting = 1;\n token.markup = '~~';\n token.content = '';\n\n token = state.tokens[endDelim.token];\n token.type = 's_close';\n token.tag = 's';\n token.nesting = -1;\n token.markup = '~~';\n token.content = '';\n\n if (state.tokens[endDelim.token - 1].type === 'text' &&\n state.tokens[endDelim.token - 1].content === '~') {\n\n loneMarkers.push(endDelim.token - 1);\n }\n }\n\n // If a marker sequence has an odd number of characters, it's splitted\n // like this: `~~~~~` -> `~` + `~~` + `~~`, leaving one marker at the\n // start of the sequence.\n //\n // So, we have to move all those markers after subsequent s_close tags.\n //\n while (loneMarkers.length) {\n i = loneMarkers.pop();\n j = i + 1;\n\n while (j < state.tokens.length && state.tokens[j].type === 's_close') {\n j++;\n }\n\n j--;\n\n if (i !== j) {\n token = state.tokens[j];\n state.tokens[j] = state.tokens[i];\n state.tokens[i] = token;\n }\n }\n};\n","// Process *this* and _that_\n//\n'use strict';\n\n\n// Insert each marker as a separate text token, and add it to delimiter list\n//\nmodule.exports.tokenize = function emphasis(state, silent) {\n var i, scanned, token,\n start = state.pos,\n marker = state.src.charCodeAt(start);\n\n if (silent) { return false; }\n\n if (marker !== 0x5F /* _ */ && marker !== 0x2A /* * */) { return false; }\n\n scanned = state.scanDelims(state.pos, marker === 0x2A);\n\n for (i = 0; i < scanned.length; i++) {\n token = state.push('text', '', 0);\n token.content = String.fromCharCode(marker);\n\n state.delimiters.push({\n // Char code of the starting marker (number).\n //\n marker: marker,\n\n // Total length of these series of delimiters.\n //\n length: scanned.length,\n\n // An amount of characters before this one that's equivalent to\n // current one. In plain English: if this delimiter does not open\n // an emphasis, neither do previous `jump` characters.\n //\n // Used to skip sequences like \"*****\" in one step, for 1st asterisk\n // value will be 0, for 2nd it's 1 and so on.\n //\n jump: i,\n\n // A position of the token this delimiter corresponds to.\n //\n token: state.tokens.length - 1,\n\n // Token level.\n //\n level: state.level,\n\n // If this delimiter is matched as a valid opener, `end` will be\n // equal to its position, otherwise it's `-1`.\n //\n end: -1,\n\n // Boolean flags that determine if this delimiter could open or close\n // an emphasis.\n //\n open: scanned.can_open,\n close: scanned.can_close\n });\n }\n\n state.pos += scanned.length;\n\n return true;\n};\n\n\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function emphasis(state) {\n var i,\n startDelim,\n endDelim,\n token,\n ch,\n isStrong,\n delimiters = state.delimiters,\n max = state.delimiters.length;\n\n for (i = max - 1; i >= 0; i--) {\n startDelim = delimiters[i];\n\n if (startDelim.marker !== 0x5F/* _ */ && startDelim.marker !== 0x2A/* * */) {\n continue;\n }\n\n // Process only opening markers\n if (startDelim.end === -1) {\n continue;\n }\n\n endDelim = delimiters[startDelim.end];\n\n // If the previous delimiter has the same marker and is adjacent to this one,\n // merge those into one strong delimiter.\n //\n // `<em><em>whatever</em></em>` -> `<strong>whatever</strong>`\n //\n isStrong = i > 0 &&\n delimiters[i - 1].end === startDelim.end + 1 &&\n delimiters[i - 1].token === startDelim.token - 1 &&\n delimiters[startDelim.end + 1].token === endDelim.token + 1 &&\n delimiters[i - 1].marker === startDelim.marker;\n\n ch = String.fromCharCode(startDelim.marker);\n\n token = state.tokens[startDelim.token];\n token.type = isStrong ? 'strong_open' : 'em_open';\n token.tag = isStrong ? 'strong' : 'em';\n token.nesting = 1;\n token.markup = isStrong ? ch + ch : ch;\n token.content = '';\n\n token = state.tokens[endDelim.token];\n token.type = isStrong ? 'strong_close' : 'em_close';\n token.tag = isStrong ? 'strong' : 'em';\n token.nesting = -1;\n token.markup = isStrong ? ch + ch : ch;\n token.content = '';\n\n if (isStrong) {\n state.tokens[delimiters[i - 1].token].content = '';\n state.tokens[delimiters[startDelim.end + 1].token].content = '';\n i--;\n }\n }\n};\n","// Process [link](<to> \"stuff\")\n\n'use strict';\n\nvar normalizeReference = require('../common/utils').normalizeReference;\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function link(state, silent) {\n var attrs,\n code,\n label,\n labelEnd,\n labelStart,\n pos,\n res,\n ref,\n title,\n token,\n href = '',\n oldPos = state.pos,\n max = state.posMax,\n start = state.pos,\n parseReference = true;\n\n if (state.src.charCodeAt(state.pos) !== 0x5B/* [ */) { return false; }\n\n labelStart = state.pos + 1;\n labelEnd = state.md.helpers.parseLinkLabel(state, state.pos, true);\n\n // parser failed to find ']', so it's not a valid link\n if (labelEnd < 0) { return false; }\n\n pos = labelEnd + 1;\n if (pos < max && state.src.charCodeAt(pos) === 0x28/* ( */) {\n //\n // Inline link\n //\n\n // might have found a valid shortcut link, disable reference parsing\n parseReference = false;\n\n // [link]( <href> \"title\" )\n // ^^ skipping these spaces\n pos++;\n for (; pos < max; pos++) {\n code = state.src.charCodeAt(pos);\n if (!isSpace(code) && code !== 0x0A) { break; }\n }\n if (pos >= max) { return false; }\n\n // [link]( <href> \"title\" )\n // ^^^^^^ parsing link destination\n start = pos;\n res = state.md.helpers.parseLinkDestination(state.src, pos, state.posMax);\n if (res.ok) {\n href = state.md.normalizeLink(res.str);\n if (state.md.validateLink(href)) {\n pos = res.pos;\n } else {\n href = '';\n }\n }\n\n // [link]( <href> \"title\" )\n // ^^ skipping these spaces\n start = pos;\n for (; pos < max; pos++) {\n code = state.src.charCodeAt(pos);\n if (!isSpace(code) && code !== 0x0A) { break; }\n }\n\n // [link]( <href> \"title\" )\n // ^^^^^^^ parsing link title\n res = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);\n if (pos < max && start !== pos && res.ok) {\n title = res.str;\n pos = res.pos;\n\n // [link]( <href> \"title\" )\n // ^^ skipping these spaces\n for (; pos < max; pos++) {\n code = state.src.charCodeAt(pos);\n if (!isSpace(code) && code !== 0x0A) { break; }\n }\n } else {\n title = '';\n }\n\n if (pos >= max || state.src.charCodeAt(pos) !== 0x29/* ) */) {\n // parsing a valid shortcut link failed, fallback to reference\n parseReference = true;\n }\n pos++;\n }\n\n if (parseReference) {\n //\n // Link reference\n //\n if (typeof state.env.references === 'undefined') { return false; }\n\n if (pos < max && state.src.charCodeAt(pos) === 0x5B/* [ */) {\n start = pos + 1;\n pos = state.md.helpers.parseLinkLabel(state, pos);\n if (pos >= 0) {\n label = state.src.slice(start, pos++);\n } else {\n pos = labelEnd + 1;\n }\n } else {\n pos = labelEnd + 1;\n }\n\n // covers label === '' and label === undefined\n // (collapsed reference link and shortcut reference link respectively)\n if (!label) { label = state.src.slice(labelStart, labelEnd); }\n\n ref = state.env.references[normalizeReference(label)];\n if (!ref) {\n state.pos = oldPos;\n return false;\n }\n href = ref.href;\n title = ref.title;\n }\n\n //\n // We found the end of the link, and know for a fact it's a valid link;\n // so all that's left to do is to call tokenizer.\n //\n if (!silent) {\n state.pos = labelStart;\n state.posMax = labelEnd;\n\n token = state.push('link_open', 'a', 1);\n token.attrs = attrs = [ [ 'href', href ] ];\n if (title) {\n attrs.push([ 'title', title ]);\n }\n\n state.md.inline.tokenize(state);\n\n token = state.push('link_close', 'a', -1);\n }\n\n state.pos = pos;\n state.posMax = max;\n return true;\n};\n","// Process ![image](<src> \"title\")\n\n'use strict';\n\nvar normalizeReference = require('../common/utils').normalizeReference;\nvar isSpace = require('../common/utils').isSpace;\n\n\nmodule.exports = function image(state, silent) {\n var attrs,\n code,\n content,\n label,\n labelEnd,\n labelStart,\n pos,\n ref,\n res,\n title,\n token,\n tokens,\n start,\n href = '',\n oldPos = state.pos,\n max = state.posMax;\n\n if (state.src.charCodeAt(state.pos) !== 0x21/* ! */) { return false; }\n if (state.src.charCodeAt(state.pos + 1) !== 0x5B/* [ */) { return false; }\n\n labelStart = state.pos + 2;\n labelEnd = state.md.helpers.parseLinkLabel(state, state.pos + 1, false);\n\n // parser failed to find ']', so it's not a valid link\n if (labelEnd < 0) { return false; }\n\n pos = labelEnd + 1;\n if (pos < max && state.src.charCodeAt(pos) === 0x28/* ( */) {\n //\n // Inline link\n //\n\n // [link]( <href> \"title\" )\n // ^^ skipping these spaces\n pos++;\n for (; pos < max; pos++) {\n code = state.src.charCodeAt(pos);\n if (!isSpace(code) && code !== 0x0A) { break; }\n }\n if (pos >= max) { return false; }\n\n // [link]( <href> \"title\" )\n // ^^^^^^ parsing link destination\n start = pos;\n res = state.md.helpers.parseLinkDestination(state.src, pos, state.posMax);\n if (res.ok) {\n href = state.md.normalizeLink(res.str);\n if (state.md.validateLink(href)) {\n pos = res.pos;\n } else {\n href = '';\n }\n }\n\n // [link]( <href> \"title\" )\n // ^^ skipping these spaces\n start = pos;\n for (; pos < max; pos++) {\n code = state.src.charCodeAt(pos);\n if (!isSpace(code) && code !== 0x0A) { break; }\n }\n\n // [link]( <href> \"title\" )\n // ^^^^^^^ parsing link title\n res = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);\n if (pos < max && start !== pos && res.ok) {\n title = res.str;\n pos = res.pos;\n\n // [link]( <href> \"title\" )\n // ^^ skipping these spaces\n for (; pos < max; pos++) {\n code = state.src.charCodeAt(pos);\n if (!isSpace(code) && code !== 0x0A) { break; }\n }\n } else {\n title = '';\n }\n\n if (pos >= max || state.src.charCodeAt(pos) !== 0x29/* ) */) {\n state.pos = oldPos;\n return false;\n }\n pos++;\n } else {\n //\n // Link reference\n //\n if (typeof state.env.references === 'undefined') { return false; }\n\n if (pos < max && state.src.charCodeAt(pos) === 0x5B/* [ */) {\n start = pos + 1;\n pos = state.md.helpers.parseLinkLabel(state, pos);\n if (pos >= 0) {\n label = state.src.slice(start, pos++);\n } else {\n pos = labelEnd + 1;\n }\n } else {\n pos = labelEnd + 1;\n }\n\n // covers label === '' and label === undefined\n // (collapsed reference link and shortcut reference link respectively)\n if (!label) { label = state.src.slice(labelStart, labelEnd); }\n\n ref = state.env.references[normalizeReference(label)];\n if (!ref) {\n state.pos = oldPos;\n return false;\n }\n href = ref.href;\n title = ref.title;\n }\n\n //\n // We found the end of the link, and know for a fact it's a valid link;\n // so all that's left to do is to call tokenizer.\n //\n if (!silent) {\n content = state.src.slice(labelStart, labelEnd);\n\n state.md.inline.parse(\n content,\n state.md,\n state.env,\n tokens = []\n );\n\n token = state.push('image', 'img', 0);\n token.attrs = attrs = [ [ 'src', href ], [ 'alt', '' ] ];\n token.children = tokens;\n token.content = content;\n\n if (title) {\n attrs.push([ 'title', title ]);\n }\n }\n\n state.pos = pos;\n state.posMax = max;\n return true;\n};\n","// Process autolinks '<protocol:...>'\n\n'use strict';\n\n\n/*eslint max-len:0*/\nvar EMAIL_RE = /^<([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])?)*)>/;\nvar AUTOLINK_RE = /^<([a-zA-Z][a-zA-Z0-9+.\\-]{1,31}):([^<>\\x00-\\x20]*)>/;\n\n\nmodule.exports = function autolink(state, silent) {\n var tail, linkMatch, emailMatch, url, fullUrl, token,\n pos = state.pos;\n\n if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false; }\n\n tail = state.src.slice(pos);\n\n if (tail.indexOf('>') < 0) { return false; }\n\n if (AUTOLINK_RE.test(tail)) {\n linkMatch = tail.match(AUTOLINK_RE);\n\n url = linkMatch[0].slice(1, -1);\n fullUrl = state.md.normalizeLink(url);\n if (!state.md.validateLink(fullUrl)) { return false; }\n\n if (!silent) {\n token = state.push('link_open', 'a', 1);\n token.attrs = [ [ 'href', fullUrl ] ];\n token.markup = 'autolink';\n token.info = 'auto';\n\n token = state.push('text', '', 0);\n token.content = state.md.normalizeLinkText(url);\n\n token = state.push('link_close', 'a', -1);\n token.markup = 'autolink';\n token.info = 'auto';\n }\n\n state.pos += linkMatch[0].length;\n return true;\n }\n\n if (EMAIL_RE.test(tail)) {\n emailMatch = tail.match(EMAIL_RE);\n\n url = emailMatch[0].slice(1, -1);\n fullUrl = state.md.normalizeLink('mailto:' + url);\n if (!state.md.validateLink(fullUrl)) { return false; }\n\n if (!silent) {\n token = state.push('link_open', 'a', 1);\n token.attrs = [ [ 'href', fullUrl ] ];\n token.markup = 'autolink';\n token.info = 'auto';\n\n token = state.push('text', '', 0);\n token.content = state.md.normalizeLinkText(url);\n\n token = state.push('link_close', 'a', -1);\n token.markup = 'autolink';\n token.info = 'auto';\n }\n\n state.pos += emailMatch[0].length;\n return true;\n }\n\n return false;\n};\n","// Process html tags\n\n'use strict';\n\n\nvar HTML_TAG_RE = require('../common/html_re').HTML_TAG_RE;\n\n\nfunction isLetter(ch) {\n /*eslint no-bitwise:0*/\n var lc = ch | 0x20; // to lower case\n return (lc >= 0x61/* a */) && (lc <= 0x7a/* z */);\n}\n\n\nmodule.exports = function html_inline(state, silent) {\n var ch, match, max, token,\n pos = state.pos;\n\n if (!state.md.options.html) { return false; }\n\n // Check start\n max = state.posMax;\n if (state.src.charCodeAt(pos) !== 0x3C/* < */ ||\n pos + 2 >= max) {\n return false;\n }\n\n // Quick fail on second char\n ch = state.src.charCodeAt(pos + 1);\n if (ch !== 0x21/* ! */ &&\n ch !== 0x3F/* ? */ &&\n ch !== 0x2F/* / */ &&\n !isLetter(ch)) {\n return false;\n }\n\n match = state.src.slice(pos).match(HTML_TAG_RE);\n if (!match) { return false; }\n\n if (!silent) {\n token = state.push('html_inline', '', 0);\n token.content = state.src.slice(pos, pos + match[0].length);\n }\n state.pos += match[0].length;\n return true;\n};\n","// Process html entity - &#123;, &#xAF;, &quot;, ...\n\n'use strict';\n\nvar entities = require('../common/entities');\nvar has = require('../common/utils').has;\nvar isValidEntityCode = require('../common/utils').isValidEntityCode;\nvar fromCodePoint = require('../common/utils').fromCodePoint;\n\n\nvar DIGITAL_RE = /^&#((?:x[a-f0-9]{1,8}|[0-9]{1,8}));/i;\nvar NAMED_RE = /^&([a-z][a-z0-9]{1,31});/i;\n\n\nmodule.exports = function entity(state, silent) {\n var ch, code, match, pos = state.pos, max = state.posMax;\n\n if (state.src.charCodeAt(pos) !== 0x26/* & */) { return false; }\n\n if (pos + 1 < max) {\n ch = state.src.charCodeAt(pos + 1);\n\n if (ch === 0x23 /* # */) {\n match = state.src.slice(pos).match(DIGITAL_RE);\n if (match) {\n if (!silent) {\n code = match[1][0].toLowerCase() === 'x' ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10);\n state.pending += isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(0xFFFD);\n }\n state.pos += match[0].length;\n return true;\n }\n } else {\n match = state.src.slice(pos).match(NAMED_RE);\n if (match) {\n if (has(entities, match[1])) {\n if (!silent) { state.pending += entities[match[1]]; }\n state.pos += match[0].length;\n return true;\n }\n }\n }\n }\n\n if (!silent) { state.pending += '&'; }\n state.pos++;\n return true;\n};\n","// For each opening emphasis-like marker find a matching closing one\n//\n'use strict';\n\n\nmodule.exports = function link_pairs(state) {\n var i, j, lastDelim, currDelim,\n delimiters = state.delimiters,\n max = state.delimiters.length;\n\n for (i = 0; i < max; i++) {\n lastDelim = delimiters[i];\n\n if (!lastDelim.close) { continue; }\n\n j = i - lastDelim.jump - 1;\n\n while (j >= 0) {\n currDelim = delimiters[j];\n\n if (currDelim.open &&\n currDelim.marker === lastDelim.marker &&\n currDelim.end < 0 &&\n currDelim.level === lastDelim.level) {\n\n // typeofs are for backward compatibility with plugins\n var odd_match = (currDelim.close || lastDelim.open) &&\n typeof currDelim.length !== 'undefined' &&\n typeof lastDelim.length !== 'undefined' &&\n (currDelim.length + lastDelim.length) % 3 === 0;\n\n if (!odd_match) {\n lastDelim.jump = i - j;\n lastDelim.open = false;\n currDelim.end = i;\n currDelim.jump = 0;\n break;\n }\n }\n\n j -= currDelim.jump + 1;\n }\n }\n};\n","// Merge adjacent text nodes into one, and re-calculate all token levels\n//\n'use strict';\n\n\nmodule.exports = function text_collapse(state) {\n var curr, last,\n level = 0,\n tokens = state.tokens,\n max = state.tokens.length;\n\n for (curr = last = 0; curr < max; curr++) {\n // re-calculate levels\n level += tokens[curr].nesting;\n tokens[curr].level = level;\n\n if (tokens[curr].type === 'text' &&\n curr + 1 < max &&\n tokens[curr + 1].type === 'text') {\n\n // collapse two adjacent text nodes\n tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content;\n } else {\n if (curr !== last) { tokens[last] = tokens[curr]; }\n\n last++;\n }\n }\n\n if (curr !== last) {\n tokens.length = last;\n }\n};\n","// Inline parser state\n\n'use strict';\n\n\nvar Token = require('../token');\nvar isWhiteSpace = require('../common/utils').isWhiteSpace;\nvar isPunctChar = require('../common/utils').isPunctChar;\nvar isMdAsciiPunct = require('../common/utils').isMdAsciiPunct;\n\n\nfunction StateInline(src, md, env, outTokens) {\n this.src = src;\n this.env = env;\n this.md = md;\n this.tokens = outTokens;\n\n this.pos = 0;\n this.posMax = this.src.length;\n this.level = 0;\n this.pending = '';\n this.pendingLevel = 0;\n\n this.cache = {}; // Stores { start: end } pairs. Useful for backtrack\n // optimization of pairs parse (emphasis, strikes).\n\n this.delimiters = []; // Emphasis-like delimiters\n}\n\n\n// Flush pending text\n//\nStateInline.prototype.pushPending = function () {\n var token = new Token('text', '', 0);\n token.content = this.pending;\n token.level = this.pendingLevel;\n this.tokens.push(token);\n this.pending = '';\n return token;\n};\n\n\n// Push new token to \"stream\".\n// If pending text exists - flush it as text token\n//\nStateInline.prototype.push = function (type, tag, nesting) {\n if (this.pending) {\n this.pushPending();\n }\n\n var token = new Token(type, tag, nesting);\n\n if (nesting < 0) { this.level--; }\n token.level = this.level;\n if (nesting > 0) { this.level++; }\n\n this.pendingLevel = this.level;\n this.tokens.push(token);\n return token;\n};\n\n\n// Scan a sequence of emphasis-like markers, and determine whether\n// it can start an emphasis sequence or end an emphasis sequence.\n//\n// - start - position to scan from (it should point at a valid marker);\n// - canSplitWord - determine if these markers can be found inside a word\n//\nStateInline.prototype.scanDelims = function (start, canSplitWord) {\n var pos = start, lastChar, nextChar, count, can_open, can_close,\n isLastWhiteSpace, isLastPunctChar,\n isNextWhiteSpace, isNextPunctChar,\n left_flanking = true,\n right_flanking = true,\n max = this.posMax,\n marker = this.src.charCodeAt(start);\n\n // treat beginning of the line as a whitespace\n lastChar = start > 0 ? this.src.charCodeAt(start - 1) : 0x20;\n\n while (pos < max && this.src.charCodeAt(pos) === marker) { pos++; }\n\n count = pos - start;\n\n // treat end of the line as a whitespace\n nextChar = pos < max ? this.src.charCodeAt(pos) : 0x20;\n\n isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctChar(String.fromCharCode(lastChar));\n isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctChar(String.fromCharCode(nextChar));\n\n isLastWhiteSpace = isWhiteSpace(lastChar);\n isNextWhiteSpace = isWhiteSpace(nextChar);\n\n if (isNextWhiteSpace) {\n left_flanking = false;\n } else if (isNextPunctChar) {\n if (!(isLastWhiteSpace || isLastPunctChar)) {\n left_flanking = false;\n }\n }\n\n if (isLastWhiteSpace) {\n right_flanking = false;\n } else if (isLastPunctChar) {\n if (!(isNextWhiteSpace || isNextPunctChar)) {\n right_flanking = false;\n }\n }\n\n if (!canSplitWord) {\n can_open = left_flanking && (!right_flanking || isLastPunctChar);\n can_close = right_flanking && (!left_flanking || isNextPunctChar);\n } else {\n can_open = left_flanking;\n can_close = right_flanking;\n }\n\n return {\n can_open: can_open,\n can_close: can_close,\n length: count\n };\n};\n\n\n// re-export Token class to use in block rules\nStateInline.prototype.Token = Token;\n\n\nmodule.exports = StateInline;\n","/** internal\n * class ParserInline\n *\n * Tokenizes paragraph content.\n **/\n'use strict';\n\n\nvar Ruler = require('./ruler');\n\n\n////////////////////////////////////////////////////////////////////////////////\n// Parser rules\n\nvar _rules = [\n [ 'text', require('./rules_inline/text') ],\n [ 'newline', require('./rules_inline/newline') ],\n [ 'escape', require('./rules_inline/escape') ],\n [ 'backticks', require('./rules_inline/backticks') ],\n [ 'strikethrough', require('./rules_inline/strikethrough').tokenize ],\n [ 'emphasis', require('./rules_inline/emphasis').tokenize ],\n [ 'link', require('./rules_inline/link') ],\n [ 'image', require('./rules_inline/image') ],\n [ 'autolink', require('./rules_inline/autolink') ],\n [ 'html_inline', require('./rules_inline/html_inline') ],\n [ 'entity', require('./rules_inline/entity') ]\n];\n\nvar _rules2 = [\n [ 'balance_pairs', require('./rules_inline/balance_pairs') ],\n [ 'strikethrough', require('./rules_inline/strikethrough').postProcess ],\n [ 'emphasis', require('./rules_inline/emphasis').postProcess ],\n [ 'text_collapse', require('./rules_inline/text_collapse') ]\n];\n\n\n/**\n * new ParserInline()\n **/\nfunction ParserInline() {\n var i;\n\n /**\n * ParserInline#ruler -> Ruler\n *\n * [[Ruler]] instance. Keep configuration of inline rules.\n **/\n this.ruler = new Ruler();\n\n for (i = 0; i < _rules.length; i++) {\n this.ruler.push(_rules[i][0], _rules[i][1]);\n }\n\n /**\n * ParserInline#ruler2 -> Ruler\n *\n * [[Ruler]] instance. Second ruler used for post-processing\n * (e.g. in emphasis-like rules).\n **/\n this.ruler2 = new Ruler();\n\n for (i = 0; i < _rules2.length; i++) {\n this.ruler2.push(_rules2[i][0], _rules2[i][1]);\n }\n}\n\n\n// Skip single token by running all rules in validation mode;\n// returns `true` if any rule reported success\n//\nParserInline.prototype.skipToken = function (state) {\n var ok, i, pos = state.pos,\n rules = this.ruler.getRules(''),\n len = rules.length,\n maxNesting = state.md.options.maxNesting,\n cache = state.cache;\n\n\n if (typeof cache[pos] !== 'undefined') {\n state.pos = cache[pos];\n return;\n }\n\n if (state.level < maxNesting) {\n for (i = 0; i < len; i++) {\n // Increment state.level and decrement it later to limit recursion.\n // It's harmless to do here, because no tokens are created. But ideally,\n // we'd need a separate private state variable for this purpose.\n //\n state.level++;\n ok = rules[i](state, true);\n state.level--;\n\n if (ok) { break; }\n }\n } else {\n // Too much nesting, just skip until the end of the paragraph.\n //\n // NOTE: this will cause links to behave incorrectly in the following case,\n // when an amount of `[` is exactly equal to `maxNesting + 1`:\n //\n // [[[[[[[[[[[[[[[[[[[[[foo]()\n //\n // TODO: remove this workaround when CM standard will allow nested links\n // (we can replace it by preventing links from being parsed in\n // validation mode)\n //\n state.pos = state.posMax;\n }\n\n if (!ok) { state.pos++; }\n cache[pos] = state.pos;\n};\n\n\n// Generate tokens for input range\n//\nParserInline.prototype.tokenize = function (state) {\n var ok, i,\n rules = this.ruler.getRules(''),\n len = rules.length,\n end = state.posMax,\n maxNesting = state.md.options.maxNesting;\n\n while (state.pos < end) {\n // Try all possible rules.\n // On success, rule should:\n //\n // - update `state.pos`\n // - update `state.tokens`\n // - return true\n\n if (state.level < maxNesting) {\n for (i = 0; i < len; i++) {\n ok = rules[i](state, false);\n if (ok) { break; }\n }\n }\n\n if (ok) {\n if (state.pos >= end) { break; }\n continue;\n }\n\n state.pending += state.src[state.pos++];\n }\n\n if (state.pending) {\n state.pushPending();\n }\n};\n\n\n/**\n * ParserInline.parse(str, md, env, outTokens)\n *\n * Process input string and push inline tokens into `outTokens`\n **/\nParserInline.prototype.parse = function (str, md, env, outTokens) {\n var i, rules, len;\n var state = new this.State(str, md, env, outTokens);\n\n this.tokenize(state);\n\n rules = this.ruler2.getRules('');\n len = rules.length;\n\n for (i = 0; i < len; i++) {\n rules[i](state);\n }\n};\n\n\nParserInline.prototype.State = require('./rules_inline/state_inline');\n\n\nmodule.exports = ParserInline;\n","'use strict';\n\n\nmodule.exports = function (opts) {\n var re = {};\n\n // Use direct extract instead of `regenerate` to reduse browserified size\n re.src_Any = require('uc.micro/properties/Any/regex').source;\n re.src_Cc = require('uc.micro/categories/Cc/regex').source;\n re.src_Z = require('uc.micro/categories/Z/regex').source;\n re.src_P = require('uc.micro/categories/P/regex').source;\n\n // \\p{\\Z\\P\\Cc\\CF} (white spaces + control + format + punctuation)\n re.src_ZPCc = [ re.src_Z, re.src_P, re.src_Cc ].join('|');\n\n // \\p{\\Z\\Cc} (white spaces + control)\n re.src_ZCc = [ re.src_Z, re.src_Cc ].join('|');\n\n // Experimental. List of chars, completely prohibited in links\n // because can separate it from other part of text\n var text_separators = '[><\\uff5c]';\n\n // All possible word characters (everything without punctuation, spaces & controls)\n // Defined via punctuation & spaces to save space\n // Should be something like \\p{\\L\\N\\S\\M} (\\w but without `_`)\n re.src_pseudo_letter = '(?:(?!' + text_separators + '|' + re.src_ZPCc + ')' + re.src_Any + ')';\n // The same as abothe but without [0-9]\n // var src_pseudo_letter_non_d = '(?:(?![0-9]|' + src_ZPCc + ')' + src_Any + ')';\n\n ////////////////////////////////////////////////////////////////////////////////\n\n re.src_ip4 =\n\n '(?:(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\\\.){3}(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)';\n\n // Prohibit any of \"@/[]()\" in user/pass to avoid wrong domain fetch.\n re.src_auth = '(?:(?:(?!' + re.src_ZCc + '|[@/\\\\[\\\\]()]).)+@)?';\n\n re.src_port =\n\n '(?::(?:6(?:[0-4]\\\\d{3}|5(?:[0-4]\\\\d{2}|5(?:[0-2]\\\\d|3[0-5])))|[1-5]?\\\\d{1,4}))?';\n\n re.src_host_terminator =\n\n '(?=$|' + text_separators + '|' + re.src_ZPCc + ')(?!-|_|:\\\\d|\\\\.-|\\\\.(?!$|' + re.src_ZPCc + '))';\n\n re.src_path =\n\n '(?:' +\n '[/?#]' +\n '(?:' +\n '(?!' + re.src_ZCc + '|' + text_separators + '|[()[\\\\]{}.,\"\\'?!\\\\-]).|' +\n '\\\\[(?:(?!' + re.src_ZCc + '|\\\\]).)*\\\\]|' +\n '\\\\((?:(?!' + re.src_ZCc + '|[)]).)*\\\\)|' +\n '\\\\{(?:(?!' + re.src_ZCc + '|[}]).)*\\\\}|' +\n '\\\\\"(?:(?!' + re.src_ZCc + '|[\"]).)+\\\\\"|' +\n \"\\\\'(?:(?!\" + re.src_ZCc + \"|[']).)+\\\\'|\" +\n \"\\\\'(?=\" + re.src_pseudo_letter + '|[-]).|' + // allow `I'm_king` if no pair found\n '\\\\.{2,3}[a-zA-Z0-9%/]|' + // github has ... in commit range links. Restrict to\n // - english\n // - percent-encoded\n // - parts of file path\n // until more examples found.\n '\\\\.(?!' + re.src_ZCc + '|[.]).|' +\n (opts && opts['---'] ?\n '\\\\-(?!--(?:[^-]|$))(?:-*)|' // `---` => long dash, terminate\n :\n '\\\\-+|'\n ) +\n '\\\\,(?!' + re.src_ZCc + ').|' + // allow `,,,` in paths\n '\\\\!(?!' + re.src_ZCc + '|[!]).|' +\n '\\\\?(?!' + re.src_ZCc + '|[?]).' +\n ')+' +\n '|\\\\/' +\n ')?';\n\n re.src_email_name =\n\n '[\\\\-;:&=\\\\+\\\\$,\\\\\"\\\\.a-zA-Z0-9_]+';\n\n re.src_xn =\n\n 'xn--[a-z0-9\\\\-]{1,59}';\n\n // More to read about domain names\n // http://serverfault.com/questions/638260/\n\n re.src_domain_root =\n\n // Allow letters & digits (http://test1)\n '(?:' +\n re.src_xn +\n '|' +\n re.src_pseudo_letter + '{1,63}' +\n ')';\n\n re.src_domain =\n\n '(?:' +\n re.src_xn +\n '|' +\n '(?:' + re.src_pseudo_letter + ')' +\n '|' +\n // don't allow `--` in domain names, because:\n // - that can conflict with markdown &mdash; / &ndash;\n // - nobody use those anyway\n '(?:' + re.src_pseudo_letter + '(?:-(?!-)|' + re.src_pseudo_letter + '){0,61}' + re.src_pseudo_letter + ')' +\n ')';\n\n re.src_host =\n\n '(?:' +\n // Don't need IP check, because digits are already allowed in normal domain names\n // src_ip4 +\n // '|' +\n '(?:(?:(?:' + re.src_domain + ')\\\\.)*' + re.src_domain/*_root*/ + ')' +\n ')';\n\n re.tpl_host_fuzzy =\n\n '(?:' +\n re.src_ip4 +\n '|' +\n '(?:(?:(?:' + re.src_domain + ')\\\\.)+(?:%TLDS%))' +\n ')';\n\n re.tpl_host_no_ip_fuzzy =\n\n '(?:(?:(?:' + re.src_domain + ')\\\\.)+(?:%TLDS%))';\n\n re.src_host_strict =\n\n re.src_host + re.src_host_terminator;\n\n re.tpl_host_fuzzy_strict =\n\n re.tpl_host_fuzzy + re.src_host_terminator;\n\n re.src_host_port_strict =\n\n re.src_host + re.src_port + re.src_host_terminator;\n\n re.tpl_host_port_fuzzy_strict =\n\n re.tpl_host_fuzzy + re.src_port + re.src_host_terminator;\n\n re.tpl_host_port_no_ip_fuzzy_strict =\n\n re.tpl_host_no_ip_fuzzy + re.src_port + re.src_host_terminator;\n\n\n ////////////////////////////////////////////////////////////////////////////////\n // Main rules\n\n // Rude test fuzzy links by host, for quick deny\n re.tpl_host_fuzzy_test =\n\n 'localhost|www\\\\.|\\\\.\\\\d{1,3}\\\\.|(?:\\\\.(?:%TLDS%)(?:' + re.src_ZPCc + '|>|$))';\n\n re.tpl_email_fuzzy =\n\n '(^|' + text_separators + '|\\\\(|' + re.src_ZCc + ')(' + re.src_email_name + '@' + re.tpl_host_fuzzy_strict + ')';\n\n re.tpl_link_fuzzy =\n // Fuzzy link can't be prepended with .:/\\- and non punctuation.\n // but can start with > (markdown blockquote)\n '(^|(?![.:/\\\\-_@])(?:[$+<=>^`|\\uff5c]|' + re.src_ZPCc + '))' +\n '((?![$+<=>^`|\\uff5c])' + re.tpl_host_port_fuzzy_strict + re.src_path + ')';\n\n re.tpl_link_no_ip_fuzzy =\n // Fuzzy link can't be prepended with .:/\\- and non punctuation.\n // but can start with > (markdown blockquote)\n '(^|(?![.:/\\\\-_@])(?:[$+<=>^`|\\uff5c]|' + re.src_ZPCc + '))' +\n '((?![$+<=>^`|\\uff5c])' + re.tpl_host_port_no_ip_fuzzy_strict + re.src_path + ')';\n\n return re;\n};\n","'use strict';\n\n\n////////////////////////////////////////////////////////////////////////////////\n// Helpers\n\n// Merge objects\n//\nfunction assign(obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n\n sources.forEach(function (source) {\n if (!source) { return; }\n\n Object.keys(source).forEach(function (key) {\n obj[key] = source[key];\n });\n });\n\n return obj;\n}\n\nfunction _class(obj) { return Object.prototype.toString.call(obj); }\nfunction isString(obj) { return _class(obj) === '[object String]'; }\nfunction isObject(obj) { return _class(obj) === '[object Object]'; }\nfunction isRegExp(obj) { return _class(obj) === '[object RegExp]'; }\nfunction isFunction(obj) { return _class(obj) === '[object Function]'; }\n\n\nfunction escapeRE(str) { return str.replace(/[.?*+^$[\\]\\\\(){}|-]/g, '\\\\$&'); }\n\n////////////////////////////////////////////////////////////////////////////////\n\n\nvar defaultOptions = {\n fuzzyLink: true,\n fuzzyEmail: true,\n fuzzyIP: false\n};\n\n\nfunction isOptionsObj(obj) {\n return Object.keys(obj || {}).reduce(function (acc, k) {\n return acc || defaultOptions.hasOwnProperty(k);\n }, false);\n}\n\n\nvar defaultSchemas = {\n 'http:': {\n validate: function (text, pos, self) {\n var tail = text.slice(pos);\n\n if (!self.re.http) {\n // compile lazily, because \"host\"-containing variables can change on tlds update.\n self.re.http = new RegExp(\n '^\\\\/\\\\/' + self.re.src_auth + self.re.src_host_port_strict + self.re.src_path, 'i'\n );\n }\n if (self.re.http.test(tail)) {\n return tail.match(self.re.http)[0].length;\n }\n return 0;\n }\n },\n 'https:': 'http:',\n 'ftp:': 'http:',\n '//': {\n validate: function (text, pos, self) {\n var tail = text.slice(pos);\n\n if (!self.re.no_http) {\n // compile lazily, because \"host\"-containing variables can change on tlds update.\n self.re.no_http = new RegExp(\n '^' +\n self.re.src_auth +\n // Don't allow single-level domains, because of false positives like '//test'\n // with code comments\n '(?:localhost|(?:(?:' + self.re.src_domain + ')\\\\.)+' + self.re.src_domain_root + ')' +\n self.re.src_port +\n self.re.src_host_terminator +\n self.re.src_path,\n\n 'i'\n );\n }\n\n if (self.re.no_http.test(tail)) {\n // should not be `://` & `///`, that protects from errors in protocol name\n if (pos >= 3 && text[pos - 3] === ':') { return 0; }\n if (pos >= 3 && text[pos - 3] === '/') { return 0; }\n return tail.match(self.re.no_http)[0].length;\n }\n return 0;\n }\n },\n 'mailto:': {\n validate: function (text, pos, self) {\n var tail = text.slice(pos);\n\n if (!self.re.mailto) {\n self.re.mailto = new RegExp(\n '^' + self.re.src_email_name + '@' + self.re.src_host_strict, 'i'\n );\n }\n if (self.re.mailto.test(tail)) {\n return tail.match(self.re.mailto)[0].length;\n }\n return 0;\n }\n }\n};\n\n/*eslint-disable max-len*/\n\n// RE pattern for 2-character tlds (autogenerated by ./support/tlds_2char_gen.js)\nvar tlds_2ch_src_re = 'a[cdefgilmnoqrstuwxz]|b[abdefghijmnorstvwyz]|c[acdfghiklmnoruvwxyz]|d[ejkmoz]|e[cegrstu]|f[ijkmor]|g[abdefghilmnpqrstuwy]|h[kmnrtu]|i[delmnoqrst]|j[emop]|k[eghimnprwyz]|l[abcikrstuvy]|m[acdeghklmnopqrstuvwxyz]|n[acefgilopruz]|om|p[aefghklmnrstwy]|qa|r[eosuw]|s[abcdeghijklmnortuvxyz]|t[cdfghjklmnortvwz]|u[agksyz]|v[aceginu]|w[fs]|y[et]|z[amw]';\n\n// DON'T try to make PRs with changes. Extend TLDs with LinkifyIt.tlds() instead\nvar tlds_default = 'biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф'.split('|');\n\n/*eslint-enable max-len*/\n\n////////////////////////////////////////////////////////////////////////////////\n\nfunction resetScanCache(self) {\n self.__index__ = -1;\n self.__text_cache__ = '';\n}\n\nfunction createValidator(re) {\n return function (text, pos) {\n var tail = text.slice(pos);\n\n if (re.test(tail)) {\n return tail.match(re)[0].length;\n }\n return 0;\n };\n}\n\nfunction createNormalizer() {\n return function (match, self) {\n self.normalize(match);\n };\n}\n\n// Schemas compiler. Build regexps.\n//\nfunction compile(self) {\n\n // Load & clone RE patterns.\n var re = self.re = require('./lib/re')(self.__opts__);\n\n // Define dynamic patterns\n var tlds = self.__tlds__.slice();\n\n self.onCompile();\n\n if (!self.__tlds_replaced__) {\n tlds.push(tlds_2ch_src_re);\n }\n tlds.push(re.src_xn);\n\n re.src_tlds = tlds.join('|');\n\n function untpl(tpl) { return tpl.replace('%TLDS%', re.src_tlds); }\n\n re.email_fuzzy = RegExp(untpl(re.tpl_email_fuzzy), 'i');\n re.link_fuzzy = RegExp(untpl(re.tpl_link_fuzzy), 'i');\n re.link_no_ip_fuzzy = RegExp(untpl(re.tpl_link_no_ip_fuzzy), 'i');\n re.host_fuzzy_test = RegExp(untpl(re.tpl_host_fuzzy_test), 'i');\n\n //\n // Compile each schema\n //\n\n var aliases = [];\n\n self.__compiled__ = {}; // Reset compiled data\n\n function schemaError(name, val) {\n throw new Error('(LinkifyIt) Invalid schema \"' + name + '\": ' + val);\n }\n\n Object.keys(self.__schemas__).forEach(function (name) {\n var val = self.__schemas__[name];\n\n // skip disabled methods\n if (val === null) { return; }\n\n var compiled = { validate: null, link: null };\n\n self.__compiled__[name] = compiled;\n\n if (isObject(val)) {\n if (isRegExp(val.validate)) {\n compiled.validate = createValidator(val.validate);\n } else if (isFunction(val.validate)) {\n compiled.validate = val.validate;\n } else {\n schemaError(name, val);\n }\n\n if (isFunction(val.normalize)) {\n compiled.normalize = val.normalize;\n } else if (!val.normalize) {\n compiled.normalize = createNormalizer();\n } else {\n schemaError(name, val);\n }\n\n return;\n }\n\n if (isString(val)) {\n aliases.push(name);\n return;\n }\n\n schemaError(name, val);\n });\n\n //\n // Compile postponed aliases\n //\n\n aliases.forEach(function (alias) {\n if (!self.__compiled__[self.__schemas__[alias]]) {\n // Silently fail on missed schemas to avoid errons on disable.\n // schemaError(alias, self.__schemas__[alias]);\n return;\n }\n\n self.__compiled__[alias].validate =\n self.__compiled__[self.__schemas__[alias]].validate;\n self.__compiled__[alias].normalize =\n self.__compiled__[self.__schemas__[alias]].normalize;\n });\n\n //\n // Fake record for guessed links\n //\n self.__compiled__[''] = { validate: null, normalize: createNormalizer() };\n\n //\n // Build schema condition\n //\n var slist = Object.keys(self.__compiled__)\n .filter(function (name) {\n // Filter disabled & fake schemas\n return name.length > 0 && self.__compiled__[name];\n })\n .map(escapeRE)\n .join('|');\n // (?!_) cause 1.5x slowdown\n self.re.schema_test = RegExp('(^|(?!_)(?:[><\\uff5c]|' + re.src_ZPCc + '))(' + slist + ')', 'i');\n self.re.schema_search = RegExp('(^|(?!_)(?:[><\\uff5c]|' + re.src_ZPCc + '))(' + slist + ')', 'ig');\n\n self.re.pretest = RegExp(\n '(' + self.re.schema_test.source + ')|' +\n '(' + self.re.host_fuzzy_test.source + ')|' +\n '@',\n 'i');\n\n //\n // Cleanup\n //\n\n resetScanCache(self);\n}\n\n/**\n * class Match\n *\n * Match result. Single element of array, returned by [[LinkifyIt#match]]\n **/\nfunction Match(self, shift) {\n var start = self.__index__,\n end = self.__last_index__,\n text = self.__text_cache__.slice(start, end);\n\n /**\n * Match#schema -> String\n *\n * Prefix (protocol) for matched string.\n **/\n this.schema = self.__schema__.toLowerCase();\n /**\n * Match#index -> Number\n *\n * First position of matched string.\n **/\n this.index = start + shift;\n /**\n * Match#lastIndex -> Number\n *\n * Next position after matched string.\n **/\n this.lastIndex = end + shift;\n /**\n * Match#raw -> String\n *\n * Matched string.\n **/\n this.raw = text;\n /**\n * Match#text -> String\n *\n * Notmalized text of matched string.\n **/\n this.text = text;\n /**\n * Match#url -> String\n *\n * Normalized url of matched string.\n **/\n this.url = text;\n}\n\nfunction createMatch(self, shift) {\n var match = new Match(self, shift);\n\n self.__compiled__[match.schema].normalize(match, self);\n\n return match;\n}\n\n\n/**\n * class LinkifyIt\n **/\n\n/**\n * new LinkifyIt(schemas, options)\n * - schemas (Object): Optional. Additional schemas to validate (prefix/validator)\n * - options (Object): { fuzzyLink|fuzzyEmail|fuzzyIP: true|false }\n *\n * Creates new linkifier instance with optional additional schemas.\n * Can be called without `new` keyword for convenience.\n *\n * By default understands:\n *\n * - `http(s)://...` , `ftp://...`, `mailto:...` & `//...` links\n * - \"fuzzy\" links and emails (example.com, foo@bar.com).\n *\n * `schemas` is an object, where each key/value describes protocol/rule:\n *\n * - __key__ - link prefix (usually, protocol name with `:` at the end, `skype:`\n * for example). `linkify-it` makes shure that prefix is not preceeded with\n * alphanumeric char and symbols. Only whitespaces and punctuation allowed.\n * - __value__ - rule to check tail after link prefix\n * - _String_ - just alias to existing rule\n * - _Object_\n * - _validate_ - validator function (should return matched length on success),\n * or `RegExp`.\n * - _normalize_ - optional function to normalize text & url of matched result\n * (for example, for @twitter mentions).\n *\n * `options`:\n *\n * - __fuzzyLink__ - recognige URL-s without `http(s):` prefix. Default `true`.\n * - __fuzzyIP__ - allow IPs in fuzzy links above. Can conflict with some texts\n * like version numbers. Default `false`.\n * - __fuzzyEmail__ - recognize emails without `mailto:` prefix.\n *\n **/\nfunction LinkifyIt(schemas, options) {\n if (!(this instanceof LinkifyIt)) {\n return new LinkifyIt(schemas, options);\n }\n\n if (!options) {\n if (isOptionsObj(schemas)) {\n options = schemas;\n schemas = {};\n }\n }\n\n this.__opts__ = assign({}, defaultOptions, options);\n\n // Cache last tested result. Used to skip repeating steps on next `match` call.\n this.__index__ = -1;\n this.__last_index__ = -1; // Next scan position\n this.__schema__ = '';\n this.__text_cache__ = '';\n\n this.__schemas__ = assign({}, defaultSchemas, schemas);\n this.__compiled__ = {};\n\n this.__tlds__ = tlds_default;\n this.__tlds_replaced__ = false;\n\n this.re = {};\n\n compile(this);\n}\n\n\n/** chainable\n * LinkifyIt#add(schema, definition)\n * - schema (String): rule name (fixed pattern prefix)\n * - definition (String|RegExp|Object): schema definition\n *\n * Add new rule definition. See constructor description for details.\n **/\nLinkifyIt.prototype.add = function add(schema, definition) {\n this.__schemas__[schema] = definition;\n compile(this);\n return this;\n};\n\n\n/** chainable\n * LinkifyIt#set(options)\n * - options (Object): { fuzzyLink|fuzzyEmail|fuzzyIP: true|false }\n *\n * Set recognition options for links without schema.\n **/\nLinkifyIt.prototype.set = function set(options) {\n this.__opts__ = assign(this.__opts__, options);\n return this;\n};\n\n\n/**\n * LinkifyIt#test(text) -> Boolean\n *\n * Searches linkifiable pattern and returns `true` on success or `false` on fail.\n **/\nLinkifyIt.prototype.test = function test(text) {\n // Reset scan cache\n this.__text_cache__ = text;\n this.__index__ = -1;\n\n if (!text.length) { return false; }\n\n var m, ml, me, len, shift, next, re, tld_pos, at_pos;\n\n // try to scan for link with schema - that's the most simple rule\n if (this.re.schema_test.test(text)) {\n re = this.re.schema_search;\n re.lastIndex = 0;\n while ((m = re.exec(text)) !== null) {\n len = this.testSchemaAt(text, m[2], re.lastIndex);\n if (len) {\n this.__schema__ = m[2];\n this.__index__ = m.index + m[1].length;\n this.__last_index__ = m.index + m[0].length + len;\n break;\n }\n }\n }\n\n if (this.__opts__.fuzzyLink && this.__compiled__['http:']) {\n // guess schemaless links\n tld_pos = text.search(this.re.host_fuzzy_test);\n if (tld_pos >= 0) {\n // if tld is located after found link - no need to check fuzzy pattern\n if (this.__index__ < 0 || tld_pos < this.__index__) {\n if ((ml = text.match(this.__opts__.fuzzyIP ? this.re.link_fuzzy : this.re.link_no_ip_fuzzy)) !== null) {\n\n shift = ml.index + ml[1].length;\n\n if (this.__index__ < 0 || shift < this.__index__) {\n this.__schema__ = '';\n this.__index__ = shift;\n this.__last_index__ = ml.index + ml[0].length;\n }\n }\n }\n }\n }\n\n if (this.__opts__.fuzzyEmail && this.__compiled__['mailto:']) {\n // guess schemaless emails\n at_pos = text.indexOf('@');\n if (at_pos >= 0) {\n // We can't skip this check, because this cases are possible:\n // 192.168.1.1@gmail.com, my.in@example.com\n if ((me = text.match(this.re.email_fuzzy)) !== null) {\n\n shift = me.index + me[1].length;\n next = me.index + me[0].length;\n\n if (this.__index__ < 0 || shift < this.__index__ ||\n (shift === this.__index__ && next > this.__last_index__)) {\n this.__schema__ = 'mailto:';\n this.__index__ = shift;\n this.__last_index__ = next;\n }\n }\n }\n }\n\n return this.__index__ >= 0;\n};\n\n\n/**\n * LinkifyIt#pretest(text) -> Boolean\n *\n * Very quick check, that can give false positives. Returns true if link MAY BE\n * can exists. Can be used for speed optimization, when you need to check that\n * link NOT exists.\n **/\nLinkifyIt.prototype.pretest = function pretest(text) {\n return this.re.pretest.test(text);\n};\n\n\n/**\n * LinkifyIt#testSchemaAt(text, name, position) -> Number\n * - text (String): text to scan\n * - name (String): rule (schema) name\n * - position (Number): text offset to check from\n *\n * Similar to [[LinkifyIt#test]] but checks only specific protocol tail exactly\n * at given position. Returns length of found pattern (0 on fail).\n **/\nLinkifyIt.prototype.testSchemaAt = function testSchemaAt(text, schema, pos) {\n // If not supported schema check requested - terminate\n if (!this.__compiled__[schema.toLowerCase()]) {\n return 0;\n }\n return this.__compiled__[schema.toLowerCase()].validate(text, pos, this);\n};\n\n\n/**\n * LinkifyIt#match(text) -> Array|null\n *\n * Returns array of found link descriptions or `null` on fail. We strongly\n * recommend to use [[LinkifyIt#test]] first, for best speed.\n *\n * ##### Result match description\n *\n * - __schema__ - link schema, can be empty for fuzzy links, or `//` for\n * protocol-neutral links.\n * - __index__ - offset of matched text\n * - __lastIndex__ - index of next char after mathch end\n * - __raw__ - matched text\n * - __text__ - normalized text\n * - __url__ - link, generated from matched text\n **/\nLinkifyIt.prototype.match = function match(text) {\n var shift = 0, result = [];\n\n // Try to take previous element from cache, if .test() called before\n if (this.__index__ >= 0 && this.__text_cache__ === text) {\n result.push(createMatch(this, shift));\n shift = this.__last_index__;\n }\n\n // Cut head if cache was used\n var tail = shift ? text.slice(shift) : text;\n\n // Scan string until end reached\n while (this.test(tail)) {\n result.push(createMatch(this, shift));\n\n tail = tail.slice(this.__last_index__);\n shift += this.__last_index__;\n }\n\n if (result.length) {\n return result;\n }\n\n return null;\n};\n\n\n/** chainable\n * LinkifyIt#tlds(list [, keepOld]) -> this\n * - list (Array): list of tlds\n * - keepOld (Boolean): merge with current list if `true` (`false` by default)\n *\n * Load (or merge) new tlds list. Those are user for fuzzy links (without prefix)\n * to avoid false positives. By default this algorythm used:\n *\n * - hostname with any 2-letter root zones are ok.\n * - biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф\n * are ok.\n * - encoded (`xn--...`) root zones are ok.\n *\n * If list is replaced, then exact match for 2-chars root zones will be checked.\n **/\nLinkifyIt.prototype.tlds = function tlds(list, keepOld) {\n list = Array.isArray(list) ? list : [ list ];\n\n if (!keepOld) {\n this.__tlds__ = list.slice();\n this.__tlds_replaced__ = true;\n compile(this);\n return this;\n }\n\n this.__tlds__ = this.__tlds__.concat(list)\n .sort()\n .filter(function (el, idx, arr) {\n return el !== arr[idx - 1];\n })\n .reverse();\n\n compile(this);\n return this;\n};\n\n/**\n * LinkifyIt#normalize(match)\n *\n * Default normalizer (if schema does not define it's own).\n **/\nLinkifyIt.prototype.normalize = function normalize(match) {\n\n // Do minimal possible changes by default. Need to collect feedback prior\n // to move forward https://github.com/markdown-it/linkify-it/issues/1\n\n if (!match.schema) { match.url = 'http://' + match.url; }\n\n if (match.schema === 'mailto:' && !/^mailto:/i.test(match.url)) {\n match.url = 'mailto:' + match.url;\n }\n};\n\n\n/**\n * LinkifyIt#onCompile()\n *\n * Override to modify basic RegExp-s.\n **/\nLinkifyIt.prototype.onCompile = function onCompile() {\n};\n\n\nmodule.exports = LinkifyIt;\n","// markdown-it default options\n\n'use strict';\n\n\nmodule.exports = {\n options: {\n html: false, // Enable HTML tags in source\n xhtmlOut: false, // Use '/' to close single tags (<br />)\n breaks: false, // Convert '\\n' in paragraphs into <br>\n langPrefix: 'language-', // CSS language prefix for fenced blocks\n linkify: false, // autoconvert URL-like texts to links\n\n // Enable some language-neutral replacements + quotes beautification\n typographer: false,\n\n // Double + single quotes replacement pairs, when typographer enabled,\n // and smartquotes on. Could be either a String or an Array.\n //\n // For example, you can use '«»„“' for Russian, '„“‚‘' for German,\n // and ['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›'] for French (including nbsp).\n quotes: '\\u201c\\u201d\\u2018\\u2019', /* “”‘’ */\n\n // Highlighter function. Should return escaped HTML,\n // or '' if the source string is not changed and should be escaped externaly.\n // If result starts with <pre... internal wrapper is skipped.\n //\n // function (/*str, lang*/) { return ''; }\n //\n highlight: null,\n\n maxNesting: 100 // Internal protection, recursion limit\n },\n\n components: {\n\n core: {},\n block: {},\n inline: {}\n }\n};\n","// \"Zero\" preset, with nothing enabled. Useful for manual configuring of simple\n// modes. For example, to parse bold/italic only.\n\n'use strict';\n\n\nmodule.exports = {\n options: {\n html: false, // Enable HTML tags in source\n xhtmlOut: false, // Use '/' to close single tags (<br />)\n breaks: false, // Convert '\\n' in paragraphs into <br>\n langPrefix: 'language-', // CSS language prefix for fenced blocks\n linkify: false, // autoconvert URL-like texts to links\n\n // Enable some language-neutral replacements + quotes beautification\n typographer: false,\n\n // Double + single quotes replacement pairs, when typographer enabled,\n // and smartquotes on. Could be either a String or an Array.\n //\n // For example, you can use '«»„“' for Russian, '„“‚‘' for German,\n // and ['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›'] for French (including nbsp).\n quotes: '\\u201c\\u201d\\u2018\\u2019', /* “”‘’ */\n\n // Highlighter function. Should return escaped HTML,\n // or '' if the source string is not changed and should be escaped externaly.\n // If result starts with <pre... internal wrapper is skipped.\n //\n // function (/*str, lang*/) { return ''; }\n //\n highlight: null,\n\n maxNesting: 20 // Internal protection, recursion limit\n },\n\n components: {\n\n core: {\n rules: [\n 'normalize',\n 'block',\n 'inline'\n ]\n },\n\n block: {\n rules: [\n 'paragraph'\n ]\n },\n\n inline: {\n rules: [\n 'text'\n ],\n rules2: [\n 'balance_pairs',\n 'text_collapse'\n ]\n }\n }\n};\n","// Commonmark default options\n\n'use strict';\n\n\nmodule.exports = {\n options: {\n html: true, // Enable HTML tags in source\n xhtmlOut: true, // Use '/' to close single tags (<br />)\n breaks: false, // Convert '\\n' in paragraphs into <br>\n langPrefix: 'language-', // CSS language prefix for fenced blocks\n linkify: false, // autoconvert URL-like texts to links\n\n // Enable some language-neutral replacements + quotes beautification\n typographer: false,\n\n // Double + single quotes replacement pairs, when typographer enabled,\n // and smartquotes on. Could be either a String or an Array.\n //\n // For example, you can use '«»„“' for Russian, '„“‚‘' for German,\n // and ['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›'] for French (including nbsp).\n quotes: '\\u201c\\u201d\\u2018\\u2019', /* “”‘’ */\n\n // Highlighter function. Should return escaped HTML,\n // or '' if the source string is not changed and should be escaped externaly.\n // If result starts with <pre... internal wrapper is skipped.\n //\n // function (/*str, lang*/) { return ''; }\n //\n highlight: null,\n\n maxNesting: 20 // Internal protection, recursion limit\n },\n\n components: {\n\n core: {\n rules: [\n 'normalize',\n 'block',\n 'inline'\n ]\n },\n\n block: {\n rules: [\n 'blockquote',\n 'code',\n 'fence',\n 'heading',\n 'hr',\n 'html_block',\n 'lheading',\n 'list',\n 'reference',\n 'paragraph'\n ]\n },\n\n inline: {\n rules: [\n 'autolink',\n 'backticks',\n 'emphasis',\n 'entity',\n 'escape',\n 'html_inline',\n 'image',\n 'link',\n 'newline',\n 'text'\n ],\n rules2: [\n 'balance_pairs',\n 'emphasis',\n 'text_collapse'\n ]\n }\n }\n};\n","// Main parser class\n\n'use strict';\n\n\nvar utils = require('./common/utils');\nvar helpers = require('./helpers');\nvar Renderer = require('./renderer');\nvar ParserCore = require('./parser_core');\nvar ParserBlock = require('./parser_block');\nvar ParserInline = require('./parser_inline');\nvar LinkifyIt = require('linkify-it');\nvar mdurl = require('mdurl');\nvar punycode = require('punycode');\n\n\nvar config = {\n 'default': require('./presets/default'),\n zero: require('./presets/zero'),\n commonmark: require('./presets/commonmark')\n};\n\n////////////////////////////////////////////////////////////////////////////////\n//\n// This validator can prohibit more than really needed to prevent XSS. It's a\n// tradeoff to keep code simple and to be secure by default.\n//\n// If you need different setup - override validator method as you wish. Or\n// replace it with dummy function and use external sanitizer.\n//\n\nvar BAD_PROTO_RE = /^(vbscript|javascript|file|data):/;\nvar GOOD_DATA_RE = /^data:image\\/(gif|png|jpeg|webp);/;\n\nfunction validateLink(url) {\n // url should be normalized at this point, and existing entities are decoded\n var str = url.trim().toLowerCase();\n\n return BAD_PROTO_RE.test(str) ? (GOOD_DATA_RE.test(str) ? true : false) : true;\n}\n\n////////////////////////////////////////////////////////////////////////////////\n\n\nvar RECODE_HOSTNAME_FOR = [ 'http:', 'https:', 'mailto:' ];\n\nfunction normalizeLink(url) {\n var parsed = mdurl.parse(url, true);\n\n if (parsed.hostname) {\n // Encode hostnames in urls like:\n // `http://host/`, `https://host/`, `mailto:user@host`, `//host/`\n //\n // We don't encode unknown schemas, because it's likely that we encode\n // something we shouldn't (e.g. `skype:name` treated as `skype:host`)\n //\n if (!parsed.protocol || RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0) {\n try {\n parsed.hostname = punycode.toASCII(parsed.hostname);\n } catch (er) { /**/ }\n }\n }\n\n return mdurl.encode(mdurl.format(parsed));\n}\n\nfunction normalizeLinkText(url) {\n var parsed = mdurl.parse(url, true);\n\n if (parsed.hostname) {\n // Encode hostnames in urls like:\n // `http://host/`, `https://host/`, `mailto:user@host`, `//host/`\n //\n // We don't encode unknown schemas, because it's likely that we encode\n // something we shouldn't (e.g. `skype:name` treated as `skype:host`)\n //\n if (!parsed.protocol || RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0) {\n try {\n parsed.hostname = punycode.toUnicode(parsed.hostname);\n } catch (er) { /**/ }\n }\n }\n\n return mdurl.decode(mdurl.format(parsed));\n}\n\n\n/**\n * class MarkdownIt\n *\n * Main parser/renderer class.\n *\n * ##### Usage\n *\n * ```javascript\n * // node.js, \"classic\" way:\n * var MarkdownIt = require('markdown-it'),\n * md = new MarkdownIt();\n * var result = md.render('# markdown-it rulezz!');\n *\n * // node.js, the same, but with sugar:\n * var md = require('markdown-it')();\n * var result = md.render('# markdown-it rulezz!');\n *\n * // browser without AMD, added to \"window\" on script load\n * // Note, there are no dash.\n * var md = window.markdownit();\n * var result = md.render('# markdown-it rulezz!');\n * ```\n *\n * Single line rendering, without paragraph wrap:\n *\n * ```javascript\n * var md = require('markdown-it')();\n * var result = md.renderInline('__markdown-it__ rulezz!');\n * ```\n **/\n\n/**\n * new MarkdownIt([presetName, options])\n * - presetName (String): optional, `commonmark` / `zero`\n * - options (Object)\n *\n * Creates parser instanse with given config. Can be called without `new`.\n *\n * ##### presetName\n *\n * MarkdownIt provides named presets as a convenience to quickly\n * enable/disable active syntax rules and options for common use cases.\n *\n * - [\"commonmark\"](https://github.com/markdown-it/markdown-it/blob/master/lib/presets/commonmark.js) -\n * configures parser to strict [CommonMark](http://commonmark.org/) mode.\n * - [default](https://github.com/markdown-it/markdown-it/blob/master/lib/presets/default.js) -\n * similar to GFM, used when no preset name given. Enables all available rules,\n * but still without html, typographer & autolinker.\n * - [\"zero\"](https://github.com/markdown-it/markdown-it/blob/master/lib/presets/zero.js) -\n * all rules disabled. Useful to quickly setup your config via `.enable()`.\n * For example, when you need only `bold` and `italic` markup and nothing else.\n *\n * ##### options:\n *\n * - __html__ - `false`. Set `true` to enable HTML tags in source. Be careful!\n * That's not safe! You may need external sanitizer to protect output from XSS.\n * It's better to extend features via plugins, instead of enabling HTML.\n * - __xhtmlOut__ - `false`. Set `true` to add '/' when closing single tags\n * (`<br />`). This is needed only for full CommonMark compatibility. In real\n * world you will need HTML output.\n * - __breaks__ - `false`. Set `true` to convert `\\n` in paragraphs into `<br>`.\n * - __langPrefix__ - `language-`. CSS language class prefix for fenced blocks.\n * Can be useful for external highlighters.\n * - __linkify__ - `false`. Set `true` to autoconvert URL-like text to links.\n * - __typographer__ - `false`. Set `true` to enable [some language-neutral\n * replacement](https://github.com/markdown-it/markdown-it/blob/master/lib/rules_core/replacements.js) +\n * quotes beautification (smartquotes).\n * - __quotes__ - `“”‘’`, String or Array. Double + single quotes replacement\n * pairs, when typographer enabled and smartquotes on. For example, you can\n * use `'«»„“'` for Russian, `'„“‚‘'` for German, and\n * `['«\\xA0', '\\xA0»', '‹\\xA0', '\\xA0›']` for French (including nbsp).\n * - __highlight__ - `null`. Highlighter function for fenced code blocks.\n * Highlighter `function (str, lang)` should return escaped HTML. It can also\n * return empty string if the source was not changed and should be escaped\n * externaly. If result starts with <pre... internal wrapper is skipped.\n *\n * ##### Example\n *\n * ```javascript\n * // commonmark mode\n * var md = require('markdown-it')('commonmark');\n *\n * // default mode\n * var md = require('markdown-it')();\n *\n * // enable everything\n * var md = require('markdown-it')({\n * html: true,\n * linkify: true,\n * typographer: true\n * });\n * ```\n *\n * ##### Syntax highlighting\n *\n * ```js\n * var hljs = require('highlight.js') // https://highlightjs.org/\n *\n * var md = require('markdown-it')({\n * highlight: function (str, lang) {\n * if (lang && hljs.getLanguage(lang)) {\n * try {\n * return hljs.highlight(lang, str, true).value;\n * } catch (__) {}\n * }\n *\n * return ''; // use external default escaping\n * }\n * });\n * ```\n *\n * Or with full wrapper override (if you need assign class to `<pre>`):\n *\n * ```javascript\n * var hljs = require('highlight.js') // https://highlightjs.org/\n *\n * // Actual default values\n * var md = require('markdown-it')({\n * highlight: function (str, lang) {\n * if (lang && hljs.getLanguage(lang)) {\n * try {\n * return '<pre class=\"hljs\"><code>' +\n * hljs.highlight(lang, str, true).value +\n * '</code></pre>';\n * } catch (__) {}\n * }\n *\n * return '<pre class=\"hljs\"><code>' + md.utils.escapeHtml(str) + '</code></pre>';\n * }\n * });\n * ```\n *\n **/\nfunction MarkdownIt(presetName, options) {\n if (!(this instanceof MarkdownIt)) {\n return new MarkdownIt(presetName, options);\n }\n\n if (!options) {\n if (!utils.isString(presetName)) {\n options = presetName || {};\n presetName = 'default';\n }\n }\n\n /**\n * MarkdownIt#inline -> ParserInline\n *\n * Instance of [[ParserInline]]. You may need it to add new rules when\n * writing plugins. For simple rules control use [[MarkdownIt.disable]] and\n * [[MarkdownIt.enable]].\n **/\n this.inline = new ParserInline();\n\n /**\n * MarkdownIt#block -> ParserBlock\n *\n * Instance of [[ParserBlock]]. You may need it to add new rules when\n * writing plugins. For simple rules control use [[MarkdownIt.disable]] and\n * [[MarkdownIt.enable]].\n **/\n this.block = new ParserBlock();\n\n /**\n * MarkdownIt#core -> Core\n *\n * Instance of [[Core]] chain executor. You may need it to add new rules when\n * writing plugins. For simple rules control use [[MarkdownIt.disable]] and\n * [[MarkdownIt.enable]].\n **/\n this.core = new ParserCore();\n\n /**\n * MarkdownIt#renderer -> Renderer\n *\n * Instance of [[Renderer]]. Use it to modify output look. Or to add rendering\n * rules for new token types, generated by plugins.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')();\n *\n * function myToken(tokens, idx, options, env, self) {\n * //...\n * return result;\n * };\n *\n * md.renderer.rules['my_token'] = myToken\n * ```\n *\n * See [[Renderer]] docs and [source code](https://github.com/markdown-it/markdown-it/blob/master/lib/renderer.js).\n **/\n this.renderer = new Renderer();\n\n /**\n * MarkdownIt#linkify -> LinkifyIt\n *\n * [linkify-it](https://github.com/markdown-it/linkify-it) instance.\n * Used by [linkify](https://github.com/markdown-it/markdown-it/blob/master/lib/rules_core/linkify.js)\n * rule.\n **/\n this.linkify = new LinkifyIt();\n\n /**\n * MarkdownIt#validateLink(url) -> Boolean\n *\n * Link validation function. CommonMark allows too much in links. By default\n * we disable `javascript:`, `vbscript:`, `file:` schemas, and almost all `data:...` schemas\n * except some embedded image types.\n *\n * You can change this behaviour:\n *\n * ```javascript\n * var md = require('markdown-it')();\n * // enable everything\n * md.validateLink = function () { return true; }\n * ```\n **/\n this.validateLink = validateLink;\n\n /**\n * MarkdownIt#normalizeLink(url) -> String\n *\n * Function used to encode link url to a machine-readable format,\n * which includes url-encoding, punycode, etc.\n **/\n this.normalizeLink = normalizeLink;\n\n /**\n * MarkdownIt#normalizeLinkText(url) -> String\n *\n * Function used to decode link url to a human-readable format`\n **/\n this.normalizeLinkText = normalizeLinkText;\n\n\n // Expose utils & helpers for easy acces from plugins\n\n /**\n * MarkdownIt#utils -> utils\n *\n * Assorted utility functions, useful to write plugins. See details\n * [here](https://github.com/markdown-it/markdown-it/blob/master/lib/common/utils.js).\n **/\n this.utils = utils;\n\n /**\n * MarkdownIt#helpers -> helpers\n *\n * Link components parser functions, useful to write plugins. See details\n * [here](https://github.com/markdown-it/markdown-it/blob/master/lib/helpers).\n **/\n this.helpers = utils.assign({}, helpers);\n\n\n this.options = {};\n this.configure(presetName);\n\n if (options) { this.set(options); }\n}\n\n\n/** chainable\n * MarkdownIt.set(options)\n *\n * Set parser options (in the same format as in constructor). Probably, you\n * will never need it, but you can change options after constructor call.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')()\n * .set({ html: true, breaks: true })\n * .set({ typographer, true });\n * ```\n *\n * __Note:__ To achieve the best possible performance, don't modify a\n * `markdown-it` instance options on the fly. If you need multiple configurations\n * it's best to create multiple instances and initialize each with separate\n * config.\n **/\nMarkdownIt.prototype.set = function (options) {\n utils.assign(this.options, options);\n return this;\n};\n\n\n/** chainable, internal\n * MarkdownIt.configure(presets)\n *\n * Batch load of all options and compenent settings. This is internal method,\n * and you probably will not need it. But if you with - see available presets\n * and data structure [here](https://github.com/markdown-it/markdown-it/tree/master/lib/presets)\n *\n * We strongly recommend to use presets instead of direct config loads. That\n * will give better compatibility with next versions.\n **/\nMarkdownIt.prototype.configure = function (presets) {\n var self = this, presetName;\n\n if (utils.isString(presets)) {\n presetName = presets;\n presets = config[presetName];\n if (!presets) { throw new Error('Wrong `markdown-it` preset \"' + presetName + '\", check name'); }\n }\n\n if (!presets) { throw new Error('Wrong `markdown-it` preset, can\\'t be empty'); }\n\n if (presets.options) { self.set(presets.options); }\n\n if (presets.components) {\n Object.keys(presets.components).forEach(function (name) {\n if (presets.components[name].rules) {\n self[name].ruler.enableOnly(presets.components[name].rules);\n }\n if (presets.components[name].rules2) {\n self[name].ruler2.enableOnly(presets.components[name].rules2);\n }\n });\n }\n return this;\n};\n\n\n/** chainable\n * MarkdownIt.enable(list, ignoreInvalid)\n * - list (String|Array): rule name or list of rule names to enable\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * Enable list or rules. It will automatically find appropriate components,\n * containing rules with given names. If rule not found, and `ignoreInvalid`\n * not set - throws exception.\n *\n * ##### Example\n *\n * ```javascript\n * var md = require('markdown-it')()\n * .enable(['sub', 'sup'])\n * .disable('smartquotes');\n * ```\n **/\nMarkdownIt.prototype.enable = function (list, ignoreInvalid) {\n var result = [];\n\n if (!Array.isArray(list)) { list = [ list ]; }\n\n [ 'core', 'block', 'inline' ].forEach(function (chain) {\n result = result.concat(this[chain].ruler.enable(list, true));\n }, this);\n\n result = result.concat(this.inline.ruler2.enable(list, true));\n\n var missed = list.filter(function (name) { return result.indexOf(name) < 0; });\n\n if (missed.length && !ignoreInvalid) {\n throw new Error('MarkdownIt. Failed to enable unknown rule(s): ' + missed);\n }\n\n return this;\n};\n\n\n/** chainable\n * MarkdownIt.disable(list, ignoreInvalid)\n * - list (String|Array): rule name or list of rule names to disable.\n * - ignoreInvalid (Boolean): set `true` to ignore errors when rule not found.\n *\n * The same as [[MarkdownIt.enable]], but turn specified rules off.\n **/\nMarkdownIt.prototype.disable = function (list, ignoreInvalid) {\n var result = [];\n\n if (!Array.isArray(list)) { list = [ list ]; }\n\n [ 'core', 'block', 'inline' ].forEach(function (chain) {\n result = result.concat(this[chain].ruler.disable(list, true));\n }, this);\n\n result = result.concat(this.inline.ruler2.disable(list, true));\n\n var missed = list.filter(function (name) { return result.indexOf(name) < 0; });\n\n if (missed.length && !ignoreInvalid) {\n throw new Error('MarkdownIt. Failed to disable unknown rule(s): ' + missed);\n }\n return this;\n};\n\n\n/** chainable\n * MarkdownIt.use(plugin, params)\n *\n * Load specified plugin with given params into current parser instance.\n * It's just a sugar to call `plugin(md, params)` with curring.\n *\n * ##### Example\n *\n * ```javascript\n * var iterator = require('markdown-it-for-inline');\n * var md = require('markdown-it')()\n * .use(iterator, 'foo_replace', 'text', function (tokens, idx) {\n * tokens[idx].content = tokens[idx].content.replace(/foo/g, 'bar');\n * });\n * ```\n **/\nMarkdownIt.prototype.use = function (plugin /*, params, ... */) {\n var args = [ this ].concat(Array.prototype.slice.call(arguments, 1));\n plugin.apply(plugin, args);\n return this;\n};\n\n\n/** internal\n * MarkdownIt.parse(src, env) -> Array\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * Parse input string and returns list of block tokens (special token type\n * \"inline\" will contain list of inline tokens). You should not call this\n * method directly, until you write custom renderer (for example, to produce\n * AST).\n *\n * `env` is used to pass data between \"distributed\" rules and return additional\n * metadata like reference info, needed for the renderer. It also can be used to\n * inject data in specific cases. Usually, you will be ok to pass `{}`,\n * and then pass updated object to renderer.\n **/\nMarkdownIt.prototype.parse = function (src, env) {\n if (typeof src !== 'string') {\n throw new Error('Input data should be a String');\n }\n\n var state = new this.core.State(src, this, env);\n\n this.core.process(state);\n\n return state.tokens;\n};\n\n\n/**\n * MarkdownIt.render(src [, env]) -> String\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * Render markdown string into html. It does all magic for you :).\n *\n * `env` can be used to inject additional metadata (`{}` by default).\n * But you will not need it with high probability. See also comment\n * in [[MarkdownIt.parse]].\n **/\nMarkdownIt.prototype.render = function (src, env) {\n env = env || {};\n\n return this.renderer.render(this.parse(src, env), this.options, env);\n};\n\n\n/** internal\n * MarkdownIt.parseInline(src, env) -> Array\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * The same as [[MarkdownIt.parse]] but skip all block rules. It returns the\n * block tokens list with the single `inline` element, containing parsed inline\n * tokens in `children` property. Also updates `env` object.\n **/\nMarkdownIt.prototype.parseInline = function (src, env) {\n var state = new this.core.State(src, this, env);\n\n state.inlineMode = true;\n this.core.process(state);\n\n return state.tokens;\n};\n\n\n/**\n * MarkdownIt.renderInline(src [, env]) -> String\n * - src (String): source string\n * - env (Object): environment sandbox\n *\n * Similar to [[MarkdownIt.render]] but for single paragraph content. Result\n * will NOT be wrapped into `<p>` tags.\n **/\nMarkdownIt.prototype.renderInline = function (src, env) {\n env = env || {};\n\n return this.renderer.render(this.parseInline(src, env), this.options, env);\n};\n\n\nmodule.exports = MarkdownIt;\n","'use strict';\n\n\nmodule.exports = require('./lib/');\n","// Unique ID creation requires a high quality random # generator. In the\n// browser this is a little complicated due to unknown quality of Math.random()\n// and inconsistent support for the `crypto` API. We do the best we can via\n// feature-detection\n\n// getRandomValues needs to be invoked in a context where \"this\" is a Crypto\n// implementation. Also, find the complete implementation of crypto on IE11.\nvar getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||\n (typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));\n\nif (getRandomValues) {\n // WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Crypto\n var rnds8 = new Uint8Array(16); // eslint-disable-line no-undef\n\n module.exports = function whatwgRNG() {\n getRandomValues(rnds8);\n return rnds8;\n };\n} else {\n // Math.random()-based (RNG)\n //\n // If all else fails, use Math.random(). It's fast, but is of unspecified\n // quality.\n var rnds = new Array(16);\n\n module.exports = function mathRNG() {\n for (var i = 0, r; i < 16; i++) {\n if ((i & 0x03) === 0) r = Math.random() * 0x100000000;\n rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;\n }\n\n return rnds;\n };\n}\n","/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\nvar byteToHex = [];\nfor (var i = 0; i < 256; ++i) {\n byteToHex[i] = (i + 0x100).toString(16).substr(1);\n}\n\nfunction bytesToUuid(buf, offset) {\n var i = offset || 0;\n var bth = byteToHex;\n // join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4\n return ([bth[buf[i++]], bth[buf[i++]], \n\tbth[buf[i++]], bth[buf[i++]], '-',\n\tbth[buf[i++]], bth[buf[i++]], '-',\n\tbth[buf[i++]], bth[buf[i++]], '-',\n\tbth[buf[i++]], bth[buf[i++]], '-',\n\tbth[buf[i++]], bth[buf[i++]],\n\tbth[buf[i++]], bth[buf[i++]],\n\tbth[buf[i++]], bth[buf[i++]]]).join('');\n}\n\nmodule.exports = bytesToUuid;\n","var rng = require('./lib/rng');\nvar bytesToUuid = require('./lib/bytesToUuid');\n\nfunction v4(options, buf, offset) {\n var i = buf && offset || 0;\n\n if (typeof(options) == 'string') {\n buf = options === 'binary' ? new Array(16) : null;\n options = null;\n }\n options = options || {};\n\n var rnds = options.random || (options.rng || rng)();\n\n // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n rnds[6] = (rnds[6] & 0x0f) | 0x40;\n rnds[8] = (rnds[8] & 0x3f) | 0x80;\n\n // Copy bytes to buffer, if provided\n if (buf) {\n for (var ii = 0; ii < 16; ++ii) {\n buf[i + ii] = rnds[ii];\n }\n }\n\n return buf || bytesToUuid(rnds);\n}\n\nmodule.exports = v4;\n","import DataUtils,\n{\n REQUEST_TYPE_GET,\n REQUEST_TYPE_PUT,\n REQUEST_TYPE_POST,\n REQUEST_TYPE_DELETE,\n CONTENT_TYPE_JSON,\n CONTENT_TYPE_FORM\n}\nfrom '../../../../../brain//tools/utilities/DataUtils';\nimport * as DataEvent from '../../../../../brain//tools/events/DataEvent';\nimport StringUtils from '../../../../../brain//tools/utilities/StringUtils';\nimport Dexie from 'dexie';\nimport sanitize from 'sanitize-html' //NOTE: Santize is a really big add - explore ways to reduce this\nimport DateUtils from '../../../../../brain/tools/utilities/DateUtils';\nimport DBUtils from '../../../../../brain/tools/utilities/DBUtils';\nvar md = require('markdown-it')('commonmark');\nvar uuidv4 = require('uuid/v4');\nexport default class PostActions\n{\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {\n this.dataUtils = new DataUtils();\n this.dateUtils = new DateUtils();\n this.dbUtils = new DBUtils();\n }\n //--------------------------\n // methods\n //--------------------------\n update(id, data, files, lastKey)\n {\n let self = this;\n let freshData;\n return new Promise(function(resolve, reject)\n {\n let txt = document.createElement(\"textarea\");\n txt.innerHTML = document.getElementById('edit-post-text').innerHTML;\n let html = txt.value;\n html = html.replace(/<\\/?span[^>]*>/g, \"\"); //removes highightjs styling\n let buffed = sanitize(html,\n {\n allowedTags: ['del', 'a', 'iframe', 'img'],\n allowedAttributes:\n {\n a: ['href', 'name', 'target'],\n img: ['src'],\n iframe: ['height', 'width', 'src', 'frameborder', 'allow', 'allowfullscreen']\n }\n })\n buffed = new StringUtils().decodeHTML(buffed);\n data.title = document.getElementById('post_title').value;\n data.slug = new StringUtils().cleanString(document.getElementById('post_title').value)\n data.plaintext = buffed;\n data.html = md.render(buffed,\n {\n html: true,\n xhtmlOut: true,\n })\n data.created = document.getElementById('post-date').value;\n data.tags = document.getElementById('post_tags').value;\n data.page = document.getElementById('option-page').getAttribute('data-active')\n data.featured = document.getElementById('option-feature').getAttribute('data-active')\n data.published = document.getElementById('option-published').getAttribute('data-active')\n if (files.length != 0)\n {\n for (var i = 0; i < files.length; i++)\n {\n var file = files[i];\n // Check the file type.\n if (!file.type.match('image.*'))\n {\n continue;\n }\n data.feature = \"/content/blog-images/\" + self.dateUtils.getDate('year', new Date()) + \"/\" + self.dateUtils.getDate('month', new Date()) + \"/\" + file.name;\n }\n }\n else\n {\n if (typeof data.feature == 'undefined')\n data.feature = \"\"\n }\n if (id == null)\n {\n freshData = {\n id: lastKey + 1,\n post:\n {\n uuid: uuidv4(),\n title: data.title,\n slug: data.slug,\n plaintext: data.plaintext,\n html: data.html,\n feature: data.feature,\n created: data.created,\n tags: data.tags,\n page: data.page,\n featured: data.featured,\n published: data.published,\n deleted: \"\",\n author: \"user\"\n }\n }\n }\n else\n {\n freshData = data;\n }\n self.dbUtils.modify(id, freshData).then((response) =>\n {\n resolve(response)\n }).catch((err) =>\n {\n reject(err)\n })\n })\n }\n deletePost(id, body)\n {\n let self = this;\n \n body.deleted = new Date().toString();\n return new Promise(function(resolve, reject){\n self.dbUtils.archivePost(id, body).then(response=>{\n console.log(response)\n resolve(response)\n }).catch(err=>{\n console.log(err)\n reject(error)\n })\n })\n }\n //--------------------------\n // event handlers\n //--------------------------\n}","export const EDITOR_DELETE = 'editorDelete';\nexport const EDITOR_UPLOAD_POST_IMAGE = 'editorUploadImage';\nexport const EDITOR_SAVE = 'editorSave';\nexport const EDITOR_UPDATE = 'editorUpdate';\n\nclass EditorEvent\n{\n\n //--------------------------\n // methods\n //--------------------------\n\n\n\n //--------------------------\n // event handlers\n //--------------------------\n}\nexport default new EditorEvent\n","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global.TinyDatePicker = factory());\n}(this, (function () { 'use strict';\n\n /**\n * @file A generic set of mutation-free date functions.\n */\n\n /**\n * now returns the current date without any time values\n *\n * @returns {Date}\n */\n function now() {\n var dt = new Date();\n dt.setHours(0, 0, 0, 0);\n return dt;\n }\n\n /**\n * dateEq compares two dates\n *\n * @param {Date} date1 the first date\n * @param {Date} date2 the second date\n * @returns {boolean}\n */\n function datesEq(date1, date2) {\n return (date1 && date1.toDateString()) === (date2 && date2.toDateString());\n }\n\n /**\n * shiftDay shifts the specified date by n days\n *\n * @param {Date} dt\n * @param {number} n\n * @returns {Date}\n */\n function shiftDay(dt, n) {\n dt = new Date(dt);\n dt.setDate(dt.getDate() + n);\n return dt;\n }\n\n /**\n * shiftMonth shifts the specified date by a specified number of months\n *\n * @param {Date} dt\n * @param {number} n\n * @param {boolean} wrap optional, if true, does not change year\n * value, defaults to false\n * @returns {Date}\n */\n function shiftMonth(dt, n, wrap) {\n dt = new Date(dt);\n\n var dayOfMonth = dt.getDate();\n var month = dt.getMonth() + n;\n\n dt.setDate(1);\n dt.setMonth(wrap ? (12 + month) % 12 : month);\n dt.setDate(dayOfMonth);\n\n // If dayOfMonth = 31, but the target month only has 30 or 29 or whatever...\n // head back to the max of the target month\n if (dt.getDate() < dayOfMonth) {\n dt.setDate(0);\n }\n\n return dt;\n }\n\n /**\n * shiftYear shifts the specified date by n years\n *\n * @param {Date} dt\n * @param {number} n\n * @returns {Date}\n */\n function shiftYear(dt, n) {\n dt = new Date(dt);\n dt.setFullYear(dt.getFullYear() + n);\n return dt;\n }\n\n /**\n * setYear changes the specified date to the specified year\n *\n * @param {Date} dt\n * @param {number} year\n */\n function setYear(dt, year) {\n dt = new Date(dt);\n dt.setFullYear(year);\n return dt;\n }\n\n /**\n * setMonth changes the specified date to the specified month\n *\n * @param {Date} dt\n * @param {number} month\n */\n function setMonth(dt, month) {\n return shiftMonth(dt, month - dt.getMonth());\n }\n\n /**\n * dateOrParse creates a function which, given a date or string, returns a date\n *\n * @param {function} parse the function used to parse strings\n * @returns {function}\n */\n function dateOrParse(parse) {\n return function (dt) {\n return dropTime(typeof dt === 'string' ? parse(dt) : dt);\n };\n }\n\n /**\n * constrainDate returns dt or min/max depending on whether dt is out of bounds (inclusive)\n *\n * @export\n * @param {Date} dt\n * @param {Date} min\n * @param {Date} max\n * @returns {Date}\n */\n function constrainDate(dt, min, max) {\n return (dt < min) ? min :\n (dt > max) ? max :\n dt;\n }\n\n function dropTime(dt) {\n dt = new Date(dt);\n dt.setHours(0, 0, 0, 0);\n return dt;\n }\n\n /**\n * @file Utility functions for function manipulation.\n */\n\n /**\n * bufferFn buffers calls to fn so they only happen every ms milliseconds\n *\n * @param {number} ms number of milliseconds\n * @param {function} fn the function to be buffered\n * @returns {function}\n */\n function bufferFn(ms, fn) {\n var timeout = undefined;\n return function () {\n clearTimeout(timeout);\n timeout = setTimeout(fn, ms);\n };\n }\n\n /**\n * noop is a function which does nothing at all.\n */\n function noop() { }\n\n /**\n * copy properties from object o2 to object o1.\n *\n * @params {Object} o1\n * @params {Object} o2\n * @returns {Object}\n */\n function cp() {\n var args = arguments;\n var o1 = args[0];\n for (var i = 1; i < args.length; ++i) {\n var o2 = args[i] || {};\n for (var key in o2) {\n o1[key] = o2[key];\n }\n }\n return o1;\n }\n\n /**\n * @file Responsible for sanitizing and creating date picker options.\n */\n\n var english = {\n days: ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat'],\n months: [\n 'January',\n 'February',\n 'March',\n 'April',\n 'May',\n 'June',\n 'July',\n 'August',\n 'September',\n 'October',\n 'November',\n 'December',\n ],\n today: 'Today',\n clear: 'Clear',\n close: 'Close',\n };\n\n /**\n * DatePickerOptions constructs a new date picker options object, overriding\n * default values with any values specified in opts.\n *\n * @param {DatePickerOptions} opts\n * @returns {DatePickerOptions}\n */\n function DatePickerOptions(opts) {\n opts = opts || {};\n opts = cp(defaults(), opts);\n var parse = dateOrParse(opts.parse);\n opts.lang = cp(english, opts.lang);\n opts.parse = parse;\n opts.inRange = makeInRangeFn(opts);\n opts.min = parse(opts.min || shiftYear(now(), -100));\n opts.max = parse(opts.max || shiftYear(now(), 100));\n opts.hilightedDate = opts.parse(opts.hilightedDate);\n\n return opts;\n }\n\n function defaults() {\n return {\n lang: english,\n\n // Possible values: dp-modal, dp-below, dp-permanent\n mode: 'dp-modal',\n\n // The date to hilight initially if the date picker has no\n // initial value.\n hilightedDate: now(),\n\n format: function (dt) {\n return (dt.getMonth() + 1) + '/' + dt.getDate() + '/' + dt.getFullYear();\n },\n\n parse: function (str) {\n var date = new Date(str);\n return isNaN(date) ? now() : date;\n },\n\n dateClass: function () { },\n\n inRange: function () {\n return true;\n }\n };\n }\n\n function makeInRangeFn(opts) {\n var inRange = opts.inRange; // Cache this version, and return a variant\n\n return function (dt, dp) {\n return inRange(dt, dp) && opts.min <= dt && opts.max >= dt;\n };\n }\n\n /**\n * @file Helper functions for dealing with dom elements.\n */\n\n var Key = {\n left: 37,\n up: 38,\n right: 39,\n down: 40,\n enter: 13,\n esc: 27,\n };\n\n /**\n * on attaches an event handler to the specified element, and returns an\n * off function which can be used to remove the handler.\n *\n * @param {string} evt the name of the event to handle\n * @param {HTMLElement} el the element to attach to\n * @param {function} handler the event handler\n * @returns {function} the off function\n */\n function on(evt, el, handler) {\n el.addEventListener(evt, handler, true);\n\n return function () {\n el.removeEventListener(evt, handler, true);\n };\n }\n\n var CustomEvent = shimCustomEvent();\n\n function shimCustomEvent() {\n var CustomEvent = window.CustomEvent;\n\n if (typeof CustomEvent !== 'function') {\n CustomEvent = function (event, params) {\n params = params || {bubbles: false, cancelable: false, detail: undefined};\n var evt = document.createEvent('CustomEvent');\n evt.initCustomEvent(event, params.bubbles, params.cancelable, params.detail);\n return evt;\n };\n\n CustomEvent.prototype = window.Event.prototype;\n }\n\n return CustomEvent;\n }\n\n /**\n * @file Manages the calendar / day-picker view.\n */\n\n var dayPicker = {\n onKeyDown: keyDown,\n onClick: {\n 'dp-day': selectDay,\n 'dp-next': gotoNextMonth,\n 'dp-prev': gotoPrevMonth,\n 'dp-today': selectToday,\n 'dp-clear': clear,\n 'dp-close': close,\n 'dp-cal-month': showMonthPicker,\n 'dp-cal-year': showYearPicker,\n },\n render: render\n };\n\n /**\n * view renders the calendar (day picker) as an HTML string.\n *\n * @param {DatePickerContext} context the date picker being rendered\n * @returns {string}\n */\n function render(dp) {\n var opts = dp.opts;\n var lang = opts.lang;\n var state = dp.state;\n var dayNames = lang.days;\n var dayOffset = opts.dayOffset || 0;\n var selectedDate = state.selectedDate;\n var hilightedDate = state.hilightedDate;\n var hilightedMonth = hilightedDate.getMonth();\n var today = now().getTime();\n\n return (\n '<div class=\"dp-cal\">' +\n '<header class=\"dp-cal-header\">' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-prev\">Prev</button>' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-cal-month\">' +\n lang.months[hilightedMonth] +\n '</button>' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-cal-year\">' +\n hilightedDate.getFullYear() +\n '</button>' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-next\">Next</button>' +\n '</header>' +\n '<div class=\"dp-days\">' +\n dayNames.map(function (name, i) {\n return (\n '<span class=\"dp-col-header\">' + dayNames[(i + dayOffset) % dayNames.length] + '</span>'\n );\n }).join('') +\n mapDays(hilightedDate, dayOffset, function (date) {\n var isNotInMonth = date.getMonth() !== hilightedMonth;\n var isDisabled = !opts.inRange(date);\n var isToday = date.getTime() === today;\n var className = 'dp-day';\n className += (isNotInMonth ? ' dp-edge-day' : '');\n className += (datesEq(date, hilightedDate) ? ' dp-current' : '');\n className += (datesEq(date, selectedDate) ? ' dp-selected' : '');\n className += (isDisabled ? ' dp-day-disabled' : '');\n className += (isToday ? ' dp-day-today' : '');\n className += ' ' + opts.dateClass(date, dp);\n\n return (\n '<button tabindex=\"-1\" type=\"button\" class=\"' + className + '\" data-date=\"' + date.getTime() + '\">' +\n date.getDate() +\n '</button>'\n );\n }) +\n '</div>' +\n '<footer class=\"dp-cal-footer\">' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-today\">' + lang.today + '</button>' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-clear\">' + lang.clear + '</button>' +\n '<button tabindex=\"-1\" type=\"button\" class=\"dp-close\">' + lang.close + '</button>' +\n '</footer>' +\n '</div>'\n );\n }\n\n /**\n * keyDown handles the key down event for the day-picker\n *\n * @param {Event} e\n * @param {DatePickerContext} dp\n */\n function keyDown(e, dp) {\n var key = e.keyCode;\n var shiftBy =\n (key === Key.left) ? -1 :\n (key === Key.right) ? 1 :\n (key === Key.up) ? -7 :\n (key === Key.down) ? 7 :\n 0;\n\n if (key === Key.esc) {\n dp.close();\n } else if (shiftBy) {\n e.preventDefault();\n dp.setState({\n hilightedDate: shiftDay(dp.state.hilightedDate, shiftBy)\n });\n }\n }\n\n function selectToday(e, dp) {\n dp.setState({\n selectedDate: now(),\n });\n }\n\n function clear(e, dp) {\n dp.setState({\n selectedDate: null,\n });\n }\n\n function close(e, dp) {\n dp.close();\n }\n\n function showMonthPicker(e, dp) {\n dp.setState({\n view: 'month'\n });\n }\n\n function showYearPicker(e, dp) {\n dp.setState({\n view: 'year'\n });\n }\n\n function gotoNextMonth(e, dp) {\n var hilightedDate = dp.state.hilightedDate;\n dp.setState({\n hilightedDate: shiftMonth(hilightedDate, 1)\n });\n }\n\n function gotoPrevMonth(e, dp) {\n var hilightedDate = dp.state.hilightedDate;\n dp.setState({\n hilightedDate: shiftMonth(hilightedDate, -1)\n });\n }\n\n function selectDay(e, dp) {\n dp.setState({\n selectedDate: new Date(parseInt(e.target.getAttribute('data-date'))),\n });\n }\n\n function mapDays(currentDate, dayOffset, fn) {\n var result = '';\n var iter = new Date(currentDate);\n iter.setDate(1);\n iter.setDate(1 - iter.getDay() + dayOffset);\n\n // If we are showing monday as the 1st of the week,\n // and the monday is the 2nd of the month, the sunday won't\n // show, so we need to shift backwards\n if (dayOffset && iter.getDate() === dayOffset + 1) {\n iter.setDate(dayOffset - 6);\n }\n\n // We are going to have 6 weeks always displayed to keep a consistent\n // calendar size\n for (var day = 0; day < (6 * 7); ++day) {\n result += fn(iter);\n iter.setDate(iter.getDate() + 1);\n }\n\n return result;\n }\n\n /**\n * @file Manages the month-picker view.\n */\n\n var monthPicker = {\n onKeyDown: keyDown$1,\n onClick: {\n 'dp-month': onChooseMonth\n },\n render: render$1\n };\n\n function onChooseMonth(e, dp) {\n dp.setState({\n hilightedDate: setMonth(dp.state.hilightedDate, parseInt(e.target.getAttribute('data-month'))),\n view: 'day',\n });\n }\n\n /**\n * render renders the month picker as an HTML string\n *\n * @param {DatePickerContext} dp the date picker context\n * @returns {string}\n */\n function render$1(dp) {\n var opts = dp.opts;\n var lang = opts.lang;\n var months = lang.months;\n var currentDate = dp.state.hilightedDate;\n var currentMonth = currentDate.getMonth();\n\n return (\n '<div class=\"dp-months\">' +\n months.map(function (month, i) {\n var className = 'dp-month';\n className += (currentMonth === i ? ' dp-current' : '');\n\n return (\n '<button tabindex=\"-1\" type=\"button\" class=\"' + className + '\" data-month=\"' + i + '\">' +\n month +\n '</button>'\n );\n }).join('') +\n '</div>'\n );\n }\n\n /**\n * keyDown handles keydown events that occur in the month picker\n *\n * @param {Event} e\n * @param {DatePickerContext} dp\n */\n function keyDown$1(e, dp) {\n var key = e.keyCode;\n var shiftBy =\n (key === Key.left) ? -1 :\n (key === Key.right) ? 1 :\n (key === Key.up) ? -3 :\n (key === Key.down) ? 3 :\n 0;\n\n if (key === Key.esc) {\n dp.setState({\n view: 'day',\n });\n } else if (shiftBy) {\n e.preventDefault();\n dp.setState({\n hilightedDate: shiftMonth(dp.state.hilightedDate, shiftBy, true)\n });\n }\n }\n\n /**\n * @file Manages the year-picker view.\n */\n\n var yearPicker = {\n render: render$2,\n onKeyDown: keyDown$2,\n onClick: {\n 'dp-year': onChooseYear\n },\n };\n\n /**\n * view renders the year picker as an HTML string.\n *\n * @param {DatePickerContext} dp the date picker context\n * @returns {string}\n */\n function render$2(dp) {\n var state = dp.state;\n var currentYear = state.hilightedDate.getFullYear();\n var selectedYear = state.selectedDate.getFullYear();\n\n return (\n '<div class=\"dp-years\">' +\n mapYears(dp, function (year) {\n var className = 'dp-year';\n className += (year === currentYear ? ' dp-current' : '');\n className += (year === selectedYear ? ' dp-selected' : '');\n\n return (\n '<button tabindex=\"-1\" type=\"button\" class=\"' + className + '\" data-year=\"' + year + '\">' +\n year +\n '</button>'\n );\n }) +\n '</div>'\n );\n }\n\n function onChooseYear(e, dp) {\n dp.setState({\n hilightedDate: setYear(dp.state.hilightedDate, parseInt(e.target.getAttribute('data-year'))),\n view: 'day',\n });\n }\n\n function keyDown$2(e, dp) {\n var key = e.keyCode;\n var opts = dp.opts;\n var shiftBy =\n (key === Key.left || key === Key.up) ? 1 :\n (key === Key.right || key === Key.down) ? -1 :\n 0;\n\n if (key === Key.esc) {\n dp.setState({\n view: 'day',\n });\n } else if (shiftBy) {\n e.preventDefault();\n var shiftedYear = shiftYear(dp.state.hilightedDate, shiftBy);\n\n dp.setState({\n hilightedDate: constrainDate(shiftedYear, opts.min, opts.max),\n });\n }\n }\n\n function mapYears(dp, fn) {\n var result = '';\n var max = dp.opts.max.getFullYear();\n\n for (var i = max; i >= dp.opts.min.getFullYear(); --i) {\n result += fn(i);\n }\n\n return result;\n }\n\n /**\n * @file Defines the base date picker behavior, overridden by various modes.\n */\n\n var views = {\n day: dayPicker,\n year: yearPicker,\n month: monthPicker\n };\n\n function BaseMode(input, emit, opts) {\n var detatchInputEvents; // A function that detaches all events from the input\n var closing = false; // A hack to prevent calendar from re-opening when closing.\n var selectedDate; // The currently selected date\n var dp = {\n // The root DOM element for the date picker, initialized on first open.\n el: undefined,\n opts: opts,\n shouldFocusOnBlur: true,\n shouldFocusOnRender: true,\n state: initialState(),\n adjustPosition: noop,\n containerHTML: '<div class=\"dp\"></div>',\n\n attachToDom: function () {\n document.body.appendChild(dp.el);\n },\n\n updateInput: function (selectedDate) {\n var e = new CustomEvent('change', {bubbles: true});\n e.simulated = true;\n input.value = selectedDate ? opts.format(selectedDate) : '';\n input.dispatchEvent(e);\n },\n\n computeSelectedDate: function () {\n return opts.parse(input.value);\n },\n\n currentView: function() {\n return views[dp.state.view];\n },\n\n open: function () {\n if (closing) {\n return;\n }\n\n if (!dp.el) {\n dp.el = createContainerElement(opts, dp.containerHTML);\n attachContainerEvents(dp);\n }\n\n selectedDate = constrainDate(dp.computeSelectedDate(), opts.min, opts.max);\n dp.state.hilightedDate = selectedDate || opts.hilightedDate;\n dp.state.view = 'day';\n\n dp.attachToDom();\n dp.render();\n\n emit('open');\n },\n\n isVisible: function () {\n return !!dp.el && !!dp.el.parentNode;\n },\n\n hasFocus: function () {\n var focused = document.activeElement;\n return dp.el &&\n dp.el.contains(focused) &&\n focused.className.indexOf('dp-focuser') < 0;\n },\n\n shouldHide: function () {\n return dp.isVisible();\n },\n\n close: function (becauseOfBlur) {\n var el = dp.el;\n\n if (!dp.isVisible()) {\n return;\n }\n\n if (el) {\n var parent = el.parentNode;\n parent && parent.removeChild(el);\n }\n\n closing = true;\n\n if (becauseOfBlur && dp.shouldFocusOnBlur) {\n focusInput(input);\n }\n\n // When we close, the input often gains refocus, which\n // can then launch the date picker again, so we buffer\n // a bit and don't show the date picker within N ms of closing\n setTimeout(function() {\n closing = false;\n }, 100);\n\n emit('close');\n },\n\n destroy: function () {\n dp.close();\n detatchInputEvents();\n },\n\n render: function () {\n if (!dp.el) {\n return;\n }\n\n var hadFocus = dp.hasFocus();\n var html = dp.currentView().render(dp);\n html && (dp.el.firstChild.innerHTML = html);\n\n dp.adjustPosition();\n\n if (hadFocus || dp.shouldFocusOnRender) {\n focusCurrent(dp);\n }\n },\n\n // Conceptually similar to setState in React, updates\n // the view state and re-renders.\n setState: function (state) {\n for (var key in state) {\n dp.state[key] = state[key];\n }\n\n emit('statechange');\n dp.render();\n },\n };\n\n detatchInputEvents = attachInputEvents(input, dp);\n\n // Builds the initial view state\n // selectedDate is a special case and causes changes to hilightedDate\n // hilightedDate is set on open, so remains undefined initially\n // view is the current view (day, month, year)\n function initialState() {\n return {\n get selectedDate() {\n return selectedDate;\n },\n set selectedDate(dt) {\n if (dt && !opts.inRange(dt)) {\n return;\n }\n\n if (dt) {\n selectedDate = new Date(dt);\n dp.state.hilightedDate = selectedDate;\n } else {\n selectedDate = dt;\n }\n\n dp.updateInput(selectedDate);\n emit('select');\n dp.close();\n },\n view: 'day',\n };\n }\n\n return dp;\n }\n\n function createContainerElement(opts, containerHTML) {\n var el = document.createElement('div');\n\n el.className = opts.mode;\n el.innerHTML = containerHTML;\n\n return el;\n }\n\n function attachInputEvents(input, dp) {\n var bufferShow = bufferFn(5, function () {\n if (dp.shouldHide()) {\n dp.close();\n } else {\n dp.open();\n }\n });\n\n var off = [\n on('blur', input, bufferFn(150, function () {\n if (!dp.hasFocus()) {\n dp.close(true);\n }\n })),\n\n on('mousedown', input, function () {\n if (input === document.activeElement) {\n bufferShow();\n }\n }),\n\n on('focus', input, bufferShow),\n\n on('input', input, function (e) {\n var date = dp.opts.parse(e.target.value);\n isNaN(date) || dp.setState({\n hilightedDate: date\n });\n }),\n ];\n\n // Unregister all events that were registered above.\n return function() {\n off.forEach(function (f) {\n f();\n });\n };\n }\n\n function focusCurrent(dp) {\n var current = dp.el.querySelector('.dp-current');\n return current && current.focus();\n }\n\n function attachContainerEvents(dp) {\n var el = dp.el;\n var calEl = el.querySelector('.dp');\n\n // Hack to get iOS to show active CSS states\n el.ontouchstart = noop;\n\n function onClick(e) {\n e.target.className.split(' ').forEach(function(evt) {\n var handler = dp.currentView().onClick[evt];\n handler && handler(e, dp);\n });\n }\n\n // The calender fires a blur event *every* time we redraw\n // this means we need to buffer the blur event to see if\n // it still has no focus after redrawing, and only then\n // do we return focus to the input. A possible other approach\n // would be to set context.redrawing = true on redraw and\n // set it to false in the blur event.\n on('blur', calEl, bufferFn(150, function () {\n if (!dp.hasFocus()) {\n dp.close(true);\n }\n }));\n\n on('keydown', el, function (e) {\n if (e.keyCode === Key.enter) {\n onClick(e);\n } else {\n dp.currentView().onKeyDown(e, dp);\n }\n });\n\n // If the user clicks in non-focusable space, but\n // still within the date picker, we don't want to\n // hide, so we need to hack some things...\n on('mousedown', calEl, function (e) {\n e.target.focus && e.target.focus(); // IE hack\n if (document.activeElement !== e.target) {\n e.preventDefault();\n focusCurrent(dp);\n }\n });\n\n on('click', el, onClick);\n }\n\n function focusInput(input) {\n // When the modal closes, we need to focus the original input so the\n // user can continue tabbing from where they left off.\n input.focus();\n\n // iOS zonks out if we don't blur the input, so...\n if (/iPad|iPhone|iPod/.test(navigator.userAgent) && !window.MSStream) {\n input.blur();\n }\n }\n\n /**\n * @file Defines the modal date picker behavior.\n */\n\n function ModalMode(input, emit, opts) {\n var dp = BaseMode(input, emit, opts);\n\n // In modal mode, users really shouldn't be able to type in\n // the input, as all input is done via the calendar.\n input.readonly = true;\n\n // In modal mode, we need to know when the user has tabbed\n // off the end of the calendar, and set focus to the original\n // input. To do this, we add a special element to the DOM.\n // When the user tabs off the bottom of the calendar, they\n // will tab onto this element.\n dp.containerHTML += '<a href=\"#\" class=\"dp-focuser\">.</a>';\n\n return dp;\n }\n\n /**\n * @file Defines the dropdown date picker behavior.\n */\n\n function DropdownMode(input, emit, opts) {\n var dp = BaseMode(input, emit, opts);\n\n dp.shouldFocusOnBlur = false;\n\n Object.defineProperty(dp, 'shouldFocusOnRender', {\n get: function() {\n return input !== document.activeElement;\n }\n });\n\n dp.adjustPosition = function () {\n autoPosition(input, dp);\n };\n\n return dp;\n }\n\n function autoPosition(input, dp) {\n var inputPos = input.getBoundingClientRect();\n var win = window;\n\n adjustCalY(dp, inputPos, win);\n adjustCalX(dp, inputPos, win);\n\n dp.el.style.visibility = '';\n }\n\n function adjustCalX(dp, inputPos, win) {\n var cal = dp.el;\n var scrollLeft = win.pageXOffset;\n var inputLeft = inputPos.left + scrollLeft;\n var maxRight = win.innerWidth + scrollLeft;\n var offsetWidth = cal.offsetWidth;\n var calRight = inputLeft + offsetWidth;\n var shiftedLeft = maxRight - offsetWidth;\n var left = calRight > maxRight && shiftedLeft > 0 ? shiftedLeft : inputLeft;\n\n cal.style.left = left + 'px';\n }\n\n function adjustCalY(dp, inputPos, win) {\n var cal = dp.el;\n var scrollTop = win.pageYOffset;\n var inputTop = scrollTop + inputPos.top;\n var calHeight = cal.offsetHeight;\n var belowTop = inputTop + inputPos.height + 8;\n var aboveTop = inputTop - calHeight - 8;\n var isAbove = (aboveTop > 0 && belowTop + calHeight > scrollTop + win.innerHeight);\n var top = isAbove ? aboveTop : belowTop;\n\n if (cal.classList) {\n cal.classList.toggle('dp-is-above', isAbove);\n cal.classList.toggle('dp-is-below', !isAbove);\n }\n cal.style.top = top + 'px';\n }\n\n /**\n * @file Defines the permanent date picker behavior.\n */\n\n function PermanentMode(root, emit, opts) {\n var dp = BaseMode(root, emit, opts);\n\n dp.close = noop;\n dp.destroy = noop;\n dp.updateInput = noop;\n dp.shouldFocusOnRender = opts.shouldFocusOnRender;\n\n dp.computeSelectedDate = function () {\n return opts.hilightedDate;\n };\n\n dp.attachToDom = function () {\n root.appendChild(dp.el);\n };\n\n dp.open();\n\n return dp;\n }\n\n /**\n * @file Defines the various date picker modes (modal, dropdown, permanent)\n */\n\n function Mode(input, emit, opts) {\n input = input && input.tagName ? input : document.querySelector(input);\n\n if (opts.mode === 'dp-modal') {\n return ModalMode(input, emit, opts);\n }\n\n if (opts.mode === 'dp-below') {\n return DropdownMode(input, emit, opts);\n }\n\n if (opts.mode === 'dp-permanent') {\n return PermanentMode(input, emit, opts);\n }\n }\n\n /**\n * @file Defines simple event emitter behavior.\n */\n\n /**\n * Emitter constructs a new emitter object which has on/off methods.\n *\n * @returns {EventEmitter}\n */\n function Emitter() {\n var handlers = {};\n\n function onOne(name, handler) {\n (handlers[name] = (handlers[name] || [])).push(handler);\n }\n\n function onMany(fns) {\n for (var name in fns) {\n onOne(name, fns[name]);\n }\n }\n\n return {\n on: function (name, handler) {\n if (handler) {\n onOne(name, handler);\n } else {\n onMany(name);\n }\n\n return this;\n },\n\n emit: function (name, arg) {\n (handlers[name] || []).forEach(function (handler) {\n handler(name, arg);\n });\n },\n\n off: function (name, handler) {\n if (!name) {\n handlers = {};\n } else if (!handler) {\n handlers[name] = [];\n } else {\n handlers[name] = (handlers[name] || []).filter(function (h) {\n return h !== handler;\n });\n }\n\n return this;\n }\n };\n }\n\n /**\n * @file The root date picker file, defines public exports for the library.\n */\n\n /**\n * The date picker language configuration\n * @typedef {Object} LangOptions\n * @property {Array.<string>} [days] - Days of the week\n * @property {Array.<string>} [months] - Months of the year\n * @property {string} today - The label for the 'today' button\n * @property {string} close - The label for the 'close' button\n * @property {string} clear - The label for the 'clear' button\n */\n\n /**\n * The configuration options for a date picker.\n *\n * @typedef {Object} DatePickerOptions\n * @property {LangOptions} [lang] - Configures the label text, defaults to English\n * @property {('dp-modal'|'dp-below'|'dp-permanent')} [mode] - The date picker mode, defaults to 'dp-modal'\n * @property {(string|Date)} [hilightedDate] - The date to hilight if no date is selected\n * @property {function(string|Date):Date} [parse] - Parses a date, the complement of the \"format\" function\n * @property {function(Date):string} [format] - Formats a date for displaying to user\n * @property {function(Date):string} [dateClass] - Associates a custom CSS class with a date\n * @property {function(Date):boolean} [inRange] - Indicates whether or not a date is selectable\n * @property {(string|Date)} [min] - The minimum selectable date (inclusive, default 100 years ago)\n * @property {(string|Date)} [max] - The maximum selectable date (inclusive, default 100 years from now)\n */\n\n /**\n * The state values for the date picker\n *\n * @typedef {Object} DatePickerState\n * @property {string} view - The current view 'day' | 'month' | 'year'\n * @property {Date} selectedDate - The date which has been selected by the user\n * @property {Date} hilightedDate - The date which is currently hilighted / active\n */\n\n /**\n * An instance of TinyDatePicker\n *\n * @typedef {Object} DatePicker\n * @property {DatePickerState} state - The values currently displayed.\n * @property {function} on - Adds an event handler\n * @property {function} off - Removes an event handler\n * @property {function} setState - Changes the current state of the date picker\n * @property {function} open - Opens the date picker\n * @property {function} close - Closes the date picker\n * @property {function} destroy - Destroys the date picker (removing all handlers from the input, too)\n */\n\n /**\n * TinyDatePicker constructs a new date picker for the specified input\n *\n * @param {HTMLElement | string} input The input or CSS selector associated with the datepicker\n * @param {DatePickerOptions} opts The options for initializing the date picker\n * @returns {DatePicker}\n */\n function TinyDatePicker(input, opts) {\n var emitter = Emitter();\n var options = DatePickerOptions(opts);\n var mode = Mode(input, emit, options);\n var me = {\n get state() {\n return mode.state;\n },\n on: emitter.on,\n off: emitter.off,\n setState: mode.setState,\n open: mode.open,\n close: mode.close,\n destroy: mode.destroy,\n };\n\n function emit(evt) {\n emitter.emit(evt, me);\n }\n\n return me;\n }\n\n return TinyDatePicker;\n\n})));\n","const attributes = [\n 'borderBottomWidth',\n 'borderLeftWidth',\n 'borderRightWidth',\n 'borderTopStyle',\n 'borderRightStyle',\n 'borderBottomStyle',\n 'borderLeftStyle',\n 'borderTopWidth',\n 'boxSizing',\n 'fontFamily',\n 'fontSize',\n 'fontWeight',\n 'height',\n 'letterSpacing',\n 'lineHeight',\n 'marginBottom',\n 'marginLeft',\n 'marginRight',\n 'marginTop',\n 'outlineWidth',\n 'overflow',\n 'overflowX',\n 'overflowY',\n 'paddingBottom',\n 'paddingLeft',\n 'paddingRight',\n 'paddingTop',\n 'textAlign',\n 'textOverflow',\n 'textTransform',\n 'whiteSpace',\n 'wordBreak',\n 'wordWrap',\n];\n\n/**\n * Create a mirror\n *\n * @param {Element} element The element\n * @param {string} html The html\n *\n * @return {object} The mirror object\n */\nconst createMirror = (element, html) => {\n\n /**\n * The mirror element\n */\n const mirror = document.createElement('div');\n\n /**\n * Create the CSS for the mirror object\n *\n * @return {object} The style object\n */\n const mirrorCss = () => {\n const css = {\n position: 'absolute',\n left: -9999,\n top: 0,\n zIndex: -2000\n };\n\n if (element.tagName === 'TEXTAREA') {\n attributes.push('width');\n }\n\n attributes.forEach((attr) => {\n css[attr] = getComputedStyle(element)[attr];\n });\n\n return css;\n };\n\n /**\n * Initialize the mirror\n *\n * @param {string} html The html\n *\n * @return {void}\n */\n const initialize = (html) => {\n const styles = mirrorCss();\n Object.keys(styles).forEach(key => {\n mirror.style[key] = styles[key];\n });\n mirror.innerHTML = html;\n element.parentNode.insertBefore(mirror, element.nextSibling);\n };\n\n /**\n * Get the rect\n *\n * @return {Rect} The bounding rect\n */\n const rect = () => {\n const marker = mirror.ownerDocument.getElementById('caret-position-marker');\n const boundingRect = {\n left: marker.offsetLeft,\n top: marker.offsetTop,\n height: marker.offsetHeight\n };\n mirror.parentNode.removeChild(mirror);\n\n return boundingRect;\n };\n\n initialize(html);\n\n return {\n rect,\n };\n};\n\nexport default createMirror;\n","/**\n * Check if a DOM Element is content editable\n *\n * @param {Element} element The DOM element\n *\n * @return {bool} If it is content editable\n */\nexport const isContentEditable = (element) => !!(\n element.contentEditable &&\n element.contentEditable === 'true'\n);\n\n/**\n * Get the context from settings passed in\n *\n * @param {object} settings The settings object\n *\n * @return {object} window and document\n */\nexport const getContext = (settings = {}) => {\n const { customPos, iframe, noShadowCaret } = settings;\n if (iframe) {\n return {\n iframe,\n window: iframe.contentWindow,\n document: iframe.contentDocument || iframe.contentWindow.document,\n noShadowCaret,\n customPos,\n };\n }\n\n return {\n window,\n document,\n noShadowCaret,\n customPos,\n };\n};\n\n/**\n * Get the offset of an element\n *\n * @param {Element} element The DOM element\n * @param {object} ctx The context\n *\n * @return {object} top and left\n */\nexport const getOffset = (element, ctx) => {\n const win = ctx && ctx.window || window;\n const doc = ctx && ctx.document || document;\n const rect = element.getBoundingClientRect();\n const docEl = doc.documentElement;\n const scrollLeft = win.pageXOffset || docEl.scrollLeft;\n const scrollTop = win.pageYOffset || docEl.scrollTop;\n\n return {\n top: rect.top + scrollTop,\n left: rect.left + scrollLeft\n };\n};\n\n/**\n * Check if a value is an object\n *\n * @param {any} value The value to check\n *\n * @return {bool} If it is an object\n */\nexport const isObject = (value) => typeof value === 'object' && value !== null;\n","import createMirror from './mirror';\nimport { getOffset as elementOffset } from './utils';\n\n/**\n * Create a Input caret object.\n *\n * @param {Element} element The element\n * @param {Object} ctx The context\n */\nconst createInputCaret = (element, ctx) => {\n\n /**\n * Get the current position\n *\n * @returns {int} The caret position\n */\n const getPos = () => {\n return element.selectionStart;\n };\n\n /**\n * Set the position\n *\n * @param {int} pos The position\n *\n * @return {Element} The element\n */\n const setPos = (pos) => {\n element.setSelectionRange(pos, pos);\n\n return element;\n };\n\n /**\n * The offset\n *\n * @param {int} pos The position\n *\n * @return {object} The offset\n */\n const getOffset = (pos) => {\n const rect = elementOffset(element);\n const position = getPosition(pos);\n\n return {\n top: rect.top + position.top + ctx.document.body.scrollTop,\n left: rect.left + position.left + ctx.document.body.scrollLeft,\n height: position.height,\n };\n };\n\n /**\n * Get the current position\n *\n * @param {int} pos The position\n *\n * @return {object} The position\n */\n const getPosition = (pos) => {\n const format = (val) => {\n let value = val.replace(/<|>|`|\"|&/g, '?')\n .replace(/\\r\\n|\\r|\\n/g,'<br/>');\n return value;\n };\n\n if (ctx.customPos || ctx.customPos === 0) {\n pos = ctx.customPos;\n }\n\n const position = pos === undefined ? getPos() : pos;\n const startRange = element.value.slice(0, position);\n const endRange = element.value.slice(position);\n let html = `<span style=\"position: relative; display: inline;\">${format(startRange)}</span>`;\n html += '<span id=\"caret-position-marker\" style=\"position: relative; display: inline;\">|</span>';\n html += `<span style=\"position: relative; display: inline;\">${format(endRange)}</span>`;\n\n const mirror = createMirror(element, html);\n const rect = mirror.rect();\n rect.pos = getPos();\n\n return rect;\n };\n\n return {\n getPos,\n setPos,\n getOffset,\n getPosition,\n };\n};\n\nexport default createInputCaret;\n","/**\n * Create an Editable Caret\n * @param {Element} element The editable element\n * @param {object|null} ctx The context\n *\n * @return {EditableCaret}\n */\nconst createEditableCaret = (element, ctx) => {\n\n /**\n * Set the caret position\n *\n * @param {int} pos The position to se\n *\n * @return {Element} The element\n */\n const setPos = (pos) => {\n const sel = ctx.window.getSelection();\n if (sel) {\n let offset = 0;\n let found = false;\n const find = (position, parent) => {\n for (let i = 0; i < parent.childNodes.length; i++) {\n const node = parent.childNodes[i];\n if (found) {\n break;\n }\n if (node.nodeType === 3) {\n if (offset + node.length >= position) {\n found = true;\n const range = ctx.document.createRange();\n range.setStart(node, position - offset);\n sel.removeAllRanges();\n sel.addRange(range);\n break;\n } else {\n offset += node.length;\n }\n } else {\n find(pos, node);\n }\n }\n };\n find(pos, element);\n }\n\n return element;\n };\n\n /**\n * Get the offset\n *\n * @return {object} The offset\n */\n const getOffset = () => {\n const range = getRange();\n let offset = {\n height: 0,\n left: 0,\n right: 0,\n };\n\n if (!range) {\n return offset;\n }\n\n const hasCustomPos = ctx.customPos || ctx.customPos === 0;\n\n // endContainer in Firefox would be the element at the start of\n // the line\n if ((range.endOffset - 1 > 0 && range.endContainer !== element) || hasCustomPos) {\n const clonedRange = range.cloneRange();\n const fixedPosition = hasCustomPos ? ctx.customPos : range.endOffset;\n clonedRange.setStart(range.endContainer, fixedPosition - 1 < 0 ? 0 : fixedPosition - 1);\n clonedRange.setEnd(range.endContainer, fixedPosition);\n const rect = clonedRange.getBoundingClientRect();\n offset = {\n height: rect.height,\n left: rect.left + rect.width,\n top: rect.top,\n };\n clonedRange.detach();\n }\n\n if ((!offset || (offset && offset.height === 0)) && !ctx.noShadowCaret) {\n const clonedRange = range.cloneRange();\n const shadowCaret = ctx.document.createTextNode('|');\n clonedRange.insertNode(shadowCaret);\n clonedRange.selectNode(shadowCaret);\n const rect = clonedRange.getBoundingClientRect();\n offset = {\n height: rect.height,\n left: rect.left,\n top: rect.top,\n };\n shadowCaret.parentNode.removeChild(shadowCaret);\n clonedRange.detach();\n }\n\n if (offset) {\n const doc = ctx.document.documentElement;\n offset.top += ctx.window.pageYOffset - (doc.clientTop || 0);\n offset.left += ctx.window.pageXOffset - (doc.clientLeft || 0);\n }\n\n return offset;\n };\n\n /**\n * Get the position\n *\n * @return {object} The position\n */\n const getPosition = () => {\n const offset = getOffset();\n const pos = getPos();\n const rect = element.getBoundingClientRect();\n const inputOffset = {\n top: rect.top + ctx.document.body.scrollTop,\n left: rect.left + ctx.document.body.scrollLeft\n };\n offset.left -= inputOffset.left;\n offset.top -= inputOffset.top;\n offset.pos = pos;\n\n return offset;\n };\n\n /**\n * Get the range\n *\n * @return {Range|null}\n */\n const getRange = () => {\n if (!ctx.window.getSelection) {\n return;\n }\n const sel = ctx.window.getSelection();\n\n return sel.rangeCount > 0 ? sel.getRangeAt(0) : null;\n };\n\n /**\n * Get the caret position\n *\n * @return {int} The position\n */\n const getPos = () => {\n const range = getRange();\n const clonedRange = range.cloneRange();\n clonedRange.selectNodeContents(element);\n clonedRange.setEnd(range.endContainer, range.endOffset);\n const pos = clonedRange.toString().length;\n clonedRange.detach();\n\n return pos;\n };\n\n return {\n getPos,\n setPos,\n getPosition,\n getOffset,\n getRange,\n };\n};\n\nexport default createEditableCaret;\n","import createInputCaret from './input';\nimport createEditableCaret from './editable';\nimport {\n isContentEditable,\n getContext,\n isObject,\n} from './utils';\n\nexport { getOffset } from './utils';\n\nconst createCaret = (element, ctx) => {\n if (isContentEditable(element)) {\n return createEditableCaret(element, ctx);\n }\n\n return createInputCaret(element, ctx);\n};\n\nexport const position = (element, value, settings = {}) => {\n let options = settings;\n if (isObject(value)) {\n options = value;\n value = null;\n }\n const ctx = getContext(options);\n const caret = createCaret(element, ctx);\n\n if (value || value === 0) {\n return caret.setPos(value);\n }\n\n return caret.getPosition();\n};\n\n/**\n *\n * @param {Element} element The DOM element\n * @param {number|undefined} value The value to set\n * @param {object} settings Any settings for context\n */\nexport const offset = (element, value, settings = {}) => {\n let options = settings;\n if (isObject(value)) {\n options = value;\n value = null;\n }\n\n const ctx = getContext(options);\n const caret = createCaret(element, ctx);\n return caret.getOffset(value);\n};\n","import * as DataEvent from '../events/DataEvent';\nimport DateUtils from '../utilities/DateUtils';\nimport\n{\n position,\n offset\n}\nfrom 'caret-pos';\nimport EventEmitter from '../events/EventEmitter';\nimport * as EditorEvent from '../events/EditorEvent';\nclass TextEditor extends EventEmitter\n{\n /**\n * Text Editor UI Component\n * @constructor\n * @param {object} textEditor - Text area that will edit text\n * @param {number} scrollLimit - YPos where editor position will become fixed\n */\n //--------------------------\n // constructor\n //--------------------------\n constructor(textEditor, scrollLimit)\n {\n super();\n hljs.initHighlightingOnLoad();\n this.dateUtils = new DateUtils();\n this.textEditor = textEditor;\n this.fixLimit = scrollLimit;\n this.caretPos = null;\n this.url = '';\n let self = this;\n this.setInputs();\n window.addEventListener(\"scroll\", f =>\n {\n var fixLimit = this.fixLimit;\n if (window.pageYOffset >= fixLimit)\n {\n document.getElementById('edit-control').style.position = \"fixed\"\n }\n else\n {\n document.getElementById('edit-control').style.position = \"relative\"\n }\n });\n this.refresh();\n }\n //--------------------------\n // methods\n //--------------------------\n setInputs()\n {\n let self = this;\n var editorButtons = document.querySelectorAll('.editor-button');\n for (var i = 0, length = editorButtons.length; i < length; i++)\n {\n editorButtons[i].addEventListener('click', e => this.handleEditorOption(e), false);\n }\n this.textEditor.addEventListener('input', f =>\n {\n if (f.inputType == \"insertParagraph\")\n {\n var caret = position(self.textEditor).pos + 1;\n var spiffed = hljs.highlight('markdown', self.textEditor.innerText).value;\n var temp = document.createElement(\"div\");\n temp.innerText = spiffed;\n self.textEditor.innerHTML = temp.innerText;\n position(self.textEditor, caret)\n }\n else\n {\n self.refresh()\n }\n })\n }\n refresh()\n {\n var caret = position(this.textEditor).pos;\n var spiffed = hljs.highlight('markdown', this.textEditor.innerText).value;\n var temp = document.createElement(\"div\");\n temp.innerText = spiffed;\n this.textEditor.innerHTML = temp.innerText;\n position(this.textEditor, caret)\n }\n notify(type, data)\n {\n switch (type)\n {\n case DataEvent.POST_UPDATED:\n document.getElementById('submit-update').classList.add('icon-hide');\n document.getElementById('submit-good').classList.remove('icon-hide');\n document.getElementById('edit-update').classList.remove('submit-start');\n document.getElementById('edit-update').classList.add('submit-cool');\n setTimeout(f =>\n {\n document.getElementById('submit-update').classList.remove('icon-hide');\n document.getElementById('submit-good').classList.add('icon-hide');\n document.getElementById('edit-update').classList.add('submit-start');\n document.getElementById('edit-update').classList.remove('submit-cool');\n }, 2000);\n break;\n case DataEvent.POST_ADDED:\n // do nothing\n break;\n case EditorEvent.EDITOR_UPLOAD_POST_IMAGE:\n position(this.textEditor, this.caretPos);\n var sel, range, pulled;\n sel = window.getSelection(); //console.log(sel)\n //console.log(note.message)\n if (sel.rangeCount)\n {\n range = sel.getRangeAt(0);\n pulled = sel.getRangeAt(0).toString();\n range.deleteContents();\n range.insertNode(document.createTextNode(\"![image alt text](\" + data + \" 'image title')\"));\n }\n this.refresh();\n break;\n }\n }\n //--------------------------\n // event handlers\n //--------------------------\n handleEditorOption(e)\n {\n e.preventDefault();\n var self = this;\n var sel, range, pulled;\n sel = window.getSelection(); //console.log(sel)\n if (sel.rangeCount)\n {\n range = sel.getRangeAt(0);\n pulled = sel.getRangeAt(0).toString();\n range.deleteContents();\n switch (e.target.id)\n {\n case \"edit-bold\":\n range.insertNode(document.createTextNode(\"**\" + pulled + \"**\"));\n break;\n case \"edit-italic\":\n range.insertNode(document.createTextNode(\"*\" + pulled + \"*\"));\n break;\n case \"edit-strikethrough\":\n range.insertNode(document.createTextNode(\"<del>\" + pulled + \"</del>\"));\n break;\n case \"edit-header1\":\n range.insertNode(document.createTextNode(\"# \" + pulled));\n break;\n case \"edit-header2\":\n range.insertNode(document.createTextNode(\"## \" + pulled));\n break;\n case \"edit-header3\":\n range.insertNode(document.createTextNode(\"### \" + pulled));\n break;\n case \"edit-image\":\n this.caretPos = position(this.textEditor).pos;\n this.emitEvent(EditorEvent.EDITOR_UPLOAD_POST_IMAGE);\n break;\n case \"submit-save\":\n case \"edit-save\":\n this.emitEvent(EditorEvent.EDITOR_SAVE);\n break;\n case \"submit-update\":\n case \"edit-update\":\n this.emitEvent(EditorEvent.EDITOR_UPDATE);\n break\n case \"edit-link\":\n range.insertNode(document.createTextNode(\"[\" + pulled + \"](PASTE URL HERE)\"));\n break;\n case \"edit-delete\":\n this.emitEvent(EditorEvent.EDITOR_DELETE);\n break\n default:\n //range.insertNode(document.createTextNode(\"[\" + self.url + \"](PASTE URL HERE)\"));\n break;\n }\n }\n this.refresh()\n }\n}\nexport default TextEditor","//TOOLS\nimport DataUtils,\n{\n REQUEST_TYPE_GET,\n REQUEST_TYPE_PUT,\n REQUEST_TYPE_POST,\n REQUEST_TYPE_DELETE,\n CONTENT_TYPE_JSON,\n CONTENT_TYPE_FORM\n}\nfrom '../../../../../brain/tools/utilities/DataUtils';\nimport * as DataEvent from '../../../../../brain/tools/events/DataEvent';\nimport Animate from '../../../../../brain/tools/effects/Animate';\nimport PostActions from '../actions/PostActions';\nimport * as EditorEvent from '../../../../../brain/tools/events/EditorEvent';\nimport TinyDatePicker from 'tiny-date-picker';\nimport DateUtils from '../../../../../brain/tools/utilities/DateUtils';\nimport TextEditor from '../../../../../brain/tools/ui/TextEditor';\nimport Dexie from 'dexie';\nimport DBUtils , {COUNT, FINAL_KEY} from '../../../../../brain/tools/utilities/DBUtils';\nexport default class PostEditor\n{\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {\n let self = this;\n this.anim = new Animate();\n this.dataUtils = new DataUtils();\n this.dateUtils = new DateUtils();\n this.urlPieces = document.URL.split(\"/\");\n this.dbUtils = new DBUtils();\n this.post = [];\n this.postID = null;\n \n if (document.getElementById('post-edit-index').getAttribute('data-index'))\n {\n this.postID = document.getElementById('post-edit-index').getAttribute('data-index');\n this.dbUtils.getPost(this.postID).then(body=>{\n self.post = body.post;\n this.start()\n }).catch(err=>{\n //console.log(err)\n })\n }else{\n this.start()\n } \n if (document.getElementById('edit-post-text'))\n {\n this.editor = new TextEditor(document.getElementById('edit-post-text'), document.getElementById('header').offsetHeight + document.getElementById('post-header').offsetHeight + document.getElementById('post-feature').offsetHeight);\n this.editor.addListener(EditorEvent.EDITOR_DELETE, f => this.handleEditorOptions(EditorEvent.EDITOR_DELETE), false)\n this.editor.addListener(EditorEvent.EDITOR_UPLOAD_POST_IMAGE, f => this.handleEditorOptions(EditorEvent.EDITOR_UPLOAD_POST_IMAGE), false)\n this.editor.addListener(EditorEvent.EDITOR_UPDATE, f => this.handleEditorOptions(EditorEvent.EDITOR_UPDATE), false)\n this.editor.addListener(EditorEvent.EDITOR_SAVE, f => this.handleEditorOptions(EditorEvent.EDITOR_SAVE), false)\n document.getElementById('post-image-upload').addEventListener('change', e =>\n {\n self.handleImageUpload(e.target.id, e.target.files);\n }, false);\n TinyDatePicker(document.getElementById('post-date'),\n {\n mode: 'dp-below',\n format(date)\n {\n //return date;\n return self.dateUtils.getDate('origin', date);\n }\n });\n }\n }\n //--------------------------\n // methods\n //--------------------------\n start()\n {\n let self = this;\n if (document.getElementById('featured-image-drop'))\n {\n document.getElementById('featured-image-drop').addEventListener('dragover', this.handleImageActions, false);\n document.getElementById('featured-image-drop').addEventListener('drop', this.handleImageActions, false);\n document.getElementById('featured-image-upload').addEventListener('change', e => this.handleImageActions(e), false);\n if (document.getElementById('new-feature-upload'))\n {\n document.getElementById('new-feature-upload').addEventListener('click', e =>\n {\n document.getElementById('featured-image-upload').click();\n })\n }\n var optionButtons = document.querySelectorAll('.post-option-btn');\n for (var i = 0, length = optionButtons.length; i < length; i++)\n {\n optionButtons[i].addEventListener('click', e => this.handlePostOptions(e), false);\n }\n }\n }\n //--------------------------\n // event handlers\n //--------------------------\n handlePostOptions(e)\n {\n let currentOption;\n switch (e.target.id)\n {\n case \"option-page-icon\":\n case \"option-page\":\n currentOption = document.getElementById('option-page');\n break;\n case \"option-feature-icon\":\n case \"option-feature\":\n currentOption = document.getElementById('option-feature');\n break;\n case \"option-published-icon\":\n case \"option-published\":\n currentOption = document.getElementById('option-published');\n break;\n }\n let active = currentOption.getAttribute('data-active');\n (active == 'false') ? currentOption.setAttribute('data-active', 'true'): currentOption.setAttribute('data-active', 'false')\n }\n handleEditorOptions(e)\n {\n let self = this;\n switch (e)\n {\n case EditorEvent.EDITOR_SAVE:\n new PostActions().update(this.postID, this.post, PostEditor.uploadFiles, FINAL_KEY).then(response =>\n {\n setTimeout(f =>\n {\n self.dbUtils.getPost(Number(response.response.newPost)).then(r=>{\n window.location = \"/@/dashboard/posts/edit/\" + r.post.slug;\n })\n \n }, 100);\n }).catch(err =>\n {\n //console.log(\"ERROR\", err)\n })\n break\n case EditorEvent.EDITOR_UPDATE:\n new PostActions().update(this.postID, this.post, PostEditor.uploadFiles, FINAL_KEY).then(response =>\n {\n this.editor.notify(DataEvent.POST_UPDATED, this.postID);\n }).catch(err =>\n {\n //console.log(\"ERRORZ\", err)\n })\n break;\n case EditorEvent.EDITOR_DELETE:\n if (confirm('Aye! You know you\\'re deleting this post, right?'))\n {\n new PostActions().deletePost(this.postID, this.post).then((response) =>\n {\n setTimeout(f =>\n {\n window.location = \"/@/dashboard/posts/\"\n \n }, 100);\n }).catch((err) =>\n {\n console.log(err)\n });\n }\n else\n {\n // Do nothing!\n }\n break;\n case EditorEvent.EDITOR_UPLOAD_POST_IMAGE:\n document.getElementById('post-image-upload').click();\n break;\n }\n }\n handleImageActions(e)\n {\n e.stopPropagation();\n e.preventDefault();\n var self = this;\n switch (e.type)\n {\n case \"dragover\":\n e.dataTransfer.dropEffect = 'copy'; // Explicitly show this is a copy.\n break;\n case \"change\":\n case \"drop\":\n (e.type == \"drop\") ? PostEditor.uploadFiles = e.dataTransfer.files: PostEditor.uploadFiles = e.target.files;\n for (var i = 0, f; f = PostEditor.uploadFiles[i]; i++)\n {\n // Only process image files.\n if (!f.type.match('image.*'))\n {\n continue;\n }\n var reader = new FileReader();\n // Closure to capture the file information.\n reader.onload = (function(theFile)\n {\n return function(f)\n {\n // Render thumbnail.\n var image = document.createElement('img');\n image.src = f.target.result;\n image.title = escape(theFile.name);\n var span = document.createElement('div');\n span.innerHTML = ['<img src=\"',\n f.target.result, '\" title=\"',\n escape(theFile.name), '\"/>'\n ].join('');\n //document.getElementById('featured-image-drop').insertBefore(span, null);\n document.getElementById('featured-image-drop').innerHTML = '';\n document.getElementById('featured-image-drop').appendChild(image);\n };\n })(f);\n // Read in the image file as a data URL.\n reader.readAsDataURL(f);\n }\n if (e.target.id == \"featured-image-upload\") this.handleImageUpload(e.target.id, PostEditor.uploadFiles);\n break;\n }\n }\n handleImageUpload(type, files)\n {\n let url = \"\"\n let eventType = \"\";\n let self = this;\n (type == \"featured-image-upload\") ? url = \"/api/post/add-feature-image\": url = \"/api/post/add-post-image\";\n (type == \"featured-image-upload\") ? eventType = DataEvent.FEATURE_IMAGE_ADDED: eventType = DataEvent.POST_IMAGE_ADDED\n var imageData = new FormData();\n for (var i = 0; i < files.length; i++)\n {\n var file = files[i];\n // Check the file type.\n if (!file.type.match('image.*'))\n {\n continue;\n }\n (type == \"featured-image-upload\") ? imageData.append('feature_image', file, file.name): imageData.append('post_image', file, file.name);\n }\n this.dataUtils.request(url, eventType, REQUEST_TYPE_POST, CONTENT_TYPE_FORM, imageData).then((response) =>\n {\n let r = JSON.parse(response.request['response']);\n if (r.message == DataEvent.POST_IMAGE_ADDED) self.editor.notify(EditorEvent.EDITOR_UPLOAD_POST_IMAGE, r.url);\n }).catch((err) =>\n {\n //console.log(err)\n })\n }\n}\nPostEditor.uploadFiles = [];","import Animate from '../../../../../brain/tools/effects/Animate';\nimport PostEditor from './PostEditor';\nexport default class PostIndex\n{\n //--------------------------\n // constructor\n //--------------------------\n constructor(page)\n {\n this.currentPage = null;\n this.choosePage(page);\n this.start();\n }\n //--------------------------\n // methods\n //--------------------------\n start()\n {\n let self = this;\n }\n choosePage(page)\n {\n this.currentPage = '';\n switch (page)\n {\n case \"edit\":\n case \"add\":\n this.currentPage = new PostEditor();\n break;\n default:\n //just chill\n break;\n }\n }\n //--------------------------\n // event handlers\n //--------------------------\n}","import PostEditor from './PostEditor';\nimport Animate from '../../../../../brain/tools/effects/Animate';\nimport PostIndex from './PostIndex';\n\nexport default class DashManager {\n //--------------------------\n // constructor\n //--------------------------\n constructor() {\n this.currentDisplay = '';\n this.urlPieces = document.URL.split(\"/\");\n this.chooseDisplay(this.urlPieces[5], this.urlPieces[6]);\n }\n //--------------------------\n // methods\n //--------------------------\n start() {\n let self = this;\n \n }\n\n chooseDisplay(section, page) {\n this.currentDisplay = '';\n switch (section) {\n case 'posts':\n this.currentDisplay = new PostIndex(page);\n break;\n \n default:\n // just chill\n break;\n }\n this.start();\n\n }\n //--------------------------\n // event handlers\n //--------------------------\n\n}","import DataUtils,\n{\n REQUEST_TYPE_GET,\n REQUEST_TYPE_PUT,\n REQUEST_TYPE_POST,\n REQUEST_TYPE_DELETE,\n CONTENT_TYPE_JSON,\n CONTENT_TYPE_FORM\n}\nfrom '../../../../brain/tools/utilities/DataUtils';\nimport * as DataEvent from '../../../../brain/tools/events/DataEvent';\nimport DashManager from './controllers/DashManager';\nimport DBUtils from '../../../../brain/tools/utilities/DBUtils';\nexport default class Base\n{\n //--------------------------\n // constructor\n //--------------------------\n constructor()\n {\n var self = this;\n this.dashManager = [];\n this.dataUtils = new DataUtils();\n this.dbUtils = new DBUtils();\n this.settings = [];\n this.cacheAssets();\n this.storeLocalData();\n }\n start()\n {\n this.dashManager = new DashManager();\n }\n //--------------------------\n // methods\n //--------------------------\n storeLocalData()\n {\n var self = this;\n this.dataUtils.request('/api/post/json', DataEvent.SETTINGS_LOADED).then((response) =>\n {\n let posts = JSON.parse(response.request['response']);\n\n let list = [];\n for (let index = 0; index < posts.length; index++) {\n list.push({id:posts[index].id ,post:posts[index].post});\n }\n self.dbUtils.syncLocal(list).then(r=>{\n self.start();\n }).catch(err=>{\n console.log(err);\n });\n }).catch((err) =>\n {\n console.log(err);\n });\n }\n\n cacheAssets()\n {\n if ('serviceWorker' in navigator)\n {\n window.addEventListener('load', function()\n {\n navigator.serviceWorker.register('https://fipamo.local/tim-duncan.js?'+Math.round(new Date().getTime()/1000)).then(function(registration)\n {\n //console.log('Service worker successfully registered on scope', registration.scope);\n }).catch(function(error)\n {\n //console.log('Service worker failed to register');\n });\n });\n }\n else\n {\n //console.log(\"NOPE\")\n }\n }\n //--------------------------\n // event handlers\n //--------------------------\n}","import Base from './Base'\n\ndocument.addEventListener('DOMContentLoaded', function() {\n\n var base = new Base();\n}, false);\n"]}
Reference in New Issue View Git Blame Copy Permalink