{"version":3,"sources":["webpack:///./node_modules/markdown-it/lib/common/utils.js","webpack:///./node_modules/markdown-it/lib/rules_block/heading.js","webpack:///./node_modules/markdown-it/lib/index.js","webpack:///./node_modules/markdown-it/lib/rules_inline/state_inline.js","webpack:///./src/apps/open/views/docCenter/components/subMenu.vue?8396","webpack:///./src/apps/open/views/docCenter/components/subMenu.vue","webpack:///./src/apps/open/views/docCenter/components/subMenu.vue?b880","webpack:///./src/apps/open/views/docCenter/components/subMenu.vue?ffd8","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/bmp.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/jpg.js","webpack:///./node_modules/markdown-it/lib/rules_block/lheading.js","webpack:///./node_modules/markdown-it/lib/presets/zero.js","webpack:///./node_modules/markdown-it/lib/rules_inline/text_collapse.js","webpack:///./src/apps/open/views/fileCenter/components/DocRate.vue?83ca","webpack:///./node_modules/markdown-it/lib/rules_inline/autolink.js","webpack:///./node_modules/markdown-it-imsize/lib/helpers/parse_image_size.js","webpack:///./node_modules/core-js/library/modules/es6.object.keys.js","webpack:///./node_modules/markdown-it/lib/rules_core/block.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/readUInt.js","webpack:///./node_modules/markdown-it/lib/rules_inline/newline.js","webpack:///./node_modules/markdown-it/lib/presets/commonmark.js","webpack:///./node_modules/markdown-it/lib/rules_block/paragraph.js","webpack:///./node_modules/markdown-it/lib/ruler.js","webpack:///./node_modules/markdown-it/lib/rules_inline/backticks.js","webpack:///./node_modules/markdown-it/lib/rules_block/list.js","webpack:///./node_modules/markdown-it-mark/index.js","webpack:///./node_modules/markdown-it/lib/rules_core/normalize.js","webpack:///./node_modules/markdown-it/lib/parser_inline.js","webpack:///./node_modules/markdown-it-mathjax/markdown-it-mathjax.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/psd.js","webpack:///./node_modules/markdown-it/lib/helpers/index.js","webpack:///./node_modules/markdown-it/lib/common/html_re.js","webpack:///./node_modules/markdown-it/lib/rules_inline/entity.js","webpack:///./node_modules/markdown-it/lib/rules_block/html_block.js","webpack:///./src/apps/open/views/docCenter/components/docBody.vue?9984","webpack:///./src/apps/open/utils/scroll.ts","webpack:///./node_modules/markdown-it/lib/rules_inline/escape.js","webpack:///./node_modules/markdown-it/lib/rules_core/state_core.js","webpack:///./node_modules/markdown-it-container/index.js","webpack:///./node_modules/markdown-it/lib/parser_block.js","webpack:///./src/apps/open/views/docCenter/components/docBody.vue?6d31","webpack:///./src/apps/open/views/docCenter/components/docBody.vue","webpack:///./src/apps/open/views/docCenter/components/docBody.vue?9f37","webpack:///./src/apps/open/views/docCenter/components/docBody.vue?293b","webpack:///./node_modules/markdown-it/lib/renderer.js","webpack:///./node_modules/markdown-it/lib/helpers/parse_link_title.js","webpack:///./node_modules/markdown-it/lib/rules_block/table.js","webpack:///./node_modules/markdown-it-imsize/lib/index.js","webpack:///./node_modules/markdown-it/lib/rules_block/state_block.js","webpack:///./node_modules/markdown-it/lib/rules_inline/balance_pairs.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/index.js","webpack:///./node_modules/markdown-it/lib/presets/default.js","webpack:///./node_modules/core-js/library/fn/object/keys.js","webpack:///./src/apps/open/views/docCenter/components/leftMenu.vue?bd55","webpack:///./node_modules/markdown-it/lib/rules_inline/strikethrough.js","webpack:///./node_modules/markdown-it/lib/rules_inline/image.js","webpack:///./node_modules/markdown-it/lib/rules_core/linkify.js","webpack:///./node_modules/markdown-it/lib/rules_block/code.js","webpack:///./node_modules/markdown-it/lib/rules_core/inline.js","webpack:///./node_modules/@babel/runtime-corejs2/core-js/object/keys.js","webpack:///./node_modules/markdown-it/lib/parser_core.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types.js","webpack:///./node_modules/markdown-it/lib/rules_core/smartquotes.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/svg.js","webpack:///./node_modules/linkify-it/lib/re.js","webpack:///./node_modules/markdown-it/lib/rules_inline/text.js","webpack:///./node_modules/markdown-it/lib/rules_core/replacements.js","webpack:///./node_modules/markdown-it/lib/common/entities.js","webpack:///./node_modules/markdown-it/lib/rules_block/fence.js","webpack:///./static/images/open/right-icon.svg","webpack:///./node_modules/markdown-it/lib/rules_inline/html_inline.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/gif.js","webpack:///./node_modules/markdown-it/lib/rules_inline/emphasis.js","webpack:///./node_modules/markdown-it/lib/rules_inline/link.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types sync ^\\.\\/.*$","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/webp.js","webpack:///./node_modules/markdown-it-ins/index.js","webpack:///./node_modules/markdown-it/index.js","webpack:///./node_modules/markdown-it/lib/rules_block/reference.js","webpack:///./node_modules/markdown-it/lib/helpers/parse_link_label.js","webpack:///./node_modules/path-browserify/index.js","webpack:///./node_modules/markdown-it/lib/common/html_blocks.js","webpack:///./node_modules/markdown-it-plantuml/lib/deflate.js","webpack:///./src/apps/open/views/docCenter/components/subMenu.vue?1a85","webpack:///./node_modules/markdown-it/lib/helpers/parse_link_destination.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/detector.js","webpack:///./node_modules/markdown-it/lib/rules_block/blockquote.js","webpack:///./node_modules/markdown-it-plantuml/index.js","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/png.js","webpack:///./src/apps/open/views/docCenter/components/leftMenu.vue?e7ea","webpack:///./src/apps/open/views/docCenter/components/leftMenu.vue","webpack:///./src/apps/open/views/docCenter/components/leftMenu.vue?f57a","webpack:///./src/apps/open/views/docCenter/components/leftMenu.vue?aae4","webpack:///./src/apps/open/views/docCenter/components/docBody.vue?8307","webpack:///./node_modules/markdown-it-imsize/lib/imsize/types/tiff.js","webpack:///./src/apps/open/views/fileCenter/components/DocRate.vue?d970","webpack:///./src/apps/open/views/fileCenter/components/DocRate.vue?af2b","webpack:///src/apps/open/views/fileCenter/components/DocRate.vue","webpack:///./node_modules/@babel/runtime-corejs2/helpers/esm/applyDecoratedDescriptor.js","webpack:///./src/apps/open/views/fileCenter/components/DocRate.vue","webpack:///./node_modules/linkify-it/index.js","webpack:///./node_modules/markdown-it/lib/rules_block/hr.js"],"names":["_hasOwnProperty","Object","prototype","hasOwnProperty","has","object","key","call","isValidEntityCode","c","fromCodePoint","surrogate1","surrogate2","String","fromCharCode","UNESCAPE_MD_RE","UNESCAPE_ALL_RE","RegExp","source","DIGITAL_ENTITY_TEST_RE","entities","r","HTML_ESCAPE_TEST_RE","HTML_ESCAPE_REPLACE_RE","HTML_REPLACEMENTS","replaceUnsafeChar","ch","REGEXP_ESCAPE_RE","UNICODE_PUNCT_RE","exports","lib","mdurl","ucmicro","assign","obj","sources","Array","slice","arguments","forEach","TypeError","keys","isString","toString","_class","unescapeMd","str","indexOf","replace","unescapeAll","match","escaped","entity","name","code","charCodeAt","test","toLowerCase","parseInt","replaceEntityPattern","escapeHtml","arrayReplaceAt","src","pos","newElements","concat","isSpace","isWhiteSpace","isMdAsciiPunct","isPunctChar","escapeRE","normalizeReference","trim","toUpperCase","module","state","startLine","endLine","silent","level","tmp","token","bMarks","tShift","max","eMarks","sCount","blkIndent","skipSpacesBack","skipCharsBack","line","push","markup","map","content","children","utils","helpers","Renderer","ParserCore","ParserBlock","ParserInline","LinkifyIt","punycode","config","default","zero","commonmark","BAD_PROTO_RE","GOOD_DATA_RE","validateLink","url","RECODE_HOSTNAME_FOR","normalizeLink","parsed","parse","hostname","protocol","toASCII","er","encode","format","normalizeLinkText","toUnicode","decode","defaultChars","MarkdownIt","presetName","options","this","inline","block","core","renderer","linkify","configure","set","presets","self","Error","components","rules","ruler","enableOnly","rules2","ruler2","enable","list","ignoreInvalid","result","isArray","chain","missed","filter","length","disable","use","plugin","args","apply","env","State","process","tokens","render","parseInline","inlineMode","renderInline","Token","StateInline","md","outTokens","tokens_meta","posMax","pending","pendingLevel","cache","delimiters","_prev_delimiters","backticks","backticksScanned","pushPending","type","tag","nesting","token_meta","pop","scanDelims","start","canSplitWord","lastChar","nextChar","count","can_open","can_close","isLastWhiteSpace","isLastPunctChar","isNextWhiteSpace","isNextPunctChar","left_flanking","right_flanking","marker","e","curMenuKey","observer","isInitHash","location","hash","isPrivate","keyIdx","lastIndexOf","menus","registerObserver","window","IntersectionObserver","initObserver","entries","isIntersecting","setCurMenuKey","target","id","threshold","menu","document","querySelector","observe","$store","getters","m","component","_vm","_h","$createElement","_c","_self","staticClass","_v","_l","class","domProps","_s","label","on","$event","selectSubMenu","staticRenderFns","buffer","readUInt32LE","validJFIFMarkers","red","extractSize","i","readUInt16BE","validateBuffer","SOIMarker","JFIFMarker","got","expected","console","warn","next","terminate","l","oldParentType","nextLine","terminatorRules","getRules","parentType","isEmpty","skipChars","skipSpaces","getLines","html","xhtmlOut","breaks","langPrefix","typographer","quotes","highlight","maxNesting","curr","last","EMAIL_RE","AUTOLINK_RE","fullUrl","attrs","info","parseNextNumber","ok","value","width","height","resultW","resultH","toObject","$keys","it","bits","offset","isBigEndian","pmax","lineMax","Ruler","__rules__","__cache__","__find__","__compile__","chains","rule","enabled","alt","altName","fn","at","index","opt","before","beforeName","ruleName","splice","after","afterName","idx","chainName","matchStart","matchEnd","openerLength","closerLength","skipBulletListMarker","skipOrderedListMarker","contentStart","indent","indentAfterMarker","initial","isOrdered","itemLines","listLines","listTokIdx","markerCharCode","markerValue","oldListIndent","oldSCount","oldTShift","oldTight","posAfterMarker","prevEmptyEnd","isTerminatingParagraph","tight","listIndent","Number","bsCount","Math","min","tokenize","hidden","markTightParagraphs","postProcess","j","startDelim","endDelim","loneMarkers","end","scanned","len","jump","open","close","NEWLINES_RE","NULL_RE","_rules","_rules2","skipToken","math","startMathPos","endMarker","includeMarkers","endMarkerPos","nextPos","texMath","afterStartMarker","beforeEndMarker","suffix","mapping","defaults","reduce","extend","beforeMath","afterMath","beforeInlineMath","afterInlineMath","beforeDisplayMath","afterDisplayMath","factory","readUInt32BE","parseLinkLabel","parseLinkDestination","parseLinkTitle","open_tag","close_tag","HTML_TAG_RE","HTML_OPEN_CLOSE_TAG_RE","DIGITAL_RE","NAMED_RE","block_names","HTML_SEQUENCES","join","lineText","scrollToTag","tagId","curTitleDom","topPostion","getBoundingClientRect","top","scroll","scrollY","pageYOffset","ESCAPED","split","StateCore","marker_str","marker_char","marker_len","validate","params","_options","slf","attrJoin","renderToken","marker_count","old_parent","old_line_max","auto_closed","floor","hasEmptyLines","skipEmptyLines","curMdSource","subMenuArr","initData","getMdFileSource","_","p1","p2","t","a","get","$route","meta","mdfilepath","res","data","navigator","userAgent","link_open","attrPush","subMenuGenerator","isPriDocMiddle","firstMenu","find","router_name","matched","path","leftMenu","subMenu","DocRate","activeIndex","isClient","officeDocUrl","default_rules","code_inline","renderAttrs","code_block","fence","highlighted","arr","tmpAttrs","tmpToken","langName","langAttrs","attrIndex","image","renderInlineAsText","hardbreak","softbreak","text","html_block","html_inline","nextToken","needLf","lines","getLine","substr","escapedSplit","isEscaped","lastPos","current","substring","columns","columnCount","aligns","tableLines","tbodyLines","firstCh","secondCh","shift","sizeOf","parseImageSize","labelEnd","labelStart","ref","title","href","oldPos","references","newState","autofill","dimensions","image_with_size","StateBlock","s","indent_found","ddIndent","from","begin","keepLastLF","lineIndent","first","queue","lineStart","processDelimiters","closerIdx","openerIdx","closer","opener","minOpenerIdx","newMinOpenerIdx","isOddMatch","lastJump","openersBottom","fs","detector","handlers","MaxBufferSize","lookup","filepath","size","calculate","asyncFileToBuffer","callback","err0","descriptor","fstatSync","bufferSize","Buffer","read","err1","err2","syncFileToBuffer","openSync","readSync","closeSync","input","resolve","err","isLinkOpen","isLinkClose","currentToken","nodes","ln","htmlLinkLevel","urlText","links","blockTokens","pretest","schema","lastIndex","tok","Core","QUOTE_TEST_RE","QUOTE_RE","replaceAt","process_inlines","thisLevel","item","canOpen","canClose","isSingle","stack","openQuote","closeQuote","OUTER","exec","single","blkIdx","svgReg","extractorRegExps","section","root","ratio","viewbox","dim","getRatio","opts","re","src_Any","src_Cc","src_Z","src_P","src_ZPCc","src_ZCc","text_separators","src_pseudo_letter","src_ip4","src_auth","src_port","src_host_terminator","src_path","src_email_name","src_xn","src_domain_root","src_domain","src_host","tpl_host_fuzzy","tpl_host_no_ip_fuzzy","src_host_strict","tpl_host_fuzzy_strict","src_host_port_strict","tpl_host_port_fuzzy_strict","tpl_host_port_no_ip_fuzzy_strict","tpl_host_fuzzy_test","tpl_email_fuzzy","tpl_link_fuzzy","tpl_link_no_ip_fuzzy","isTerminatorChar","RARE_RE","SCOPED_ABBR_TEST_RE","SCOPED_ABBR_RE","SCOPED_ABBR","p","tm","replaceFn","replace_scoped","inlineTokens","inside_autolink","replace_rare","mem","haveEndMarker","lc","isLetter","gifRegexp","signature","readUInt16LE","isStrong","parseReference","webpackContext","req","webpackContextResolve","__webpack_require__","riffHeader","webpHeader","vp8Header","chunkHeader","readInt16LE","calculateLossy","calculateLossless","_endLine","destEndPos","destEndLineNo","disableNested","found","prevPos","normalizeArray","parts","allowAboveRoot","up","unshift","xs","f","resolvedPath","resolvedAbsolute","cwd","charAt","normalize","isAbsolute","trailingSlash","paths","relative","to","fromParts","toParts","samePartsLength","outputParts","sep","delimiter","dirname","hasRoot","matchedSlash","basename","ext","extname","startDot","startPart","preDotState","zip_deflate","out","buff","zip_deflate_data","zip_deflate_pos","zip_deflate_start","zip_deflate_internal","encode64","append3bytes","zip_free_queue","zip_qhead","zip_qtail","zip_initflag","zip_outcnt","zip_outoff","zip_complete","zip_window","zip_d_buf","zip_l_buf","zip_prev","zip_bi_buf","zip_bi_valid","zip_block_start","zip_ins_h","zip_hash_head","zip_prev_match","zip_match_available","zip_match_length","zip_prev_length","zip_strstart","zip_match_start","zip_eofile","zip_lookahead","zip_max_chain_length","zip_max_lazy_match","zip_compr_level","zip_good_match","zip_dyn_ltree","zip_dyn_dtree","zip_static_ltree","zip_static_dtree","zip_bl_tree","zip_l_desc","zip_d_desc","zip_bl_desc","zip_bl_count","zip_heap","zip_heap_len","zip_heap_max","zip_depth","zip_length_code","zip_dist_code","zip_base_length","zip_base_dist","zip_flag_buf","zip_last_lit","zip_last_dist","zip_last_flags","zip_flags","zip_flag_bit","zip_opt_len","zip_static_len","zip_WSIZE","zip_MAX_DIST","zip_L_CODES","zip_LITERALS","zip_H_SHIFT","zip_outbuf","zip_extra_lbits","zip_extra_dbits","zip_extra_blbits","zip_bl_order","zip_configuration_table","zip_DeflateConfiguration","zip_DeflateCT","fc","dl","zip_DeflateTreeDesc","dyn_tree","static_tree","extra_bits","extra_base","elems","max_length","max_code","b","d","good_length","max_lazy","nice_length","max_chain","zip_DeflateBuffer","ptr","off","zip_INBUFSIZ","zip_MAX_BITS","zip_MAX_MATCH","zip_LIT_BUFSIZE","zip_reuse_queue","zip_head1","zip_head2","val","zip_put_byte","q","zip_new_queue","zip_qoutbuf","zip_put_short","w","zip_OUTBUFSIZ","zip_INSERT_STRING","zip_HASH_SIZE","zip_SEND_CODE","tree","zip_send_bits","zip_D_CODE","dist","zip_SMALLER","n","zip_read_buff","zip_longest_match","cur_match","matchp","chain_length","scanp","best_len","limit","strendp","scan_end1","scan_end","zip_fill_window","more","zip_init_deflate","zip_LENGTH_CODES","zip_gen_codes","zip_bi_reverse","zip_init_block","zip_ct_init","zip_MIN_MATCH","zip_lm_init","buff_size","zip_qcopy","flush","zip_ct_tally","zip_flush_block","zip_deflate_fast","zip_deflate_better","zip_pqdownheap","k","v","next_code","zip_build_tree","desc","stree","node","xnew","h","xbits","extra","base","overflow","zip_gen_bitlen","zip_scan_tree","curlen","prevlen","nextlen","max_count","min_count","zip_send_tree","eof","opt_lenb","static_lenb","max_blindex","stored_len","zip_BL_CODES","zip_build_bl_tree","zip_bi_windup","zip_compress_block","lcodes","dcodes","blcodes","rank","zip_send_all_trees","dcode","out_length","in_length","ltree","dtree","lx","dx","fx","flag","b1","b2","b3","c2","c3","c4","encode6bit","typeMap","detect","adjustTab","lastLineEmpty","oldBMarks","oldBSCount","oldIndent","spaceAfterMarker","isOutdented","oldLineMax","openMarker","openChar","closeMarker","closeChar","generateSource","umlCode","pluginOptions","imageFormat","diagramName","server","deflate","unescape","encodeURIComponent","autoClosed","closeMarkerMatched","contents","altToken","uml_diagram","$emit","isAbsolutePath","defaultActive","emitActiveMenu","slot","icon","itemChild","itemChild_Child","getIndexPath","nativeOn","openTab","readUInt","readIFD","ifdOffset","fileSize","statSync","endBuffer","readValue","low","nextTag","extractTags","tags","hex4","determineEndianness","property","decorators","context","enumerable","configurable","initializer","writable","reverse","decorator","undefined","rateState","addRate","model","$$v","rateVal","expression","isObject","isRegExp","isFunction","defaultOptions","fuzzyLink","fuzzyEmail","fuzzyIP","defaultSchemas","tail","http","no_http","mailto","tlds_default","compile","__opts__","tlds","__tlds__","untpl","tpl","src_tlds","onCompile","__tlds_replaced__","email_fuzzy","link_fuzzy","link_no_ip_fuzzy","host_fuzzy_test","aliases","schemaError","__compiled__","__schemas__","compiled","link","createValidator","alias","slist","schema_test","schema_search","__index__","__text_cache__","resetScanCache","Match","__last_index__","__schema__","raw","createMatch","schemas","acc","isOptionsObj","add","definition","ml","me","tld_pos","testSchemaAt","search","keepOld","sort","el","cnt"],"mappings":"+JASA,IAAIA,EAAkBC,OAAOC,UAAUC,eAEvC,SAASC,EAAIC,EAAQC,GACnB,OAAON,EAAgBO,KAAKF,EAAQC,GA+BtC,SAASE,EAAkBC,GAGzB,QAAIA,GAAK,OAAUA,GAAK,OAEpBA,GAAK,OAAUA,GAAK,OACH,QAAZ,MAAJA,IAA2C,QAAZ,MAAJA,IAE5BA,GAAK,GAAQA,GAAK,GACZ,KAANA,GACAA,GAAK,IAAQA,GAAK,IAClBA,GAAK,KAAQA,GAAK,KAElBA,EAAI,SAIV,SAASC,EAAcD,GAErB,GAAIA,EAAI,MAAQ,CAEd,IAAIE,EAAa,QADjBF,GAAK,QAC2B,IAC5BG,EAAa,OAAc,KAAJH,GAE3B,OAAOI,OAAOC,aAAaH,EAAYC,GAEzC,OAAOC,OAAOC,aAAaL,GAI7B,IAAIM,EAAkB,8CAElBC,EAAkB,IAAIC,OAAOF,EAAeG,OAAS,IADnC,6BACmDA,OAAQ,MAE7EC,EAAyB,qCAEzBC,EAAWC,EAAQ,QA2CvB,IAAIC,EAAsB,SACtBC,EAAyB,UACzBC,EAAoB,CACtB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,UAGP,SAASC,EAAkBC,GACzB,OAAOF,EAAkBE,GAY3B,IAAIC,EAAmB,uBAwCvB,IAAIC,EAAmBP,EAAQ,QAiH/BQ,EAAQC,IAAsB,GAC9BD,EAAQC,IAAIC,MAAkBV,EAAQ,QACtCQ,EAAQC,IAAIE,QAAkBX,EAAQ,QAEtCQ,EAAQI,OA5RR,SAAgBC,GACd,IAAIC,EAAUC,MAAMlC,UAAUmC,MAAM9B,KAAK+B,UAAW,GAcpD,OAZAH,EAAQI,SAAQ,SAAUrB,GACxB,GAAKA,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIsB,UAAUtB,EAAS,kBAG/BjB,OAAOwC,KAAKvB,GAAQqB,SAAQ,SAAUjC,GACpC4B,EAAI5B,GAAOY,EAAOZ,UAIf4B,GA8QTL,EAAQa,SAvSR,SAAkBR,GAAO,MAAuB,oBAFhD,SAAgBA,GAAO,OAAOjC,OAAOC,UAAUyC,SAASpC,KAAK2B,GAE7BU,CAAOV,IAwSvCL,EAAQzB,IAAsBA,EAC9ByB,EAAQgB,WAtMR,SAAoBC,GAClB,OAAIA,EAAIC,QAAQ,MAAQ,EAAYD,EAC7BA,EAAIE,QAAQjC,EAAgB,OAqMrCc,EAAQoB,YAlMR,SAAqBH,GACnB,OAAIA,EAAIC,QAAQ,MAAQ,GAAKD,EAAIC,QAAQ,KAAO,EAAYD,EAErDA,EAAIE,QAAQhC,GAAiB,SAAUkC,EAAOC,EAASC,GAC5D,OAAID,GAlCR,SAA8BD,EAAOG,GACnC,IAAIC,EAAO,EAEX,OAAIlD,EAAIgB,EAAUiC,GACTjC,EAASiC,GAGS,KAAvBA,EAAKE,WAAW,IAAsBpC,EAAuBqC,KAAKH,IAIhE7C,EAHJ8C,EAAiC,MAA1BD,EAAK,GAAGI,cACbC,SAASL,EAAKhB,MAAM,GAAI,IAAMqB,SAASL,EAAKhB,MAAM,GAAI,KAG/C3B,EAAc4C,GAIlBJ,EAmBES,CAAqBT,EAAOE,OA8LvCvB,EAAQrB,kBAAsBA,EAC9BqB,EAAQnB,cAAsBA,EAE9BmB,EAAQ+B,WA9KR,SAAoBd,GAClB,OAAIxB,EAAoBkC,KAAKV,GACpBA,EAAIE,QAAQzB,EAAwBE,GAEtCqB,GA2KTjB,EAAQgC,eAjRR,SAAwBC,EAAKC,EAAKC,GAChC,MAAO,GAAGC,OAAOH,EAAIzB,MAAM,EAAG0B,GAAMC,EAAaF,EAAIzB,MAAM0B,EAAM,KAiRnElC,EAAQqC,QA/JR,SAAiBZ,GACf,OAAQA,GACN,KAAK,EACL,KAAK,GACH,OAAM,EAEV,OAAM,GA0JRzB,EAAQsC,aAtJR,SAAsBb,GACpB,GAAIA,GAAQ,MAAUA,GAAQ,KAAU,OAAM,EAC9C,OAAQA,GACN,KAAK,EACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,MACH,OAAM,EAEV,OAAM,GAuIRzB,EAAQuC,eAlHR,SAAwB1C,GACtB,OAAQA,GACN,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACL,KAAK,IACH,OAAM,EACR,QACE,OAAM,IA+EZG,EAAQwC,YA/HR,SAAqB3C,GACnB,OAAOE,EAAiB4B,KAAK9B,IA+H/BG,EAAQyC,SAzKR,SAAkBxB,GAChB,OAAOA,EAAIE,QAAQrB,EAAkB,SAyKvCE,EAAQ0C,mBA3ER,SAA4BzB,GA+C1B,OA5CAA,EAAMA,EAAI0B,OAAOxB,QAAQ,OAAQ,KAQP,MAAtB,IAAIS,gBACNX,EAAMA,EAAIE,QAAQ,KAAM,MAmCnBF,EAAIW,cAAcgB,gB,oCC5R3B,IAAIP,EAAU7C,EAAQ,QAAmB6C,QAGzCQ,EAAO7C,QAAU,SAAiB8C,EAAOC,EAAWC,EAASC,GAC3D,IAAIpD,EAAIqD,EAAOC,EAAKC,EAChBlB,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GAGvB,GAAID,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAI5D,GAAW,MAFX7D,EAAMiD,EAAMb,IAAIP,WAAWQ,KAEDA,GAAOqB,EAAO,OAAM,EAK9C,IAFAL,EAAQ,EACRrD,EAAKiD,EAAMb,IAAIP,aAAaQ,GACd,KAAPrC,GAAsBqC,EAAMqB,GAAOL,GAAS,GACjDA,IACArD,EAAKiD,EAAMb,IAAIP,aAAaQ,GAG9B,QAAIgB,EAAQ,GAAMhB,EAAMqB,IAAQlB,EAAQxC,KAEpCoD,IAIJM,EAAMT,EAAMa,eAAeJ,EAAKrB,GAChCiB,EAAML,EAAMc,cAAcL,EAAK,GAAMrB,GACjCiB,EAAMjB,GAAOG,EAAQS,EAAMb,IAAIP,WAAWyB,EAAM,MAClDI,EAAMJ,GAGRL,EAAMe,KAAOd,EAAY,EAEzBK,EAAeN,EAAMgB,KAAK,eAAgB,IAAM9E,OAAOkE,GAAQ,GAC/DE,EAAMW,OAAS,WAAWvD,MAAM,EAAG0C,GACnCE,EAAMY,IAAS,CAAEjB,EAAWD,EAAMe,MAElCT,EAAiBN,EAAMgB,KAAK,SAAU,GAAI,GAC1CV,EAAMa,QAAWnB,EAAMb,IAAIzB,MAAM0B,EAAKqB,GAAKZ,OAC3CS,EAAMY,IAAW,CAAEjB,EAAWD,EAAMe,MACpCT,EAAMc,SAAW,GAEjBd,EAAeN,EAAMgB,KAAK,gBAAiB,IAAM9E,OAAOkE,IAAS,GACjEE,EAAMW,OAAS,WAAWvD,MAAM,EAAG0C,S,oCC9CrC,IAAIiB,EAAe3E,EAAQ,QACvB4E,EAAe5E,EAAQ,QACvB6E,EAAe7E,EAAQ,QACvB8E,EAAe9E,EAAQ,QACvB+E,EAAe/E,EAAQ,QACvBgF,EAAehF,EAAQ,QACvBiF,EAAejF,EAAQ,QACvBU,EAAeV,EAAQ,QACvBkF,EAAelF,EAAQ,QAGvBmF,EAAS,CACXC,QAASpF,EAAQ,QACjBqF,KAAMrF,EAAQ,QACdsF,WAAYtF,EAAQ,SAYlBuF,EAAe,oCACfC,EAAe,oCAEnB,SAASC,EAAaC,GAEpB,IAAIjE,EAAMiE,EAAIvC,OAAOf,cAErB,OAAOmD,EAAapD,KAAKV,MAAQ+D,EAAarD,KAAKV,GAMrD,IAAIkE,EAAsB,CAAE,QAAS,SAAU,WAE/C,SAASC,EAAcF,GACrB,IAAIG,EAASnF,EAAMoF,MAAMJ,MAEzB,GAAIG,EAAOE,YAOJF,EAAOG,UAAYL,EAAoBjE,QAAQmE,EAAOG,WAAa,GACtE,IACEH,EAAOE,SAAWb,EAASe,QAAQJ,EAAOE,UAC1C,MAAOG,IAIb,OAAOxF,EAAMyF,OAAOzF,EAAM0F,OAAOP,IAGnC,SAASQ,EAAkBX,GACzB,IAAIG,EAASnF,EAAMoF,MAAMJ,MAEzB,GAAIG,EAAOE,YAOJF,EAAOG,UAAYL,EAAoBjE,QAAQmE,EAAOG,WAAa,GACtE,IACEH,EAAOE,SAAWb,EAASoB,UAAUT,EAAOE,UAC5C,MAAOG,IAKb,OAAOxF,EAAM6F,OAAO7F,EAAM0F,OAAOP,GAASnF,EAAM6F,OAAOC,aAAe,KAyIxE,SAASC,EAAWC,EAAYC,GAC9B,KAAMC,gBAAgBH,GACpB,OAAO,IAAIA,EAAWC,EAAYC,GAG/BA,GACEhC,EAAMtD,SAASqF,KAClBC,EAAUD,GAAc,GACxBA,EAAa,WAWjBE,KAAKC,OAAS,IAAI7B,EASlB4B,KAAKE,MAAQ,IAAI/B,EASjB6B,KAAKG,KAAO,IAAIjC,EAuBhB8B,KAAKI,SAAW,IAAInC,EASpB+B,KAAKK,QAAU,IAAIhC,EAiBnB2B,KAAKnB,aAAeA,EAQpBmB,KAAKhB,cAAgBA,EAOrBgB,KAAKP,kBAAoBA,EAWzBO,KAAKjC,MAAQA,EAQbiC,KAAKhC,QAAUD,EAAM/D,OAAO,GAAIgE,GAGhCgC,KAAKD,QAAU,GACfC,KAAKM,UAAUR,GAEXC,GAAWC,KAAKO,IAAIR,GAuB1BF,EAAW5H,UAAUsI,IAAM,SAAUR,GAEnC,OADAhC,EAAM/D,OAAOgG,KAAKD,QAASA,GACpBC,MAcTH,EAAW5H,UAAUqI,UAAY,SAAUE,GACzC,IAAiBV,EAAbW,EAAOT,KAEX,GAAIjC,EAAMtD,SAAS+F,MAEjBA,EAAUjC,EADVuB,EAAaU,IAEG,MAAM,IAAIE,MAAM,+BAAiCZ,EAAa,iBAGhF,IAAKU,EAAW,MAAM,IAAIE,MAAM,8CAchC,OAZIF,EAAQT,SAAWU,EAAKF,IAAIC,EAAQT,SAEpCS,EAAQG,YACV3I,OAAOwC,KAAKgG,EAAQG,YAAYrG,SAAQ,SAAUc,GAC5CoF,EAAQG,WAAWvF,GAAMwF,OAC3BH,EAAKrF,GAAMyF,MAAMC,WAAWN,EAAQG,WAAWvF,GAAMwF,OAEnDJ,EAAQG,WAAWvF,GAAM2F,QAC3BN,EAAKrF,GAAM4F,OAAOF,WAAWN,EAAQG,WAAWvF,GAAM2F,WAIrDf,MAqBTH,EAAW5H,UAAUgJ,OAAS,SAAUC,EAAMC,GAC5C,IAAIC,EAAS,GAERjH,MAAMkH,QAAQH,KAASA,EAAO,CAAEA,IAErC,CAAE,OAAQ,QAAS,UAAW5G,SAAQ,SAAUgH,GAC9CF,EAASA,EAAOpF,OAAOgE,KAAKsB,GAAOT,MAAMI,OAAOC,SAC/ClB,MAEHoB,EAASA,EAAOpF,OAAOgE,KAAKC,OAAOe,OAAOC,OAAOC,OAEjD,IAAIK,EAASL,EAAKM,QAAO,SAAUpG,GAAQ,OAAOgG,EAAOtG,QAAQM,GAAQ,KAEzE,GAAImG,EAAOE,SAAWN,EACpB,MAAM,IAAIT,MAAM,iDAAmDa,GAGrE,OAAOvB,MAWTH,EAAW5H,UAAUyJ,QAAU,SAAUR,EAAMC,GAC7C,IAAIC,EAAS,GAERjH,MAAMkH,QAAQH,KAASA,EAAO,CAAEA,IAErC,CAAE,OAAQ,QAAS,UAAW5G,SAAQ,SAAUgH,GAC9CF,EAASA,EAAOpF,OAAOgE,KAAKsB,GAAOT,MAAMa,QAAQR,SAChDlB,MAEHoB,EAASA,EAAOpF,OAAOgE,KAAKC,OAAOe,OAAOU,QAAQR,OAElD,IAAIK,EAASL,EAAKM,QAAO,SAAUpG,GAAQ,OAAOgG,EAAOtG,QAAQM,GAAQ,KAEzE,GAAImG,EAAOE,SAAWN,EACpB,MAAM,IAAIT,MAAM,kDAAoDa,GAEtE,OAAOvB,MAoBTH,EAAW5H,UAAU0J,IAAM,SAAUC,GACnC,IAAIC,EAAO,CAAE7B,MAAOhE,OAAO7B,MAAMlC,UAAUmC,MAAM9B,KAAK+B,UAAW,IAEjE,OADAuH,EAAOE,MAAMF,EAAQC,GACd7B,MAmBTH,EAAW5H,UAAUiH,MAAQ,SAAUrD,EAAKkG,GAC1C,GAAmB,iBAARlG,EACT,MAAM,IAAI6E,MAAM,iCAGlB,IAAIhE,EAAQ,IAAIsD,KAAKG,KAAK6B,MAAMnG,EAAKmE,KAAM+B,GAI3C,OAFA/B,KAAKG,KAAK8B,QAAQvF,GAEXA,EAAMwF,QAefrC,EAAW5H,UAAUkK,OAAS,SAAUtG,EAAKkG,GAG3C,OAFAA,EAAMA,GAAO,GAEN/B,KAAKI,SAAS+B,OAAOnC,KAAKd,MAAMrD,EAAKkG,GAAM/B,KAAKD,QAASgC,IAalElC,EAAW5H,UAAUmK,YAAc,SAAUvG,EAAKkG,GAChD,IAAIrF,EAAQ,IAAIsD,KAAKG,KAAK6B,MAAMnG,EAAKmE,KAAM+B,GAK3C,OAHArF,EAAM2F,cACNrC,KAAKG,KAAK8B,QAAQvF,GAEXA,EAAMwF,QAYfrC,EAAW5H,UAAUqK,aAAe,SAAUzG,EAAKkG,GAGjD,OAFAA,EAAMA,GAAO,GAEN/B,KAAKI,SAAS+B,OAAOnC,KAAKoC,YAAYvG,EAAKkG,GAAM/B,KAAKD,QAASgC,IAIxEtF,EAAO7C,QAAUiG,G,oCChkBjB,IAAI0C,EAAiBnJ,EAAQ,QACzB8C,EAAiB9C,EAAQ,QAAmB8C,aAC5CE,EAAiBhD,EAAQ,QAAmBgD,YAC5CD,EAAiB/C,EAAQ,QAAmB+C,eAGhD,SAASqG,EAAY3G,EAAK4G,EAAIV,EAAKW,GACjC1C,KAAKnE,IAAMA,EACXmE,KAAK+B,IAAMA,EACX/B,KAAKyC,GAAKA,EACVzC,KAAKkC,OAASQ,EACd1C,KAAK2C,YAAcxI,MAAMuI,EAAUjB,QAEnCzB,KAAKlE,IAAM,EACXkE,KAAK4C,OAAS5C,KAAKnE,IAAI4F,OACvBzB,KAAKlD,MAAQ,EACbkD,KAAK6C,QAAU,GACf7C,KAAK8C,aAAe,EAIpB9C,KAAK+C,MAAQ,GAGb/C,KAAKgD,WAAa,GAGlBhD,KAAKiD,iBAAmB,GAGxBjD,KAAKkD,UAAY,GACjBlD,KAAKmD,oBAMPX,EAAYvK,UAAUmL,YAAc,WAClC,IAAIpG,EAAQ,IAAIuF,EAAM,OAAQ,GAAI,GAKlC,OAJAvF,EAAMa,QAAUmC,KAAK6C,QACrB7F,EAAMF,MAAQkD,KAAK8C,aACnB9C,KAAKkC,OAAOxE,KAAKV,GACjBgD,KAAK6C,QAAU,GACR7F,GAOTwF,EAAYvK,UAAUyF,KAAO,SAAU2F,EAAMC,EAAKC,GAC5CvD,KAAK6C,SACP7C,KAAKoD,cAGP,IAAIpG,EAAQ,IAAIuF,EAAMc,EAAMC,EAAKC,GAC7BC,EAAa,KAqBjB,OAnBID,EAAU,IAEZvD,KAAKlD,QACLkD,KAAKgD,WAAahD,KAAKiD,iBAAiBQ,OAG1CzG,EAAMF,MAAQkD,KAAKlD,MAEfyG,EAAU,IAEZvD,KAAKlD,QACLkD,KAAKiD,iBAAiBvF,KAAKsC,KAAKgD,YAChChD,KAAKgD,WAAa,GAClBQ,EAAa,CAAER,WAAYhD,KAAKgD,aAGlChD,KAAK8C,aAAe9C,KAAKlD,MACzBkD,KAAKkC,OAAOxE,KAAKV,GACjBgD,KAAK2C,YAAYjF,KAAK8F,GACfxG,GAUTwF,EAAYvK,UAAUyL,WAAa,SAAUC,EAAOC,GAClD,IAAiBC,EAAUC,EAAUC,EAAOC,EAAUC,EAClDC,EAAkBC,EAClBC,EAAkBC,EAFlBvI,EAAM6H,EAGNW,KACAC,KACApH,EAAM6C,KAAK4C,OACX4B,EAASxE,KAAKnE,IAAIP,WAAWqI,GAKjC,IAFAE,EAAWF,EAAQ,EAAI3D,KAAKnE,IAAIP,WAAWqI,EAAQ,GAAK,GAEjD7H,EAAMqB,GAAO6C,KAAKnE,IAAIP,WAAWQ,KAAS0I,GAAU1I,IAqC3D,OAnCAiI,EAAQjI,EAAM6H,EAGdG,EAAWhI,EAAMqB,EAAM6C,KAAKnE,IAAIP,WAAWQ,GAAO,GAElDqI,EAAkBhI,EAAe0H,IAAazH,EAAYxD,OAAOC,aAAagL,IAC9EQ,EAAkBlI,EAAe2H,IAAa1H,EAAYxD,OAAOC,aAAaiL,IAE9EI,EAAmBhI,EAAa2H,IAChCO,EAAmBlI,EAAa4H,IAG9BQ,KACSD,IACHH,GAAoBC,IACxBG,OAIAJ,EACFK,KACSJ,IACHC,GAAoBC,IACxBE,OAICX,GAIHI,EAAYM,EACZL,EAAYM,IAJZP,EAAYM,KAAoBC,GAAkBJ,GAClDF,EAAYM,KAAoBD,GAAkBD,IAM7C,CACLL,SAAWA,EACXC,UAAWA,EACXxC,OAAWsC,IAMfvB,EAAYvK,UAAUsK,MAAQA,EAG9B9F,EAAO7C,QAAU4I,G,2CCzJjB,I,4GCsBqB,EAArB,SAAAiC,GADA,+C,0DAKEC,WAAqB,GACrB,EAAAC,SAAe,GACf,EAAAC,cAPF,EACA,qBAAAH,GAAA,kDAWI,GADAzE,KAAK0E,WAAaG,SAASC,KAAK1K,MAAM,GAClC4F,KAAK+E,UAAW,CAClB,IAAIC,EAAShF,KAAK0E,WAAWO,YAAY,KACzCjF,KAAK0E,WAAa1E,KAAK0E,WAAWtK,MAAM4K,EAAS,IAE9ChF,KAAK0E,YAAc1E,KAAKkF,OAASlF,KAAKkF,MAAMzD,OAAS,IACxDzB,KAAK0E,WAAa1E,KAAKkF,MAAM,GAAG7M,KAElC2H,KAAKmF,qBAlBT,gCAsBQC,OAAOC,sBACTrF,KAAKsF,iBAvBX,qCA+Bc,WACVtF,KAAK2E,SAAW,IAAIU,sBAAqB,SAACE,GACpCA,EAAQ,GAAGC,iBACT,EAAKd,aAAe,EAAKE,YAC3B,EAAKa,cAAc,EAAKf,YACxB,EAAKE,eAEL,EAAKa,cAAcF,EAAQ,GAAGG,OAAOC,OAGxC,CACDC,UAAW,MA1CjB,yCA8CkB,WACd5F,KAAKkF,MAAM5K,SAAQ,SAAAuL,GACjB,IAAIH,EAASI,SAASC,cAAT,WAA2BF,EAAKxN,MAC7CqN,GAAU,EAAKf,SAASqB,QAAQN,QAjDtC,oCAqDiBrN,GACb2H,KAAK0E,WAAarM,IAtDtB,oCAyDiBA,GACb2H,KAAKyF,cAAcpN,GACnB,YAAY2H,KAAK0E,cA3DrB,gCA4BI,OAAO1E,KAAKiG,OAAOC,QAAQ,cA5B/B,GAAqC,KAEnC,KADC,e,4BAQD,KADC,YAAM,U,yBAWN,MAnBkB,ICtBqbC,EDsBrb,EAAO,KAD3B,KACoB,G,wBEdjBC,EAAY,YACd,GHTW,WAAa,IAAIC,EAAIrG,KAASsG,EAAGD,EAAIE,eAAmBC,EAAGH,EAAII,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,oBAAoB,CAACF,EAAG,OAAO,CAACE,YAAY,kBAAkB,CAACL,EAAIM,GAAG,UAAUH,EAAG,MAAM,CAACE,YAAY,sBAAsB,CAACF,EAAG,KAAK,CAACE,YAAY,YAAYL,EAAIO,GAAIP,EAAS,OAAE,SAASR,GAAM,OAAOW,EAAG,KAAK,CAACnO,IAAIwN,EAAKxN,IAAIwO,MAAM,CAAC,gBAAiB,CAAC,OAAUR,EAAI3B,aAAemB,EAAKxN,MAAMyO,SAAS,CAAC,YAAcT,EAAIU,GAAGlB,EAAKmB,QAAQC,GAAG,CAAC,MAAQ,SAASC,GAAQ,OAAOb,EAAIc,cAActB,EAAKxN,YAAW,SAChf,IGUpB+O,EAEA,KACA,WACA,MAIa,UAAAhB,E,sECNf3J,EAAO7C,QAAU,CACf,OAZF,SAAgByN,GACd,MAAQ,OAASA,EAAO3M,SAAS,QAAS,EAAG,IAY7C,UATF,SAAoB2M,GAClB,MAAO,CACL,MAASA,EAAOC,aAAa,IAC7B,OAAUD,EAAOC,aAAa,Q,oCCDlC,IAAIC,EAAmB,CACrB,KAAQ,aACR,KAAQ,aACR,KAAQ,aACR,KAAQ,aACR,KAAQ,GACR,KAAQ,aACR,KAAQ,aACR,KAAQ,aACR,KAAQ,cAGNC,EAAM,CAAC,QAAY,SA2BvB,SAASC,EAAaJ,EAAQK,GAC5B,MAAO,CACL,OAAWL,EAAOM,aAAaD,GAC/B,MAAUL,EAAOM,aAAaD,EAAI,IAItC,SAASE,EAAgBP,EAAQK,GAE/B,GAAIA,EAAIL,EAAO5F,OACb,MAAM,IAAIlH,UAAU,uCAGtB,GAAkB,MAAd8M,EAAOK,GACT,MAAM,IAAInN,UAAU,uCA+BxBkC,EAAO7C,QAAU,CACf,OAxEF,SAAgByN,GACd,IAAIQ,EAAYR,EAAO3M,SAAS,MAAO,EAAG,GACtCoN,EAAaT,EAAO3M,SAAS,MAAO,EAAG,GAG3C,GAAI,SAAWmN,EACb,OAAM,EAKR,IAAIE,EAAMV,EAAO3M,SAAS,MAAO,EAAG,IAChCsN,EAAWF,GAAcP,EAAiBO,GAC9C,MAAiB,KAAbE,GACFC,QAAQC,KACNV,EAAI,GACJ,sEAEAA,EAAI,GACJ,2DAIIO,IAAQC,GAA6B,SAAfF,GAkD9B,UA7BF,SAAoBT,GAKlB,IAAIK,EAAGS,EACP,IAHAd,EAASA,EAAOjN,MAAM,GAGfiN,EAAO5F,QAAQ,CAUpB,GARAiG,EAAIL,EAAOM,aAAa,GAGxBC,EAAeP,EAAQK,GAKV,OADbS,EAAOd,EAAOK,EAAI,KACY,MAATS,EACnB,OAAOV,EAAYJ,EAAQK,EAAI,GAIjCL,EAASA,EAAOjN,MAAMsN,EAAI,GAG5B,MAAM,IAAInN,UAAU,iC,2DCpFtBkC,EAAO7C,QAAU,SAAkB8C,EAAOC,EAAWC,GACnD,IAAIiB,EAASuK,EAAWV,EAAGW,EAAGrL,EAAOlB,EAAKqB,EAAKL,EAAO0H,EACxB8D,EAA1BC,EAAW5L,EAAY,EACvB6L,EAAkB9L,EAAM+F,GAAGvC,MAAMW,MAAM4H,SAAS,aAGpD,GAAI/L,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAM5D,IAJAgL,EAAgB5L,EAAMgM,WACtBhM,EAAMgM,WAAa,YAGZH,EAAW3L,IAAYF,EAAMiM,QAAQJ,GAAWA,IAGrD,KAAI7L,EAAMW,OAAOkL,GAAY7L,EAAMY,UAAY,GAA/C,CAKA,GAAIZ,EAAMW,OAAOkL,IAAa7L,EAAMY,aAClCxB,EAAMY,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,KAC5CpL,EAAMT,EAAMU,OAAOmL,OAKF,MAFf/D,EAAS9H,EAAMb,IAAIP,WAAWQ,KAEW,KAAX0I,KAC5B1I,EAAMY,EAAMkM,UAAU9M,EAAK0I,IAC3B1I,EAAMY,EAAMmM,WAAW/M,KAEZqB,KAAK,CACdL,EAAoB,KAAX0H,EAAyB,EAAI,EACtC,MAOR,KAAI9H,EAAMW,OAAOkL,GAAY,GAA7B,CAIA,IADAH,KACKV,EAAI,EAAGW,EAAIG,EAAgB/G,OAAQiG,EAAIW,EAAGX,IAC7C,GAAIc,EAAgBd,GAAGhL,EAAO6L,EAAU3L,MAAgB,CACtDwL,KACA,MAGJ,GAAIA,EAAa,OAGnB,QAAKtL,IAKLe,EAAUnB,EAAMoM,SAASnM,EAAW4L,EAAU7L,EAAMY,WAAUA,GAAQf,OAEtEG,EAAMe,KAAO8K,EAAW,GAExBvL,EAAiBN,EAAMgB,KAAK,eAAgB,IAAM9E,OAAOkE,GAAQ,IAC3Da,OAAW/E,OAAOC,aAAa2L,GACrCxH,EAAMY,IAAW,CAAEjB,EAAWD,EAAMe,OAEpCT,EAAiBN,EAAMgB,KAAK,SAAU,GAAI,IACpCG,QAAWA,EACjBb,EAAMY,IAAW,CAAEjB,EAAWD,EAAMe,KAAO,GAC3CT,EAAMc,SAAW,IAEjBd,EAAiBN,EAAMgB,KAAK,gBAAiB,IAAM9E,OAAOkE,IAAS,IAC7Da,OAAW/E,OAAOC,aAAa2L,GAErC9H,EAAMgM,WAAaJ,Q,oCCzErB7L,EAAO7C,QAAU,CACfmG,QAAS,CACPgJ,MAAKA,EACLC,UAASA,EACTC,QAAOA,EACPC,WAAc,YACd7I,SAAQA,EAGR8I,aAAYA,EAOZC,OAAQ,OAQRC,UAAW,KAEXC,WAAc,IAGhB3I,WAAY,CAEVR,KAAM,CACJS,MAAO,CACL,YACA,QACA,WAIJV,MAAO,CACLU,MAAO,CACL,cAIJX,OAAQ,CACNW,MAAO,CACL,QAEFG,OAAQ,CACN,gBACA,qB,kCC9CRtE,EAAO7C,QAAU,SAAuB8C,GACtC,IAAI6M,EAAMC,EACN1M,EAAQ,EACRoF,EAASxF,EAAMwF,OACf/E,EAAMT,EAAMwF,OAAOT,OAEvB,IAAK8H,EAAOC,EAAO,EAAGD,EAAOpM,EAAKoM,IAG5BrH,EAAOqH,GAAMhG,QAAU,GAAGzG,IAC9BoF,EAAOqH,GAAMzM,MAAQA,EACjBoF,EAAOqH,GAAMhG,QAAU,GAAGzG,IAEJ,SAAtBoF,EAAOqH,GAAMlG,MACbkG,EAAO,EAAIpM,GACe,SAA1B+E,EAAOqH,EAAO,GAAGlG,KAGnBnB,EAAOqH,EAAO,GAAG1L,QAAUqE,EAAOqH,GAAM1L,QAAUqE,EAAOqH,EAAO,GAAG1L,SAE/D0L,IAASC,IAAQtH,EAAOsH,GAAQtH,EAAOqH,IAE3CC,KAIAD,IAASC,IACXtH,EAAOT,OAAS+H,K,oCCtCpB,uBAA0nB,G,oCCM1nB,IAAIC,EAAc,0IACdC,EAAc,sDAGlBjN,EAAO7C,QAAU,SAAkB8C,EAAOG,GACxC,IAAIiC,EAAK6K,EAAS3M,EAAOvD,EAAIkK,EAAOxG,EAChCrB,EAAMY,EAAMZ,IAEhB,GAAkC,KAA9BY,EAAMb,IAAIP,WAAWQ,GAAwB,OAAM,EAKvD,IAHA6H,EAAQjH,EAAMZ,IACdqB,EAAMT,EAAMkG,SAEH,CACP,KAAM9G,GAAOqB,EAAK,OAAM,EAIxB,GAAW,MAFX1D,EAAKiD,EAAMb,IAAIP,WAAWQ,IAED,OAAM,EAC/B,GAAW,KAAPrC,EAAqB,MAK3B,OAFAqF,EAAMpC,EAAMb,IAAIzB,MAAMuJ,EAAQ,EAAG7H,GAE7B4N,EAAYnO,KAAKuD,IACnB6K,EAAUjN,EAAM+F,GAAGzD,cAAcF,KAC5BpC,EAAM+F,GAAG5D,aAAa8K,KAEtB9M,KACHG,EAAgBN,EAAMgB,KAAK,YAAa,IAAK,IACvCkM,MAAU,CAAE,CAAE,OAAQD,IAC5B3M,EAAMW,OAAU,WAChBX,EAAM6M,KAAU,QAEhB7M,EAAgBN,EAAMgB,KAAK,OAAQ,GAAI,IACjCG,QAAUnB,EAAM+F,GAAGhD,kBAAkBX,IAE3C9B,EAAgBN,EAAMgB,KAAK,aAAc,KAAM,IACzCC,OAAU,WAChBX,EAAM6M,KAAU,QAGlBnN,EAAMZ,KAAOgD,EAAI2C,OAAS,SAIxBgI,EAASlO,KAAKuD,KAChB6K,EAAUjN,EAAM+F,GAAGzD,cAAc,UAAYF,KACxCpC,EAAM+F,GAAG5D,aAAa8K,KAEtB9M,KACHG,EAAgBN,EAAMgB,KAAK,YAAa,IAAK,IACvCkM,MAAU,CAAE,CAAE,OAAQD,IAC5B3M,EAAMW,OAAU,WAChBX,EAAM6M,KAAU,QAEhB7M,EAAgBN,EAAMgB,KAAK,OAAQ,GAAI,IACjCG,QAAUnB,EAAM+F,GAAGhD,kBAAkBX,IAE3C9B,EAAgBN,EAAMgB,KAAK,aAAc,KAAM,IACzCC,OAAU,WAChBX,EAAM6M,KAAU,QAGlBnN,EAAMZ,KAAOgD,EAAI2C,OAAS,S,oCClE9B,SAASqI,EAAgBjP,EAAKiB,EAAKqB,GACjC,IAAI9B,EACJsI,EAAQ7H,EACRsF,EAAS,CACP2I,IAAGA,EACHjO,IAAKA,EACLkO,MAAO,IAKT,IAFA3O,EAAOR,EAAIS,WAAWQ,GAEfA,EAAMqB,GAAQ9B,GAAQ,IAAgBA,GAAQ,IAA0B,KAATA,GACpEA,EAAOR,EAAIS,aAAaQ,GAO1B,OAJAsF,EAAO2I,MACP3I,EAAOtF,IAAMA,EACbsF,EAAO4I,MAAQnP,EAAIT,MAAMuJ,EAAO7H,GAEzBsF,EAGT3E,EAAO7C,QAAU,SAAwBiB,EAAKiB,EAAKqB,GACjD,IAAI9B,EACJ+F,EAAS,CACP2I,IAAGA,EACHjO,IAAK,EACLmO,MAAO,GACPC,OAAQ,IAGV,GAAIpO,GAAOqB,EAAO,OAAOiE,EAIzB,GAAa,MAFb/F,EAAOR,EAAIS,WAAWQ,IAEO,OAAOsF,EASpC,GAPAtF,IAOa,OADbT,EAAOR,EAAIS,WAAWQ,MACQT,EAAO,IAAQA,EAAQ,IACnD,OAAO+F,EAIT,IAAI+I,EAAUL,EAAgBjP,EAAKiB,EAAKqB,GAKxC,GAJArB,EAAMqO,EAAQrO,IAID,OADbT,EAAOR,EAAIS,WAAWQ,IACO,OAAOsF,EAKpC,IAAIgJ,EAAUN,EAAgBjP,IAH9BiB,EAGwCqB,GAOxC,OANArB,EAAMsO,EAAQtO,IAEdsF,EAAO6I,MAAQE,EAAQH,MACvB5I,EAAO8I,OAASE,EAAQJ,MACxB5I,EAAOtF,IAAMA,EACbsF,EAAO2I,MACA3I,I,gDCrET,IAAIiJ,EAAWjR,EAAQ,QACnBkR,EAAQlR,EAAQ,QAEpBA,EAAQ,OAARA,CAAyB,QAAQ,WAC/B,OAAO,SAAcmR,GACnB,OAAOD,EAAMD,EAASE,S,kCCH1B9N,EAAO7C,QAAU,SAAe8C,GAC9B,IAAIM,EAEAN,EAAM2F,aACRrF,EAAiB,IAAIN,EAAM6F,MAAM,SAAU,GAAI,IACzC1E,QAAWnB,EAAMb,IACvBmB,EAAMY,IAAW,CAAE,EAAG,GACtBZ,EAAMc,SAAW,GACjBpB,EAAMwF,OAAOxE,KAAKV,IAElBN,EAAM+F,GAAGvC,MAAMhB,MAAMxC,EAAMb,IAAKa,EAAM+F,GAAI/F,EAAMqF,IAAKrF,EAAMwF,U,oCCX/DzF,EAAO7C,QAAU,SAASyN,EAAQmD,EAAMC,EAAQC,GAI9C,OAHAD,EAASA,GAAU,EAENpD,EAAO,WAAamD,GADlBE,EAAc,KAAO,OAEtBpS,KAAK+O,EAAQoD,K,yDCF7B,IAAIxO,EAAU7C,EAAQ,QAAmB6C,QAGzCQ,EAAO7C,QAAU,SAAiB8C,EAAOG,GACvC,IAAI8N,EAAMxN,EAAKrB,EAAMY,EAAMZ,IAE3B,GAAkC,KAA9BY,EAAMb,IAAIP,WAAWQ,GAAyB,OAAM,EA2BxD,IAzBA6O,EAAOjO,EAAMmG,QAAQpB,OAAS,EAC9BtE,EAAMT,EAAMkG,OAMP/F,IACC8N,GAAQ,GAAwC,KAAnCjO,EAAMmG,QAAQvH,WAAWqP,GACpCA,GAAQ,GAA4C,KAAvCjO,EAAMmG,QAAQvH,WAAWqP,EAAO,IAC/CjO,EAAMmG,QAAUnG,EAAMmG,QAAQ9H,QAAQ,MAAO,IAC7C2B,EAAMgB,KAAK,YAAa,KAAM,KAE9BhB,EAAMmG,QAAUnG,EAAMmG,QAAQzI,MAAM,GAAI,GACxCsC,EAAMgB,KAAK,YAAa,KAAM,IAIhChB,EAAMgB,KAAK,YAAa,KAAM,IAIlC5B,IAGOA,EAAMqB,GAAOlB,EAAQS,EAAMb,IAAIP,WAAWQ,KAASA,IAG1D,OADAY,EAAMZ,IAAMA,O,oCClCdW,EAAO7C,QAAU,CACfmG,QAAS,CACPgJ,MAAKA,EACLC,UAASA,EACTC,QAAOA,EACPC,WAAc,YACd7I,SAAQA,EAGR8I,aAAYA,EAOZC,OAAQ,OAQRC,UAAW,KAEXC,WAAc,IAGhB3I,WAAY,CAEVR,KAAM,CACJS,MAAO,CACL,YACA,QACA,WAIJV,MAAO,CACLU,MAAO,CACL,aACA,OACA,QACA,UACA,KACA,aACA,WACA,OACA,YACA,cAIJX,OAAQ,CACNW,MAAO,CACL,WACA,YACA,WACA,SACA,SACA,cACA,QACA,OACA,UACA,QAEFG,OAAQ,CACN,gBACA,WACA,qB,oCCtERtE,EAAO7C,QAAU,SAAmB8C,EAAOC,GACzC,IAAIkB,EAASuK,EAAWV,EAAGW,EAAGrL,EAAOsL,EACjCC,EAAW5L,EAAY,EACvB6L,EAAkB9L,EAAM+F,GAAGvC,MAAMW,MAAM4H,SAAS,aAChD7L,EAAUF,EAAMkO,QAMpB,IAJAtC,EAAgB5L,EAAMgM,WACtBhM,EAAMgM,WAAa,YAGZH,EAAW3L,IAAYF,EAAMiM,QAAQJ,GAAWA,IAGrD,KAAI7L,EAAMW,OAAOkL,GAAY7L,EAAMY,UAAY,GAG3CZ,EAAMW,OAAOkL,GAAY,GAA7B,CAIA,IADAH,KACKV,EAAI,EAAGW,EAAIG,EAAgB/G,OAAQiG,EAAIW,EAAGX,IAC7C,GAAIc,EAAgBd,GAAGhL,EAAO6L,EAAU3L,MAAgB,CACtDwL,KACA,MAGJ,GAAIA,EAAa,MAmBnB,OAhBAvK,EAAUnB,EAAMoM,SAASnM,EAAW4L,EAAU7L,EAAMY,WAAUA,GAAQf,OAEtEG,EAAMe,KAAO8K,GAEbvL,EAAiBN,EAAMgB,KAAK,iBAAkB,IAAK,IAC7CE,IAAW,CAAEjB,EAAWD,EAAMe,OAEpCT,EAAiBN,EAAMgB,KAAK,SAAU,GAAI,IACpCG,QAAWA,EACjBb,EAAMY,IAAW,CAAEjB,EAAWD,EAAMe,MACpCT,EAAMc,SAAW,GAEjBd,EAAiBN,EAAMgB,KAAK,kBAAmB,KAAM,GAErDhB,EAAMgM,WAAaJ,O,kCCzBrB,SAASuC,IAUP7K,KAAK8K,UAAY,GAOjB9K,KAAK+K,UAAY,KASnBF,EAAM5S,UAAU+S,SAAW,SAAU5P,GACnC,IAAK,IAAIsM,EAAI,EAAGA,EAAI1H,KAAK8K,UAAUrJ,OAAQiG,IACzC,GAAI1H,KAAK8K,UAAUpD,GAAGtM,OAASA,EAC7B,OAAOsM,EAGX,OAAQ,GAMVmD,EAAM5S,UAAUgT,YAAc,WAC5B,IAAIxK,EAAOT,KACPkL,EAAS,CAAE,IAGfzK,EAAKqK,UAAUxQ,SAAQ,SAAU6Q,GAC1BA,EAAKC,SAEVD,EAAKE,IAAI/Q,SAAQ,SAAUgR,GACrBJ,EAAOpQ,QAAQwQ,GAAW,GAC5BJ,EAAOxN,KAAK4N,SAKlB7K,EAAKsK,UAAY,GAEjBG,EAAO5Q,SAAQ,SAAUgH,GACvBb,EAAKsK,UAAUzJ,GAAS,GACxBb,EAAKqK,UAAUxQ,SAAQ,SAAU6Q,GAC1BA,EAAKC,UAEN9J,GAAS6J,EAAKE,IAAIvQ,QAAQwG,GAAS,GAEvCb,EAAKsK,UAAUzJ,GAAO5D,KAAKyN,EAAKI,YA+BtCV,EAAM5S,UAAUuT,GAAK,SAAUpQ,EAAMmQ,EAAIxL,GACvC,IAAI0L,EAAQzL,KAAKgL,SAAS5P,GACtBsQ,EAAM3L,GAAW,GAErB,IAAe,IAAX0L,EAAgB,MAAM,IAAI/K,MAAM,0BAA4BtF,GAEhE4E,KAAK8K,UAAUW,GAAOF,GAAKA,EAC3BvL,KAAK8K,UAAUW,GAAOJ,IAAMK,EAAIL,KAAO,GACvCrL,KAAK+K,UAAY,MA4BnBF,EAAM5S,UAAU0T,OAAS,SAAUC,EAAYC,EAAUN,EAAIxL,GAC3D,IAAI0L,EAAQzL,KAAKgL,SAASY,GACtBF,EAAM3L,GAAW,GAErB,IAAe,IAAX0L,EAAgB,MAAM,IAAI/K,MAAM,0BAA4BkL,GAEhE5L,KAAK8K,UAAUgB,OAAOL,EAAO,EAAG,CAC9BrQ,KAAMyQ,EACNT,SAAQA,EACRG,GAAIA,EACJF,IAAKK,EAAIL,KAAO,KAGlBrL,KAAK+K,UAAY,MA4BnBF,EAAM5S,UAAU8T,MAAQ,SAAUC,EAAWH,EAAUN,EAAIxL,GACzD,IAAI0L,EAAQzL,KAAKgL,SAASgB,GACtBN,EAAM3L,GAAW,GAErB,IAAe,IAAX0L,EAAgB,MAAM,IAAI/K,MAAM,0BAA4BsL,GAEhEhM,KAAK8K,UAAUgB,OAAOL,EAAQ,EAAG,EAAG,CAClCrQ,KAAMyQ,EACNT,SAAQA,EACRG,GAAIA,EACJF,IAAKK,EAAIL,KAAO,KAGlBrL,KAAK+K,UAAY,MA0BnBF,EAAM5S,UAAUyF,KAAO,SAAUmO,EAAUN,EAAIxL,GAC7C,IAAI2L,EAAM3L,GAAW,GAErBC,KAAK8K,UAAUpN,KAAK,CAClBtC,KAAMyQ,EACNT,SAAQA,EACRG,GAAIA,EACJF,IAAKK,EAAIL,KAAO,KAGlBrL,KAAK+K,UAAY,MAgBnBF,EAAM5S,UAAUgJ,OAAS,SAAUC,EAAMC,GAClChH,MAAMkH,QAAQH,KAASA,EAAO,CAAEA,IAErC,IAAIE,EAAS,GAeb,OAZAF,EAAK5G,SAAQ,SAAUc,GACrB,IAAI6Q,EAAMjM,KAAKgL,SAAS5P,GAExB,GAAI6Q,EAAM,EAAG,CACX,GAAI9K,EAAiB,OACrB,MAAM,IAAIT,MAAM,oCAAsCtF,GAExD4E,KAAK8K,UAAUmB,GAAKb,WACpBhK,EAAO1D,KAAKtC,KACX4E,MAEHA,KAAK+K,UAAY,KACV3J,GAcTyJ,EAAM5S,UAAU6I,WAAa,SAAUI,EAAMC,GACtChH,MAAMkH,QAAQH,KAASA,EAAO,CAAEA,IAErClB,KAAK8K,UAAUxQ,SAAQ,SAAU6Q,GAAQA,EAAKC,cAE9CpL,KAAKiB,OAAOC,EAAMC,IAgBpB0J,EAAM5S,UAAUyJ,QAAU,SAAUR,EAAMC,GACnChH,MAAMkH,QAAQH,KAASA,EAAO,CAAEA,IAErC,IAAIE,EAAS,GAeb,OAZAF,EAAK5G,SAAQ,SAAUc,GACrB,IAAI6Q,EAAMjM,KAAKgL,SAAS5P,GAExB,GAAI6Q,EAAM,EAAG,CACX,GAAI9K,EAAiB,OACrB,MAAM,IAAIT,MAAM,oCAAsCtF,GAExD4E,KAAK8K,UAAUmB,GAAKb,WACpBhK,EAAO1D,KAAKtC,KACX4E,MAEHA,KAAK+K,UAAY,KACV3J,GAaTyJ,EAAM5S,UAAUwQ,SAAW,SAAUyD,GAMnC,OALuB,OAAnBlM,KAAK+K,WACP/K,KAAKiL,cAIAjL,KAAK+K,UAAUmB,IAAc,IAGtCzP,EAAO7C,QAAUiR,G,oCC1VjBpO,EAAO7C,QAAU,SAAkB8C,EAAOG,GACxC,IAAI8G,EAAOxG,EAAKqH,EAAQxH,EAAOmP,EAAYC,EAAUC,EAAcC,EAC/DxQ,EAAMY,EAAMZ,IAGhB,GAAW,KAFFY,EAAMb,IAAIP,WAAWQ,GAEJ,OAAM,EAOhC,IALA6H,EAAQ7H,EACRA,IACAqB,EAAMT,EAAMkG,OAGL9G,EAAMqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,IAAwBA,IAKjE,GAFAuQ,GADA7H,EAAS9H,EAAMb,IAAIzB,MAAMuJ,EAAO7H,IACV2F,OAElB/E,EAAMyG,mBAAqBzG,EAAMwG,UAAUmJ,IAAiB,IAAM1I,EAGpE,OAFK9G,IAAQH,EAAMmG,SAAW2B,GAC9B9H,EAAMZ,KAAOuQ,KAOf,IAHAF,EAAaC,EAAWtQ,GAGoC,KAApDqQ,EAAazP,EAAMb,IAAIf,QAAQ,IAAKsR,KAAmB,CAI7D,IAHAA,EAAWD,EAAa,EAGjBC,EAAWjP,GAA0C,KAAnCT,EAAMb,IAAIP,WAAW8Q,IAA6BA,IAI3E,IAFAE,EAAeF,EAAWD,KAELE,EAUnB,OARKxP,KACHG,EAAYN,EAAMgB,KAAK,cAAe,OAAQ,IACxCC,OAAU6G,EAChBxH,EAAMa,QAAUnB,EAAMb,IAAIzB,MAAM0B,EAAKqQ,GAClCpR,QAAQ,MAAO,KACfA,QAAQ,WAAY,OAEzB2B,EAAMZ,IAAMsQ,KAKd1P,EAAMwG,UAAUoJ,GAAgBH,EAQlC,OAJAzP,EAAMyG,oBAEDtG,IAAQH,EAAMmG,SAAW2B,GAC9B9H,EAAMZ,KAAOuQ,O,oCCxDf,IAAIpQ,EAAU7C,EAAQ,QAAmB6C,QAKzC,SAASsQ,EAAqB7P,EAAOC,GACnC,IAAI6H,EAAQ1I,EAAKqB,EAAK1D,EAOtB,OALAqC,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GAIJ,MAFf6H,EAAS9H,EAAMb,IAAIP,WAAWQ,OAGf,KAAX0I,GACW,KAAXA,GAIA1I,EAAMqB,IACR1D,EAAKiD,EAAMb,IAAIP,WAAWQ,IAErBG,EAAQxC,KANL,EAYHqC,EAKT,SAAS0Q,EAAsB9P,EAAOC,GACpC,IAAIlD,EACAkK,EAAQjH,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC/Cb,EAAM6H,EACNxG,EAAMT,EAAMU,OAAOT,GAGvB,GAAIb,EAAM,GAAKqB,EAAO,OAAQ,EAI9B,IAFA1D,EAAKiD,EAAMb,IAAIP,WAAWQ,MAEjB,IAAerC,EAAK,GAAe,OAAQ,EAEpD,OAAS,CAEP,GAAIqC,GAAOqB,EAAO,OAAQ,EAI1B,MAFA1D,EAAKiD,EAAMb,IAAIP,WAAWQ,OAEhB,IAAerC,GAAM,IAA/B,CAUA,GAAW,KAAPA,GAA6B,KAAPA,EACxB,MAGF,OAAQ,EAVN,GAAIqC,EAAM6H,GAAS,GAAM,OAAQ,EAcrC,OAAI7H,EAAMqB,IACR1D,EAAKiD,EAAMb,IAAIP,WAAWQ,IAErBG,EAAQxC,KAEH,EAGLqC,EAiBTW,EAAO7C,QAAU,SAAc8C,EAAOC,EAAWC,EAASC,GACxD,IAAIpD,EACAgT,EACA/E,EACAgF,EACAC,EACAC,EACAC,EACAC,EACAzE,EACA0E,EACAC,EACAC,EACAC,EACA/P,EACAoL,EACAkC,EACA0C,EACA7E,EACA8E,EACAC,EACAC,EACAxR,EACAyR,EACAC,EACA7J,EACAyE,EACAI,EACAxL,EACAyQ,KACAC,KAGJ,GAAIhR,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAQ5D,GAAIZ,EAAMiR,YAAc,GACpBjR,EAAMW,OAAOV,GAAaD,EAAMiR,YAAc,GAC9CjR,EAAMW,OAAOV,GAAaD,EAAMY,UAClC,OAAM,EAiBR,GAZIT,GAA+B,cAArBH,EAAMgM,YAMdhM,EAAMQ,OAAOP,IAAcD,EAAMY,YACnCmQ,OAKCF,EAAiBf,EAAsB9P,EAAOC,KAAe,GAOhE,GANAkQ,KACAlJ,EAAQjH,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC/CuQ,EAAcU,OAAOlR,EAAMb,IAAIzB,MAAMuJ,EAAO4J,EAAiB,IAIzDE,GAA0C,IAAhBP,EAAmB,OAAM,MAElD,OAAKK,EAAiBhB,EAAqB7P,EAAOC,KAAe,GAItE,OAAM,EAHNkQ,KAQF,GAAIY,GACE/Q,EAAMmM,WAAW0E,IAAmB7Q,EAAMU,OAAOT,GAAY,OAAM,EAOzE,GAHAsQ,EAAiBvQ,EAAMb,IAAIP,WAAWiS,EAAiB,GAGnD1Q,EAAU,OAAM,EA6BpB,IA1BAmQ,EAAatQ,EAAMwF,OAAOT,OAEtBoL,GACF7P,EAAcN,EAAMgB,KAAK,oBAAqB,KAAM,GAChC,IAAhBwP,IACFlQ,EAAM4M,MAAQ,CAAE,CAAE,QAASsD,MAI7BlQ,EAAcN,EAAMgB,KAAK,mBAAoB,KAAM,GAGrDV,EAAMY,IAASmP,EAAY,CAAEpQ,EAAW,GACxCK,EAAMW,OAAS/E,OAAOC,aAAaoU,GAMnC1E,EAAW5L,EACX6Q,KACAhF,EAAkB9L,EAAM+F,GAAGvC,MAAMW,MAAM4H,SAAS,QAEhDH,EAAgB5L,EAAMgM,WACtBhM,EAAMgM,WAAa,OAEZH,EAAW3L,GAAS,CAMzB,IALAd,EAAMyR,EACNpQ,EAAMT,EAAMU,OAAOmL,GAEnBqE,EAAUnC,EAAS/N,EAAMW,OAAOkL,GAAYgF,GAAkB7Q,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,IAE9Fb,EAAMqB,GAAK,CAGhB,GAAW,KAFX1D,EAAKiD,EAAMb,IAAIP,WAAWQ,IAGxB2O,GAAU,GAAKA,EAAS/N,EAAMmR,QAAQtF,IAAa,MAC9C,IAAW,KAAP9O,EAGT,MAFAgR,IAKF3O,IA+EF,IAxEE6Q,GAJFF,EAAe3Q,IAEKqB,EAEE,EAEAsN,EAASmC,GAKP,IAAKD,EAAoB,GAIjDD,EAASE,EAAUD,GAGnB3P,EAAeN,EAAMgB,KAAK,iBAAkB,KAAM,IAC5CC,OAAS/E,OAAOC,aAAaoU,GACnCjQ,EAAMY,IAASkP,EAAY,CAAEnQ,EAAW,GACpCkQ,IACF7P,EAAM6M,KAAOnN,EAAMb,IAAIzB,MAAMuJ,EAAO4J,EAAiB,IAIvDD,EAAW5Q,EAAMgR,MACjBL,EAAY3Q,EAAMQ,OAAOP,GACzByQ,EAAY1Q,EAAMW,OAAOV,GAMzBwQ,EAAgBzQ,EAAMiR,WACtBjR,EAAMiR,WAAajR,EAAMY,UACzBZ,EAAMY,UAAYoP,EAElBhQ,EAAMgR,SACNhR,EAAMQ,OAAOP,GAAa8P,EAAe/P,EAAMO,OAAON,GACtDD,EAAMW,OAAOV,GAAa8N,EAEtBgC,GAAgBtP,GAAOT,EAAMiM,QAAQhM,EAAY,GAQnDD,EAAMe,KAAOqQ,KAAKC,IAAIrR,EAAMe,KAAO,EAAGb,GAEtCF,EAAM+F,GAAGvC,MAAM8N,SAAStR,EAAOC,EAAWC,MAIvCF,EAAMgR,QAASF,IAClBE,MAIFF,EAAgB9Q,EAAMe,KAAOd,EAAa,GAAKD,EAAMiM,QAAQjM,EAAMe,KAAO,GAE1Ef,EAAMY,UAAYZ,EAAMiR,WACxBjR,EAAMiR,WAAaR,EACnBzQ,EAAMQ,OAAOP,GAAa0Q,EAC1B3Q,EAAMW,OAAOV,GAAayQ,EAC1B1Q,EAAMgR,MAAQJ,GAEdtQ,EAAeN,EAAMgB,KAAK,kBAAmB,MAAO,IAC9CC,OAAS/E,OAAOC,aAAaoU,GAEnC1E,EAAW5L,EAAYD,EAAMe,KAC7BqP,EAAU,GAAKvE,EACfkE,EAAe/P,EAAMO,OAAON,GAExB4L,GAAY3L,EAAW,MAK3B,GAAIF,EAAMW,OAAOkL,GAAY7L,EAAMY,UAAa,MAGhD,GAAIZ,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,MAItD,IADA8K,KACKV,EAAI,EAAGW,EAAIG,EAAgB/G,OAAQiG,EAAIW,EAAGX,IAC7C,GAAIc,EAAgBd,GAAGhL,EAAO6L,EAAU3L,MAAgB,CACtDwL,KACA,MAGJ,GAAIA,EAAa,MAGjB,GAAIyE,EAAW,CAEb,IADAU,EAAiBf,EAAsB9P,EAAO6L,IACzB,EAAK,MAC1B5E,EAAQjH,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,QAG9C,IADAgF,EAAiBhB,EAAqB7P,EAAO6L,IACxB,EAAK,MAG5B,GAAI0E,IAAmBvQ,EAAMb,IAAIP,WAAWiS,EAAiB,GAAM,MAqBrE,OAhBEvQ,EADE6P,EACMnQ,EAAMgB,KAAK,qBAAsB,MAAO,GAExChB,EAAMgB,KAAK,oBAAqB,MAAO,IAE3CC,OAAS/E,OAAOC,aAAaoU,GAEnCF,EAAU,GAAKxE,EACf7L,EAAMe,KAAO8K,EAEb7L,EAAMgM,WAAaJ,EAGfoF,GAjRN,SAA6BhR,EAAOuP,GAClC,IAAIvE,EAAGW,EACHvL,EAAQJ,EAAMI,MAAQ,EAE1B,IAAK4K,EAAIuE,EAAM,EAAG5D,EAAI3L,EAAMwF,OAAOT,OAAS,EAAGiG,EAAIW,EAAGX,IAChDhL,EAAMwF,OAAOwF,GAAG5K,QAAUA,GAAkC,mBAAzBJ,EAAMwF,OAAOwF,GAAGrE,OACrD3G,EAAMwF,OAAOwF,EAAI,GAAGuG,UACpBvR,EAAMwF,OAAOwF,GAAGuG,UAChBvG,GAAK,GA0QPwG,CAAoBxR,EAAOsQ,Q,oCCpW/BvQ,EAAO7C,QAAU,SAAoB6I,GAiDnC,SAAS0L,EAAYzR,EAAOsG,GAC1B,IAAI0E,EAAG0G,EACHC,EACAC,EACAtR,EACAuR,EAAc,GACdpR,EAAM6F,EAAWvB,OAErB,IAAKiG,EAAI,EAAGA,EAAIvK,EAAKuK,IAGO,MAF1B2G,EAAarL,EAAW0E,IAETlD,SAIS,IAApB6J,EAAWG,MAIfF,EAAWtL,EAAWqL,EAAWG,MAEjCxR,EAAgBN,EAAMwF,OAAOmM,EAAWrR,QAClCqG,KAAU,YAChBrG,EAAMsG,IAAU,OAChBtG,EAAMuG,QAAU,EAChBvG,EAAMW,OAAU,KAChBX,EAAMa,QAAU,IAEhBb,EAAgBN,EAAMwF,OAAOoM,EAAStR,QAChCqG,KAAU,aAChBrG,EAAMsG,IAAU,OAChBtG,EAAMuG,SAAW,EACjBvG,EAAMW,OAAU,KAChBX,EAAMa,QAAU,GAE8B,SAA1CnB,EAAMwF,OAAOoM,EAAStR,MAAQ,GAAGqG,MACY,MAA7C3G,EAAMwF,OAAOoM,EAAStR,MAAQ,GAAGa,SAEnC0Q,EAAY7Q,KAAK4Q,EAAStR,MAAQ,IAUtC,KAAOuR,EAAY9M,QAAQ,CAIzB,IAFA2M,GADA1G,EAAI6G,EAAY9K,OACR,EAED2K,EAAI1R,EAAMwF,OAAOT,QAAmC,eAAzB/E,EAAMwF,OAAOkM,GAAG/K,MAChD+K,IAKE1G,MAFJ0G,IAGEpR,EAAQN,EAAMwF,OAAOkM,GACrB1R,EAAMwF,OAAOkM,GAAK1R,EAAMwF,OAAOwF,GAC/BhL,EAAMwF,OAAOwF,GAAK1K,IAKxByF,EAAGxC,OAAOY,MAAM8K,OAAO,WAAY,QAhHnC,SAAkBjP,EAAOG,GACvB,IAAI6K,EAAG+G,EAAgBC,EAAKjV,EACxBkK,EAAQjH,EAAMZ,IACd0I,EAAS9H,EAAMb,IAAIP,WAAWqI,GAElC,GAAI9G,EAAU,OAAM,EAEpB,GAAe,KAAX2H,EAA0B,OAAM,EAMpC,GAHAkK,GADAD,EAAU/R,EAAMgH,WAAWhH,EAAMZ,KAAIA,IACvB2F,OACdhI,EAAKb,OAAOC,aAAa2L,GAErBkK,EAAM,EAAK,OAAM,EAQrB,IANIA,EAAM,IACQhS,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUpE,EAChBiV,KAGGhH,EAAI,EAAGA,EAAIgH,EAAKhH,GAAK,EACRhL,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUpE,EAAKA,GAEhBgV,EAAQzK,UAAayK,EAAQxK,YAElCvH,EAAMsG,WAAWtF,KAAK,CACpB8G,OAAQA,EACR/C,OAAQ,EACRkN,KAAQjH,EAAI,EACZ1K,MAAQN,EAAMwF,OAAOT,OAAS,EAC9B+M,KAAS,EACTI,KAAQH,EAAQzK,SAChB6K,MAAQJ,EAAQxK,YAMpB,OAFAvH,EAAMZ,KAAO2S,EAAQhN,aA2EvBgB,EAAGxC,OAAOe,OAAO2K,OAAO,WAAY,QAAQ,SAAUjP,GACpD,IAAI6M,EACA5G,EAAcjG,EAAMiG,YACpBxF,GAAOT,EAAMiG,aAAe,IAAIlB,OAIpC,IAFA0M,EAAYzR,EAAOA,EAAMsG,YAEpBuG,EAAO,EAAGA,EAAOpM,EAAKoM,IACrB5G,EAAY4G,IAAS5G,EAAY4G,GAAMvG,YACzCmL,EAAYzR,EAAOiG,EAAY4G,GAAMvG,iB,oCC1H7C,IAAI8L,EAAe,YACfC,EAAe,MAGnBtS,EAAO7C,QAAU,SAAmB8C,GAClC,IAAI7B,EAMJA,GAHAA,EAAM6B,EAAMb,IAAId,QAAQ+T,EAAa,OAG3B/T,QAAQgU,EAAS,KAE3BrS,EAAMb,IAAMhB,I,oCCXd,IAAIgQ,EAAkBzR,EAAQ,QAM1B4V,EAAS,CACX,CAAE,OAAmB5V,EAAQ,SAC7B,CAAE,UAAmBA,EAAQ,SAC7B,CAAE,SAAmBA,EAAQ,SAC7B,CAAE,YAAmBA,EAAQ,SAC7B,CAAE,gBAAmBA,EAAQ,QAAgC4U,UAC7D,CAAE,WAAmB5U,EAAQ,QAA2B4U,UACxD,CAAE,OAAmB5U,EAAQ,SAC7B,CAAE,QAAmBA,EAAQ,SAC7B,CAAE,WAAmBA,EAAQ,SAC7B,CAAE,cAAmBA,EAAQ,SAC7B,CAAE,SAAmBA,EAAQ,UAG3B6V,EAAU,CACZ,CAAE,gBAAmB7V,EAAQ,SAC7B,CAAE,gBAAmBA,EAAQ,QAAgC+U,aAC7D,CAAE,WAAmB/U,EAAQ,QAA2B+U,aACxD,CAAE,gBAAmB/U,EAAQ,UAO/B,SAASgF,IACP,IAAIsJ,EASJ,IAFA1H,KAAKa,MAAQ,IAAIgK,EAEZnD,EAAI,EAAGA,EAAIsH,EAAOvN,OAAQiG,IAC7B1H,KAAKa,MAAMnD,KAAKsR,EAAOtH,GAAG,GAAIsH,EAAOtH,GAAG,IAW1C,IAFA1H,KAAKgB,OAAS,IAAI6J,EAEbnD,EAAI,EAAGA,EAAIuH,EAAQxN,OAAQiG,IAC9B1H,KAAKgB,OAAOtD,KAAKuR,EAAQvH,GAAG,GAAIuH,EAAQvH,GAAG,IAQ/CtJ,EAAanG,UAAUiX,UAAY,SAAUxS,GAC3C,IAAIqN,EAAIrC,EAAG5L,EAAMY,EAAMZ,IACnB8E,EAAQZ,KAAKa,MAAM4H,SAAS,IAC5BiG,EAAM9N,EAAMa,OACZ6H,EAAa5M,EAAM+F,GAAG1C,QAAQuJ,WAC9BvG,EAAQrG,EAAMqG,MAGlB,QAA0B,IAAfA,EAAMjH,GAAjB,CAKA,GAAIY,EAAMI,MAAQwM,EAChB,IAAK5B,EAAI,EAAGA,EAAIgH,IAKdhS,EAAMI,QACNiN,EAAKnJ,EAAM8G,GAAGhL,MACdA,EAAMI,SAEFiN,GATerC,UAuBrBhL,EAAMZ,IAAMY,EAAMkG,OAGfmH,GAAMrN,EAAMZ,MACjBiH,EAAMjH,GAAOY,EAAMZ,SAhCjBY,EAAMZ,IAAMiH,EAAMjH,IAsCtBsC,EAAanG,UAAU+V,SAAW,SAAUtR,GAO1C,IANA,IAAIqN,EAAIrC,EACJ9G,EAAQZ,KAAKa,MAAM4H,SAAS,IAC5BiG,EAAM9N,EAAMa,OACZ+M,EAAM9R,EAAMkG,OACZ0G,EAAa5M,EAAM+F,GAAG1C,QAAQuJ,WAE3B5M,EAAMZ,IAAM0S,GAAK,CAQtB,GAAI9R,EAAMI,MAAQwM,EAChB,IAAK5B,EAAI,EAAGA,EAAIgH,KACd3E,EAAKnJ,EAAM8G,GAAGhL,OADKgL,KAMvB,GAAIqC,GACF,GAAIrN,EAAMZ,KAAO0S,EAAO,WAI1B9R,EAAMmG,SAAWnG,EAAMb,IAAIa,EAAMZ,OAG/BY,EAAMmG,SACRnG,EAAM0G,eAUVhF,EAAanG,UAAUiH,MAAQ,SAAUrE,EAAK4H,EAAIV,EAAKW,GACrD,IAAIgF,EAAG9G,EAAO8N,EACVhS,EAAQ,IAAIsD,KAAKgC,MAAMnH,EAAK4H,EAAIV,EAAKW,GAOzC,IALA1C,KAAKgO,SAAStR,GAGdgS,GADA9N,EAAQZ,KAAKgB,OAAOyH,SAAS,KACjBhH,OAEPiG,EAAI,EAAGA,EAAIgH,EAAKhH,IACnB9G,EAAM8G,GAAGhL,IAKb0B,EAAanG,UAAU+J,MAAQ5I,EAAQ,QAGvCqD,EAAO7C,QAAUwE,G,uBC9Kb3B,EAAO7C,QAIF,WACP,SAASuV,EAAMzS,EAAOG,GACpB,IAAIuS,EAAe1S,EAAMZ,IACzB,GAA2C,KAAvCY,EAAMb,IAAIP,WAAW8T,GACvB,OAAM,EAER,IAKI/L,EAAMgM,EAAWC,EALjBrU,EAAQyB,EAAMb,IAAIzB,QAAQgV,GAAcnU,MAAM,mCAClD,IAAKA,EACH,OAAM,EAERmU,GAAgBnU,EAAM,GAAGwG,OAER,QAAbxG,EAAM,IACRoI,EAAO,eACPgM,EAAY,SACU,QAAbpU,EAAM,IACfoI,EAAO,cACPgM,EAAY,SACHpU,EAAM,KACfoI,EAAO,OACPgM,EAAY,SAAWpU,EAAM,GAAK,IAClCqU,MAEF,IAAIC,EAAe7S,EAAMb,IAAIf,QAAQuU,EAAWD,GAChD,IAAsB,IAAlBG,EACF,OAAM,EAER,IAAIC,EAAUD,EAAeF,EAAU5N,OAQvC,OAPK5E,IACSH,EAAMgB,KAAK2F,EAAM,GAAI,GAC3BxF,QAAUyR,EACZ5S,EAAMb,IAAIzB,MAAMsC,EAAMZ,IAAK0T,GAC3B9S,EAAMb,IAAIzB,MAAMgV,EAAcG,IAEpC7S,EAAMZ,IAAM0T,KAId,SAASC,EAAS/S,EAAOG,GACvB,IAAIuS,EAAe1S,EAAMZ,IACzB,GAA2C,KAAvCY,EAAMb,IAAIP,WAAW8T,GACvB,OAAM,EAIR,IAAIC,EAAY,IACZK,EAAmBhT,EAAMb,IAAIP,aAAa8T,GAC9C,GAAyB,KAArBM,GAEF,GADAL,EAAY,KACiC,KAAzC3S,EAAMb,IAAIP,aAAa8T,GAEzB,OAAM,OAIR,GAAyB,KAArBM,GAA8D,IAArBA,GAA2D,KAArBA,EACjF,OAAM,EAGV,IAAIH,EAAe7S,EAAMb,IAAIf,QAAQuU,EAAWD,GAChD,IAAsB,IAAlBG,EACF,OAAM,EAER,GAA+C,KAA3C7S,EAAMb,IAAIP,WAAWiU,EAAe,GACtC,OAAM,EAER,IAAIC,EAAUD,EAAeF,EAAU5N,OACvC,GAAyB,IAArB4N,EAAU5N,OAAc,CAE1B,IAAIkO,EAAkBjT,EAAMb,IAAIP,WAAWiU,EAAe,GAC1D,GAAwB,KAApBI,GAA4D,IAApBA,GAAyD,KAApBA,EAC/E,OAAM,EAGR,IAAIC,EAASlT,EAAMb,IAAIP,WAAWkU,GAClC,GAAII,GAAU,IAAQA,EAAS,GAC7B,OAAM,EASV,OALK/S,IACSH,EAAMgB,KAA0B,IAArB2R,EAAU5N,OAAe,cAAgB,eAAgB,GAAI,GAC9E5D,QAAUnB,EAAMb,IAAIzB,MAAMgV,EAAcG,IAEhD7S,EAAMZ,IAAM0T,KAiBd,IAAIK,EAAU,CACZ,KAAQ,OACR,YAAe,aACf,aAAgB,eAGlB,OAAO,SAAU9P,GAWf,OAFAA,EAxBF,SAAiBA,EAAS+P,GACxB,OAAO9X,OAAOwC,KAAKsV,GAAUC,QAAO,SAAU3O,EAAQ/I,GAIpD,YAAO,IAHH+I,EAAO/I,KACT+I,EAAO/I,GAAOyX,EAASzX,IAElB+I,IACNrB,GAkBOiQ,CAAOjQ,GAAW,GARb,CACbkQ,WAAY,GACZC,UAAW,GACXC,iBAAkB,MAClBC,gBAAiB,MACjBC,kBAAmB,MACnBC,iBAAkB,QAIb,SAAU7N,GACfA,EAAGxC,OAAOY,MAAM8K,OAAO,SAAU,OAAQwD,GACzC1M,EAAGxC,OAAOY,MAAMnD,KAAK,UAAW+R,GAEhCzX,OAAOwC,KAAKqV,GAASvV,SAAQ,SAAUjC,GACrC,IAAIsT,EAAS5L,EAAQ,SAAW8P,EAAQxX,IACpC0T,EAAQhM,EAAQ,QAAU8P,EAAQxX,IACtCoK,EAAGrC,SAASQ,MAAMvI,GAAO,SAAU6J,EAAQ+J,GACzC,OAAON,EAtCf,SAAqB5C,GACnB,OAAOA,EAAKhO,QAAQ,KAAM,SAASA,QAAQ,KAAM,QAAQA,QAAQ,UAAW,KAqCtDY,CAAWuG,EAAO+J,GAAKpO,SAAWkO,QAlIvCwE,I,oCCWrB9T,EAAO7C,QAAU,CACf,OAZF,SAAgByN,GACd,MAAQ,SAAWA,EAAO3M,SAAS,QAAS,EAAG,IAY/C,UATF,SAAoB2M,GAClB,MAAO,CACL,MAASA,EAAOmJ,aAAa,IAC7B,OAAUnJ,EAAOmJ,aAAa,Q,oCCLlC5W,EAAQ6W,eAAuBrX,EAAQ,QACvCQ,EAAQ8W,qBAAuBtX,EAAQ,QACvCQ,EAAQ+W,eAAuBvX,EAAQ,S,kCCFvC,IAUIwX,EAAc,kIAEdC,EAAc,mCAMdC,EAAc,IAAI9X,OAAO,OAAS4X,EAAW,IAAMC,EAA1B,4HAEzBE,EAAyB,IAAI/X,OAAO,OAAS4X,EAAW,IAAMC,EAAY,KAE9EpU,EAAO7C,QAAQkX,YAAcA,EAC7BrU,EAAO7C,QAAQmX,uBAAyBA,G,oCCvBxC,IAAI5X,EAAoBC,EAAQ,QAC5BjB,EAAoBiB,EAAQ,QAAmBjB,IAC/CI,EAAoBa,EAAQ,QAAmBb,kBAC/CE,EAAoBW,EAAQ,QAAmBX,cAG/CuY,EAAa,uCACbC,EAAa,4BAGjBxU,EAAO7C,QAAU,SAAgB8C,EAAOG,GACtC,IAAQxB,EAAMJ,EAAOa,EAAMY,EAAMZ,IAAKqB,EAAMT,EAAMkG,OAElD,GAAkC,KAA9BlG,EAAMb,IAAIP,WAAWQ,GAAwB,OAAM,EAEvD,GAAIA,EAAM,EAAIqB,EAGZ,GAAW,KAFNT,EAAMb,IAAIP,WAAWQ,EAAM,IAI9B,GADAb,EAAQyB,EAAMb,IAAIzB,MAAM0B,GAAKb,MAAM+V,GAOjC,OALKnU,IACHxB,EAAqC,MAA9BJ,EAAM,GAAG,GAAGO,cAAwBC,SAASR,EAAM,GAAGb,MAAM,GAAI,IAAMqB,SAASR,EAAM,GAAI,IAChGyB,EAAMmG,SAAWtK,EAAkB8C,GAAQ5C,EAAc4C,GAAQ5C,EAAc,QAEjFiE,EAAMZ,KAAOb,EAAM,GAAGwG,eAKxB,IADAxG,EAAQyB,EAAMb,IAAIzB,MAAM0B,GAAKb,MAAMgW,KAE7B9Y,EAAIgB,EAAU8B,EAAM,IAGtB,OAFK4B,IAAUH,EAAMmG,SAAW1J,EAAS8B,EAAM,KAC/CyB,EAAMZ,KAAOb,EAAM,GAAGwG,UAS9B,OAFK5E,IAAUH,EAAMmG,SAAW,KAChCnG,EAAMZ,W,qCCxCR,IAAIoV,EAAc9X,EAAQ,QACtB2X,EAAyB3X,EAAQ,QAAqB2X,uBAKtDI,EAAiB,CACnB,CAAE,6CAA8C,oCAAmC,GACnF,CAAE,QAAgB,OAAM,GACxB,CAAE,OAAgB,OAAM,GACxB,CAAE,WAAgB,KAAI,GACtB,CAAE,eAAgB,SAAQ,GAC1B,CAAE,IAAInY,OAAO,QAAUkY,EAAYE,KAAK,KAAO,mBAAoB,KAAM,MAAK,GAC9E,CAAE,IAAIpY,OAAO+X,EAAuB9X,OAAS,SAAW,MAAK,IAI/DwD,EAAO7C,QAAU,SAAoB8C,EAAOC,EAAWC,EAASC,GAC9D,IAAI6K,EAAGa,EAAUvL,EAAOqU,EACpBvV,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GAGvB,GAAID,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAE5D,IAAKZ,EAAM+F,GAAG1C,QAAQgJ,KAAQ,OAAM,EAEpC,GAAkC,KAA9BrM,EAAMb,IAAIP,WAAWQ,GAAwB,OAAM,EAIvD,IAFAuV,EAAW3U,EAAMb,IAAIzB,MAAM0B,EAAKqB,GAE3BuK,EAAI,EAAGA,EAAIyJ,EAAe1P,SACzB0P,EAAezJ,GAAG,GAAGnM,KAAK8V,GADO3J,KAIvC,GAAIA,IAAMyJ,EAAe1P,OAAU,OAAM,EAEzC,GAAI5E,EAEF,OAAOsU,EAAezJ,GAAG,GAO3B,GAJAa,EAAW5L,EAAY,GAIlBwU,EAAezJ,GAAG,GAAGnM,KAAK8V,GAC7B,KAAO9I,EAAW3L,KACZF,EAAMW,OAAOkL,GAAY7L,EAAMY,WADViL,IAOzB,GAJAzM,EAAMY,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,GAC5CpL,EAAMT,EAAMU,OAAOmL,GACnB8I,EAAW3U,EAAMb,IAAIzB,MAAM0B,EAAKqB,GAE5BgU,EAAezJ,GAAG,GAAGnM,KAAK8V,GAAW,CACf,IAApBA,EAAS5P,QAAgB8G,IAC7B,MAWN,OANA7L,EAAMe,KAAO8K,GAEbvL,EAAgBN,EAAMgB,KAAK,aAAc,GAAI,IACvCE,IAAU,CAAEjB,EAAW4L,GAC7BvL,EAAMa,QAAUnB,EAAMoM,SAASnM,EAAW4L,EAAU7L,EAAMY,WAAUA,IAAC,I,kCCtEvE,uBAA0nB,G,oCCApnB,SAAUgU,EAAaC,GAC3B,IAAMC,EAAc1L,SAASC,cAAT,WAA2BwL,IAC/C,GAAIC,EAAa,CACf,IAAMC,EAAaD,EAAYE,wBAAwBC,IACvDvM,OAAOwM,OAAO,EAAGH,GAAcrM,OAAOyM,SAAWzM,OAAO0M,aAAe,MAJ3E,mC,oCCQA,IAJA,IAAI7V,EAAU7C,EAAQ,QAAmB6C,QAErC8V,EAAU,GAELrK,EAAI,EAAGA,EAAI,IAAKA,IAAOqK,EAAQrU,KAAK,GAE7C,qCACGsU,MAAM,IAAI1X,SAAQ,SAAUb,GAAMsY,EAAQtY,EAAG6B,WAAW,IAAM,KAGjEmB,EAAO7C,QAAU,SAAgB8C,EAAOG,GACtC,IAAIpD,EAAIqC,EAAMY,EAAMZ,IAAKqB,EAAMT,EAAMkG,OAErC,GAAkC,KAA9BlG,EAAMb,IAAIP,WAAWQ,GAAwB,OAAM,EAIvD,KAFAA,EAEUqB,EAAK,CAGb,IAFA1D,EAAKiD,EAAMb,IAAIP,WAAWQ,IAEjB,KAAuB,IAAhBiW,EAAQtY,GAGtB,OAFKoD,IAAUH,EAAMmG,SAAWnG,EAAMb,IAAIC,IAC1CY,EAAMZ,KAAO,KAIf,GAAW,KAAPrC,EAAa,CAOf,IANKoD,GACHH,EAAMgB,KAAK,YAAa,KAAM,GAGhC5B,IAEOA,EAAMqB,IACX1D,EAAKiD,EAAMb,IAAIP,WAAWQ,GACrBG,EAAQxC,KACbqC,IAIF,OADAY,EAAMZ,IAAMA,MAOhB,OAFKe,IAAUH,EAAMmG,SAAW,MAChCnG,EAAMZ,W,kCC7CR,IAAIyG,EAAQnJ,EAAQ,QAGpB,SAAS6Y,EAAUpW,EAAK4G,EAAIV,GAC1B/B,KAAKnE,IAAMA,EACXmE,KAAK+B,IAAMA,EACX/B,KAAKkC,OAAS,GACdlC,KAAKqC,cACLrC,KAAKyC,GAAKA,EAIZwP,EAAUha,UAAUsK,MAAQA,EAG5B9F,EAAO7C,QAAUqY,G,oCCdjBxV,EAAO7C,QAAU,SAA0B6I,EAAIrH,EAAM2E,GAoBnD,IACImS,GAHJnS,EAAUA,GAAW,IAGKyE,QAAU,IAChC2N,EAAcD,EAAW5W,WAAW,GACpC8W,EAAcF,EAAWzQ,OACzB4Q,EAActS,EAAQsS,UApB1B,SAAyBC,GACvB,OAAOA,EAAO/V,OAAOyV,MAAM,IAAK,GAAG,KAAO5W,GAoBxC+G,EAAcpC,EAAQoC,QAjB1B,SAAuBD,EAAQ+J,EAAKsG,EAAUxQ,EAAKyQ,GAOjD,OAJ4B,IAAxBtQ,EAAO+J,GAAK1I,SACdrB,EAAO+J,GAAKwG,SAAS,QAASrX,GAGzBoX,EAAIE,YAAYxQ,EAAQ+J,EAAKsG,EAAUxQ,EAAKyQ,IAuHrD/P,EAAGvC,MAAMW,MAAM8K,OAAO,QAAS,aAAevQ,GA3G9C,SAAmBsB,EAAOC,EAAWC,EAASC,GAC5C,IAAIf,EAAKyM,EAAUoK,EAAchV,EAAQ2U,EAAQtV,EAC7C4V,EAAYC,EACZC,KACAnP,EAAQjH,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC/CQ,EAAMT,EAAMU,OAAOT,GAKvB,GAAIwV,IAAgBzV,EAAMb,IAAIP,WAAWqI,GAAU,OAAM,EAIzD,IAAK7H,EAAM6H,EAAQ,EAAG7H,GAAOqB,GACvB+U,GAAYpW,EAAM6H,GAASyO,KAAgB1V,EAAMb,IAAIC,GADzBA,KAOlC,IADA6W,EAAe7E,KAAKiF,OAAOjX,EAAM6H,GAASyO,IA3B1B,EA4BkB,OAAM,EAKxC,GAJAtW,IAAQA,EAAM6H,GAASyO,EAEvBzU,EAASjB,EAAMb,IAAIzB,MAAMuJ,EAAO7H,GAChCwW,EAAS5V,EAAMb,IAAIzB,MAAM0B,EAAKqB,IACzBkV,EAASC,EAAQ3U,GAAW,OAAM,EAIvC,GAAId,EAAU,OAAM,EAMpB,IAFA0L,EAAW5L,MAGT4L,GACgB3L,OAMhB+G,EAAQjH,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,KAC9CpL,EAAMT,EAAMU,OAAOmL,KAEA7L,EAAMW,OAAOkL,GAAY7L,EAAMY,YAOlD,GAAI6U,IAAgBzV,EAAMb,IAAIP,WAAWqI,MAErCjH,EAAMW,OAAOkL,GAAY7L,EAAMY,WAAa,GAAhD,CAKA,IAAKxB,EAAM6H,EAAQ,EAAG7H,GAAOqB,GACvB+U,GAAYpW,EAAM6H,GAASyO,KAAgB1V,EAAMb,IAAIC,GADzBA,KAOlC,KAAIgS,KAAKiF,OAAOjX,EAAM6H,GAASyO,GAAcO,IAG7C7W,IAAQA,EAAM6H,GAASyO,EACvBtW,EAAMY,EAAMmM,WAAW/M,GAEnBA,EAAMqB,IAAV,CAGA2V,KACA,OA0BF,OAvBAF,EAAalW,EAAMgM,WACnBmK,EAAenW,EAAMkO,QACrBlO,EAAMgM,WAAa,YAGnBhM,EAAMkO,QAAUrC,GAEhBvL,EAAeN,EAAMgB,KAAK,aAAetC,EAAO,QAAS,MAAO,IAC1DuC,OAASA,EACfX,EAAMkD,SACNlD,EAAM6M,KAASyI,EACftV,EAAMY,IAAS,CAAEjB,EAAW4L,GAE5B7L,EAAM+F,GAAGvC,MAAM8N,SAAStR,EAAOC,EAAY,EAAG4L,IAE9CvL,EAAeN,EAAMgB,KAAK,aAAetC,EAAO,SAAU,OAAQ,IAC5DuC,OAASjB,EAAMb,IAAIzB,MAAMuJ,EAAO7H,GACtCkB,EAAMkD,SAENxD,EAAMgM,WAAakK,EACnBlW,EAAMkO,QAAUiI,EAChBnW,EAAMe,KAAO8K,GAAYuK,EAAc,EAAI,QAKkB,CAC7DzH,IAAK,CAAE,YAAa,YAAa,aAAc,UAEjD5I,EAAGrC,SAASQ,MAAM,aAAexF,EAAO,SAAW+G,EACnDM,EAAGrC,SAASQ,MAAM,aAAexF,EAAO,UAAY+G,I,kCCvItD,IAAI0I,EAAkBzR,EAAQ,QAG1B4V,EAAS,CAGX,CAAE,QAAc5V,EAAQ,QAA6B,CAAE,YAAa,cACpE,CAAE,OAAcA,EAAQ,SACxB,CAAE,QAAcA,EAAQ,QAA6B,CAAE,YAAa,YAAa,aAAc,SAC/F,CAAE,aAAcA,EAAQ,QAA6B,CAAE,YAAa,YAAa,aAAc,SAC/F,CAAE,KAAcA,EAAQ,QAA6B,CAAE,YAAa,YAAa,aAAc,SAC/F,CAAE,OAAcA,EAAQ,QAA6B,CAAE,YAAa,YAAa,eACjF,CAAE,YAAcA,EAAQ,SACxB,CAAE,aAAcA,EAAQ,SAA6B,CAAE,YAAa,YAAa,eACjF,CAAE,UAAcA,EAAQ,QAA6B,CAAE,YAAa,YAAa,eACjF,CAAE,WAAcA,EAAQ,SACxB,CAAE,YAAcA,EAAQ,UAO1B,SAAS+E,IAMP6B,KAAKa,MAAQ,IAAIgK,EAEjB,IAAK,IAAInD,EAAI,EAAGA,EAAIsH,EAAOvN,OAAQiG,IACjC1H,KAAKa,MAAMnD,KAAKsR,EAAOtH,GAAG,GAAIsH,EAAOtH,GAAG,GAAI,CAAE2D,KAAM2D,EAAOtH,GAAG,IAAM,IAAItN,UAO5E+D,EAAYlG,UAAU+V,SAAW,SAAUtR,EAAOC,EAAWC,GAQ3D,IAPA,IAAQ8K,EACJ9G,EAAQZ,KAAKa,MAAM4H,SAAS,IAC5BiG,EAAM9N,EAAMa,OACZhE,EAAOd,EACPqW,KACA1J,EAAa5M,EAAM+F,GAAG1C,QAAQuJ,WAE3B7L,EAAOb,IACZF,EAAMe,KAAOA,EAAOf,EAAMuW,eAAexV,KACrCA,GAAQb,OAIRF,EAAMW,OAAOI,GAAQf,EAAMY,YANV,CAUrB,GAAIZ,EAAMI,OAASwM,EAAY,CAC7B5M,EAAMe,KAAOb,EACb,MAUF,IAAK8K,EAAI,EAAGA,EAAIgH,IACT9N,EAAM8G,GAAGhL,EAAOe,EAAMb,MADR8K,KAOrBhL,EAAMgR,OAASsF,EAGXtW,EAAMiM,QAAQjM,EAAMe,KAAO,KAC7BuV,OAGFvV,EAAOf,EAAMe,MAEFb,GAAWF,EAAMiM,QAAQlL,KAClCuV,KACAvV,IACAf,EAAMe,KAAOA,KAWnBU,EAAYlG,UAAUiH,MAAQ,SAAUrD,EAAK4G,EAAIV,EAAKW,GACpD,IAAIhG,EAECb,IAELa,EAAQ,IAAIsD,KAAKgC,MAAMnG,EAAK4G,EAAIV,EAAKW,GAErC1C,KAAKgO,SAAStR,EAAOA,EAAMe,KAAMf,EAAMkO,WAIzCzM,EAAYlG,UAAU+J,MAAQ5I,EAAQ,QAGtCqD,EAAO7C,QAAUuE,G,2CCzHjB,I,+PC8CMsE,EAAKrJ,EAAQ,OAARA,CAAuB,CAChC2P,MAAKA,EACL1I,SAAQA,EACR8I,aAAYA,IACXxH,IAAIvI,EAAQ,QAA0B,WAAWuI,IAAIvI,EAAQ,QAA0B,QAAQuI,IAAIvI,EAAQ,QAA0B,UAAUuI,IAAIvI,EAAQ,SAAuBuI,IAAIvI,EAAQ,SAAoBuI,IAAIvI,EAAQ,SAAqBuI,IAAIvI,EAAQ,SAAyBuI,IAAIvI,EAAQ,OAARA,IAS1Q,EAArB,SAAAqL,GAPA,+C,0DAQEyO,YAAsB,GAEtB,EAAAC,WAAwB,GAV1B,EAOA,qBAAA1O,GAAA,sDAAAA,EAAA,8CAAAA,IAAA,yCAAAA,GAAA,cAAAA,EAAA,KAAAA,EAAA,aAgCIzE,KAAKoT,WACLpT,KAAKqT,kBAjCT,wBAAA5O,EAAA,UAAAA,EAAA,mCAAAA,EAAA,2DA6CIzE,KAAKqT,oBA7CT,iCAiDIrT,KAAKmT,WAAa,KAjDtB,uCAoDoBla,GAAc,WAC9BA,EAAO8B,QAAQ,8CAA8C,SAACuY,EAAGC,EAAIC,GAKnE,OAJAC,EAAKN,WAAWzV,KAAK,CACnBrF,IAAKkb,EACLvM,MAAOwM,IAEF,QA1Db,4CAAA/O,EAAA,8CAAAA,IAAA,+CAAAA,GAAA,cAAAA,EAAA,KAAAA,EAAA,oBAAAA,EAAA,OA+DsB,EAAAiP,EAAMC,IAAN,iBAAoB3T,KAAK4T,OAAOC,KAAKC,aA/D3D,OA+DUC,EA/DVtP,EAAA,KAgEIzE,KAAKkT,YAAczQ,EAAGN,OAAO4R,EAAIC,MAE7BC,UAAUC,UAAUpZ,QAAQ,YAAc,IAC5C2H,EAAGrC,SAASQ,MAAMuT,UAAY,SAAkBjS,EAAa+J,EAAalM,EAAcgC,EAAUtB,GAEhG,OADAyB,EAAO+J,GAAKmI,SAAS,CAAC,SAAU,WACzB3T,EAAKiS,YAAYxQ,EAAQ+J,EAAKlM,KAIzCC,KAAKqU,iBAAiBrU,KAAKkT,aAzE/B,wBAAAzO,EAAA,UAAAA,EAAA,mCAAAA,EAAA,0DAMI,MAA4B,YAArBzE,KAAK4T,OAAOxY,OANvB,mCAUI,OAAO,MAVX,qCAcI,OAAO4E,KAAKiG,OAAOC,QAAQoO,iBAd/B,4BAiBW,WASDC,GANAvU,KAAKsU,eACK,EAEA,GAGYE,MAAK,SAAC3O,GAAD,OAAeA,EAAK4O,cAAgB,EAAKb,OAAOc,QAAQ,GAAGtZ,QAC5F,OAAOmZ,GAAaA,EAAUzW,SAAWyW,EAAUzW,SAAW,KA3BlE,kCAqCI,OAAOkC,KAAK4T,OAAOe,OArCvB,oCAyCI,MAAM,UAAN,OAAiB3U,KAAK4T,OAAOC,KAAKC,gBAzCtC,GAAwC,KA+BtC,KADC,YAAM,W,yBAIN,MAlCkB,IC3Dqb,ED2Drb,EAAU,KAP9B,YAAU,CACTnT,WAAY,CACViU,WAAA,QACAC,UAAA,QACAC,UAAA,YAGiB,G,mCElDjB1O,EAAY,YACd,GHVW,WAAa,IAAIC,EAAIrG,KAASsG,EAAGD,EAAIE,eAAmBC,EAAGH,EAAII,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,MAAM,CAACE,YAAY,iBAAiB,CAACF,EAAG,YAAY,CAACoD,MAAM,CAAC,SAAWvD,EAAInB,MAAM,iBAAiBmB,EAAI0O,eAAiB1O,EAAI2O,SAAsSxO,EAAG,MAAM,CAACE,YAAY,kBAAkB,CAACF,EAAG,SAAS,CAACE,YAAY,iBAAiBkD,MAAM,CAAC,UAAY,KAAK,YAAc,IAAI,IAAMvD,EAAI4O,kBAAnazO,EAAG,MAAM,CAACE,YAAY,gBAAgB,CAACF,EAAG,MAAM,CAACE,YAAY,0BAA0B,CAACF,EAAG,IAAI,CAACE,YAAY,gBAAgBI,SAAS,CAAC,UAAYT,EAAIU,GAAGV,EAAI6M,gBAAgB1M,EAAG,aAAa,GAAGA,EAAG,MAAM,CAACE,YAAY,eAAe,CAACF,EAAG,WAAW,CAACoD,MAAM,CAAC,MAAQvD,EAAI8M,eAAe,MAA+J,OAC9qB,IGWpB/L,EAEA,KACA,WACA,MAIa,UAAAhB,E,6CCVf,IAAIpM,EAAkBZ,EAAQ,QAAkBY,OAC5CgB,EAAkB5B,EAAQ,QAAkB4B,YAC5CW,EAAkBvC,EAAQ,QAAkBuC,WAK5CuZ,EAAgB,GAoHpB,SAASjX,IA8BP+B,KAAKY,MAAQ5G,EAAO,GAAIkb,GA/I1BA,EAAcC,YAAc,SAAUjT,EAAQ+J,EAAKlM,EAASgC,EAAKyQ,GAC/D,IAAIxV,EAAQkF,EAAO+J,GAEnB,MAAQ,QAAUuG,EAAI4C,YAAYpY,GAAS,IACnCrB,EAAWuG,EAAO+J,GAAKpO,SACvB,WAIVqX,EAAcG,WAAa,SAAUnT,EAAQ+J,EAAKlM,EAASgC,EAAKyQ,GAC9D,IAAIxV,EAAQkF,EAAO+J,GAEnB,MAAQ,OAASuG,EAAI4C,YAAYpY,GAAS,UAClCrB,EAAWuG,EAAO+J,GAAKpO,SACvB,mBAIVqX,EAAcI,MAAQ,SAAUpT,EAAQ+J,EAAKlM,EAASgC,EAAKyQ,GACzD,IAII+C,EAAa7N,EAAG8N,EAAKC,EAAUC,EAJ/B1Y,EAAQkF,EAAO+J,GACfpC,EAAO7M,EAAM6M,KAAO7O,EAAYgC,EAAM6M,MAAMtN,OAAS,GACrDoZ,EAAW,GACXC,EAAY,GAehB,OAZI/L,IAEF8L,GADAH,EAAM3L,EAAKmI,MAAM,WACF,GACf4D,EAAYJ,EAAIpb,MAAM,GAAGgX,KAAK,KASI,KALlCmE,EADExV,EAAQsJ,WACItJ,EAAQsJ,UAAUrM,EAAMa,QAAS8X,EAAUC,IAE3Cja,EAAWqB,EAAMa,UAGjB/C,QAAQ,QACfya,EAAc,KAMnB1L,GACFnC,EAAW1K,EAAM6Y,UAAU,SAC3BJ,EAAWzY,EAAM4M,MAAQ5M,EAAM4M,MAAMxP,QAAU,GAE3CsN,EAAI,EACN+N,EAAS/X,KAAK,CAAE,QAASqC,EAAQmJ,WAAayM,KAE9CF,EAAS/N,GAAK+N,EAAS/N,GAAGtN,QAC1Bqb,EAAS/N,GAAG,IAAM,IAAM3H,EAAQmJ,WAAayM,GAI/CD,EAAW,CACT9L,MAAO6L,GAGD,aAAejD,EAAI4C,YAAYM,GAAY,IAC3CH,EACA,mBAIF,aAAe/C,EAAI4C,YAAYpY,GAAS,IACxCuY,EACA,mBAIVL,EAAcY,MAAQ,SAAU5T,EAAQ+J,EAAKlM,EAASgC,EAAKyQ,GACzD,IAAIxV,EAAQkF,EAAO+J,GAUnB,OAHAjP,EAAM4M,MAAM5M,EAAM6Y,UAAU,QAAQ,GAClCrD,EAAIuD,mBAAmB/Y,EAAMc,SAAUiC,EAASgC,GAE3CyQ,EAAIE,YAAYxQ,EAAQ+J,EAAKlM,IAItCmV,EAAcc,UAAY,SAAU9T,EAAQ+J,EAAKlM,GAC/C,OAAOA,EAAQiJ,SAAW,WAAa,UAEzCkM,EAAce,UAAY,SAAU/T,EAAQ+J,EAAKlM,GAC/C,OAAOA,EAAQkJ,OAAUlJ,EAAQiJ,SAAW,WAAa,SAAY,MAIvEkM,EAAcgB,KAAO,SAAUhU,EAAQ+J,GACrC,OAAOtQ,EAAWuG,EAAO+J,GAAKpO,UAIhCqX,EAAciB,WAAa,SAAUjU,EAAQ+J,GAC3C,OAAO/J,EAAO+J,GAAKpO,SAErBqX,EAAckB,YAAc,SAAUlU,EAAQ+J,GAC5C,OAAO/J,EAAO+J,GAAKpO,SAgDrBI,EAAShG,UAAUmd,YAAc,SAAqBpY,GACpD,IAAI0K,EAAGW,EAAGjH,EAEV,IAAKpE,EAAM4M,MAAS,MAAO,GAI3B,IAFAxI,EAAS,GAEJsG,EAAI,EAAGW,EAAIrL,EAAM4M,MAAMnI,OAAQiG,EAAIW,EAAGX,IACzCtG,GAAU,IAAMzF,EAAWqB,EAAM4M,MAAMlC,GAAG,IAAM,KAAO/L,EAAWqB,EAAM4M,MAAMlC,GAAG,IAAM,IAGzF,OAAOtG,GAaTnD,EAAShG,UAAUya,YAAc,SAAqBxQ,EAAQ+J,EAAKlM,GACjE,IAAIsW,EACAjV,EAAS,GACTkV,KACAtZ,EAAQkF,EAAO+J,GAGnB,OAAIjP,EAAMiR,OACD,IAULjR,EAAMkD,QAA4B,IAAnBlD,EAAMuG,SAAkB0I,GAAO/J,EAAO+J,EAAM,GAAGgC,SAChE7M,GAAU,MAIZA,KAA8B,IAAnBpE,EAAMuG,QAAiB,KAAO,KAAOvG,EAAMsG,IAGtDlC,GAAUpB,KAAKoV,YAAYpY,GAGL,IAAlBA,EAAMuG,SAAiBxD,EAAQiJ,WACjC5H,GAAU,MAIRpE,EAAMkD,QACRoW,KAEsB,IAAlBtZ,EAAMuG,SACJ0I,EAAM,EAAI/J,EAAOT,UAGI,YAFvB4U,EAAYnU,EAAO+J,EAAM,IAEX5I,MAAqBgT,EAAUpI,SAKX,IAAvBoI,EAAU9S,SAAkB8S,EAAU/S,MAAQtG,EAAMsG,OAF7DgT,QAWRlV,GAAUkV,EAAS,MAAQ,MAc7BrY,EAAShG,UAAUqK,aAAe,SAAUJ,EAAQnC,EAASgC,GAK3D,IAJA,IAAIsB,EACAjC,EAAS,GACTR,EAAQZ,KAAKY,MAER8G,EAAI,EAAGgH,EAAMxM,EAAOT,OAAQiG,EAAIgH,EAAKhH,SAGjB,IAAhB9G,EAFXyC,EAAOnB,EAAOwF,GAAGrE,MAGfjC,GAAUR,EAAMyC,GAAMnB,EAAQwF,EAAG3H,EAASgC,EAAK/B,MAE/CoB,GAAUpB,KAAK0S,YAAYxQ,EAAQwF,EAAG3H,GAI1C,OAAOqB,GAcTnD,EAAShG,UAAU8d,mBAAqB,SAAU7T,EAAQnC,EAASgC,GAGjE,IAFA,IAAIX,EAAS,GAEJsG,EAAI,EAAGgH,EAAMxM,EAAOT,OAAQiG,EAAIgH,EAAKhH,IACrB,SAAnBxF,EAAOwF,GAAGrE,KACZjC,GAAUc,EAAOwF,GAAG7J,QACQ,UAAnBqE,EAAOwF,GAAGrE,KACnBjC,GAAUpB,KAAK+V,mBAAmB7T,EAAOwF,GAAG5J,SAAUiC,EAASgC,GACnC,cAAnBG,EAAOwF,GAAGrE,OACnBjC,GAAU,MAId,OAAOA,GAaTnD,EAAShG,UAAUkK,OAAS,SAAUD,EAAQnC,EAASgC,GACrD,IAAI2F,EAAGgH,EAAKrL,EACRjC,EAAS,GACTR,EAAQZ,KAAKY,MAEjB,IAAK8G,EAAI,EAAGgH,EAAMxM,EAAOT,OAAQiG,EAAIgH,EAAKhH,IAG3B,YAFbrE,EAAOnB,EAAOwF,GAAGrE,MAGfjC,GAAUpB,KAAKsC,aAAaJ,EAAOwF,GAAG5J,SAAUiC,EAASgC,QACzB,IAAhBnB,EAAMyC,GACtBjC,GAAUR,EAAMsB,EAAOwF,GAAGrE,MAAMnB,EAAQwF,EAAG3H,EAASgC,EAAK/B,MAEzDoB,GAAUpB,KAAK0S,YAAYxQ,EAAQwF,EAAG3H,EAASgC,GAInD,OAAOX,GAGT3E,EAAO7C,QAAUqE,G,oCC/UjB,IAAIjD,EAAc5B,EAAQ,QAAmB4B,YAG7CyB,EAAO7C,QAAU,SAAwBiB,EAAKiB,EAAKqB,GACjD,IAAI9B,EACAmJ,EACA+R,EAAQ,EACR5S,EAAQ7H,EACRsF,EAAS,CACP2I,IAAGA,EACHjO,IAAK,EACLya,MAAO,EACP1b,IAAK,IAGX,GAAIiB,GAAOqB,EAAO,OAAOiE,EAIzB,GAAe,MAFfoD,EAAS3J,EAAIS,WAAWQ,KAEkB,KAAX0I,GAAsC,KAAXA,EAA2B,OAAOpD,EAO5F,IALAtF,IAGe,KAAX0I,IAAmBA,EAAS,IAEzB1I,EAAMqB,GAAK,CAEhB,IADA9B,EAAOR,EAAIS,WAAWQ,MACT0I,EAKX,OAJApD,EAAOtF,IAAMA,EAAM,EACnBsF,EAAOmV,MAAQA,EACfnV,EAAOvG,IAAMG,EAAYH,EAAIT,MAAMuJ,EAAQ,EAAG7H,IAC9CsF,EAAO2I,MACA3I,EACF,GAAa,KAAT/F,GAAoC,KAAXmJ,EAClC,OAAOpD,EACW,KAAT/F,EACTkb,IACkB,KAATlb,GAAyBS,EAAM,EAAIqB,IAC5CrB,IAC4B,KAAxBjB,EAAIS,WAAWQ,IACjBya,KAIJza,IAGF,OAAOsF,I,oCCjDT,IAAInF,EAAU7C,EAAQ,QAAmB6C,QAGzC,SAASua,EAAQ9Z,EAAOe,GACtB,IAAI3B,EAAMY,EAAMO,OAAOQ,GAAQf,EAAMQ,OAAOO,GACxCN,EAAMT,EAAMU,OAAOK,GAEvB,OAAOf,EAAMb,IAAI4a,OAAO3a,EAAKqB,EAAMrB,GAGrC,SAAS4a,EAAa7b,GACpB,IAGIpB,EAHA2H,EAAS,GACTtF,EAAM,EACNqB,EAAMtC,EAAI4G,OAEVkV,KACAC,EAAU,EACVC,EAAU,GAId,IAFApd,EAAMoB,EAAIS,WAAWQ,GAEdA,EAAMqB,GACA,MAAP1D,IACGkd,GAOHE,GAAWhc,EAAIic,UAAUF,EAAS9a,EAAM,GACxC8a,EAAU9a,IANVsF,EAAO1D,KAAKmZ,EAAUhc,EAAIic,UAAUF,EAAS9a,IAC7C+a,EAAU,GACVD,EAAU9a,EAAM,IAQpB6a,EAAoB,KAAPld,EACbqC,IAEArC,EAAKoB,EAAIS,WAAWQ,GAKtB,OAFAsF,EAAO1D,KAAKmZ,EAAUhc,EAAIic,UAAUF,IAE7BxV,EAIT3E,EAAO7C,QAAU,SAAe8C,EAAOC,EAAWC,EAASC,GACzD,IAAIpD,EAAI4X,EAAUvV,EAAK4L,EAAGW,EAAGE,EAAUwO,EAASC,EAAaha,EACzDia,EAAQxD,EAAGyD,EAAYC,EAAY7O,EAAeF,EAClDI,EAAiB4O,EAASC,EAG9B,GAAI1a,EAAY,EAAIC,EAAW,OAAM,EAIrC,GAFA2L,EAAW5L,EAAY,EAEnBD,EAAMW,OAAOkL,GAAY7L,EAAMY,UAAa,OAAM,EAGtD,GAAIZ,EAAMW,OAAOkL,GAAY7L,EAAMY,WAAa,EAAK,OAAM,EAO3D,IADAxB,EAAMY,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,KACjC7L,EAAMU,OAAOmL,GAAa,OAAM,EAG3C,GAAgB,OADhB6O,EAAU1a,EAAMb,IAAIP,WAAWQ,OACY,KAAZsb,GAAuC,KAAZA,EAA2B,OAAM,EAE3F,GAAItb,GAAOY,EAAMU,OAAOmL,GAAa,OAAM,EAG3C,GAAiB,OADjB8O,EAAW3a,EAAMb,IAAIP,WAAWQ,OACa,KAAbub,GAAyC,KAAbA,IAA6Bpb,EAAQob,GAC/F,OAAM,EAKR,GAAgB,KAAZD,GAA2Bnb,EAAQob,GAAa,OAAM,EAE1D,KAAOvb,EAAMY,EAAMU,OAAOmL,IAAW,CAGnC,GAAW,OAFX9O,EAAKiD,EAAMb,IAAIP,WAAWQ,KAEO,KAAPrC,GAA6B,KAAPA,IAAuBwC,EAAQxC,GAAO,OAAM,EAE5FqC,IAOF,IAFAib,GAFA1F,EAAWmF,EAAQ9Z,EAAOC,EAAY,IAEnBqV,MAAM,KACzBiF,EAAS,GACJvP,EAAI,EAAGA,EAAIqP,EAAQtV,OAAQiG,IAAK,CAEnC,KADA+L,EAAIsD,EAAQrP,GAAGnL,QACP,CAGN,GAAU,IAANmL,GAAWA,IAAMqP,EAAQtV,OAAS,EACpC,SAEA,OAAM,EAIV,IAAK,WAAWlG,KAAKkY,GAAM,OAAM,EACE,KAA/BA,EAAEnY,WAAWmY,EAAEhS,OAAS,GAC1BwV,EAAOvZ,KAAyB,KAApB+V,EAAEnY,WAAW,GAAqB,SAAW,SAC5B,KAApBmY,EAAEnY,WAAW,GACtB2b,EAAOvZ,KAAK,QAEZuZ,EAAOvZ,KAAK,IAKhB,IAA+B,KAD/B2T,EAAWmF,EAAQ9Z,EAAOC,GAAWJ,QACxBzB,QAAQ,KAAe,OAAM,EAC1C,GAAI4B,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAQ5D,IAPAyZ,EAAUL,EAAarF,IACX5P,QAAyB,KAAfsV,EAAQ,IAAWA,EAAQO,QAC7CP,EAAQtV,QAA0C,KAAhCsV,EAAQA,EAAQtV,OAAS,IAAWsV,EAAQtT,MAK9C,KADpBuT,EAAcD,EAAQtV,SACGuV,IAAgBC,EAAOxV,OAAU,OAAM,EAEhE,GAAI5E,EAAU,OAAM,EAkBpB,IAhBAyL,EAAgB5L,EAAMgM,WACtBhM,EAAMgM,WAAa,QAInBF,EAAkB9L,EAAM+F,GAAGvC,MAAMW,MAAM4H,SAAS,eAEhDzL,EAAYN,EAAMgB,KAAK,aAAc,QAAS,IACxCE,IAAMsZ,EAAa,CAAEva,EAAW,IAEtCK,EAAYN,EAAMgB,KAAK,aAAc,QAAS,IACxCE,IAAM,CAAEjB,EAAWA,EAAY,IAErCK,EAAYN,EAAMgB,KAAK,UAAW,KAAM,IAClCE,IAAM,CAAEjB,EAAWA,EAAY,GAEhC+K,EAAI,EAAGA,EAAIqP,EAAQtV,OAAQiG,IAC9B1K,EAAiBN,EAAMgB,KAAK,UAAW,KAAM,GACzCuZ,EAAOvP,KACT1K,EAAM4M,MAAS,CAAE,CAAE,QAAS,cAAgBqN,EAAOvP,OAGrD1K,EAAiBN,EAAMgB,KAAK,SAAU,GAAI,IACpCG,QAAWkZ,EAAQrP,GAAGnL,OAC5BS,EAAMc,SAAW,GAEjBd,EAAiBN,EAAMgB,KAAK,WAAY,MAAO,GAMjD,IAHAV,EAAYN,EAAMgB,KAAK,WAAY,MAAO,GAC1CV,EAAYN,EAAMgB,KAAK,cAAe,SAAU,GAE3C6K,EAAW5L,EAAY,EAAG4L,EAAW3L,KACpCF,EAAMW,OAAOkL,GAAY7L,EAAMY,WADciL,IAAY,CAI7D,IADAH,KACKV,EAAI,EAAGW,EAAIG,EAAgB/G,OAAQiG,EAAIW,EAAGX,IAC7C,GAAIc,EAAgBd,GAAGhL,EAAO6L,EAAU3L,MAAgB,CACtDwL,KACA,MAIJ,GAAIA,EAAa,MAEjB,KADAiJ,EAAWmF,EAAQ9Z,EAAO6L,GAAUhM,QACnB,MACjB,GAAIG,EAAMW,OAAOkL,GAAY7L,EAAMY,WAAa,EAAK,MAarD,KAZAyZ,EAAUL,EAAarF,IACX5P,QAAyB,KAAfsV,EAAQ,IAAWA,EAAQO,QAC7CP,EAAQtV,QAA0C,KAAhCsV,EAAQA,EAAQtV,OAAS,IAAWsV,EAAQtT,MAE9D8E,IAAa5L,EAAY,KAC3BK,EAAYN,EAAMgB,KAAK,aAAc,QAAS,IACxCE,IAAMuZ,EAAa,CAAExa,EAAY,EAAG,KAG5CK,EAAYN,EAAMgB,KAAK,UAAW,KAAM,IAClCE,IAAM,CAAE2K,EAAUA,EAAW,GAE9Bb,EAAI,EAAGA,EAAIsP,EAAatP,IAC3B1K,EAAiBN,EAAMgB,KAAK,UAAW,KAAM,GACzCuZ,EAAOvP,KACT1K,EAAM4M,MAAS,CAAE,CAAE,QAAS,cAAgBqN,EAAOvP,OAGrD1K,EAAiBN,EAAMgB,KAAK,SAAU,GAAI,IACpCG,QAAWkZ,EAAQrP,GAAKqP,EAAQrP,GAAGnL,OAAS,GAClDS,EAAMc,SAAW,GAEjBd,EAAiBN,EAAMgB,KAAK,WAAY,MAAO,GAEjDV,EAAQN,EAAMgB,KAAK,WAAY,MAAO,GAaxC,OAVIyZ,IACFna,EAAQN,EAAMgB,KAAK,cAAe,SAAU,GAC5CyZ,EAAW,GAAK5O,GAGlBvL,EAAQN,EAAMgB,KAAK,cAAe,SAAU,GAC5CwZ,EAAW,GAAK3O,EAEhB7L,EAAMgM,WAAaJ,EACnB5L,EAAMe,KAAO8K,O,kCCrNf,IAAIgP,EAASne,EAAQ,QAEjBoe,EAAiBpe,EAAQ,QA6M7BqD,EAAO7C,QAAU,SAAuB6I,EAAI1C,GAC1C0C,EAAGxC,OAAOY,MAAM8K,OAAO,WAAY,QA5MrC,SAAyBlJ,EAAI1C,GAC3B,OAAO,SAASrD,EAAOG,GACrB,IAAI+M,EACAvO,EACA2L,EACAyQ,EACAC,EACA5b,EACA6b,EACA5D,EACA6D,EAGA5a,EACAkF,EACAyB,EAJAsG,EAAQ,GACRC,EAAS,GAIT2N,EAAO,GACPC,EAASpb,EAAMZ,IACfqB,EAAMT,EAAMkG,OAEhB,GAAwC,KAApClG,EAAMb,IAAIP,WAAWoB,EAAMZ,KAAwB,OAAM,EAC7D,GAA4C,KAAxCY,EAAMb,IAAIP,WAAWoB,EAAMZ,IAAM,GAAsB,OAAM,EAMjE,GAJA4b,EAAahb,EAAMZ,IAAM,GACzB2b,EAAWhV,EAAGzE,QAAQyS,eAAe/T,EAAOA,EAAMZ,IAAM,GAAE,IAG3C,EAAK,OAAM,EAG1B,IADAA,EAAM2b,EAAW,GACPta,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,GAAsB,CAS1D,IADAA,IACOA,EAAMqB,IAEE,MADb9B,EAAOqB,EAAMb,IAAIP,WAAWQ,KACE,KAATT,GAFLS,KAIlB,GAAIA,GAAOqB,EAAO,OAAM,EAkBxB,IAdAwG,EAAQ7H,GACRiY,EAAMtR,EAAGzE,QAAQ0S,qBAAqBhU,EAAMb,IAAKC,EAAKY,EAAMkG,SACpDmH,KACN8N,EAAOnb,EAAM+F,GAAGzD,cAAc+U,EAAIlZ,KAC9B6B,EAAM+F,GAAG5D,aAAagZ,GACxB/b,EAAMiY,EAAIjY,IAEV+b,EAAO,IAMXlU,EAAQ7H,EACDA,EAAMqB,IAEE,MADb9B,EAAOqB,EAAMb,IAAIP,WAAWQ,KACE,KAATT,GAFLS,KAQlB,GADAiY,EAAMtR,EAAGzE,QAAQ2S,eAAejU,EAAMb,IAAKC,EAAKY,EAAMkG,QAClD9G,EAAMqB,GAAOwG,IAAU7H,GAAOiY,EAAIhK,GAMpC,IALA6N,EAAQ7D,EAAIlZ,IACZiB,EAAMiY,EAAIjY,IAIHA,EAAMqB,IAEE,MADb9B,EAAOqB,EAAMb,IAAIP,WAAWQ,KACE,KAATT,GAFLS,UAKlB8b,EAAQ,GAKV,GAAI9b,EAAM,GAAK,IAKA,MAJbT,EAAOqB,EAAMb,IAAIP,WAAWQ,EAAM,MAKhCiY,EAAMyD,EAAe9a,EAAMb,IAAKC,EAAKY,EAAMkG,SACnCmH,IAON,IANAE,EAAQ8J,EAAI9J,MACZC,EAAS6J,EAAI7J,OACbpO,EAAMiY,EAAIjY,IAIHA,EAAMqB,IAEE,MADb9B,EAAOqB,EAAMb,IAAIP,WAAWQ,KACE,KAATT,GAFLS,KAQxB,GAAIA,GAAOqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,GAErC,OADAY,EAAMZ,IAAMgc,KAGdhc,QAEK,CAIL,QAAoC,IAAzBY,EAAMqF,IAAIgW,WAA8B,OAAM,EAIzD,KAAOjc,EAAMqB,IAEE,MADb9B,EAAOqB,EAAMb,IAAIP,WAAWQ,KACE,KAATT,GAFLS,KAsBlB,GAjBIA,EAAMqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,IACpC6H,EAAQ7H,EAAM,GACdA,EAAM2G,EAAGzE,QAAQyS,eAAe/T,EAAOZ,KAC5B,EACTkL,EAAQtK,EAAMb,IAAIzB,MAAMuJ,EAAO7H,KAE/BA,EAAM2b,EAAW,GAGnB3b,EAAM2b,EAAW,EAKdzQ,IAASA,EAAQtK,EAAMb,IAAIzB,MAAMsd,EAAYD,MAElDE,EAAMjb,EAAMqF,IAAIgW,WAAWtV,EAAG1E,MAAMzB,mBAAmB0K,KAGrD,OADAtK,EAAMZ,IAAMgc,KAGdD,EAAOF,EAAIE,KACXD,EAAQD,EAAIC,MAOd,IAAK/a,EAAQ,CACXH,EAAMZ,IAAM4b,EACZhb,EAAMkG,OAAS6U,EAEf,IAAIO,EAAW,IAAItb,EAAM+F,GAAGxC,OAAO+B,MACjCtF,EAAMb,IAAIzB,MAAMsd,EAAYD,GAC5B/a,EAAM+F,GACN/F,EAAMqF,IACNG,EAAS,IAOX,GALA8V,EAASvV,GAAGxC,OAAO+N,SAASgK,GAKxBjY,GACEA,EAAQkY,UAAsB,KAAVhO,GAA2B,KAAXC,EACtC,IACE,IAAIgO,EAAaX,EAAOM,GACxB5N,EAAQiO,EAAWjO,MACnBC,EAASgO,EAAWhO,OACpB,MAAOzF,KAIbzH,EAAiBN,EAAMgB,KAAK,QAAS,MAAO,IACtCkM,MAAWA,EAAQ,CAAE,CAAE,MAAOiO,GACT,CAAE,MAAO,KACpC7a,EAAMc,SAAWoE,EACb0V,GACFhO,EAAMlM,KAAK,CAAE,QAASka,IAGV,KAAV3N,GACFL,EAAMlM,KAAK,CAAE,QAASuM,IAGT,KAAXC,GACFN,EAAMlM,KAAK,CAAE,SAAUwM,IAM3B,OAFAxN,EAAMZ,IAAMA,EACZY,EAAMkG,OAASzF,MAM2Bgb,CAAgB1V,EAAI1C,M,oCCjNlE,IAAIwC,EAAQnJ,EAAQ,QAChB6C,EAAU7C,EAAQ,QAAmB6C,QAGzC,SAASmc,EAAWvc,EAAK4G,EAAIV,EAAKG,GAChC,IAAIzI,EAAI4e,EAAG1U,EAAO7H,EAAK4S,EAAKhC,EAAQjC,EAAQ6N,EAuD5C,IArDAtY,KAAKnE,IAAMA,EAGXmE,KAAKyC,GAASA,EAEdzC,KAAK+B,IAAMA,EAMX/B,KAAKkC,OAASA,EAEdlC,KAAK/C,OAAS,GACd+C,KAAK5C,OAAS,GACd4C,KAAK9C,OAAS,GACd8C,KAAK3C,OAAS,GAYd2C,KAAK6N,QAAU,GAGf7N,KAAK1C,UAAa,EAElB0C,KAAKvC,KAAa,EAClBuC,KAAK4K,QAAa,EAClB5K,KAAK0N,SACL1N,KAAKuY,UAAc,EACnBvY,KAAK2N,YAAc,EAInB3N,KAAK0I,WAAa,OAElB1I,KAAKlD,MAAQ,EAGbkD,KAAKoB,OAAS,GAKdkX,KAEK3U,EAAQ7H,EAAM4Q,EAASjC,EAAS,EAAGiE,GAHxC2J,EAAIrY,KAAKnE,KAGuC4F,OAAQ3F,EAAM4S,EAAK5S,IAAO,CAGxE,GAFArC,EAAK4e,EAAE/c,WAAWQ,IAEbwc,EAAc,CACjB,GAAIrc,EAAQxC,GAAK,CACfiT,IAEW,IAAPjT,EACFgR,GAAU,EAAIA,EAAS,EAEvBA,IAEF,SAEA6N,KAIO,KAAP7e,GAAeqC,IAAQ4S,EAAM,IACpB,KAAPjV,GAAeqC,IACnBkE,KAAK/C,OAAOS,KAAKiG,GACjB3D,KAAK5C,OAAOM,KAAK5B,GACjBkE,KAAK9C,OAAOQ,KAAKgP,GACjB1M,KAAK3C,OAAOK,KAAK+M,GACjBzK,KAAK6N,QAAQnQ,KAAK,GAElB4a,KACA5L,EAAS,EACTjC,EAAS,EACT9G,EAAQ7H,EAAM,GAKlBkE,KAAK/C,OAAOS,KAAK2a,EAAE5W,QACnBzB,KAAK5C,OAAOM,KAAK2a,EAAE5W,QACnBzB,KAAK9C,OAAOQ,KAAK,GACjBsC,KAAK3C,OAAOK,KAAK,GACjBsC,KAAK6N,QAAQnQ,KAAK,GAElBsC,KAAK4K,QAAU5K,KAAK/C,OAAOwE,OAAS,EAKtC2W,EAAWngB,UAAUyF,KAAO,SAAU2F,EAAMC,EAAKC,GAC/C,IAAIvG,EAAQ,IAAIuF,EAAMc,EAAMC,EAAKC,GAQjC,OAPAvG,EAAMkD,SAEFqD,EAAU,GAAGvD,KAAKlD,QACtBE,EAAMF,MAAQkD,KAAKlD,MACfyG,EAAU,GAAGvD,KAAKlD,QAEtBkD,KAAKkC,OAAOxE,KAAKV,GACVA,GAGTob,EAAWngB,UAAU0Q,QAAU,SAAiBlL,GAC9C,OAAOuC,KAAK/C,OAAOQ,GAAQuC,KAAK9C,OAAOO,IAASuC,KAAK5C,OAAOK,IAG9D2a,EAAWngB,UAAUgb,eAAiB,SAAwBuF,GAC5D,IAAK,IAAIrb,EAAM6C,KAAK4K,QAAS4N,EAAOrb,KAC9B6C,KAAK/C,OAAOub,GAAQxY,KAAK9C,OAAOsb,GAAQxY,KAAK5C,OAAOob,IADjBA,KAKzC,OAAOA,GAITJ,EAAWngB,UAAU4Q,WAAa,SAAoB/M,GAGpD,IAFA,IAAIrC,EAEK0D,EAAM6C,KAAKnE,IAAI4F,OAAQ3F,EAAMqB,IACpC1D,EAAKuG,KAAKnE,IAAIP,WAAWQ,GACpBG,EAAQxC,IAF4BqC,KAI3C,OAAOA,GAITsc,EAAWngB,UAAUsF,eAAiB,SAAwBzB,EAAKiS,GACjE,GAAIjS,GAAOiS,EAAO,OAAOjS,EAEzB,KAAOA,EAAMiS,GACX,IAAK9R,EAAQ+D,KAAKnE,IAAIP,aAAaQ,IAAS,OAAOA,EAAM,EAE3D,OAAOA,GAITsc,EAAWngB,UAAU2Q,UAAY,SAAmB9M,EAAKT,GACvD,IAAK,IAAI8B,EAAM6C,KAAKnE,IAAI4F,OAAQ3F,EAAMqB,GAChC6C,KAAKnE,IAAIP,WAAWQ,KAAST,EADQS,KAG3C,OAAOA,GAITsc,EAAWngB,UAAUuF,cAAgB,SAAuB1B,EAAKT,EAAM0S,GACrE,GAAIjS,GAAOiS,EAAO,OAAOjS,EAEzB,KAAOA,EAAMiS,GACX,GAAI1S,IAAS2E,KAAKnE,IAAIP,aAAaQ,GAAQ,OAAOA,EAAM,EAE1D,OAAOA,GAITsc,EAAWngB,UAAU6Q,SAAW,SAAkB2P,EAAOjK,EAAK9B,EAAQgM,GACpE,IAAIhR,EAAGiR,EAAYlf,EAAImf,EAAOpP,EAAMqP,EAAOC,EACvCrb,EAAOgb,EAEX,GAAIA,GAASjK,EACX,MAAO,GAKT,IAFAqK,EAAQ,IAAI1e,MAAMqU,EAAMiK,GAEnB/Q,EAAI,EAAGjK,EAAO+Q,EAAK/Q,IAAQiK,IAAK,CAWnC,IAVAiR,EAAa,EACbG,EAAYF,EAAQ5Y,KAAK/C,OAAOQ,GAI9B+L,EAFE/L,EAAO,EAAI+Q,GAAOkK,EAEb1Y,KAAK5C,OAAOK,GAAQ,EAEpBuC,KAAK5C,OAAOK,GAGdmb,EAAQpP,GAAQmP,EAAajM,GAAQ,CAG1C,GAFAjT,EAAKuG,KAAKnE,IAAIP,WAAWsd,GAErB3c,EAAQxC,GACC,IAAPA,EACFkf,GAAc,GAAKA,EAAa3Y,KAAK6N,QAAQpQ,IAAS,EAEtDkb,QAEG,MAAIC,EAAQE,EAAY9Y,KAAK9C,OAAOO,IAIzC,MAFAkb,IAKFC,IAMAC,EAAMnR,GAHJiR,EAAajM,EAGJ,IAAIvS,MAAMwe,EAAajM,EAAS,GAAG0E,KAAK,KAAOpR,KAAKnE,IAAIzB,MAAMwe,EAAOpP,GAErExJ,KAAKnE,IAAIzB,MAAMwe,EAAOpP,GAIrC,OAAOqP,EAAMzH,KAAK,KAIpBgH,EAAWngB,UAAUsK,MAAQA,EAG7B9F,EAAO7C,QAAUwe,G,oCCjOjB,SAASW,EAAkBrc,EAAOsG,GAChC,IAAIgW,EAAWC,EAAWC,EAAQC,EAAQC,EAAcC,EACpDC,EAAYC,EACZC,EAAgB,GAChBrc,EAAM6F,EAAWvB,OAErB,IAAKuX,EAAY,EAAGA,EAAY7b,EAAK6b,IASnC,IARAE,EAASlW,EAAWgW,IAMbvX,OAASyX,EAAOzX,QAAU,EAE5ByX,EAAOrK,MAAZ,CAmBA,IAbK2K,EAActhB,eAAeghB,EAAO1U,UACvCgV,EAAcN,EAAO1U,QAAU,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,IAGxD4U,EAAeI,EAAcN,EAAO1U,SAAS0U,EAAOtK,KAAO,EAAI,GAAMsK,EAAOzX,OAAS,IAErFwX,EAAYD,EAAYE,EAAOvK,KAAO,IAGrB,IAAGsK,GAAa,GAEjCI,EAAkBJ,EAEXA,EAAYG,EAAcH,GAAaE,EAAOxK,KAAO,EAG1D,IAFAwK,EAASnW,EAAWiW,IAETzU,SAAW0U,EAAO1U,QAEzB2U,EAAOvK,MAAQuK,EAAO3K,IAAM,IAE9B8K,MASIH,EAAOtK,OAASqK,EAAOtK,QACpBuK,EAAO1X,OAASyX,EAAOzX,QAAU,GAAM,IACtC0X,EAAO1X,OAAS,GAAM,GAAKyX,EAAOzX,OAAS,GAAM,IACnD6X,QAKDA,GAAY,CAKfC,EAAWN,EAAY,IAAMjW,EAAWiW,EAAY,GAAGrK,KACrD5L,EAAWiW,EAAY,GAAGtK,KAAO,EACjC,EAEFuK,EAAOvK,KAAQqK,EAAYC,EAAYM,EACvCL,EAAOtK,QACPuK,EAAO3K,IAAQwK,EACfG,EAAOxK,KAAQ4K,EACfJ,EAAOtK,SACPwK,GAAmB,EACnB,OAKmB,IAArBA,IAQFG,EAAcN,EAAO1U,SAAS0U,EAAOtK,KAAO,EAAI,IAAOsK,EAAOzX,QAAU,GAAK,GAAM4X,IAMzF5c,EAAO7C,QAAU,SAAoB8C,GACnC,IAAI6M,EACA5G,EAAcjG,EAAMiG,YACpBxF,EAAMT,EAAMiG,YAAYlB,OAI5B,IAFAsX,EAAkBrc,EAAOA,EAAMsG,YAE1BuG,EAAO,EAAGA,EAAOpM,EAAKoM,IACrB5G,EAAY4G,IAAS5G,EAAY4G,GAAMvG,YACzC+V,EAAkBrc,EAAOiG,EAAY4G,GAAMvG,c,4CC1GjD,GAEA,IAAIyW,EAAOrgB,EAAQ,QACfub,EAAOvb,EAAQ,QAEfsgB,EAAWtgB,EAAQ,QACnBugB,EAAW,GACHvgB,EAAQ,QAEdkB,SAAQ,SAAS+I,GACrBsW,EAAStW,GAAQjK,EAAA,OAAAA,CAAQ,KAAaiK,MAGxC,IAAIuW,EAAgB,OAEpB,SAASC,EAAOxS,EAAQyS,GACtB,IAAIzW,EAAOqW,EAASrS,EAAQyS,GAE5B,GAAIzW,KAAQsW,EAAU,CACpB,IAAII,EAAOJ,EAAStW,GAAM2W,UAAU3S,EAAQyS,GAC5C,QAAIC,EAEF,OADAA,EAAK1W,KAAOA,EACL0W,EAIX,MAAM,IAAIxf,UAAU,yBAGtB,SAAS0f,EAAkBH,EAAUI,GACnCT,EAAG7K,KAAKkL,EAAU,KAAK,SAASK,EAAMC,GACpC,GAAID,EACF,OAAOD,EAASC,GAGlB,IAAIJ,EAAON,EAAGY,UAAUD,GAAYL,KAChCO,EAAaxM,KAAKC,IAAIgM,EAAMH,GAC5BvS,EAAS,IAAIkT,EAAOD,GACxBb,EAAGe,KAAKJ,EAAY/S,EAAQ,EAAGiT,EAAY,GAAG,SAASG,GACrD,GAAIA,EACF,OAAOP,EAASO,GAGlBhB,EAAG5K,MAAMuL,GAAY,SAASM,GAC5BR,EAASQ,EAAMrT,YAMvB,SAASsT,EAAiBb,GACxB,IAAIM,EAAaX,EAAGmB,SAASd,EAAU,KACnCC,EAAON,EAAGY,UAAUD,GAAYL,KAChCO,EAAaxM,KAAKC,IAAIgM,EAAMH,GAC5BvS,EAAS,IAAIkT,EAAOD,GAGxB,OAFAb,EAAGoB,SAAST,EAAY/S,EAAQ,EAAGiT,EAAY,GAC/Cb,EAAGqB,UAAUV,GACN/S,EAQT5K,EAAO7C,QAAU,SAASmhB,EAAOb,GAC/B,GAAqB,iBAAVa,EACT,MAAM,IAAIxgB,UAAU,2BAGtB,IAAIuf,EAAWnF,EAAKqG,QAAQD,GAE5B,GAAwB,mBAAbb,EAgBT,OAAOL,EADMc,EAAiBb,GACRA,GAftBG,EAAkBH,GAAU,SAASmB,EAAK5T,GACxC,GAAI4T,EACF,OAAOf,EAASe,GAGlB,IAAI/C,EACJ,IACEA,EAAa2B,EAAOxS,EAAQyS,GAC5B,MAAOrV,GACPwW,EAAMxW,EAERyV,EAASe,EAAK/C,S,iEC/EpBzb,EAAO7C,QAAU,CACfmG,QAAS,CACPgJ,MAAKA,EACLC,UAASA,EACTC,QAAOA,EACPC,WAAc,YACd7I,SAAQA,EAGR8I,aAAYA,EAOZC,OAAQ,OAQRC,UAAW,KAEXC,WAAc,KAGhB3I,WAAY,CAEVR,KAAM,GACND,MAAO,GACPD,OAAQ,M,uBCtCZ7G,EAAQ,QACRqD,EAAO7C,QAAUR,EAAQ,QAAuBpB,OAAOwC,M,oCCDvD,uBAA2nB,G,oCCiD3nB,SAAS2T,EAAYzR,EAAOsG,GAC1B,IAAI0E,EAAG0G,EACHC,EACAC,EACAtR,EACAuR,EAAc,GACdpR,EAAM6F,EAAWvB,OAErB,IAAKiG,EAAI,EAAGA,EAAIvK,EAAKuK,IAGO,OAF1B2G,EAAarL,EAAW0E,IAETlD,SAIS,IAApB6J,EAAWG,MAIfF,EAAWtL,EAAWqL,EAAWG,MAEjCxR,EAAgBN,EAAMwF,OAAOmM,EAAWrR,QAClCqG,KAAU,SAChBrG,EAAMsG,IAAU,IAChBtG,EAAMuG,QAAU,EAChBvG,EAAMW,OAAU,KAChBX,EAAMa,QAAU,IAEhBb,EAAgBN,EAAMwF,OAAOoM,EAAStR,QAChCqG,KAAU,UAChBrG,EAAMsG,IAAU,IAChBtG,EAAMuG,SAAW,EACjBvG,EAAMW,OAAU,KAChBX,EAAMa,QAAU,GAE8B,SAA1CnB,EAAMwF,OAAOoM,EAAStR,MAAQ,GAAGqG,MACY,MAA7C3G,EAAMwF,OAAOoM,EAAStR,MAAQ,GAAGa,SAEnC0Q,EAAY7Q,KAAK4Q,EAAStR,MAAQ,IAUtC,KAAOuR,EAAY9M,QAAQ,CAIzB,IAFA2M,GADA1G,EAAI6G,EAAY9K,OACR,EAED2K,EAAI1R,EAAMwF,OAAOT,QAAmC,YAAzB/E,EAAMwF,OAAOkM,GAAG/K,MAChD+K,IAKE1G,MAFJ0G,IAGEpR,EAAQN,EAAMwF,OAAOkM,GACrB1R,EAAMwF,OAAOkM,GAAK1R,EAAMwF,OAAOwF,GAC/BhL,EAAMwF,OAAOwF,GAAK1K,IAvGxBP,EAAO7C,QAAQoU,SAAW,SAAuBtR,EAAOG,GACtD,IAAI6K,EAAG+G,EAAgBC,EAAKjV,EACxBkK,EAAQjH,EAAMZ,IACd0I,EAAS9H,EAAMb,IAAIP,WAAWqI,GAElC,GAAI9G,EAAU,OAAM,EAEpB,GAAe,MAAX2H,EAA0B,OAAM,EAMpC,GAHAkK,GADAD,EAAU/R,EAAMgH,WAAWhH,EAAMZ,KAAIA,IACvB2F,OACdhI,EAAKb,OAAOC,aAAa2L,GAErBkK,EAAM,EAAK,OAAM,EAQrB,IANIA,EAAM,IACQhS,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUpE,EAChBiV,KAGGhH,EAAI,EAAGA,EAAIgH,EAAKhH,GAAK,EACRhL,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUpE,EAAKA,EAErBiD,EAAMsG,WAAWtF,KAAK,CACpB8G,OAAQA,EACR/C,OAAQ,EACRkN,KAAQjH,EAAI,EACZ1K,MAAQN,EAAMwF,OAAOT,OAAS,EAC9B+M,KAAS,EACTI,KAAQH,EAAQzK,SAChB6K,MAAQJ,EAAQxK,YAMpB,OAFAvH,EAAMZ,KAAO2S,EAAQhN,WA2EvBhF,EAAO7C,QAAQuU,YAAc,SAAuBzR,GAClD,IAAI6M,EACA5G,EAAcjG,EAAMiG,YACpBxF,EAAMT,EAAMiG,YAAYlB,OAI5B,IAFA0M,EAAYzR,EAAOA,EAAMsG,YAEpBuG,EAAO,EAAGA,EAAOpM,EAAKoM,IACrB5G,EAAY4G,IAAS5G,EAAY4G,GAAMvG,YACzCmL,EAAYzR,EAAOiG,EAAY4G,GAAMvG,c,oCC3H3C,IAAI1G,EAAuBlD,EAAQ,QAAmBkD,mBAClDL,EAAuB7C,EAAQ,QAAmB6C,QAGtDQ,EAAO7C,QAAU,SAAe8C,EAAOG,GACrC,IAAI+M,EACAvO,EACAwC,EACAmJ,EACAyQ,EACAC,EACA5b,EACA6b,EACA5D,EACA6D,EACA5a,EACAkF,EACAyB,EACAkU,EAAO,GACPC,EAASpb,EAAMZ,IACfqB,EAAMT,EAAMkG,OAEhB,GAAwC,KAApClG,EAAMb,IAAIP,WAAWoB,EAAMZ,KAAwB,OAAM,EAC7D,GAA4C,KAAxCY,EAAMb,IAAIP,WAAWoB,EAAMZ,IAAM,GAAsB,OAAM,EAMjE,GAJA4b,EAAahb,EAAMZ,IAAM,GACzB2b,EAAW/a,EAAM+F,GAAGzE,QAAQyS,eAAe/T,EAAOA,EAAMZ,IAAM,GAAE,IAGjD,EAAK,OAAM,EAG1B,IADAA,EAAM2b,EAAW,GACPta,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,GAAsB,CAQ1D,IADAA,IACOA,EAAMqB,IACX9B,EAAOqB,EAAMb,IAAIP,WAAWQ,GACvBG,EAAQZ,IAAkB,KAATA,GAFNS,KAIlB,GAAIA,GAAOqB,EAAO,OAAM,EAkBxB,IAdAwG,EAAQ7H,GACRiY,EAAMrX,EAAM+F,GAAGzE,QAAQ0S,qBAAqBhU,EAAMb,IAAKC,EAAKY,EAAMkG,SAC1DmH,KACN8N,EAAOnb,EAAM+F,GAAGzD,cAAc+U,EAAIlZ,KAC9B6B,EAAM+F,GAAG5D,aAAagZ,GACxB/b,EAAMiY,EAAIjY,IAEV+b,EAAO,IAMXlU,EAAQ7H,EACDA,EAAMqB,IACX9B,EAAOqB,EAAMb,IAAIP,WAAWQ,GACvBG,EAAQZ,IAAkB,KAATA,GAFNS,KAQlB,GADAiY,EAAMrX,EAAM+F,GAAGzE,QAAQ2S,eAAejU,EAAMb,IAAKC,EAAKY,EAAMkG,QACxD9G,EAAMqB,GAAOwG,IAAU7H,GAAOiY,EAAIhK,GAMpC,IALA6N,EAAQ7D,EAAIlZ,IACZiB,EAAMiY,EAAIjY,IAIHA,EAAMqB,IACX9B,EAAOqB,EAAMb,IAAIP,WAAWQ,GACvBG,EAAQZ,IAAkB,KAATA,GAFNS,UAKlB8b,EAAQ,GAGV,GAAI9b,GAAOqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,GAErC,OADAY,EAAMZ,IAAMgc,KAGdhc,QACK,CAIL,QAAoC,IAAzBY,EAAMqF,IAAIgW,WAA8B,OAAM,EAmBzD,GAjBIjc,EAAMqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,IACpC6H,EAAQ7H,EAAM,GACdA,EAAMY,EAAM+F,GAAGzE,QAAQyS,eAAe/T,EAAOZ,KAClC,EACTkL,EAAQtK,EAAMb,IAAIzB,MAAMuJ,EAAO7H,KAE/BA,EAAM2b,EAAW,GAGnB3b,EAAM2b,EAAW,EAKdzQ,IAASA,EAAQtK,EAAMb,IAAIzB,MAAMsd,EAAYD,MAElDE,EAAMjb,EAAMqF,IAAIgW,WAAWzb,EAAmB0K,KAG5C,OADAtK,EAAMZ,IAAMgc,KAGdD,EAAOF,EAAIE,KACXD,EAAQD,EAAIC,MA6Bd,OAtBK/a,IACHgB,EAAUnB,EAAMb,IAAIzB,MAAMsd,EAAYD,GAEtC/a,EAAM+F,GAAGxC,OAAOf,MACdrB,EACAnB,EAAM+F,GACN/F,EAAMqF,IACNG,EAAS,KAGXlF,EAAiBN,EAAMgB,KAAK,QAAS,MAAO,IACtCkM,MAAWA,EAAQ,CAAE,CAAE,MAAOiO,GAAQ,CAAE,MAAO,KACrD7a,EAAMc,SAAWoE,EACjBlF,EAAMa,QAAWA,EAEb+Z,GACFhO,EAAMlM,KAAK,CAAE,QAASka,KAI1Blb,EAAMZ,IAAMA,EACZY,EAAMkG,OAASzF,O,2DC9IjB,IAAIvB,EAAiBxC,EAAQ,QAAmBwC,eAGhD,SAASsf,EAAWrgB,GAClB,MAAO,YAAYU,KAAKV,GAE1B,SAASsgB,EAAYtgB,GACnB,MAAO,aAAaU,KAAKV,GAI3B4B,EAAO7C,QAAU,SAAiB8C,GAChC,IAAIgL,EAAG0G,EAAG/F,EAAGnG,EAAQlF,EAAOoe,EAAcC,EAAOC,EAAIpF,EAAMpa,EAAK8a,EAC5D9Z,EAAOye,EAAezc,EAAK6K,EAAS6R,EAEpCC,EADAC,EAAchf,EAAMwF,OAGxB,GAAKxF,EAAM+F,GAAG1C,QAAQM,QAEtB,IAAK+N,EAAI,EAAG/F,EAAIqT,EAAYja,OAAQ2M,EAAI/F,EAAG+F,IACzC,GAA4B,WAAxBsN,EAAYtN,GAAG/K,MACd3G,EAAM+F,GAAGpC,QAAQsb,QAAQD,EAAYtN,GAAGvQ,SAU7C,IAJA0d,EAAgB,EAIX7T,GANLxF,EAASwZ,EAAYtN,GAAGtQ,UAMR2D,OAAS,EAAGiG,GAAK,EAAGA,IAIlC,GAA0B,gBAH1B0T,EAAelZ,EAAOwF,IAGLrE,MAiBjB,GAR0B,gBAAtB+X,EAAa/X,OACX6X,EAAWE,EAAavd,UAAY0d,EAAgB,GACtDA,IAEEJ,EAAYC,EAAavd,UAC3B0d,OAGAA,EAAgB,IAEM,SAAtBH,EAAa/X,MAAmB3G,EAAM+F,GAAGpC,QAAQ9E,KAAK6f,EAAavd,SAAU,CAU/E,IARAqY,EAAOkF,EAAavd,QACpB4d,EAAQ/e,EAAM+F,GAAGpC,QAAQpF,MAAMib,GAG/BmF,EAAQ,GACRve,EAAQse,EAAate,MACrB8Z,EAAU,EAEL0E,EAAK,EAAGA,EAAKG,EAAMha,OAAQ6Z,IAE9Bxc,EAAM2c,EAAMH,GAAIxc,IAChB6K,EAAUjN,EAAM+F,GAAGzD,cAAcF,GAC5BpC,EAAM+F,GAAG5D,aAAa8K,KAE3B6R,EAAUC,EAAMH,GAAIpF,KAWlBsF,EALGC,EAAMH,GAAIM,OAEiB,YAArBH,EAAMH,GAAIM,QAAyB,YAAYrgB,KAAKigB,GAGnD9e,EAAM+F,GAAGhD,kBAAkB+b,GAF3B9e,EAAM+F,GAAGhD,kBAAkB,UAAY+b,GAASzgB,QAAQ,WAAY,IAFpE2B,EAAM+F,GAAGhD,kBAAkB,UAAY+b,GAASzgB,QAAQ,aAAc,KAOlFe,EAAM2f,EAAMH,GAAI7P,OAENmL,KACR5Z,EAAgB,IAAIN,EAAM6F,MAAM,OAAQ,GAAI,IACtC1E,QAAUqY,EAAK9b,MAAMwc,EAAS9a,GACpCkB,EAAMF,MAAUA,EAChBue,EAAM3d,KAAKV,KAGbA,EAAgB,IAAIN,EAAM6F,MAAM,YAAa,IAAK,IAC5CqH,MAAU,CAAE,CAAE,OAAQD,IAC5B3M,EAAMF,MAAUA,IAChBE,EAAMW,OAAU,UAChBX,EAAM6M,KAAU,OAChBwR,EAAM3d,KAAKV,IAEXA,EAAgB,IAAIN,EAAM6F,MAAM,OAAQ,GAAI,IACtC1E,QAAU2d,EAChBxe,EAAMF,MAAUA,EAChBue,EAAM3d,KAAKV,IAEXA,EAAgB,IAAIN,EAAM6F,MAAM,aAAc,KAAM,IAC9CzF,QAAYA,EAClBE,EAAMW,OAAU,UAChBX,EAAM6M,KAAU,OAChBwR,EAAM3d,KAAKV,GAEX4Z,EAAU6E,EAAMH,GAAIO,WAElBjF,EAAUV,EAAKzU,UACjBzE,EAAgB,IAAIN,EAAM6F,MAAM,OAAQ,GAAI,IACtC1E,QAAUqY,EAAK9b,MAAMwc,GAC3B5Z,EAAMF,MAAUA,EAChBue,EAAM3d,KAAKV,IAIb0e,EAAYtN,GAAGtQ,SAAWoE,EAAStG,EAAesG,EAAQwF,EAAG2T,SApF7D,IADA3T,IACOxF,EAAOwF,GAAG5K,QAAUse,EAAate,OAA4B,cAAnBoF,EAAOwF,GAAGrE,MACzDqE,M,oCCxCVjL,EAAO7C,QAAU,SAAc8C,EAAOC,EAAWC,GAC/C,IAAI2L,EAAUiB,EAAMxM,EAEpB,GAAIN,EAAMW,OAAOV,GAAaD,EAAMY,UAAY,EAAK,OAAM,EAI3D,IAFAkM,EAAOjB,EAAW5L,EAAY,EAEvB4L,EAAW3L,GAChB,GAAIF,EAAMiM,QAAQJ,GAChBA,QADF,CAKA,KAAI7L,EAAMW,OAAOkL,GAAY7L,EAAMY,WAAa,GAKhD,MAHEkM,IADAjB,EAaJ,OANA7L,EAAMe,KAAO+L,GAEbxM,EAAgBN,EAAMgB,KAAK,aAAc,OAAQ,IAC3CG,QAAUnB,EAAMoM,SAASnM,EAAW6M,EAAM,EAAI9M,EAAMY,WAAUA,GAAU,KAC9EN,EAAMY,IAAU,CAAEjB,EAAWD,EAAMe,W,kCC5BrChB,EAAO7C,QAAU,SAAgB8C,GAC/B,IAA2Bof,EAAKpU,EAAGW,EAA/BnG,EAASxF,EAAMwF,OAGnB,IAAKwF,EAAI,EAAGW,EAAInG,EAAOT,OAAQiG,EAAIW,EAAGX,IAEnB,YADjBoU,EAAM5Z,EAAOwF,IACLrE,MACN3G,EAAM+F,GAAGxC,OAAOf,MAAM4c,EAAIje,QAASnB,EAAM+F,GAAI/F,EAAMqF,IAAK+Z,EAAIhe,Y,qBCTlErB,EAAO7C,QAAUR,EAAQ,S,yDCSzB,IAAIyR,EAASzR,EAAQ,QAGjB4V,EAAS,CACX,CAAE,YAAkB5V,EAAQ,SAC5B,CAAE,QAAkBA,EAAQ,SAC5B,CAAE,SAAkBA,EAAQ,SAC5B,CAAE,UAAkBA,EAAQ,SAC5B,CAAE,eAAkBA,EAAQ,SAC5B,CAAE,cAAkBA,EAAQ,UAO9B,SAAS2iB,IAMP/b,KAAKa,MAAQ,IAAIgK,EAEjB,IAAK,IAAInD,EAAI,EAAGA,EAAIsH,EAAOvN,OAAQiG,IACjC1H,KAAKa,MAAMnD,KAAKsR,EAAOtH,GAAG,GAAIsH,EAAOtH,GAAG,IAU5CqU,EAAK9jB,UAAUgK,QAAU,SAAUvF,GACjC,IAAIgL,EAAGW,EAAGzH,EAIV,IAAK8G,EAAI,EAAGW,GAFZzH,EAAQZ,KAAKa,MAAM4H,SAAS,KAENhH,OAAQiG,EAAIW,EAAGX,IACnC9G,EAAM8G,GAAGhL,IAIbqf,EAAK9jB,UAAU+J,MAAQ5I,EAAQ,QAG/BqD,EAAO7C,QAAUmiB,G,kCCvDjBtf,EAAO7C,QAAU,CACf,MACA,MACA,MACA,MACA,S,01wBCFF,IAAIsC,EAAiB9C,EAAQ,QAAmB8C,aAC5CE,EAAiBhD,EAAQ,QAAmBgD,YAC5CD,EAAiB/C,EAAQ,QAAmB+C,eAE5C6f,EAAgB,OAChBC,EAAW,QAIf,SAASC,EAAUrhB,EAAK4Q,EAAOhS,GAC7B,OAAOoB,EAAI4b,OAAO,EAAGhL,GAAShS,EAAKoB,EAAI4b,OAAOhL,EAAQ,GAGxD,SAAS0Q,EAAgBja,EAAQxF,GAC/B,IAAIgL,EAAG1K,EAAOkZ,EAAMzC,EAAG3X,EAAKqB,EAAKif,EAAWC,EAAMxY,EAAUC,EACxDK,EAAiBE,EAAiBH,EAAkBE,EACpDkY,EAASC,EAAUnO,EAAGoO,EAAUC,EAAOC,EAAWC,EAItD,IAFAF,EAAQ,GAEH/U,EAAI,EAAGA,EAAIxF,EAAOT,OAAQiG,IAAK,CAKlC,IAJA1K,EAAQkF,EAAOwF,GAEf0U,EAAYla,EAAOwF,GAAG5K,MAEjBsR,EAAIqO,EAAMhb,OAAS,EAAG2M,GAAK,KAC1BqO,EAAMrO,GAAGtR,OAASsf,GADWhO,KAKnC,GAFAqO,EAAMhb,OAAS2M,EAAI,EAEA,SAAfpR,EAAMqG,KAAV,CAGAvH,EAAM,EACNqB,GAFA+Y,EAAOlZ,EAAMa,SAEF4D,OAGXmb,EACA,KAAO9gB,EAAMqB,IACX8e,EAASJ,UAAY/f,EACrB2X,EAAIwI,EAASY,KAAK3G,KAFF,CAchB,GATAoG,EAAUC,KACVzgB,EAAM2X,EAAEhI,MAAQ,EAChB+Q,EAAqB,MAAT/I,EAAE,GAKd5P,EAAW,GAEP4P,EAAEhI,MAAQ,GAAK,EACjB5H,EAAWqS,EAAK5a,WAAWmY,EAAEhI,MAAQ,QAErC,IAAK2C,EAAI1G,EAAI,EAAG0G,GAAK,IACI,cAAnBlM,EAAOkM,GAAG/K,MAA2C,cAAnBnB,EAAOkM,GAAG/K,MAD1B+K,IAEtB,GAAKlM,EAAOkM,GAAGvQ,QAAf,CAEAgG,EAAW3B,EAAOkM,GAAGvQ,QAAQvC,WAAW4G,EAAOkM,GAAGvQ,QAAQ4D,OAAS,GACnE,MASJ,GAFAqC,EAAW,GAEPhI,EAAMqB,EACR2G,EAAWoS,EAAK5a,WAAWQ,QAE3B,IAAKsS,EAAI1G,EAAI,EAAG0G,EAAIlM,EAAOT,SACF,cAAnBS,EAAOkM,GAAG/K,MAA2C,cAAnBnB,EAAOkM,GAAG/K,MADf+K,IAEjC,GAAKlM,EAAOkM,GAAGvQ,QAAf,CAEAiG,EAAW5B,EAAOkM,GAAGvQ,QAAQvC,WAAW,GACxC,MA6CJ,GAzCA6I,EAAkBhI,EAAe0H,IAAazH,EAAYxD,OAAOC,aAAagL,IAC9EQ,EAAkBlI,EAAe2H,IAAa1H,EAAYxD,OAAOC,aAAaiL,IAE9EI,EAAmBhI,EAAa2H,IAChCO,EAAmBlI,EAAa4H,IAG9BwY,KACSjY,IACHH,GAAoBC,IACxBmY,OAIApY,EACFqY,KACSpY,IACHC,GAAoBC,IACxBkY,OAIa,KAAbzY,GAAsC,MAAT2P,EAAE,IAC7B5P,GAAY,IAAgBA,GAAY,KAE1C0Y,EAAWD,MAIXA,GAAWC,IAQbD,EAAUnY,EACVoY,EAAWlY,GAGRiY,GAAYC,EAAjB,CAQA,GAAIA,EAEF,IAAKnO,EAAIqO,EAAMhb,OAAS,EAAG2M,GAAK,IAC9BiO,EAAOI,EAAMrO,KACTqO,EAAMrO,GAAGtR,MAAQsf,IAFYhO,IAGjC,GAAIiO,EAAKS,SAAWN,GAAYC,EAAMrO,GAAGtR,QAAUsf,EAAW,CAC5DC,EAAOI,EAAMrO,GAEToO,GACFE,EAAYhgB,EAAM+F,GAAG1C,QAAQqJ,OAAO,GACpCuT,EAAajgB,EAAM+F,GAAG1C,QAAQqJ,OAAO,KAErCsT,EAAYhgB,EAAM+F,GAAG1C,QAAQqJ,OAAO,GACpCuT,EAAajgB,EAAM+F,GAAG1C,QAAQqJ,OAAO,IAMvCpM,EAAMa,QAAUqe,EAAUlf,EAAMa,QAAS4V,EAAEhI,MAAOkR,GAClDza,EAAOma,EAAKrf,OAAOa,QAAUqe,EAC3Bha,EAAOma,EAAKrf,OAAOa,QAASwe,EAAKvgB,IAAK4gB,GAExC5gB,GAAO6gB,EAAWlb,OAAS,EACvB4a,EAAKrf,QAAU0K,IAAK5L,GAAO4gB,EAAUjb,OAAS,GAGlDtE,GADA+Y,EAAOlZ,EAAMa,SACF4D,OAEXgb,EAAMhb,OAAS2M,EACf,SAASwO,EAKXN,EACFG,EAAM/e,KAAK,CACTV,MAAO0K,EACP5L,IAAK2X,EAAEhI,MACPqR,OAAQN,EACR1f,MAAOsf,IAEAG,GAAYC,IACrBxf,EAAMa,QAAUqe,EAAUlf,EAAMa,QAAS4V,EAAEhI,MAvKlC,WAsHL+Q,IACFxf,EAAMa,QAAUqe,EAAUlf,EAAMa,QAAS4V,EAAEhI,MAvHpC,SA8KjBhP,EAAO7C,QAAU,SAAqB8C,GAEpC,IAAIqgB,EAEJ,GAAKrgB,EAAM+F,GAAG1C,QAAQoJ,YAEtB,IAAK4T,EAASrgB,EAAMwF,OAAOT,OAAS,EAAGsb,GAAU,EAAGA,IAEhB,WAA9BrgB,EAAMwF,OAAO6a,GAAQ1Z,MACpB2Y,EAAczgB,KAAKmB,EAAMwF,OAAO6a,GAAQlf,UAI7Cse,EAAgBzf,EAAMwF,OAAO6a,GAAQjf,SAAUpB,K,kCCpMnD,IAAIsgB,EAAS,kBAKb,IAAIC,EACM,cADNA,EAEO,6BAFPA,EAGQ,8BAHRA,EAIS,+BAiBb,SAAS/d,EAAOmI,GACd,IACI6V,EADO7V,EAAO3M,WAAWK,QAAQ,aAAc,KAChCE,MAAMgiB,GACrBE,EAAOD,GAAWA,EAAQ,GAC9B,GAAIC,EAAM,CACR,IAAIlT,EAAQkT,EAAKliB,MAAMgiB,GACnB/S,EAASiT,EAAKliB,MAAMgiB,GAEpBG,EAtBR,SAAmBC,GACjB,IAAID,EAAQ,EACZ,GAAIC,GAAWA,EAAQ,GAAI,CACzB,IAAIC,EAAMD,EAAQ,GAAGrL,MAAM,OACR,IAAfsL,EAAI7b,SAIN2b,IAHAE,EAAMA,EAAI1f,KAAI,SAAU8J,GACtB,OAAOjM,SAASiM,EAAG,QAER,GAAK4V,EAAI,KAAOA,EAAI,GAAKA,EAAI,KAG9C,OAAOF,EAWOG,CADEJ,EAAKliB,MAAMgiB,IAEzB,MAAO,CACL,MAASxhB,SAASwO,GAASA,EAAM,GAAI,KAAO,EAC5C,OAAUxO,SAASyO,GAAUA,EAAO,GAAI,KAAO,EAC/C,MAASkT,IAyBf3gB,EAAO7C,QAAU,CACf,OA/DF,SAAgByN,GACd,OAAO2V,EAAOzhB,KAAK8L,IA+DnB,UAtBF,SAAoBA,GAElB,IAAIpI,EAASC,EAAMmI,GACf4C,EAAQhL,EAAOgL,MACfC,EAASjL,EAAOiL,OAChBkT,EAAQne,EAAOme,MAEnB,GAAInT,GAASC,EACX,MAAO,CAAE,MAASD,EAAO,OAAUC,GAEnC,GAAID,EACF,MAAO,CAAE,MAASA,EAAO,OAAU6D,KAAKiF,MAAM9I,EAAQmT,IACjD,GAAIlT,EACT,MAAO,CAAE,MAAS4D,KAAKiF,MAAM7I,EAASkT,GAAQ,OAAUlT,GAExD,MAAM,IAAI3P,UAAU,kB,kCCzD1BkC,EAAO7C,QAAU,SAAU4jB,GACzB,IAAIC,EAAK,GAGTA,EAAGC,QAAUtkB,EAAQ,QAAiCH,OACtDwkB,EAAGE,OAAUvkB,EAAQ,QAAgCH,OACrDwkB,EAAGG,MAAUxkB,EAAQ,QAA+BH,OACpDwkB,EAAGI,MAAUzkB,EAAQ,QAA+BH,OAGpDwkB,EAAGK,SAAW,CAAEL,EAAGG,MAAOH,EAAGI,MAAOJ,EAAGE,QAASvM,KAAK,KAGrDqM,EAAGM,QAAU,CAAEN,EAAGG,MAAOH,EAAGE,QAASvM,KAAK,KAI1C,IAAI4M,EAAkB,QA+JtB,OA1JAP,EAAGQ,kBAA0B,eAAmCR,EAAGK,SAAW,IAAML,EAAGC,QAAU,IAMjGD,EAAGS,QAED,yFAGFT,EAAGU,SAAc,YAAcV,EAAGM,QAAU,uBAE5CN,EAAGW,SAED,kFAEFX,EAAGY,oBAED,cAAkCZ,EAAGK,SAAW,6BAA+BL,EAAGK,SAAW,KAE/FL,EAAGa,SAED,iBAGcb,EAAGM,QAAU,IAAMC,EAAkB,qCAC/BP,EAAGM,QAAU,wBACbN,EAAGM,QAAU,wBACbN,EAAGM,QAAU,wBACbN,EAAGM,QAAU,yBACbN,EAAGM,QAAU,qBAChBN,EAAGQ,kBAAoB,sCASvBR,EAAGM,QAAU,WACvBP,GAAQA,EAAK,OACZ,6BAEA,SAEF,OAASC,EAAGM,QAAU,UACbN,EAAGM,QAAU,aACVN,EAAGM,QAAU,gBACdN,EAAGM,QAAU,iBAOhCN,EAAGc,eAED,iEAEFd,EAAGe,OAED,wBAKFf,EAAGgB,gBAGD,MACEhB,EAAGe,OACH,IACAf,EAAGQ,kBAAoB,UAG3BR,EAAGiB,WAED,MACEjB,EAAGe,OACH,OACQf,EAAGQ,kBAAoB,QAEvBR,EAAGQ,kBAAoB,QAAUR,EAAGQ,kBAAoB,UAAYR,EAAGQ,kBAAoB,KAGvGR,EAAGkB,SAED,eAIgBlB,EAAGiB,WAAa,SAAWjB,EAAGiB,WAAsB,KAGtEjB,EAAGmB,eAED,MACEnB,EAAGS,QACL,aACgBT,EAAGiB,WAAa,qBAGlCjB,EAAGoB,qBAED,YAAcpB,EAAGiB,WAAa,oBAEhCjB,EAAGqB,gBAEDrB,EAAGkB,SAAWlB,EAAGY,oBAEnBZ,EAAGsB,sBAEDtB,EAAGmB,eAAiBnB,EAAGY,oBAEzBZ,EAAGuB,qBAEDvB,EAAGkB,SAAWlB,EAAGW,SAAWX,EAAGY,oBAEjCZ,EAAGwB,2BAEDxB,EAAGmB,eAAiBnB,EAAGW,SAAWX,EAAGY,oBAEvCZ,EAAGyB,iCAEDzB,EAAGoB,qBAAuBpB,EAAGW,SAAWX,EAAGY,oBAO7CZ,EAAG0B,oBAED,sDAAwD1B,EAAGK,SAAW,SAExEL,EAAG2B,gBAEC,kBAAsC3B,EAAGM,QAAU,KAC7CN,EAAGc,eAAiB,IAAMd,EAAGsB,sBAAwB,IAE/DtB,EAAG4B,eAGC,mCAA0C5B,EAAGK,SAAW,qBAC9BL,EAAGwB,2BAA6BxB,EAAGa,SAAW,IAE5Eb,EAAG6B,qBAGC,mCAA0C7B,EAAGK,SAAW,qBAC9BL,EAAGyB,iCAAmCzB,EAAGa,SAAW,IAE3Eb,I,yDCtKT,SAAS8B,EAAiB9lB,GACxB,OAAQA,GACN,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACH,OAAM,EACR,QACE,OAAM,GAIZgD,EAAO7C,QAAU,SAAc8C,EAAOG,GAGpC,IAFA,IAAIf,EAAMY,EAAMZ,IAETA,EAAMY,EAAMkG,SAAW2c,EAAiB7iB,EAAMb,IAAIP,WAAWQ,KAClEA,IAGF,OAAIA,IAAQY,EAAMZ,MAEbe,IAAUH,EAAMmG,SAAWnG,EAAMb,IAAIzB,MAAMsC,EAAMZ,IAAKA,IAE3DY,EAAMZ,IAAMA,Q,kCCtCd,IAAI0jB,EAAU,+BAIVC,EAAsB,kBAEtBC,EAAiB,mBACjBC,EAAc,CAChBnnB,EAAG,IACHY,EAAG,IACHwmB,EAAG,IACHC,GAAI,KAGN,SAASC,EAAU7kB,EAAOG,GACxB,OAAOukB,EAAYvkB,EAAKI,eAG1B,SAASukB,EAAeC,GACtB,IAAItY,EAAG1K,EAAOijB,EAAkB,EAEhC,IAAKvY,EAAIsY,EAAave,OAAS,EAAGiG,GAAK,EAAGA,IAGrB,UAFnB1K,EAAQgjB,EAAatY,IAEXrE,MAAoB4c,IAC5BjjB,EAAMa,QAAUb,EAAMa,QAAQ9C,QAAQ2kB,EAAgBI,IAGrC,cAAf9iB,EAAMqG,MAAuC,SAAfrG,EAAM6M,MACtCoW,IAGiB,eAAfjjB,EAAMqG,MAAwC,SAAfrG,EAAM6M,MACvCoW,IAKN,SAASC,EAAaF,GACpB,IAAItY,EAAG1K,EAAOijB,EAAkB,EAEhC,IAAKvY,EAAIsY,EAAave,OAAS,EAAGiG,GAAK,EAAGA,IAGrB,UAFnB1K,EAAQgjB,EAAatY,IAEXrE,MAAoB4c,GACxBT,EAAQjkB,KAAKyB,EAAMa,WACrBb,EAAMa,QAAUb,EAAMa,QACnB9C,QAAQ,OAAQ,KAGhBA,QAAQ,UAAW,KAAKA,QAAQ,WAAY,QAC5CA,QAAQ,cAAe,UAAUA,QAAQ,SAAU,KAEnDA,QAAQ,0BAA2B,OAEnCA,QAAQ,qBAAsB,OAC9BA,QAAQ,6BAA8B,QAI1B,cAAfiC,EAAMqG,MAAuC,SAAfrG,EAAM6M,MACtCoW,IAGiB,eAAfjjB,EAAMqG,MAAwC,SAAfrG,EAAM6M,MACvCoW,IAMNxjB,EAAO7C,QAAU,SAAiB8C,GAChC,IAAIqgB,EAEJ,GAAKrgB,EAAM+F,GAAG1C,QAAQoJ,YAEtB,IAAK4T,EAASrgB,EAAMwF,OAAOT,OAAS,EAAGsb,GAAU,EAAGA,IAEhB,WAA9BrgB,EAAMwF,OAAO6a,GAAQ1Z,OAErBoc,EAAoBlkB,KAAKmB,EAAMwF,OAAO6a,GAAQlf,UAChDkiB,EAAerjB,EAAMwF,OAAO6a,GAAQjf,UAGlC0hB,EAAQjkB,KAAKmB,EAAMwF,OAAO6a,GAAQlf,UACpCqiB,EAAaxjB,EAAMwF,OAAO6a,GAAQjf,a,kCCjGxCrB,EAAO7C,QAAUR,EAAQ,S,kCCAzBqD,EAAO7C,QAAU,SAAe8C,EAAOC,EAAWC,EAASC,GACzD,IAAI2H,EAAQkK,EAAK4D,EAAQ/J,EAAU4X,EAAKnjB,EAAOW,EAC3CyiB,KACAtkB,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GAGvB,GAAID,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAE5D,GAAIxB,EAAM,EAAIqB,EAAO,OAAM,EAI3B,GAAe,OAFfqH,EAAS9H,EAAMb,IAAIP,WAAWQ,KAEW,KAAX0I,EAC5B,OAAM,EASR,GALA2b,EAAMrkB,GAGN4S,GAFA5S,EAAMY,EAAMkM,UAAU9M,EAAK0I,IAEf2b,GAEF,EAAK,OAAM,EAKrB,GAHAxiB,EAASjB,EAAMb,IAAIzB,MAAM+lB,EAAKrkB,GAC9BwW,EAAS5V,EAAMb,IAAIzB,MAAM0B,EAAKqB,GAEf,KAAXqH,GACE8N,EAAOxX,QAAQlC,OAAOC,aAAa2L,KAAY,EACjD,OAAM,EAKV,GAAI3H,EAAU,OAAM,EAKpB,IAFA0L,EAAW5L,MAGT4L,GACgB3L,OAMhBd,EAAMqkB,EAAMzjB,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,KAClDpL,EAAMT,EAAMU,OAAOmL,KAEF7L,EAAMW,OAAOkL,GAAY7L,EAAMY,YAOhD,KAAIZ,EAAMb,IAAIP,WAAWQ,KAAS0I,GAE9B9H,EAAMW,OAAOkL,GAAY7L,EAAMY,WAAa,IAKhDxB,EAAMY,EAAMkM,UAAU9M,EAAK0I,GAGvB1I,EAAMqkB,EAAMzR,IAGhB5S,EAAMY,EAAMmM,WAAW/M,GAEnBA,EAAMqB,KAAV,CAEAijB,KAEA,MAcF,OAVA1R,EAAMhS,EAAMW,OAAOV,GAEnBD,EAAMe,KAAO8K,GAAY6X,EAAgB,EAAI,IAE7CpjB,EAAgBN,EAAMgB,KAAK,QAAS,OAAQ,IACtCmM,KAAUyI,EAChBtV,EAAMa,QAAUnB,EAAMoM,SAASnM,EAAY,EAAG4L,EAAUmG,MACxD1R,EAAMW,OAAUA,EAChBX,EAAMY,IAAU,CAAEjB,EAAWD,EAAMe,W,qBC9FrChB,EAAO7C,QAAU,IAA0B,+B,kCCK3C,IAAIkX,EAAc1X,EAAQ,QAAqB0X,YAU/CrU,EAAO7C,QAAU,SAAqB8C,EAAOG,GAC3C,IAAIpD,EAAIwB,EAAOkC,EAAKH,EAChBlB,EAAMY,EAAMZ,IAEhB,SAAKY,EAAM+F,GAAG1C,QAAQgJ,OAGtB5L,EAAMT,EAAMkG,OACsB,KAA9BlG,EAAMb,IAAIP,WAAWQ,IACrBA,EAAM,GAAKqB,IAKf1D,EAAKiD,EAAMb,IAAIP,WAAWQ,EAAM,GACrB,KAAPrC,GACO,KAAPA,GACO,KAAPA,IAxBN,SAAkBA,GAEhB,IAAI4mB,EAAU,GAAL5mB,EACT,OAAQ4mB,GAAM,IAAiBA,GAAM,IAsBhCC,CAAS7mB,KAIdwB,EAAQyB,EAAMb,IAAIzB,MAAM0B,GAAKb,MAAM6V,IAC9B7V,IAEA4B,IACHG,EAAgBN,EAAMgB,KAAK,cAAe,GAAI,GAC9CV,EAAMa,QAAUnB,EAAMb,IAAIzB,MAAM0B,EAAKA,EAAMb,EAAM,GAAGwG,SAEtD/E,EAAMZ,KAAOb,EAAM,GAAGwG,gB,kCC1CxB,IAAI8e,EAAY,cAahB9jB,EAAO7C,QAAU,CACf,OAbF,SAAgByN,GACd,IAAImZ,EAAYnZ,EAAO3M,SAAS,QAAS,EAAG,GAC5C,OAAQ6lB,EAAUhlB,KAAKilB,IAYvB,UATF,SAAmBnZ,GACjB,MAAO,CACL,MAASA,EAAOoZ,aAAa,GAC7B,OAAUpZ,EAAOoZ,aAAa,O,kCCoDlC,SAAStS,EAAYzR,EAAOsG,GAC1B,IAAI0E,EACA2G,EACAC,EACAtR,EACAvD,EACAinB,EAGJ,IAAKhZ,EAFK1E,EAAWvB,OAEN,EAAGiG,GAAK,EAAGA,IAGE,MAF1B2G,EAAarL,EAAW0E,IAETlD,QAAgD,KAAtB6J,EAAW7J,SAK5B,IAApB6J,EAAWG,MAIfF,EAAWtL,EAAWqL,EAAWG,KAOjCkS,EAAWhZ,EAAI,GACJ1E,EAAW0E,EAAI,GAAG8G,MAAQH,EAAWG,IAAM,GAC3CxL,EAAW0E,EAAI,GAAG1K,QAAUqR,EAAWrR,MAAQ,GAC/CgG,EAAWqL,EAAWG,IAAM,GAAGxR,QAAUsR,EAAStR,MAAQ,GAC1DgG,EAAW0E,EAAI,GAAGlD,SAAW6J,EAAW7J,OAEnD/K,EAAKb,OAAOC,aAAawV,EAAW7J,SAEpCxH,EAAgBN,EAAMwF,OAAOmM,EAAWrR,QAClCqG,KAAUqd,EAAW,cAAgB,UAC3C1jB,EAAMsG,IAAUod,EAAW,SAAW,KACtC1jB,EAAMuG,QAAU,EAChBvG,EAAMW,OAAU+iB,EAAWjnB,EAAKA,EAAKA,EACrCuD,EAAMa,QAAU,IAEhBb,EAAgBN,EAAMwF,OAAOoM,EAAStR,QAChCqG,KAAUqd,EAAW,eAAiB,WAC5C1jB,EAAMsG,IAAUod,EAAW,SAAW,KACtC1jB,EAAMuG,SAAW,EACjBvG,EAAMW,OAAU+iB,EAAWjnB,EAAKA,EAAKA,EACrCuD,EAAMa,QAAU,GAEZ6iB,IACFhkB,EAAMwF,OAAOc,EAAW0E,EAAI,GAAG1K,OAAOa,QAAU,GAChDnB,EAAMwF,OAAOc,EAAWqL,EAAWG,IAAM,GAAGxR,OAAOa,QAAU,GAC7D6J,MA7GNjL,EAAO7C,QAAQoU,SAAW,SAAkBtR,EAAOG,GACjD,IAAI6K,EAAG+G,EACH9K,EAAQjH,EAAMZ,IACd0I,EAAS9H,EAAMb,IAAIP,WAAWqI,GAElC,GAAI9G,EAAU,OAAM,EAEpB,GAAe,KAAX2H,GAAsC,KAAXA,EAA2B,OAAM,EAIhE,IAFAiK,EAAU/R,EAAMgH,WAAWhH,EAAMZ,IAAgB,KAAX0I,GAEjCkD,EAAI,EAAGA,EAAI+G,EAAQhN,OAAQiG,IACdhL,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUjF,OAAOC,aAAa2L,GAEpC9H,EAAMsG,WAAWtF,KAAK,CAGpB8G,OAAQA,EAIR/C,OAAQgN,EAAQhN,OAShBkN,KAAQjH,EAIR1K,MAAQN,EAAMwF,OAAOT,OAAS,EAK9B+M,KAAS,EAKTI,KAAQH,EAAQzK,SAChB6K,MAAQJ,EAAQxK,YAMpB,OAFAvH,EAAMZ,KAAO2S,EAAQhN,WAmEvBhF,EAAO7C,QAAQuU,YAAc,SAAkBzR,GAC7C,IAAI6M,EACA5G,EAAcjG,EAAMiG,YACpBxF,EAAMT,EAAMiG,YAAYlB,OAI5B,IAFA0M,EAAYzR,EAAOA,EAAMsG,YAEpBuG,EAAO,EAAGA,EAAOpM,EAAKoM,IACrB5G,EAAY4G,IAAS5G,EAAY4G,GAAMvG,YACzCmL,EAAYzR,EAAOiG,EAAY4G,GAAMvG,c,kCCjI3C,IAAI1G,EAAuBlD,EAAQ,QAAmBkD,mBAClDL,EAAuB7C,EAAQ,QAAmB6C,QAGtDQ,EAAO7C,QAAU,SAAc8C,EAAOG,GACpC,IAAI+M,EACAvO,EACA2L,EACAyQ,EACAC,EACA5b,EACAiY,EACA4D,EAEAE,EAAO,GACPD,EAAQ,GACRE,EAASpb,EAAMZ,IACfqB,EAAMT,EAAMkG,OACZe,EAAQjH,EAAMZ,IACd6kB,KAEJ,GAAwC,KAApCjkB,EAAMb,IAAIP,WAAWoB,EAAMZ,KAAwB,OAAM,EAM7D,GAJA4b,EAAahb,EAAMZ,IAAM,GACzB2b,EAAW/a,EAAM+F,GAAGzE,QAAQyS,eAAe/T,EAAOA,EAAMZ,KAAIA,IAG7C,EAAK,OAAM,EAG1B,IADAA,EAAM2b,EAAW,GACPta,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,GAAsB,CAW1D,IALA6kB,KAIA7kB,IACOA,EAAMqB,IACX9B,EAAOqB,EAAMb,IAAIP,WAAWQ,GACvBG,EAAQZ,IAAkB,KAATA,GAFNS,KAIlB,GAAIA,GAAOqB,EAAO,OAAM,EAMxB,GAFAwG,EAAQ7H,GACRiY,EAAMrX,EAAM+F,GAAGzE,QAAQ0S,qBAAqBhU,EAAMb,IAAKC,EAAKY,EAAMkG,SAC1DmH,GAAI,CAWV,IAVA8N,EAAOnb,EAAM+F,GAAGzD,cAAc+U,EAAIlZ,KAC9B6B,EAAM+F,GAAG5D,aAAagZ,GACxB/b,EAAMiY,EAAIjY,IAEV+b,EAAO,GAKTlU,EAAQ7H,EACDA,EAAMqB,IACX9B,EAAOqB,EAAMb,IAAIP,WAAWQ,GACvBG,EAAQZ,IAAkB,KAATA,GAFNS,KAQlB,GADAiY,EAAMrX,EAAM+F,GAAGzE,QAAQ2S,eAAejU,EAAMb,IAAKC,EAAKY,EAAMkG,QACxD9G,EAAMqB,GAAOwG,IAAU7H,GAAOiY,EAAIhK,GAMpC,IALA6N,EAAQ7D,EAAIlZ,IACZiB,EAAMiY,EAAIjY,IAIHA,EAAMqB,IACX9B,EAAOqB,EAAMb,IAAIP,WAAWQ,GACvBG,EAAQZ,IAAkB,KAATA,GAFNS,OAOlBA,GAAOqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,MAErC6kB,MAEF7kB,IAGF,GAAI6kB,EAAgB,CAIlB,QAAoC,IAAzBjkB,EAAMqF,IAAIgW,WAA8B,OAAM,EAmBzD,GAjBIjc,EAAMqB,GAAqC,KAA9BT,EAAMb,IAAIP,WAAWQ,IACpC6H,EAAQ7H,EAAM,GACdA,EAAMY,EAAM+F,GAAGzE,QAAQyS,eAAe/T,EAAOZ,KAClC,EACTkL,EAAQtK,EAAMb,IAAIzB,MAAMuJ,EAAO7H,KAE/BA,EAAM2b,EAAW,GAGnB3b,EAAM2b,EAAW,EAKdzQ,IAASA,EAAQtK,EAAMb,IAAIzB,MAAMsd,EAAYD,MAElDE,EAAMjb,EAAMqF,IAAIgW,WAAWzb,EAAmB0K,KAG5C,OADAtK,EAAMZ,IAAMgc,KAGdD,EAAOF,EAAIE,KACXD,EAAQD,EAAIC,MAwBd,OAjBK/a,IACHH,EAAMZ,IAAM4b,EACZhb,EAAMkG,OAAS6U,EAEA/a,EAAMgB,KAAK,YAAa,IAAK,GACtCkM,MAASA,EAAQ,CAAE,CAAE,OAAQiO,IAC/BD,GACFhO,EAAMlM,KAAK,CAAE,QAASka,IAGxBlb,EAAM+F,GAAGxC,OAAO+N,SAAStR,GAEVA,EAAMgB,KAAK,aAAc,KAAM,IAGhDhB,EAAMZ,IAAMA,EACZY,EAAMkG,OAASzF,O,qBCjJjB,IAAIS,EAAM,CACT,QAAS,OACT,WAAY,OACZ,QAAS,OACT,WAAY,OACZ,QAAS,OACT,WAAY,OACZ,QAAS,OACT,WAAY,OACZ,QAAS,OACT,WAAY,OACZ,QAAS,OACT,WAAY,OACZ,SAAU,OACV,YAAa,OACb,SAAU,QACV,YAAa,SAId,SAASgjB,EAAeC,GACvB,IAAIlb,EAAKmb,EAAsBD,GAC/B,OAAOE,EAAoBpb,GAE5B,SAASmb,EAAsBD,GAC9B,IAAIlb,EAAK/H,EAAIijB,GACb,KAAKlb,EAAK,GAAI,CACb,IAAIlB,EAAI,IAAI/D,MAAM,uBAAyBmgB,EAAM,KAEjD,MADApc,EAAEpJ,KAAO,mBACHoJ,EAEP,OAAOkB,EAERib,EAAepmB,KAAO,WACrB,OAAOxC,OAAOwC,KAAKoD,IAEpBgjB,EAAe5F,QAAU8F,EACzBrkB,EAAO7C,QAAUgnB,EACjBA,EAAejb,GAAK,Q,mCCSpBlJ,EAAO7C,QAAU,CACf,OA5CF,SAAiByN,GACf,IAAI2Z,EAAa,SAAW3Z,EAAO3M,SAAS,QAAS,EAAG,GACpDumB,EAAa,SAAW5Z,EAAO3M,SAAS,QAAS,EAAG,IACpDwmB,EAAa,QAAW7Z,EAAO3M,SAAS,QAAS,GAAI,IACzD,OAAQsmB,GAAcC,GAAcC,GAyCpC,UAtCF,SAAoB7Z,GAElB,IAAI8Z,EAAc9Z,EAAO3M,SAAS,QAAS,GAAI,IAI/C,GAHA2M,EAASA,EAAOjN,MAAM,GAAI,IAGN,SAAhB+mB,GAAwC,KAAd9Z,EAAO,GACnC,OAoBJ,SAAyBA,GAGvB,MAAO,CACL,MAAiC,MAAxBA,EAAO+Z,YAAY,GAC5B,OAAkC,MAAxB/Z,EAAO+Z,YAAY,IAzBtBC,CAAeha,GAIxB,IAAImZ,EAAYnZ,EAAO3M,SAAS,MAAO,EAAG,GAC1C,MAAoB,SAAhBymB,GAAwC,WAAdX,GAOhC,SAA4BnZ,GAC1B,MAAO,CACL,MAAS,IAAmB,GAAZA,EAAO,KAAc,EAAKA,EAAO,IACjD,OAAU,IAAmB,GAAZA,EAAO,KAAa,GAAOA,EAAO,IAAM,GAC7B,IAAZA,EAAO,KAAc,IAV9Bia,CAAkBja,M,kCCrB7B5K,EAAO7C,QAAU,SAAoB6I,GAiDnC,SAAS0L,EAAYzR,EAAOsG,GAC1B,IAAI0E,EAAG0G,EACHC,EACAC,EACAtR,EACAuR,EAAc,GACdpR,EAAM6F,EAAWvB,OAErB,IAAKiG,EAAI,EAAGA,EAAIvK,EAAKuK,IAGO,MAF1B2G,EAAarL,EAAW0E,IAETlD,SAIS,IAApB6J,EAAWG,MAIfF,EAAWtL,EAAWqL,EAAWG,MAEjCxR,EAAgBN,EAAMwF,OAAOmM,EAAWrR,QAClCqG,KAAU,WAChBrG,EAAMsG,IAAU,MAChBtG,EAAMuG,QAAU,EAChBvG,EAAMW,OAAU,KAChBX,EAAMa,QAAU,IAEhBb,EAAgBN,EAAMwF,OAAOoM,EAAStR,QAChCqG,KAAU,YAChBrG,EAAMsG,IAAU,MAChBtG,EAAMuG,SAAW,EACjBvG,EAAMW,OAAU,KAChBX,EAAMa,QAAU,GAE8B,SAA1CnB,EAAMwF,OAAOoM,EAAStR,MAAQ,GAAGqG,MACY,MAA7C3G,EAAMwF,OAAOoM,EAAStR,MAAQ,GAAGa,SAEnC0Q,EAAY7Q,KAAK4Q,EAAStR,MAAQ,IAUtC,KAAOuR,EAAY9M,QAAQ,CAIzB,IAFA2M,GADA1G,EAAI6G,EAAY9K,OACR,EAED2K,EAAI1R,EAAMwF,OAAOT,QAAmC,cAAzB/E,EAAMwF,OAAOkM,GAAG/K,MAChD+K,IAKE1G,MAFJ0G,IAGEpR,EAAQN,EAAMwF,OAAOkM,GACrB1R,EAAMwF,OAAOkM,GAAK1R,EAAMwF,OAAOwF,GAC/BhL,EAAMwF,OAAOwF,GAAK1K,IAKxByF,EAAGxC,OAAOY,MAAM8K,OAAO,WAAY,OAhHnC,SAAkBjP,EAAOG,GACvB,IAAI6K,EAAG+G,EAAgBC,EAAKjV,EACxBkK,EAAQjH,EAAMZ,IACd0I,EAAS9H,EAAMb,IAAIP,WAAWqI,GAElC,GAAI9G,EAAU,OAAM,EAEpB,GAAe,KAAX2H,EAA0B,OAAM,EAMpC,GAHAkK,GADAD,EAAU/R,EAAMgH,WAAWhH,EAAMZ,KAAIA,IACvB2F,OACdhI,EAAKb,OAAOC,aAAa2L,GAErBkK,EAAM,EAAK,OAAM,EAQrB,IANIA,EAAM,IACQhS,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUpE,EAChBiV,KAGGhH,EAAI,EAAGA,EAAIgH,EAAKhH,GAAK,EACRhL,EAAMgB,KAAK,OAAQ,GAAI,GACjCG,QAAUpE,EAAKA,GAEhBgV,EAAQzK,UAAayK,EAAQxK,YAElCvH,EAAMsG,WAAWtF,KAAK,CACpB8G,OAAQA,EACR/C,OAAQ,EACRkN,KAAQjH,EAAI,EACZ1K,MAAQN,EAAMwF,OAAOT,OAAS,EAC9B+M,KAAS,EACTI,KAAQH,EAAQzK,SAChB6K,MAAQJ,EAAQxK,YAMpB,OAFAvH,EAAMZ,KAAO2S,EAAQhN,aA2EvBgB,EAAGxC,OAAOe,OAAO2K,OAAO,WAAY,OAAO,SAAUjP,GACnD,IAAI6M,EACA5G,EAAcjG,EAAMiG,YACpBxF,GAAOT,EAAMiG,aAAe,IAAIlB,OAIpC,IAFA0M,EAAYzR,EAAOA,EAAMsG,YAEpBuG,EAAO,EAAGA,EAAOpM,EAAKoM,IACrB5G,EAAY4G,IAAS5G,EAAY4G,GAAMvG,YACzCmL,EAAYzR,EAAOiG,EAAY4G,GAAMvG,iB,kCC7H7CvG,EAAO7C,QAAUR,EAAQ,S,kCCAzB,IAAIkD,EAAuBlD,EAAQ,QAAmBkD,mBAClDL,EAAuB7C,EAAQ,QAAmB6C,QAGtDQ,EAAO7C,QAAU,SAAmB8C,EAAOC,EAAW4kB,EAAU1kB,GAC9D,IAAIpD,EACA+nB,EACAC,EACA7kB,EACAib,EACAnQ,EACAW,EACArB,EACAyQ,EACAnP,EACAyL,EACApQ,EACA9I,EACAuN,EACAI,EACAoP,EACArB,EAAQ,EACRza,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GACnB4L,EAAW5L,EAAY,EAG3B,GAAID,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAE5D,GAAkC,KAA9BZ,EAAMb,IAAIP,WAAWQ,GAAwB,OAAM,EAIvD,OAASA,EAAMqB,GACb,GAAkC,KAA9BT,EAAMb,IAAIP,WAAWQ,IACa,KAAlCY,EAAMb,IAAIP,WAAWQ,EAAM,GAAoB,CACjD,GAAIA,EAAM,IAAMqB,EAAO,OAAM,EAC7B,GAAsC,KAAlCT,EAAMb,IAAIP,WAAWQ,EAAM,GAAsB,OAAM,EAC3D,MAYJ,IARAc,EAAUF,EAAMkO,QAGhBpC,EAAkB9L,EAAM+F,GAAGvC,MAAMW,MAAM4H,SAAS,aAEhDH,EAAgB5L,EAAMgM,WACtBhM,EAAMgM,WAAa,YAEZH,EAAW3L,IAAYF,EAAMiM,QAAQJ,GAAWA,IAGrD,KAAI7L,EAAMW,OAAOkL,GAAY7L,EAAMY,UAAY,GAG3CZ,EAAMW,OAAOkL,GAAY,GAA7B,CAIA,IADAH,KACKV,EAAI,EAAGW,EAAIG,EAAgB/G,OAAQiG,EAAIW,EAAGX,IAC7C,GAAIc,EAAgBd,GAAGhL,EAAO6L,EAAU3L,MAAgB,CACtDwL,KACA,MAGJ,GAAIA,EAAa,MAMnB,IAFAjL,GADAtC,EAAM6B,EAAMoM,SAASnM,EAAW4L,EAAU7L,EAAMY,WAAUA,GAAQf,QACxDkF,OAEL3F,EAAM,EAAGA,EAAMqB,EAAKrB,IAAO,CAE9B,GAAW,MADXrC,EAAKoB,EAAIS,WAAWQ,IAElB,OAAM,EACD,GAAW,KAAPrC,EAAqB,CAC9Bge,EAAW3b,EACX,MACgB,KAAPrC,EACT8c,IACgB,KAAP9c,MACTqC,EACUqB,GAA+B,KAAxBtC,EAAIS,WAAWQ,IAC9Bya,KAKN,GAAIkB,EAAW,GAAsC,KAAjC5c,EAAIS,WAAWmc,EAAW,GAAsB,OAAM,EAI1E,IAAK3b,EAAM2b,EAAW,EAAG3b,EAAMqB,EAAKrB,IAElC,GAAW,MADXrC,EAAKoB,EAAIS,WAAWQ,IAElBya,SACK,IAAIta,EAAQxC,GAGjB,MAOJ,KADAsa,EAAMrX,EAAM+F,GAAGzE,QAAQ0S,qBAAqB7V,EAAKiB,EAAKqB,IAC7C4M,GAAM,OAAM,EAGrB,GADA8N,EAAOnb,EAAM+F,GAAGzD,cAAc+U,EAAIlZ,MAC7B6B,EAAM+F,GAAG5D,aAAagZ,GAAS,OAAM,EAY1C,IANA2J,EAJA1lB,EAAMiY,EAAIjY,IAKV2lB,EAJAlL,GAASxC,EAAIwC,MAQb5S,EAAQ7H,EACDA,EAAMqB,EAAKrB,IAEhB,GAAW,MADXrC,EAAKoB,EAAIS,WAAWQ,IAElBya,SACK,IAAIta,EAAQxC,GAGjB,MAkBJ,IAZAsa,EAAMrX,EAAM+F,GAAGzE,QAAQ2S,eAAe9V,EAAKiB,EAAKqB,GAC5CrB,EAAMqB,GAAOwG,IAAU7H,GAAOiY,EAAIhK,IACpC6N,EAAQ7D,EAAIlZ,IACZiB,EAAMiY,EAAIjY,IACVya,GAASxC,EAAIwC,QAEbqB,EAAQ,GACR9b,EAAM0lB,EACNjL,EAAQkL,GAIH3lB,EAAMqB,IACX1D,EAAKoB,EAAIS,WAAWQ,GACfG,EAAQxC,KACbqC,IAGF,GAAIA,EAAMqB,GAA+B,KAAxBtC,EAAIS,WAAWQ,IAC1B8b,EAMF,IAHAA,EAAQ,GACR9b,EAAM0lB,EACNjL,EAAQkL,EACD3lB,EAAMqB,IACX1D,EAAKoB,EAAIS,WAAWQ,GACfG,EAAQxC,KACbqC,IAKN,QAAIA,EAAMqB,GAA+B,KAAxBtC,EAAIS,WAAWQ,KAKhCkL,EAAQ1K,EAAmBzB,EAAIT,MAAM,EAAGqd,KACnCzQ,IAODnK,SAEgC,IAAzBH,EAAMqF,IAAIgW,aACnBrb,EAAMqF,IAAIgW,WAAa,SAEkB,IAAhCrb,EAAMqF,IAAIgW,WAAW/Q,KAC9BtK,EAAMqF,IAAIgW,WAAW/Q,GAAS,CAAE4Q,MAAOA,EAAOC,KAAMA,IAGtDnb,EAAMgM,WAAaJ,EAEnB5L,EAAMe,KAAOd,EAAY4Z,EAAQ,S,kCC5LnC9Z,EAAO7C,QAAU,SAAwB8C,EAAOiH,EAAO+d,GACrD,IAAI5kB,EAAO6kB,EAAOnd,EAAQod,EACtBnK,GAAY,EACZta,EAAMT,EAAMkG,OACZkV,EAASpb,EAAMZ,IAKnB,IAHAY,EAAMZ,IAAM6H,EAAQ,EACpB7G,EAAQ,EAEDJ,EAAMZ,IAAMqB,GAAK,CAEtB,GAAe,MADfqH,EAAS9H,EAAMb,IAAIP,WAAWoB,EAAMZ,OAGpB,MADdgB,EACiB,CACf6kB,KACA,MAMJ,GAFAC,EAAUllB,EAAMZ,IAChBY,EAAM+F,GAAGxC,OAAOiP,UAAUxS,GACX,KAAX8H,EACF,GAAIod,IAAYllB,EAAMZ,IAAM,EAE1BgB,SACK,GAAI4kB,EAET,OADAhlB,EAAMZ,IAAMgc,GACJ,EAYd,OAPI6J,IACFlK,EAAW/a,EAAMZ,KAInBY,EAAMZ,IAAMgc,EAELL,I,+BC9CT,GA4BA,SAASoK,EAAeC,EAAOC,GAG7B,IADA,IAAIC,EAAK,EACAta,EAAIoa,EAAMrgB,OAAS,EAAGiG,GAAK,EAAGA,IAAK,CAC1C,IAAI8B,EAAOsY,EAAMpa,GACJ,MAAT8B,EACFsY,EAAMhW,OAAOpE,EAAG,GACE,OAAT8B,GACTsY,EAAMhW,OAAOpE,EAAG,GAChBsa,KACSA,IACTF,EAAMhW,OAAOpE,EAAG,GAChBsa,KAKJ,GAAID,EACF,KAAOC,IAAMA,EACXF,EAAMG,QAAQ,MAIlB,OAAOH,EA0OT,SAAStgB,EAAQ0gB,EAAIC,GACjB,GAAID,EAAG1gB,OAAQ,OAAO0gB,EAAG1gB,OAAO2gB,GAEhC,IADA,IAAIpO,EAAM,GACDrM,EAAI,EAAGA,EAAIwa,EAAGzgB,OAAQiG,IACvBya,EAAED,EAAGxa,GAAIA,EAAGwa,IAAKnO,EAAIrW,KAAKwkB,EAAGxa,IAErC,OAAOqM,EA3OXna,EAAQohB,QAAU,WAIhB,IAHA,IAAIoH,EAAe,GACfC,KAEK3a,EAAIrN,UAAUoH,OAAS,EAAGiG,IAAM,IAAM2a,EAAkB3a,IAAK,CACpE,IAAIiN,EAAQjN,GAAK,EAAKrN,UAAUqN,GAAKzF,EAAQqgB,MAG7C,GAAoB,iBAAT3N,EACT,MAAM,IAAIpa,UAAU,6CACVoa,IAIZyN,EAAezN,EAAO,IAAMyN,EAC5BC,EAAsC,MAAnB1N,EAAK4N,OAAO,IAWjC,OAASF,EAAmB,IAAM,KAJlCD,EAAeP,EAAergB,EAAO4gB,EAAapQ,MAAM,MAAM,SAAS4N,GACrE,QAASA,MACNyC,GAAkBjR,KAAK,OAE6B,KAK3DxX,EAAQ4oB,UAAY,SAAS7N,GAC3B,IAAI8N,EAAa7oB,EAAQ6oB,WAAW9N,GAChC+N,EAAqC,MAArBjM,EAAO9B,GAAO,GAclC,OAXAA,EAAOkN,EAAergB,EAAOmT,EAAK3C,MAAM,MAAM,SAAS4N,GACrD,QAASA,MACN6C,GAAYrR,KAAK,OAERqR,IACZ9N,EAAO,KAELA,GAAQ+N,IACV/N,GAAQ,MAGF8N,EAAa,IAAM,IAAM9N,GAInC/a,EAAQ6oB,WAAa,SAAS9N,GAC5B,MAA0B,MAAnBA,EAAK4N,OAAO,IAIrB3oB,EAAQwX,KAAO,WACb,IAAIuR,EAAQxoB,MAAMlC,UAAUmC,MAAM9B,KAAK+B,UAAW,GAClD,OAAOT,EAAQ4oB,UAAUhhB,EAAOmhB,GAAO,SAAS/C,EAAGnU,GACjD,GAAiB,iBAANmU,EACT,MAAM,IAAIrlB,UAAU,0CAEtB,OAAOqlB,KACNxO,KAAK,OAMVxX,EAAQgpB,SAAW,SAASpK,EAAMqK,GAIhC,SAAStmB,EAAKiZ,GAEZ,IADA,IAAI7R,EAAQ,EACLA,EAAQ6R,EAAI/T,QACE,KAAf+T,EAAI7R,GADiBA,KAK3B,IADA,IAAI6K,EAAMgH,EAAI/T,OAAS,EAChB+M,GAAO,GACK,KAAbgH,EAAIhH,GADOA,KAIjB,OAAI7K,EAAQ6K,EAAY,GACjBgH,EAAIpb,MAAMuJ,EAAO6K,EAAM7K,EAAQ,GAfxC6U,EAAO5e,EAAQohB,QAAQxC,GAAM/B,OAAO,GACpCoM,EAAKjpB,EAAQohB,QAAQ6H,GAAIpM,OAAO,GAsBhC,IALA,IAAIqM,EAAYvmB,EAAKic,EAAKxG,MAAM,MAC5B+Q,EAAUxmB,EAAKsmB,EAAG7Q,MAAM,MAExBvQ,EAASqM,KAAKC,IAAI+U,EAAUrhB,OAAQshB,EAAQthB,QAC5CuhB,EAAkBvhB,EACbiG,EAAI,EAAGA,EAAIjG,EAAQiG,IAC1B,GAAIob,EAAUpb,KAAOqb,EAAQrb,GAAI,CAC/Bsb,EAAkBtb,EAClB,MAIJ,IAAIub,EAAc,GAClB,IAASvb,EAAIsb,EAAiBtb,EAAIob,EAAUrhB,OAAQiG,IAClDub,EAAYvlB,KAAK,MAKnB,OAFAulB,EAAcA,EAAYjnB,OAAO+mB,EAAQ3oB,MAAM4oB,KAE5B5R,KAAK,MAG1BxX,EAAQspB,IAAM,IACdtpB,EAAQupB,UAAY,IAEpBvpB,EAAQwpB,QAAU,SAAUzO,GAE1B,GADoB,iBAATA,IAAmBA,GAAc,IACxB,IAAhBA,EAAKlT,OAAc,MAAO,IAK9B,IAJA,IAAIpG,EAAOsZ,EAAKrZ,WAAW,GACvB+nB,EAAmB,KAAThoB,EACVmT,GAAO,EACP8U,KACK5b,EAAIiN,EAAKlT,OAAS,EAAGiG,GAAK,IAAKA,EAEtC,GAAa,MADbrM,EAAOsZ,EAAKrZ,WAAWoM,KAEnB,IAAK4b,EAAc,CACjB9U,EAAM9G,EACN,YAIJ4b,KAIJ,OAAa,IAAT9U,EAAmB6U,EAAU,IAAM,IACnCA,GAAmB,IAAR7U,EAGN,IAEFmG,EAAKva,MAAM,EAAGoU,IAiCvB5U,EAAQ2pB,SAAW,SAAU5O,EAAM6O,GACjC,IAAIrB,EA/BN,SAAkBxN,GACI,iBAATA,IAAmBA,GAAc,IAE5C,IAGIjN,EAHA/D,EAAQ,EACR6K,GAAO,EACP8U,KAGJ,IAAK5b,EAAIiN,EAAKlT,OAAS,EAAGiG,GAAK,IAAKA,EAClC,GAA2B,KAAvBiN,EAAKrZ,WAAWoM,IAGhB,IAAK4b,EAAc,CACjB3f,EAAQ+D,EAAI,EACZ,YAEgB,IAAT8G,IAGX8U,KACA9U,EAAM9G,EAAI,GAId,OAAa,IAAT8G,EAAmB,GAChBmG,EAAKva,MAAMuJ,EAAO6K,GAMjB+U,CAAS5O,GAIjB,OAHI6O,GAAOrB,EAAE1L,QAAQ,EAAI+M,EAAI/hB,UAAY+hB,IACvCrB,EAAIA,EAAE1L,OAAO,EAAG0L,EAAE1gB,OAAS+hB,EAAI/hB,SAE1B0gB,GAGTvoB,EAAQ6pB,QAAU,SAAU9O,GACN,iBAATA,IAAmBA,GAAc,IAQ5C,IAPA,IAAI+O,GAAY,EACZC,EAAY,EACZnV,GAAO,EACP8U,KAGAM,EAAc,EACTlc,EAAIiN,EAAKlT,OAAS,EAAGiG,GAAK,IAAKA,EAAG,CACzC,IAAIrM,EAAOsZ,EAAKrZ,WAAWoM,GAC3B,GAAa,KAATrM,GASS,IAATmT,IAGF8U,KACA9U,EAAM9G,EAAI,GAEC,KAATrM,GAEkB,IAAdqoB,EACFA,EAAWhc,EACY,IAAhBkc,IACPA,EAAc,IACK,IAAdF,IAGTE,GAAe,QArBb,IAAKN,EAAc,CACjBK,EAAYjc,EAAI,EAChB,OAuBR,OAAkB,IAAdgc,IAA4B,IAATlV,GAEH,IAAhBoV,GAEgB,IAAhBA,GAAqBF,IAAalV,EAAM,GAAKkV,IAAaC,EAAY,EACjE,GAEFhP,EAAKva,MAAMspB,EAAUlV,IAa9B,IAAIiI,EAA6B,MAApB,KAAKA,QAAQ,GACpB,SAAU5b,EAAK8I,EAAO+K,GAAO,OAAO7T,EAAI4b,OAAO9S,EAAO+K,IACtD,SAAU7T,EAAK8I,EAAO+K,GAEpB,OADI/K,EAAQ,IAAGA,EAAQ9I,EAAI4G,OAASkC,GAC7B9I,EAAI4b,OAAO9S,EAAO+K,M,wDCrSjCjS,EAAO7C,QAAU,CACf,UACA,UACA,QACA,OACA,WACA,aACA,OACA,UACA,SACA,MACA,WACA,KACA,UACA,SACA,MACA,MACA,KACA,KACA,WACA,aACA,SACA,SACA,OACA,QACA,WACA,KACA,KACA,KACA,KACA,KACA,KACA,OACA,SACA,KACA,OACA,SACA,SACA,KACA,OACA,OACA,OACA,WACA,MACA,WACA,KACA,WACA,SACA,IACA,QACA,UACA,SACA,UACA,QACA,QACA,KACA,QACA,KACA,QACA,QACA,KACA,QACA,O,kCC9DF6C,EAAO7C,QAAU,CACfiqB,YAuhDF,SAAqBhpB,EAAKiC,GACxB,IAAIgnB,EAAKC,EACLrc,EAAG0G,EAEP4V,GAAmBnpB,EACnBopB,GAAkB,OACG,IAAVnnB,IAAyBA,EAvgDd,GAwgDtBonB,GAAkBpnB,GAElBinB,EAAO,IAAI5pB,MAAM,MACjB2pB,EAAM,GACN,MAAQpc,EAAIyc,GAAqBJ,EAAM,EAAGA,EAAKtiB,SAAW,GACxD,IAAK2M,EAAI,EAAGA,EAAI1G,EAAG0G,IAAO0V,GAAOlrB,OAAOC,aAAakrB,EAAK3V,IAG5D,OADA4V,GAAmB,KACZF,GAriDPM,SAwiDF,SAAkBpQ,GAEhB,IADA,IAAI5a,EAAI,GACCsO,EAAI,EAAGA,EAAIsM,EAAKvS,OAAQiG,GAAK,EAChCA,EAAI,GAAKsM,EAAKvS,OAChBrI,GAAKirB,GAAarQ,EAAK1Y,WAAWoM,GAAIsM,EAAK1Y,WAAWoM,EAAI,GAAI,GACrDA,EAAI,GAAKsM,EAAKvS,OACvBrI,GAAKirB,GAAarQ,EAAK1Y,WAAWoM,GAAI,EAAG,GAEzCtO,GAAKirB,GAAarQ,EAAK1Y,WAAWoM,GAAIsM,EAAK1Y,WAAWoM,EAAI,GAAIsM,EAAK1Y,WAAWoM,EAAI,IAGtF,OAAOtO,IApiDT,IAqDIkrB,EACAC,EAAWC,EACXC,EAEAC,EAAYC,EACZC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACA1D,GACAC,GA3GA0D,GAAY,MAmCZC,GAAeD,MAOfE,GAAcC,IAOdC,GAActsB,SAASA,GAOvBusB,GAAa,KAsDbC,GAAkB,IAAI9tB,MACxB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAClF+tB,GAAkB,IAAI/tB,MACxB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAC5FguB,GAAmB,IAAIhuB,MACzB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACpDiuB,GAAe,IAAIjuB,MACrB,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAC5DkuB,GAA0B,IAAIluB,MAChC,IAAImuB,GAAyB,EAAM,EAAK,EAAM,GAC9C,IAAIA,GAAyB,EAAM,EAAK,EAAM,GAC9C,IAAIA,GAAyB,EAAM,EAAI,GAAO,GAC9C,IAAIA,GAAyB,EAAM,EAAI,GAAM,IAC7C,IAAIA,GAAyB,EAAM,EAAI,GAAM,IAC7C,IAAIA,GAAyB,EAAK,GAAK,GAAM,IAC7C,IAAIA,GAAyB,EAAK,GAAI,IAAM,KAC5C,IAAIA,GAAyB,EAAK,GAAI,IAAM,KAC5C,IAAIA,GAAyB,GAAI,IAAK,IAAK,MAC3C,IAAIA,GAAyB,GAAI,IAAK,IAAK,OAI7C,SAASC,KACPvoB,KAAKwoB,GAAK,EACVxoB,KAAKyoB,GAAK,EAGZ,SAASC,KACP1oB,KAAK2oB,SAAW,KAChB3oB,KAAK4oB,YAAc,KACnB5oB,KAAK6oB,WAAa,KAClB7oB,KAAK8oB,WAAa,EAClB9oB,KAAK+oB,MAAQ,EACb/oB,KAAKgpB,WAAa,EAClBhpB,KAAKipB,SAAW,EAQlB,SAASX,GAAyB5U,EAAGwV,EAAG1wB,EAAG2wB,GACzCnpB,KAAKopB,YAAc1V,EACnB1T,KAAKqpB,SAAWH,EAChBlpB,KAAKspB,YAAc9wB,EACnBwH,KAAKupB,UAAYJ,EAGnB,SAASK,KACPxpB,KAAKmI,KAAO,KACZnI,KAAK0O,IAAM,EACX1O,KAAKypB,IAAM,IAAItvB,MAxJG,MAyJlB6F,KAAK0pB,IAAM,EAKb,SAASxF,GAAkBpnB,GACzB,IAAI4K,EAOJ,GALK5K,EAA+CA,EAAQ,EAAKA,EAAQ,EAAcA,EAAQ,IAAKA,EAAQ,GAA9FA,EArKQ,EAuKtBkpB,EAAkBlpB,EAClB2nB,KACAmB,KACkB,MAAdoC,GAAJ,CASA,IAPA1D,EAAiBC,EAAYC,EAAY,KACzCwD,GAAa,IAAI7tB,MAzKC,MA0KlB0qB,EAAa,IAAI1qB,MAzKG,OA0KpB2qB,EAAY,IAAI3qB,MArKI,MAsKpB4qB,EAAY,IAAI5qB,MAAMwvB,OACtB3E,EAAW,IAAI7qB,MAAM,OACrB+rB,EAAgB,IAAI/rB,MAxIF,KAyIbuN,EAAI,EAAGA,EAzIM,IAyIaA,IAAOwe,EAAcxe,GAAK,IAAI6gB,GAE7D,IADApC,EAAgB,IAAIhsB,MAAM,IACrBuN,EAAI,EAAGA,EAAI,GAAqBA,IAAOye,EAAcze,GAAK,IAAI6gB,GAEnE,IADAnC,EAAmB,IAAIjsB,MAAM0tB,KACxBngB,EAAI,EAAGA,EAAImgB,IAAiBngB,IAAO0e,EAAiB1e,GAAK,IAAI6gB,GAElE,IADAlC,EAAmB,IAAIlsB,MAnJP,IAoJXuN,EAAI,EAAGA,EApJI,GAoJaA,IAAO2e,EAAiB3e,GAAK,IAAI6gB,GAE9D,IADAjC,EAAc,IAAInsB,MAAM,IACnBuN,EAAI,EAAGA,EAAI,GAAsBA,IAAO4e,EAAY5e,GAAK,IAAI6gB,GAClEhC,EAAa,IAAImC,GACjBlC,EAAa,IAAIkC,GACjBjC,EAAc,IAAIiC,GAClBhC,EAAe,IAAIvsB,MAAMyvB,IACzBjD,EAAW,IAAIxsB,MAAM,KACrB2sB,EAAY,IAAI3sB,MAAM,KACtB4sB,EAAkB,IAAI5sB,MAAM0vB,KAC5B7C,EAAgB,IAAI7sB,MAAM,KAC1B8sB,EAAkB,IAAI9sB,MAnKD,IAoKrB+sB,EAAgB,IAAI/sB,MAhKJ,IAiKhBgtB,EAAe,IAAIhtB,MAAMsB,SAASquB,QA4BpC,SAASC,GAAgBnK,GACvBA,EAAEzX,KAAOmc,EACTA,EAAiB1E,EAgBnB,SAASoK,GAAUtiB,GACjB,OAAOsd,EAAS2C,GAAYjgB,GAG9B,SAASuiB,GAAUviB,EAAGwiB,GACpB,OAAOlF,EAAS2C,GAAYjgB,GAAKwiB,EAQnC,SAASC,GAAa3xB,GACpBwvB,GAAWrD,EAAaD,KAAgBlsB,EACpCmsB,EAAaD,GA/PC,MAi/CpB,WACE,GAAkB,GAAdA,EAAiB,CACnB,IAAI0F,EAAG1iB,EAKP,IAJA0iB,EAjxCJ,WACE,IAAIxK,EASJ,OAPsB,MAAlB0E,GACF1E,EAAI0E,EACJA,EAAiBA,EAAenc,MACzByX,EAAI,IAAI4J,GACjB5J,EAAEzX,KAAO,KACTyX,EAAElR,IAAMkR,EAAE8J,IAAM,EAET9J,EAuwCDyK,GACa,MAAb9F,EAAqBA,EAAYC,EAAY4F,EAAY5F,EAAYA,EAAUrc,KAAOiiB,EAC1FA,EAAE1b,IAAMgW,EAAaC,EAEhBjd,EAAI,EAAGA,EAAI0iB,EAAE1b,IAAKhH,IAAO0iB,EAAEX,IAAI/hB,GAAKsgB,GAAWrD,EAAajd,GACjEgd,EAAaC,EAAa,GA1vCoB2F,GAIlD,SAASC,GAAcC,GACrBA,GAAK,MACD7F,EAAaD,EAAa+F,MAC5BzC,GAAWrD,EAAaD,KAAqB,IAAJ8F,EACzCxC,GAAWrD,EAAaD,KAAiB8F,IAAM,IAE/CL,GAAiB,IAAJK,GACbL,GAAaK,IAAM,IAYvB,SAASE,KACPtF,EAnQkBuF,MAmQJvF,GAAa2C,GACyB,IAA/ClD,EAAWa,EAtRE,EAsR6B,IAE/CL,EAAgB2E,GAAU5E,GAC1BJ,EAtQc2C,MAsQLjC,GAA4BL,EACrC4E,GAAU7E,EAAWM,GAIvB,SAASkF,GAAcpyB,EAAGqyB,GACxBC,GAAcD,EAAKryB,GAAGgwB,GAAIqC,EAAKryB,GAAGiwB,IAOpC,SAASsC,GAAWC,GAClB,OACwC,KADhCA,EAAO,IAAMhE,EAAcgE,GAC/BhE,EAAc,KAAOgE,GAAQ,KAOnC,SAASC,GAAYJ,EAAMK,EAAG/kB,GAC5B,OAAO0kB,EAAKK,GAAG1C,GAAKqC,EAAK1kB,GAAGqiB,IACzBqC,EAAKK,GAAG1C,IAAMqC,EAAK1kB,GAAGqiB,IAAM1B,EAAUoE,IAAMpE,EAAU3gB,GAM3D,SAASglB,GAAcpH,EAAMtZ,EAAQygB,GACnC,IAAIxjB,EACJ,IAAKA,EAAI,EAAGA,EAAIwjB,GAAKjH,GAAkBD,GAAiBviB,OAAQiG,IAC9Dqc,EAAKtZ,EAAS/C,GACqC,IAAjDsc,GAAiB1oB,WAAW2oB,MAEhC,OAAOvc,EAuDT,SAAS0jB,GAAkBC,GACzB,IAEIC,EACA5c,EAHA6c,EAAezF,EACf0F,EAAQ9F,EAGR+F,EAAWhG,EAKXiG,EAAShG,EAAekC,GAAelC,EAAekC,GA1W9C,EA4WR+D,EAAUjG,EA/XI,IAgYdkG,EAAY/G,EAAW2G,EAAQC,EAAW,GAC1CI,EAAYhH,EAAW2G,EAAQC,GAG/BhG,GAAmBQ,IAAkBsF,IAAiB,GAI1D,GAOE,GAAI1G,GALJyG,EAASD,GAKeI,IAAaI,GACnChH,EAAWyG,EAASG,EAAW,IAAMG,GACrC/G,EAAWyG,IAAazG,EAAW2G,IACnC3G,IAAayG,IAAazG,EAAW2G,EAAQ,GAH/C,CAaAA,GAAS,EACTF,IAKA,UACSzG,IAAa2G,IAAU3G,IAAayG,IAC3CzG,IAAa2G,IAAU3G,IAAayG,IACpCzG,IAAa2G,IAAU3G,IAAayG,IACpCzG,IAAa2G,IAAU3G,IAAayG,IACpCzG,IAAa2G,IAAU3G,IAAayG,IACpCzG,IAAa2G,IAAU3G,IAAayG,IACpCzG,IAAa2G,IAAU3G,IAAayG,IACpCzG,IAAa2G,IAAU3G,IAAayG,IACpCE,EAAQG,GAKV,GAHAjd,EA7agB,KA6aOid,EAAUH,GACjCA,EAAQG,EA9aQ,IAgbZjd,EAAM+c,EAAU,CAIhB,GAHF9F,EAAkB0F,EAClBI,EAAW/c,EAELA,GApbQ,IAobc,MAG5Bkd,EAAa/G,EAAW2G,EAAQC,EAAW,GAC3CI,EAAahH,EAAW2G,EAAQC,YAE1BJ,EAAYrG,EAxaR2C,MAwaiB0D,IAA0BK,GAClC,KAAhBH,GAEP,OAAOE,EAWT,SAASK,KACP,IAAIZ,EAAG/kB,EAGH4lB,EA9cgB,MA8cSlG,EAAgBH,EAK7C,IAAa,GAATqG,EAIFA,SACK,GAAIrG,GAAgBiC,MAA0B,CAOnD,IAAKuD,EAAI,EAAGA,EAAIvD,GAAWuD,IAAOrG,EAAWqG,GAAKrG,EAAWqG,EAAIvD,IAMjE,IAJAhC,GAAmBgC,GACnBjC,GAAmBiC,GACnBxC,GAAmBwC,GAEduD,EAAI,EAAGA,EAndI,KAmdeA,IAE7BjB,GAAUiB,GADV/kB,EAAI6jB,GAAUkB,KACIvD,GAAYxhB,EAAIwhB,GAld1B,GAodV,IAAKuD,EAAI,EAAGA,EAAIvD,GAAWuD,IAIzB/kB,EAAI6e,EAASkG,GACblG,EAASkG,GAAM/kB,GAAKwhB,GAAYxhB,EAAIwhB,GAzd5B,EA2dVoE,GAAQpE,GAGL/B,KACHsF,EAAIC,GAActG,EAAYa,EAAeG,EAAekG,KACnD,EAAKnG,KAA4BC,GAAiBqF,GAqL/D,SAASc,KACHpG,IACJX,EAAa,EACbC,EAAe,EA0FjB,WACE,IAAIgG,EACA1gB,EACA/I,EACApG,EACA2vB,EAEJ,GAA8B,GAA1B3E,EAAiB,GAAGoC,GAAxB,CA4BA,IA1BAlC,EAAWoC,SAAYzC,EACvBK,EAAWqC,YAAcxC,EACzBG,EAAWsC,WAAaZ,GACxB1B,EAAWuC,WAAahB,IACxBvB,EAAWwC,MAASlB,GACpBtB,EAAWyC,WA3vBM,GA4vBjBzC,EAAW0C,SAAY,EAEvBzC,EAAWmC,SAAYxC,EACvBK,EAAWoC,YAAcvC,EACzBG,EAAWqC,WAAaX,GACxB1B,EAAWsC,WAAa,EACxBtC,EAAWuC,MA5vBK,GA6vBhBvC,EAAWwC,WAnwBM,GAowBjBxC,EAAWyC,SAAY,EAEvBxC,EAAYkC,SAAWrC,EACvBG,EAAYmC,YAAc,KAC1BnC,EAAYoC,WAAaV,GACzB1B,EAAYqC,WAAa,EACzBrC,EAAYsC,MAnwBK,GAowBjBtC,EAAYuC,WA1wBQ,EA2wBpBvC,EAAYwC,SAAW,EAGvBxnB,EAAS,EACJpG,EAAO,EAAGA,EAAO4wB,GAAsB5wB,IAE1C,IADA4rB,EAAgB5rB,GAAQoG,EACnBypB,EAAI,EAAGA,EAAK,GAAKjD,GAAgB5sB,GAAQ6vB,IAAOnE,EAAgBtlB,KAAYpG,EAYnF,IAJA0rB,EAAgBtlB,EAAS,GAAKpG,EAG9B2vB,EAAO,EACF3vB,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADA6rB,EAAc7rB,GAAQ2vB,EACjBE,EAAI,EAAGA,EAAK,GAAKhD,GAAgB7sB,GAAQ6vB,IAC5ClE,EAAcgE,KAAU3vB,EAK5B,IADA2vB,IAAS,EACF3vB,EAhyBS,GAgyBWA,IAEzB,IADA6rB,EAAc7rB,GAAQ2vB,GAAQ,EACzBE,EAAI,EAAGA,EAAK,GAAMhD,GAAgB7sB,GAAQ,EAAK6vB,IAAOlE,EAAc,IAAMgE,KAAU3vB,EAK3F,IAAKmP,EAAO,EAAGA,GA7yBE,GA6yBoBA,IAAUkc,EAAalc,GAAQ,EAEpE,IADA0gB,EAAI,EACGA,GAAK,KAAO9E,EAAiB8E,KAAKzC,GAAK,EAAG/B,EAAa,KAC9D,KAAOwE,GAAK,KAAO9E,EAAiB8E,KAAKzC,GAAK,EAAG/B,EAAa,KAC9D,KAAOwE,GAAK,KAAO9E,EAAiB8E,KAAKzC,GAAK,EAAG/B,EAAa,KAC9D,KAAOwE,GAAK,KAAO9E,EAAiB8E,KAAKzC,GAAK,EAAG/B,EAAa,KAQ9D,IAHAwF,GAAc9F,EAAkByB,KAG3BqD,EAAI,EAAGA,EApzBI,GAozBaA,IAC3B7E,EAAiB6E,GAAGzC,GAAK,EACzBpC,EAAiB6E,GAAG1C,GAAK2D,GAAejB,EAAG,GAI7CkB,MA5KAC,GA1WF,WACE,IAAIje,EAGJ,IAAKA,EAAI,EAAGA,EAtTM,KAsTaA,IAE7B4W,EAAS2C,GAAYvZ,GAAK,EAc5B,GATA2X,EAAqBsC,GAAwBrC,GAAiBqD,SAC9DpD,EAAqBoC,GAAwBrC,GAAiBoD,YAE9DtD,EAAuBuC,GAAwBrC,GAAiBuD,UAEhE7D,EAAe,EACfP,EAAkB,GAElBU,EAAgBsF,GAActG,EAAY,EAAG,EAAI8C,MAC5B,EAGnB,OAFA/B,UACAC,EAAgB,GAOlB,IAJAD,KAIOC,EA1UegE,MA0UuBjE,GAAckG,KAM3D,IADA1G,EAAY,EACPhX,EAAI,EAAGA,EAAIke,EAAmBle,IAEjCgX,EAtVgBuF,MAsVFvF,GAAa2C,GAAgC,IAAhBlD,EAAWzW,IAsUxDme,GAEAhI,EAAY,KACZG,EAAa,EACbC,EAAa,EAETqB,GAAmB,GACrBP,EAAkB6G,EAClB9G,EAAmB,IAEnBA,EAAmB8G,EACnB/G,EAAsB,GAGxBX,MAQF,SAAST,GAAqBJ,EAAM2F,EAAK8C,GACvC,IAAItB,EAEJ,OAAKzG,IACHuH,KACAvH,KACqB,GAAjBoB,IAMDqF,EAAIuB,GAAU1I,EAAM2F,EAAK8C,KAAeA,EAAoBA,EAE7D5H,EAAuBsG,GAEvBlF,GAAmB,EAtNzB,WACE,KAAwB,GAAjBH,GAAmC,MAAbtB,GAAmB,CAC9C,IAAImI,EAoBJ,GAfAhC,KAjfU,GAsfNrF,GACFK,EAAeL,GAAiBuC,MAKhCpC,EAAmB4F,GAAkB/F,IAEdQ,IAAiBL,EAAmBK,IAEzDL,GAphBY,EA8hBd,GAPAkH,EAAQC,GAAajH,EAAeC,EAClCH,EAxhBY,GAyhBdK,GAAiBL,EAKbA,GAAoBO,EAAoB,CAC1CP,IACA,GACEE,IACAgF,WAM6B,KAApBlF,GACXE,SAEAA,GAAgBF,EAChBA,EAAmB,EAGnBJ,EA7hBYuF,OA2hBZvF,EAAuC,IAA3BP,EAAWa,KAEIqC,GAA+C,IAA/BlD,EAAWa,EAAe,SASvEgH,EAAQC,GAAa,EAA8B,IAA3B9H,EAAWa,IACnCG,IACAH,IAYF,IAVIgH,IACFE,GAAgB,GAChBzH,EAAkBO,GAQbG,EAhjBagE,MAgjByBjE,GAAckG,MA+I3De,GA3IJ,WAEE,KAAwB,GAAjBhH,GAAmC,MAAbtB,GAAmB,CAmC9C,GA/BAmG,KAIAjF,EAAkBD,EAClBF,EAAiBK,EACjBH,EAAmB8G,EAlkBT,GAokBNjH,GACFI,EAAkBM,GAClBL,EAAeL,GAAiBuC,MAKhCpC,EAAmB4F,GAAkB/F,IAEdQ,IAAiBL,EAAmBK,GAjmB7C,GAomBVL,GACFE,EAAeC,EAhlBL,MAolBVH,KAMAC,GA/mBY,GAgnBdD,GAAoBC,EAAiB,CACrC,IAAIiH,EAGJA,EAAQC,GAAajH,EAAe,EAAIJ,EACtCG,EArnBY,GA0nBdI,GAAiBJ,EAAkB,EACnCA,GAAmB,EACnB,GACEC,IACAgF,WAM4B,KAAnBjF,GACXF,EAAsB,EACtBC,EAAmB8G,EACnB5G,IACIgH,IACFE,GAAgB,GAChBzH,EAAkBO,QAEY,GAAvBH,GAKLoH,GAAa,EAAkC,IAA/B9H,EAAWa,EAAe,MAC5CkH,GAAgB,GAChBzH,EAAkBO,GAEpBA,IACAG,MAKAN,EAAsB,EACtBG,IACAG,KAQF,KAAOA,EA/oBagE,MA+oByBjE,GAAckG,MAgD9BgB,GACV,GAAjBjH,IACyB,GAAvBN,GAA4BoH,GAAa,EAAkC,IAA/B9H,EAAWa,EAAe,IAC1EkH,GAAgB,GAChBhI,MAEKsG,EAAIuB,GAAU1I,EAAMmH,EAAIxB,EAAK8C,EAAYtB,KAhB5CtG,KACO,GAkBb,SAAS6H,GAAU1I,EAAM2F,EAAK8C,GAC5B,IAAItB,EAAGxjB,EAAG0G,EAGV,IADA8c,EAAI,EACgB,MAAb3G,GAAqB2G,EAAIsB,GAAW,CAIzC,KAHA9kB,EAAI8kB,EAAYtB,GACR3G,EAAU7V,MAAOhH,EAAI6c,EAAU7V,KAElCN,EAAI,EAAGA,EAAI1G,EAAG0G,IAAO2V,EAAK2F,EAAMwB,EAAI9c,GAAKmW,EAAUkF,IAAIlF,EAAUmF,IAAMtb,GAM1E,IAAIwR,EAJN2E,EAAUmF,KAAOhiB,EACjB6c,EAAU7V,KAAOhH,EACjBwjB,GAAKxjB,EACgB,GAAjB6c,EAAU7V,MAEZkR,EAAI2E,EACJA,EAAYA,EAAUpc,KACtB4hB,GAAgBnK,IAIpB,GAAIsL,GAAKsB,EAAa,OAAOtB,EAE7B,GAAIvG,EAAaD,EAAY,CAI3B,KAHAhd,EAAI8kB,EAAYtB,GACRxG,EAAaC,IAAcjd,EAAIgd,EAAaC,GAE/CvW,EAAI,EAAGA,EAAI1G,EAAG0G,IAAO2V,EAAK2F,EAAMwB,EAAI9c,GAAK4Z,GAAWrD,EAAavW,GAEtE8c,GAAKxjB,EACDgd,IAFJC,GAAcjd,KAEkBgd,EAAaC,EAAa,GAE5D,OAAOuG,EAiGT,SAASkB,KACP,IAAIlB,EAGJ,IAAKA,EAAI,EAAGA,EAAIrD,GAAcqD,IAAKhF,EAAcgF,GAAG1C,GAAK,EACzD,IAAK0C,EAAI,EAAGA,EAr0BI,GAq0BcA,IAAK/E,EAAc+E,GAAG1C,GAAK,EACzD,IAAK0C,EAAI,EAAGA,EAr0BK,GAq0BaA,IAAK5E,EAAY4E,GAAG1C,GAAK,EAEvDtC,EA10BkB,KA00BWsC,GAAK,EAClCf,GAAcC,GAAiB,EAC/BN,EAAeC,EAAgBC,EAAiB,EAChDC,EAAY,EACZC,EAAe,EASjB,SAASuF,GACPlC,EACAmC,GAIA,IAHA,IAAIC,EAAItG,EAASqG,GACb5e,EAAI4e,GAAK,EAEN5e,GAAKwY,IAENxY,EAAIwY,GACNqE,GAAYJ,EAAMlE,EAASvY,EAAI,GAAIuY,EAASvY,KAAOA,KAGjD6c,GAAYJ,EAAMoC,EAAGtG,EAASvY,MAGlCuY,EAASqG,GAAKrG,EAASvY,GACvB4e,EAAI5e,EAGJA,IAAM,EAERuY,EAASqG,GAAKC,EAiGhB,SAASf,GAAcrB,EACrB5B,GACA,IAEIze,EACA0gB,EAHAgC,EAAY,IAAI/yB,MAAMyvB,IACtBvuB,EAAO,EAOX,IAAKmP,EAAO,EAAGA,GA39BE,GA29BoBA,IACnCnP,EAASA,EAAOqrB,EAAalc,EAAO,IAAO,EAC3C0iB,EAAU1iB,GAAQnP,EAUpB,IAAK6vB,EAAI,EAAGA,GAAKjC,EAAUiC,IAAK,CAC9B,IAAIxc,EAAMmc,EAAKK,GAAGzC,GACP,GAAP/Z,IAEJmc,EAAKK,GAAG1C,GAAK2D,GAAee,EAAUxe,KAAQA,KAelD,SAASye,GAAeC,GACtB,IAGIlC,EAAG/kB,EAHH0kB,EAAOuC,EAAKzE,SACZ0E,EAAQD,EAAKxE,YACbG,EAAQqE,EAAKrE,MAEbE,GAAY,EACZqE,EAAOvE,EASX,IAHAnC,EAAe,EACfC,EA5/BkB,IA8/BbqE,EAAI,EAAGA,EAAInC,EAAOmC,IACH,GAAdL,EAAKK,GAAG1C,IACV7B,IAAWC,GAAgBqC,EAAWiC,EACtCpE,EAAUoE,GAAK,GACRL,EAAKK,GAAGzC,GAAK,EAQxB,KAAO7B,EAAe,GAAG,CACvB,IAAI2G,EAAO5G,IAAWC,GAAiBqC,EAAW,IAAMA,EAAW,EACnE4B,EAAK0C,GAAM/E,GAAK,EAChB1B,EAAUyG,GAAQ,EAClB9F,KACa,MAAT4F,IAAiB3F,IAAkB2F,EAAME,GAAM9E,IAQrD,IALA2E,EAAKnE,SAAWA,EAKXiC,EAAItE,GAAgB,EAAGsE,GAAK,EAAGA,IAAO6B,GAAelC,EAAMK,GAKhE,GACEA,EAAIvE,EAziCW,GA0iCfA,EA1iCe,GA0iCUA,EAASC,KAClCmG,GAAelC,EA3iCA,GA6iCf1kB,EAAIwgB,EA7iCW,GAgjCfA,IAAWE,GAAgBqE,EAC3BvE,IAAWE,GAAgB1gB,EAG3B0kB,EAAKyC,GAAM9E,GAAKqC,EAAKK,GAAG1C,GAAKqC,EAAK1kB,GAAGqiB,GAEjC1B,EAAUoE,GAAKpE,EAAU3gB,GAAK,EAAK2gB,EAAUwG,GAAQxG,EAAUoE,GAAapE,EAAUwG,GAAQxG,EAAU3gB,GAAK,EACjH0kB,EAAKK,GAAGzC,GAAKoC,EAAK1kB,GAAGsiB,GAAK6E,EAG1B3G,EA1jCe,GA0jCU2G,IACzBP,GAAelC,EA3jCA,SA6jCRjE,GAAgB,GAEzBD,IAAWE,GAAgBF,EA/jCV,GA83BnB,SAAwByG,GACtB,IAMII,EACAtC,EAAG/kB,EACHqE,EACAijB,EACAtL,EAVA0I,EAAQuC,EAAKzE,SACb+E,EAASN,EAAKvE,WACd8E,EAAQP,EAAKtE,WACbG,EAAWmE,EAAKnE,SAChBD,EAAaoE,EAAKpE,WAClBqE,EAASD,EAAKxE,YAMdgF,EAAW,EAEf,IAAKpjB,EAAO,EAAGA,GA34BE,GA24BoBA,IAAUkc,EAAalc,GAAQ,EAOpE,IAFAqgB,EAAKlE,EAASE,IAAe4B,GAAK,EAE7B+E,EAAI3G,EAAe,EAAG2G,EAv4BT,IAu4B4BA,KAE5ChjB,EAAOqgB,EAAKA,EADZK,EAAIvE,EAAS6G,IACO/E,IAAIA,GAAK,GAClBO,IACTxe,EAAOwe,EACP4E,KAEF/C,EAAKK,GAAGzC,GAAKje,EAGT0gB,EAAIjC,IAERvC,EAAalc,KACbijB,EAAQ,EACJvC,GAAKyC,IAAQF,EAAQC,EAAMxC,EAAIyC,IACnCxL,EAAI0I,EAAKK,GAAG1C,GACZf,IAAetF,GAAK3X,EAAOijB,GACd,MAATJ,IAAiB3F,IAAkBvF,GAAKkL,EAAMnC,GAAGzC,GAAKgF,KAE5D,GAAgB,GAAZG,EAAJ,CAKA,EAAG,CAED,IADApjB,EAAOwe,EAAa,EACS,GAAtBtC,EAAalc,IAAcA,IAClCkc,EAAalc,KACbkc,EAAalc,EAAO,IAAM,EAC1Bkc,EAAasC,KAIb4E,GAAY,QACLA,EAAW,GAOpB,IAAKpjB,EAAOwe,EAAoB,GAARxe,EAAWA,IAEjC,IADA0gB,EAAIxE,EAAalc,GACL,GAAL0gB,IACL/kB,EAAIwgB,IAAW6G,IACPvE,IACJ4B,EAAK1kB,GAAGsiB,IAAMje,IAChBid,KAAgBjd,EAAOqgB,EAAK1kB,GAAGsiB,IAAMoC,EAAK1kB,GAAGqiB,GAC7CqC,EAAK1kB,GAAGqiB,GAAKhe,GAEf0gB,MA+HJ2C,CAAeT,GAGflB,GAAcrB,EAAM5B,GAStB,SAAS6E,GAAcjD,EACrB5B,GACA,IAAIiC,EAEA6C,EADAC,GAAW,EAEXC,EAAUpD,EAAK,GAAGpC,GAClB1kB,EAAQ,EACRmqB,EAAY,EACZC,EAAY,EAQhB,IANe,GAAXF,IACFC,EAAY,IACZC,EAAY,GAEdtD,EAAK5B,EAAW,GAAGR,GAAK,MAEnByC,EAAI,EAAGA,GAAKjC,EAAUiC,IACzB6C,EAASE,EACTA,EAAUpD,EAAKK,EAAI,GAAGzC,KAChB1kB,EAAQmqB,GAAaH,GAAUE,IAAgClqB,EAAQoqB,EAAa7H,EAAYyH,GAAQvF,IAAMzkB,EAA4B,GAAVgqB,GAChIA,GAAUC,GAAW1H,EAAYyH,GAAQvF,KAC7ClC,EA5lCY,IA4lCakC,MAChBzkB,GAAS,GAAMuiB,EA5lCV,IA4lCqCkC,KAAelC,EA3lClD,IA2lC+EkC,KACjGzkB,EAAQ,EAAGiqB,EAAUD,EACN,GAAXE,GACFC,EAAY,IACZC,EAAY,GACHJ,GAAUE,GACnBC,EAAY,EACZC,EAAY,IAEZD,EAAY,EACZC,EAAY,IASlB,SAASC,GAAcvD,EACrB5B,GACA,IAAIiC,EAEA6C,EADAC,GAAW,EAEXC,EAAUpD,EAAK,GAAGpC,GAClB1kB,EAAQ,EACRmqB,EAAY,EACZC,EAAY,EAQhB,IALe,GAAXF,IACFC,EAAY,IACZC,EAAY,GAGTjD,EAAI,EAAGA,GAAKjC,EAAUiC,IAGzB,GAFA6C,EAASE,EACTA,EAAUpD,EAAKK,EAAI,GAAGzC,OAChB1kB,EAAQmqB,GAAaH,GAAUE,GAArC,CAEO,GAAIlqB,EAAQoqB,EACjB,GAAKvD,GAAcmD,EAAQzH,SAAkC,KAATviB,QACjC,GAAVgqB,GACLA,GAAUC,IACZpD,GAAcmD,EAAQzH,GACtBviB,KAGF6mB,GA7oCY,GA6oCetE,GAC3BwE,GAAc/mB,EAAQ,EAAG,IAChBA,GAAS,IAClB6mB,GA/oCc,GA+oCetE,GAC7BwE,GAAc/mB,EAAQ,EAAG,KAEzB6mB,GAjpCgB,GAipCetE,GAC/BwE,GAAc/mB,EAAQ,GAAI,IAE5BA,EAAQ,EACRiqB,EAAUD,EACK,GAAXE,GACFC,EAAY,IACZC,EAAY,GACHJ,GAAUE,GACnBC,EAAY,EACZC,EAAY,IAEZD,EAAY,EACZC,EAAY,IAoElB,SAASvB,GAAgByB,GACvB,IAAIC,EAAUC,EACVC,EACAC,EAkCE/mB,EAFN,GA9BA+mB,EAAa/I,EAAeP,EAC5BgC,EAAaG,GAAkBC,EAG/B4F,GAAe5G,GAIf4G,GAAe3G,GAUfgI,EAlFF,WACE,IAAIA,EAgBJ,IAbAV,GAAc5H,EAAeK,EAAW0C,UACxC6E,GAAc3H,EAAeK,EAAWyC,UAGxCkE,GAAe1G,GASV+H,EAAcE,GAAkBF,GAAe,GACD,GAA7ClI,EAAY8B,GAAaoG,IAAc/F,GADU+F,KAQvD,OAJA/G,IAAe,GAAK+G,EAAc,GAAK,EAAI,EAAI,EAIxCA,EAyDOG,IAIdJ,EAAe7G,GAAiB,EAAI,GAAM,KAD1C4G,EAAY7G,GAAgB,EAAI,GAAM,KAQP6G,EAAWC,GACtCE,EAAa,GAAKH,GACjBnJ,GAAmB,EAoBtB,IAXA2F,KAAwCuD,EAAK,GAC7CO,KACArE,GAAckE,GACdlE,IAAekE,GAQV/mB,EAAI,EAAGA,EAAI+mB,EAAY/mB,IAAOyiB,GAAatF,EAAWM,EAAkBzd,SAEpE6mB,GAAeD,GACxBxD,KAAwCuD,EAAK,GAC7CQ,GAAmBzI,EAAkBC,KAErCyE,KAAqCuD,EAAK,GAxF9C,SAA4BS,EAAQC,EAAQC,GAC1C,IAAIC,EASJ,IAHAnE,GAAcgE,EAAS,IAAK,GAC5BhE,GAAciE,EAAS,EAAK,GAC5BjE,GAAckE,EAAU,EAAI,GACvBC,EAAO,EAAGA,EAAOD,EAASC,IAE7BnE,GAAcxE,EAAY8B,GAAa6G,IAAOxG,GAAI,GAIpD2F,GAAclI,EAAe4I,EAAS,GAGtCV,GAAcjI,EAAe4I,EAAS,GAsEpCG,CAAmB3I,EAAW0C,SAAW,EACvCzC,EAAWyC,SAAW,EACtBuF,EAAc,GAChBK,GAAmB3I,EAAeC,IAGpCiG,KAEW,GAAPiC,GAAYO,KAOlB,SAASjC,GACP3B,EACA3K,GA2BA,GA1BA0E,EAAUqC,KAAkB/G,EAChB,GAAR2K,EAEF9E,EAAc7F,GAAImI,MAGlBwC,IAKA9E,EAAca,EAAgB1G,GAr0Cf,IAq0CoC,GAAGmI,KACtDrC,EAAc4E,GAAWC,IAAOxC,KAEhC1D,EAAUuC,KAAmB2D,EAC7BzD,GAAaC,GAEfA,IAAiB,EAGS,IAAN,EAAfJ,KACHD,EAAaG,KAAoBC,EACjCA,EAAY,EACZC,EAAe,GAGbxB,EAAkB,GAA+B,IAAV,KAAfoB,GAA4B,CAEtD,IAEI+H,EAFAC,EAA4B,EAAfhI,EACbiI,EAAY3J,EAAeP,EAG/B,IAAKgK,EAAQ,EAAGA,EAv1CF,GAu1CuBA,IACnCC,GAAcjJ,EAAcgJ,GAAO3G,IAAM,EAAIN,GAAgBiH,IAM/D,GAJAC,IAAe,EAIX/H,EAAgB5rB,SAAS2rB,EAAe,IAC1CgI,EAAa3zB,SAAS4zB,EAAY,GAAM,OAAM,EAElD,OAAwBvF,MAAhB1C,GA53CY,MA63ClBC,EAUJ,SAASwH,GACPS,EACAC,GACA,IAAIvE,EACA3K,EAKAhlB,EACAqyB,EALA8B,EAAK,EACLC,EAAK,EACLC,EAAK,EACLC,EAAO,EAIX,GAAoB,GAAhBvI,EACF,GACkB,IAAN,EAALoI,KAAgBG,EAAOxI,EAAauI,MACzCrP,EAAuB,IAAlB0E,EAAUyK,KACG,IAAN,EAAPG,GACH/E,GAAcvK,EAAIiP,IAKlB1E,IADAvvB,EAAO0rB,EAAgB1G,IAp4CZ,IAq4CyB,EAAGiP,GAE1B,IADb5B,EAAQzF,GAAgB5sB,KAGtByvB,GADAzK,GAAM4G,EAAgB5rB,GACJqyB,GAOpB9C,GAHAvvB,EAAO0vB,GAFPC,EAAOlG,EAAU2K,MAKGF,GAEP,IADb7B,EAAQxF,GAAgB7sB,KAGtByvB,GADAE,GAAQ9D,EAAc7rB,GACFqyB,IAGxBiC,IAAS,QACFH,EAAKpI,GAGhBwD,GA15CkB,IA05CW0E,GAQ/B,SAASxE,GACP9gB,EACAvI,GAKIyjB,EARa,GAQiBzjB,GAEhC8oB,GADAtF,GAAejb,GAASkb,GAExBD,EAAcjb,GAXC,GAWwBkb,EACvCA,GAAgBzjB,EAZD,KAcfwjB,GAAcjb,GAASkb,EACvBA,GAAgBzjB,GASpB,SAAS0qB,GACP9wB,EACAqT,GACA,IAAIqF,EAAM,EACV,GACEA,GAAc,EAAP1Y,EACPA,IAAS,EACT0Y,IAAQ,UACCrF,EAAM,GACjB,OAAOqF,GAAO,EAMhB,SAAS6a,KACH1J,EAAe,EACjBqF,GAActF,GACLC,EAAe,GACxBiF,GAAalF,GAEfA,EAAa,EACbC,EAAe,EA+CjB,SAASb,GAAauL,EAAIC,EAAIC,GAC5B,IACIC,GAAY,EAALH,IAAa,EAAMC,GAAM,EAChCG,GAAY,GAALH,IAAa,EAAMC,GAAM,EAChCG,EAAU,GAALH,EACL12B,EAAI,GAKR,OAJAA,GAAK82B,GAAgB,GALZN,GAAM,GAMfx2B,GAAK82B,GAAgB,GAALH,GAChB32B,GAAK82B,GAAgB,GAALF,GAChB52B,GAAK82B,GAAgB,GAALD,GAIlB,SAASC,GAAWhH,GAClB,OAAIA,EAAI,GACCtwB,OAAOC,aAAa,GAAKqwB,IAElCA,GAAK,IACG,GACCtwB,OAAOC,aAAa,GAAKqwB,IAElCA,GAAK,IACG,GACCtwB,OAAOC,aAAa,GAAKqwB,GAGzB,IADTA,GAAK,IAEI,IAEA,GAALA,EACK,IAEF,M,kCC9lDT,uBAA0nB,G,kCCK1nB,IAAIluB,EAAc5B,EAAQ,QAAmB4B,YAG7CyB,EAAO7C,QAAU,SAA8BiB,EAAKiB,EAAKqB,GACvD,IAAI9B,EAAMyB,EAEN6G,EAAQ7H,EACRsF,EAAS,CACP2I,IAAGA,EACHjO,IAAK,EACLya,MAAO,EACP1b,IAAK,IAGX,GAA4B,KAAxBA,EAAIS,WAAWQ,GAAuB,CAExC,IADAA,IACOA,EAAMqB,GAAK,CAEhB,GAAa,MADb9B,EAAOR,EAAIS,WAAWQ,IACQ,OAAOsF,EACrC,GAAa,KAAT/F,EAAyB,OAAO+F,EACpC,GAAa,KAAT/F,EAIF,OAHA+F,EAAOtF,IAAMA,EAAM,EACnBsF,EAAOvG,IAAMG,EAAYH,EAAIT,MAAMuJ,EAAQ,EAAG7H,IAC9CsF,EAAO2I,MACA3I,EAEI,KAAT/F,GAAyBS,EAAM,EAAIqB,EACrCrB,GAAO,EAITA,IAIF,OAAOsF,EAMT,IADAtE,EAAQ,EACDhB,EAAMqB,GAGE,MAFb9B,EAAOR,EAAIS,WAAWQ,OAKlBT,EAAO,IAAiB,MAATA,IAEnB,GAAa,KAATA,GAAyBS,EAAM,EAAIqB,EAAvC,CACE,GAAgC,KAA5BtC,EAAIS,WAAWQ,EAAM,GAAe,MACxCA,GAAO,MAFT,CAMA,GAAa,KAATT,KACFyB,EACY,GAAM,OAAOsE,EAG3B,GAAa,KAAT/F,EAAuB,CACzB,GAAc,IAAVyB,EAAe,MACnBA,IAGFhB,IAGF,OAAI6H,IAAU7H,GACA,IAAVgB,IAEJsE,EAAOvG,IAAMG,EAAYH,EAAIT,MAAMuJ,EAAO7H,IAC1CsF,EAAOmV,MAnEK,EAoEZnV,EAAOtF,IAAMA,EACbsF,EAAO2I,OANqB3I,I,kCCvE9B,IAAI+uB,EAAU,GACF/2B,EAAQ,QAEdkB,SAAQ,SAAS+I,GACrB8sB,EAAQ9sB,GAAQjK,EAAA,OAAAA,CAAQ,KAAaiK,GAAM+sB,UAG7C3zB,EAAO7C,QAAU,SAASyN,EAAQyS,GAChC,IAAIzW,EACJ,IAAKA,KAAQ8sB,EACX,GAAI9sB,KAAQ8sB,GACDA,EAAQ9sB,GAAMgE,EAAQyS,GAE7B,OAAOzW,EAIb,MAAM,IAAI9I,UAAU,sB,kCCftB,IAAI0B,EAAU7C,EAAQ,QAAmB6C,QAGzCQ,EAAO7C,QAAU,SAAoB8C,EAAOC,EAAWC,EAASC,GAC9D,IAAIwzB,EACA52B,EACAiO,EACAkF,EACAvE,EACAioB,EACA/Z,EACAhO,EACAkC,EACA8lB,EACAC,EACAC,EACAnoB,EACA8E,EACAC,EACAqjB,EACAtoB,EACAI,EACAxL,EACA2zB,EACAC,EAAal0B,EAAMkO,QACnB9O,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GAGvB,GAAID,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAG5D,GAAoC,KAAhCZ,EAAMb,IAAIP,WAAWQ,KAA0B,OAAM,EAIzD,GAAIe,EAAU,OAAM,EAqCpB,IAlCA+P,EAAUnC,EAAS/N,EAAMW,OAAOV,GAAa,EAGX,KAA9BD,EAAMb,IAAIP,WAAWQ,IAGvBA,IACA8Q,IACAnC,IACA4lB,KACAK,MACuC,IAA9Bh0B,EAAMb,IAAIP,WAAWQ,IAC9B40B,MAEKh0B,EAAMmR,QAAQlR,GAAa8N,GAAU,GAAM,GAG9C3O,IACA8Q,IACAnC,IACA4lB,MAKAA,MAGFK,KAGFH,EAAY,CAAE7zB,EAAMO,OAAON,IAC3BD,EAAMO,OAAON,GAAab,EAEnBA,EAAMqB,IACX1D,EAAKiD,EAAMb,IAAIP,WAAWQ,GAEtBG,EAAQxC,KACC,IAAPA,EACFgR,GAAU,GAAKA,EAAS/N,EAAMmR,QAAQlR,IAAc0zB,EAAY,EAAI,IAAM,EAE1E5lB,IAMJ3O,IAqCF,IAlCA00B,EAAa,CAAE9zB,EAAMmR,QAAQlR,IAC7BD,EAAMmR,QAAQlR,GAAaD,EAAMW,OAAOV,GAAa,GAAK+zB,EAAmB,EAAI,GAEjFJ,EAAgBx0B,GAAOqB,EAEvBiQ,EAAY,CAAE1Q,EAAMW,OAAOV,IAC3BD,EAAMW,OAAOV,GAAa8N,EAASmC,EAEnCS,EAAY,CAAE3Q,EAAMQ,OAAOP,IAC3BD,EAAMQ,OAAOP,GAAab,EAAMY,EAAMO,OAAON,GAE7C6L,EAAkB9L,EAAM+F,GAAGvC,MAAMW,MAAM4H,SAAS,cAEhDH,EAAgB5L,EAAMgM,WACtBhM,EAAMgM,WAAa,aAoBdH,EAAW5L,EAAY,EAAG4L,EAAW3L,IASxC+zB,EAAcj0B,EAAMW,OAAOkL,GAAY7L,EAAMY,aAE7CxB,EAAMY,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,MAC5CpL,EAAMT,EAAMU,OAAOmL,MAZ8BA,IAmBjD,GAAoC,KAAhC7L,EAAMb,IAAIP,WAAWQ,MAA2B60B,EAApD,CAoEA,GAAIL,EAAiB,MAIrB,IADAloB,KACKV,EAAI,EAAGW,EAAIG,EAAgB/G,OAAQiG,EAAIW,EAAGX,IAC7C,GAAIc,EAAgBd,GAAGhL,EAAO6L,EAAU3L,MAAgB,CACtDwL,KACA,MAIJ,GAAIA,EAAW,CAKb1L,EAAMkO,QAAUrC,EAEQ,IAApB7L,EAAMY,YAIRizB,EAAU7yB,KAAKhB,EAAMO,OAAOsL,IAC5BioB,EAAW9yB,KAAKhB,EAAMmR,QAAQtF,IAC9B8E,EAAU3P,KAAKhB,EAAMQ,OAAOqL,IAC5B6E,EAAU1P,KAAKhB,EAAMW,OAAOkL,IAC5B7L,EAAMW,OAAOkL,IAAa7L,EAAMY,WAGlC,MAGFizB,EAAU7yB,KAAKhB,EAAMO,OAAOsL,IAC5BioB,EAAW9yB,KAAKhB,EAAMmR,QAAQtF,IAC9B8E,EAAU3P,KAAKhB,EAAMQ,OAAOqL,IAC5B6E,EAAU1P,KAAKhB,EAAMW,OAAOkL,IAI5B7L,EAAMW,OAAOkL,IAAa,MA3G1B,CAsCE,IAlCAqE,EAAUnC,EAAS/N,EAAMW,OAAOkL,GAAY,EAGV,KAA9B7L,EAAMb,IAAIP,WAAWQ,IAGvBA,IACA8Q,IACAnC,IACA4lB,KACAK,MACuC,IAA9Bh0B,EAAMb,IAAIP,WAAWQ,IAC9B40B,MAEKh0B,EAAMmR,QAAQtF,GAAYkC,GAAU,GAAM,GAG7C3O,IACA8Q,IACAnC,IACA4lB,MAKAA,MAGFK,KAGFH,EAAU7yB,KAAKhB,EAAMO,OAAOsL,IAC5B7L,EAAMO,OAAOsL,GAAYzM,EAElBA,EAAMqB,IACX1D,EAAKiD,EAAMb,IAAIP,WAAWQ,GAEtBG,EAAQxC,KACC,IAAPA,EACFgR,GAAU,GAAKA,EAAS/N,EAAMmR,QAAQtF,IAAa8nB,EAAY,EAAI,IAAM,EAEzE5lB,IAMJ3O,IAGFw0B,EAAgBx0B,GAAOqB,EAEvBqzB,EAAW9yB,KAAKhB,EAAMmR,QAAQtF,IAC9B7L,EAAMmR,QAAQtF,GAAY7L,EAAMW,OAAOkL,GAAY,GAAKmoB,EAAmB,EAAI,GAE/EtjB,EAAU1P,KAAKhB,EAAMW,OAAOkL,IAC5B7L,EAAMW,OAAOkL,GAAYkC,EAASmC,EAElCS,EAAU3P,KAAKhB,EAAMQ,OAAOqL,IAC5B7L,EAAMQ,OAAOqL,GAAYzM,EAAMY,EAAMO,OAAOsL,GAiEhD,IAlBAkoB,EAAY/zB,EAAMY,UAClBZ,EAAMY,UAAY,GAElBN,EAAeN,EAAMgB,KAAK,kBAAmB,aAAc,IACrDC,OAAS,IACfX,EAAMY,IAAS2Y,EAAQ,CAAE5Z,EAAW,GAEpCD,EAAM+F,GAAGvC,MAAM8N,SAAStR,EAAOC,EAAW4L,IAE1CvL,EAAeN,EAAMgB,KAAK,mBAAoB,cAAe,IACvDC,OAAS,IAEfjB,EAAMkO,QAAUgmB,EAChBl0B,EAAMgM,WAAaJ,EACnBiO,EAAM,GAAK7Z,EAAMe,KAIZiK,EAAI,EAAGA,EAAI2F,EAAU5L,OAAQiG,IAChChL,EAAMO,OAAOyK,EAAI/K,GAAa4zB,EAAU7oB,GACxChL,EAAMQ,OAAOwK,EAAI/K,GAAa0Q,EAAU3F,GACxChL,EAAMW,OAAOqK,EAAI/K,GAAayQ,EAAU1F,GACxChL,EAAMmR,QAAQnG,EAAI/K,GAAa6zB,EAAW9oB,GAI5C,OAFAhL,EAAMY,UAAYmzB,O,kCCpRpBh0B,EAAO7C,QAAU,SAAmB6I,EAAI1C,GAoBtC,IAAI8wB,GAFJ9wB,EAAUA,GAAW,IAEI8wB,YAAc,YACnCC,EAAWD,EAAWv1B,WAAW,GACjCy1B,EAAchxB,EAAQgxB,aAAe,UACrCC,EAAYD,EAAYz1B,WAAW,GACnC6G,EAASpC,EAAQoC,QAAUM,EAAGrC,SAASQ,MAAMkV,MAC7Cmb,EAAiBlxB,EAAQkxB,gBAvB7B,SAA+BC,EAASC,GACtC,IAAIC,EAAcD,EAAcC,aAAe,MAC3CC,EAAcF,EAAcE,aAAe,MAC3CC,EAASH,EAAcG,QAAU,oCACjCC,EAAUn4B,EAAQ,QAStB,OAAOk4B,EAAS,IAAMF,EAAc,IARnBG,EAAQnN,SACvBmN,EAAQ1N,YACN2N,SAASC,mBACP,SAAWJ,EAAc,KAAOH,EAAU,SAAWG,IACvD,KA4HN5uB,EAAGvC,MAAMW,MAAM8K,OAAO,QAAS,eA5G/B,SAAajP,EAAOC,EAAWC,EAASC,GACtC,IAAI0L,EAAU5K,EAAQ2U,EAAQtV,EAAO0K,EACjCgqB,KACA/tB,EAAQjH,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC/CQ,EAAMT,EAAMU,OAAOT,GAKvB,GAAIm0B,IAAap0B,EAAMb,IAAIP,WAAWqI,GAAU,OAAM,EAItD,IAAK+D,EAAI,EAAGA,EAAImpB,EAAWpvB,SAAUiG,EACnC,GAAImpB,EAAWnpB,KAAOhL,EAAMb,IAAI8H,EAAQ+D,GAAM,OAAM,EAQtD,GALA/J,EAASjB,EAAMb,IAAIzB,MAAMuJ,EAAOA,EAAQ+D,GACxC4K,EAAS5V,EAAMb,IAAIzB,MAAMuJ,EAAQ+D,EAAGvK,GAIhCN,EAAU,OAAM,EAMpB,IAFA0L,EAAW5L,MAGT4L,GACgB3L,OAMhB+G,EAAQjH,EAAMO,OAAOsL,GAAY7L,EAAMQ,OAAOqL,KAC9CpL,EAAMT,EAAMU,OAAOmL,KAEA7L,EAAMW,OAAOkL,GAAY7L,EAAMY,YAOlD,GAAI0zB,IAAct0B,EAAMb,IAAIP,WAAWqI,MAKnCjH,EAAMW,OAAOkL,GAAY7L,EAAMW,OAAOV,IAA1C,CAKA,IAAIg1B,KACJ,IAAKjqB,EAAI,EAAGA,EAAIqpB,EAAYtvB,SAAUiG,EACpC,GAAIqpB,EAAYrpB,KAAOhL,EAAMb,IAAI8H,EAAQ+D,GAAI,CAC3CiqB,KACA,MAIJ,GAAKA,KAKDj1B,EAAMmM,WAAWlF,EAAQ+D,GAAKvK,GAAlC,CAKAu0B,KACA,OAGF,IAAIE,EAAWl1B,EAAMb,IAClBmW,MAAM,MACN5X,MAAMuC,EAAY,EAAG4L,GACrB6I,KAAK,MAGJygB,EAAW,GAEXxmB,EAAMiH,EAASA,EAAOlY,MAAM,GAAK,cAmBrC,OAlBAsC,EAAM+F,GAAGxC,OAAOf,MACdmM,EACA3O,EAAM+F,GACN/F,EAAMqF,IACN8vB,IAGF70B,EAAQN,EAAMgB,KAAK,cAAe,MAAO,IAEnCkM,MAAQ,CAAE,CAAE,MAAOqnB,EAAeW,EAAU7xB,IAAY,CAAE,MAAO,KACvE/C,EAAMkD,SACNlD,EAAMc,SAAW+zB,EACjB70B,EAAM6M,KAAOyI,EACbtV,EAAMY,IAAM,CAAEjB,EAAW4L,GACzBvL,EAAMW,OAASA,EAEfjB,EAAMe,KAAO8K,GAAYmpB,EAAa,EAAI,QAKO,CACjDrmB,IAAK,CAAE,YAAa,YAAa,aAAc,UAEjD5I,EAAGrC,SAASQ,MAAMkxB,YAAc3vB,I,kCC3HlC1F,EAAO7C,QAAU,CACf,OAjBF,SAAgByN,GACd,GAFiB,eAEIA,EAAO3M,SAAS,QAAS,EAAG,GAAI,CACnD,GAAI,SAAW2M,EAAO3M,SAAS,QAAS,GAAI,IAC1C,MAAM,IAAIH,UAAU,eAEtB,OAAM,IAaR,UATF,SAAoB8M,GAClB,MAAO,CACL,MAASA,EAAOmJ,aAAa,IAC7B,OAAUnJ,EAAOmJ,aAAa,Q,yCCflC,I,oFC+CqB,EAArB,SAAA/L,GAAA,oHAAAA,GAAA,oDAUkBgH,GACdzL,KAAK+xB,MAAM,aAActmB,KAX7B,qCAckB3M,GACd,MAAO,mCAAmCvD,KAAKuD,KAfnD,mCAkBgBA,GACZ,OAAOkB,KAAKgyB,eAAelzB,GAAO,GAAKA,IAnB3C,8BAsBWA,GACHkB,KAAKgyB,eAAelzB,IACtBsG,OAAOwJ,KAAK9P,OAxBlB,GAAsC,KAEpC,KADC,YAAK3E,Q,+BAIN,KADC,YAAKA,Q,8BAIN,KADC,YAAKvB,S,oCAPa,IC/Csb,ED+Ctb,EAAQ,KAD5B,KACoB,G,wBEvCjBwN,EAAY,YACd,GHTW,WAAa,IAAIC,EAAIrG,KAASsG,EAAGD,EAAIE,eAAmBC,EAAGH,EAAII,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,aAAa,CAACF,EAAG,UAAU,CAACoD,MAAM,CAAC,iBAAiBvD,EAAI4rB,cAAc,OAAS,GAAG,gBAAgB,GAAG,mBAAmB,UAAU,oBAAoB,WAAWhrB,GAAG,CAAC,OAASZ,EAAI6rB,iBAAiB,CAAC7rB,EAAIO,GAAIP,EAAY,UAAE,SAASgW,GAAM,MAAO,CAAEA,EAAKve,UAAYue,EAAKve,SAAS2D,OAAQ+E,EAAG,aAAa,CAACnO,IAAIgkB,EAAK1H,KAAK/K,MAAM,CAAC,MAAQyS,EAAK1H,OAAO,CAACnO,EAAG,WAAW,CAAC2rB,KAAK,SAAS,CAAC3rB,EAAG,IAAI,CAACK,MAAMwV,EAAK+V,OAAO5rB,EAAG,OAAO,CAACE,YAAY,mBAAmB,CAACL,EAAIM,GAAGN,EAAIU,GAAGsV,EAAKjhB,WAAWiL,EAAIO,GAAIyV,EAAa,UAAE,SAASgW,GAAW,MAAO,CAAEA,EAAUv0B,UAAYu0B,EAAUv0B,SAAS2D,OAAQ+E,EAAG,aAAa,CAACnO,IAAIg6B,EAAU1d,KAAK/K,MAAM,CAAC,MAAQyoB,EAAU1d,OAAO,CAACnO,EAAG,WAAW,CAAC2rB,KAAK,SAAS,CAAC3rB,EAAG,IAAI,CAACK,MAAMwrB,EAAUD,OAAO5rB,EAAG,OAAO,CAACH,EAAIM,GAAGN,EAAIU,GAAGsrB,EAAUj3B,WAAWiL,EAAIO,GAAIyrB,EAAkB,UAAE,SAASC,GAAiB,OAAO9rB,EAAG,eAAe,CAACnO,IAAIi6B,EAAgB3d,KAAK/K,MAAM,CAAC,MAAQ0oB,EAAgB3d,OAAO,CAACnO,EAAG,IAAI,CAACK,MAAMyrB,EAAgBF,OAAO5rB,EAAG,OAAO,CAACoD,MAAM,CAAC,KAAO,SAASuoB,KAAK,SAAS,CAAC9rB,EAAIM,GAAGN,EAAIU,GAAGurB,EAAgBl3B,eAAc,GAAGoL,EAAG,eAAe,CAACnO,IAAIg6B,EAAU1d,KAAK/K,MAAM,CAAC,MAAQyoB,EAAU1d,OAAO,CAACnO,EAAG,IAAI,CAACK,MAAMwrB,EAAUD,OAAO5rB,EAAG,OAAO,CAACoD,MAAM,CAAC,KAAO,SAASuoB,KAAK,SAAS,CAAC9rB,EAAIM,GAAGN,EAAIU,GAAGsrB,EAAUj3B,gBAAe,GAAGoL,EAAG,eAAe,CAACnO,IAAIgkB,EAAK1H,KAAK/K,MAAM,CAAC,MAAQvD,EAAIksB,aAAalW,EAAK1H,OAAO6d,SAAS,CAAC,MAAQ,SAAStrB,GAAQ,OAAOb,EAAIosB,QAAQpW,EAAK1H,SAAS,CAACnO,EAAG,IAAI,CAACK,MAAMwV,EAAK+V,OAAO5rB,EAAG,OAAO,CAACoD,MAAM,CAAC,KAAO,SAASuoB,KAAK,SAAS,CAAC9rB,EAAIM,GAAGN,EAAIU,GAAGsV,EAAKjhB,gBAAe,IAAI,KACniD,IGUpBgM,EAEA,KACA,WACA,MAIa,UAAAhB,E,4CCnBf,uBAAshB,G,4CCAthB,GAKA,IAAIqT,EAAKrgB,EAAQ,QACbs5B,EAAWt5B,EAAQ,QAQvB,SAASu5B,EAAStrB,EAAQyS,EAAUpP,GAElC,IAAIkoB,EAAYF,EAASrrB,EAAQ,GAAI,EAAGqD,GAGpC4P,EAAa,KACbuY,EAAWpZ,EAAGqZ,SAAShZ,GAAUC,KACjC6Y,EAAYtY,EAAauY,IAC3BvY,EAAauY,EAAWD,EAAY,IAItC,IAAIG,EAAY,IAAIxY,EAAOD,GACvBF,EAAaX,EAAGmB,SAASd,EAAU,KAKvC,OAJAL,EAAGoB,SAAST,EAAY2Y,EAAW,EAAGzY,EAAYsY,GAGlCG,EAAU34B,MAAM,GAKlC,SAAS44B,EAAW3rB,EAAQqD,GAC1B,IAAIuoB,EAAMP,EAASrrB,EAAQ,GAAI,EAAGqD,GAElC,OADWgoB,EAASrrB,EAAQ,GAAI,GAAIqD,IACpB,IAAMuoB,EAIxB,SAASC,EAAS7rB,GAChB,GAAIA,EAAO5F,OAAS,GAClB,OAAO4F,EAAOjN,MAAM,IAKxB,SAAS+4B,EAAa9rB,EAAQqD,GAI5B,IAHA,IACIrP,EAAMgI,EAAM5B,EADZ2xB,EAAO,GAGJ/rB,GAAUA,EAAO5F,SACtBpG,EAAOq3B,EAASrrB,EAAQ,GAAI,EAAGqD,GAC/BrH,EAAOqvB,EAASrrB,EAAQ,GAAI,EAAGqD,GAC/BjJ,EAASixB,EAASrrB,EAAQ,GAAI,EAAGqD,GAGpB,IAATrP,IAKa,IAAXoG,GAAyB,IAAT4B,IAClB+vB,EAAK/3B,GAAQ23B,EAAU3rB,EAAQqD,IAIjCrD,EAAS6rB,EAAQ7rB,GAGrB,OAAO+rB,EAyCT32B,EAAO7C,QAAU,CACf,OA3GF,SAAiByN,GACf,IAAIgsB,EAAOhsB,EAAO3M,SAAS,MAAO,EAAG,GACrC,MAAQ,aAAe24B,GAAQ,aAAeA,GA0G9C,UA9BF,SAAoBhsB,EAAQyS,GAE1B,IAAKA,EACH,MAAM,IAAIvf,UAAU,+BAItB,IAAImQ,EAA8C,OAhBpD,SAA8BrD,GAC5B,IAAImZ,EAAYnZ,EAAO3M,SAAS,QAAS,EAAG,GAC5C,MAAI,OAAS8lB,EACJ,KACE,OAASA,EACX,YAWS8S,CAAoBjsB,GAMlC+rB,EAAOD,EAHKR,EAAQtrB,EAAQyS,EAAUpP,GAGRA,GAE9BT,EAAQmpB,EAAK,KACblpB,EAASkpB,EAAK,KAElB,IAAKnpB,IAAUC,EACb,MAAM,IAAI3P,UAAU,8BAGtB,MAAO,CACL,MAAS0P,EACT,OAAUC,O,sEC9Gd,I,iMCA6Y,G,ECyB7Y,sBALA,aClBe,SAAmCxE,EAAQ6tB,EAAUC,EAAYpZ,EAAYqZ,GAC1F,IAAIrG,EAAO,GAEX,IAAahT,GAAY9f,SAAQ,SAAUjC,GACzC+0B,EAAK/0B,GAAO+hB,EAAW/hB,MAGzB+0B,EAAKsG,aAAetG,EAAKsG,WACzBtG,EAAKuG,eAAiBvG,EAAKuG,cAEvB,UAAWvG,GAAQA,EAAKwG,eAC1BxG,EAAKyG,aAGPzG,EAAOoG,EAAWp5B,QAAQ05B,UAAU/jB,QAAO,SAAUqd,EAAM2G,GACzD,OAAOA,EAAUruB,EAAQ6tB,EAAUnG,IAASA,IAC3CA,GAECqG,YAAWrG,EAAKwG,cAClBxG,EAAKpjB,MAAQojB,EAAKwG,YAAcxG,EAAKwG,YAAYt7B,KAAKm7B,UACtDrG,EAAKwG,yBAAcI,IAGjB5G,EAAKwG,cACP,IAAuBluB,EAAQ6tB,EAAUnG,GAEzCA,EAAO,M,mPDNX,G,qHAKA,kBACA,iB,kCAIA,iB,uLAIA,GACA,6BACA,kBACA,W,SAEA,gD,QAAA,E,QACA,6BACA,iBACA,mB,2GAvBA,M,gIEbIhnB,EAAY,YACd,GJTW,WAAa,IAAIC,EAAIrG,KAASsG,EAAGD,EAAIE,eAAmBC,EAAGH,EAAII,MAAMD,IAAIF,EAAG,OAAOE,EAAG,MAAM,CAACE,YAAY,gBAAgB,CAAGL,EAAI4tB,UAAiT,CAACztB,EAAG,MAAM,CAACE,YAAY,aAAakD,MAAM,CAAC,IAAMxQ,EAAQ,WAAwCoN,EAAG,OAAO,CAACE,YAAY,eAAe,CAACL,EAAIM,GAAG,mBAArb,CAACH,EAAG,OAAO,CAACE,YAAY,aAAa,CAACL,EAAIM,GAAG,kBAAkBH,EAAG,UAAU,CAACoD,MAAM,CAAC,YAAY,GAAG,MAAQ,CAAC,QAAS,MAAO,KAAM,OAAQ,SAAS3C,GAAG,CAAC,OAAS,SAASC,GAAQ,OAAOb,EAAI6tB,YAAYC,MAAM,CAACnqB,MAAO3D,EAAW,QAAE6T,SAAS,SAAUka,GAAM/tB,EAAIguB,QAAQD,GAAKE,WAAW,eAAiL,KAC3kB,IIUpBltB,EAEA,KACA,WACA,MAIa,UAAAhB,E,2CCXf,SAASpM,EAAOC,GACd,IAAIC,EAAUC,MAAMlC,UAAUmC,MAAM9B,KAAK+B,UAAW,GAUpD,OARAH,EAAQI,SAAQ,SAAUrB,GACnBA,GAELjB,OAAOwC,KAAKvB,GAAQqB,SAAQ,SAAUjC,GACpC4B,EAAI5B,GAAOY,EAAOZ,SAIf4B,EAGT,SAASU,EAAOV,GAAO,OAAOjC,OAAOC,UAAUyC,SAASpC,KAAK2B,GAC7D,SAASQ,EAASR,GAAO,MAAuB,oBAAhBU,EAAOV,GACvC,SAASs6B,EAASt6B,GAAO,MAAuB,oBAAhBU,EAAOV,GACvC,SAASu6B,EAASv6B,GAAO,MAAuB,oBAAhBU,EAAOV,GACvC,SAASw6B,EAAWx6B,GAAO,MAAuB,sBAAhBU,EAAOV,GAGzC,SAASoC,EAASxB,GAAO,OAAOA,EAAIE,QAAQ,uBAAwB,QAKpE,IAAI25B,EAAiB,CACnBC,WAAUA,EACVC,YAAWA,EACXC,SAAQA,GAWV,IAAIC,EAAiB,CACnB,QAAS,CACPziB,SAAU,SAAU6D,EAAMpa,EAAK2E,GAC7B,IAAIs0B,EAAO7e,EAAK9b,MAAM0B,GAQtB,OANK2E,EAAKgd,GAAGuX,OAEXv0B,EAAKgd,GAAGuX,KAAQ,IAAIh8B,OAClB,UAAYyH,EAAKgd,GAAGU,SAAW1d,EAAKgd,GAAGuB,qBAAuBve,EAAKgd,GAAGa,SAAU,MAGhF7d,EAAKgd,GAAGuX,KAAKz5B,KAAKw5B,GACbA,EAAK95B,MAAMwF,EAAKgd,GAAGuX,MAAM,GAAGvzB,OAE9B,IAGX,SAAW,QACX,OAAW,QACX,KAAW,CACT4Q,SAAU,SAAU6D,EAAMpa,EAAK2E,GAC7B,IAAIs0B,EAAO7e,EAAK9b,MAAM0B,GAkBtB,OAhBK2E,EAAKgd,GAAGwX,UAEXx0B,EAAKgd,GAAGwX,QAAW,IAAIj8B,OACrB,IACAyH,EAAKgd,GAAGU,SAGR,sBAAwB1d,EAAKgd,GAAGiB,WAAa,SAAWje,EAAKgd,GAAGgB,gBAAkB,IAClFhe,EAAKgd,GAAGW,SACR3d,EAAKgd,GAAGY,oBACR5d,EAAKgd,GAAGa,SAER,MAIA7d,EAAKgd,GAAGwX,QAAQ15B,KAAKw5B,GAEnBj5B,GAAO,GAAuB,MAAlBoa,EAAKpa,EAAM,IACvBA,GAAO,GAAuB,MAAlBoa,EAAKpa,EAAM,GADqB,EAEzCi5B,EAAK95B,MAAMwF,EAAKgd,GAAGwX,SAAS,GAAGxzB,OAEjC,IAGX,UAAW,CACT4Q,SAAU,SAAU6D,EAAMpa,EAAK2E,GAC7B,IAAIs0B,EAAO7e,EAAK9b,MAAM0B,GAOtB,OALK2E,EAAKgd,GAAGyX,SACXz0B,EAAKgd,GAAGyX,OAAU,IAAIl8B,OACpB,IAAMyH,EAAKgd,GAAGc,eAAiB,IAAM9d,EAAKgd,GAAGqB,gBAAiB,MAG9Dre,EAAKgd,GAAGyX,OAAO35B,KAAKw5B,GACfA,EAAK95B,MAAMwF,EAAKgd,GAAGyX,QAAQ,GAAGzzB,OAEhC,KAWT0zB,EAAe,8EAA8EnjB,MAAM,KA8BvG,SAASojB,EAAQ30B,GAGf,IAAIgd,EAAKhd,EAAKgd,GAAKrkB,EAAQ,OAARA,CAAoBqH,EAAK40B,UAGxCC,EAAO70B,EAAK80B,SAASn7B,QAWzB,SAASo7B,EAAMC,GAAO,OAAOA,EAAI16B,QAAQ,SAAU0iB,EAAGiY,UATtDj1B,EAAKk1B,YAEAl1B,EAAKm1B,mBACRN,EAAK53B,KA5Ca,2VA8CpB43B,EAAK53B,KAAK+f,EAAGe,QAEbf,EAAGiY,SAAWJ,EAAKlkB,KAAK,KAIxBqM,EAAGoY,YAAmB78B,OAAOw8B,EAAM/X,EAAG2B,iBAAkB,KACxD3B,EAAGqY,WAAmB98B,OAAOw8B,EAAM/X,EAAG4B,gBAAiB,KACvD5B,EAAGsY,iBAAmB/8B,OAAOw8B,EAAM/X,EAAG6B,sBAAuB,KAC7D7B,EAAGuY,gBAAmBh9B,OAAOw8B,EAAM/X,EAAG0B,qBAAsB,KAM5D,IAAI8W,EAAU,GAId,SAASC,EAAY96B,EAAM8uB,GACzB,MAAM,IAAIxpB,MAAM,+BAAiCtF,EAAO,MAAQ8uB,GAHlEzpB,EAAK01B,aAAe,GAMpBn+B,OAAOwC,KAAKiG,EAAK21B,aAAa97B,SAAQ,SAAUc,GAC9C,IAAI8uB,EAAMzpB,EAAK21B,YAAYh7B,GAG3B,GAAY,OAAR8uB,EAAJ,CAEA,IAAImM,EAAW,CAAEhkB,SAAU,KAAMikB,KAAM,MAIvC,GAFA71B,EAAK01B,aAAa/6B,GAAQi7B,EAEtB9B,EAASrK,GAiBX,OAhBIsK,EAAStK,EAAI7X,UACfgkB,EAAShkB,SAnEjB,SAAyBoL,GACvB,OAAO,SAAUvH,EAAMpa,GACrB,IAAIi5B,EAAO7e,EAAK9b,MAAM0B,GAEtB,OAAI2hB,EAAGliB,KAAKw5B,GACHA,EAAK95B,MAAMwiB,GAAI,GAAGhc,OAEpB,GA4DiB80B,CAAgBrM,EAAI7X,UAC/BoiB,EAAWvK,EAAI7X,UACxBgkB,EAAShkB,SAAW6X,EAAI7X,SAExB6jB,EAAY96B,EAAM8uB,QAGhBuK,EAAWvK,EAAI1H,WACjB6T,EAAS7T,UAAY0H,EAAI1H,UACf0H,EAAI1H,UAGd0T,EAAY96B,EAAM8uB,GAFlBmM,EAAS7T,UAjER,SAAUvnB,EAAOwF,GACtBA,EAAK+hB,UAAUvnB,KAwEXR,EAASyvB,GACX+L,EAAQv4B,KAAKtC,GAIf86B,EAAY96B,EAAM8uB,OAOpB+L,EAAQ37B,SAAQ,SAAUk8B,GACnB/1B,EAAK01B,aAAa11B,EAAK21B,YAAYI,MAMxC/1B,EAAK01B,aAAaK,GAAOnkB,SACvB5R,EAAK01B,aAAa11B,EAAK21B,YAAYI,IAAQnkB,SAC7C5R,EAAK01B,aAAaK,GAAOhU,UACvB/hB,EAAK01B,aAAa11B,EAAK21B,YAAYI,IAAQhU,cAM/C/hB,EAAK01B,aAAa,IAAM,CAAE9jB,SAAU,KAAMmQ,UArGnC,SAAUvnB,EAAOwF,GACtBA,EAAK+hB,UAAUvnB,KAyGjB,IAAIw7B,EAAQz+B,OAAOwC,KAAKiG,EAAK01B,cACR30B,QAAO,SAAUpG,GAEhB,OAAOA,EAAKqG,OAAS,GAAKhB,EAAK01B,aAAa/6B,MAE7CwC,IAAIvB,GACJ+U,KAAK,KAE1B3Q,EAAKgd,GAAGiZ,YAAgB19B,OAAO,oBAA2BykB,EAAGK,SAAW,MAAQ2Y,EAAQ,IAAK,KAC7Fh2B,EAAKgd,GAAGkZ,cAAgB39B,OAAO,oBAA2BykB,EAAGK,SAAW,MAAQ2Y,EAAQ,IAAK,MAE7Fh2B,EAAKgd,GAAG9B,QAAU3iB,OAChB,IAAMyH,EAAKgd,GAAGiZ,YAAYz9B,OAAS,MAAQwH,EAAKgd,GAAGuY,gBAAgB/8B,OAAS,MAC5E,KAxIJ,SAAwBwH,GACtBA,EAAKm2B,WAAa,EAClBn2B,EAAKo2B,eAAmB,GA6IxBC,CAAer2B,GAQjB,SAASs2B,EAAMt2B,EAAM6W,GACnB,IAAI3T,EAAQlD,EAAKm2B,UACbpoB,EAAQ/N,EAAKu2B,eACb9gB,EAAQzV,EAAKo2B,eAAez8B,MAAMuJ,EAAO6K,GAO7CxO,KAAK4b,OAAYnb,EAAKw2B,WAAWz7B,cAMjCwE,KAAKyL,MAAY9H,EAAQ2T,EAMzBtX,KAAK6b,UAAYrN,EAAM8I,EAMvBtX,KAAKk3B,IAAYhhB,EAMjBlW,KAAKkW,KAAYA,EAMjBlW,KAAKlB,IAAYoX,EAGnB,SAASihB,EAAY12B,EAAM6W,GACzB,IAAIrc,EAAQ,IAAI87B,EAAMt2B,EAAM6W,GAI5B,OAFA7W,EAAK01B,aAAal7B,EAAM2gB,QAAQ4G,UAAUvnB,EAAOwF,GAE1CxF,EA0CT,SAASoD,EAAU+4B,EAASr3B,GAC1B,KAAMC,gBAAgB3B,GACpB,OAAO,IAAIA,EAAU+4B,EAASr3B,GAG3BA,GA1UP,SAAsB9F,GACpB,OAAOjC,OAAOwC,KAAKP,GAAO,IAAI8V,QAAO,SAAUsnB,EAAKrK,GAClD,OAAOqK,GAAO3C,EAAex8B,eAAe80B,SAyUxCsK,CAAaF,KACfr3B,EAAUq3B,EACVA,EAAU,IAIdp3B,KAAKq1B,SAAqBr7B,EAAO,GAAI06B,EAAgB30B,GAGrDC,KAAK42B,WAAsB,EAC3B52B,KAAKg3B,gBAAsB,EAC3Bh3B,KAAKi3B,WAAqB,GAC1Bj3B,KAAK62B,eAAqB,GAE1B72B,KAAKo2B,YAAqBp8B,EAAO,GAAI86B,EAAgBsC,GACrDp3B,KAAKm2B,aAAqB,GAE1Bn2B,KAAKu1B,SAAqBJ,EAC1Bn1B,KAAK41B,qBAEL51B,KAAKyd,GAAK,GAEV2X,EAAQp1B,MAWV3B,EAAUpG,UAAUs/B,IAAM,SAAa3b,EAAQ4b,GAG7C,OAFAx3B,KAAKo2B,YAAYxa,GAAU4b,EAC3BpC,EAAQp1B,MACDA,MAUT3B,EAAUpG,UAAUsI,IAAM,SAAaR,GAErC,OADAC,KAAKq1B,SAAWr7B,EAAOgG,KAAKq1B,SAAUt1B,GAC/BC,MAST3B,EAAUpG,UAAUsD,KAAO,SAAc2a,GAKvC,GAHAlW,KAAK62B,eAAiB3gB,EACtBlW,KAAK42B,WAAkB,GAElB1gB,EAAKzU,OAAU,OAAM,EAE1B,IAAI0E,EAAGsxB,EAAIC,EAAIhpB,EAAK4I,EAAOnP,EAAMsV,EAAIka,EAGrC,GAAI33B,KAAKyd,GAAGiZ,YAAYn7B,KAAK2a,GAG3B,KAFAuH,EAAKzd,KAAKyd,GAAGkZ,eACV9a,UAAY,EACgB,QAAvB1V,EAAIsX,EAAGZ,KAAK3G,KAElB,GADAxH,EAAM1O,KAAK43B,aAAa1hB,EAAM/P,EAAE,GAAIsX,EAAG5B,WAC9B,CACP7b,KAAKi3B,WAAiB9wB,EAAE,GACxBnG,KAAK42B,UAAiBzwB,EAAEsF,MAAQtF,EAAE,GAAG1E,OACrCzB,KAAKg3B,eAAiB7wB,EAAEsF,MAAQtF,EAAE,GAAG1E,OAASiN,EAC9C,MA8CN,OAzCI1O,KAAKq1B,SAASV,WAAa30B,KAAKm2B,aAAa,YAE/CwB,EAAUzhB,EAAK2hB,OAAO73B,KAAKyd,GAAGuY,mBACf,IAETh2B,KAAK42B,UAAY,GAAKe,EAAU33B,KAAK42B,YAC0D,QAA5Fa,EAAKvhB,EAAKjb,MAAM+E,KAAKq1B,SAASR,QAAU70B,KAAKyd,GAAGqY,WAAa91B,KAAKyd,GAAGsY,qBAExEze,EAAQmgB,EAAGhsB,MAAQgsB,EAAG,GAAGh2B,QAErBzB,KAAK42B,UAAY,GAAKtf,EAAQtX,KAAK42B,aACrC52B,KAAKi3B,WAAiB,GACtBj3B,KAAK42B,UAAiBtf,EACtBtX,KAAKg3B,eAAiBS,EAAGhsB,MAAQgsB,EAAG,GAAGh2B,UAO7CzB,KAAKq1B,SAAST,YAAc50B,KAAKm2B,aAAa,aAEvCjgB,EAAKpb,QAAQ,MACR,GAGmC,QAA1C48B,EAAKxhB,EAAKjb,MAAM+E,KAAKyd,GAAGoY,gBAE3Bve,EAAQogB,EAAGjsB,MAAQisB,EAAG,GAAGj2B,OACzB0G,EAAQuvB,EAAGjsB,MAAQisB,EAAG,GAAGj2B,QAErBzB,KAAK42B,UAAY,GAAKtf,EAAQtX,KAAK42B,WAClCtf,IAAUtX,KAAK42B,WAAazuB,EAAOnI,KAAKg3B,kBAC3Ch3B,KAAKi3B,WAAiB,UACtBj3B,KAAK42B,UAAiBtf,EACtBtX,KAAKg3B,eAAiB7uB,KAMvBnI,KAAK42B,WAAa,GAW3Bv4B,EAAUpG,UAAU0jB,QAAU,SAAiBzF,GAC7C,OAAOlW,KAAKyd,GAAG9B,QAAQpgB,KAAK2a,IAa9B7X,EAAUpG,UAAU2/B,aAAe,SAAsB1hB,EAAM0F,EAAQ9f,GAErE,OAAKkE,KAAKm2B,aAAava,EAAOpgB,eAGvBwE,KAAKm2B,aAAava,EAAOpgB,eAAe6W,SAAS6D,EAAMpa,EAAKkE,MAF1D,GAsBX3B,EAAUpG,UAAUgD,MAAQ,SAAeib,GACzC,IAAIoB,EAAQ,EAAGlW,EAAS,GAGpBpB,KAAK42B,WAAa,GAAK52B,KAAK62B,iBAAmB3gB,IACjD9U,EAAO1D,KAAKy5B,EAAYn3B,KAAMsX,IAC9BA,EAAQtX,KAAKg3B,gBAOf,IAHA,IAAIjC,EAAOzd,EAAQpB,EAAK9b,MAAMkd,GAASpB,EAGhClW,KAAKzE,KAAKw5B,IACf3zB,EAAO1D,KAAKy5B,EAAYn3B,KAAMsX,IAE9Byd,EAAOA,EAAK36B,MAAM4F,KAAKg3B,gBACvB1f,GAAStX,KAAKg3B,eAGhB,OAAI51B,EAAOK,OACFL,EAGF,MAmBT/C,EAAUpG,UAAUq9B,KAAO,SAAcp0B,EAAM42B,GAG7C,OAFA52B,EAAO/G,MAAMkH,QAAQH,GAAQA,EAAO,CAAEA,GAEjC42B,GAOL93B,KAAKu1B,SAAWv1B,KAAKu1B,SAASv5B,OAAOkF,GACJ62B,OACAv2B,QAAO,SAAUw2B,EAAI/rB,EAAKuJ,GACzB,OAAOwiB,IAAOxiB,EAAIvJ,EAAM,MAEzB6nB,UAEjCsB,EAAQp1B,MACDA,OAdLA,KAAKu1B,SAAWr0B,EAAK9G,QACrB4F,KAAK41B,qBACLR,EAAQp1B,MACDA,OAmBX3B,EAAUpG,UAAUuqB,UAAY,SAAmBvnB,GAK5CA,EAAM2gB,SAAU3gB,EAAM6D,IAAM,UAAY7D,EAAM6D,KAE9B,YAAjB7D,EAAM2gB,QAAyB,YAAYrgB,KAAKN,EAAM6D,OACxD7D,EAAM6D,IAAM,UAAY7D,EAAM6D,MAUlCT,EAAUpG,UAAU09B,UAAY,aAIhCl5B,EAAO7C,QAAUyE,G,kCCvnBjB,IAAIpC,EAAU7C,EAAQ,QAAmB6C,QAGzCQ,EAAO7C,QAAU,SAAY8C,EAAOC,EAAWC,EAASC,GACtD,IAAI2H,EAAQyzB,EAAKx+B,EAAIuD,EACjBlB,EAAMY,EAAMO,OAAON,GAAaD,EAAMQ,OAAOP,GAC7CQ,EAAMT,EAAMU,OAAOT,GAGvB,GAAID,EAAMW,OAAOV,GAAaD,EAAMY,WAAa,EAAK,OAAM,EAK5D,GAAe,MAHfkH,EAAS9H,EAAMb,IAAIP,WAAWQ,OAIf,KAAX0I,GACW,KAAXA,EACF,OAAM,EAMR,IADAyzB,EAAM,EACCn8B,EAAMqB,GAAK,CAEhB,IADA1D,EAAKiD,EAAMb,IAAIP,WAAWQ,QACf0I,IAAWvI,EAAQxC,GAAO,OAAM,EACvCA,IAAO+K,GAAUyzB,IAGvB,QAAIA,EAAM,IAENp7B,IAEJH,EAAMe,KAAOd,EAAY,EAEzBK,EAAeN,EAAMgB,KAAK,KAAM,KAAM,GACtCV,EAAMY,IAAS,CAAEjB,EAAWD,EAAMe,MAClCT,EAAMW,OAASxD,MAAM89B,EAAM,GAAG7mB,KAAKxY,OAAOC,aAAa2L","file":"js/chunk-4679972e.23f708ac.js","sourcesContent":["// 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) : parseInt(name.slice(1), 10);\n\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  // Trim and collapse whitespace\n  //\n  str = str.trim().replace(/\\s+/g, ' ');\n\n  // In node v10 'ẞ'.toLowerCase() === 'Ṿ', which is presumed to be a bug\n  // fixed in v12 (couldn't find any details).\n  //\n  // So treat this one as a special case\n  // (remove this when node v10 is no longer supported).\n  //\n  if ('ẞ'.toLowerCase() === 'Ṿ') {\n    str = str.replace(/ẞ/g, 'ß');\n  }\n\n  // .toLowerCase().toUpperCase() should get rid of all differences\n  // between letter variants.\n  //\n  // Simple .toLowerCase() doesn't normalize 125 code points correctly,\n  // and .toUpperCase doesn't normalize 6 of them (list of exceptions:\n  // İ, ϴ, ẞ, Ω, K, Å - those are already uppercased, but have differently\n  // uppercased versions).\n  //\n  // Here's an example showing how it happens. Lets take greek letter omega:\n  // uppercase U+0398 (Θ), U+03f4 (ϴ) and lowercase U+03b8 (θ), U+03d1 (ϑ)\n  //\n  // Unicode entries:\n  // 0398;GREEK CAPITAL LETTER THETA;Lu;0;L;;;;;N;;;;03B8;\n  // 03B8;GREEK SMALL LETTER THETA;Ll;0;L;;;;;N;;;0398;;0398\n  // 03D1;GREEK THETA SYMBOL;Ll;0;L;<compat> 03B8;;;;N;GREEK SMALL LETTER SCRIPT THETA;;0398;;0398\n  // 03F4;GREEK CAPITAL THETA SYMBOL;Lu;0;L;<compat> 0398;;;;N;;;;03B8;\n  //\n  // Case-insensitive comparison should treat all of them as equivalent.\n  //\n  // But .toLowerCase() doesn't change ϑ (it's already lowercase),\n  // and .toUpperCase() doesn't change ϴ (already uppercase).\n  //\n  // Applying first lower then upper case normalizes any character:\n  // '\\u0398\\u03f4\\u03b8\\u03d1'.toLowerCase().toUpperCase() === '\\u0398\\u0398\\u0398\\u0398'\n  //\n  // Note: this is equivalent to unicode case folding; unicode normalization\n  // is a different step that is not required here.\n  //\n  // Final result should be uppercased, because it's later stored in an object\n  // (this avoid a conflict with Object.prototype members,\n  // most notably, `__proto__`)\n  //\n  return str.toLowerCase().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","// 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","// 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  // add '%' to exclude list because of https://github.com/markdown-it/markdown-it/issues/720\n  return mdurl.decode(mdurl.format(parsed), mdurl.decode.defaultChars + '%');\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(str, { language: lang, ignoreIllegals: 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(str, { language: lang, ignoreIllegals: 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 will - 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 return 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","// 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  this.tokens_meta = Array(outTokens.length);\n\n  this.pos = 0;\n  this.posMax = this.src.length;\n  this.level = 0;\n  this.pending = '';\n  this.pendingLevel = 0;\n\n  // Stores { start: end } pairs. Useful for backtrack\n  // optimization of pairs parse (emphasis, strikes).\n  this.cache = {};\n\n  // List of emphasis-like delimiters for current tag\n  this.delimiters = [];\n\n  // Stack of delimiter lists for upper level tags\n  this._prev_delimiters = [];\n\n  // backtick length => last seen position\n  this.backticks = {};\n  this.backticksScanned = false;\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  var token_meta = null;\n\n  if (nesting < 0) {\n    // closing tag\n    this.level--;\n    this.delimiters = this._prev_delimiters.pop();\n  }\n\n  token.level = this.level;\n\n  if (nesting > 0) {\n    // opening tag\n    this.level++;\n    this._prev_delimiters.push(this.delimiters);\n    this.delimiters = [];\n    token_meta = { delimiters: this.delimiters };\n  }\n\n  this.pendingLevel = this.level;\n  this.tokens.push(token);\n  this.tokens_meta.push(token_meta);\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","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"sub-menu-wrapper\"},[_c('span',{staticClass:\"sub-menu-title\"},[_vm._v(\"本页目录\")]),_c('div',{staticClass:\"sub-menu-container\"},[_c('ul',{staticClass:\"sub-menu\"},_vm._l((_vm.menus),function(menu){return _c('li',{key:menu.key,class:['sub-menu-item', {'active': _vm.curMenuKey === menu.key}],domProps:{\"textContent\":_vm._s(menu.label)},on:{\"click\":function($event){return _vm.selectSubMenu(menu.key)}}})}),0)])])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\r\nimport { Component, Prop, Vue, Watch } from 'vue-property-decorator'\r\nimport { DocMenu } from '@/apps/open/types/doc'\r\nimport { scrollToTag } from '@/apps/open/utils/scroll'\r\n\r\n@Component\r\nexport default class SubMenu extends Vue {\r\n  @Prop()\r\n  menus!: DocMenu[]\r\n\r\n  curMenuKey: string = ''\r\n  observer:any = {}\r\n  isInitHash: boolean = false\r\n\r\n  @Watch('menus')\r\n  listenMenu () {\r\n    this.curMenuKey = location.hash.slice(1)\r\n    if (this.isPrivate) {\r\n      let keyIdx = this.curMenuKey.lastIndexOf('#')\r\n      this.curMenuKey = this.curMenuKey.slice(keyIdx + 1)\r\n    }\r\n    if (!this.curMenuKey && this.menus && this.menus.length > 0) {\r\n      this.curMenuKey = this.menus[0].key\r\n    }\r\n    this.registerObserver()\r\n  }\r\n\r\n  mounted () {\r\n    if (window.IntersectionObserver) {\r\n      this.initObserver()\r\n    }\r\n  }\r\n\r\n  get isPrivate () {\r\n    return this.$store.getters['isPrivate']\r\n  }\r\n\r\n  initObserver () {\r\n    this.observer = new IntersectionObserver((entries) => {\r\n      if (entries[0].isIntersecting) {\r\n        if (this.curMenuKey && !this.isInitHash) {\r\n          this.setCurMenuKey(this.curMenuKey)\r\n          this.isInitHash = true\r\n        } else {\r\n          this.setCurMenuKey(entries[0].target.id)\r\n        }\r\n      }\r\n    }, {\r\n      threshold: 1.0\r\n    })\r\n  }\r\n\r\n  registerObserver () {\r\n    this.menus.forEach(menu => {\r\n      let target = document.querySelector(`#${menu.key}`)\r\n      target && this.observer.observe(target)\r\n    })\r\n  }\r\n\r\n  setCurMenuKey (key: string) {\r\n    this.curMenuKey = key\r\n  }\r\n\r\n  selectSubMenu (key: string) {\r\n    this.setCurMenuKey(key)\r\n    scrollToTag(this.curMenuKey)\r\n  }\r\n}\r\n","import mod from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--14-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/ts-loader/index.js??ref--14-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./subMenu.vue?vue&type=script&lang=ts&\"; export default mod; export * from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--14-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/ts-loader/index.js??ref--14-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./subMenu.vue?vue&type=script&lang=ts&\"","import { render, staticRenderFns } from \"./subMenu.vue?vue&type=template&id=173324de&scoped=true&\"\nimport script from \"./subMenu.vue?vue&type=script&lang=ts&\"\nexport * from \"./subMenu.vue?vue&type=script&lang=ts&\"\nimport style0 from \"./subMenu.vue?vue&type=style&index=0&id=173324de&lang=scss&scoped=true&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n  script,\n  render,\n  staticRenderFns,\n  false,\n  null,\n  \"173324de\",\n  null\n  \n)\n\nexport default component.exports","'use strict';\n\nfunction isBMP (buffer) {\n  return ('BM' === buffer.toString('ascii', 0, 2));\n}\n\nfunction calculate (buffer) {\n  return {\n    'width': buffer.readUInt32LE(18),\n    'height': buffer.readUInt32LE(22)\n  };\n}\n\nmodule.exports = {\n  'detect': isBMP,\n  'calculate': calculate\n};\n","'use strict';\n\n// NOTE: we only support baseline and progressive JPGs here\n// due to the structure of the loader class, we only get a buffer\n// with a maximum size of 4096 bytes. so if the SOF marker is outside\n// if this range we can't detect the file size correctly.\n\n// TO-DO: handle all JFIFs\nvar validJFIFMarkers = {\n  'ffdb': '0001010101', // Samsung D807 JPEG\n  'ffe0': '4a46494600', // Standard JPEG\n  'ffe1': '4578696600', // Camera JPEG, with EXIF data\n  'ffe2': '4943435f50', // Canon EOS-1D JPEG\n  'ffe3': '',           // Samsung D500 JPEG\n  'ffe8': '5350494646', // SPIFF JPEG\n  'ffec': '4475636b79', // Photoshop JPEG\n  'ffed': '50686f746f', // Adobe JPEG, Photoshop CMYK buffer\n  'ffee': '41646f6265'  // Adobe JPEG, Unrecognised (Lightroom??)\n};\n\nvar red = ['\\x1B[31m', '\\x1B[39m'];\nfunction isJPG (buffer) { //, filepath\n  var SOIMarker = buffer.toString('hex', 0, 2);\n  var JFIFMarker = buffer.toString('hex', 2, 4);\n\n  // not a valid jpeg\n  if ('ffd8' !== SOIMarker) {\n    return false;\n  }\n\n  // TO-DO: validate the end-bytes of a jpeg file\n  // use filepath, get the last bytes, check for ffd9\n  var got = buffer.toString('hex', 6, 11);\n  var expected = JFIFMarker && validJFIFMarkers[JFIFMarker];\n  if (expected === '') {\n    console.warn(\n      red[0] +\n      'this looks like a unrecognised jpeg\\n' +\n      'please report the issue here\\n' +\n      red[1],\n      '\\thttps://github.com/netroy/image-size/issues/new\\n'\n    );\n    return false;\n  }\n  return (got === expected) || (JFIFMarker === 'ffdb');\n}\n\nfunction extractSize (buffer, i) {\n  return {\n    'height' : buffer.readUInt16BE(i),\n    'width' : buffer.readUInt16BE(i + 2)\n  };\n}\n\nfunction validateBuffer (buffer, i) {\n  // index should be within buffer limits\n  if (i > buffer.length) {\n    throw new TypeError('Corrupt JPG, exceeded buffer limits');\n  }\n  // Every JPEG block must begin with a 0xFF\n  if (buffer[i] !== 0xFF) {\n    throw new TypeError('Invalid JPG, marker table corrupted');\n  }\n}\n\nfunction calculate (buffer) {\n\n  // Skip 5 chars, they are for signature\n  buffer = buffer.slice(4);\n\n  var i, next;\n  while (buffer.length) {\n    // read length of the next block\n    i = buffer.readUInt16BE(0);\n\n    // ensure correct format\n    validateBuffer(buffer, i);\n\n    // 0xFFC0 is baseline(SOF)\n    // 0xFFC2 is progressive(SOF2)\n    next = buffer[i + 1];\n    if (next === 0xC0 || next === 0xC2) {\n      return extractSize(buffer, i + 5);\n    }\n\n    // move to the next block\n    buffer = buffer.slice(i + 2);\n  }\n\n  throw new TypeError('Invalid JPG, no size found');\n}\n\nmodule.exports = {\n  'detect': isJPG,\n  'calculate': calculate\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","// \"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","// Clean up tokens after emphasis and strikethrough postprocessing:\n// merge adjacent text nodes into one and re-calculate all token levels\n//\n// This is necessary because initially emphasis delimiter markers (*, _, ~)\n// are treated as their own separate text tokens. Then emphasis rule either\n// leaves them as text (needed to merge with adjacent text) or turns them\n// into opening/closing tags (which messes up levels inside).\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 after emphasis/strikethrough turns some text nodes\n    // into opening/closing tags\n    if (tokens[curr].nesting < 0) level--; // closing tag\n    tokens[curr].level = level;\n    if (tokens[curr].nesting > 0) level++; // opening tag\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","import mod from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./DocRate.vue?vue&type=style&index=0&id=cc41fafc&lang=scss&scoped=true&\"; export default mod; export * from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./DocRate.vue?vue&type=style&index=0&id=cc41fafc&lang=scss&scoped=true&\"","// 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 url, fullUrl, token, ch, start, max,\n      pos = state.pos;\n\n  if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false; }\n\n  start = state.pos;\n  max = state.posMax;\n\n  for (;;) {\n    if (++pos >= max) return false;\n\n    ch = state.src.charCodeAt(pos);\n\n    if (ch === 0x3C /* < */) return false;\n    if (ch === 0x3E /* > */) break;\n  }\n\n  url = state.src.slice(start + 1, pos);\n\n  if (AUTOLINK_RE.test(url)) {\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 += url.length + 2;\n    return true;\n  }\n\n  if (EMAIL_RE.test(url)) {\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 += url.length + 2;\n    return true;\n  }\n\n  return false;\n};\n","// Parse image size\n//\n'use strict';\n\nfunction parseNextNumber(str, pos, max) {\n  var code,\n  start = pos,\n  result = {\n    ok: false,\n    pos: pos,\n    value: ''\n  };\n\n  code = str.charCodeAt(pos);\n\n  while (pos < max && (code >= 0x30 /* 0 */ && code <= 0x39 /* 9 */) || code === 0x25 /* % */) {\n    code = str.charCodeAt(++pos);\n  }\n\n  result.ok = true;\n  result.pos = pos;\n  result.value = str.slice(start, pos);\n\n  return result;\n}\n\nmodule.exports = function parseImageSize(str, pos, max) {\n  var code,\n  result = {\n    ok: false,\n    pos: 0,\n    width: '',\n    height: ''\n  };\n\n  if (pos >= max) { return result; }\n\n  code = str.charCodeAt(pos);\n\n  if (code !== 0x3d /* = */) { return result; }\n\n  pos++;\n\n  // size must follow = without any white spaces as follows\n  // (1) =300x200\n  // (2) =300x\n  // (3) =x200\n  code = str.charCodeAt(pos);\n  if (code !== 0x78 /* x */ && (code < 0x30 || code  > 0x39) /* [0-9] */) {\n    return result;\n  }\n\n  // parse width\n  var resultW = parseNextNumber(str, pos, max);\n  pos = resultW.pos;\n\n  // next charactor must be 'x'\n  code = str.charCodeAt(pos);\n  if (code !== 0x78 /* x */) { return result; }\n\n  pos++;\n\n  // parse height\n  var resultH = parseNextNumber(str, pos, max);\n  pos = resultH.pos;\n\n  result.width = resultW.value;\n  result.height = resultH.value;\n  result.pos = pos;\n  result.ok = true;\n  return result;\n};\n","// 19.1.2.14 Object.keys(O)\nvar toObject = require('./_to-object');\nvar $keys = require('./_object-keys');\n\nrequire('./_object-sap')('keys', function () {\n  return function keys(it) {\n    return $keys(toObject(it));\n  };\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(buffer, bits, offset, isBigEndian) {\n  offset = offset || 0;\n  var endian = !!isBigEndian ? 'BE' : 'LE';\n  var method = buffer['readUInt' + bits + endian];\n  return method.call(buffer, offset);\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","// 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","// 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","/**\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","// Parse backticks\n\n'use strict';\n\n\nmodule.exports = function backtick(state, silent) {\n  var start, max, marker, token, matchStart, matchEnd, openerLength, closerLength,\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  // scan marker length\n  while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++; }\n\n  marker = state.src.slice(start, pos);\n  openerLength = marker.length;\n\n  if (state.backticksScanned && (state.backticks[openerLength] || 0) <= start) {\n    if (!silent) state.pending += marker;\n    state.pos += openerLength;\n    return true;\n  }\n\n  matchStart = matchEnd = pos;\n\n  // Nothing found in the cache, scan until the end of the line (or until marker is found)\n  while ((matchStart = state.src.indexOf('`', matchEnd)) !== -1) {\n    matchEnd = matchStart + 1;\n\n    // scan marker length\n    while (matchEnd < max && state.src.charCodeAt(matchEnd) === 0x60/* ` */) { matchEnd++; }\n\n    closerLength = matchEnd - matchStart;\n\n    if (closerLength === openerLength) {\n      // Found matching closer 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          .replace(/^ (.+) $/, '$1');\n      }\n      state.pos = matchEnd;\n      return true;\n    }\n\n    // Some different length found, put it in cache as upper limit of where closer can be found\n    state.backticks[closerLength] = matchStart;\n  }\n\n  // Scanned through the end, didn't find anything\n  state.backticksScanned = true;\n\n  if (!silent) state.pending += marker;\n  state.pos += openerLength;\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      oldListIndent,\n      oldParentType,\n      oldSCount,\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  // Special case:\n  //  - item 1\n  //   - item 2\n  //    - item 3\n  //     - item 4\n  //      - this one is a paragraph continuation\n  if (state.listIndent >= 0 &&\n      state.sCount[startLine] - state.listIndent >= 4 &&\n      state.sCount[startLine] < state.blkIndent) {\n    return false;\n  }\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.slice(start, posAfterMarker - 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    if (isOrdered) {\n      token.info = state.src.slice(start, posAfterMarker - 1);\n    }\n\n    // change current state, then restore it after parser subcall\n    oldTight = state.tight;\n    oldTShift = state.tShift[startLine];\n    oldSCount = state.sCount[startLine];\n\n    //  - example list\n    // ^ listIndent position will be here\n    //   ^ blkIndent position will be here\n    //\n    oldListIndent = state.listIndent;\n    state.listIndent = state.blkIndent;\n    state.blkIndent = indent;\n\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 = state.listIndent;\n    state.listIndent = oldListIndent;\n    state.tShift[startLine] = oldTShift;\n    state.sCount[startLine] = oldSCount;\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    // if it's indented more than 3 spaces, it should be a code block\n    if (state.sCount[startLine] - state.blkIndent >= 4) { 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      start = state.bMarks[nextLine] + state.tShift[nextLine];\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\nmodule.exports = function ins_plugin(md) {\n  // Insert each marker as a separate text token, and add it to delimiter list\n  //\n  function tokenize(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 !== 0x3D/* = */) { 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      if (!scanned.can_open && !scanned.can_close) { continue; }\n\n      state.delimiters.push({\n        marker: marker,\n        length: 0,     // disable \"rule of 3\" length checks meant for emphasis\n        jump:   i / 2, // 1 delimiter = 2 characters\n        token:  state.tokens.length - 1,\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  //\n  function postProcess(state, delimiters) {\n    var i, j,\n        startDelim,\n        endDelim,\n        token,\n        loneMarkers = [],\n        max = delimiters.length;\n\n    for (i = 0; i < max; i++) {\n      startDelim = delimiters[i];\n\n      if (startDelim.marker !== 0x3D/* = */) {\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    = 'mark_open';\n      token.tag     = 'mark';\n      token.nesting = 1;\n      token.markup  = '==';\n      token.content = '';\n\n      token         = state.tokens[endDelim.token];\n      token.type    = 'mark_close';\n      token.tag     = 'mark';\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 === 'mark_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\n  md.inline.ruler.before('emphasis', 'mark', tokenize);\n  md.inline.ruler2.before('emphasis', 'mark', function (state) {\n    var curr,\n        tokens_meta = state.tokens_meta,\n        max = (state.tokens_meta || []).length;\n\n    postProcess(state, state.delimiters);\n\n    for (curr = 0; curr < max; curr++) {\n      if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n        postProcess(state, tokens_meta[curr].delimiters);\n      }\n    }\n  });\n};\n","// Normalize input string\n\n'use strict';\n\n\n// https://spec.commonmark.org/0.29/#line-ending\nvar NEWLINES_RE  = /\\r\\n?|\\n/g;\nvar NULL_RE      = /\\0/g;\n\n\nmodule.exports = function normalize(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","/** 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",";(function (root, factory) {\n  if (typeof exports === 'object') {\n    module.exports = factory()\n  } else {\n    root.markdownitMathjax = factory()\n  }\n})(this, function () {\n  function math (state, silent) {\n    var startMathPos = state.pos\n    if (state.src.charCodeAt(startMathPos) !== 0x5C /* \\ */) {\n      return false\n    }\n    var match = state.src.slice(++startMathPos).match(/^(?:\\\\\\[|\\\\\\(|begin\\{([^}]*)\\})/)\n    if (!match) {\n      return false\n    }\n    startMathPos += match[0].length\n    var type, endMarker, includeMarkers\n    if (match[0] === '\\\\[') {\n      type = 'display_math'\n      endMarker = '\\\\\\\\]'\n    } else if (match[0] === '\\\\(') {\n      type = 'inline_math'\n      endMarker = '\\\\\\\\)'\n    } else if (match[1]) {\n      type = 'math'\n      endMarker = '\\\\end{' + match[1] + '}'\n      includeMarkers = true\n    }\n    var endMarkerPos = state.src.indexOf(endMarker, startMathPos)\n    if (endMarkerPos === -1) {\n      return false\n    }\n    var nextPos = endMarkerPos + endMarker.length\n    if (!silent) {\n      var token = state.push(type, '', 0)\n      token.content = includeMarkers\n        ? state.src.slice(state.pos, nextPos)\n        : state.src.slice(startMathPos, endMarkerPos)\n    }\n    state.pos = nextPos\n    return true\n  }\n\n  function texMath (state, silent) {\n    var startMathPos = state.pos\n    if (state.src.charCodeAt(startMathPos) !== 0x24 /* $ */) {\n      return false\n    }\n\n    // Parse tex math according to http://pandoc.org/README.html#math\n    var endMarker = '$'\n    var afterStartMarker = state.src.charCodeAt(++startMathPos)\n    if (afterStartMarker === 0x24 /* $ */) {\n      endMarker = '$$'\n      if (state.src.charCodeAt(++startMathPos) === 0x24 /* $ */) {\n        // 3 markers are too much\n        return false\n      }\n    } else {\n      // Skip if opening $ is succeeded by a space character\n      if (afterStartMarker === 0x20 /* space */ || afterStartMarker === 0x09 /* \\t */ || afterStartMarker === 0x0a /* \\n */) {\n        return false\n      }\n    }\n    var endMarkerPos = state.src.indexOf(endMarker, startMathPos)\n    if (endMarkerPos === -1) {\n      return false\n    }\n    if (state.src.charCodeAt(endMarkerPos - 1) === 0x5C /* \\ */) {\n      return false\n    }\n    var nextPos = endMarkerPos + endMarker.length\n    if (endMarker.length === 1) {\n      // Skip if $ is preceded by a space character\n      var beforeEndMarker = state.src.charCodeAt(endMarkerPos - 1)\n      if (beforeEndMarker === 0x20 /* space */ || beforeEndMarker === 0x09 /* \\t */ || beforeEndMarker === 0x0a /* \\n */) {\n        return false\n      }\n      // Skip if closing $ is succeeded by a digit (eg $5 $10 ...)\n      var suffix = state.src.charCodeAt(nextPos)\n      if (suffix >= 0x30 && suffix < 0x3A) {\n        return false\n      }\n    }\n\n    if (!silent) {\n      var token = state.push(endMarker.length === 1 ? 'inline_math' : 'display_math', '', 0)\n      token.content = state.src.slice(startMathPos, endMarkerPos)\n    }\n    state.pos = nextPos\n    return true\n  }\n\n  function escapeHtml (html) {\n    return html.replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/\\u00a0/g, ' ')\n  }\n\n  function extend (options, defaults) {\n    return Object.keys(defaults).reduce(function (result, key) {\n      if (result[key] === undefined) {\n        result[key] = defaults[key]\n      }\n      return result\n    }, options)\n  }\n\n  var mapping = {\n    'math': 'Math',\n    'inline_math': 'InlineMath',\n    'display_math': 'DisplayMath'\n  }\n\n  return function (options) {\n    var defaults = {\n      beforeMath: '',\n      afterMath: '',\n      beforeInlineMath: '\\\\(',\n      afterInlineMath: '\\\\)',\n      beforeDisplayMath: '\\\\[',\n      afterDisplayMath: '\\\\]'\n    }\n    options = extend(options || {}, defaults)\n\n    return function (md) {\n      md.inline.ruler.before('escape', 'math', math)\n      md.inline.ruler.push('texMath', texMath)\n\n      Object.keys(mapping).forEach(function (key) {\n        var before = options['before' + mapping[key]]\n        var after = options['after' + mapping[key]]\n        md.renderer.rules[key] = function (tokens, idx) {\n          return before + escapeHtml(tokens[idx].content) + after\n        }\n      })\n    }\n  }\n})\n","'use strict';\n\nfunction isPSD (buffer) {\n  return ('8BPS' === buffer.toString('ascii', 0, 4));\n}\n\nfunction calculate (buffer) {\n  return {\n    'width': buffer.readUInt32BE(18),\n    'height': buffer.readUInt32BE(14)\n  };\n}\n\nmodule.exports = {\n  'detect': isPSD,\n  'calculate': calculate\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","// 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  = '<[?][\\\\s\\\\S]*?[?]>';\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","// 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,6}|[0-9]{1,7}));/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","// 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|textarea)(?=(\\s|>|$))/i, /<\\/(script|pre|style|textarea)>/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","import mod from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./docBody.vue?vue&type=style&index=1&id=6b1ad95e&lang=scss&scoped=true&\"; export default mod; export * from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./docBody.vue?vue&type=style&index=1&id=6b1ad95e&lang=scss&scoped=true&\"","export function scrollToTag (tagId: string) {\r\n  const curTitleDom = document.querySelector(`#${tagId}`)\r\n  if (curTitleDom) {\r\n    const topPostion = curTitleDom.getBoundingClientRect().top\r\n    window.scroll(0, topPostion + (window.scrollY || window.pageYOffset) - 150)\r\n  }\r\n}\r\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","// 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","// Process block-level custom containers\n//\n'use strict';\n\n\nmodule.exports = function container_plugin(md, name, options) {\n\n  // Second param may be useful if you decide\n  // to increase minimal allowed marker length\n  function validateDefault(params/*, markup*/) {\n    return params.trim().split(' ', 2)[0] === name;\n  }\n\n  function renderDefault(tokens, idx, _options, env, slf) {\n\n    // add a class to the opening tag\n    if (tokens[idx].nesting === 1) {\n      tokens[idx].attrJoin('class', name);\n    }\n\n    return slf.renderToken(tokens, idx, _options, env, slf);\n  }\n\n  options = options || {};\n\n  var min_markers = 3,\n      marker_str  = options.marker || ':',\n      marker_char = marker_str.charCodeAt(0),\n      marker_len  = marker_str.length,\n      validate    = options.validate || validateDefault,\n      render      = options.render || renderDefault;\n\n  function container(state, startLine, endLine, silent) {\n    var pos, nextLine, marker_count, markup, params, token,\n        old_parent, old_line_max,\n        auto_closed = false,\n        start = state.bMarks[startLine] + state.tShift[startLine],\n        max = state.eMarks[startLine];\n\n    // Check out the first character quickly,\n    // this should filter out most of non-containers\n    //\n    if (marker_char !== state.src.charCodeAt(start)) { return false; }\n\n    // Check out the rest of the marker string\n    //\n    for (pos = start + 1; pos <= max; pos++) {\n      if (marker_str[(pos - start) % marker_len] !== state.src[pos]) {\n        break;\n      }\n    }\n\n    marker_count = Math.floor((pos - start) / marker_len);\n    if (marker_count < min_markers) { return false; }\n    pos -= (pos - start) % marker_len;\n\n    markup = state.src.slice(start, pos);\n    params = state.src.slice(pos, max);\n    if (!validate(params, markup)) { return false; }\n\n    // Since start is found, we can report success here in validation mode\n    //\n    if (silent) { return true; }\n\n    // Search for the end of the block\n    //\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      start = state.bMarks[nextLine] + state.tShift[nextLine];\n      max = state.eMarks[nextLine];\n\n      if (start < 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 (marker_char !== state.src.charCodeAt(start)) { 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      for (pos = start + 1; pos <= max; pos++) {\n        if (marker_str[(pos - start) % marker_len] !== state.src[pos]) {\n          break;\n        }\n      }\n\n      // closing code fence must be at least as long as the opening one\n      if (Math.floor((pos - start) / marker_len) < marker_count) { continue; }\n\n      // make sure tail has spaces only\n      pos -= (pos - start) % marker_len;\n      pos = state.skipSpaces(pos);\n\n      if (pos < max) { continue; }\n\n      // found!\n      auto_closed = true;\n      break;\n    }\n\n    old_parent = state.parentType;\n    old_line_max = state.lineMax;\n    state.parentType = 'container';\n\n    // this will prevent lazy continuations from ever going past our end marker\n    state.lineMax = nextLine;\n\n    token        = state.push('container_' + name + '_open', 'div', 1);\n    token.markup = markup;\n    token.block  = true;\n    token.info   = params;\n    token.map    = [ startLine, nextLine ];\n\n    state.md.block.tokenize(state, startLine + 1, nextLine);\n\n    token        = state.push('container_' + name + '_close', 'div', -1);\n    token.markup = state.src.slice(start, pos);\n    token.block  = true;\n\n    state.parentType = old_parent;\n    state.lineMax = old_line_max;\n    state.line = nextLine + (auto_closed ? 1 : 0);\n\n    return true;\n  }\n\n  md.block.ruler.before('fence', 'container_' + name, container, {\n    alt: [ 'paragraph', 'reference', 'blockquote', 'list' ]\n  });\n  md.renderer.rules['container_' + name + '_open'] = render;\n  md.renderer.rules['container_' + name + '_close'] = render;\n};\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  [ 'html_block', require('./rules_block/html_block'), [ 'paragraph', 'reference', 'blockquote' ] ],\n  [ 'heading',    require('./rules_block/heading'),    [ 'paragraph', 'reference', 'blockquote' ] ],\n  [ 'lheading',   require('./rules_block/lheading') ],\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","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"doc-wrapper\"},[_c('div',{staticClass:\"doc-container\"},[_c('left-menu',{attrs:{\"menuList\":_vm.menus,\"default-active\":_vm.activeIndex}}),(!_vm.isClient)?_c('div',{staticClass:\"doc-markdown\"},[_c('div',{staticClass:\"doc-markdown-container\"},[_c('p',{staticClass:\"markdown-body\",domProps:{\"innerHTML\":_vm._s(_vm.curMdSource)}}),_c('doc-rate')],1),_c('div',{staticClass:\"doc-submenu\"},[_c('sub-menu',{attrs:{\"menus\":_vm.subMenuArr}})],1)]):_c('div',{staticClass:\"iframe-wrapper\"},[_c('iframe',{staticClass:\"iframe-content\",attrs:{\"scrolling\":\"no\",\"frameborder\":\"0\",\"src\":_vm.officeDocUrl}})])],1)])}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\r\nimport { Component, Watch, Vue } from 'vue-property-decorator'\r\nimport leftMenu from './leftMenu.vue'\r\nimport subMenu from './subMenu.vue'\r\nimport pubDocConfig from '../docConfig.json'\r\n// 文档中台\r\nimport priMiddleDocMenu from '@/apps/open/views/fileCenter/PriMiddleDocMenu.json'\r\n// 云文档+文档中台文档\r\nimport priCombineDocMenu from '@/apps/open/views/fileCenter/PriCombineDocMenu.json'\r\n\r\nimport axios from 'axios'\r\nimport { DocMenu } from '@/apps/open/types/doc'\r\nimport DocRate from '../../fileCenter/components/DocRate.vue'\r\nimport 'static/css/markdown.css'\r\nimport { officeDocUrl } from '@/apps/open/constants'\r\nimport { scrollToTag } from '@/apps/open/utils/scroll'\r\n\r\nconst isPrivate: boolean = process.env.VUE_APP_IS_PRIVATE\r\n\r\nconst md = require('markdown-it')({\r\n  html: true,\r\n  linkify: true,\r\n  typographer: true\r\n}).use(require('markdown-it-container'), 'warning').use(require('markdown-it-container'), 'info').use(require('markdown-it-container'), 'danger').use(require('markdown-it-imsize')).use(require('markdown-it-ins')).use(require('markdown-it-mark')).use(require('markdown-it-plantuml')).use(require('markdown-it-mathjax')())\r\n\r\n@Component({\r\n  components: {\r\n    leftMenu,\r\n    subMenu,\r\n    DocRate\r\n  }\r\n})\r\nexport default class docContent extends Vue {\r\n  curMdSource: string = ''\r\n\r\n  subMenuArr: DocMenu[] = []\r\n\r\n  get isClient () {\r\n    return this.$route.name === 'wpsLoad'\r\n  }\r\n\r\n  get officeDocUrl () {\r\n    return officeDocUrl\r\n  }\r\n\r\n  get isPriDocMiddle () {\r\n    return this.$store.getters.isPriDocMiddle\r\n  }\r\n\r\n  get menus () {\r\n    let docConfig: any = pubDocConfig\r\n    if (isPrivate) {\r\n      if (this.isPriDocMiddle) {\r\n        docConfig = priMiddleDocMenu\r\n      } else {\r\n        docConfig = priCombineDocMenu\r\n      }\r\n    }\r\n    const firstMenu = docConfig.find((menu: any) => menu.router_name === this.$route.matched[1].name)\r\n    return firstMenu && firstMenu.children ? firstMenu.children : []\r\n  }\r\n\r\n  @Watch('$route')\r\n  async watchRoute () {\r\n    this.initData()\r\n    this.getMdFileSource()\r\n  }\r\n\r\n  get activeIndex () {\r\n    return this.$route.path\r\n  }\r\n\r\n  get currentSource () {\r\n    return `/mdfile${this.$route.meta.mdfilepath}`\r\n  }\r\n\r\n  mounted () {\r\n    this.getMdFileSource()\r\n  }\r\n\r\n  initData () {\r\n    this.subMenuArr = []\r\n  }\r\n\r\n  subMenuGenerator (source: string) {\r\n    source.replace(/<span[ ]*id=\"(\\S+)\"[ ]*>([ \\S]*)<\\/span>/gi, (_, p1, p2) => {\r\n      this.subMenuArr.push({\r\n        key: p1,\r\n        label: p2\r\n      })\r\n      return ''\r\n    })\r\n  }\r\n\r\n  async getMdFileSource () {\r\n    const res = await axios.get(`/mdfile${this.$route.meta.mdfilepath}`)\r\n    this.curMdSource = md.render(res.data)\r\n    // compatible with IE browser\r\n    if (navigator.userAgent.indexOf('Trident') > -1) {\r\n      md.renderer.rules.link_open = function myToken (tokens: any, idx: number, options: any, env: any, self: any) {\r\n        tokens[idx].attrPush(['target', '_blank'])\r\n        return self.renderToken(tokens, idx, options)\r\n      }\r\n    }\r\n\r\n    this.subMenuGenerator(this.curMdSource)\r\n  }\r\n}\r\n","import mod from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--14-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/ts-loader/index.js??ref--14-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./docBody.vue?vue&type=script&lang=ts&\"; export default mod; export * from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--14-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/ts-loader/index.js??ref--14-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./docBody.vue?vue&type=script&lang=ts&\"","import { render, staticRenderFns } from \"./docBody.vue?vue&type=template&id=6b1ad95e&scoped=true&\"\nimport script from \"./docBody.vue?vue&type=script&lang=ts&\"\nexport * from \"./docBody.vue?vue&type=script&lang=ts&\"\nimport style0 from \"./docBody.vue?vue&type=style&index=0&lang=css&\"\nimport style1 from \"./docBody.vue?vue&type=style&index=1&id=6b1ad95e&lang=scss&scoped=true&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n  script,\n  render,\n  staticRenderFns,\n  false,\n  null,\n  \"6b1ad95e\",\n  null\n  \n)\n\nexport default component.exports","/**\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      langAttrs = '',\n      highlighted, i, arr, tmpAttrs, tmpToken;\n\n  if (info) {\n    arr = info.split(/(\\s+)/g);\n    langName = arr[0];\n    langAttrs = arr.slice(2).join('');\n  }\n\n  if (options.highlight) {\n    highlighted = options.highlight(token.content, langName, langAttrs) || 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 .deepClone() 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] = tmpAttrs[i].slice();\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    } else if (tokens[i].type === 'softbreak') {\n      result += '\\n';\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","// 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 === 0x28 /* ( */ && marker === 0x29 /* ) */) {\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","// GFM table, https://github.github.com/gfm/#tables-extension-\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\n\nfunction getLine(state, line) {\n  var pos = state.bMarks[line] + state.tShift[line],\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      isEscaped = false,\n      lastPos = 0,\n      current = '';\n\n  ch  = str.charCodeAt(pos);\n\n  while (pos < max) {\n    if (ch === 0x7c/* | */) {\n      if (!isEscaped) {\n        // pipe separating cells, '|'\n        result.push(current + str.substring(lastPos, pos));\n        current = '';\n        lastPos = pos + 1;\n      } else {\n        // escaped pipe, '\\|'\n        current += str.substring(lastPos, pos - 1);\n        lastPos = pos;\n      }\n    }\n\n    isEscaped = (ch === 0x5c/* \\ */);\n    pos++;\n\n    ch = str.charCodeAt(pos);\n  }\n\n  result.push(current + str.substring(lastPos));\n\n  return result;\n}\n\n\nmodule.exports = function table(state, startLine, endLine, silent) {\n  var ch, lineText, pos, i, l, nextLine, columns, columnCount, token,\n      aligns, t, tableLines, tbodyLines, oldParentType, terminate,\n      terminatorRules, firstCh, secondCh;\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  firstCh = state.src.charCodeAt(pos++);\n  if (firstCh !== 0x7C/* | */ && firstCh !== 0x2D/* - */ && firstCh !== 0x3A/* : */) { return false; }\n\n  if (pos >= state.eMarks[nextLine]) { return false; }\n\n  secondCh = state.src.charCodeAt(pos++);\n  if (secondCh !== 0x7C/* | */ && secondCh !== 0x2D/* - */ && secondCh !== 0x3A/* : */ && !isSpace(secondCh)) {\n    return false;\n  }\n\n  // if first character is '-', then second character must not be a space\n  // (due to parsing ambiguity with list)\n  if (firstCh === 0x2D/* - */ && isSpace(secondCh)) { 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);\n  if (columns.length && columns[0] === '') columns.shift();\n  if (columns.length && columns[columns.length - 1] === '') columns.pop();\n\n  // header row will define an amount of columns in the entire table,\n  // and align row should be exactly the same (the rest of the rows can differ)\n  columnCount = columns.length;\n  if (columnCount === 0 || columnCount !== aligns.length) { return false; }\n\n  if (silent) { return true; }\n\n  oldParentType = state.parentType;\n  state.parentType = 'table';\n\n  // use 'blockquote' lists for termination because it's\n  // the most similar to tables\n  terminatorRules = state.md.block.ruler.getRules('blockquote');\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    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.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  for (nextLine = startLine + 2; nextLine < endLine; nextLine++) {\n    if (state.sCount[nextLine] < state.blkIndent) { break; }\n\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) { break; }\n    lineText = getLine(state, nextLine).trim();\n    if (!lineText) { break; }\n    if (state.sCount[nextLine] - state.blkIndent >= 4) { break; }\n    columns = escapedSplit(lineText);\n    if (columns.length && columns[0] === '') columns.shift();\n    if (columns.length && columns[columns.length - 1] === '') columns.pop();\n\n    if (nextLine === startLine + 2) {\n      token     = state.push('tbody_open', 'tbody', 1);\n      token.map = tbodyLines = [ startLine + 2, 0 ];\n    }\n\n    token     = state.push('tr_open', 'tr', 1);\n    token.map = [ nextLine, nextLine + 1 ];\n\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\n  if (tbodyLines) {\n    token = state.push('tbody_close', 'tbody', -1);\n    tbodyLines[1] = nextLine;\n  }\n\n  token = state.push('table_close', 'table', -1);\n  tableLines[1] = nextLine;\n\n  state.parentType = oldParentType;\n  state.line = nextLine;\n  return true;\n};\n","// Process ![test]( x =100x200)\n//                    ^^^^^^^^ this size specification\n\n'use strict';\n\nvar sizeOf = require('./imsize');\n\nvar parseImageSize = require('./helpers/parse_image_size');\n\nfunction image_with_size(md, options) {\n  return function(state, silent) {\n    var attrs,\n        code,\n        label,\n        labelEnd,\n        labelStart,\n        pos,\n        ref,\n        res,\n        title,\n        width = '',\n        height = '',\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 = 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      //\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 (code !== 0x20 && code !== 0x0A) { break; }\n      }\n      if (pos >= max) { return false; }\n\n      // [link](  <href>  \"title\"  )\n      //          ^^^^^^ parsing link destination\n      start = pos;\n      res = 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 (code !== 0x20 && code !== 0x0A) { break; }\n      }\n\n      // [link](  <href>  \"title\"  )\n      //                  ^^^^^^^ parsing link title\n      res = 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 (code !== 0x20 && code !== 0x0A) { break; }\n        }\n      } else {\n        title = '';\n      }\n\n      // [link](  <href>  \"title\" =WxH  )\n      //                          ^^^^ parsing image size\n      if (pos - 1 >= 0) {\n        code = state.src.charCodeAt(pos - 1);\n\n        // there must be at least one white spaces\n        // between previous field and the size\n        if (code === 0x20) {\n          res = parseImageSize(state.src, pos, state.posMax);\n          if (res.ok) {\n            width = res.width;\n            height = res.height;\n            pos = res.pos;\n\n            // [link](  <href>  \"title\" =WxH  )\n            //                              ^^ skipping these spaces\n            for (; pos < max; pos++) {\n              code = state.src.charCodeAt(pos);\n              if (code !== 0x20 && code !== 0x0A) { break; }\n            }\n          }\n        }\n      }\n\n      if (pos >= max || state.src.charCodeAt(pos) !== 0x29/* ) */) {\n        state.pos = oldPos;\n        return false;\n      }\n      pos++;\n\n    } else {\n      //\n      // Link reference\n      //\n      if (typeof state.env.references === 'undefined') { return false; }\n\n      // [foo]  [bar]\n      //      ^^ optional whitespace (can include newlines)\n      for (; pos < max; pos++) {\n        code = state.src.charCodeAt(pos);\n        if (code !== 0x20 && code !== 0x0A) { break; }\n      }\n\n      if (pos < max && state.src.charCodeAt(pos) === 0x5B/* [ */) {\n        start = pos + 1;\n        pos = 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[md.utils.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      var newState = new state.md.inline.State(\n        state.src.slice(labelStart, labelEnd),\n        state.md,\n        state.env,\n        tokens = []\n      );\n      newState.md.inline.tokenize(newState);\n\n      // if 'autofill' option is specified\n      // and width/height are both blank,\n      // they are filled automatically\n      if (options) {\n        if (options.autofill && width === '' && height === '') {\n          try {\n            var dimensions = sizeOf(href);\n            width = dimensions.width;\n            height = dimensions.height;\n          } catch (e) { }\n        }\n      }\n\n      token          = state.push('image', 'img', 0);\n      token.attrs    = attrs = [ [ 'src', href ],\n                                 [ 'alt', '' ] ];\n      token.children = tokens;\n      if (title) {\n        attrs.push([ 'title', title ]);\n      }\n\n      if (width !== '') {\n        attrs.push([ 'width', width ]);\n      }\n\n      if (height !== '') {\n        attrs.push([ 'height', height ]);\n      }\n    }\n\n    state.pos = pos;\n    state.posMax = max;\n    return true;\n  };\n}\n\nmodule.exports = function imsize_plugin(md, options) {\n  md.inline.ruler.before('emphasis', 'image', image_with_size(md, options));\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 (for example, if we are\n                       // inside a list, it would be positioned after list marker)\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  this.listIndent = -1; // indent of the current list 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--; // closing tag\n  token.level = this.level;\n  if (nesting > 0) this.level++; // opening tag\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","// For each opening emphasis-like marker find a matching closing one\n//\n'use strict';\n\n\nfunction processDelimiters(state, delimiters) {\n  var closerIdx, openerIdx, closer, opener, minOpenerIdx, newMinOpenerIdx,\n      isOddMatch, lastJump,\n      openersBottom = {},\n      max = delimiters.length;\n\n  for (closerIdx = 0; closerIdx < max; closerIdx++) {\n    closer = delimiters[closerIdx];\n\n    // Length is only used for emphasis-specific \"rule of 3\",\n    // if it's not defined (in strikethrough or 3rd party plugins),\n    // we can default it to 0 to disable those checks.\n    //\n    closer.length = closer.length || 0;\n\n    if (!closer.close) continue;\n\n    // Previously calculated lower bounds (previous fails)\n    // for each marker, each delimiter length modulo 3,\n    // and for whether this closer can be an opener;\n    // https://github.com/commonmark/cmark/commit/34250e12ccebdc6372b8b49c44fab57c72443460\n    if (!openersBottom.hasOwnProperty(closer.marker)) {\n      openersBottom[closer.marker] = [ -1, -1, -1, -1, -1, -1 ];\n    }\n\n    minOpenerIdx = openersBottom[closer.marker][(closer.open ? 3 : 0) + (closer.length % 3)];\n\n    openerIdx = closerIdx - closer.jump - 1;\n\n    // avoid crash if `closer.jump` is pointing outside of the array, see #742\n    if (openerIdx < -1) openerIdx = -1;\n\n    newMinOpenerIdx = openerIdx;\n\n    for (; openerIdx > minOpenerIdx; openerIdx -= opener.jump + 1) {\n      opener = delimiters[openerIdx];\n\n      if (opener.marker !== closer.marker) continue;\n\n      if (opener.open && opener.end < 0) {\n\n        isOddMatch = false;\n\n        // from spec:\n        //\n        // If one of the delimiters can both open and close emphasis, then the\n        // sum of the lengths of the delimiter runs containing the opening and\n        // closing delimiters must not be a multiple of 3 unless both lengths\n        // are multiples of 3.\n        //\n        if (opener.close || closer.open) {\n          if ((opener.length + closer.length) % 3 === 0) {\n            if (opener.length % 3 !== 0 || closer.length % 3 !== 0) {\n              isOddMatch = true;\n            }\n          }\n        }\n\n        if (!isOddMatch) {\n          // If previous delimiter cannot be an opener, we can safely skip\n          // the entire sequence in future checks. This is required to make\n          // sure algorithm has linear complexity (see *_*_*_*_*_... case).\n          //\n          lastJump = openerIdx > 0 && !delimiters[openerIdx - 1].open ?\n            delimiters[openerIdx - 1].jump + 1 :\n            0;\n\n          closer.jump  = closerIdx - openerIdx + lastJump;\n          closer.open  = false;\n          opener.end   = closerIdx;\n          opener.jump  = lastJump;\n          opener.close = false;\n          newMinOpenerIdx = -1;\n          break;\n        }\n      }\n    }\n\n    if (newMinOpenerIdx !== -1) {\n      // If match for this delimiter run failed, we want to set lower bound for\n      // future lookups. This is required to make sure algorithm has linear\n      // complexity.\n      //\n      // See details here:\n      // https://github.com/commonmark/cmark/issues/178#issuecomment-270417442\n      //\n      openersBottom[closer.marker][(closer.open ? 3 : 0) + ((closer.length || 0) % 3)] = newMinOpenerIdx;\n    }\n  }\n}\n\n\nmodule.exports = function link_pairs(state) {\n  var curr,\n      tokens_meta = state.tokens_meta,\n      max = state.tokens_meta.length;\n\n  processDelimiters(state, state.delimiters);\n\n  for (curr = 0; curr < max; curr++) {\n    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n      processDelimiters(state, tokens_meta[curr].delimiters);\n    }\n  }\n};\n","'use strict';\n\nvar fs   = require('fs');\nvar path = require('path');\n\nvar detector = require('./detector');\nvar handlers = {};\nvar types = require('./types');\n\ntypes.forEach(function(type) {\n  handlers[type] = require('./types/' + type);\n});\n\nvar MaxBufferSize = 128 * 1024;\n\nfunction lookup(buffer, filepath) {\n  var type = detector(buffer, filepath);\n\n  if (type in handlers) {\n    var size = handlers[type].calculate(buffer, filepath);\n    if (size !== false) {\n      size.type = type;\n      return size;\n    }\n  }\n\n  throw new TypeError('Unsupported file type');\n}\n\nfunction asyncFileToBuffer(filepath, callback) {\n  fs.open(filepath, 'r', function(err0, descriptor) {\n    if (err0) {\n      return callback(err0);\n    }\n\n    var size = fs.fstatSync(descriptor).size;\n    var bufferSize = Math.min(size, MaxBufferSize);\n    var buffer = new Buffer(bufferSize);\n    fs.read(descriptor, buffer, 0, bufferSize, 0, function(err1) {\n      if (err1) {\n        return callback(err1);\n      }\n\n      fs.close(descriptor, function(err2) {\n        callback(err2, buffer);\n      });\n    });\n  });\n}\n\nfunction syncFileToBuffer(filepath) {\n  var descriptor = fs.openSync(filepath, 'r');\n  var size = fs.fstatSync(descriptor).size;\n  var bufferSize = Math.min(size, MaxBufferSize);\n  var buffer = new Buffer(bufferSize);\n  fs.readSync(descriptor, buffer, 0, bufferSize, 0);\n  fs.closeSync(descriptor);\n  return buffer;\n}\n\n/**\n * Returns the dimensions of the image file\n * @param[in] input: input image path\n * @param[in] callback(option): if specified, gets size async.\n */\nmodule.exports = function(input, callback) {\n  if (typeof input !== 'string') {\n    throw new TypeError('Input must be file name');\n  }\n\n  var filepath = path.resolve(input);\n\n  if (typeof callback === 'function') {\n    asyncFileToBuffer(filepath, function(err, buffer) {\n      if (err) {\n        return callback(err);\n      }\n\n      var dimensions;\n      try {\n        dimensions = lookup(buffer, filepath);\n      } catch (e) {\n        err = e;\n      }\n      callback(err, dimensions);\n    });\n  } else {\n    var buffer = syncFileToBuffer(filepath);\n    return lookup(buffer, filepath);\n  }\n};\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","require('../../modules/es6.object.keys');\nmodule.exports = require('../../modules/_core').Object.keys;\n","import mod from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./leftMenu.vue?vue&type=style&index=0&id=9e1623a2&lang=scss&scoped=true&\"; export default mod; export * from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./leftMenu.vue?vue&type=style&index=0&id=9e1623a2&lang=scss&scoped=true&\"","// ~~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      length: 0,     // disable \"rule of 3\" length checks meant for emphasis\n      jump:   i / 2, // for `~~` 1 marker = 2 characters\n      token:  state.tokens.length - 1,\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\nfunction postProcess(state, delimiters) {\n  var i, j,\n      startDelim,\n      endDelim,\n      token,\n      loneMarkers = [],\n      max = 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\n\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function strikethrough(state) {\n  var curr,\n      tokens_meta = state.tokens_meta,\n      max = state.tokens_meta.length;\n\n  postProcess(state, state.delimiters);\n\n  for (curr = 0; curr < max; curr++) {\n    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n      postProcess(state, tokens_meta[curr].delimiters);\n    }\n  }\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","// 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","// 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, false) + '\\n';\n  token.map     = [ startLine, state.line ];\n\n  return true;\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","module.exports = require(\"core-js/library/fn/object/keys\");","/** 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","'use strict';\n\nmodule.exports = [\n  'bmp',\n  'gif',\n  'jpg',\n  'png',\n  'tiff',\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].content) continue; // should skip all tokens except 'text', 'html_inline' or 'code_inline'\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].content) continue; // should skip all tokens except 'text', 'html_inline' or 'code_inline'\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        // Replace quotes in the middle of punctuation sequence, but not\n        // in the middle of the words, i.e.:\n        //\n        // 1. foo \" bar \" baz - not replaced\n        // 2. foo-\"-bar-\"-baz - replaced\n        // 3. foo\"bar\"baz     - not replaced\n        //\n        canOpen = isLastPunctChar;\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","'use strict';\n\nvar svgReg = /<svg[^>]+[^>]*>/;\nfunction isSVG (buffer) {\n  return svgReg.test(buffer);\n}\n\nvar extractorRegExps = {\n  'root': /<svg [^>]+>/,\n  'width': /(^|\\s)width\\s*=\\s*\"(.+?)\"/i,\n  'height': /(^|\\s)height\\s*=\\s*\"(.+?)\"/i,\n  'viewbox': /(^|\\s)viewbox\\s*=\\s*\"(.+?)\"/i\n};\n\nfunction getRatio (viewbox) {\n  var ratio = 1;\n  if (viewbox && viewbox[2]) {\n    var dim = viewbox[2].split(/\\s/g);\n    if (dim.length === 4) {\n      dim = dim.map(function (i) {\n        return parseInt(i, 10);\n      });\n      ratio = (dim[2] - dim[0]) / (dim[3] - dim[1]);\n    }\n  }\n  return ratio;\n}\n\nfunction parse (buffer) {\n  var body = buffer.toString().replace(/[\\r\\n\\s]+/g, ' ');\n  var section = body.match(extractorRegExps.root);\n  var root = section && section[0];\n  if (root) {\n    var width = root.match(extractorRegExps.width);\n    var height = root.match(extractorRegExps.height);\n    var viewbox = root.match(extractorRegExps.viewbox);\n    var ratio = getRatio(viewbox);\n    return {\n      'width': parseInt(width && width[2], 10) || 0,\n      'height': parseInt(height && height[2], 10) || 0,\n      'ratio': ratio\n    };\n  }\n}\n\nfunction calculate (buffer) {\n\n  var parsed = parse(buffer);\n  var width = parsed.width;\n  var height = parsed.height;\n  var ratio = parsed.ratio;\n\n  if (width && height) {\n    return { 'width': width, 'height': height };\n  } else {\n    if (width) {\n      return { 'width': width, 'height': Math.floor(width / ratio) };\n    } else if (height) {\n      return { 'width': Math.floor(height * ratio), 'height': height };\n    } else {\n      throw new TypeError('invalid svg');\n    }\n  }\n}\n\nmodule.exports = {\n  'detect': isSVG,\n  'calculate': calculate\n};\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,}[a-zA-Z0-9%/&]|' + // google has many dots in \"google search\" links (#66, #81).\n                                     // github has ... in commit range links,\n                                     // Restrict to\n                                     // - english\n                                     // - percent-encoded\n                                     // - parts of file path\n                                     // - params separator\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 + ').|' +       // allow `;` if not followed by space-like char\n          '\\\\!+(?!' + re.src_ZCc + '|[!]).|' +  // allow `!!!` in paths, but not at the end\n          '\\\\?(?!' + re.src_ZCc + '|[?]).' +\n        ')+' +\n      '|\\\\/' +\n    ')?';\n\n  // Allow anything in markdown spec, forbid quote (\") at the first position\n  // because emails enclosed in quotes are far more common\n  re.src_email_name =\n\n    '[\\\\-;:&=\\\\+\\\\$,\\\\.a-zA-Z0-9_][\\\\-;:&=\\\\+\\\\$,\\\\\"\\\\.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      '(?:' + 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 + ')' +\n      '(' + 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","// 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","// Simple typographic 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')\n          // en-dash\n          .replace(/(^|\\s)--(?=\\s|$)/mg, '$1\\u2013')\n          .replace(/(^|[^-\\s])--(?=[^-\\s]|$)/mg, '$1\\u2013');\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","// HTML5 entities map: { name -> utf16string }\n//\n'use strict';\n\n/*eslint quotes:0*/\nmodule.exports = require('entities/lib/maps/entities.json');\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 (marker === 0x60 /* ` */) {\n    if (params.indexOf(String.fromCharCode(marker)) >= 0) {\n      return false;\n    }\n  }\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","module.exports = __webpack_public_path__ + \"img/right-icon.f83b989a.svg\";","// 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","'use strict';\n\nvar gifRegexp = /^GIF8[7,9]a/;\nfunction isGIF (buffer) {\n  var signature = buffer.toString('ascii', 0, 6);\n  return (gifRegexp.test(signature));\n}\n\nfunction calculate(buffer) {\n  return {\n    'width': buffer.readUInt16LE(6),\n    'height': buffer.readUInt16LE(8)\n  };\n}\n\nmodule.exports = {\n  'detect': isGIF,\n  'calculate': calculate\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      // 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\nfunction postProcess(state, delimiters) {\n  var i,\n      startDelim,\n      endDelim,\n      token,\n      ch,\n      isStrong,\n      max = 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\n\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function emphasis(state) {\n  var curr,\n      tokens_meta = state.tokens_meta,\n      max = state.tokens_meta.length;\n\n  postProcess(state, state.delimiters);\n\n  for (curr = 0; curr < max; curr++) {\n    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n      postProcess(state, tokens_meta[curr].delimiters);\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      token,\n      href = '',\n      title = '',\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      // [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      }\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","var map = {\n\t\"./bmp\": \"0dcc\",\n\t\"./bmp.js\": \"0dcc\",\n\t\"./gif\": \"c416\",\n\t\"./gif.js\": \"c416\",\n\t\"./jpg\": \"135b\",\n\t\"./jpg.js\": \"135b\",\n\t\"./png\": \"e9ef\",\n\t\"./png.js\": \"e9ef\",\n\t\"./psd\": \"520c\",\n\t\"./psd.js\": \"520c\",\n\t\"./svg\": \"b0bf\",\n\t\"./svg.js\": \"b0bf\",\n\t\"./tiff\": \"f270\",\n\t\"./tiff.js\": \"f270\",\n\t\"./webp\": \"cf1e3\",\n\t\"./webp.js\": \"cf1e3\"\n};\n\n\nfunction webpackContext(req) {\n\tvar id = webpackContextResolve(req);\n\treturn __webpack_require__(id);\n}\nfunction webpackContextResolve(req) {\n\tvar id = map[req];\n\tif(!(id + 1)) { // check for number or string\n\t\tvar e = new Error(\"Cannot find module '\" + req + \"'\");\n\t\te.code = 'MODULE_NOT_FOUND';\n\t\tthrow e;\n\t}\n\treturn id;\n}\nwebpackContext.keys = function webpackContextKeys() {\n\treturn Object.keys(map);\n};\nwebpackContext.resolve = webpackContextResolve;\nmodule.exports = webpackContext;\nwebpackContext.id = \"cd50\";","'use strict';\n\n// based on https://developers.google.com/speed/webp/docs/riff_container\n\nfunction isWebP (buffer) {\n  var riffHeader = 'RIFF' === buffer.toString('ascii', 0, 4);\n  var webpHeader = 'WEBP' === buffer.toString('ascii', 8, 12);\n  var vp8Header  = 'VP8'  === buffer.toString('ascii', 12, 15);\n  return (riffHeader && webpHeader && vp8Header);\n}\n\nfunction calculate (buffer) {\n\n  var chunkHeader = buffer.toString('ascii', 12, 16);\n  buffer = buffer.slice(20, 30);\n\n  // Lossless webp stream signature\n  if (chunkHeader === 'VP8 ' && buffer[0] !== 0x2f) {\n    return calculateLossy(buffer);\n  }\n\n  // Lossy webp stream signature\n  var signature = buffer.toString('hex', 3, 6);\n  if (chunkHeader === 'VP8L' && signature !== '9d012a') {\n    return calculateLossless(buffer);\n  }\n\n  return false;\n}\n\nfunction calculateLossless (buffer) {\n  return {\n    'width': 1 + (((buffer[2] & 0x3F) << 8) | buffer[1]),\n    'height': 1 + (((buffer[4] & 0xF) << 10) | (buffer[3] << 2) |\n                  ((buffer[2] & 0xC0) >> 6))\n  };\n}\n\nfunction calculateLossy (buffer) {\n  // `& 0x3fff` returns the last 14 bits\n  // TO-DO: include webp scaling in the calculations\n  return {\n    'width': buffer.readInt16LE(6) & 0x3fff,\n    'height': buffer.readInt16LE(8) & 0x3fff\n  };\n}\n\nmodule.exports = {\n  'detect': isWebP,\n  'calculate': calculate\n};\n","'use strict';\n\n\nmodule.exports = function ins_plugin(md) {\n  // Insert each marker as a separate text token, and add it to delimiter list\n  //\n  function tokenize(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 !== 0x2B/* + */) { 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      if (!scanned.can_open && !scanned.can_close) { continue; }\n\n      state.delimiters.push({\n        marker: marker,\n        length: 0,     // disable \"rule of 3\" length checks meant for emphasis\n        jump:   i / 2, // 1 delimiter = 2 characters\n        token:  state.tokens.length - 1,\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  //\n  function postProcess(state, delimiters) {\n    var i, j,\n        startDelim,\n        endDelim,\n        token,\n        loneMarkers = [],\n        max = delimiters.length;\n\n    for (i = 0; i < max; i++) {\n      startDelim = delimiters[i];\n\n      if (startDelim.marker !== 0x2B/* + */) {\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    = 'ins_open';\n      token.tag     = 'ins';\n      token.nesting = 1;\n      token.markup  = '++';\n      token.content = '';\n\n      token         = state.tokens[endDelim.token];\n      token.type    = 'ins_close';\n      token.tag     = 'ins';\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 === 'ins_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\n  md.inline.ruler.before('emphasis', 'ins', tokenize);\n  md.inline.ruler2.before('emphasis', 'ins', function (state) {\n    var curr,\n        tokens_meta = state.tokens_meta,\n        max = (state.tokens_meta || []).length;\n\n    postProcess(state, state.delimiters);\n\n    for (curr = 0; curr < max; curr++) {\n      if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n        postProcess(state, tokens_meta[curr].delimiters);\n      }\n    }\n  });\n};\n","'use strict';\n\n\nmodule.exports = require('./lib/');\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","// 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","// .dirname, .basename, and .extname methods are extracted from Node.js v8.11.1,\n// backported and transplited with Babel, with backwards-compat fixes\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// 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// 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  if (typeof path !== 'string') path = path + '';\n  if (path.length === 0) return '.';\n  var code = path.charCodeAt(0);\n  var hasRoot = code === 47 /*/*/;\n  var end = -1;\n  var matchedSlash = true;\n  for (var i = path.length - 1; i >= 1; --i) {\n    code = path.charCodeAt(i);\n    if (code === 47 /*/*/) {\n        if (!matchedSlash) {\n          end = i;\n          break;\n        }\n      } else {\n      // We saw the first non-path separator\n      matchedSlash = false;\n    }\n  }\n\n  if (end === -1) return hasRoot ? '/' : '.';\n  if (hasRoot && end === 1) {\n    // return '//';\n    // Backwards-compat fix:\n    return '/';\n  }\n  return path.slice(0, end);\n};\n\nfunction basename(path) {\n  if (typeof path !== 'string') path = path + '';\n\n  var start = 0;\n  var end = -1;\n  var matchedSlash = true;\n  var i;\n\n  for (i = path.length - 1; i >= 0; --i) {\n    if (path.charCodeAt(i) === 47 /*/*/) {\n        // If we reached a path separator that was not part of a set of path\n        // separators at the end of the string, stop now\n        if (!matchedSlash) {\n          start = i + 1;\n          break;\n        }\n      } else if (end === -1) {\n      // We saw the first non-path separator, mark this as the end of our\n      // path component\n      matchedSlash = false;\n      end = i + 1;\n    }\n  }\n\n  if (end === -1) return '';\n  return path.slice(start, end);\n}\n\n// Uses a mixed approach for backwards-compatibility, as ext behavior changed\n// in new Node.js versions, so only basename() above is backported here\nexports.basename = function (path, ext) {\n  var f = basename(path);\n  if (ext && f.substr(-1 * ext.length) === ext) {\n    f = f.substr(0, f.length - ext.length);\n  }\n  return f;\n};\n\nexports.extname = function (path) {\n  if (typeof path !== 'string') path = path + '';\n  var startDot = -1;\n  var startPart = 0;\n  var end = -1;\n  var matchedSlash = true;\n  // Track the state of characters (if any) we see before our first dot and\n  // after any path separator we find\n  var preDotState = 0;\n  for (var i = path.length - 1; i >= 0; --i) {\n    var code = path.charCodeAt(i);\n    if (code === 47 /*/*/) {\n        // If we reached a path separator that was not part of a set of path\n        // separators at the end of the string, stop now\n        if (!matchedSlash) {\n          startPart = i + 1;\n          break;\n        }\n        continue;\n      }\n    if (end === -1) {\n      // We saw the first non-path separator, mark this as the end of our\n      // extension\n      matchedSlash = false;\n      end = i + 1;\n    }\n    if (code === 46 /*.*/) {\n        // If this is our first dot, mark it as the start of our extension\n        if (startDot === -1)\n          startDot = i;\n        else if (preDotState !== 1)\n          preDotState = 1;\n    } else if (startDot !== -1) {\n      // We saw a non-dot and non-path separator before our dot, so we should\n      // have a good chance at having a non-empty extension\n      preDotState = -1;\n    }\n  }\n\n  if (startDot === -1 || end === -1 ||\n      // We saw a non-dot character immediately before the dot\n      preDotState === 0 ||\n      // The (right-most) trimmed path component is exactly '..'\n      preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n    return '';\n  }\n  return path.slice(startDot, end);\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","// 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  '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","// Using this library so that our img links are compatible with plantUml website.\n// TODO: replace this library with zlib once we create our private uml server.\n\n'use strict';\n\n// Added to original:\nmodule.exports = {\n  zip_deflate: zip_deflate,\n  encode64: encode64\n};\n\n// Original[some parts modified to avoid errors]:\n\n/* Copyright (C) 1999 Masanao Izumo <iz@onicos.co.jp>\n * Version: 1.0.1\n * LastModified: Dec 25 1999\n */\n\n/* Interface:\n * data = zip_deflate(src);\n */\n\n/* constant parameters */\nvar zip_WSIZE = 32768;\t\t// Sliding Window size\nvar zip_STORED_BLOCK = 0;\nvar zip_STATIC_TREES = 1;\nvar zip_DYN_TREES    = 2;\n\n/* for deflate */\nvar zip_DEFAULT_LEVEL = 6;\nvar zip_FULL_SEARCH = true;\nvar zip_INBUFSIZ = 32768;\t// Input buffer size\nvar zip_INBUF_EXTRA = 64;\t// Extra buffer\nvar zip_OUTBUFSIZ = 1024 * 8;\nvar zip_window_size = 2 * zip_WSIZE;\nvar zip_MIN_MATCH = 3;\nvar zip_MAX_MATCH = 258;\nvar zip_BITS = 16;\n// for SMALL_MEM\nvar zip_LIT_BUFSIZE = 0x2000;\nvar zip_HASH_BITS = 13;\n// for MEDIUM_MEM\n// var zip_LIT_BUFSIZE = 0x4000;\n// var zip_HASH_BITS = 14;\n// for BIG_MEM\n// var zip_LIT_BUFSIZE = 0x8000;\n// var zip_HASH_BITS = 15;\n// if (zip_LIT_BUFSIZE > zip_INBUFSIZ) { alert('error: zip_INBUFSIZ is too small'); }\n// if ((zip_WSIZE << 1) > (1 << zip_BITS)) { alert('error: zip_WSIZE is too large'); }\n// if (zip_HASH_BITS > zip_BITS - 1) { alert('error: zip_HASH_BITS is too large'); }\n// if (zip_HASH_BITS < 8 || zip_MAX_MATCH != 258) { alert('error: Code too clever'); }\nvar zip_DIST_BUFSIZE = zip_LIT_BUFSIZE;\nvar zip_HASH_SIZE = 1 << zip_HASH_BITS;\nvar zip_HASH_MASK = zip_HASH_SIZE - 1;\nvar zip_WMASK = zip_WSIZE - 1;\nvar zip_NIL = 0; // Tail of hash chains\nvar zip_TOO_FAR = 4096;\nvar zip_MIN_LOOKAHEAD = zip_MAX_MATCH + zip_MIN_MATCH + 1;\nvar zip_MAX_DIST = zip_WSIZE - zip_MIN_LOOKAHEAD;\nvar zip_SMALLEST = 1;\nvar zip_MAX_BITS = 15;\nvar zip_MAX_BL_BITS = 7;\nvar zip_LENGTH_CODES = 29;\nvar zip_LITERALS = 256;\nvar zip_END_BLOCK = 256;\nvar zip_L_CODES = zip_LITERALS + 1 + zip_LENGTH_CODES;\nvar zip_D_CODES = 30;\nvar zip_BL_CODES = 19;\nvar zip_REP_3_6 = 16;\nvar zip_REPZ_3_10 = 17;\nvar zip_REPZ_11_138 = 18;\nvar zip_HEAP_SIZE = 2 * zip_L_CODES + 1;\nvar zip_H_SHIFT = parseInt((zip_HASH_BITS + zip_MIN_MATCH - 1) /\n  zip_MIN_MATCH);\n\n/* variables */\nvar zip_free_queue;\nvar zip_qhead, zip_qtail;\nvar zip_initflag;\nvar zip_outbuf = null;\nvar zip_outcnt, zip_outoff;\nvar zip_complete;\nvar zip_window;\nvar zip_d_buf;\nvar zip_l_buf;\nvar zip_prev;\nvar zip_bi_buf;\nvar zip_bi_valid;\nvar zip_block_start;\nvar zip_ins_h;\nvar zip_hash_head;\nvar zip_prev_match;\nvar zip_match_available;\nvar zip_match_length;\nvar zip_prev_length;\nvar zip_strstart;\nvar zip_match_start;\nvar zip_eofile;\nvar zip_lookahead;\nvar zip_max_chain_length;\nvar zip_max_lazy_match;\nvar zip_compr_level;\nvar zip_good_match;\nvar zip_nice_match;\nvar zip_dyn_ltree;\nvar zip_dyn_dtree;\nvar zip_static_ltree;\nvar zip_static_dtree;\nvar zip_bl_tree;\nvar zip_l_desc;\nvar zip_d_desc;\nvar zip_bl_desc;\nvar zip_bl_count;\nvar zip_heap;\nvar zip_heap_len;\nvar zip_heap_max;\nvar zip_depth;\nvar zip_length_code;\nvar zip_dist_code;\nvar zip_base_length;\nvar zip_base_dist;\nvar zip_flag_buf;\nvar zip_last_lit;\nvar zip_last_dist;\nvar zip_last_flags;\nvar zip_flags;\nvar zip_flag_bit;\nvar zip_opt_len;\nvar zip_static_len;\nvar zip_deflate_data;\nvar zip_deflate_pos;\n\n/* constant tables */\nvar zip_extra_lbits = new Array(\n  0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0);\nvar zip_extra_dbits = new Array(\n  0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13);\nvar zip_extra_blbits = new Array(\n  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7);\nvar zip_bl_order = new Array(\n  16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15);\nvar zip_configuration_table = new Array(\n  new zip_DeflateConfiguration(0,    0,   0,    0),\n  new zip_DeflateConfiguration(4,    4,   8,    4),\n  new zip_DeflateConfiguration(4,    5,  16,    8),\n  new zip_DeflateConfiguration(4,    6,  32,   32),\n  new zip_DeflateConfiguration(4,    4,  16,   16),\n  new zip_DeflateConfiguration(8,   16,  32,   32),\n  new zip_DeflateConfiguration(8,   16, 128,  128),\n  new zip_DeflateConfiguration(8,   32, 128,  256),\n  new zip_DeflateConfiguration(32, 128, 258, 1024),\n  new zip_DeflateConfiguration(32, 258, 258, 4096));\n\n/* objects (deflate) */\n\nfunction zip_DeflateCT() {\n  this.fc = 0; // frequency count or bit string\n  this.dl = 0; // father node in Huffman tree or length of bit string\n}\n\nfunction zip_DeflateTreeDesc() {\n  this.dyn_tree = null;\t// the dynamic tree\n  this.static_tree = null;\t// corresponding static tree or NULL\n  this.extra_bits = null;\t// extra bits for each code or NULL\n  this.extra_base = 0;\t// base index for extra_bits\n  this.elems = 0;\t\t// max number of elements in the tree\n  this.max_length = 0;\t// max bit length for the codes\n  this.max_code = 0;\t\t// largest code with non zero frequency\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction zip_DeflateConfiguration(a, b, c, d) {\n  this.good_length = a; // reduce lazy search above this match length\n  this.max_lazy = b;    // do not perform lazy search above this match length\n  this.nice_length = c; // quit search above this match length\n  this.max_chain = d;\n}\n\nfunction zip_DeflateBuffer() {\n  this.next = null;\n  this.len = 0;\n  this.ptr = new Array(zip_OUTBUFSIZ);\n  this.off = 0;\n}\n\n/* routines (deflate) */\n\nfunction zip_deflate_start(level) {\n  var i;\n\n  if (!level) { level = zip_DEFAULT_LEVEL; } else if (level < 1) { level = 1; } else if (level > 9) { level = 9; }\n\n  zip_compr_level = level;\n  zip_initflag = false;\n  zip_eofile = false;\n  if (zip_outbuf != null) { return; }\n\n  zip_free_queue = zip_qhead = zip_qtail = null;\n  zip_outbuf = new Array(zip_OUTBUFSIZ);\n  zip_window = new Array(zip_window_size);\n  zip_d_buf = new Array(zip_DIST_BUFSIZE);\n  zip_l_buf = new Array(zip_INBUFSIZ + zip_INBUF_EXTRA);\n  zip_prev = new Array(1 << zip_BITS);\n  zip_dyn_ltree = new Array(zip_HEAP_SIZE);\n  for (i = 0; i < zip_HEAP_SIZE; i++) { zip_dyn_ltree[i] = new zip_DeflateCT(); }\n  zip_dyn_dtree = new Array(2 * zip_D_CODES + 1);\n  for (i = 0; i < 2 * zip_D_CODES + 1; i++) { zip_dyn_dtree[i] = new zip_DeflateCT(); }\n  zip_static_ltree = new Array(zip_L_CODES + 2);\n  for (i = 0; i < zip_L_CODES + 2; i++) { zip_static_ltree[i] = new zip_DeflateCT(); }\n  zip_static_dtree = new Array(zip_D_CODES);\n  for (i = 0; i < zip_D_CODES; i++) { zip_static_dtree[i] = new zip_DeflateCT(); }\n  zip_bl_tree = new Array(2 * zip_BL_CODES + 1);\n  for (i = 0; i < 2 * zip_BL_CODES + 1; i++) { zip_bl_tree[i] = new zip_DeflateCT(); }\n  zip_l_desc = new zip_DeflateTreeDesc();\n  zip_d_desc = new zip_DeflateTreeDesc();\n  zip_bl_desc = new zip_DeflateTreeDesc();\n  zip_bl_count = new Array(zip_MAX_BITS + 1);\n  zip_heap = new Array(2 * zip_L_CODES + 1);\n  zip_depth = new Array(2 * zip_L_CODES + 1);\n  zip_length_code = new Array(zip_MAX_MATCH - zip_MIN_MATCH + 1);\n  zip_dist_code = new Array(512);\n  zip_base_length = new Array(zip_LENGTH_CODES);\n  zip_base_dist = new Array(zip_D_CODES);\n  zip_flag_buf = new Array(parseInt(zip_LIT_BUFSIZE / 8));\n}\n\nfunction zip_deflate_end() {\n  zip_free_queue = zip_qhead = zip_qtail = null;\n  zip_outbuf = null;\n  zip_window = null;\n  zip_d_buf = null;\n  zip_l_buf = null;\n  zip_prev = null;\n  zip_dyn_ltree = null;\n  zip_dyn_dtree = null;\n  zip_static_ltree = null;\n  zip_static_dtree = null;\n  zip_bl_tree = null;\n  zip_l_desc = null;\n  zip_d_desc = null;\n  zip_bl_desc = null;\n  zip_bl_count = null;\n  zip_heap = null;\n  zip_depth = null;\n  zip_length_code = null;\n  zip_dist_code = null;\n  zip_base_length = null;\n  zip_base_dist = null;\n  zip_flag_buf = null;\n}\n\nfunction zip_reuse_queue(p) {\n  p.next = zip_free_queue;\n  zip_free_queue = p;\n}\n\nfunction zip_new_queue() {\n  var p;\n\n  if (zip_free_queue != null) {\n    p = zip_free_queue;\n    zip_free_queue = zip_free_queue.next;\n  } else { p = new zip_DeflateBuffer(); }\n  p.next = null;\n  p.len = p.off = 0;\n\n  return p;\n}\n\nfunction zip_head1(i) {\n  return zip_prev[zip_WSIZE + i];\n}\n\nfunction zip_head2(i, val) {\n  return zip_prev[zip_WSIZE + i] = val;\n}\n\n/* put_byte is used for the compressed output, put_ubyte for the\n * uncompressed output. However unlzw() uses window for its\n * suffix table instead of its output buffer, so it does not use put_ubyte\n * (to be cleaned up).\n */\nfunction zip_put_byte(c) {\n  zip_outbuf[zip_outoff + zip_outcnt++] = c;\n  if (zip_outoff + zip_outcnt == zip_OUTBUFSIZ) { zip_qoutbuf(); }\n}\n\n/* Output a 16 bit value, lsb first */\nfunction zip_put_short(w) {\n  w &= 0xffff;\n  if (zip_outoff + zip_outcnt < zip_OUTBUFSIZ - 2) {\n    zip_outbuf[zip_outoff + zip_outcnt++] = (w & 0xff);\n    zip_outbuf[zip_outoff + zip_outcnt++] = (w >>> 8);\n  } else {\n    zip_put_byte(w & 0xff);\n    zip_put_byte(w >>> 8);\n  }\n}\n\n/* ==========================================================================\n * Insert string s in the dictionary and set match_head to the previous head\n * of the hash chain (the most recent string with same hash key). Return\n * the previous length of the hash chain.\n * IN  assertion: all calls to to INSERT_STRING are made with consecutive\n *    input characters and the first MIN_MATCH bytes of s are valid\n *    (except for the last MIN_MATCH-1 bytes of the input file).\n */\nfunction zip_INSERT_STRING() {\n  zip_ins_h = ((zip_ins_h << zip_H_SHIFT)\n    ^ (zip_window[zip_strstart + zip_MIN_MATCH - 1] & 0xff))\n    & zip_HASH_MASK;\n  zip_hash_head = zip_head1(zip_ins_h);\n  zip_prev[zip_strstart & zip_WMASK] = zip_hash_head;\n  zip_head2(zip_ins_h, zip_strstart);\n}\n\n/* Send a code of the given tree. c and tree must not have side effects */\nfunction zip_SEND_CODE(c, tree) {\n  zip_send_bits(tree[c].fc, tree[c].dl);\n}\n\n/* Mapping from a distance to a distance code. dist is the distance - 1 and\n * must not have side effects. dist_code[256] and dist_code[257] are never\n * used.\n */\nfunction zip_D_CODE(dist) {\n  return (dist < 256 ? zip_dist_code[dist]\n    : zip_dist_code[256 + (dist >> 7)]) & 0xff;\n}\n\n/* ==========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction zip_SMALLER(tree, n, m) {\n  return tree[n].fc < tree[m].fc ||\n    (tree[n].fc == tree[m].fc && zip_depth[n] <= zip_depth[m]);\n}\n\n/* ==========================================================================\n * read string data\n */\nfunction zip_read_buff(buff, offset, n) {\n  var i;\n  for (i = 0; i < n && zip_deflate_pos < zip_deflate_data.length; i++) {\n    buff[offset + i] =\n      zip_deflate_data.charCodeAt(zip_deflate_pos++) & 0xff;\n  }\n  return i;\n}\n\n/* ==========================================================================\n * Initialize the \"longest match\" routines for a new file\n */\nfunction zip_lm_init() {\n  var j;\n\n  /* Initialize the hash table. */\n  for (j = 0; j < zip_HASH_SIZE; j++)\n  //\tzip_head2(j, zip_NIL);\n  { zip_prev[zip_WSIZE + j] = 0; }\n  /* prev will be initialized on the fly */\n\n  /* Set the default configuration parameters:\n  */\n  zip_max_lazy_match = zip_configuration_table[zip_compr_level].max_lazy;\n  zip_good_match     = zip_configuration_table[zip_compr_level].good_length;\n  if (!zip_FULL_SEARCH) { zip_nice_match = zip_configuration_table[zip_compr_level].nice_length; }\n  zip_max_chain_length = zip_configuration_table[zip_compr_level].max_chain;\n\n  zip_strstart = 0;\n  zip_block_start = 0;\n\n  zip_lookahead = zip_read_buff(zip_window, 0, 2 * zip_WSIZE);\n  if (zip_lookahead <= 0) {\n    zip_eofile = true;\n    zip_lookahead = 0;\n    return;\n  }\n  zip_eofile = false;\n  /* Make sure that we always have enough lookahead. This is important\n   * if input comes from a device such as a tty.\n   */\n  while (zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) { zip_fill_window(); }\n\n  /* If lookahead < MIN_MATCH, ins_h is garbage, but this is\n   * not important since only literal bytes will be emitted.\n   */\n  zip_ins_h = 0;\n  for (j = 0; j < zip_MIN_MATCH - 1; j++) {\n    //      UPDATE_HASH(ins_h, window[j]);\n    zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[j] & 0xff)) & zip_HASH_MASK;\n  }\n}\n\n/* ==========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n */\nfunction zip_longest_match(cur_match) {\n  var chain_length = zip_max_chain_length; // max hash chain length\n  var scanp = zip_strstart; // current string\n  var matchp;\t\t// matched string\n  var len;\t\t// length of current match\n  var best_len = zip_prev_length;\t// best match length so far\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n  var limit = (zip_strstart > zip_MAX_DIST ? zip_strstart - zip_MAX_DIST : zip_NIL);\n\n  var strendp = zip_strstart + zip_MAX_MATCH;\n  var scan_end1 = zip_window[scanp + best_len - 1];\n  var scan_end  = zip_window[scanp + best_len];\n\n  /* Do not waste too much time if we already have a good match: */\n  if (zip_prev_length >= zip_good_match) { chain_length >>= 2; }\n\n  //  Assert(encoder->strstart <= window_size-MIN_LOOKAHEAD, \"insufficient lookahead\");\n\n  do {\n    //    Assert(cur_match < encoder->strstart, \"no future\");\n    matchp = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2:\n     */\n    if (zip_window[matchp + best_len]\t!= scan_end  ||\n      zip_window[matchp + best_len - 1]\t!= scan_end1 ||\n      zip_window[matchp]\t\t\t!= zip_window[scanp] ||\n      zip_window[++matchp]\t\t\t!= zip_window[scanp + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scanp += 2;\n    matchp++;\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n    } while (zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      zip_window[++scanp] == zip_window[++matchp] &&\n      scanp < strendp);\n\n    len = zip_MAX_MATCH - (strendp - scanp);\n    scanp = strendp - zip_MAX_MATCH;\n\n    if (len > best_len) {\n      zip_match_start = cur_match;\n      best_len = len;\n      if (zip_FULL_SEARCH) {\n        if (len >= zip_MAX_MATCH) break;\n      } else if (len >= zip_nice_match) break;\n\n      scan_end1  = zip_window[scanp + best_len - 1];\n      scan_end   = zip_window[scanp + best_len];\n    }\n  } while ((cur_match = zip_prev[cur_match & zip_WMASK]) > limit\n    && --chain_length != 0);\n\n  return best_len;\n}\n\n/* ==========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead, and sets eofile if end of input file.\n * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0\n * OUT assertions: at least one byte has been read, or eofile is set;\n *    file reads are performed for at least two bytes (required for the\n *    translate_eol option).\n */\nfunction zip_fill_window() {\n  var n, m;\n\n  // Amount of free space at the end of the window.\n  var more = zip_window_size - zip_lookahead - zip_strstart;\n\n  /* If the window is almost full and there is insufficient lookahead,\n   * move the upper half to the lower one to make room in the upper half.\n   */\n  if (more == -1) {\n    /* Very unlikely, but possible on 16 bit machine if strstart == 0\n     * and lookahead == 1 (input done one byte at time)\n     */\n    more--;\n  } else if (zip_strstart >= zip_WSIZE + zip_MAX_DIST) {\n    /* By the IN assertion, the window is not empty so we can't confuse\n     * more == 0 with more == 64K on a 16 bit machine.\n     */\n    //\tAssert(window_size == (ulg)2*WSIZE, \"no sliding with BIG_MEM\");\n\n    //\tSystem.arraycopy(window, WSIZE, window, 0, WSIZE);\n    for (n = 0; n < zip_WSIZE; n++) { zip_window[n] = zip_window[n + zip_WSIZE]; }\n\n    zip_match_start -= zip_WSIZE;\n    zip_strstart    -= zip_WSIZE; /* we now have strstart >= MAX_DIST: */\n    zip_block_start -= zip_WSIZE;\n\n    for (n = 0; n < zip_HASH_SIZE; n++) {\n      m = zip_head1(n);\n      zip_head2(n, m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL);\n    }\n    for (n = 0; n < zip_WSIZE; n++) {\n      /* If n is not on any hash chain, prev[n] is garbage but\n       * its value will never be used.\n       */\n      m = zip_prev[n];\n      zip_prev[n] = (m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL);\n    }\n    more += zip_WSIZE;\n  }\n  // At this point, more >= 2\n  if (!zip_eofile) {\n    n = zip_read_buff(zip_window, zip_strstart + zip_lookahead, more);\n    if (n <= 0) { zip_eofile = true; } else { zip_lookahead += n; }\n  }\n}\n\n/* ==========================================================================\n * Processes a new input file and return its compressed length. This\n * function does not perform lazy evaluationof matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction zip_deflate_fast() {\n  while (zip_lookahead != 0 && zip_qhead == null) {\n    var flush; // set if current block must be flushed\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    zip_INSERT_STRING();\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (zip_hash_head != zip_NIL &&\n      zip_strstart - zip_hash_head <= zip_MAX_DIST) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      zip_match_length = zip_longest_match(zip_hash_head);\n      /* longest_match() sets match_start */\n      if (zip_match_length > zip_lookahead) { zip_match_length = zip_lookahead; }\n    }\n    if (zip_match_length >= zip_MIN_MATCH) {\n      //\t    check_match(strstart, match_start, match_length);\n\n      flush = zip_ct_tally(zip_strstart - zip_match_start,\n        zip_match_length - zip_MIN_MATCH);\n      zip_lookahead -= zip_match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (zip_match_length <= zip_max_lazy_match) {\n        zip_match_length--; // string at strstart already in hash table\n        do {\n          zip_strstart++;\n          zip_INSERT_STRING();\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\n           * these bytes are garbage, but it does not matter since\n           * the next lookahead bytes will be emitted as literals.\n           */\n        } while (--zip_match_length != 0);\n        zip_strstart++;\n      } else {\n        zip_strstart += zip_match_length;\n        zip_match_length = 0;\n        zip_ins_h = zip_window[zip_strstart] & 0xff;\n        //\t\tUPDATE_HASH(ins_h, window[strstart + 1]);\n        zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[zip_strstart + 1] & 0xff)) & zip_HASH_MASK;\n\n        //#if MIN_MATCH != 3\n        //\t\tCall UPDATE_HASH() MIN_MATCH-3 more times\n        //#endif\n\n      }\n    } else {\n      /* No match, output a literal byte */\n      flush = zip_ct_tally(0, zip_window[zip_strstart] & 0xff);\n      zip_lookahead--;\n      zip_strstart++;\n    }\n    if (flush) {\n      zip_flush_block(0);\n      zip_block_start = zip_strstart;\n    }\n\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    while (zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) { zip_fill_window(); }\n  }\n}\n\nfunction zip_deflate_better() {\n  /* Process the input block. */\n  while (zip_lookahead != 0 && zip_qhead == null) {\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    zip_INSERT_STRING();\n\n    /* Find the longest match, discarding those <= prev_length.\n    */\n    zip_prev_length = zip_match_length;\n    zip_prev_match = zip_match_start;\n    zip_match_length = zip_MIN_MATCH - 1;\n\n    if (zip_hash_head != zip_NIL &&\n      zip_prev_length < zip_max_lazy_match &&\n      zip_strstart - zip_hash_head <= zip_MAX_DIST) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      zip_match_length = zip_longest_match(zip_hash_head);\n      /* longest_match() sets match_start */\n      if (zip_match_length > zip_lookahead) { zip_match_length = zip_lookahead; }\n\n      /* Ignore a length 3 match if it is too distant: */\n      if (zip_match_length == zip_MIN_MATCH &&\n        zip_strstart - zip_match_start > zip_TOO_FAR) {\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        zip_match_length--;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (zip_prev_length >= zip_MIN_MATCH &&\n      zip_match_length <= zip_prev_length) {\n      var flush; // set if current block must be flushed\n\n      //\t    check_match(strstart - 1, prev_match, prev_length);\n      flush = zip_ct_tally(zip_strstart - 1 - zip_prev_match,\n        zip_prev_length - zip_MIN_MATCH);\n\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted.\n       */\n      zip_lookahead -= zip_prev_length - 1;\n      zip_prev_length -= 2;\n      do {\n        zip_strstart++;\n        zip_INSERT_STRING();\n        /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n         * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH\n         * these bytes are garbage, but it does not matter since the\n         * next lookahead bytes will always be emitted as literals.\n         */\n      } while (--zip_prev_length != 0);\n      zip_match_available = 0;\n      zip_match_length = zip_MIN_MATCH - 1;\n      zip_strstart++;\n      if (flush) {\n        zip_flush_block(0);\n        zip_block_start = zip_strstart;\n      }\n    } else if (zip_match_available != 0) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      if (zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff)) {\n        zip_flush_block(0);\n        zip_block_start = zip_strstart;\n      }\n      zip_strstart++;\n      zip_lookahead--;\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      zip_match_available = 1;\n      zip_strstart++;\n      zip_lookahead--;\n    }\n\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    while (zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) { zip_fill_window(); }\n  }\n}\n\nfunction zip_init_deflate() {\n  if (zip_eofile) { return; }\n  zip_bi_buf = 0;\n  zip_bi_valid = 0;\n  zip_ct_init();\n  zip_lm_init();\n\n  zip_qhead = null;\n  zip_outcnt = 0;\n  zip_outoff = 0;\n\n  if (zip_compr_level <= 3) {\n    zip_prev_length = zip_MIN_MATCH - 1;\n    zip_match_length = 0;\n  } else {\n    zip_match_length = zip_MIN_MATCH - 1;\n    zip_match_available = 0;\n  }\n\n  zip_complete = false;\n}\n\n/* ==========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction zip_deflate_internal(buff, off, buff_size) {\n  var n;\n\n  if (!zip_initflag) {\n    zip_init_deflate();\n    zip_initflag = true;\n    if (zip_lookahead == 0) { // empty\n      zip_complete = true;\n      return 0;\n    }\n  }\n\n  if ((n = zip_qcopy(buff, off, buff_size)) == buff_size) { return buff_size; }\n\n  if (zip_complete) { return n; }\n\n  if (zip_compr_level <= 3) // optimized for speed\n  { zip_deflate_fast(); } else { zip_deflate_better(); }\n  if (zip_lookahead == 0) {\n    if (zip_match_available != 0) { zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff); }\n    zip_flush_block(1);\n    zip_complete = true;\n  }\n  return n + zip_qcopy(buff, n + off, buff_size - n);\n}\n\nfunction zip_qcopy(buff, off, buff_size) {\n  var n, i, j;\n\n  n = 0;\n  while (zip_qhead != null && n < buff_size) {\n    i = buff_size - n;\n    if (i > zip_qhead.len) { i = zip_qhead.len; }\n    //      System.arraycopy(qhead.ptr, qhead.off, buff, off + n, i);\n    for (j = 0; j < i; j++) { buff[off + n + j] = zip_qhead.ptr[zip_qhead.off + j]; }\n\n    zip_qhead.off += i;\n    zip_qhead.len -= i;\n    n += i;\n    if (zip_qhead.len == 0) {\n      var p;\n      p = zip_qhead;\n      zip_qhead = zip_qhead.next;\n      zip_reuse_queue(p);\n    }\n  }\n\n  if (n == buff_size) { return n; }\n\n  if (zip_outoff < zip_outcnt) {\n    i = buff_size - n;\n    if (i > zip_outcnt - zip_outoff) { i = zip_outcnt - zip_outoff; }\n    // System.arraycopy(outbuf, outoff, buff, off + n, i);\n    for (j = 0; j < i; j++) { buff[off + n + j] = zip_outbuf[zip_outoff + j]; }\n    zip_outoff += i;\n    n += i;\n    if (zip_outcnt == zip_outoff) { zip_outcnt = zip_outoff = 0; }\n  }\n  return n;\n}\n\n/* ==========================================================================\n * Allocate the match buffer, initialize the various tables and save the\n * location of the internal file attribute (ascii/binary) and method\n * (DEFLATE/STORE).\n */\nfunction zip_ct_init() {\n  var n;\t// iterates over tree elements\n  var bits;\t// bit counter\n  var length;\t// length value\n  var code;\t// code value\n  var dist;\t// distance index\n\n  if (zip_static_dtree[0].dl != 0) return; // ct_init already called\n\n  zip_l_desc.dyn_tree\t\t= zip_dyn_ltree;\n  zip_l_desc.static_tree\t= zip_static_ltree;\n  zip_l_desc.extra_bits\t= zip_extra_lbits;\n  zip_l_desc.extra_base\t= zip_LITERALS + 1;\n  zip_l_desc.elems\t\t= zip_L_CODES;\n  zip_l_desc.max_length\t= zip_MAX_BITS;\n  zip_l_desc.max_code\t\t= 0;\n\n  zip_d_desc.dyn_tree\t\t= zip_dyn_dtree;\n  zip_d_desc.static_tree\t= zip_static_dtree;\n  zip_d_desc.extra_bits\t= zip_extra_dbits;\n  zip_d_desc.extra_base\t= 0;\n  zip_d_desc.elems\t\t= zip_D_CODES;\n  zip_d_desc.max_length\t= zip_MAX_BITS;\n  zip_d_desc.max_code\t\t= 0;\n\n  zip_bl_desc.dyn_tree\t= zip_bl_tree;\n  zip_bl_desc.static_tree\t= null;\n  zip_bl_desc.extra_bits\t= zip_extra_blbits;\n  zip_bl_desc.extra_base\t= 0;\n  zip_bl_desc.elems\t\t= zip_BL_CODES;\n  zip_bl_desc.max_length\t= zip_MAX_BL_BITS;\n  zip_bl_desc.max_code\t= 0;\n\n  // Initialize the mapping length (0..255) -> length code (0..28)\n  length = 0;\n  for (code = 0; code < zip_LENGTH_CODES - 1; code++) {\n    zip_base_length[code] = length;\n    for (n = 0; n < (1 << zip_extra_lbits[code]); n++) { zip_length_code[length++] = code; }\n  }\n  // Assert (length == 256, \"ct_init: length != 256\");\n\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  zip_length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    zip_base_dist[code] = dist;\n    for (n = 0; n < (1 << zip_extra_dbits[code]); n++) {\n      zip_dist_code[dist++] = code;\n    }\n  }\n  // Assert (dist == 256, \"ct_init: dist != 256\");\n  dist >>= 7; // from now on, all distances are divided by 128\n  for (; code < zip_D_CODES; code++) {\n    zip_base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (zip_extra_dbits[code] - 7)); n++) { zip_dist_code[256 + dist++] = code; }\n  }\n  // Assert (dist == 256, \"ct_init: 256+dist != 512\");\n\n  // Construct the codes of the static literal tree\n  for (bits = 0; bits <= zip_MAX_BITS; bits++) { zip_bl_count[bits] = 0; }\n  n = 0;\n  while (n <= 143) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; }\n  while (n <= 255) { zip_static_ltree[n++].dl = 9; zip_bl_count[9]++; }\n  while (n <= 279) { zip_static_ltree[n++].dl = 7; zip_bl_count[7]++; }\n  while (n <= 287) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  zip_gen_codes(zip_static_ltree, zip_L_CODES + 1);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < zip_D_CODES; n++) {\n    zip_static_dtree[n].dl = 5;\n    zip_static_dtree[n].fc = zip_bi_reverse(n, 5);\n  }\n\n  // Initialize the first block of the first file:\n  zip_init_block();\n}\n\n/* ==========================================================================\n * Initialize a new block.\n */\nfunction zip_init_block() {\n  var n; // iterates over tree elements\n\n  // Initialize the trees.\n  for (n = 0; n < zip_L_CODES;  n++) zip_dyn_ltree[n].fc = 0;\n  for (n = 0; n < zip_D_CODES;  n++) zip_dyn_dtree[n].fc = 0;\n  for (n = 0; n < zip_BL_CODES; n++) zip_bl_tree[n].fc = 0;\n\n  zip_dyn_ltree[zip_END_BLOCK].fc = 1;\n  zip_opt_len = zip_static_len = 0;\n  zip_last_lit = zip_last_dist = zip_last_flags = 0;\n  zip_flags = 0;\n  zip_flag_bit = 1;\n}\n\n/* ==========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction zip_pqdownheap(\n  tree,\t// the tree to restore\n  k) {\t// node to move down\n  var v = zip_heap[k];\n  var j = k << 1;\t// left son of k\n\n  while (j <= zip_heap_len) {\n    // Set j to the smallest of the two sons:\n    if (j < zip_heap_len &&\n      zip_SMALLER(tree, zip_heap[j + 1], zip_heap[j])) { j++; }\n\n    // Exit if v is smaller than both sons\n    if (zip_SMALLER(tree, v, zip_heap[j])) { break; }\n\n    // Exchange v with the smallest son\n    zip_heap[k] = zip_heap[j];\n    k = j;\n\n    // And continue down the tree, setting j to the left son of k\n    j <<= 1;\n  }\n  zip_heap[k] = v;\n}\n\n/* ==========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nfunction zip_gen_bitlen(desc) { // the tree descriptor\n  var tree\t\t= desc.dyn_tree;\n  var extra\t\t= desc.extra_bits;\n  var base\t\t= desc.extra_base;\n  var max_code\t= desc.max_code;\n  var max_length\t= desc.max_length;\n  var stree\t\t= desc.static_tree;\n  var h;\t\t// heap index\n  var n, m;\t\t// iterate over the tree elements\n  var bits;\t\t// bit length\n  var xbits;\t\t// extra bits\n  var f;\t\t// frequency\n  var overflow = 0;\t// number of elements with bit length too large\n\n  for (bits = 0; bits <= zip_MAX_BITS; bits++) { zip_bl_count[bits] = 0; }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[zip_heap[zip_heap_max]].dl = 0; // root of the heap\n\n  for (h = zip_heap_max + 1; h < zip_HEAP_SIZE; h++) {\n    n = zip_heap[h];\n    bits = tree[tree[n].dl].dl + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n].dl = bits;\n    // We overwrite tree[n].dl which is no longer needed\n\n    if (n > max_code) { continue; } // not a leaf node\n\n    zip_bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) { xbits = extra[n - base]; }\n    f = tree[n].fc;\n    zip_opt_len += f * (bits + xbits);\n    if (stree != null) { zip_static_len += f * (stree[n].dl + xbits); }\n  }\n  if (overflow == 0) { return; }\n\n  // This happens for example on obj2 and pic of the Calgary corpus\n\n  // Find the first bit length which could increase:\n  do {\n    bits = max_length - 1;\n    while (zip_bl_count[bits] == 0) { bits--; }\n    zip_bl_count[bits]--;\t\t// move one leaf down the tree\n    zip_bl_count[bits + 1] += 2;\t// move one overflow item as its brother\n    zip_bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits != 0; bits--) {\n    n = zip_bl_count[bits];\n    while (n != 0) {\n      m = zip_heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m].dl != bits) {\n        zip_opt_len += (bits - tree[m].dl) * tree[m].fc;\n        tree[m].fc = bits;\n      }\n      n--;\n    }\n  }\n}\n\n/* ==========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nfunction zip_gen_codes(tree,\t// the tree to decorate\n  max_code) {\t// largest code with non zero frequency\n  var next_code = new Array(zip_MAX_BITS + 1); // next code value for each bit length\n  var code = 0;\t\t// running code value\n  var bits;\t\t\t// bit index\n  var n;\t\t\t// code index\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= zip_MAX_BITS; bits++) {\n    code = ((code + zip_bl_count[bits - 1]) << 1);\n    next_code[bits] = code;\n  }\n\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //    Assert (code + encoder->bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //\t    \"inconsistent bit counts\");\n  //    Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0; n <= max_code; n++) {\n    var len = tree[n].dl;\n    if (len == 0) { continue; }\n    // Now reverse the bits\n    tree[n].fc = zip_bi_reverse(next_code[len]++, len);\n\n    //      Tracec(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //\t  n, (isgraph(n) ? n : ' '), len, tree[n].fc, next_code[len]-1));\n  }\n}\n\n/* ==========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nfunction zip_build_tree(desc) { // the tree descriptor\n  var tree\t= desc.dyn_tree;\n  var stree\t= desc.static_tree;\n  var elems\t= desc.elems;\n  var n, m;\t\t// iterate over heap elements\n  var max_code = -1;\t// largest code with non zero frequency\n  var node = elems;\t// next internal node of the tree\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  zip_heap_len = 0;\n  zip_heap_max = zip_HEAP_SIZE;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n].fc != 0) {\n      zip_heap[++zip_heap_len] = max_code = n;\n      zip_depth[n] = 0;\n    } else { tree[n].dl = 0; }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (zip_heap_len < 2) {\n    var xnew = zip_heap[++zip_heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[xnew].fc = 1;\n    zip_depth[xnew] = 0;\n    zip_opt_len--;\n    if (stree != null) { zip_static_len -= stree[xnew].dl; }\n    // new is 0 or 1 so it does not have extra bits\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = zip_heap_len >> 1; n >= 1; n--) { zip_pqdownheap(tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  do {\n    n = zip_heap[zip_SMALLEST];\n    zip_heap[zip_SMALLEST] = zip_heap[zip_heap_len--];\n    zip_pqdownheap(tree, zip_SMALLEST);\n\n    m = zip_heap[zip_SMALLEST];  // m = node of next least frequency\n\n    // keep the nodes sorted by frequency\n    zip_heap[--zip_heap_max] = n;\n    zip_heap[--zip_heap_max] = m;\n\n    // Create a new node father of n and m\n    tree[node].fc = tree[n].fc + tree[m].fc;\n    //\tdepth[node] = (char)(MAX(depth[n], depth[m]) + 1);\n    if (zip_depth[n] > zip_depth[m] + 1) { zip_depth[node] = zip_depth[n]; } else { zip_depth[node] = zip_depth[m] + 1; }\n    tree[n].dl = tree[m].dl = node;\n\n    // and insert the new node in the heap\n    zip_heap[zip_SMALLEST] = node++;\n    zip_pqdownheap(tree, zip_SMALLEST);\n\n  } while (zip_heap_len >= 2);\n\n  zip_heap[--zip_heap_max] = zip_heap[zip_SMALLEST];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  zip_gen_bitlen(desc);\n\n  // The field len is now set, we can generate the bit codes\n  zip_gen_codes(tree, max_code);\n}\n\n/* ==========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree. Updates opt_len to take into account the repeat\n * counts. (The contribution of the bit length codes will be added later\n * during the construction of bl_tree.)\n */\nfunction zip_scan_tree(tree, // the tree to be scanned\n  max_code) {  // and its largest code of non zero frequency\n  var n;\t\t\t// iterates over all tree elements\n  var prevlen = -1;\t\t// last emitted length\n  var curlen;\t\t\t// length of current code\n  var nextlen = tree[0].dl;\t// length of next code\n  var count = 0;\t\t// repeat count of the current code\n  var max_count = 7;\t\t// max repeat count\n  var min_count = 4;\t\t// min repeat count\n\n  if (nextlen == 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[max_code + 1].dl = 0xffff; // guard\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[n + 1].dl;\n    if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { zip_bl_tree[curlen].fc += count; } else if (curlen != 0) {\n      if (curlen != prevlen) { zip_bl_tree[curlen].fc++; }\n      zip_bl_tree[zip_REP_3_6].fc++;\n    } else if (count <= 10) { zip_bl_tree[zip_REPZ_3_10].fc++; } else { zip_bl_tree[zip_REPZ_11_138].fc++; }\n    count = 0; prevlen = curlen;\n    if (nextlen == 0) {\n      max_count = 138;\n      min_count = 3;\n    } else if (curlen == nextlen) {\n      max_count = 6;\n      min_count = 3;\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n}\n\n/* ==========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction zip_send_tree(tree, // the tree to be scanned\n  max_code) { // and its largest code of non zero frequency\n  var n;\t\t\t// iterates over all tree elements\n  var prevlen = -1;\t\t// last emitted length\n  var curlen;\t\t\t// length of current code\n  var nextlen = tree[0].dl;\t// length of next code\n  var count = 0;\t\t// repeat count of the current code\n  var max_count = 7;\t\t// max repeat count\n  var min_count = 4;\t\t// min repeat count\n\n  /* tree[max_code+1].dl = -1; */  /* guard already set */\n  if (nextlen == 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[n + 1].dl;\n    if (++count < max_count && curlen == nextlen) {\n      continue;\n    } else if (count < min_count) {\n      do { zip_SEND_CODE(curlen, zip_bl_tree); } while (--count != 0);\n    } else if (curlen != 0) {\n      if (curlen != prevlen) {\n        zip_SEND_CODE(curlen, zip_bl_tree);\n        count--;\n      }\n      // Assert(count >= 3 && count <= 6, \" 3_6?\");\n      zip_SEND_CODE(zip_REP_3_6, zip_bl_tree);\n      zip_send_bits(count - 3, 2);\n    } else if (count <= 10) {\n      zip_SEND_CODE(zip_REPZ_3_10, zip_bl_tree);\n      zip_send_bits(count - 3, 3);\n    } else {\n      zip_SEND_CODE(zip_REPZ_11_138, zip_bl_tree);\n      zip_send_bits(count - 11, 7);\n    }\n    count = 0;\n    prevlen = curlen;\n    if (nextlen == 0) {\n      max_count = 138;\n      min_count = 3;\n    } else if (curlen == nextlen) {\n      max_count = 6;\n      min_count = 3;\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n}\n\n/* ==========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction zip_build_bl_tree() {\n  var max_blindex;  // index of last bit length code of non zero freq\n\n  // Determine the bit length frequencies for literal and distance trees\n  zip_scan_tree(zip_dyn_ltree, zip_l_desc.max_code);\n  zip_scan_tree(zip_dyn_dtree, zip_d_desc.max_code);\n\n  // Build the bit length tree:\n  zip_build_tree(zip_bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = zip_BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n    if (zip_bl_tree[zip_bl_order[max_blindex]].dl != 0) break;\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  zip_opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //    Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //\t    encoder->opt_len, encoder->static_len));\n\n  return max_blindex;\n}\n\n/* ==========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction zip_send_all_trees(lcodes, dcodes, blcodes) { // number of codes for each tree\n  var rank; // index in bl_order\n\n  //    Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //    Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //\t    \"too many codes\");\n  //    Tracev((stderr, \"\\nbl counts: \"));\n  zip_send_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt\n  zip_send_bits(dcodes - 1,   5);\n  zip_send_bits(blcodes - 4,  4); // not -3 as stated in appnote.txt\n  for (rank = 0; rank < blcodes; rank++) {\n    //      Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    zip_send_bits(zip_bl_tree[zip_bl_order[rank]].dl, 3);\n  }\n\n  // send the literal tree\n  zip_send_tree(zip_dyn_ltree, lcodes - 1);\n\n  // send the distance tree\n  zip_send_tree(zip_dyn_dtree, dcodes - 1);\n}\n\n/* ==========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction zip_flush_block(eof) { // true if this is the last block for a file\n  var opt_lenb, static_lenb; // opt_len and static_len in bytes\n  var max_blindex;\t// index of last bit length code of non zero freq\n  var stored_len;\t// length of input block\n\n  stored_len = zip_strstart - zip_block_start;\n  zip_flag_buf[zip_last_flags] = zip_flags; // Save the flags for the last 8 items\n\n  // Construct the literal and distance trees\n  zip_build_tree(zip_l_desc);\n  //    Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\",\n  //\t    encoder->opt_len, encoder->static_len));\n\n  zip_build_tree(zip_d_desc);\n  //    Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\",\n  //\t    encoder->opt_len, encoder->static_len));\n  /* At this point, opt_len and static_len are the total bit lengths of\n   * the compressed block data, excluding the tree representations.\n   */\n\n  /* Build the bit length tree for the above two trees, and get the index\n   * in bl_order of the last bit length code to send.\n   */\n  max_blindex = zip_build_bl_tree();\n\n  // Determine the best encoding. Compute first the block length in bytes\n  opt_lenb\t= (zip_opt_len   + 3 + 7) >> 3;\n  static_lenb = (zip_static_len + 3 + 7) >> 3;\n\n  //    Trace((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \",\n  //\t   opt_lenb, encoder->opt_len,\n  //\t   static_lenb, encoder->static_len, stored_len,\n  //\t   encoder->last_lit, encoder->last_dist));\n\n  if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n  if (stored_len + 4 <= opt_lenb // 4: two words for the lengths\n    && zip_block_start >= 0) {\n    var i;\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    zip_send_bits((zip_STORED_BLOCK << 1) + eof, 3);  /* send block type */\n    zip_bi_windup();\t\t /* align on byte boundary */\n    zip_put_short(stored_len);\n    zip_put_short(~stored_len);\n\n    // copy block\n    /*\n      p = &window[block_start];\n      for(i = 0; i < stored_len; i++)\n  put_byte(p[i]);\n  */\n    for (i = 0; i < stored_len; i++) { zip_put_byte(zip_window[zip_block_start + i]); }\n\n  } else if (static_lenb == opt_lenb) {\n    zip_send_bits((zip_STATIC_TREES << 1) + eof, 3);\n    zip_compress_block(zip_static_ltree, zip_static_dtree);\n  } else {\n    zip_send_bits((zip_DYN_TREES << 1) + eof, 3);\n    zip_send_all_trees(zip_l_desc.max_code + 1,\n      zip_d_desc.max_code + 1,\n      max_blindex + 1);\n    zip_compress_block(zip_dyn_ltree, zip_dyn_dtree);\n  }\n\n  zip_init_block();\n\n  if (eof != 0) { zip_bi_windup(); }\n}\n\n/* ==========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction zip_ct_tally(\n  dist, // distance of matched string\n  lc) { // match length-MIN_MATCH or unmatched char (if dist==0)\n  zip_l_buf[zip_last_lit++] = lc;\n  if (dist == 0) {\n    // lc is the unmatched char\n    zip_dyn_ltree[lc].fc++;\n  } else {\n    // Here, lc is the match length - MIN_MATCH\n    dist--;\t\t    // dist = match distance - 1\n    //      Assert((ush)dist < (ush)MAX_DIST &&\n    //\t     (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //\t     (ush)D_CODE(dist) < (ush)D_CODES,  \"ct_tally: bad match\");\n\n    zip_dyn_ltree[zip_length_code[lc] + zip_LITERALS + 1].fc++;\n    zip_dyn_dtree[zip_D_CODE(dist)].fc++;\n\n    zip_d_buf[zip_last_dist++] = dist;\n    zip_flags |= zip_flag_bit;\n  }\n  zip_flag_bit <<= 1;\n\n  // Output the flags if they fill a byte\n  if ((zip_last_lit & 7) == 0) {\n    zip_flag_buf[zip_last_flags++] = zip_flags;\n    zip_flags = 0;\n    zip_flag_bit = 1;\n  }\n  // Try to guess if it is profitable to stop the current block here\n  if (zip_compr_level > 2 && (zip_last_lit & 0xfff) == 0) {\n    // Compute an upper bound for the compressed length\n    var out_length = zip_last_lit * 8;\n    var in_length = zip_strstart - zip_block_start;\n    var dcode;\n\n    for (dcode = 0; dcode < zip_D_CODES; dcode++) {\n      out_length += zip_dyn_dtree[dcode].fc * (5 + zip_extra_dbits[dcode]);\n    }\n    out_length >>= 3;\n    //      Trace((stderr,\"\\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) \",\n    //\t     encoder->last_lit, encoder->last_dist, in_length, out_length,\n    //\t     100L - out_length*100L/in_length));\n    if (zip_last_dist < parseInt(zip_last_lit / 2) &&\n      out_length < parseInt(in_length / 2)) { return true; }\n  }\n  return (zip_last_lit == zip_LIT_BUFSIZE - 1 ||\n    zip_last_dist == zip_DIST_BUFSIZE);\n  /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n}\n\n/* ==========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction zip_compress_block(\n  ltree,\t// literal tree\n  dtree) {\t// distance tree\n  var dist;\t\t// distance of matched string\n  var lc;\t\t// match length or unmatched char (if dist == 0)\n  var lx = 0;\t\t// running index in l_buf\n  var dx = 0;\t\t// running index in d_buf\n  var fx = 0;\t\t// running index in flag_buf\n  var flag = 0;\t// current flags\n  var code;\t\t// the code to send\n  var extra;\t\t// number of extra bits to send\n\n  if (zip_last_lit != 0) {\n    do {\n      if ((lx & 7) == 0) { flag = zip_flag_buf[fx++]; }\n      lc = zip_l_buf[lx++] & 0xff;\n      if ((flag & 1) == 0) {\n        zip_SEND_CODE(lc, ltree); /* send a literal byte */\n      //\tTracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n      // Here, lc is the match length - MIN_MATCH\n        code = zip_length_code[lc];\n        zip_SEND_CODE(code + zip_LITERALS + 1, ltree); // send the length code\n        extra = zip_extra_lbits[code];\n        if (extra != 0) {\n          lc -= zip_base_length[code];\n          zip_send_bits(lc, extra); // send the extra length bits\n        }\n        dist = zip_d_buf[dx++];\n        // Here, dist is the match distance - 1\n        code = zip_D_CODE(dist);\n        //\tAssert (code < D_CODES, \"bad d_code\");\n\n        zip_SEND_CODE(code, dtree);\t  // send the distance code\n        extra = zip_extra_dbits[code];\n        if (extra != 0) {\n          dist -= zip_base_dist[code];\n          zip_send_bits(dist, extra);   // send the extra distance bits\n        }\n      } // literal or match pair ?\n      flag >>= 1;\n    } while (lx < zip_last_lit);\n  }\n\n  zip_SEND_CODE(zip_END_BLOCK, ltree);\n}\n\n/* ==========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nvar zip_Buf_size = 16; // bit size of bi_buf\nfunction zip_send_bits(\n  value,\t// value to send\n  length) {\t// number of bits\n  /* If not enough room in bi_buf, use (valid) bits from bi_buf and\n   * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))\n   * unused bits in value.\n   */\n  if (zip_bi_valid > zip_Buf_size - length) {\n    zip_bi_buf |= (value << zip_bi_valid);\n    zip_put_short(zip_bi_buf);\n    zip_bi_buf = (value >> (zip_Buf_size - zip_bi_valid));\n    zip_bi_valid += length - zip_Buf_size;\n  } else {\n    zip_bi_buf |= value << zip_bi_valid;\n    zip_bi_valid += length;\n  }\n}\n\n/* ==========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction zip_bi_reverse(\n  code,\t// the value to invert\n  len) {\t// its bit length\n  var res = 0;\n  do {\n    res |= code & 1;\n    code >>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >> 1;\n}\n\n/* ==========================================================================\n * Write out any remaining bits in an incomplete byte.\n */\nfunction zip_bi_windup() {\n  if (zip_bi_valid > 8) {\n    zip_put_short(zip_bi_buf);\n  } else if (zip_bi_valid > 0) {\n    zip_put_byte(zip_bi_buf);\n  }\n  zip_bi_buf = 0;\n  zip_bi_valid = 0;\n}\n\nfunction zip_qoutbuf() {\n  if (zip_outcnt != 0) {\n    var q, i;\n    q = zip_new_queue();\n    if (zip_qhead == null) { zip_qhead = zip_qtail = q; } else { zip_qtail = zip_qtail.next = q; }\n    q.len = zip_outcnt - zip_outoff;\n    //      System.arraycopy(zip_outbuf, zip_outoff, q.ptr, 0, q.len);\n    for (i = 0; i < q.len; i++) { q.ptr[i] = zip_outbuf[zip_outoff + i]; }\n    zip_outcnt = zip_outoff = 0;\n  }\n}\n\nfunction zip_deflate(str, level) {\n  var out, buff;\n  var i, j;\n\n  zip_deflate_data = str;\n  zip_deflate_pos = 0;\n  if (typeof level === 'undefined') { level = zip_DEFAULT_LEVEL; }\n  zip_deflate_start(level);\n\n  buff = new Array(1024);\n  out = '';\n  while ((i = zip_deflate_internal(buff, 0, buff.length)) > 0) {\n    for (j = 0; j < i; j++) { out += String.fromCharCode(buff[j]); }\n  }\n  zip_deflate_data = null; // G.C.\n  return out;\n}\n\nfunction encode64(data) {\n  var r = '';\n  for (var i = 0; i < data.length; i += 3) {\n    if (i + 2 == data.length) {\n      r += append3bytes(data.charCodeAt(i), data.charCodeAt(i + 1), 0);\n    } else if (i + 1 == data.length) {\n      r += append3bytes(data.charCodeAt(i), 0, 0);\n    } else {\n      r += append3bytes(data.charCodeAt(i), data.charCodeAt(i + 1), data.charCodeAt(i + 2));\n    }\n  }\n  return r;\n}\n\nfunction append3bytes(b1, b2, b3) {\n  var c1 = b1 >> 2;\n  var c2 = ((b1 & 0x3) << 4) | (b2 >> 4);\n  var c3 = ((b2 & 0xF) << 2) | (b3 >> 6);\n  var c4 = b3 & 0x3F;\n  var r = '';\n  r += encode6bit(c1 & 0x3F);\n  r += encode6bit(c2 & 0x3F);\n  r += encode6bit(c3 & 0x3F);\n  r += encode6bit(c4 & 0x3F);\n  return r;\n}\n\nfunction encode6bit(b) {\n  if (b < 10) {\n    return String.fromCharCode(48 + b);\n  }\n  b -= 10;\n  if (b < 26) {\n    return String.fromCharCode(65 + b);\n  }\n  b -= 26;\n  if (b < 26) {\n    return String.fromCharCode(97 + b);\n  }\n  b -= 26;\n  if (b == 0) {\n    return '-';\n  }\n  if (b == 1) {\n    return '_';\n  }\n  return '?';\n}\n","import mod from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./subMenu.vue?vue&type=style&index=0&id=173324de&lang=scss&scoped=true&\"; export default mod; export * from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--8-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--8-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--8-oneOf-1-2!../../../../../../node_modules/sass-loader/lib/loader.js??ref--8-oneOf-1-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./subMenu.vue?vue&type=style&index=0&id=173324de&lang=scss&scoped=true&\"","// Parse link destination\n//\n'use strict';\n\n\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 */) { return result; }\n      if (code === 0x3C /* < */) { 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      if (str.charCodeAt(pos + 1) === 0x20) { break; }\n      pos += 2;\n      continue;\n    }\n\n    if (code === 0x28 /* ( */) {\n      level++;\n      if (level > 32) { return result; }\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","'use strict';\n\nvar typeMap = {};\nvar types = require('./types');\n\ntypes.forEach(function(type) {\n  typeMap[type] = require('./types/' + type).detect;\n});\n\nmodule.exports = function(buffer, filepath) {\n  var type, result;\n  for (type in typeMap) {\n    if (type in typeMap) {\n      result = typeMap[type](buffer, filepath);\n      if (result) {\n        return type;\n      }\n    }\n  }\n  throw new TypeError('Unsupported type');\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      isOutdented,\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  // set offset past spaces and \">\"\n  initial = offset = state.sCount[startLine] + 1;\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\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    isOutdented = state.sCount[nextLine] < state.blkIndent;\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/* > */ && !isOutdented) {\n      // This line is inside the blockquote.\n\n      // set offset past spaces and \">\"\n      initial = offset = state.sCount[nextLine] + 1;\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","// Process block-level uml diagrams\n//\n'use strict';\n\nmodule.exports = function umlPlugin(md, options) {\n\n  function generateSourceDefault(umlCode, pluginOptions) {\n    var imageFormat = pluginOptions.imageFormat || 'svg';\n    var diagramName = pluginOptions.diagramName || 'uml';\n    var server = pluginOptions.server || 'https://www.plantuml.com/plantuml';\n    var deflate = require('./lib/deflate.js');\n    var zippedCode = deflate.encode64(\n      deflate.zip_deflate(\n        unescape(encodeURIComponent(\n          '@start' + diagramName + '\\n' + umlCode + '\\n@end' + diagramName)),\n        9\n      )\n    );\n\n    return server + '/' + imageFormat + '/' + zippedCode;\n  }\n\n  options = options || {};\n\n  var openMarker = options.openMarker || '@startuml',\n      openChar = openMarker.charCodeAt(0),\n      closeMarker = options.closeMarker || '@enduml',\n      closeChar = closeMarker.charCodeAt(0),\n      render = options.render || md.renderer.rules.image,\n      generateSource = options.generateSource || generateSourceDefault;\n\n  function uml(state, startLine, endLine, silent) {\n    var nextLine, markup, params, token, i,\n        autoClosed = false,\n        start = state.bMarks[startLine] + state.tShift[startLine],\n        max = state.eMarks[startLine];\n\n    // Check out the first character quickly,\n    // this should filter out most of non-uml blocks\n    //\n    if (openChar !== state.src.charCodeAt(start)) { return false; }\n\n    // Check out the rest of the marker string\n    //\n    for (i = 0; i < openMarker.length; ++i) {\n      if (openMarker[i] !== state.src[start + i]) { return false; }\n    }\n\n    markup = state.src.slice(start, start + i);\n    params = state.src.slice(start + i, max);\n\n    // Since start is found, we can report success here in validation mode\n    //\n    if (silent) { return true; }\n\n    // Search for the end of the block\n    //\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      start = state.bMarks[nextLine] + state.tShift[nextLine];\n      max = state.eMarks[nextLine];\n\n      if (start < 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 (closeChar !== state.src.charCodeAt(start)) {\n        // didn't find the closing fence\n        continue;\n      }\n\n      if (state.sCount[nextLine] > state.sCount[startLine]) {\n        // closing fence should not be indented with respect of opening fence\n        continue;\n      }\n\n      var closeMarkerMatched = true;\n      for (i = 0; i < closeMarker.length; ++i) {\n        if (closeMarker[i] !== state.src[start + i]) {\n          closeMarkerMatched = false;\n          break;\n        }\n      }\n\n      if (!closeMarkerMatched) {\n        continue;\n      }\n\n      // make sure tail has spaces only\n      if (state.skipSpaces(start + i) < max) {\n        continue;\n      }\n\n      // found!\n      autoClosed = true;\n      break;\n    }\n\n    var contents = state.src\n      .split('\\n')\n      .slice(startLine + 1, nextLine)\n      .join('\\n');\n\n    // We generate a token list for the alt property, to mimic what the image parser does.\n    var altToken = [];\n    // Remove leading space if any.\n    var alt = params ? params.slice(1) : 'uml diagram';\n    state.md.inline.parse(\n      alt,\n      state.md,\n      state.env,\n      altToken\n    );\n\n    token = state.push('uml_diagram', 'img', 0);\n    // alt is constructed from children. No point in populating it here.\n    token.attrs = [ [ 'src', generateSource(contents, options) ], [ 'alt', '' ] ];\n    token.block = true;\n    token.children = altToken;\n    token.info = params;\n    token.map = [ startLine, nextLine ];\n    token.markup = markup;\n\n    state.line = nextLine + (autoClosed ? 1 : 0);\n\n    return true;\n  }\n\n  md.block.ruler.before('fence', 'uml_diagram', uml, {\n    alt: [ 'paragraph', 'reference', 'blockquote', 'list' ]\n  });\n  md.renderer.rules.uml_diagram = render;\n};\n","'use strict';\n\nvar pngSignature = 'PNG\\r\\n\\x1a\\n';\nfunction isPNG (buffer) {\n  if (pngSignature === buffer.toString('ascii', 1, 8)) {\n    if ('IHDR' !== buffer.toString('ascii', 12, 16)) {\n      throw new TypeError('invalid png');\n    }\n    return true;\n  }\n}\n\nfunction calculate (buffer) {\n  return {\n    'width': buffer.readUInt32BE(16),\n    'height': buffer.readUInt32BE(20)\n  };\n}\n\nmodule.exports = {\n  'detect': isPNG,\n  'calculate': calculate\n};\n","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"slide-bar\"},[_c('el-menu',{attrs:{\"default-active\":_vm.defaultActive,\"router\":\"\",\"unique-opened\":\"\",\"background-color\":\"#F7F9FB\",\"active-text-color\":\"#417FF9\"},on:{\"select\":_vm.emitActiveMenu}},[_vm._l((_vm.menuList),function(item){return [(item.children && item.children.length)?_c('el-submenu',{key:item.path,attrs:{\"index\":item.path}},[_c('template',{slot:\"title\"},[_c('i',{class:item.icon}),_c('span',{staticClass:\"first-menu-span\"},[_vm._v(_vm._s(item.name))])]),_vm._l((item.children),function(itemChild){return [(itemChild.children && itemChild.children.length)?_c('el-submenu',{key:itemChild.path,attrs:{\"index\":itemChild.path}},[_c('template',{slot:\"title\"},[_c('i',{class:itemChild.icon}),_c('span',[_vm._v(_vm._s(itemChild.name))])]),_vm._l((itemChild.children),function(itemChild_Child){return _c('el-menu-item',{key:itemChild_Child.path,attrs:{\"index\":itemChild_Child.path}},[_c('i',{class:itemChild_Child.icon}),_c('span',{attrs:{\"slot\":\"title\"},slot:\"title\"},[_vm._v(_vm._s(itemChild_Child.name))])])})],2):_c('el-menu-item',{key:itemChild.path,attrs:{\"index\":itemChild.path}},[_c('i',{class:itemChild.icon}),_c('span',{attrs:{\"slot\":\"title\"},slot:\"title\"},[_vm._v(_vm._s(itemChild.name))])])]})],2):_c('el-menu-item',{key:item.path,attrs:{\"index\":_vm.getIndexPath(item.path)},nativeOn:{\"click\":function($event){return _vm.openTab(item.path)}}},[_c('i',{class:item.icon}),_c('span',{attrs:{\"slot\":\"title\"},slot:\"title\"},[_vm._v(_vm._s(item.name))])])]})],2)],1)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\r\n\r\nimport { Component, Prop, Vue } from 'vue-property-decorator'\r\n\r\n@Component\r\nexport default class SlideBar extends Vue {\r\n  @Prop(Array)\r\n  menuList!: Array<object>\r\n\r\n  @Prop(Array)\r\n  openeds!: Array<string>\r\n\r\n  @Prop(String)\r\n  defaultActive!: string\r\n\r\n  emitActiveMenu (index: string) {\r\n    this.$emit('selectMenu', index)\r\n  }\r\n\r\n  isAbsolutePath (url: string) {\r\n    return /^(https:\\/\\/)|(http:\\/\\/)|(\\/\\/)/.test(url)\r\n  }\r\n\r\n  getIndexPath (url: string) {\r\n    return this.isAbsolutePath(url) ? '' : url\r\n  }\r\n\r\n  openTab (url: string) {\r\n    if (this.isAbsolutePath(url)) {\r\n      window.open(url)\r\n    }\r\n  }\r\n}\r\n","import mod from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--14-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/ts-loader/index.js??ref--14-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./leftMenu.vue?vue&type=script&lang=ts&\"; export default mod; export * from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--14-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/ts-loader/index.js??ref--14-3!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./leftMenu.vue?vue&type=script&lang=ts&\"","import { render, staticRenderFns } from \"./leftMenu.vue?vue&type=template&id=9e1623a2&scoped=true&\"\nimport script from \"./leftMenu.vue?vue&type=script&lang=ts&\"\nexport * from \"./leftMenu.vue?vue&type=script&lang=ts&\"\nimport style0 from \"./leftMenu.vue?vue&type=style&index=0&id=9e1623a2&lang=scss&scoped=true&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n  script,\n  render,\n  staticRenderFns,\n  false,\n  null,\n  \"9e1623a2\",\n  null\n  \n)\n\nexport default component.exports","import mod from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--6-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--6-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--6-oneOf-1-2!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./docBody.vue?vue&type=style&index=0&lang=css&\"; export default mod; export * from \"-!../../../../../../node_modules/mini-css-extract-plugin/dist/loader.js??ref--6-oneOf-1-0!../../../../../../node_modules/css-loader/index.js??ref--6-oneOf-1-1!../../../../../../node_modules/vue-loader/lib/loaders/stylePostLoader.js!../../../../../../node_modules/postcss-loader/src/index.js??ref--6-oneOf-1-2!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./docBody.vue?vue&type=style&index=0&lang=css&\"","'use strict';\n\n// based on http://www.compix.com/fileformattif.htm\n// TO-DO: support big-endian as well\n\nvar fs = require('fs');\nvar readUInt = require('../readUInt');\n\nfunction isTIFF (buffer) {\n  var hex4 = buffer.toString('hex', 0, 4);\n  return ('49492a00' === hex4 || '4d4d002a' === hex4);\n}\n\n// Read IFD (image-file-directory) into a buffer\nfunction readIFD (buffer, filepath, isBigEndian) {\n\n  var ifdOffset = readUInt(buffer, 32, 4, isBigEndian);\n\n  // read only till the end of the file\n  var bufferSize = 1024;\n  var fileSize = fs.statSync(filepath).size;\n  if (ifdOffset + bufferSize > fileSize) {\n    bufferSize = fileSize - ifdOffset - 10;\n  }\n\n  // populate the buffer\n  var endBuffer = new Buffer(bufferSize);\n  var descriptor = fs.openSync(filepath, 'r');\n  fs.readSync(descriptor, endBuffer, 0, bufferSize, ifdOffset);\n\n  // var ifdLength = readUInt(endBuffer, 16, 0, isBigEndian);\n  var ifdBuffer = endBuffer.slice(2); //, 2 + 12 * ifdLength);\n  return ifdBuffer;\n}\n\n// TIFF values seem to be messed up on Big-Endian, this helps\nfunction readValue (buffer, isBigEndian) {\n  var low = readUInt(buffer, 16, 8, isBigEndian);\n  var high = readUInt(buffer, 16, 10, isBigEndian);\n  return (high << 16) + low;\n}\n\n// move to the next tag\nfunction nextTag (buffer) {\n  if (buffer.length > 24) {\n    return buffer.slice(12);\n  }\n}\n\n// Extract IFD tags from TIFF metadata\nfunction extractTags (buffer, isBigEndian) {\n  var tags = {};\n  var code, type, length;\n\n  while (buffer && buffer.length) {\n    code = readUInt(buffer, 16, 0, isBigEndian);\n    type = readUInt(buffer, 16, 2, isBigEndian);\n    length = readUInt(buffer, 32, 4, isBigEndian);\n\n    // 0 means end of IFD\n    if (code === 0) {\n      break;\n    } else {\n      // 256 is width, 257 is height\n      // if (code === 256 || code === 257) {\n      if (length === 1 && type === 3) {\n        tags[code] = readValue(buffer, isBigEndian);\n      }\n\n      // move to the next tag\n      buffer = nextTag(buffer);\n    }\n  }\n  return tags;\n}\n\n// Test if the TIFF is Big Endian or Little Endian\nfunction determineEndianness (buffer) {\n  var signature = buffer.toString('ascii', 0, 2);\n  if ('II' === signature) {\n    return 'LE';\n  } else if ('MM' === signature) {\n    return 'BE';\n  }\n}\n\nfunction calculate (buffer, filepath) {\n\n  if (!filepath) {\n    throw new TypeError('Tiff doesn\\'t support buffer');\n  }\n\n  // Determine BE/LE\n  var isBigEndian = determineEndianness(buffer) === 'BE';\n\n  // read the IFD\n  var ifdBuffer = readIFD(buffer, filepath, isBigEndian);\n\n  // extract the tags from the IFD\n  var tags = extractTags(ifdBuffer, isBigEndian);\n\n  var width = tags[256];\n  var height = tags[257];\n\n  if (!width || !height) {\n    throw new TypeError('Invalid Tiff, missing tags');\n  }\n\n  return {\n    'width': width,\n    'height': height\n  };\n}\n\nmodule.exports = {\n  'detect': isTIFF,\n  'calculate': calculate\n};\n","var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:\"rate-wrapper\"},[(!_vm.rateState)?[_c('span',{staticClass:\"rate-text\"},[_vm._v(\"以上内容是否对您有帮助：\")]),_c('el-rate',{attrs:{\"show-text\":\"\",\"texts\":['非常不满意', '不满意', '一般', '比较满意', '非常满意']},on:{\"change\":function($event){return _vm.addRate()}},model:{value:(_vm.rateVal),callback:function ($$v) {_vm.rateVal=$$v},expression:\"rateVal\"}})]:[_c('img',{staticClass:\"state-icon\",attrs:{\"src\":require(\"static/images/open/right-icon.svg\")}}),_c('span',{staticClass:\"prompt-text\"},[_vm._v(\"提交成功，感谢您的反馈！\")])]],2)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","import mod from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./DocRate.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../../../../node_modules/thread-loader/dist/cjs.js!../../../../../../node_modules/babel-loader/lib/index.js!../../../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./DocRate.vue?vue&type=script&lang=js&\"","<template>\n<div class=\"rate-wrapper\">\n  <template v-if=\"!rateState\">\n    <span class=\"rate-text\">以上内容是否对您有帮助：</span>\n    <el-rate v-model=\"rateVal\"\n      show-text\n      :texts=\"['非常不满意', '不满意', '一般', '比较满意', '非常满意']\"\n      @change=\"addRate()\"/>\n  </template>\n  <template v-else>\n    <img class=\"state-icon\" src=\"~static/images/open/right-icon.svg\"/>\n    <span class=\"prompt-text\">提交成功，感谢您的反馈！</span>\n  </template>\n</div>\n</template>\n\n<script>\nimport { Component, Vue, Prop, Watch } from 'vue-property-decorator'\nimport axios from 'axios'\n\n@Component\nexport default class DocRate extends Vue {\n  rateVal = 0\n  rateState = false\n\n  @Watch('$route')\n  initRate () {\n    this.rateState = false\n    this.rateVal = 0\n  }\n\n  resetRate () {\n    this.rateVal = 0\n  }\n\n  async addRate () {\n    const params = {\n      doc_url: window.location.href,\n      rate: this.rateVal,\n      remark: ''\n    }\n    const res = await axios({ url: '/api/doc/rate', method: 'POST', data: params })\n    if (res.data && res.data.result === 'ok') {\n      this.resetRate()\n      this.rateState = true\n    }\n  }\n}\n</script>\n\n<style lang=\"scss\" scoped>\n.rate-wrapper {\n  display: flex;\n  align-items: center;\n  padding: 35px 0;\n  margin: 30px 50px 0;\n  border-top: 1px solid #E7E9EB;\n  .state-icon {\n    margin-right: 4px;\n    width: 18px;\n    height: 18px;\n  }\n  .rate-text {\n    font-size: 15px;\n    font-weight: bold;\n    color: initial;\n  }\n  .prompt-text {\n    font-size: 15px;\n  }\n  ::v-deep .el-dialog {\n    width: 400px;\n  }\n  ::v-deep .el-rate {\n    display: flex;\n    align-items: center;\n  }\n  ::v-deep .el-rate__text {\n    margin-left: 0.5em;\n  }\n}\n</style>\n","import _Object$defineProperty from \"../../core-js/object/define-property\";\nimport _Object$keys from \"../../core-js/object/keys\";\nexport default function _applyDecoratedDescriptor(target, property, decorators, descriptor, context) {\n  var desc = {};\n\n  _Object$keys(descriptor).forEach(function (key) {\n    desc[key] = descriptor[key];\n  });\n\n  desc.enumerable = !!desc.enumerable;\n  desc.configurable = !!desc.configurable;\n\n  if ('value' in desc || desc.initializer) {\n    desc.writable = true;\n  }\n\n  desc = decorators.slice().reverse().reduce(function (desc, decorator) {\n    return decorator(target, property, desc) || desc;\n  }, desc);\n\n  if (context && desc.initializer !== void 0) {\n    desc.value = desc.initializer ? desc.initializer.call(context) : void 0;\n    desc.initializer = undefined;\n  }\n\n  if (desc.initializer === void 0) {\n    _Object$defineProperty(target, property, desc);\n\n    desc = null;\n  }\n\n  return desc;\n}","import { render, staticRenderFns } from \"./DocRate.vue?vue&type=template&id=cc41fafc&scoped=true&\"\nimport script from \"./DocRate.vue?vue&type=script&lang=js&\"\nexport * from \"./DocRate.vue?vue&type=script&lang=js&\"\nimport style0 from \"./DocRate.vue?vue&type=style&index=0&id=cc41fafc&lang=scss&scoped=true&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n  script,\n  render,\n  staticRenderFns,\n  false,\n  null,\n  \"cc41fafc\",\n  null\n  \n)\n\nexport default component.exports","'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 + ')|(' + self.re.host_fuzzy_test.source + ')|@',\n    'i'\n  );\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","// 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"],"sourceRoot":""}