Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
js.dalliance-all.js.map Maven / Gradle / Ivy
{"version":3,"sources":["node_modules/browser-pack/_prelude.js","js/bam.js","dalliance-all.js","js/bedwig.js","js/bigwig.js","js/bin.js","js/browser-ui.js","js/cbrowser.js","js/chainset.js","js/cigar.js","js/color.js","js/das.js","js/default-renderer.es6","js/domui.js","js/dummy-renderer.es6","js/encode.js","js/ensembljson.js","js/export-config.js","js/export-image.js","js/export-ui.js","js/exports.js","js/feature-draw.js","js/feature-popup.js","js/features.js","js/glyphs.js","js/jbjson.js","js/kspace.js","js/lh3utils.js","js/memstore.js","js/molgenisjson.js","js/multi-renderer.es6","js/numformats.js","js/overlay.js","js/probe.js","js/rulers.es6","js/sample.js","js/search.js","js/sequence-draw.js","js/session.js","js/sha1.js","js/sourceadapters.js","js/sourcecompare.js","js/spans.js","js/style.js","js/sub-renderer.es6","js/svg-export.js","js/svg-utils.js","js/tabix-source.js","js/tabix.js","js/test-source.es6","js/thub.js","js/tier-actions.js","js/tier-edit.js","js/tier.js","js/track-adder.js","js/trix.js","js/twoBit.js","js/utils.js","js/vcf.js","js/version.js","js/zoomslider.js","node_modules/babel-polyfill/lib/index.js","node_modules/core-js/fn/regexp/escape.js","node_modules/core-js/modules/_a-function.js","node_modules/core-js/modules/_a-number-value.js","node_modules/core-js/modules/_add-to-unscopables.js","node_modules/core-js/modules/_an-instance.js","node_modules/core-js/modules/_an-object.js","node_modules/core-js/modules/_array-copy-within.js","node_modules/core-js/modules/_array-fill.js","node_modules/core-js/modules/_array-from-iterable.js","node_modules/core-js/modules/_array-includes.js","node_modules/core-js/modules/_array-methods.js","node_modules/core-js/modules/_array-reduce.js","node_modules/core-js/modules/_array-species-constructor.js","node_modules/core-js/modules/_array-species-create.js","node_modules/core-js/modules/_bind.js","node_modules/core-js/modules/_classof.js","node_modules/core-js/modules/_cof.js","node_modules/core-js/modules/_collection-strong.js","node_modules/core-js/modules/_collection-to-json.js","node_modules/core-js/modules/_collection-weak.js","node_modules/core-js/modules/_collection.js","node_modules/core-js/modules/_core.js","node_modules/core-js/modules/_create-property.js","node_modules/core-js/modules/_ctx.js","node_modules/core-js/modules/_date-to-iso-string.js","node_modules/core-js/modules/_date-to-primitive.js","node_modules/core-js/modules/_defined.js","node_modules/core-js/modules/_descriptors.js","node_modules/core-js/modules/_dom-create.js","node_modules/core-js/modules/_enum-bug-keys.js","node_modules/core-js/modules/_enum-keys.js","node_modules/core-js/modules/_export.js","node_modules/core-js/modules/_fails-is-regexp.js","node_modules/core-js/modules/_fails.js","node_modules/core-js/modules/_fix-re-wks.js","node_modules/core-js/modules/_flags.js","node_modules/core-js/modules/_flatten-into-array.js","node_modules/core-js/modules/_for-of.js","node_modules/core-js/modules/_global.js","node_modules/core-js/modules/_has.js","node_modules/core-js/modules/_hide.js","node_modules/core-js/modules/_html.js","node_modules/core-js/modules/_ie8-dom-define.js","node_modules/core-js/modules/_inherit-if-required.js","node_modules/core-js/modules/_invoke.js","node_modules/core-js/modules/_iobject.js","node_modules/core-js/modules/_is-array-iter.js","node_modules/core-js/modules/_is-array.js","node_modules/core-js/modules/_is-integer.js","node_modules/core-js/modules/_is-object.js","node_modules/core-js/modules/_is-regexp.js","node_modules/core-js/modules/_iter-call.js","node_modules/core-js/modules/_iter-create.js","node_modules/core-js/modules/_iter-define.js","node_modules/core-js/modules/_iter-detect.js","node_modules/core-js/modules/_iter-step.js","node_modules/core-js/modules/_iterators.js","node_modules/core-js/modules/_library.js","node_modules/core-js/modules/_math-expm1.js","node_modules/core-js/modules/_math-fround.js","node_modules/core-js/modules/_math-log1p.js","node_modules/core-js/modules/_math-scale.js","node_modules/core-js/modules/_math-sign.js","node_modules/core-js/modules/_meta.js","node_modules/core-js/modules/_metadata.js","node_modules/core-js/modules/_microtask.js","node_modules/core-js/modules/_new-promise-capability.js","node_modules/core-js/modules/_object-assign.js","node_modules/core-js/modules/_object-create.js","node_modules/core-js/modules/_object-dp.js","node_modules/core-js/modules/_object-dps.js","node_modules/core-js/modules/_object-forced-pam.js","node_modules/core-js/modules/_object-gopd.js","node_modules/core-js/modules/_object-gopn-ext.js","node_modules/core-js/modules/_object-gopn.js","node_modules/core-js/modules/_object-gops.js","node_modules/core-js/modules/_object-gpo.js","node_modules/core-js/modules/_object-keys-internal.js","node_modules/core-js/modules/_object-keys.js","node_modules/core-js/modules/_object-pie.js","node_modules/core-js/modules/_object-sap.js","node_modules/core-js/modules/_object-to-array.js","node_modules/core-js/modules/_own-keys.js","node_modules/core-js/modules/_parse-float.js","node_modules/core-js/modules/_parse-int.js","node_modules/core-js/modules/_perform.js","node_modules/core-js/modules/_promise-resolve.js","node_modules/core-js/modules/_property-desc.js","node_modules/core-js/modules/_redefine-all.js","node_modules/core-js/modules/_redefine.js","node_modules/core-js/modules/_replacer.js","node_modules/core-js/modules/_same-value.js","node_modules/core-js/modules/_set-collection-from.js","node_modules/core-js/modules/_set-collection-of.js","node_modules/core-js/modules/_set-proto.js","node_modules/core-js/modules/_set-species.js","node_modules/core-js/modules/_set-to-string-tag.js","node_modules/core-js/modules/_shared-key.js","node_modules/core-js/modules/_shared.js","node_modules/core-js/modules/_species-constructor.js","node_modules/core-js/modules/_strict-method.js","node_modules/core-js/modules/_string-at.js","node_modules/core-js/modules/_string-context.js","node_modules/core-js/modules/_string-html.js","node_modules/core-js/modules/_string-pad.js","node_modules/core-js/modules/_string-repeat.js","node_modules/core-js/modules/_string-trim.js","node_modules/core-js/modules/_string-ws.js","node_modules/core-js/modules/_task.js","node_modules/core-js/modules/_to-absolute-index.js","node_modules/core-js/modules/_to-index.js","node_modules/core-js/modules/_to-integer.js","node_modules/core-js/modules/_to-iobject.js","node_modules/core-js/modules/_to-length.js","node_modules/core-js/modules/_to-object.js","node_modules/core-js/modules/_to-primitive.js","node_modules/core-js/modules/_typed-array.js","node_modules/core-js/modules/_typed-buffer.js","node_modules/core-js/modules/_typed.js","node_modules/core-js/modules/_uid.js","node_modules/core-js/modules/_validate-collection.js","node_modules/core-js/modules/_wks-define.js","node_modules/core-js/modules/_wks-ext.js","node_modules/core-js/modules/_wks.js","node_modules/core-js/modules/core.get-iterator-method.js","node_modules/core-js/modules/core.regexp.escape.js","node_modules/core-js/modules/es6.array.copy-within.js","node_modules/core-js/modules/es6.array.every.js","node_modules/core-js/modules/es6.array.fill.js","node_modules/core-js/modules/es6.array.filter.js","node_modules/core-js/modules/es6.array.find-index.js","node_modules/core-js/modules/es6.array.find.js","node_modules/core-js/modules/es6.array.for-each.js","node_modules/core-js/modules/es6.array.from.js","node_modules/core-js/modules/es6.array.index-of.js","node_modules/core-js/modules/es6.array.is-array.js","node_modules/core-js/modules/es6.array.iterator.js","node_modules/core-js/modules/es6.array.join.js","node_modules/core-js/modules/es6.array.last-index-of.js","node_modules/core-js/modules/es6.array.map.js","node_modules/core-js/modules/es6.array.of.js","node_modules/core-js/modules/es6.array.reduce-right.js","node_modules/core-js/modules/es6.array.reduce.js","node_modules/core-js/modules/es6.array.slice.js","node_modules/core-js/modules/es6.array.some.js","node_modules/core-js/modules/es6.array.sort.js","node_modules/core-js/modules/es6.array.species.js","node_modules/core-js/modules/es6.date.now.js","node_modules/core-js/modules/es6.date.to-iso-string.js","node_modules/core-js/modules/es6.date.to-json.js","node_modules/core-js/modules/es6.date.to-primitive.js","node_modules/core-js/modules/es6.date.to-string.js","node_modules/core-js/modules/es6.function.bind.js","node_modules/core-js/modules/es6.function.has-instance.js","node_modules/core-js/modules/es6.function.name.js","node_modules/core-js/modules/es6.map.js","node_modules/core-js/modules/es6.math.acosh.js","node_modules/core-js/modules/es6.math.asinh.js","node_modules/core-js/modules/es6.math.atanh.js","node_modules/core-js/modules/es6.math.cbrt.js","node_modules/core-js/modules/es6.math.clz32.js","node_modules/core-js/modules/es6.math.cosh.js","node_modules/core-js/modules/es6.math.expm1.js","node_modules/core-js/modules/es6.math.fround.js","node_modules/core-js/modules/es6.math.hypot.js","node_modules/core-js/modules/es6.math.imul.js","node_modules/core-js/modules/es6.math.log10.js","node_modules/core-js/modules/es6.math.log1p.js","node_modules/core-js/modules/es6.math.log2.js","node_modules/core-js/modules/es6.math.sign.js","node_modules/core-js/modules/es6.math.sinh.js","node_modules/core-js/modules/es6.math.tanh.js","node_modules/core-js/modules/es6.math.trunc.js","node_modules/core-js/modules/es6.number.constructor.js","node_modules/core-js/modules/es6.number.epsilon.js","node_modules/core-js/modules/es6.number.is-finite.js","node_modules/core-js/modules/es6.number.is-integer.js","node_modules/core-js/modules/es6.number.is-nan.js","node_modules/core-js/modules/es6.number.is-safe-integer.js","node_modules/core-js/modules/es6.number.max-safe-integer.js","node_modules/core-js/modules/es6.number.min-safe-integer.js","node_modules/core-js/modules/es6.number.parse-float.js","node_modules/core-js/modules/es6.number.parse-int.js","node_modules/core-js/modules/es6.number.to-fixed.js","node_modules/core-js/modules/es6.number.to-precision.js","node_modules/core-js/modules/es6.object.assign.js","node_modules/core-js/modules/es6.object.create.js","node_modules/core-js/modules/es6.object.define-properties.js","node_modules/core-js/modules/es6.object.define-property.js","node_modules/core-js/modules/es6.object.freeze.js","node_modules/core-js/modules/es6.object.get-own-property-descriptor.js","node_modules/core-js/modules/es6.object.get-own-property-names.js","node_modules/core-js/modules/es6.object.get-prototype-of.js","node_modules/core-js/modules/es6.object.is-extensible.js","node_modules/core-js/modules/es6.object.is-frozen.js","node_modules/core-js/modules/es6.object.is-sealed.js","node_modules/core-js/modules/es6.object.is.js","node_modules/core-js/modules/es6.object.keys.js","node_modules/core-js/modules/es6.object.prevent-extensions.js","node_modules/core-js/modules/es6.object.seal.js","node_modules/core-js/modules/es6.object.set-prototype-of.js","node_modules/core-js/modules/es6.object.to-string.js","node_modules/core-js/modules/es6.parse-float.js","node_modules/core-js/modules/es6.parse-int.js","node_modules/core-js/modules/es6.promise.js","node_modules/core-js/modules/es6.reflect.apply.js","node_modules/core-js/modules/es6.reflect.construct.js","node_modules/core-js/modules/es6.reflect.define-property.js","node_modules/core-js/modules/es6.reflect.delete-property.js","node_modules/core-js/modules/es6.reflect.enumerate.js","node_modules/core-js/modules/es6.reflect.get-own-property-descriptor.js","node_modules/core-js/modules/es6.reflect.get-prototype-of.js","node_modules/core-js/modules/es6.reflect.get.js","node_modules/core-js/modules/es6.reflect.has.js","node_modules/core-js/modules/es6.reflect.is-extensible.js","node_modules/core-js/modules/es6.reflect.own-keys.js","node_modules/core-js/modules/es6.reflect.prevent-extensions.js","node_modules/core-js/modules/es6.reflect.set-prototype-of.js","node_modules/core-js/modules/es6.reflect.set.js","node_modules/core-js/modules/es6.regexp.constructor.js","node_modules/core-js/modules/es6.regexp.flags.js","node_modules/core-js/modules/es6.regexp.match.js","node_modules/core-js/modules/es6.regexp.replace.js","node_modules/core-js/modules/es6.regexp.search.js","node_modules/core-js/modules/es6.regexp.split.js","node_modules/core-js/modules/es6.regexp.to-string.js","node_modules/core-js/modules/es6.set.js","node_modules/core-js/modules/es6.string.anchor.js","node_modules/core-js/modules/es6.string.big.js","node_modules/core-js/modules/es6.string.blink.js","node_modules/core-js/modules/es6.string.bold.js","node_modules/core-js/modules/es6.string.code-point-at.js","node_modules/core-js/modules/es6.string.ends-with.js","node_modules/core-js/modules/es6.string.fixed.js","node_modules/core-js/modules/es6.string.fontcolor.js","node_modules/core-js/modules/es6.string.fontsize.js","node_modules/core-js/modules/es6.string.from-code-point.js","node_modules/core-js/modules/es6.string.includes.js","node_modules/core-js/modules/es6.string.italics.js","node_modules/core-js/modules/es6.string.iterator.js","node_modules/core-js/modules/es6.string.link.js","node_modules/core-js/modules/es6.string.raw.js","node_modules/core-js/modules/es6.string.repeat.js","node_modules/core-js/modules/es6.string.small.js","node_modules/core-js/modules/es6.string.starts-with.js","node_modules/core-js/modules/es6.string.strike.js","node_modules/core-js/modules/es6.string.sub.js","node_modules/core-js/modules/es6.string.sup.js","node_modules/core-js/modules/es6.string.trim.js","node_modules/core-js/modules/es6.symbol.js","node_modules/core-js/modules/es6.typed.array-buffer.js","node_modules/core-js/modules/es6.typed.data-view.js","node_modules/core-js/modules/es6.typed.float32-array.js","node_modules/core-js/modules/es6.typed.float64-array.js","node_modules/core-js/modules/es6.typed.int16-array.js","node_modules/core-js/modules/es6.typed.int32-array.js","node_modules/core-js/modules/es6.typed.int8-array.js","node_modules/core-js/modules/es6.typed.uint16-array.js","node_modules/core-js/modules/es6.typed.uint32-array.js","node_modules/core-js/modules/es6.typed.uint8-array.js","node_modules/core-js/modules/es6.typed.uint8-clamped-array.js","node_modules/core-js/modules/es6.weak-map.js","node_modules/core-js/modules/es6.weak-set.js","node_modules/core-js/modules/es7.array.flat-map.js","node_modules/core-js/modules/es7.array.flatten.js","node_modules/core-js/modules/es7.array.includes.js","node_modules/core-js/modules/es7.asap.js","node_modules/core-js/modules/es7.error.is-error.js","node_modules/core-js/modules/es7.global.js","node_modules/core-js/modules/es7.map.from.js","node_modules/core-js/modules/es7.map.of.js","node_modules/core-js/modules/es7.map.to-json.js","node_modules/core-js/modules/es7.math.clamp.js","node_modules/core-js/modules/es7.math.deg-per-rad.js","node_modules/core-js/modules/es7.math.degrees.js","node_modules/core-js/modules/es7.math.fscale.js","node_modules/core-js/modules/es7.math.iaddh.js","node_modules/core-js/modules/es7.math.imulh.js","node_modules/core-js/modules/es7.math.isubh.js","node_modules/core-js/modules/es7.math.rad-per-deg.js","node_modules/core-js/modules/es7.math.radians.js","node_modules/core-js/modules/es7.math.scale.js","node_modules/core-js/modules/es7.math.signbit.js","node_modules/core-js/modules/es7.math.umulh.js","node_modules/core-js/modules/es7.object.define-getter.js","node_modules/core-js/modules/es7.object.define-setter.js","node_modules/core-js/modules/es7.object.entries.js","node_modules/core-js/modules/es7.object.get-own-property-descriptors.js","node_modules/core-js/modules/es7.object.lookup-getter.js","node_modules/core-js/modules/es7.object.lookup-setter.js","node_modules/core-js/modules/es7.object.values.js","node_modules/core-js/modules/es7.observable.js","node_modules/core-js/modules/es7.promise.finally.js","node_modules/core-js/modules/es7.promise.try.js","node_modules/core-js/modules/es7.reflect.define-metadata.js","node_modules/core-js/modules/es7.reflect.delete-metadata.js","node_modules/core-js/modules/es7.reflect.get-metadata-keys.js","node_modules/core-js/modules/es7.reflect.get-metadata.js","node_modules/core-js/modules/es7.reflect.get-own-metadata-keys.js","node_modules/core-js/modules/es7.reflect.get-own-metadata.js","node_modules/core-js/modules/es7.reflect.has-metadata.js","node_modules/core-js/modules/es7.reflect.has-own-metadata.js","node_modules/core-js/modules/es7.reflect.metadata.js","node_modules/core-js/modules/es7.set.from.js","node_modules/core-js/modules/es7.set.of.js","node_modules/core-js/modules/es7.set.to-json.js","node_modules/core-js/modules/es7.string.at.js","node_modules/core-js/modules/es7.string.match-all.js","node_modules/core-js/modules/es7.string.pad-end.js","node_modules/core-js/modules/es7.string.pad-start.js","node_modules/core-js/modules/es7.string.trim-left.js","node_modules/core-js/modules/es7.string.trim-right.js","node_modules/core-js/modules/es7.symbol.async-iterator.js","node_modules/core-js/modules/es7.symbol.observable.js","node_modules/core-js/modules/es7.system.global.js","node_modules/core-js/modules/es7.weak-map.from.js","node_modules/core-js/modules/es7.weak-map.of.js","node_modules/core-js/modules/es7.weak-set.from.js","node_modules/core-js/modules/es7.weak-set.of.js","node_modules/core-js/modules/web.dom.iterable.js","node_modules/core-js/modules/web.immediate.js","node_modules/core-js/modules/web.timers.js","node_modules/core-js/shim.js","node_modules/es6-promise/dist/es6-promise.js","node_modules/jszlib/js/inflate.js","node_modules/process/browser.js","node_modules/ramda/dist/ramda.js","node_modules/regenerator-runtime/runtime.js"],"names":["e","t","n","r","s","o","u","a","require","i","f","Error","code","l","exports","call","length","1","module","BamFile","_getBaiRefLength","uncba","offset","p","nbin","readInt","b","nchnk","nintv","minBlockIndex","q","v","readVob","bi","block","makeBam","data","bai","indexChunks","callback","attempted","slice","fetch","header","makeBam2","timeout","parseBamHeader","unc","unbgzf","byteLength","Uint8Array","magic","BAM_MAGIC","toString","headLen","String","fromCharCode","nRef","bam","chrToIndex","indexToChr","lName","name","j","indexOf","substring","push","indices","parseBai","baiMagic","BAI_MAGIC","nref","ref","blockStart","Math","min","chunks","result","url","replace","RegExp","BamRecord","spans","bin","Range","union","intersection","readShort","readByte","readFloat","readInt64","lh3utils","reg2bins","Chunk","BamFlags","MULTIPLE_SEGMENTS","ALL_SEGMENTS_ALIGN","SEGMENT_UNMAPPED","NEXT_SEGMENT_UNMAPPED","REVERSE_COMPLEMENT","NEXT_REVERSE_COMPLEMENT","FIRST_SEGMENT","LAST_SEGMENT","SECONDARY_ALIGNMENT","QC_FAIL","DUPLICATE","SUPPLEMENTARY","prototype","blocksForRange","refId","max","index","this","intBinsL","intBins","leafChunks","otherChunks","c","cs","ce","lowest","minLin","maxLin","lb","prunedOtherChunks","chnk","maxv","intChunks","sort","c0","c1","dif","minv","mergedChunks","cur","nc","chr","opts","tramp","records","ba","finished","thisB","readBamRecords","chrId","fetchMin","fetchMax","undefined","start_stop","buffer","bind","SEQRET_DECODER","CIGAR_DECODER","sink","blockSize","blockEnd","record","refID","pos","bmn","mq","nl","flag_nc","flag","lseq","nextRef","nextPos","segment","light","seqLength","includeName","readName","nextSegment","cigar","cigop","seq","seqBytes","sb","qseq","quals","value","tag","type","cc","elen","reader","atype","alen","./bin","./lh3utils","./spans","2","BedWigParser","BedParseSession","parser","WigParseSession","wigState","sa","dalliance_registerParserFactory","registerParserFactory","das","DASStylesheet","DASStyle","DASGroup","DASFeature","utils","shallowCopy","createSession","__KV_REGEXP","__SPACE_REGEXP","BED_COLOR_REGEXP","parse","line","toks","split","start","parseInt","end","label","score","parseFloat","orientation","color","test","itemRgb","thickStart","thickEnd","blockCount","blockSizes","map","x","blockStarts","grp","id","notes","groups","geneId","geneName","gg","bmin","bmax","span","tsList","ranges","ts","bf","codingRegion","tl","tlList","readingFrame","readframe","flush","step","ti","m","exec","getStyleSheet","stylesheet","wigStyle","glyph","BGCOLOR","HEIGHT","pushStyle","FGCOLOR","BUMP","LABEL","ZINDEX","tsStyle","densStyle","COLOR1","COLOR2","./das","./sourceadapters","./utils","3","bwg_readOffset","M1","M2","M3","M4","BigWig","BigWigView","bwg","cirTreeOffset","cirTreeLength","isSummary","makeBwg","salted","Int16Array","la","Int32Array","BIG_WIG_MAGIC","BIG_BED_MAGIC","BIG_WIG_MAGIC_BE","BIG_BED_MAGIC_BE","version","numZoomLevels","chromTreeOffset","unzoomedDataOffset","unzoomedIndexOffset","fieldCount","definedFieldCount","asOffset","totalSummaryOffset","uncompressBufSize","extHeaderOffset","zoomLevels","zl","zlReduction","zlData","zlIndex","reduction","dataOffset","indexOffset","readChromTree","getAutoSQL","as","schema","BBIExtraIndex","bbi","field","jszlib","jszlib_inflate_buffer","inflateBuffer","arrayCopy","BIG_WIG_TYPE_GRAPH","BIG_WIG_TYPE_VSTEP","BIG_WIG_TYPE_FSTEP","chromsToIDs","idsToChroms","maxID","udo","eb","bpt","keySize","rootNodeOffset","bptReadNode","nodeType","cnt","childOffset","key","ki","charCode","chromId","substr","readWigData","chrName","readWigDataById","cirHeader","cirBlockSize","blocksToFetch","outstanding","filter","Date","now","fmin","fmax","cirFobRecur","level","instrument","console","log","cachedCirRoot","cirFobRecur2","fetchFeatures","maxCirBlockSpan","blockSpan","fetchRanges","fr","cirFobStartFetch","attempts","resultBuffer","contains","cirBlockData","isLeaf","lo","startChrom","startBase","endChrom","endBase","blockOffset","size","recurOffsets","b0","b1","features","createFeature","_chromId","k","parseFeatures","splice","fetchStart","fetchSize","fb","tmp","fa","Float32Array","itemCount","validCnt","maxVal","sumData","summaryOpts","maxScore","itemStep","itemSpan","blockType","dfc","rest","ch","bedColumns","featureOpts","isNaN","col","fields","exonFrames","geneName2","spanList","tlOffset","brf","readframeExplicit","getFirstAdjacent","dir","getFirstAdjacentById","blockToFetch","bestBlockChr","bestBlockOffset","chrx","bestFeature","bestChr","bestPos","fi","bestRecur","getUnzoomedView","unzoomedView","cirLen","nzl","getZoomedView","z","zh","view","_tsFetch","zoom","topLevelReductionCache","feats","thresholdSearch","referencePoint","threshold","fbThresholdSearchRecur","candidates","c2","d","chrOrd","candidate","rp","fromRef","initialChr","header_re","field_re","headerMatch","declType","comment","getExtraIndices","extraIndexCount","extraIndexListOffset","eil","ii","eiType","eiFieldCount","eiOffset","eiField","lookup","nodeOffset","valSize","node","Uint16Array","Uint32Array","lastChildOffset","localeCompare","4","BlobFetchable","blob","URLFetchable","_typeof","bstringToBuffer","charCodeAt","buf","readIntBE","Symbol","iterator","obj","constructor","sha1","b64_sha1","Promise","webkitSlice","FileReader","onloadend","ev","readAsBinaryString","FileReaderSync","res","readAsArrayBuffer","ns","ne","seed","isSafari","navigator","userAgent","fetchAsText","getURL","then","req","XMLHttpRequest","salt","open","setRequestHeader","onreadystatechange","readyState","status","responseText","credentials","withCredentials","send","err","resolver","urlOrObj","resolve","attempt","truncatedLength","setTimeout","abort","overrideMimeType","responseType","clearTimeout","response","bl","mozResponseArrayBuffer","convertBuffer","ArrayBuffer","./sha1","es6-promise","5","humanReadableScale","suffix","round","browser","Browser","makeElement","nf","removeChildren","formatLongInt","makeZoomSlider","initUI","holder","genomePanel","noSourceCSS","forEach","path","document","head","appendChild","rel","href","resolveURL","disableDefaultFeaturePopup","addFeatureListener","feature","hit","tier","featurePopup","classList","add","toolbar","className","title","coordSystem","speciesName","nameForCoordSystem","setDocumentTitle","locField","makeTooltip","locStatusField","zoomInBtn","zoomSlider","width","zoomSliderWidth","zoomOutBtn","clearHighlightsButton","addTrackBtn","favBtn","svgBtn","optsButton","helpButton","tierEditButton","leapLeftButton","leapRightButton","modeButtons","noTrackAdder","noTrackEditor","noExport","noOptions","noHelp","setUiMode","uiMode","mb","help","export","remove","noLeapButtons","firstChild","noTitle","margin","noLocationField","noClearHighlightsButton","noZoomSlider","toolbarBelow","lt2","lt5","roundSliderValue","rounded","ltx","zoomExpt","zoomBase","whole","frac","markSlider","addLabel","exp","addViewListener","_oldZoom","isSnapZooming","alternate","value2","current","active","removeLabels","zmin","zmax","zrange","numSliderTicks","sti","storeStatus","storeViewStatus","highlights","style","display","addTierListener","storeTierStatus","addEventListener","keyCode","preventDefault","stopPropagation","setSelectedTier","g","search","textContent","trackAddPopup","displayed","removeAllPopups","showTrackAdder","zoomStep","wantSnap","savedZoom","zoomSliderValue","zoomMin","activeZSV","openExportPanel","toggleOptsPopup","toggleHelpPopup","selectedTiers","openTierPanel","tiers","leap","reverseKeyScrolling","st","getSelectedTier","featureSource","sourceAdapterIsCapable","quantLeapThreshold","config","dasSource","addTierSelectionListener","canLeap","clearHighlights","addTierSelectionWrapListener","focus","sel","hideToolPanel","manipulatingTier","ft","uiKeyHandler","removeEventListener","browserHolder","showToolPanel","panel","nowrap","activeToolPanel","parentElement","removeChild","content","overflowY","divider","svgHolder","resizeViewer","helpFrame","scrolling","seamless","src","optsForm","boxSizing","MozBoxSizing","verticalAlign","optsTable","cellPadding","scrollModeButton","checked","reverseScrolling","align","scrollKeyButton","rulerSelect","rulerLocation","positionRuler","paintQuant","singleBaseHighlightButton","singleBaseHighlight","setAttribute","resetButton","marginLeft","marginRight","reset","./cbrowser","./export-config","./export-image","./export-ui","./numformats","./session","./svg-export","./tier-edit","./zoomslider","6","Region","renderers","default","DefaultRenderer","dummy","DummyRenderer","multi","MultiRenderer","sub","SubRenderer","defaultRenderer","renderer","prefix","sources","tierGroups","searchOnlySources","searchOnlySourceHolders","featureListeners","featureHoverListeners","viewListeners","regionSelectListeners","tierListeners","tierSelectionListeners","tierSelectionWrapListeners","cookieKey","chains","pageName","zoomFactor","maxPixelsPerBase","origin","targetQuantRes","featurePanelWidth","entryPoints","currentSeqMax","maxViewWidth","defaultSubtierMax","highZoomThreshold","mediumZoomThreshold","minExtraWidth","maxExtraWidth","defaultHighlightFill","defaultHighlightAlpha","exportHighlights","exportRuler","exportBanner","exportRegion","tierBackgroundColors","minTierHeight","noDefaultLabels","availableSources","Observed","defaultSources","mappableSources","registry","noRegistryTabs","defaultTrackAdderTab","hubs","hubObjects","sourceCache","SourceCache","retina","useFetchWorkers","maxWorkers","workerPath","resolvers","resolverSeed","assemblyNamePrimary","assemblyNameUcsc","defaultSearchRegionPadding","httpCanaryURL","httpWarningURL","initListeners","baseColors","A","C","G","T","-","I","viewStart","viewEnd","offscreenInitWidth","uiPrefix","location","window","hostname","port","proto","protocol","realInit","loadListener","setSources","msh","maybeMapping","mapping","set","glyphLookup","glyphs","rx","ry","matches","gi","notSelectable","minY","maxY","group","FetchWorker","worker","tagSeed","callbacks","onmessage","cmd","postMessage","cb","error","makeFetchWorker","wurl","wscript","VERSION","wblob","Blob","reject","Worker","URL","createObjectURL","onerror","message","sourcesByURI","Awaited","miniJSONify","textXHR","DasTier","hex_sha1","thub","connectTrackHub","formatQuantLabel","Chainset","sourcecompare","sourcesAreEqual","sourcesAreEqualModuloStyle","sourceDataURI","sourceStyleURI","destroy","resizeListener","fetchWorkers","_iteratorNormalCompletion","_didIteratorError","_iteratorError","_step","_iterator","next","done","terminate","self","wasInitialized","ua","disablePinning","defaultChr","defaultStart","defaultEnd","restoreStatus","statusRestored","injectionPoint","Element","browserHolderHolder","getElementById","tabIndex","maxHeight","pinnedTierHolder","tierHolder","makeLoader","locSingleBase","locSingleBaseHolder","minFloor","maxFloor","zoomSliderDict","loc","createTextNode","tierHolderHolder","bhtmlRoot","disablePoweredBy","ruler","ruler2","chainConfigs","promisedWorkers","pw","all","nextWorker","getComputedStyle","getBoundingClientRect","realInit2","pollInterval","setInterval","clearInterval","_this","scale","zoomMax","wheelDeltaX","delta","move","wheelDeltaY","scrollTop","axis","detail","touchStartHandler","touchMoveHandler","touchEndHandler","touchCancelHandler","keyHandler","layoutsChanged","wantedLayoutHeight","layoutHeight","clipTier","arrangeTiers","newZoom","check","scrollArrowKey","shiftKey","tt","forceHeight","subtiers","height","mergeConfig","ctrlKey","metaKey","th","tq","quant","qmin","qmax","qscale","notify","altKey","contiguous","mt","si","ip","withPreservedSelection","_ensureTiersGrouped","markSelectedTiers","notifyTierSelection","reorderTiers","notifyTier","nst","top","row","offsetTop","bottom","offsetHeight","notifyTierSelectionWrap","it","discontig","infoVisible","infoElement","updateHeight","bumpStatus","collapseSuperGroups","bumped","mergeSelectedTiers","addTier","pinned","hPopupHolder","body","source","restoredConfigs","disabled","makeTier","refreshTier","_iteratorNormalCompletion2","_didIteratorError2","_iteratorError2","_step2","_iterator2","_source","_createSources","createSources","onFirstRender","firstRenderPromise","ss","getSequenceSource","getSeqInfo","queryRegistry","hi","hc","hub","tdb","genome","genomes","ucscName","altLabel","fullScreen","setFullScreenHeight","setLocation","touchOriginX","touches","pageX","touchOriginY","pageY","sep","abs","zooming","zoomLastSep","zoomInitialSep","zoomInitialScale","touchX","touchY","cp","scp","getRenderer","drawTier","realMakeTier","stack","background","oorigin","dragOrigin","dragMoveOrigin","hoverTimeout","isDragging","featureLookup","padding","glyphCacheOrigin","dragMoveHandler","clientX","dragUpHandler","viewport","clientY","br","left","cursor","notifyFeatureHover","doubleClickTimeout","featureDoubleClick","notifyFeature","sequenceSource","notifyRegionSelect","removeButton","removeTier","nameButton","hitTier","bumpButton","dragLabel","dragTierHolder","dragTierHolderScrollLimit","tierOrdinal","yAtLastReorder","tiersWereReordered","labelDragHandler","scrollHeight","cloneNode","visibility","holderBCR","pty","ttr","tix","labelReleaseHandler","init","updatedTier","currentlyHeight","updateLabel","_updateFromConfig","hasPinned","pinnedTiers","unpinnedTiers","visible","xi","tierCallback","getTierRenderer","renderCallback","renderTier","knownSpace","invalidate","down","groupedTiers","tierGroup","pusho","newTiers","reverse","nt","nti","arrangedTiers","element","parentNode","setBackground","refresh","retrieveTierData","drawOverlays","notifyLocation","minExtraW","maxExtraW","newOrigin","oh","scaleAtLastRedraw","od","originHaxx","scaledQuantRes","innerDrawnStart","innerDrawnEnd","outerDrawnStart","outerDrawnEnd","cancel","KnownSpace","seg","bestCacheOverlapping","drawnStart","drawnEnd","retrieveFeatures","tryCache","coords","cacheHash","cacheTime","localStorage","JSON","cacheAge","rex","rurl","DASRegistry","scoords","taxon","auth","stringify","soft","wid","nStart","nEnd","oz","nz","factor","viewCenter","len","spaceCheck","dontRefresh","skipRefresh","oldFPW","viewWidth","nve","innerHeight","conf","force","target","targetTier","featureCache","removeAllTiers","_sequenceSource","_getSequenceSource","provides_entrypoints","tier_type","twoBitURI","twoBitBlob","TwoBitSequenceSource","ensemblURI","EnsemblSequenceSource","DASSequenceSource","newChr","newMin","newMax","oldNewMin","_setLocation","findChr","altChr","si2","newChrInfo","chrChanged","newWidth","csm","newScale","oldScale","scaleChanged","newZS","oldZS","viewportHolder","overlay","difToActive","difToSaved","norigin","drawOverlay","instrumentActivity","activityStartTime","setCenterLocation","newCenterLoc","halfWidth","pingActivity","activity","loaderButton","addInitListener","handler","removeFeatureListener","idx","arrayIndexOf","fli","ex","addFeatureHoverListener","removeFeatureHoverListener","removeViewListener","nvs","lli","removeTierListener","tli","addRegionSelectListener","removeRegionSelectListener","rli","highlightRegion","_highlightRegion","h","visStart","visEnd","featuresInRegion","fl","currentFeatures","button","browserMid","removeTierSelectionListener","removeTierSelectionWrapListener","right","borderWidth","borderRightWidth","centreOffset","offsetWidth","quantOverlay","fstart","fwidth","newMid","zoomForScale","ssScale","zoomForCurrentScale","tierTotal","currentHeight","fedge","mid","findNextFeature","nxt","nmin","nmax","newStart","newEnd","alert","primary","ucsc","devicePixelRatio","canFetchPlainHTTP","_plainHTTPPromise","getWorker","postCommand","command","uri","registerResolver","transfer","get","scb","configs","put","./browser-ui","./chainset","./default-renderer","./domui","./dummy-renderer","./feature-popup","./kspace","./multi-renderer","./search","./sourcecompare","./sub-renderer","./thub","./tier","./tier-actions","./track-adder","./version","7","srcTag","destTag","chainsBySrc","chainsByDest","postFetchQueues","fetchedTiles","granularity","chainFetcher","BBIChainFetcher","AliasChainFetcher","DASChainFetcher","DASSource","pi","cleanChr","bbiFeatureToChain","chain","srcChr","srcChrom","srcMin","srcStart","srcMax","srcEnd","srcOri","destChr","destMin","destMax","destOri","ori","blocks","srcStarts","destStarts","blockLengths","blockLens","forwardAliases","sequenceAliases","ai","al","DASSegment","parseCigar","exportConfig","mapPoint","ci","cpos","bSrc","bDest","bSize","dpos","apos","flipped","mapSegment","mappings","cmin","cmax","partialMax","partialMin","unmapPoint","sourceBlocksForRange","STATE_PENDING","STATE_FETCHED","thisCS","minTile","maxTile","needsNewOrPending","needsNewFetch","tn","fetchChains","cbs","present","oci","oc","cbd","pfq","srcBlocks","amin","amax","_min","_max","alignments","aligns","aln","srcSeg","destSeg","segments","objects","object","dbSource","accession","strand","srcops","destops","srcOffset","destOffset","srci","desti","op","blockLen","resp","./bigwig","./cigar","8","match","cigops","CIGAR_REGEXP","count","9","DColour","red","green","blue","hex2","y","dasColourForName","palette","COLOR_RE","CSS_COLOR_RE","black","makeColourSteps","steps","stops","colours","dcolours","grad","STEP_LOOP","rs","ca","fill","toSvgString","makeGradient","color1","color2","color3","toHexString","yellow","white","gray","grey","lightskyblue","lightsalmon","hotpink","10","description","a1","a2","options","props","dasBaseURI","DASCoords","coordsMatch","DASSequence","alpha","alphabet","DASLink","desc","DASAlignment","styles","parseGradient","getAttribute","colors","se","getElementsByTagName","stop","nodeValue","elementValue","children","childNodes","ni","childElementOf","hasChildNodes","child","Node","ELEMENT_NODE","nextSibling","dasLinksOf","links","Array","maybeLinkChilden","linkXML","dasNotesOf","maybeNotes","doCrossDomainRequest","custAuth","XDomainRequest","onload","dom","ActiveXObject","async","loadXML","ontimeout","responseXML","isDasBooleanTrue","toLowerCase","isDasBooleanNotFalse","copyStylesheet","nss","sh","_methodRE","_labelRE","_typeRE","_gradient","isBounded","toDASQuery","getURI","dasURI","segs","segMin","segMax","segId","segSize","segDesc","sequence","seqs","segAlpha","segSeq","rawSeq","space","toUpperCase","features_uri","filters","adjacent","adj","maxbins","join","msg","segmentMap","segmentXML","segmentID","featureXMLs","dasFeature","spos","epos","tec","te","typeId","typeCv","method","groupXML","dasGroup","pec","parts","parents","aliXMLs","aliXML","ali","objXMLs","oi","objXML","dbVersion","blockXMLs","blockXML","order","segXMLs","segXML","styleHolder","successCB","failureCB","creds","stylesheet_uri","typeXMLs","typeStyle","glyphXMLs","glyphXML","localName","failure","quri","sourceXMLs","sourceXML","versionXMLs","versionXML","coordXMLs","coordXML","coord","caps","capXMLs","capXML","fep","propXMLs","source_uri","capabilities","errHandler","xUser","btoa","xPass","./color","11","_interopRequireWildcard","__esModule","newObj","Object","hasOwnProperty","updateStatus","canvas","getContext","currentSequence","_sequenceDraw","drawSeqTier","prepareSubtiers","vOffset","R","defaultTo","prepareViewport","paint","restore","drawCallback","glyphsForGroup","groupElement","gstyle","styleForFeature","labelWanted","_das","glyphForFeature","connector","labelText","LABELS","g1","g2","zindex","groupGlyph","Glyphs","GroupGlyph","LabelledGlyph","bump","noLabel","glyphType","hideSubpixelGlyphs","minPos","rawMaxPos","maxPos","glyphHolder","featureToCrossLikeGlyph","_glyphHolder","_slicedToArray","_featureToGradientLik","featureToGradientLikeGlyph","_featureToGradientLik2","PaddedGlyph","parallel","PARALLEL","sw","SOUTHWEST","NORTHEAST","ArrowGlyph","stroke","AArrowGlyph","_stroke","SpanGlyph","_stroke2","lineStyle","STYLE","LineGlyph","_stroke3","_fill","PrimersGlyph","string","STRING","_fill2","TextGlyph","_stroke4","_fill3","TooManyGlyph","_featureToPointGlyph","featureToPointGlyph","_featureToPointGlyph2","sequenceGlyph","insertionLabels","__INSERTIONS","TriangleGlyph","insertion","altAlleles","_stroke5","_fill4","bg","BoxGlyph","_stroke6","_fill5","BGITEM","_scale","tags","refSeq","getRefSeq","AminoAcidGlyph","forceLabel","groupFeatures","gbsFeatures","gbsStyles","stackedFeatures","_utils","ungroupedFeatures","concat","makeStackedBars","gbs","gf","lineGraphGlyphs","makeLinePlot","glyphifyGroups","groupIds","keys","groupedFeatures","groupGlyphs","gId","bumpSubtiers","grid","gridOffset","gridSpacing","subtierMax","subtiersExceeded","unbumpedST","_featureDraw","SubTier","bumpedSTs","glyphTier","find","hasSpaceFor","subtier","unshift","GridGlyph","arguments","MIN_PADDING","scaleVertical","_loop","sgId","sgGroup","superGroups","isSuperGroup","featuresByType","sgMin","sgMax","sgSeg","groupedFeature","template","_spans","mergedRanges","range","posCoverage","actCoverage","newFeature","visualWeight","superGroup","sgGlyphs","gGlyphs","_bumpSubtiers","_bumpSubtiers2","drawUnmapped","drawStart","drawEnd","unmappedBlocks","knownCoverage","knownRanges","fillStyle","fillRect","clearViewport","clearRect","clear","desiredWidth","fpw","lh","canvasHeight","save","overlayLabelCanvas","OverlayLabelCanvas","translate","paintToContext","getScoreMinMax","smin","quantMin","smax","quantMax","relScoreOrigin","relScore","relOrigin","csStart","csEnd","sfMin","sfMax","requiredHeight","outline","STROKECOLOR","COLOR_BY_SCORE2","BGGRAD","_color","COLOR3","score2","smin2","MIN2","smax2","MAX2","relScore2","clamp","SIZE","RSIZE","STROKETHRESHOLD","ExGlyph","DIRECTION","LINEWIDTH","DotGlyph","PlimsollGlyph","points","POINTS","StarGlyph","CrossGlyph","boxGlyph","SCATTER","_getScoreMinMax","_getScoreMinMax2","_relScoreOrigin","_relScoreOrigin2","originShift","heightFudge","featureLabel","textHeight","TranslatedGlyph","centerOnAxis","_getScoreMinMax3","_getScoreMinMax4","AUTOMIN","currentFeaturesMinScore","AUTOMAX","currentFeaturesMaxScore","tmin","tmax","_relScoreOrigin3","_relScoreOrigin4","ALPHA","_grad","tempGlyph","_getScoreMinMax5","_getScoreMinMax6","yscale","sc","PointGlyph","rawseq","rawquals","indels","ops","_cigar","co","repeat","inseq","ig","__SEQCOLOR","mismatchSeq","strandColor","_minusColor","_plusColor","__disableQuals","SequenceGlyph","__CLEARBG","yshift","prevSign","curSign","curGlyphPoints","glyphSequences","prevPoint","px","ADDITIVE","POSCOLOR","NEGCOLOR","py","lggs","gs","lgg","LineGraphGlyph","posStacks","negStacks","stackOrigin","relScoreEnd","relScoreStart","relScoreMax","relScoreMin","createQuantOverlay","tics","w","ticSpacing","ticInterval","globalAlpha","strokeStyle","lineWidth","beginPath","moveTo","lineTo","ty","_t","_ty","textAlign","fillText","_numformats","_t2","_ty2","_t3","_ty3","defineProperty","sliceIterator","arr","_arr","_n","_d","_e","_s","_i","isArray","TypeError","_glyphs","_ramda","./cigar.js","./color.js","./das.js","./feature-draw.js","./glyphs.js","./sequence-draw.js","./spans.js","./utils.js","ramda","12","makeTreeTableSection","update","ttButton","heading","popupHolder","ele","text","_outlistener","isin","timer","setup","mx","scrollX","my","scrollY","ttt","popup","_moveHandler","offsetParent","popit","documentElement","scrollLeft","winWidth","innerWidth","position","maxWidth","closeButton","innerHTML","dragOX","dragOY","moveHandler","_upHandler","tbar","paddingLeft","paddingRight","popupHandle","13","_defaultRenderer","14","lookupEncodeURI","json","accept","EncodeURLHolder","rawurl","EncodeFetchable","getURLPromise","urlPromise","urlPromiseValidity","15","EnsemblFeatureSource","FeatureSourceBase","base","species","dalliance_registerSourceAdapterFactory","registerSourceAdapterFactory","create","cdsStyle","varStyle","getScales","types","pool","busy","notifyActivity","jr","jf","feature_type","ID","Parent","consequence_type","alt_alleles","query","seq_region_name","16","exportFullConfig","exportSourceConfig","exportChains","sourceConfig","noPersist","forceMin","forceMinDynamic","forceMax","forceMaxDynamic","exportPageTemplate","17","fillTextRightJustified","measureText","drawSeqTierGC","exportImage","ypos","banner","region","backupFPW","backupScale","totHeight","backupSubtiers","backupOriginHaxx","backupLayoutHeight","mult","resolutionMultiplier","cw","font","closePath","clip","draw","hasQuant","numTics","strokeWidth","labelName","labelWidth","rulerPos","toDataURL","./glyphs","./sequence-draw","18","exportForm","exportSelect","exportContent","setupEOT","exportHighlightsToggle","exportRulerToggle","exportRegionToggle","exportBannerToggle","exportScale","exportWidth","exportButton","blobURL","note","makeSVG","page","downloadLink","download","previewLink","eotHighlights","eotGuideline","eotScale","eotWidth","eotRegion","eotBanner","exportOptsTable","es","insertBefore","19","chainset","dalliance_makeParser","makeParser","Ruler","rulerDrawCallback","./rulers","babel-polyfill","20","indexFor","gmin","ub","mg","ind","gc","zeroLine","ctx","maybe","labelRE","methodRE","typeRE","softMin","SOFTMIN","Number","MAX_VALUE","MIN","softMax","SOFTMAX","MIN_VALUE","MAX","21","FeatureInfo","pick","fid","molgenis","sections","maybeConcat","pushnew","TAGVAL_NOTE_RE","addFeatureInfoPlugin","featureInfoPlugins","setTitle","info","__ignored_feature","featureInfo","fips","fipi","table","suppressMethod","minWidth","suppressScore","fisi","section","actions","action","actionItem","eval","run","22","sortFeatures","minScore","fbid","dmin","dmax","drawnGroupedFeatures","groupMins","groupMaxes","groupsToSupers","nonPositional","init_fbid","superParentsOf","spids","pid","drawn","fGroups","fSuperGroup","gid","ogm","pushnewo","sgs","sp","23","PathGlyphBase","radius","_width","_height","_alpha","_radius","covList","coverage","GLOBAL_GC","unmeasured","anchor","metrics","textLen","measured","_x","_dir","minp","maxp","_ori","_style","_strand","_parallel","_sw","_ne","_string","_textLen","aminoTileColor","aa","tileColors","ALTERNATE_COLOR","purple","reverseComplement","seq_dict","rev_seq","rev_compl_seq","_seq","_orientation","_readframe","scheme","fillbg","_strandColor","_ref","_scheme","_quals","_fillbg","_scaleVertical","_y","yOffset","spacing","_r","_points","overhang","_overhang","_hh","ox","oy","makeElementNS","AMINO_ACID_TRANSLATION","svgu","NS_SVG","SVGPath","NS_XLINK","drawPath","toSVG","toPathData","arcTo","strokeRect","drawConnectors","gl","last","pathData","transform","fontSize","registerGlyph","minVisible","maxVisible","hh","hw","arc","cx","cy","lInset","rInset","minLength","instep","setLineDash","drawStemPath","drawTrigsPath","prevOverhang","nextOverhang","leftOverhang","codon","isRetina","__dalliance_SequenceGlyphCache","altPattern","isCloseUp","alphaForQual","qual","mismatch","qc","oldAlpha","refBase","alt","img","createElement","imgGc","dy","drawImage","fillOpacity","textAnchor","midX","midY","theta","sin","cos","x1","y1","x2","y2","./svg-utils","24","JBrowseStore","jbori","subfeatures","uniqueID","cds","sj","sf","txGroup","exon","tlGroup","cdsExon","25","FetchPool","reqs","awaitedFeatures","requestsIssued","notifyRequestsIssued","KSCacheBaton","tierMap","seqSource","DummySequenceSource","viewCount","latestViews","filterFeatures","ff","featuresByGroup","gmax","MappedFeatureSource","CachingFeatureSource","BWGFeatureSource","RemoteBWGFeatureSource","BAMFeatureSource","RemoteBAMFeatureSource","DummyFeatureSource","OverlayFeatureSource","sample","downsample","getBaseCoverage","addRequest","xhr","abortAll","cancelled","baton","awaitedSeq","seqWasFetched","startFetchesForTiers","gex","needSeq","tierRenderer","startFetchesFor","wasRendered","cachedSeq","provide","wantedTypes","viewID","getSource","needsSeq","needsSequence","styleFilters","getActiveStyleFilters","typeList","cachedFeatures","provision","availableScales","latestViewID","actualScale","setFeatures","mayDownsample","needBaseComposition","isPrototypeOf","forceReduction","noDownsample","await","./overlay","./sample","26","Vob","allowZero","bint","lim","oBlockList","ptr","totalSize","xlen","out","reg2bin","beg","list","27","MemStore","featuresByChr","maxLength","chrRing","MemStoreFeatureSource","storeHolder","payload","_load","store","lines","session","li","addFeatures","dirty","f1","f2","_indexFor","mini","maxi","chrInd","readAsText","getDefaultFIPs","28","MolgenisFeatureSource","entity","random","setStyleProperties","track_type","altAttr","genome_attrs","refAttr","labelAttr","label_attr","exon_key","attrs","attributes","attr","attrArray","encodeURIComponent","items","identifier","score_attr","29","multiTier","multiConfig","getSubConfig","multi_id","minOffset","pipe","reduce","acc","flatten","Infinity","t1","t2","grid_offset","grid_spacing","quantCanvas","30","dot","dotThreshold","31","activityListeners","readinessListeners","changeListeners","business","readiness","initN","merge","OverlayFeatureSource_merge_concat","filterDispatchOnMethod","OverlayFeatureSource_merge_byKey","OverlayBaton","returnCount","statusCount","returns","statuses","featureSets","omaps","fsi","om","of","keyForFeature","mf","fs","_sourceAdapterIsCapable","cap","addActivityListener","addChangeListener","notifyChange","addReadinessListener","notifyReadiness","notifyReadinessListener","removeReadinessListener","removeActivityListener","listener","removeChangeListener","s0","sfl","fetchN","completed","quantFindNextFeature","32","probeResource","retry","fetchable","BED_REGEXP","KV_REGEXP","VCFHEAD_RE","transport","nameExtractPattern","TABIX_MAGIC","apply","maybeType","finishProbeBedWig","tbi","./bam","./encode","./tabix","33","rulers","rulerY","oldLineWidth","34","ds_scale","__DS_SCALES","pow","DSBin","tot","hasScore","_featureOrder","targetRez","sn","binTots","maxBin","minBin","minLap","maxLap","bm","sampledFeatures","BaseBin","_pos","_bases","_totalCount","alignSeqUsingCigar","processedSeq","currentRefSeq","allBins","minForFeature","maxForFeature","charAt","recordBase","baseFeatures","infoList","refString","baseScoreList","fBase","maxSeen","cov","lap","lMin","lMax","baseComposition","totalQual","strandCnt","strandComposition","+","totalCount","totalCountStr","baseCnt","basePercentage","plusStrandCnt","minusStrandCnt","meanQual","baseInfoString","toFixed","minCount","baseCount","baseScorePair","35","_toConsumableArray","arr2","from","parseLocCardinal","connectTrix","REGION_PATTERN","statusCallback","srPadding","searchCount","foundLatch","searchCallback","found","nchr","doTrixSearch","trix","searchEndpoint","doDasSearch","searchSources","trixURI","ix","ixx","trixxURI","provides_search","found2","./trix","36","tileSizeForScale","MIN_TILE","knownStart","knownEnd","seqTierMax","tile","svgSeqTier","37","nukeStatus","noPersistView","currentSourceList","coveredHubURLs","currentHubList","CONFIG","storedConfigVersion","storedConfigHash","pageConfigHash","defaultSourcesByURI","ul","qChr","qMin","qMax","sz","rks","sbh","rl","sourceStr","storedSources","osi","oldSource","hubStr","38","rstr2hex","rstr_sha1","str2rstr_utf8","rstr2b64","binb2rstr","binb_sha1","rstr2binb","input","hex_tab","hexcase","output","tab","triplet","b64pad","olda","oldb","oldc","oldd","olde","bit_rol","safe_add","sha1_ft","sha1_kt","lsw","msw","num","39","factory","__dalliance_sourceAdapterFactories","__dalliance_parserFactories","cfsid","__cfs_id_seed","DASFeatureSource","awaitedEntryPoints","ep","twoBit","makeTwoBit","tb","bwgSource","bwgHolder","preflight","pfs","bwg_preflights","keyHolder","resolverKey","bamRecordToFeature","bamRecord","bamSource","bamGroup","bamHolder","JBrowseFeatureSource","jbURI","jbQuery","resolveUrlToPage","StyleFilterSet","initSources","thisTier","saf","bwgURI","bwgBlob","bamURI","bamBlob","fetchStylesheet","ssSource","cacheKey","started","doesNotContain","addAll","af","defStyle","dasStaticFeatures","cachedStaticFeatures","cachedStaticScale","tryMaxBins","fops","retScale","dasAdjLock","getDesiredTypes","epi","getSeq","arg","ei","extraIndices","quantLeap","eii","wantDensity","clientBin","scaleFactor","is","link","scales","noExtraFeatureInfo","fip","geneHint","connection","meta","under","bamF","baiF","baiBlob","baiURI","bamRecords","ri","indexUri","indexBlob","simplifySegments","minGap","s1","s2","ssegs","currentSeg","fetchLength","mseg","finalStatus","mappedFeatures","mappedLoc","fscale","mi","m1","m2","segDestCoverage","./bedwig","./ensembljson","./jbjson","./memstore","./molgenisjson","./style","./tabix-source","./test-source","./twoBit","./vcf","40","41","_Compound","sorted","_rangeOrder","merged","shift","_ranges","insertRange","r0","r1","l0","l1","i0","i1","or","lapMin","lapMax","rangeOrder","isContiguous","_pushRanges","lower_bound","floor","rangeOver","42","StyleFilter","_filters","equals","_list","filterSet","43","44","saveDoc","implementation","createDocument","saveRoot","fontFamily","dallianceAnchor","clipRect","tierSVG","clipPath","clipRule","tierLabels","tierTopPos","tierBackground","seqTrack","glyphElements","svg","XMLSerializer","serializeToString","root","outerHTML","45","46","TabixFeatureSource","tabixHolder","indexURI","connectTabix","tabix","fetchHeader","47","TabixFile","unchead","format","colSeq","colStart","colEnd","skip","headerMax","readRecords","canonicalChr","LINE_LOOP","48","_classCallCheck","instance","Constructor","_possibleConstructorReturn","ReferenceError","_inherits","subClass","superClass","enumerable","writable","configurable","setPrototypeOf","__proto__","_createClass","defineProperties","descriptor","protoProps","staticProps","_sourceadapters","TestSource","_FeatureSourceBase","getPrototypeOf","genFeature","./sourceadapters.js","49","TrackHub","TrackHubTrack","TrackHubDB","hubURL","hubFile","THUB_PARSE_REGEXP","genomesFile","genURL","relativeURL","genFile","stanzas","THUB_STANZA_REGEXP","gprops","twoBitPath","trackDb","absURL","THUB_COMPARE","priority","shortLabel","THUB_SUBGROUP_REGEXP","THUB_PENNANT_PREFIX","_parent","getTracks","_tracks","trackFile","tracks","tracksById","track","_db","subgroups","sgtoks","sgtag","sgrecord","titles","sgti","sgm","container","bigDataUrl","toplevels","composites","parent","ptoks","compositeTrack","comp","parentOfViews","toDallianceSource","longLabel","pennantIcon","pennant","searchTrix","aggregate","typeToks","bedTokens","bedPlus","bigbedStyles","bigwigStyles","yLineOnOff","yLineMark","maxHeightPixels","mhpToks","gtype","graphTypeDefault","altColor","cbsToks","plus","minus","tlStyle","50","nsh","51","getSeqStyle","__dalliance_smallGlyphs","DOT","EX","STAR","SQUARE","CROSS","TRIANGLE","PLIMSOLL","setStyleColors","numColors","tierColorField","tierColorField2","tierColorField3","tierPlusColorField","tierMinusColorField","mutateStylesheet","visitor","changeColor","mergeStylesheet","tierForm","aboutBanner","Name","paddingBottom","marginBottom","about","aboutNotes","sduri","semanticBanner","editBanner","tierNameField","tierPinnedToggle","glyphField","tierColorFields","colorListPlus","colorListMinus","colorListElement","setNumColors","tierMinField","tierMaxField","tierMinToggle","tierMaxToggle","quantLeapToggle","quantLeapThreshField","tierHeightField","bumpToggle","bumpLimit","labelToggle","mainStyle","isQuantitative","isSimpleQuantitative","activeStyleCount","minRow","maxRow","bumpRow","labelRow","styleRow","colorRow","setMinValue","setMaxValue","seqStyle","seqMismatchRow","seqMismatchToggle","seqInsertRow","seqInsertToggle","seqIgnoreQualsRow","seqIgnoreQualsToggle","plusStrandColorRow","minusStrandColorRow","quantLeapRow","tierTable","setConfig","updateQuant","currentScale","52","__tier_idSeed","border","minHeight","notifier","notifierHolder","paddingTop","borderRadius","nameElement","classes","styleIdSeed","layoutWasDone","featureInfoPlugin","noSourceFeatureInfo","readinessListener","ready","activityListener","listeners","featuresLoadedListeners","_resolveFirstRenderPromise","setStylesheet","baseStylesheet","baseStylesheetValidity","sfs","sourceConfigNeedsSeq","some","knownChr","notifyFeaturesLoaded","mmin","trySourceFNF","clientHeight","_notifierToStatus","checkedHTTP","can","warnHTTP","notifierFadeTimeout","_notifierOn","opacity","_notifierOff","notifyTierListeners","newStyle","stylesheetValidity","newConfig","needsRefresh","needsReorder","wantedHeight","wantedPinned","wantedSubtierMax","wantedBumped","scheduleRedraw","redrawTimeout","clearTierListeners","change","clearFeaturesLoadedListeners","addFeaturesLoadedListener","removeFeaturesLoadedListener","./feature-draw","./features","53","activateButton","addModeButtons","which","domui","currentlyActive","makeButton","tooltip","regButton","makeHubStab","refreshButton","addButton","canButton","customMode","stabHolder","buttonIdSeed","ttab","trim","tops","buttons","dg","dimensions","dprops","dtoks","dti","dimX","dimY","sgX","sgY","trks","vX","vY","matrix","tableLayout","transformOrigin","webkitTransform","webkitTransformOrigin","mbody","yi","cell","ds","bd","dalliance_source","__mapping","dalliance_mapping","stabBody","stab","buttonId","ld","htmlFor","setChecks","switchToBinMode","binButton","pageHolder","custURL","custFile","multiple","switchToHubConnectMode","addHubButton","switchToCustomMode","custButton","customForm","doAdd","curi","nds","tryAddDAS","fileList","files","tryAddMultiple","lcuri","tryAddBin","dataToFinalize","completeBAM","promptForBAI","completeTabixVCF","promptForTabix","custName","custCS","custQuant","custUser","custPass","tryAddHub","multipleSet","hidden","makeSourceConfig","bestHub","bestHubButton","okay","hubButton","makeHubButton","modeButtonHolder","tryAddDASxSources","sqfail","addDasCompletionPage","coordsDetermined","quantDetermined","indexF","hasBAI","magic2","binFormatErrorPage","hasTabix","makeStab","makeStabObserver","mm","mapButton","groupedDefaults","hubMenuButton","hbContent","loader","marginTop","removeHubItem","allOnItem","allOffItem","hubMenu","clickCatcher","firstDefButton","firstDefSources","defButton","asform","overflow","__sourceHolder","msources","removeListener","addListenerAndFire","cors","tsm","testSegment","tabError","quantIrrelevant","csk","newSources","probeMultiple","updateMultipleStatus","usedIndices","bams","tabixes","baiPattern","tbiPattern","needsIndex","multTable","typeContent","ccs","state","indexFile","buttonHolder","./probe","54","ixxData","offsets","TrixIndex","ixslice","qtag","ist","55","TwoBitFile","headerBlockSize","HEADER_BLOCK_SIZE","headerBlocksFetched","TWOBIT_MAGIC","TWOBIT_MAGIC_BE","seqCount","seqDict","parseSeqInfo","TwoBitSeq","tbf","seqOffset","_length","nBlockCnt","r2","nbs","nbMin","nbLen","nb","nBlocks","mBlockCnt","TWOBIT_TABLE","fillSeq","fsm","bb","bv","seqData","seqstr","nSpans","intr","56","arrayRemove","attribs","namespace","createElementNS","setAttrs","setAttr","attr_name_cache","_attr","lcc","exc","queue","saltURL","__dalliance_saltSeed","lastIndexOf","addListener","TTT","TTC","TTA","TTG","CTT","CTC","CTA","CTG","ATT","ATC","ATA","ATG","GTT","GTC","GTA","GTG","TCT","TCC","TCA","TCG","CCT","CCC","CCA","CCG","ACT","ACC","ACA","ACG","GCT","GCC","GCA","GCG","TAT","TAC","TAA","TAG","CAT","CAC","CAA","CAG","AAT","AAC","AAA","AAG","GAT","GAC","GAA","GAG","TGT","TGC","TGA","TGG","CGT","CGC","CGA","CGG","AGT","AGC","AGA","AGG","GGT","GGC","GGA","GGG","57","VCFParser","VCFParseSession","VCF_INFO_RE","VCF_INFO_HEADER","VCF_INFO_HEADER_TOK","refAllele","infoToks","val","58","MAJOR","MINOR","MICRO","BRANCH","vs","PATCH","59","setPos","np","thumb","setPos2","pos2","thumb2","labels","slider","txt","onChange","createEvent","initEvent","thumbMouseDown","dispatchEvent","thumbDragHandler","thumbDragEndHandler","60","global","define","O","DEFINE_PROPERTY","_babelPolyfill","padStart","padEnd","Function","core-js/fn/regexp/escape","core-js/shim","regenerator-runtime/runtime","61","escape","../../modules/_core","../../modules/core.regexp.escape","62","63","cof","./_cof","64","UNSCOPABLES","ArrayProto","./_hide","./_wks","65","forbiddenField","66","isObject","./_is-object","67","toObject","toAbsoluteIndex","toLength","copyWithin","to","inc","./_to-absolute-index","./_to-length","./_to-object","68","aLen","endPos","69","forOf","iter","ITERATOR","./_for-of","70","toIObject","IS_INCLUDES","$this","el","fromIndex","./_to-iobject","71","IObject","asc","TYPE","$create","IS_MAP","IS_FILTER","IS_SOME","IS_EVERY","IS_FIND_INDEX","NO_HOLES","callbackfn","that","./_array-species-create","./_ctx","./_iobject","72","aFunction","memo","isRight","./_a-function","73","SPECIES","original","./_is-array","74","speciesConstructor","./_array-species-constructor","75","invoke","arraySlice","factories","construct","F","args","fn","partArgs","bound","./_invoke","76","ARG","tryGet","B","callee","77","78","dP","redefineAll","anInstance","$iterDefine","setSpecies","DESCRIPTORS","fastKey","validate","getEntry","entry","_f","getConstructor","wrapper","NAME","ADDER","iterable","_l","delete","prev","has","def","setStrong","iterated","kind","_k","./_an-instance","./_descriptors","./_iter-define","./_iter-step","./_meta","./_object-create","./_object-dp","./_redefine-all","./_set-species","./_validate-collection","79","classof","./_array-from-iterable","./_classof","80","getWeak","anObject","createArrayMethod","$has","arrayFind","arrayFindIndex","uncaughtFrozenStore","UncaughtFrozenStore","findUncaughtFrozen","ufstore","./_an-object","./_array-methods","./_has","81","$export","redefine","fails","$iterDetect","setToStringTag","inheritIfRequired","methods","common","IS_WEAK","Base","fixMethod","KEY","entries","HASNT_CHAINING","THROWS_ON_PRIMITIVES","ACCEPT_ITERABLES","BUGGY_ZERO","$instance","NEED","W","./_export","./_fails","./_global","./_inherit-if-required","./_iter-detect","./_redefine","./_set-to-string-tag","82","core","__e","83","$defineProperty","createDesc","./_property-desc","84","85","getTime","$toISOString","toISOString","lz","NaN","isFinite","RangeError","getUTCFullYear","getUTCMilliseconds","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","86","toPrimitive","NUMBER","hint","./_to-primitive","87","88","89","90","91","getKeys","gOPS","pIE","getSymbols","symbols","isEnum","./_object-gops","./_object-keys","./_object-pie","92","hide","PROTOTYPE","own","IS_FORCED","IS_GLOBAL","IS_STATIC","S","IS_PROTO","P","IS_BIND","expProto","U","./_core","93","MATCH","re","94","95","defined","wks","SYMBOL","fns","strfn","rxfn","./_defined","96","ignoreCase","multiline","unicode","sticky","97","flattenIntoArray","sourceLen","depth","mapper","thisArg","spreadable","targetIndex","sourceIndex","mapFn","IS_CONCAT_SPREADABLE","98","isArrayIter","getIterFn","BREAK","RETURN","iterFn","./_is-array-iter","./_iter-call","./core.get-iterator-method","99","__g","100","101","102","103","./_dom-create","104","./_set-proto","105","un","106","propertyIsEnumerable","107","Iterators","./_iterators","108","109","110","111","isRegExp","112","ret","113","IteratorPrototype","114","LIBRARY","$iterCreate","BUGGY","FF_ITERATOR","KEYS","VALUES","returnThis","DEFAULT","IS_SET","FORCED","getMethod","DEF_VALUES","VALUES_BUG","$native","$default","$entries","$anyNative","values","./_iter-create","./_library","./_object-gpo","115","SAFE_CLOSING","riter","skipClosing","safe","116","117","118","119","$expm1","expm1","120","sign","EPSILON","EPSILON32","MAX32","MIN32","roundTiesToEven","fround","$abs","$sign","./_math-sign","121","log1p","122","inLow","inHigh","outLow","outHigh","123","124","META","setDesc","isExtensible","FREEZE","preventExtensions","setMeta","onFreeze","./_uid","125","Map","shared","getOrCreateMetadataMap","targetKey","targetMetadata","keyMetadata","ordinaryHasOwnMetadata","MetadataKey","metadataMap","ordinaryGetOwnMetadata","ordinaryDefineOwnMetadata","MetadataValue","ordinaryOwnMetadataKeys","_","toMetaKey","./_shared","./es6.map","./es6.weak-map","126","macrotask","Observer","MutationObserver","WebKitMutationObserver","process","isNode","domain","exit","enter","nextTick","toggle","observe","characterData","promise","task","./_task","127","PromiseCapability","$$resolve","$$reject","128","$assign","assign","K","129","dPs","enumBugKeys","IE_PROTO","Empty","createDict","iframeDocument","iframe","lt","gt","contentWindow","write","close","Properties","./_enum-bug-keys","./_html","./_object-dps","./_shared-key","130","IE8_DOM_DEFINE","Attributes","./_ie8-dom-define","131","132","__defineSetter__","133","gOPD","getOwnPropertyDescriptor","134","gOPN","windowNames","getOwnPropertyNames","getWindowNames","./_object-gopn","135","$keys","hiddenKeys","./_object-keys-internal","136","getOwnPropertySymbols","137","ObjectProto","138","names","./_array-includes","139","140","141","142","isEntries","143","Reflect","ownKeys","144","$parseFloat","$trim","str","./_string-trim","./_string-ws","145","$parseInt","ws","hex","radix","146","147","newPromiseCapability","promiseCapability","./_new-promise-capability","148","bitmap","149","150","SRC","TO_STRING","$toString","TPL","inspectSource","isFunction","151","regExp","replacer","part","152","153","COLLECTION","nextItem","154","155","buggy","./_object-gopd","156","157","stat","158","uid","159","SHARED","160","D","161","162","toInteger","./_to-integer","163","searchString","./_is-regexp","164","quot","createHTML","attribute","p1","165","fillString","stringLength","fillStr","intMaxLength","fillLen","stringFiller","ceil","./_string-repeat","166","167","spaces","non","ltrim","rtrim","exporter","ALIAS","FORCE","168","169","defer","channel","html","cel","setTask","setImmediate","clearTask","clearImmediate","MessageChannel","Dispatch","counter","ONREADYSTATECHANGE","event","port2","port1","importScripts","170","171","number","172","173","174","175","176","valueOf","177","$typed","$buffer","propertyDesc","toIndex","createArrayIncludes","ArrayIterators","arrayFill","arrayCopyWithin","$DP","$GOPD","ARRAY_BUFFER","SHARED_BUFFER","BYTES_PER_ELEMENT","$ArrayBuffer","$DataView","DataView","arrayForEach","arrayFilter","arraySome","arrayEvery","arrayIncludes","arrayValues","arrayKeys","arrayEntries","arrayLastIndexOf","arrayReduce","arrayReduceRight","reduceRight","arrayJoin","arraySort","arrayToString","arrayToLocaleString","toLocaleString","TYPED_CONSTRUCTOR","DEF_CONSTRUCTOR","ALL_CONSTRUCTORS","CONSTR","TYPED_ARRAY","TYPED","VIEW","WRONG_LENGTH","$map","allocate","LITTLE_ENDIAN","FORCED_SET","toOffset","BYTES","speciesFromList","fromList","addGetter","internal","$from","mapfn","$of","TO_LOCALE_BUG","$toLocaleString","every","predicate","findIndex","searchElement","includes","separator","middle","comparefn","subarray","begin","$begin","byteOffset","$slice","$set","arrayLike","$iterators","isTAIndex","$getDesc","$setDesc","$TypedArrayPrototype$","CLAMPED","GETTER","SETTER","TypedArray","ABV","TypedArrayPrototype","getter","setter","addElement","$offset","$length","klass","$len","$nativeIterator","CORRECT_ITER_NAME","$iterator","./_array-copy-within","./_array-fill","./_species-constructor","./_to-index","./_typed","./_typed-buffer","./es6.array.iterator","178","packIEEE754","mLen","nBytes","eLen","eMax","eBias","rt","LN2","unpackIEEE754","nBits","unpackI32","bytes","packI8","packI16","packI32","packF64","packF32","isLittleEndian","numIndex","intIndex","$LENGTH","WRONG_INDEX","$BUFFER","_b","$OFFSET","pack","conversion","DATA_VIEW","BaseBuffer","BUFFER","BYTE_LENGTH","BYTE_OFFSET","ArrayBufferProto","$setInt8","setInt8","getInt8","setUint8","bufferLength","getUint8","getInt16","getUint16","getInt32","getUint32","getFloat32","getFloat64","setInt16","setUint16","setInt32","setUint32","setFloat32","setFloat64","179","Typed","TypedArrayConstructors","180","181","182","wksExt","$Symbol","./_wks-ext","183","184","USE_SYMBOL","$exports","185","getIteratorMethod","186","$re","./_replacer","187","./_add-to-unscopables","188","$every","./_strict-method","189","190","$filter","191","$find","forced","192","193","$forEach","STRICT","194","createProperty","./_create-property","195","$indexOf","NEGATIVE_ZERO","196","197","addToUnscopables","Arguments","198","199","200","201","202","$reduce","./_array-reduce","203","204","upTo","cloned","205","$some","206","$sort","207","208","209","./_date-to-iso-string","210","toJSON","pv","211","TO_PRIMITIVE","./_date-to-primitive","212","DateProto","INVALID_DATE","213","./_bind","214","HAS_INSTANCE","FunctionProto","215","FProto","nameRE","216","strong","MAP","./_collection","./_collection-strong","217","sqrt","$acosh","acosh","./_math-log1p","218","asinh","$asinh","219","$atanh","atanh","220","cbrt","221","clz32","LOG2E","222","cosh","223","./_math-expm1","224","./_math-fround","225","hypot","value1","div","sum","larg","226","$imul","imul","UINT16","xn","yn","xl","yl","227","log10","LOG10E","228","229","log2","230","231","sinh","E","232","tanh","233","trunc","234","$Number","BROKEN_COF","TRIM","toNumber","argument","third","maxCode","first","digits","235","236","_isFinite","237","isInteger","./_is-integer","238","239","isSafeInteger","240","MAX_SAFE_INTEGER","241","MIN_SAFE_INTEGER","242","./_parse-float","243","./_parse-int","244","aNumberValue","$toFixed","ERROR","ZERO","multiply","divide","numToString","fractionDigits","./_a-number-value","245","$fails","$toPrecision","toPrecision","precision","246","./_object-assign","247","248","249","250","$freeze","./_object-sap","251","$getOwnPropertyDescriptor","252","./_object-gopn-ext","253","$getPrototypeOf","254","$isExtensible","255","$isFrozen","256","$isSealed","257","./_same-value","258","259","$preventExtensions","260","$seal","261","262","263","264","265","Internal","newGenericPromiseCapability","OwnPromiseCapability","Wrapper","microtask","newPromiseCapabilityModule","perform","promiseResolve","PROMISE","$Promise","empty","USE_NATIVE","FakePromise","PromiseRejectionEvent","isThenable","isReject","_c","_v","ok","reaction","fail","_h","onHandleUnhandled","onUnhandled","unhandled","isUnhandled","emit","onunhandledrejection","reason","_a","onrejectionhandled","$reject","_w","$resolve","executor","onFulfilled","onRejected","catch","capability","remaining","$index","alreadyCalled","race","./_microtask","./_perform","./_promise-resolve","266","rApply","fApply","thisArgument","argumentsList","L","267","rConstruct","NEW_TARGET_BUG","ARGS_BUG","Target","newTarget","$args","268","propertyKey","269","deleteProperty","270","Enumerate","enumerate","271","272","getProto","273","receiver","274","275","276","./_own-keys","277","278","setProto","279","V","existingDescriptor","ownDesc","280","$flags","$RegExp","re1","re2","CORRECT_NEW","tiRE","piRE","fiU","proxy","./_flags","281","flags","282","$match","regexp","./_fix-re-wks","283","REPLACE","$replace","searchValue","replaceValue","284","SEARCH","$search","285","SPLIT","$split","_split","$push","$SPLIT","LENGTH","LAST_INDEX","NPCG","limit","separator2","lastIndex","lastLength","lastLastIndex","splitLimit","separatorCopy","286","./es6.regexp.flags","287","SET","288","./_string-html","289","290","291","292","$at","codePointAt","./_string-at","293","context","ENDS_WITH","$endsWith","endsWith","endPosition","./_fails-is-regexp","./_string-context","294","295","296","297","$fromCodePoint","fromCodePoint","298","INCLUDES","299","300","point","301","302","raw","callSite","tpl","303","304","305","STARTS_WITH","$startsWith","startsWith","306","307","308","309","310","wksDefine","enumKeys","_create","gOPNExt","$JSON","_stringify","HIDDEN","SymbolRegistry","AllSymbols","OPSymbols","QObject","findChild","setSymbolDesc","protoDesc","wrap","sym","isSymbol","$defineProperties","$propertyIsEnumerable","$getOwnPropertyNames","$getOwnPropertySymbols","IS_OP","es6Symbols","wellKnownSymbols","for","keyFor","useSetter","useSimple","$replacer","./_enum-keys","./_wks-define","311","$isView","isView","final","viewS","viewT","312","313","./_typed-array","314","315","316","317","318","319","320","321","322","InternalMap","each","weak","WEAK_MAP","$WeakMap","freeze","./_collection-weak","323","WEAK_SET","324","arraySpeciesCreate","flatMap","./_flatten-into-array","325","depthArg","326","$includes","327","asap","328","isError","329","330","./_set-collection-from","331","./_set-collection-of","332","./_collection-to-json","333","lower","upper","334","DEG_PER_RAD","PI","335","RAD_PER_DEG","degrees","radians","336","./_math-scale","337","iaddh","x0","y0","$x0","$x1","$y0","338","imulh","$u","$v","u0","v0","u1","v1","339","isubh","340","341","342","343","signbit","344","umulh","345","__defineGetter__","./_object-forced-pam","346","347","./_object-to-array","348","getOwnPropertyDescriptors","getDesc","349","__lookupGetter__","350","__lookupSetter__","351","$values","352","OBSERVABLE","cleanupSubscription","subscription","cleanup","subscriptionClosed","_o","closeSubscription","Subscription","observer","subscriber","SubscriptionObserver","unsubscribe","complete","$Observable","subscribe","observable","Observable","353","finally","onFinally","354","try","355","metadata","defineMetadata","metadataKey","metadataValue","./_metadata","356","deleteMetadata","357","Set","ordinaryMetadataKeys","oKeys","pKeys","getMetadataKeys","./es6.set","358","ordinaryGetMetadata","hasOwn","getMetadata","359","getOwnMetadataKeys","360","getOwnMetadata","361","ordinaryHasMetadata","hasMetadata","362","hasOwnMetadata","363","$metadata","364","365","366","367","at","368","getFlags","RegExpProto","$RegExpStringIterator","matchAll","369","$pad","./_string-pad","370","371","372","373","374","375","376","377","378","379","380","TO_STRING_TAG","ArrayValues","DOMIterables","CSSRuleList","CSSStyleDeclaration","CSSValueList","ClientRectList","DOMRectList","DOMStringList","DOMTokenList","DataTransferItemList","FileList","HTMLAllCollection","HTMLCollection","HTMLFormElement","HTMLSelectElement","MediaList","MimeTypeArray","NamedNodeMap","NodeList","PaintRequestList","Plugin","PluginArray","SVGLengthList","SVGNumberList","SVGPathSegList","SVGPointList","SVGStringList","SVGTransformList","SourceBufferList","StyleSheetList","TextTrackCueList","TextTrackList","TouchList","collections","explicit","Collection","381","$task","382","MSIE","time","boundArgs","383","./modules/_core","./modules/es6.array.copy-within","./modules/es6.array.every","./modules/es6.array.fill","./modules/es6.array.filter","./modules/es6.array.find","./modules/es6.array.find-index","./modules/es6.array.for-each","./modules/es6.array.from","./modules/es6.array.index-of","./modules/es6.array.is-array","./modules/es6.array.iterator","./modules/es6.array.join","./modules/es6.array.last-index-of","./modules/es6.array.map","./modules/es6.array.of","./modules/es6.array.reduce","./modules/es6.array.reduce-right","./modules/es6.array.slice","./modules/es6.array.some","./modules/es6.array.sort","./modules/es6.array.species","./modules/es6.date.now","./modules/es6.date.to-iso-string","./modules/es6.date.to-json","./modules/es6.date.to-primitive","./modules/es6.date.to-string","./modules/es6.function.bind","./modules/es6.function.has-instance","./modules/es6.function.name","./modules/es6.map","./modules/es6.math.acosh","./modules/es6.math.asinh","./modules/es6.math.atanh","./modules/es6.math.cbrt","./modules/es6.math.clz32","./modules/es6.math.cosh","./modules/es6.math.expm1","./modules/es6.math.fround","./modules/es6.math.hypot","./modules/es6.math.imul","./modules/es6.math.log10","./modules/es6.math.log1p","./modules/es6.math.log2","./modules/es6.math.sign","./modules/es6.math.sinh","./modules/es6.math.tanh","./modules/es6.math.trunc","./modules/es6.number.constructor","./modules/es6.number.epsilon","./modules/es6.number.is-finite","./modules/es6.number.is-integer","./modules/es6.number.is-nan","./modules/es6.number.is-safe-integer","./modules/es6.number.max-safe-integer","./modules/es6.number.min-safe-integer","./modules/es6.number.parse-float","./modules/es6.number.parse-int","./modules/es6.number.to-fixed","./modules/es6.number.to-precision","./modules/es6.object.assign","./modules/es6.object.create","./modules/es6.object.define-properties","./modules/es6.object.define-property","./modules/es6.object.freeze","./modules/es6.object.get-own-property-descriptor","./modules/es6.object.get-own-property-names","./modules/es6.object.get-prototype-of","./modules/es6.object.is","./modules/es6.object.is-extensible","./modules/es6.object.is-frozen","./modules/es6.object.is-sealed","./modules/es6.object.keys","./modules/es6.object.prevent-extensions","./modules/es6.object.seal","./modules/es6.object.set-prototype-of","./modules/es6.object.to-string","./modules/es6.parse-float","./modules/es6.parse-int","./modules/es6.promise","./modules/es6.reflect.apply","./modules/es6.reflect.construct","./modules/es6.reflect.define-property","./modules/es6.reflect.delete-property","./modules/es6.reflect.enumerate","./modules/es6.reflect.get","./modules/es6.reflect.get-own-property-descriptor","./modules/es6.reflect.get-prototype-of","./modules/es6.reflect.has","./modules/es6.reflect.is-extensible","./modules/es6.reflect.own-keys","./modules/es6.reflect.prevent-extensions","./modules/es6.reflect.set","./modules/es6.reflect.set-prototype-of","./modules/es6.regexp.constructor","./modules/es6.regexp.flags","./modules/es6.regexp.match","./modules/es6.regexp.replace","./modules/es6.regexp.search","./modules/es6.regexp.split","./modules/es6.regexp.to-string","./modules/es6.set","./modules/es6.string.anchor","./modules/es6.string.big","./modules/es6.string.blink","./modules/es6.string.bold","./modules/es6.string.code-point-at","./modules/es6.string.ends-with","./modules/es6.string.fixed","./modules/es6.string.fontcolor","./modules/es6.string.fontsize","./modules/es6.string.from-code-point","./modules/es6.string.includes","./modules/es6.string.italics","./modules/es6.string.iterator","./modules/es6.string.link","./modules/es6.string.raw","./modules/es6.string.repeat","./modules/es6.string.small","./modules/es6.string.starts-with","./modules/es6.string.strike","./modules/es6.string.sub","./modules/es6.string.sup","./modules/es6.string.trim","./modules/es6.symbol","./modules/es6.typed.array-buffer","./modules/es6.typed.data-view","./modules/es6.typed.float32-array","./modules/es6.typed.float64-array","./modules/es6.typed.int16-array","./modules/es6.typed.int32-array","./modules/es6.typed.int8-array","./modules/es6.typed.uint16-array","./modules/es6.typed.uint32-array","./modules/es6.typed.uint8-array","./modules/es6.typed.uint8-clamped-array","./modules/es6.weak-map","./modules/es6.weak-set","./modules/es7.array.flat-map","./modules/es7.array.flatten","./modules/es7.array.includes","./modules/es7.asap","./modules/es7.error.is-error","./modules/es7.global","./modules/es7.map.from","./modules/es7.map.of","./modules/es7.map.to-json","./modules/es7.math.clamp","./modules/es7.math.deg-per-rad","./modules/es7.math.degrees","./modules/es7.math.fscale","./modules/es7.math.iaddh","./modules/es7.math.imulh","./modules/es7.math.isubh","./modules/es7.math.rad-per-deg","./modules/es7.math.radians","./modules/es7.math.scale","./modules/es7.math.signbit","./modules/es7.math.umulh","./modules/es7.object.define-getter","./modules/es7.object.define-setter","./modules/es7.object.entries","./modules/es7.object.get-own-property-descriptors","./modules/es7.object.lookup-getter","./modules/es7.object.lookup-setter","./modules/es7.object.values","./modules/es7.observable","./modules/es7.promise.finally","./modules/es7.promise.try","./modules/es7.reflect.define-metadata","./modules/es7.reflect.delete-metadata","./modules/es7.reflect.get-metadata","./modules/es7.reflect.get-metadata-keys","./modules/es7.reflect.get-own-metadata","./modules/es7.reflect.get-own-metadata-keys","./modules/es7.reflect.has-metadata","./modules/es7.reflect.has-own-metadata","./modules/es7.reflect.metadata","./modules/es7.set.from","./modules/es7.set.of","./modules/es7.set.to-json","./modules/es7.string.at","./modules/es7.string.match-all","./modules/es7.string.pad-end","./modules/es7.string.pad-start","./modules/es7.string.trim-left","./modules/es7.string.trim-right","./modules/es7.symbol.async-iterator","./modules/es7.symbol.observable","./modules/es7.system.global","./modules/es7.weak-map.from","./modules/es7.weak-map.of","./modules/es7.weak-set.from","./modules/es7.weak-set.of","./modules/web.dom.iterable","./modules/web.immediate","./modules/web.timers","384","lib$es6$promise$utils$$objectOrFunction","lib$es6$promise$utils$$isFunction","lib$es6$promise$utils$$isMaybeThenable","lib$es6$promise$asap$$setScheduler","scheduleFn","lib$es6$promise$asap$$customSchedulerFn","lib$es6$promise$asap$$setAsap","asapFn","lib$es6$promise$asap$$asap","lib$es6$promise$asap$$useNextTick","lib$es6$promise$asap$$flush","lib$es6$promise$asap$$useVertxTimer","lib$es6$promise$asap$$vertxNext","lib$es6$promise$asap$$useMutationObserver","iterations","lib$es6$promise$asap$$BrowserMutationObserver","lib$es6$promise$asap$$useMessageChannel","lib$es6$promise$asap$$useSetTimeout","lib$es6$promise$asap$$len","lib$es6$promise$asap$$queue","lib$es6$promise$asap$$attemptVertx","vertx","runOnLoop","runOnContext","lib$es6$promise$$internal$$noop","lib$es6$promise$$internal$$selfFulfillment","lib$es6$promise$$internal$$cannotReturnOwn","lib$es6$promise$$internal$$getThen","lib$es6$promise$$internal$$GET_THEN_ERROR","lib$es6$promise$$internal$$tryThen","fulfillmentHandler","rejectionHandler","lib$es6$promise$$internal$$handleForeignThenable","thenable","sealed","lib$es6$promise$$internal$$resolve","lib$es6$promise$$internal$$fulfill","lib$es6$promise$$internal$$reject","_label","lib$es6$promise$$internal$$handleOwnThenable","_state","lib$es6$promise$$internal$$FULFILLED","_result","lib$es6$promise$$internal$$REJECTED","lib$es6$promise$$internal$$subscribe","lib$es6$promise$$internal$$handleMaybeThenable","maybeThenable","lib$es6$promise$$internal$$publishRejection","_onerror","lib$es6$promise$$internal$$publish","lib$es6$promise$$internal$$PENDING","_subscribers","onFulfillment","onRejection","subscribers","settled","lib$es6$promise$$internal$$invokeCallback","lib$es6$promise$$internal$$ErrorObject","lib$es6$promise$$internal$$tryCatch","lib$es6$promise$$internal$$TRY_CATCH_ERROR","succeeded","failed","hasCallback","lib$es6$promise$$internal$$initializePromise","lib$es6$promise$enumerator$$Enumerator","enumerator","_instanceConstructor","_validateInput","_input","_remaining","_init","_enumerate","_validationError","lib$es6$promise$promise$all$$all","lib$es6$promise$enumerator$$default","lib$es6$promise$promise$race$$race","lib$es6$promise$utils$$isArray","lib$es6$promise$promise$resolve$$resolve","lib$es6$promise$promise$reject$$reject","lib$es6$promise$promise$$needsResolver","lib$es6$promise$promise$$needsNew","lib$es6$promise$promise$$Promise","_id","lib$es6$promise$promise$$counter","lib$es6$promise$polyfill$$polyfill","local","cast","lib$es6$promise$promise$$default","lib$es6$promise$utils$$_isArray","lib$es6$promise$asap$$scheduleFlush","lib$es6$promise$asap$$browserWindow","lib$es6$promise$asap$$browserGlobal","lib$es6$promise$asap$$isNode","lib$es6$promise$asap$$isWorker","Uint8ClampedArray","_eachEntry","_settledAt","_willSettleAt","lib$es6$promise$promise$all$$default","lib$es6$promise$promise$race$$default","lib$es6$promise$promise$resolve$$default","lib$es6$promise$promise$reject$$default","_setScheduler","_setAsap","_asap","lib$es6$promise$polyfill$$default","lib$es6$promise$umd$$ES6Promise","polyfill","_process","385","ZStream","Inflate","was","InfBlocks","checkfn","hufts","MANY","mode","IB_TYPE","blens","codes","InfCodes","bitk","bitb","read","inftree","InfTree","inflate_trees_fixed","td","fixed_bl","fixed_bd","fixed_tl","fixed_td","Z_OK","dest","arrayCopy_fast","hasSubarray","arrayCopy_slow","afterUncOffset","inflateInit","DEF_WBITS","next_in","next_in_index","avail_in","obuf","next_out","next_out_index","avail_out","inflate","Z_NO_FLUSH","Z_STREAM_END","Z_BUF_ERROR","newob","MAX_WBITS","BMAX","PRESET_DICT","Z_FINISH","Z_DEFLATED","Z_NEED_DICT","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","METHOD","FLAG","DICT4","DICT3","DICT2","DICT1","DICT0","BLOCKS","CHECK4","CHECK3","CHECK2","CHECK1","DONE","BAD","inflate_mask","IB_LENS","IB_STORED","IB_TABLE","IB_BTREE","IB_DTREE","IB_CODES","IB_DRY","IB_DONE","IB_BAD","cplens","cplext","cpdist","cpdext","istate","inflateEnd","inflateSync","inflateSetDictionary","dictionary","dictLength","inflateReset","total_in","total_out","free","wbits","marker","need","adler","proc","_adler","adler32","set_dictionary","mark","inflateSyncPoint","sync_point","INFBLOCKS_BORDER","inflate_flush","inflate_trees_bits","inflate_trees_dynamic","IC_START","IC_LEN","IC_LENEXT","IC_DIST","IC_DISTEXT","IC_COPY","IC_LIT","IC_WASH","IC_END","IC_BADCODE","tl_index","td_index","lbits","dbits","ltree","ltree_index","dtree","dtree_index","tree","tindex","inflate_fast","tree_index","lit","dist","tp","tp_index","ml","md","tp_index_t_3","huft_build","bindex","hp","hn","mask","xp","initWorkArea","nd","vsize","testArray","386","defaultSetTimout","defaultClearTimeout","runTimeout","fun","cachedSetTimeout","runClearTimeout","cachedClearTimeout","cleanUpNextTick","draining","currentQueue","queueIndex","drainQueue","Item","array","noop","env","argv","versions","on","once","off","removeAllListeners","prependListener","prependOnceListener","binding","cwd","chdir","umask","387","__","@@functional/placeholder","_arity","a0","a3","a4","a5","a6","a7","a8","a9","_arrayFromIterator","_arrayOf","_cloneRegExp","pattern","_complement","_concat","set1","set2","len1","len2","_containsWith","pred","_filter","_forceReduced","@@transducer/value","@@transducer/reduced","_functionName","_has","prop","_identity","_isArguments","_isArray","_isFunction","_isInteger","_isNumber","_isObject","_isPlaceholder","_isRegExp","_isString","_isTransformer","_map","functor","_objectAssign","nextKey","_of","_pipe","_pipeP","_quote","escaped","_reduced","_slice","_toISOString","pad","_xfBase","xf","_xwrap","XWrap","_aperture","_assign","_checkForMethod","methodname","_curry1","_curry2","_curry3","f3","_curryN","received","combined","argsIdx","combinedIdx","_dispatchable","transducer","_dropLastWhile","_xall","XAll","_xany","XAny","any","_xaperture","XAperture","full","getCopy","_xdrop","XDrop","_xdropLast","XDropLast","_xdropRepeatsWith","XDropRepeatsWith","lastValue","seenFirstValue","sameAsLast","_xdropWhile","XDropWhile","_xfilter","XFilter","_xfind","XFind","_xfindIndex","XFindIndex","_xfindLast","XFindLast","_xfindLastIndex","XFindLastIndex","lastIdx","_xmap","XMap","_xtake","XTake","_xtakeWhile","XTakeWhile","adjust","_idx","always","and","aperture","append","assoc","assocPath","thisObj","comparator","curryN","dec","differenceWith","second","firstLen","dissoc","dissocPath","tail","dropWhile","evolve","transformations","transformation","findLast","findLastIndex","fromPairs","pairs","groupWith","nextidx","gte","hasIn","identical","identity","ifElse","condition","onTrue","onFalse","insert","elt","insertAll","elts","intersperse","Ctor","isArrayLike","isNil","hasEnumBug","nonEnumerableProps","hasArgsEnumBug","item","nIdx","ks","checkArgsLength","keysIn","lte","mapAccum","tuple","mapAccumRight","mathMod","maxBy","mergeAll","mergeWithKey","minBy","modulo","nAry","negate","none","not","nth","nthArg","objOf","called","over","Identity","lens","pair","fst","snd","paths","pathOr","pathSatisfies","propPath","pickAll","pickBy","prepend","propOr","propSatisfies","ps","reduced","regex","replacement","scan","sortBy","splitAt","splitEvery","splitWhen","subtract","take","xs","takeLastWhile","takeWhile","tap","times","toPairs","toPairsIn","transpose","outerlist","innerlist","zeroWidth","hasProtoTrim","beginRx","endRx","tryCatch","tryer","catcher","unapply","unary","uncurryN","endIdx","currentDepth","unfold","uniqWith","unless","whenFalseFn","until","useWith","transformers","vals","valuesIn","Const","when","whenTrueFn","where","spec","testObj","xprod","ilen","jlen","zip","rv","zipObj","zipWith","_clone","refFrom","refTo","deep","copy","copiedValue","_createPartialApplicator","_dropLast","_equals","stackA","stackB","keysA","pop","_makeFlat","recursive","flatt","_reduce","_arrayReduce","_iterableReduce","_methodReduce","symIterator","_stepCat","_stepCatArray","@@transducer/init","@@transducer/step","@@transducer/result","_stepCatString","_stepCatObject","_xdropLastWhile","XDropLastWhile","retained","retain","_xgroupBy","XGroupBy","inputs","addIndex","origFn","binary","clone","curry","drop","dropLast","dropLastWhile","filterable","flip","intersectionWith","list1","list2","lookupList","filteredList","results","into","invert","invertObj","isEmpty","mapObjIndexed","mergeWith","partial","partialRight","pathEq","_path","pluck","project","propEq","propIs","reduceBy","valueFn","valueAcc","keyFn","takeLast","transduce","unionWith","whereEq","_flatCat","preservingReduced","rxf","_indexOf","inf","_xchain","allPass","preds","allUniq","anyPass","ap","applicative","applySpec","monad","cond","arity","constructN","Fn","$0","$1","$2","$3","$4","$5","$6","$7","$8","$9","converge","after","countBy","elem","dropRepeatsWith","eqBy","eqProps","obj1","obj2","groupBy","indexBy","juxt","toFunctorFn","lensIndex","lensPath","lensProp","liftN","lifted","mean","median","partition","pipeP","product","traversable","traverse","unnest","_contains","_toString","seen","recur","mapPairs","repr","compose","composeK","composeP","difference","dropRepeats","lift","omit","pipeK","without","_Set","_nativeSet","_items","hasOrAdd","shouldAdd","prevSize","newSize","bIdx","both","complement","either","invoker","memoize","cache","toLower","toUpper","uniqBy","appliedItem","symmetricDifference","symmetricDifferenceWith","uniq","amd","388","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","Context","_invoke","makeInvokeMethod","GeneratorFunction","GeneratorFunctionPrototype","defineIteratorMethods","AsyncIterator","__await","unwrapped","enqueue","callInvokeWithMethodAndArg","previousPromise","GenStateSuspendedStart","GenStateExecuting","GenStateCompleted","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","GenStateSuspendedYield","resultName","nextLoc","pushTryEntry","locs","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","iteratorMethod","iteratorSymbol","Op","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","toStringTag","inModule","runtime","regeneratorRuntime","NativeIteratorPrototype","Gp","displayName","isGeneratorFunction","genFun","ctor","awrap","skipTempReset","rootEntry","rootRecord","rval","exception","handle","caught","hasCatch","hasFinally","finallyEntry","finish","thrown","delegateYield"],"mappings":"CAAA,QAAAA,GAAAC,EAAAC,EAAAC,GAAA,QAAAC,GAAAC,EAAAC,GAAA,IAAAJ,EAAAG,GAAA,CAAA,IAAAJ,EAAAI,GAAA,CAAA,GAAAE,GAAA,kBAAAC,UAAAA,OAAA,KAAAF,GAAAC,EAAA,MAAAA,GAAAF,GAAA,EAAA,IAAAI,EAAA,MAAAA,GAAAJ,GAAA,EAAA,IAAAK,GAAA,GAAAC,OAAA,uBAAAN,EAAA,IAAA,MAAAK,GAAAE,KAAA,mBAAAF,EAAA,GAAAG,GAAAX,EAAAG,IAAAS,WAAAb,GAAAI,GAAA,GAAAU,KAAAF,EAAAC,QAAA,SAAAd,GAAA,GAAAE,GAAAD,EAAAI,GAAA,GAAAL,EAAA,OAAAI,GAAAF,EAAAA,EAAAF,IAAAa,EAAAA,EAAAC,QAAAd,EAAAC,EAAAC,EAAAC,GAAA,MAAAD,GAAAG,GAAAS,QAAA,IAAA,GAAAL,GAAA,kBAAAD,UAAAA,QAAAH,EAAA,EAAAA,EAAAF,EAAAa,OAAAX,IAAAD,EAAAD,EAAAE,GAAA,OAAAD,KAAAa,GAAA,SAAAT,EAAAU,EAAAJ,GCSA,YAyCA,SAASK,MAMT,QAASC,GAAiBC,EAAOC,GAC7B,GAAIC,GAAID,EACJE,EAAOC,EAAQJ,EAAOE,EAAIA,IAAK,CACnC,KAAK,GAAIG,GAAI,EAAOF,EAAJE,IAAYA,EAAG,CAC3B,GACIC,IADMF,EAAQJ,EAAOE,GACbE,EAAQJ,EAAOE,EAAE,GAC7BA,IAAK,EAAa,GAARI,EAEd,GAAIC,GAAQH,EAAQJ,EAAOE,EAAIA,IAAK,CAIpC,KAAK,GAFDM,GAAgB,IAChBC,EAAIP,EACCd,EAAI,EAAOmB,EAAJnB,IAAaA,EAAG,CAC5B,GAAIsB,GAAIC,EAAQX,EAAOS,EACvB,IAD2BA,GAAK,EAC5BC,EAAG,CACH,GAAIE,GAAKF,EAAEG,KACPH,GAAET,OAAS,IACXW,GAAM,OAEDJ,EAALI,IACAJ,EAAgBI,EACpB,QAKR,MAFAV,IAAc,EAARK,GAGFC,cAAeA,EACfL,KAAMA,EACNR,OAAQO,EAAID,GAKpB,QAASa,GAAQC,EAAMC,EAAKC,EAAaC,EAAUC,GAE/CJ,EAAKK,MAAM,EAAG,IAAIC,MAAM,SAASC,GAC7B,MAAIA,GACOC,EAASR,EAAMC,EAAKC,EAAaC,EAAUC,GAE3CD,EAAS,KAAM,0BAE1BM,QAAS,MAGjB,QAASD,GAASR,EAAMC,EAAKC,EAAaC,EAAUC,GAShD,QAASM,GAAe3C,GACpB,IAAKA,EACD,MAAOoC,GAAS,KAAM,sBAG1B,IAAIQ,GAAMC,EAAO7C,EAAGA,EAAE8C,YAClB5B,EAAQ,GAAI6B,YAAWH,GAEvBI,EAAQ1B,EAAQJ,EAAO,EAC3B,IAAI8B,GAASC,EACT,MAAOb,GAAS,KAAM,2BAA6BY,EAAME,SAAS,IAItE,KAAK,GAFDC,GAAU7B,EAAQJ,EAAO,GACzBsB,EAAS,GACJlC,EAAI,EAAO6C,EAAJ7C,IAAeA,EAC3BkC,GAAUY,OAAOC,aAAanC,EAAMZ,EAAI,GAG5C,IAAIgD,GAAOhC,EAAQJ,EAAOiC,EAAU,GAChC/B,EAAI+B,EAAU,EAElBI,GAAIC,cACJD,EAAIE,aACJ,KAAK,GAAInD,GAAI,EAAOgD,EAAJhD,IAAYA,EAAG,CAG3B,IAAK,GAFDoD,GAAQpC,EAAQJ,EAAOE,GACvBuC,EAAO,GACFC,EAAI,EAAOF,EAAM,EAAVE,IAAeA,EAC3BD,GAAQP,OAAOC,aAAanC,EAAME,EAAI,EAAIwC,GAEnCtC,GAAQJ,EAAOE,EAAIsC,EAAQ,EACtCH,GAAIC,WAAWG,GAAQrD,EACI,GAAvBqD,EAAKE,QAAQ,OACbN,EAAIC,WAAWG,EAAKG,UAAU,IAAMxD,EAEpCiD,EAAIC,WAAW,MAAQG,GAAQrD,EAEnCiD,EAAIE,WAAWM,KAAKJ,GAEpBvC,EAAIA,EAAI,EAAIsC,EAGhB,MAAIH,GAAIS,QACG5B,EAASmB,GADpB,OAKJ,QAASU,GAASzB,GACd,IAAKA,EACD,MAAO,qBAGX,IAAItB,GAAQ,GAAI6B,YAAWP,GACvB0B,EAAW5C,EAAQJ,EAAO,EAC9B,IAAIgD,GAAYC,EACZ,MAAO/B,GAAS,KAAM,2BAA6B8B,EAAShB,SAAS,IAGzE,IAAIkB,GAAO9C,EAAQJ,EAAO,EAE1BqC,GAAIS,UAGJ,KAAK,GADD5C,GAAI,EACCiD,EAAM,EAASD,EAANC,IAAcA,EAAK,CACjC,GAAIC,GAAalD,EACblB,EAAIe,EAAiBC,EAAOoD,EAChClD,IAAKlB,EAAEW,OAEPa,EAAgB6C,KAAKC,IAAItE,EAAEwB,cAAeA,EAE1C,IAAIL,GAAOnB,EAAEmB,IAETA,GAAO,IACPkC,EAAIS,QAAQK,GAAO,GAAItB,YAAWP,EAAQ8B,EAAYlD,EAAIkD,IAIlE,OAAO,EApFX,GAAIf,GAAM,GAAIvC,EACduC,GAAItB,KAAOA,EACXsB,EAAIrB,IAAMA,EACVqB,EAAIpB,YAAcA,CAElB,IAAIT,GAAgB6B,EAAIpB,YAAcoB,EAAIpB,YAAYT,cAAgB,GAkFtE,IAAK6B,EAAIpB,YAmBF,CACH,GAAIsC,GAASlB,EAAIpB,YAAYsC,MAC7BlB,GAAIS,UACJ,KAAK,GAAI1D,GAAI,EAAGA,EAAImE,EAAO5D,OAAQP,IAChCiD,EAAIS,QAAQ1D,GAAK,IAEpBiD,GAAItB,KAAKK,MAAM,EAAGZ,GAAea,MAAMI,OAxBvCY,GAAIrB,IAAIK,MAAM,SAASC,GACnB,GAAIkC,GAAST,EAASzB,EAClBkC,MAAW,EACPnB,EAAIrB,IAAIyC,KAA6B,mBAAftC,IAEtBkB,EAAIrB,IAAIyC,IAAMpB,EAAItB,KAAK0C,IAAIC,QAAQ,GAAIC,QAAO,SAAU,QAGxDpC,EAASR,EAAMsB,EAAIrB,IAAKC,EAAaC,GAAU,IAI/CA,EAAS,KAAMsC,GAGrBnB,EAAItB,KAAKK,MAAM,EAAGZ,GAAea,MAAMI,KAyKrD,QAASmC,MA3WT,GAAwB,mBAAbzE,GACP,GAAI0E,GAAQ1E,EAAQ,WAKhB2E,GAJQD,EAAME,MACNF,EAAMG,MACCH,EAAMI,aAEf9E,EAAQ,UACdiB,EAAU0D,EAAI1D,QACd8D,EAAYJ,EAAII,UAChBC,EAAWL,EAAIK,SAEfC,GADYN,EAAIO,UACJP,EAAIM,WAEhBE,EAAWnF,EAAQ,cACnBwB,EAAU2D,EAAS3D,QACnBgB,EAAS2C,EAAS3C,OAClB4C,EAAWD,EAASC,SACpBC,EAAQF,EAASE,KAIzB,IAAIzC,GAAY,SACZkB,EAAY,SAEZwB,GACAC,kBAAyB,EACzBC,mBAAyB,EACzBC,iBAAyB,EACzBC,sBAAyB,EACzBC,mBAAyB,GACzBC,wBAAyB,GACzBC,cAAyB,GACzBC,aAAyB,IACzBC,oBAAyB,IACzBC,QAAyB,IACzBC,UAAyB,KACzBC,cAAyB,KA6K7BvF,GAAQwF,UAAUC,eAAiB,SAASC,EAAOlC,EAAKmC,GACpD,GAAIC,GAAQC,KAAK7C,QAAQ0C,EACzB,KAAKE,EACD,QAKJ,KAAK,GAFDE,GAAWrB,EAASjB,EAAKmC,GACzBI,KACKzG,EAAI,EAAGA,EAAIwG,EAASjG,SAAUP,EACnCyG,EAAQD,EAASxG,KAAM,CAM3B,KAAK,GAJD0G,MAAiBC,KAEjB5F,EAAOC,EAAQsF,EAAO,GACtBxF,EAAI,EACCG,EAAI,EAAOF,EAAJE,IAAYA,EAAG,CAC3B,GAAIyD,GAAM1D,EAAQsF,EAAOxF,GACrBI,EAAQF,EAAQsF,EAAOxF,EAAE,EAG7B,IADAA,GAAK,EACD2F,EAAQ/B,GACR,IAAK,GAAIkC,GAAI,EAAO1F,EAAJ0F,IAAaA,EAAG,CAC5B,GAAIC,GAAKtF,EAAQ+E,EAAOxF,GACpBgG,EAAKvF,EAAQ+E,EAAOxF,EAAI,IACrB,KAAN4D,EAAaiC,EAAcD,GAAYjD,KAAK,GAAI2B,GAAMyB,EAAIC,IAC3DhG,GAAK,OAGTA,IAAe,GAARI,EAUf,IAAK,GAJDC,GAAQH,EAAQsF,EAAOxF,GAEvBiG,EAAS,KACTC,EAAS/C,KAAKC,IAAIA,GAAK,GAAI/C,EAAQ,GAAI8F,EAAShD,KAAKC,IAAImC,GAAK,GAAIlF,EAAQ,GACrEnB,EAAIgH,EAAaC,GAALjH,IAAeA,EAAG,CACnC,GAAIkH,GAAM3F,EAAQ+E,EAAOxF,EAAI,EAAS,EAAJd,EAC7BkH,MAGAH,GAAUG,EAAGzF,MAAQsF,EAAOtF,OAAUyF,EAAGzF,OAASsF,EAAOtF,OAASyF,EAAGrG,OAASkG,EAAOlG,UACtFkG,EAASG,GAKjB,GAAIC,KACJ,IAAc,MAAVJ,EACA,IAAK,GAAI/G,GAAI,EAAGA,EAAI2G,EAAYpG,SAAUP,EAAG,CACzC,GAAIoH,GAAOT,EAAY3G,IACnBoH,EAAKC,KAAK5F,MAAQsF,EAAOtF,OAAU2F,EAAKC,KAAK5F,OAASsF,EAAOtF,OAAS2F,EAAKC,KAAKxG,QAAUkG,EAAOlG,SACjGsG,EAAkB1D,KAAK2D,GAKnCT,EAAcQ,CAGd,KAAK,GADDG,MACKtH,EAAI,EAAGA,EAAI2G,EAAYpG,SAAUP,EACtCsH,EAAU7D,KAAKkD,EAAY3G,GAE/B,KAAK,GAAIA,GAAI,EAAGA,EAAI0G,EAAWnG,SAAUP,EACrCsH,EAAU7D,KAAKiD,EAAW1G,GAG9BsH,GAAUC,KAAK,SAASC,EAAIC,GACxB,GAAIC,GAAMF,EAAGG,KAAKlG,MAAQgG,EAAGE,KAAKlG,KAClC,OAAW,IAAPiG,EACOA,EAEAF,EAAGG,KAAK9G,OAAS4G,EAAGE,KAAK9G,QAGxC,IAAI+G,KACJ,IAAIN,EAAU/G,OAAS,EAAG,CAEtB,IAAK,GADDsH,GAAMP,EAAU,GACXtH,EAAI,EAAGA,EAAIsH,EAAU/G,SAAUP,EAAG,CACvC,GAAI8H,GAAKR,EAAUtH,EACf8H,GAAGH,KAAKlG,OAASoG,EAAIR,KAAK5F,MAC1BoG,EAAM,GAAIzC,GAAMyC,EAAIF,KAAMG,EAAGT,OAE7BO,EAAanE,KAAKoE,GAClBA,EAAMC,GAGdF,EAAanE,KAAKoE,GAItB,MAAOD,IAGXlH,EAAQwF,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKvE,EAAUkG,GA6BxD,QAASC,KACL,GAAI3B,GAASnC,EAAO5D,OAChB,MAAOuB,GAASoG,EACb,IAAKvG,EASL,CACH,GAAIwG,GAAK,GAAI1F,YAAWd,GACpByG,EAAWC,EAAMC,eAAeH,EAAIhE,EAAOmC,GAAOqB,KAAK9G,OAAQqH,EAAShE,EAAKmC,EAAKkC,EAAOP,EAG7F,OAFArG,GAAO,OACL2E,EACE8B,EACOtG,EAASoG,GAETD,IAhBX,GAAIrB,GAAIzC,EAAOmC,GACXkC,EAAW5B,EAAEe,KAAKlG,MAClBgH,EAAW7B,EAAES,KAAK5F,MAAP,KAEf4G,GAAM1G,KAAKK,MAAMwG,EAAUC,EAAWD,GAAUvG,MAAM,SAASvC,GAE3D,MADAiC,GAAOY,EAAO7C,EAAGkH,EAAES,KAAK5F,MAAQmF,EAAEe,KAAKlG,MAAQ,GACxCwG,MAtCnB,GAAII,GAAQ9B,IACZyB,GAAOA,KAEP,IACI7D,GADAoE,EAAQhC,KAAKrD,WAAW6E,EAE5B,IAAcW,SAAVH,EACApE,SACG,CAEH,GAA4B,OAAxBoC,KAAK7C,QAAQ6E,IAAmBhC,KAAK1E,YAAYsC,OAAOoE,GAAQ,CAChE,GAAII,GAAapC,KAAK1E,YAAYsC,OAAOoE,EACzC,OAAOhC,MAAK3E,IAAII,MAAM2G,EAAW,GAAIA,EAAW,IAAI1G,MAAM,SAASN,GAC/D,GAAIiH,GAAS,GAAInG,YAAWd,EAE5B,OADA4E,MAAK7C,QAAQ6E,GAASK,EACfrC,KAAKtE,MAAM8F,EAAK7D,EAAKmC,EAAKvE,EAAUkG,IAC7Ca,KAAKtC,OAGXpC,EAASoC,KAAKJ,eAAeoC,EAAOrE,EAAKmC,GACpClC,GACDrC,EAAS,KAAM,wBAIvB,GAEIH,GAFAuG,KACA5B,EAAQ,CA0BZ2B,KAGJ,IAAIa,IAAkB,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAC7FC,GAAiB,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAKhGrI,GAAQwF,UAAUoC,eAAiB,SAASH,EAAItH,EAAQmI,EAAM9E,EAAKmC,EAAKkC,EAAOP,GAC3E,OAAa,CACT,GAAIiB,GAAYjI,EAAQmH,EAAItH,GACxBqI,EAAWrI,EAASoI,EAAY,CACpC,IAAIC,EAAWf,EAAG5H,OACd,OAAO,CAGX,IAAI4I,GAAS,GAAI3E,GAEb4E,EAAQpI,EAAQmH,EAAItH,EAAS,GAC7BwI,EAAMrI,EAAQmH,EAAItH,EAAS,GAE3ByI,EAAMtI,EAAQmH,EAAItH,EAAS,IAE3B0I,GAAY,MAAND,IAAiB,EACvBE,EAAW,IAANF,EAELG,EAAUzI,EAAQmH,EAAItH,EAAS,IAC/B6I,GAAkB,WAAVD,IAAyB,GACjC3B,EAAe,MAAV2B,EAELE,EAAO3I,EAAQmH,EAAItH,EAAS,IAE5B+I,EAAW5I,EAAQmH,EAAItH,EAAS,IAChCgJ,EAAU7I,EAAQmH,EAAItH,EAAS,GAExBG,GAAQmH,EAAItH,EAAS,GAShC,IAPAsI,EAAOW,QAAUvD,KAAKpD,WAAWiG,GACjCD,EAAOO,KAAOA,EACdP,EAAOE,IAAMA,EACbF,EAAOI,GAAKA,EACRvB,EAAK+B,QACLZ,EAAOa,UAAYL,IAElB3B,EAAK+B,OAAS/B,EAAKiC,YAAa,CAEjC,IAAK,GADDC,GAAW,GACN5G,EAAI,EAAOkG,EAAG,EAAPlG,IAAYA,EACxB4G,GAAYpH,OAAOC,aAAaoF,EAAGtH,EAAS,GAAKyC,GAErD6F,GAAOe,SAAWA,EAGtB,IAAKlC,EAAK+B,MAAO,CACTH,GAAW,IACXT,EAAOgB,YAAc5D,KAAKpD,WAAWyG,GACrCT,EAAOU,QAAUA,EAMrB,KAAK,GAHD/I,GAAID,EAAS,GAAK2I,EAElBY,EAAQ,GACHxD,EAAI,EAAOkB,EAAJlB,IAAUA,EAAG,CACzB,GAAIyD,GAAQrJ,EAAQmH,EAAIrH,EACxBsJ,GAAQA,GAASC,GAAO,GAAKtB,EAAsB,GAARsB,GAC3CvJ,GAAK,EAETqI,EAAOiB,MAAQA,CAIf,KAAK,GAFDE,GAAM,GACNC,EAAYZ,EAAO,GAAM,EACpBrG,EAAI,EAAOiH,EAAJjH,IAAgBA,EAAG,CAC/B,GAAIkH,GAAKrC,EAAGrH,EAAIwC,EAChBgH,IAAOxB,GAAqB,IAAL0B,IAAc,GACjCF,EAAI/J,OAASoJ,IACbW,GAAOxB,EAAqB,GAAL0B,IAE/B1J,GAAKyJ,EACLpB,EAAOmB,IAAMA,CAGb,KAAK,GADDG,GAAO,GACFnH,EAAI,EAAOqG,EAAJrG,IAAYA,EACxBmH,GAAQ3H,OAAOC,aAAaoF,EAAGrH,EAAIwC,GAAK,GAK5C,KAHAxC,GAAK6I,EACLR,EAAOuB,MAAQD,EAEJvB,EAAJpI,GAAc,CACjB,GAEI6J,GAFAC,EAAM9H,OAAOC,aAAaoF,EAAGrH,GAAIqH,EAAGrH,EAAI,IACxC+J,EAAO/H,OAAOC,aAAaoF,EAAGrH,EAAI,GAGtC,IAAY,KAAR+J,EACAF,EAAQ7H,OAAOC,aAAaoF,EAAGrH,EAAI,IACnCA,GAAK,MACF,IAAY,KAAR+J,GAAuB,KAARA,EACtBF,EAAQ3J,EAAQmH,EAAIrH,EAAI,GACxBA,GAAK,MACF,IAAY,KAAR+J,GAAuB,KAARA,EACtBF,EAAQxC,EAAGrH,EAAI,GACfA,GAAK,MACF,IAAY,KAAR+J,GAAuB,KAARA,EACtBF,EAAQ7F,EAAUqD,EAAIrH,EAAI,GAC1BA,GAAK,MACF,IAAY,KAAR+J,EACPF,EAAQ3F,EAAUmD,EAAIrH,EAAI,GAC1BA,GAAK,MACF,IAAY,KAAR+J,GAAuB,KAARA,EAGtB,IAFA/J,GAAK,EACL6J,EAAQ,KACC,CACL,GAAIG,GAAK3C,EAAGrH,IACZ,IAAU,GAANgK,EACA,KAEAH,IAAS7H,OAAOC,aAAa+H,OAGlC,CAAA,GAAY,KAARD,EA4BP,KAAM,gBAAiBA,CA3BvB,IAEIE,GACAC,EAHAC,EAAQnI,OAAOC,aAAaoF,EAAGrH,EAAI,IACnCoK,EAAOlK,EAAQmH,EAAIrH,EAAI,EAG3B,IAAa,KAATmK,GAAyB,KAATA,GAAyB,KAATA,EAChCF,EAAO,EAEHC,EADS,KAATC,EACSjG,EAEAhE,MACV,IAAa,KAATiK,GAAyB,KAATA,EACvBF,EAAO,EACPC,EAASlG,MACN,CAAA,GAAa,KAATmG,GAAyB,KAATA,EAIvB,KAAM,sBAAwBA,CAH9BF,GAAO,EACPC,EAASjG,EAKbjE,GAAK,EACL6J,IACA,KAAK,GAAI3K,GAAI,EAAOkL,EAAJlL,IAAYA,EACxB2K,EAAMlH,KAAKuH,EAAO7C,EAAIrH,IACtBA,GAAKiK,EAKb5B,EAAOyB,GAAOD,GAStB,KALKzG,GAAOiF,EAAOE,KAAOhD,GAAO8C,EAAOE,IAAMM,GAAQzF,KACpCwE,SAAVH,GAAuBa,GAASb,IAChCS,EAAKvF,KAAK0F,GAGdA,EAAOE,IAAMhD,EACb,OAAO,CAEXxF,GAASqI,IAMM,mBAAZzI,KACPA,EAAOJ,SACHqB,QAASA,EACTiB,UAAWA,EACXkB,UAAWA,EACXwB,SAAUA,MCTf8F,QAAQ,EAAEC,aAAa,GAAGC,UAAU,KAAKC,GAAG,SAASvL,EAAQU,EAAOJ,GCzgBvE,YAsBA,SAASkL,GAAaV,GAClBtE,KAAKsE,KAAOA,EAchB,QAASW,GAAgBC,EAAQzC,GAC7BzC,KAAKkF,OAASA,EACdlF,KAAKyC,KAAOA,EAoHhB,QAAS0C,GAAgBD,EAAQzC,GAC7BzC,KAAKkF,OAASA,EACdlF,KAAKyC,KAAOA,EACZzC,KAAKoF,SAAW,KA5JpB,GAAwB,mBAAb5L,GACP,GAAI0E,GAAQ1E,EAAQ,WAChB4E,EAAQF,EAAME,MACdC,EAAQH,EAAMG,MACdC,EAAeJ,EAAMI,aAErB+G,EAAK7L,EAAQ,oBACb8L,EAAkCD,EAAGE,sBAErCC,EAAMhM,EAAQ,SACdiM,EAAgBD,EAAIC,cACpBC,EAAWF,EAAIE,SAEfC,GADaH,EAAII,WACNJ,EAAIG,UAEfE,EAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,WAQ5Bd,GAAarF,UAAUoG,cAAgB,SAAStD,GAC5C,MAAiB,OAAbzC,KAAKsE,KACE,GAAIa,GAAgBnF,KAAMyC,GAE1B,GAAIwC,GAAgBjF,KAAMyC,GAGzC,IAAIuD,GAAY,eACZC,EAAe,KACfC,EAAmB,GAAIlI,QAAO,wBAOlCiH,GAAgBtF,UAAUwG,MAAQ,SAASC,GACvC,GAAIC,GAAOD,EAAKE,MAAML,EACtB,MAAII,EAAKrM,OAAS,GAAlB,CAGA,GAAIuM,GAAQC,SAASH,EAAK,IAAM,EAC5BI,EAAMD,SAASH,EAAK,IAEpB3M,GAAK6J,QAAS8C,EAAK,GACd1I,IAAK4I,EACLzG,IAAK2G,EAcd,IAZIJ,EAAKrM,OAAS,GAAiB,MAAZqM,EAAK,KACxB3M,EAAEgN,MAAQL,EAAK,IAGfA,EAAKrM,OAAS,IACdN,EAAEiN,MAAQC,WAAWP,EAAK,KAG1BA,EAAKrM,OAAS,IACdN,EAAEmN,YAAcR,EAAK,IAGrBA,EAAKrM,OAAS,EAAG,CACjB,GAAI8M,GAAQT,EAAK,EACbH,GAAiBa,KAAKD,KACtBpN,EAAEsN,QAAU,OAASF,EAAQ,KAIrC,GAAIT,EAAKrM,QAAU,GAAI,CACnB,GAAIiN,GAAaT,SAASH,EAAK,IAC3Ba,EAAaV,SAASH,EAAK,IAC3Bc,EAAaX,SAASH,EAAK,IAC3Be,EAAaf,EAAK,IAAIC,MAAM,KAAKe,IAAI,SAASC,GAAI,MAAOd,UAASc,KAClEC,EAAclB,EAAK,IAAIC,MAAM,KAAKe,IAAI,SAASC,GAAI,MAAOd,UAASc,IAEvE5N,GAAE4K,KAAO,YACT,IAAIkD,GAAM,GAAI7B,EAMd,IALA6B,EAAIC,GAAKpB,EAAK,GACdmB,EAAIlD,KAAO,aACXkD,EAAIE,SACJhO,EAAEiO,QAAUH,GAERnB,EAAKrM,OAAS,GAAI,CAClB,GAAI4N,GAASvB,EAAK,IACdwB,EAAWD,CACXvB,GAAKrM,OAAS,KACd6N,EAAWxB,EAAK,IAEpB,IAAIyB,GAAK,GAAInC,EACbmC,GAAGL,GAAKG,EACRE,EAAGpB,MAAQmB,EACXC,EAAGxD,KAAO,OACV5K,EAAEiO,OAAOzK,KAAK4K,GAIlB,IAAK,GADD5J,GAAQ,KACHxD,EAAI,EAAOyM,EAAJzM,IAAkBA,EAAG,CACjC,GAAIqN,GAAOR,EAAY7M,GAAK6L,EACxByB,EAAOD,EAAOX,EAAW1M,GACzBuN,EAAO,GAAI7J,GAAM2J,EAAMC,EAEvB9J,GADAA,EACQG,EAAMH,EAAO+J,GAEbA,EAKhB,IAAK,GADDC,GAAShK,EAAMiK,SACV/O,EAAI,EAAGA,EAAI8O,EAAOlO,SAAUZ,EAAG,CACpC,GAAIgP,GAAKF,EAAO9O,GACZiP,EAAKvC,EAAYpM,EACrB2O,GAAG1K,IAAMyK,EAAGzK,MACZ0K,EAAGvI,IAAMsI,EAAGtI,MACZE,KAAKyC,KAAK4F,GAGd,GAAInB,EAAWD,EAAY,CACvB,GAAIqB,GAAiC,KAAjB5O,EAAEmN,YAClB,GAAIzI,GAAM6I,EAAYC,EAAW,GACjC,GAAI9I,GAAM6I,EAAa,EAAGC,GAG1BqB,EAAKjK,EAAaJ,EAAOoK,EAC7B,IAAIC,EAAI,CACJ7O,EAAE4K,KAAO,aAGT,KAAK,GAFDkE,GAASD,EAAGJ,SACZM,EAAe,EACVrP,EAAI,EAAGA,EAAIoP,EAAOxO,SAAUZ,EAAG,CAEpC,GAAI2G,GAAQ3G,CACS,MAAjBM,EAAEmN,cACF9G,EAAQyI,EAAOxO,OAASZ,EAAI,EAChC,IAAIgP,GAAKI,EAAOzI,GACZsI,EAAKvC,EAAYpM,EACrB2O,GAAG1K,IAAMyK,EAAGzK,MACZ0K,EAAGvI,IAAMsI,EAAGtI,MACZpG,EAAEgP,UAAYD,CACd,IAAIzO,GAASoO,EAAGtI,MAAQsI,EAAGzK,KAC3B8K,IAAgBA,EAAezO,GAAU,EACzCgG,KAAKyC,KAAK4F,UAKtBrI,MAAKyC,KAAK/I,KAIlBuL,EAAgBtF,UAAUgJ,MAAQ,aAQlCxD,EAAgBxF,UAAUwG,MAAQ,SAASC,GACvC,GAAIC,GAAOD,EAAKE,MAAML,EAEtB,IAAe,aAAXI,EAAK,GAAmB,CACxBrG,KAAKoF,SAAW,YAChBpF,KAAKwB,IAAMxB,KAAK8C,IAAM9C,KAAK4I,KAAO,KAClC5I,KAAKiI,KAAO,CAEZ,KAAK,GAAIY,GAAK,EAAGA,EAAKxC,EAAKrM,SAAU6O,EAAI,CACrC,GAAIC,GAAI9C,EAAY+C,KAAK1C,EAAKwC,GAC1BC,KACY,SAARA,EAAE,GACF9I,KAAKwB,IAAMsH,EAAE,GACE,SAARA,EAAE,GACT9I,KAAK8C,IAAM0D,SAASsC,EAAE,IACP,QAARA,EAAE,GACT9I,KAAK4I,KAAOpC,SAASsC,EAAE,IACR,QAARA,EAAE,KACT9I,KAAKiI,KAAOzB,SAASsC,EAAE,WAIhC,IAAe,gBAAXzC,EAAK,GAAsB,CAClCrG,KAAKoF,SAAW,eAChBpF,KAAKwB,IAAM,KACXxB,KAAKiI,KAAO,CAEZ,KAAK,GAAIY,GAAK,EAAGA,EAAKxC,EAAKrM,SAAU6O,EAAI,CACrC,GAAIC,GAAI9C,EAAY+C,KAAK1C,EAAKwC,GAClB,UAARC,EAAE,GACF9I,KAAKwB,IAAMsH,EAAE,GACE,QAARA,EAAE,KACT9I,KAAKiI,KAAOzB,SAASsC,EAAE,UAI/B,IAAK9I,KAAKoF,UAUH,GAAqB,aAAjBpF,KAAKoF,SAAyB,CACrC,GAAmB,GAAfiB,EAAKrM,OACL,MACJ,IAAI2M,GAAQC,WAAWP,EAAK,IACxB3M,GAAK6J,QAASvD,KAAKwB,IAAK7D,IAAKqC,KAAK8C,IAAKhD,IAAKE,KAAK8C,IAAM9C,KAAKiI,KAAO,EAAGtB,MAAOA,EACjF3G,MAAK8C,KAAO9C,KAAK4I,KACjB5I,KAAKyC,KAAK/I,OACP,IAAqB,gBAAjBsG,KAAKoF,SAA4B,CACxC,GAAmB,GAAfiB,EAAKrM,OACL,MACJ,IAAI8I,GAAM0D,SAASH,EAAK,IACpBM,EAAQC,WAAWP,EAAK,IACxB3M,GAAK6J,QAASvD,KAAKwB,IAAK7D,IAAKmF,EAAKhD,IAAKgD,EAAM9C,KAAKiI,KAAO,EAAGtB,MAAOA,EACvE3G,MAAKyC,KAAK/I,QAvBM,CAChB,GAAI2M,EAAKrM,OAAS,EACd,MAEJ,IAAIN,IAAK6J,QAAS8C,EAAK,GACd1I,IAAK6I,SAASH,EAAK,IAAM,EACzBvG,IAAK0G,SAASH,EAAK,IACnBM,MAAOC,WAAWP,EAAK,IAEhCrG,MAAKyC,KAAK/I,KAmBtByL,EAAgBxF,UAAUgJ,MAAQ,aAElC3D,EAAarF,UAAUqJ,cAAgB,SAASzN,GAC5C,GACI0N,GAAa,GAAIxD,EAErB,IAAiB,OAAbzF,KAAKsE,KAAe,CACpB,GAAI4E,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,YACjBD,EAASE,QAAU,OACnBF,EAASG,OAAO,GAChBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,OAC3C,CACH,GAAIA,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,OACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,EAE9C,IAAIA,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,MACnBF,EAASG,OAAS,GAClBH,EAASM,MAAO,EAChBN,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,eAAgB,KAAM4E,EAElD,IAAIS,GAAU,GAAIjE,EAClBiE,GAAQR,MAAQ,MAChBQ,EAAQJ,QAAU,QAClBI,EAAQP,QAAU,QAClBO,EAAQN,OAAS,GACjBM,EAAQD,OAAS,GACjBC,EAAQH,MAAO,EACfG,EAAQF,OAAQ,EAChBR,EAAWK,WAAWhF,KAAM,cAAe,KAAMqF,EAEjD,IAAIC,GAAY,GAAIlE,EACpBkE,GAAUT,MAAQ,YAClBS,EAAUC,OAAS,QACnBD,EAAUE,OAAS,QACnBF,EAAUP,OAAO,GACjBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAMsF,GAGlD,MAAOrO,GAAS0N,IAGpB3D,EAAgC,MAAO,SAASrM,GAAI,MAAO,IAAI+L,GAAa/L,KAC5EqM,EAAgC,MAAO,SAASrM,GAAI,MAAO,IAAI+L,GAAa/L,ODkhBzE8Q,QAAQ,GAAGC,mBAAmB,GAAGlF,UAAU,GAAGmF,UAAU,KAAKC,GAAG,SAAS1Q,EAAQU,EAAOJ,GEzyB3F,YAyCA,SAASqQ,GAAevI,EAAIvI,GACxB,GAAIiB,GAASsH,EAAGvI,GAAKuI,EAAGvI,EAAE,GAAG+Q,EAAKxI,EAAGvI,EAAE,GAAGgR,EAAKzI,EAAGvI,EAAE,GAAGiR,EAAK1I,EAAGvI,EAAE,GAAGkR,CACpE,OAAOjQ,GAGX,QAASkQ,MA8DT,QAASC,GAAWC,EAAKC,EAAeC,EAAeC,GACnD7K,KAAK0K,IAAMA,EACX1K,KAAK2K,cAAgBA,EACrB3K,KAAK4K,cAAgBA,EACrB5K,KAAK6K,UAAYA,EAonBrB,QAASC,GAAQ1P,EAAMG,EAAUuB,GAC7B,GAAI4N,GAAM,GAAIF,EACdE,GAAItP,KAAOA,EACXsP,EAAI5N,KAAOA,EACX4N,EAAItP,KAAKK,MAAM,EAAG,KAAKsP,SAASrP,MAAM,SAASmC,GAC3C,IAAKA,EACD,MAAOtC,GAAS,KAAM,sBAG1B,IAAII,GAASkC,EACT+D,EAAK,GAAI1F,YAAWP,GACpB0J,EAAK,GAAI2F,YAAWrP,GACpBsP,EAAK,GAAIC,YAAWvP,GACpBQ,EAAQyF,EAAG,GAAMwI,EAAKxI,EAAG,GAAOyI,EAAKzI,EAAG,GAAO0I,EAAK1I,EAAG,EAC3D,IAAIzF,GAASgP,EACTT,EAAIpG,KAAO,aACR,CAAA,GAAInI,GAASiP,EAEb,MAAIjP,IAASkP,GAAoBlP,GAASmP,EACtC/P,EAAS,KAAM,gDAGfA,EAAS,KAAM,mCAAqCY,EAAME,SAAS,IAL1EqO,GAAIpG,KAAO,SASfoG,EAAIa,QAAUlG,EAAG,GACjBqF,EAAIc,cAAgBnG,EAAG,GACvBqF,EAAIe,gBAAkBtB,EAAevI,EAAI,GACzC8I,EAAIgB,mBAAqBvB,EAAevI,EAAI,IAC5C8I,EAAIiB,oBAAsBxB,EAAevI,EAAI,IAC7C8I,EAAIkB,WAAavG,EAAG,IACpBqF,EAAImB,kBAAoBxG,EAAG,IAC3BqF,EAAIoB,SAAW3B,EAAevI,EAAI,IAClC8I,EAAIqB,mBAAqB5B,EAAevI,EAAI,IAC5C8I,EAAIsB,kBAAoBf,EAAG,IAC3BP,EAAIuB,gBAAkB9B,EAAevI,EAAI,IAEzC8I,EAAIwB,aACJ,KAAK,GAAIC,GAAK,EAAGA,EAAKzB,EAAIc,gBAAiBW,EAAI,CAC3C,GAAIC,GAAcnB,EAAM,EAAHkB,EAAO,IACxBE,EAASlC,EAAevI,EAAO,GAAHuK,EAAQ,IACpCG,EAAUnC,EAAevI,EAAO,GAAHuK,EAAQ,GACzCzB,GAAIwB,WAAWhP,MAAMqP,UAAWH,EAAaI,WAAYH,EAAQI,YAAaH,IAGlF5B,EAAIgC,cAAc,WACdhC,EAAIiC,WAAW,SAASC,GAEpB,MADAlC,GAAImC,OAASD,EACNrR,EAASmP,SAGxB7O,QAAS,MAqMjB,QAASiR,GAAcC,EAAKzI,EAAMsH,EAAYtR,EAAQ0S,GAClDhN,KAAK+M,IAAMA,EACX/M,KAAKsE,KAAOA,EACZtE,KAAK4L,WAAaA,EAClB5L,KAAK1F,OAASA,EACd0F,KAAKgN,MAAQA,EA/9BjB,GAAwB,mBAAbxT,GACP,GAAI0E,GAAQ1E,EAAQ,WAChB4E,EAAQF,EAAME,MACdC,EAAQH,EAAMG,MACdC,EAAeJ,EAAMI,aAErBkH,EAAMhM,EAAQ,SACdoM,EAAaJ,EAAII,WACjBD,EAAWH,EAAIG,SAEfE,EAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,YAEpB3H,EAAM3E,EAAQ,SACdiB,EAAU0D,EAAI1D,QAEdwS,EAASzT,EAAQ,UACjB0T,EAAwBD,EAAOE,cAC/BC,EAAYH,EAAOG,SAG3B,IAAIjC,GAAgB,WAChBE,EAAmB,UACnBD,EAAgB,WAChBE,EAAmB,WAGnB+B,EAAqB,EACrBC,EAAqB,EACrBC,EAAqB,EAErBnD,EAAK,IACLC,EAAK,MACLC,EAAK,SACLC,EAAK,WAELrE,EAAmB,GAAIlI,QAAO,wBAUlCwM,GAAO7K,UAAU+M,cAAgB,SAASnR,GACtC,GAAIuG,GAAQ9B,IACZA,MAAKwN,eACLxN,KAAKyN,eACLzN,KAAK0N,MAAQ,CAEb,IAAIC,GAAM3N,KAAK0L,mBACXkC,EAAMD,EAAM3N,KAAKyL,gBAAmB,CACxCkC,GAAMA,EAAM,EAAIC,EAEhB5N,KAAK5E,KAAKK,MAAMuE,KAAKyL,gBAAiBkC,EAAM3N,KAAKyL,iBAAiB/P,MAAM,SAASmS,GAC7E,GAAIjM,GAAK,GAAI1F,YAAW2R,GACpBxI,EAAK,GAAI2F,YAAW6C,GACpB5C,EAAK,GAAIC,YAAW2C,GAGpBC,GAFW7C,EAAG,GACFA,EAAG,GACLA,EAAG,IAGb8C,GAFU9C,EAAG,GACDd,EAAevI,EAAI,IACd,IAEjBoM,EAAc,QAAdA,GAAuB1T,GACvB,GAAI2T,GAAWrM,EAAGtH,GACd4T,EAAM7I,EAAI/K,EAAO,EAAK,EAC1BA,IAAU,CACV,KAAK,GAAIpB,GAAI,EAAOgV,EAAJhV,IAAWA,EACvB,GAAgB,GAAZ+U,EAAe,CACf3T,GAAUwT,CACV,IAAIK,GAAchE,EAAevI,EAAItH,EACrCA,IAAU,EACV6T,GAAerM,EAAM2J,gBACrBuC,EAAYG,OACT,CAEH,IAAK,GADDC,GAAM,GACDC,EAAK,EAAQP,EAALO,IAAgBA,EAAI,CACjC,GAAIC,GAAW1M,EAAGtH,IACF,IAAZgU,IACAF,GAAO7R,OAAOC,aAAa8R,IAGnC,GAAIC,GAAW3M,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,EAAMsH,EAAGtH,EAAO,EACtEsH,GAAGtH,EAAS,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,EAAMsH,EAAGtH,EAAO,EAC3FA,IAAU,EAEVwH,EAAM0L,YAAYY,GAAOG,EACC,GAAtBH,EAAIpR,QAAQ,SACZ8E,EAAM0L,YAAYY,EAAII,OAAO,IAAMD,GAEvCzM,EAAM2L,YAAYc,GAAWH,EAC7BtM,EAAM4L,MAAQhQ,KAAKoC,IAAIgC,EAAM4L,MAAOa,IAIhDP,GAAYD,GAEZxS,EAASuG,MAajB2I,EAAW9K,UAAU8O,YAAc,SAASC,EAAS/Q,EAAKmC,EAAKvE,GAC3D,GAAIiG,GAAMxB,KAAK0K,IAAI8C,YAAYkB,EAC/B,OAAYvM,UAARX,EAEOjG,UAEPyE,MAAK2O,gBAAgBnN,EAAK7D,EAAKmC,EAAKvE,IAI5CkP,EAAW9K,UAAUgP,gBAAkB,SAASnN,EAAK7D,EAAKmC,EAAKvE,GAC3D,GAAIuG,GAAQ9B,IACZ,KAAKA,KAAK4O,UAON,WANA5O,MAAK0K,IAAItP,KAAKK,MAAMuE,KAAK2K,cAAe,IAAIjP,MAAM,SAASmC,GACvDiE,EAAM8M,UAAY/Q,CAClB,IAAIoN,GAAK,GAAIC,YAAWpJ,EAAM8M,UAC9B9M,GAAM+M,aAAe5D,EAAG,GACxBnJ,EAAM6M,gBAAgBnN,EAAK7D,EAAKmC,EAAKvE,IAK7C,IAAIuT,MACAC,EAAc,EAIdC,GAFYC,KAAKC,MAER,SAASX,EAASY,EAAMC,EAAM/I,GACvC,OAAe,EAAN7E,GAAW+M,GAAW/M,IAAgB1B,GAARqP,GAAeC,GAAQzR,IAG9D0R,EAAc,SAAS/U,EAAQgV,GAM/B,GALIxN,EAAM4I,IAAI6E,YACVC,QAAQC,IAAI,SAAWH,EAAQ,YAAchV,EAAS,WAAwB,EAAX2U,KAAKC,QAE5EH,GAAezU,EAAON,OAED,GAAjBM,EAAON,QAAeM,EAAO,GAAKwH,EAAM6I,eAAiB,IAAM7I,EAAM4N,cAMrE,MALAC,GAAa7N,EAAM4N,cAAe,EAAGJ,KACnCP,OACiB,GAAfA,GACAjN,EAAM8N,cAAcZ,EAAQF,EAAevT,GAOnD,KAAK,GADD2C,GADA2R,EAAkB,EAA2B,GAArB/N,EAAM+M,aAEzBpV,EAAI,EAAGA,EAAIa,EAAON,SAAUP,EAAG,CACpC,GAAIqW,GAAY,GAAI1R,GAAM9D,EAAOb,GAAIa,EAAOb,GAAKoW,EACjD3R,GAAQA,EAAQG,EAAMH,EAAO4R,GAAaA,EAI9C,IAAK,GADDC,GAAc7R,EAAMiK,SACfhP,EAAI,EAAGA,EAAI4W,EAAY/V,SAAUb,EAAG,CACzC,GAAI6W,GAAKD,EAAY5W,EACrB8W,GAAiB3V,EAAQ0V,EAAIV,KAIjCW,EAAmB,SAAS3V,EAAQ0V,EAAIV,EAAOY,GAClCF,EAAGlQ,MAAQkQ,EAAGrS,KAC3BmE,GAAM4I,IAAItP,KAAKK,MAAMuU,EAAGrS,MAAOqS,EAAGlQ,MAAQkQ,EAAGrS,OAAOjC,MAAM,SAASyU,GAC/D,IAAK,GAAI1W,GAAI,EAAGA,EAAIa,EAAON,SAAUP,EAC7BuW,EAAGI,SAAS9V,EAAOb,MACnBkW,EAAaQ,EAAc7V,EAAOb,GAAKuW,EAAGrS,MAAO2R,GAE7ChV,EAAOb,GAAKqI,EAAM6I,eAAiB,IAAMrQ,EAAOb,GAAKuW,EAAGrS,OAAS,IACjEmE,EAAM4N,cAAgBS,KAExBpB,EACiB,GAAfA,GACAjN,EAAM8N,cAAcZ,EAAQF,EAAevT,OAO3DoU,EAAe,SAASU,EAAc/V,EAAQgV,GAC9C,GAAI1N,GAAK,GAAI1F,YAAWmU,GACpBhL,EAAK,GAAI2F,YAAWqF,GACpBpF,EAAK,GAAIC,YAAWmF,GAEpBC,EAAS1O,EAAGtH,GACZ4T,EAAM7I,EAAG/K,EAAO,EAAI,EAGxB,IAFAA,GAAU,EAEI,GAAVgW,EACA,IAAK,GAAI7W,GAAI,EAAOyU,EAAJzU,IAAWA,EAAG,CAC1B,GAAI8W,GAAKjW,EAAO,EACZkW,EAAavF,EAAGsF,GAChBE,EAAYxF,EAAGsF,EAAK,GACpBG,EAAWzF,EAAGsF,EAAK,GACnBI,EAAU1F,EAAGsF,EAAK,GAClBK,EAAczG,EAAevI,EAAItH,EAAO,IACxCoI,EAAYyH,EAAevI,EAAItH,EAAO,KAC9B,EAANkH,GAAwBA,EAAbgP,GAAsBA,GAAchP,GAAoB1B,GAAb2Q,KAChD,EAANjP,GAAWkP,EAAalP,GAASkP,GAAYlP,GAAOmP,GAAWhT,IAEjEmR,EAAc5R,MAAM5C,OAAQsW,EAAaC,KAAMnO,IAEnDpI,GAAU,OAEX,CAEH,IAAK,GADDwW,MACKrX,EAAI,EAAOyU,EAAJzU,IAAWA,EAAG,CAC1B,GAAI8W,GAAKjW,EAAO,EACZkW,EAAavF,EAAGsF,GAChBE,EAAYxF,EAAGsF,EAAK,GACpBG,EAAWzF,EAAGsF,EAAK,GACnBI,EAAU1F,EAAGsF,EAAK,GAClBK,EAAczG,EAAevI,EAAItH,EAAO,KACjC,EAANkH,GAAwBA,EAAbgP,GAAqBA,GAAchP,GAAoB1B,GAAb2Q,KAC/C,EAANjP,GAAWkP,EAAalP,GAAQkP,GAAYlP,GAAOmP,GAAWhT,IAE/DmT,EAAa5T,KAAK0T,GAEtBtW,GAAU,GAEVwW,EAAa9W,OAAS,GACtBqV,EAAYyB,EAAcxB,EAAQ,IAK9CD,IAAavN,EAAM6I,cAAgB,IAAK,IAI5CF,EAAW9K,UAAUiQ,cAAgB,SAASZ,EAAQF,EAAevT,GACjE,GAAIuG,GAAQ9B,IAMZ,IAJA8O,EAAc9N,KAAK,SAAS+P,EAAIC,GAC5B,OAAkB,EAAVD,EAAGzW,SAAuB,EAAV0W,EAAG1W,UAGH,GAAxBwU,EAAc9U,OACduB,UACG,CACH,GAAI0V,MACAC,EAAgB,SAAS1P,EAAK2N,EAAMC,EAAM3N,GACrCA,IACDA,KAGJ,IAAI/H,GAAI,GAAIkM,EACZlM,GAAEyX,SAAW3P,EACb9H,EAAE6J,QAAUzB,EAAM4I,IAAI+C,YAAYjM,GAClC9H,EAAEiE,IAAMwR,EACRzV,EAAEoG,IAAMsP,EACR1V,EAAE4K,KAAOxC,EAAM4I,IAAIpG,IAEnB,KAAK,GAAI8M,KAAK3P,GACV/H,EAAE0X,GAAK3P,EAAK2P,EAGhBH,GAAS/T,KAAKxD,IAGdgI,EAAQ,QAARA,KACA,GAA4B,GAAxBoN,EAAc9U,OAAa,CACZiV,KAAKC,KAGpB,YADA3T,GAAS0V,GAGT,GAAI/V,GAAQ4T,EAAc,EAC1B,IAAI5T,EAAME,KACN0G,EAAMuP,cAAcnW,EAAME,KAAM8V,EAAelC,GAC/CF,EAAcwC,OAAO,EAAG,GACxB5P,QACG,CAIH,IAHA,GAAI6P,GAAarW,EAAMZ,OACnBkX,EAAYtW,EAAM2V,KAClB5V,EAAK,EACFA,EAAK6T,EAAc9U,QAAU8U,EAAc7T,GAAIX,QAAWiX,EAAaC,GAC1EA,GAAa1C,EAAc7T,GAAI4V,OAC7B5V,CAGN6G,GAAM4I,IAAItP,KAAKK,MAAM8V,EAAYC,GAAW9V,MAAM,SAASmC,GAGvD,IAFA,GAAIvD,GAAS,EACTW,EAAK,EACOuW,EAATlX,GAAoB,CACvB,GAEIc,GAFAqW,EAAK3C,EAAc7T,EAGvB,IAAI6G,EAAM4I,IAAIsB,kBAAoB,EAC9B5Q,EAAO8R,EAAsBrP,EAAQvD,EAAS,EAAGmX,EAAGZ,KAAO,OACxD,CACH,GAAIa,GAAM,GAAIxV,YAAWuV,EAAGZ,KAC5BzD,GAAU,GAAIlR,YAAW2B,EAAQvD,EAAQmX,EAAGZ,MAAO,EAAGa,EAAK,EAAGD,EAAGZ,MACjEzV,EAAOsW,EAAIrP,OAEfoP,EAAGrW,KAAOA,EAEVd,GAAUmX,EAAGZ,OACX5V,EAENyG,OAKhBA,OAIR+I,EAAW9K,UAAU0R,cAAgB,SAASjW,EAAM8V,EAAelC,GAC/D,GAAIpN,GAAK,GAAI1F,YAAWd,EAExB,IAAI4E,KAAK6K,UAML,IAAK,GALDxF,GAAK,GAAI2F,YAAW5P,GACpB6P,EAAK,GAAIC,YAAW9P,GACpBuW,EAAK,GAAIC,cAAaxW,GAEtByW,EAAYzW,EAAKa,WAAW,GACvBxC,EAAI,EAAOoY,EAAJpY,IAAiBA,EAAG,CAChC,GAAI8U,GAAYtD,EAAM,EAAFxR,GAChB8M,EAAY0E,EAAM,EAAFxR,EAAK,GACrBgN,EAAYwE,EAAM,EAAFxR,EAAK,GACrBqY,EAAY7G,EAAM,EAAFxR,EAAK,GAErBsY,GADYJ,EAAM,EAAFlY,EAAK,GACTkY,EAAM,EAAFlY,EAAK,IACrBuY,EAAYL,EAAM,EAAFlY,EAAK,EACTkY,GAAM,EAAFlY,EAAK,EAEzB,IAAIuV,EAAOT,EAAShI,EAAQ,EAAGE,GAAM,CACjC,GAAIwL,IAAe3N,KAAM,SAAUqC,MAAOqL,EAAQF,EAAUI,SAAUH,EACjD,WAAjB/R,KAAK0K,IAAIpG,OACT2N,EAAY3N,KAAO,WAEvB4M,EAAc3C,EAAShI,EAAQ,EAAGE,EAAKwL,QAG5C,IAAqB,UAAjBjS,KAAK0K,IAAIpG,KAAkB,CAClC,GAAIe,GAAK,GAAI2F,YAAW5P,GACpB6P,EAAK,GAAIC,YAAW9P,GACpBuW,EAAK,GAAIC,cAAaxW,GAEtBmT,EAAUtD,EAAG,GACbxN,EAAawN,EAAG,GAEhBkH,GADWlH,EAAG,GACHA,EAAG,IACdmH,EAAWnH,EAAG,GACdoH,EAAYzQ,EAAG,IACfiQ,EAAYxM,EAAG,GAEnB,IAAIgN,GAAa9E,EACb,IAAK,GAAI9T,GAAI,EAAOoY,EAAJpY,IAAiBA,EAAG,CAChC,GAAIkN,GAAQgL,EAAGlY,EAAI,GACf0V,EAAO1R,EAAchE,EAAE0Y,EAAY,EAAG/C,EAAO3R,EAAchE,EAAE0Y,EAAYC,CACzEpD,GAAOT,EAASY,EAAMC,IACtB8B,EAAc3C,EAASY,EAAMC,GAAOzI,MAAOA,QAEhD,IAAI0L,GAAa/E,EACpB,IAAK,GAAI7T,GAAI,EAAOoY,EAAJpY,IAAiBA,EAAG,CAChC,GAAI8M,GAAQ0E,EAAM,EAAFxR,EAAO,GAAK,EACxBgN,EAAMF,EAAQ6L,EAAW,EACzBzL,EAAQgL,EAAM,EAAFlY,EAAO,EACnBuV,GAAOT,EAAShI,EAAOE,IACvByK,EAAc3C,EAAShI,EAAOE,GAAME,MAAOA,QAEhD,IAAI0L,GAAahF,EACpB,IAAK,GAAI5T,GAAI,EAAOoY,EAAJpY,IAAiBA,EAAG,CAChC,GAAI8M,GAAQ0E,EAAM,EAAFxR,EAAO,GAAK,EACxBgN,EAAQwE,EAAM,EAAFxR,EAAO,GACnBkN,EAAQgL,EAAM,EAAFlY,EAAO,EACnB8M,GAAQE,IACRF,EAAQE,GAERuI,EAAOT,EAAShI,EAAOE,IACvByK,EAAc3C,EAAShI,EAAOE,GAAME,MAAOA,QAGnD6I,SAAQC,IAAI,kCAAoC4C,OAEjD,CAAA,GAAqB,UAAjBrS,KAAK0K,IAAIpG,KAyJhB,KAAM3K,OAAM,8BAAgCqG,KAAK0K,IAAIpG,KApJrD,KAJA,GAAIhK,GAAS,EACTgY,EAAMtS,KAAK0K,IAAImB,kBACfgB,EAAS7M,KAAK0K,IAAImC,OAEfvS,EAASsH,EAAG5H,QAAQ,CACvB,GAAIuU,GAAW3M,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,EAAMsH,EAAGtH,EAAO,GACnFiM,EAAS3E,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,GAAOsH,EAAGtH,EAAO,IAAI,EAAMsH,EAAGtH,EAAO,GACjFmM,EAAO7E,EAAGtH,EAAO,KAAK,GAAOsH,EAAGtH,EAAO,KAAK,GAAOsH,EAAGtH,EAAO,IAAI,EAAMsH,EAAGtH,EAAO,EACrFA,IAAU,EAEV,KADA,GAAIiY,GAAO,KACE,CACT,GAAIC,GAAK5Q,EAAGtH,IACZ,IAAU,GAANkY,EAGA,KAFAD,IAAQhW,OAAOC,aAAagW,GAMpC,GAEIC,GAFAC,IAWJ,IAPID,EADAF,EAAKvY,OAAS,EACDuY,EAAKjM,MAAM,QAIxBmM,EAAWzY,OAAS,GAAKsY,EAAM,IAC/BI,EAAYhM,MAAQ+L,EAAW,IAE/BA,EAAWzY,OAAS,GAAKsY,EAAM,EAAG,CAClC,GAAI3L,GAAQH,SAASiM,EAAW,GAC3BE,OAAMhM,KACP+L,EAAY/L,MAAQA,GAK5B,GAHI8L,EAAWzY,OAAS,GAAKsY,EAAM,IAC/BI,EAAY7L,YAAc4L,EAAW,IAErCA,EAAWzY,OAAS,GAAKsY,EAAM,EAAG,CAClC,GAAIxL,GAAQ2L,EAAW,EACnBvM,GAAiBa,KAAKD,KACtB4L,EAAY1L,QAAU,OAASF,EAAQ,KAI/C,GAAI2L,EAAWzY,OAASsY,EAAI,GAAKzF,EAC7B,IAAK,GAAI+F,GAAMN,EAAM,EAAGM,EAAMH,EAAWzY,SAAU4Y,EAC/CF,EAAY7F,EAAOgG,OAAOD,EAAI,GAAG9V,MAAQ2V,EAAWG,EAI5D,IAAI5D,EAAOT,EAAShI,EAAQ,EAAGE,EAAKgM,GAChC,GAAU,GAANH,EACApB,EAAc3C,EAAShI,EAAQ,EAAGE,EAAKiM,OACpC,CACH,GAAIzL,GAA2B,EAAdwL,EAAW,GACxBvL,EAA2B,EAAduL,EAAW,GACxBtL,EAA2B,EAAdsL,EAAW,GACxBrL,EAAaqL,EAAW,GAAGnM,MAAM,KACjCiB,EAAckL,EAAW,GAAGnM,MAAM,IAEtC,IAAIoM,EAAYI,WAAY,CACxB,GAAIA,GAAaJ,EAAYI,WAAWxM,MAAM,IAC9CoM,GAAYI,WAAa3Q,OAG7BuQ,EAAYpO,KAAO,YACnB,IAAIkD,GAAM,GAAI7B,EACd,KAAK,GAAIyL,KAAKsB,GACVlL,EAAI4J,GAAKsB,EAAYtB,EAYzB,IAVA5J,EAAIC,GAAKgL,EAAW,GACpBjL,EAAIjE,QAAUvD,KAAK0K,IAAI+C,YAAYc,GACnC/G,EAAI7J,IAAM4I,EAAQ,EAClBiB,EAAI1H,IAAM2G,EACVe,EAAIE,SACJgL,EAAY/K,QAAUH,GAKlBiL,EAAWzY,OAAS,EAAG,CACvB,GAAI4N,GAAS8K,EAAY7K,UAAY4K,EAAW,GAC5C5K,EAAWD,CACX6K,GAAWzY,OAAS,KACpB6N,EAAW4K,EAAW,KAEtBC,EAAYK,YACZlL,EAAW6K,EAAYK,UAE3B,IAAIjL,GAAKhC,EAAY0B,EACrBM,GAAGL,GAAKG,EACRE,EAAGpB,MAAQmB,EACXC,EAAGxD,KAAO,OACVoO,EAAY/K,OAAOzK,KAAK4K,GAI5B,IAAK,GADDkL,MACKtY,EAAI,EAAOyM,EAAJzM,IAAkBA,EAAG,CACjC,GAAIqN,KAAuB,EAAfR,EAAY7M,IAAQ6L,EAC5ByB,GAAOD,IAAsB,EAAdX,EAAW1M,IAC1BuN,GAAO,GAAI7J,GAAM2J,GAAMC,GAC3BgL,GAAS9V,KAAK+K,IAKlB,IAAK,GAHD/J,IAAQG,EAAM2U,GAEd9K,GAAShK,GAAMiK,SACV/O,GAAI,EAAGA,GAAI8O,GAAOlO,SAAUZ,GAAG,CACpC,GAAIgP,IAAKF,GAAO9O,GAChB8X,GAAc3C,EAASnG,GAAGzK,MAAQ,EAAGyK,GAAGtI,MAAO4S,GAGnD,GAAIxL,EAAWD,EAAY,CACvB,GAAIqB,IAA2C,KAA3BoK,EAAY7L,YAC5B,GAAIzI,GAAM6I,EAAYC,EAAW,GACjC,GAAI9I,GAAM6I,EAAa,EAAGC,GAG1BqB,GAAKjK,EAAaJ,GAAOoK,GAC7B,IAAIC,GAAI,CACJmK,EAAYpO,KAAO,aAKnB,KAJA,GAAIkE,IAASD,GAAGJ,SACZM,GAAe,EAEfwK,GAAW,EACRzK,GAAO,GAAG7K,MAAQuK,GAAO+K,IAAUnT,OACtCmT,IAEJ,KAAK,GAAI7Z,IAAI,EAAGA,GAAIoP,GAAOxO,SAAUZ,GAAG,CAEpC,GAAI2G,IAAQ3G,EACmB,MAA3BsZ,EAAY7L,cACZ9G,GAAQyI,GAAOxO,OAASZ,GAAI,EAChC,IAAIgP,IAAKI,GAAOzI,GAEhB,IADA2S,EAAYhK,UAAYD,GACpBqK,EAAY,CACZ,GAAII,IAAM1M,SAASsM,EAAW/S,GAAQkT,IAClB,iBAATC,KAAqBA,IAAO,GAAY,GAAPA,KACxCR,EAAYhK,UAAYwK,GACxBR,EAAYS,mBAAoB,GAGxC,GAAInZ,IAASoO,GAAGtI,MAAQsI,GAAGzK,KAC3B8K,KAAgBA,GAAezO,IAAU,EACzCkX,EAAc3C,EAASnG,GAAGzK,MAAQ,EAAGyK,GAAGtI,MAAO4S,UAgB/EjI,EAAW9K,UAAUyT,iBAAmB,SAAS1E,EAAS5L,EAAKuQ,EAAK9X,GAChE,GAAIiG,GAAMxB,KAAK0K,IAAI8C,YAAYkB,EAC/B,OAAYvM,UAARX,EAEOjG,UAEPyE,MAAKsT,qBAAqB9R,EAAKsB,EAAKuQ,EAAK9X,IAIjDkP,EAAW9K,UAAU2T,qBAAuB,SAAS9R,EAAKsB,EAAKuQ,EAAK9X,GAChE,GAAIuG,GAAQ9B,IACZ,KAAKA,KAAK4O,UAON,WANA5O,MAAK0K,IAAItP,KAAKK,MAAMuE,KAAK2K,cAAe,IAAIjP,MAAM,SAASmC,GACvDiE,EAAM8M,UAAY/Q,CAClB,IAAIoN,GAAK,GAAIC,YAAWpJ,EAAM8M,UAC9B9M,GAAM+M,aAAe5D,EAAG,GACxBnJ,EAAMwR,qBAAqB9R,EAAKsB,EAAKuQ,EAAK9X,IAKlD,IAAIgY,GAAe,KACfC,EAAe,GACfC,EAAkB,GAElB1E,EAAc,EAIdM,GAFYJ,KAAKC,MAEH,SAAS5U,EAAQgV,GAC/BP,GAAezU,EAAON,MAItB,KAAK,GADDkE,GADA2R,EAAkB,EAA2B,GAArB/N,EAAM+M,aAEzBpV,EAAI,EAAGA,EAAIa,EAAON,SAAUP,EAAG,CACpC,GAAIqW,GAAY,GAAI1R,GAAM9D,EAAOb,GAAIa,EAAOb,GAAKoW,EACjD3R,GAAQA,EAAQG,EAAMH,EAAO4R,GAAaA,EAI9C,IAAK,GADDC,GAAc7R,EAAMiK,SACfhP,EAAI,EAAGA,EAAI4W,EAAY/V,SAAUb,EAAG,CACzC,GAAI6W,GAAKD,EAAY5W,EACrB8W,GAAiB3V,EAAQ0V,EAAIV,MAIjCW,EAAmB,SAAS3V,EAAQ0V,EAAIV,EAAOY,GAClCF,EAAGlQ,MAAQkQ,EAAGrS,KAC3BmE,GAAM4I,IAAItP,KAAKK,MAAMuU,EAAGrS,MAAOqS,EAAGlQ,MAAQkQ,EAAGrS,OAAOjC,MAAM,SAASyU,GAC/D,IAAK,GAAI1W,GAAI,EAAGA,EAAIa,EAAON,SAAUP,EACjC,GAAIuW,EAAGI,SAAS9V,EAAOb,MACnBkW,EAAaQ,EAAc7V,EAAOb,GAAKuW,EAAGrS,MAAO2R,KAC/CP,EACiB,GAAfA,GAAkB,CAClB,IAAKwE,EACD,MAAIF,GAAM,IAAa,GAAP7R,GAAYsB,EAAM,GACvBhB,EAAMwR,qBAAqB,EAAG,EAAGD,EAAK9X,GAChC,EAAN8X,IAAY7R,GAAOM,EAAM4I,IAAIgD,OAAe,IAAN5K,GACtChB,EAAMwR,qBAAqBxR,EAAM4I,IAAIgD,MAAO,IAAY2F,EAAK9X,GAEjEA,KAGXuG,GAAM8N,cAAc,SAAS8D,EAAMvE,EAAMC,EAAM/I,GAC3C,MAAc,GAANgN,IAAmB7R,EAAPkS,GAAqB5Q,EAAPsM,IAAiBiE,EAAM,IAAMK,EAAOlS,GAAO2N,EAAOrM,KACpFyQ,GAAe,SAAStC,GAIxB,IAAK,GAHD0C,GAAc,KACdC,EAAU,GACVC,EAAU,GACLC,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,GACbJ,EAAOha,EAAEyX,SAAUhC,EAAOzV,EAAEiE,IAAKyR,EAAO1V,EAAEoG,KAC3B,MAAf6T,GAA+B,EAANN,IAAaK,EAAOE,GAAWxE,EAAOyE,IAAeR,EAAM,IAAcO,EAAPF,GAAyBG,EAAP1E,MAC7GwE,EAAcja,EACdma,EAAiB,EAANR,EAAWjE,EAAOD,EAC7ByE,EAAUF,GAIlB,MACWnY,GADQ,MAAfoY,GACiBA,aAUzChE,EAAe,SAASU,EAAc/V,EAAQgV,GAC9C,GAAI1N,GAAK,GAAI1F,YAAWmU,GACpBhL,EAAK,GAAI2F,YAAWqF,GACpBpF,EAAK,GAAIC,YAAWmF,GAEpBC,EAAS1O,EAAGtH,GACZ4T,EAAM7I,EAAG/K,EAAO,EAAI,EAGxB,IAFAA,GAAU,EAEI,GAAVgW,EACA,IAAK,GAAI7W,GAAI,EAAOyU,EAAJzU,IAAWA,EAAG,CAC1B,GAAI8W,GAAKjW,EAAO,EACZkW,EAAavF,EAAGsF,GAChBE,EAAYxF,EAAGsF,EAAK,GACpBG,EAAWzF,EAAGsF,EAAK,GACnBI,EAAU1F,EAAGsF,EAAK,GAClBK,EAAczG,EAAevI,EAAItH,EAAO,IACxCoI,EAAYyH,EAAevI,EAAItH,EAAO,KAC/B,EAAN+Y,IAA0B7R,EAAbgP,GAAqBA,GAAchP,GAAoBsB,GAAb2N,IACvD4C,EAAM,IAAO3C,EAAWlP,GAAQkP,GAAYlP,GAAOmP,GAAW7N,MAG3D,UAAUiG,KAAKjH,EAAM4I,IAAI+C,YAAY+C,MAEd,MAAhB+C,GAAgC,EAANF,IAAa3C,EAAW8C,GAAiB9C,GAAY8C,GAAgB7C,EAAU8C,IACtFJ,EAAM,IAAoBG,EAAbhD,GAA8BA,GAAcgD,GAA4BC,EAAZhD,MAGnG8C,GAAgBjZ,OAAQsW,EAAaC,KAAMnO,GAC3C+Q,EAAyB,EAANJ,EAAW1C,EAAUF,EACxC+C,EAAsB,EAANH,EAAW3C,EAAWF,IAG9ClW,GAAU,OAEX,CAIH,IAAK,GAHDyZ,GAAY,GACZF,EAAU,GACVD,EAAU,GACLna,EAAI,EAAOyU,EAAJzU,IAAWA,EAAG,CAC1B,GAAI8W,GAAKjW,EAAO,EACZkW,EAAavF,EAAGsF,GAChBE,EAAYxF,EAAGsF,EAAK,GACpBG,EAAWzF,EAAGsF,EAAK,GACnBI,EAAU1F,EAAGsF,EAAK,GAClBK,EAAe3F,EAAGsF,EAAK,IAAI,GAAOtF,EAAGsF,EAAK,IACnC,EAAN8C,IAA0B7R,EAAbgP,GAAqBA,GAAchP,GAAoBsB,GAAb2N,IAC1CC,GAAclP,GAC1B6R,EAAM,IAAO3C,EAAWlP,GAAQkP,GAAYlP,GAAOmP,GAAW7N,IACnCtB,GAAdgP,KAEC,EAAZuD,GAAiBpD,EAAUkD,KAC3BE,EAAYnD,EACZiD,EAAiB,EAANR,EAAW1C,EAAUF,EAChCmD,EAAiB,EAANP,EAAW3C,EAAWF,GAGzClW,GAAU,GAEVyZ,GAAa,GACb1E,GAAa0E,GAAYzE,EAAQ,IAM7CD,IAAavN,EAAM6I,cAAgB,IAAK,IAG5CH,EAAO7K,UAAU8O,YAAc,SAASC,EAAS/Q,EAAKmC,EAAKvE,GACvDyE,KAAKgU,kBAAkBvF,YAAYC,EAAS/Q,EAAKmC,EAAKvE,IAG1DiP,EAAO7K,UAAUqU,gBAAkB,WAC/B,IAAKhU,KAAKiU,aAAc,CACpB,GAAIC,GAAS,IACTC,EAAMnU,KAAKkM,WAAW,EACtBiI,KACAD,EAASlU,KAAKkM,WAAW,GAAGM,WAAaxM,KAAK2L,qBAElD3L,KAAKiU,aAAe,GAAIxJ,GAAWzK,KAAMA,KAAK2L,oBAAqBuI,GAAQ,GAE/E,MAAOlU,MAAKiU,cAGhBzJ,EAAO7K,UAAUyU,cAAgB,SAASC,GACtC,GAAIC,GAAKtU,KAAKkM,WAAWmI,EAIzB,OAHKC,GAAGC,OACJD,EAAGC,KAAO,GAAI9J,GAAWzK,KAAMsU,EAAG7H,YAAsE,KAAM,IAE3G6H,EAAGC,MA4Dd/J,EAAO7K,UAAU6U,SAAW,SAASC,EAAMjT,EAAK7D,EAAKmC,EAAKvE,GACtD,GAAImP,GAAM1K,IACV,MAAIyU,GAAQzU,KAAKkM,WAAWlS,OAAS,GAgB9B,CACH,GAAIua,EAMJ,OAJIA,GADO,EAAPE,EACOzU,KAAKgU,kBAELhU,KAAKoU,cAAcK,GAEvBF,EAAK5F,gBAAgBnN,EAAK7D,EAAKmC,EAAKvE,GAtB3C,GAAKyE,KAAK0U,uBAKH,CAGH,IAAK,GAFDhb,MACA2G,EAAIL,KAAK0U,uBACJZ,EAAK,EAAGA,EAAKzT,EAAErG,SAAU8Z,EAC1BzT,EAAEyT,GAAI3C,UAAY3P,GAClB9H,EAAEwD,KAAKmD,EAAEyT,GAGjB,OAAOvY,GAAS7B,GAZhBsG,KAAKoU,cAAcpU,KAAKkM,WAAWlS,OAAS,GAAG2U,gBAAgB,GAAI,EAAG,IAAW,SAASgG,GAEtF,MADAjK,GAAIgK,uBAAyBC,EACtBjK,EAAI8J,SAASC,EAAMjT,EAAK7D,EAAKmC,EAAKvE,MAuBzDiP,EAAO7K,UAAUiV,gBAAkB,SAASlG,EAASmG,EAAgBxB,EAAKyB,EAAWvZ,GAYjF,QAASwZ,KACR,GAAyB,GAArBC,EAAWhb,OACX,MAAOuB,GAAS,KAEpByZ,GAAWhU,KAAK,SAASE,EAAI+T,GACzB,GAAIC,GAAIhU,EAAGuT,KAAOQ,EAAGR,IACrB,OAAS,IAALS,EACIA,GAELA,EAAIhU,EAAGiU,OAASF,EAAGE,OACV,GAALD,EACOA,EAENhU,EAAGvD,IAAMsX,EAAGtX,IAAM0V,IAG9B,IAAI+B,GAAYJ,EAAW1D,OAAO,EAAG,GAAG,EACrC5G,GAAI8J,SAASY,EAAUX,KAAMW,EAAU5T,IAAK4T,EAAUzX,IAAKyX,EAAUtV,IAAK,SAAS6U,GAC/E,GAAIU,GAAKhC,EAAM,EAAI,EAAI,GACnB+B,GAAUE,UACVD,EAAKR,EAET,KAAK,GAAIf,GAAK,EAAGA,EAAKa,EAAM3a,SAAU8Z,EAAI,CACzC,GACOnN,GADHjN,EAAIib,EAAMb,EAOX,IAJInN,EADcxE,QAAdzI,EAAEwY,SACMxY,EAAEwY,SAEFxY,EAAEiN,MAEV0M,EAAM,GACT,GAAI1M,EAAQmO,EACX,GAAIM,EAAUX,KAAO,GACjB,GAAI/a,EAAEiE,IAAM0X,EACF,MAAO9Z,GAAS7B,OACnBA,GAAEoG,IAAMuV,GACfL,EAAW9X,MAAMsE,IAAK4T,EAAU5T,IAAK2T,OAAQC,EAAUD,OAAQV,KAAMW,EAAUX,KAAO,EAAG9W,IAAKjE,EAAEiE,IAAKmC,IAAKpG,EAAEoG,IAAKwV,QAASF,EAAUE,cAItI,IAAI3O,EAAQmO,EACd,GAAIM,EAAUX,KAAO,GACd,GAAI/a,EAAEoG,IAAMuV,EACd,MAAO9Z,GAAS7B,OACJA,GAAEiE,IAAM0X,GACfL,EAAW9X,MAAMsE,IAAK4T,EAAU5T,IAAK2T,OAAQC,EAAUD,OAAQV,KAAMW,EAAUX,KAAO,EAAG9W,IAAKjE,EAAEiE,IAAKmC,IAAKpG,EAAEoG,IAAKwV,QAASF,EAAUE,UAKpJP,MA7DR1B,EAAW,EAAJA,EAAS,GAAK,CAIrB,KAAK,GAHD3I,GAAM1K,KACNuV,EAAavV,KAAKwN,YAAYkB,GAC9BsG,IAAeG,OAAQ,EAAG3T,IAAK+T,EAAYd,KAAM/J,EAAIwB,WAAWlS,OAAS,EAAG2D,IAAK,EAAGmC,IAAK,IAAWwV,SAAS,IACxG7b,EAAI,EAAGA,GAAKuG,KAAK0N,MAAQ,IAAKjU,EAAG,CACtC,GAAIuI,IAASuT,EAAclC,EAAI5Z,IAAOuG,KAAK0N,MAAQ,EACvC,GAAR1L,IACAA,GAAUhC,KAAK0N,MAAQ,GAC3BsH,EAAW9X,MAAMiY,OAAQ1b,EAAG+H,IAAKQ,EAAOyS,KAAM/J,EAAIwB,WAAWlS,OAAS,EAAG2D,IAAK,EAAGmC,IAAK,MAyD1FiV,KAGJvK,EAAO7K,UAAUgN,WAAa,SAASpR,GAEnC,MAAKyE,MAAK8L,aAIV9L,MAAK5E,KAAKK,MAAMuE,KAAK8L,SAAU,MAAMpQ,MAAM,SAASmC,GAGhD,IAAK,GAFD+D,GAAK,GAAI1F,YAAW2B,GACpBzE,EAAI,GACCK,EAAI,EAAGA,EAAImI,EAAG5H,QACN,GAAT4H,EAAGnI,KADsBA,EAG7BL,GAAKmD,OAAOC,aAAaoF,EAAGnI,GAQhC,IAAI+b,GAAY,uCACZC,EAAW,6CAEXC,EAAcF,EAAUzM,KAAK3P,EACjC,IAAIsc,EAAa,CACb,GAAI9I,IACA+I,SAAUD,EAAY,GACtB5Y,KAAM4Y,EAAY,GAClBE,QAASF,EAAY,GAErB7C,UAGJzZ,GAAIA,EAAE6D,UAAUyY,EAAY,GAC5B,KAAK,GAAI5M,GAAI2M,EAAS1M,KAAK3P,GAAS,MAAL0P,EAAWA,EAAI2M,EAAS1M,KAAK3P,GACxDwT,EAAGiG,OAAO3V,MAAMoH,KAAMwE,EAAE,GACXhM,KAAMgM,EAAE,GACR8M,QAAS9M,EAAE,IAG5B,OAAOvN,GAASqR,MArCbrR,EAAS,OA0CxBiP,EAAO7K,UAAUkW,gBAAkB,SAASta,GACxC,GAAIuG,GAAQ9B,IACZ,OAAIA,MAAKuL,QAAU,GAA6B,GAAxBvL,KAAKiM,iBAAqC,UAAbjM,KAAKsE,KAC/C/I,EAAS,UAEhByE,MAAK5E,KAAKK,MAAMuE,KAAKiM,gBAAiB,IAAIvQ,MAAM,SAASmC,GACrD,IAAKA,EACD,MAAOtC,GAAS,KAAM,kCAG1B,IAAIqG,GAAK,GAAI1F,YAAW2B,GACpBwH,EAAK,GAAI2F,YAAWnN,GAIpBiY,GAHK,GAAI5K,YAAWrN,GAEJwH,EAAG,GACDA,EAAG,IACrB0Q,EAAuB5L,EAAevI,EAAI,EAE9C,OAAuB,IAAnBkU,EACOva,EAAS,UAMpBuG,GAAM1G,KAAKK,MAAMsa,EAAwC,GAAlBD,GAAsBpa,MAAM,SAASsa,GACxE,IAAKA,EACD,MAAOza,GAAS,KAAM,4BAQ1B,KAAK,GALDqG,GAAK,GAAI1F,YAAW8Z,GACpB3Q,EAAK,GAAI2F,YAAWgL,GAGpB7Y,GAFK,GAAI+N,YAAW8K,OAGfC,EAAK,EAAQH,EAALG,IAAwBA,EAAI,CACzC,GAAIC,GAAS7Q,EAAM,GAAH4Q,GACZE,EAAe9Q,EAAM,GAAH4Q,EAAQ,GAC1BG,EAAWjM,EAAevI,EAAO,GAAHqU,EAAQ,GACtCI,EAAUhR,EAAM,GAAH4Q,EAAQ,GACrBlW,EAAQ,GAAI+M,GAAchL,EAAOoU,EAAQC,EAAcC,EAAUC,EACrElZ,GAAQD,KAAK6C,GAEjBxE,EAAS4B,QAczB2P,EAAcnN,UAAU2W,OAAS,SAASxZ,EAAMvB,GAC5C,GAAIuG,GAAQ9B,IAEZA,MAAK+M,IAAI3R,KAAKK,MAAMuE,KAAK1F,OAAQ,IAAIoB,MAAM,SAASmS,GAWhD,QAASG,GAAYuI,GACjBzU,EAAMiL,IAAI3R,KAAKK,MAAM8a,EAAY,EAAK7T,GAAaoL,EAAU0I,IAAW9a,MAAM,SAAS+a,GACnF,GAAI7U,GAAK,GAAI1F,YAAWua,GACpBpR,EAAK,GAAIqR,aAAYD,GAGrBxI,GAFK,GAAI0I,aAAYF,GAEV7U,EAAG,IACdsM,EAAM7I,EAAG,GAET/K,EAAS,CACb,IAAgB,GAAZ2T,EAqBG,CACH,IAAK,GAAI/U,GAAI,EAAOgV,EAAJhV,IAAWA,EAAG,CAE1B,IAAK,GADDkV,GAAM,GACDC,EAAK,EAAQP,EAALO,IAAgBA,EAAI,CACjC,GAAIC,GAAW1M,EAAGtH,IACF,IAAZgU,IACAF,GAAO7R,OAAOC,aAAa8R,IAKnC,GAAIF,GAAOtR,EAAM,CACb,GAAIyJ,GAAQ4D,EAAevI,EAAItH,GAC3BN,EAASS,EAAQmH,EAAItH,EAAS,EAElC,OAAOwH,GAAMiL,IAAIiH,kBAAkBpE,cAC/B,SAASpO,EAAK7D,EAAKmC,EAAKuG,GACpB,MAAIA,IAAQA,EAAKrM,OAAS8H,EAAMkL,MAAQ,EAC7B3G,EAAKvE,EAAMkL,MAAQ,IAAMlQ,EADpC,UAGFxC,OAAQiM,EAAOsK,KAAM7W,IACvBuB,GAERjB,GAAUkc,EAEd,MAAOjb,OA5CP,IAAK,GADDqb,GAAkB,KACb1d,EAAI,EAAOgV,EAAJhV,IAAWA,EAAG,CAE1B,IAAK,GADDkV,GAAM,GACDC,EAAK,EAAQP,EAALO,IAAgBA,EAAI,CACjC,GAAIC,GAAW1M,EAAGtH,IACF,IAAZgU,IACAF,GAAO7R,OAAOC,aAAa8R,IAInC,GAAIH,GAAchE,EAAevI,EAAItH,EAGrC,IAFAA,GAAU,EAENwC,EAAK+Z,cAAczI,GAAO,GAAKwI,EAE/B,WADA5I,GAAY4I,EAGhBA,GAAkBzI,EAEtBH,EAAY4I,KAxCxB,GAAIhV,GAAK,GAAI1F,YAAW2R,GAEpB5C,GADK,GAAID,YAAW6C,GACf,GAAI3C,YAAW2C,IAEpBnL,GADWuI,EAAG,GACFA,EAAG,IACf6C,EAAU7C,EAAG,GACbuL,EAAUvL,EAAG,GAEb8C,GADY5D,EAAevI,EAAI,IACd,GA+DrBoM,GAAYlM,EAAMxH,OAASyT,MAIZ,mBAAZ7T,KACPA,EAAOJ,SACHgR,QAASA,EACTM,cAAeA,EACfD,cAAeA,MFowBpBvG,QAAQ,EAAEmF,QAAQ,GAAGjF,UAAU,GAAGmF,UAAU,GAAGgD,OAAS,MAAM6J,GAAG,SAAStd,EAAQU,EAAOJ,GG5zD5F,YAYA,SAASid,GAAcrc,GACnBsF,KAAKgX,KAAOtc,EAkDhB,QAASuc,GAAanZ,EAAKyI,EAAOE,EAAKhF,GAC9BA,IACoB,YAAjB,mBAAO8E,GAAP,YAAA2Q,EAAO3Q,KACP9E,EAAO8E,EACPA,EAAQpE,QAERV,MAIRzB,KAAKlC,IAAMA,EACXkC,KAAKuG,MAAQA,GAAS,EAClBE,IACAzG,KAAKyG,IAAMA,GAEfzG,KAAKyB,KAAOA,EAwKhB,QAAS0V,GAAgBtZ,GACrB,IAAKA,EACD,MAAO,KAIX,KAAK,GADD+D,GAAK,GAAI1F,YAAW2B,EAAO7D,QACtBP,EAAI,EAAGA,EAAImI,EAAG5H,SAAUP,EAC7BmI,EAAGnI,GAAKoE,EAAOuZ,WAAW3d,EAE9B,OAAOmI,GAAGS,OASd,QAAS5D,GAAU4Y,EAAK/c,GAKpB,MAJAsH,GAAG,GAAKyV,EAAI/c,GACZsH,EAAG,GAAKyV,EAAI/c,EAAO,GACnBsH,EAAG,GAAKyV,EAAI/c,EAAO,GACfsH,EAAG,GAAKyV,EAAI/c,EAAO,GAChBqX,EAAG,GAGd,QAASjT,GAAUkD,EAAItH,GACnB,MAAQsH,GAAGtH,EAAS,IAAM,GAAOsH,EAAGtH,EAAS,IAAM,GAAOsH,EAAGtH,EAAS,IAAM,EAAMsH,EAAGtH,EAAS,GAGlG,QAASG,GAAQmH,EAAItH,GACjB,MAAQsH,GAAGtH,EAAS,IAAM,GAAOsH,EAAGtH,EAAS,IAAM,GAAOsH,EAAGtH,EAAS,IAAM,EAAMsH,EAAGtH,GAGzF,QAASiE,GAAUqD,EAAItH,GACnB,MAAQsH,GAAGtH,EAAS,IAAM,EAAMsH,EAAGtH,GAGvC,QAASkE,GAASoD,EAAItH,GAClB,MAAOsH,GAAGtH,GAGd,QAASgd,GAAU1V,EAAItH,GACnB,MAAQsH,GAAGtH,IAAW,GAAOsH,EAAGtH,EAAS,IAAM,GAAOsH,EAAGtH,EAAS,IAAM,EAAMsH,EAAGtH,EAAS,GHuiD9F,GAAI4c,GAA4B,kBAAXK,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAO5X,UAAY,eAAkB8X,GGt0DtQ,IAAwB,mBAAbje,GACP,GAAIqM,GAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,YAEpB6R,EAAOne,EAAQ,UACfoe,EAAWD,EAAKC,SAEhBC,EAAUre,EAAQ,eAAeqe,OAOzCd,GAAcpX,UAAUlE,MAAQ,SAAS8K,EAAOvM,GAC5C,GAAIU,EAeJ,OAXQA,GAFJsF,KAAKgX,KAAKvb,MACNzB,EACIgG,KAAKgX,KAAKvb,MAAM8K,EAAOA,EAAQvM,GAE/BgG,KAAKgX,KAAKvb,MAAM8K,GAGpBvM,EACIgG,KAAKgX,KAAKc,YAAYvR,EAAOA,EAAQvM,GAErCgG,KAAKgX,KAAKc,YAAYvR,GAG3B,GAAIwQ,GAAcrc,IAG7Bqc,EAAcpX,UAAUoL,OAAS,WAAY,MAAO/K,OAEzB,mBAAhB+X,YAGPhB,EAAcpX,UAAUjE,MAAQ,SAASH,GACrC,GAAIkJ,GAAS,GAAIsT,WACjBtT,GAAOuT,UAAY,SAASC,GACxB1c,EAAS4b,EAAgB1S,EAAO5G,UAEpC4G,EAAOyT,mBAAmBlY,KAAKgX,OAOnCD,EAAcpX,UAAUjE,MAAQ,SAASH,GACrC,GAAIkJ,GAAS,GAAI0T,eACjB,KACI,GAAIC,GAAM3T,EAAO4T,kBAAkBrY,KAAKgX,KACxCzb,GAAS6c,GACX,MAAOpf,GACLuC,EAAS,KAAMvC,KAuB3Bie,EAAatX,UAAUlE,MAAQ,SAASrC,EAAGS,GACvC,GAAQ,EAAJT,EACA,KAAM,aAAeA,CAGzB,IAAIkf,GAAKtY,KAAKuG,MAAOgS,EAAKvY,KAAKyG,GAW/B,OAVI6R,IAAMlf,EACNkf,GAAUlf,EAEVkf,EAAKlf,GAAKkf,EAGVC,EADA1e,GAAKye,EACAA,EAAKze,EAAI,EAET0e,GAAM1e,EAAI,EAEZ,GAAIod,GAAajX,KAAKlC,IAAKwa,EAAIC,EAAIvY,KAAKyB,MAGnD,IAAI+W,GAAK,EACLC,EAAiC,mBAAfC,YAClBA,UAAUC,UAAU3b,QAAQ,WAAa,GACzC0b,UAAUC,UAAU3b,QAAQ,UAAY,CAE5Cia,GAAatX,UAAUiZ,YAAc,SAASrd,GAC1C,GAAIuG,GAAQ9B,IAEZA,MAAK6Y,SAASC,KAAK,SAAShb,GACxB,IACI,GACI9D,GADA+e,EAAM,GAAIC,eAOd,KALKP,GAAY3W,EAAML,KAAKwX,OAASnb,EAAId,QAAQ,KAAO,IACpDc,EAAMA,EAAM,SAAW8Z,EAAS,GAAK3I,KAAKC,MAAQ,OAASsJ,IAE/DO,EAAIG,KAAK,MAAOpb,GAAK,GAEjBgE,EAAM2E,IAAK,CACX,GAAI3E,EAAM2E,IAAM3E,EAAMyE,MAAQ,IAC1B,KAAM,gBAEVwS,GAAII,iBAAiB,QAAS,SAAWrX,EAAMyE,MAAQ,IAAMzE,EAAM2E,KACnEzM,EAAS8H,EAAM2E,IAAM3E,EAAMyE,MAAQ,EAGvCwS,EAAIK,mBAAqB,WACrB,MAAsB,IAAlBL,EAAIM,WAEO9d,EADO,KAAdwd,EAAIO,QAA+B,KAAdP,EAAIO,OACTP,EAAIQ,aAEJ,MAJxB,QAQAzX,EAAML,KAAK+X,cACXT,EAAIU,iBAAkB,GAE1BV,EAAIW,OACN,MAAO1gB,GACL,MAAOuC,GAAS,SA/BxByE,SAiCS,SAAS2Z,GAEd,MADAnK,SAAQC,IAAIkK,GACLpe,EAAS,KAAMoe,MAI9B1C,EAAatX,UAAUoL,OAAS,WAC5B,GAAI1R,GAAIyM,EAAY9F,KAAKyB,KAEzB,OADApI,GAAE4f,MAAO,EACF,GAAIhC,GAAajX,KAAKlC,IAAKkC,KAAKuG,MAAOvG,KAAKyG,IAAKpN,IAG5D4d,EAAatX,UAAUkZ,OAAS,WAC5B,MAAI7Y,MAAKyB,KAAKmY,SACH5Z,KAAKyB,KAAKmY,SAAS5Z,KAAKlC,KAAKgb,KAAK,SAAUe,GAC/C,MAAwB,gBAAbA,GACAA,EAEAA,EAAS/b,MAIjB+Z,EAAQiC,QAAQ9Z,KAAKlC,MAIpCmZ,EAAatX,UAAUjE,MAAQ,SAASH,EAAUkG,GAC9C,GAAIK,GAAQ9B,IAEZyB,GAAOA,KACP,IAAIsY,GAAUtY,EAAKsY,SAAW,EAC1BC,EAAkBvY,EAAKuY,eAC3B,OAAID,GAAU,EACHxe,EAAS,UAGpByE,MAAK6Y,SAASC,KAAK,SAAShb,GACxB,IACI,GAAIjC,EACA4F,GAAK5F,UAAYiG,EAAML,KAAK+X,cAC5B3d,EAAUoe,WACN,WAGI,MAFAzK,SAAQC,IAAI,cAAgB3R,GAC5Bib,EAAImB,QACG3e,EAAS,KAAM,YAE1BkG,EAAK5F,SAIb,IACI7B,GADA+e,EAAM,GAAIC,eAOd,KALKP,GAAY3W,EAAML,KAAKwX,OAASnb,EAAId,QAAQ,KAAO,IACpDc,EAAMA,EAAM,SAAW8Z,EAAS,GAAK3I,KAAKC,MAAQ,OAASsJ,IAE/DO,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIoB,iBAAiB,sCACjBrY,EAAM2E,IAAK,CACX,GAAI3E,EAAM2E,IAAM3E,EAAMyE,MAAQ,IAC1B,KAAM,gBAEVwS,GAAII,iBAAiB,QAAS,SAAWrX,EAAMyE,MAAQ,IAAMzE,EAAM2E,KACnEzM,EAAS8H,EAAM2E,IAAM3E,EAAMyE,MAAQ,EAEvCwS,EAAIqB,aAAe,cACnBrB,EAAIK,mBAAqB,WACrB,GAAsB,GAAlBL,EAAIM,WAAiB,CAGrB,GAFIxd,GACAwe,aAAaxe,GACC,KAAdkd,EAAIO,QAA+B,KAAdP,EAAIO,OAAe,CACxC,GAAIP,EAAIuB,SAAU,CACd,GAAIC,GAAKxB,EAAIuB,SAASre,UACtB,QAAIjC,GAAUA,GAAUugB,GAAQP,GAAmBO,GAAMP,EAG9Cze,EAASwd,EAAIuB,UAFbxY,EAAMpG,MAAMH,GAAWwe,QAASA,EAAU,EAAGC,gBAAiBO,IAItE,GAAIxB,EAAIyB,uBACX,MAAOjf,GAASwd,EAAIyB,uBAEpB,IAAIrhB,GAAI4f,EAAIQ,YACZ,QAAIvf,GAAUA,GAAUb,EAAEa,QAAYggB,GAAmB7gB,EAAEa,QAAUggB,EAG1Dze,EAAS4b,EAAgB4B,EAAIQ,eAF7BzX,EAAMpG,MAAMH,GAAWwe,QAASA,EAAU,EAAGC,gBAAiB7gB,EAAEa,SAM/E,MAAO8H,GAAMpG,MAAMH,GAAWwe,QAASA,EAAU,MAIzDjY,EAAML,KAAK+X,cACXT,EAAIU,iBAAkB,GAE1BV,EAAIW,OACN,MAAO1gB,GACL,MAAOuC,GAAS,SA7DxByE,SA+DS,SAAS2Z,GAEd,MADAnK,SAAQC,IAAIkK,GACLpe,EAAS,KAAMoe,KAkB9B,IAAIc,GAAgB,GAAIC,aAAY,GAChC9Y,EAAK,GAAI1F,YAAWue,GACpB9I,EAAK,GAAIC,cAAa6I,EAgCH,oBAAZvgB,KACPA,EAAOJ,SACHid,cAAeA,EACfE,aAAcA,EAEdxc,QAASA,EACT6c,UAAWA,EACX5Y,UAAWA,EACXH,UAAWA,EACXC,SAAUA,EACVC,UAAWA,MHw0DhBkc,SAAS,GAAG1Q,UAAU,GAAG2Q,cAAc,MAAMC,GAAG,SAASrhB,EAAQU,EAAOJ,GIxnE3E,YA8hBA,SAASghB,GAAmBxT,GACxB,GAAIyT,GAAS,IAWb,OAVIzT,GAAI,KACJA,GAAK,IACLyT,EAAS,MACFzT,EAAI,KACXA,GAAK,IACLyT,EAAS,MACFzT,EAAI,MACXA,GAAK,IACLyT,EAAS,MAEN,GAAKrd,KAAKsd,MAAM1T,GAAKyT,EAxiBhC,GAAwB,mBAAbvhB,GAA0B,CACjC,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,YAGpBC,GAFiBvV,EAAMwV,eAElB7hB,EAAQ,iBACb8hB,EAAgBF,EAAGE,cAEnBC,EAAiB/hB,EAAQ,eAI7BA,GAAQ,eACRA,EAAQ,mBACRA,EAAQ,eACRA,EAAQ,kBACRA,EAAQ,gBACRA,EAAQ,aASZ0hB,EAAQvb,UAAU6b,OAAS,SAASC,EAAQC,GACnC1b,KAAK2b,cACP,uBAAwB,uBAAwB,wBAAwBC,QAAQ,SAASC,GACxFC,SAASC,KAAKC,YAAYb,EAAY,OAAQ,IAC5Cc,IAAK,aACLC,KAAMlc,KAAKmc,WAAW,SAAWN,OAEnCvZ,KAAKtC,MAGT,IAAItF,GAAIsF,IAEHtF,GAAE0hB,4BACHpc,KAAKqc,mBAAmB,SAASpE,EAAIqE,EAASC,EAAKC,GAC/C9hB,EAAE+hB,aAAaxE,EAAIqE,EAASC,EAAKC,KAIzCf,EAAOiB,UAAUC,IAAI,YACrB,IAAIC,GAAUliB,EAAEkiB,QAAUzB,EAAY,MAAO,MAAO0B,UAAW,wBAE3DC,EAAQpiB,EAAEqiB,YAAYC,YAAc,IAAMtiB,EAAEuiB,mBAAmBviB,EAAEqiB,YACjE/c,MAAKkd,mBACLpB,SAASgB,MAAQA,EAAQ,gBAG7B,IAAIK,GAAWhC,EAAY,QAAS,IAAK0B,UAAW,aACpDniB,GAAE0iB,YAAYD,EAAU,wCACxB,IAAIE,GAAiBlC,EAAY,IAAK,IAAK0B,UAAW,eAElDS,EAAYnC,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,wBAAyBA,UAAW,QACrGU,EAAa,GAAIhC,IAAgBiC,MAAO9iB,EAAE+iB,iBAC9C/iB,GAAE0iB,YAAYG,EAAY,qHAE1B,IAAIG,GAAavC,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,yBAA0BA,UAAW,QAEvGc,EAAwBxC,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,mBAAoBA,UAAW,QAE5Ge,EAAczC,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,iBAAkBA,UAAW,QAChGgB,EAAS1C,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,qBAAsBA,UAAW,QAC/FiB,EAAS3C,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,kBAAmBA,UAAW,QAE5FkB,GADW5C,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,oBAAqBA,UAAW,QACnF1B,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,iBAAkBA,UAAW,SAC/FmB,EAAa7C,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,qBAAsBA,UAAW,QAEnGoB,EAAiB9C,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,iBAAkBA,UAAW,OACvGniB,GAAE0iB,YAAYa,EAAgB,4CAE9B,IAAIC,GAAiB/C,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,uBAAwBA,UAAW,QAASW,MAAO,QACzHW,EAAkBhD,EAAY,KAAMA,EAAY,IAAK,MAAO0B,UAAW,wBAAyBA,UAAW,mBAAoBW,MAAO,QAEtIY,EAAcjD,EAAY,MAAO,MAAO0B,UAAW,wBAClD7c,MAAKqe,cACND,EAAYpC,YAAY4B,GACvB5d,KAAKse,eACNF,EAAYpC,YAAYiC,GACvBje,KAAKue,UACNH,EAAYpC,YAAY8B,GACvB9d,KAAKwe,WACNJ,EAAYpC,YAAY+B,GACvB/d,KAAKye,QACNL,EAAYpC,YAAYgC,GAE5Bhe,KAAK0e,UAAY,SAAS5V,GACtB9I,KAAK2e,OAAS7V,CACd,IAAI8V,IAAMC,KAAMb,EAAYrB,IAAKiB,EAAanc,KAAMsc,EAAYe,SAAUhB,EAAQtB,KAAMyB,EACxF,KAAK,GAAI3W,KAAKsX,GACNtX,GAAKwB,EACL8V,EAAGtX,GAAGoV,UAAUC,IAAI,UAEpBiC,EAAGtX,GAAGoV,UAAUqC,OAAO,WAI9B/e,KAAKgf,eACNpC,EAAQZ,YAAYmC,GAEpBC,EAAYa,YACZrC,EAAQZ,YAAYoC,GAEnBpe,KAAKgf,eACNpC,EAAQZ,YAAYkC,GACnBle,KAAKkf,SACNtC,EAAQZ,YAAYb,EAAY,MAAOA,EAAY,KAAM2B,MAAYqC,OAAQ,SAAUtC,UAAW,qBAEjG7c,KAAKof,iBACNxC,EAAQZ,YAAYb,EAAY,OAAQgC,EAAUE,IAAkBR,UAAW,yBAC9E7c,KAAKqf,yBACNzC,EAAQZ,YAAY2B,GAEnB3d,KAAKsf,cACN1C,EAAQZ,YAAYb,EAAY,OAAQmC,EACAnC,EAAY,OAAQoC,GAAaV,UAAW,QAC5Ca,IAAcb,UAAW,eAGjE7c,KAAKuf,cACL9D,EAAOO,YAAYN,GACnBD,EAAOO,YAAYY,KAEnBnB,EAAOO,YAAYY,GACnBnB,EAAOO,YAAYN,GAIvB,IAAI8D,GAAM9hB,KAAK+R,IAAI,GAAK/R,KAAK+R,IAAI,IAC7BgQ,EAAM/hB,KAAK+R,IAAI,GAAK/R,KAAK+R,IAAI,IAC7BiQ,EAAmB,SAASpY,GAC5B,GAIIqY,GAJAC,GAAOtY,EAAI5M,EAAEmlB,SAAWniB,KAAK+R,IAAI/U,EAAEolB,WAAapiB,KAAK+R,IAAI,IAEzDsQ,EAAY,EAAJH,EACRI,EAAOJ,EAAMG,CAajB,OATIJ,GADO,IAAPK,EACUD,EACIP,EAAM,KAAfQ,EACKD,EAAQP,EACJC,EAAM,KAAfO,EACKD,EAAQN,EAERM,EAAQ,GAGdJ,EAAUjiB,KAAK+R,IAAI,IAAK/R,KAAK+R,IAAI/U,EAAEolB,WAAaplB,EAAEmlB,UAG1DI,EAAa,SAAS3Y,GACtBiW,EAAW2C,SAAS5Y,EAAGwT,EAAmBpd,KAAKyiB,IAAI7Y,EAAI5M,EAAEmlB,UAAYnlB,EAAEolB,WAG3E9f,MAAKogB,gBAAgB,SAAS5e,EAAK7D,EAAKmC,EAAKugB,EAAU5L,GACnD0I,EAAS/Y,MAAS5C,EAAM,IAAM8Z,EAAc3d,GAAO,KAAO2d,EAAcxb,GACxEyd,EAAW5f,IAAe,EAAT8W,EAAK9W,IACtB4f,EAAWzd,IAAe,EAAT2U,EAAK3U,IAClB2U,EAAK6L,eACL/C,EAAWnZ,MAAQqQ,EAAK8L,UACxBhD,EAAWiD,OAAS/L,EAAKgM,QACzBlD,EAAWmD,OAAS,IAEpBnD,EAAWnZ,MAAQqQ,EAAKgM,QACxBlD,EAAWiD,OAAS/L,EAAK8L,UACzBhD,EAAWmD,OAAS,GAGpBjM,EAAKgM,SAAWhM,EAAK9W,IACrB2f,EAAUZ,UAAUC,IAAI,YAExBW,EAAUZ,UAAUqC,OAAO,YAE3BtK,EAAKgM,SAAWhM,EAAK3U,IACrB4d,EAAWhB,UAAUC,IAAI,YAEzBe,EAAWhB,UAAUqC,OAAO,YAEhCxB,EAAWoD,cACX,IAAIC,GAAOnM,EAAK9W,IACZkjB,EAAOpM,EAAK3U,IACZghB,EAASD,EAAOD,EAGhBG,EAAiB,CACjBrmB,GAAE+iB,iBAAmB/iB,EAAE+iB,gBAAkB,MACzCsD,EAAiB,GACrBd,EAAWP,EAAiBkB,GAC5B,KAAK,GAAII,GAAM,EAASD,EAAiB,EAAvBC,IAA4BA,EAC1Cf,EAAWP,EAAiBkB,EAAQ,EAAMI,EAAMF,GAAUC,EAAgB,IAE9Ed,GAAWP,EAAiBmB,IAExBnmB,EAAEumB,aACFvmB,EAAEwmB,kBAGFxmB,EAAEymB,WAAWnnB,OAAS,EACtB2jB,EAAsByD,MAAMC,QAAU,eAEtC1D,EAAsByD,MAAMC,QAAU,SAI9CrhB,KAAKshB,gBAAgB,WACb5mB,EAAEumB,aACFvmB,EAAE6mB,oBAIVpE,EAASqE,iBAAiB,UAAW,SAASvJ,GAIxC,GAHgB,IAAdA,EAAGwJ,UACHxJ,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBjnB,EAAEknB,gBAAgB,IACF,IAAd3J,EAAGwJ,SAA+B,IAAdxJ,EAAGwJ,QAAe,CACxCxJ,EAAGyJ,gBAGH,IAAIG,GAAI1E,EAAS/Y,KACjB1J,GAAEonB,OAAOD,EAAG,SAASlI,GACbA,EACA0D,EAAe0E,YAAc,GAAKpI,EAElC0D,EAAe0E,YAAc,QAI1C,EAEH,IAAIC,EACJpE,GAAY4D,iBAAiB,QAAS,SAASvJ,GACvC+J,GAAiBA,EAAcC,UAC/BvnB,EAAEwnB,kBAEFF,EAAgBtnB,EAAEynB,eAAelK,KAEtC,GACHvd,EAAE0iB,YAAYQ,EAAa,6DAE3BN,EAAUkE,iBAAiB,QAAS,SAASvJ,GAC3CA,EAAG0J,kBAAmB1J,EAAGyJ,iBAEzBhnB,EAAE0nB,SAAS,OACV,GACH1nB,EAAE0iB,YAAYE,EAAW,eAEzBI,EAAW8D,iBAAiB,QAAS,SAASvJ,GAC5CA,EAAG0J,kBAAmB1J,EAAGyJ,iBAEzBhnB,EAAE0nB,SAAS,MACV,GACH1nB,EAAE0iB,YAAYM,EAAY,gBAE1BH,EAAWiE,iBAAiB,SAAU,SAASvJ;AAC3C,GAAIoK,GAAgC,GAArB9E,EAAWmD,MACtB2B,IAAY3nB,EAAE4lB,gBACd5lB,EAAE4nB,UAAY5nB,EAAE6nB,gBAAmB7nB,EAAE8nB,QACrC9nB,EAAE4lB,cAAgB+B,EAEtB,IAAII,GAAiC,GAArBlF,EAAWmD,OAAcnD,EAAWnZ,MAAQmZ,EAAWiD,MAE1E9lB,GAAE6nB,gBAAmB,EAAME,EAC3B/nB,EAAE+Z,KAAK/W,KAAKyiB,IAAK,EAAMsC,EAAa/nB,EAAEmlB,aACpC,GAEHhC,EAAO2D,iBAAiB,QAAS,SAASvJ,GACvCA,EAAG0J,kBAAmB1J,EAAGyJ,mBACzB,GACHhnB,EAAE0iB,YAAYS,EAAQ,qBAEtBC,EAAO0D,iBAAiB,QAAS,SAASvJ,GACvCA,EAAG0J,kBAAmB1J,EAAGyJ,iBACxBhnB,EAAEgoB,oBACH,GACHhoB,EAAE0iB,YAAYU,EAAQ,sCAGtBC,GAAWyD,iBAAiB,QAAS,SAASvJ,GAC1CA,EAAG0J,kBAAmB1J,EAAGyJ,iBAEzBhnB,EAAEioB,gBAAgB1K,KACnB,GACHvd,EAAE0iB,YAAYW,EAAY,sBAE1BC,EAAWwD,iBAAiB,QAAS,SAASvJ,GAC1CA,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBhnB,EAAEkoB,gBAAgB3K,KAEtBvd,EAAE0iB,YAAYY,EAAY,iCAE1BC,EAAeuD,iBAAiB,QAAS,SAASvJ,GAC9CA,EAAG0J,kBAAmB1J,EAAGyJ,iBACK,GAA1BhnB,EAAEmoB,cAAc7oB,QAChBU,EAAEooB,cAAcpoB,EAAEqoB,MAAMroB,EAAEmoB,cAAc,OAE7C,GAEH3E,EAAesD,iBAAiB,QAAS,SAASvJ,GAC9Cvd,EAAEsoB,KAAKtoB,EAAEuoB,oBAAsB,GAAK,GAAG,KACxC,GACHvoB,EAAE0iB,YAAYc,EAAgB,SAASjG,GACnC,GACIuE,GADA0G,EAAKxoB,EAAEyoB,iBAKX,OAHID,IAAM,IACN1G,EAAO9hB,EAAEqoB,MAAMG,IAEf1G,GAAQA,EAAK4G,eAAiB1oB,EAAE2oB,uBAAuB7G,EAAK4G,cAAe,cAAmD,gBAA5B5G,GAAK8G,mBAChG,oFAAsF9G,EAAK+G,OAAOzmB,MAAQ0f,EAAKgH,UAAU1mB,MAAQ,iBACjI0f,GAAQA,EAAK4G,eAAiB1oB,EAAE2oB,uBAAuB7G,EAAK4G,cAAe,QAC3E,oDAAsD5G,EAAK+G,OAAOzmB,MAAQ0f,EAAKgH,UAAU1mB,MAAQ,gBAEjG,2BAIfqhB,EAAgBqD,iBAAiB,QAAS,SAASvJ,GAC/Cvd,EAAEsoB,KAAKtoB,EAAEuoB,oBAAsB,EAAI,IAAI,KACxC,GACHvoB,EAAE0iB,YAAYe,EAAiB,SAASlG,GACpC,GACIuE,GADA0G,EAAKxoB,EAAEyoB,iBAKX,OAHID,IAAM,IACN1G,EAAO9hB,EAAEqoB,MAAMG,IAEf1G,GAAQA,EAAK4G,eAAiB1oB,EAAE2oB,uBAAuB7G,EAAK4G,cAAe,cAAmD,gBAA5B5G,GAAK8G,mBAChG,oFAAsF9G,EAAK+G,OAAOzmB,MAAQ0f,EAAKgH,UAAU1mB,MAAQ,kBACjI0f,GAAQA,EAAK4G,eAAiB1oB,EAAE2oB,uBAAuB7G,EAAK4G,cAAe,QAC3E,oDAAsD5G,EAAK+G,OAAOzmB,MAAQ0f,EAAKgH,UAAU1mB,MAAQ,iBAEjG,6BAGfpC,EAAE+oB,yBAAyB,WACvB,GACIjH,GADA0G,EAAKxoB,EAAEyoB,iBAEPD,IAAM,IACN1G,EAAO9hB,EAAEqoB,MAAMG,GAEnB,IAAIQ,IAAU,CACVlH,IAAQA,EAAK4G,gBACT1oB,EAAE2oB,uBAAuB7G,EAAK4G,cAAe,cAAmD,gBAA5B5G,GAAK8G,mBACzEI,GAAU,EACLhpB,EAAE2oB,uBAAuB7G,EAAK4G,cAAe,UAClDM,GAAU,IAGlBxF,EAAee,WAAWpC,UAAY6G,EAAU,0BAA4B,mBAC5EvF,EAAgBc,WAAWpC,UAAY6G,EAAU,2BAA6B,sBAGlF/F,EAAsB6D,iBAAiB,QAAS,SAASvJ,GACrDvd,EAAEipB,oBACH,GACHjpB,EAAE0iB,YAAYO,EAAuB,wBAErCjjB,EAAEkpB,6BAA6B,SAASvQ,GAC1B,EAANA,IACA3Y,EAAEknB,gBAAgB,MAClBzE,EAAS0G,WAIjBnpB,EAAE+oB,yBAAyB,SAASK,GAChC,GAAiB,SAAbppB,EAAEikB,OACF,GAAkB,GAAdmF,EAAI9pB,OACJU,EAAEqpB,gBACFrpB,EAAEspB,iBAAmB,KACrBtpB,EAAEikB,OAAS,WACR,CACH,GAAIsF,GAAKvpB,EAAEqoB,MAAMe,EAAI,GACjBG,IAAMvpB,EAAEspB,kBACRtpB,EAAEooB,cAAcmB,KAMhC,IAAIC,GAAe,SAASjM,GAEN,IAAdA,EAAGwJ,SAA+B,IAAdxJ,EAAGwJ,SACvBxJ,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBjnB,EAAEynB,kBACmB,IAAdlK,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,SAC9BxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBhnB,EAAEkoB,gBAAgB3K,IACG,IAAdA,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,SAC9BxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACK,GAA1BhnB,EAAEmoB,cAAc7oB,QAChBU,EAAEooB,cAAcpoB,EAAEqoB,MAAMroB,EAAEmoB,cAAc,MAEvB,IAAd5K,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,SAC9BxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBhnB,EAAEgoB,oBACmB,IAAdzK,EAAGwJ,SAA+B,IAAdxJ,EAAGwJ,WAC9BxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBhnB,EAAEipB,mBAIVlI,GAAO+F,iBAAiB,QAAS,SAASvJ,GACtCwD,EAAO+F,iBAAiB,UAAW0C,GAAc,KAClD,GACHzI,EAAO+F,iBAAiB,OAAQ,SAASvJ,GACrCwD,EAAO0I,oBAAoB,UAAWD,GAAc,KACrD,GAEHzI,EAAO+F,iBAAiB,UAAW,SAASvJ,GACrB,KAAfA,EAAGwJ,SACc,SAAb/mB,EAAEikB,SAEF1G,EAAGyJ,iBACHzJ,EAAG0J,kBACHjnB,EAAEgkB,UAAU,QACZhkB,EAAEqpB,gBAEErpB,EAAEmoB,eAAiBnoB,EAAEmoB,cAAc7oB,OAAS,GAC5CU,EAAE0pB,cAAcP,WAI7B,IAGP3I,EAAQvb,UAAU0kB,cAAgB,SAASC,EAAOC,GAC9C,GAAIziB,GAAQ9B,IAERA,MAAKwkB,iBACLxkB,KAAKwkB,gBAAgBC,cAAcC,YAAY1kB,KAAKwkB,gBAGxD,IAAIG,EAEAA,GADAJ,EACUD,EAEAnJ,EAAY,MAAOmJ,MAAYM,UAAW,OAAQpH,MAAO,QAGvE,IAAIqH,GAAU1J,EAAY,MAAOA,EAAY,IAAK,MAAO0B,UAAW,uBAAwBA,UAAW,gBACvGgI,GAAQrD,iBAAiB,QAAS,SAASvJ,GACvCnW,EAAMiiB,gBACNjiB,EAAM4c,UAAU,UACjB,GACH1e,KAAKod,YAAYyH,EAAS,0BAC1B7kB,KAAKwkB,gBAAkBrJ,EAAY,OAAQ0J,EAASF,IAAW9H,UAAW,gBAC1E7c,KAAK8kB,UAAU9I,YAAYhc,KAAKwkB,iBAChCxkB,KAAK+kB,cAEL,IAAIjjB,GAAQ9B,MAGhBkb,EAAQvb,UAAUokB,cAAgB,WAC1B/jB,KAAKwkB,iBACLxkB,KAAKwkB,gBAAgBC,cAAcC,YAAY1kB,KAAKwkB,iBAExDxkB,KAAK8kB,UAAU1D,MAAM5D,MAAQ,OAC7Bxd,KAAKwkB,gBAAkB,KACvBxkB,KAAK+kB,gBAGT7J,EAAQvb,UAAUijB,gBAAkB,SAAS3K,GACzC,GAAoB,SAAhBjY,KAAK2e,OACL3e,KAAK+jB,gBACL/jB,KAAK0e,UAAU,YACZ,CACH,GAAIsG,GAAY7J,EAAY,SAAU,MAAO8J,UAAW,MAAOC,SAAU,WAAYC,IAAKnlB,KAAKmc,WAAW,qBAAsBU,UAAW,cAC3I7c,MAAKqkB,cAAcW,GAAW,GAC9BhlB,KAAK0e,UAAU,UAIvBxD,EAAQvb,UAAUgjB,gBAAkB,SAAS1K,GACzC,GAAIvd,GAAIsF,IAER,IAAoB,SAAhBA,KAAK2e,OACL3e,KAAK+jB,gBACL/jB,KAAK0e,UAAU,YACZ,CACH,GAAI0G,GAAWjK,EAAY,MAAO,MAAO0B,UAAW,oBAAqBwI,UAAW,aAAcC,aAAc,aAAcjE,QAAS,eAAgBkE,cAAe,QAClKC,EAAYrK,EAAY,QAC5BqK,GAAUC,YAAc,CAExB,IAAIC,GAAmBvK,EAAY,QAAS,IAAK7W,KAAM,WAAYqhB,QAASjrB,EAAEkrB,kBAC9EF,GAAiBlE,iBAAiB,SAAU,SAASvJ,GACjDvd,EAAEkrB,iBAAmBF,EAAiBC,QACtCjrB,EAAEumB,gBACH,GACHuE,EAAUxJ,YAAYb,EAAY,MAAOA,EAAY,KAAM,8BAA+B0K,MAAO,UAAW1K,EAAY,KAAMuK,KAE9H,IAAII,GAAkB3K,EAAY,QAAS,IAAK7W,KAAM,WAAYqhB,QAASjrB,EAAEuoB,qBAC7E6C,GAAgBtE,iBAAiB,SAAU,SAASvJ,GAChDvd,EAAEuoB,oBAAsB6C,EAAgBH,QACxCjrB,EAAEumB,gBACH,GACHuE,EAAUxJ,YAAYb,EAAY,MAAOA,EAAY,KAAM,sCAAuC0K,MAAO,UAAW1K,EAAY,KAAM2K,KAGtI,IAAIC,GAAc5K,EAAY,SAC9B4K,GAAY/J,YAAYb,EAAY,SAAU,QAAS/W,MAAO,UAC9D2hB,EAAY/J,YAAYb,EAAY,SAAU,UAAW/W,MAAO,YAChE2hB,EAAY/J,YAAYb,EAAY,SAAU,SAAU/W,MAAO,WAC/D2hB,EAAY/J,YAAYb,EAAY,SAAU,QAAS/W,MAAO,UAC9D2hB,EAAY3hB,MAAQ1J,EAAEsrB,cACtBD,EAAYvE,iBAAiB,SAAU,SAASvJ,GAC5Cvd,EAAEsrB,cAAgBD,EAAY3hB,MAC9B1J,EAAEurB,eACF,KAAK,GAAIpd,GAAK,EAAGA,EAAKnO,EAAEqoB,MAAM/oB,SAAU6O,EACpCnO,EAAEqoB,MAAMla,GAAIqd,YAEhBxrB,GAAEumB,gBACH,GACHuE,EAAUxJ,YAAYb,EAAY,MAAOA,EAAY,KAAM,sBAAuB0K,MAAO,UAAW1K,EAAY,KAAM4K,KAEtH,IAAII,GAA4BhL,EAAY,QAAS,IAAK7W,KAAM,WAAYqhB,QAASjrB,EAAE0rB,qBACvFD,GAA0B3E,iBAAiB,SAAU,SAASvJ,GAC1Dvd,EAAE0rB,oBAAsBD,EAA0BR,QAClDjrB,EAAEurB,gBACFvrB,EAAEumB,gBACH,GACHkF,EAA0BE,aAAa,KAAK,8BAC5Cb,EAAUxJ,YAAYb,EAAY,MAAOA,EAAY,KAAM,iDAAkD0K,MAAO,UAAW1K,EAAY,KAAMgL,MAEjJf,EAASpJ,YAAYwJ,EAErB,IAAIc,GAAcnL,EAAY,SAAU,iBAAkB0B,UAAW,QAAS0J,WAAY,OAAQC,YAAa,OAAQnF,QAAS,SAChIiF,GAAY9E,iBAAiB,QAAS,SAASvJ,GAC3Cvd,EAAE+rB,UACH,GACHrB,EAASpJ,YAAYsK,GAErBtmB,KAAKqkB,cAAce,GACnBplB,KAAK0e,UAAU,YJgnEpBgI,aAAa,EAAEC,kBAAkB,GAAGC,iBAAiB,GAAGC,cAAc,GAAGC,eAAe,GAAGC,YAAY,GAAGC,eAAe,GAAGC,cAAc,GAAGhd,UAAU,GAAGid,eAAe,KAAKC,GAAG,SAAS3tB,EAAQU,EAAOJ,GK1oF5M,YA6CA,SAASstB,GAAO5lB,EAAK7D,EAAKmC,GACtBE,KAAKrC,IAAMA,EACXqC,KAAKF,IAAMA,EACXE,KAAKwB,IAAMA,EAGf,QAAS0Z,GAAQzZ,GAiIb,GAhIKA,IACDA,MAGJzB,KAAKqnB,WACCC,UAAWC,EACXC,MAASC,EACTC,MAASC,EACTC,IAAOC,GAGb7nB,KAAK8nB,gBAAkBrmB,EAAKsmB,UAAYR,EAExCvnB,KAAKgoB,OAAS,uCAEdhoB,KAAKioB,WACLjoB,KAAK+iB,SACL/iB,KAAKkoB,cAELloB,KAAKmoB,qBACLnoB,KAAKooB,2BAELpoB,KAAKqoB,oBACLroB,KAAKsoB,yBACLtoB,KAAKuoB,iBACLvoB,KAAKwoB,yBACLxoB,KAAKyoB,iBACLzoB,KAAK0oB,0BACL1oB,KAAK2oB,8BAEL3oB,KAAK4oB,UAAY,UAEjB5oB,KAAK6oB,UAEL7oB,KAAK8oB,SAAW,YAChB9oB,KAAK+oB,WAAa,EAClB/oB,KAAKgpB,iBAAmB,GACxBhpB,KAAKipB,OAAS,EACdjpB,KAAKkpB,eAAiB,EACtBlpB,KAAKmpB,kBAAoB,IACzBnpB,KAAK8f,SAAW,IAChB9f,KAAK6f,SAAW,GAChB7f,KAAKuiB,gBAAkB,IACvBviB,KAAKopB,YAAc,KACnBppB,KAAKqpB,cAAgB,GAErBrpB,KAAKmhB,cACLnhB,KAAK6iB,eAAiB,GAEtB7iB,KAAKspB,aAAe,IACpBtpB,KAAKupB,kBAAoB,IAEzBvpB,KAAKwpB,kBAAoB,GACzBxpB,KAAKypB,oBAAsB,IAE3BzpB,KAAK0pB,cAAgB,IACrB1pB,KAAK2pB,cAAgB,IAIrB3pB,KAAK4lB,kBAAmB,EACxB5lB,KAAKgmB,cAAgB,SACrBhmB,KAAK4pB,qBAAuB,MAC5B5pB,KAAK6pB,sBAAwB,GAC7B7pB,KAAK8pB,kBAAmB,EACxB9pB,KAAK+pB,aAAc,EACnB/pB,KAAKgqB,cAAe,EACpBhqB,KAAKiqB,cAAe,EACpBjqB,KAAKomB,qBAAsB,EAK3BpmB,KAAKkqB,sBAAwB,mBAAoB,SACjDlqB,KAAKmqB,cAAgB,GACrBnqB,KAAKoqB,iBAAkB,EAIvBpqB,KAAKqqB,iBAAmB,GAAIC,GAC5BtqB,KAAKuqB,kBACLvqB,KAAKwqB,mBAILxqB,KAAKyqB,SAAW,KAChBzqB,KAAK0qB,gBAAiB,EAEtB1qB,KAAK2qB,qBAAuB,KAE5B3qB,KAAK4qB,QACL5qB,KAAK6qB,cAEL7qB,KAAK8qB,YAAc,GAAIC,GAEvB/qB,KAAKgrB,QAAS,EAEdhrB,KAAKirB,iBAAkB,EACvBjrB,KAAKkrB,WAAa,EAClBlrB,KAAKmrB,WAAa,kBAClBnrB,KAAKorB,aACLprB,KAAKqrB,aAAe,EAEpBrrB,KAAKsrB,qBAAsB,EAC3BtrB,KAAKurB,kBAAmB,EAExBvrB,KAAKwrB,2BAA6B,IAIlCxrB,KAAKyrB,cAAgB,8CACrBzrB,KAAK0rB,eAAiB,oCAEtB1rB,KAAK2rB,iBAEDlqB,EAAKmqB,WACL5rB,KAAK4rB,WAAanqB,EAAKmqB,WAEvB5rB,KAAK4rB,YACDC,EAAG,QACHC,EAAG,OACHC,EAAG,SACHC,EAAG,MACHC,IAAM,UACNC,EAAM,OAIS/pB,SAAnBV,EAAK0qB,WAAsD,gBAApB1qB,GAAK0qB,UAC5C,KAAMxyB,OAAM,+BAEhB,IAAqBwI,SAAjBV,EAAK2qB,SAAkD,gBAAlB3qB,GAAK2qB,QAC1C,KAAMzyB,OAAM,6BAEhB,IAAgCwI,SAA5BV,EAAK4qB,oBAAwE,gBAA7B5qB,GAAK4qB,mBACrD,KAAM1yB,OAAM,wCAGhB,KAAK,GAAIyX,KAAK3P,GACVzB,KAAKoR,GAAK3P,EAAK2P,EAQnB,IAL8B,gBAAnB3P,GAAK6qB,UAAkD,gBAAjB7qB,GAAKumB,SAClDhoB,KAAKgoB,OAASvmB,EAAK6qB,UAInBtsB,KAAKgoB,OAAOhrB,QAAQ,MAAQ,GAAkC,IAA7BgD,KAAKgoB,OAAOhrB,QAAQ,KAAY,CACjE,GAAIuvB,GAAWC,OAAOD,SAASE,QAC3BD,QAAOD,SAASG,OAChBH,GAAY,IAAMC,OAAOD,SAASG,MAEtC1sB,KAAKgoB,OAAS,KAAOuE,EAAWvsB,KAAKgoB,OAEzC,GAAkC,IAA9BhoB,KAAKgoB,OAAOhrB,QAAQ,MAAa,CACjC,GAAI2vB,GAAQH,OAAOD,SAASK,QACf,UAATD,GAA6B,UAATA,IAGpBnd,QAAQC,IAAI+c,OAAOD,SAASK,UAC5Bpd,QAAQC,IAAI,sDAAwDzP,KAAKgoB,OAAS,wCAClFhoB,KAAKgoB,OAAS,QAAUhoB,KAAKgoB,QAIrC,IAAKhoB,KAAK+c,YACN,KAAMpjB,OAAM,uCAGhB,IAAiBwI,SAAbnC,KAAKwB,KAAwCW,SAAnBnC,KAAKmsB,WAA4ChqB,SAAjBnC,KAAKosB,QAC/D,KAAMzyB,OAAM,iDAGhB,IAAImI,GAAQ9B,IAEZ,IAA4B,aAAxB8b,SAASzC,WACTvX,EAAM+qB,eACH,CACH,GAAIC,GAAe,QAAfA,GAAwB7U,GACxBuU,OAAOrI,oBAAoB,OAAQ2I,GAAc,GACjDhrB,EAAM+qB,WAEVL,QAAOhL,iBAAiB,OAAQsL,GAAc,IAquCtD,QAASC,GAAWC,EAAK3C,EAAkB4C,GACvC,GAAIA,EACA,IAAK,GAAI7zB,GAAI,EAAGA,EAAIixB,EAAiBrwB,SAAUZ,EAC3CixB,EAAiBjxB,GAAG8zB,QAAUD,CAGtCD,GAAIG,IAAI9C,GAq7BZ,QAAS+C,GAAYC,EAAQC,EAAIC,EAAIC,GACjCA,EAAUA,KAEV,KAAK,GAAIC,GAAKJ,EAAOrzB,OAAS,EAAGyzB,GAAM,IAAKA,EAAI,CAC5C,GAAI5L,GAAIwL,EAAOI,EACf,KAAK5L,EAAE6L,eAAiB7L,EAAElkB,OAAS2vB,GAAMzL,EAAE/hB,OAASwtB,EAAI,CACpD,GAAIzL,EAAE8L,OACEJ,EAAK1L,EAAE8L,QAAUJ,EAAK1L,EAAE+L,QACxB,QASR,OANI/L,GAAEvF,QACFkR,EAAQtwB,KAAK2kB,EAAEvF,SACRuF,EAAEgM,OACTL,EAAQtwB,KAAK2kB,EAAEgM,OAGfhM,EAAEwL,OACKD,EAAYvL,EAAEwL,OAAQC,EAAIC,EAAIC,GAC9B3L,EAAE1Y,MACFikB,GAAavL,EAAE1Y,OAAQmkB,EAAIC,EAAIC,GAE/BA,GAInB,MAAOA,GAgFX,QAASM,GAAY7S,EAAS8S,GAC1B,GAAIjsB,GAAQ9B,IACZA,MAAKguB,QAAU,EACfhuB,KAAKiuB,aACLjuB,KAAKib,QAAUA,EACfjb,KAAK+tB,OAASA,EAEd/tB,KAAK+tB,OAAOG,UAAY,SAASjW,GAC7B,GAAI7c,GAAO6c,EAAG7c,IAEd,IAAKA,EAAK+yB,IAMH,GAAgB,WAAZ/yB,EAAK+yB,IAAkB,CAC9B,GAAIvU,GAAW9X,EAAMmZ,QAAQmQ,UAAUhwB,EAAKwe,SACxCA,GACAA,EAASxe,EAAK0C,KAAKgb,KAAK,SAAShb,GAC7BgE,EAAMisB,OAAOK,aACT/pB,IAAKjJ,EAAKiJ,IACVvG,IAAKA,MAHb8b,SAKS,SAASD,GACdnK,QAAQC,IAAIkK,GACZ7X,EAAMisB,OAAOK,aACT/pB,IAAKjJ,EAAKiJ,IACVsV,IAAKA,EAAItd,eAIjBmT,QAAQC,IAAI,eAAiBrU,EAAKwe,cAGtCpK,SAAQC,IAAI,uBAAyBrU,EAAK+yB,SAzB/B,CACX,GAAIE,GAAKvsB,EAAMmsB,UAAU7yB,EAAKiJ,IAC1BgqB,KACAA,EAAGjzB,EAAKyC,OAAQzC,EAAKkzB,aACdxsB,GAAMmsB,UAAU7yB,EAAKiJ,QA0B5C,QAASkqB,GAAgBtT,GACrB,GAAIuT,GAAOvT,EAAQkB,WAAWlB,EAAQkQ,WACtC,IAA0B,GAAtBqD,EAAKxxB,QAAQ,MAAY,CACzB,GAAI2vB,GAAQH,OAAOD,SAASK,QAExB4B,GADS,UAAT7B,EACO,SAAW6B,EAEX,QAAUA,EAGzB,GAAIC,GAAU,kBAAoBD,EAAO,YAAcE,EAAU,MAC7DC,EAAQ,GAAIC,OAAMH,IAAWnqB,KAAM,0BAGvC,OAAO,IAAIuT,GAAQ,SAASiC,EAAS+U,GACjC,GAAId,GAAS,GAAIe,QAAOC,IAAIC,gBAAgBL,GAE5CZ,GAAOG,UAAY,SAASjW,GACJ,SAAhBA,EAAG7c,KAAKiJ,MACRmL,QAAQC,IAAI,sBACZqK,EAAQ,GAAIgU,GAAY7S,EAAS8S,MAKzCA,EAAOkB,QAAU,SAAShX,GACtB4W,EAAO5W,EAAGiX,YAuCtB,QAASnE,KACL/qB,KAAKmvB,gBA5lFT,GAAwB,mBAAb31B,GACP,GAAIqM,GAAQrM,EAAQ,WAChB8wB,EAAWzkB,EAAMykB,SAEjBnP,GADUtV,EAAMupB,QACFvpB,EAAMsV,aACpBE,EAAiBxV,EAAMwV,eACvBgU,EAAcxpB,EAAMwpB,YACpBvpB,EAAcD,EAAMC,YACpBwpB,EAAUzpB,EAAMypB,QAEhB9S,EAAOhjB,EAAQ,UACf+1B,EAAU/S,EAAK+S,QAEf5X,EAAOne,EAAQ,UACfg2B,EAAW7X,EAAK6X,SAEhBC,EAAOj2B,EAAQ,UACfk2B,EAAkBD,EAAKC,gBAEvBhB,EAAUl1B,EAAQ,aAElB4hB,EAAK5hB,EAAQ,gBACbm2B,EAAmBvU,EAAGuU,iBACtBrU,EAAgBF,EAAGE,cAEnBsU,EAAWp2B,EAAQ,cAAco2B,SAEjC/X,EAAUre,EAAQ,eAAeqe,QAEjCgY,EAAgBr2B,EAAQ,mBACxBs2B,EAAkBD,EAAcC,gBAChCC,EAA6BF,EAAcE,2BAC3CC,EAAgBH,EAAcG,cAG9BzI,GAFiBsI,EAAcI,eAEbz2B,EAAQ,uBAE1BmuB,EAAgBnuB,EAAQ,oBACxBquB,EAAcruB,EAAQ,kBAEtBiuB,EAAgBjuB,EAAQ,mBAoMhC0hB,GAAQvb,UAAUwc,WAAa,SAASre,GACpC,MAAOA,GAAIC,QAAQ,KAAMiC,KAAKgoB,SAGlC9M,EAAQvb,UAAUuwB,QAAU,WAExB,GADA1D,OAAOrI,oBAAoB,SAAUnkB,KAAKmwB,gBAAgB,GACtDnwB,KAAKowB,aAAc,CAAA,GAAAC,IAAA,EAAAC,GAAA,EAAAC,EAAApuB,MAAA,KACnB,IAAA,GAAAquB,GAAAC,EAAqBzwB,KAAKowB,aAA1B7Y,OAAAC,cAAA6Y,GAAAG,EAAAC,EAAAC,QAAAC,MAAAN,GAAA,EAAwC,CAAA,GAA7BtC,GAA6ByC,EAAApsB,KACpC2pB,GAAO6C,aAFQ,MAAAjX,GAAA2W,GAAA,EAAAC,EAAA5W,EAAA,QAAA,KAAA0W,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,OAO3BrV,EAAQvb,UAAUktB,SAAW,WACzB,GAAIgE,GAAO7wB,KACP8B,EAAQ9B,IAEZ,IAAIA,KAAK8wB,eAEL,WADAthB,SAAQC,IAAI,0EAMhB,IAFAzP,KAAK8wB,gBAAiB,EAEI,mBAAfpY,WAA4B,CACnC,GAAIqY,GAAKrY,UAAUC,WAAa,OAC5BoY,GAAG/zB,QAAQ,YAAc,GAAK+zB,EAAG/zB,QAAQ,UAAY,IAErDgD,KAAKgxB,gBAAiB,GAI9BhxB,KAAKixB,WAAajxB,KAAKwB,IACvBxB,KAAKkxB,aAAelxB,KAAKmsB,UACzBnsB,KAAKmxB,WAAanxB,KAAKosB,QACvBpsB,KAAKuqB,iBACL,KAAK,GAAI9wB,GAAI,EAAGA,EAAIuG,KAAKioB,QAAQjuB,SAAUP,EAAG,CAC1C,GAAIL,GAAI4G,KAAKioB,QAAQxuB,EACjBL,IACA4G,KAAKuqB,eAAertB,KAAK9D,GAOjC,GAJI4G,KAAKoxB,gBACLpxB,KAAKqxB,eAAiBrxB,KAAKoxB,iBAG3BpxB,KAAKsxB,gBAAkBtxB,KAAKsxB,yBAA0BC,SACtDvxB,KAAKwxB,oBAAsBxxB,KAAKsxB,mBAC7B,IAAItxB,KAAKsxB,gBAEZ,GADAtxB,KAAKwxB,oBAAsB1V,SAAS2V,eAAezxB,KAAKsxB,iBACnDtxB,KAAKwxB,oBACN,KAAM73B,OAAM,sEAIhB,IADAqG,KAAKwxB,oBAAsB1V,SAAS2V,eAAezxB,KAAK8oB,WACnD9oB,KAAKwxB,oBACN,KAAM73B,OAAM,iFAIpBqG,MAAKwxB,oBAAoB9U,UAAUC,IAAI,6BACvC3c,KAAKokB,cAAgBjJ,EAAY,MAAO,MAAO0B,UAAW,2BAA4B6U,SAAU,KAC5F1xB,KAAK2xB,UACL3xB,KAAKokB,cAAchD,MAAMuQ,UAAY3xB,KAAK2xB,UAAY,KAC7BxvB,QAAlBnC,KAAK2xB,YACZ3xB,KAAKokB,cAAchD,MAAMuQ,UAAY,MAEzCtW,EAAerb,KAAKwxB,qBACpBxxB,KAAKwxB,oBAAoBxV,YAAYhc,KAAKokB,eAC1CpkB,KAAK8kB,UAAY3J,EAAY,MAAO,MAAO0B,UAAW,gBAEtD7c,KAAKwb,OAAOxb,KAAKokB,cAAepkB,KAAK8kB,WAErC9kB,KAAK4xB,iBAAmBzW,EAAY,MAAO,MAAO0B,UAAW,mCAC7D7c,KAAK6xB,WAAa1W,EAAY,MAAOnb,KAAK8xB,WAAW,KAAMjV,UAAW,iCAEtE7c,KAAK+xB,cAAgB5W,EAAY,OAAQ,IAAK0B,UAAW,mBACzD,IAAImV,GAAsB7W,EAAY,MAAOnb,KAAK+xB,eAAelV,UAAW,0BAE5E7c,MAAKogB,gBAAgB,SAAS5e,EAAKywB,EAAUC,EAAU3P,EAAiB4P,EAAgBx0B,EAAKmC,GAGzF,GAAIsyB,GAAM10B,KAAKsd,OAAOlb,EAAMnC,GAAO,EACnCkzB,GAAKkB,cAAc/V,YAAYF,SAASuW,eAAe7wB,EAAM,IAAM8Z,EAAc8W,KACjFvB,EAAKkB,cAAcrN,YAAYmM,EAAKkB,cAAc9S,cAGlDjf,KAAKgxB,eACLhxB,KAAKsyB,iBAAmBtyB,KAAK6xB,YAE7B7xB,KAAKsyB,iBAAmBnX,EAAY,OAAQ6W,EAAqBhyB,KAAK4xB,iBAAkB5xB,KAAK6xB,aAAchV,UAAW,uBACtH7c,KAAK8kB,UAAU9I,YAAYhc,KAAKsyB,mBAEpCtyB,KAAK8kB,UAAU9I,YAAYhc,KAAKsyB,kBAEhCtyB,KAAKuyB,UAAYpX,EAAY,OACxBnb,KAAKwyB,kBACNxyB,KAAKuyB,UAAUvW,YAAYb,EAAY,QAAS,cAAeA,EAAY,IAAK,gBAAiBe,KAAM,iCAAkC,IAAMwS,IAAW7R,UAAW,gBAEzK7c,KAAKokB,cAAcpI,YAAYhc,KAAKuyB,WAEpCvyB,KAAKmwB,eAAiB,SAASlY,GAC3BnW,EAAMijB,gBAGV/kB,KAAKyyB,MAAQtX,EAAY,MAAO,MAAO0B,UAAW,cAClD7c,KAAK0yB,OAASvX,EAAY,MAAO,MAAO0B,UAAW,0BACnD7c,KAAKsyB,iBAAiBtW,YAAYhc,KAAKyyB,OACvCzyB,KAAKsyB,iBAAiBtW,YAAYhc,KAAK0yB,QACvC1yB,KAAK2yB,aAAe3yB,KAAK6oB,WACzB7oB,KAAK6oB,SACL,KAAK,GAAIzX,KAAKpR,MAAK2yB,aAAc,CAC7B,GAAIpuB,GAAKvE,KAAK2yB,aAAavhB,EACvB7M,aAAcqrB,IACdpgB,QAAQC,IAAI,gFAEhBzP,KAAK6oB,OAAOzX,GAAK,GAAIwe,GAASrrB,GAGlC,GAAIquB,EACJ,IAAI5yB,KAAKkrB,WAAa,EAAG,CAErB,IAAK,GADD2H,MACK/e,EAAK,EAAGA,EAAK9T,KAAKkrB,aAAcpX,EACrC+e,EAAG31B,KAAKqxB,EAAgBvuB,MAC5B4yB,GAAkB/a,EAAQib,IAAID,OAE9BD,GAAkB/a,EAAQiC,WAG9B9Z,MAAKowB,aAAe,KACpBpwB,KAAK+yB,WAAa,EAClBH,EAAgB9Z,KAAK,SAAS/d,GAC1ByU,QAAQC,IAAI,UAAY1U,EAAEf,OAAS,YACnC8H,EAAMsuB,aAAer1B,GACtB,SAASA,GACRyU,QAAQC,IAAI,yBAA0B1U,KACvC+d,KAAK,WACJ,GAAI+X,EAAKxE,oBAAqF,QAA9DG,OAAOwG,iBAAiBlxB,EAAM0vB,qBAAqBnQ,SAC/Evf,EAAM+vB,WAAWoB,wBAAwBzV,MAAQ,EAEjDvD,WAAW,WAAYnY,EAAMoxB,aAAc,OAE3C,IAAIC,GAAeC,YAAY,WACuC,QAA9D5G,OAAOwG,iBAAiBlxB,EAAM0vB,qBAAqBnQ,SACnDvf,EAAM+vB,WAAWoB,wBAAwBzV,MAAQ,IAEjD6V,cAAcF,GACdrxB,EAAMoxB,cAEX,QAKfhY,EAAQvb,UAAUuzB,UAAY,WAAW,GAAAI,GAAAtzB,KACjC8B,EAAQ9B,IAGZqb,GAAerb,KAAK6xB,YACpBxW,EAAerb,KAAK4xB,kBAEpB5xB,KAAKmpB,kBAAoBnpB,KAAK6xB,WAAWoB,wBAAwBzV,MAAQ1b,EAAMuqB,mBAAqB,EACpGG,OAAOhL,iBAAiB,SAAUxhB,KAAKmwB,gBAAgB,GAEvDnwB,KAAKuzB,MAAQvzB,KAAKmpB,mBAAqBnpB,KAAKosB,QAAUpsB,KAAKmsB,WACtDnsB,KAAKwzB,UACNxzB,KAAKwzB,QAAUxzB,KAAK6f,SAAWniB,KAAK+R,IAAIzP,KAAKspB,aAAetpB,KAAK8f,UACjE9f,KAAKwiB,QAAUxiB,KAAK6f,SAAWniB,KAAK+R,IAAIzP,KAAKmpB,kBAAoBnpB,KAAKgpB,iBAAmBhpB,KAAK8f,WAElG9f,KAAKuiB,gBAAkBviB,KAAK6f,SAAWniB,KAAK+R,KAAKzP,KAAKosB,QAAUpsB,KAAKmsB,UAAY,GAAKnsB,KAAK8f,UAI3F9f,KAAKsyB,iBAAiB9Q,iBAAiB,aAAc,SAASvJ,GAG1D,GAFAA,EAAG0J,kBAAmB1J,EAAGyJ,iBAErBzJ,EAAGwb,YAAa,CAChB,GAAIC,GAAQzb,EAAGwb,YAAY,CACtB3xB,GAAM8jB,mBACP8N,GAASA,GAEb5xB,EAAM6xB,KAAKD,GAGf,GAAIzb,EAAG2b,YAAa,CAChB,GAAIF,GAAQzb,EAAG2b,WACX9xB,GAAM8jB,mBACN8N,GAASA,GAEb5xB,EAAM+vB,WAAWgC,WAAaH,KAEnC,GAEH1zB,KAAKsyB,iBAAiB9Q,iBAAiB,sBAAuB,SAASvJ,GAEnE,GADAA,EAAG0J,kBAAmB1J,EAAGyJ,iBACV,GAAXzJ,EAAG6b,MACH,GAAiB,GAAb7b,EAAG8b,OAAa,CAChB,GAAIL,GAAQzb,EAAG8b,OAAO,CAClBjyB,GAAM8jB,mBACN8N,GAASA,GAEb5xB,EAAM6xB,KAAKD,QAEZ,CACH,GAAIA,GAAQzb,EAAG8b,MACVjyB,GAAM8jB,mBACT8N,GAASA,GAGX5xB,EAAM+vB,WAAWgC,WAAaH,KAEnC,GAEH1zB,KAAKsyB,iBAAiB9Q,iBAAiB,aAAc,SAASvJ,GAAK,MAAOnW,GAAMkyB,kBAAkB/b,KAAM,GACxGjY,KAAKsyB,iBAAiB9Q,iBAAiB,YAAa,SAASvJ,GAAK,MAAOnW,GAAMmyB,iBAAiBhc,KAAM,GACtGjY,KAAKsyB,iBAAiB9Q,iBAAiB,WAAY,SAASvJ,GAAK,MAAOnW,GAAMoyB,gBAAgBjc,KAAM,GACpGjY,KAAKsyB,iBAAiB9Q,iBAAiB,cAAe,SAASvJ,GAAK,MAAOnW,GAAMqyB,mBAAmBlc,KAAM,EAE1G,IAAImc,GAAa,SAASnc,GAEtB,GAAkB,IAAdA,EAAGwJ,QAAe,CAElB,IAAK,GADD4S,IAAiB,EACZxrB,EAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EAAI,CAC5C,GAAI5P,GAAI6I,EAAMihB,MAAMla,EAChB5P,GAAEq7B,oBAAsBr7B,EAAEq7B,oBAAsBr7B,EAAEs7B,eAClDt7B,EAAEs7B,aAAet7B,EAAEq7B,mBACnBr7B,EAAEu7B,WACFH,GAAiB,GAGrBA,GACAvyB,EAAM2yB,mBAEP,IAAkB,IAAdxc,EAAGwJ,SAAgC,IAAfxJ,EAAG3J,SAAgB,CAC9C,GAAKxM,EAAMwe,cAMJ,CACHxe,EAAMwe,eAAgB,CACtB,IAAIoU,IAAW5yB,EAAMwgB,WAAa,IAAQxgB,EAAM0gB,OAChD1gB,GAAMwgB,UAAYxgB,EAAMygB,gBAAkBzgB,EAAM0gB,QAChD1gB,EAAMygB,gBAAkBmS,EACxB5yB,EAAM2S,KAAK/W,KAAKyiB,IAAK,EAAMuU,EAAW5yB,EAAM+d,eAXtB,CACtB/d,EAAMwe,eAAgB,CACtB,IAAIoU,IAAW5yB,EAAMwgB,WAAa,GAAOxgB,EAAM0gB,OAC/C1gB,GAAMwgB,UAAYxgB,EAAMygB,gBAAkBzgB,EAAM0gB,QAChD1gB,EAAMygB,gBAAkBmS,EACxB5yB,EAAM2S,KAAK/W,KAAKyiB,IAAK,EAAMuU,EAAW5yB,EAAM+d,WAQhD5H,EAAG0J,kBAAmB1J,EAAGyJ,qBACtB,IAAkB,IAAdzJ,EAAGwJ,QAAe,CACzB,GAAqB,SAAjB3f,EAAM6c,OAAmB,CACzB,GAAIgW,GAAQ7Y,SAAS2V,eAAe,8BAA8B9L,OAClE7J,UAAS2V,eAAe,8BAA8B9L,SAAWgP,EAErE7yB,EAAMskB,qBAAuBtkB,EAAMskB,oBACnCtkB,EAAMmkB,gBACNhO,EAAG0J,kBAAmB1J,EAAGyJ,qBACtB,IAAkB,IAAdzJ,EAAGwJ,QACVxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB5f,EAAM8yB,eAAe3c,EAAI,QACtB,IAAkB,IAAdA,EAAGwJ,QACVxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB5f,EAAM8yB,eAAe3c,EAAI,OACtB,IAAkB,IAAdA,EAAGwJ,SAA+B,IAAdxJ,EAAGwJ,QAG9B,GAFAxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBAErBzJ,EAAG4c,SAAU,CACb,GAAI3R,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZ,IAAI4R,GAAKhzB,EAAMihB,MAAMG,GACjB1Q,EAAKsiB,EAAGC,aAAeD,EAAGE,SAAS,GAAGC,MACtCziB,IAAM,IACNsiB,EAAGI,aAAaD,OAAQziB,EAAG,SAE5B,IAAIyF,EAAGkd,SAAWld,EAAGmd,QAAS,CACjC,GAAIlS,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZ,IAAI4R,GAAKhzB,EAAMihB,MAAMG,EAErB,IAAI4R,EAAGxR,mBAAoB,CACvB,GAAI+R,GAAKP,EAAGE,SAAS,GAAGC,OACpBK,EAAKR,EAAGE,SAAS,GAAGO,KACxB,KAAKD,EACD,MAEJ,IAAIE,GAAO,EAAMF,EAAG33B,IAChB83B,EAAO,EAAMH,EAAGx1B,IAEhB41B,GAAUD,EAAOD,GAAQH,CAC7BP,GAAGI,aAAa5R,mBAAoBkS,IAA2D,EAAlD93B,KAAKsd,OAAO8Z,EAAGxR,mBAAqBkS,GAAME,IAAW,GAAGA,IAErGZ,EAAGa,OAAO,cAAgBhG,EAAiBmF,EAAGxR,0BAE/C,IAAIrL,EAAG2d,OAAQ,CAClB,GAAI1nB,GAAMpM,EAAM+gB,cAAc7oB,MAC9B,IAAW,GAAPkU,EACA,MAKJ,KAAK,GAHDgV,GAAKphB,EAAM+gB,cAAc,GACzBgT,GAAa,EACbC,KACKC,EAAK,EAAGA,EAAKj0B,EAAM+gB,cAAc7oB,SAAU+7B,EAChDD,EAAG54B,KAAK4E,EAAMihB,MAAMjhB,EAAM+gB,cAAckT,KACpCA,EAAK,GAAKj0B,EAAM+gB,cAAckT,GAAMj0B,EAAM+gB,cAAckT,EAAK,IAAM,IACnEF,GAAa,EAGrB,IAAIA,GAAoB,GAAN3S,EACd,MAEJ,KAAK,GAAI6S,GAAKj0B,EAAM+gB,cAAc7oB,OAAS,EAAG+7B,GAAM,IAAKA,EACrDj0B,EAAMihB,MAAMzR,OAAOxP,EAAM+gB,cAAckT,GAAK,EAEhDj0B,GAAM+gB,cAAcvR,OAAO,EAAGpD,EAG9B,KAAK,GADD8nB,GAAKH,EAAa3S,EAAK,EAAIA,EACtB6S,EAAK,EAAGA,EAAKD,EAAG97B,SAAU+7B,EAC/Bj0B,EAAMihB,MAAMzR,OAAO0kB,EAAGD,EAAI,EAAGD,EAAGC,IAChCj0B,EAAM+gB,cAAc3lB,KAAK84B,EAAKD,EAGlCj0B,GAAMm0B,uBAAuBn0B,EAAMo0B,qBACnCp0B,EAAMq0B,oBACNr0B,EAAMs0B,sBACNt0B,EAAMu0B,eACNv0B,EAAMw0B,WAAW,WAAYpT,OAC1B,CACH,GAAIA,GAAKphB,EAAMqhB,iBACf,IAAID,EAAK,EAAG,CACRphB,EAAM8f,gBAAgBsB,EAAK,EAC3B,IAAIqT,GAAMz0B,EAAMihB,MAAMjhB,EAAMqhB,mBACxBqT,EAAMD,EAAIE,IAAIC,UAAWC,EAASH,EAAMD,EAAIE,IAAIG,cAChDJ,EAAM10B,EAAM+vB,WAAWgC,WAAa8C,EAAS70B,EAAM+vB,WAAWgC,UAAY/xB,EAAM+vB,WAAW+E,gBAC3F90B,EAAM+vB,WAAWgC,UAAY2C,OAGjC10B,GAAM+0B,wBAAwB,QAGnC,IAAkB,IAAd5e,EAAGwJ,SAA+B,IAAdxJ,EAAGwJ,QAG9B,GAFAxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBAErBzJ,EAAG4c,SAAU,CACb,GAAI3R,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZ,IAAI4R,GAAKhzB,EAAMihB,MAAMG,GACjB1Q,EAAKsiB,EAAGC,aAAeD,EAAGE,SAAS,GAAGC,MAC1CH,GAAGI,aAAaD,OAAQziB,EAAG,SACxB,IAAIyF,EAAGkd,SAAWld,EAAGmd,QAAS,CACjC,GAAIlS,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZ,IAAI4R,GAAKhzB,EAAMihB,MAAMG,EAErB,IAAI4R,EAAGxR,mBAAoB,CACvB,GAAI+R,GAAKP,EAAGE,SAAS,GAAGC,OACpBK,EAAKR,EAAGE,SAAS,GAAGO,KACxB,KAAKD,EACD,MAEJ,IAAIE,GAAO,EAAMF,EAAG33B,IAChB83B,EAAO,EAAMH,EAAGx1B,IAChB41B,GAAUD,EAAOD,GAAQH,EAEzByB,EAAuD,EAAlDp5B,KAAKsd,OAAO8Z,EAAGxR,mBAAqBkS,GAAME,EAC/CoB,GAAK,IACLhC,EAAGI,aAAa5R,mBAAoBkS,GAAQsB,EAAG,GAAGpB,IAClDZ,EAAGa,OAAO,cAAgBhG,EAAiBmF,EAAGxR,2BAGnD,IAAIrL,EAAG2d,OAAQ,CAClB,GAAI1nB,GAAMpM,EAAM+gB,cAAc7oB,MAC9B,IAAW,GAAPkU,EACA,MAKJ,KAAK,GAHDgV,GAAKphB,EAAM+gB,cAAc,GACzBkU,EAAY,EACZjB,KACKC,EAAK,EAAGA,EAAKj0B,EAAM+gB,cAAc7oB,SAAU+7B,EAChDD,EAAG54B,KAAK4E,EAAMihB,MAAMjhB,EAAM+gB,cAAckT,KACpCA,EAAK,IACLgB,GAAcj1B,EAAM+gB,cAAckT,GAAMj0B,EAAM+gB,cAAckT,EAAK,GAAK,EAE9E,IAAIF,GAA0B,GAAbkB,CAEjB,IAAIlB,GAAc3S,EAAKhV,GAAOpM,EAAMihB,MAAM/oB,OACtC,MAEJ,KAAK,GAAI+7B,GAAKj0B,EAAM+gB,cAAc7oB,OAAS,EAAG+7B,GAAM,IAAKA,EACrDj0B,EAAMihB,MAAMzR,OAAOxP,EAAM+gB,cAAckT,GAAK,EAEhDj0B,GAAM+gB,cAAcvR,OAAO,EAAGpD,EAG9B,KAAK,GADD8nB,GAAKH,EAAa3S,EAAK,EAAIA,EAAK6T,EAC3BhB,EAAK,EAAGA,EAAKD,EAAG97B,SAAU+7B,EAC/Bj0B,EAAMihB,MAAMzR,OAAO0kB,EAAGD,EAAI,EAAGD,EAAGC,IAChCj0B,EAAM+gB,cAAc3lB,KAAK84B,EAAKD,EAGlCj0B,GAAMm0B,uBAAuB,WACzBn0B,EAAMo0B,qBAAoB,KAE9Bp0B,EAAMq0B,oBACNr0B,EAAMs0B,sBACNt0B,EAAMu0B,eACNv0B,EAAMw0B,WAAW,WAAYpT,OAC1B,CACH,GAAIA,GAAKphB,EAAMqhB,iBACf,IAAID,EAAKphB,EAAMihB,MAAM/oB,OAAQ,EAAG,CAC5B8H,EAAM8f,gBAAgBsB,EAAK,EAC3B,IAAIqT,GAAMz0B,EAAMihB,MAAMjhB,EAAMqhB,mBACxBqT,EAAMD,EAAIE,IAAIC,UAAWC,EAASH,EAAMD,EAAIE,IAAIG,cAChDJ,EAAM10B,EAAM+vB,WAAWgC,WAAa8C,EAAS70B,EAAM+vB,WAAWgC,UAAY/xB,EAAM+vB,WAAW+E,gBAC3F90B,EAAM+vB,WAAWgC,UAAYn2B,KAAKC,IAAI64B,EAAKG,EAAS70B,EAAM+vB,WAAW+E,oBAI9E,IAAkB,KAAd3e,EAAGwJ,SAAgC,IAAdxJ,EAAGwJ,QAC/BxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB5f,EAAMsgB,SAAS,SACZ,IAAkB,KAAdnK,EAAGwJ,SAAgC,KAAdxJ,EAAGwJ,QAC/BxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB5f,EAAMsgB,SAAS,QACZ,IAAkB,IAAdnK,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,QAAgB,CAC9CxJ,EAAG0J,kBAAmB1J,EAAGyJ,gBACzB,IAAIwB,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZ,IAAIjqB,GAAI6I,EAAMihB,MAAMG,EACfjqB,GAAE+9B,aAKH/9B,EAAEg+B,YAAY7V,MAAMC,QAAU,OAC9BpoB,EAAEi+B,eACFj+B,EAAE+9B,aAAc,IANhB/9B,EAAEg+B,YAAY7V,MAAMC,QAAU,QAC9BpoB,EAAEi+B,eACFj+B,EAAE+9B,aAAc,OAMjB,IAAkB,IAAd/e,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,QAAgB,CAC9C,GAAI0V,EACJ,IAAIlf,EAAG4c,SAAU,CACb5c,EAAG0J,kBAAmB1J,EAAGyJ,gBACzB,KAAK,GAAI7Y,GAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EAAI,CAC5C,GAAI5P,GAAI6I,EAAMihB,MAAMla,EAChB5P,GAAEuqB,UAAU4T,sBACOj1B,SAAfg1B,IACAA,GAAcl+B,EAAEo+B,QAEpBp+B,EAAEi8B,aAAamC,OAAQF,UAG5B,KAAKlf,EAAGkd,UAAYld,EAAGmd,QAAS,CACnCnd,EAAG0J,kBAAmB1J,EAAGyJ,gBACzB,IAAIwB,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZ,IAAIjqB,GAAI6I,EAAMihB,MAAMG,EAEhBjqB,GAAEuqB,UAAU4T,sBACOj1B,SAAfg1B,IACAA,GAAcl+B,EAAEo+B,QAEpBp+B,EAAEi8B,aAAamC,OAAQF,UAG5B,IAAkB,IAAdlf,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,QAC9BxJ,EAAG0J,kBAAmB1J,EAAGyJ,kBACpBzJ,EAAGkd,SAAWld,EAAGmd,UAAYtzB,EAAM+gB,cAAc7oB,OAAS,GAC3D8H,EAAMw1B,yBAEP,IAAkB,IAAdrf,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,SAE9B,GADAxJ,EAAG0J,kBAAmB1J,EAAGyJ,iBACrBzJ,EAAGkd,SAAWld,EAAGmd,QAAS,CAC1B,GAAIlS,GAAKphB,EAAMqhB,iBACf,IAAS,EAALD,EAAQ,MACZphB,GAAMy1B,QAAQz1B,EAAMihB,MAAMG,GAAIM,gBAE/B,KAAkB,IAAdvL,EAAGwJ,SAA+B,KAAdxJ,EAAGwJ,WAC1BxJ,EAAGkd,SAAWld,EAAGmd,SAAS,CAI1B,IAAK,GADDN,MACK5R,EAAK,EAAGA,EAAKphB,EAAM+gB,cAAc7oB,SAAUkpB,EAChD4R,EAAG53B,KAAK4E,EAAMihB,MAAMjhB,EAAM+gB,cAAcK,IAE5C,KAAK,GAAIra,GAAK,EAAGA,EAAKisB,EAAG96B,SAAU6O,EAC/BisB,EAAGjsB,GAAIqsB,aAAasC,QAAS1C,EAAGjsB,GAAI2uB,UAQpDx3B,MAAKokB,cAAc5C,iBAAiB,QAAS,SAASvJ,GAClDnW,EAAMsiB,cAAc5C,iBAAiB,UAAW4S,GAAY,KAC7D,GACHp0B,KAAKokB,cAAc5C,iBAAiB,OAAQ,SAASvJ,GACjDnW,EAAMsiB,cAAcD,oBAAoB,UAAWiQ,GAAY,KAChE,GAGHp0B,KAAKy3B,aAAetc,EAAY,OAChCnb,KAAKy3B,aAAarW,MAAM,eAAiB,YACzCphB,KAAKy3B,aAAarW,MAAM,aAAe,OACvCphB,KAAKy3B,aAAa/a,UAAUC,IAAI,aAChCb,SAAS4b,KAAK1b,YAAYhc,KAAKy3B,aAE/B,KAAK,GAAIx+B,GAAI,EAAGA,EAAI+G,KAAKioB,QAAQjuB,SAAUf,EAAG,CAC1C,GAAI0+B,GAAS33B,KAAKioB,QAAQhvB,EAC1B,IAAK0+B,EAAL,CAGA,GAAIpU,KACAvjB,MAAK43B,kBACLrU,EAASvjB,KAAK43B,gBAAgB3+B,IAG7B0+B,EAAOE,UACR73B,KAAK83B,SAASH,EAAQpU,GAAQzK,KAAK,SAAS0D,GACxC1a,EAAMi2B,YAAYvb,MA1WO,GAAAwb,IAAA,EAAAC,GAAA,EAAAC,EAAA/1B,MAAA,KA+WrC,IAAA,GAAAg2B,GAAAC,EAAqBp4B,KAAKmoB,kBAA1B5Q,OAAAC,cAAAwgB,GAAAG,EAAAC,EAAA1H,QAAAC,MAAAqH,GAAA,EAA6C,CAAA,GAAlCK,GAAkCF,EAAA/zB,KACzC,KAAKi0B,EAAOR,SAAU,CAAA,GAAAS,GACCt4B,KAAKu4B,cAAcF,GAA/BpnB,EADWqnB,EACXrnB,QAEHA,IACAjR,KAAKooB,wBAAwBlrB,MACzBsmB,UAAW6U,EACXjV,cAAenS,MAtXM,MAAA0I,GAAAse,GAAA,EAAAC,EAAAve,EAAA,QAAA,KAAAqe,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,IA4XjCl4B,KAAKw4B,eACL3gB,EAAQib,IAAI9yB,KAAK+iB,MAAM1b,IAAI,SAAApO,GAAA,MAAKA,GAAEw/B,sBAC7B3f,KAAK,WAAA,MAAMwa,GAAKkF,kBADrB3gB,SAEW,SAAC8B,GAAD,MAASnK,SAAQC,IAAIkK,KAGpC7X,EAAMo0B,sBACNp0B,EAAM2yB,eACN3yB,EAAMu0B,cAGN,IAAIqC,GAAK14B,KAAK24B,mBACVD,IACAA,EAAGE,WAAW54B,KAAKwB,IAAK,SAASu0B,GACzBA,EACAj0B,EAAMunB,cAAgB0M,EAAG/7B,OAEzB8H,EAAMunB,cAAgB,KAIlCrpB,KAAK64B,eACL,KAAK,GAAI/vB,KAAK9I,MAAK6oB,OACf7oB,KAAK64B,cAAc/vB,GAAG,EAG1B,IAAI9I,KAAK4qB,KACL,IAAK,GAAIkO,GAAK,EAAGA,EAAK94B,KAAK4qB,KAAK5wB,SAAU8+B,EAAI,CAC1C,GAAIC,GAAK/4B,KAAK4qB,KAAKkO,EACF,iBAANC,KACPA,GAAMj7B,IAAKi7B,IAGf,SAAUA,GACNrJ,EAAgBqJ,EAAGj7B,IAAK,SAASk7B,EAAKrf,GAClC,GAAIA,EACAnK,QAAQC,IAAIkK,OACT,CACH,GAAIsf,EAEAA,GADAF,EAAGG,OACGF,EAAIG,QAAQJ,EAAGG,QAEfF,EAAIG,QAAQr3B,EAAMib,YAAYqc,UAEpCH,IACIF,EAAG7L,UACH+L,EAAI/L,QAAU6L,EAAG7L,SACjB6L,EAAGryB,QACHuyB,EAAID,IAAIK,SAAWN,EAAGryB,OAC1B5E,EAAM+oB,WAAW3tB,KAAK+7B,MAG/BF,IACJA,GAIP/4B,KAAKs5B,YACLt5B,KAAKu5B,uBAGJv5B,KAAKqxB,gBAAkBrxB,KAAKihB,aAC7BjhB,KAAKihB,cAGTnf,EAAM03B,YAAYx5B,KAAKwB,IAAKxB,KAAKmsB,UAAWnsB,KAAKosB,QAAS,WACtDtqB,EAAM8f,gBAAgB,EAEtB,KAAK,GAAI3L,GAAK,EAAGA,EAAKnU,EAAM6pB,cAAc3xB,SAAUic,EAChD,IACInU,EAAM6pB,cAAc1V,GAAIlc,KAAK+H,GAC/B,MAAO9I,GACLwW,QAAQC,IAAIzW,OAU5BkiB,EAAQvb,UAAUq0B,kBAAoB,SAAS/b,GAK3C,GAFAjY,KAAKy5B,aAAexhB,EAAGyhB,QAAQ,GAAGC,MAClC35B,KAAK45B,aAAe3hB,EAAGyhB,QAAQ,GAAGG,MACT,GAArB5hB,EAAGyhB,QAAQ1/B,OAAa,CACxB,GAAI8/B,GAAMp8B,KAAKq8B,IAAI9hB,EAAGyhB,QAAQ,GAAGC,MAAQ1hB,EAAGyhB,QAAQ,GAAGC,MACvD35B,MAAKg6B,SAAU,EACfh6B,KAAKi6B,YAAcj6B,KAAKk6B,eAAiBJ,EACzC95B,KAAKm6B,iBAAmBn6B,KAAKuzB,QAIrCrY,EAAQvb,UAAUs0B,iBAAmB,SAAShc,GAM1C,GAFAA,EAAG0J,kBAAmB1J,EAAGyJ,iBAEA,GAArBzJ,EAAGyhB,QAAQ1/B,OAAa,CACxB,GAAIogC,GAASniB,EAAGyhB,QAAQ,GAAGC,MACvBU,EAASpiB,EAAGyhB,QAAQ,GAAGG,KACvB75B,MAAKy5B,cAAgBW,GAAUp6B,KAAKy5B,cACpCz5B,KAAK2zB,KAAKyG,EAASp6B,KAAKy5B,cAExBz5B,KAAK45B,cAAgBS,GAAUr6B,KAAK45B,eACpC55B,KAAK6xB,WAAWgC,WAAcwG,EAASr6B,KAAK45B,cAEhD55B,KAAKy5B,aAAeW,EACpBp6B,KAAK45B,aAAeS,MACjB,IAAIr6B,KAAKg6B,SAAgC,GAArB/hB,EAAGyhB,QAAQ1/B,OAAa,CAC/C,GAAI8/B,GAAMp8B,KAAKq8B,IAAI9hB,EAAGyhB,QAAQ,GAAGC,MAAQ1hB,EAAGyhB,QAAQ,GAAGC,MACvD,IAAIG,GAAO95B,KAAKi6B,YAAa,CACzB,GAAIK,IAAMriB,EAAGyhB,QAAQ,GAAGC,MAAQ1hB,EAAGyhB,QAAQ,GAAGC,OAAO,EACjDY,EAAMv6B,KAAKmsB,UAAamO,EAAGt6B,KAAKuzB,MAAO,CAC3CvzB,MAAKuzB,MAAQvzB,KAAKm6B,kBAAoBL,EAAI95B,KAAKk6B,gBAC/Cl6B,KAAKmsB,UAAYoO,EAAOD,EAAGt6B,KAAKuzB,MAAO,CACvC,KAAK,GAAI95B,GAAI,EAAGA,EAAIuG,KAAK+iB,MAAM/oB,SAAUP,EACrCspB,MAAMtpB,GAAG+gC,cAAcC,SAAS1X,MAAMtpB,IAG9CuG,KAAKi6B,YAAcH,IAI3B5e,EAAQvb,UAAUu0B,gBAAkB,SAASjc,KAG7CiD,EAAQvb,UAAUw0B,mBAAqB,SAASlc,KAIhDiD,EAAQvb,UAAUm4B,SAAW,SAASH,EAAQpU,GAC1C,IACI,MAAOvjB,MAAK06B,aAAa/C,EAAQpU,GACnC,MAAOvqB,GACLwW,QAAQC,IAAI,qBAAsBkoB,GAClCnoB,QAAQC,IAAIzW,EAAE2hC,OAAS3hC,KAI/BkiB,EAAQvb,UAAU+6B,aAAe,SAAS/C,EAAQpU,GAC9C,GAAIzhB,GAAQ9B,KACR46B,EAAa,IACb56B,MAAKkqB,uBACL0Q,EAAa56B,KAAKkqB,qBAAqBlqB,KAAK+iB,MAAM/oB,OAASgG,KAAKkqB,qBAAqBlwB,QAGzF,IAAIwiB,GAAO,GAAI+S,GAAQvvB,KAAM23B,EAAQpU,EAAQqX,EAC7Cpe,GAAKqe,QAAU76B,KAAKmsB,SAEpB,IACI2O,GAAYC,EACZC,EAFAC,GAAa,EAIbC,EAAgB,SAAS5N,EAAIC,GAC7B,GAAIrK,GAAK1G,EAAKwY,QACd,IAAK9R,EAAL,CAIA,GAAIlC,GAAM,CAEV,KADAuM,GAAM/Q,EAAK2e,QACJna,EAAMkC,EAAGlpB,QAAUuzB,EAAKrK,EAAGlC,GAAKiU,QAAUjU,EAAOkC,EAAGlpB,OAAS,GAChEuzB,EAAKA,EAAKrK,EAAGlC,GAAKiU,OAASzY,EAAK2e,UAC9Bna,CAEN,MAAIA,GAAOkC,EAAGlpB,QAAd,CAIA,GAAIqzB,GAASnK,EAAGlC,GAAKqM,OAEjB/yB,IADcwH,EAAMqqB,UAAYrqB,EAAMsqB,SAAS,GACrC5P,EAAK4e,iBAAmBt5B,EAAMqqB,WAAWrqB,EAAMyxB,MAG7D,OAFAjG,IAAMhzB,EAEC8yB,EAAYC,EAAQC,EAAIC,MAG/B8N,EAAkB,SAASpjB,GAC3BA,EAAGyJ,iBAAkBzJ,EAAG0J,iBACxB,IAAI2L,GAAKrV,EAAGqjB,OACRhO,IAAMyN,IACNj5B,EAAM6xB,KAAMrG,EAAKyN,GAAiB,GAClCA,EAAiBzN,GAErBxrB,EAAMm5B,YAAa,GAGnBM,EAAgB,QAAhBA,GAAyBtjB,GACzBuU,OAAOrI,oBAAoB,YAAakX,GAAiB,GACzD7O,OAAOrI,oBAAoB,UAAWoX,GAAe,GACrDz5B,EAAM6xB,KAAM1b,EAAGqjB,QAAUP,GAI7Bve,GAAKgf,SAASha,iBAAiB,YAAa,SAASvJ,GACjDnW,EAAMsiB,cAAcP,QACpB5L,EAAGyJ,gBACH,IACI4L,IADK9Q,EAAKia,IAAIxD,wBACThb,EAAGqjB,QAAcrjB,GAAGwjB,OAE7BjP,QAAOhL,iBAAiB,YAAa6Z,GAAiB,GACtD7O,OAAOhL,iBAAiB,UAAW+Z,GAAe,GAClDT,EAAaC,EAAiBzN,EAC9BxrB,EAAMm5B,YAAa,IACpB,GAEHze,EAAKgf,SAASha,iBAAiB,YAAa,SAASvJ,GACjD,GAAIyjB,GAAKlf,EAAKia,IAAIxD,wBACd3F,EAAKrV,EAAGqjB,QAAUI,EAAGC,KAAMpO,EAAKtV,EAAGwjB,QAAUC,EAAGlF,IAEhDja,EAAM2e,EAAc5N,EAAIC,EACxBhR,IAAOA,EAAIviB,OAAS,EACpBwiB,EAAKia,IAAIrV,MAAMwa,OAAS,UAExBpf,EAAKia,IAAIrV,MAAMwa,OAAS,UAGxBZ,GACA3gB,aAAa2gB,GAGbC,IAMAD,EAAe/gB,WAAW,WACtB,GAAIsC,GAAM2e,EAAc5N,EAAIC,EACxBhR,IAAOA,EAAIviB,OAAS,GACpB8H,EAAM+5B,mBAAmB5jB,EAAIsE,EAAIA,EAAIviB,OAAS,GAAIuiB,EAAKC,IAE5D,OAIX,IAAIsf,GAAqB,IACzBtf,GAAKgf,SAASha,iBAAiB,UAAW,SAASvJ,GAC/C,GAAIyjB,GAAKlf,EAAKia,IAAIxD,wBACd3F,EAAKrV,EAAGqjB,QAAUI,EAAGC,KAAMpO,EAAKtV,EAAGwjB,QAAUC,EAAGlF,IAEhDja,EAAM2e,EAAc5N,EAAIC,EAc5B,IAbIhR,GAAOA,EAAIviB,OAAS,IAAM8H,EAAMm5B,aAC5Ba,GACAzhB,aAAayhB,GACbA,EAAqB,KACrBh6B,EAAMi6B,mBAAmBxf,EAAK+Q,EAAIC,IAElCuO,EAAqB7hB,WAAW,WAC5B6hB,EAAqB,KACrBh6B,EAAMk6B,cAAc/jB,EAAIsE,EAAIA,EAAIviB,OAAO,GAAIuiB,EAAKC,IACjD,MAIP1a,EAAMm5B,YAAc3N,GAAMwN,GAActe,EAAKyf,eAAgB,CAC7D,GAGIt+B,GAAKmC,EAHLvG,EAAIuI,EAAMqqB,UAAamB,EAAGxrB,EAAMyxB,MAChC74B,EAAIoH,EAAMqqB,UAAa2O,EAAWh5B,EAAMyxB,KAGpC74B,GAAJnB,GACAoE,EAAQ,EAAFpE,EAAKuG,EAAQ,EAAFpF,IAEjBiD,EAAQ,EAAFjD,EAAKoF,EAAQ,EAAFvG,GAGrBuI,EAAMo6B,mBAAmBp6B,EAAMN,IAAK7D,EAAKmC,GAE7CgC,EAAMm5B,YAAa,IACpB,GAEHze,EAAKgf,SAASha,iBAAiB,WAAY,SAASvJ,GAChDgjB,GAAa,IAGjBze,EAAK2f,aAAa3a,iBAAiB,QAAS,SAASvJ,GACjDA,EAAG0J,kBAAmB1J,EAAGyJ,gBACzB,KAAK,GAAI7Y,GAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EACxC,GAAI/G,EAAMihB,MAAMla,KAAQ2T,EAAM,CAC1B1a,EAAMs6B,YAAYr8B,MAAO8I,GACzB,UAGT,GACH2T,EAAK6f,WAAW7a,iBAAiB,QAAS,SAASvJ,GAG/C,GAFAA,EAAG0J,kBAAmB1J,EAAGyJ,iBAErBzJ,EAAG4c,SAAU,CAEb,IAAK,GADDyH,GAAU,GACLzzB,EAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EACxC,GAAI/G,EAAMihB,MAAMla,KAAQ2T,EAAM,CAC1B8f,EAAUzzB,CACV,OAGR,GAAIyzB,GAAW,EAAG,CACd,GAAI7iC,GAAIqI,EAAM+gB,cAAc7lB,QAAQs/B,EAChC7iC,IAAK,EACLqI,EAAM+gB,cAAcvR,OAAO7X,EAAG,IAE9BqI,EAAM+gB,cAAc3lB,KAAKo/B,GACzBx6B,EAAM+gB,cAAc7hB,QAExBc,EAAMq0B,oBACNr0B,EAAMs0B,sBAEFt0B,EAAM+gB,cAAc7oB,OAAS,EAC7B8H,EAAMsiB,cAAcP,QAEpB/hB,EAAM+0B,wBAAwB,SAGnC,CACH,IAAK,GAAIhuB,GAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EACxC,GAAI/G,EAAMihB,MAAMla,KAAQ2T,IACpB1a,EAAMsiB,cAAcP,QACc,GAA9B/hB,EAAM+gB,cAAc7oB,QAAe8H,EAAM+gB,cAAc,IAAMha,GAE7D,WADA/G,GAAM8f,gBAAgB/Y,EAM7B2T,GAAKwa,aAKNxa,EAAKya,YAAY7V,MAAMC,QAAU,OACjC7E,EAAK0a,eACL1a,EAAKwa,aAAc,IANnBxa,EAAKya,YAAY7V,MAAMC,QAAU,QACjC7E,EAAK0a,eACL1a,EAAKwa,aAAc,MAO5B,GACHxa,EAAK+f,WAAW/a,iBAAiB,QAAS,SAASvJ,GAC/CA,EAAG0J,kBAAmB1J,EAAGyJ,gBACzB,IAAIyV,GACAl+B,EAAIujB,CACJvjB,GAAEuqB,UAAU4T,sBACOj1B,SAAfg1B,IACAA,GAAcl+B,EAAEo+B,QAEpBp+B,EAAEi8B,aAAamC,OAAQF,OAE5B,EAGH,IAAIqF,GACAC,EACAC,EACAC,EACAC,EACAC,GAAqB,EAErBC,EAAmB,SAAS7kB,GAC5B,GAAIvR,GAAQ8V,EAAK9V,KAGjB,IADAuR,EAAG0J,kBAAmB1J,EAAGyJ,kBACpB8a,EAAW,CAERC,EADAjgB,EAAKgb,OACY11B,EAAM8vB,iBAEN9vB,EAAM+vB,WAE3B6K,EAA4BD,EAAeM,aAAeN,EAAe7F,aAEzE4F,EAAY91B,EAAMs2B,WAAU,GAC5BR,EAAUpb,MAAMwa,OAAS,UACzBa,EAAezgB,YAAYwgB,GAC3B91B,EAAM0a,MAAM6b,WAAa,QAEzB,KAAK,GAAIp0B,GAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EACxC,GAAI/G,EAAMihB,MAAMla,KAAQ2T,EAAM,CAC1BmgB,EAAc9zB,CACd,OAIR+zB,EAAiB3kB,EAAGwjB,QAGxB,GAAIyB,GAAYT,EAAexJ,uBAC/BuJ,GAAUpb,MAAMua,KAAQj1B,EAAMusB,wBAAwB0I,KAAOuB,EAAUvB,KAAQ,KAC/Ea,EAAUpb,MAAMoV,IAAOve,EAAGwjB,QAAUyB,EAAU1G,IAAMiG,EAAe5I,UAAY,GAAM,IAGrF,KAAK,GADDsJ,GAAMllB,EAAGwjB,QAAUyB,EAAU1G,IAAMiG,EAAe5I,UAC7ChrB,EAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EAAI,CAC5C,GAAIisB,GAAKhzB,EAAMihB,MAAMla,EACrB,MAAIisB,EAAG0C,OAAShb,EAAKgb,QAArB,CAGA,GAAI4F,GAAMtI,EAAG2B,IAAIxD,uBAEjB,IADAkK,GAAQC,EAAIzG,OAASyG,EAAI5G,IACf,EAAN2G,EAAS,CACT,GAASR,EAAL9zB,GAAoBoP,EAAGwjB,QAAUmB,GAAkB/zB,EAAK8zB,GAAe1kB,EAAGwjB,QAAUmB,EAAgB,CACpG96B,EAAMm0B,uBAAuB,WACzBn0B,EAAMihB,MAAMzR,OAAOqrB,EAAa,GAChC76B,EAAMihB,MAAMzR,OAAOzI,EAAI,EAAG2T,GAC1B1a,EAAMo0B,oBAAoBrtB,EAAK8zB,IAGnC,KAAK,GAAIU,GAAM,EAAGA,EAAMv7B,EAAMihB,MAAM/oB,SAAUqjC,EACtCv7B,EAAMihB,MAAMsa,IAAQ7gB,IACpBmgB,EAAcU,EAEtBT,GAAiB3kB,EAAGwjB,QACpB35B,EAAMu0B,eACNoG,EAAezgB,YAAYwgB,GAC3BK,GAAqB,EAEzB,QAIJL,EAAU9F,UAAY+F,EAAe5I,UACrC4I,EAAe5I,WAAc4I,EAAe5I,UAAY2I,EAAU9F,UAC1D8F,EAAU9F,UAAY8F,EAAU5F,aAAiB6F,EAAe5I,UAAY4I,EAAe7F,eACnG6F,EAAe5I,UAAYn2B,KAAKC,IAAI8+B,EAAe5I,WACX2I,EAAU9F,UAAY8F,EAAU5F,eAChC6F,EAAe5I,UAAY4I,EAAe7F,cAC9C8F,KAIxCY,EAAsB,QAAtBA,GAA+BrlB,GAC/B,GAAIvR,GAAQ8V,EAAK9V,KAYjB,IAVAuR,EAAG0J,kBAAmB1J,EAAGyJ,iBACrB8a,IACAA,EAAUpb,MAAMwa,OAAS,OACzBa,EAAe/X,YAAY8X,GAC3BA,EAAY,KACZ91B,EAAM0a,MAAM6b,WAAa,WAE7BnhB,SAASqI,oBAAoB,YAAa2Y,GAAkB,GAC5DhhB,SAASqI,oBAAoB,UAAWmZ,GAAqB,GAEzDT,EAAoB,CACpB,IAAK,GAAIh0B,GAAK,EAAGA,EAAK/G,EAAMihB,MAAM/oB,SAAU6O,EACxC,GAAI/G,EAAMihB,MAAMla,IAAO2T,EAAM,CACzB1a,EAAM8f,gBAAgB/Y,EACtB,OAGR/G,EAAMw0B,WAAW,YAAa9Z,IActC,OAVAA,GAAK9V,MAAM8a,iBAAiB,YAAa,SAASvJ,GAC9CA,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBmb,GAAqB,EACrB/gB,SAAS0F,iBAAiB,YAAasb,GAAkB,GACzDhhB,SAAS0F,iBAAiB,UAAW8b,GAAqB,KAC3D,GAEHt9B,KAAK+iB,MAAM7lB,KAAKsf,GAGTA,EAAK+gB,OAAOzkB,KAAK,SAAU0kB,GAS9B,MARAA,GAAYC,gBAAkB,GAC9B37B,EAAMo1B,eACNsG,EAAYE,cAEZ57B,EAAMm0B,uBAAuBn0B,EAAMo0B,qBACnCsH,EAAYG,oBACZ77B,EAAMu0B,eAECmH,KAIftiB,EAAQvb,UAAU02B,aAAe,WAC7Bhb,EAAerb,KAAK6xB,YACpBxW,EAAerb,KAAK4xB,kBAChB5xB,KAAKgxB,iBACLhxB,KAAK6xB,WAAW7V,YAAYhc,KAAKyyB,OACjCzyB,KAAK6xB,WAAW7V,YAAYhc,KAAK0yB,QAIrC,KAAK,GAFDkL,IAAY,EACZC,KAAkBC,KACbrkC,EAAI,EAAGA,EAAIuG,KAAK+iB,MAAM/oB,SAAUP,EAAG,CACxC,GAAIR,GAAI+G,KAAK+iB,MAAMtpB,GACfskC,EAAwE,MAA7D,MAAM,SAAS/gC,QAAQgD,KAAK+iB,MAAMtpB,GAAG+pB,UAAUuE,SAC1D9uB,GAAEu+B,SAAWx3B,KAAKgxB,gBAClB6M,EAAY3gC,KAAKjE,GACb8kC,GACA/9B,KAAK4xB,iBAAiB5V,YAAYhc,KAAK+iB,MAAMtpB,GAAGg9B,KACpDmH,GAAY,IAEZE,EAAc5gC,KAAKjE,GACf8kC,GACA/9B,KAAK6xB,WAAW7V,YAAYhc,KAAK+iB,MAAMtpB,GAAGg9B,MAItDz2B,KAAKi2B,uBAAuB,WACxBj2B,KAAK+iB,MAAMzR,OAAO,EAAGtR,KAAK+iB,MAAM/oB,OAChC,KAAK,GAAIP,GAAI,EAAGA,EAAIokC,EAAY7jC,SAAUP,EACtCuG,KAAK+iB,MAAM7lB,KAAK2gC,EAAYpkC;AAChC,IAAK,GAAIA,GAAI,EAAGA,EAAIqkC,EAAc9jC,SAAUP,EACxCuG,KAAK+iB,MAAM7lB,KAAK4gC,EAAcrkC,MAGlCmkC,EACA59B,KAAK4xB,iBAAiBlV,UAAUC,IAAI,2BAEpC3c,KAAK4xB,iBAAiBlV,UAAUqC,OAAO,2BAE3C/e,KAAKy0B,gBAGTvZ,EAAQvb,UAAUs2B,uBAAyB,SAASv8B,GAEhD,IAAK,GADDwpB,MACK8a,EAAK,EAAGA,EAAKh+B,KAAK6iB,cAAc7oB,SAAUgkC,EAC/C9a,EAAGhmB,KAAK8C,KAAK+iB,MAAM/iB,KAAK6iB,cAAcmb,IAG1CtkC,GAAEK,KAAKiG,MAEPA,KAAK6iB,gBACL,KAAK,GAAI7B,GAAM,EAAGA,EAAMhhB,KAAK+iB,MAAM/oB,SAAUgnB,EACrCkC,EAAGlmB,QAAQgD,KAAK+iB,MAAM/B,KAAS,GAC/BhhB,KAAK6iB,cAAc3lB,KAAK8jB,IAIpC9F,EAAQvb,UAAUo4B,YAAc,SAASvb,EAAMyhB,GAC3C,GAAIlW,GAAW/nB,KAAKk+B,gBAAgB1hB,EACpC,IAAgC,UAA5BA,EAAKgH,UAAUuE,SACfA,EAAS0S,SAASje,OACf,CACH,GAAI2hB,GAAiBF,GAAgBlW,EAASqW,UAC1Cp+B,MAAKq+B,YACLr+B,KAAKq+B,WAAWC,WAAW9hB,EAAM2hB,KAK7CjjB,EAAQvb,UAAUu+B,gBAAkB,SAAS1hB,GACzC,GAAIuL,GAAWvL,EAAKgH,UAAUuE,UAAY/nB,KAAK8nB,eAC/C,OAAyB,gBAAdC,GACA/nB,KAAKqnB,UAAUU,GACiB,kBAAzBA,GAASqW,YACc,kBAAvBrW,GAAS0S,SAChB1S,MAEPvY,SAAQC,IAAI,iCAMpByL,EAAQvb,UAAUu2B,oBAAsB,SAASqI,GAE7C,IAAK,GADDC,MACK31B,EAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAI5P,GAAI+G,KAAK+iB,MAAMla,EACf5P,GAAEuqB,UAAUib,WACZC,MAAMF,EAAcvlC,EAAEuqB,UAAUib,UAAWxlC,GAInD,GAAI0lC,KACAJ,IACAv+B,KAAK+iB,MAAM6b,SACf,KAAK,GAAI/1B,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAI5P,GAAI+G,KAAK+iB,MAAMla,EACnB,IAAI5P,EAAEuqB,UAAUib,UAAW,CACvB,GAAII,GAAKL,EAAavlC,EAAEuqB,UAAUib,UAClC,IAAII,EAAI,CACAN,GACAM,EAAGD,SACP,KAAK,GAAIE,GAAM,EAAGA,EAAMD,EAAG7kC,SAAU8kC,EACjCH,EAASzhC,KAAK2hC,EAAGC,GACrBN,GAAavlC,EAAEuqB,UAAUib,WAAa,UAG1CE,GAASzhC,KAAKjE,GAGlBslC,GACAI,EAASC,UACb5+B,KAAK+iB,MAAMzR,OAAO,EAAGtR,KAAK+iB,MAAM/oB,OAChC,KAAK,GAAI8kC,GAAM,EAAGA,EAAMH,EAAS3kC,SAAU8kC,EACvC9+B,KAAK+iB,MAAM7lB,KAAKyhC,EAASG,KAGjC5jB,EAAQvb,UAAU80B,aAAe,WAI7B,IAAK,GAHDsK,MACAP,KAEK31B,EAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAI5P,GAAI+G,KAAK+iB,MAAMla,EACf5P,GAAEu+B,SACFuH,EAAc7hC,KAAKjE,GACfA,EAAEuqB,UAAUib,WACZC,MAAMF,EAAcvlC,EAAEuqB,UAAUib,UAAWxlC,IAKvD,IAAK,GAAI4P,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAI5P,GAAI+G,KAAK+iB,MAAMla,EACd5P,GAAEu+B,SACHuH,EAAc7hC,KAAKjE,GACfA,EAAEuqB,UAAUib,WACZC,MAAMF,EAAcvlC,EAAEuqB,UAAUib,UAAWxlC,IAKvD,IAAK,GAAI4oB,KAAK2c,GAAc,CACxB,GAAIzb,GAAQyb,EAAa3c,GACrB4c,EAAYz+B,KAAKkoB,WAAWrG,EAC3B4c,KACDA,GACIO,QAAS7jB,EACL,MACAA,EAAY,OAAQ0G,GAAIhF,UAAW,sBAClCA,UAAW,gBAEpB7c,KAAKkoB,WAAWrG,GAAK4c,GAGrBA,EAAUO,QAAQC,YAClBR,EAAUO,QAAQC,WAAWva,YAAY+Z,EAAUO,QAIvD,KAAK,GAFDvjB,GAASsH,EAAM,GAAGyU,OAASx3B,KAAK4xB,iBAAmB5xB,KAAK6xB,WACxDl0B,EAAM,IAAUmC,EAAM,EACjB+I,EAAK,EAAGA,EAAKka,EAAM/oB,SAAU6O,EAAI,CACtC,GAAI4tB,GAAM1T,EAAMla,GAAI4tB,GACpB94B,GAAMD,KAAKC,IAAIA,EAAK84B,EAAIC,WACxB52B,EAAMpC,KAAKoC,IAAIA,EAAK22B,EAAIC,UAAYD,EAAIG,cAE5C6H,EAAUO,QAAQ5d,MAAMoV,IAAM74B,EAAM,KACpC8gC,EAAUO,QAAQ5d,MAAMua,KAAO,MAC/B8C,EAAUO,QAAQ5d,MAAM6T,OAAUn1B,EAAInC,EAAO,KAC7C8d,EAAOO,YAAYyiB,EAAUO,SAGjC,GAAIh/B,KAAKkqB,qBACL,IAAK,GAAIrhB,GAAK,EAAGA,EAAKk2B,EAAc/kC,SAAU6O,EAAI,CAC9C,GAAI5P,GAAI8lC,EAAcl2B,EACtB5P,GAAEimC,cAAcl/B,KAAKkqB,qBAAqBrhB,EAAK7I,KAAKkqB,qBAAqBlwB,SACrEf,EAAEuqB,UAAUib,UACZxlC,EAAEyN,MAAM0a,MAAMua,KAAO,OAErB1iC,EAAEyN,MAAM0a,MAAMua,KAAO,MACzB1iC,EAAE2hC,WAAa56B,KAAKkqB,qBAAqBrhB,EAAK7I,KAAKkqB,qBAAqBlwB,UAKpFkhB,EAAQvb,UAAUw/B,QAAU,WACxBn/B,KAAKo/B,iBAAiBp/B,KAAK+iB,OAC3B/iB,KAAKq/B,eACLr/B,KAAKimB,gBA+qCT,IAxqCA/K,EAAQvb,UAAUy/B,iBAAmB,SAASrc,GAC1C/iB,KAAKs/B,gBACL,IACIC,IADSv/B,KAAKosB,QAAUpsB,KAAKmsB,UAAa,EAC7BnsB,KAAK0pB,cAAgB1pB,KAAKuzB,MAAO,GAC9CiM,EAAax/B,KAAK2pB,cAAgB3pB,KAAKuzB,MAAO,EAE9CkM,GAAaz/B,KAAKmsB,UAAYnsB,KAAKosB,SAAW,EAC9CsT,EAAKD,EAAYz/B,KAAKipB,MAC1BjpB,MAAKipB,OAASwW,EACdz/B,KAAK2/B,kBAAoB3/B,KAAKuzB,KAC9B,KAAK,GAAIt6B,GAAI,EAAGA,EAAI8pB,EAAM/oB,SAAUf,EAAG,CACnC,GAAI2mC,GAAKF,CACL3c,GAAM9pB,GAAG4mC,aACTD,GAAM7c,EAAM9pB,GAAG4mC,YAEnB9c,EAAM9pB,GAAG4mC,WAAaD,EAG1B,GAAIE,GAAiB9/B,KAAKkpB,eAAiBlpB,KAAKuzB,MAE5CwM,EAAkBriC,KAAKoC,IAAI,GAAmB,EAAfE,KAAKmsB,WAAeoT,GACnDS,EAAgBtiC,KAAKC,KAAkB,EAAbqC,KAAKosB,SAAamT,GAAgC,EAAnBv/B,KAAKqpB,eAAmB,EAAwB,EAAnBrpB,KAAKqpB,cAAmB,KAC9G4W,EAAkBviC,KAAKoC,IAAI,GAAmB,EAAfE,KAAKmsB,WAAeqT,GACnDU,EAAgBxiC,KAAKC,KAAkB,EAAbqC,KAAKosB,SAAaoT,GAAgC,EAAnBx/B,KAAKqpB,eAAmB,EAAwB,EAAnBrpB,KAAKqpB,cAAmB,IAElH,KAAKrpB,KAAKq+B,YAAcr+B,KAAKq+B,WAAW78B,MAAQxB,KAAKwB,IAAK,CACtD,GAAIk3B,GAAK14B,KAAK24B,mBACV34B,MAAKq+B,YACLr+B,KAAKq+B,WAAW8B,SAEpBngC,KAAKq+B,WAAa,GAAI+B,GAAWpgC,KAAK+iB,MAAO/iB,KAAKwB,IAAKy+B,EAAiBC,EAAeJ,EAAgBpH,GAG3G,GAAI2H,GAAMrgC,KAAKq+B,WAAWiC,qBAAqBtgC,KAAKwB,IAAKu+B,EAAiBC,EACtEK,IAAOA,EAAI1iC,KAAOoiC,GAAmBM,EAAIvgC,KAAOkgC,GAChDhgC,KAAKugC,WAAa7iC,KAAKoC,IAAIugC,EAAI1iC,IAAKsiC,GACpCjgC,KAAKwgC,SAAW9iC,KAAKC,IAAI0iC,EAAIvgC,IAAKogC,KAElClgC,KAAKugC,WAAaN,EAClBjgC,KAAKwgC,SAAWN,GAGpBlgC,KAAKq+B,WAAWoC,iBAAiB1d,EACA/iB,KAAKwB,IACLxB,KAAKugC,WACLvgC,KAAKwgC,SACLV,IAYrC5kB,EAAQvb,UAAUk5B,cAAgB,SAAS5L,EAAcyT,GACrD,GAAK1gC,KAAKyqB,SAAV,CAGA,GACIkW,GAAQ3T,EADRlrB,EAAQ9B,IAERitB,IACA0T,EAAS3gC,KAAK6oB,OAAOoE,GAAc0T,OAC9B7+B,EAAM0oB,gBAAgByC,KACvBnrB,EAAM0oB,gBAAgByC,GAAgB,GAAI3C,IAE9C0C,EAAMlrB,EAAM0oB,gBAAgByC,KAE5B0T,EAAS3gC,KAAK+c,YACdiQ,EAAMhtB,KAAKqqB,iBAEf,IAAIuW,GAAYpR,EAASH,EAAYsR,GACrC,IAAID,EAAU,CACV,GAAIG,GAAYC,aAAa,sBAAwBF,EAAY,gBACjE,IAAIC,EACA,IACI9T,EAAWC,EAAK+T,KAAK56B,MAAM26B,aAAa,sBAAwBF,EAAY,aAAc3T,EAC1F,IAAI+T,IAAuB,EAAX/xB,KAAKC,QAAsB,EAAV2xB,EACjC,IAAgB,MAAZG,EACA,OAEN,MAAOC,GACLzxB,QAAQC,IAAI,uBAAyBwxB,IAKjD,GAAIC,GAAOlhC,KAAKyqB,QAChB,IAA0B,GAAtByW,EAAKlkC,QAAQ,MAAY,CACzB,GAAI2vB,GAAQH,OAAOD,SAASK,QACf,WAATD,GAA8B,SAATA,IACrBuU,EAAO,QAAUA,GAEzB,GAAIC,GAAYD,GAAMjZ,QAAQ,SAASA,GAEnC,IAAK,GADDoC,MACKjxB,EAAI,EAAGA,EAAI6uB,EAAQjuB,SAAUZ,EAAG,CACrC,GAAIu+B,GAAS1P,EAAQ7uB,EACrB,IAAKu+B,EAAOgJ,QAAkC,GAAxBhJ,EAAOgJ,OAAO3mC,OAApC,CAGA,GAAIonC,GAAUzJ,EAAOgJ,OAAO,EACxBS,GAAQC,OAASV,EAAOU,OAASD,EAAQE,MAAQX,EAAOW,MAAQF,EAAQ71B,SAAWo1B,EAAOp1B,SAG9F8e,EAAiBntB,KAAKy6B,IAG1BmJ,aAAa,sBAAwBF,EAAY,YAAcG,KAAKQ,UAAUlX,GAC9EyW,aAAa,sBAAwBF,EAAY,iBAAmB,GAAK3xB,KAAKC,MAE9E6d,EAAWC,EAAK3C,EAAkB4C,IACnC,SAASqB,KAETqS,KAOPzlB,EAAQvb,UAAUg0B,KAAO,SAAS7wB,EAAK0+B,GAEnC,GAAIC,GAAMzhC,KAAKosB,QAAUpsB,KAAKmsB,UAC1BuV,EAAS1hC,KAAKmsB,UAAc,EAAMrpB,EAAO9C,KAAKuzB,MAC9CoO,EAAOD,EAASD,CAEfD,KACGxhC,KAAKqpB,cAAgB,GAAKsY,EAAO3hC,KAAKqpB,gBACtCsY,EAAO3hC,KAAKqpB,cACZqY,EAAS1hC,KAAKosB,QAAUqV,GAEf,EAATC,IACAA,EAAS,EACTC,EAAOD,EAASD,IAIxBzhC,KAAKw5B,YAAY,KAAMkI,EAAQC,EAAM,KAAMH,IAG/CtmB,EAAQvb,UAAUyiB,SAAW,SAASsR,GAClC,GAAIkO,GAAK,EAAM5hC,KAAKuiB,gBAChBsf,EAAKD,EAAKlO,CACVmO,GAAK7hC,KAAKwiB,UACVqf,EAAI7hC,KAAKwiB,SAETqf,EAAK7hC,KAAKwzB,UACVqO,EAAK7hC,KAAKwzB,SAGVqO,GAAMD,IACN5hC,KAAKuiB,gBAAkBsf,EACvB7hC,KAAKyU,KAAK/W,KAAKyiB,IAAK,EAAM0hB,EAAM7hC,KAAK6f,aAI7C3E,EAAQvb,UAAU8U,KAAO,SAASqtB,GAC9B9hC,KAAK+oB,WAAa+Y,CAClB,IAAIC,GAA+D,EAAlDrkC,KAAKsd,OAAOhb,KAAKmsB,UAAYnsB,KAAKosB,SAAW,EAG9D,IAFApsB,KAAKmsB,UAAY4V,EAAa/hC,KAAK8f,SAAW9f,KAAK+oB,WAAa,EAChE/oB,KAAKosB,QAAU2V,EAAa/hC,KAAK8f,SAAW9f,KAAK+oB,WAAa,EAC1D/oB,KAAKqpB,cAAgB,GAAMrpB,KAAKosB,QAAUpsB,KAAKqpB,cAAgB,EAAI,CACnE,GAAI2Y,GAAMhiC,KAAKosB,QAAUpsB,KAAKmsB,UAAY,CAC1CnsB,MAAKosB,QAAUpsB,KAAKqpB,cACpBrpB,KAAKmsB,UAAYnsB,KAAKosB,QAAU4V,EAAM,EAE1C,GAAIhiC,KAAKmsB,UAAY,EAAG,CACpB,GAAI6V,GAAMhiC,KAAKosB,QAAUpsB,KAAKmsB,UAAY,CAC1CnsB,MAAKmsB,UAAY,EACjBnsB,KAAKosB,QAAUpsB,KAAKmsB,UAAY6V,EAAM,EAE1ChiC,KAAKuzB,MAAQvzB,KAAKmpB,mBAAqBnpB,KAAKosB,QAAUpsB,KAAKmsB,UAC/CnsB,MAAKosB,QAAUpsB,KAAKmsB,UAAY,EAE5BnsB,KAAKuzB,MAAQvzB,KAAK2/B,iBAElC3/B,MAAKs/B,iBACLt/B,KAAKm/B,WAGTjkB,EAAQvb,UAAUsiC,WAAa,SAASC,GACpC,IAAKliC,KAAKq+B,YAAcr+B,KAAKq+B,WAAW78B,MAAQxB,KAAKwB,IAEjD,WADAxB,MAAKm/B,SAIT,IACII,KADUv/B,KAAKosB,QAAUpsB,KAAKmsB,UAAW,GAAK,EACjCnsB,KAAK0pB,cAAgB1pB,KAAKuzB,MAAO,EACjCvzB,MAAK2pB,cAAgB3pB,KAAKuzB,MAAO,IAE7B,EAAhBvzB,KAAKugC,YAAgB7iC,KAAKoC,IAAI,GAAoB,EAAfE,KAAKmsB,WAAeoT,EAAW,KAAsB,EAAdv/B,KAAKwgC,UAAc9iC,KAAKC,KAAkB,EAAbqC,KAAKosB,SAAamT,GAAgC,EAAnBv/B,KAAKqpB,eAAmB,EAAwB,EAAnBrpB,KAAKqpB,cAAmB,OAC5LrpB,KAAKm/B,WAIbjkB,EAAQvb,UAAUolB,aAAe,SAASod,GACtC,GAAI3kB,GAAwD,EAAhDxd,KAAK6xB,WAAWoB,wBAAwBzV,KACpD,IAAa,GAATA,EAAJ,CAGA,GAAI4kB,GAAS1kC,KAAKoC,IAAIE,KAAKmpB,kBAAmB,IAI9C,IAFAnpB,KAAKmpB,kBAA0B,EAAN3L,EAErB4kB,GAAUpiC,KAAKmpB,kBAAmB,CAClCnpB,KAAKwzB,QAAUxzB,KAAK6f,SAAWniB,KAAK+R,IAAIzP,KAAKspB,aAAetpB,KAAK8f,UACjE9f,KAAKwiB,QAAUxiB,KAAK6f,SAAWniB,KAAK+R,IAAIzP,KAAKmpB,kBAAoBnpB,KAAKgpB,iBAAmBhpB,KAAK8f,UAC9F9f,KAAKuiB,gBAAkBviB,KAAK6f,SAAWniB,KAAK+R,KAAKzP,KAAKosB,QAAUpsB,KAAKmsB,UAAY,GAAKnsB,KAAK8f,SAE3F,IAAIuiB,GAAYriC,KAAKosB,QAAUpsB,KAAKmsB,UAChCmW,EAAMtiC,KAAKmsB,UAAakW,EAAYriC,KAAKmpB,kBAAqBiZ,CAElEpiC,MAAKosB,QAAUkW,CAEf,IAAIb,GAAMzhC,KAAKosB,QAAUpsB,KAAKmsB,UAAY,CACtCnsB,MAAKqpB,cAAgB,GAAKrpB,KAAKosB,QAAUpsB,KAAKqpB,gBAC9CrpB,KAAKosB,QAAUpsB,KAAKqpB,cACpBrpB,KAAKmsB,UAAYnsB,KAAKosB,QAAUqV,EAAM,GAEtCzhC,KAAKmsB,UAAY,IACjBnsB,KAAKmsB,UAAY,EACjBnsB,KAAKosB,QAAUpsB,KAAKmsB,UAAYsV,EAAM,GAG1CzhC,KAAKimB,gBAEAkc,GACDniC,KAAKiiC,aAETjiC,KAAKs/B,iBAGLt/B,KAAKs5B,YACLt5B,KAAKu5B,wBAIbre,EAAQvb,UAAU45B,oBAAsB,WACpC,GAAIhnB,GAAOuJ,SAAS4b,KAAKd,aAAe52B,KAAKokB,cAAcwS,YAC3D52B,MAAKokB,cAAchD,MAAMuQ,UAAYj0B,KAAKoC,IAAI,IAAK0sB,OAAO+V,YAAchwB,EAAO,IAAM,MAGzF2I,EAAQvb,UAAU43B,QAAU,SAASiL,GACjC,GAAI1gC,GAAQ9B,IAIZ,OAHAwiC,GAAO18B,EAAY08B,GACnBA,EAAK3K,UAAW,EAET73B,KAAK83B,SAAS0K,GAAM1pB,KAAK,SAAU0D,GAKtC,MAJA1a,GAAMi2B,YAAYvb,GAClB1a,EAAMq0B,oBACNr0B,EAAMmkB,gBACNnkB,EAAMw0B,WAAW,QAAS9Z,GACnBA,KAKftB,EAAQvb,UAAUy8B,WAAa,SAASoG,EAAMC,GAC1C,GAAIC,GAAS,EAEb,IAA0B,mBAAfF,GAAKziC,OAAyByiC,EAAKziC,OAAQ,GAAKyiC,EAAKziC,MAAQC,KAAK+iB,MAAM/oB,OAC/E0oC,EAASF,EAAKziC,UAEd,KAAK,GAAI8I,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAIT,GAAKpI,KAAK+iB,MAAMla,GAAI2a,SAExB,IAAIsM,EAAgB0S,EAAMp6B,GAAK,CAC3Bs6B,EAAS75B,CAAI,QAKzB,GAAa,EAAT65B,EACA,KAAM,8BAGV,IAAIC,GAAa3iC,KAAK+iB,MAAM2f,EAC5B1iC,MAAK+iB,MAAMzR,OAAOoxB,EAAQ,EAG1B,KAAK,GADDnM,MACKvV,EAAM,EAAGA,EAAMhhB,KAAK6iB,cAAc7oB,SAAUgnB,EAAK,CACtD,GAAIkC,GAAKljB,KAAK6iB,cAAc7B,EACnB0hB,GAALxf,EACAqT,EAAIr5B,KAAKgmB,GACFA,EAAKwf,GACZnM,EAAIr5B,KAAKgmB,EAAK,GAGtBljB,KAAK6iB,cAAgB0T,EACrBv2B,KAAKm2B,oBAELwM,EAAWzS,UACPlwB,KAAKq+B,aACLr+B,KAAKq+B,WAAWuE,aAAaD,GAAc,MAG/C3iC,KAAKq2B,eACLr2B,KAAKs2B,WAAW,UAAWqM,IAG/BznB,EAAQvb,UAAUkjC,eAAiB,WAClC,GAAI/gC,GAAQ9B,IACTA,MAAK6iB,iBACL7iB,KAAKm2B,oBACLn2B,KAAK+iB,MAAMnH,QAAQ,SAAU+mB,GACzBA,EAAWzS,UACPpuB,EAAMu8B,aACNv8B,EAAMu8B,WAAWuE,aAAaD,GAAc,QAGpD3iC,KAAK+iB,MAAM/oB,OAAS,EACpBgG,KAAKq2B,eACLr2B,KAAKs2B,WAAW,aAAc,OAGlCpb,EAAQvb,UAAUg5B,kBAAoB,WAGlC,MAF6Bx2B,UAAzBnC,KAAK8iC,kBACL9iC,KAAK8iC,gBAAkB9iC,KAAK+iC,sBACzB/iC,KAAK8iC,iBAGhB5nB,EAAQvb,UAAUojC,mBAAqB,WACnC,IAAK,GAAIl6B,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EACvC,GAAI7I,KAAK+iB,MAAMla,GAAIozB,eACf,MAAOj8B,MAAK+iB,MAAMla,GAAIozB,cAI9B,KAAK,GAAIlG,GAAK,EAAGA,EAAK/1B,KAAKuqB,eAAevwB,SAAU+7B,EAAI,CACpD,GAAI38B,GAAI4G,KAAKuqB,eAAewL,EAC5B,IAAI38B,EAAE4pC,sBAAuC,YAAf5pC,EAAE6pC,WAA2B7pC,EAAE8pC,WAAa9pC,EAAE+pC,WACxE,MAAI/pC,GAAE8pC,WAAa9pC,EAAE+pC,WACV,GAAIC,GAAqBhqC,GACzBA,EAAEiqC,WACF,GAAIC,GAAsBlqC,GAE1B,GAAImqC,GAAkBnqC,KAM7C8hB,EAAQvb,UAAU65B,YAAc,SAASgK,EAAQC,EAAQC,EAAQnoC,EAAUimC,GACvE,GAAuB,gBAAZiC,GACP,KAAM9pC,OAAM,iCAAmConC,KAAKQ,UAAUkC,GAAU,IAE5E,IAAuB,gBAAZC,GACP,KAAM/pC,OAAM,iCAAmConC,KAAKQ,UAAUmC,GAAU,IAG5E,IAAID,EAASC,EAAQ,CACjB,GAAIC,GAAYF,CAChBA,GAASC,EACTA,EAASC,MACFF,KAAWC,IAClBA,GAAU,EAGTnoC,KACDA,EAAW,SAASoe,GAChB,GAAIA,EACA,KAAMA,IAIlB,IAAI7X,GAAQ9B,IAEZ,MAAMwjC,GAAUA,GAAUxjC,KAAKwB,MAAQxB,KAAKqpB,cAAgB,EACxD,MAAOrpB,MAAK4jC,aAAa,KAAMH,EAAQC,EAAQ,KAAMnoC,EAAUimC,EAE/D,IAAI9I,GAAK14B,KAAK24B,mBACd,KAAKD,EACD,MAAOn9B,GAAS,yBAGpB,IAAIsoC,GAAUL,GAAUxjC,KAAKwB,GAC7Bk3B,GAAGE,WAAWiL,EAAS,SAAS9N,GAC5B,GAAKA,EAiBD,MAAOj0B,GAAM8hC,aAAaJ,EAAQC,EAAQC,EAAQ3N,EAAIx6B,EAAUimC,EAhBhE,IAAIsC,EAEAA,GAD0B,GAA1BD,EAAQ7mC,QAAQ,OACP6mC,EAAQr1B,OAAO,GAEf,MAAQq1B,EAErBnL,EAAGE,WAAWkL,EAAQ,SAASC,GAC3B,OAAKA,GAAOP,EACDjoC,EAAS,2BAA6BioC,EAAS,KAC9CO,EAGDjiC,EAAM8hC,aAAaE,EAAQL,EAAQC,EAAQK,EAAKxoC,EAAUimC,GAF1D1/B,EAAM8hC,aAAa,KAAMH,EAAQC,EAAQ,KAAMnoC,EAAUimC,QAYxFtmB,EAAQvb,UAAUikC,aAAe,SAASJ,EAAQC,EAAQC,EAAQM,EAAYzoC,EAAUimC,GACpF,GAAIyC,IAAa,CACbT,KAC6B,GAAzBA,EAAOxmC,QAAQ,SACfwmC,EAASA,EAAOvmC,UAAU,IAE1B+C,KAAKwB,KAAOgiC,IACZS,GAAa,GACjBjkC,KAAKwB,IAAMgiC,EACXxjC,KAAKqpB,cAAgB2a,EAAWhqC,QAGpCypC,EAAS78B,WAAW68B,GAASC,EAAO98B,WAAW88B,EAE/C,IAAIQ,GAAWxmC,KAAKoC,IAAI,GAAI4jC,EAAOD,EAAO,EAE1C,KAAKjC,EAAM,CACP,GAAI2C,GAAMnkC,KAAKqpB,aACJ,IAAP8a,IACAA,EAAM,MACG,EAATV,IACAA,EAAS,EAAGC,EAASD,EAASS,EAAW,GAEzCR,EAASS,IACTT,EAASS,EACTV,EAAS/lC,KAAKoC,IAAI,EAAG4jC,EAASQ,EAAW,IAIjDlkC,KAAKmsB,UAAYsX,EACjBzjC,KAAKosB,QAAUsX,CACf,IAAIU,GAAW1mC,KAAKoC,IAAIE,KAAKmpB,mBAAqBnpB,KAAKqsB,mBAAoB,KAAOrsB,KAAKosB,QAAUpsB,KAAKmsB,WAClGkY,EAAWrkC,KAAKuzB,MAChB+Q,EAAgB5mC,KAAKq8B,IAAIqK,EAAWC,GAAa,IACrDrkC,MAAKuzB,MAAQ6Q,CAEb,IAAIG,GAAOC,CAIX,IAHAA,EAAQxkC,KAAKuiB,gBACbviB,KAAKuiB,gBAAkBgiB,EAAQvkC,KAAK6f,SAAWniB,KAAK+R,KAAKzP,KAAKosB,QAAUpsB,KAAKmsB,UAAY,GAAKnsB,KAAK8f,UAE/FwkB,GAAgBL,EAAY,CAC5B,IAAK,GAAIxqC,GAAI,EAAGA,EAAIuG,KAAK+iB,MAAM/oB,SAAUP,EACrCuG,KAAK+iB,MAAMtpB,GAAGgrC,eAAerjB,MAAMua,KAAO,SAC1C37B,KAAK+iB,MAAMtpB,GAAGirC,QAAQtjB,MAAMua,KAAO,QAQvC,IALA37B,KAAKm/B,UAKDn/B,KAAKsiB,UAAW,CAChBiiB,GAASvkC,KAAKwiB,QACdgiB,GAASxkC,KAAKwiB,OACd,IAAImiB,GAAcJ,EAAQC,EACtBI,EAAaL,EAAQvkC,KAAKsiB,SAC1B5kB,MAAKq8B,IAAI4K,GAAejnC,KAAKq8B,IAAI6K,KACjC5kC,KAAKsgB,eAAiBtgB,KAAKsgB,cAC3BtgB,KAAKsiB,UAAYkiB,OAGrBxkC,MAAKsgB,eAAgB,EACrBtgB,KAAKsiB,UAAY,SAKrB,KAAK,GAAI7oB,KAFSuG,KAAKmsB,UAAYnsB,KAAKosB,SAAS,EAEpC,GAAG3yB,EAAIuG,KAAK+iB,MAAM/oB,SAAUP,EAAG,CACxC,GAAIa,IAAU0F,KAAKmsB,UAAYnsB,KAAK+iB,MAAMtpB,GAAGorC,SAAS7kC,KAAKuzB,KAC3DvzB,MAAK+iB,MAAMtpB,GAAGgrC,eAAerjB,MAAMua,KAAO,KAAe,GAAPrhC,GAAY,KAAQ,KACtE0F,KAAK+iB,MAAMtpB,GAAGqrC,cAStB,MALA9kC,MAAKs/B,iBAELt/B,KAAKiiC,aACDjiC,KAAK+kC,qBACL/kC,KAAKglC,kBAA+B,EAAX/1B,KAAKC,OAC3B3T,KAGX2f,EAAQvb,UAAUslC,kBAAoB,SAASzB,EAAQ0B,GACnD,GAAIC,IAAanlC,KAAKosB,QAAUpsB,KAAKmsB,WAAW,EAChDsX,EAASyB,EAAeC,EACxBzB,EAASwB,EAAeC,CACxBnlC,MAAKw5B,YAAYgK,EAAQC,EAAQC,IAGrCxoB,EAAQvb,UAAUylC,aAAe,WAC7B,GAAKplC,KAAK+kC,oBAAuB/kC,KAAKglC,kBAAtC,CAIA,IAAK,GADDK,GAAW,EACNx8B,EAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EACW,SAA9C7I,KAAK+iB,MAAMla,GAAIy8B,aAAalkB,MAAMC,WAChCgkB,CAGV,IAAgB,GAAZA,EAAe,CACf,GAAIn2B,GAAiB,EAAXD,KAAKC,KACfM,SAAQC,IAAI,iBAAmBP,EAAIlP,KAAKglC,mBAAqB,MAC7DhlC,KAAKglC,kBAAoB,QAIjC9pB,EAAQvb,UAAU4lC,gBAAkB,SAASC,GACzCxlC,KAAK2rB,cAAczuB,KAAKsoC,IAG5BtqB,EAAQvb,UAAU0c,mBAAqB,SAASmpB,EAAS/jC,GACrDA,EAAOA,MACPzB,KAAKqoB,iBAAiBnrB,KAAKsoC,IAG/BtqB,EAAQvb,UAAU8lC,sBAAwB,SAASD,EAAS/jC,GACxD,GAAIikC,GAAMC,aAAa3lC,KAAKqoB,iBAAkBmd,EAC1CE,IAAO,GACP1lC,KAAKqoB,iBAAiB/W,OAAOo0B,EAAK,IAI1CxqB,EAAQvb,UAAUq8B,cAAgB,SAAS/jB,EAAIqE,EAASC,EAAKC,GAC3D,IAAK,GAAIopB,GAAM,EAAGA,EAAM5lC,KAAKqoB,iBAAiBruB,SAAU4rC,EACpD,IACI,GAAI5lC,KAAKqoB,iBAAiBud,GAAK3tB,EAAIqE,EAASC,EAAKC,GAC/C,OACJ,MAAOqpB,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAKzBzf,EAAQvb,UAAUmmC,wBAA0B,SAASN,EAAS/jC,GAC1DA,EAAOA,MACPzB,KAAKsoB,sBAAsBprB,KAAKsoC,IAGpCtqB,EAAQvb,UAAUomC,2BAA6B,SAASP,EAAS/jC,GAC7D,GAAIikC,GAAMC,aAAa3lC,KAAKsoB,sBAAuBkd,EAC/CE,IAAO,GACP1lC,KAAKsoB,sBAAsBhX,OAAOo0B,EAAK,IAI/CxqB,EAAQvb,UAAUk8B,mBAAqB,SAAS5jB,EAAIqE,EAASC,EAAKC,GAC9D,IAAK,GAAIopB,GAAM,EAAGA,EAAM5lC,KAAKsoB,sBAAsBtuB,SAAU4rC,EACzD,IACI5lC,KAAKsoB,sBAAsBsd,GAAK3tB,EAAIqE,EAASC,EAAKC,GACpD,MAAOqpB,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAK3Bzf,EAAQvb,UAAUygB,gBAAkB,SAASolB,EAAS/jC,GAClDA,EAAOA,MACPzB,KAAKuoB,cAAcrrB,KAAKsoC,IAG5BtqB,EAAQvb,UAAUqmC,mBAAqB,SAASR,EAAS/jC,GACrD,GAAIikC,GAAMC,aAAa3lC,KAAKuoB,cAAeid,EACvCE,IAAO,GACP1lC,KAAKuoB,cAAcjX,OAAOo0B,EAAK,IAIvCxqB,EAAQvb,UAAU2/B,eAAiB,WAC/B,GAAI2G,GAAMvoC,KAAKoC,IAAI,EAAkB,EAAfE,KAAKmsB,WACvBmW,EAAmB,EAAbtiC,KAAKosB,OACXpsB,MAAKqpB,cAAgB,GAAKiZ,EAAMtiC,KAAKqpB,gBACrCiZ,EAAMtiC,KAAKqpB,cAEf,KAAK,GAAI6c,GAAM,EAAGA,EAAMlmC,KAAKuoB,cAAcvuB,SAAUksC,EACjD,IACIlmC,KAAKuoB,cAAc2d,GACflmC,KAAKwB,IACLykC,EACA3D,EACAtiC,KAAKuiB,iBACJ9B,QAASzgB,KAAKuiB,gBACdhC,UAAYvgB,KAAKsiB,UAAUtiB,KAAKwiB,SAAYxiB,KAAKwiB,QACjDlC,cAAetgB,KAAKsgB,cACpB3iB,IAAKqC,KAAKwiB,QACV1iB,IAAKE,KAAKwzB,SACVxzB,KAAKmsB,UACLnsB,KAAKosB,SACZ,MAAOyZ,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAK3Bzf,EAAQvb,UAAU2hB,gBAAkB,SAASkkB,GACzCxlC,KAAKyoB,cAAcvrB,KAAKsoC,IAG5BtqB,EAAQvb,UAAUwmC,mBAAqB,SAASX,GAC5C,GAAIE,GAAMC,aAAa3lC,KAAKyoB,cAAe+c,EACvCE,IAAO,GACP1lC,KAAKyoB,cAAcnX,OAAOo0B,EAAK,IAIvCxqB,EAAQvb,UAAU22B,WAAa,SAAShd,EAAQkD,GAC5C,IAAK,GAAI4pB,GAAM,EAAGA,EAAMpmC,KAAKyoB,cAAczuB,SAAUosC,EACjD,IACIpmC,KAAKyoB,cAAc2d,GAAK9sB,EAAQkD,GAClC,MAAOqpB,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAK3Bzf,EAAQvb,UAAU0mC,wBAA0B,SAASb,GACjDxlC,KAAKwoB,sBAAsBtrB,KAAKsoC,IAGpCtqB,EAAQvb,UAAU2mC,2BAA6B,SAASd,GACpD,GAAIE,GAAMC,aAAa3lC,KAAKwoB,sBAAuBgd,EAC/CE,IAAO,GACP1lC,KAAKwoB,sBAAsBlX,OAAOo0B,EAAK,IAI/CxqB,EAAQvb,UAAUu8B,mBAAqB,SAAS16B,EAAK7D,EAAKmC,GACtD,IAAK,GAAIymC,GAAM,EAAGA,EAAMvmC,KAAKwoB,sBAAsBxuB,SAAUusC,EACzD,IACIvmC,KAAKwoB,sBAAsB+d,GAAK/kC,EAAK7D,EAAKmC,GAC5C,MAAO+lC,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAM3Bzf,EAAQvb,UAAU6mC,gBAAkB,SAAShlC,EAAK7D,EAAKmC,GACnD,GAAIgC,GAAQ9B,IAEZ,IAAIwB,GAAOxB,KAAKwB,IACZ,MAAOxB,MAAKymC,iBAAiBjlC,EAAK7D,EAAKmC,EAG3C,IAAI44B,GAAK14B,KAAK24B,mBACd,KAAKD,EACD,KAAM,wBAGVA,GAAGE,WAAWp3B,EAAK,SAASu0B,GACxB,GAAKA,EAeD,MAAOj0B,GAAM2kC,iBAAiBjlC,EAAK7D,EAAKmC,EAdxC,IAAIgkC,EAEAA,GADsB,GAAtBtiC,EAAIxE,QAAQ,OACHwE,EAAIgN,OAAO,GAEX,MAAQhN,EAErBk3B,EAAGE,WAAWkL,EAAQ,SAASC,GAC3B,MAAKA,GAGMjiC,EAAM2kC,iBAAiB3C,EAAQnmC,EAAKmC,GAH/C,YAYhBob,EAAQvb,UAAU8mC,iBAAmB,SAASjlC,EAAK7D,EAAKmC,GACpD,IAAK,GAAIg5B,GAAK,EAAGA,EAAK94B,KAAKmhB,WAAWnnB,SAAU8+B,EAAI,CAChD,GAAI4N,GAAI1mC,KAAKmhB,WAAW2X,EACxB,IAAI4N,EAAEllC,KAAOA,GAAOklC,EAAE/oC,KAAOA,GAAO+oC,EAAE5mC,KAAOA,EACzC,OAGRE,KAAKmhB,WAAWjkB,KAAK,GAAIkqB,GAAO5lB,EAAK7D,EAAKmC,GAC1C,IAAI6mC,GAAW3mC,KAAKmsB,UAAa,IAAKnsB,KAAKuzB,MACvCqT,EAAS5mC,KAAKosB,QAAW,IAAKpsB,KAAKuzB,OAClC/xB,GAAOxB,KAAKwB,KAAOA,GAAQ,MAAMxB,KAAKwB,MAAeolC,EAANjpC,GAAgBmC,EAAM6mC,GACtE3mC,KAAKq/B,eAGTr/B,KAAKs/B,kBAGTpkB,EAAQvb,UAAUgkB,gBAAkB,WAChC3jB,KAAKmhB,cACLnhB,KAAKq/B,eACLr/B,KAAKs/B,kBAGTpkB,EAAQvb,UAAU0/B,aAAe,WAC7B,IAAK,GAAIx2B,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EACvC7I,KAAK+iB,MAAMla,GAAIi8B,eAIvB5pB,EAAQvb,UAAUknC,iBAAmB,SAASrlC,EAAK7D,EAAKmC,GACpD,GAAImR,KACJ,IAAIzP,IAAQxB,KAAKwB,IACb,QAGJ,KAAK,GAAIqH,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAEvC,IAAK,GADDi+B,GAAK9mC,KAAK+iB,MAAMla,GAAIk+B,oBACfjzB,EAAK,EAAGA,EAAKgzB,EAAG9sC,SAAU8Z,EAAI,CACnC,GAAIpa,GAAIotC,EAAGhzB,EACPpa,GAAEiE,KAAOmC,GAAOpG,EAAEoG,KAAOnC,GACzBsT,EAAS/T,KAAKxD,GAI1B,MAAOuX,IAIXiK,EAAQvb,UAAUwjB,gBAAkB,WAChC,MAAInjB,MAAK6iB,cAAc7oB,OAAS,EACrBgG,KAAK6iB,cAAc,GAEnB,IAGf3H,EAAQvb,UAAUiiB,gBAAkB,SAAS3oB,GAChC,MAALA,EACA+G,KAAK6iB,iBAEL7iB,KAAK6iB,eAAiB5pB,GAE1B+G,KAAKm2B,oBACLn2B,KAAKo2B,uBAGTlb,EAAQvb,UAAUw2B,kBAAoB,WAClC,IAAK,GAAIttB,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAIm+B,GAAShnC,KAAK+iB,MAAMla,GAAIwzB,UAExBr8B,MAAK6iB,cAAc7lB,QAAQ6L,IAAO,EAClCm+B,EAAOtqB,UAAUC,IAAI,UAErBqqB,EAAOtqB,UAAUqC,OAAO,UAGhC,GAAI/e,KAAK6iB,cAAc7oB,OAAS,EAAG,CAC/B,GAAIitC,GAAajnC,KAAKokB,cAAcsS,UAAY12B,KAAKokB,cAAcwS,aAAa,CAC5EqQ,GAAanrB,SAAS4b,KAAK7D,WAAcoT,EAAa,IAAOnrB,SAAS4b,KAAK7D,UAAYrH,OAAO+V,aAC9FviC,KAAKokB,cAAcP,UAI/B3I,EAAQvb,UAAU8jB,yBAA2B,SAAS+hB,GAClDxlC,KAAK0oB,uBAAuBxrB,KAAKsoC,IAGrCtqB,EAAQvb,UAAUunC,4BAA8B,SAAS1B,GACrD,GAAIE,GAAMC,aAAa3lC,KAAK0oB,uBAAwB8c,EAChDE,IAAO,GACP1lC,KAAK0oB,uBAAuBpX,OAAOo0B,EAAK,IAIhDxqB,EAAQvb,UAAUy2B,oBAAsB,WACpC,IAAK,GAAIwP,GAAM,EAAGA,EAAM5lC,KAAK0oB,uBAAuB1uB,SAAU4rC,EAC1D,IACI5lC,KAAK0oB,uBAAuBkd,GAAK5lC,KAAK6iB,eACxC,MAAOgjB,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAM3Bzf,EAAQvb,UAAUikB,6BAA+B,SAASlqB,GACtDsG,KAAK2oB,2BAA2BzrB,KAAKxD,IAGzCwhB,EAAQvb,UAAUwnC,gCAAkC,SAAS3B,GACzD,GAAIE,GAAMC,aAAa3lC,KAAK2oB,2BAA4B6c,EACpDE,IAAO,GACP1lC,KAAK2oB,2BAA2BrX,OAAOo0B,EAAK,IAIpDxqB,EAAQvb,UAAUk3B,wBAA0B,SAASp9B,GACjD,IAAK,GAAImsC,GAAM,EAAGA,EAAM5lC,KAAK2oB,2BAA2B3uB,SAAU4rC,EAC9D,IACI5lC,KAAK2oB,2BAA2Bid,GAAKnsC,GACvC,MAAOosC,GACLr2B,QAAQC,IAAIo2B,EAAGlL,SAM3Bzf,EAAQvb,UAAUsmB,cAAgB,WAC9B,GAAI5E,GAAU,OACVsa,EAAO,GACPyL,EAAQ,EAmBZ,IAjB0B,UAAtBpnC,KAAKgmB,eACL3E,EAAU,QACVsa,EAAO,IAAO37B,KAAKmpB,kBAAkB,EAAG,GAAK,MAChB,QAAtBnpB,KAAKgmB,eACZ3E,EAAU,QACVsa,EAAO,OACsB,SAAtB37B,KAAKgmB,eACZ3E,EAAU,QACV+lB,EAAQ,OAER/lB,EAAU,OAGdrhB,KAAKyyB,MAAMrR,MAAMC,QAAUA,EAC3BrhB,KAAKyyB,MAAMrR,MAAMua,KAAOA,EACxB37B,KAAKyyB,MAAMrR,MAAMgmB,MAAQA,EAEtBpnC,KAAKomB,oBAAqB,CACzBpmB,KAAK0yB,OAAOtR,MAAMC,QAAU,QAC5BrhB,KAAK0yB,OAAOtR,MAAMimB,YAAc,MAC5BrnC,KAAKuzB,MAAQ,GACbvzB,KAAK0yB,OAAOtR,MAAM5D,MAAQ,MAC1Bxd,KAAK0yB,OAAOtR,MAAMkmB,iBAAmB,QAErCtnC,KAAK0yB,OAAOtR,MAAM5D,MAAQxd,KAAKuzB,MAAQ,KACvCvzB,KAAK0yB,OAAOtR,MAAMkmB,iBAAmB,OAGzCtnC,KAAK+xB,cAAc3Q,MAAM6b,WAAa,SACtC,IAAIsK,GAAevnC,KAAKmpB,kBAAkB,EAAInpB,KAAK+xB,cAAcyV,YAAY,EAAIxnC,KAAK0yB,OAAO8U,YAAY,CACzGxnC,MAAK+xB,cAAc3Q,MAAMua,KAAO,IAAmB,EAAb4L,GAAkB,SAExDvnC,MAAK+xB,cAAc3Q,MAAM6b,WAAa,SACtCj9B,KAAK0yB,OAAOtR,MAAM5D,MAAQ,MAC1Bxd,KAAK0yB,OAAOtR,MAAMimB,YAAc,MAChCrnC,KAAK0yB,OAAOtR,MAAMC,QAAgC,UAAtBrhB,KAAKgmB,cAA4B,OAAS,OAG1EhmB,MAAK0yB,OAAOtR,MAAMua,KAAO,IAAO37B,KAAKmpB,kBAAkB,EAAG,GAAK,IAE/D,KAAK,GAAItgB,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAGI0sB,GAHA/Y,EAAOxc,KAAK+iB,MAAMla,GAClB/N,EAAI0hB,EAAKirB,YAGTjrB,GAAKwY,UAAYxY,EAAKwY,SAASh7B,OAAS,IACxCu7B,EAAQ/Y,EAAKwY,SAAS,GAAGO,OAEzBz6B,IACAA,EAAEsmB,MAAMC,QAAUkU,EAAQlU,EAAU,OACpCvmB,EAAEsmB,MAAMua,KAAOA,EACf7gC,EAAEsmB,MAAMgmB,MAAQA,KAK5BlsB,EAAQvb,UAAUo8B,mBAAqB,SAASxf,EAAK+Q,EAAIC,GACrD,GAAKhR,GAAqB,GAAdA,EAAIviB,OAAhB,CAGA,GAAIN,GAAI6iB,EAAIA,EAAIviB,OAAS,EAEzB,IAAKN,EAAEiE,KAAQjE,EAAEoG,IAAjB,CAIA,GAAI4nC,KAAkB,EAANhuC,EAAEiE,MAAyB,EAAfqC,KAAKmsB,YAAgBnsB,KAAKuzB,MAClDoU,GAAYjuC,EAAEoG,IAAMpG,EAAEiE,IAAO,GAAKqC,KAAKuzB,MAEvCqU,IAAkB,EAANluC,EAAEiE,MAAgB,EAANjE,EAAEoG,MAAS,CACvC,IAAI6nC,EAAS,GAAI,CACb,GAAI3nB,GAAQ,GAAOsN,EAAKoa,GAAWC,CACxB,IAAP3nB,EACA4nB,EAAgB,EAANluC,EAAEiE,IACJqiB,EAAO,KACf4nB,GAAgB,EAANluC,EAAEoG,KAAS,GAI7B,GAAI0d,GAAQxd,KAAKosB,QAAUpsB,KAAKmsB,SAChCnsB,MAAKw5B,YAAY,KAAMoO,EAAUpqB,EAAM,EAAIoqB,EAAUpqB,EAAM,MAG/DtC,EAAQvb,UAAUkoC,aAAe,SAAStU,GACtC,GAAIuU,EAQJ,OANIA,GADAvU,EAAQvzB,KAAKwpB,kBACH,OACH+J,EAAQvzB,KAAKypB,oBACV,SAEA,OAKlBvO,EAAQvb,UAAUooC,oBAAsB,WACpC,MAAO/nC,MAAK6nC,aAAa7nC,KAAKuzB,QAGlCrY,EAAQvb,UAAUu3B,aAAe,WAE7B,IAAK,GADD8Q,GAAY,EACPn/B,EAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EACvCm/B,GAAchoC,KAAK+iB,MAAMla,GAAIo/B,eAAiB,EAClDjoC,MAAKyyB,MAAMrR,MAAM6T,OAAS,GAAK+S,EAAY,KAC3ChoC,KAAK0yB,OAAOtR,MAAM6T,OAAS,GAAK+S,EAAY,KAC5ChoC,KAAKokB,cAAchD,MAAMC,QAAU,QACnCrhB,KAAKokB,cAAchD,MAAMC,QAAU,eACnCrhB,KAAKokB,cAAchD,MAAMC,QAAU,QAIvCnG,EAAQvb,UAAUi1B,eAAiB,SAAS3c,EAAI5E,GAI5C,GAHIrT,KAAKijB,sBACL5P,GAAOA,GAEP4E,EAAGkd,SAAWld,EAAGmd,QAAS,CAC1B,GAAI8S,IAAQ,CACTjwB,GAAG4c,WACFqT,GAAQ,GAGZloC,KAAKgjB,KAAK3P,EAAK60B,OACZ,IAAIloC,KAAKuzB,MAAQ,EAAG,CAEvB,GAAI4U,IAAOnoC,KAAKmsB,UAAYnsB,KAAKosB,SAAS,EACtCzS,EAAMwuB,EAAMzqC,KAAKsd,MAAMmtB,GACvBjvC,EAAI,CACJ+e,GAAG4c,WACH37B,GAAK,IACLma,EAAM,GACNna,GAAKA,EACLA,GAAKygB,EACDA,EAAM,IACNzgB,GAAK,KAETA,GAAKygB,EACK,EAANA,IACAzgB,GAAK,IAEb8G,KAAKw5B,YAAY,KAAMx5B,KAAKmsB,UAAYjzB,EAAG8G,KAAKosB,QAAUlzB,OAE1D8G,MAAK2zB,KAAK1b,EAAG4c,SAAW,IAAIxhB,EAAM,GAAGA,IAI7C6H,EAAQvb,UAAUqjB,KAAO,SAAS3P,EAAK60B,GACnC,GAAIpmC,GAAQ9B,KACR8C,GAAMhB,EAAMqqB,UAAYrqB,EAAMsqB,QAAU,GAAG,EAAG,CAC9C/Y,GAAM,GAAKvR,EAAMqqB,WAAa,EAC9BrpB,GAAO,IACM,EAANuQ,GAAWvR,EAAMsqB,SAAWtqB,EAAMunB,gBACzCvmB,GAAO,IAGX,IAAIogB,GAAKphB,EAAMqhB,iBACf,MAAS,EAALD,GAAJ,CACA,GAAI1G,GAAO1a,EAAMihB,MAAMG,EAEnB1G,KAAUA,EAAK4G,eAAiBpjB,KAAKqjB,uBAAuB7G,EAAK4G,cAAe,cAAmD,gBAA5B5G,GAAK8G,oBAC/F9G,EAAK4G,eAAiBpjB,KAAKqjB,uBAAuB7G,EAAK4G,cAAe,SACnF5G,EAAK4rB,gBACCtmC,EAAMN,IACNsB,GACCuQ,EACD60B,EACA,SAASG,GACL,GAAIA,EAAK,CACL,GAAIC,GAAOD,EAAI1qC,IACX4qC,EAAOF,EAAIvoC,GACXooC,KACE70B,EAAM,EACJi1B,EAAKxlC,EAAI,EACTylC,EAAKD,GAELC,IACAD,EAAKC,GAGEzlC,EAAI,EAATylC,GACAA,IACAD,EAAKC,GAELA,EAAKD,EAIf,IAAI7G,GAAM3/B,EAAMsqB,QAAUtqB,EAAMqqB,UAAY,CACzCvlB,YAAW66B,EAAI,IAAMj7B,SAASi7B,EAAI,IAAIA,GACzC,IAAI+G,IAAYF,EAAOC,EAAO9G,GAAK,EAAI,EACnCgH,EAASD,EAAW/G,EAAM,CAE9B3/B,GAAM03B,YAAY6O,EAAI9kC,QAASilC,EAAUC,OAEzCC,OAAM,qBAIpB1oC,KAAK2zB,KAAK,IAAItgB,KAiCtB6H,EAAQvb,UAAUsd,mBAAqB,SAAS3c,GAC5C,GAAIqoC,GAAU,KAAMC,EAAO,IAS3B,OARI5oC,MAAKsrB,sBACLqd,EAAU,GAAKroC,EAAGghC,KACS,mBAAhBhhC,GAAGiL,UACVo9B,GAAWroC,EAAGiL,UAElBvL,KAAKurB,mBACLqd,EAAOtoC,EAAG84B,UAEC,MAAXuP,GAA2B,MAARC,EACZD,EAAU,IAAMC,EAEhBD,GAAWC,GAAQ,WAGlC1tB,EAAQvb,UAAUmyB,WAAa,SAASjhB,GACpCA,EAAOA,GAAQ,EACf,IAAIma,GAASwB,OAAOqc,iBAAmB,CACvC,OAAW,IAAPh4B,EACOsK,EAAY,MAAO,MAAOgK,IAAKnlB,KAAKmc,WAAW,kBAAoB6O,EAAS,GAAK,IAAM,QAASxN,MAAO,KAAMyX,OAAQ,OAErH9Z,EAAY,MAAO,MAAOgK,IAAKnlB,KAAKmc,WAAW,kBAAoB6O,EAAS,GAAK,IAAM,QAASxN,MAAO,KAAMyX,OAAQ,QAIpI/Z,EAAQvb,UAAUmpC,kBAAoB,WAClC,GAAIjY,GAAO7wB,IACX,KAAKA,KAAK+oC,kBAAmB,CACzB,GAAIhb,GAAS/tB,KAAKgpC,WACdjb,GACA/tB,KAAK+oC,kBAAoB,GAAIlxB,GAAQ,SAASiC,EAAS+U,GACnDd,EAAOkb,aACFC,QAAS,UACTC,IAAKtY,EAAKpF,eACX,SAAS5tB,EAAQ8b,GAETG,EADAjc,GACQ,GAEA,OAKzBmC,KAAK+oC,kBAAoB,GAAIlxB,GAAQ,SAASiC,EAAS+U,GAClDS,EACIuB,EAAKpF,cACL,SAAS5tB,EAAQ8b,GAETG,EADAjc,GACQ,GAEA,KAGfhC,QAAS,QAK1B,MAAOmE,MAAK+oC,mBAGhB7tB,EAAQvb,UAAUqpC,UAAY,WAC1B,MAAKhpC,MAAKirB,iBAAoBjrB,KAAKowB,cAA0C,GAA1BpwB,KAAKowB,aAAap2B,QAGjEgG,KAAK+yB,YAAc/yB,KAAKowB,aAAap2B,SACrCgG,KAAK+yB,WAAa,GACf/yB,KAAKowB,aAAapwB,KAAK+yB,eAJnB,MAOf7X,EAAQvb,UAAUypC,iBAAmB,SAASxvB,GAC1C,GAAInS,GAAK,SAAWzH,KAAKqrB,YAEzB,OADArrB,MAAKorB,UAAU3jB,GAAMmS,EACdnS,GA0EXqmB,EAAYnuB,UAAUspC,YAAc,SAAS9a,EAAK5yB,EAAU8tC,GACxD,GAAIhlC,GAAM,OAASrE,KAAKguB,OACxBG,GAAI9pB,IAAMA,EACVrE,KAAKiuB,UAAU5pB,GAAO9I,EACtByE,KAAK+tB,OAAOK,YAAYD,EAAKkb,IAGjCvb,EAAYnuB,UAAUixB,UAAY,WAC9B5wB,KAAK+tB,OAAO6C,aAGO,mBAAZ12B,GAAyB,CAChCA,EAAOJ,SACHohB,QAASA,GAIb1hB,EAAQ,gBACRA,EAAQ,iBACRA,EAAQ,mBACRA,EAAQ,kBACRA,EAAQ,WACRA,EAAQ,WAER,IAAI6L,GAAK7L,EAAQ,oBACb4pC,EAAuB/9B,EAAG+9B,qBAC1BE,EAAwBj+B,EAAGi+B,sBAC3BC,EAAoBl+B,EAAGk+B,kBAEvBnD,EAAa5mC,EAAQ,YAAY4mC,WAEjCe,EAAc3nC,EAAQ,SAAS2nC,YAOvCpW,EAAYprB,UAAU2pC,IAAM,SAAS9G,GACjC,GAAI+G,GAAMvpC,KAAKmvB,aAAaa,EAAcwS,GAC1C,IAAI+G,EACA,IAAK,GAAIxT,GAAK,EAAGA,EAAKwT,EAAIC,QAAQxvC,SAAU+7B,EACxC,GAAIhG,EAA2BwZ,EAAIC,QAAQzT,GAAKyM,GAC5C,MAAO+G,GAAIthB,QAAQ8N,IAMnChL,EAAYprB,UAAU8pC,IAAM,SAASjH,EAAM7K,GACvC,GAAIwR,GAAMnZ,EAAcwS,GACpB+G,EAAMvpC,KAAKmvB,aAAaga,EACvBI,KACDA,GAAOC,WAAavhB,YACpBjoB,KAAKmvB,aAAaga,GAAOI,GAE7BA,EAAIC,QAAQtsC,KAAKslC,GACjB+G,EAAIthB,QAAQ/qB,KAAKy6B,MLqnFlB+R,eAAe,EAAEC,aAAa,EAAE5/B,QAAQ,GAAG6/B,qBAAqB,GAAGC,UAAU,GAAGC,mBAAmB,GAAGC,kBAAkB,GAAGC,WAAW,GAAGC,mBAAmB,GAAGnjB,eAAe,GAAGojB,WAAW,GAAGvvB,SAAS,GAAG3Q,mBAAmB,GAAGmgC,kBAAkB,GAAGC,iBAAiB,GAAGC,SAAS,GAAGC,SAAS,GAAGC,iBAAiB,GAAGC,gBAAgB,GAAGvgC,UAAU,GAAGwgC,YAAY,GAAG7vB,cAAc,MAAM8vB,GAAG,SAASlxC,EAAQU,EAAOJ,GMzuKvZ,YAsBA,SAAS81B,GAAS4S,EAAMmI,EAAQC,EAASjK,GACjB,gBAAT6B,IACPxiC,KAAKmpC,IAAM3G,EACXxiC,KAAK2qC,OAASA,EACd3qC,KAAK4qC,QAAUA,EACf5qC,KAAK2gC,OAASA,IAEd3gC,KAAKmpC,IAAM3G,EAAK2G,IAChBnpC,KAAK2qC,OAASnI,EAAKmI,OACnB3qC,KAAK4qC,QAAUpI,EAAKoI,QACpB5qC,KAAK2gC,OAAS76B,EAAY08B,EAAK7B,QAC/B3gC,KAAKsE,KAAOk+B,EAAKl+B,KACjBtE,KAAKwZ,YAAcgpB,EAAKhpB,aAG5BxZ,KAAK6qC,eACL7qC,KAAK8qC,gBACL9qC,KAAK+qC,mBACL/qC,KAAKgrC,gBACLhrC,KAAKirC,YAAc,IAEF,UAAbjrC,KAAKsE,KACLtE,KAAKkrC,aAAe,GAAIC,GAAgBnrC,KAAKmpC,IAAKnpC,KAAKwZ,aACnC,SAAbxZ,KAAKsE,KACZtE,KAAKkrC,aAAe,GAAIE,GAAkB5I,GAE1CxiC,KAAKkrC,aAAe,GAAIG,GAAgBrrC,KAAKmpC,IAAKnpC,KAAK2qC,OAAQ3qC,KAAK4qC,SAqR5E,QAASS,GAAgBlC,EAAKwB,EAAQC,GAClC5qC,KAAK23B,OAAS,GAAI2T,GAAUnC,GAC5BnpC,KAAK2qC,OAASA,EACd3qC,KAAK4qC,QAASA,EAyElB,QAASO,GAAgBhC,EAAK3vB,GAC1B,GAAIqX,GAAO7wB,IACXA,MAAKmpC,IAAMA,EACXnpC,KAAKwZ,YAAcA,EAEnBxZ,KAAK0K,IAAM,GAAImN,GAAQ,SAASiC,EAAS+U,GACrC/jB,EAAQ,GAAImM,GAAa4Z,EAAKsY,KAAM3vB,YAAaqX,EAAKrX,YAClBI,SAAUiX,EAAKjX,WACjD,SAASlP,EAAKiP,GACRjP,EACAoP,EAAQpP,GAERmkB,EAAOlV,OAKnB3Z,KAAK0K,IAAIoO,KAAK,SAASpO,EAAKiP,GACpBA,GACAnK,QAAQC,IAAIkK,KAIxB,QAAS4xB,GAAGjkC,GACR,MAAOd,UAASc,GAGpB,QAASkkC,GAASnrC,GACd,MAAwB,IAApBA,EAAErD,QAAQ,OACHqD,EAAEmO,OAAO,GAETnO,EAGf,QAASorC,GAAkBnvB,GAevB,IAAK,GAdDovB,IACAC,OAAYH,EAASlvB,EAAQsvB,UAC7BC,OAAYrlC,SAAS8V,EAAQwvB,UAC7BC,OAAYvlC,SAAS8V,EAAQ0vB,QAC7BC,OAAY3vB,EAAQ2vB,OACpBC,QAAYV,EAASlvB,EAAQ/Y,SAC7B4oC,QAAY7vB,EAAQ3e,IAAM,EAC1ByuC,QAAY9vB,EAAQxc,IACpBusC,QAAY/vB,EAAQgwB,IACpBC,WAEAC,EAAYlwB,EAAQkwB,UAAUlmC,MAAM,KAAKe,IAAIkkC,GAC7CkB,EAAanwB,EAAQmwB,WAAWnmC,MAAM,KAAKe,IAAIkkC,GAC/CmB,EAAepwB,EAAQqwB,UAAUrmC,MAAM,KAAKe,IAAIkkC,GAC3CtwC,EAAK,EAAGA,EAAKuxC,EAAUxyC,SAAUiB,EACtCywC,EAAMa,OAAOrvC,MAAMsvC,EAAUvxC,GAAKwxC,EAAWxxC,GAAKyxC,EAAazxC,IAGnE,OAAOywC,GAgBX,QAASN,GAAkB5I,GACvBxiC,KAAKwiC,KAAOA,EACZxiC,KAAK4sC,iBAEL,KAAK,GADDvnC,GAAKm9B,EAAKqK,oBACLC,EAAK,EAAGA,EAAKznC,EAAGrL,SAAU8yC,EAAI,CACnC,GAAIC,GAAK1nC,EAAGynC,EACZ,MAAIC,EAAG/yC,OAAS,GAAhB,CAIA,IAAK,GADD2X,MACKlY,EAAI,EAAGA,EAAIszC,EAAG/yC,OAAS,IAAKP,EACjCkY,EAAGzU,KAAK6vC,EAAGtzC,GACfuG,MAAK4sC,eAAeG,EAAGA,EAAG/yC,OAAS,IAAM2X,IAhejD,GAAwB,mBAAbnY,GACP,GAAIgM,GAAMhM,EAAQ,SACd8xC,EAAY9lC,EAAI8lC,UAChB0B,EAAaxnC,EAAIwnC,WAEjBnnC,EAAQrM,EAAQ,WAChBklC,EAAQ74B,EAAM64B,MACd54B,EAAcD,EAAMC,YAEpBmnC,EAAazzC,EAAQ,WAAWyzC,WAEhC9uC,EAAM3E,EAAQ,SACdyd,EAAe9Y,EAAI8Y,aAEnBlK,EAAMvT,EAAQ,YACdsR,EAAUiC,EAAIjC,QAEd+M,EAAUre,EAAQ,eAAeqe,OAiCzC+X,GAASjwB,UAAUutC,aAAe,WAC9B,OACI/D,IAAKnpC,KAAKmpC,IACVwB,OAAQ3qC,KAAK2qC,OACbC,QAAS5qC,KAAK4qC,QACdjK,OAAQ3gC,KAAK2gC,OACbr8B,KAAMtE,KAAKsE,KACXkV,YAAaxZ,KAAKwZ,cAI1BoW,EAASjwB,UAAUwtC,SAAW,SAAS3rC,EAAKsB,GAExC,IAAK,GADD+lB,GAAS7oB,KAAK6qC,YAAYrpC,OACrB4rC,EAAK,EAAGA,EAAKvkB,EAAO7uB,SAAUozC,EAAI,CACvC,GAAI/sC,GAAIwoB,EAAOukB,EACf,IAAItqC,GAAOzC,EAAEwrC,QAAU/oC,GAAOzC,EAAE0rC,OAAQ,CACpC,GAAIsB,EAEAA,GADY,KAAZhtC,EAAE4rC,OACK5rC,EAAE0rC,OAASjpC,EAEXA,EAAMzC,EAAEwrC,MAGnB,KAAK,GADDU,GAASlsC,EAAEksC,OACNtxC,EAAK,EAAGA,EAAKsxC,EAAOvyC,SAAUiB,EAAI,CACvC,GAAIP,GAAI6xC,EAAOtxC,GACXqyC,EAAO5yC,EAAE,GACT6yC,EAAQ7yC,EAAE,GACV8yC,EAAQ9yC,EAAE,EACd,IAAI2yC,GAAQC,GAAiBA,EAAOE,GAAhBH,EAAwB,CACxC,GAEII,GAFAC,EAAOL,EAAOC,CAQlB,OAJIG,GADa,KAAbptC,EAAEgsC,QACKhsC,EAAE+rC,QAAUmB,EAAQG,EAEpBA,EAAOH,EAAQltC,EAAE8rC,SAEpBpoC,IAAK1D,EAAE6rC,QAASppC,IAAK2qC,EAAME,QAAUttC,EAAE4rC,QAAU5rC,EAAEgsC,YAK3E,MAAO,OAGXzc,EAASjwB,UAAUiuC,WAAa,SAASpsC,EAAK7D,EAAKmC,GAG/C,IAAK,GAFD+oB,GAAS7oB,KAAK6qC,YAAYrpC,OAC1BqsC,KACKT,EAAK,EAAGA,EAAKvkB,EAAO7uB,SAAUozC,EAAI,CACvC,GAAI/sC,GAAIwoB,EAAOukB,EACf,IAAIttC,GAAOO,EAAEwrC,QAAUluC,GAAO0C,EAAE0rC,OAAQ,CACpC,GAAI+B,GAAMC,CACM,MAAZ1tC,EAAE4rC,QACF6B,EAAOztC,EAAE0rC,OAASjsC,EAClBiuC,EAAO1tC,EAAE0rC,OAASpuC,IAElBmwC,EAAOnwC,EAAM0C,EAAEwrC,OACfkC,EAAOjuC,EAAMO,EAAEwrC,OAGnB,KAAK,GADDU,GAASlsC,EAAEksC,OACNtxC,EAAK,EAAGA,EAAKsxC,EAAOvyC,SAAUiB,EAAI,CACvC,GAAIP,GAAI6xC,EAAOtxC,GACXqyC,EAAO5yC,EAAE,GACT6yC,EAAQ7yC,EAAE,GACV8yC,EAAQ9yC,EAAE,EACd,IAAIqzC,GAAQT,GAAiBA,EAAOE,GAAhBM,EAAwB,CACxC,GAAIhlC,IACAvF,QAASlD,EAAE6rC,QACXyB,QAAsB,KAAZttC,EAAE4rC,OAA+B,KAAb5rC,EAAEgsC,QAEnB,MAAbhsC,EAAEgsC,SACEyB,GAAQR,EACRxkC,EAAEhJ,IAAMO,EAAE+rC,QAAUmB,EAAQO,EAAOR,GAEnCxkC,EAAEhJ,IAAMO,EAAE+rC,QAAUmB,EACpBzkC,EAAEklC,WAAaV,EAAOQ,GAEbR,EAAOE,GAAhBO,EACAjlC,EAAEnL,IAAM0C,EAAE+rC,QAAUmB,EAAQQ,EAAOT,GAEnCxkC,EAAEnL,IAAM0C,EAAE+rC,QAAUmB,EAAQC,EAC5B1kC,EAAEmlC,WAAaF,EAAOT,EAAOE,KAG7BM,GAAQR,EACRxkC,EAAEnL,IAAM0C,EAAE8rC,QAAUoB,EAAQO,EAAOR,GAEnCxkC,EAAEnL,IAAM0C,EAAE8rC,QAAUoB,EACpBzkC,EAAEmlC,WAAaX,EAAOQ,GAEbR,EAAOE,GAAhBO,EACAjlC,EAAEhJ,IAAMO,EAAE8rC,QAAUoB,EAAQQ,EAAOT,GAEnCxkC,EAAEhJ,IAAMO,EAAE8rC,QAAUoB,EAAQC,EAC5B1kC,EAAEklC,WAAaD,EAAOT,EAAOE,IAGrCK,EAAS3wC,KAAK4L,MAK9B,MAAO+kC,IAGXje,EAASjwB,UAAUuuC,WAAa,SAAS1sC,EAAKsB,GAE1C,IAAK,GADD+lB,GAAS7oB,KAAK8qC,aAAatpC,OACtB4rC,EAAK,EAAGA,EAAKvkB,EAAO7uB,SAAUozC,EAAI,CACvC,GAAI/sC,GAAIwoB,EAAOukB,EACf,IAAItqC,GAAOzC,EAAE8rC,SAAWrpC,GAAOzC,EAAE+rC,QAAS,CACtC,GAAIiB,EAEAA,GADY,KAAZhtC,EAAE4rC,OACK5rC,EAAE+rC,QAAUtpC,EAEZA,EAAMzC,EAAE8rC,OAInB,KAAK,GADDI,GAASlsC,EAAEksC,OACNtxC,EAAK,EAAGA,EAAKsxC,EAAOvyC,SAAUiB,EAAI,CACvC,GAAIP,GAAI6xC,EAAOtxC,GACXqyC,EAAO5yC,EAAE,GACT6yC,EAAQ7yC,EAAE,GACV8yC,EAAQ9yC,EAAE,EAEd,IAAI2yC,GAAQE,GAAkBA,EAAQC,GAAjBH,EAAyB,CAC1C,GAGII,GAHAC,EAAOL,EAAOE,EAEdE,EAAOC,EAAOJ,EAAOjtC,EAAEwrC,MAO3B,OAJI4B,GADa,KAAbptC,EAAEgsC,QACKhsC,EAAE0rC,OAASuB,EAAOI,EAElBA,EAAOJ,EAAOjtC,EAAEwrC,QAEnB9nC,IAAK1D,EAAEsrC,OAAQ7oC,IAAK2qC,EAAME,QAAUttC,EAAE4rC,QAAU5rC,EAAEgsC,YAM1E,MAAO,OAGXzc,EAASjwB,UAAUwuC,qBAAuB,SAAS3sC,EAAK7D,EAAKmC,EAAKvE,GAU9D,IAAK,GATD6yC,GAAgB,EAChBC,EAAgB,EAEhBC,EAAStuC,KACTuuC,EAAW5wC,EAAIqC,KAAKirC,YAAa,EACjCuD,EAAW1uC,EAAIE,KAAKirC,YAAa,EAEjCwD,GAAoB,EACpBC,GAAgB,EACXz1C,EAAIs1C,EAAcC,GAALv1C,IAAgBA,EAAG,CACrC,GAAI01C,GAAKntC,EAAM,IAAMvI,CACjB+G,MAAKgrC,aAAa2D,IAAON,IACzBI,GAAoB,EAChBzuC,KAAKgrC,aAAa2D,IAAOP,IACzBpuC,KAAKgrC,aAAa2D,GAAMP,EACxBM,GAAgB,IAK5B,GAAID,EACKzuC,KAAK+qC,gBAAgBvpC,IACtBxB,KAAKkrC,aAAa0D,YACdptC,EACA+sC,EAAUvuC,KAAKirC,aACduD,EAAQ,GAAKxuC,KAAKirC,YAAc,GAClCnyB,KAAK,SAAS+P,GACRylB,EAAOxD,eACRwD,EAAOxD,aAAatpC,MACxB,KAAK,GAAI4rC,GAAK,EAAGA,EAAKvkB,EAAO7uB,SAAUozC,EAAI,CACvC,GAAI1B,GAAQ7iB,EAAOukB,GAGXyB,EAAMP,EAAOzD,YAAYa,EAAMC,OACnC,IAAKkD,EAEE,CAEH,IAAK,GADDC,IAAU,EACLC,EAAM,EAAGA,EAAMF,EAAI70C,SAAU+0C,EAAK,CACvC,GAAIC,GAAKH,EAAIE,EACb,IAAIC,EAAGnD,QAAUH,EAAMG,QAAUmD,EAAGjD,QAAUL,EAAMK,OAAQ,CACxD+C,GAAU,CACV,QAGHA,GACDD,EAAI3xC,KAAKwuC,OAXb4C,GAAOzD,YAAYa,EAAMC,SAAWD,EAgBxC,IAAIuD,GAAMX,EAAOxD,aAAaY,EAAMQ,QACpC,IAAK+C,EAEE,CAEH,IAAK,GADDH,IAAU,EACLC,EAAM,EAAGA,EAAME,EAAIj1C,SAAU+0C,EAAK,CACvC,GAAIC,GAAKC,EAAIF,EACb,IAAIC,EAAG7C,SAAWT,EAAMS,SAAW6C,EAAG5C,SAAWV,EAAMU,QAAS,CAC5D0C,GAAU,CACV,QAGHA,GACDG,EAAI/xC,KAAKwuC,OAXb4C,GAAOxD,aAAaY,EAAMQ,UAAYR,GAelD,IAAK,GAAIzyC,GAAIs1C,EAAcC,GAALv1C,IAAgBA,EAAG,CACrC,GAAI01C,GAAKntC,EAAM,IAAMvI,CACrBq1C,GAAOtD,aAAa2D,GAAMN,EAE9B,GAAIC,EAAOvD,gBAAgBvpC,GAAM,CAE7B,IAAK,GADD0tC,GAAMZ,EAAOvD,gBAAgBvpC,GACxB/H,EAAI,EAAGA,EAAIy1C,EAAIl1C,SAAUP,EAC9By1C,EAAIz1C,IAER60C,GAAOvD,gBAAgBvpC,GAAO,QAvDtCxB,SAyDW,SAAU2Z,GACjBnK,QAAQC,IAAIkK,KAIpB+kB,EAAM1+B,KAAK+qC,gBAAiBvpC,EAAK,WAI7B8sC,EAAOH,qBAAqB3sC,EAAK7D,EAAKmC,EAAKvE,SAE5C,CAGH,IAAK,GAFD4zC,MACAtmB,EAAS7oB,KAAK8qC,aAAatpC,OACtB4rC,EAAK,EAAGA,EAAKvkB,EAAO7uB,SAAUozC,EAAI,CACvC,GAAI/sC,GAAIwoB,EAAOukB,EACf,IAAIzvC,GAAO0C,EAAE+rC,SAAWtsC,GAAOO,EAAE8rC,QAAS,CACtC,GAAI2B,GAAMC,CACM,MAAZ1tC,EAAE4rC,QACF6B,EAAOztC,EAAE+rC,QAAUtsC,EACnBiuC,EAAO1tC,EAAE+rC,QAAUzuC,IAEnBmwC,EAAOnwC,EAAM0C,EAAE8rC,QACf4B,EAAOjuC,EAAMO,EAAE8rC,QAInB,KAAK,GADDI,GAASlsC,EAAEksC,OACNtxC,EAAK,EAAGA,EAAKsxC,EAAOvyC,SAAUiB,EAAI,CACvC,GAAIP,GAAI6xC,EAAOtxC,GACXqyC,EAAO5yC,EAAE,GACT6yC,EAAQ7yC,EAAE,GACV8yC,EAAQ9yC,EAAE,EAEd,IAAIqzC,GAAQR,GAAkBA,EAAQC,GAAjBM,EAAyB,CAC1C,GAAIsB,GAAO1xC,KAAKoC,IAAIguC,EAAMP,GAASA,EAC/B8B,EAAO3xC,KAAKC,IAAIowC,EAAMR,EAAQC,GAASD,CAE1B,MAAbltC,EAAEgsC,QACF8C,EAAUjyC,KAAK,GAAI8vC,GAAW3sC,EAAEsrC,OAAQtrC,EAAE0rC,OAASuB,EAAO+B,EAAMhvC,EAAE0rC,OAASuB,EAAO8B,IAElFD,EAAUjyC,KAAK,GAAI8vC,GAAW3sC,EAAEsrC,OAAQtrC,EAAEwrC,OAASuD,EAAO9B,EAAMjtC,EAAEwrC,OAASwD,EAAO/B,OAMtG/xC,EAAS4zC,KAUjB9D,EAAgB1rC,UAAUivC,YAAc,SAASptC,EAAK8tC,EAAMC,GACxD,GAAIjB,GAAStuC,IAEb,OAAO,IAAI6X,GAAQ,SAASiC,EAAS+U,GACjCyf,EAAO3W,OAAO6X,WAAWhuC,KAAS,SAASiuC,GAGvC,IAAK,GAFD5mB,MAEKikB,EAAK,EAAGA,EAAK2C,EAAOz1C,SAAU8yC,EAEnC,IAAK,GADD4C,GAAMD,EAAO3C,GACR7xC,EAAK,EAAGA,EAAKy0C,EAAInD,OAAOvyC,SAAUiB,EAAI,CAG3C,IAAK,GADD00C,GAAQC,EADR10C,EAAQw0C,EAAInD,OAAOtxC,GAEd86B,EAAK,EAAGA,EAAK76B,EAAM20C,SAAS71C,SAAU+7B,EAAI,CAC/C,GAAIsK,GAAMnlC,EAAM20C,SAAS9Z,GACrBte,EAAMi4B,EAAII,QAAQzP,EAAI0P,OACtBt4B,GAAIu4B,WAAa1B,EAAO3D,OACxBgF,EAAStP,EACF5oB,EAAIu4B,WAAa1B,EAAO1D,UAC/BgF,EAAUvP,GAGlB,GAAIsP,GAAUC,EAAS,CAiBnB,IAhBA,GAAIlE,IACAC,OAAY+D,EAAII,QAAQH,EAAOI,QAAQE,UACvCpE,OAAuB,EAAX8D,EAAOhyC,IACnBouC,OAAuB,EAAX4D,EAAO7vC,IACnBmsC,OAAY0D,EAAOO,OACnBhE,QAAYwD,EAAII,QAAQF,EAAQG,QAAQE,UACxC9D,QAAwB,EAAZyD,EAAQjyC,IACpByuC,QAAwB,EAAZwD,EAAQ9vC,IACpBusC,QAAYuD,EAAQM,OACpB3D,WAGA4D,EAASlD,EAAW0C,EAAO9rC,OAAQusC,EAAUnD,EAAW2C,EAAQ/rC,OAEhEwsC,EAAY,EAAGC,EAAa,EAC5BC,EAAO,EAAGC,EAAQ,EACfD,EAAOJ,EAAOn2C,QAAUw2C,EAAQJ,EAAQp2C,QAC3C,GAAuB,KAAnBm2C,EAAOI,GAAME,IAAkC,KAArBL,EAAQI,GAAOC,GAAW,CACpD,GAAIC,GAAWhzC,KAAKC,IAAIwyC,EAAOI,GAAMriC,IAAKkiC,EAAQI,GAAOtiC,IACzDw9B,GAAMa,OAAOrvC,MAAMmzC,EAAWC,EAAYI,IACtCP,EAAOI,GAAMriC,KAAOwiC,IAClBH,EAEFJ,EAAOI,GAAMriC,KAAOwiC,EAEpBN,EAAQI,GAAOtiC,KAAOwiC,IACpBF,EAEFJ,EAAQI,IAAUE,EAEtBL,GAAaK,EACbJ,GAAcI,MACY,KAAnBP,EAAOI,GAAME,GACpBH,GAAcH,EAAOI,KAAQriC,IACD,KAArBkiC,EAAQI,GAAOC,KACtBJ,GAAaD,EAAQI,KAAStiC,IAItC2a,GAAO3rB,KAAKwuC,IAIxB5xB,EAAQ+O,QA6DpBsiB,EAAgBxrC,UAAUivC,YAAc,SAASptC,EAAK7D,EAAKmC,GACvD,MAAOE,MAAK0K,IAAIoO,KAAK,SAASpO,EAAKiP,GAC/B,IAAKjP,EACD,KAAM/Q,OAAM,SAEhB,OAAO,IAAIke,GAAQ,SAASiC,EAAS+U,GACjCnkB,EAAIsJ,kBAAkBvF,YAAYjN,EAAK7D,EAAKmC,EAAK,SAAS6U,GACtDmF,EAAQnF,EAAMtN,IAAIokC,WAsBlCL,EAAkBzrC,UAAUivC,YAAc,SAASptC,EAAK7D,EAAKmC,GAGzD,IAAK,GAFD6wC,MACAh/B,EAAK3R,KAAK4sC,eAAeprC,OACpB/H,EAAI,EAAGA,EAAIkY,EAAG3X,SAAUP,EAC7Bk3C,EAAKzzC,MAEGyuC,OAAgBh6B,EAAGlY,GACnBoyC,OAAgB,EAChBE,OAAgB,IAChBE,OAAgB,IAChBC,QAAgB1qC,EAChB2qC,QAAgB,EAChBC,QAAgB,IAChBC,QAAgB,IAChBE,SAAU,EAAG,EAAG,OAI5B,OAAO10B,GAAQiC,QAAQ62B,IAGJ,mBAAZz2C,KACPA,EAAOJ,SACH81B,SAAUA,MN2uKfghB,WAAW,EAAEhsC,QAAQ,EAAEisC,UAAU,EAAE9mC,QAAQ,GAAGE,UAAU,GAAG2Q,cAAc,MAAMk2B,GAAG,SAASt3C,EAAQU,EAAOJ,GAC7G,YOxuLA,SAASmzC,GAAWppC,GAIhB,IAFA,GACIktC,GADAC,KAEyC,OAArCD,EAAQE,EAAaloC,KAAKlF,KAAiB,CAC/C,GAAIqtC,GAAQH,EAAM,EACE,IAAhBG,EAAMl3C,SACNk3C,EAAQ,GAEZF,EAAO9zC,MAAMgR,IAAW,EAANgjC,EAAST,GAAIM,EAAM,KAEzC,MAAOC,GAbX,GAAIC,GAAe,GAAIjzC,QAAO,mBAAoB,IAgB3B,oBAAZ9D,KACPA,EAAOJ,SACHmzC,WAAYA,SPsvLdkE,GAAG,SAAS33C,EAAQU,EAAOJ,GQvwLjC,YAEA,SAASs3C,GAAQC,EAAKC,EAAOC,EAAMz0C,GAC/BkD,KAAKqxC,IAAU,EAAJA,EACXrxC,KAAKsxC,MAAc,EAANA,EACbtxC,KAAKuxC,KAAY,EAALA,EACRz0C,IACAkD,KAAKlD,KAAOA,GAYpB,QAAS00C,GAAKlqC,GACV,GAAImqC,GAAI,KAAOnqC,EAAEjL,SAAS,GAC1B,OAAOo1C,GAAEx0C,UAAUw0C,EAAEz3C,OAAS,GAwBlC,QAAS03C,GAAiB50C,GACtB,GAAIuD,GAAIsxC,EAAQ70C,EAChB,KAAKuD,EAAG,CACJ,GAAI0wC,GAAQa,EAAS7oC,KAAKjM,EACtBi0C,IACA1wC,EAAI,GAAI+wC,GAAS,KAAOL,EAAM,GAAI,EAAI,KAAOA,EAAM,GAAI,EAAI,KAAOA,EAAM,GAAI,EAAGj0C,GAC/E60C,EAAQ70C,GAAQuD,IAEnB0wC,EAAQc,EAAa9oC,KAAKjM,GACtBi0C,GACH1wC,EAAI,GAAI+wC,GAAiB,EAATL,EAAM,GAAe,EAATA,EAAM,GAAe,EAATA,EAAM,GAAMj0C,GACpD60C,EAAQ70C,GAAQuD,IAElBmP,QAAQC,IAAI,0BAA4B3S,GACxCuD,EAAIsxC,EAAQG,MACZH,EAAQ70C,GAAQuD,IAIpB,MAAOA,GAGX,QAAS0xC,GAAgBC,EAAOC,EAAOC,GAEnC,IAAK,GADDC,MACK/E,EAAK,EAAGA,EAAK8E,EAAQl4C,SAAUozC,EACpC+E,EAASj1C,KAAKw0C,EAAiBQ,EAAQ9E,IAG3C,IAAIgF,KACNC,GACE,IAAK,GAAItc,GAAK,EAAQic,EAALjc,IAAcA,EAAI,CAG/B,IAAK,GAFDuc,GAAM,EAAMvc,GAAOic,EAAM,GACzBrrC,EAAQsrC,EAAM,IAAMA,EAAMA,EAAMj4C,OAAQ,GAAKi4C,EAAM,IAAMK,EACpD74C,EAAI,EAAGA,EAAIw4C,EAAMj4C,OAAS,IAAKP,EACpC,GAAIkN,GAASsrC,EAAMx4C,IAAMkN,GAASsrC,EAAMx4C,EAAE,GAAI,CAC1C,GAAIumB,IAAQrZ,EAAQsrC,EAAMx4C,KAAOw4C,EAAMx4C,EAAE,GAAKw4C,EAAMx4C,IAChD84C,EAAKJ,EAAS14C,GACd40B,EAAK8jB,EAAS14C,EAAE,GAEhB+4C,EAAO,GAAIpB,GACTmB,EAAGlB,KAAO,EAAMrxB,GAAUqO,EAAGgjB,IAAMrxB,EAAO,EAC1CuyB,EAAGjB,OAAS,EAAMtxB,GAAUqO,EAAGijB,MAAQtxB,EAAO,EAC9CuyB,EAAGhB,MAAQ,EAAMvxB,GAAUqO,EAAGkjB,KAAOvxB,EAAO,GAChDyyB,aACFL,GAAKl1C,KAAKs1C,EAEV,SAASH,GAGjB,KAAM,WAGV,MAAOD,GAGX,QAASM,GAAaV,EAAOW,EAAQC,EAAQC,GACzC,MAAIA,GACOd,EAAgBC,GAAQ,EAAG,GAAK,IAAKW,EAAQC,EAAQC,IAErDd,EAAgBC,GAAQ,EAAG,IAAKW,EAAQC,IA7FvDxB,EAAQzxC,UAAU8yC,YAAc,WAK5B,MAJKzyC,MAAKlD,OACNkD,KAAKlD,KAAO,OAASkD,KAAKqxC,IAAM,IAAMrxC,KAAKsxC,MAAQ,IAAMtxC,KAAKuxC,KAAO,KAGlEvxC,KAAKlD,MAQhBs0C,EAAQzxC,UAAUmzC,YAAc,WAC5B,MAAO,IAAMtB,EAAKxxC,KAAKqxC,KAAOG,EAAKxxC,KAAKsxC,OAASE,EAAKxxC,KAAKuxC,MAG/D,IAAII,IACAN,IAAK,GAAID,GAAQ,IAAK,EAAG,EAAG,OAC5BE,MAAO,GAAIF,GAAQ,EAAG,IAAK,EAAG,SAC9BG,KAAM,GAAIH,GAAQ,EAAG,EAAG,IAAK,QAC7B2B,OAAQ,GAAI3B,GAAQ,IAAK,IAAK,EAAG,UACjC4B,MAAO,GAAI5B,GAAQ,IAAK,IAAK,IAAK,SAClCU,MAAO,GAAIV,GAAQ,EAAG,EAAG,EAAG,SAC5B6B,KAAM,GAAI7B,GAAQ,IAAK,IAAK,IAAK,QACjC8B,KAAM,GAAI9B,GAAQ,IAAK,IAAK,IAAK,QACjC+B,aAAc,GAAI/B,GAAQ,IAAK,IAAK,IAAK,gBACzCgC,YAAa,GAAIhC,GAAQ,IAAK,IAAK,IAAK,eACxCiC,QAAS,GAAIjC,GAAQ,IAAK,IAAK,IAAK,YAGpCQ,EAAW,GAAI5zC,QAAO,uDACtB6zC,EAAe,mCAiEI,oBAAZ33C,KACPA,EAAOJ,SACHi4C,gBAAiBA,EACjBW,aAAcA,EACdhB,iBAAkBA,SRgxLpB4B,IAAI,SAAS95C,EAAQU,EAAOJ,GSh4LlC,YAgBA,SAASkzC,GAAWlwC,EAAMyJ,EAAOE,EAAK8sC,GAClCvzC,KAAKlD,KAAOA,EACZkD,KAAKuG,MAAQA,EACbvG,KAAKyG,IAAMA,EACXzG,KAAKuzC,YAAcA,EAiBvB,QAASjI,GAAUkI,EAAIC,GACnB,GAAIC,EACa,iBAANF,IACPxzC,KAAKmpC,IAAMqK,EACXE,EAAUD,OAEVC,EAAUF,KAEd,KAAK,GAAIpiC,KAAKsiC,GACV1zC,KAAKoR,GAAKsiC,EAAQtiC,EAGjBpR,MAAK2gC,SACN3gC,KAAK2gC,WAEJ3gC,KAAK2zC,QACN3zC,KAAK2zC,UAGT3zC,KAAK4zC,WAAa5zC,KAAKmpC,IACnBnpC,KAAK4zC,YAA6D,KAA/C5zC,KAAK4zC,WAAWplC,OAAOxO,KAAKmpC,IAAInvC,OAAS,KAC5DgG,KAAK4zC,WAAa5zC,KAAK4zC,WAAa,KAkB5C,QAASC,MAGT,QAASC,GAAY5yC,EAAI+T,GACrB,MAAO/T,GAAGmgC,OAASpsB,EAAGosB,OAASngC,EAAGogC,MAAQrsB,EAAGqsB,MAAQpgC,EAAGqK,SAAW0J,EAAG1J,QAkD1E,QAASwoC,GAAYj3C,EAAMyJ,EAAOE,EAAKutC,EAAOjwC,GAC1C/D,KAAKlD,KAAOA,EACZkD,KAAKuG,MAAQA,EACbvG,KAAKyG,IAAMA,EACXzG,KAAKi0C,SAAWD,EAChBh0C,KAAK+D,IAAMA,EA+Cf,QAAS6B,MAGT,QAASD,GAAS8B,GACVA,IACAzH,KAAKyH,GAAKA,GAGlB,QAASysC,GAAQC,EAAMhL,GACnBnpC,KAAKm0C,KAAOA,EACZn0C,KAAKmpC,IAAMA,EAsNf,QAASiL,GAAa9vC,GAClBtE,KAAKsE,KAAOA,EACZtE,KAAK8vC,WACL9vC,KAAKusC,UA0DT,QAAS9mC,KACLzF,KAAKq0C,UAeT,QAAS3uC,MAGT,QAAS4uC,GAAclC,GACnB,GAAIJ,GAAQI,EAAKmC,aAAa,QAE1BvC,GADAA,EACc,EAANA,EAEA,EAMZ,KAAK,GAHDC,MACAuC,KACAC,EAAKrC,EAAKsC,qBAAqB,QAC1B3e,EAAK,EAAGA,EAAK0e,EAAGz6C,SAAU+7B,EAAI,CACnC,GAAI4e,GAAOF,EAAG1e,EACdkc,GAAM/0C,KAAK,EAAMy3C,EAAKJ,aAAa,UACnCC,EAAOt3C,KAAKy3C,EAAK11B,WAAW21B,WAGhC,MAAO7C,GAAgBC,EAAOC,EAAOuC,GA+DzC,QAASrT,GAAYgI,EAAK1nC,GAEtBA,EAAOA,MACPzB,KAAKmpC,IAAMA,EACXnpC,KAAKyB,KAAOA,EA6FhB,QAASozC,GAAa7V,EAAS36B,GAE3B,GAAIywC,GAAW9V,EAAQ0V,qBAAqBrwC,EAC5C,IAAIywC,EAAS96C,OAAS,GAAK86C,EAAS,GAAG71B,WAAY,CAC/C,GAAI5e,GAAIy0C,EAAS,EACjB,IAA2B,GAAvBz0C,EAAE00C,WAAW/6C,OACb,MAAOqG,GAAE4e,WAAW21B,SAGpB,KAAK,GADDx7C,GAAI,GACC47C,EAAK,EAAGA,EAAK30C,EAAE00C,WAAW/6C,SAAUg7C,EACzC57C,GAAKiH,EAAE00C,WAAWC,GAAIJ,SAE1B,OAAOx7C,GAIX,MAAO,MAIf,QAAS67C,GAAejW,GAEpB,GAAIA,EAAQkW,gBAAiB,CACzB,GAAIC,GAAQnW,EAAQ/f,UACpB,GAAG,CACC,GAAIk2B,EAAMlnC,UAAYmnC,KAAKC,aACvB,MAAOF,EAEXA,GAAQA,EAAMG,kBACA,MAATH,GAEb,MAAO,MAIX,QAASI,GAAWvW,GAIhB,IAAK,GAFDwW,GAAQ,GAAIC,OACZC,EAAmB1W,EAAQ0V,qBAAqB,QAC3CtH,EAAK,EAAGA,EAAKsI,EAAiB17C,SAAUozC,EAAI,CACjD,GAAIuI,GAAUD,EAAiBtI,EAC3BuI,GAAQ1W,YAAcD,GACtBwW,EAAMt4C,KAAK,GAAIg3C,GAAQyB,EAAQ12B,WAAa02B,EAAQ12B,WAAW21B,UAAY,UAAWe,EAAQpB,aAAa,UAInH,MAAOiB,GAGX,QAASI,GAAW5W,GAIhB,IAAK,GAFDt3B,MACAmuC,EAAa7W,EAAQ0V,qBAAqB,QACrCM,EAAK,EAAGA,EAAKa,EAAW77C,SAAUg7C,EACnCa,EAAWb,GAAI/1B,YACfvX,EAAMxK,KAAK24C,EAAWb,GAAI/1B,WAAW21B,UAG7C,OAAOltC,GAGX,QAASouC,GAAqBh4C,EAAK0nC,EAAShsB,EAAau8B,GAGrD,GAAIvpB,OAAOwpB,eAAgB,CACvB,GAAIj9B,GAAM,GAAIi9B,eACdj9B,GAAIk9B,OAAS,WACT,GAAIC,GAAM,GAAIC,eAAc,mBAC5BD,GAAIE,OAAQ,EACZF,EAAIG,QAAQt9B,EAAIQ,cAChBisB,EAAQ0Q,IAEZn9B,EAAIG,KAAK,MAAOpb,GAChBib,EAAIW,WAEJ,KACI,GAAIX,GAAM,GAAIC,gBACVnd,EAAUoe,WACV,WACIzK,QAAQC,IAAI,cAAiB3R,GAC7Bib,EAAImB,QACJsrB,EAAQ,KAAMzsB,IAElB,IAGJA,GAAIu9B,UAAY,WACZ9mC,QAAQC,IAAI,cAAgB3R,IAGhCib,EAAIK,mBAAqB,WACC,GAAlBL,EAAIM,aACJgB,aAAaxe;CACTkd,EAAIO,QAAU,KAAqB,GAAdP,EAAIO,SACzBksB,EAAQzsB,EAAIw9B,YAAax9B,KAIrCA,EAAIG,KAAK,MAAOpb,GAAK,GAGrBib,EAAIld,QAAU,IACV2d,IACAT,EAAIU,iBAAkB,GAEtBs8B,GACAh9B,EAAII,iBAAiB,sBAAuB48B,GAEhDh9B,EAAIoB,iBAAiB,YACrBpB,EAAII,iBAAiB,SAAU,uBAC/BJ,EAAIW,OACN,MAAO1gB,GACLwsC,EAAQ,KAAMzsB,EAAK/f,IAsB/B,QAASw9C,GAAiBp9C,GAEtB,MADAA,IAAK,GAAKA,GAAGq9C,cACF,QAAJr9C,GAAiB,SAAJA,EAGxB,QAASs9C,GAAqBt9C,GAC1B,MAAKA,IAGLA,GAAK,GAAKA,GAAGq9C,cACF,OAAJr9C,GAAgB,UAAJA,IAHR,EAMf,QAASu9C,GAAeje,GACpB,GAAIke,GAAM9wC,EAAY4yB,EACtBke,GAAIvC,SACJ,KAAK,GAAIte,GAAK,EAAGA,EAAK2C,EAAG2b,OAAOr6C,SAAU+7B,EAAI,CAC1C,GAAI8gB,GAAKD,EAAIvC,OAAOte,GAAMjwB,EAAY4yB,EAAG2b,OAAOte,GAChD8gB,GAAGC,UAAYD,EAAGE,SAAWF,EAAGG,QAAU70C,OAC1C00C,EAAGz1B,MAAQtb,EAAY+wC,EAAGz1B,OAC1By1B,EAAGz1B,MAAM3Z,GAAKtF,OACd00C,EAAGz1B,MAAM61B,UAAY90C,OAEzB,MAAOy0C,GAlzBX,GAAwB,mBAAbp9C,GACP,GAAIqM,GAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,YACpB44B,EAAQ74B,EAAM64B,MAEd53B,EAAQtN,EAAQ,WAChBu4C,EAAkBjrC,EAAMirC,eAMP,IAAI0D,MAQ7BzI,GAAWrtC,UAAUtD,SAAW,WAC5B,MAAO2D,MAAKlD,KAAO,IAAMkD,KAAKuG,MAAQ,KAAOvG,KAAKyG,KAEtDumC,EAAWrtC,UAAUu3C,UAAY,WAC7B,MAAOl3C,MAAKuG,OAASvG,KAAKyG,KAE9BumC,EAAWrtC,UAAUw3C,WAAa,WAC9B,GAAIr8C,GAAI,WAAakF,KAAKlD,IAI1B,OAHIkD,MAAKuG,OAASvG,KAAKyG,MACnB3L,GAAM,IAAMkF,KAAKuG,MAAQ,IAAMvG,KAAKyG,KAEjC3L,GA6BXwwC,EAAU3rC,UAAUy3C,OAAS,SAASjO,GAClC,MAAInpC,MAAK4Z,SACE5Z,KAAK4Z,SAASuvB,GAAKrwB,KAAK,SAAUe,GACrC,MAAwB,gBAAbA,GACAA,EAEAA,EAAS/b,MAIjB+Z,QAAQiC,QAAQqvB,IAe/BmC,EAAU3rC,UAAUypB,YAAc,SAAS7tB,GACvC,GAAI87C,GAASr3C,KAAK4zC,WAAa,cAC/B5zC,MAAK81C,qBAAqBuB,EAAQ,SAASd,GACnC,IAAKA,EACD,MAAOh7C,MAMP,KAAK,GAHD6tB,GAAc,GAAIqsB,OAElB6B,EAAOf,EAAY7B,qBAAqB,WACnCj7C,EAAI,EAAGA,EAAI69C,EAAKt9C,SAAUP,EAAG,CAClC,GAII89C,GAAQC,EAJRnX,EAAMiX,EAAK79C,GACXg+C,EAAQpX,EAAIkU,aAAa,MAEzBmD,EAAUrX,EAAIkU,aAAa,OAE3BmD,IACAH,EAAS,EAAGC,EAAiB,EAARE,IAErBH,EAASlX,EAAIkU,aAAa,SACtBgD,IACAA,GAAU,GAEdC,EAASnX,EAAIkU,aAAa,QACtBiD,IACAA,GAAU,GAGlB,IAAIG,GAAU,IACVtX,GAAIphB,aACJ04B,EAAUtX,EAAIphB,WAAW21B,WAE7BxrB,EAAYlsB,KAAK,GAAI8vC,GAAWyK,EAAOF,EAAQC,EAAQG,IAE5Dp8C,EAAS6tB,MAiBxBkiB,EAAU3rC,UAAUi4C,SAAW,SAASr0C,EAAShI,GAC7C,GAAI87C,GAASr3C,KAAK4zC,WAAa,YAAcrwC,EAAQ4zC,YACrDn3C,MAAK81C,qBAAqBuB,EAAQ,SAASd,GACvC,IAAKA,EAED,WADAh7C,MAMI,KAAK,GAHDs8C,GAAO,GAAIpC,OAEX6B,EAAOf,EAAY7B,qBAAqB,YACnCj7C,EAAI,EAAGA,EAAI69C,EAAKt9C,SAAUP,EAAG,CAClC,GAAI4mC,GAAMiX,EAAK79C,GACXg+C,EAAQpX,EAAIkU,aAAa,MACzBgD,EAASlX,EAAIkU,aAAa,SAC1BiD,EAASnX,EAAIkU,aAAa,QAC1BuD,EAAW,MACXC,EAAS,IACb,IAAI1X,EAAIphB,WAAY,CAChB,GAAI+4B,GAAS3X,EAAIphB,WAAW21B,SAC5BmD,GAAS,EAET,KADA,GAAIrS,GAAM,IACG,CACT,GAAIuS,GAAQD,EAAOh7C,QAAQ,KAAM0oC,EACjC,MAAIuS,GAAS,GAGN,CACHF,GAAUC,EAAO/6C,UAAUyoC,GAAKwS,aAChC,OAJAH,GAAUC,EAAO/6C,UAAUyoC,EAAKuS,GAAOC,cACvCxS,EAAMuS,EAAQ,GAO1BJ,EAAK36C,KAAK,GAAI62C,GAAY0D,EAAOF,EAAQC,EAAQM,EAAUC,IAG/Dx8C,EAASs8C,MAsBzBvM,EAAU3rC,UAAUsR,SAAW,SAAS1N,EAASmwC,EAASn4C,GACtDm4C,EAAUA,KACV,IAEI2D,EACJ,IAAIr3C,KAAKm4C,aACLd,EAASr3C,KAAKm4C,iBACX,CACH,GAAIC,KAEJ,IAAI70C,EACA60C,EAAQl7C,KAAKqG,EAAQ4zC,kBAClB,IAAIzD,EAAQ7lB,MAAO,CACtB,GAAIhM,GAAI6xB,EAAQ7lB,KAChB,IAAgB,gBAALhM,GACPu2B,EAAQl7C,KAAK,YAAc2kB,OAE3B,KAAK,GAAI4L,GAAK,EAAGA,EAAK5L,EAAE7nB,SAAUyzB,EAC9B2qB,EAAQl7C,KAAK,YAAc2kB,EAAE4L,IAKzC,GAAIimB,EAAQ2E,SAAU,CAClB,GAAIC,GAAM5E,EAAQ2E,QACA,iBAAPC,KACPA,GAAOA,GAEX,KAAK,GAAIxL,GAAK,EAAGA,EAAKwL,EAAIt+C,SAAU8yC,EAChCsL,EAAQl7C,KAAK,YAAco7C,EAAIxL,IAIvC,GAAI4G,EAAQpvC,KACR,GAA2B,gBAAhBovC,GAAQpvC,KACf8zC,EAAQl7C,KAAK,QAAUw2C,EAAQpvC,UAE/B,KAAK,GAAIuE,GAAK,EAAGA,EAAK6qC,EAAQpvC,KAAKtK,SAAU6O,EACzCuvC,EAAQl7C,KAAK,QAAUw2C,EAAQpvC,KAAKuE,GAK5C6qC,GAAQ6E,SACRH,EAAQl7C,KAAK,WAAaw2C,EAAQ6E,SAGlCH,EAAQp+C,OAAS,EACjBq9C,EAASr3C,KAAK4zC,WAAa,YAAcwE,EAAQI,KAAK,KAEtDj9C,KAAa,wBAKrByE,KAAK81C,qBAAqBuB,EAAQ,SAASd,EAAax9B,GACpD,IAAKw9B,EAAa,CACd,GAAIkC,EAOJ,OALIA,GADc,GAAd1/B,EAAIO,OACE,8BAEA,UAAYP,EAAIO,WAE1B/d,MAAa,mBAAqBk9C,GActC,IAAK,GAJDxnC,GAAW,GAAIwkC,OACfiD,KAEApB,EAAOf,EAAY7B,qBAAqB,WACnC3e,EAAK,EAAGA,EAAKuhB,EAAKt9C,SAAU+7B,EAAI,CACrC,GAAI4iB,GAAarB,EAAKvhB,GAClB6iB,EAAYD,EAAWpE,aAAa,KACxCmE,GAAWE,IACPj7C,IAAKg7C,EAAWpE,aAAa,SAC7Bz0C,IAAK64C,EAAWpE,aAAa,QAIjC,KAAK,GADDsE,GAAcF,EAAWjE,qBAAqB,WACzCj7C,EAAI,EAAGA,EAAIo/C,EAAY7+C,SAAUP,EAAG,CACzC,GAAI6iB,GAAUu8B,EAAYp/C,GACtBq/C,EAAa,GAAIlzC,EAErBkzC,GAAWv1C,QAAUq1C,EACrBE,EAAWrxC,GAAK6U,EAAQi4B,aAAa,MACrCuE,EAAWpyC,MAAQ4V,EAAQi4B,aAAa,QAkBxC,IAAIwE,GAAOlE,EAAav4B,EAAS,SAC7B08B,EAAOnE,EAAav4B,EAAS,QACvB,EAALy8B,IAAgB,EAALC,IACZF,EAAWn7C,IAAW,EAALq7C,EACjBF,EAAWh5C,IAAW,EAALi5C,IAEjBD,EAAWn7C,IAAW,EAALo7C,EACjBD,EAAWh5C,IAAW,EAALk5C,EAGjB,IAAIC,GAAM38B,EAAQo4B,qBAAqB,OACvC,IAAIuE,EAAIj/C,OAAS,EAAG,CAChB,GAAIk/C,GAAKD,EAAI,EACTC,GAAGj6B,aACH65B,EAAWx0C,KAAO40C,EAAGj6B,WAAW21B,WAEpCkE,EAAWK,OAASD,EAAG3E,aAAa,MACpCuE,EAAWM,OAASF,EAAG3E,aAAa,QAG5CuE,EAAWx0C,KAAOuwC,EAAav4B,EAAS,SACnCw8B,EAAWx0C,MAAQw0C,EAAWK,SAC/BL,EAAWx0C,KAAOw0C,EAAWK,QAGjCL,EAAWO,OAASxE,EAAav4B,EAAS,SAEtC,IAAIgwB,GAAMuI,EAAav4B,EAAS,cAC3BgwB,KACDA,EAAM,KAEVwM,EAAWjyC,YAAcylC,EAE7BwM,EAAWnyC,MAAQkuC,EAAav4B,EAAS,SACzCw8B,EAAWtD,MAAQD,EAAWj5B,GAC9Bw8B,EAAWpxC,MAAQkuC,EAAWt5B,EAG9B,KAAK,GADD3U,GAAS2U,EAAQo4B,qBAAqB,SACjCjnB,EAAM,EAAGA,EAAK9lB,EAAO3N,SAAUyzB,EAAI,CACxC,GAAI6rB,GAAW3xC,EAAO8lB,GAClB8rB,EAAW,GAAI5zC,EACnB4zC,GAASj1C,KAAOg1C,EAAS/E,aAAa,QACtCgF,EAAS9xC,GAAK6xC,EAAS/E,aAAa,MACpCgF,EAAS/D,MAAQD,EAAW+D,GAC5BC,EAAS7xC,MAAQkuC,EAAW0D,GACvBR,EAAWnxC,OAGZmxC,EAAWnxC,OAAOzK,KAAKq8C,GAFvBT,EAAWnxC,OAAS,GAAI8tC,OAAM8D,GAOtC,GAAIT,EAAWpxC,MACX,IAAK,GAAIstC,GAAK,EAAGA,EAAK8D,EAAWpxC,MAAM1N,SAAUg7C,EAAI,CACjD,GAAI97C,GAAI4/C,EAAWpxC,MAAMstC,EACzB,IAA8B,GAA1B97C,EAAE8D,QAAQ,aAAmB,CAC7B,GAAI8K,GAAK,GAAInC,EACbmC,GAAGxD,KAAK,OACRwD,EAAGL,GAAKvO,EAAE+D,UAAU,GACf67C,EAAWnxC,OAGZmxC,EAAWnxC,OAAOzK,KAAK4K,GAFvBgxC,EAAWnxC,OAAS,GAAI8tC,OAAM3tC,IAS1C,GAAI0xC,GAAMl9B,EAAQo4B,qBAAqB,OACvC,IAAI8E,EAAIx/C,OAAS,EAAG,CAEhB,IAAK,GADDy/C,MACKlO,EAAK,EAAGA,EAAKiO,EAAIx/C,SAAUuxC,EAChCkO,EAAMv8C,KAAKs8C,EAAIjO,GAAIgJ,aAAa,MAEpCuE,GAAWW,MAAQA,EAIvB,GAAID,GAAMl9B,EAAQo4B,qBAAqB,SACvC,IAAI8E,EAAIx/C,OAAS,EAAG,CAEhB,IAAK,GADD0/C,MACKnO,EAAK,EAAGA,EAAKiO,EAAIx/C,SAAUuxC,EAChCmO,EAAQx8C,KAAKs8C,EAAIjO,GAAIgJ,aAAa,MAEtCuE,GAAWY,QAAUA,EAI7BzoC,EAAS/T,KAAK47C,IAItBv9C,EAAS0V,EAAU9O,OAAWu2C,IAElC,SAAU/+B,GACNpe,KAAaoe,MAUrB2xB,EAAU3rC,UAAU6vC,WAAa,SAASjsC,EAASmwC,EAASn4C,GACxD,GAAI87C,GAASr3C,KAAK4zC,WAAa,mBAAqBrwC,CACpDvD,MAAK81C,qBAAqBuB,EAAQ,SAASd,GACvC,IAAKA,EAED,WADAh7C,MAAa,kBAAoB87C,EAMrC,KAAK,GAFD7H,MACAmK,EAAUpD,EAAY7B,qBAAqB,aACtC5H,EAAK,EAAGA,EAAK6M,EAAQ3/C,SAAU8yC,EAAI,CAIxC,IAAK,GAHD8M,GAASD,EAAQ7M,GACjB+M,EAAM,GAAIzF,GAAawF,EAAOrF,aAAa,cAC3CuF,EAAUF,EAAOlF,qBAAqB,eACjCqF,EAAK,EAAGA,EAAKD,EAAQ9/C,SAAU+/C,EAAI,CACxC,GAAIC,GAASF,EAAQC,GACjBtiC,GACAhQ,GAAauyC,EAAOzF,aAAa,eACjCtE,UAAa+J,EAAOzF,aAAa,iBACjChpC,QAAayuC,EAAOzF,aAAa,iBACjCvE,SAAagK,EAAOzF,aAAa,YACjC0F,UAAaD,EAAOzF,aAAa,aAErCsF,GAAI/J,QAAQr4B,EAAIhQ,IAAMgQ,EAI1B,IAAK,GADDyiC,GAAYN,EAAOlF,qBAAqB,SACnCz5C,EAAK,EAAGA,EAAKi/C,EAAUlgD,SAAUiB,EAAI,CAO1C,IAAK,GANDk/C,GAAWD,EAAUj/C,GACrBC,GACAk/C,MAAYD,EAAS5F,aAAa,cAClC1E,aAEAwK,EAAUF,EAASzF,qBAAqB,WACnC3e,EAAK,EAAGA,EAAKskB,EAAQrgD,SAAU+7B,EAAI,CACxC,GAAIukB,GAASD,EAAQtkB,GACjBsK,GACA0P,OAAauK,EAAO/F,aAAa,eACjC52C,IAAa28C,EAAO/F,aAAa,SACjCz0C,IAAaw6C,EAAO/F,aAAa,OACjCrE,OAAaoK,EAAO/F,aAAa,UACjC1wC,MAAagxC,EAAayF,EAAQ,SAEtCp/C,GAAM20C,SAAS3yC,KAAKmjC,GAExBwZ,EAAItN,OAAOrvC,KAAKhC,GAGpBs0C,EAAWtyC,KAAK28C,GAEpBt+C,EAASi0C,MASjB/pC,EAAc9F,UAAU2J,UAAY,SAAS8uC,EAAS3jC,EAAM2M,GACnDg3B,IACDA,GAAW9zC,KAAM,WAErB,IAAIi2C,GAAcz0C,EAAYsyC,EAC1B3jC,KACA8lC,EAAY9lC,KAAOA,GAEvB8lC,EAAYn5B,MAAQA,EACpBphB,KAAKq0C,OAAOn3C,KAAKq9C,IA0BrBjP,EAAU3rC,UAAUsJ,WAAa,SAASuxC,EAAWC,GACjD,GAAIpD,GAAQqD,EAAQ16C,KAAKwZ,WACrBxZ,MAAK26C,gBACLtD,EAASr3C,KAAK26C,eACdD,GAAQ,GAERrD,EAASr3C,KAAK4zC,WAAa,aAG/B5zC,KAAKo3C,OAAOC,GAAQv+B,KAAK,SAASu+B,GAC9BvB,EAAqBuB,EAAQ,SAASd,GAClC,IAAKA,EAID,YAHIkE,GACAA,IAMR,KAAK,GAFDxxC,GAAa,GAAIxD,GACjBm1C,EAAWrE,EAAY7B,qBAAqB,QACvCj7C,EAAI,EAAGA,EAAImhD,EAAS5gD,SAAUP,EAAG,CACtC,GAAIohD,GAAYD,EAASnhD,GAErBuV,IACJA,GAAO1K,KAAOu2C,EAAUtG,aAAa,MACrCvlC,EAAOtI,MAAQm0C,EAAUtG,aAAa,SACtCvlC,EAAOqqC,OAASwB,EAAUtG,aAAa,SAEvC,KAAK,GADDuG,GAAYD,EAAUnG,qBAAqB,SACtCjnB,EAAK,EAAGA,EAAKqtB,EAAU9gD,SAAUyzB,EAAI,CAC1C,GAAIstB,GAAWD,EAAUrtB,GACrBhZ,EAAOsmC,EAASxG,aAAa,QAC7BprC,EAAQ8rC,EAAe8F,GACvB35B,EAAQ,GAAI1b,EAChB0b,GAAMjY,MAAQA,EAAM6xC,SAGpB,KAFA,GAAI7F,GAAQhsC,EAAM8V,WAEXk2B,GACCA,EAAMlnC,UAAYmnC,KAAKC,eACA,UAAnBF,EAAM6F,UACN55B,EAAM+zB,EAAM6F,WAAa1G,EAAca,GAEvC/zB,EAAM+zB,EAAM6F,WAAa7F,EAAMl2B,WAAW21B,WAGlDO,EAAQA,EAAMG,WAElBrsC,GAAWK,UAAU0F,EAAQyF,EAAM2M,IAG3Co5B,EAAUvxC,IACXyxC,KAxCP16C,SAyCS,SAAS2Z,GACdnK,QAAQC,IAAIkK,GACZ8gC,OAeRtZ,EAAYxhC,UAAUsoB,QAAU,SAAS1sB,EAAU0/C,EAASx5C,GAEnDA,IACDA,KAGJ,IAAI22C,KACA32C,GAAK4/B,OACL+W,EAAQl7C,KAAK,YAAcuE,EAAK4/B,OAEhC5/B,EAAK6/B,MACL8W,EAAQl7C,KAAK,aAAeuE,EAAK6/B,MAEjC7/B,EAAK8J,SACL6sC,EAAQl7C,KAAK,WAAauE,EAAK8J,QAEnC,IAAI2vC,GAAOl7C,KAAKmpC,GACZiP,GAAQp+C,OAAS,IACjBkhD,EAAOA,EAAO,IAAM9C,EAAQI,KAAK,MAGrC1C,EAAqBoF,EAAM,SAAS3E,GAChC,IAAKA,GAAe0E,EAEhB,WADAA,IAMJ,KAAK,GAFDhzB,MACAkzB,EAAa5E,EAAY7B,qBAAqB,UACzC3e,EAAK,EAAGA,EAAKolB,EAAWnhD,SAAU+7B,EAAI,CAC3C,GAAIqlB,GAAYD,EAAWplB,GACvBslB,EAAcD,EAAU1G,qBAAqB,UACjD,MAAI2G,EAAYrhD,OAAS,GAAzB,CAOA,IAAK,GAJDshD,GAAaD,EAAY,GAEzBE,EAAYD,EAAW5G,qBAAqB,eAC5C/T,KACKyM,EAAK,EAAGA,EAAKmO,EAAUvhD,SAAUozC,EAAI,CAC1C,GAAIoO,GAAWD,EAAUnO,GACrBqO,EAAQ,GAAI5H,EAChB4H,GAAMna,KAAOka,EAASjH,aAAa,aACnCkH,EAAMpa,MAAQma,EAASjH,aAAa,SACpCkH,EAAMlwC,QAAUiwC,EAASjH,aAAa,WACtC5T,EAAOzjC,KAAKu+C,GAMhB,IAAK,GADDtS,GAFAuS,KACAC,EAAUL,EAAW5G,qBAAqB,cAErCtH,EAAK,EAAGA,EAAKuO,EAAQ3hD,SAAUozC,EAAI,CACxC,GAAIwO,GAASD,EAAQvO,EAIrB,IAFAsO,EAAKx+C,KAAK0+C,EAAOrH,aAAa,SAEK,iBAA/BqH,EAAOrH,aAAa,QAA4B,CAChD,GAAIsH,GAAMD,EAAOrH,aAAa,YAC9BpL,GAAM0S,EAAI5+C,UAAU,EAAG4+C,EAAI7hD,OAAU,WAAWA,SAMxD,IAAK,GAFD25C,MACAmI,EAAWR,EAAW5G,qBAAqB,QACtCnJ,EAAK,EAAGA,EAAKuQ,EAAS9hD,SAAUuxC,EACrC7M,EAAMiV,EAAOmI,EAASvQ,GAAIgJ,aAAa,QAASuH,EAASvQ,GAAIgJ,aAAa,SAG9E,IAAIpL,EAAK,CACL,GAAIxR,GAAS,GAAI2T,GAAUnC,GACvB4S,WAAYX,EAAU7G,aAAa,OACnCz3C,KAAOs+C,EAAU7G,aAAa,SAC9BJ,KAAOiH,EAAU7G,aAAa,eAC9B5T,OAAQA,EACRgT,MAAOA,EACPqI,aAAcN,GAElBzzB,GAAQ/qB,KAAKy6B,KAIrBp8B,EAAS0sB,MA8HjBqjB,EAAU3rC,UAAUm2C,qBAAuB,SAASh4C,EAAK0nC,EAASyW,GAC9D,GAAIlG,EACA/1C,MAAKk8C,QACLnG,EAAW,SAAWoG,KAAKn8C,KAAKk8C,MAAQ,IAAMl8C,KAAKo8C,OAGvD,KACI,MAAOtG,GAAqBh4C,EAAK0nC,EAASxlC,KAAKwZ,YAAau8B,GAC9D,MAAOp8B,GACL,IAAIsiC,EAGA,KAAMtiC,EAFNsiC,GAAWtiC,KAiCA,mBAAZzf,KACPA,EAAOJ,SACH6L,SAAUA,EACVC,WAAYA,EACZH,cAAeA,EACfC,SAAUA,EACV4lC,UAAWA,EACX0B,WAAYA,EACZ7L,YAAaA,EACb4S,YAAaA,EACbG,QAASA,EAETsC,iBAAkBA,EAClBE,qBAAsBA,EACtBC,eAAgBA,EAChB7C,YAAaA,MTw3LlBuI,UAAU,EAAEpyC,UAAU,KAAKqyC,IAAI,SAAS9iD,EAAQU,EAAOJ,GUtsN1D,YVyuNA,SAASyiD,GAAwB9kC,GAAO,GAAIA,GAAOA,EAAI+kC,WAAc,MAAO/kC,EAAc,IAAIglC,KAAa,IAAW,MAAPhlC,EAAe,IAAK,GAAIrJ,KAAOqJ,GAAWilC,OAAO/8C,UAAUg9C,eAAe5iD,KAAK0d,EAAKrJ,KAAMquC,EAAOruC,GAAOqJ,EAAIrJ,GAAgC,OAAtBquC,GAAAA,WAAiBhlC,EAAYglC,EUlsNlQ,QAASre,GAAW9kB,EAAQkD,GACxBie,EAASje,GACTA,EAAKogC,aAAatjC,GAGtB,QAASmhB,GAASje,GACd,GAAIqgC,GAASrgC,EAAKgf,SAASshB,WAAW,MAClC9xB,EAASxO,EAAKvB,QAAQ+P,QAAUwB,OAAOqc,iBAAmB,CAE9D,IAAIrsB,EAAKyf,eAAgB,CACrB,GAAI2b,GAAWp7B,EAAKugC,iBACpB,EAAAC,EAAAC,aAAYzgC,EAAMo7B,OACXp7B,GAAKuqB,gBACZmW,EAAgB1gC,EAAMqgC,GAEtBrtC,QAAQC,IAAI,mCAGhB,IAAI+M,EAAKwY,SAAU,CACf,GAAImoB,GAAUC,EAAEC,UAAU,EAAG7gC,EAAKgH,UAAU25B,QAE5CG,GAAgB9gC,EAAMqgC,EAAQ7xB,GAAQ,EAAMmyB,GAC5CI,EAAM/gC,EAAMqgC,EAAQM,GACpBN,EAAOW,UAGXhhC,EAAKsoB,cACLtoB,EAAK0J,aAEuC,kBAAjC1J,GAAKgH,UAAUi6B,cACtBjhC,EAAKgH,UAAUi6B,aAAaZ,EAAQrgC,GAGxCA,EAAKqjB,WAAa,EAClBrjB,EAAKvB,QAAQwZ,eAGjB,QAASipB,GAAeb,EAAQ5rC,EAAUwgC,EAAGkM,EAAcnhC,GACvD,GAAIohC,GAASphC,EAAKqhC,gBAAgBF,GAC9Bj3C,EAAA,OACAo3C,GAAc,EAEdzwB,KACA6iB,EAAS,IAsBb,IApBAj/B,EAAS2K,QAAQ,SAAAliB,GACTA,EAAEmN,aAA0B,OAAXqpC,IACjBA,EAASx2C,EAAEmN,cAGVH,GAAShN,EAAEgN,QACZA,EAAQhN,EAAEgN,MAGd,IAAI0a,GAAQ5E,EAAKqhC,gBAAgBnkD,EACjC,IAAI0nB,IAAU1nB,EAAE+/C,MAAO,EACf,EAAAsE,EAAAvH,kBAAiBp1B,EAAM3X,SACvBq0C,GAAc,EAElB,IAAI30C,GAAQ60C,EAAgBnB,EAAQnjD,EAAG+3C,EAAGrwB,EAAO5E,EAAM,MAAM,EACzDrT,IACAkkB,EAAOnwB,KAAKiM,MAIF,IAAlBkkB,EAAOrzB,OACP,MAAO,KAEX,IAAIikD,GAAY,MACZL,IAA2B,SAAjBA,EAAOz0C,QAGbqT,EAAKgH,UAAU4T,sBAAwB5a,EAAK6a,QAC7B,MAAX6Y,GAA6B,MAAXA,KAClB+N,EAAY,YAAc/N,IAGf,MAAXA,GAA6B,MAAXA,KAClB+N,EAAY,MAAQ/N,GAKhC,IAAIgO,GAAY,MACXx3C,GAASo3C,GACTF,KAAW,EAAAG,EAAAvH,kBAAiBoH,EAAOn0C,SACxB,EAAAs0C,EAAAvH,kBAAiBoH,EAAOO,YACpCD,EAAYP,EAAaj3C,OAASA,GAGtC2mB,EAAOrsB,KAAK,SAACo9C,EAAIC,GAAL,OAAaD,EAAGE,QAAU,IAAMD,EAAGC,QAAU,IAEzD,IAAIC,GAAa,GAAIC,GAAOC,WAAWpxB,EAAQ4wB,EAU/C,OATIC,KACe,MAAXhO,EACAgO,EAAY,IAAMA,EACA,MAAXhO,IACPgO,EAAY,IAAMA,GAEtBK,EAAa,GAAIC,GAAOE,cAAc7B,EAAQ0B,EAAYL,GAAW,IAEzEK,EAAWI,MAAO,EACXJ,EAGX,QAASP,GAAgBnB,EAAQvgC,EAASm1B,EAAGrwB,EAAO5E,EAAMuY,EAAa6pB,GACnE,GAAIrrB,GAAQ/W,EAAKvB,QAAQsY,MACrBtK,EAASzM,EAAKvB,QAAQkR,UACtB0yB,EAAYz9B,EAAMjY,OAAS,MAE3BxL,EAAM2e,EAAQ3e,IACdmC,EAAMwc,EAAQxc,IACdowC,EAAS5zB,EAAQzV,YACjBF,EAAQ2V,EAAQ3V,MAChBD,EAAQ4V,EAAQ5V,OAAS4V,EAAQ7U,EAGrC,IAAI+U,EAAKgH,UAAUs7B,oBAA4C,GAArBh/C,EAAMnC,GAAO41B,EAAW,MAAO,KAEzE,IAAIwrB,IAAUphD,EAAMsrB,GAAUsK,EAC1ByrB,GAAcl/C,EAAMmpB,EAAS,GAAKsK,EAClC0rB,EAASvhD,KAAKoC,IAAIk/C,EAAWD,EAAS,EAE1ChqB,GAA4B,EAAdA,CACd,IAAIE,GAAmE,GAAzDzY,EAAKuY,aAAe3T,EAAM/X,QAAU0rB,GAAe,GACjEE,GAAkB,EAATA,CACT,IAAI0pB,GAAOv9B,EAAM5X,OAAQ,EAAAu0C,EAAAvH,kBAAiBp1B,EAAM5X,MAE5CL,EAAA,OACAosB,EAAA,MAGJ,IAAkB,UAAdspB,GACc,OAAdA,GACc,aAAdA,GACc,QAAdA,GACc,WAAdA,GACc,SAAdA,GACc,aAAdA,EAA0B,CAC1B,GAAMK,GAAcC,EAAwBtC,EAAQrgC,EAAMF,EAASm1B,EAC1BoN,EAAWz9B,EAAO2T,EAAa6pB,EACxE,IAAIM,EAAa,CAAA,GAAAE,GAAAC,EACIH,EADJ,EACZ/1C,GADYi2C,EAAA,GACL7pB,EADK6pB,EAAA,QAGd,IAAkB,cAAdP,GAA2C,aAAdA,GAAsC,cAAVl4C,EAAuB,CAAA,GAAA24C,GACtEC,EAA2B1C,EAAQrgC,EAAMF,EAASm1B,EAAGoN,EAAWz9B,EAAO2T,GADDyqB,EAAAH,EAAAC,EAAA,EACtFn2C,GADsFq2C,EAAA,GAC/EjqB,EAD+EiqB,EAAA,OAGpF,IAAkB,WAAdX,EACP11C,EAAQ,GAAIq1C,GAAOiB,YAAY,KAAMV,EAAQE,GAC7CL,GAAU,MAEP,IAAkB,UAAdC,EAAuB,CAC9B,GAAI/3C,GAAQsa,EAAM7X,SAAW,SACzBm2C,GAAW,EAAA3B,EAAAvH,kBAAiBp1B,EAAMu+B,UAClCC,GAAK,EAAA7B,EAAAvH,kBAAiBp1B,EAAMy+B,WAC5BtnC,GAAK,EAAAwlC,EAAAvH,kBAAiBp1B,EAAM0+B,UAChC32C,GAAQ,GAAIq1C,GAAOuB,WAAWhB,EAAQE,EAAQhqB,EAAQnuB,EAAO44C,EAAUE,EAAIrnC,OAExE,IAAkB,mBAAdsmC,EAAgC,CACvC,GAAImB,GAAS5+B,EAAM7X,SAAW,OAC1BipC,EAAOpxB,EAAMhY,SAAW,OAC5BD,GAAQ,GAAIq1C,GAAOyB,YAAYlB,EAAQE,EAAQhqB,EAAQud,EAAMwN,EAAQ9P,GACrE/mC,EAAMw1C,MAAO,MAEV,IAAkB,SAAdE,EAAsB,CAC7B,GAAIqB,GAAS9+B,EAAM7X,SAAW,OAC9BJ,GAAQ,GAAIq1C,GAAO2B,UAAUpB,EAAQE,EAAQhqB,EAAQirB,OAElD,IAAkB,SAAdrB,EAAsB,CAC7B,GAAIuB,GAASh/B,EAAM7X,SAAW,QAC1B82C,EAAYj/B,EAAMk/B,OAAS,OAC/Bn3C,GAAQ,GAAIq1C,GAAO+B,UAAUxB,EAAQE,EAAQhqB,EAAQorB,EAAWnQ,EAAQkQ,OAErE,IAAkB,YAAdvB,EAAyB,CAChC,GAAI2B,GAASp/B,EAAM7X,SAAW,QAC1Bk3C,EAAOr/B,EAAMhY,SAAW,KAC5BD,GAAQ,GAAIq1C,GAAOkC,aAAa3B,EAAQE,EAAQhqB,EAAQwrB,EAAMD,OAE3D,IAAkB,SAAd3B,EAAsB,CAC7B,GAAI8B,GAASv/B,EAAMw/B,QAAU,OACzBC,EAAOz/B,EAAM7X,SAAW,OAC5BJ,GAAQ,GAAIq1C,GAAOsC,UAAUjE,EAAQkC,EAAQE,EAAQhqB,EAAQ4rB,EAAMF,OAEhE,IAAkB,YAAd9B,EAAyB,CAChC,GAAIkC,GAAS3/B,EAAM7X,SAAW,OAC1By3C,EAAO5/B,EAAMhY,SAAW,QAC5BD,GAAQ,GAAIq1C,GAAOyC,aAAalC,EAAQE,EAAQhqB,EAAQ+rB,EAAMD,OAE3D,IAAkB,UAAdlC,EAAuB,CAAA,GAAAqC,GACbC,EAAoB3kC,EAAMF,EAAS8E,GADtBggC,EAAA/B,EAAA6B,EAAA,EAC7B/3C,GAD6Bi4C,EAAA,GACtB7rB,EADsB6rB,EAAA,OAG3B,IAAkB,eAAdvC,EACP11C,EAAQk4C,EAAcxE,EAAQrgC,EAAMF,EAAS8E,EAAO2T,OAEjD,IAAkB,gBAAd8pB,EAA6B,CACpC,GAAIyC,IAAkB,CAOtB,IAN2Bn/C,SAAvBif,EAAMmgC,eACND,GAAkB,EAAAvD,EAAArH,sBAAqBt1B,EAAMmgC,eACjDp4C,EAAQ,GAAIq1C,GAAOgD,cAAczC,EAAQ,EAAG,IAAK,EAAGviC,EAAKvB,QAAQ2Q,WAAb,GAChD01B,IACAn4C,EAAQ,GAAIq1C,GAAOE,cAAc7B,EAAQ1zC,EAAOmT,EAAQmlC,WAAanlC,EAAQolC,WAAW,IAAI,EAAO,SAAU,QAAS,mBAErHzC,EAASF,EAAU,EAAG,CACvB,GAAI4C,GAASvgC,EAAM7X,SAAW,MAC1Bq4C,EAAOxgC,EAAMhY,SAAWgY,EAAMvX,QAAU,QACxCg4C,GAAK,GAAIrD,GAAOsD,SAAS/C,EAAQ,EAAIE,EAASF,EAAS9pB,EAAQ2sB,EAAMD,EACzEx4C,GAAQ,GAAIq1C,GAAOC,YAAYoD,GAAI14C,SAGpC,CAAA,GAAkB,WAAd01C,EACP,MAAO,KAEJ,IAAkB,QAAdA,EAAqB,CAC5B,GAAIkD,IAAS3gC,EAAM7X,SAAW,KAC1By4C,GAAO5gC,EAAMhY,SAAWgY,EAAMvX,QAAU,OACxCuX,GAAM6gC,QAAU3lC,EAAQtV,UACxBg7C,GAAO1lC,EAAQtV,QACnB,IAAIk7C,KAASjD,EAASF,IAAWj/C,EAAMnC,EACvC,IAAoB,eAAhB2e,EAAQhY,OACW,kBAAlBgY,EAAQ+8B,QAA8B/8B,EAAQnJ,sBAC7CmJ,EAAQ6lC,MAAQ7lC,EAAQ6lC,KAAKnlD,QAAQ,gBAAkB,GAAKsf,EAAQnJ,sBACpEqJ,EAAKgH,UAAU4T,qBAAuB5a,EAAK6a,SAC7C6qB,IAAS,GAAK,CACd,GAAIE,IAASC,EAAU7lC,EAAM7e,EAAKmC,EAClCqJ,GAAQ,GAAIq1C,GAAO8D,eAAevD,EACHE,EACAhqB,EACA+sB,GACAI,GACA9lC,EAAQzV,YACRyV,EAAQ5T,eAEvCS,GAAQ,GAAIq1C,GAAOsD,SAAS/C,EAAQ,EAAIE,EAASF,EACxB9pB,EAAQ+sB,GAAMD,KAI/C,MAAK54C,MAGA,EAAA40C,EAAAvH,kBAAiBp1B,EAAM3X,QAAU6S,EAAQimC,aAC1C77C,IAAUk4C,IACVz1C,EAAQ,GAAIq1C,GAAOE,cAAc7B,EAAQ1zC,EAAOzC,GAAO,IAGvDi4C,IACAx1C,EAAMw1C,MAAO,GAGjBx1C,EAAMmT,QAAUA,GAEZ,EAAAyhC,EAAAvH,kBAAiBp1B,EAAA,iBACjBmU,EAAQ,MAERA,IACApsB,EAAMosB,MAAQA,GAGdnU,EAAM1X,SACNP,EAAMm1C,OAAwB,EAAfl9B,EAAM1X,QAGlBP,GAzBP,OA6BJ,QAASq5C,GAAchmC,EAAMqgC,EAAQpL,GACjC,GAAIpkB,MACAo1B,KACAC,KACAC,IAEJvF,GAAE/1C,IAAI,SAAA4J,GACFA,EAAS2K,QAAQ,SAAAU,GACb,GAAI8E,GAAQ5E,EAAKqhC,gBAAgBvhC,EAEjC,KAAIA,EAAQm9B,OAAUr4B,EAGtB,GAAoB,aAAhBA,EAAMjY,OACN,EAAAy5C,EAAAlkB,OAAM+jB,EAAarhC,EAAM3Z,GAAI6U,GAC7BomC,EAAUthC,EAAM3Z,IAAM2Z,MACnB,IAAoB,YAAhBA,EAAMjY,MACbw5C,EAAgBzlD,KAAKof,OAClB,CACH,GAAInT,GAAQ60C,EAAgBnB,EAAQvgC,EAASm1B,EAAGrwB,EAAO5E,EACnDrT,IACAkkB,EAAOnwB,KAAKiM,OAGzBqT,EAAKqmC,mBAEJF,EAAgB3oD,OAAS,IACzBqzB,EAASA,EAAOy1B,OAAOC,EAAgBJ,EAAiBnmC,IAG5D,KAAK,GAAIwmC,KAAOP,GAAa,CACzB,GAAIQ,GAAKR,EAAYO,GACjB5hC,EAAQshC,EAAUM,EACtB,IAAoB,aAAhB5hC,EAAMjY,MAAsB,CAC5B,GAAI+5C,GAAkBC,EAAaF,EAAI7hC,EAAO5E,EAAMi1B,EACpDyR,GAAgBtnC,QAAQ,SAAAiG,GAAA,MAAKwL,GAAOnwB,KAAK2kB,MAIjD,MAAOwL,GAGX,QAAS+1B,GAAe5mC,EAAMqgC,EAAQxvB,EAAQokB,GAC1C,GAAI4R,GAAW3G,OAAO4G,KAAK9mC,EAAK+mC,iBAC5BC,IAiBJ,OAfAH,GAASriD,KAAK,SAACo9C,EAAIC,GAAL,MACA7hC,GAAK+mC,gBAAgBlF,GAAI,GAAG13C,MAAQ6V,EAAK+mC,gBAAgBnF,GAAI,GAAGz3C,QAG9E08C,EAASznC,QAAQ,SAAA6nC,GACb,GAAIp2B,GAASqwB,EAAeb,EAAQrgC,EAAK+mC,gBAAgBE,GAAMhS,EAAGj1B,EAAK7U,OAAO87C,GAAMjnC,EACvDA,EAAKgH,UAAU4T,sBAAwB5a,EAAK6a,OAC7C,iBAAmB,OAE3ChK,KACAA,EAAOQ,MAAQrR,EAAK7U,OAAO87C,GAC3BD,EAAYC,GAAOp2B,KAIpBm2B,EAGX,QAASE,GAAalnC,EAAM6Q,EAAQs2B,EAAMC,EAAYC,GAClD,GAAIC,GACItnC,EAAKsnC,YACLtnC,EAAKgH,UAAUsgC,YACftnC,EAAKvB,QAAQsO,kBAEjBw6B,GAAmB,EAEnBC,EAAa,GAAAC,GAAAC,QACbC,IA4CJ,OAxCA92B,GAAOzR,QAAQ,SAAAzS,GAEX,GAAIA,EAAMw1C,OACLniC,EAAK6a,QACN7a,EAAKgH,UAAU4T,qBAAsB,CAErC,GAAIgtB,GAAYD,EAAUE,KAAK,SAAAnhC,GAAA,MAAMA,GAAGohC,YAAYn7C,IAEpD,IAAIi7C,EACAA,EAAUznC,IAAIxT,OACX,IAAIg7C,EAAUnqD,QAAU8pD,EAC3BC,GAAmB,MAChB,CACH,GAAIQ,GAAU,GAAAN,GAAAC,OACdK,GAAQ5nC,IAAIxT,GACZg7C,EAAUjnD,KAAKqnD,QAGnBP,GAAWrnC,IAAIxT,KAInB66C,EAAW32B,OAAOrzB,OAAS,IAC3BmqD,GAAaH,GAAYlB,OAAOqB,IAKhCR,GACAQ,EAAUvoC,QAAQ,SAAA2oC,GACVA,EAAQhvB,OACRgvB,EAAQl3B,OAAOm3B,QAAQ,GAAIhG,GAAOiG,UAAUF,EAAQtvB,OAAQ2uB,EAAYC,MAKpFM,EAAUvoC,QAAQ,SAAA2oC,GACdA,EAAQl3B,OAAOrsB,KAAK,SAACo9C,EAAIC,GAAL,OAAaD,EAAGE,QAAU,IAAMD,EAAGC,QAAU,QAG7D6F,EAAWJ,GAIvB,QAAS7G,GAAgB1gC,EAAMqgC,GAAwB,GAAhBpL,GAAgBiT,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,GAAd,EAAGf,EAAWe,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,IAAN,EAEzCC,EAAc,CAClBnoC,GAAK2e,QAA6C,gBAA5B3e,GAAKgH,UAAU2X,QACjC3e,EAAKgH,UAAU2X,QAAUwpB,EAE7BnoC,EAAKooC,cAAyD,iBAAlCpoC,GAAKgH,UAAUohC,cACvCpoC,EAAKgH,UAAUohC,eAAgB,CAEnC,IAAIv3B,GAASm1B,EAAchmC,EAAMqgC,EAAQpL,EAGzC,IAAIj1B,EAAKgH,UAAU4T,sBAAwB5a,EAAK6a,OAAQ,CAAA,GAAAwtB,GAAA,SAC3CC,GACL,GAAIC,GAAUvoC,EAAKwoC,YAAYF,EAC/BtoC,GAAK7U,OAAOm9C,IAAQ,EAAAlC,EAAA98C,aAAY0W,EAAK7U,OAAOm9C,GAC5C,IAAIj3B,GAAQrR,EAAK7U,OAAOm9C,EACxBj3B,GAAMo3B,cAAe,CACrB,IAAIC,MAEAC,EAAQ,KAAaC,EAAQ,MAC7BC,EAAQ,IAEZN,GAAQnpC,QAAQ,SAACiG,EAAGpoB,GAChB,GAAI6rD,GAAiB9oC,EAAK+mC,gBAAgBwB,EAAQtrD,GAC7C6rD,KAGLA,EAAe1pC,QAAQ,SAAAU,IACnB,EAAAsmC,EAAAlkB,OAAMwmB,EAAgB5oC,EAAQhY,KAAMgY,GACpC6oC,EAAQznD,KAAKC,IAAI2e,EAAQ3e,IAAKwnD,GAC9BC,EAAQ1nD,KAAKoC,IAAIwc,EAAQxc,IAAKslD,GAC1B9oC,EAAQ/Y,UAAY8hD,IACpBA,EAAQ/oC,EAAQ/Y,YAGpBsqB,IAAUA,EAAM2nB,OAAgC,IAAvB3nB,EAAM2nB,MAAMx7C,UACrC6zB,EAAM2nB,MAAQh5B,EAAK7U,OAAOo9C,EAAQ,IAAIvP,aAGnCh5B,GAAK+mC,gBAAgBwB,EAAQtrD,OAIxC+iB,EAAK7U,OAAOm9C,GAAMhlD,IAAMslD,EACxB5oC,EAAK7U,OAAOm9C,GAAMnnD,IAAMwnD,EACxB3oC,EAAK7U,OAAOm9C,GAAMvhD,QAAU8hD,EAE5BjI,EAAE/1C,IAAI,SAAA4J,GAEF,GAAIs0C,GAAWt0C,EAAS,GACpBmhB,EAAM,IAEVnhB,GAAS2K,QAAQ,SAAAU,GACb,GAAIwqB,GAAK,GAAA0e,GAAApnD,MAAUke,EAAQ3e,IAAK2e,EAAQxc,IACxCsyB,GAAMA,GAAM,EAAAozB,EAAAnnD,OAAM+zB,EAAK0U,GAAMA,GAGjC,IAAI2e,GAAerzB,EAAIjqB,QAEvBs9C,GAAa7pC,QAAQ,SAAA8pC,GACjB,GAAIC,KAA8B,EAAdD,EAAM5lD,QAA4B,EAAd4lD,EAAM/nD,OAAa,GAAKonD,EAAQ/qD,OACpE4rD,EAAc,CAElB30C,GAAS2K,QAAQ,SAAAU,GACb,GAAInN,GAAOmN,EAAQ3e,KAAO,EACtByR,EAAOkN,EAAQxc,KAAO,CACtBqP,IAAQu2C,EAAM5lD,OAASsP,GAAQs2C,EAAM/nD,QAErCioD,GAAgBloD,KAAKC,IAAIyR,EAAMs2C,EAAM5lD,OACrBpC,KAAKoC,IAAIqP,EAAMu2C,EAAM/nD,OAAS,IAItD,IAAIkoD,GAAa,GAAA9H,GAAAn4C,UACjB,KAAK,GAAIwI,KAAOm3C,GACZM,EAAWz3C,GAAOm3C,EAASn3C,EAG/By3C,GAAWloD,IAAM+nD,EAAM/nD,MACvBkoD,EAAW/lD,IAAM4lD,EAAM5lD,MACnB+lD,EAAWn/C,OAASq+C,EAAQ/qD,OAAS,IACrC6rD,EAAWn/C,OAAS,KAAOq+C,EAAQ/qD,OAAS,UAGhD6rD,EAAWC,aAAiB,EAAMF,EAAeD,GAEjD,EAAA/C,EAAAlkB,OAAMliB,EAAK+mC,gBAAiBuB,EAAMe,MAEvCX,SAEI1oC,GAAKwoC,YAAYF,GA9E5B,KAAK,GAAIA,KAAQtoC,GAAKwoC,YAAaH,EAA1BC,GAmFb,GAAItB,GAAcJ,EAAe5mC,EAAMqgC,EAAQxvB,EAAQokB,EAEvD2L,GAAE/1C,IAAI,SAAA0+C,GACF,GAAIC,MACAb,EAAQ,KACRC,EAAQ,KAEZW,GAAWnqC,QAAQ,SAAAyR,GACf,GAAI44B,GAAUzC,EAAYn2B,EACtB44B,KACAD,EAAS9oD,KAAK+oD,GACdd,EAAQznD,KAAKC,IAAIwnD,EAAOc,EAAQtoD,OAChCynD,EAAQ1nD,KAAKoC,IAAIslD,EAAOa,EAAQnmD,UAIxCkmD,EAASpqC,QAAQ,SAAAzS,GACbkkB,EAAOnwB,KAAK,GAAIshD,GAAOiB,YAAYt2C,EAAOg8C,EAAOC,OAEtD5oC,EAAKwoC,aAER5H,EAAE/1C,IAAI,SAAA8B,GAAA,MAASkkB,GAAOnwB,KAAKiM,IAAQq6C,EArHgB,IAAA0C,GAuHhBxC,EAAalnC,EAAM6Q,EAAQs2B,EAAMlS,GAvHjB0U,EAAA9G,EAAA6G,EAAA,GAuH9ClxB,EAvH8CmxB,EAAA,GAuHpCpC,EAvHoCoC,EAAA,EAyHnD3pC,GAAK4e,iBAAmB5e,EAAKvB,QAAQkR,UAEjC43B,EACAvnC,EAAKogC,aAAa,qEAElBpgC,EAAKogC,eAETpgC,EAAKwY,SAAWA,EAIpB,QAASoxB,GAAa5pC,EAAMqgC,EAAQ1hB,GAChC,GAAIkrB,GAAa7pC,EAAKvB,QAAQkR,UAAY,IAAO3P,EAAKvB,QAAQsY,MAC1D+yB,EAAU9pC,EAAKvB,QAAQmR,QAAU,IAAO5P,EAAKvB,QAAQsY,MACrDgzB,IACJ,IAAI/pC,EAAKgqC,cAAe,CACpB,GAAIC,GAAcjqC,EAAKgqC,cAAcr+C,QACrCs+C,GAAY7qC,QAAQ,SAAC8pC,EAAO3lD,GACV,IAAVA,EACI2lD,EAAM/nD,MAAQ0oD,GACdE,EAAerpD,MAAMS,IAAK0oD,EAAWvmD,IAAK4lD,EAAM/nD,MAAQ,IAE5D4oD,EAAerpD,MAAMS,IAAK8oD,EAAY1mD,EAAM,GAAGD,MAAQ,EAAGA,IAAK4lD,EAAM/nD,MAAQ,IAG7EoC,GAAS0mD,EAAYzsD,OAAS,GAAK0rD,EAAM5lD,MAAQwmD,GACjDC,EAAerpD,MAAMS,IAAK+nD,EAAM5lD,MAAQ,EAAGA,IAAKwmD,MAIxDC,EAAevsD,OAAS,IACxB6iD,EAAO6J,UAAY,OACnBH,EAAe3qC,QAAQ,SAAA1gB,GACnB,GAAIyC,IAAOzC,EAAMyC,IAAM6e,EAAKvB,QAAQkR,WAAa3P,EAAKvB,QAAQsY,MAAQ,IAClEzzB,GAAO5E,EAAM4E,IAAM0c,EAAKvB,QAAQkR,WAAa3P,EAAKvB,QAAQsY,MAAQ,GACtEspB,GAAO8J,SAAShpD,EAAK,EAAGmC,EAAMnC,EAAKw9B,MAK/C,QAASyrB,GAAc/J,EAAQr/B,EAAOyX,GAClC4nB,EAAOgK,UAAU,EAAG,EAAGrpC,EAAOyX,GAIlC,QAASqoB,GAAgB9gC,EAAMqgC,EAAQ7xB,GAA+B,GAAvB87B,GAAuBpC,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,IAAjB,EAAMvH,EAAWuH,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,GAAH,EAC3DqC,EAAevqC,EAAKvB,QAAQkO,kBAAoB,GAChD6B,KACA+7B,GAAgB,EAGpB,IAAIC,GAA0B,EAApBxqC,EAAKgf,SAAShe,KACdupC,GAAe,GAArBC,IACAxqC,EAAKgf,SAAShe,MAAQwpC,EAAMD,EAGhC,IAAIE,GAAKzqC,EAAK2e,QAAUgiB,CAExB3gC,GAAKwY,SAASpZ,QAAQ,SAAAxiB,GAAA,MAAK6tD,IAAM7tD,EAAE67B,OAASzY,EAAK2e,UAEjD8rB,GAAM,EACNA,EAAKvpD,KAAKoC,IAAImnD,EAAIzqC,EAAKvB,QAAQkP,cAE/B,IAAI+8B,GAAeD,CACfj8B,KACAk8B,GAAgB,GAGhBA,GAAgB1qC,EAAKgf,SAASvG,SAC9BzY,EAAKgf,SAASvG,OAASiyB,GAG3B1qC,EAAKioB,eAAerjB,MAAMua,KAAO,UACjCnf,EAAKgf,SAASpa,MAAM5D,MAAQwN,EAAU,GAAMg8B,EAAI,EAAK,KAAS,GAAKA,EAAM,KACzExqC,EAAKgf,SAASpa,MAAM6T,OAAS,GAAKgyB,EAAK,KACvCzqC,EAAK+X,aAAgB72B,KAAKoC,IAAImnD,EAAIzqC,EAAKvB,QAAQkP,eAE/C3N,EAAK0a,eACL1a,EAAKqoB,QAAUroB,EAAKvB,QAAQkR,UAE5B0wB,EAAOsK,OACHn8B,GACA6xB,EAAOtpB,MAAM,EAAG,GAGhBuzB,GACAF,EAAc/J,EAAQmK,EAAKE,GAG/Bd,EAAa5pC,EAAMqgC,EAAQoK,GAI/B,QAAS1J,GAAM/gC,EAAMqgC,GAAmB,GAAXM,GAAWuH,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,GAAH,EAC7B0C,EAAqB,GAAI5I,GAAO6I,mBAChC/sD,GAAWkiB,EAAK4e,iBAAmB5e,EAAKvB,QAAQkR,WAAW3P,EAAKvB,QAAQsY,MAAO,GACnFspB,GAAOyK,UAAUhtD,EAAQ6iD,EAAU3gC,EAAK2e,SACxCisB,EAAmBE,UAAU,EAAG9qC,EAAK2e,SAErC3e,EAAK+qC,eAAe1K,EAAQuK,EAAoB9sD,GAE5C8sD,EAAmB/5B,OAAOrzB,OAAS,EACnCwiB,EAAK4qC,mBAAqBA,EAE1B5qC,EAAK4qC,mBAAqB,KAE9BvK,EAAOW,UAGX,QAASgK,GAAehrC,EAAM4E,GAC1B,GAAIqmC,GAAOjrC,EAAKkrC,SAAStmC,GACrBumC,EAAOnrC,EAAKorC,SAASxmC,EAYzB,OAVKumC,KAEGA,EADO,EAAPF,EACO,EAEA,IAGVA,IACDA,EAAO,IAEHA,EAAME,GAGlB,QAASE,GAAelhD,EAAO8gD,EAAME,GACjC,GAAIG,IAAa,EAAMnhD,EAAS8gD,IAASE,EAAKF,GAC1CM,EAAa,GAAON,GAASE,EAAOF,EAExC,QAAQK,EAAUC,GAGtB,QAAS1F,GAAU7lC,EAAM7e,EAAKmC,GAC1B,GAAIsiD,GAAS,IACb,IAAI5lC,EAAKugC,gBAAiB,CACtB,GAAIiL,GAAqC,EAA3BxrC,EAAKugC,gBAAgBx2C,MAC/B0hD,EAAiC,EAAzBzrC,EAAKugC,gBAAgBt2C,GACjC,IAAe3G,GAAXkoD,GAAkBC,GAAStqD,EAAK,CAChC,GAAIuqD,GAAQxqD,KAAKoC,IAAInC,EAAKqqD,GACtBG,EAAQzqD,KAAKC,IAAImC,EAAKmoD,EAG1B,KADA7F,EAAS5lC,EAAKugC,gBAAgBh5C,IAAIyK,OAAO05C,EAAQF,EAASG,EAAQD,EAAQ,GAC7DA,EAANvqD,GACHykD,EAAS,IAAMA,EACf8F,GAEJ,MAAOpoD,EAAMqoD,GACT/F,GAAkB,IAClB+F,KAIZ,MAAO/F,GAGX,QAASjD,GAAwBtC,EAAQrgC,EAAMF,EAASm1B,EAAGoN,EAAWz9B,EAAO2T,EAAa6pB,GACtF,GAAIrrB,GAAQ/W,EAAKvB,QAAQsY,MACrBtK,EAASzM,EAAKvB,QAAQkR,UAEtBxlB,EAAQ2V,EAAQ3V,MAChBD,EAAQ4V,EAAQ5V,OAAS4V,EAAQ7U,GAEjCs3C,GAAUziC,EAAQ3e,IAAMsrB,GAAUsK,EAClC0rB,EAASvhD,KAAKoC,KAAKwc,EAAQxc,IAAMmpB,EAAS,GAAKsK,EAAOwrB,EAAS,GAE/D9pB,EAAmE,GAAzDzY,EAAKuY,aAAe3T,EAAM/X,QAAU0rB,GAAe,IAC7DqzB,EAAiBnzB,EAEjB9rB,EAAQ,KACRosB,EAAQ,KAERyqB,EAAS5+B,EAAM7X,SAAW,QAC1BipC,EAAOpxB,EAAMhY,SAAW,OACxBi/C,EAAUjnC,EAAMknC,WAEpB,IAAIlnC,EAAM6gC,QAAU3lC,EAAQtV,QACxBg5C,EAAS1jC,EAAQtV,YAEd,KAAI,EAAA+2C,EAAAvH,kBAAiBp1B,EAAMmnC,iBAAkB,CAChD,GAAInW,GAAOhxB,EAAMonC,QAAUpnC,EAAM61B,SAC5B7E,KACDA,GAAO,EAAAqW,EAAA/V,cAAa,GAAItxB,EAAMvX,OAAQuX,EAAMtX,OAAQsX,EAAMsnC,QAC1DtnC,EAAM61B,UAAY7E,EAGtB,IAAIuW,GAASrsC,EAAQqsC,MACrB,IAAexmD,SAAXwmD,IAAyB3I,EAAQ,CACjC2I,EAASA,GAAU,CAEnB,IAAIC,GAAQxnC,EAAMynC,KAAQ,EAAMznC,EAAMynC,KAAQ,EAC1CC,EAAQ1nC,EAAM2nC,KAAQ,EAAM3nC,EAAM2nC,KAAQ,EAC1CC,GAAc,EAAML,EAAUC,IAAUE,EAAMF,GAE9ChgD,EAAQogD,EAAU5W,EAAKp4C,OAAU,CACrCojD,GAAE6L,MAAM,EAAGrgD,EAAMwpC,EAAKp4C,OAAS,GAC/BgmD,EAAS5N,EAAKxpC,IAItB,GAAIiI,GAAOuQ,EAAM8nC,MAAQj0B,CACrB7T,GAAM+nC,QACNt4C,EAAQ,EAAMuQ,EAAM+nC,MAASl0B,GAG7B7T,EAAMgoC,iBACFv4C,EAAQ,EAAMuQ,EAAMgoC,kBACpBf,EAAU,KAGlB,IAAIlgB,IAAO4W,EAASE,GAAQ,CAE5B,IAAkB,OAAdJ,EACA11C,EAAQ,GAAIq1C,GAAO6K,QAAQlhB,EAAKt3B,EAAMmvC,OAEnC,IAAkB,aAAdnB,EAA0B,CACjC,GAAIxrC,GAAM+N,EAAMkoC,WAAa,IACzB9rC,EAAQ4D,EAAMmoC,WAAa14C,CAC/B1H,GAAQ,GAAIq1C,GAAOgD,cAAcrZ,EAAKt3B,EAAMwC,EAAKmK,EAAOwiC,EAAQqI,OAE7D,IAAkB,QAAdxJ,EACP11C,EAAQ,GAAIq1C,GAAOgL,SAASrhB,EAAKt3B,EAAMmvC,EAAQqI,OAE5C,IAAkB,aAAdxJ,EACP11C,EAAQ,GAAIq1C,GAAOiL,cAActhB,EAAKt3B,EAAM,GAAMA,EAAMmvC,EAAQqI,OAE7D,IAAkB,WAAdxJ,EACP11C,EAAQ,GAAIq1C,GAAOsD,SAAS3Z,EAAMt3B,EAAK,EAAG,EAAGA,EAAMA,EAAMmvC,EAAQqI,OAE9D,IAAkB,SAAdxJ,EAAsB,CAC7B,GAAI6K,GAAStoC,EAAMuoC,QAAU,CAC7BxgD,GAAQ,GAAIq1C,GAAOoL,UAAUzhB,EAAKt3B,EAAK,EAAG64C,EAAQ1J,EAAQqI,OAG1Dl/C,GAAQ,GAAIq1C,GAAOqL,WAAW1hB,EAAKt3B,EAAMmvC,EAI7C,IAAIxN,GAAiB,SAATA,GAAoByM,EAASF,EAAU,EAAG,CAClD,GAAI+K,GAAW,GAAItL,GAAOsD,SAAS/C,EAAQ,EAAIE,EAASF,EAASluC,EAAM2hC,EACvErpC,GAAQ,GAAIq1C,GAAOC,YAAYqL,EAAU3gD,IAG7C,IAAI,EAAA40C,EAAAvH,kBAAiBp1B,EAAM2oC,SAAU,CAAA,GAAAC,GACdxC,EAAehrC,EAAM4E,GADP6oC,EAAA5K,EAAA2K,EAAA,GAC5BvC,EAD4BwC,EAAA,GACtBtC,EADsBsC,EAAA,GAAAC,EAGLrC,EAAelhD,EAAO8gD,EAAME,GAHvBwC,EAAA9K,EAAA6K,EAAA,GAG5BpC,EAH4BqC,EAAA,GAGlBpC,EAHkBoC,EAAA,EAKjC,IAAe,EAAXrC,GAAkBA,EAAW,EAI7B,MAAO,KAEP,IAAIsC,GAAc,SAAA9iD,GAAA,OAAMA,EAAIygD,GAAaK,EACzCnzB,GAASv3B,KAAKoC,IAAI,EAAGsqD,EAAYtC,IACjCrW,GAAQ2Y,EAAY,GAEhBtC,GAAYC,IACZtW,GAAQxc,GAEZM,GAAS53B,IAAK8pD,EAAM3nD,IAAK6nD,EAEzB,IAAI0C,GAAc,EACdC,EAAelN,EAAEC,UAAUj8B,EAAM3X,MAAO6S,EAAQimC,aAEhD,EAAAxE,EAAArH,sBAAqB4T,IAAiB5jD,IAAUk4C,IAChDz1C,EAAQ,GAAIq1C,GAAOE,cAAc7B,EAAQ1zC,EAAOzC,GAAO,EAAM,KACZ,SAAhB4jD,EAA0B,QAAU,SAChD,UAAjBA,IACAD,EAAclhD,EAAMohD,WAAa,GAErC3L,GAAU,GAEdz1C,EAAQ,GAAIq1C,GAAOgM,gBAAgBrhD,EAAO,EAAGsoC,EAAK5gC,EAAO,EAAKw5C,EAAajC,GAInF,OAAQj/C,EAAOosB,GAGnB,QAASgqB,GAA2B1C,EAAQrgC,EAAMF,EAASm1B,EAAGoN,EAAWz9B,EAAO2T,GAC5E,GAAIxB,GAAQ/W,EAAKvB,QAAQsY,MACrBtK,EAASzM,EAAKvB,QAAQkR,UAEtBxlB,EAAQ2V,EAAQ3V,MAEhBo4C,GAAUziC,EAAQ3e,IAAMsrB,GAAUsK,EAClC0rB,EAASvhD,KAAKoC,KAAKwc,EAAQxc,IAAMmpB,EAAS,GAAKsK,EAAOwrB,EAAS,GAE/D9pB,EAAmE,GAAzDzY,EAAKuY,aAAe3T,EAAM/X,QAAU0rB,GAAe,IAC7DqzB,EAA0B,EAATnzB,EAEjB9rB,EAAQ,KACRosB,EAAQ,KAERk1B,GAAe,EAAA1M,EAAAvH,kBAAiBp1B,EAAA,YAfqDspC,EAkBtElD,EAAehrC,EAAM4E,GAlBiDupC,EAAAtL,EAAAqL,EAAA,GAkBpFjD,EAlBoFkD,EAAA,GAkB9EhD,EAlB8EgD,EAAA,EAuCzF,KAlBI,EAAA5M,EAAAvH,kBAAiBp1B,EAAMwpC,WACvBnD,EAAoC,IAA7BjrC,EAAKquC,wBACZr7C,QAAQC,IAAI,SAAYg4C,KAExB,EAAA1J,EAAAvH,kBAAiBp1B,EAAM0pC,WACvBnD,EAAoC,KAA7BnrC,EAAKuuC,wBACZv7C,QAAQC,IAAI,SAAYk4C,IAGP,EAAMF,EAAtB,EAAM9gD,IACPA,EAAQ8gD,GAEP,EAAM9gD,EAAU,EAAMghD,IACvBhhD,EAAQghD,GAKR8C,EAAc,CACd,GAAIO,GAAOxuC,EAAKkrC,SAAStmC,GACrB6pC,EAAOzuC,EAAKorC,SAASxmC,IAErB,EAAA28B,EAAAvH,kBAAiBp1B,EAAMwpC,WACvBI,EAAoC,IAA7BxuC,EAAKquC,0BAEZ,EAAA9M,EAAAvH,kBAAiBp1B,EAAM0pC,WACvBG,EAAoC,KAA7BzuC,EAAKuuC,yBAGhBtD,EAAOuD,GAASC,EAAOD,GAAQ,EAC/BrD,EAAOsD,GAASA,EAAOD,GAAQ,EAnDsD,GAAAE,GAsD7DrD,EAAelhD,EAAO8gD,EAAME,GAtDiCwD,EAAA9L,EAAA6L,EAAA,GAsDpFpD,EAtDoFqD,EAAA,GAsD1EpD,EAtD0EoD,EAAA,EAwDzF,IAAkB,cAAdtM,EAA2B,CAC3B,GAAIuL,GAAc,SAAA9iD,GAAA,MAAKA,GAAI5J,KAAKoC,IAAI,EAAGioD,GACvC9yB,GAASv3B,KAAKq8B,IAAIqwB,EAAYtC,IAAaM,EAC3C3W,GAAQ2Y,EAAY,GAAOhC,EAEvBN,GAAYC,IACZtW,GAAKxc,GAELw1B,IACAhZ,GAAKxc,EAAS,GAGdM,GADA,EAAAwoB,EAAAvH,kBAAiBp1B,EAAA,eACT,MAECzjB,IAAK8pD,EAAM3nD,IAAK6nD,GAGjC,GAAI3H,GAAS5+B,EAAM7X,SAAW,KAC1BipC,EAAOpxB,EAAMhY,SAAWgY,EAAMvX,QAAU,OACxCuX,GAAM6gC,QAAU3lC,EAAQtV,UACxBwrC,EAAOl2B,EAAQtV,QACnB,IAAIgtC,GAAQ5yB,EAAMgqC,MAAS,EAAMhqC,EAAMgqC,MAAS,IAEhD,IAAIhqC,EAAMonC,OAAQ,CACd,GAAIpW,GAAOhxB,EAAMonC,OACb5/C,EAAQk/C,EAAS1V,EAAKp4C,OAAQ,CAClC4O,GAAOw0C,EAAE6L,MAAM,EAAGrgD,EAAMwpC,EAAKp4C,OAAS,GACtCw4C,EAAOJ,EAAKxpC,GAGhB,GAAIwY,EAAMtX,OAAQ,CACd,GAAIuhD,GAAOjqC,EAAM61B,SACZoU,KACDA,GAAO,EAAA5C,EAAA/V,cAAa,GAAItxB,EAAMvX,OAAQuX,EAAMtX,OAAQsX,EAAMsnC,QAC1DtnC,EAAM61B,UAAYoU,EAGtB,IAAI76B,GAAQs3B,EAASuD,EAAKrxD,OAAU,CACpCw2B,GAAO4sB,EAAE6L,MAAM,EAAGz4B,EAAM66B,EAAKrxD,OAAS,GACtCw4C,EAAO6Y,EAAK76B,GAGhB,GAAI86B,GAAY,GAAI9M,GAAOsD,SAAS/C,EAAQtN,EAAIwN,EAASF,EAAS9pB,EAAQud,EAAMwN,EAAQhM,EAGxF,OAFA7qC,GAAQ,GAAIq1C,GAAOgM,gBAAgBc,EAAW,EAAG,EAAGlD,IAE5Cj/C,EAAOosB,GAGnB,QAAS4rB,GAAoB3kC,EAAMF,EAAS8E,GACxC,GAAImS,GAAQ/W,EAAKvB,QAAQsY,MACrBtK,EAASzM,EAAKvB,QAAQkR,UAEtBxlB,EAAQ2V,EAAQ3V,MAEhBo4C,GAAUziC,EAAQ3e,IAAMsrB,GAAUsK,EAClC0rB,EAASvhD,KAAKoC,KAAKwc,EAAQxc,IAAMmpB,EAAS,GAAKsK,EAAOwrB,EAAS,GAE/D9pB,EAASzY,EAAKuY,aAAe3T,EAAM/X,QAAU,GAE7CF,EAAQ,KACRosB,EAAQ,KAZmCg2B,EAc5B/D,EAAehrC,EAAM4E,GAdOoqC,EAAAnM,EAAAkM,EAAA,GAc1C9D,EAd0C+D,EAAA,GAcpC7D,EAdoC6D,EAAA,GAe3CC,EAAW,EAAMx2B,GAAW0yB,EAAOF,GACnCK,GAAa,EAAMnhD,EAAS8gD,IAASE,EAAKF,GAC1CiE,GAAO/kD,EAAS,EAAI8gD,GAASgE,EAAQ,CACzCl2B,IAAS53B,IAAK8pD,EAAM3nD,IAAK6nD,EAEzB,IAAInV,GAAOpxB,EAAM7X,SAAW6X,EAAMvX,QAAU,OAC5C,IAAIuX,EAAMtX,OAAQ,CACd,GAAIsoC,GAAOhxB,EAAM61B,SACZ7E,KACDA,GAAO,EAAAqW,EAAA/V,cAAa,GAAItxB,EAAMvX,OAAQuX,EAAMtX,OAAQsX,EAAMsnC,QAC1DtnC,EAAM61B,UAAY7E,EAGtB,IAAIxpC,GAAQk/C,EAAS1V,EAAKp4C,OAAQ,CAClC4O,GAAOw0C,EAAE6L,MAAM,EAAGrgD,EAAMwpC,EAAKp4C,OAAS,GACtCw4C,EAAOJ,EAAKxpC,GAKhB,MAFAO,GAAQ,GAAIq1C,GAAOmN,YAAY5M,EAASE,GAAQ,EAAGhqB,EAAOy2B,EAAIz2B,EAAQud,IAE9DrpC,EAAOosB,GAGnB,QAAS8rB,GAAcxE,EAAQrgC,EAAMF,EAAS8E,EAAO2T,GACjD,GAAIxB,GAAQ/W,EAAKvB,QAAQsY,MACrBtK,EAASzM,EAAKvB,QAAQkR,UAEtBxuB,EAAM2e,EAAQ3e,IACdmC,EAAMwc,EAAQxc,IACdi/C,GAAUziC,EAAQ3e,IAAMsrB,GAAUsK,EAClC0rB,EAASvhD,KAAKoC,KAAKwc,EAAQxc,IAAMmpB,EAAS,GAAKsK,EAAOwrB,EAAS,GAE/D9pB,EAAmE,GAAzDzY,EAAKuY,aAAe3T,EAAM/X,QAAU0rB,GAAe,IAE7D5rB,EAAQ,KAERyiD,EAAStvC,EAAQvY,IACjBA,EAAM6nD,EACNC,EAAWvvC,EAAQnY,MACnBA,EAAQ0nD,EACRvK,GAAkB,EAAAvD,EAAAvH,kBAAiBp1B,EAAMmgC,cAEzCuK,IACJ,IAAIxvC,EAAQzY,MAAO,CACf,GAAIkoD,IAAM,EAAAC,EAAA/e,YAAW3wB,EAAQzY,MAC7BE,GAAM,GACNI,EAAQ,EACR,IAAIy3B,GAAS,CAEbmwB,GAAInwC,QAAQ,SAAAqwC,GACR,GAAc,MAAVA,EAAGxb,GACH1sC,GAAO6nD,EAAOp9C,OAAOotB,EAAQqwB,EAAG/9C,KAChC/J,GAAS0nD,EAASr9C,OAAOotB,EAAQqwB,EAAG/9C,KACpC0tB,GAAUqwB,EAAG/9C,QACV,IAAc,MAAV+9C,EAAGxb,GACV1sC,GAAO,IAAImoD,OAAOD,EAAG/9C,KACrB/J,GAAS,IAAI+nD,OAAOD,EAAG/9C,SACpB,IAAc,MAAV+9C,EAAGxb,GAAY,CACtB,GAAI0b,GAAQP,EAAOp9C,OAAOotB,EAAQqwB,EAAG/9C,KACjCk+C,EAAK,GAAI5N,GAAOgM,gBAChB,GAAIhM,GAAOgD,cAAczC,EAAUh7C,EAAI/J,OAAOu5B,EAAQ,EAAG,IAAK,EAAG/W,EAAKvB,QAAQ2Q,WAAb,GACjE,EAAG,GAAI,EAEP01B,KACA8K,EAAK,GAAI5N,GAAOE,cAAc7B,EAAQuP,EAAID,GAAO,EAAO,SAAU,QAAS,mBAC/EC,EAAG9vC,SAAW5V,MAAO,cAAgBylD,EAAO7nD,KAAM,YAAa+0C,OAAQ,aACvEyS,EAAO5uD,KAAKkvD,GAEZxwB,GAAUqwB,EAAG/9C,QACI,MAAV+9C,EAAGxb,GACV7U,GAAUqwB,EAAG/9C,IAEbsB,QAAQC,IAAI,gBAAkBw8C,EAAGxb,MAK7C,GAAI2R,GAASC,EAAU7lC,EAAM7e,EAAKmC,EAClC,IAAIiE,GAAOq+C,IACe,aAArBhhC,EAAMirC,YACe,iBAArBjrC,EAAMirC,YAAgC,CAGvC,IAAK,GAFDC,MACAvb,EAAgC,MAAxBz0B,EAAQzV,YAAsB,IAAM,IACvCpN,EAAI,EAAGA,EAAIsK,EAAI/J,SAAUP,EAC9B6yD,EAAYpvD,KAAK6G,EAAItK,IAAM2oD,EAAO3oD,GAAKs3C,EAAQhtC,EAAItK,GAEvDsK,GAAMuoD,EAAY9T,KAAK,IAG3B,GAAI+T,GAAsC,MAAxBjwC,EAAQzV,YAChBua,EAAMorC,aAAe,eACrBprC,EAAMqrC,YAAc,aA2B9B,OAzBIrrC,GAAMsrC,iBACNvoD,GAAQ,GAEZgF,EAAQ,GAAIq1C,GAAOmO,cACfnwC,EAAKvB,QAAQ2Q,WACb2gC,EACAxN,EACAE,EACAhqB,EACAlxB,EACAq+C,EACAhhC,EAAMirC,WACNloD,IACC,EAAA45C,EAAAvH,kBAAiBp1B,EAAMwrC,WACxBpwC,EAAKooC,eAGLtD,IACAn4C,EAAQ,GAAIq1C,GAAOgM,gBAAgBrhD,EAAO,EAAG,IAE7C2iD,EAAO9xD,OAAS,IAChB8xD,EAAOx6C,OAAO,EAAG,EAAGnI,GACpBA,EAAQ,GAAIq1C,GAAOC,WAAWqN,IAG3B3iD,EAGX,QAASg6C,GAAalyC,EAAUmQ,EAAO5E,EAAMqwC,GACzCA,EAASA,GAAU,CAEnB,IAAI5jC,GAASzM,EAAKvB,QAAQkR,UAAWoH,EAAQ/W,EAAKvB,QAAQsY,MACtD0B,EAASzY,EAAKuY,aAAe3T,EAAM/X,QAAU,GAC7C1L,EAAM6e,EAAKkrC,SAAStmC,GACpBthB,EAAM0c,EAAKorC,SAASxmC,IAGpB,EAAA28B,EAAAvH,kBAAiBp1B,EAAMwpC,WAEvBjtD,EAAmC,IAA7B6e,EAAKquC,0BAEX,EAAA9M,EAAAvH,kBAAiBp1B,EAAM0pC,WACvBhrD,EAAmC,KAA7B0c,EAAKuuC,wBAGf,IAAIU,GAAW,EAAMx2B,GAAWn1B,EAAMnC,GAClCmJ,EAAQsa,EAAM7X,SAAW6X,EAAMvX,QAAU,QAEzCijD,EAAW,EACXC,EAAU,KAEVC,KACAC,KAEAC,EAAY,IAEhBj8C,GAAS2K,QAAQ,SAAAliB,GACb,GAAIyzD,MAAe,EAANzzD,EAAEiE,MAAgB,EAANjE,EAAEoG,MAAU,EAAKmpB,GAAUsK,EAChDm4B,GAAOhyD,EAAEiN,MAAS,EAAIhJ,GAAQ8tD,EAAQ,GAItC,EAAA1N,EAAAvH,kBAAiBp1B,EAAMgsC,WACvBL,EAAUrzD,EAAEiN,MAAQ,EAAI,GAAK,EAEzBomD,IAAYD,IACZG,EAAe/vD,MACXwsD,OAAQsD,EACRlmD,MAAoB,IAAbgmD,EACH1rC,EAAMisC,SACJjsC,EAAMksC,WAEhBN,KAGAA,EAAe9vD,KAAKgwD,IAExBJ,EAAWC,GAEXA,EAAU,CAGd,IAAIQ,GAAMt4B,EAAUy2B,EAAKqB,EAAYF,CACrCK,IAAa5lD,EAAG6lD,EAAI1b,EAAG8b,GACvBP,EAAe9vD,KAAKgwD,MAKpB,EAAAnP,EAAAvH,kBAAiBp1B,EAAMgsC,YACvBtmD,EAAoB,IAAZimD,EAAgB3rC,EAAMisC,SAAWjsC,EAAMksC,UAEnDL,EAAe/vD,MACXwsD,OAAQsD,EACRlmD,MAAOA,GAIX,IAAI0mD,GAAOP,EAAe5lD,IAAI,SAAAomD,GAC1B,GAAIC,GAAM,GAAIlP,GAAOmP,eAAeF,EAAG/D,OAAQ+D,EAAG3mD,MAAOmuB,EAMzD,OALAy4B,GAAIn4B,OAAS53B,IAAAA,EAAKmC,IAAAA,GAEdshB,EAAM1X,SACNgkD,EAAIpP,OAAsB,EAAbl9B,EAAM1X,QAEhBgkD,GAGX,OAAOF,GAGX,QAASzK,GAAgB9xC,EAAUuL,GAO/B,IAAK,GAND6Q,MAEAugC,KACAC,KAEEt6B,EAAQ/W,EAAKvB,QAAQsY,MAAOtK,EAASzM,EAAKvB,QAAQkR,UAC/CrY,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAMwI,GAAUrL,EAAS6C,GACnBsN,EAAQ5E,EAAKqhC,gBAAgBvhC,GAC/B3V,EAAwB,EAAhB2V,EAAQ3V,MAEhBsuB,EAASzY,EAAKuY,aAAe3T,EAAM/X,QAAU,GAC3C++C,EAAiBnzB,EAAS,EAAMA,EAEhCt3B,EAAM2e,EAAQ3e,IACdmC,EAAMwc,EAAQxc,IAEdi/C,GAAUphD,EAAMsrB,GAAUsK,EAC1ByrB,GAAcl/C,EAAMmpB,EAAS,GAAKsK,EAClC0rB,EAASvhD,KAAKoC,IAAIk/C,EAAWD,EAAS,GAIxC0I,EAAOjrC,EAAKkrC,SAAStmC,GACrBumC,EAAOnrC,EAAKorC,SAASxmC,EASrBumC,GAPCA,EAOa,EAAPA,EANI,EAAPF,EACO,EAEA,GASXA,EAHCA,EAGa,EAAPA,EAFA,CAKX,IAAIqG,EASJ,IARInnD,GAAS,GACTmnD,EAAcF,EAAUjwD,IAAQ,EAChCiwD,EAAUjwD,GAAOmwD,EAAcnnD,IAE/BmnD,EAAcD,EAAUlwD,IAAQ,EAChCkwD,EAAUlwD,GAAOmwD,EAAcnnD,KAG/BmnD,EAAcnG,GAAsBF,EAAdqG,GAA1B,CAK0BrG,EAAtBqG,EAAcnnD,IACdA,EAAQ8gD,EAAOqG,GAEfA,EAAcnnD,EAAQghD,IACtBhhD,EAAQghD,EAAOmG,EAGnB,IAAIC,IAAepnD,EAAQmnD,EAAcrG,IAASE,EAAOF,GACrDuG,GAAiBF,EAAcrG,IAASE,EAAOF,GAC/CwG,EAAcvwD,KAAKoC,IAAIkuD,EAAeD,GACtCG,EAAcxwD,KAAKC,IAAIqwD,EAAeD,EAE1C94B,IAAUg5B,EAAcC,GAAe9F,CACvC,IAAI3W,IAAK,EAAMwc,GAAe7F,EAE1BpI,EAAS5+B,EAAM7X,SAAW,KAC1BipC,EAAOpxB,EAAMhY,SAAWgY,EAAMvX,QAAU,OACxCuX,GAAM6gC,QAAU3lC,EAAQtV,UACxBwrC,EAAOl2B,EAAQtV,QACnB,IAAMgtC,GAAQ5yB,EAAMgqC,MAAS,EAAMhqC,EAAMgqC,MAAS,KAE9CtjD,EAAK,GAAI02C,GAAOsD,SAAS/C,EAAQtN,EAAIwN,EAASF,EAAS9pB,EAAQud,EAAMwN,EAAQhM,EACjFlsC,GAAK,GAAI02C,GAAOgM,gBAAgB1iD,EAAI,EAAG,EAAGsgD,GAC1CtgD,EAAGwU,QAAUA,EACbxU,EAAGytB,OACC53B,IAAK8pD,EAAM3nD,IAAK6nD,GAEhBvmC,EAAM1X,SACN5B,EAAGw2C,OAAwB,EAAfl9B,EAAM1X,QAEtB2jB,EAAOnwB,KAAK4K,IAGhB,MAAOulB,GAIX,QAAS8gC,GAAmB3xC,EAAMyY,GAAsB,GAAdjK,GAAc05B,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,IAAP,EACzClnC,EAAQ,EAEZhB,GAAKirB,aAAaxS,OAASA,EAC3BzY,EAAKirB,aAAajqB,MAAQwN,EAAe,EAANxN,EAAUA,EAC7ChB,EAAKirB,aAAarmB,MAAM6T,OAAS,IAAMjK,EAASiK,EAAO,EAAIA,GAAU,KACrEzY,EAAKirB,aAAarmB,MAAM5D,MAAQ,GAAKA,EAAQ,KAC7ChB,EAAKirB,aAAarmB,MAAMC,QAAU,OAElC,IAAIw7B,GAASrgC,EAAKirB,aAAaqV,WAAW,KAM1C,OAJI9xB,IACA6xB,EAAOtpB,MAAM,EAAG,GAGbspB,EAGX,QAAS32B,GAAW22B,EAAQrgC,EAAM+Y,EAAO64B,GACrCvR,EAAOsK,MAEP,IAAIzgB,GAAIlqB,EAAKirB,aAAaxS,OACtBo5B,EAAI,IAEJC,GAAc5nB,EAAiB,EAAblqB,EAAK2e,SAAaizB,EACpCG,GAAeh5B,EAAMz1B,IAAMy1B,EAAM53B,KAAOywD,CAc5C,IAZAvR,EAAO6J,UAAY,QACnB7J,EAAO2R,YAAc,GACa,SAA9BhyC,EAAKvB,QAAQ+K,cACb62B,EAAO8J,SAAS0H,EAAE,GAAI,EAAG,GAAI3nB,EAAiB,EAAblqB,EAAK2e,SAEtC0hB,EAAO8J,SAAS,EAAG,EAAG,GAAIjgB,EAAiB,EAAblqB,EAAK2e,SAEvC0hB,EAAO2R,YAAc,EAErB3R,EAAO4R,YAAc,QACrB5R,EAAO6R,UAAY,EACnB7R,EAAO8R,YAC2B,SAA9BnyC,EAAKvB,QAAQ+K,cAA0B,CACvC62B,EAAO+R,OAAOP,EAAI,EAAG7xC,EAAK2e,SAC1B0hB,EAAOgS,OAAOR,EAAG7xC,EAAK2e,SACtB0hB,EAAOgS,OAAOR,EAAG3nB,EAAIlqB,EAAK2e,SAC1B0hB,EAAOgS,OAAOR,EAAI,EAAG3nB,EAAIlqB,EAAK2e,QAE9B,KAAK,GAAIliC,GAAI,EAAOm1D,EAAK,EAATn1D,EAAYA,IAAK,CAC7B,GAAI61D,GAAK71D,EAAEq1D,CACXzR,GAAO+R,OAAOP,EAAGS,GACjBjS,EAAOgS,OAAOR,EAAI,EAAGS,QAEtB,CACHjS,EAAO+R,OAAO,EAAGpyC,EAAK2e,SACtB0hB,EAAOgS,OAAO,EAAGryC,EAAK2e,SACtB0hB,EAAOgS,OAAO,EAAGnoB,EAAIlqB,EAAK2e,SAC1B0hB,EAAOgS,OAAO,EAAGnoB,EAAIlqB,EAAK2e,QAE1B,KAAK,GAAI4zB,GAAI,EAAOX,EAAK,EAATW,EAAYA,IAAK,CAC7B,GAAIC,GAAKD,EAAET,CACXzR,GAAO+R,OAAO,EAAGI,GACjBnS,EAAOgS,OAAO,EAAGG,IAOzB,GAJAnS,EAAOmD,SAEPnD,EAAO6J,UAAY,QAEe,SAA9BlqC,EAAKvB,QAAQ+K,cAA0B,CACvC62B,EAAOoS,UAAY,QACnBpS,EAAOqS,UAAS,EAAAC,EAAAx/B,kBAAiB4F,EAAMz1B,KAAMuuD,EAAE,EAAG,GAClDxR,EAAOqS,UAAS,EAAAC,EAAAx/B,kBAAiB4F,EAAM53B,KAAM0wD,EAAE,EAAG3nB,EAAIlqB,EAAK2e,QAE3D,KAAK,GAAIi0B,GAAI,EAAOhB,EAAK,EAATgB,EAAYA,IAAK,CAC7B,GAAIC,GAAKD,EAAEd,CACXzR,GAAOqS,UAAS,EAAAC,EAAAx/B,kBAAkB,EAAI4F,EAAMz1B,IAAQsvD,EAAEb,GAAeF,EAAI,EAAGgB,EAAK,QAElF,CACHxS,EAAOoS,UAAY,OACnBpS,EAAOqS,UAAS,EAAAC,EAAAx/B,kBAAiB4F,EAAMz1B,KAAM,EAAG,GAChD+8C,EAAOqS,UAAS,EAAAC,EAAAx/B,kBAAiB4F,EAAM53B,KAAM,EAAG+oC,EAAIlqB,EAAK2e,QAEzD,KAAK,GAAIm0B,GAAI,EAAOlB,EAAK,EAATkB,EAAYA,IAAK,CAC7B,GAAIC,GAAKD,EAAEhB,CACXzR,GAAOqS,UAAS,EAAAC,EAAAx/B,kBAAkB,EAAI4F,EAAMz1B,IAAQwvD,EAAEf,GAAe,EAAGgB,EAAK,IAIrF1S,EAAOW,UVu5KXd,OAAO8S,eAAe11D,EAAS,cAC3BsK,OAAO,IAEXtK,EAAQosB,WAAapsB,EAAQq0D,mBAAqBr0D,EAAQ8sD,cAAgB9sD,EAAQssD,aAAetsD,EAAQyjD,MAAQzjD,EAAQwjD,gBAAkBxjD,EAAQojD,gBAAkBpjD,EAAQ2gC,SAAW3gC,EAAQskC,WAAaj8B,MAE7M,IAAIk9C,GAAiB,WAAc,QAASoQ,GAAcC,EAAKj2D,GAAK,GAAIk2D,MAAeC,GAAK,EAAUC,GAAK,EAAWC,EAAK3tD,MAAW,KAAM,IAAK,GAAiC4tD,GAA7BC,EAAKN,EAAIn4C,OAAOC,cAAmBo4C,GAAMG,EAAKC,EAAGt/B,QAAQC,QAAoBg/B,EAAKzyD,KAAK6yD,EAAG3rD,QAAY3K,GAAKk2D,EAAK31D,SAAWP,GAA3Dm2D,GAAK,IAAoE,MAAOj2C,GAAOk2C,GAAK,EAAMC,EAAKn2C,EAAO,QAAU,KAAWi2C,GAAMI,EAAG,WAAWA,EAAG,YAAe,QAAU,GAAIH,EAAI,KAAMC,IAAQ,MAAOH,GAAQ,MAAO,UAAUD,EAAKj2D,GAAK,GAAIg8C,MAAMwa,QAAQP,GAAQ,MAAOA,EAAY,IAAIn4C,OAAOC,WAAYklC,QAAOgT,GAAQ,MAAOD,GAAcC,EAAKj2D,EAAa,MAAM,IAAIy2D,WAAU,4DU7sNtlBjM,EAAAzqD,EAAA,qBAEAwjD,EAAAxjD,EAAA,sBAGAgsD,EAAAhsD,EAAA,cAEAopD,EAAAppD,EAAA,cAGA22D,EAAA32D,EAAA,eAAYglD,EV+sNCjC,EAAwB4T,GU7sNrCpS,EAAAvkD,EAAA,YAIAivD,EAAAjvD,EAAA,cAEAwyD,EAAAxyD,EAAA,cAEA21D,EAAA31D,EAAA,gBAEA42D,EAAA52D,EAAA,SAAY4jD,EV+sNJb,EAAwB6T,EAMhCt2D,GUjtNSskC,WAAAA,EVktNTtkC,EUjtNS2gC,SAAAA,EVktNT3gC,EUjtNSojD,gBAAAA,EVktNTpjD,EUjtNSwjD,gBAAAA,EVktNTxjD,EUjtNSyjD,MAAAA,EVktNTzjD,EUjtNSssD,aAAAA,EVktNTtsD,EUjtNS8sD,cAAAA,EVktNT9sD,EUjtNSq0D,mBAAAA,EVktNTr0D,EUjtNSosB,WAAAA,IVs7PNmqC,aAAa,EAAEC,aAAa,EAAEC,WAAW,GAAGC,oBAAoB,GAAGC,cAAc,GAAG3pC,eAAe,GAAG4pC,qBAAqB,GAAGC,aAAa,GAAGC,aAAa,GAAGC,MAAQ,MAAMC,IAAI,SAASt3D,EAAQU,EAAOJ,GWl9P3M,YA6LA,SAASi3D,GAAqBj0C,EAAO6H,EAASoZ,GAE1C,QAASizB,KACDjzB,GACAkzB,EAASp0C,UAAY,mBACrB8H,EAAQvD,MAAMC,QAAU,UAExB4vC,EAASp0C,UAAY,oBACrB8H,EAAQvD,MAAMC,QAAU,QAPhC,GAAI4vC,GAAW91C,EAAY,IAU3B61C,KAEAC,EAASzvC,iBAAiB,QAAS,SAASvJ,GACxCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBoc,GAAWA,EACXizB,MACD,EAEH,IAAIE,GAAU/1C,EAAY,MAAO81C,EAAU,IAAKn0C,OAAauE,QAAS,QAASuZ,WAAY,OAAQ9zB,MAAO,QAAS0W,MAAO,OAAQ2d,QAAS,UAAWhc,OAAQ,OAC9J,OAAOhE,GAAY,OAAQ+1C,EAASvsC,OA/MxC,GAAwB,mBAAbnrB,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,YACpBE,EAAiBxV,EAAMwV,cAG/BH,GAAQvb,UAAUuiB,gBAAkB,WAChC7G,EAAerb,KAAKy3B,cACpBpc,EAAerb,KAAKmxD,cAGxBj2C,EAAQvb,UAAUyd,YAAc,SAASg0C,EAAKC,GAE1C,GAGIC,GAHAC,GAAO,EACPzvD,EAAQ9B,KACRwxD,EAAQ,IAEZF,GAAc,SAASr5C,GACnBs5C,GAAO,EACHC,IACAn3C,aAAam3C,GACbA,EAAQ,MAEZJ,EAAIjtC,oBAAoB,WAAYmtC,GAAa,GAGrD,IAAIG,GAAQ,QAARA,GAAiBx5C,GACjB,GAAIy5C,GAAKz5C,EAAGqjB,QAAU9O,OAAOmlC,QAASC,EAAK35C,EAAGwjB,QAAUjP,OAAOqlC,OAC1DL,KACDA,EAAQv3C,WAAW,WACf,GAAI63C,EAEAA,GADiB,kBAAVT,GACDA,IAEAA,CAGV,IAAIU,GAAQ52C,EAAY,OACnBA,EAAY,MAAO,MAAO0B,UAAW,kBACrC1B,EAAY,MAAO22C,GAAMj1C,UAAW,oBACpCA,UAAW,sBACZwE,QAAS,QACTmV,IAAK,IAAMo7B,EAAK,IAAM,KACtBj2B,KAAM,GAAKj+B,KAAKoC,IAAI4xD,EAAK,GAAI,IAAM,MAEvC5vD,GAAM21B,aAAazb,YAAY+1C,EAC/B,IAAIC,EACJA,GAAc,SAAS/5C,GACnB,IACInW,EAAM21B,aAAa/S,YAAYqtC,GACjC,MAAO/4D,IAGTwzB,OAAOrI,oBAAoB,YAAa6tC,GAAa,GACjDT,IACwB,MAApBH,EAAIa,cAEJR,EAAMx5C,KAIlBuU,OAAOhL,iBAAiB,YAAawwC,GAAa,GAClDR,EAAQ,MACT,MAIXJ,GAAI5vC,iBAAiB,YAAa,SAASvJ,GACvCs5C,GAAO,EACPH,EAAI5vC,iBAAiB,WAAY8vC,GAAa,GAC9CG,EAAMx5C,KACP,GACHm5C,EAAI5vC,iBAAiB,6BAA8B,SAASvJ,GACxDs5C,GAAO,EACHC,IACAn3C,aAAam3C,GACbA,EAAQ,QAEb,IAGPt2C,EAAQvb,UAAUuyD,MAAQ,SAASj6C,EAAInb,EAAMs0D,EAAK3vD,GAE9C,GAAIK,GAAQ9B,IACPyB,KACDA,MACCwW,IACDA,KAEJ,IAEIy5C,GAAIE,EAFJp0C,EAAQ/b,EAAK+b,OAAS,GAI1B,IAAIvF,EAAGqjB,QACH,GAAIo2B,GAAMz5C,EAAGqjB,QAASs2B,EAAK35C,EAAGwjB,YAE9Bi2B,GAAK,IAAKE,EAAI,EAElBF,IAAO51C,SAASq2C,gBAAgBC,YAAct2C,SAAS4b,KAAK06B,WAC5DR,GAAO91C,SAASq2C,gBAAgBt+B,WAAa/X,SAAS4b,KAAK7D,SAC3D,IAAIw+B,GAAW7lC,OAAO8lC,WAElB97B,EAAMo7B,EACNj2B,EAAOj+B,KAAKC,IAAI+zD,EAAMl0C,EAAM,EAAK,EAAI60C,EAAW70C,EAAQ,IAExDu0C,EAAQ52C,EAAY,MAcxB,IAbA42C,EAAMl1C,UAAY,iBAAmB5E,EAAGqjB,QAAU,UAAY,IAAM,KACpEy2B,EAAM3wC,MAAMC,QAAU,QACtB0wC,EAAM3wC,MAAMmxC,SAAW,WACvBR,EAAM3wC,MAAMoV,IAAM,GAAKA,EAAM,KAC7Bu7B,EAAM3wC,MAAMua,KAAO,GAAKA,EAAO,KAC/Bo2B,EAAM3wC,MAAM5D,MAAQA,EAAQ,KACxBA,EAAQ,MAERu0C,EAAM3wC,MAAMoxC,SAAWh1C,EAAQ,MAGnCu0C,EAAM/1C,YAAYb,EAAY,MAAO,MAAO0B,UAAW,WAEnD/f,EAAM,CACN,GAAI21D,GAAct3C,EAAY,SAAU,IAAK0B,UAAW,SACxD41C,GAAYC,UAAY,UAExBD,EAAYjxC,iBAAiB,YAAa,SAASvJ,GAC/Cw6C,EAAYrxC,MAAMta,MAAQ,QAC3B,GACH2rD,EAAYjxC,iBAAiB,WAAY,SAASvJ,GAC9Cw6C,EAAYrxC,MAAMta,MAAQ,UAC3B,GACH2rD,EAAYjxC,iBAAiB,QAAS,SAASvJ,GAC3CA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxB7f,EAAMogB,oBACP,EACH,IAEIywC,GAAQC,EACRC,EAAaC,EAHbC,EAAO53C,EAAY,MAAOA,EAAY,OAAQre,EAAM,MAAO01D,SAAU,UAAWC,OAAkDO,YAAa,OAAQC,aAAc,QAIzKJ,GAAc,SAAS56C,GACnBA,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBia,GAAe1jB,EAAGqjB,QAAUq3B,EACjB,EAAPh3B,IACAA,EAAO,GACLA,EAAQ02B,EAAW70C,EAAQ,KAC7Bme,EAAQ02B,EAAW70C,EAAQ,IAE/BgZ,GAAave,EAAGwjB,QAAUm3B,EAC1Bp8B,EAAM94B,KAAKoC,IAAI,GAAI02B,GACnBu7B,EAAM3wC,MAAMoV,IAAM,GAAKA,EAAM,KAC7Bu7B,EAAM3wC,MAAMua,KAAO,GAAKj+B,KAAKC,IAAIg+B,EAAO02B,EAAW70C,EAAQ,IAAO,KAClEm1C,EAAS16C,EAAGqjB,QAASs3B,EAAS36C,EAAGwjB,SAErCq3B,EAAY,SAAS76C,GACjBA,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB8K,OAAOrI,oBAAoB,YAAa0uC,GAAa,GACrDrmC,OAAOrI,oBAAoB,UAAW2uC,GAAW,IAErDC,EAAKvxC,iBAAiB,YAAa,SAASvJ,GACxCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBgxC,EAAS16C,EAAGqjB,QAASs3B,EAAS36C,EAAGwjB,QACjCjP,OAAOhL,iBAAiB,YAAaqxC,GAAa,GAClDrmC,OAAOhL,iBAAiB,UAAWsxC,GAAW,KAC/C,GAGHf,EAAM/1C,YAAY+2C,GAGtBhB,EAAM/1C,YAAYb,EAAY,MAAOi2C,GAAMv0C,UAAW,oBAClDse,QAAS,SAEbn7B,KAAKy3B,aAAazb,YAAY+1C,EAE9B,IAAImB,IACAz8C,KAAMs7C,EACN9vC,WAAW,EAOf,OALA8vC,GAAMvwC,iBAAiB,iBAAkB,SAASvJ,GAC1CA,EAAGyqB,QAAUqvB,IACbmB,EAAYjxC,WAAY,KAE7B,GACIixC,GA0BY,mBAAZh5D,KACPA,EAAOJ,SACHi3D,qBAAsBA,MXy9P3BrqC,aAAa,EAAEzc,UAAU,KAAKkpD,IAAI,SAAS35D,EAAQU,EAAOJ,GYvrQ7D,YZosQA,SAASyiD,GAAwB9kC,GAAO,GAAIA,GAAOA,EAAI+kC,WAAc,MAAO/kC,EAAc,IAAIglC,KAAa,IAAW,MAAPhlC,EAAe,IAAK,GAAIrJ,KAAOqJ,GAAWilC,OAAO/8C,UAAUg9C,eAAe5iD,KAAK0d,EAAKrJ,KAAMquC,EAAOruC,GAAOqJ,EAAIrJ,GAAgC,OAAtBquC,GAAAA,WAAiBhlC,EAAYglC,EY9rQlQ,QAASre,GAAW9kB,EAAQkD,GACxBie,EAASje,GACTA,EAAKogC,aAAatjC,GAGtB,QAASmhB,GAASje,GACd,GAAIqgC,GAASrgC,EAAKgf,SAASshB,WAAW,MAClC9xB,EAASxO,EAAKvB,QAAQ+P,QAAUwB,OAAOqc,iBAAmB,CAC1D7d,IACA6xB,EAAOtpB,MAAM,EAAG,EAGpB,IAAItiB,GAAWuL,EAAKuqB,gBAChB6Q,EAAWp7B,EAAKugC,eAChBvgC,GAAKyf,eACL1U,EAAgB01B,YAAYzgC,EAAMo7B,GAC3B3mC,EACPsW,EAAgB21B,gBAAgB1gC,EAAMqgC,GAEtCrtC,QAAQC,IAAI,oCAGZ+M,EAAKwY,UACLzN,EAAgB+1B,gBAAgB9gC,EAAMqgC,EAAQ7xB,GAAQ,GAG1DxO,EAAKsoB,cACLtoB,EAAK0J,aAEuC,kBAAjC1J,GAAKgH,UAAUi6B,cACtBjhC,EAAKgH,UAAUi6B,aAAaZ,EAAQrgC,GAGxCA,EAAKqjB,WAAa,EAClBrjB,EAAKvB,QAAQwZ,eZmpQjBioB,OAAO8S,eAAe11D,EAAS,cAC3BsK,OAAO,IAEXtK,EAAQ2gC,SAAW3gC,EAAQskC,WAAaj8B,MY5rQxC,IAAAixD,GAAA55D,EAAA,sBAAY+tB,EZgsQUg1B,EAAwB6W,EAI9Ct5D,GYlsQSskC,WAAAA,EZmsQTtkC,EYnsQqB2gC,SAAAA,IZ2uQlBmP,qBAAqB,KAAKypB,IAAI,SAAS75D,EAAQU,EAAOJ,GavuQzD,YAMA,SAASw5D,GAAgBnqB,EAAKoqB,GAI1B,MAHIpqB,GAAInsC,QAAQ,KAAO,IACnBmsC,GAAY,cAET,GAAItxB,GAAQ,SAAS27C,EAAQ3kC,GAChC,GAAI9V,GAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACrB,GAAsB,GAAlBL,EAAIM,WACJ,GAAIN,EAAIO,QAAU,IACduV,EAAO,cAAgB9V,EAAIO,YACxB,CACH,GAAIq3B,GAAO5P,KAAK56B,MAAM4S,EAAIuB,SAC1Bk5C,GAAOD,EAAO5iB,EAAOA,EAAKpkB,YAKtCxT,EAAIG,KAAK,MAAOiwB,GAAK,GACrBpwB,EAAII,iBAAiB,SAAU,oBAC/BJ,EAAIqB,aAAe,OACnBrB,EAAIW,SAIZ,QAAS+5C,GAAgB31D,GACrBkC,KAAK0zD,OAAS51D,EAelB,QAAS61D,GAAgB71D,EAAKyI,EAAOE,EAAKhF,GACjCA,IACoB,YAAjB,mBAAO8E,GAAP,YAAA2Q,EAAO3Q,KACP9E,EAAO8E,EACPA,EAAQpE,QAERV,MAIRzB,KAAKlC,IAAsB,gBAARA,GAAmB,GAAI21D,GAAgB31D,GAAOA,EACjEkC,KAAKuG,MAAQA,GAAS,EAClBE,IACAzG,KAAKyG,IAAMA,GAEfzG,KAAKyB,KAAOA,EAqHhB,QAAS0V,GAAgBtZ,GACrB,IAAKA,EACD,MAAO,KAIX,KAAK,GADD+D,GAAK,GAAI1F,YAAW2B,EAAO7D,QACtBP,EAAI,EAAGA,EAAImI,EAAG5H,SAAUP,EAC7BmI,EAAGnI,GAAKoE,EAAOuZ,WAAW3d,EAE9B,OAAOmI,GAAGS,ObwjQd,GAAI6U,GAA4B,kBAAXK,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAO5X,UAAY,eAAkB8X,GajvQtQ,IAAwB,mBAAbje,GACP,GAAIqe,GAAUre,EAAQ,eAAeqe,OA+BzC47C,GAAgB9zD,UAAUi0D,cAAgB,WACtC,MAAI5zD,MAAK6zD,YAAc7zD,KAAK8zD,mBAAqB7kD,KAAKC,MAC3ClP,KAAK6zD,YAEZ7zD,KAAK6zD,WAAaP,EAAgBtzD,KAAK0zD,QAAQ,GAAM56C,KAAK,SAAS63B,GAC/D,MAAOA,GAAKpkB,WAEhBvsB,KAAK8zD,mBAAqB7kD,KAAKC,MAAS,MACjClP,KAAK6zD,aAwBpBF,EAAgBh0D,UAAUlE,MAAQ,SAASrC,EAAGS,GAC1C,GAAQ,EAAJT,EACA,KAAM,aAAeA,CAGzB,IAAIkf,GAAKtY,KAAKuG,MAAOgS,EAAKvY,KAAKyG,GAW/B,OAVI6R,IAAMlf,EACNkf,GAAUlf,EAEVkf,EAAKlf,GAAKkf,EAGVC,EADA1e,GAAKye,EACAA,EAAKze,EAAI,EAET0e,GAAM1e,EAAI,EAEZ,GAAI85D,GAAgB3zD,KAAKlC,IAAKwa,EAAIC,EAAIvY,KAAKyB,OAGtDkyD,EAAgBh0D,UAAUiZ,YAAc,SAASrd,GAC7C,GAEIvB,GAFA62B,EAAO7wB,KACP+Y,EAAM,GAAIC,eAEd6X,GAAK/yB,IAAI81D,gBAAgB96C,KAAK,SAAShb,GAGnC,GAFAib,EAAIG,KAAK,MAAOpb,GAAK,GAEjB+yB,EAAKpqB,IAAK,CACV,GAAIoqB,EAAKpqB,IAAMoqB,EAAKtqB,MAAQ,IACxB,KAAM,gBAEVwS,GAAII,iBAAiB,QAAS,SAAW0X,EAAKtqB,MAAQ,IAAMsqB,EAAKpqB,KACjEzM,EAAS62B,EAAKpqB,IAAMoqB,EAAKtqB,MAAQ;CAGrCwS,EAAIK,mBAAqB,WACrB,MAAsB,IAAlBL,EAAIM,WAEO9d,EADO,KAAdwd,EAAIO,QAA+B,KAAdP,EAAIO,OACTP,EAAIQ,aAEJ,MAJxB,QAQAsX,EAAKpvB,KAAK+X,cACVT,EAAIU,iBAAkB,GAE1BV,EAAIW,SAvBRmX,SAwBS,SAASlX,GAEd,MADAnK,SAAQC,IAAIkK,GACLpe,EAAS,SAIxBo4D,EAAgBh0D,UAAUoL,OAAS,WAC/B,MAAO/K,OAGX2zD,EAAgBh0D,UAAUjE,MAAQ,SAASH,EAAUwe,EAASC,GAC1D,GAAI6W,GAAO7wB,IAGX,OADA+Z,GAAUA,GAAW,EACjBA,EAAU,EACHxe,EAAS,UAGpBs1B,GAAK/yB,IAAI81D,gBAAgB96C,KAAK,SAAUhb,GACpC,GACI9D,GADA+e,EAAM,GAAIC,eAId,IAFAD,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIoB,iBAAiB,sCACjB0W,EAAKpqB,IAAK,CACV,GAAIoqB,EAAKpqB,IAAMoqB,EAAKtqB,MAAQ,IACxB,KAAM,gBAEVwS,GAAII,iBAAiB,QAAS,SAAW0X,EAAKtqB,MAAQ,IAAMsqB,EAAKpqB,KACjEzM,EAAS62B,EAAKpqB,IAAMoqB,EAAKtqB,MAAQ,EAErCwS,EAAIqB,aAAe,cACnBrB,EAAIK,mBAAqB,WACrB,GAAsB,GAAlBL,EAAIM,WAAiB,CACrB,GAAkB,KAAdN,EAAIO,QAA+B,KAAdP,EAAIO,OAAe,CACxC,GAAIP,EAAIuB,SAAU,CACd,GAAIC,GAAKxB,EAAIuB,SAASre,UACtB,QAAIjC,GAAUA,GAAUugB,GAAQP,GAAmBO,GAAMP,EAG9Cze,EAASwd,EAAIuB,UAFbuW,EAAKn1B,MAAMH,EAAUwe,EAAU,EAAGQ,GAI1C,GAAIxB,EAAIyB,uBACX,MAAOjf,GAASwd,EAAIyB,uBAEpB,IAAIrhB,GAAI4f,EAAIQ,YACZ,QAAIvf,GAAUA,GAAUb,EAAEa,QAAYggB,GAAmB7gB,EAAEa,QAAUggB,EAG1Dze,EAAS4b,EAAgB4B,EAAIQ,eAF7BsX,EAAKn1B,MAAMH,EAAUwe,EAAU,EAAG5gB,EAAEa,QAMnD,MAAO62B,GAAKn1B,MAAMH,EAAUwe,EAAU,KAI9C8W,EAAKpvB,KAAK+X,cACVT,EAAIU,iBAAkB,GAE1BV,EAAIW,SAzCRmX,SA0CS,SAASlX,GACdnK,QAAQC,IAAIkK,MAgBG,mBAAZzf,KACPA,EAAOJ,SACHw5D,gBAAiBA,EACjBK,gBAAiBA,MbqvQtB/4C,cAAc,MAAMm5C,IAAI,SAASv6D,EAAQU,EAAOJ,Gct7QnD,YAcA,SAASk6D,GAAqBr8B,GAI1B,GAHAs8B,EAAkBl6D,KAAKiG,MACvBA,KAAK23B,OAASA,EACd33B,KAAKk0D,KAAOv8B,EAAOwR,KAAO,qBACM,IAA5BnpC,KAAKk0D,KAAKl3D,QAAQ,MAAa,CAC/B,GAAI2vB,GAAQH,OAAOD,SAASK,QACf,UAATD,GAA6B,UAATA,IAGpB3sB,KAAKk0D,KAAO,QAAUl0D,KAAKk0D,MAGnCl0D,KAAKm0D,QAAUx8B,EAAOw8B,SAAW,QAEN,gBAAhBx8B,GAAOrzB,KACdtE,KAAKsE,MAAQqzB,EAAOrzB,MAEpBtE,KAAKsE,KAAOqzB,EAAOrzB,OAAS,cA7BpC,GAAwB,mBAAb9K,GACP,GAAI6L,GAAK7L,EAAQ,oBACb46D,EAAyC/uD,EAAGgvD,6BAC5CJ,EAAoB5uD,EAAG4uD,kBAEvBzuD,EAAMhM,EAAQ,SACdiM,EAAgBD,EAAIC,cACpBC,EAAWF,EAAIE,SACfE,EAAaJ,EAAII,WACjBD,EAAWH,EAAIG,QAwBvBquD,GAAqBr0D,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WACjEq0D,EAAqBr0D,UAAU+X,YAAcs8C,EAE7CA,EAAqBr0D,UAAUqJ,cAAgB,SAASzN,GACpD,GAAI0N,GAAa,GAAIxD,GAEjBkE,EAAU,GAAIjE,EAClBiE,GAAQR,MAAQ,SACZnJ,KAAKsE,KAAKtH,QAAQ,SAAW,GAC7BiM,EAAWK,WAAWhF,KAAM,cAAe,KAAMqF,IACjD3J,KAAKsE,KAAKtH,QAAQ,SAAW,GAAKgD,KAAKsE,KAAKtH,QAAQ,eAAiB,IACrEiM,EAAWK,WAAWhF,KAAM,QAAS,KAAMqF,EAE/C,IAAI4qD,GAAW,GAAI7uD,EACnB6uD,GAASprD,MAAQ,MACjBorD,EAAShrD,QAAU,QACnBgrD,EAASnrD,QAAU,MACnBmrD,EAASlrD,OAAS,EAClBkrD,EAAS/qD,MAAO,EAChB+qD,EAAS9qD,OAAQ,EACjB8qD,EAAS7qD,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,OAAQ,KAAMiwD,EAGtC,IAAIC,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,SACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KAEjB+qD,EAASjrD,QAAU,OACnBN,EAAWK,WAAWhF,KAAM,YAAa+0C,OAAQ,kBAAmB,KAAMmb,EAG1E,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAASlL,UAAY,IACrBkL,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KAEjB+qD,EAASjrD,QAAU,OACnBN,EAAWK,WAAWhF,KAAM,YAAa+0C,OAAQ,oBAAqB,KAAMmb,EAG5E,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAASlL,UAAY,IACrBkL,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KAEjB+qD,EAASjrD,QAAU,OACnBN,EAAWK,WAAWhF,KAAM,YAAa+0C,OAAQ,qBAAsB,KAAMmb,EAG7E,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS7K,OAAS,EAClB6K,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KAEjB+qD,EAASjrD,QAAU,OACnBN,EAAWK,WAAWhF,KAAM,YAAa+0C,OAAQ,6BAA8B,KAAMmb,EAGrF,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KAEjB+qD,EAASjrD,QAAU,iBACnBirD,EAASlM,YAAc,QACvBr/C,EAAWK,WAAWhF,KAAM,aAAc,KAAMkwD,EAGhD,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,SACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASprD,QAAU,UACnBorD,EAASjrD,QAAU,MACnBN,EAAWK,WAAWhF,KAAM,QAAS+0C,OAAQ,kBAAmB,KAAMmb,EAGtE,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAASlL,UAAY,IACrBkL,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASprD,QAAU,UACnBorD,EAASjrD,QAAU,MACnBN,EAAWK,WAAWhF,KAAM,QAAS+0C,OAAQ,oBAAqB,KAAMmb,EAGxE,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAASlL,UAAY,IACrBkL,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASprD,QAAU,UACnBorD,EAASjrD,QAAU,MACnBN,EAAWK,WAAWhF,KAAM,QAAS+0C,OAAQ,qBAAsB,KAAMmb,EAGzE,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS7K,OAAS,EAClB6K,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASprD,QAAU,UACnBorD,EAASjrD,QAAU,MACnBN,EAAWK,WAAWhF,KAAM,QAAS+0C,OAAQ,6BAA8B,KAAMmb,EAGjF,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASprD,QAAU,UACnBorD,EAASjrD,QAAU,MACnBirD,EAASlM,YAAc,QACvBr/C,EAAWK,WAAWhF,KAAM,SAAU,KAAMkwD,EAGhD,IAAItrD,GAAW,GAAIxD,EASnB,OARAwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,SACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,GACvC3N,EAAS0N,IAIpB+qD,EAAqBr0D,UAAU80D,UAAY,WACvC,UAGJT,EAAqBr0D,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GAK/E,IAAK,GAJDuG,GAAQ9B,KACRlC,EAAMkC,KAAKk0D,KAAO,mBAAqBl0D,KAAKm0D,QAAU,IAAM3yD,EAAM,IAAM7D,EAAM,IAAMmC,EAEpFs4C,KACKvvC,EAAK,EAAGA,EAAK7I,KAAKsE,KAAKtK,SAAU6O,EACtCuvC,EAAQl7C,KAAK,WAAa8C,KAAKsE,KAAKuE,GAExCuvC,GAAQl7C,KAAK,iCACbY,EAAMA,EAAM,IAAMs6C,EAAQI,KAAK,IAE/B,IAAIz/B,GAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACxB,GAAsB,GAAlBL,EAAIM,WAIJ,GAHGvX,EAAM8yD,OACN9yD,EAAM+yD,iBAEL97C,EAAIO,QAAU,IAAK,CAChB,GAAIK,GAAM,cAAgBZ,EAAIO,MAC9B,KACI,GAAIw7C,GAAK/zB,KAAK56B,MAAM4S,EAAIuB,SACpBw6C,GAAGxmC,QACH3U,EAAMm7C,EAAGxmC,OAEf,MAAOuX,IAEftqC,EAASoe,EAAK,UACR,CAGN,IAAK,GAFDo7C,GAAKh0B,KAAK56B,MAAM4S,EAAIuB,UACpBrJ,KACK6C,EAAK,EAAGA,EAAKihD,EAAG/6D,SAAU8Z,EAAI,CACnC,GAAI/W,GAAIg4D,EAAGjhD,GAEPpM,KACAhO,EAAI,GAAIkM,EAON,IANNlM,EAAE6J,QAAU/B,EACZ9H,EAAEiE,IAAmB,EAAbZ,EAAA,MACRrD,EAAEoG,IAAiB,EAAX/C,EAAA,IACRrD,EAAE4K,KAAOvH,EAAEi4D,cAAgB,UAC3Bt7D,EAAE+N,GAAK1K,EAAEk4D,GAECl4D,EAAEm4D,OAAQ,CACV,GAAI1tD,GAAM,GAAI7B,EACd6B,GAAIC,GAAK1K,EAAEm4D,OACXx7D,EAAEiO,QAAUH,GAGZzK,EAAEmzC,SACEnzC,EAAEmzC,OAAS,EACXx2C,EAAEmN,YAAc,IACX9J,EAAEmzC,OAAS,IAChBx2C,EAAEmN,YAAc,MAGpB9J,EAAEo4D,mBACFz7D,EAAE2/C,OAASt8C,EAAEo4D,kBAEbp4D,EAAEq4D,cACF1tD,EAAMxK,KAAK,WAAaH,EAAEq4D,YAAY5c,KAAK,MACvCz7C,EAAEq4D,YAAYp7D,OAAS,IACnB+C,EAAEq4D,YAAY,GAAGp7D,QAAU+C,EAAEq4D,YAAY,GAAGp7D,QAA8B,KAApB+C,EAAEq4D,YAAY,MACpE17D,EAAE4K,KAAO,UAKjBoD,EAAM1N,OAAS,IACfN,EAAEgO,MAAQA,GAEpBuJ,EAAS/T,KAAKxD,GAElB6B,EAAS,KAAM0V,KAMrBnP,EAAM8yD,OACN9yD,EAAM+yD,iBAEN97C,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIqB,aAAe,OACnBrB,EAAIW,QAGRs6C,EAAqBr0D,UAAUq8C,aAAe,WAC1C,GAAMN,KAIN,OAHI17C,MAAKsE,MAAQtE,KAAKsE,KAAKtH,QAAQ,eAAiB,IAChD0+C,EAAK55B,QAAU,SAEZ45B,GAGXsY,EAAqBr0D,UAAUmiB,OAAS,SAASuzC,EAAO95D,GACpD,GAAMuC,GAASkC,KAAKk0D,KAAd,kBAAoCl0D,KAAKm0D,QAAzC,IAAoDkB,EAApD,iCACAt8C,EAAM,GAAIC,eAChBD,GAAIK,mBAAqB,WACrB,GAAsB,GAAlBL,EAAIM,WACJ,CAAA,GAAIN,EAAIO,QAAU,KAAOP,EAAIO,OAAS,IAAK,CACvC,GAAIK,GAAM,cAAgBZ,EAAIO,MAC9B,KACI,GAAIw7C,GAAK/zB,KAAK56B,MAAM4S,EAAIuB,SACpBw6C,GAAGxmC,QACH3U,EAAMm7C,EAAGxmC,OAEf,MAAOuX,IAET,MAAkB,MAAd9sB,EAAIO,OACG/d,MAEAA,EAAS,KAAMoe,GAE1B,GAAMg3B,GAAO5P,KAAK56B,MAAM4S,EAAIuB,UACtBzc,IAUN,OARI8yC,IAAQA,EAAK2kB,iBACbz3D,EAAOX,MACHqG,QAASotC,EAAK2kB,gBACd33D,IAAKgzC,EAAKpqC,MACVzG,IAAK6wC,EAAKlqC,MAIXlL,EAASsC,KAI5Bkb,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIqB,aAAe,OACnBrB,EAAIW,QAGR06C,EAAuC,UAAW,SAASz8B,GACvD,OAAQ1mB,SAAU,GAAI+iD,GAAqBr8B,Qdw7Q5C5tB,QAAQ,GAAGC,mBAAmB,KAAKurD,IAAI,SAAS/7D,EAAQU,EAAOJ,GAClE,Ye5uRA,IAAwB,mBAAbN,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,YAEpB6R,EAAOne,EAAQ,UACfg2B,EAAW7X,EAAK6X,SAEhBhqB,EAAMhM,EAAQ,SACdm9C,EAAiBnxC,EAAImxC,cAG7Bz7B,GAAQvb,UAAU61D,iBAAmB,SAAS/zD,GAC1CA,EAAOA,KAEP,IAAI8hB,IACA/hB,IAAKxB,KAAKwB,IACV2qB,UAA0B,EAAfnsB,KAAKmsB,UAChBC,QAAsB,EAAbpsB,KAAKosB,QACdxD,UAAW,aAAe4G,EAASvgB,KAAKC,OAExC6N,YAAa/c,KAAK+c,YAElBkL,QAASjoB,KAAKy1D,qBAEd5sC,OAAQ7oB,KAAK01D,eAMjB,OAHI11D,MAAKgoB,SACLzE,EAAOyE,OAAShoB,KAAKgoB,QAElBzE,GAGXrI,EAAQvb,UAAU+1D,aAAe,WAC7B,GAAInxD,MACAjE,EAAKN,KAAK6oB,UACd,KAAK,GAAIzX,KAAK9Q,GACViE,EAAG6M,GAAK9Q,EAAG8Q,GAAG87B,cAElB,OAAO3oC,IAGX2W,EAAQvb,UAAU81D,mBAAqB,SAASh0D,GAC5CA,EAAOA,KAGP,KAAK,GADDk0D,MACK9sD,EAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAI2T,GAAOxc,KAAK+iB,MAAMla,GAClB8uB,EAAS7xB,EAAY0W,EAAKgH,UAE1BmU,GAAOi+B,YAGXj+B,EAAOgJ,OAASx+B,OAChBw1B,EAAOgc,MAAQxxC,OACVw1B,EAAOE,WACRF,EAAOE,SAAW11B,QAElBqa,EAAK+G,OAAOta,YACZ0uB,EAAOvW,MAAQu1B,EAAen6B,EAAK+G,OAAOta,YAAYorC,OACtD1c,EAAOgjB,eAAiBx4C,QACjBw1B,EAAOvW,QACduW,EAAOvW,MAAQu1B,GAAgBtC,OAAQ1c,EAAOvW,QAAQizB,QAGzB,gBAAtB73B,GAAK+G,OAAOzmB,OACnB66B,EAAO76B,KAAO0f,EAAK+G,OAAOzmB,MAGHqF,SAAvBqa,EAAK+G,OAAO0R,SACZ0C,EAAO5C,YAAcvY,EAAK+G,OAAO0R,QAER9yB,SAAzBqa,EAAK+G,OAAOsyC,WACZl+B,EAAOk+B,SAAWr5C,EAAK+G,OAAOsyC,UAE9Br5C,EAAK+G,OAAOuyC,kBACZn+B,EAAOm+B,gBAAkBt5C,EAAK+G,OAAOuyC,iBACZ3zD,SAAzBqa,EAAK+G,OAAOwyC,WACZp+B,EAAOo+B,SAAWv5C,EAAK+G,OAAOwyC,UAEP5zD,SAAvBqa,EAAK+G,OAAO8T,SACZM,EAAON,OAAS7a,EAAK+G,OAAO8T,QAE5B7a,EAAK+G,OAAOyyC,kBACZr+B,EAAOq+B,gBAAkBx5C,EAAK+G,OAAOyyC,iBAEzCL,EAAaz4D,KAAKy6B,IAGtB,MAAOg+B,IAGXz6C,EAAQvb,UAAUs2D,mBAAqB,SAASx0D,GAC5CA,EAAOA,KACP,IAAI8jD,GAAW,4DAE4CvlD,KAAKmc,WAAW,2BAA6B,8FAE1C4kB,KAAKQ,UAAUvhC,KAAKw1D,iBAAiB/zD,GAAO,KAAM,GAAK,gHAQrH,OAAO8jD,Mf2uRR7+B,aAAa,EAAE3c,QAAQ,GAAG4Q,SAAS,GAAG1Q,UAAU,KAAKisD,IAAI,SAAS18D,EAAQU,EAAOJ,GgBx1RpF,YAkBA,SAASq8D,GAAuBt0C,EAAGwvC,EAAM/pD,EAAGmqC,GACxC5vB,EAAEqtC,SAASmC,EAAM/pD,EAAIua,EAAEu0C,YAAY/E,GAAM7zC,MAAOi0B,GAjBpD,GAAwB,mBAAbj4C,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElB2G,EAAIroB,EAAQ,YACZ6tD,EAAqBxlC,EAAEwlC,mBAEvBjsC,EAAK5hB,EAAQ,gBACbm2B,EAAmBvU,EAAGuU,iBACtBrU,EAAgBF,EAAGE,cAEnBoT,EAAUl1B,EAAQ,aAElB68D,EAAgB78D,EAAQ,mBAAmB68D,aAOnDn7C,GAAQvb,UAAU22D,YAAc,SAAS70D,GACrCA,EAAOA,KAEP,IAAIulD,GAAMvlD,EAAK+b,OAASxd,KAAKmpB,kBACzBgS,EAAU,EACVo7B,EAAO,GACP90D,EAAK+0D,QAAU/0D,EAAKg1D,UACpBF,EAAO,GAGX,IAAIG,GAAY12D,KAAKmpB,kBACjBwtC,EAAc32D,KAAKuzB,KACvBvzB,MAAKmpB,kBAAoB69B,EACzBhnD,KAAKuzB,MAAQvzB,KAAKmpB,mBAAqBnpB,KAAKosB,QAAUpsB,KAAKmsB,UAG3D,KAAK,GADDyqC,GAAYL,EACP1tD,EAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CACvCA,EAAK,IACL+tD,GAAaz7B,EACjB,IAAI3e,GAAOxc,KAAK+iB,MAAMla,EAMtB,IAJA2T,EAAKq6C,eAAiBr6C,EAAKwY,SAC3BxY,EAAKs6C,iBAAmBt6C,EAAKqjB,WAC7BrjB,EAAKu6C,mBAAqBv6C,EAAK+X,aAE3B/X,EAAKwY,SAAU,CACf,GAAMjN,GAAW/nB,KAAKk+B,gBAAgB1hB,EAKtC,IAJIuL,GAAYA,EAASm1B,iBACrBn1B,EAASm1B,gBAAgB1gC,EAAMA,EAAKgf,SAASshB,WAAW,OAGxDtgC,EAAKwY,SAAU,CAEf,IAAK,GADDiyB,GAAKzqC,EAAK2e,QACL/hC,EAAI,EAAGA,EAAIojB,EAAKwY,SAASh7B,SAAUZ,EACxC6tD,EAAKA,EAAKzqC,EAAKwY,SAAS57B,GAAG67B,OAASzY,EAAK2e,OAE7C8rB,IAAM,EACNzqC,EAAK+X,aAAe72B,KAAKoC,IAAImnD,EAAIjnD,KAAKmqB,gBAIpBhoB,SAAtBqa,EAAK+X,eACDqiC,GAAap6C,EAAK+X,cAE9B,GAAIyiC,GAAOv1D,EAAKw1D,sBAAwB,EACpC93C,EAAS,IAET+3C,GAAOlQ,EAAM7nC,GAAU63C,EAAM,EAC7BxkD,EAAMokD,EAAYI,EAAM,EACxB32D,EAAI8a,YAAY,SAAU,MAAOqC,MAAO05C,EAAIjiC,OAAQziB,IACpDqP,EAAIxhB,EAAEy8C,WAAW,KACrBj7B,GAAE6kC,UAAY,QACd7kC,EAAE8kC,SAAS,EAAG,EAAGuQ,EAAI1kD,GAErBqP,EAAE0R,MAAMyjC,EAAMA,GAEVv1D,EAAKg1D,SACL50C,EAAEslC,OACFtlC,EAAE6kC,UAAY,QACd7kC,EAAEs1C,KAAO,kBACTt1C,EAAEqtC,SACElvD,KAAKwB,IAAM,IAAM8Z,EAActb,KAAKmsB,WAAa,KAAO7Q,EAActb,KAAKosB,SAC3EjN,EAAS,IACT,IAEJ0C,EAAE27B,WAGF/7C,EAAK+0D,SACL30C,EAAEslC,OACFtlC,EAAE6kC,UAAY,QACd7kC,EAAEs1C,KAAO,kBACThB,EAAuBt0C,EAAG,8BAAgC6M,EAASvP,EAAS6nC,EAAM,IAAK,IACvFnlC,EAAE27B,WAGN37B,EAAEs1C,KAAO,iBAET,KAAK,GAAItuD,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EAAI,CAC3C,GAAI2T,GAAOxc,KAAK+iB,MAAMla,GAClBvO,GAAWkiB,EAAK4e,iBAAmBp7B,KAAKmsB,WAAWnsB,KAAKuzB,MAExDyb,EAAK,GAAIqY,EACbxlC,GAAEslC,OACFtlC,EAAEylC,UAAU,EAAGiP,GAEf10C,EAAEslC,OACFtlC,EAAE8sC,YACF9sC,EAAE+sC,OAAOzvC,EAAQ,GACjB0C,EAAEgtC,OAAO1vC,EAAS6nC,EAAK,GACvBnlC,EAAEgtC,OAAO1vC,EAAS6nC,EAAKxqC,EAAK+X,cAC5B1S,EAAEgtC,OAAO1vC,EAAQ3C,EAAK+X,cACtB1S,EAAEu1C,YACFv1C,EAAEw1C,OACFx1C,EAAEylC,UAAUnoC,EAAQ,GAEpB0C,EAAEslC,OACFtlC,EAAEylC,UAAUhtD,EAAQ,GAChBkiB,EAAKwY,SACLxY,EAAK+qC,eAAe1lC,EAAGmtB,EAAI10C,EAAS,KAGpC+7D,EAAc75C,EAAMA,EAAKugC,gBAAiBl7B,GAE9CA,EAAE27B,UAEF37B,EAAEslC,OACFtlC,EAAEylC,UAAUhtD,EAAQ,GACpB00C,EAAGsoB,KAAKz1C,GAAIvnB,EAAQ0sD,EAAM1sD,GAC1BunB,EAAE27B,UACF37B,EAAE27B,SAKF,KAAK,GAHD+Z,IAAW,EACXz0D,EAAM,EACNkyB,EAAWxY,EAAKwY,aACXhU,EAAM,EAAGA,EAAMgU,EAASh7B,SAAUgnB,EAAK,CAC5C,GAAIujC,GAAUvvB,EAAShU,EAEvB,IAAIujC,EAAQhvB,MAAO,CACfgiC,GAAW,CACX,IAAIz8D,GAAIypD,EAAQhvB,MACZmR,EAAI6d,EAAQtvB,OAEZuiC,EAAU,CACV9wB,GAAI,KACJ8wB,EAAU,GAAM9wB,EAAE,GAAM,GAE5B,IAAI4nB,GAAa5nB,GAAK8wB,EAAU,GAC5BjJ,GAAezzD,EAAEgF,IAAMhF,EAAE6C,MAAQ65D,EAAU,EAE/C31C,GAAE8sC,YACF9sC,EAAE+sC,OAAOzvC,EAAS,EAAGrc,GACrB+e,EAAEgtC,OAAO1vC,EAAQrc,GACjB+e,EAAEgtC,OAAO1vC,EAAQrc,EAAMyhD,EAAQtvB,QAC/BpT,EAAEgtC,OAAO1vC,EAAS,EAAGrc,EAAMyhD,EAAQtvB,OACnC,KAAK,GAAIh8B,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXzsC,GAAE+sC,OAAOzvC,EAAQrc,EAAMgsD,GACvBjtC,EAAEgtC,OAAO1vC,EAAO,EAAGrc,EAAMgsD,GAE7BjtC,EAAE4sC,YAAc,QAChB5sC,EAAE41C,YAAc,EAChB51C,EAAEm+B,SAEFn+B,EAAE6kC,UAAY,QACdyP,EAAuBt0C,EAAG8N,EAAiB70B,EAAEgF,KAAMqf,EAAS,EAAGrc,EAAM,GACrEqzD,EAAuBt0C,EAAG8N,EAAiB70B,EAAE6C,KAAMwhB,EAAS,EAAGrc,EAAMyhD,EAAQtvB,OAC7E,KAAK,GAAIh8B,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACX6H,GAAuBt0C,EAAG8N,EAAkB,EAAI70B,EAAEgF,IAAQ7G,EAAEs1D,GAAepvC,EAAS,EAAGrc,EAAMgsD,EAAK,IAI1GhsD,GAAOyhD,EAAQtvB,OAASkG,EAG5B,GAAIu8B,EAEAA,GAD4B,gBAArBl7C,GAAK+G,OAAOzmB,KACP0f,EAAK+G,OAAOzmB,KAEZ0f,EAAKgH,UAAU1mB,IAC/B,IAAI66D,GAAa91C,EAAEu0C,YAAYsB,GAAWl6C,KAC1CqE,GAAE6kC,UAAY,QACd7kC,EAAEqtC,SAASwI,EAAWv4C,GAAUo4C,EAAW,GAAK,IAAMI,GAAan7C,EAAK+X,aAAe,GAAK,GAE5F1S,EAAE27B,UAEF+Y,GAAQ/5C,EAAK+X,aAAe4G,EAE5B3e,EAAKwY,SAAWxY,EAAKq6C,eACrBr6C,EAAKqjB,WAAarjB,EAAKs6C,iBACvBt6C,EAAK+X,aAAe/X,EAAKu6C,mBAG7B,GAAIt1D,EAAK0f,WAAY,CACjBU,EAAEslC,OAEFtlC,EAAE8sC,YACF9sC,EAAE+sC,OAAOzvC,EAAQ,GACjB0C,EAAEgtC,OAAO1vC,EAAS6nC,EAAK,GACvBnlC,EAAEgtC,OAAO1vC,EAAS6nC,EAAKuP,GACvB10C,EAAEgtC,OAAO1vC,EAAQo3C,GACjB10C,EAAEu1C,YACFv1C,EAAEw1C,OAEFx1C,EAAEylC,UAAUnoC,EAAS7kB,EAAQ,EAK7B,KAAK,GAJD2uB,GAASjpB,KAAKmsB,UACdwa,EAAW3mC,KAAKmsB,UAChBya,EAAS5mC,KAAKosB,QAET0M,EAAK,EAAGA,EAAK94B,KAAKmhB,WAAWnnB,SAAU8+B,EAAI,CAChD,GAAI4N,GAAI1mC,KAAKmhB,WAAW2X,IAClB4N,EAAEllC,MAAQxB,KAAKwB,KAASklC,EAAEllC,MAAS,MAAQxB,KAAKwB,MAAUklC,EAAE/oC,IAAMipC,GAAUF,EAAE5mC,IAAM6mC,IACtF9kB,EAAE2sC,YAAcxuD,KAAK6pB,sBACrBhI,EAAE6kC,UAAY1mD,KAAK4pB,qBACnB/H,EAAE8kC,UAAUjgB,EAAE/oC,IAAMsrB,GAAUjpB,KAAKuzB,MACxB,GACCmT,EAAE5mC,IAAM4mC,EAAE/oC,KAAOqC,KAAKuzB,MACvBgjC,IAGnB10C,EAAE27B,UAGN,GAAIoa,GAAW,EAmBf,OAlBkB,UAAdn2D,EAAKgxB,MACLmlC,EAAWz4C,GAAWnf,KAAKosB,QAAUpsB,KAAKmsB,UAAY,GAAGnsB,KAAKuzB,MAAS,EAClD,QAAd9xB,EAAKgxB,MACZmlC,EAAWz4C,EACU,SAAd1d,EAAKgxB,QACZmlC,EAAWz4C,GAAWnf,KAAKosB,QAAUpsB,KAAKmsB,UAAY,GAAGnsB,KAAKuzB,OAE9DqkC,GAAY,IACZ/1C,EAAE4sC,YAAc,OAChB5sC,EAAE8sC,YACF9sC,EAAE+sC,OAAOgJ,EAAU,GACnB/1C,EAAEgtC,OAAO+I,EAAUrB,GACnB10C,EAAEm+B,UAGNhgD,KAAKmpB,kBAAoButC,EACzB12D,KAAKuzB,MAAQojC,EAENt2D,EAAEw3D,UAAU,gBhBw1RpBnxC,aAAa,EAAEoxC,WAAW,GAAGhxC,eAAe,GAAGixC,kBAAkB,GAAGttB,YAAY,KAAKutB,IAAI,SAASx+D,EAAQU,EAAOJ,GACpH,YiB9kSA,IAAwB,mBAAbN,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,YACpBE,EAAiBxV,EAAMwV,cAG/BH,GAAQvb,UAAU+iB,gBAAkB,WAChC,GAAIhoB,GAAIsF,IACR,IAAoB,WAAhBA,KAAK2e,OACL3e,KAAK+jB,gBACL/jB,KAAK0e,UAAU,YACZ,CACH,GAAIu5C,GAAa98C,EAAY,MAAO,MAAO0B,UAAW,gBAClDq7C,EAAe/8C,EAAY,SAC/B+8C,GAAal8C,YAAYb,EAAY,SAAU,OAAQ/W,MAAO,SAC9D8zD,EAAal8C,YAAYb,EAAY,SAAU,SAAU/W,MAAO,SAChE8zD,EAAal8C,YAAYb,EAAY,SAAU,oBAAqB/W,MAAO,YAC3E8zD,EAAal8C,YAAYb,EAAY,SAAU,qBAAsB/W,MAAO,aAC5E8zD,EAAal8C,YAAYb,EAAY,SAAU,kBAAmB/W,MAAO,UACzE8zD,EAAa9zD,MAAQ,MAErB8zD,EAAa12C,iBAAiB,SAAU,SAASvJ,GAC7CoD,EAAe88C,GACfC,MACD,GACHH,EAAWj8C,YAAYb,EAAY,KAAM,cAAe+8C,IAExD,IAAIG,GAAyBl9C,EAAY,QAAS,MAAO7W,KAAM,WAAYqhB,QAAS3lB,KAAK8pB,kBACzFuuC,GAAuB72C,iBAAiB,SAAU,SAASvJ,GACvDvd,EAAEovB,iBAAmBuuC,EAAuB1yC,QAC5CjrB,EAAEumB,gBACH,EACH,IAAIq3C,GAAoBn9C,EAAY,QAAS,MAAO7W,KAAM,WAAYqhB,QAAS3lB,KAAK+pB,aACpFuuC,GAAkB92C,iBAAiB,SAAU,SAASvJ,GAClDvd,EAAEqvB,YAAcuuC,EAAkB3yC,QAClCjrB,EAAEumB,gBACH,EACH,IAAIs3C,GAAqBp9C,EAAY,QAAS,MAAO7W,KAAM,WAAYqhB,QAAS3lB,KAAKiqB,cACrFsuC,GAAmB/2C,iBAAiB,SAAU,SAASvJ,GACnDvd,EAAEuvB,aAAesuC,EAAmB5yC,QACpCjrB,EAAEumB,gBACH,EACH,IAAIu3C,GAAqBr9C,EAAY,QAAS,MAAO7W,KAAM,WAAYqhB,QAAS3lB,KAAKgqB,cACrFwuC,GAAmBh3C,iBAAiB,SAAU,SAASvJ,GACnDvd,EAAEsvB,aAAewuC,EAAmB7yC,QACpCjrB,EAAEumB,gBACH,EACH,IAAIw3C,GAAct9C,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,QAC/Ds0D,EAAcv9C,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,QAE/Du0D,EAAex9C,EAAY,SAAU,UAAW0B,UAAW,mBAC/D87C,GAAan3C,iBAAiB,QAAS,SAASvJ,GAC5CoD,EAAe88C,EAEf,IAAIS,GACAC,EAAMv0D,EAAMxH,CAChB,IAA2B,QAAvBo7D,EAAa9zD,MACbw0D,EAAU7pC,IAAIC,gBAAgBt0B,EAAEo+D,SAAS33C,WAAYk3C,EAAuB1yC,QACnC6wC,OAAQ97D,EAAEsvB,aACVysC,OAAQ/7D,EAAEuvB,aACVwI,MAAO6lC,EAAkB3yC,QAAUjrB,EAAEsrB,cAAgB,OACrDxI,MAAOhX,SAASkyD,EAAYt0D,QAAU,OAC/Ey0D,EAAO,MACPv0D,EAAO,YACPxH,EAAO,yBACJ,IAA2B,QAAvBo7D,EAAa9zD,MAAiB,CACrC,GAAI4yD,GAAOpwD,WAAW6xD,EAAYr0D,MAClC,IAAW,GAAP4yD,GAAcA,EAAO,GAErB,WADAtuB,OAAM,aAAesuB,EAIzB4B,GAAUl+D,EAAE47D,aAAan1C,WAAYk3C,EAAuB1yC,QACnC6wC,OAAQ97D,EAAEsvB,aACVysC,OAAQ/7D,EAAEuvB,aACVwI,MAAO6lC,EAAkB3yC,QAAUjrB,EAAEsrB,cAAgB,OACrDixC,qBAAsBD,EACtBx5C,MAAOhX,SAASkyD,EAAYt0D,QAAU,MAC/Dy0D,EAAO,QACPv0D,EAAO,YACPxH,EAAO,yBACJ,IAA2B,WAAvBo7D,EAAa9zD,MAAoB,CACxC,GAAImf,GAASwd,KAAKQ,UAAU7mC,EAAE86D,mBAAoB,KAAM,GACpDx+C,EAAO,GAAI4X,OAAMrL,IAAUjf,KAAM,cACrCs0D,GAAU7pC,IAAIC,gBAAgBhY,GAC9B6hD,EAAO,gBACPv0D,EAAO,aACPxH,EAAO,4BACJ,IAA2B,YAAvBo7D,EAAa9zD,MAAqB,CACzC,GAAImf,GAASwd,KAAKQ,UAAU7mC,EAAE+6D,qBAAsB,KAAM,GACtDz+C,EAAO,GAAI4X,OAAMrL,IAAUjf,KAAM,cACrCs0D,GAAU7pC,IAAIC,gBAAgBhY,GAC9B6hD,EAAO,eACPv0D,EAAO,aACPxH,EAAO,6BACJ,IAA2B,SAAvBo7D,EAAa9zD,MAAkB,CACtC,GAAI20D,GAAOr+D,EAAEu7D,qBACT3xD,EAAO,YACP0S,EAAO,GAAI4X,OAAMmqC,IAAQz0D,KAAMA,GACnCs0D,GAAU7pC,IAAIC,gBAAgBhY,GAC9B6hD,EAAO,gBACP/7D,EAAO,sBAGX,GAAI87D,EAAS,CACT,GAAII,GAAe79C,EAAY,IAAK,cAChCe,KAAM08C,EACNK,SAAUn8D,EACVwH,KAAMA,IAGN40D,EAAc/9C,EAAY,IAAK,wBAC/Be,KAAM08C,EACNt0D,KAAMA,EACNo+B,OAAQ,QAGZy1B,GAAcn8C,YAAYb,EAAY,KAAM,GAAK09C,EAAO,aAAcG,EAAcE,QAEzF,GAEHx+D,EAAE0lB,gBAAgB,WACd/E,EAAe88C,KAEnBz9D,EAAE4mB,gBAAgB,WACdjG,EAAe88C,IAGnB,IAAIA,GAAgBh9C,EAAY,IAAK,IAEjCg+C,EAAgBh+C,EAAY,MACvBA,EAAY,KAAM,yBAA2BqC,MAAO,QAASyxC,UAAW,UACxE9zC,EAAY,KAAMk9C,KACvBe,EAAej+C,EAAY,MACtBA,EAAY,KAAM,iCAAmC8zC,UAAW,UAChE9zC,EAAY,KAAMm9C,KACvBe,EAAWl+C,EAAY,MACtBA,EAAY,KAAM,uBAAyB8zC,UAAW,UACtD9zC,EAAY,KAAMs9C,KACnBa,EAAWn+C,EAAY,MACtBA,EAAY,KAAM,yBAA2B8zC,UAAW,UACxD9zC,EAAY,KAAMu9C,KACnBa,EAAYp+C,EAAY,MACvBA,EAAY,KAAM,qCAAuC8zC,UAAW,UACpE9zC,EAAY,KAAMo9C,KACnBiB,EAAYr+C,EAAY,MACvBA,EAAY,KAAM,qBAAuB8zC,UAAW,UACpD9zC,EAAY,KAAMq9C,KAEnBiB,EAAkBt+C,EAAY,SAC7Bg+C,EACAC,EACAE,EACAD,EACAE,GAAY,MAAO/7C,MAAO,UAC3B46C,EAAW,WACX,GAAIsB,GAAKxB,EAAa9zD,KACtB+0D,GAAc/3C,MAAMC,QAAiB,OAANq4C,GAAqB,OAANA,EAAe,YAAc,OAC3EN,EAAah4C,MAAMC,QAAiB,OAANq4C,GAAqB,OAANA,EAAe,YAAc,OAC1EL,EAASj4C,MAAMC,QAAiB,OAANq4C,EAAe,YAAc,OACvDJ,EAASl4C,MAAMC,QAAiB,OAANq4C,GAAqB,OAANA,EAAe,YAAc,OACtEH,EAAUn4C,MAAMC,QAAiB,OAANq4C,GAAqB,OAANA,EAAe,YAAc,OACvEF,EAAUp4C,MAAMC,QAAiB,OAANq4C,GAAqB,OAANA,EAAe,YAAc,OAE3EtB,KAEAH,EAAWj8C,YAAYy9C,GACvBxB,EAAWj8C,YAAY28C,GACvBV,EAAWj8C,YAAYm8C,GAEH,SAAhBn4D,KAAK2e,QACL3e,KAAK+jB,gBACT/jB,KAAKokB,cAAcu1C,aAAa1B,EAAYj4D,KAAK8kB,WACjD9kB,KAAKwkB,gBAAkByzC,EAEvBj4D,KAAK0e,UAAU,cjB2kSpBgI,aAAa,EAAEzc,UAAU,KAAK2vD,IAAI,SAASpgE,EAAQU,EAAOJ,GAC7D,YkB9vSAN,GAAQ,iBACR,IAAIyhB,GAAUzhB,EAAQ,cAClBqgE,EAAWrgE,EAAQ,cACnB6L,EAAK7L,EAAQ,oBACbqM,EAAQrM,EAAQ,WAChBgM,EAAMhM,EAAQ,SACdkyD,EAAKlyD,EAAQ,kBAEjBgzB,QAAOtR,QAAUD,EAAQC,QACzBsR,OAAOsD,gBAAkB47B,EAAG57B,gBAC5BtD,OAAOoD,SAAWiqC,EAASjqC,SAG3BpD,OAAOrR,YAActV,EAAMsV,YAG3BqR,OAAO4nC,uCAAyC/uD,EAAGgvD,6BACnD7nC,OAAOlnB,gCAAkCD,EAAGE,sBAC5CinB,OAAOstC,qBAAuBz0D,EAAG00D,WAIjCvtC,OAAOunB,YAAcvuC,EAAIuuC,YACzBvnB,OAAO5mB,WAAaJ,EAAII,WACxB4mB,OAAO7mB,SAAWH,EAAIG,SACtB6mB,OAAO/mB,cAAgBD,EAAIC,cAC3B+mB,OAAO9mB,SAAWF,EAAIE,SACtB8mB,OAAO8e,UAAY9lC,EAAI8lC,SAEvB,IAAI7Y,GAAQj5B,EAAQ,WACpBgzB,QAAOwtC,MAAQvnC,EAAMunC,MACrBxtC,OAAOytC,kBAAoBxnC,EAAMwnC,oBlB2wS9BvzC,aAAa,EAAEijB,aAAa,EAAE5/B,QAAQ,GAAGmwD,WAAW,GAAGlwD,mBAAmB,GAAGmgC,kBAAkB,GAAGlgC,UAAU,GAAGkwD,iBAAiB,KAAKC,IAAI,SAAS5gE,EAAQU,EAAOJ,GmB5ySpK,YAUA,SAASoqD,KACLlkD,KAAKqtB,UACLrtB,KAAKi1B,OAAS,EACdj1B,KAAKu1B,MAAQ,KAXjB,GAAwB,mBAAb/7B,GACP,GAAIgjB,GAAOhjB,EAAQ,UACf+1B,EAAU/S,EAAK+S,QAEfnU,EAAK5hB,EAAQ,gBACbm2B,EAAmBvU,EAAGuU,gBAS9Bu0B,GAAQvkD,UAAU06D,SAAW,SAASlxD,GAGlC,IAFA,GAAImxD,GAAOnxD,EAAMxL,MACbgD,EAAK,EAAG45D,EAAKv6D,KAAKqtB,OAAOrzB,OACtBugE,EAAK55D,GAAI,CACZ,GAAIwnC,IAAQxnC,EAAK45D,GAAI,EAAG,CACxB,IAAIpyB,GAAOnoC,KAAKqtB,OAAOrzB,OACnB,MAAOgG,MAAKqtB,OAAOrzB,MACvB,IAAIwgE,GAAKx6D,KAAKqtB,OAAO8a,EACjBmyB,GAAOE,EAAG78D,MACV48D,EAAKpyB,EAELxnC,EAAKwnC,EAAM,EAGnB,MAAOoyB,IAGXrW,EAAQvkD,UAAUgd,IAAM,SAASxT,GAC7B,GAAIsxD,GAAMz6D,KAAKq6D,SAASlxD,EACxBnJ,MAAKqtB,OAAO/b,OAAOmpD,EAAK,EAAGtxD,GAC3BnJ,KAAKi1B,OAASv3B,KAAKoC,IAAIE,KAAKi1B,OAAQ9rB,EAAM8rB,UACtC9rB,EAAMosB,OAAuB,MAAdv1B,KAAKu1B,QACpBv1B,KAAKu1B,MAAQpsB,EAAMosB,QAI3B2uB,EAAQvkD,UAAU2kD,YAAc,SAASn7C,GACrC,GAAIsxD,GAAMz6D,KAAKq6D,SAASlxD,EACxB,OAAIsxD,GAAM,GAAKz6D,KAAKqtB,OAAOotC,EAAI,GAAG36D,OAASqJ,EAAMxL,OACtC,EACP88D,EAAMz6D,KAAKqtB,OAAOrzB,QAAUgG,KAAKqtB,OAAOotC,GAAK98D,OAASwL,EAAMrJ,OACrD,GAEJ,GAGXyvB,EAAQ5vB,UAAU4nD,eAAiB,SAASmT,EAAI1rB,EAAI10C,GAChD,GAAI06B,GAAWh1B,KAAKg1B,SAChBgyB,EAA0B,EAApBhnD,KAAKw7B,SAAShe,KAExBk9C,GAAGvT,MACH,KAAK,GAAI/tD,GAAI,EAAGA,EAAI47B,EAASh7B,SAAUZ,EAAG,CAGtC,IAAK,GAFDm8B,GAAQ,KACRlI,EAAS2H,EAAS57B,GAAGi0B,OAChB5zB,EAAI,EAAGA,EAAI4zB,EAAOrzB,SAAUP,EAAG,CACpC,GAAI0P,GAAQkkB,EAAO5zB,EACnB,IAAI0P,EAAMxL,MAAQqpD,EAAI1sD,GAAU6O,EAAMrJ,OAASxF,EAAQ,CACnD,GAAI6O,GAAQkkB,EAAO5zB,EACnB0P,GAAMmuD,KAAKoD,EAAI1rB,GACX7lC,EAAMosB,QACNA,EAAQpsB,EAAMosB,QAKjC,GAAIA,GAASA,EAAM53B,IAAM,GAAK43B,EAAMz1B,IAAM,GAAKE,KAAKwjB,UAAUm3C,SAAU,CACpE,GAAIptC,GAAKyH,EAAS,GAAGC,QAAUM,EAAMz1B,KAAOy1B,EAAMz1B,IAAMy1B,EAAM53B,KAC9D+8D,GAAGvT,OACHuT,EAAGjM,YAAczuD,KAAKwjB,UAAUm3C,SAChCD,EAAGhM,UAAY,GACfgM,EAAG/L,YACH+L,EAAG9L,OAAO,KAAOrhC,GACjBmtC,EAAG7L,OAAO7H,EAAM,IAAMz5B,GACtBmtC,EAAG1a,SACH0a,EAAGld,UAGA,GAAIx9C,KAAK4kD,cAAe,CACpB,GAAIrxB,GAAQvzB,KAAKib,QAAQsY,KACzBmnC,GAAGpT,UAAU,EAAG/zB,EAAQvzB,KAAKm7B,SAC7B6T,EAAGsY,UAAU,EAAG/zB,EAAQvzB,KAAKm7B,aAE7Bu/B,GAAGpT,UAAU,EAAGtyB,EAAS57B,GAAG67B,OAASj1B,KAAKm7B,SAC1C6T,EAAGsY,UAAU,EAAGtyB,EAAS57B,GAAG67B,OAASj1B,KAAKm7B,SAKlD,GAFAu/B,EAAGld,UAECjoB,GAASv1B,KAAKsjB,oBAAsBtjB,KAAKojB,eAAiBpjB,KAAKib,QAAQoI,uBAAuBrjB,KAAKojB,cAAe,aAAc,CAChI,GAAImK,GAAKyH,EAAS,GAAGC,QAAU,GAAQj1B,KAAKsjB,mBAAqBiS,EAAM53B,MAAQ43B,EAAMz1B,IAAMy1B,EAAM53B,KAEjG+8D,GAAGvT,OACHuT,EAAGjM,YAAc,MACjBiM,EAAGhM,UAAY,GACfgM,EAAG/L,YACH+L,EAAG9L,OAAO,KAAOrhC,GACjBmtC,EAAG7L,OAAO7H,EAAM,IAAMz5B,GACtBmtC,EAAG1a,SACH0a,EAAGld,YAIXjuB,EAAQ5vB,UAAUumB,WAAa,WAC3B,GAAKlmB,KAAKynC,aAAV,CAGA,GAEIlS,GAFAvK,EAAShrB,KAAKib,QAAQ+P,QAAUwB,OAAOqc,iBAAmB,CAM9D,IAHI7oC,KAAKg1B,UAAYh1B,KAAKg1B,SAASh7B,OAAS,IACxCu7B,EAAQv1B,KAAKg1B,SAAS,GAAGO,OAEzBA,EAAO,CACP,GAAImR,GAAI1mC,KAAKg1B,SAAS,GAAGC,OACrBo5B,EAAI,EACRruD,MAAKynC,aAAaxS,OAASj1B,KAAKw7B,SAASvG,OACzCj1B,KAAKynC,aAAajqB,MAAQwN,EAAW,EAAFqjC,EAAMA,EACzCruD,KAAKynC,aAAarmB,MAAM6T,OAAS,IAAMjK,EAAShrB,KAAKynC,aAAaxS,OAAO,EAAIj1B,KAAKynC,aAAaxS,QAAU,KACzGj1B,KAAKynC,aAAarmB,MAAM5D,MAAQ,GAAK6wC,EAAI,KACzCruD,KAAKynC,aAAarmB,MAAMC,QAAU,OAClC,IAAIu5C,GAAM56D,KAAKynC,aAAaqV,WAAW,KACnC9xB,IACA4vC,EAAIrnC,MAAM,EAAG,EAEjB,IAAIikC,GAAU,CACV9wB,GAAI,KACJ8wB,EAAU,GAAM9wB,EAAE,GAAM,GAE5B,IAAI4nB,IAAc5nB,EAAiB,EAAb1mC,KAAKm7B,UAAcq8B,EAAU,GAC/CjJ,GAAeh5B,EAAMz1B,IAAMy1B,EAAM53B,MAAQ65D,EAAU,EAevD,IAbAoD,EAAIlU,UAAY,QAChBkU,EAAIpM,YAAc,GACgB,SAA9BxuD,KAAKib,QAAQ+K,cACb40C,EAAIjU,SAAS0H,EAAE,GAAI,EAAG,GAAI3nB,EAAiB,EAAb1mC,KAAKm7B,SAEnCy/B,EAAIjU,SAAS,EAAG,EAAG,GAAIjgB,EAAiB,EAAb1mC,KAAKm7B,SAEpCy/B,EAAIpM,YAAc,EAElBoM,EAAInM,YAAc,QAClBmM,EAAIlM,UAAY,EAChBkM,EAAIjM,YAE8B,SAA9B3uD,KAAKib,QAAQ+K,cAA0B,CACvC40C,EAAIhM,OAAOP,EAAI,EAAGruD,KAAKm7B,SACvBy/B,EAAI/L,OAAOR,EAAGruD,KAAKm7B,SACnBy/B,EAAI/L,OAAOR,EAAG3nB,EAAI1mC,KAAKm7B,SACvBy/B,EAAI/L,OAAOR,EAAI,EAAG3nB,EAAI1mC,KAAKm7B,QAC3B,KAAK,GAAIliC,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXsM,GAAIhM,OAAOP,EAAGS,GACd8L,EAAI/L,OAAOR,EAAI,EAAGS,QAEnB,CACH8L,EAAIhM,OAAO,EAAG5uD,KAAKm7B,SACnBy/B,EAAI/L,OAAO,EAAG7uD,KAAKm7B,SACnBy/B,EAAI/L,OAAO,EAAGnoB,EAAI1mC,KAAKm7B,SACvBy/B,EAAI/L,OAAO,EAAGnoB,EAAI1mC,KAAKm7B,QACvB,KAAK,GAAIliC,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXsM,GAAIhM,OAAO,EAAGE,GACd8L,EAAI/L,OAAO,EAAGC,IAOtB,GAJA8L,EAAI5a,SAEJ4a,EAAIlU,UAAY,QAEkB,SAA9B1mD,KAAKib,QAAQ+K,cAA0B,CACvC40C,EAAI3L,UAAY,QAChB2L,EAAI1L,SAASv/B,EAAiB4F,EAAMz1B,KAAMuuD,EAAE,EAAG,GAC/CuM,EAAI1L,SAASv/B,EAAiB4F,EAAM53B,KAAM0wD,EAAE,EAAG3nB,EAAI1mC,KAAKm7B,QACxD,KAAK,GAAIliC,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXsM,GAAI1L,SAASv/B,EAAkB,EAAI4F,EAAMz1B,IAAQ7G,EAAEs1D,GAAeF,EAAI,EAAGS,EAAK,QAE/E,CACH8L,EAAI3L,UAAY,OAChB2L,EAAI1L,SAASv/B,EAAiB4F,EAAMz1B,KAAM,EAAG,GAC7C86D,EAAI1L,SAASv/B,EAAiB4F,EAAM53B,KAAM,EAAG+oC,EAAI1mC,KAAKm7B,QACtD,KAAK,GAAIliC,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXsM,GAAI1L,SAASv/B,EAAkB,EAAI4F,EAAMz1B,IAAQ7G,EAAEs1D,GAAe,EAAGO,EAAK,SAIlF9uD,MAAKynC,aAAarmB,MAAMC,QAAU,SAI1CkO,EAAQ5vB,UAAUk+C,gBAAkB,SAASnkD,GACzC,GAAIouC,GAAU9nC,KAAKib,QAAQ8sB,qBAE3B,KAAK/nC,KAAKiJ,WACN,MAAO,KAKX,KAAK,GAFD4xD,GAAQ,KACRniC,EAAK14B,KAAKiJ,WAAWorC,OAChBte,EAAK,EAAGA,EAAK2C,EAAG1+B,SAAU+7B,EAAI,CACnC,GAAI8gB,GAAKne,EAAG3C,EACZ,MAAI8gB,EAAGpiC,MAAQoiC,EAAGpiC,MAAQqzB,GAItB+O,EAAGhwC,aACCgwC,EAAGhwC,aAAenN,EAAEmN,aAD5B,CAMA,GAAIi0D,GAAUjkB,EAAGE,QAKjB,IAJK+jB,GAAYA,EAAQ/zD,OACrB+zD,EAAU,GAAI98D,QAAO,IAAM64C,EAAGnwC,MAAQ,KACtCmwC,EAAGE,SAAW+jB,IAEdjkB,EAAGnwC,OAAWo0D,EAAQ/zD,KAAKrN,EAAEgN,OAAjC,CAGA,GAAIq0D,GAAWlkB,EAAGC,SAKlB,IAJKikB,GAAaA,EAASh0D,OACvBg0D,EAAW,GAAI/8D,QAAO,IAAM64C,EAAGwC,OAAS,KACxCxC,EAAGC,UAAYikB,IAEflkB,EAAGwC,QAAY0hB,EAASh0D,KAAKrN,EAAE2/C,QAAnC,CAGA,GAAIxC,EAAGvyC,KAAM,CACT,GAAe,WAAXuyC,EAAGvyC,KAAmB,CACjBu2D,IACDA,EAAQhkB,EAAGz1B,MAEf,UAEA,GAAI45C,GAASnkB,EAAGG,OAKhB,IAJKgkB,GAAWA,EAAOj0D,OACnBi0D,EAAS,GAAIh9D,QAAO,IAAM64C,EAAGvyC,KAAO,KACpCuyC,EAAGG,QAAUgkB,IAEZA,EAAOj0D,KAAKrN,EAAE4K,MACf,SAGZ,MAAOuyC,GAAGz1B,SAEd,MAAOy5C,IAGXtrC,EAAQ5vB,UAAU+nD,SAAW,SAAStmC,GAClC,GAAIphB,KAAK81D,gBACL,MAAO91D,MAAK6qD,yBAA2B,CACpC,IAA8B,gBAAnB7qD,MAAK61D,SACnB,MAAO71D,MAAK61D,QAEZ,IAAMoF,GAAoC,mBAAnB75C,GAAM85C,QAA2B95C,EAAM85C,QAAUC,OAAOC,SAC/E,OAAOh6C,GAAMi6C,KAAO39D,KAAKC,IAAIs9D,EAASj7D,KAAK6qD,yBAA2B,IAI9Et7B,EAAQ5vB,UAAUioD,SAAW,SAASxmC,GAClC,GAAIphB,KAAKg2D,gBACL,MAAOh2D,MAAK+qD,yBAA2B,CACpC,IAA8B,gBAAnB/qD,MAAK+1D,SACnB,MAAO/1D,MAAK+1D,QAEZ,IAAMuF,GAAoC,mBAAnBl6C,GAAMm6C,QAA2Bn6C,EAAMm6C,QAAUJ,OAAOK,SAC/E,OAAOp6C,GAAMq6C,KAAO/9D,KAAKoC,IAAIw7D,EAASt7D,KAAK+qD,yBAA2B,IAIvD,mBAAZ7wD,KACPA,EAAOJ,SACHoqD,QAASA,MnBkzSdp9B,eAAe,GAAGwjB,SAAS,KAAKoxB,IAAI,SAASliE,QAAQU,OAAOJ,SoBvkT/D,YAsBA,SAAS6hE,aAAYp/C,EAAKD,EAASuR,GAC/B,GAAI/wB,GAAO8+D,KAAK/tC,EAAMvpB,KAAMgY,EAAQhY,MAChCu3D,EAAMD,KAAK/tC,EAAMnnB,MAAO4V,EAAQ5V,MAAOmnB,EAAMpmB,GAAI6U,EAAQ7U,KACxD8U,EAAI,GAAGu/C,UAAYD,GAAkC,GAA3BA,EAAI7+D,QAAQ,cACvCF,EAAOA,EAAO,KAAO++D,GAGzB77D,KAAKuc,IAAMA,EACXvc,KAAKsc,QAAUA,EACftc,KAAK6tB,MAAQA,EACb7tB,KAAK8c,MAAQP,EAAI,GAAGu/C,SAAWx/C,EAAQ7U,GAAK3K,EAC5CkD,KAAK+7D,YAkJT,QAASC,aAAYziE,EAAGmB,GACpB,GAAIb,KACJ,IAAIN,EACA,IAAK,GAAIE,GAAI,EAAGA,EAAIF,EAAES,SAAUP,EAC5BwiE,QAAQpiE,EAAGN,EAAEE,GAGrB,IAAIiB,EACA,IAAK,GAAIjB,GAAI,EAAGA,EAAIiB,EAAEV,SAAUP,EAC5BwiE,QAAQpiE,EAAGa,EAAEjB,GAGrB,OAAOI,GA7LX,GAAwB,mBAAbL,SACP,GAAIyhB,SAAUzhB,QAAQ,cAClB0hB,QAAUD,QAAQC,QAElBrV,MAAQrM,QAAQ,WAChBoiE,KAAO/1D,MAAM+1D,KACbK,QAAUp2D,MAAMo2D,QAChB9gD,YAActV,MAAMsV,WAI5B,IAAI+gD,gBAAiB,GAAIl+D,QAAO,sBAEhCkd,SAAQvb,UAAUw8D,qBAAuB,SAAU32B,GAC1CxlC,KAAKo8D,qBACNp8D,KAAKo8D,uBAETp8D,KAAKo8D,mBAAmBl/D,KAAKsoC,IAiBjCm2B,YAAYh8D,UAAU08D,SAAW,SAAUpjE,GACvC+G,KAAK8c,MAAQ7jB,GAGjB0iE,YAAYh8D,UAAUgd,IAAM,SAAUjW,EAAO41D,GACrB,gBAATA,KACPA,EAAOnhD,YAAY,OAAQmhD,IAE/Bt8D,KAAK+7D,SAAS7+D,MAAMwJ,MAAOA,EAAO41D,KAAMA,KAG5CphD,QAAQvb,UAAU8c,aAAe,SAAUxE,GAAIskD,kBAAmBhgD,IAAKC,MACnE,GAAIsc,IAAKvc,IAAIviB,OACTsiB,UAAYwc,IAAM,EAAIvc,IAAIuc,OAC1BjL,QAAUiL,IAAM,EAAIvc,IAAIuc,OAExB0jC,YAAc,GAAIb,aAAYp/C,IAAKD,QAASuR,MAChD2uC,aAAYhgD,KAAOA,IAEnB,KAAK,GADDigD,MAAOz8D,KAAKo8D,uBACPM,KAAO,EAAGA,KAAOD,KAAKziE,SAAU0iE,KACrC,IACID,KAAKC,MAAMpgD,QAASkgD,aACtB,MAAOxjE,GACLwW,QAAQC,IAAIzW,EAAE2hC,OAAS3hC,GAI/B,IADAyjE,KAAOjgD,KAAK4/C,uBACPM,KAAO,EAAGA,KAAOD,KAAKziE,SAAU0iE,KACjC,IACID,KAAKC,MAAMpgD,QAASkgD,aACtB,MAAOxjE,GACLwW,QAAQC,IAAIzW,EAAE2hC,OAAS3hC,GAI/BgH,KAAKkiB,iBAEL,IAAIy6C,OAAQxhD,YAAY,QAAS,MAAO0B,UAAW,uCACnD8/C,OAAMv7C,MAAM5D,MAAQ,OACpBm/C,MAAMv7C,MAAMjC,OAAS,KAErB,IAAIumB,KAAM,CACV,IAAIppB,QAAQ+8B,SAAW78B,KAAKgH,UAAUo5C,eAAgB,CAClD,GAAInmC,KAAMtb,YAAY,MAClBA,YAAY,KAAM,UAClBA,YAAY,KAAMmB,QAAQ+8B,SAE9BsjB,OAAM3gD,YAAYya,OAChBiP,IAGF,GAAItT,IAEAA,KADAvE,MAAMtqB,QACAsqB,MAEAvR,OAEV,IAAIma,KAAMtb,YAAY,MAClBA,YAAY,KAAM,YAClBA,YAAY,KAAMiX,IAAI7uB,QAAU,IAAM6uB,IAAIz0B,IAAM,IAAMy0B,IAAItyB,QAAU+8D,SAAU,WAKtF,IAHIF,MAAM3gD,YAAYya,OAChBiP,IAEgBvjC,SAAlBma,QAAQ3V,OAAyC,OAAlB2V,QAAQ3V,OAAmC,KAAjB2V,QAAQ3V,QAC7D2V,QAAQwgD,gBAAkBtgD,KAAKgH,UAAUs5C,cAC/C,CACE,GAAIrmC,KAAMtb,YAAY,MAClBA,YAAY,KAAM,SAClBA,YAAY,KAAM,GAAKmB,QAAQ3V,QAEnCg2D,OAAM3gD,YAAYya,OAChBiP,IAGF,GAAI8P,OAAQwmB,YAAYnuC,MAAM2nB,MAAOl5B,QAAQk5B,MAC7C,IAAIA,OAASA,MAAMx7C,OAAS,EAAG,CAC3B,GAAIy8B,KAAMtb,YAAY,MAClBA,YAAY,KAAM,SAClBA,YAAY,KAAMq6B,MAAMnuC,IAAI,SAAUxN,GAClC,MAAOshB,aAAY,MAAOA,YAAY,IAAKthB,EAAEs6C,MAAOj4B,KAAMriB,EAAEsvC,IAAKzG,OAAQ,cAGjFi6B,OAAM3gD,YAAYya,OAChBiP,IAKN,IAAK,GADDh+B,OAAQs0D,YAAYnuC,MAAMnmB,MAAO4U,QAAQ5U,OACpCstC,GAAK,EAAGA,GAAKttC,MAAM1N,SAAUg7C,GAAI,CACtC,GAAI5jC,GAAI,OACJrW,EAAI2M,MAAMstC,GAOd,IAAIz4B,IAAI,GAAGu/C,SAAU,CACjB,GAAIhzD,GAAI/N,EAAEuL,MAAM,IACC,KAAbwC,EAAE9O,SACFoX,EAAItI,EAAE,GACN/N,EAAI+N,EAAE,IAKd,GAAI2tB,KAAMtb,YAAY,MAClBA,YAAY,KAAM/J,GAClB+J,YAAY,KAAMpgB,IAEtB4hE,OAAM3gD,YAAYya,OAChBiP,IAIV,IAAK,GAAIq3B,MAAO,EAAGA,KAAOP,YAAYT,SAAS/hE,SAAU+iE,KAAM,CAC3D,GAAIC,SAAUR,YAAYT,SAASgB,KACnCJ,OAAM3gD,YAAYb,YAAY,MAC1BA,YAAY,KAAM6hD,QAAQt2D,OAC1ByU,YAAY,KAAM6hD,QAAQV,SAGlC,GAAG//C,IAAI,GAAGu/C,UACFx/C,QAAQ2gD,QACR,IAAK,GADYpY,OAAA,QAAAA,SAEb,GAAIqY,QAAS5gD,QAAQ2gD,QAAQl9D,OACzBo9D,WAAahiD,YAAY,IAAK+hD,OAAOx2D,MAEzCy2D,YAAW37C,iBAAiB,QAAS,SAAUvJ,IAC3CmlD,KAAKF,OAAOG,OACb,GAEHV,MAAM3gD,YAAYb,YAAY,MAC1BA,YAAY,KAAM,IAClBA,YAAY,KAAMgiD,gBAVjBp9D,MAAQ,EAAGA,MAAQuc,QAAQ2gD,QAAQjjE,SAAU+F,MAAO8kD,OAerE7kD,MAAKkyD,MAAMj6C,GAAIukD,YAAY1/C,OAAS,UAAW6/C,OAAQn/C,MAAO,SpBilT/DkJ,aAAa,EAAEzc,UAAU,KAAKqzD,IAAI,SAAS9jE,EAAQU,EAAOJ,GqB1wT7D,YAQA,SAASyjE,GAAa/gD,GA2ClB,IAAK,GAhCDghD,GAAUtrD,EACVurD,EAVAC,EAAOlhD,EAAKvB,QAAQslB,WAAYo9B,EAAOnhD,EAAKvB,QAAQulB,SACpDqiB,KACAU,KACAqa,KACAC,KAAgBC,KAChBn2D,KACAq9C,KACA+Y,KACAC,KAIAC,EAAY,WACZR,IACA,KAAK,GAAI3pD,GAAK,EAAGA,EAAK0I,EAAKuqB,gBAAgB/sC,SAAU8Z,EAAI,CACrD,GAAIpa,GAAI8iB,EAAKuqB,gBAAgBjzB,EACzBpa,GAAE+N,KACFg2D,EAAK/jE,EAAE+N,IAAM/N,KAKrBwkE,EAAiB,SAASxkE,GAE1B,GAAIykE,KACJ,IAAIzkE,EAAEggD,QACF,IAAK,GAAInO,GAAK,EAAGA,EAAK7xC,EAAEggD,QAAQ1/C,SAAUuxC,EAAI,CAC1C,GAAI6yB,GAAM1kE,EAAEggD,QAAQnO,GAChBhxC,EAAIkjE,EAAKW,EACR7jE,IAIW,cAAZA,EAAE6+C,QACF6iB,QAAQkC,EAAOC,GAI3B,MAAOD,IAGFrqD,EAAK,EAAGA,EAAK0I,EAAKuqB,gBAAgB/sC,SAAU8Z,EAAI,CACrD,GAAIpa,GAAI8iB,EAAKuqB,gBAAgBjzB,EAC7B,KAAIpa,EAAE+/C,MAAN,CAIA,GAAI4kB,GAAQ3kE,EAAEiE,KAAOggE,GAAQjkE,EAAEoG,KAAO49D,CAEtC,IAAKhkE,EAAEiE,KAAQjE,EAAEoG,IAAjB,CAKA,GAAIpG,EAAEiN,OAAoB,KAAXjN,EAAEiN,OAA2B,KAAXjN,EAAEiN,MAAc,CAC7C,GAAI+kD,GAAK,EAAMhyD,EAAEiN,QACZ62D,GAAiBA,EAAL9R,KACb8R,EAAW9R,KAEVx5C,GAAYw5C,EAAKx5C,KAClBA,EAAWw5C,GAInB,GAAI4S,MACAC,EAAc,IAClB,IAAI7kE,EAAEiO,OACF,IAAK,GAAI8lB,GAAK,EAAGA,EAAK/zB,EAAEiO,OAAO3N,SAAUyzB,EAAI,CACzC,GAAI5L,GAAInoB,EAAEiO,OAAO8lB,GACb+wC,EAAM38C,EAAEpa,EACZ,IAAc,QAAVoa,EAAEvd,KAEFi6D,EAAcC,EACd72D,EAAO62D,GAAO38C,MACX,IAAc,eAAVA,EAAEvd,UAEN,CACHo6B,EAAM6kB,EAAiBib,EAAK9kE,GAC5BiO,EAAO62D,GAAO38C,EACdy8C,EAAQphE,KAAKshE,EAEb,IAAIC,GAAMZ,EAAUW,KACfC,GAAO/kE,EAAEiE,IAAM8gE,KAChBZ,EAAUW,GAAO9kE,EAAEiE,KAEvB8gE,EAAMX,EAAWU,KACZC,GAAO/kE,EAAEoG,IAAM2+D,KAChBX,EAAWU,GAAO9kE,EAAEoG,MAKpC,GAAIpG,EAAEggD,QAAS,CACN+jB,GACDQ,GAEJ,KAAK,GAAI1yB,GAAK,EAAGA,EAAK7xC,EAAEggD,QAAQ1/C,SAAUuxC,EAAI,CAC1C,GAAI6yB,GAAM1kE,EAAEggD,QAAQnO,GAChBhxC,EAAIkjE,EAAKW,EACb,IAAK7jE,EAAL,CAIKA,EAAEk/C,QACHl/C,EAAEk/C,OAAS//C,IAEfglE,EAASnb,EAAiB6a,EAAK7jE,GAC/BmkC,EAAM6kB,EAAiB6a,EAAK1kE,GAEvBiO,EAAOy2D,KACRz2D,EAAOy2D,IACH95D,KAAM/J,EAAE+J,KACRmD,GAAIlN,EAAEkN,GACNf,MAAOnM,EAAEmM,OAASnM,EAAEkN,KAG5B62D,EAAQphE,KAAKkhE,EAEb,IAAIK,GAAMZ,EAAUO,KACfK,GAAO/kE,EAAEiE,IAAM8gE,KAChBZ,EAAUO,GAAO1kE,EAAEiE,KAEvB8gE,EAAMX,EAAWM,KACZK,GAAO/kE,EAAEoG,IAAM2+D,KAChBX,EAAWM,GAAO1kE,EAAEoG,IAExB,IAAI6+D,GAAMT,EAAe3jE,EACzB,IAAIokE,EAAI3kE,OAAS,EAAG,CAChBukE,EAAcI,EAAI,EAClB,IAAIC,GAAKnB,EAAKkB,EAAI,GAClBh3D,GAAOg3D,EAAI,KACPr6D,KAAMs6D,EAAGt6D,KACTmD,GAAIm3D,EAAGn3D,GACPf,MAAOk4D,EAAGl4D,OAASk4D,EAAGn3D,IAErB+U,EAAKgH,UAAU4T,sBAChB5a,EAAKgH,UAAU4T,qBAAsB,MAMrD,GAAsB,GAAlBknC,EAAQtkE,OACJqkE,GACA3/B,EAAMmkB,EAAmBnpD,EAAE4K,KAAM5K,OAClC,IAAI6kE,EACP,IAAK,GAAI18C,GAAI,EAAGA,EAAIy8C,EAAQtkE,SAAU6nB,EAAG,CACrC,GAAI28C,GAAMF,EAAQz8C,EAClB68C,GAAS1Z,EAAauZ,EAAaC,GACnCT,EAAeS,GAAOD,OAnG1BP,GAAc9gE,KAAKxD,IAwG3B,IAAK,GAAI8kE,KAAOjb,GAAiB,CAC7B,GAAI11B,GAAQlmB,EAAO62D,EACO,iBAAf3wC,GAAMlwB,MACbkwB,EAAMlwB,IAAMkgE,EAAUW,IACA,gBAAf3wC,GAAM/tB,MACb+tB,EAAM/tB,IAAMg+D,EAAWU,IAEvBV,EAAWU,IAAQd,GAAQG,EAAUW,IAAQb,IAC7CC,EAAqBY,GAAOjb,EAAgBib,IAGpDhiD,EAAKqmC,kBAAoBA,EACzBrmC,EAAK+mC,gBAAkBqa,EACvBphD,EAAK7U,OAASA,EACd6U,EAAKwoC,YAAcA,EACnBxoC,EAAKuhD,eAAiBA,EAElBP,IACIA,EAAW,EACXA,EAAW,EACO,EAAXtrD,IACPA,EAAW,GAEfsK,EAAKquC,wBAA0B2S,EAC/BhhD,EAAKuuC,wBAA0B74C,GA1LvC,GAAwB,mBAAb1Y,GACP,GAAIqM,GAAQrM,EAAQ,WAChBklC,EAAQ74B,EAAM64B,MACdggC,EAAW74D,EAAM64D,QA2LF,oBAAZxkE,KACPA,EAAOJ,SACHyjE,aAAcA,MrBwwTnBtzD,UAAU,KAAK40D,IAAI,SAASrlE,EAAQU,EAAOJ,GsBj8T9C,YAiBA,SAASglE,GAAc9e,EAAQxN,GAC3BxyC,KAAKkgD,QAAUF,EACfhgD,KAAKygD,MAAQjO,EAiCjB,QAASsP,GAASx6C,EAAGmqC,EAAGj0B,EAAOyX,EAAQud,EAAMwN,EAAQhM,EAAO+qB,GACxD/+D,KAAKsH,EAAIA,EACTtH,KAAKyxC,EAAIA,EACTzxC,KAAKg/D,OAASxhD,EACdxd,KAAKi/D,QAAUhqC,EACfj1B,KAAKwyC,KAAOA,EACZxyC,KAAKggD,OAASA,EACdhgD,KAAKk/D,OAASlrB,EACdh0C,KAAKm/D,QAAUJ,GAAU,EAyF7B,QAAStgB,GAAWpxB,EAAQ4wB,GACxBj+C,KAAKqtB,OAASA,EACdrtB,KAAKi+C,UAAYA,EACjBj+C,KAAK0mC,EAAIrZ,EAAO,GAAG4H,QAGnB,KAAK,GADDmqC,MACKv9C,EAAI,EAAGA,EAAIwL,EAAOrzB,SAAU6nB,EAAG,CACpC,GAAI/Z,GAAKulB,EAAOxL,EAChBu9C,GAAQliE,KAAK,GAAIkB,GAAM0J,EAAGnK,MAAOmK,EAAGhI,QACpCE,KAAK0mC,EAAIhpC,KAAKoC,IAAIE,KAAK0mC,EAAG5+B,EAAGmtB,UAEjCj1B,KAAKq/D,SAAWhhE,EAAM+gE,GA+F1B,QAASzR,GAAejE,EAAQ5iD,EAAOmuB,GACnCj1B,KAAK0pD,OAASA,EACd1pD,KAAK8G,MAAQA,EACb9G,KAAKi/D,QAAUhqC,GAAU,GAqD7B,QAASypB,GAAc4gB,EAAWn2D,EAAOkoD,EAAMkO,EAAYC,EAAQ35C,EAAOsxC,GACtEn3D,KAAKmJ,MAAQA,EACbnJ,KAAKqxD,KAAOA,EACZrxD,KAAKw/D,OAASA,GAAU,OACxBx/D,KAAK6lB,MAAQA,GAAS,QAClBsxC,IACAn3D,KAAKm3D,KAAOA,GAEZn3D,KAAKm3D,OACLmI,EAAUnY,OACVmY,EAAUnI,KAAOn3D,KAAKm3D,KAE1B,IAAIsI,GAAUH,EAAUlJ,YAAY/E,EAChCrxD,MAAKm3D,MACLmI,EAAU9hB,UAEdx9C,KAAK0/D,QAAUD,EAAQjiD,MACvBxd,KAAKuqD,WAAa,EAClBvqD,KAAK2+C,KAAOx1C,EAAMw1C,KAClB3+C,KAAK2/D,UAAYJ,EAwFrB,QAAS1V,GAAWviD,EAAG2tB,EAAQ+qB,GAC3BhgD,KAAK4/D,GAAKt4D,EACVtH,KAAKi/D,QAAUhqC,EACfj1B,KAAKkgD,QAAUF,EAgDnB,QAASqJ,GAAQ/hD,EAAG2tB,EAAQ+qB,GACxBhgD,KAAK4/D,GAAKt4D,EACVtH,KAAKi/D,QAAUhqC,EACfj1B,KAAKkgD,QAAUF,EAkDnB,QAASwB,GAAcl6C,EAAG2tB,EAAQ5hB,EAAKmK,EAAOg1B,EAAMwN,GAChD8e,EAAc/kE,KAAKiG,KAAMggD,EAAQxN,GAEjCxyC,KAAK4/D,GAAKt4D,EACVtH,KAAKi/D,QAAUhqC,EACfj1B,KAAK6/D,KAAOxsD,EACZrT,KAAKg/D,OAASxhD,EA6ClB,QAASgsC,GAASliD,EAAG2tB,EAAQud,EAAMwN,GAC/BhgD,KAAK4/D,GAAKt4D,EACVtH,KAAKi/D,QAAUhqC,EACfj1B,KAAKygD,MAAQjO,EACbxyC,KAAKkgD,QAAUF,EA4CnB,QAASP,GAAYt2C,EAAO22D,EAAMC,GAC9B//D,KAAKmJ,MAAQA,EACbnJ,KAAKsvC,KAAOwwB,EACZ9/D,KAAKuvC,KAAOwwB,EACR52D,IACAnJ,KAAK2+C,KAAOx1C,EAAMw1C,MAkC1B,QAASsB,GAAYtiD,EAAKmC,EAAKm1B,EAAQud,EAAMwN,EAAQ1T,GACjDwyB,EAAc/kE,KAAKiG,KAAMggD,EAAQxN,GACjCxyC,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKggE,KAAO1zB,EAqDhB,QAAS6T,GAAUxiD,EAAKmC,EAAKm1B,EAAQ+qB,GACjC8e,EAAc/kE,KAAKiG,KAAMggD,EAAQ,MACjChgD,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EAoBnB,QAASsrB,GAAU5iD,EAAKmC,EAAKm1B,EAAQ7T,EAAO8uB,EAAQ8P,GAChDhgD,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKigE,OAAS7+C,EACdphB,KAAKkgE,QAAUhwB,EACflwC,KAAKkgD,QAAUF,EAwDnB,QAASU,GAAa/iD,EAAKmC,EAAKm1B,EAAQud,EAAMwN,GAC1ChgD,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKygD,MAAQjO,EACbxyC,KAAKkgD,QAAUF,EA4DnB,QAASD,GAAWpiD,EAAKmC,EAAKm1B,EAAQnuB,EAAO44C,EAAUE,EAAIrnC,GACvDumD,EAAc/kE,KAAKiG,KAAM,KAAM8G,GAC/B9G,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKyoD,OAAS3hD,EACd9G,KAAKmgE,UAAYzgB,EACjB1/C,KAAKogE,IAAMxgB,EACX5/C,KAAKqgE,IAAM9nD,EAkEf,QAAS0oC,GAAatjD,EAAKmC,EAAKm1B,EAAQud,EAAMwN,GAC1ChgD,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKygD,MAAQjO,EACbxyC,KAAKkgD,QAAUF,EAkCnB,QAASc,GAAUwe,EAAW3hE,EAAKmC,EAAKm1B,EAAQud,EAAMmO,GAClD3gD,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKygD,MAAQjO,EACbxyC,KAAKsgE,QAAU3f,EACf3gD,KAAKugE,SAAWjB,EAAUlJ,YAAYzV,GAAQnjC,MAgBlD,QAASgjD,GAAeC,EAAIl6D,EAAOO,GAC/B,GAOI45D,GAPAC,GACAtvB,IAAO,UACPuvB,OAAU,eACVrvB,KAAQ,WACRD,MAAS,aAETsB,EAAS+tB,EAAgB75D,EAAM2vC,cAQnC,OAFIiqB,GAJC9tB,GAIa9rC,EAAO8rC,IAHP,mBAAoB,kBAK5B,KAAN6tB,EACO,QACI,KAANA,EACE,cACI,KAANA,EACE,UAEAC,EAAWn6D,EAAQ,GAGlC,QAASs6D,GAAkBjpB,GAIvB,IAAK,GAHDkpB,IAAYj1C,EAAK,IAAKG,EAAK,IAAKD,EAAK,IAAKD,EAAK,KAC/Ci1C,EAAUnpB,EAAStxC,MAAM,IAAIs4B,UAAU4Z,KAAK,IAC5CwoB,KACKtmE,EAAI,EAAGA,EAAIqmE,EAAQ/mE,SAAUU,EAAG,CACrC,GAAIw5D,GAAO6M,EAAQvyD,OAAO9T,EAAG,GAAGw9C,aAChC8oB,GAAc9jE,KAAKg3D,IAAQ4M,GAAWA,EAAS5M,GAAQ,KAE3D,MAAO8M,GAAcxoB,KAAK,IAG9B,QAAS8J,GAAe3kD,EAAKmC,EAAKm1B,EAAQud,EAAMzuC,EAAK8C,EAAa6B,GAC9D1I,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKygD,MAAQjO,EACbxyC,KAAKihE,KAAOl9D,EACZ/D,KAAKkhE,aAAer6D,EACpB7G,KAAKmhE,WAAaz4D,EA+FtB,QAASikD,GAAc/gC,EAAY2gC,EAAa5uD,EAAKmC,EAAKm1B,EAAQlxB,EAAKvG,EAAK4jE,EAAQj9D,EAAOk9D,EAAQzc,GAC/F5kD,KAAK4rB,WAAaA,EAClB5rB,KAAKshE,aAAe/U,EACpBvsD,KAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EACZE,KAAKi/D,QAAUhqC,EACfj1B,KAAKihE,KAAOl9D,EACZ/D,KAAKuhE,KAAO/jE,EACZwC,KAAKwhE,QAAUJ,EACfphE,KAAKyhE,OAASt9D,EACdnE,KAAK0hE,QAAUL,EACfrhE,KAAK2hE,eAAiB/c,EAyJ1B,QAAS4F,GAAgBrhD,EAAO7B,EAAGmqC,EAAGxc,GAClCj1B,KAAKmJ,MAAQA,EACbnJ,KAAKi/D,QAAUhqC,EACfj1B,KAAK4/D,GAAKt4D,EACVtH,KAAK4hE,GAAKnwB,EAwCd,QAASka,GAAWrkD,EAAGmqC,EAAGxc,EAAQud,GAC9BxyC,KAAK4/D,GAAKt4D,EACVtH,KAAK4hE,GAAKnwB,EACVzxC,KAAKi/D,QAAUhqC,EACfj1B,KAAKygD,MAAQjO,EAmCjB,QAASiS,GAAUxvB,EAAQ4sC,EAASC,GAChC9hE,KAAKi/D,QAAUhqC,GAAU,GACzBj1B,KAAK6hE,QAAUA,GAAW,EAC1B7hE,KAAK8hE,QAAUA,GAAW,GAgD9B,QAASlY,GAAUtiD,EAAGnO,EAAGuwD,EAAQlX,EAAMwN,GACnC8e,EAAc/kE,KAAKiG,KAAMggD,EAAQxN,GACjCxyC,KAAK4/D,GAAKt4D,EACVtH,KAAK+hE,GAAK5oE,EACV6G,KAAKgiE,QAAUtY,EAoCnB,QAASD,GAAcniD,EAAG2tB,EAAQgtC,EAAUzvB,EAAMwN,GAC9ChgD,KAAK4/D,GAAKt4D,EACVtH,KAAKi/D,QAAUhqC,EACfj1B,KAAKkiE,UAAYD,EACjBjiE,KAAKygD,MAAQjO,EACbxyC,KAAKkgD,QAAUF,EACfhgD,KAAKmiE,IAAMltC,EAAS,EA6CxB,QAASoyB,KACLrnD,KAAKoiE,GAAK,EACVpiE,KAAKqiE,GAAK,EACVriE,KAAKqtB,UA5/CT,GAAwB,mBAAb7zB,GACP,GAAI0E,GAAQ1E,EAAQ,WAChB6E,EAAQH,EAAMG,MACdD,EAAQF,EAAME,MAEdyH,EAAQrM,EAAQ,WAChB8oE,EAAgBz8D,EAAMy8D,cACtBC,EAAyB18D,EAAM08D,uBAE/BC,EAAOhpE,EAAQ,eACfipE,EAASD,EAAKC,OAEdC,GADWF,EAAKG,SACNH,EAAKE,QAQvB5D,GAAcn/D,UAAU23D,KAAO,SAASz1C,GACpCA,EAAE8sC,YACF3uD,KAAK4iE,SAAS/gD,GAEV7hB,KAAKygD,QACL5+B,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAE2wB,QAEFxyC,KAAKkgD,UACLr+B,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAEm+B,WAIV8e,EAAcn/D,UAAUkjE,MAAQ,WAC5B,GAAIhhD,GAAI,GAAI6gD,EAGZ,OAFA1iE,MAAK4iE,SAAS/gD,GAEPygD,EACHG,EAAQ,OACR,MACCvtD,EAAG2M,EAAEihD,aACLtwB,KAAMxyC,KAAKygD,OAAS,OACpBT,OAAQhgD,KAAKkgD,SAAW,UAGjC4e,EAAcn/D,UAAUijE,SAAW,SAAS/gD,GACxC,KAAM,uDAcVigC,EAASniD,UAAU23D,KAAO,SAASz1C,GAC/B,GAAI1oB,GAAI6G,KAAKm/D,OAEThmE,GAAI,GACJ0oB,EAAE8sC,YACF9sC,EAAE+sC,OAAO5uD,KAAKsH,EAAInO,EAAG6G,KAAKyxC,GAC1B5vB,EAAEgtC,OAAO7uD,KAAKsH,EAAItH,KAAKg/D,OAAS7lE,EAAG6G,KAAKyxC,GACxC5vB,EAAEkhD,MAAM/iE,KAAKsH,EAAItH,KAAKg/D,OAAQh/D,KAAKyxC,EAAGzxC,KAAKsH,EAAItH,KAAKg/D,OAAQh/D,KAAKyxC,EAAIt4C,EAAGA,GACxE0oB,EAAEgtC,OAAO7uD,KAAKsH,EAAItH,KAAKg/D,OAAQh/D,KAAKyxC,EAAIzxC,KAAKi/D,QAAU9lE,GACvD0oB,EAAEkhD,MAAM/iE,KAAKsH,EAAItH,KAAKg/D,OAAQh/D,KAAKyxC,EAAIzxC,KAAKi/D,QAASj/D,KAAKsH,EAAItH,KAAKg/D,OAAS7lE,EAAG6G,KAAKyxC,EAAIzxC,KAAKi/D,QAAS9lE,GACtG0oB,EAAEgtC,OAAO7uD,KAAKsH,EAAInO,EAAG6G,KAAKyxC,EAAIzxC,KAAKi/D,SACnCp9C,EAAEkhD,MAAM/iE,KAAKsH,EAAGtH,KAAKyxC,EAAIzxC,KAAKi/D,QAASj/D,KAAKsH,EAAGtH,KAAKyxC,EAAIzxC,KAAKi/D,QAAU9lE,EAAGA,GAC1E0oB,EAAEgtC,OAAO7uD,KAAKsH,EAAGtH,KAAKyxC,EAAIt4C,GAC1B0oB,EAAEkhD,MAAM/iE,KAAKsH,EAAGtH,KAAKyxC,EAAGzxC,KAAKsH,EAAInO,EAAG6G,KAAKyxC,EAAGt4C,GAC5C0oB,EAAEu1C,YAEiB,MAAfp3D,KAAKk/D,SACLr9C,EAAEslC,OACFtlC,EAAE2sC,YAAcxuD,KAAKk/D,QAGrBl/D,KAAKwyC,OACL3wB,EAAE6kC,UAAY1mD,KAAKwyC,KACnB3wB,EAAE2wB,QAEFxyC,KAAKggD,SACLn+B,EAAE4sC,YAAczuD,KAAKggD,OACrBn+B,EAAE6sC,UAAY,GACd7sC,EAAEm+B,UAGa,MAAfhgD,KAAKk/D,QACLr9C,EAAE27B,YAGa,MAAfx9C,KAAKk/D,SACLr9C,EAAEslC,OACFtlC,EAAE2sC,YAAcxuD,KAAKk/D,QAGrBl/D,KAAKwyC,OACL3wB,EAAE6kC,UAAY1mD,KAAKwyC,KACnB3wB,EAAE8kC,SAAS3mD,KAAKsH,EAAGtH,KAAKyxC,EAAGzxC,KAAKg/D,OAAQh/D,KAAKi/D,UAG7Cj/D,KAAKggD,SACLn+B,EAAE4sC,YAAczuD,KAAKggD,OACrBn+B,EAAE6sC,UAAY,GACd7sC,EAAEmhD,WAAWhjE,KAAKsH,EAAGtH,KAAKyxC,EAAGzxC,KAAKg/D,OAAQh/D,KAAKi/D,UAGhC,MAAfj/D,KAAKk/D,QACLr9C,EAAE27B,YAKdsE,EAASniD,UAAUkjE,MAAQ,WACvB,GAAIzpE,GAAIkpE,EAAcG,EAAQ,OAAQ,MAChBn7D,EAAGtH,KAAKsH,EACRmqC,EAAGzxC,KAAKyxC,EACRj0B,MAAOxd,KAAKg/D,OACZ/pC,OAAQj1B,KAAKi/D,QACbjf,OAAQhgD,KAAKggD,QAAU,OACvByX,YAAa,GACbjlB,KAAMxyC,KAAKwyC,MAAQ,QAKzC,OAJmB,OAAfxyC,KAAKk/D,QACL9lE,EAAEitB,aAAa,UAAWrmB,KAAKk/D,QAG5B9lE,GAGX0oD,EAASniD,UAAUhC,IAAM,WACrB,MAAOqC,MAAKsH,GAGhBw6C,EAASniD,UAAUG,IAAM,WACrB,MAAOE,MAAKsH,EAAItH,KAAKg/D,QAGzBld,EAASniD,UAAUs1B,OAAS,WACxB,MAAOj1B,MAAKyxC,EAAIzxC,KAAKi/D,SAkBzBxgB,EAAW9+C,UAAUsjE,eAAiB,SAASphD,GAE3C,IAAK,GADD1Z,GAASnI,KAAKq/D,SAASl3D,SAClBhP,EAAI,EAAGA,EAAIgP,EAAOnO,SAAUb,EAAG,CACpC,GAAI+pE,GAAK/6D,EAAOhP,GACZgqE,EAAOh7D,EAAOhP,EAAI,EACtB,IAAIgqE,GAAQD,EAAGvlE,MAAQwlE,EAAKrjE,MAAO,CAC/B,GAAIyG,GAAQ48D,EAAKrjE,MACb2G,EAAMy8D,EAAGvlE,MACTwqC,GAAO5hC,EAAME,GAAK,CAEC,UAAnBzG,KAAKi+C,WACLp8B,EAAE+sC,OAAOroD,EAAOvG,KAAK0mC,EAAE,GACvB7kB,EAAEgtC,OAAO1mB,EAAK,GACdtmB,EAAEgtC,OAAOpoD,EAAKzG,KAAK0mC,EAAE,IACK,SAAnB1mC,KAAKi+C,WACZp8B,EAAE+sC,OAAOroD,EAAOvG,KAAK0mC,EAAE,GACvB7kB,EAAEgtC,OAAO1mB,EAAKnoC,KAAK0mC,GACnB7kB,EAAEgtC,OAAOpoD,EAAKzG,KAAK0mC,EAAE,IACK,eAAnB1mC,KAAKi+C,WACZp8B,EAAE+sC,OAAOroD,EAAOvG,KAAK0mC,EAAE,GACvB7kB,EAAEgtC,OAAOpoD,EAAKzG,KAAK0mC,EAAE,GACjBjgC,EAAMF,EAAQ,IACdsb,EAAE+sC,OAAOzmB,EAAM,EAAInoC,KAAK0mC,EAAE,EAAK,GAC/B7kB,EAAEgtC,OAAO1mB,EAAM,EAAGnoC,KAAK0mC,EAAE,GACzB7kB,EAAEgtC,OAAO1mB,EAAM,EAAInoC,KAAK0mC,EAAE,EAAK,KAET,eAAnB1mC,KAAKi+C,WACZp8B,EAAE+sC,OAAOroD,EAAOvG,KAAK0mC,EAAE,GACvB7kB,EAAEgtC,OAAOpoD,EAAKzG,KAAK0mC,EAAE,GACjBjgC,EAAMF,EAAQ,IACdsb,EAAE+sC,OAAOzmB,EAAM,EAAInoC,KAAK0mC,EAAE,EAAK,GAC/B7kB,EAAEgtC,OAAO1mB,EAAM,EAAGnoC,KAAK0mC,EAAE,GACzB7kB,EAAEgtC,OAAO1mB,EAAM,EAAInoC,KAAK0mC,EAAE,EAAK,MAGnC7kB,EAAE+sC,OAAOroD,EAAOvG,KAAK0mC,EAAE,GACvB7kB,EAAEgtC,OAAOpoD,EAAKzG,KAAK0mC,EAAE,IAG7By8B,EAAOD,IAIfzkB,EAAW9+C,UAAU23D,KAAO,SAASz1C,EAAGmtB,GACpC,IAAK,GAAIv1C,GAAI,EAAGA,EAAIuG,KAAKqtB,OAAOrzB,SAAUP,EAAG,CACzC,GAAIypE,GAAKljE,KAAKqtB,OAAO5zB,EACrBypE,GAAG5L,KAAKz1C,EAAGmtB,GAGfntB,EAAE4sC,YAAc,QAChB5sC,EAAE8sC,YACF3uD,KAAKijE,eAAephD,GACpBA,EAAEm+B,UAGNvB,EAAW9+C,UAAUkjE,MAAQ;AAEzB,IAAK,GADDhhD,GAAIygD,EAAcG,EAAQ,KACrBhpE,EAAI,EAAGA,EAAIuG,KAAKqtB,OAAOrzB,SAAUP,EACtCooB,EAAE7F,YAAYhc,KAAKqtB,OAAO5zB,GAAGopE,QAGjC,IAAItoE,GAAI,GAAImoE,EACZ1iE,MAAKijE,eAAe1oE,EAEpB,IAAI6oE,GAAW7oE,EAAEuoE,YACjB,IAAIM,EAASppE,OAAS,EAAG,CACrB,GAAI6hB,GAAOymD,EACPG,EAAQ,OACR,MACCvtD,EAAG3a,EAAEuoE,aACLtwB,KAAM,OACNwN,OAAQ,QACRyX,YAAa,IAClB51C,GAAE7F,YAAYH,GAGlB,MAAOgG,IAGX48B,EAAW9+C,UAAUhC,IAAM,WACvB,MAAOqC,MAAKq/D,SAAS1hE,OAGzB8gD,EAAW9+C,UAAUG,IAAM,WACvB,MAAOE,MAAKq/D,SAASv/D,OAGzB2+C,EAAW9+C,UAAUs1B,OAAS,WAC1B,MAAOj1B,MAAK0mC,GAUhBinB,EAAehuD,UAAUhC,IAAM,WAC3B,MAAOqC,MAAK0pD,OAAO,GAAGpiD,GAI1BqmD,EAAehuD,UAAUG,IAAM,WAC3B,MAAOE,MAAK0pD,OAAO1pD,KAAK0pD,OAAO1vD,OAAS,GAAGsN,GAI/CqmD,EAAehuD,UAAUs1B,OAAS,WAC9B,MAAOj1B,MAAKi/D,SAGhBtR,EAAehuD,UAAU23D,KAAO,SAASz1C,GACrCA,EAAEslC,OACFtlC,EAAE4sC,YAAczuD,KAAK8G,MACrB+a,EAAE6sC,UAAY,EACd7sC,EAAE8sC,YACF3uD,KAAK0pD,OAAO9tC,QAAQ,SAASrhB,EAAGd,GAClB,IAANA,EACAooB,EAAE+sC,OAAOr0D,EAAE+M,EAAG/M,EAAEk3C,GAEhB5vB,EAAEgtC,OAAOt0D,EAAE+M,EAAG/M,EAAEk3C,KAExB5vB,EAAEm+B,SACFn+B,EAAE27B,WAGNmQ,EAAehuD,UAAUkjE,MAAQ,WAE7B,IAAK,GADDtoE,GAAI,GAAImoE,GACHjpE,EAAI,EAAGA,EAAIuG,KAAK0pD,OAAO1vD,SAAUP,EAAG,CACzC,GAAI6N,GAAItH,KAAK0pD,OAAOjwD,GAAG6N,EACnBmqC,EAAIzxC,KAAK0pD,OAAOjwD,GAAGg4C,CACd,IAALh4C,EACAc,EAAEq0D,OAAOtnD,EAAGmqC,GAEZl3C,EAAEs0D,OAAOvnD,EAAGmqC,GAIpB,MAAO6wB,GACHG,EAAQ,OACR,MACCvtD,EAAG3a,EAAEuoE,aACLtwB,KAAM,OACNwN,OAAQhgD,KAAK8G,MACb2wD,YAAa,SAyBtB/Y,EAAc/+C,UAAUkjE,MAAQ,WAC5B,GAAI1tB,GAAQn1C,KAAKmJ,MAAM05D,QACnBphE,IAmBJ,OAjBkB,SAAdzB,KAAK6lB,OACLsvB,EAAQmtB,EAAcG,EAAQ,IAAKttB,GAAQkuB,UAAW,iBAAmC,EAAhBrjE,KAAKuqD,YAAoB,MAClG9oD,EAAKgwC,EAAIzxC,KAAKuqD,YAEd9oD,EAAKgwC,EAAIzxC,KAAKmJ,MAAM8rB,SAAW,GAG/Bj1B,KAAKm3D,OACL11D,EAAK6hE,SAAY,GAGjB,UAAYtjE,KAAKw/D,OACjB/9D,EAAK6F,GAAKtH,KAAKmJ,MAAMxL,MAAQqC,KAAKmJ,MAAMrJ,MAAQE,KAAK0/D,SAAW,EAEhEj+D,EAAK6F,EAAItH,KAAKmJ,MAAMxL,MAGjB2kE,EAAcG,EAAQ,KACxBttB,EACAmtB,EAAcG,EAAQ,OAAQziE,KAAKqxD,KAAM5vD,MAGlDi9C,EAAc/+C,UAAUhC,IAAM,WAC1B,MAAOqC,MAAKmJ,MAAMxL,OAGtB+gD,EAAc/+C,UAAUG,IAAM,WAC1B,MAAIE,MAAK2/D,SACEjiE,KAAKoC,IAAIE,KAAKmJ,MAAMrJ,MAAQ,EAAIE,KAAKmJ,MAAMxL,MAASqC,KAAK0/D,QAAU,IAEnE1/D,KAAKmJ,MAAMrJ,OAG1B4+C,EAAc/+C,UAAUs1B,OAAS,WAC7B,GAAIyR,GAAI1mC,KAAKmJ,MAAM8rB,QAQnB,OAPIj1B,MAAK2/D,WAEDj5B,GADc,SAAd1mC,KAAK6lB,MACA7lB,KAAKuqD,WAAa,EAElB,IAGN7jB,GAGXgY,EAAc/+C,UAAU23D,KAAO,SAASz1C,EAAGmtB,GACrB,SAAdhvC,KAAK6lB,QACLhE,EAAEslC,OACFtlC,EAAEylC,UAAU,EAAGtnD,KAAKuqD,WAAa,IAErCvqD,KAAKmJ,MAAMmuD,KAAKz1C,GACE,SAAd7hB,KAAK6lB,OACLhE,EAAE27B,UAGNxO,EAAGu0B,cAAcvjE,OAGrB0+C,EAAc/+C,UAAUmlC,YAAc,SAASjjB,EAAG2hD,EAAYC,GAC1D5hD,EAAE6kC,UAAY,QACV1mD,KAAKm3D,OACLt1C,EAAEslC,OACFtlC,EAAEs1C,KAAOn3D,KAAKm3D,KAElB,IAAI58D,EACA,WAAYyF,KAAKw/D,OACjBjlE,GAAKyF,KAAKmJ,MAAMxL,MAAQqC,KAAKmJ,MAAMrJ,MAAQE,KAAK0/D,SAAW,GAE3DnlE,EAAIyF,KAAKmJ,MAAMxL,MACP6lE,EAAJjpE,IACAA,EAAImD,KAAKC,IAAI6lE,EAAYxjE,KAAKmJ,MAAMrJ,MAAQE,KAAK0/D,WAGzD79C,EAAEqtC,SAASlvD,KAAKqxD,KAAM92D,EAAiB,SAAdyF,KAAK6lB,MAAmB7lB,KAAKuqD,WAAavqD,KAAKmJ,MAAM8rB,SAAW,IACrFj1B,KAAKm3D,MACLt1C,EAAE27B,WAYVqM,EAAWlqD,UAAU23D,KAAO,SAASz1C,GACjC,GAAI6hD,GAAK1jE,KAAKi/D,QAAQ,CAEtBp9C,GAAE8sC,YACF9sC,EAAE+sC,OAAO5uD,KAAK4/D,GAAI,GAClB/9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAI5/D,KAAKi/D,SACvBp9C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK8D,EAAIA,GACvB7hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK8D,EAAIA,GAEvB7hD,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAE6sC,UAAY,EAEd7sC,EAAEm+B,UAGN6J,EAAWlqD,UAAUkjE,MAAQ,WACzB,GAAIa,GAAK1jE,KAAKi/D,QAAQ,EAElBp9C,EAAI,GAAI6gD,EAMZ,OALA7gD,GAAE+sC,OAAO5uD,KAAK4/D,GAAI,GAClB/9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAI5/D,KAAKi/D,SACvBp9C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK8D,EAAIA,GACvB7hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK8D,EAAIA,GAEhBpB,EACHG,EAAQ,OACR,MACCvtD,EAAG2M,EAAEihD,aACLtwB,KAAM,OACNwN,OAAQhgD,KAAKkgD,QACbuX,YAAa,SAGtB5N,EAAWlqD,UAAUhC,IAAM,WACvB,MAAOqC,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlCpV,EAAWlqD,UAAUG,IAAM,WACvB,MAAOE,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlCpV,EAAWlqD,UAAUs1B,OAAS,WAC1B,MAAOj1B,MAAKi/D,SAShB5V,EAAQ1pD,UAAU23D,KAAO,SAASz1C,GAC9B,GAAI6hD,GAAK1jE,KAAKi/D,QAAQ,CAEtBp9C,GAAE8sC,YACF9sC,EAAE+sC,OAAO5uD,KAAK4/D,GAAK8D,EAAI,GACvB7hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK8D,EAAI1jE,KAAKi/D,SAC5Bp9C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK8D,EAAI1jE,KAAKi/D,SAC5Bp9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAK8D,EAAI,GAEvB7hD,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAE6sC,UAAY,EAEd7sC,EAAEm+B,UAGNqJ,EAAQ1pD,UAAUkjE,MAAQ,WACtB,GAAIa,GAAK1jE,KAAKi/D,QAAQ,EAElBp9C,EAAI,GAAI6gD,EAMZ,OALA7gD,GAAE+sC,OAAO5uD,KAAK4/D,GAAK8D,EAAI,GACvB7hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK8D,EAAI1jE,KAAKi/D,SAC5Bp9C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK8D,EAAI1jE,KAAKi/D,SAC5Bp9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAK8D,EAAI,GAEhBpB,EACHG,EAAQ,OACR,MACCvtD,EAAG2M,EAAEihD,aACLtwB,KAAM,OACNwN,OAAQhgD,KAAKkgD,QACbuX,YAAa,SAGtBpO,EAAQ1pD,UAAUhC,IAAM,WACpB,MAAOqC,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlC5V,EAAQ1pD,UAAUG,IAAM,WACpB,MAAOE,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlC5V,EAAQ1pD,UAAUs1B,OAAS,WACvB,MAAOj1B,MAAKi/D,SAchBzd,EAAc7hD,UAAY+8C,OAAO4X,OAAOwK,EAAcn/D,WAEtD6hD,EAAc7hD,UAAUijE,SAAW,SAAS/gD,GACxC,GAAI6hD,GAAK1jE,KAAKi/D,QAAQ,EAClB0E,EAAK3jE,KAAKg/D,OAAO,CAEH,OAAdh/D,KAAK6/D,MACLh+C,EAAE+sC,OAAO5uD,KAAK4/D,GAAI5/D,KAAKi/D,SACvBp9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI,GACvB9hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI,IACF,MAAd3jE,KAAK6/D,MACZh+C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK+D,EAAID,GACvB7hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI,GACvB9hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI3jE,KAAKi/D,UACP,MAAdj/D,KAAK6/D,MACZh+C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK+D,EAAID,GACvB7hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI,GACvB9hD,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI3jE,KAAKi/D,WAE5Bp9C,EAAE+sC,OAAO5uD,KAAK4/D,GAAK,GACnB/9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI3jE,KAAKi/D,SAC5Bp9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAK+D,EAAI3jE,KAAKi/D,UAGhCp9C,EAAEu1C,aAGN5V,EAAc7hD,UAAUhC,IAAM,WAC1B,MAAOqC,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlCzd,EAAc7hD,UAAUG,IAAM,WAC1B,MAAOE,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlCzd,EAAc7hD,UAAUs1B,OAAS,WAC7B,MAAOj1B,MAAKi/D,SAahBzV,EAAS7pD,UAAU23D,KAAO,SAASz1C,GAC/B,GAAI6hD,GAAK1jE,KAAKi/D,QAAQ,CACtBp9C,GAAE6kC,UAAY1mD,KAAKkgD,QACnBr+B,EAAE8sC,YACF9sC,EAAE+hD,IAAI5jE,KAAK4/D,GAAI8D,EAAIA,EAAI,EAAG,MAEtB1jE,KAAKygD,QACL5+B,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAE2wB,QAGFxyC,KAAKkgD,UACLr+B,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAEm+B,WAIVwJ,EAAS7pD,UAAUkjE,MAAQ,WACvB,GAAIa,GAAK1jE,KAAKi/D,QAAQ,CACtB,OAAOqD,GACHG,EAAQ,SACR,MACCoB,GAAI7jE,KAAK4/D,GAAIkE,GAAIJ,EAAIvqE,EAAGuqE,EACxBlxB,KAAMxyC,KAAKygD,OAAS,OACpBT,OAAQhgD,KAAKkgD,SAAW,OACxBuX,YAAa,SAGtBjO,EAAS7pD,UAAUhC,IAAM,WACrB,MAAOqC,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlCzV,EAAS7pD,UAAUG,IAAM,WACrB,MAAOE,MAAK4/D,GAAK5/D,KAAKi/D,QAAQ,GAGlCzV,EAAS7pD,UAAUs1B,OAAS,WACxB,MAAOj1B,MAAKi/D,SAahBxf,EAAY9/C,UAAU23D,KAAO,SAASz1C,EAAGmtB,GACjChvC,KAAKmJ,OACLnJ,KAAKmJ,MAAMmuD,KAAKz1C,EAAGmtB,IAG3ByQ,EAAY9/C,UAAUkjE,MAAQ,WAC1B,MAAI7iE,MAAKmJ,MACEnJ,KAAKmJ,MAAM05D,QAEXP,EAAcG,EAAQ,MAIrChjB,EAAY9/C,UAAUhC,IAAM,WACxB,MAAOqC,MAAKsvC,MAGhBmQ,EAAY9/C,UAAUG,IAAM,WACxB,MAAOE,MAAKuvC,MAGhBkQ,EAAY9/C,UAAUs1B,OAAS,WAC3B,MAAIj1B,MAAKmJ,MACEnJ,KAAKmJ,MAAM8rB,SAEX,GAafgrB,EAAYtgD,UAAY+8C,OAAO4X,OAAOwK,EAAcn/D,WAEpDsgD,EAAYtgD,UAAUhC,IAAM,WACxB,MAAOqC,MAAKsvC,MAGhB2Q,EAAYtgD,UAAUG,IAAM,WACxB,MAAOE,MAAKuvC,MAGhB0Q,EAAYtgD,UAAUs1B,OAAS,WAC3B,MAAOj1B,MAAKi/D,SAGhBhf,EAAYtgD,UAAUijE,SAAW,SAAS/gD,GACtC,GAAIo9B,GAASj/C,KAAKuvC,KACdwP,EAAS/+C,KAAKsvC,KACdra,EAASj1B,KAAKi/D,QACd8E,EAAS,EACTC,EAAS,EACTC,EAAYjkE,KAAKi/D,QAAU,EAC3BiF,EAAS,QAAWlkE,KAAKi/D,QACzBxtB,EAAI,CAEJzxC,MAAKggE,OACa,MAAdhgE,KAAKggE,KACLgE,EAAS,GAAMhkE,KAAKi/D,QACC,MAAdj/D,KAAKggE,OACZ+D,EAAS,GAAM/jE,KAAKi/D,UAINgF,EAAlBhlB,EAASF,IACTA,GAAUE,EAASF,EAASklB,GAAa,EACzChlB,EAASF,EAASklB,GAGtBpiD,EAAE+sC,OAAO7P,EAASglB,EAAQtyB,EAAEyyB,GAC5BriD,EAAEgtC,OAAO5P,EAAS+kB,EAAQvyB,EAAEyyB,GAC5BriD,EAAEgtC,OAAO5P,EAAS+kB,EAAQvyB,GAC1B5vB,EAAEgtC,OAAO5P,EAAQxN,EAAIzxC,KAAKi/D,QAAQ,GAClCp9C,EAAEgtC,OAAO5P,EAAS+kB,EAAQvyB,EAAExc,GAC5BpT,EAAEgtC,OAAO5P,EAAS+kB,EAAQvyB,EAAEyyB,EAAOA,GACnCriD,EAAEgtC,OAAO9P,EAASglB,EAAQtyB,EAAEyyB,EAAOA,GACnCriD,EAAEgtC,OAAO9P,EAASglB,EAAQtyB,EAAExc,GAC5BpT,EAAEgtC,OAAO9P,EAAQtN,EAAExc,EAAO,GAC1BpT,EAAEgtC,OAAO9P,EAASglB,EAAQtyB,GAC1B5vB,EAAEgtC,OAAO9P,EAASglB,EAAQtyB,EAAEyyB,IAUhC/jB,EAAUxgD,UAAY+8C,OAAO4X,OAAOwK,EAAcn/D,WAElDwgD,EAAUxgD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MAClD6Q,EAAUxgD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MAClD4Q,EAAUxgD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAErD9e,EAAUxgD,UAAUijE,SAAW,SAAS/gD,GACpC,GAAIk9B,GAAS/+C,KAAKsvC,KAAM2P,EAASj/C,KAAKuvC,KAClCta,EAASj1B,KAAKi/D,QAASyE,EAAKzuC,EAAO,CACvCpT,GAAE+sC,OAAO7P,EAAQ2kB,GACjB7hD,EAAEgtC,OAAO5P,EAAQykB,GACjB7hD,EAAE+sC,OAAO7P,EAAQ,GACjBl9B,EAAEgtC,OAAO9P,EAAQ9pB,GACjBpT,EAAE+sC,OAAO3P,EAAQ,GACjBp9B,EAAEgtC,OAAO5P,EAAQhqB,IAYrBsrB,EAAU5gD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MAClDiR,EAAU5gD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MAClDgR,EAAU5gD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAErD1e,EAAU5gD,UAAUijE,SAAW,SAAS/gD,GACpC,GAAIk9B,GAAS/+C,KAAKsvC,KAAM2P,EAASj/C,KAAKuvC,KAClCta,EAASj1B,KAAKi/D,QAASyE,EAAKzuC,EAAO,CAEnB,SAAhBj1B,KAAKigE,QACLp+C,EAAE+sC,OAAO7P,EAAQ2kB,GACjB7hD,EAAEgtC,QAAQ9P,EAASE,GAAQ,EAAoB,MAAjBj/C,KAAKkgE,QAAkBjrC,EAAS,GAC9DpT,EAAEgtC,OAAO5P,EAAQykB,KAEjB7hD,EAAE+sC,OAAO7P,EAAQ2kB,GACjB7hD,EAAEgtC,OAAO5P,EAAQykB,KAKzBnjB,EAAU5gD,UAAU23D,KAAO,SAASz1C,GAChCA,EAAE8sC,YACF3uD,KAAK4iE,SAAS/gD,GACdA,EAAE4sC,YAAczuD,KAAKkgD,QACD,WAAhBlgD,KAAKigE,QAAuBp+C,EAAEsiD,aAC9BtiD,EAAEslC,OACFtlC,EAAEsiD,aAAa,IACftiD,EAAEm+B,SACFn+B,EAAE27B,WAEF37B,EAAEm+B,UAIVO,EAAU5gD,UAAUkjE,MAAQ,WACxB,GAAIhhD,GAAI,GAAI6gD,EACZ1iE,MAAK4iE,SAAS/gD,EAEd,IAAIpgB,IAAQyT,EAAG2M,EAAEihD,aACT9iB,OAAQhgD,KAAKkgD,SAAW,OAKhC,OAJoB,WAAhBlgD,KAAKigE,SACLx+D,EAAA,gBAA0B,KAGvB6gE,EACHG,EAAQ,OACR,KAAMhhE,IAgBdi/C,EAAa/gD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MACrDoR,EAAa/gD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MACrDmR,EAAa/gD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAGxDve,EAAa/gD,UAAUykE,aAAe,SAASviD,GAC3C,GAAIk9B,GAAS/+C,KAAKsvC,KAAM2P,EAASj/C,KAAKuvC,KAClCta,EAASj1B,KAAKi/D,QAASyE,EAAKzuC,EAAO,CACvCpT,GAAE+sC,OAAO7P,EAAQ2kB,GACjB7hD,EAAEgtC,OAAO5P,EAAQykB,IAGrBhjB,EAAa/gD,UAAU0kE,cAAgB,SAASxiD,GAC5C,GAAIk9B,GAAS/+C,KAAKsvC,KAAM2P,EAASj/C,KAAKuvC,KAClCta,EAASj1B,KAAKi/D,QAASyE,EAAKzuC,EAAO,CACvCpT,GAAE+sC,OAAO7P,EAAQ,GACjBl9B,EAAEgtC,OAAO9P,EAAS9pB,EAAQyuC,GAC1B7hD,EAAEgtC,OAAO9P,EAAQ9pB,GACjBpT,EAAEgtC,OAAO9P,EAAQ,GACjBl9B,EAAE+sC,OAAO3P,EAAQ,GACjBp9B,EAAEgtC,OAAO5P,EAAShqB,EAAQyuC,GAC1B7hD,EAAEgtC,OAAO5P,EAAQhqB,GACjBpT,EAAEgtC,OAAO5P,EAAQ,IAIrByB,EAAa/gD,UAAU23D,KAAO,SAASz1C,GACnCA,EAAE8sC,YACF3uD,KAAKokE,aAAaviD,GAClBA,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAEm+B,SACFn+B,EAAE8sC,YACF3uD,KAAKqkE,cAAcxiD,GACnBA,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAE2wB,QAGNkO,EAAa/gD,UAAUkjE,MAAQ,WAC3B,GAAIzpE,GAAI,GAAIspE,EACZ1iE,MAAKokE,aAAahrE,EAClB,IAAIH,GAAI,GAAIypE,EAGZ,OAFA1iE,MAAKqkE,cAAcprE,GAEZqpE,EACHG,EAAQ,KACPH,EACGG,EAAQ,OACR,MACCvtD,EAAG9b,EAAE0pE,aACL9iB,OAAQhgD,KAAKkgD,SAAW,SAC5BoiB,EACIG,EAAQ,OACR,MACCvtD,EAAGjc,EAAE6pE,aACLtwB,KAAMxyC,KAAKygD,OAAS,YAclCV,EAAWpgD,UAAY+8C,OAAO4X,OAAOwK,EAAcn/D,WAEnDogD,EAAWpgD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MACnDyQ,EAAWpgD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MACnDwQ,EAAWpgD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAEtDlf,EAAWpgD,UAAUijE,SAAW,SAAS/gD,GACrC,GAAIlkB,GAAMqC,KAAKsvC,KAAMxvC,EAAME,KAAKuvC,KAAMta,EAASj1B,KAAKi/D,OAEpD,IAAIj/D,KAAKmgE,UAAW,CAChB,GAAIuD,GAAKzuC,EAAO,EACZivC,EAAS,GAAMjvC,CACfj1B,MAAKogE,KACLv+C,EAAE+sC,OAAOjxD,EAAM+lE,EAAIzuC,EAAOivC,GAC1BriD,EAAEgtC,OAAOlxD,EAAM+lE,EAAIzuC,GACnBpT,EAAEgtC,OAAOlxD,EAAK+lE,GACd7hD,EAAEgtC,OAAOlxD,EAAM+lE,EAAI,GACnB7hD,EAAEgtC,OAAOlxD,EAAM+lE,EAAIQ,KAEnBriD,EAAE+sC,OAAOjxD,EAAKs3B,EAAOivC,GACrBriD,EAAEgtC,OAAOlxD,EAAKumE,IAEdlkE,KAAKqgE,KACLx+C,EAAEgtC,OAAO/uD,EAAM4jE,EAAIQ,GACnBriD,EAAEgtC,OAAO/uD,EAAM4jE,EAAI,GACnB7hD,EAAEgtC,OAAO/uD,EAAK4jE,GACd7hD,EAAEgtC,OAAO/uD,EAAM4jE,EAAIzuC,GACnBpT,EAAEgtC,OAAO/uD,EAAM4jE,EAAIzuC,EAASivC,KAE5BriD,EAAEgtC,OAAO/uD,EAAKokE,GACdriD,EAAEgtC,OAAO/uD,EAAKm1B,EAAOivC,IAEzBriD,EAAEu1C,gBACC,CACH,GAAIjvB,IAAOxqC,EAAImC,GAAK,EAChBokE,EAAS,IAAKpkE,EAAInC,GAClB03B,EAAKJ,EAAO,CAEZj1B,MAAKqgE,KACLx+C,EAAE+sC,OAAOjxD,EAAMumE,EAAQ7uC,GACvBxT,EAAEgtC,OAAOlxD,EAAK03B,GACdxT,EAAEgtC,OAAO1mB,EAAK,GACdtmB,EAAEgtC,OAAO/uD,EAAKu1B,GACdxT,EAAEgtC,OAAO/uD,EAAMokE,EAAQ7uC,KAEvBxT,EAAE+sC,OAAOjxD,EAAIumE,EAAQ,GACrBriD,EAAEgtC,OAAO/uD,EAAIokE,EAAQ,IAErBlkE,KAAKogE,KACLv+C,EAAEgtC,OAAO/uD,EAAMokE,EAAQjvC,EAAOI,GAC9BxT,EAAEgtC,OAAO/uD,EAAKm1B,EAAOI,GACrBxT,EAAEgtC,OAAO1mB,EAAKlT,GACdpT,EAAEgtC,OAAOlxD,EAAKs3B,EAAOI,GACrBxT,EAAEgtC,OAAOlxD,EAAMumE,EAAQjvC,EAAOI,KAE9BxT,EAAEgtC,OAAO/uD,EAAMokE,EAAQjvC,GACvBpT,EAAEgtC,OAAOlxD,EAAMumE,EAAQjvC,IAE3BpT,EAAEu1C,cAaVnW,EAAathD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MACrD2R,EAAathD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MACrD0R,EAAathD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAExDhe,EAAathD,UAAUkjE,MAAQ,WAC3B,MAAOP,GAAcG,EAAQ,OAAQ,MACfn7D,EAAGtH,KAAKsvC,KACRmC,EAAG,EACHj0B,MAAOxd,KAAKuvC,KAAOvvC,KAAKsvC,KACxBra,OAAQj1B,KAAKi/D,QACbjf,OAAQhgD,KAAKkgD,SAAW,OACxB1N,KAAMxyC,KAAKygD,OAAS,UAG9CQ,EAAathD,UAAU23D,KAAO,SAASz1C,GAKnC,GAJI7hB,KAAKygD,QACL5+B,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAE8kC,SAAS3mD,KAAKsvC,KAAM,EAAGtvC,KAAKuvC,KAAOvvC,KAAKsvC,KAAMtvC,KAAKi/D,UAErDj/D,KAAKkgD,QAAS,CACdr+B,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAEmhD,WAAWhjE,KAAKsvC,KAAM,EAAGtvC,KAAKuvC,KAAOvvC,KAAKsvC,KAAMtvC,KAAKi/D,SACvDp9C,EAAE8sC,WACF,KAAK,GAAIz1D,GAAI,EAAGA,EAAI8G,KAAKi/D,QAAS/lE,GAAK,EACnC2oB,EAAE+sC,OAAO5uD,KAAKsvC,KAAMp2C,GACpB2oB,EAAEgtC,OAAO7uD,KAAKuvC,KAAMr2C,EAExB2oB,GAAEm+B,WAaVc,EAAUnhD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MAClDwR,EAAUnhD,UAAUG,IAAM,WAAY,MAAOpC,MAAKoC,IAAIE,KAAKuvC,KAAMvvC,KAAKsvC,KAAOtvC,KAAKugE,WAClFzf,EAAUnhD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAErDne,EAAUnhD,UAAU23D,KAAO,SAASz1C,GAChCA,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAEqtC,SAASlvD,KAAKsgE,QAAStgE,KAAKsvC,KAAMtvC,KAAKi/D,QAAU,IAGvDne,EAAUnhD,UAAUkjE,MAAQ,WACxB,MAAOP,GAAcG,EAAQ,OAAQziE,KAAKsgE,SAAUh5D,EAAGtH,KAAKsvC,KAAMmC,EAAGzxC,KAAKi/D,QAAU,KAiDxF3c,EAAe3iD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MACvDgT,EAAe3iD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MACvD+S,EAAe3iD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAE1D3c,EAAe3iD,UAAU23D,KAAO,SAASoD,GACrC,GAAI32D,GAAM/D,KAAKihE,KACXn6D,EAAQ9G,KAAKygD,KAEjB,IAAK18C,EAAL,CAEA,GAAIwvB,IAASvzB,KAAKuvC,KAAOvvC,KAAKsvC,KAAO,GAAKvrC,EAAI/J,OAE1CsqE,GAAgB,EAAItkE,KAAKmhE,YAAc,EACvCoD,GAAgBxgE,EAAI/J,OAASsqE,GAAgB,EAC7CE,EAAoC,KAArBxkE,KAAKkhE,aAAsBoD,EAAeC,CAEzDC,GAAe,IACf9J,EAAGhU,UAAY5/C,EACf4zD,EAAG/T,SAAS3mD,KAAKsvC,KAAM,EAAG/b,EAAQixC,EAAcxkE,KAAKi/D,SAGzD,KAAK,GAAI1kE,GAAIiqE,EAAcjqE,EAAIwJ,EAAI/J,OAAQO,GAAK,EAAG,CAC/C,GAAIkqE,GAAQ1gE,EAAIyK,OAAOjU,EAAG,GAAG29C,aACJ,MAArBl4C,KAAKkhE,eACLuD,EAAQ5D,EAAkB4D,GAC9B,IAAIhE,GAAKgE,IAASlC,GAAyBA,EAAuBkC,GAAS,GAC3E39D,GAAwB,GAAhB29D,EAAMzqE,OAAcwmE,EAAeC,EAAIlmE,EAAGyF,KAAKygD,OAASzgD,KAAKygD,MACrEia,EAAGhU,UAAY5/C,EACf4zD,EAAG/T,SAAS3mD,KAAKsvC,KAAO/0C,EAAIg5B,EAAO,EAAGA,EAAQkxC,EAAMzqE,OAAQgG,KAAKi/D,SAE7D1rC,GAAS,GAAqB,GAAhBkxC,EAAMzqE,SACpB0gE,EAAGhU,UAAY,QACfgU,EAAGxL,SAASuR,EAAIzgE,KAAKsvC,MAAQ/0C,EAAE,GAAKg5B,EAAOvzB,KAAKi/D,aAK5D3c,EAAe3iD,UAAUkjE,MAAQ,WAC7B,GAAIhhD,GAAIygD,EAAcG,EAAQ,KAC1B1+D,EAAM/D,KAAKihE,KACXn6D,EAAQ9G,KAAKygD,KAEjB,KAAK18C,EACD,MAAO8d,EAEX,IAAI0R,IAASvzB,KAAKuvC,KAAOvvC,KAAKsvC,KAAO,GAAKvrC,EAAI/J,OAE1CsqE,GAAgB,EAAItkE,KAAKmhE,YAAc,EACvCoD,GAAgBxgE,EAAI/J,OAASsqE,GAAgB,EAC7CE,EAAoC,KAArBxkE,KAAKkhE,aAAsBoD,EAAeC,CAEzDC,GAAe,GACf3iD,EAAE7F,YACEsmD,EAAcG,EAAQ,OAAQ,MAC1Bn7D,EAAGtH,KAAKsvC,KACRmC,EAAG,EACHj0B,MAAO+V,EAAQixC,EACfvvC,OAAQj1B,KAAKi/D,QACbzsB,KAAM1rC,IAElB,KAAK,GAAIvM,GAAIiqE,EAAcjqE,EAAIwJ,EAAI/J,OAAQO,GAAK,EAAG,CAC/C,GAAIkqE,GAAQ1gE,EAAIyK,OAAOjU,EAAG,GAAG29C,aACJ,MAArBl4C,KAAKkhE,eACLuD,EAAQ5D,EAAkB4D,GAC9B,IAAIhE,GAAKgE,IAASlC,GAAyBA,EAAuBkC,GAAS,GAC3E39D,GAAwB,GAAhB29D,EAAMzqE,OAAcwmE,EAAeC,EAAIlmE,EAAGyF,KAAKygD,OAASzgD,KAAKygD,MACrE5+B,EAAE7F,YACEsmD,EAAcG,EAAQ,OAAQ,MAC1Bn7D,EAAGtH,KAAKsvC,KAAO/0C,EAAIg5B,EACnBke,EAAG,EACHj0B,MAAO+V,EAAQkxC,EAAMzqE,OACrBi7B,OAAQj1B,KAAKi/D,QACbzsB,KAAM1rC,KAEVysB,GAAS,GAAqB,GAAhBkxC,EAAMzqE,QACpB6nB,EAAE7F,YACEsmD,EAAcG,EAAQ,OAAQhC,GAC1Bn5D,EAAGtH,KAAKsvC,MAAQ/0C,EAAE,GAAKg5B,EACvBke,EAAGzxC,KAAKi/D,QACRzsB,KAAM,WAGtB,MAAO3wB,GAGX,IAAI6iD,GAA8B,mBAAZl4C,SAA2BA,OAAOqc,iBAAmB,EACvE87B,KACAC,EAAa,GAAI5mE,QAAO,aACxB6mE,EAAY,SAAStxC,GACrB,MAAOA,IAAS,EAiBpBo5B,GAAchtD,UAAUhC,IAAM,WAAY,MAAOqC,MAAKsvC,MACtDqd,EAAchtD,UAAUG,IAAM,WAAY,MAAOE,MAAKuvC,MACtDod,EAAchtD,UAAUs1B,OAAS,WAAY,MAAOj1B,MAAKi/D,SAGzDtS,EAAchtD,UAAUmlE,aAAe,SAASC,GAC5C,MAAO,GAAM,GAAIrnE,KAAKoC,IAAI,EAAKpC,KAAKC,IAAK,EAAMonE,EAAQ,GAAM,KAGjEpY,EAAchtD,UAAU23D,KAAO,SAASoD,GACpC,GAAI32D,GAAM/D,KAAKihE,KACXzjE,EAAMwC,KAAKuhE,KACXyD,EAA4B,aAAjBhlE,KAAKwhE,SAA2C,iBAAjBxhE,KAAKwhE,QAC/C1uC,EAAuB,iBAAjB9yB,KAAKwhE,QAEX/9D,EAAYM,EAAMA,EAAI/J,OAAUgG,KAAKuvC,KAAOvvC,KAAKsvC,KAAO,EACxD/b,GAASvzB,KAAKuvC,KAAOvvC,KAAKsvC,KAAO,GAAK7rC,CAEtCuhE,KAAaH,EAAUtxC,KACvBmnC,EAAGhU,UAAY1mD,KAAKshE,aAChBthE,KAAK2hE,eACLjH,EAAG/T,SAAS3mD,KAAKsvC,KAAM/b,EAAOvzB,KAAKuvC,KAAOvvC,KAAKsvC,KAAM/b,GAErDmnC,EAAG/T,SAAS3mD,KAAKsvC,KAAMtvC,KAAKi/D,QAAQ,EAAGj/D,KAAKuvC,KAAOvvC,KAAKsvC,KAAMtvC,KAAKi/D,QAAQ,GAInF,KAAK,GAAI1kE,GAAI,EAAOkJ,EAAJlJ,IAAiBA,EAAG,CAChC,GAAI25D,GAAOnwD,EAAMA,EAAIyK,OAAOjU,EAAG,GAAG29C,cAAgB,GAElD,IAAK0sB,EAAW79D,KAAKmtD,IAAU2Q,EAAUtxC,GAAzC,CAGA,GAAIzsB,GAAQ9G,KAAK4rB,WAAWsoC,EAE5B,IAAIl0D,KAAKyhE,OAAQ,CACb,GAAIwD,GAAKjlE,KAAKyhE,OAAOrqD,WAAW7c,GAAK,GACjC2qE,EAAWxK,EAAGlM,WAClBkM,GAAGlM,YAAcxuD,KAAK8kE,aAAaG,GAGvC,IAAKn+D,EAAO,CACR,GAAIq+D,GAAU3nE,EAAMA,EAAIgR,OAAOjU,EAAG,GAAG29C,cAAgB,GAEjDpxC,GADQ,KAARotD,GAA0B,KAAXiR,EACP,OAEAnlE,KAAKshE,aAEbxuC,IACAohC,EAAOiR,GAGfzK,EAAGhU,UAAY5/C,CAEf,IAAIs+D,GAAMR,EAAW79D,KAAKmtD,EAO1B,KANIl0D,KAAK0hE,SAAYmD,EAAUtxC,IAAW6xC,IAClCplE,KAAK2hE,eACLjH,EAAG/T,SAAS3mD,KAAKsvC,KAAO/0C,EAAEg5B,EAAOA,EAAOA,EAAOA,GAE/CmnC,EAAG/T,SAAS3mD,KAAKsvC,KAAO/0C,EAAEg5B,EAAO,EAAGA,EAAOvzB,KAAKi/D,UAEpD4F,EAAUtxC,IAAU6xC,EAAK,CACzB,GAAIh3D,GAAMtH,EAAQ,IAAMotD,EACpBmR,EAAMV,EAA+Bv2D,EACzC,KAAKi3D,EAAK,CACNA,EAAMvpD,SAASwpD,cAAc,UACzBZ,GACAW,EAAI7nD,MAAQ,GACZ6nD,EAAIpwC,OAAS,KAEbowC,EAAI7nD,MAAQ,EACZ6nD,EAAIpwC,OAAS,GAEjB,IAAIswC,GAAQF,EAAIvoB,WAAW,KACvB4nB,IACAa,EAAMhyC,MAAM,EAAG,GAEnBgyC,EAAM7e,UAAY1mD,KAAK0hE,QAAU,QAAU56D,CAC3C,IAAIunD,GAAIkX,EAAMnP,YAAYlC,GAAM12C,KAChC+nD,GAAMrW,SAASgF,EAAM,IAAO,EAAM7F,GAAI,GACtCsW,EAA+Bv2D,GAAOi3D,EAE1C,GAAIG,GAAKxlE,KAAK2hE,eAAiBpuC,EAAQ,CACnCmxC,GACAhK,EAAG+K,UAAUJ,EAAKrlE,KAAKsvC,KAAO/0C,EAAEg5B,EAAQ,IAAKA,EAAM,GAAIiyC,EAAI,EAAG,IAE9D9K,EAAG+K,UAAUJ,EAAKrlE,KAAKsvC,KAAO/0C,EAAEg5B,EAAQ,IAAKA,EAAM,GAAIiyC,GAG3DxlE,KAAKyhE,SACL/G,EAAGlM,YAAc0W,MAK7BvY,EAAchtD,UAAUkjE,MAAQ,WAQ5B,IAAK,GAPD9+D,GAAM/D,KAAKihE,KACXzjE,EAAMwC,KAAKuhE,KAEXzuC,GAD4B,aAAjB9yB,KAAKwhE,SAA2C,iBAAjBxhE,KAAKwhE,QACxB,iBAAjBxhE,KAAKwhE,SACXjuC,GAASvzB,KAAKuvC,KAAOvvC,KAAKsvC,KAAO,GAAKtvC,KAAKihE,KAAKjnE,OAC/C6nB,EAAIygD,EAAcG,EAAQ,KAEtBloE,EAAI,EAAGA,EAAIwJ,EAAI/J,SAAUO,EAAG,CACjC,GAAI25D,GAAOnwD,EAAMA,EAAIyK,OAAOjU,EAAG,GAAG29C,cAAgB,IAC9CpxC,EAAQ9G,KAAK4rB,WAAWsoC,EAE5B,KAAKptD,EAAO,CACR,GAAIq+D,GAAU3nE,EAAMA,EAAIgR,OAAOjU,EAAG,GAAG29C,cAAgB,GAEjDpxC,GADQ,KAARotD,GAA0B,KAAXiR,EACP,OAEAnlE,KAAKshE,aAEbxuC,IACAohC,EAAOiR,GAGf,GAAInxB,GAAQ,CACZ,IAAIh0C,KAAKyhE,OAAQ,CACb,GAAIwD,GAAKjlE,KAAKyhE,OAAOrqD,WAAW7c,GAAK,EACrCy5C,GAAQh0C,KAAK8kE,aAAaG,GAG9B,GAAIG,GAAMR,EAAW79D,KAAKmtD,IACtBl0D,KAAK0hE,SAAYmD,EAAUtxC,IAAW6xC,GACtCvjD,EAAE7F,YACEsmD,EAAcG,EAAQ,OAAQ,MAC1Bn7D,EAAEtH,KAAKsvC,KAAO/0C,EAAEg5B,EAChBke,EAAG,EACHj0B,MAAO+V,EACP0B,OAAQj1B,KAAKi/D,QACbzsB,KAAM1rC,EACN4+D,YAAa1xB,KAGrB6wB,EAAUtxC,IAAU6xC,GACpBvjD,EAAE7F,YACEsmD,EAAcG,EAAQ,OAAQvO,GAC1B5sD,EAAGtH,KAAKsvC,MAAQ,GAAI/0C,GAAGg5B,EACvBke,EAAG,EACHk0B,WAAY,SACZnzB,KAAMxyC,KAAK0hE,QAAU,QAAU56D,EAC/B4+D,YAAa1xB,KAI7B,MAAOnyB,IAUX2oC,EAAgB7qD,UAAUs1B,OAAS,WAC/B,MAAIj1B,MAAKi/D,QACEj/D,KAAKi/D,QAELj/D,KAAKmJ,MAAM8rB,SAAWj1B,KAAK4hE,IAI1CpX,EAAgB7qD,UAAUhC,IAAM,WAC5B,MAAOqC,MAAKmJ,MAAMxL,MAAQqC,KAAK4/D,IAGnCpV,EAAgB7qD,UAAUG,IAAM,WAC5B,MAAOE,MAAKmJ,MAAMrJ,MAAQE,KAAK4/D,IAGnCpV,EAAgB7qD,UAAUguB,KAAO,WAC7B,MAAO3tB,MAAK4hE,IAGhBpX,EAAgB7qD,UAAUiuB,KAAO,WAC7B,MAAO5tB,MAAK4hE,GAAK5hE,KAAKmJ,MAAM8rB,UAGhCu1B,EAAgB7qD,UAAU23D,KAAO,SAASz1C,EAAGxoB,GACzCwoB,EAAEslC,OACFtlC,EAAEylC,UAAUtnD,KAAK4/D,GAAI5/D,KAAK4hE,IAC1B5hE,KAAKmJ,MAAMmuD,KAAKz1C,EAAGxoB,GACnBwoB,EAAE27B,WAGNgN,EAAgB7qD,UAAUkjE,MAAQ,WAC9B,GAAIzpE,GAAK4G,KAAKmJ,MAAM05D,OAEpB,OADAzpE,GAAEitB,aAAa,YAAa,aAAermB,KAAK4/D,GAAK,IAAM5/D,KAAK4hE,GAAK,KAC9DxoE,GAUXuyD,EAAWhsD,UAAUhC,IAAM,WACvB,MAAOqC,MAAK4/D,GAAK,GAGrBjU,EAAWhsD,UAAUG,IAAM,WACvB,MAAOE,MAAK4/D,GAAK,GAGrBjU,EAAWhsD,UAAUs1B,OAAS,WAC1B,MAAOj1B,MAAKi/D,SAGhBtT,EAAWhsD,UAAU23D,KAAO,SAASz1C,GACjCA,EAAEslC,OACFtlC,EAAE2sC,YAAc,GAChB3sC,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAE8sC,YACF9sC,EAAE+hD,IAAI5jE,KAAK4/D,GAAI5/D,KAAK4hE,GAAI,IAAK,EAAG,MAChC//C,EAAE2wB,OACF3wB,EAAE27B,WAGNmO,EAAWhsD,UAAUkjE,MAAQ,WACzB,MAAOP,GACHG,EAAQ,SACR,MACCoB,GAAI7jE,KAAK4/D,GAAIkE,GAAI9jE,KAAK4hE,GAAIzoE,EAAG,EAC7Bq5C,KAAMxyC,KAAKygD,MACXT,OAAQ,UAUjByE,EAAU9kD,UAAU+tB,eAAgB,EAEpC+2B,EAAU9kD,UAAUhC,IAAM,WACtB,MAAO,MAGX8mD,EAAU9kD,UAAUG,IAAM,WACtB,MAAO,MAGX2kD,EAAU9kD,UAAUs1B,OAAS,WACzB,MAAOj1B,MAAKi/D,SAGhBxa,EAAU9kD,UAAU23D,KAAO,SAASz1C,GAChCA,EAAEslC,OACFtlC,EAAE4sC,YAAc,QAChB5sC,EAAE6sC,UAAY,GAEd7sC,EAAE8sC,WACF,KAAK,GAAIld,GAAIzxC,KAAK6hE,QAASpwB,GAAKzxC,KAAKi/D,QAAQj/D,KAAK6hE,QAASpwB,GAAKzxC,KAAK8hE,QAEjEjgD,EAAE+sC,OAAO,KAAOnd,GAChB5vB,EAAEgtC,OAAO,IAAMpd,EAEnB5vB,GAAEm+B,SACFn+B,EAAE27B,WAGNiH,EAAU9kD,UAAUkjE,MAAQ,WAExB,IAAK,GADDtoE,GAAI,GAAImoE,GACHjxB,EAAI,EAAGA,GAAKzxC,KAAKi/D,QAASxtB,GAAK,GACpCl3C,EAAEq0D,OAAO,KAAOnd,GAChBl3C,EAAEs0D,OAAO,IAAMpd,EAGnB,OAAO6wB,GACHG,EAAQ,OACR,MACCvtD,EAAG3a,EAAEuoE,aACLtwB,KAAM,OACNwN,OAAQ,QACRyX,YAAa,WAUtB7N,EAAUjqD,UAAY+8C,OAAO4X,OAAOwK,EAAcn/D,WAElDiqD,EAAUjqD,UAAUhC,IAAM,WACtB,MAAOqC,MAAK4/D,GAAK5/D,KAAK+hE,IAG1BnY,EAAUjqD,UAAUG,IAAM,WACtB,MAAOE,MAAK4/D,GAAK5/D,KAAK+hE,IAG1BnY,EAAUjqD,UAAUs1B,OAAS,WACzB,MAAO,GAAIj1B,KAAK+hE,IAGpBnY,EAAUjqD,UAAUijE,SAAW,SAAS/gD,GAEpC,IAAK,GADD+jD,GAAO5lE,KAAK4/D,GAAIiG,EAAO7lE,KAAK+hE,GAAI5oE,EAAI6G,KAAK+hE,GACpCxnE,EAAI,EAAGA,EAAIyF,KAAKgiE,UAAWznE,EAAG,CACnC,GAAIurE,GAAa,KAAJvrE,EAAYyF,KAAKgiE,QAC1B7U,EAAKyY,EAAOzsE,EAAEuE,KAAKqoE,IAAID,GACvBvY,EAAKsY,EAAO1sE,EAAEuE,KAAKsoE,IAAIF,EAClB,IAALvrE,EACAsnB,EAAE+sC,OAAOzB,EAAII,GAEb1rC,EAAEgtC,OAAO1B,EAAII,GAEjBuY,EAAmB,MAATvrE,EAAE,IAAeyF,KAAKgiE,QAChC7U,EAAKyY,EAAO,GAAIzsE,EAAEuE,KAAKqoE,IAAID,GAC3BvY,EAAKsY,EAAO,GAAI1sE,EAAEuE,KAAKsoE,IAAIF,GAC3BjkD,EAAEgtC,OAAO1B,EAAII,GAEjB1rC,EAAEu1C,aAYN3N,EAAc9pD,UAAU23D,KAAO,SAASz1C,GACpC,GAAI6hD,GAAK1jE,KAAKi/D,QAAQ,CACtBp9C,GAAE6kC,UAAY1mD,KAAKkgD,QACnBr+B,EAAE8sC,YACF9sC,EAAE+hD,IAAI5jE,KAAK4/D,GAAI8D,EAAIA,EAAK1jE,KAAKkiE,UAAW,EAAG,MAC3CrgD,EAAE+sC,OAAO5uD,KAAK4/D,GAAI,GAClB/9C,EAAEgtC,OAAO7uD,KAAK4/D,GAAI5/D,KAAKi/D,SAEnBj/D,KAAKygD,QACL5+B,EAAE6kC,UAAY1mD,KAAKygD,MACnB5+B,EAAE2wB,QAGFxyC,KAAKkgD,UACLr+B,EAAE4sC,YAAczuD,KAAKkgD,QACrBr+B,EAAEm+B,WAIVyJ,EAAc9pD,UAAUkjE,MAAQ,WAC5B,GAAIa,GAAK1jE,KAAKmiE,GACd,OAAOG,GAAcG,EAAQ,KACxBH,EAAcG,EAAQ,SAAU,MAAOoB,GAAI7jE,KAAK4/D,GAAIkE,GAAIJ,EAAIvqE,EAAGuqE,EAAK1jE,KAAKkiE,YACzEI,EAAcG,EAAQ,OAAQ,MAAOwD,GAAIjmE,KAAK4/D,GAAIsG,GAAI,EAAGC,GAAInmE,KAAK4/D,GAAIwG,GAAIpmE,KAAKi/D,YAC/EzsB,KAAMxyC,KAAKygD,OAAS,OACpBT,OAAQhgD,KAAKkgD,SAAW,OACxBuX,YAAa,SAGtBhO,EAAc9pD,UAAUhC,IAAM,WAC1B,MAAOqC,MAAK4/D,GAAK5/D,KAAKmiE,KAG1B1Y,EAAc9pD,UAAUG,IAAM,WAC1B,MAAOE,MAAK4/D,GAAK5/D,KAAKmiE,KAG1B1Y,EAAc9pD,UAAUs1B,OAAS,WAC7B,MAAOj1B,MAAKi/D,SAUhB5X,EAAmB1nD,UAAU2nD,UAAY,SAAShgD,EAAGmqC,GACjDzxC,KAAKoiE,IAAM96D,EACXtH,KAAKqiE,IAAM5wB,GAGf4V,EAAmB1nD,UAAU4jE,cAAgB,SAAS1hD,GAClD7hB,KAAKqtB,OAAOnwB,MACRoK,EAAGtH,KAAKoiE,GACR3wB,EAAGzxC,KAAKqiE,GACRl5D,MAAO0Y,KAKfwlC,EAAmB1nD,UAAU23D,KAAO,SAASz1C,EAAG2hD,EAAYC,GACxD,IAAK,GAAIh2C,GAAK,EAAGA,EAAKztB,KAAKqtB,OAAOrzB,SAAUyzB,EAAI,CAC5C,GAAI3lB,GAAK9H,KAAKqtB,OAAOI,EACrB5L,GAAEslC,OACFtlC,EAAEylC,UAAUx/C,EAAGR,EAAGQ,EAAG2pC,GACrB3pC,EAAGqB,MAAM27B,YAAYjjB,EAAG2hD,EAAYC,GACpC5hD,EAAE27B,YAIa,mBAAZtjD,KACPA,EAAOJ,SACHgoD,SAAUA,EACVrD,WAAYA,EACZkP,eAAgBA,EAChBjP,cAAeA,EACfmL,WAAYA,EACZR,QAASA,EACT7H,cAAeA,EACfgI,SAAUA,EACV/J,YAAaA,EACbQ,YAAaA,EACbE,UAAWA,EACXI,UAAWA,EACXG,aAAcA,EACdX,WAAYA,EACZkB,aAAcA,EACdH,UAAWA,EACX6L,cAAeA,EACfrK,eAAgBA,EAChBkI,gBAAiBA,EACjB/F,UAAWA,EACXmF,UAAWA,EACX+B,WAAYA,EACZlC,cAAeA,EAEfpC,mBAAoBA,MtB85TzBviD,UAAU,GAAGuhE,cAAc,GAAGp8D,UAAU,KAAKq8D,IAAI,SAAS9sE,EAAQU,EAAOJ,GAC5E,YuBl8WA,SAASysE,GAAarS,EAAMmB,GACxBr1D,KAAKk0D,KAAOA,EACZl0D,KAAKq1D,MAAQA,EAGjB,QAASmR,GAAMt2B,GACX,MAAIA,GAAS,EACF,IACO,EAATA,EACE,IADN,OAxBT,GAAwB,mBAAb12C,GACP,CAAA,GAAIgM,GAAMhM,EAAQ,SAGdoM,GAFgBJ,EAAIC,cACTD,EAAIE,SACFF,EAAII,YAGjBC,GAFWL,EAAIG,SAEPnM,EAAQ,YAChBsM,EAAcD,EAAMC,YAEpB5H,EAAQ1E,EAAQ,WAChB4E,EAAQF,EAAME,MACdC,EAAQH,EAAMG,KACCH,GAAMI,aAe7BioE,EAAa5mE,UAAUsR,SAAW,SAAS1N,EAAS9B,EAAMlG,GACtDkG,EAAOA,MAEP3D,IAAMkC,KAAKk0D,KAAO,aAAe3wD,EAAQzG,IAEzC,IAAIs7C,KACAp4C,MAAKq1D,OACTjd,EAAQl7C,KAAK8C,KAAKq1D,OAEd9xD,EAAQ2zC,YACXkB,EAAQl7C,KAAK,SAAWqG,EAAQgD,OAChC6xC,EAAQl7C,KAAK,OAASqG,EAAQkD,MAE3B2xC,EAAQp+C,OAAS,IACpB8D,IAAMA,IAAM,IAAMs6C,EAAQI,KAAK,KAGhC,IAAIz/B,GAAM,GAAIC,eACdD,GAAIK,mBAAqB,WAC5B,GAAsB,GAAlBL,EAAIM,WACJ,GAAIN,EAAIO,QAAU,IACjB/d,EAAS,KAAM,cAAgBwd,EAAIO,YAC7B,CACV,GAAIy7C,GAAKh0B,KAAK56B,MAAM4S,EAAIuB,UAAf,SACLrJ,IACJ,KAAK6C,GAAK,EAAGA,GAAKihD,EAAG/6D,SAAU8Z,GAAI,CAC/B,GAAI/W,GAAIg4D,EAAGjhD,IAEPpa,EAAI,GAAIkM,EAWE,IAVdlM,EAAE6J,QAAUA,EAAQzG,KACpBpD,EAAEiE,KAAoB,EAAbZ,EAAA,OAAkB,EAC3BrD,EAAEoG,IAAiB,EAAX/C,EAAA,IACJA,EAAED,OACTpD,EAAEgN,MAAQ3J,EAAED,MAESC,EAAEmzC,SACFx2C,EAAEmN,YAAc2/D,EAAMzpE,EAAEmzC,SAC1Cx2C,EAAE4K,KAAOvH,EAAEuH,MAAQ,UAEDvH,EAAE0pE,aAAe1pE,EAAE0pE,YAAYzsE,OAAS,EAAG,CAC3CN,EAAE+N,GAAK1K,EAAE2pE,QAMT,KAAK,GAJDn6B,MACAo6B,KACA7zC,KAEKiD,EAAK,EAAGA,EAAKh5B,EAAE0pE,YAAYzsE,SAAU+7B,EAAI,CAC9C,GAAI6wC,GAAK7pE,EAAE0pE,YAAY1wC,GACnB8wC,EAAK/gE,EAAYpM,EACrBmtE,GAAGlpE,IAAMipE,EAAGrgE,MAAQ,EACpBsgE,EAAG/mE,IAAM8mE,EAAGngE,IACZogE,EAAGl/D,QAAUjO,GAEbo5B,EAAI51B,KAAK2pE,GACTt6B,EAAOrvC,KAAK,GAAIkB,GAAMyoE,EAAGlpE,IAAKkpE,EAAG/mE,MACjB,QAAZ8mE,EAAGtiE,MACHqiE,EAAIzpE,KAAK2pE,GAGjB,GAAIF,EAAI3sE,OAAS,EAAG,CAChBkE,EAAQG,EAAMkuC,EACd,IAAIu6B,GAAUhhE,EAAYpM,EAC1BotE,GAAQxiE,KAAO,aACfpG,EAAMiK,SAASyT,QAAQ,SAASmrD,GAC5B91D,EAAS/T,MACLqG,QAAaA,EAAQzG,KACrBa,IAAaopE,EAAKppE,MAClBmC,IAAainE,EAAKjnE,MAClB+G,YAAanN,EAAEmN,YACfc,QAAcm/D,GACdxiE,KAAa,gBAIrB,IAAI0iE,GAAUlhE,EAAYpM,EAC1BitE,GAAI/qD,QAAQ,SAASqrD,GACjBA,EAAQ3iE,KAAO,cACf2iE,EAAQt/D,QAAUq/D,GAClB/1D,EAAS/T,KAAK+pE,SAGlBn0C,GAAIlX,QAAQ,SAASliB,GACjBuX,EAAS/T,KAAKxD,SAIpCuX,GAAS/T,KAAKxD,GAGtB6B,EAAS0V,KAMP8H,EAAIG,KAAK,MAAOpb,KAAK,GACrBib,EAAIqB,aAAe,OACnBrB,EAAIW,QAGe,mBAAZxf,KACPA,EAAOJ,SACHysE,aAAcA,MvB29WnBx8D,QAAQ,GAAGjF,UAAU,GAAGmF,UAAU,KAAKi9D,IAAI,SAAS1tE,EAAQU,EAAOJ,GwB7lXtE,YAkCA,SAASqtE,KACL,GAAIt2C,GAAO7wB,IACXA,MAAKonE,QACLpnE,KAAKqnE,mBACLrnE,KAAKsnE,eAAiB,GAAIzvD,GAAQ,SAASiC,EAAS+U,GAChDgC,EAAK02C,qBAAuBztD,IAcpC,QAAS0tD,GAAahmE,EAAK7D,EAAKmC,EAAKyzB,EAAOtiB,EAAUqI,EAAQ+lD,GAC1Dr/D,KAAKwB,IAAMA,EACXxB,KAAKrC,IAAMA,EACXqC,KAAKF,IAAMA,EACXE,KAAKq/D,SAAWA,EAChBr/D,KAAKuzB,MAAQA,EACbvzB,KAAKiR,SAAWA,MAChBjR,KAAKsZ,OAASA,EAOlB,QAAS8mB,GAAWqnC,EAASjmE,EAAK7D,EAAKmC,EAAKyzB,EAAOm0C,GAC/C1nE,KAAKynE,QAAUA,EACfznE,KAAKwB,IAAMA,EACXxB,KAAKrC,IAAMA,EACXqC,KAAKF,IAAMA,EACXE,KAAKuzB,MAAQA,EACbvzB,KAAK0nE,UAAYA,GAAa,GAAIC,GAClC3nE,KAAK4nE,UAAY,EAEjB5nE,KAAK4iC,gBACL5iC,KAAK6nE,eA4CT,QAASC,GAAe72D,EAAUtT,EAAKmC,GAInC,IAAK,GAHDioE,MACAC,KAEKl0D,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,EACZpa,GAAEiE,KAAQjE,EAAEoG,IAENpG,EAAEiO,QAAUjO,EAAEiO,OAAO3N,OAAS,EACrC0kC,EAAMspC,EAAiBtuE,EAAEiO,OAAO,GAAGF,GAAI/N,GAChCA,EAAEiE,KAAOmC,GAAOpG,EAAEoG,KAAOnC,GAChCoqE,EAAG7qE,KAAKxD,GAJRquE,EAAG7qE,KAAKxD,GAQhB,IAAK,GAAI8kE,KAAOwJ,GAAiB,CAG7B,IAAK,GAFD/kB,GAAK+kB,EAAgBxJ,GACrBlE,EAAO,KAAc2N,EAAO,MACvBn0D,EAAK,EAAGA,EAAKmvC,EAAGjpD,SAAU8Z,EAAI,CACnC,GAAIpa,GAAIupD,EAAGnvC,EACXwmD,GAAO58D,KAAKC,IAAI28D,EAAM5gE,EAAEiE,KACxBsqE,EAAOvqE,KAAKoC,IAAImoE,EAAMvuE,EAAEoG,KAE5B,GAAYA,GAARw6D,GAAe2N,GAAQtqE,EACvB,IAAK,GAAImW,GAAK,EAAGA,EAAKmvC,EAAGjpD,SAAU8Z,EAC/Bi0D,EAAG7qE,KAAK+lD,EAAGnvC,IAKvB,MAAOi0D,GArJX,GAAwB,mBAAbvuE,GACP,GAAIqM,GAAQrM,EAAQ,WAChB41B,EAAUvpB,EAAMupB,QAChBsP,EAAQ74B,EAAM64B,MAEdr5B,EAAK7L,EAAQ,oBACb0uE,EAAsB7iE,EAAG6iE,oBACzBC,EAAuB9iE,EAAG8iE,qBAC1BC,EAAmB/iE,EAAG+iE,iBACtBC,EAAyBhjE,EAAGgjE,uBAC5BC,EAAmBjjE,EAAGijE,iBACtBC,EAAyBljE,EAAGkjE,uBAC5BZ,EAAsBtiE,EAAGsiE,oBACzBa,EAAqBnjE,EAAGmjE,mBAExBC,EAAuBjvE,EAAQ,aAAaivE,qBAE5CvqE,EAAQ1E,EAAQ,WAChB4E,EAAQF,EAAME,MAEdE,GADQJ,EAAMG,MACCH,EAAMI,cAErBoqE,EAASlvE,EAAQ,YACjBmvE,EAAaD,EAAOC,WACpBC,EAAkBF,EAAOE,gBAEzBpjE,EAAMhM,EAAQ,SACdu6C,EAAcvuC,EAAIuuC,YAElBl8B,EAAUre,EAAQ,eAAeqe,OAYzCsvD,GAAUxnE,UAAUkpE,WAAa,SAASC,GACtC9oE,KAAKonE,KAAKlqE,KAAK4rE,IAGnB3B,EAAUxnE,UAAUopE,SAAW,WAC3B,IAAK,GAAItvE,GAAI,EAAGA,EAAIuG,KAAKonE,KAAKptE,SAAUP,EACpCuG,KAAKonE,KAAK3tE,GAAGygB,SAcrBstD,EAAa7nE,UAAUtD,SAAW,WAC9B,MAAO2D,MAAKwB,IAAM,IAAMxB,KAAKrC,IAAM,KAAOqC,KAAKF,IAAM,UAAYE,KAAKuzB,OAgB1E6M,EAAWzgC,UAAUwgC,OAAS,WAC1BngC,KAAKgpE,WAAY,GAGrB5oC,EAAWzgC,UAAU2gC,qBAAuB,SAAS9+B,EAAK7D,EAAKmC,GAC3D,GAAImpE,GAAQjpE,KAAK4iC,aAAa5iC,KAAKynE,QAAQ,GAC3C,OAAIwB,GACOA,EAEA,MAIf7oC,EAAWzgC,UAAU8gC,iBAAmB,SAAS1d,EAAOvhB,EAAK7D,EAAKmC,EAAKyzB,GACnE,GAAIA,GAASA,EACT,KAAM,0CAGV,IAAI/xB,GAAOxB,KAAKwB,IACZ,KAAM,8CAEA,GAAN7D,IACAA,EAAM,GAGVqC,KAAKrC,IAAMA,EACXqC,KAAKF,IAAMA,EACXE,KAAKuzB,MAAQA,EAETvzB,KAAK20D,MACL30D,KAAK20D,KAAKoU,WAEd/oE,KAAK20D,KAAO,GAAIwS,GAChBnnE,KAAKkpE,WAAa,GAAI95C,GACtBpvB,KAAKmpE,eAAgB,EACrBnpE,KAAK4nE,YAEL5nE,KAAKopE,qBAAqBrmD,GAC1B/iB,KAAK20D,KAAK4S,wBAoCdnnC,EAAWzgC,UAAU2+B,WAAa,SAAS9hB,GAClCxc,KAAK20D,OAIV30D,KAAK4iC,aAAapmB,GAAQ,KAC1Bxc,KAAKopE,sBAAsB5sD,MAG/B4jB,EAAWzgC,UAAUypE,qBAAuB,SAASrmD,GAQjD,IAAK,GAFDsmD,GALAvnE,EAAQ9B,KAERkpE,EAAalpE,KAAKkpE,WAClBI,GAAU,EAILrwE,EAAI,EAAGA,EAAI8pB,EAAM/oB,SAAUf,EAAG,CACnC,GAAIswE,GAAexmD,EAAM9pB,GAAGgiB,QAAQijB,gBAAgBnb,EAAM9pB,GAC1D,KACQ+G,KAAKwpE,gBAAgBzmD,EAAM9pB,GAAIiwE,KAC/BI,GAAU,GAEhB,MAAOzjC,GACL,GAAIrpB,GAAOuG,EAAM9pB,EAEjBujB,GAAKuqB,mBACLvqB,EAAKugC,gBAAkB,KACvBvtC,QAAQC,IAAI,8BACZD,QAAQC,IAAIo2B,GACZwjC,EAAMxjC,EACNr2B,QAAQC,IAAIo2B,EAAGlL,OACf4uC,EAAanrC,WAAWyH,EAAIrpB,GAC5BA,EAAKitD,eAIb,GAAIH,IAAYtpE,KAAKmpE,cAAe,CAChCnpE,KAAKmpE,eAAgB,CACrB,IAAI1hB,GAAOznD,KAAKrC,IAAKgqD,EAAO3nD,KAAKF,GAEjC,IAAIE,KAAKM,IACDN,KAAKM,GAAGiG,OAASkhD,GAAQznD,KAAKM,GAAGmG,KAAOkhD,EAAM,CAC9C,GAAI+hB,EAOJ,OALIA,GADA1pE,KAAKM,GAAGiG,OAASkhD,GAAQznD,KAAKM,GAAGmG,KAAOkhD,EAC5B3nD,KAAKM,GAEL,GAAIyzC,GAAY/zC,KAAKM,GAAGxD,KAAM2qD,EAAME,EAAM3nD,KAAKM,GAAG2zC,SAClCj0C,KAAKM,GAAGyD,IAAI9G,UAAUwqD,EAAOznD,KAAKM,GAAGiG,MAAOohD,EAAO,EAAI3nD,KAAKM,GAAGiG,QAExF2iE,EAAWS,QAAQD,GAIlC1pE,KAAK0nE,UAAUhsE,MAAMsE,KAAKwB,IAAKimD,EAAME,EAAM3nD,KAAK20D,KAAM,SAASh7C,EAAK5V,GAC5DA,KACKjC,EAAMxB,IAAOmnD,GAAQ3lD,EAAMxB,GAAGiG,OAASohD,GAAQ7lD,EAAMxB,GAAGmG,KACxDghD,GAAQ3lD,EAAMxB,GAAGmG,KAASkhD,GAAQ7lD,EAAMxB,GAAGiG,OAC1CohD,EAAOF,EAAS3lD,EAAMxB,GAAGmG,IAAM3E,EAAMxB,GAAGiG,SAE1CzE,EAAMxB,GAAKyD,GAEfmlE,EAAWS,QAAQ5lE,KAEnByL,QAAQC,IAAI,0BAA2BkK,GACvCuvD,EAAWS,QAAQ,SAK/B,GAAIN,EACA,KAAMA,IAGdjpC,EAAWzgC,UAAU6pE,gBAAkB,SAAShtD,EAAM0sD,GAClD,GAOIU,GAPA9nE,EAAQ9B,KAER6pE,EAAS7pE,KAAK4nE,UACdjwC,EAASnb,EAAKstD,aAAe,GAAItB,GACjCuB,EAAWvtD,EAAKwtD,cAAchqE,KAAKuzB,OACnC01C,EAAQnnE,EAAM8gC,aAAapmB,GAC3BytD,EAAeztD,EAAK0tD,sBAAsBlqE,KAAKuzB,MAE/C02C,KACAL,EAAcK,EAAaE,WAC/B,IAAI3oE,GAAMxB,KAAKwB,IAAK7D,EAAMqC,KAAKrC,IAAKmC,EAAME,KAAKF,GAG/C,IAAoBqC,SAAhBynE,EACA,OAAO,CAEX,IAAIX,GAASA,EAAMznE,MAAQxB,KAAKwB,KAAOynE,EAAMtrE,KAAOA,GAAOsrE,EAAMnpE,KAAOA,EAAK,CACzE,GAAIsqE,GAAiBnB,EAAMh4D,UACvBg4D,EAAMtrE,IAAMA,GAAOsrE,EAAMnpE,IAAMA,KAC/BsqE,EAAiBtC,EAAesC,EAAgBzsE,EAAKmC,IAGzDgC,EAAMuoE,UAAU7tD,EAAMysD,EAAMznE,IACZlD,EAAa2qE,EAAM5J,SAAU,GAAIjhE,GAAMT,EAAKmC,IAC5CmpE,EAAM11C,MAAOq2C,EACbQ,EAAgBnB,EAAM3vD,OACtBywD,EAAWb,EAAa,KAExC,IAAIoB,GAAkB3yC,EAAO88B,WAE7B,IAAIwU,EAAM11C,OAASvzB,KAAKuzB,QAAU+2C,EAC9B,MAAOP,GA4Bf,MAxBIpyC,GAAOpoB,YACPC,QAAQC,IAAI,mBAAqBo6D,EAAS,KAAOlsE,EAAM,KAAOmC,EAAM,KAGxE63B,EAAOj8B,MAAM8F,EAAK7D,EAAKmC,EAAKE,KAAKuzB,MAAOq2C,EAAa5pE,KAAK20D,KAAM,SAASr7C,EAAQrI,EAAUsiB,EAAO8rC,GAC1F1nC,EAAOpoB,YACPC,QAAQC,IAAI,mBAAqBo6D,EAErC,IAAIU,GAAezoE,EAAM+lE,YAAYrrD,IAAS,EAC1C1a,GAAMknE,WAAauB,EAAeV,IAIjCxK,IACDA,EAAW,GAAIjhE,GAAMT,EAAKmC,MAGzBmpE,GAAUtrE,EAAMsrE,EAAMtrE,KAASmC,EAAMmpE,EAAMnpE,OAC5CgC,EAAM8gC,aAAapmB,GAAQ,GAAIgrD,GAAahmE,EAAK7D,EAAKmC,EAAKyzB,EAAOtiB,EAAUqI,EAAQ+lD,IAGxFv9D,EAAM+lE,YAAYrrD,GAAQqtD,EAC1B/nE,EAAMuoE,UAAU7tD,EAAMhb,EAAK69D,EAAU9rC,EAAOq2C,EAAa34D,EAAUqI,EAAQywD,EAAWb,EAAa,QACpGe,GACIF,GAGX3pC,EAAWzgC,UAAU0qE,UAAY,SAAS7tD,EAAMhb,EAAK69D,EAAUmL,EAAaZ,EAAa34D,EAAUqI,EAAQ4vD,GACvG,GAAIK,GAAe/sD,EAAKvB,QAAQijB,gBAAgB1hB,EAChD,IAAIlD,EAAQ,CAER,GADAkD,EAAKiuD,YAAYjpE,EAAK69D,EAAUmL,KAAiB,OAC5Cv5D,EAAU,CACX,GAAIjY,GAAI,GAAIW,OAAM2f,EAClBA,GAAS,wBAA0BA,EAAS,wBAC5C9J,QAAQC,IAAI,gCAAkC+M,EAAKgH,UAAU1mB,KAAO,KACpE0S,QAAQC,IAAI+M,EAAKgH,WACjBhU,QAAQC,IAAI,gBACZD,QAAQC,IAAIzW,EAAE2hC,OAElB4uC,EAAanrC,WAAW9kB,EAAQkD,GAChCA,EAAKitD,kBACF,CAIH,IAHA,GAAIiB,IAAgB,EAChBC,GAAsB,EACtBxlD,EAAM3I,EAAKstD,YACR5B,EAAoBvoE,UAAUirE,cAAczlD,IAC5CgjD,EAAqBxoE,UAAUirE,cAAczlD,IAC7CsjD,EAAqB9oE,UAAUirE,cAAczlD,IAG5CA,EADAsjD,EAAqB9oE,UAAUirE,cAAczlD,GACvCA,EAAI8C,QAAQ,GAEZ9C,EAAIwS,QAGdywC,EAAiBzoE,UAAUirE,cAAczlD,IACzCkjD,EAAuB1oE,UAAUirE,cAAczlD,IAC/CmjD,EAAiB3oE,UAAUirE,cAAczlD,IACzCojD,EAAuB5oE,UAAUirE,cAAczlD,MAE/CulD,GAAgB,GAGfvlD,EAAI1jB,OAAU0jB,EAAI1jB,KAAKopE,gBAAmB1lD,EAAI1jB,KAAKqpE,eAE/CJ,GAAiBd,GAAqC,GAAtBA,EAAY5vE,QAAe4vE,EAAY5sE,QAAQ,YAAc,IAE9FiU,EAAW03D,EAAW13D,EAAUjR,KAAKuzB,QAIzCq2C,GAAqC,GAAtBA,EAAY5vE,QAAe4vE,EAAY5sE,QAAQ,kBAAoB,IAGlF2tE,GAAsB,GAItBzB,EACAA,EAAW6B,MAAM,SAAShnE,GAClB4mE,IACA15D,EAAW23D,EAAgB33D,EAAUlN,EAAKyY,EAAKvB,QAAQ2Q,aAE3DpP,EAAKiuD,YAAYjpE,EAAK69D,EAAUmL,EAAav5D,EAAUlN,GACvDwlE,EAAanrC,WAAW9kB,EAAQkD,GAChCA,EAAKitD,iBAGTjtD,EAAKiuD,YAAYjpE,EAAK69D,EAAUmL,EAAav5D,GAC7Cs4D,EAAanrC,WAAW9kB,EAAQkD,GAChCA,EAAKitD,iBAKM,mBAAZvvE,KACPA,EAAOJ,SACHsmC,WAAYA,MxB0lXjBr2B,QAAQ,GAAGihE,YAAY,GAAGC,WAAW,GAAGjhE,mBAAmB,GAAGlF,UAAU,GAAGmF,UAAU,GAAG2Q,cAAc,MAAMswD,IAAI,SAAS1xE,EAAQU,EAAOJ,GAC3I,YyB97XA,SAASqxE,GAAIzwE,EAAGrB,GACZ2G,KAAK9E,MAAQR,EACbsF,KAAK1F,OAASjB,EAOlB,QAAS2B,GAAQ4G,EAAItH,EAAQ8wE,GACzB,GAAIlwE,GAAiC,YAAR,IAAf0G,EAAGtH,EAAO,IAAqD,UAAR,IAAfsH,EAAGtH,EAAO,IAAmD,OAAR,IAAfsH,EAAGtH,EAAO,IAAiD,KAAR,IAAfsH,EAAGtH,EAAO,KAAuC,IAAfsH,EAAGtH,EAAO,IACxK+wE,EAAQzpE,EAAGtH,EAAO,IAAM,EAAMsH,EAAGtH,EACrC,OAAa,IAATY,GAAsB,GAARmwE,GAAcD,EAGrB,GAAID,GAAIjwE,EAAOmwE,GAFf,KAMf,QAASrvE,GAAOZ,EAAMkwE,GAClBA,EAAM5tE,KAAKC,IAAI2tE,GAAO,EAAGlwE,EAAKa,WAAa,GAK3C,KAJA,GAAIsvE,MACAC,GAAO,GACPC,EAAY,EAETD,EAAI,GAAKF,GAAK,CACjB,GAAI1pE,GAAK,GAAI1F,YAAWd,EAAMowE,EAAI,GAAI,IAClCE,EAAQ9pE,EAAG,KAAO,EAAMA,EAAG,IAE3B7F,EAAMmR,EAAsB9R,EAAM,GAAKswE,EAAOF,EAAI,GAAI9tE,KAAKC,IAAI,MAAOvC,EAAKa,WAAa,GAAKyvE,EAAOF,EAAI,IAAKA,EACjHA,GAAI,IAAM,EACVC,GAAa1vE,EAAIE,WACjBsvE,EAAWruE,KAAKnB,GAGpB,GAAyB,GAArBwvE,EAAWvxE,OACX,MAAOuxE,GAAW,EAIlB,KAAK,GAFDI,GAAM,GAAIzvE,YAAWuvE,GACrB7vC,EAAS,EACJniC,EAAI,EAAGA,EAAI8xE,EAAWvxE,SAAUP,EAAG,CACxC,GAAIiB,GAAI,GAAIwB,YAAWqvE,EAAW9xE,GAClC2T,GAAU1S,EAAG,EAAGixE,EAAK/vC,EAAQlhC,EAAEV,QAC/B4hC,GAAUlhC,EAAEV,OAEhB,MAAO2xE,GAAItpE,OAInB,QAASxD,GAAMuC,EAAMN,GACjBd,KAAKoB,KAAOA,EAAMpB,KAAKc,KAAOA,EASlC,QAAS8qE,GAAQC,EAAKplE,GAGlB,QADEA,EACEolE,GAAK,IAAMplE,GAAK,GAAW,MAAiBolE,GAAK,IACjDA,GAAK,IAAMplE,GAAK,GAAW,KAAiBolE,GAAK,IACjDA,GAAK,IAAMplE,GAAK,GAAW,IAAgBolE,GAAK,IAChDA,GAAK,IAAMplE,GAAK,GAAW,GAAgBolE,GAAK,IAChDA,GAAK,IAAMplE,GAAK,GAAW,GAAgBolE,GAAK,IAC7C,EAKX,QAASjtE,GAASitE,EAAKplE,GAEnB,GAAW2K,GAAG06D,IAGd,OAFErlE,EACFqlE,EAAK5uE,KAAK,GACLkU,EAAI,GAAKy6D,GAAK,IAAU,GAAKplE,GAAK,KAAf2K,IAAsBA,EAAG06D,EAAK5uE,KAAKkU,EAC3D,KAAKA,EAAI,GAAKy6D,GAAK,IAAU,GAAKplE,GAAK,KAAf2K,IAAsBA,EAAG06D,EAAK5uE,KAAKkU,EAC3D,KAAKA,EAAI,IAAMy6D,GAAK,IAAU,IAAMplE,GAAK,KAAhB2K,IAAuBA,EAAG06D,EAAK5uE,KAAKkU,EAC7D,KAAKA,EAAI,KAAOy6D,GAAK,IAAU,KAAOplE,GAAK,KAAjB2K,IAAwBA,EAAG06D,EAAK5uE,KAAKkU,EAC/D,KAAKA,EAAI,MAAQy6D,GAAK,IAAU,MAAQplE,GAAK,KAAlB2K,IAAyBA,EAAG06D,EAAK5uE,KAAKkU,EACjE,OAAO06D,GAxFX,GAAwB,mBAAbtyE,GACP,GAAIyT,GAASzT,EAAQ,UACjB0T,EAAwBD,EAAOE,cAC/BC,EAAYH,EAAOG,SAQ3B+9D,GAAIxrE,UAAUtD,SAAW,WACrB,MAAO,GAAK2D,KAAK9E,MAAQ,IAAM8E,KAAK1F,OA+EjB,oBAAZJ,KACPA,EAAOJ,SACHkC,OAAQA,EACRhB,QAASA,EACT4wE,QAASA,EACThtE,SAAUA,EACVC,MAAOA,MzBu9XZoO,OAAS,MAAM8+D,IAAI,SAASvyE,EAAQU,EAAOJ,G0BxjY9C,YAmBA,SAASkyE,KACLhsE,KAAKisE,iBACLjsE,KAAKksE,UAAY,EACjBlsE,KAAKmsE,QAAU,KAsHnB,QAASC,GAAsBz0C,GAK3B,GAJA33B,KAAK23B,OAASA,EACds8B,EAAkBl6D,KAAKiG,MACvBA,KAAKqsE,YAAc,GAAIj9C,GACvBpvB,KAAKkF,OAAS40D,EAAqBniC,EAAO20C,UACrCtsE,KAAKkF,OACN,KAAM,iCAAmCyyB,EAAO20C,OAGpD,IAAIxqE,GAAQ9B,IACZA,MAAKusE,MAAM,SAAS57B,EAAMh3B,GACtB,GAAIA,EACA7X,EAAMwsB,MAAQ3U,EACd7X,EAAMuqE,YAAY1C,QAAQ,UACvB,CAMH,IAAK,GALD6C,GAAQ,GAAIR,GACZ/6D,KACAw7D,EAAQ97B,EAAKrqC,MAAM,MAEnBomE,EAAU5qE,EAAMoD,OAAOa,cAAc,SAASrM,GAAIuX,EAAS/T,KAAKxD,KAC3DizE,EAAK,EAAGA,EAAKF,EAAMzyE,SAAU2yE,EAAI,CACtC,GAAIvmE,GAAOqmE,EAAME,EACbvmE,GAAKpM,OAAS,GACd0yE,EAAQvmE,MAAMC,GAGtBsmE,EAAQ/jE,QAER6jE,EAAMI,YAAY37D,GAElBnP,EAAMuqE,YAAY1C,QAAQ6C,MAxKtC,GAAwB,mBAAbhzE,GACP,GAAI6L,GAAK7L,EAAQ,oBACb46D,EAAyC/uD,EAAGgvD,6BAC5CyF,EAAuBz0D,EAAG00D,WAC1B9F,EAAoB5uD,EAAG4uD,kBAEvBzuD,EAAMhM,EAAQ,SAMdqM,GALgBL,EAAIC,cACTD,EAAIE,SACFF,EAAII,WACNJ,EAAIG,SAEPnM,EAAQ,YAChB41B,EAAUvpB,EAAMupB,QAChBE,EAAUzpB,EAAMypB,OASxB08C,GAASrsE,UAAUitE,YAAc,SAAS37D,GAEtC,IAAK,GADD47D,MACK/4D,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,GACbtS,EAAM9H,EAAE6J,SAAW7J,EAAE8H,IACrBmQ,EAAK3R,KAAKisE,cAAczqE,EACvBmQ,KACDA,KACA3R,KAAKisE,cAAczqE,GAAOmQ,GAE9BA,EAAGzU,KAAKxD,GACRmzE,EAAMrrE,IAAO,CAEb,IAAIwgC,GAAMtoC,EAAEoG,IAAMpG,EAAEiE,IAAM,CACtBqkC,GAAMhiC,KAAKksE,YACXlsE,KAAKksE,UAAYlqC,GAGzB,IAAKxgC,IAAOqrE,GAAO,CACf,GAAIl7D,GAAK3R,KAAKisE,cAAczqE,EAC5BmQ,GAAG3Q,KAAK,SAAS8rE,EAAIC,GACjB,GAAI73D,GAAI43D,EAAGnvE,IAAMovE,EAAGpvE,GACpB,OAAS,IAALuX,EACOA,EACJ43D,EAAGhtE,IAAMitE,EAAGjtE,MAG3BE,KAAKmsE,QAAU,MAGnBH,EAASrsE,UAAUqtE,UAAY,SAASr7D,EAAIpX,GAExC,IADA,GAAIoG,GAAK,EAAG45D,EAAK5oD,EAAG3X,OACbugE,EAAK55D,GAAI,CACZ,GAAIwnC,IAAQxnC,EAAK45D,GAAI,EAAG,CACxB,IAAIpyB,GAAOx2B,EAAG3X,OACV,MAAO2X,GAAG3X,MACd,IAAIwgE,GAAK7oD,EAAGw2B,EACR5tC,GAAIigE,EAAG78D,IACP48D,EAAKpyB,EAELxnC,EAAKwnC,EAAM,EAGnB,MAAOoyB,IAGXyR,EAASrsE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,GAC1C,GAAI6R,GAAK3R,KAAKisE,cAAczqE,EAO5B,IANKmQ,IAEGA,EADsB,GAAtBnQ,EAAIxE,QAAQ,OACPgD,KAAKisE,cAAczqE,EAAIvE,UAAU,IAEjC+C,KAAKisE,cAAc,MAAQzqE,KAEnCmQ,EACD,QAMJ,KAAK,GAJDs7D,GAAOvvE,KAAKoC,IAAI,EAAGE,KAAKgtE,UAAUr7D,EAAIhU,EAAMqC,KAAKksE,UAAY,IAC7DgB,EAAOxvE,KAAKC,IAAIgU,EAAG3X,OAAS,EAAGgG,KAAKgtE,UAAUr7D,EAAI7R,IAElDsY,KACKtE,EAAKm5D,EAAYC,GAANp5D,IAAcA,EAAI,CAClC,GAAIpa,GAAIiY,EAAGmC,EACPpa,GAAEiE,KAAOmC,GAAOpG,EAAEoG,KAAOnC,GACzBya,EAAIlb,KAAKxD,GAEjB,MAAO0e,IAGX4zD,EAASrsE,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,GACpD,GAAoB,MAAhBrT,KAAKmsE,QAAiB,CACtBnsE,KAAKmsE,UACL,KAAK,GAAI3qE,KAAOxB,MAAKisE,cACjBjsE,KAAKmsE,QAAQjvE,KAAKsE,EAEtBxB,MAAKmsE,QAAQnrE,OAGjB,GAAI2Q,GAAK3R,KAAKisE,cAAczqE,EAU5B,IATKmQ,IACyB,GAAtBnQ,EAAIxE,QAAQ,QACZwE,EAAMA,EAAIvE,UAAU,GACpB0U,EAAK3R,KAAKisE,cAAczqE,KAExBA,EAAM,MAAQA,EACdmQ,EAAK3R,KAAKisE,cAAczqE,MAG3BmQ,EACD,MAAO,KAEX,IAAIlY,GAAIiE,KAAKoC,IAAI,EAAGpC,KAAKC,IAAIqC,KAAKgtE,UAAUr7D,EAAI7O,GAAM6O,EAAG3X,OAAS,GAClE,IAAIqZ,EAAM,EAAG,CACT,KAAO5Z,EAAIkY,EAAG3X,QAAQ,CAClB,GAAIN,GAAIiY,EAAGlY,IACX,IAAIC,EAAEiE,IAAMmF,EACR,MAAOpJ,GAEf,GAAIyzE,GAASntE,KAAKmsE,QAAQnvE,QAAQwE,GAAO,CAGzC,OAFI2rE,IAAUntE,KAAKmsE,QAAQnyE,SACvBmzE,EAAS,GACNntE,KAAKooC,gBAAgBpoC,KAAKmsE,QAAQgB,GAAS,EAAG95D,GAErD,KAAO5Z,GAAK,GAAG,CACX,GAAIC,GAAIiY,EAAGlY,IACX,IAAIC,EAAEoG,IAAMgD,EACR,MAAOpJ,GAEf,GAAIyzE,GAASntE,KAAKmsE,QAAQnvE,QAAQwE,GAAO,CAGzC,OAFa,GAAT2rE,IACAA,EAASntE,KAAKmsE,QAAQnyE,OAAS,GAC5BgG,KAAKooC,gBAAgBpoC,KAAKmsE,QAAQgB,GAAS,KAAa95D,IAuCvE+4D,EAAsBzsE,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WAElEysE,EAAsBzsE,UAAU4sE,MAAQ,SAAShxE,GAC7C,GAAIyE,KAAK23B,OAAO3gB,KAAM,CAClB,GAAI7d,GAAI,GAAI4e,WACZ5e,GAAE6e,UAAY,WACV,MAAOzc,GAASpC,EAAE0E,OAAQ1E,EAAEm1B,QAEhCn1B,EAAEi0E,WAAWptE,KAAK23B,OAAO3gB,UACtB,CACH,GAAIhX,KAAK23B,OAAOne,YACZ,GAAI/X,IAAQ+X,YAAcxZ,KAAK23B,OAAOne,YAC1C8V,GAAQtvB,KAAK23B,OAAOwR,IAAK5tC,EAAUkG,KAI3C2qE,EAAsBzsE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMzmD,GAChF,GAAIpM,GAAQ9B,IACZA,MAAKqsE,YAAYtB,MAAM,SAASyB,GAC5B,GAAIA,EAAO,CACP,GAAI9yE,GAAI8yE,EAAM9wE,MAAM8F,EAAK7D,EAAKmC,EAC9B,OAAOoO,GAAI,KAAMxU,EAAG,KAEpB,MAAOwU,GAAIpM,EAAMwsB,UAK7B89C,EAAsBzsE,UAAUqJ,cAAgB,SAASzN,GACjDyE,KAAKkF,QAAUlF,KAAKkF,OAAO8D,eAC3BhJ,KAAKkF,OAAO8D,cAAczN,IAGlC6wE,EAAsBzsE,UAAU0tE,eAAiB,SAAS9xE,GAClDyE,KAAKkF,QAAUlF,KAAKkF,OAAOmoE,gBAC3BrtE,KAAKkF,OAAOmoE,eAAe9xE,IAGnC6wE,EAAsBzsE,UAAU80D,UAAY,WACxC,MAAO,MAGX2X,EAAsBzsE,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK9X,GACtE,GAAIuG,GAAQ9B,IACZA,MAAKqsE,YAAYtB,MAAM,SAASyB,GAC5B,MAAIA,GACOjxE,EAASixE,EAAMpkC,gBAAgB5mC,EAAKsB,EAAKuQ,IAEzC9X,EAAS,KAAMuG,EAAMwsB,UAMxC89C,EAAsBzsE,UAAUq8C,aAAe,WAC3C,GAAIN,IAAQ14B,MAAM,EAClB,OAAO04B,IAGX0Y,EAAuC,WAAY,SAASz8B,GACxD,OAAQ1mB,SAAU,GAAIm7D,GAAsBz0C,Q1BujY7C5tB,QAAQ,GAAGC,mBAAmB,GAAGC,UAAU,KAAKqjE,IAAI,SAAS9zE,QAAQU,OAAOJ,S2BlyY/E,YAcA,SAASyzE,uBAAsB51C,GAG3B,GAFAs8B,kBAAkBl6D,KAAKiG,MACvBA,KAAK23B,OAASA,EACVA,EAAOwR,IACTnpC,KAAKk0D,KAAOv8B,EAAOwR,QACd,CAAA,IAAIxR,EAAO61C,OAGd,KAAM,IAAI7zE,OAAM,6FAFhBqG,MAAKk0D,KAAO1nC,OAAOD,SAAStD,OAAS,WAAa0O,EAAO61C,OAAS,IAAM9vE,KAAK+vE,SAKjFztE,KAAKm0D,QAAUx8B,EAAOw8B,SAAW,QAEN,gBAAhBx8B,GAAOrzB,KACdtE,KAAKsE,MAAQqzB,EAAOrzB,MAEpBtE,KAAKsE,KAAOqzB,EAAOrzB,OAAS,cA4PpC,QAASopE,oBAAmBF,EAAQlxD,EAASqb,GAEzC,GAAIrzB,GAAOqzB,EAAOg2C,WACdC,EAAUj2C,EAAOk2C,aAAazI,IAC9B0I,EAAUn2C,EAAOk2C,aAAarwE,GAClC,IAAY,YAAT8G,EAEC,YADAgY,EAAQhY,KAAO,UAGnB,IAAY,SAATA,EAAiB,CAChB,GAAIypE,GAAYp2C,EAAOq2C,UACvB,OAAiD,IAA7CR,EAAOO,GAAWjsD,OAAO6V,EAAOs2C,WAChC3xD,EAAQhY,KAAO,YACfgY,EAAQ+8B,OAAS,UAIjB/8B,EAAQhY,KAAO,YACfgY,EAAQ+8B,OAAS,WAIpB,MAAGu0B,IAAWJ,EAAOI,IAAYE,GAAWN,EAAOM,GAChDN,EAAOI,GAAS5zE,OAAS,GAAKwzE,EAAOM,GAAS9zE,OAAS,OACvDsiB,EAAQhY,KAAO,SAGU,MAApBkpE,EAAOI,IACZtxD,EAAQhY,KAAO,eACfgY,EAAQ+8B,OAAS,MAGQ,MAApBm0B,EAAOI,IACZtxD,EAAQhY,KAAO,eACfgY,EAAQ+8B,OAAS,MAGQ,MAApBm0B,EAAOI,IACZtxD,EAAQhY,KAAO,eACfgY,EAAQ+8B,OAAS,MAGQ,MAApBm0B,EAAOI,IACZtxD,EAAQhY,KAAO,eACfgY,EAAQ+8B,OAAS,MAGmB,IAA/Bm0B,EAAOI,GAAS9rD,OAAO,MAC5BxF,EAAQhY,KAAO,eACfgY,EAAQ+8B,OAAS,cAIjB/8B,EAAQhY,KAAO,eACfgY,EAAQ+8B,OAAS,iBAIrB/8B,EAAQhY,KAAO,WAlVvB,GAAwB,mBAAb9K,SACP,GAAI6L,IAAK7L,QAAQ,oBACb46D,uCAAyC/uD,GAAGgvD,6BAC5CJ,kBAAoB5uD,GAAG4uD,kBAEvBzuD,IAAMhM,QAAQ,SACdiM,cAAgBD,IAAIC,cACpBC,SAAWF,IAAIE,SACfE,WAAaJ,IAAII,WACjBD,SAAWH,IAAIG,QAuBvB4nE,uBAAsB5tE,UAAY+8C,OAAO4X,OAAOL,kBAAkBt0D,WAClE4tE,sBAAsB5tE,UAAU+X,YAAc61D,sBAE9CA,sBAAsB5tE,UAAUqJ,cAAgB,SAASzN,GACrD,GAAI0N,GAAa,GAAIxD,eAGb+uD,EAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS5T,OAAS,IAClB4T,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,QACnBN,EAAWK,WAAWhF,KAAM,UAAW+0C,OAAQ,KAAM,KAAMmb,EAG3D,IAAIA,GAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS5T,OAAS,IAClB4T,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,OACnBN,EAAWK,WAAWhF,KAAM,UAAW+0C,OAAQ,KAAM,KAAMmb,EAG3D,IAAIA,GAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS5T,OAAS,IAClB4T,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,SACnBN,EAAWK,WAAWhF,KAAM,UAAW+0C,OAAQ,KAAM,KAAMmb,EAG3D,IAAIA,GAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS5T,OAAS,IAClB4T,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,MACnBN,EAAWK,WAAWhF,KAAM,UAAW+0C,OAAQ,KAAM,KAAMmb,EAG3D,IAAIA,GAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAS5T,OAAS,IAClB4T,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,WACnBN,EAAWK,WAAWhF,KAAM,UAAW+0C,OAAQ,WAAY,KAAMmb,EAGjE,IAAIA,GAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,MACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,SACnBN,EAAWK,WAAWhF,KAAM,SAAU,KAAMkwD,EAG5C,IAAIA,GAAW,GAAI9uD,SACnB8uD,GAASrrD,MAAQ,OACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,QACnBN,EAAWK,WAAWhF,KAAM,UAAW+0C,OAAQ,YAAa,KAAMmb,EAGlE,IAAItrD,GAAW,GAAIxD,SACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,OACnBL,EAASE,QAAU,OACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,EAG9C,IAAIA,GAAW,GAAIxD,SACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,MACnBL,EAASE,QAAU,MACnBF,EAASG,OAAS,EAClBH,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,OAAQ+0C,OAAQ,QAAS,KAAMnwC,EAG3D,IAAIA,GAAW,GAAIxD,SACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,QACnBF,EAASG,OAAS,EAClBH,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,OAAQ+0C,OAAQ,UAAW,KAAMnwC,EAG7D,IAAIsrD,GAAW,GAAI9uD,SAOvB,OANI8uD,GAASrrD,MAAQ,YACjBqrD,EAASprD,QAAU,OACnBorD,EAASnrD,OAAS,GAClBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAMkwD,GAG3Cj5D,EAAS0N,IAIpBskE,sBAAsB5tE,UAAU80D,UAAY,WACxC,UAGJ8Y,sBAAsB5tE,UAAUjE,MAAQ,SAAS8F,IAAK7D,IAAKmC,IAAKyzB,MAAOmhC,MAAOC,KAAMp5D,UAChF,GAAIuG,OAAQ9B,KACR23B,OAAS33B,KAAK23B,MAElB,KAAKA,OAAOk2C,aAAarsE,MAAQm2B,OAAOk2C,aAAa/qE,IACjD,KAAM,IAAInJ,OAAM,6FAGpB,IAAImE,KAAMkC,KAAKk0D,IAGf,IAAIv8B,OAAOu2C,MAAO,CAEd,IAAK,GADDC,eACKpuE,MAAQ,EAAGA,MAAQ43B,OAAOu2C,MAAMl0E,SAAU+F,MAAO,CACtD,GAAIquE,MAAOz2C,OAAOu2C,MAAMnuE,OACpBsuE,UAAYD,KAAK9nE,MAAM,IAC3B6nE,YAAWjxE,KAAKmxE,UAAU,IAEalsE,SAAxCgsE,WAAWx2C,OAAOk2C,aAAarsE,MAC9B2sE,WAAWjxE,KAAKy6B,OAAOk2C,aAAarsE,KAEGW,SAAxCgsE,WAAWx2C,OAAOk2C,aAAa/qE,MAC9BqrE,WAAWjxE,KAAKy6B,OAAOk2C,aAAa/qE,KAEGX,SAAxCgsE,WAAWx2C,OAAOk2C,aAAazI,MAC3BztC,OAAOk2C,aAAazI,KACnB+I,WAAWjxE,KAAKy6B,OAAOk2C,aAAazI,KAGDjjE,SAAxCgsE,WAAWx2C,OAAOk2C,aAAarwE,MAC3Bm6B,OAAOk2C,aAAarwE,KACnB2wE,WAAWjxE,KAAKy6B,OAAOk2C,aAAarwE;AAGA2E,SAAzCgsE,WAAWx2C,OAAOk2C,aAAal5B,OAC3Bhd,OAAOk2C,aAAal5B,MACnBw5B,WAAWjxE,KAAKy6B,OAAOk2C,aAAal5B,MAG5C72C,KAAO,UAAYwwE,mBAAmBH,YAItCrwE,KADA65B,OAAOk2C,aAAal5B,KACb,MAAQ25B,mBAAmB32C,OAAOk2C,aAAarsE,KAAO,KAAOA,IAAM,KAAOm2B,OAAOk2C,aAAa/qE,IAAM,OAASnF,IAAM,IAAMg6B,OAAOk2C,aAAa/qE,IAAM,OAAShD,IAAM,IAAM63B,OAAOk2C,aAAal5B,KAAO,OAASh3C,IAAM,IAAMg6B,OAAOk2C,aAAal5B,KAAO,OAAS70C,IAAM,IAElQ,MAAQwuE,mBAAmB32C,OAAOk2C,aAAarsE,KAAO,KAAOA,IAAM,IAAMm2B,OAAOk2C,aAAa/qE,IAAM,OAASnF,IAAM,IAAMg6B,OAAOk2C,aAAa/qE,IAAM,OAAShD,GAGtK,IAAIiZ,KAAM,GAAIC,eACdD,KAAIK,mBAAqB,WACxB,GAAsB,GAAlBL,IAAIM,WAIJ,GAHGvX,MAAM8yD,OACN9yD,MAAM+yD,iBAEL97C,IAAIO,QAAU,IAAK,CAChB,GAAIK,KAAM,cAAgBZ,IAAIO,MAC9B,KACI,GAAIw7C,IAAK/zB,KAAK56B,MAAM4S,IAAIuB,SACpBw6C,IAAGxmC,QACH3U,IAAMm7C,GAAGxmC,OAEf,MAAOuX,KAEftqC,SAASoe,IAAK,UACR,CAIN,IAAK,GAHDo7C,IAAKh0B,KAAK56B,MAAM4S,IAAIuB,UACpBi0D,MAAQxZ,GAAGwZ,MACXt9D,YACK6C,GAAK,EAAGA,GAAKy6D,MAAMv0E,SAAU8Z,GAAI,CAChC,GAAI05D,QAASe,MAAMz6D,IACfpM,SACA4U,QAAU,GAAI1W,WAClB0W,SAAQ/Y,QAAU/B,IAClB8a,QAAQ3e,IAAwC,EAAlC6vE,OAAO71C,OAAOk2C,aAAa/qE,KACtC60B,OAAOk2C,aAAal5B,KAEnBr4B,QAAQxc,IAAyC,EAAnC0tE,OAAO71C,OAAOk2C,aAAal5B,MAGzCr4B,QAAQxc,IAAwC,EAAlC0tE,OAAO71C,OAAOk2C,aAAa/qE,KAG7CwZ,QAAQhY,KAAOkpE,OAAOxY,cAAgB,SACtC,IAAIwZ,WASJ,IAPIA,WADA72C,OAAOq2C,WACMr2C,OAAOq2C,WAEP,KAEjB1xD,QAAQ7U,GAAK+lE,OAAOgB,YAGhB72C,OAAOu2C,MACP,IAAK,GAAInuE,OAAQ,EAAGA,MAAQ43B,OAAOu2C,MAAMl0E,SAAU+F,MAAO,CACtD,GAAIquE,MAAOz2C,OAAOu2C,MAAMnuE,OACpBsuE,UAAYD,KAAK9nE,MAAM,KAEvBI,MAAQ2nE,UAAU,GAClBjqE,MAAQopE,OAAOa,UAAU,GAE7B3mE,OAAMxK,KAAKwJ,MAAQ,IAAMtC,OAG7BuzB,OAAOslC,UACP3gD,QAAQ2gD,QAAUG,KAAKzlC,OAAOslC,SAC9B3gD,QAAQkxD,OAASA,QAGjB9lE,MAAM1N,OAAS,IACfsiB,QAAQ5U,MAAQA,OAGK,YAAtBiwB,OAAOg2C,aACNrxD,QAAQ3V,MAAQ6mE,OAAO71C,OAAO82C,aAGlCf,mBAAmBF,OAAQlxD,QAASqb,QACpCrb,QAAQw/C,UAAW,EACzB7qD,SAAS/T,KAAKof,SAElB/gB,SAAS,KAAM0V,YAMrBnP,MAAM8yD,OACN9yD,MAAM+yD,iBAEN97C,IAAIG,KAAK,MAAOpb,KAAK,GACrBib,IAAIqB,aAAe,OACnBrB,IAAIW,KAAK,KAkEb06C,uCAAuC,WAAY,SAASz8B,GACxD,OAAQ1mB,SAAU,GAAIs8D,uBAAsB51C,Q3BkyY7C5tB,QAAQ,GAAGC,mBAAmB,KAAK0kE,IAAI,SAASl1E,EAAQU,EAAOJ,G4BpoZlE,Y5B2pZA,SAASyiD,GAAwB9kC,GAAO,GAAIA,GAAOA,EAAI+kC,WAAc,MAAO/kC,EAAc,IAAIglC,KAAa,IAAW,MAAPhlC,EAAe,IAAK,GAAIrJ,KAAOqJ,GAAWilC,OAAO/8C,UAAUg9C,eAAe5iD,KAAK0d,EAAKrJ,KAAMquC,EAAOruC,GAAOqJ,EAAIrJ,GAAgC,OAAtBquC,GAAAA,WAAiBhlC,EAAYglC,E4BjoZlQ,QAASre,GAAW9kB,EAAQkD,GACxBie,EAASje,GACTA,EAAKogC,aAAatjC,GAGtB,QAASmhB,GAASk0C,GACd,GAAIC,GAAcD,EAAUnrD,UAAUkE,MAClCmnD,EAAe,SAAA51E,GAAA,MAAKA,GAAEuqB,UAAUoE,IAG/B+mD,GAAUxzC,UACXwzC,EAAUxzC,QAAU,EAExB,IAAI0hB,GAAS8xB,EAAUnzC,SAASshB,WAAW,MACvC9xB,EAAS2jD,EAAU1zD,QAAQ+P,QAAUwB,OAAOqc,iBAAmB,CAC/D7d,IACA6xB,EAAOtpB,MAAM,EAAG,EAKpB,IAAIxQ,GAAQ4rD,EAAU1zD,QAAQ8H,MACtB/T,OAAO,SAAAwN,GAAA,MAAuC,WAA/BtF,EAAO23D,EAAaryD,KAC5BqyD,EAAaryD,GAAMsyD,WAAaF,EAAYE,WAC3CtyD,EAAKuqB,iBAAmBvqB,EAAKugC,mBAGzCgyB,EAAY3xB,EAAE4xB,KACd5xB,EAAE/1C,IAAI,SAAAmV,GAAA,MAAQA,GAAKgH,UAAUoE,IAAIttB,SACjC8iD,EAAE6xB,OAAO,SAACC,EAAK50E,GAAN,MAA0B40E,GAAT50E,EAAeA,EAAS40E,GAAK,IACzDnsD,EAEFA,GAAMnH,QAAQ,SAAAY,GACNA,EAAKyf,gBACL,EAAA+gB,EAAAC,aAAYzgC,EAAMA,EAAKugC,iBAIvBx1B,EAAgB21B,gBAAgB1gC,EAAMqgC,EACNgyB,EAAaryD,GAAMliB,OAASy0E,GAC5B,GAI/BJ,EAAUvzC,mBACXuzC,EAAUvzC,iBAAmB5e,EAAK4e,mBAI1C,IAAI8rB,GAAe9J,EAAE4xB,KACjB5xB,EAAE/1C,IAAI,SAAAmV,GAAA,MACA4gC,GAAE/1C,IAAI,SAAAk9C,GAAA,MAAWA,GAAQtvB,OAAS45C,EAAaryD,GAAMliB,QAC/CkiB,EAAKwY,YACjBooB,EAAE+xB,QACF/xB,EAAE6xB,OAAO,SAACC,EAAKxoC,GAAN,MAAYA,GAAIwoC,EAAMxoC,EAAIwoC,KAAME,EAAAA,IACzChyB,EAAEzgC,KAAKoyD,IACThsD,EAQF,IANAu6B,EAAgBqxB,EAAW9xB,EAAQ7xB,EAAQk8B,GAAc,GAEzDnkC,EAAM/hB,KAAK,SAACquE,EAAIC,GAAL,MAAYT,GAAaQ,GAAIh7D,EAAIw6D,EAAaS,GAAIj7D,IAIzDu6D,EAAYjrB,MAAQ5gC,GAASA,EAAMA,EAAM/oB,OAAO,IAAM+oB,EAAMA,EAAM/oB,OAAO,GAAGg7B,SAAS,GAAI,CACzF,GAAI2uB,GAAO,GAAAwM,GAAA1L,UAAcyC,EACA0nB,EAAYW,YACZX,EAAYY,aAErCzsD,GAAMA,EAAM/oB,OAAO,GAAGg7B,SAAS,GAAG3H,OAAOm3B,QAAQb,GAarD,GAVA5gC,EAAMnH,QAAQ,SAAAY,GAGVqgC,EAAOsK,OACP5/B,EAAgBg2B,MAAM/gC,EAAMqgC,EAAQ7xB,GAAQ,GAC5C6xB,EAAOW,YAGXmxB,EAAU7pC,cAEN8pC,EAAYr5C,MAAO,CACnB,GAAIk6C,GAAcloD,EAAgB4mC,mBAAmBwgB,EAAWznB,EAA+B,EAAlBynB,EAAUxzC,QAAWnQ,EAClGzD,GAAgBrB,WAAWupD,EAAad,EAAWC,EAAYr5C,MAAO,IAGzB,kBAAtCo5C,GAAUnrD,UAAUi6B,cAC3BkxB,EAAUnrD,UAAUi6B,aAAaZ,EAAQ8xB,GAG7CA,EAAU9uC,WAAa,EACvB8uC,EAAU1zD,QAAQwZ,eAGtB,QAAS6oB,GAAgB9gC,EAAMqgC,EAAQ7xB,EAAQk8B,GAA0B,GAAZJ,GAAYpC,UAAA1qD,OAAA,GAAAmI,SAAAuiD,UAAA,GAAAA,UAAA,IAAN,EAC3DqC,EAAevqC,EAAKvB,QAAQkO,kBAAoB,GAChD6B,KACA+7B,GAAgB,EAGpB,IAAIC,GAA0B,EAApBxqC,EAAKgf,SAAShe,KACdupC,GAAe,GAArBC,IACAxqC,EAAKgf,SAAShe,MAAQwpC,EAAMD,GAGhCG,GAAgB,EAAE1qC,EAAK2e,QACvB+rB,EAAexpD,KAAKoC,IAAIonD,EAAc1qC,EAAKvB,QAAQkP,eAE/C+8B,GAAgB1qC,EAAKgf,SAASvG,SAC9BzY,EAAKgf,SAASvG,OAASiyB,EAEnBl8B,IACAxO,EAAKgf,SAASvG,QAAU,IAIhCzY,EAAKioB,eAAerjB,MAAMua,KAAO,UACjCnf,EAAKgf,SAASpa,MAAM5D,MAAQwN,EAAU,GAAMg8B,EAAI,EAAK,KAAS,GAAKA,EAAM,KACzExqC,EAAKgf,SAASpa,MAAM6T,OAAS,GAAKiyB,EAAe,KACjD1qC,EAAK+X,aAAgB72B,KAAKoC,IAAIonD,EAAc1qC,EAAKvB,QAAQkP,eAEzD3N,EAAK0a,eACL1a,EAAKqoB,QAAUroB,EAAKvB,QAAQkR,UAExB26B,GACAv/B,EAAgBq/B,cAAc/J,EAAQmK,EAAKE,GAG/C3/B,EAAgB6+B,aAAa5pC,EAAMqgC,EAAQqK,G5B6+Y/CxK,OAAO8S,eAAe11D,EAAS,cAC3BsK,OAAO,IAEXtK,EAAQ2gC,SAAW3gC,EAAQskC,WAAaj8B,MAExC,IAAI+U,GAA4B,kBAAXK,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAO5X,UAAY,eAAkB8X,I4B3oZtQulC,EAAAxjD,EAAA,sBAEA22D,EAAA32D,EAAA,eAEA45D,EAAA55D,EAAA,sBAAY+tB,E5B+oZUg1B,EAAwB6W,G4B7oZ9ChD,EAAA52D,EAAA,SAAY4jD,E5BipZJb,EAAwB6T,EAIhCt2D,G4BnpZSskC,WAAAA,E5BopZTtkC,E4BppZqB2gC,SAAAA,I5BsyZlBmP,qBAAqB,GAAG6mB,cAAc,GAAGC,qBAAqB,GAAGG,MAAQ,MAAM6e,IAAI,SAASl2E,EAAQU,EAAOJ,GAC9G,Y6BzyZA,SAASwhB,GAAcpiB,GACnB,OAAU,EAAFA,GAAKmD,WAAW0B,QAAQ,wBAAyB,KAG7D,QAAS4xB,GAAiB50B,GACtB,GAAI9B,GAAI,GAAK8B,EACT40E,EAAM12E,EAAE+D,QAAQ,IACpB,IAAU,EAAN2yE,EACA,MAAO12E,EAEP,IAAI22E,GAAe,CAKnB,OAJyB,KAArB32E,EAAEgE,UAAU,EAAG,MACb2yE,EAGFD,GAAOC,EACA32E,EAAEgE,UAAU,EAAG0yE,GAEf12E,EAAEgE,UAAU,EAAG0yE,EAAM,GAKjB,mBAAZz1E,KACPA,EAAOJ,SACHwhB,cAAeA,EACfqU,iBAAkBA,S7BwzZpBkgD,IAAI,SAASr2E,EAAQU,EAAOJ,G8Bl1ZlC,YAQA,SAAS2uE,GAAqBxgD,EAASxmB,GACnCzB,KAAKioB,QAAUA,EACfjoB,KAAKyB,KAAOA,MACZzB,KAAK8vE,qBACL9vE,KAAK+vE,sBACL/vE,KAAKgwE,mBACLhwE,KAAKiwE,YACLjwE,KAAKkwE,YAEL,KAAK,GAAIz2E,GAAI,EAAGA,EAAIuG,KAAKioB,QAAQjuB,SAAUP,EACvCuG,KAAKmwE,MAAM12E,EAGY,mBAAhBgI,GAAK2uE,MACZpwE,KAAKowE,MAAQ3uE,EAAK2uE,MACG,UAAd3uE,EAAK2uE,MACZpwE,KAAKowE,MAAQC,EACQ,cAAd5uE,EAAK2uE,OACZpwE,KAAKowE,MAAQC,EACbrwE,KAAKswE,wBAAyB,GAE9BtwE,KAAKowE,MAAQG,EAsLrB,QAASC,GAAa74C,EAAQp8B,EAAU0sB,GACpCjoB,KAAK23B,OAASA,EACd33B,KAAKzE,SAAWA,EAChByE,KAAKioB,QAAUA,EACfjoB,KAAKkxC,MAAQjpB,EAAQjuB,OAErBgG,KAAKywE,YAAc,EACnBzwE,KAAK0wE,YAAc,EACnB1wE,KAAK2wE,WACL3wE,KAAKiR,YACLjR,KAAK4wE,YACL5wE,KAAKuzB,MAAQ,KAmDjB,QAASg9C,GAAiCM,GAGtC,IAAK,GAFDC,MAEKC,EAAM,EAAGA,EAAMF,EAAY72E,SAAU+2E,EAAK,CAG/C,IAAK,GAFDC,MACAC,EAAKJ,EAAYE,GACZj9D,EAAK,EAAGA,EAAKm9D,EAAGj3E,SAAU8Z,EACnCk9D,EAAGhxE,KAAKkxE,cAAcD,EAAGn9D,KAAQm9D,EAAGn9D,EAEpCg9D,GAAM5zE,KAAK8zE,GAMf,IAAK,GAFDG,MACArqC,EAAK+pC,EAAY,GACZ/8D,EAAK,EAAGA,EAAKgzB,EAAG9sC,SAAU8Z,EAAI,CAGnC,IAAK,GAFJpa,GAAIotC,EAAGhzB,GAECimC,EAAK,EAAGA,EAAK+2B,EAAM92E,SAAU+/C,EAAI,CACtC,GAAIi3B,GAAKF,EAAM/2B,EAElB,IADAk3B,EAAKD,EAAGhxE,KAAKkxE,cAAcx3E,IAEpB,IAAK,GAAI0X,KAAK6/D,GACA,UAAN7/D,EACA1X,EAAEivD,OAASsoB,EAAGtqE,MACD,QAANyK,GAAqB,QAANA,GAAqB,YAANA,GAAyB,iBAANA,IAGxD1X,EAAE0X,GAAK6/D,EAAG7/D,IAK7B+/D,EAAGj0E,KAAKxD,GAET,MAAOy3E,GAGX,QAASd,GAAkCQ,EAAa5oD,GAEpD,IAAK,GADDhX,MACK8/D,EAAM,EAAGA,EAAMF,EAAY72E,SAAU+2E,EAG1C,IAAK,GAFDK,GAAKP,EAAYE,GACjBj0E,EAAOmrB,EAAQ8oD,GAAKj0E,KACfgX,EAAK,EAAGA,EAAKs9D,EAAGp3E,SAAU8Z,EAAI,CACnC,GAAIpa,GAAI03E,EAAGt9D,EACXpa,GAAE2/C,OAASv8C,EACXmU,EAAS/T,KAAKxD,GAGtB,MAAOuX,GAGX,QAASogE,GAAwBj4E,EAAGk4E,GAChC,MAAKl4E,GAAE4iD,aAGI5iD,EAAE4iD,eAAes1B,IAFjB,EArUf,GAAwB,mBAAb93E,GACP,GAAIqM,GAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,YACpB6/B,EAAe9/B,EAAM8/B,YA4B7B8iC,GAAqB9oE,UAAUwwE,MAAQ,SAASj3E,GAC5C,GAAIE,GAAI4G,KAAKioB,QAAQ/uB,GACjB4I,EAAQ9B,IACZA,MAAKiwE,SAAS/2E,GAAK,EAEfE,EAAEm4E,qBACFn4E,EAAEm4E,oBAAoB,SAAS72E,GAC3BoH,EAAMmuE,SAAS/2E,GAAKwB,EACpBoH,EAAM+yD,mBAGVz7D,EAAEo4E,mBACFp4E,EAAEo4E,kBAAkB,WAChB1vE,EAAM2vE,iBAGVr4E,EAAEs4E,sBACFt4E,EAAEs4E,qBAAqB,SAASv4E,GAC5B2I,EAAMouE,UAAUh3E,GAAKC,EACrB2I,EAAM6vE,qBAKlBlJ,EAAqB9oE,UAAU+xE,qBAAuB,SAAS73E,GAC3DmG,KAAK+vE,mBAAmB7yE,KAAKrD,GAC7BmG,KAAK4xE,wBAAwB/3E,IAGjC4uE,EAAqB9oE,UAAUkyE,wBAA0B,SAASh4E,GAC9D,GAAI6rC,GAAMC,EAAa3lC,KAAK+vE,mBAAoBl2E,EAC5C6rC,IAAO,GACP1lC,KAAK+vE,mBAAmBz+D,OAAOo0B,EAAK,IAI5C+iC,EAAqB9oE,UAAUgyE,gBAAkB,WAC7C,IAAK,GAAIl4E,GAAI,EAAGA,EAAIuG,KAAK+vE,mBAAmB/1E,SAAUP,EAClDuG,KAAK4xE,wBAAwB5xE,KAAK+vE,mBAAmBt2E,KAI7DgvE,EAAqB9oE,UAAUiyE,wBAA0B,SAAS/3E,GAE9D,IAAK,GADDV,GAAI,KACCM,EAAI,EAAGA,EAAIuG,KAAKkwE,UAAUl2E,SAAUP,EACzC,GAAyB,MAArBuG,KAAKkwE,UAAUz2E,GAAY,CAC3BN,EAAI6G,KAAKkwE,UAAUz2E,EAAI,OAG/B,IACII,EAAEV,GACJ,MAAOH,GACLwW,QAAQC,IAAIzW,KAIpByvE,EAAqB9oE,UAAU4xE,oBAAsB,SAAS13E,GAC1DmG,KAAK8vE,kBAAkB5yE,KAAKrD,IAGhC4uE,EAAqB9oE,UAAUmyE,uBAAyB,SAASj4E,GAC7D,GAAI6rC,GAAMC,EAAa3lC,KAAK8vE,kBAAmBj2E,EAC3C6rC,IAAO,GACP1lC,KAAK8vE,kBAAkBx+D,OAAOo0B,EAAK,IAI3C+iC,EAAqB9oE,UAAUk1D,eAAiB,WAE5C,IAAK,GADDD,GAAO,EACFn7D,EAAI,EAAGA,EAAIuG,KAAKiwE,SAASj2E,SAAUP,EACxCm7D,GAAQ50D,KAAKiwE,SAASx2E,EAG1B,KAAK,GAAIkzE,GAAK,EAAGA,EAAK3sE,KAAK8vE,kBAAkB91E,SAAU2yE,EACnD,IACI3sE,KAAK8vE,kBAAkBnD,GAAI/X,GAC7B,MAAO57D,GACLwW,QAAQC,IAAIzW,KAKxByvE,EAAqB9oE,UAAU6xE,kBAAoB,SAASO,GACxD/xE,KAAKgwE,gBAAgB9yE,KAAK60E,IAG9BtJ,EAAqB9oE,UAAUqyE,qBAAuB,SAASn4E,GAC3D,GAAI6rC,GAAMC,EAAa3lC,KAAKgwE,gBAAiBn2E,EACzC6rC,IAAO,GACP1lC,KAAKgwE,gBAAgB1+D,OAAOo0B,EAAK,IAIzC+iC,EAAqB9oE,UAAU8xE,aAAe,WAC1C,IAAK,GAAI9E,GAAK,EAAGA,EAAK3sE,KAAKgwE,gBAAgBh2E,SAAU2yE,EACjD,IACI3sE,KAAKgwE,gBAAgBrD,GAAI3sE,KAAK40D,MAChC,MAAO57D,GACLwW,QAAQC,IAAIzW,KAKxByvE,EAAqB9oE,UAAU80D,UAAY,WACvC,MAAOz0D,MAAKioB,QAAQ,GAAGwsC,aAG3BgU,EAAqB9oE,UAAUqJ,cAAgB,SAASzN,GACpD,MAAOyE,MAAKioB,QAAQ,GAAGjf,cAAczN,IAGzCktE,EAAqB9oE,UAAUq8C,aAAe,WAC1C,GAAIN,MACAu2B,EAAKjyE,KAAKioB,QAAQ,EAClBgqD,GAAGj2B,eACHN,EAAO51C,EAAYmsE,EAAGj2B,gBAE1B,KAAK,GAAIviD,GAAI,EAAGA,EAAIuG,KAAKioB,QAAQjuB,SAAUP,EAAG,CAC1C,GAAIs8B,GAAK/1B,KAAKioB,QAAQxuB,EACtB,IAAIs8B,EAAGimB,aAAc,CACjB,GAAIiQ,GAAKl2B,EAAGimB,cACRiQ,GAAGnqC,SACH45B,EAAK55B,OAASmqC,EAAGnqC,SAK7B,MAAO45B,IAGX+sB,EAAqB9oE,UAAUmiB,OAAS,SAASuzC,EAAO95D,GACpD,IAAK,GAAI9B,GAAI,EAAGA,EAAIuG,KAAKioB,QAAQjuB,SAAUP,EACvC,GAAI43E,EAAwBrxE,KAAKioB,QAAQxuB,GAAI,UACzC,MAAOuG,MAAKioB,QAAQxuB,GAAGqoB,OAAOuzC,EAAO95D,IAKjDktE,EAAqB9oE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,EAAU0uE,GACzF,GAAIhiD,EACJ,IAAIjoB,KAAKswE,uBAAwB,CAC7BroD,IAEA,KAAK,GADDiqD,GAAMjI,EAAa6B,OACd/1C,EAAK,EAAGA,EAAK/1B,KAAKioB,QAAQjuB,SAAU+7B,EAEzC,IAAK,GADD4B,GAAS33B,KAAKioB,QAAQ8N,GACjBjiB,EAAK,EAAGA,EAAKo+D,EAAIl4E,SAAU8Z,EAAI,CACpC,GAAI9E,GAASkjE,EAAIp+D,EACjB,KAAK9E,EAAOqqC,QAAUrqC,EAAOqqC,QAAU1hB,EAAO76B,KAAM,CAChDmrB,EAAQ/qB,KAAKy6B,EACb,aAKZ1P,GAAUjoB,KAAKioB,OAInB,KAAK,GADDghD,GAAQ,GAAIuH,GAAaxwE,KAAMzE,EAAU0sB,GACpC8N,EAAK,EAAGA,EAAK9N,EAAQjuB,SAAU+7B,EACxC/1B,KAAKmyE,OAAOlJ,EAAOlzC,EAAI9N,EAAQ8N,GAAKv0B,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMsV,IAI3ExB,EAAqB9oE,UAAUwyE,OAAS,SAASlJ,EAAOlzC,EAAI4B,EAAQn2B,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMsV,GAEnGtyC,EAAOj8B,MAAM8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAM,SAASr7C,EAAQrI,EAAUsiB,GAC3E,MAAO01C,GAAMmJ,UAAUr8C,EAAIzc,EAAQrI,EAAUsiB,IAC1C02C,IAGPxB,EAAqB9oE,UAAU0yE,qBAAuB,SAAS7wE,EAAKsB,EAAKuQ,EAAKyB,EAAWvZ,GACrF,MAAOyE,MAAKioB,QAAQ,GAAGoqD,qBAAqB7wE,EAAKsB,EAAKuQ,EAAKyB,EAAWvZ,IAG1EktE,EAAqB9oE,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK9X,GACrE,MAAOyE,MAAKioB,QAAQ,GAAGmgB,gBAAgB5mC,EAAKsB,EAAKuQ,EAAK9X,IAiB1Di1E,EAAa7wE,UAAUyyE,UAAY,SAASryE,EAAOuZ,EAAQrI,EAAUsiB,GAIjE,IAHkB,MAAdvzB,KAAKuzB,OAA0B,GAATxzB,KAC1BC,KAAKuzB,MAAQA,GAETvzB,KAAK2wE,QAAQ5wE,GACjB,KAAM,+BAAiCA,CAavC,IAXAC,KAAK2wE,QAAQ5wE,IAAS,EACtBC,KAAKywE,cAELzwE,KAAKiR,SAASlR,GAASkR,EAEnBqI,IACHtZ,KAAK4wE,SAAS7wE,GAASuZ,EACvBtZ,KAAK0wE,eAIF1wE,KAAKywE,aAAezwE,KAAKkxC,MAAO,CACnC,GAAIlxC,KAAK0wE,YAAc,EAAG,CAEtB,IAAK,GADDxhD,GAAU,GACL6G,EAAK,EAAGA,EAAK/1B,KAAKkxC,QAASnb,EAAI,CACvC,GAAI38B,GAAI4G,KAAK4wE,SAAS76C,EAClB38B,KACI81B,EAAQl1B,OAAS,IACxBk1B,GAAW,MACRA,GAAW91B,GAGhB,MAAO4G,MAAKzE,SAAS2zB,EAAS,KAAMlvB,KAAKuzB,OAEzCvzB,KAAKzE,SAAS,KAAMyE,KAAK23B,OAAOy4C,MAAMpwE,KAAKiR,SAAUjR,KAAKioB,SAAUjoB,KAAKuzB,SAKlFk1C,EAAqB9oE,UAAU0tE,eAAiB,SAAS9xE,GACrD,IAAK,GAAIw6B,GAAK,EAAGA,EAAK/1B,KAAKioB,QAAQjuB,SAAU+7B,EAAI,CAC7C,GAAI38B,GAAI4G,KAAKioB,QAAQ8N,EACjB38B,GAAEi0E,gBACFj0E,EAAEi0E,eAAe9xE,KAI7BktE,EAAqB9oE,UAAUuxE,cAAgB,SAAS50D,GACpD,MAAO,GAAKA,EAAQ3e,IAAM,KAAO2e,EAAQxc,KA8DtB,mBAAZ5F,KACPA,EAAOJ,SACH2uE,qBAAsBA,M9Bs1Z3Bx+D,UAAU,KAAKqoE,IAAI,SAAS94E,EAAQU,EAAOJ,G+Bpqa9C,YAyBA,SAASy4E,GAAc56C,EAAQo6C,EAAUS,GACrC,GAIIC,GAJAC,EAAa,GAAI10E,QAAO,8BACxB20E,EAAU,yBACVC,EAAa,4BAIbH,GADA96C,EAAO3gB,KACK,GAAID,GAAc4gB,EAAO3gB,MACZ,UAApB2gB,EAAOk7C,UACA,GAAIlf,GAAgBh8B,EAAOwR,KAE3B,GAAIlyB,GAAa0gB,EAAOwR,KAAM3vB,YAAame,EAAOne,cAElEi5D,EAAUh3E,MAAM,EAAG,OAAOsP,SAASrP,MAAM,SAASmC,EAAQywB,GACtD,IAAKzwB,EAMD,MALK20E,KACD76C,EAAOne,aAAc,EACrB+4D,EAAc56C,EAAQo6C,GAAU,IAG7BA,EAASp6C,EAAQ,sBAG5B,IAAI/1B,GAAK,GAAI1F,YAAW2B,GACpBoN,EAAK,GAAI0L,aAAY9Y,EAAQ,EAAG,GAChC1B,EAAQ8O,EAAG,EACf,IAAI9O,GAASgP,GAAiBhP,GAASiP,EAAe,CAClDusB,EAAOsL,UAAY,KACnB,IAAI6vC,GAAqB,GAAI90E,QAAO,yCAChC+yC,EAAQ+hC,EAAmB/pE,KAAK4uB,EAAOwR,KAAOxR,EAAO3gB,KAAKla,KAK9D,OAJIi0C,KACApZ,EAAO76B,KAAOi0C,EAAM,IAGjBghC,EAASp6C,EAAQ,MACrB,GAAIx7B,GAASmB,EAEhB,MADAq6B,GAAOsL,UAAY,MACZ8uC,EAASp6C,EAAQ,KACrB,IAAa,IAAT/1B,EAAG,IAAqB,KAATA,EAAG,GAAW,CACpC,GAAI7F,GAAMC,EAAO6B,GACbxD,EAAQ,GAAI6B,YAAWH,EAE3B,IADAI,EAAQ1B,EAAQJ,EAAO,GACnB8B,GAASC,EAAW,CACpBu7B,EAAOsL,UAAY,KACnB,IAAI6vC,GAAqB,GAAI90E,QAAO,sBAChC+yC,EAAQ+hC,EAAmB/pE,KAAK4uB,EAAOwR,KAAOxR,EAAO3gB,KAAKla,KAK9D,OAJIi0C,KACApZ,EAAO76B,KAAOi0C,EAAM,IAGjBghC,EAASp6C,EAAQ,MACrB,GAAIx7B,GAAS42E,EAEhB,MADAp7C,GAAOsL,UAAY,cACZ8uC,EAASp6C,EAAQ,KACrB,IAAa,YAATx7B,EAAqB,CAC5Bw7B,EAAOsL,UAAY,QACnBtL,EAAO20C,QAAU,KACjB,IAAIwG,GAAqB,GAAI90E,QAAO,4BAChC+yC,EAAQ+hC,EAAmB/pE,KAAK4uB,EAAOwR,KAAOxR,EAAO3gB,KAAKla,KAK9D,OAJIi0C,KACApZ,EAAO76B,KAAOi0C,EAAM,IAGjBghC,EAASp6C,EAAQ,MAGzB,MADCnoB,SAAQC,IAAI,WAAatT,EAAME,SAAS,KAClC01E,EAASp6C,EAAQ,sBAG3B,GAAI05B,GAAO90D,OAAOC,aAAaw2E,MAAM,KAAMpxE,GACvC6qE,EAAQpb,EAAK/qD,MAAM,KAEvB,IAAImmE,EAAMzyE,OAAS,GAAK44E,EAAW7rE,KAAK0lE,EAAM,IAAK,CAC/C90C,EAAOsL,UAAY,WACnBtL,EAAO20C,QAAU,KACjB,IAAIwG,GAAqB,GAAI90E,QAAO,sBAChC+yC,EAAQ+hC,EAAmB/pE,KAAK4uB,EAAOwR,KAAOxR,EAAO3gB,KAAKla,KAI9D,OAHIi0C,KAAUpZ,EAAO76B,OACjB66B,EAAO76B,KAAOi0C,EAAM,IAEjBghC,EAASp6C,EAAQ,MAG5B,IAAK,GAAIg1C,GAAK,EAAGA,EAAKF,EAAMzyE,SAAU2yE,EAAI,CACtC,GAAIvmE,GAAOqmE,EAAME,GAAI5uE,QAAQ,KAAM,GACnC,IAAmB,GAAfqI,EAAKpM,QAEsB,GAA3BoM,EAAKpJ,QAAQ,WAAjB,CAEA,GAA6B,GAAzBoJ,EAAKpJ,QAAQ,SAAe,CAG5B,IAAK,GAFDi2E,GAAY,MACZ5sE,EAAOD,EAAKE,MAAM,MACbuC,EAAK,EAAGA,EAAKxC,EAAKrM,SAAU6O,EAAI,CACrC,GAAIC,GAAI6pE,EAAU5pE,KAAK1C,EAAKwC,GACxBC,KACY,QAARA,EAAE,IAAwB,YAARA,EAAE,GACpBmqE,EAAY,MACG,QAARnqE,EAAE,KACT6uB,EAAO76B,KAAOgM,EAAE,KAM5B,MADAoqE,GAAkBv7C,EAAQs7C,GACnBlB,EAASp6C,EAAQ,MAG5B,GAAiC,GAA7BvxB,EAAKpJ,QAAQ,aAEb,MADAk2E,GAAkBv7C,EAAQ,OACnBo6C,EAASp6C,EAAQ,KAG5B,IAAoC,GAAhCvxB,EAAKpJ,QAAQ,gBAEb,MADAk2E,GAAkBv7C,EAAQ,OACnBo6C,EAASp6C,EAAQ,KAG5B,IAAI+6C,EAAW3rE,KAAKX,GAEhB,MADA8sE,GAAkBv7C,EAAQ,MACnBo6C,EAASp6C,EAAQ,KAG5B,QAGJ,MAAOo6C,GAASp6C,EAAQ,wBAE5B97B,QAAS,OAGjB,QAASq3E,GAAkBv7C,EAAQs7C,GAC/Bt7C,EAAOsL,UAAY,UACnB,IAAI6vC,GAAqB,GAAI90E,QAAO,4BAChC+yC,EAAQ+hC,EAAmB/pE,KAAK4uB,EAAOwR,KAAOxR,EAAO3gB,KAAKla,KAC1Di0C,KACKpZ,EAAO76B,OACR66B,EAAO76B,KAAOi0C,EAAM,KACnBkiC,GAAaliC,EAAM,KACpBkiC,EAAYliC,EAAM,KAG1BpZ,EAAO20C,QAAU2G,GAAa,MApKlC,GAAwB,mBAAbz5E,GACP,GAAI2E,GAAM3E,EAAQ,SACdyd,EAAe9Y,EAAI8Y,aACnBF,EAAgB5Y,EAAI4Y,cACpBtc,EAAU0D,EAAI1D,QAEdsS,EAAMvT,EAAQ,YACd2R,EAAgB4B,EAAI5B,cACpBC,EAAgB2B,EAAI3B,cAEpBzM,EAAWnF,EAAQ,cACnBwC,EAAS2C,EAAS3C,OAElBU,EAAMlD,EAAQ,SACd4C,EAAYM,EAAIN,UAChBkB,EAAYZ,EAAIY,UAEhB61E,EAAM35E,EAAQ,WACdu5E,EAAcI,EAAIJ,YAElBpf,EAAkBn6D,EAAQ,YAAYm6D,eAmJvB,oBAAZz5D,KACPA,EAAOJ,SACHy4E,cAAeA,M/B4qapBa,QAAQ,EAAExiC,WAAW,EAAEhsC,QAAQ,EAAEyuE,WAAW,GAAGxuE,aAAa,GAAGyuE,UAAU,KAAKC,IAAI,SAAS/5E,EAAQU,EAAOJ,GgC91a7G,YAKA,SAASkgE,GAAMtmB,GACX,GAAI7iB,GAAO7wB,IAEX6wB,GAAKzsB,MAAQsvC,EAAQtvC,MACrBysB,EAAKlzB,IAAM+1C,EAAQ/1C,IACnBkzB,EAAK/wB,IAAM4zC,EAAQ5zC,IACnB+wB,EAAKrT,MAAQk2B,EAAQl2B,MACrBqT,EAAK/pB,MAAQ4sC,EAAQ5sC,MAErB41C,OAAO4G,KAAKzyB,GAAMxpB,IAAI,SAAA+G,GACAjM,SAAd0uB,EAAKziB,IACLoB,QAAQC,IAAI,yBAA2BrB,EAAM,cAOzD,QAAS6rD,GAAkBpd,EAAQrgC,GAC/B,GAAIg3D,GAASh3D,EAAKgH,UAAUgwD,MAEvBA,GAEQA,YAAkB/9B,QAC3BjmC,QAAQC,IAAI,0CAFZD,QAAQC,IAAI,+CAMhB+jE,EAAOnsE,IAAI,SAAAlO,GACP,GAAIs6E,IAAWt6E,EAAE2G,IAAM3G,EAAEiL,OAASjL,EAAE87B,OAChCoN,EAAY7lB,EAAKgf,SAAShe,MAC1Bk2D,EAAe72B,EAAO6R,SAE1B7R,GAAO4R,YAAct1D,EAAE2N,MACvB+1C,EAAO8R,YACP9R,EAAO+R,QAAQvsB,EAAWoxC,EAASt6E,EAAEmB,QAGrCuiD,EAAO6R,UAAYv1D,EAAEqkB,MACrBq/B,EAAOgS,OAAO,EAAExsB,EAAWoxC,EAASt6E,EAAEmB,QACtCuiD,EAAOmD,SACPnD,EAAO6R,UAAYglB,IhCqza3Bh3B,OAAO8S,eAAe11D,EAAS,cAC3BsK,OAAO,IAEXtK,EgCp2aSkgE,MAAAA,EhCq2aTlgE,EgCr2agBmgE,kBAAAA,EAmBhBD,EAAMr6D,UAAU+X,YAAcsiD,OhCi4axB2Z,IAAI,SAASn6E,EAAQU,EAAOJ,GiC/4alC,YAaA,SAAS85E,GAAS16E,GACd,MAAO26E,GAAY36E,EAAI26E,EAAY75E,QAAU0D,KAAKo2E,IAAI,GAAK56E,EAAI26E,EAAY75E,OAAQ,GAIvF,QAAS+5E,GAAMxgD,EAAO51B,EAAKmC,GACvBE,KAAKuzB,MAAQA,EACbvzB,KAAKg0E,IAAM,EACXh0E,KAAKkO,IAAM,EACXlO,KAAKi0E,UAAW,EAChBj0E,KAAKrC,IAAMA,EAAKqC,KAAKF,IAAMA,EAC3BE,KAAKiR,YAGT,QAASijE,GAAc36E,EAAGmB,GACtB,MAAInB,GAAEoE,IAAMjD,EAAEiD,IACH,GACApE,EAAEoE,IAAMjD,EAAEiD,IACV,EACApE,EAAEuG,IAAMpF,EAAEoF,IACV,GACApF,EAAEoF,IAAMvG,EAAEuG,IACV,EAEA,EAkDf,QAAS6oE,GAAW13D,EAAUkjE,GAE1B,IADA,GAAIC,GAAK,EACFR,EAASQ,EAAK,GAAKD,KACpBC,CAON,KAAK,GALD7gD,GAAQqgD,EAASQ,GAEjBC,KACAC,EAAS,MACTC,EAAS,KACJzgE,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,EACjB,IAAIpa,EAAEiO,QAAUjO,EAAEiO,OAAO3N,OAAS,EAE9B,MAAOiX,EAGX,IAAIujE,GAAU96E,EAAEiE,IAAM41B,EAAO,EACzBkhD,EAAU/6E,EAAEoG,IAAMyzB,EAAO,CAC7B+gD,GAAS52E,KAAKoC,IAAIw0E,EAAQG,GAC1BF,EAAS72E,KAAKC,IAAI42E,EAAQC,EAC1B,KAAK,GAAI95E,GAAI85E,EAAaC,GAAL/5E,IAAeA,EAAG,CACnC,GAAIg6E,GAAKL,EAAQ35E,EACZg6E,KACDA,EAAK,GAAIX,GAAMxgD,EAAO74B,EAAI64B,GAAQ74B,EAAI,GAAK64B,EAAQ,GACnD8gD,EAAQ35E,GAAKg6E,GAEjBA,EAAGp4D,QAAQ5iB,IAKnB,IAAK,GADDi7E,MACKj6E,EAAI65E,EAAaD,GAAL55E,IAAeA,EAAG,CACnC,GAAIg6E,GAAKL,EAAQ35E,EACjB,IAAIg6E,EAAI,CACJ,GAAIh7E,GAAI,GAAIkM,EACZlM,GAAE6J,QAAU0N,EAAS,GAAG1N,QACxB7J,EAAEiE,IAAOjD,EAAI64B,EAAS,EACtB75B,EAAEoG,KAAOpF,EAAI,GAAK64B,EAClB75B,EAAEiN,MAAQ+tE,EAAG/tE,QACbjN,EAAE4K,KAAO,UACTqwE,EAAgBz3E,KAAKxD,IAIfuV,KAAKC,KACnB,OAAOylE,GAQX,QAASC,GAAQ9xE,GAEb9C,KAAK60E,KAAO/xE,EACZ9C,KAAK80E,UACL90E,KAAK+0E,YAAc,EA4HvB,QAASC,GAAmBppB,EAAQC,EAAUhoD,GAK1C,IAAK,GAJDkoD,GAAM9e,EAAWppC,GACjBE,KACAI,KACAy3B,EAAS,EACJwR,EAAK,EAAGA,EAAK2e,EAAI/xD,SAAUozC,EAAI,CACpC,GAAI6e,GAAKF,EAAI3e,EACb,IAAa,KAAT6e,EAAGxb,GACH1sC,EAAI7G,KAAK0uD,EAAOp9C,OAAOotB,EAAQqwB,EAAG/9C,MAClC/J,EAAMjH,KAAK2uD,EAASr9C,OAAOotB,EAAQqwB,EAAG/9C,MACtC0tB,GAAUqwB,EAAG/9C,QACV,IAAa,KAAT+9C,EAAGxb,GACV,IAAK,GAAIsJ,GAAK,EAAGA,EAAKkS,EAAG/9C,MAAO6rC,EAC5Bh2C,EAAI7G,KAAK,KACTiH,EAAMjH,KAAK,SAEC,KAAT+uD,EAAGxb,GACV7U,GAAUqwB,EAAG/9C,IACG,KAAT+9C,EAAGxb,GACV7U,GAAUqwB,EAAG/9C,IAEbsB,QAAQC,IAAI,gBAAkBw8C,EAAGxb,IAGzC,GAAIwkC,IAAgBlxE,IAAKA,EAAIy0C,KAAK,IAAKr0C,MAAOA,EAAMq0C,KAAK,IACzD,OAAOy8B,GAaX,QAAS5yB,GAAUtF,EAAiBp/C,EAAKmC,GACrC,GAAIsiD,KACJ,IAAIrF,EAAiB,CACjB,GAAIiL,GAAgC,EAAtBjL,EAAgBx2C,MAC1B0hD,EAA4B,EAApBlL,EAAgBt2C,GAC5B,IAAe3G,GAAXkoD,GAAkBC,GAAStqD,EAAK,CAIhC,IAAK,GAHDuqD,GAAQxqD,KAAKoC,IAAInC,EAAKqqD,GACtBG,EAAQzqD,KAAKC,IAAImC,EAAKmoD,GAEjBxuD,EAAI,EAAOyuD,EAAQvqD,EAAZlE,EAAiBA,IAC7B2oD,EAAOllD,KAAK,IAChBklD,GAAOllD,KAAK6/C,EAAgBh5C,IAAIyK,OAAO05C,EAAQF,EAASG,EAAQD,EAAQ,GACxE,KAAK,GAAIzuD,GAAI,EAAOqG,EAAMqoD,EAAV1uD,EAAiBA,IAC7B2oD,EAAOllD,KAAK,MAGxB,MAAOklD,GAAO5J,KAAK,IAavB,QAASowB,GAAgB33D,EAAUikE,EAAetpD,GAO9C,IAAK,GAND2oD,GAAS,KACTD,EAAS,KAETa,KAGKrhE,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,EACjB,IAAIpa,EAAEiO,QAAUjO,EAAEiO,OAAO3N,OAAS,EAE9B,MAAOiX,EAUX,KAAK,GARDgkE,GAAeD,EAAmBt7E,EAAEqK,IAAKrK,EAAEyK,MAAOzK,EAAEmK,OACpDE,EAAMkxE,EAAalxE,IACnBI,EAAQ8wE,EAAa9wE,MACrB+rC,EAASx2C,EAAEmN,YACXuuE,EAAgB17E,EAAEiE,KAAO,EACzB03E,EAAgB37E,EAAEoG,KAAO,EACzB26D,EAAM,EAED//D,EAAI06E,EAAoBC,GAAL36E,IAAsBA,EAAG,CACjD,GAAIg6E,GAAKS,EAAQz6E,EACZg6E,KACDA,EAAK,GAAIE,GAAQl6E,GACjBy6E,EAAQz6E,GAAKg6E,EAEjB,IAAIxgB,GAAOnwD,EAAIuxE,OAAO7a,GAClBsK,EAAO5gE,EAAMiT,WAAWqjD,GAAO,EACnCia,GAAGa,WAAWrhB,EAAM6Q,EAAM70B,GAC1BuqB,IAMA8Z,EAHCA,EAGQ72E,KAAKC,IAAI42E,EAAQa,GAFjBA,EAMTd,EAHCA,EAGQ52E,KAAKoC,IAAIw0E,EAAQe,GAFjBA,EASjB,IAAK,GAHDjzB,GAASC,EAAU6yB,EAAeX,EAAQD,GAC1CkB,KACA/a,EAAM,EACD//D,EAAI65E,EAAaD,GAAL55E,IAAeA,EAAG,CACnC,GAAIg6E,GAAKS,EAAQz6E,EACjB,IAAIg6E,EAAI,CACJ,GAAIh7E,GAAI,GAAIkM,EAQZ,IAPAlM,EAAE6J,QAAU0N,EAAS,GAAG1N,QACxB7J,EAAEiE,IAAM+2E,EAAG5xE,MACXpJ,EAAEoG,IAAMpG,EAAEiE,IACVjE,EAAEgO,SACFhO,EAAEgO,MAAQhO,EAAEgO,MAAMo7C,OAAO4xB,EAAGe,YAC5B/7E,EAAE4K,KAAO,gBACT5K,EAAEojE,eAAgB,EACd1a,EAAQ,CACR,GAAI+iB,GAAU/iB,EAAOkzB,OAAO7a,GACxBib,EAAY,OAASvQ,CACzBzrE,GAAEgO,MAAM88C,QAAQkxB,EAGhB,KAAK,GAFDC,GAAgBjB,EAAGiB,cAAcxQ,EAAS,IAErC1rE,EAAI,EAAGA,EAAIk8E,EAAc37E,OAAQP,IAAK,CAC3C,GAAIy6D,GAAOyhB,EAAcl8E,GAAGy6D,KACxBvtD,EAAQgvE,EAAcl8E,GAAGkN,MACzBivE,EAAQ9vE,EAAYpM,EACxBk8E,GAAMjvE,MAAQA,GAGVgvE,EAAc37E,OAAS,GAAKk6D,GAAQiR,KACpCyQ,EAAM5uE,QAAU4kB,EAAWsoC,IAE/BshB,EAAat4E,KAAK04E,QAItBJ,GAAat4E,KAAKxD,GAG1B+gE,IAEJ,MAAO+a,GAjaX,GAAwB,mBAAbh8E,GACP,GAAIgM,GAAMhM,EAAQ,SACdoM,EAAaJ,EAAII,WAEjBqnC,EAAazzC,EAAQ,WAAWyzC,WAEhCnnC,EAActM,EAAQ,WAAWsM,WAGzC,IAAI+tE,IAAe,EAAG,EAAG,EA8BzBE,GAAMp0E,UAAUgH,MAAQ,WACpB,GAAgB,GAAZ3G,KAAKkO,IACL,MAAO,EACJ,IAAIlO,KAAKi0E,SACZ,MAAOj0E,MAAKg0E,IAAMh0E,KAAKkO,GAEvB,IAAI+C,GAAWjR,KAAKiR,QACpBA,GAASjQ,KAAKkzE,EAKd,KAAK,GAHD2B,GAAU,MACVC,EAAI,EAAGC,EAAI,EAENjiE,EAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,GACbkiE,EAAOt4E,KAAKoC,IAAIpG,EAAEiE,IAAKqC,KAAKrC,KAC5Bs4E,EAAOv4E,KAAKC,IAAIjE,EAAEoG,IAAKE,KAAKF,IAChCi2E,IAAQE,EAAOD,EAAO,EAElBA,EAAOH,GACPC,GAAOG,EAAOD,EAAO,EACrBH,EAAUI,GAENA,EAAOJ,IACPC,GAAQG,EAAOJ,EACfA,EAAUI,GAKtB,MAAIH,GAAM,EACE,EAAMC,EAAOD,EAEd,GAInB/B,EAAMp0E,UAAU2c,QAAU,SAAS5iB,GACfyI,SAAZzI,EAAEiN,QACF3G,KAAKg0E,KAAOt6E,EAAEiN,MACd3G,KAAKi0E,UAAW,KAGlBj0E,KAAKkO,IACPlO,KAAKiR,SAAS/T,KAAKxD,IAwEvBk7E,EAAQj1E,UAAU41E,WAAa,SAASrhB,EAAM6Q,EAAM70B,GAChD,GAAKlwC,KAAK80E,OAAO5gB,GAQV,CACH,GAAIgiB,GAAkBl2E,KAAK80E,OAAO5gB,EAClCgiB,GAAgBhoE,MAChBgoE,EAAgBC,WAAapR,EAC7BmR,EAAgBE,UAAUlmC,SAZN,CACpB,GAAImmC,IAAqBC,IAAK,EAAGrqD,IAAK,EACtCoqD,GAAkBnmC,KAClBlwC,KAAK80E,OAAO5gB,IACRhmD,IAAK,EACLioE,UAAWpR,EACXqR,UAAWC,GAQnBr2E,KAAK+0E,eAITH,EAAQj1E,UAAU42E,WAAa,WAAY,MAAOv2E,MAAK+0E,aAGvDH,EAAQj1E,UAAUmD,IAAM,WAAY,MAAO9C,MAAK60E,MAIhDD,EAAQj1E,UAAU81E,SAAW,WACzB,GAAInZ,MACAia,EAAav2E,KAAK+0E,YAClByB,EAAgB,SAAWD,EAAWl6E,UAC1CigE,GAAKp/D,KAAKs5E,EACV,KAAK,GAAItiB,KAAQl0D,MAAK80E,OAAQ,CAC1B,GAAIoB,GAAkBl2E,KAAK80E,OAAO5gB,GAC9BuiB,EAAUP,EAAgBhoE,IAC1BwoE,EAA4B,IAAVD,EAAgBF,EAClCI,EAAgBT,EAAgBE,UAAU,KAC1CQ,EAAiBV,EAAgBE,UAAU,KAC3CS,EAAWX,EAAgBC,UAAUM,EAErCK,GAAkB5iB,EAAM,IAAKuiB,EAAS,KAAMC,EAAeK,QAAQ,GAAI,MACrDJ,EAAe,OAAQC,EAAgB,aAAcC,EAASE,QAAQ,GAAI,IAChGza,GAAKp/D,KAAK45E,EAAet+B,KAAK,KAElC,MAAO8jB,IAyCXsY,EAAQj1E,UAAUg2E,cAAgB,SAASn4E,EAAKsX,GAC5C,GAAI6gE,MACAY,EAAav2E,KAAK+0E,YAClBiC,EAAWliE,EAAYyhE,CAC3B,KAAK,GAAIriB,KAAQl0D,MAAK80E,OAAQ,CAC1B,GAAImC,GAAYj3E,KAAK80E,OAAO5gB,GAAMhmD,GAClC,MAAgB8oE,EAAZC,GAAwB/iB,GAAQ12D,GAApC,CAEA,GAAI05E,IAAiBhjB,KAAMA,EAAMvtD,MAAO4vE,EACxCZ,GAAcz4E,KAAKg6E,GACnBX,GAAcU,GAGlB,MADAtB,GAAcz4E,MAAMg3D,KAAM12D,EAAKmJ,MAAO4vE,IAC/BZ,GAyKY,mBAAZz7E,KACPA,EAAOJ,SACH6uE,WAAYA,EACZC,gBAAiBA,MjCs5atB/3B,UAAU,EAAE9mC,QAAQ,GAAGE,UAAU,KAAKktE,IAAI,SAAS39E,EAAQU,EAAOJ,GkC/zbrE,YlC20bA,SAASs9E,GAAmB1nB,GAAO,GAAIja,MAAMwa,QAAQP,GAAM,CAAE,IAAK,GAAIj2D,GAAI,EAAG49E,EAAO5hC,MAAMia,EAAI11D,QAASP,EAAIi2D,EAAI11D,OAAQP,IAAO49E,EAAK59E,GAAKi2D,EAAIj2D,EAAM,OAAO49E,GAAe,MAAO5hC,OAAM6hC,KAAK5nB,GkC7zb1L,QAAS6nB,GAAiBr+E,EAAG4P,GACzB,GAAIrP,GAAImN,WAAW1N,EAAE6E,QAAQ,KAAM,IACnC,OAAU,MAAN+K,GAAmB,MAANA,EACD,IAAJrP,EAAU,EACN,KAALqP,GAAkB,MAANA,EACP,IAAJrP,EAAa,EAEZ,EAAFA,EAnBf,GAAwB,mBAAbD,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElB/c,EAAM3E,EAAQ,SACdyd,EAAe9Y,EAAI8Y,aAEnBugE,EAAch+E,EAAQ,UAAUg+E,WAGxC,IAAIC,GAAiB,0FAarBv8D,GAAQvb,UAAUmiB,OAAS,SAASD,EAAG61D,EAAgBj2E,GACnD,GAAIK,GAAQ9B,IACZyB,GAAOA,KACP,IAAIk2E,GAAYl2E,EAAK05B,SAAWn7B,KAAKwrB,2BAEjC1iB,EAAI2uE,EAAe1uE,KAAK8Y,EAE5B,IAAI/Y,EAAG,CACH,GAAgBvC,GAAOE,EAAnBjF,EAAMsH,EAAE,EACZ,IAAIA,EAAE,GACFvC,EAAQgxE,EAAiBzuE,EAAE,GAAKA,EAAE,IAClCrC,EAAM8wE,EAAiBzuE,EAAE,GAAIA,EAAE,QAC5B,CACH,GAAI0U,GAAQxd,KAAKosB,QAAUpsB,KAAKmsB,UAAY,CAC5C5lB,GAASgxE,EAAiBzuE,EAAE,GAAIA,EAAE,IAAO0U,EAAM,EAAI,EACnD/W,EAAMF,EAAQiX,EAAQ,EAE1Bxd,KAAKw5B,YAAYh4B,EAAK+E,EAAOE,EAAKixE,OAC/B,CACH,IAAK71D,GAAiB,GAAZA,EAAE7nB,OACR,OAAO,CAGX,IAAI49E,GAAc,EACdC,GAAa,EAEbC,EAAiB,SAASC,EAAOp+D,GAEjC,KADEi+D,EACEj+D,EACA,MAAO+9D,GAAe/9D,EAGrBo+D,KAAOA,KAGZ,KAAK,GAFDp6E,GAAM,IAAWmC,EAAM,KACvBk4E,EAAO,KACFlkE,EAAK,EAAGA,EAAKikE,EAAM/9E,SAAU8Z,EAAI,CACtC,GAAIpa,GAAIq+E,EAAMjkE,EAEF,OAARkkE,IACAA,EAAOt+E,EAAE6J,SAEb5F,EAAMD,KAAKC,IAAIA,EAAKjE,EAAEiE,KACtBmC,EAAMpC,KAAKoC,IAAIA,EAAKpG,EAAEoG,KAG1B,GAAKk4E,EAGE,CACHH,GAAa,EACb/1E,EAAM0kC,gBAAgBwxC,EAAMr6E,EAAKmC,EAEjC,IACIq7B,GAAUz9B,KAAKoC,IAAI63E,EAAY,IAAO73E,EAAMnC,EAAM,GAAI,EAC1DmE,GAAM03B,YAAYw+C,EAAMr6E,EAAMw9B,EAASr7B,EAAMq7B,EAASu8C,OARtD,IAAmB,GAAfE,IAAqBC,EACrB,MAAOH,GAAe,iBAAmB71D,EAAI,MAWrDo2D,EAAe,SAASz7D,EAAM07D,GAC9BA,EAAK5hE,OAAOuL,EAAG,SAAShkB,EAAQyb,GAC5B,GAAc,MAAVzb,GAAkBA,EAAO7D,OAAS,EAClC,MAAOwiB,GAAK4G,cAActB,OAAOD,EAAGi2D,EAEpC,IAAIv7D,GAAM1e,EAAO,GAAGyI,MAAM,KAAK,EAC/B,OAAOkW,GAAK4G,cAActB,OAAOvF,EAAKu7D,KAKlD,IAAI93E,KAAKm4E,eAEL,MADAP,GAAc,EACP53E,KAAKo4E,YAAYt2E,EAAMq2E,eAAgBt2D,EAAGi2D,EASrD,KAAK,GALCO,MAAAv1B,OAAAs0B,EACEp3E,KAAKooB,6BADPgvD,EAECp3E,KAAK+iB,QAGHla,EAAK,EAAGA,EAAKwvE,EAAcr+E,SAAU6O,GAC1C,SAAU2T,GACN,GAAI1a,EAAMuhB,uBAAuB7G,EAAK4G,cAAe,UACjD,GAAI5G,EAAKgH,UAAU80D,QAEf,KADEV,EACEp7D,EAAK07D,KACLD,EAAaz7D,EAAMA,EAAK07D,UACrB,CACH,GAAIK,GAAK,GAAIthE,GACTuF,EAAKgH,UAAU80D,SACd9+D,YAAagD,EAAKgH,UAAUhK,YAC5BI,SAAU4C,EAAKgH,UAAU5J,WAG1B4+D,EAAM,GAAIvhE,GACVuF,EAAKgH,UAAUi1D,UAAaj8D,EAAKgH,UAAU80D,QAAU,KACpD9+D,YAAagD,EAAKgH,UAAUhK,YAC5BI,SAAU4C,EAAKgH,UAAU5J,UAG9B49D,GAAYe,EAAIC,EAAK,SAASN,GAC1B17D,EAAK07D,KAAOA,EACZD,EAAaz7D,EAAM07D,WAIzBN,EACFp7D,EAAK4G,cAActB,OAAOD,EAAGi2D,OAE1Bt7D,GAAKgH,UAAUk1D,oBACpBd,EACF91E,EAAMs2E,YAAY57D,EAAKgH,UAAW3B,EAAGi2D,KAE1CO,EAAcxvE,MAK7BqS,EAAQvb,UAAUy4E,YAAc,SAASzgD,EAAQ9V,EAAGi2D,GAEhDngD,EAAO1mB,SAAS,MAAO4c,MAAOhM,EAAGvd,KAAM,cAAe,SAASyzE,GACtDA,IAAOA,KAKZ,KAAK,GADDY,MACK7kE,EAAK,EAAGA,EAAKikE,EAAM/9E,SAAU8Z,EAAI,CACtC,GAAIpa,GAAIq+E,EAAMjkE,EAEVpa,GAAEgN,MAAM+vC,eAAiB50B,EAAE40B,eAI/BkiC,EAAOz7E,KAAKxD,GAGhB,MAAOo+E,GAAea,KACvB,MlCu0bJ/zE,QAAQ,EAAE8hB,aAAa,EAAEkyD,SAAS,KAAKC,IAAI,SAASr/E,EAAQU,EAAOJ,GmCz+btE,YAyBA,SAASg/E,GAAiBvlD,EAAO51B,GAM7B,QAASyK,GAAG7N,GACR,MAAOy3C,GAAMz3C,EAAIy3C,EAAMh4C,QAAU0D,KAAKo2E,IAAI,GAAKv5E,EAAIy3C,EAAMh4C,OAAQ,GALhE2D,IACDA,EAAMo7E,EAOV,KADA,GAAIjF,GAAM9hC,EAAMh4C,OACTu5B,EAAQnrB,EAAG0rE,GAAOn2E,KACnBm2E,CAEN,OAAO1rE,GAAG0rE,GAGd,QAAS72B,GAAYzgC,EAAMzY,GACvB,GAAI22D,GAAKl+C,EAAKgf,SAASshB,WAAW,MAC9B9xB,EAASxO,EAAKvB,QAAQ+P,QAAUwB,OAAOqc,iBAAmB,EAC1Dke,EAAevqC,EAAKvB,QAAQkO,kBAAoB,GAChD6B,KACA+7B,GAAgB,EAEpB,IAAIC,GAA0B,EAApBxqC,EAAKgf,SAAShe,KACdupC,GAAe,GAArBC,IACAxqC,EAAKgf,SAAShe,MAAQwpC,EAAMD,EAGhC,IAAI9xB,GAAS,EACTlxB,IAAOA,EAAIA,MACXkxB,GAAU,GAGd,IAAIiyB,GAAejyB,CACfjK,KACAk8B,GAAgB,GAEpB1qC,EAAKgf,SAASvG,OAASiyB,EACvB1qC,EAAKgf,SAASpa,MAAM6T,OAAS,GAAKA,EAAS,KAC3CzY,EAAKgf,SAASpa,MAAM5D,MAAQwN,EAAU,GAAMg8B,EAAI,EAAK,KAAS,GAAKA,EAAM,KACzExqC,EAAK+X,aAAeU,EACpBzY,EAAK0a,eAGD1a,EAAKoe,aACL8/B,EAAGhU,UAAYlqC,EAAKoe,WACpB8/B,EAAG/T,SAAS,EAAG,EAAGK,EAAKxqC,EAAKgf,SAASvG,SAErCjK,GACA0vC,EAAGnnC,MAAM,EAAG,GAGhBmnC,EAAGpT,UAAU,IAAK,GAClB+O,EAAc75C,EAAMzY,EAAK22D,GACzBl+C,EAAKqoB,QAAUroB,EAAKvB,QAAQkR,UAC5B3P,EAAKioB,eAAerjB,MAAMua,KAAO,UAGrC,QAAS06B,GAAc75C,EAAMzY,EAAK22D,GAE9B,GAAInnC,GAAQ/W,EAAKvB,QAAQsY,MAAOylD,EAAax8D,EAAKvB,QAAQkR,UAAa,IAAKoH,EAAO,EAAG0lD,EAAWz8D,EAAKvB,QAAQmR,QAAW,IAAKmH,EAAQlK,EAAgB7M,EAAKvB,QAAQoO,cAE/J6vD,EAAaD,CACb5vD,GAAgB,GAAqB4vD,EAAhB5vD,IACrB6vD,EAAa7vD,EAOjB,KALA,GAAI8vD,GAAOL,EAAiBvlD,GACxBzwB,EAAMpF,KAAKoC,IAAI,GAAKk5E,EAAaG,EAAM,GAAKA,GAE5ClwD,EAASzM,EAAKvB,QAAQkR,UAEZ+sD,GAAPp2E,GACT43D,EAAGhU,UAAc5jD,EAAMq2E,EAAQ,GAAK,EAAK,QAAU,QACnDze,EAAGjM,YAAc,QACjBiM,EAAG/T,UAAU7jD,EAAMmmB,GAAUsK,EACxB,EACA4lD,EAAK5lD,EACL,GACLmnC,EAAGsI,YAAYlgE,EAAMmmB,GAAUsK,EACxB,EACA4lD,EAAK5lD,EACL,GAEPmnC,EAAGhU,UAAY,QACfgU,EAAGxL,SAAS5zC,EAAcxY,IAAQA,EAAMmmB,GAAUsK,EAAQ,IAG1DzwB,GAAOq2E,CAGL,IAAIp1E,GAAOA,EAAIA,IACjB,IAAK,GAAIxJ,GAAIy+E,EAAiBC,GAAL1+E,IAAiBA,EACtC,GAAIA,GAAKwJ,EAAIwC,OAAShM,GAAKwJ,EAAI0C,IAAK,CACtC,GAAIytD,GAAOnwD,EAAIA,IAAIyK,OAAOjU,EAAIwJ,EAAIwC,MAAO,GAAG2xC,cACxCpxC,EAAQ0V,EAAKvB,QAAQ2Q,WAAWsoC,EAOpC,IANKptD,IACKA,EAAQ,QAGlB4zD,EAAGhU,UAAY5/C,EAEXysB,GAAS,EAAG,CACA,GAAI86B,GAAIqM,EAAGtE,YAAYlC,GAAM12C,KAEzCk9C,GAAGxL,SAASgF,GAAO35D,EAAI0uB,GAAUsK,EAAmB,IAATA,EAAM86B,GAAU,QAE3DqM,GAAG/T,UAAUpsD,EAAI0uB,GAAUsK,EAAO,GAAIA,EAAO,KAOrD,QAAS6lD,GAAW58D,EAAMzY,GACtB,GAAIwvB,GAAQ/W,EAAKvB,QAAQsY,MAAOylD,EAAax8D,EAAKvB,QAAQkR,UAAa,IAAKoH,EAAO,EAAG0lD,EAAWz8D,EAAKvB,QAAQmR,QAAW,IAAKmH,EAAQlK,EAAgB7M,EAAKvB,QAAQoO,cAI/J6vD,GAF0B,EAApB18D,EAAKgf,SAAShe,MAEPy7D,EACb5vD,GAAgB,GAAqB4vD,EAAhB5vD,IACrB6vD,EAAa7vD,EAQjB,KANA,GAAI8vD,GAAOL,EAAiBvlD,GACxBzwB,EAAMpF,KAAKoC,IAAI,GAAKk5E,EAAaG,EAAM,GAAKA,GAE5ClwD,EAASzM,EAAKvB,QAAQkR,UAErBtK,EAAIygD,EAAcG,EAAQ,QAAUa,SAAU,QACrC4V,GAAPp2E,GACN+e,EAAE7F,YACEsmD,EACHG,EAAQ,OACR,MACCn7D,GAAIxE,EAAImmB,GAAQsK,EAChBke,EAAG,EACHj0B,MAAO27D,EAAK5lD,EACZ0B,OAAQ,EACRud,KAAQ1vC,EAAMq2E,EAAQ,GAAK,EAAK,QAAU,QAC1Cn5B,OAAQ,WAEVn+B,EAAE7F,YACEsmD,EACHG,EAAQ,OACRnnD,EAAcxY,IACbwE,GAAIxE,EAAImmB,GAAQsK,EAChBke,EAAG,GACHe,KAAM,QAASwN,OAAQ,UAEzBl9C,GAAOq2E,CAGR,IAAIp1E,GAAOA,EAAIA,IACd,IAAK,GAAIxJ,GAAIy+E,EAAiBC,GAAL1+E,IAAiBA,EACtC,GAAIA,GAAKwJ,EAAIwC,OAAShM,GAAKwJ,EAAI0C,IAAK,CACnC,GAAIytD,GAAOnwD,EAAIA,IAAIyK,OAAOjU,EAAIwJ,EAAIwC,MAAO,GAAG2xC,cACxCpxC,EAAQ0V,EAAKvB,QAAQ2Q,WAAWsoC,EAC/BptD,KACKA,EAAQ,QAGdysB,GAAS,EACT1R,EAAE7F,YACLsmD,EAAcG,EAAQ,OAAQvO,GAC1B5sD,GAAI,GAAI/M,EAAE0uB,GAAQsK,EAClBke,EAAG,GACMk0B,WAAY,SACrBnzB,KAAM1rC,KAEP+a,EAAE7F,YACLsmD,EAAcG,EAAQ,OAAQ,MAC1Bn7D,GAAI/M,EAAI0uB,GAAQsK,EAChBke,EAAG,GACHj0B,MAAO+V,EACP0B,OAAQ,GACFud,KAAM1rC,KAOvB,MAAO+a,GA5MX,GAAwB,mBAAbroB,GACP,GAAIqM,GAAQrM,EAAQ,WAChB8hB,EAAgBzV,EAAMyV,cACtBgnD,EAAgBz8D,EAAMy8D,cAEtBE,EAAOhpE,EAAQ,eACfipE,EAASD,EAAKC,OAIdrnD,GAHWonD,EAAKG,SACNH,EAAKE,QAEVlpE,EAAQ,iBACb8hB,EAAgBF,EAAGE,aAG3B,IAAIy9D,GAAW,IAGX/mC,GAAS,EAAE,EAAE,GAGbywB,EAAS,4BA2LU,oBAAZvoE,KACPA,EAAOJ,SACHmjD,YAAaA,EACboZ,cAAeA,EACf+iB,WAAYA,MnCq+bjBtyD,eAAe,GAAGu/C,cAAc,GAAGp8D,UAAU,KAAKovE,IAAI,SAAS7/E,EAAQU,EAAOJ,GoC1rcjF,YAEA,IAAuB,mBAAZN,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBwwC,EAAKlyD,EAAQ,mBACbw2B,EAAgB07B,EAAG17B,cACnBF,EAAkB47B,EAAG57B,gBAErBpB,EAAUl1B,EAAQ,aAElBqM,EAAQrM,EAAQ,WAChB61B,EAAcxpB,EAAMwpB,YAEpB1X,EAAOne,EAAQ,UACfg2B,EAAW7X,EAAK6X,QAGxBtU,GAAQvb,UAAU25E,WAAa,iBACpBx4C,cAAa,aAAe9gC,KAAK4oB,UAAY,mBAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,qBAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,mBAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,6BAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,2BAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,qBAE7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,kBAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,eAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,kBAE7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,4BAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,gCAC7CkY,cAAa,aAAe9gC,KAAK4oB,UAAY,oBAGxD1N,EAAQvb,UAAUshB,YAAc,WAC5BjhB,KAAKkhB,kBACLlhB,KAAKuhB,mBAGTrG,EAAQvb,UAAUuhB,gBAAkB,YAC3BlhB,KAAK4oB,WAAa5oB,KAAK41D,WAAa51D,KAAKu5E,gBAI9Cz4C,aAAa,aAAe9gC,KAAK4oB,UAAY,aAAe5oB,KAAKwB,IACjEs/B,aAAa,aAAe9gC,KAAK4oB,UAAY,eAAgC,EAAf5oB,KAAKmsB,UACnE2U,aAAa,aAAe9gC,KAAK4oB,UAAY,aAA4B,EAAb5oB,KAAKosB,QACjE0U,aAAa,aAAe9gC,KAAK4oB,UAAY,qBAAuB,GAAK5oB,KAAKsgB,cAC9EwgB,aAAa,aAAe9gC,KAAK4oB,UAAY,eAAiB5oB,KAAKsiB,UAC/DtiB,KAAKqpB,gBACTyX,aAAa,aAAe9gC,KAAK4oB,UAAY,uBAAyB5oB,KAAKqpB,iBAK/EnO,EAAQvb,UAAU4hB,gBAAkB,WAChC,GAAKvhB,KAAK4oB,YAAa5oB,KAAK41D,UAA5B,CAKA,IAAK,GADD4jB,MACKvgF,EAAI,EAAGA,EAAI+G,KAAK+iB,MAAM/oB,SAAUf,EAAG,CACxC,GAAI67B,GAAK90B,KAAK+iB,MAAM9pB,GAChBmP,EAAK0sB,EAAGtR,SACPpb,GAAGwtD,WACJ4jB,EAAkBt8E,MAAMy6B,OAAQ7C,EAAGtR,UAAWD,OAAQuR,EAAGvR,aAGjEud,aAAa,aAAe9gC,KAAK4oB,UAAY,YAAcmY,KAAKQ,UAAUi4C,EAK1E,KAAK,GAFDC,MACAC,KACK5gD,EAAK,EAAGA,EAAK94B,KAAK6qB,WAAW7wB,SAAU8+B,EAAI,CAChD,GAAIG,GAAMj5B,KAAK6qB,WAAWiO,GACtBC,GAAMj7B,IAAKm7B,EAAID,IAAIl7B,IAAKo7B,OAAQD,EAAIC,OACpCD,GAAIzf,cACJuf,EAAGvf,YAAcyf,EAAIzf,aACrByf,EAAI/L,UACJ6L,EAAG7L,QAAU+L,EAAI/L,SACrBusD,EAAe1gD,EAAGj7B,MAAO,EACzB47E,EAAex8E,KAAK67B,GAKxB,IAAK,GAAID,GAAK,EAAGA,EAAK94B,KAAK4qB,KAAK5wB,SAAU8+B,EAAI,CAC1C,GAAIC,GAAK/4B,KAAK4qB,KAAKkO,EACD,iBAAPC,KACPA,GAAMj7B,IAAKi7B,IACV0gD,EAAe1gD,EAAGj7B,MACnB47E,EAAex8E,KAAK67B,GAG5B+H,aAAa,aAAe9gC,KAAK4oB,UAAY,SAAWmY,KAAKQ,UAAUm4C,GAEvE54C,aAAa,aAAe9gC,KAAK4oB,UAAY,sBAAwB5oB,KAAK4lB,iBAC1Ekb,aAAa,aAAe9gC,KAAK4oB,UAAY,0BAA4B5oB,KAAKijB,oBAC9E6d,aAAa,aAAe9gC,KAAK4oB,UAAY,0BAA4B5oB,KAAKomB,oBAC9E0a,aAAa,aAAe9gC,KAAK4oB,UAAY,mBAAqB5oB,KAAKgmB,cAEvE8a,aAAa,aAAe9gC,KAAK4oB,UAAY,iBAAmB5oB,KAAK+pB,YACrE+W,aAAa,aAAe9gC,KAAK4oB,UAAY,sBAAwB5oB,KAAK8pB,iBAE1EgX,aAAa,aAAe9gC,KAAK4oB,UAAY,YAAc8F,EAAQirD,SAGvEz+D,EAAQvb,UAAUyxB,cAAgB,WAC9B,IAAIpxB,KAAK41D,UAAT,CAGA,GAAIgkB,GAAsB94C,aAAa,aAAe9gC,KAAK4oB,UAAY,WAMvE,IAJIgxD,EADAA,EAC0C,EAApBA,EAEA,KAEtBlrD,EAAQirD,QAAUC,EAAtB,CAIA,GAAIC,GAAmB/4C,aAAa,aAAe9gC,KAAK4oB,UAAY,gBAAkB,GAClFkxD,EAAiBtqD,EAASH,GAC1BpH,QAASjoB,KAAKioB,QACd2C,KAAM5qB,KAAK4qB,KACX5E,cAAehmB,KAAKgmB,gBAExB,IAAI8zD,GAAkBD,EAElB,YADA/4C,aAAa,aAAe9gC,KAAK4oB,UAAY,eAAiBkxD,EAKlE,KAAK,GADDC,MACKhkD,EAAK,EAAGA,EAAK/1B,KAAKioB,QAAQjuB,SAAU+7B,EAAI,CAC7C,GAAI4B,GAAS33B,KAAKioB,QAAQ8N,EAC1B,IAAK4B,EAAL,CAGA,GAAIwR,GAAMnZ,EAAc2H,GACpBqiD,EAAKD,EAAoB5wC,EACxB6wC,KACDD,EAAoB5wC,GAAO6wC,MAC/BA,EAAG98E,KAAKy6B,IAIZ,IAAK33B,KAAKu5E,cAAe,CACrB,GAAIU,GAAOn5C,aAAa,aAAe9gC,KAAK4oB,UAAY,aACpDsxD,EAAmE,EAA5Dp5C,aAAa,aAAe9gC,KAAK4oB,UAAY,eACpDuxD,EAAiE,EAA1Dr5C,aAAa,aAAe9gC,KAAK4oB,UAAY,YACxD,IAAIqxD,GAAQC,GAAQC,EAAM,CACzBn6E,KAAKwB,IAAMy4E,EACXj6E,KAAKmsB,UAAY+tD,EACjBl6E,KAAKosB,QAAU+tD,CAEf,IAAIh2C,GAAMrD,aAAa,aAAe9gC,KAAK4oB,UAAY,sBACnDub,KACAnkC,KAAKqpB,cAAoB,EAAJ8a,GAGtBnkC,KAAKsgB,cAAuF,QAAtEwgB,aAAa,aAAe9gC,KAAK4oB,UAAY,oBAEnE,IAAIwxD,GAAKxzE,WAAWk6B,aAAa,aAAe9gC,KAAK4oB,UAAY,eAC/C,iBAAPwxD,IAAoBznE,MAAMynE,KACjCp6E,KAAKsiB,UAAY83D,IAK7B,GAAI9nC,GAAKxR,aAAa,aAAe9gC,KAAK4oB,UAAY,qBACtD5oB,MAAK4lB,iBAAoB0sB,GAAY,QAANA,CAC/B,IAAI+nC,GAAMv5C,aAAa,aAAe9gC,KAAK4oB,UAAY,yBACvD5oB,MAAKijB,oBAAuBo3D,GAAc,QAAPA,CACnC,IAAIC,GAAMx5C,aAAa,aAAe9gC,KAAK4oB,UAAY,yBACvD5oB,MAAKomB,oBAAuBk0D,GAAc,QAAPA,CAEnC,IAAIC,GAAKz5C,aAAa,aAAe9gC,KAAK4oB,UAAY,kBAClD2xD,KACAv6E,KAAKgmB,cAAgBu0D,EAEzB,IAAIjzE,GAAIw5B,aAAa,aAAe9gC,KAAK4oB,UAAY,gBACjDthB,KACAtH,KAAK+pB,YAAqB,SAANziB,EACxB,IAAIA,GAAIw5B,aAAa,aAAe9gC,KAAK4oB,UAAY,qBACjDthB,KACAtH,KAAK8pB,iBAA0B,SAANxiB,EAE7B,IAAIkzE,GAAY15C,aAAa,aAAe9gC,KAAK4oB,UAAY,WAC7D,IAAI4xD,EAAW,CACd,GAAIC,GAAgB15C,KAAK56B,MAAMq0E,EAC5Bx6E,MAAKioB,WACLjoB,KAAK43B,kBACL,KAAK,GAAI7B,GAAK,EAAGA,EAAK0kD,EAAczgF,SAAU+7B,EAAI,CAC9C,GAAI4B,GAAS33B,KAAKioB,QAAQ8N,GAAM0kD,EAAc1kD,GAAI4B,MAClD33B,MAAK43B,gBAAgB7B,GAAM0kD,EAAc1kD,GAAIxS,MAG7C,KAAK,GAFD4lB,GAAMnZ,EAAc2H,GACpBqiD,EAAKD,EAAoB5wC,OACpBuxC,EAAM,EAAGA,EAAMV,EAAGhgF,SAAU0gF,EAAK,CACtC,GAAIC,GAAYX,EAAGU,EACnB,IAAI5qD,EAAgB6H,EAAQgjD,GACxB,IAAK,GAAIvpE,KAAKupE,GACNA,EAAUh+B,eAAevrC,KACC,kBAAlBupE,GAAUvpE,IAAsBupE,EAAUvpE,YAAcwd,SAEhE+I,EAAOvmB,GAAKupE,EAAUvpE,MAQ9C,GAAIwpE,GAAS95C,aAAa,aAAe9gC,KAAK4oB,UAAY,QAK1D,OAJIgyD,KACA56E,KAAK4qB,KAAOmW,KAAK56B,MAAMy0E,KAGpB,KAGX1/D,EAAQvb,UAAU8mB,MAAQ,WACtB,IAAK,GAAIhtB,GAAIuG,KAAK+iB,MAAM/oB,OAAS,EAAGP,GAAK,IAAKA,EAC3CuG,KAAKo8B,YAAYr8B,MAAOtG,IAAI,EAE/B,KAAK,GAAIA,GAAI,EAAGA,EAAIuG,KAAKuqB,eAAevwB,SAAUP,EAAG,CACjD,GAAIL,GAAI4G,KAAKuqB,eAAe9wB,EACvBL,GAAEy+B,UACH73B,KAAKu3B,QAAQv3B,KAAKuqB,eAAe9wB,IAGzCuG,KAAKmhB,WAAW7P,OAAO,EAAGtR,KAAKmhB,WAAWnnB,QAE1CgG,KAAKw5B,YAAYx5B,KAAKixB,WAAYjxB,KAAKkxB,aAAclxB,KAAKmxB,epCurc3DzK,aAAa,EAAE/L,SAAS,GAAGwvB,kBAAkB,GAAGlgC,UAAU,GAAGwgC,YAAY,KAAKowC,IAAI,SAASrhF,EAAQU,EAAOJ,GqCj6c5G,YAaD,SAAS01B,GAASp2B,GAAQ,MAAO0hF,GAASC,EAAUC,EAAc5hF,KAClE,QAASwe,GAASxe,GAAQ,MAAO6hF,GAASF,EAAUC,EAAc5hF,KAoBlE,QAAS2hF,GAAU3hF,GAEjB,MAAO8hF,GAAUC,EAAUC,EAAUhiF,GAAe,EAAXA,EAAEY,SAyB7C,QAAS8gF,GAASO,GAMhB,IAAI,GADA/zE,GAFAg0E,EAAUC,EAAU,mBAAqB,mBACzCC,EAAS,GAEL/hF,EAAI,EAAGA,EAAI4hF,EAAMrhF,OAAQP,IAE/B6N,EAAI+zE,EAAMjkE,WAAW3d,GACrB+hF,GAAUF,EAAQhG,OAAQhuE,IAAM,EAAK,IAC3Bg0E,EAAQhG,OAAmB,GAAXhuE,EAE5B,OAAOk0E,GAMT,QAASP,GAASI,GAMhB,IAAI,GAHAI,GAAM,mEACND,EAAS,GACTx5C,EAAMq5C,EAAMrhF,OACRP,EAAI,EAAOuoC,EAAJvoC,EAASA,GAAK,EAK3B,IAAI,GAHAiiF,GAAWL,EAAMjkE,WAAW3d,IAAM,IACfuoC,EAARvoC,EAAI,EAAU4hF,EAAMjkE,WAAW3d,EAAE,IAAM,EAAI,IACnCuoC,EAARvoC,EAAI,EAAU4hF,EAAMjkE,WAAW3d,EAAE,GAAU,GAClDsD,EAAI,EAAO,EAAJA,EAAOA,IAEiBy+E,GAA9B,EAAJ/hF,EAAY,EAAJsD,EAAuB,EAAfs+E,EAAMrhF,OAAsB2hF,EAChCF,EAAInG,OAAQoG,IAAY,GAAG,EAAE3+E,GAAM,GAGtD,OAAOy+E,GA2DT,QAASR,GAAcK,GAMrB,IAJA,GAEI/zE,GAAGmqC,EAFH+pC,EAAS,GACT/hF,EAAI,KAGAA,EAAI4hF,EAAMrhF,QAGhBsN,EAAI+zE,EAAMjkE,WAAW3d,GACrBg4C,EAAIh4C,EAAI,EAAI4hF,EAAMrhF,OAASqhF,EAAMjkE,WAAW3d,EAAI,GAAK,EACxC6N,GAAV,OAAoB,OAALA,GAAyBmqC,GAAV,OAAoB,OAALA,IAE9CnqC,EAAI,QAAgB,KAAJA,IAAe,KAAW,KAAJmqC,GACtCh4C,KAIM,KAAL6N,EACDk0E,GAAUj/E,OAAOC,aAAa8K,GACnB,MAALA,EACNk0E,GAAUj/E,OAAOC,aAAa,IAAS8K,IAAM,EAAM,GACrB,IAAqB,GAAZA,GAC5B,OAALA,EACNk0E,GAAUj/E,OAAOC,aAAa,IAAS8K,IAAM,GAAM,GACrB,IAASA,IAAM,EAAM,GACrB,IAAqB,GAAZA,GAC5B,SAALA,IACNk0E,GAAUj/E,OAAOC,aAAa,IAAS8K,IAAM,GAAM,EACrB,IAASA,IAAM,GAAM,GACrB,IAASA,IAAM,EAAM,GACrB,IAAqB,GAAZA,GAE3C,OAAOk0E,GA4BT,QAASJ,GAAUC,GAGjB,IAAI,GADAG,GAAS/lC,MAAM4lC,EAAMrhF,QAAU,GAC3BP,EAAI,EAAGA,EAAI+hF,EAAOxhF,OAAQP,IAChC+hF,EAAO/hF,GAAK,CACd,KAAI,GAAIA,GAAI,EAAGA,EAAmB,EAAf4hF,EAAMrhF,OAAYP,GAAK,EACxC+hF,EAAO/hF,GAAG,KAAiC,IAA1B4hF,EAAMjkE,WAAW3d,EAAI,KAAe,GAAKA,EAAI,EAChE,OAAO+hF,GAMT,QAASN,GAAUG,GAGjB,IAAI,GADAG,GAAS,GACL/hF,EAAI,EAAGA,EAAmB,GAAf4hF,EAAMrhF,OAAaP,GAAK,EACzC+hF,GAAUj/E,OAAOC,aAAc6+E,EAAM5hF,GAAG,KAAQ,GAAKA,EAAI,GAAO,IAClE,OAAO+hF,GAMT,QAASL,GAAU7zE,EAAG06B,GAGpB16B,EAAE06B,GAAO,IAAM,KAAS,GAAKA,EAAM,GACnC16B,GAAI06B,EAAM,IAAM,GAAM,GAAK,IAAMA,CASjC,KAAI,GAPAqsB,GAAI5Y,MAAM,IACVl8C,EAAK,WACLmB,EAAI,WACJ2F,EAAI,YACJ6U,EAAK,UACLlc,EAAI,YAEAS,EAAI,EAAGA,EAAI6N,EAAEtN,OAAQP,GAAK,GAClC,CAOE,IAAI,GANAmiF,GAAOriF,EACPsiF,EAAOnhF,EACPohF,EAAOz7E,EACP07E,EAAO7mE,EACP8mE,EAAOhjF,EAEH+D,EAAI,EAAO,GAAJA,EAAQA,IACvB,CACS,GAAJA,EAAQsxD,EAAEtxD,GAAKuK,EAAE7N,EAAIsD,GACnBsxD,EAAEtxD,GAAKk/E,EAAQ5tB,EAAEtxD,EAAE,GAAKsxD,EAAEtxD,EAAE,GAAKsxD,EAAEtxD,EAAE,IAAMsxD,EAAEtxD,EAAE,IAAK,EACzD,IAAI9D,GAAIijF,EAASA,EAASD,EAAQ1iF,EAAG,GAAI4iF,EAAQp/E,EAAGrC,EAAG2F,EAAG6U,IACzCgnE,EAASA,EAASljF,EAAGq1D,EAAEtxD,IAAKq/E,EAAQr/E,IACrD/D,GAAIkc,EACJA,EAAI7U,EACJA,EAAI47E,EAAQvhF,EAAG,IACfA,EAAInB,EACJA,EAAIN,EAGNM,EAAI2iF,EAAS3iF,EAAGqiF,GAChBlhF,EAAIwhF,EAASxhF,EAAGmhF,GAChBx7E,EAAI67E,EAAS77E,EAAGy7E,GAChB5mE,EAAIgnE,EAAShnE,EAAG6mE,GAChB/iF,EAAIkjF,EAASljF,EAAGgjF,GAElB,MAAOvmC,OAAMl8C,EAAGmB,EAAG2F,EAAG6U,EAAGlc,GAQ3B,QAASmjF,GAAQljF,EAAGyB,EAAG2F,EAAG6U,GAExB,MAAO,IAAJjc,EAAgByB,EAAI2F,GAAQ3F,EAAKwa,EAC7B,GAAJjc,EAAeyB,EAAI2F,EAAI6U,EACnB,GAAJjc,EAAgByB,EAAI2F,EAAM3F,EAAIwa,EAAM7U,EAAI6U,EACpCxa,EAAI2F,EAAI6U,EAMjB,QAASknE,GAAQnjF,GAEf,MAAY,IAAJA,EAAW,WAAkB,GAAJA,EAAW,WAChC,GAAJA,EAAU,YAAc,WAOlC,QAASijF,GAAS50E,EAAGmqC,GAEnB,GAAI4qC,IAAW,MAAJ/0E,IAAmB,MAAJmqC,GACtB6qC,GAAOh1E,GAAK,KAAOmqC,GAAK,KAAO4qC,GAAO,GAC1C,OAAQC,IAAO,GAAa,MAAND,EAMxB,QAASJ,GAAQM,EAAKruE,GAEpB,MAAQquE,IAAOruE,EAAQquE,IAAS,GAAKruE,EA3TvC,GAAIqtE,GAAU,EACVI,EAAU,EA6TS,oBAAZzhF,KACTA,EAAOJ,SACL8d,SAAUA,EACV4X,SAAUA,SrCo4cRgtD,IAAI,SAAShjF,EAAQU,EAAOJ,GsC3sdlC,YA0DA,SAASs6D,GAAuC9vD,EAAMm4E,GAClDC,GAAmCp4E,GAAQm4E,EAM/C,QAASn3E,GAAgChB,EAAMm4E,GAC3CE,GAA4Br4E,GAAQm4E,EAGxC,QAAS3iB,GAAqBx1D,GAC1B,MAAIq4E,IAA4Br4E,GACrBq4E,GAA4Br4E,GAAMA,GAD7C,OAyHJ,QAAS6jE,GAAqBxwC,GAC1B,GAAI71B,GAAQ9B,IAEZA,MAAK23B,OAASA,EACd33B,KAAK48E,MAAQ,SAAWC,GACpBllD,EAAO76B,OACPkD,KAAKlD,KAAO66B,EAAO76B,MAEnB66B,EAAO65C,mBACP75C,EAAO65C,kBAAkB,WACrB1vE,EAAM86E,MAAQ,SAAWC,KAuHrC,QAAS5oB,KACLj0D,KAAK40D,KAAO,EACZ50D,KAAK8vE,qBACL9vE,KAAK+vE,sBACL/vE,KAAKkwE,UAAY,KAkErB,QAAS4M,GAAiBt5D,GACtBxjB,KAAKwjB,UAAY,GAAI8nB,GAAU9nB,GAC/BxjB,KAAK40D,KAAO,EACZ50D,KAAK8vE,qBAuGT,QAASvsC,GAAkB/f,GACvBxjB,KAAKwjB,UAAY,GAAI8nB,GAAU9nB,GAC/BxjB,KAAK+8E,mBAAqB,GAAI3tD,EAE9B,IAAIttB,GAAQ9B,IACZA,MAAKwjB,UAAU4F,YACX,SAAS4zD,GACLl7E,EAAMi7E,mBAAmBpT,QAAQqT,KA8B7C,QAAS55C,GAAqBzL,GAC1B,GAAI71B,GAAQ9B,IACZA,MAAK23B,OAASA,EACd33B,KAAKi9E,OAAS,GAAI7tD,EAClB,IAAIh0B,EACJ,IAAIu8B,EAAOuL,UACP9nC,EAAO,GAAI6b,GAAa0gB,EAAOuL,WAAY1pB,YAAame,EAAOne,YAAaI,SAAU+d,EAAO/d,eAC1F,CAAA,IAAI+d,EAAOwL,WAGd,KAAMxpC,OAAM,uCAFZyB,GAAO,GAAI2b,GAAc4gB,EAAOwL,YAKpC+5C,EAAW9hF,EAAM,SAAS+hF,EAAI7uD,GACtBA,EACA9e,QAAQC,IAAI6e,GAEZxsB,EAAMm7E,OAAOtT,QAAQwT,KAgCjC,QAAS75C,GAAsB3L,GAC3B33B,KAAK23B,OAASA,EA0DlB,QAASywC,GAAiBgV,GACtBnpB,EAAkBl6D,KAAKiG,KAEvB,IAAI8B,GAAQ9B,IAKZ,IAJAA,KAAKkwE,UAAY,aACjBlwE,KAAKo9E,UAAYp9E,KAAKyB,KAAO27E,EAC7Bt7E,EAAMu7E,UAAY,GAAIjuD,GAElBpvB,KAAKyB,KAAK67E,UAAW,CACrB,GAAIC,GAAMC,GAAex9E,KAAKyB,KAAK67E,UACnC,KAAKC,EAAK,CACNA,EAAM,GAAInuD,GACVouD,GAAex9E,KAAKyB,KAAK67E,WAAaC,CAEtC,IAAIxkE,GAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACC,GAAlBL,EAAIM,aACc,KAAdN,EAAIO,OACJikE,EAAI5T,QAAQ,WAEZ4T,EAAI5T,QAAQ,aAIxB5wD,EAAIG,KAAK,MAAOlZ,KAAKyB,KAAK67E,UAAY,IAAM9tD,SAAS,OAASvgB,KAAKC,QAAQ,GACvElP,KAAKyB,KAAK+X,cACVT,EAAIU,iBAAkB,GAE1BV,EAAIW,OAER6jE,EAAIxS,MAAM,SAASzxD,GACA,YAAXA,GACAxX,EAAMy7B,aAIdz7B,GAAMy7B,OA0Pd,QAAS8qC,GAAuB+U,EAAWrvD,EAAQ9S,GAC/Cg5C,EAAkBl6D,KAAKiG,KAGvBA,MAAK+tB,OAASA,EACd/tB,KAAKkwE,UAAY,aACjBlwE,KAAKo9E,UAAYp9E,KAAKyB,KAAO27E,EAC7Bp9E,KAAKy9E,UAAY,GAAIruD,GAEjBguD,EAAUxjE,WACV5Z,KAAK09E,YAAcziE,EAAQmuB,iBAAiBg0C,EAAUxjE,WAG1D5Z,KAAKu9B,OA+PT,QAASogD,GAAmBxkF,EAAG00B,GAC3B,KAAI10B,EAAEgK,KAAOrE,EAASG,kBAAtB,CAGA,GAAI+iC,EAMJ,IAJIA,EADA7oC,EAAE4K,IACI5K,EAAE4K,IAAI/J,OAENb,EAAEsK,UAERtK,EAAE0K,MAAO,CACTm+B,EAAM,CAEN,KAAK,GADD+pB,GAAM9e,EAAW9zC,EAAE0K,OACdupC,EAAK,EAAGA,EAAK2e,EAAI/xD,SAAUozC,EAAI,CACpC,GAAI6e,GAAKF,EAAI3e,IACA,KAAT6e,EAAGxb,IAAsB,KAATwb,EAAGxb,MACnBzO,GAAOiqB,EAAG/9C,MAItB,GAAIxU,GAAI,GAAIkM,EAkBZ,OAjBAlM,GAAEiE,IAAMxE,EAAE2J,IAAM,EAChBpJ,EAAEoG,IAAM3G,EAAE2J,IAAMk/B,EAChBtoC,EAAE6J,QAAUpK,EAAEoK,QACd7J,EAAE4K,KAAO,MACT5K,EAAE+N,GAAKtO,EAAEwK,SACTjK,EAAEgO,OAAwD,MAAQvO,EAAE6J,IACpEtJ,EAAEmK,MAAQ1K,EAAE0K,MACZnK,EAAEqK,IAAM5K,EAAE4K,IACVrK,EAAEyK,MAAQhL,EAAEgL,MACZzK,EAAEmN,YAAe1N,EAAEgK,KAAOrE,EAASK,mBAAsB,IAAM,IAC/DzF,EAAEkkF,UAAYzkF,EAEV00B,GAAU10B,EAAEgK,KAAOrE,EAASC,oBAC5BrF,EAAEiO,SAAWF,GAAItO,EAAEwK,SACNW,KAAM,cAGhB5K,GAGX,QAAS4uE,GAAiBuV,GACtB5pB,EAAkBl6D,KAAKiG,KAEvB,IAAI8B,GAAQ9B,IAKZ,IAJAA,KAAK69E,UAAYA,EACjB79E,KAAKyB,MAAQ+X,YAAaqkE,EAAUrkE,YAAa8jE,UAAWO,EAAUP,UAAWQ,SAAUD,EAAUC,UACrG99E,KAAK+9E,UAAY,GAAI3uD,GAEjBpvB,KAAKyB,KAAK67E,UAAW,CACrB,GAAIC,GAAMC,GAAex9E,KAAKyB,KAAK67E,UACnC,KAAKC,EAAK,CACNA,EAAM,GAAInuD,GACVouD,GAAex9E,KAAKyB,KAAK67E,WAAaC,CAEtC,IAAIxkE,GAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACC,GAAlBL,EAAIM,aACc,KAAdN,EAAIO,OACJikE,EAAI5T,QAAQ,WAEZ4T,EAAI5T,QAAQ,aAKxB5wD,EAAIG,KAAK,MAAOlZ,KAAKyB,KAAK67E,UAAY,IAAM9tD,SAAS,OAASvgB,KAAKC,QAAQ,GACvElP,KAAKyB,KAAK+X,cACVT,EAAIU,gBAAkB,QAE1BV,EAAIW,OAER6jE,EAAIxS,MAAM,SAASzxD,GACA,YAAXA,GACAxX,EAAMy7B,aAIdz7B,GAAMy7B,OAiGd,QAASgrC,GAAuBsV,EAAW9vD,GACvCkmC,EAAkBl6D,KAAKiG,KAGvBA,MAAK69E,UAAYA,EACjB79E,KAAK+tB,OAASA,EACd/tB,KAAKyB,MAAQ+X,YAAaqkE,EAAUrkE,YAAa8jE,UAAWO,EAAUP,UAAWQ,SAAUD,EAAUC,UACrG99E,KAAKy9E,UAAY,GAAIruD,GAEjByuD,EAAUjkE,WACV5Z,KAAK09E,YAAcziE,EAAQmuB,iBAAiBy0C,EAAUjkE,WAG1D5Z,KAAKu9B,OAwGT,QAAS2qC,GAAoBvwC,EAAQzK,GACjCltB,KAAK23B,OAASA,EACd33B,KAAKktB,QAAUA,EAEfltB,KAAK8vE,qBACL9vE,KAAK40D,KAAO,EA0JhB,QAAS4T,MAqBT,QAASb,MAOT,QAASqW,GAAqBrmD,GAC1B33B,KAAKwsE,MAAQ,GAAIjG,GAAa5uC,EAAOsmD,MAAOtmD,EAAOumD,SAzoDvD,GAAwB,mBAAb1kF,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBsB,EAAOhjB,EAAQ,UACf+1B,EAAU/S,EAAK+S,QAEf1pB,EAAQrM,EAAQ,WAChB41B,EAAUvpB,EAAMupB,QAChBuW,EAAe9/B,EAAM8/B,aACrB7/B,EAAcD,EAAMC,YACpBq4E,EAAmBt4E,EAAMs4E,iBAEzB34E,EAAMhM,EAAQ,SACdiM,EAAgBD,EAAIC,cACpBC,EAAWF,EAAIE,SACf4lC,EAAY9lC,EAAI8lC,UAChB0B,EAAaxnC,EAAIwnC,WACjBpnC,EAAaJ,EAAII,WACjBmuC,EAAcvuC,EAAIuuC,YAClBG,EAAU1uC,EAAI0uC,QAEd/1C,EAAM3E,EAAQ,SACdyd,EAAe9Y,EAAI8Y,aACnBF,EAAgB5Y,EAAI4Y,cAEpBkmE,EAASzjF,EAAQ,YACjB0jF,EAAaD,EAAOC,WAEpBnwE,EAAMvT,EAAQ,YACdsR,EAAUiC,EAAIjC,QAEdpO,EAAMlD,EAAQ,SACd2B,EAAUuB,EAAIvB,QACd2D,EAAWpC,EAAIoC,SAEfZ,EAAQ1E,EAAQ,WAChB4E,EAAQF,EAAME,MACdC,EAAQH,EAAMG,MAEd4uC,EAAazzC,EAAQ,WAAWyzC,WAEhCw7B,EAAuBjvE,EAAQ,aAAaivE,qBAE5ClC,EAAe/sE,EAAQ,YAAY+sE,aAEnC32C,GAAWp2B,EAAQ,cAAco2B,SAEjCxO,GAAQ5nB,EAAQ,WAGhBm6D,IAFiBvyC,GAAMg9D;AAEL5kF,EAAQ,YAAYm6D,gBAG9C,IAAI+oB,OAOAC,KAaJptD,GAAQ5vB,UAAU0+E,YAAc,WAC5B,GAAIC,GAAWt+E,KAEXioB,EAAUjoB,KAAKib,QAAQsd,cAAcv4B,KAAKwjB,UAC9CxjB,MAAKojB,cAAgB6E,EAAQhX,UAAY,GAAIu3D,GAC7CxoE,KAAKi8B,eAAiBhU,EAAQ2vB,SAE1B53C,KAAKojB,eAAiBpjB,KAAKojB,cAAcouD,mBACzCxxE,KAAKojB,cAAcouD,kBAAkB,WACjC8M,EAASrjE,QAAQ8c,YAAYumD,MAKzCpjE,EAAQvb,UAAU44B,cAAgB,SAAShV,GACvC,GAAI0E,GAAUjoB,KAAK8qB,YAAYwe,IAAI/lB,EACnC,IAAI0E,EACA,MAAOA,EAEX,IAAImpD,GAAI14C,CAER,IAAwB,YAApBnV,EAAO0f,WAA2B1f,EAAO2f,WAAa3f,EAAO4f,WAEzDzK,EADAnV,EAAO2f,WAAa3f,EAAO4f,WACtB,GAAIC,GAAqB7f,GACvBA,EAAO8f,WACT,GAAIC,GAAsB/f,GAE1B,GAAIggB,GAAkBhgB,OAE5B,IAAIA,EAAO0f,WAAay5C,GAAmCn5D,EAAO0f,WAAY,CACjF,GAAIs7C,GAAM7B,GAAmCn5D,EAAO0f,WAChD3qB,EAAKimE,EAAIh7D,EACb6tD,GAAK94D,EAAGrH,SACRynB,EAAKpgB,EAAGs/B,aACL,IAAIr0B,EAAOi7D,QAAUj7D,EAAOk7D,QAAS,CACxC,GAAI1wD,GAAS/tB,KAAKgpC,WAEdooC,GADArjD,EACK,GAAIs6C,GAAuB9kD,EAAQwK,EAAQ/tB,MAE3C,GAAIooE,GAAiB7kD,OAC3B,IAAIA,EAAOm7D,QAAUn7D,EAAOo7D,QAAS,CACxC,GAAI5wD,GAAS/tB,KAAKgpC,WAEdooC,GADArjD,EACK,GAAIw6C,GAAuBhlD,EAAQwK,EAAQ/tB,MAE3C,GAAIsoE,GAAiB/kD,OACvBA,GAAO06D,MACd7M,EAAK,GAAI4M,GAAqBz6D,IACvBA,EAAO4lB,KAAO5lB,EAAO40B,gBAC5Bi5B,EAAK,GAAI0L,GAAiBv5D,GAG9B,IAAIA,EAAOmhB,QAAS,CAChB,GAAIzc,KACAmpD,IACAnpD,EAAQ/qB,KAAK,GAAIirE,GAAqBiJ,GAE1C,KAAK,GAAIr3B,GAAK,EAAGA,EAAKx2B,EAAOmhB,QAAQ1qC,SAAU+/C,EAAI,CAC/C,GAAIz5C,GAAKN,KAAKu4B,cAAchV,EAAOmhB,QAAQqV,GACvCz5C,IAAMA,EAAG2Q,UACTgX,EAAQ/qB,KAAKoD,EAAG2Q,UAExBmgE,EAAK,GAAI3I,GAAqBxgD,EAAS1E,GA2B3C,MAxBIA,GAAOspB,kBACPukC,EAAK,GAAIlJ,GAAoBkJ,EAAI,GAAIxhD,KAAUtrB,KAAM,QAASuoC,gBAAiBtpB,EAAOspB,oBAGtFtpB,EAAO2J,UACPkkD,EAAK,GAAIlJ,GAAoBkJ,EAAIpxE,KAAK6oB,OAAOtF,EAAO2J,WAGpD3J,EAAOzmB,MAAQs0E,IAAOA,EAAGt0E,OACzBs0E,EAAGt0E,KAAOymB,EAAOzmB,MAGH,mBAAPs0E,IAA6B,OAAPA,IAC7BA,EAAK,GAAIjJ,GAAqBiJ,KAGd,mBAAPA,IAA8B,OAARA,GAAgC,mBAAP14C,IAA4B,MAANA,KAC9EzQ,GACIhX,SAAUmgE,EACVx5B,SAAUlf,GAEd14B,KAAK8qB,YAAY2e,IAAIlmB,EAAQ0E,IAG1BA,GAGXsH,EAAQ5vB,UAAUi/E,gBAAkB,SAASvwD,GACzC,GAAIwwD,EAeAA,IAbA7+E,KAAKwjB,UAAUm3B,iBACd36C,KAAKwjB,UAAUyf,WACfjjC,KAAKwjB,UAAUg7D,QACfx+E,KAAKwjB,UAAUi7D,SACfz+E,KAAKwjB,UAAUk7D,QACf1+E,KAAKwjB,UAAUm7D,SACf3+E,KAAKwjB,UAAU0f,WACfljC,KAAKwjB,UAAU2f,YACfnjC,KAAKwjB,UAAUy6D,OACfj+E,KAAKwjB,UAAUkhB,SAIL1kC,KAAK8pE,YAFL,GAAIgT,GAAiB98E,KAAKwjB,WAIzCq7D,EAAS71E,cAAcqlB,GAG3B,IAAIwuD,IAAgB,CAiBpB1U,GAAqBxoE,UAAU+xE,qBAAuB,SAASK,GAC3D,MAAI/xE,MAAK23B,OAAO+5C,qBACL1xE,KAAK23B,OAAO+5C,qBAAqBK,OAExCA,GAAS,OAGjB5J,EAAqBxoE,UAAUkyE,wBAA0B,SAASE,GAC9D,MAAI/xE,MAAK23B,OAAOk6C,wBACL7xE,KAAK23B,OAAOk6C,wBAAwBE,GAD/C,QAIJ5J,EAAqBxoE,UAAUmiB,OAAS,SAASuzC,EAAO95D,GACpD,MAAIyE,MAAK23B,OAAO7V,OACL9hB,KAAK23B,OAAO7V,OAAOuzC,EAAO95D,GADrC,QAIJ4sE,EAAqBxoE,UAAU0tE,eAAiB,SAAS9xE,GACrD,MAAIyE,MAAK23B,OAAO01C,eACLrtE,KAAK23B,OAAO01C,eAAe9xE,GADtC,QAIJ4sE,EAAqBxoE,UAAUqJ,cAAgB,SAASzN,GACpDyE,KAAK23B,OAAO3uB,cAAczN,IAG9B4sE,EAAqBxoE,UAAU80D,UAAY,WACvC,MAAOz0D,MAAK23B,OAAO88B,aAGvB0T,EAAqBxoE,UAAU4xE,oBAAsB,SAAS13E,GACtDmG,KAAK23B,OAAO45C,qBACZvxE,KAAK23B,OAAO45C,oBAAoB13E,IAIxCsuE,EAAqBxoE,UAAUmyE,uBAAyB,SAASj4E,GACzDmG,KAAK23B,OAAOm6C,wBACZ9xE,KAAK23B,OAAOm6C,uBAAuBj4E,IAI3CsuE,EAAqBxoE,UAAU6xE,kBAAoB,SAAS33E,GACpDmG,KAAK23B,OAAO65C,mBACZxxE,KAAK23B,OAAO65C,kBAAkB33E,IAGtCsuE,EAAqBxoE,UAAUqyE,qBAAuB,SAASn4E,GACvDmG,KAAK23B,OAAOq6C,sBACZhyE,KAAK23B,OAAOq6C,qBAAqBn4E,IAGzCsuE,EAAqBxoE,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK9X,GACrEyE,KAAK23B,OAAOyQ,gBAAgB5mC,EAAKsB,EAAKuQ,EAAK9X,IAG/C4sE,EAAqBxoE,UAAU0yE,qBAAuB,SAAS7wE,EAAKsB,EAAKuQ,EAAKyB,EAAWvZ,GACrFyE,KAAK23B,OAAO06C,qBAAqB7wE,EAAKsB,EAAKuQ,EAAKyB,EAAWvZ,IAG/D4sE,EAAqBxoE,UAAUq8C,aAAe,WAC1C,MAAIh8C,MAAK23B,OAAOqkB,aACLh8C,KAAK23B,OAAOqkB,mBAM3BmsB,EAAqBxoE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,EAAU0uE,GACzF,IAAKtV,EACD,KAAMh7D,OAAM,qBAGhB,IAAIk3B,GAAO7wB,KACP8+E,EAAW9+E,KAAK48E,MAEhBvV,EAAkB1S,EAAK0S,gBAAgByX,EAC3C,IAAIzX,GAAmBA,EAAgB0X,SACnC,GAAI1X,EAAgB4C,aAAa+U,eAAe/U,GAG5C,WADAp5C,GAAK8G,OAAOj8B,MAAM8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,EAAU0uE,OAG5D5C,GACPA,EAAgB4C,aAAagV,OAAOhV,IAEpC5C,EAAkB,GAAIj4C,GACtBi4C,EAAgB4C,aAAeA,EAC/BtV,EAAK0S,gBAAgByX,GAAYzX,EAEjC1S,EAAK2S,eAAexuD,KAAK,WACrBuuD,EAAgB0X,SAAU,EAC1BluD,EAAK8G,OAAOj8B,MACR8F,EACA7D,EACAmC,EACAyzB,EACA8zC,EAAgB4C,aAAaE,WAC7BxV,EACA,SAASr7C,EAAQrI,EAAUsiB,EAAO8rC,GACzBgI,EAAgBjvD,KACjBivD,EAAgBsC,SAASrwD,OAAQA,EAAQrI,SAAUA,EAAUsiB,MAAOA,EAAO8rC,SAAUA,KAE7FgI,EAAgB4C,gBAbxBtV,SAcS,SAASh7C,GACdnK,QAAQC,IAAIkK,KAIpB0tD,GAAgB0D,MAAM,SAASmU,GAC3B3jF,EAAS2jF,EAAG5lE,OAAQ4lE,EAAGjuE,SAAUiuE,EAAG3rD,MAAO2rD,EAAG7f,aAWtDpL,EAAkBt0D,UAAU+xE,qBAAuB,SAASK,GACxD/xE,KAAK+vE,mBAAmB7yE,KAAK60E,GAC7BA,EAAS/xE,KAAKkwE,YAGlBjc,EAAkBt0D,UAAUkyE,wBAA0B,SAASE,GAC3D,GAAIrsC,GAAMC,EAAa3lC,KAAK+vE,mBAAoBgC,EAC5CrsC,IAAO,GACP1lC,KAAK+vE,mBAAmBz+D,OAAOo0B,EAAK,IAI5CuuB,EAAkBt0D,UAAUgyE,gBAAkB,WAC1C,IAAK,GAAIhF,GAAK,EAAGA,EAAK3sE,KAAK+vE,mBAAmB/1E,SAAU2yE,EACpD,IACI3sE,KAAK+vE,mBAAmBpD,GAAI3sE,KAAKkwE,WACnC,MAAOl3E,GACLwW,QAAQC,IAAIzW,KAKxBi7D,EAAkBt0D,UAAU4xE,oBAAsB,SAASQ,GACvD/xE,KAAK8vE,kBAAkB5yE,KAAK60E,IAGhC9d,EAAkBt0D,UAAUmyE,uBAAyB,SAASC,GAC1D,GAAIrsC,GAAMC,EAAa3lC,KAAK8vE,kBAAmBiC,EAC3CrsC,IAAO,GACP1lC,KAAK8vE,kBAAkBx+D,OAAOo0B,EAAK,IAI3CuuB,EAAkBt0D,UAAUk1D,eAAiB,WACzC,IAAK,GAAI8X,GAAK,EAAGA,EAAK3sE,KAAK8vE,kBAAkB91E,SAAU2yE,EACnD,IACI3sE,KAAK8vE,kBAAkBnD,GAAI3sE,KAAK40D,MAClC,MAAO57D,GACLwW,QAAQC,IAAIzW,KAKxBi7D,EAAkBt0D,UAAU80D,UAAY,WACpC,MAAO,OAGXR,EAAkBt0D,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMzmD,GAC5E,MAAOA,GAAI,QAAU,MAGzB+lD,EAAkBt0D,UAAUqJ,cAAgB,SAASzN,GACjD,GAAI0N,GAAa,GAAIxD,GACjB05E,EAAW,GAAIz5E,EAKnB,OAJAy5E,GAASh2E,MAAQ,MACjBg2E,EAAS/1E,QAAU,OACnB+1E,EAAS51E,QAAU,QACnBN,EAAWK,WAAWhF,KAAM,WAAY,KAAM66E,GACvC5jF,EAAS0N,IAWpB6zE,EAAiBn9E,UAAU4xE,oBAAsB,SAASQ,GACtD/xE,KAAK8vE,kBAAkB5yE,KAAK60E,IAGhC+K,EAAiBn9E,UAAUmyE,uBAAyB,SAASC,GACzD,GAAIrsC,GAAMC,EAAa3lC,KAAK8vE,kBAAmBiC,EAC3CrsC,IAAO,GACP1lC,KAAK8vE,kBAAkBx+D,OAAOo0B,EAAK,IAI3Co3C,EAAiBn9E,UAAUk1D,eAAiB,WACxC,IAAK,GAAI8X,GAAK,EAAGA,EAAK3sE,KAAK8vE,kBAAkB91E,SAAU2yE,EACnD,IACI3sE,KAAK8vE,kBAAkBnD,GAAI3sE,KAAK40D,MAClC,MAAO57D,GACLwW,QAAQC,IAAIzW,KAKxB8jF,EAAiBn9E,UAAUqJ,cAAgB,SAASzN,GAChDyE,KAAKwjB,UAAUva,WAAW,SAASA,GAC/B1N,EAAS0N,IACV,WACC1N,EAAS,KAAM,oCAIvBuhF,EAAiBn9E,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GAC3E,GAAIm5D,GAA0B,IAAjBA,EAAM16D,OAEf,WADAuB,GAAS,QAAUg4B,EAIvB,IAAKvzB,KAAKwjB,UAAU2lB,KAAQnpC,KAAKwjB,UAAU20B,aAA3C,CAKA,GAAIn4C,KAAKwjB,UAAU47D,mBAAqBp/E,KAAKq/E,qBACzC,MAAO9jF,GAAS,KAAMyE,KAAKq/E,qBAAsBr/E,KAAKs/E,kBAG1D,IAAIC,GAAcv/E,KAAKwjB,UAAU+0B,WAAY,EACzCinC,GACAl7E,KAAMowD,EAEN6qB,KACAC,EAAKjnC,QAAU,IAAOz4C,EAAMnC,GAAO41B,EAAS,GAGhD,IAAIzxB,GAAQ9B,IACZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBAEN70D,KAAKwjB,UAAUvS,SACX,GAAI+7B,GAAWxrC,EAAK7D,EAAKmC,GACzB0/E,EACA,SAASvuE,EAAUqI,GAEfxX,EAAM8yD,OACN9yD,EAAM+yD,gBAEN,IAAI4qB,GAAWlsD,CACVgsD,KACDE,EAAW,KAEVnmE,GAAUxX,EAAM0hB,UAAU47D,oBAC3Bt9E,EAAMu9E,qBAAuBpuE,EAC7BnP,EAAMw9E,kBAAoBG,GAE9BlkF,EAAS+d,EAAQrI,EAAUwuE,OAKvC3C,EAAiBn9E,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK9X,GACjE,GAAIyE,KAAKwjB,UAAUw4B,cAAgBrW,EAAa3lC,KAAKwjB,UAAUw4B,aAAc,0BAA4B,EAAG,CACxG,GAAIl6C,GAAQ9B,IACZ,IAAIA,KAAK0/E,WACL,MAAOlwE,SAAQC,IAAI,kDAEvBzP,MAAK0/E,YAAa,CAClB,IAAIF,IACAnnC,SAAU72C,EAAM,KAAW,EAAJsB,GAAS,KAAOuQ,EAAM,EAAI,IAAM,MAEvDqhD,EAAQ4pB,SAASqB,gBAAgBrB,SAASrjE,QAAQsY,MAClDmhC,KACA8qB,EAAK9qB,MAAQA,GAEjB4pB,SAAS96D,UAAUvS,SAAS,KAAMuuE,EAAM,SAASpnE,GAC7CtW,EAAM49E,YAAa,EACftnE,EAAIpe,OAAS,GAAgB,OAAXoe,EAAI,IACtB7c,EAAS6c,EAAI,QAkB7BmrB,EAAkB5jC,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAK60D,EAAMp5D,GAC9DyE,KAAKwjB,UAAUo0B,SACX,GAAI5K,GAAWxrC,EAAK7D,EAAKmC,GACzB,SAAS+3C,GACL,MAAmB,IAAfA,EAAK79C,OACEuB,EAAS,KAAMs8C,EAAK,IAEpBt8C,EAAS,0BAMhCgoC,EAAkB5jC,UAAUi5B,WAAa,SAASp3B,EAAK0M,GACnDlO,KAAK+8E,mBAAmBhS,MAAM,SAASiS,GACnC,IAAK,GAAI4C,GAAM,EAAGA,EAAM5C,EAAGhjF,SAAU4lF,EACjC,GAAI5C,EAAG4C,GAAK9iF,MAAQ0E,EAChB,MAAO0M,IAAKlU,OAAQgjF,EAAG4C,GAAKn5E,KAGpC,OAAOyH,QA2Bfk1B,EAAqBzjC,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAK60D,EAAMp5D,GAC7DyE,KAAKi9E,OAAOlS,MAAM,SAASoS,GACvBA,EAAGzhF,MAAM8F,EAAK7D,EAAKmC,EACV,SAASiE,EAAK4V,GACV,GAAIA,EACA,MAAOpe,GAASoe,EAAK,KAErB,IAAIi+B,GAAW,GAAI7D,GAAYvyC,EAAK7D,EAAKmC,EAAK,MAAOiE,EACrD,OAAOxI,GAAS,KAAMq8C,QAMnDxU,EAAqBzjC,UAAUi5B,WAAa,SAASp3B,EAAK0M,GACtDlO,KAAKi9E,OAAOlS,MAAM,SAASoS,GACvB,GAAIp5E,GAAMo5E,EAAG0C,OAAOr+E,EAChBuC,GACAo5E,EAAG0C,OAAOr+E,GAAKxH,OAAO,SAASH,GAC3BqU,GAAKlU,OAAQH,MAGjBqU,OAWZo1B,EAAsB3jC,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAK60D,EAAMp5D,GAClE,GAAIuC,GAAMkC,KAAK23B,OAAO0L,WAAa,oBAAsBrjC,KAAK23B,OAAOw8B,QAAU,IACrE3yD,EAAM,IAAM7D,EAAM,KAAOmC,EAAM,mCACrCiZ,EAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACrB,GAAsB,GAAlBL,EAAIM,WAAiB,CACrB,GAAIy7C,EACJ,MAAI/7C,EAAIO,QAAU,KAUX,CACHw7C,EAAK/zB,KAAK56B,MAAM4S,EAAIuB,SACpB,IAAIs9B,GAAW,GAAI7D,GAAYvyC,EAAK7D,EAAKmC,EAAK,MAAOg1D,EAAG/wD,IACxD,OAAOxI,GAAS,KAAMq8C,GAZtB,GAAIj+B,GAAM,cAAgBZ,EAAIO,MAC9B,KACIw7C,EAAK/zB,KAAK56B,MAAM4S,EAAIuB,UAChBw6C,EAAGxmC,QACH3U,EAAMm7C,EAAGxmC,OAHjB,QAMI/yB,EAASoe,EAAK,SAS9BZ,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIqB,aAAe,OACnBrB,EAAIW,QAGR4pB,EAAsB3jC,UAAUi5B,WAAa,SAASp3B,EAAK0M,GACzD,GAAIpQ,GAAMkC,KAAK23B,OAAO0L,WAAa,kBAAoBrjC,KAAK23B,OAAOw8B,QAAU,IAAM3yD,EAAM,iCACrFuX,EAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACtB,GAAsB,GAAlBL,EAAIM,WACL,GAAIN,EAAIO,QAAU,IACdpL,QACG,CACH,GAAI4mD,GAAK/zB,KAAK56B,MAAM4S,EAAIuB,SACxBpM,GAAI4mD,KAId/7C,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIqB,aAAe,OACnBrB,EAAIW,QAGNojE,EAAiBn9E,UAAU80D,UAAY,WACnC,SAGJ,IAAI+oB,MA0CJpV,GAAiBzoE,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WAE7DyoE,EAAiBzoE,UAAU49B,KAAO,WAC9B,GACIuiD,GADAh+E,EAAQ9B,KAGRmpC,EAAMnpC,KAAKo9E,UAAUj0C,KAAOnpC,KAAKo9E,UAAUoB,MAGvCsB,GAFJ32C,EACiC,WAA7BnpC,KAAKo9E,UAAUvK,UACT,GAAIlf,IAAgBxqB,GAAM3vB,YAAaxZ,KAAKyB,KAAK+X,cAEjD,GAAIvC,GAAakyB,GAAM3vB,YAAaxZ,KAAKyB,KAAK+X,YAAaI,SAAU5Z,KAAKyB,KAAKmY,WAGnF,GAAI7C,GAAc/W,KAAKo9E,UAAUqB,SAG3C3zE,EAAQg1E,EAAK,SAASp1E,EAAKiP,GACnBA,GACA7X,EAAMwsB,MAAQ3U,EACd7X,EAAMouE,UAAY,KAClBpuE,EAAM6vE,kBACN7vE,EAAMu7E,UAAU1T,QAAQ,QAExB7nE,EAAMu7E,UAAU1T,QAAQj/D,GACxB5I,EAAMouE,UAAY,KAClBpuE,EAAM6vE,kBACU,UAAZjnE,EAAIpG,MACJoG,EAAImL,gBAAgB,SAASkqE,GACzBj+E,EAAMk+E,aAAeD,QAOzC3X,EAAiBzoE,UAAUq8C,aAAe,WACtC,GAAIN,IAAQ14B,MAAM,EAGlB,IAFIhjB,KAAKq9E,UAAUjlE,KAAkC,UAA3BpY,KAAKq9E,UAAUjlE,IAAI9T,OACzCo3C,EAAKukC,WAAY,GACjBjgF,KAAKggF,cAAgBhgF,KAAKggF,aAAahmF,OAAS,EAAG,CACnD0hD,EAAK55B,SACL,KAAK,GAAIo+D,GAAM,EAAGA,EAAMlgF,KAAKggF,aAAahmF,SAAUkmF,EAChDxkC,EAAK55B,OAAO5kB,KAAK8C,KAAKggF,aAAaE,GAAKlzE,OAGhD,MAAO0uC,IAGX0sB,EAAiBzoE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GAC3E,GAAIuG,GAAQ9B,IACZA,MAAKq9E,UAAUtS,MAAM,SAASrgE,GAC1B,GAAmB,mBAARA,IAA+B,OAARA,EAC9B,MAAOnP,GAASuG,EAAMwsB,OAAS,2BAA4B,KAAM,KAGrE,IAAIlzB,GACA+kF,GAAezrB,GAA0B,IAAjBA,EAAM16D,QAAgB2rC,EAAa+uB,EAAO,YAAc,CAChF5yD,GAAML,KAAK2+E,YACXD,GAAc,EAElB,IAAIE,GAAcv+E,EAAML,KAAK4+E,aAAe,CAC5C,IAAgB,UAAZ31E,EAAIpG,MAAoB67E,GAAqD,mBAA9Br+E,GAAML,KAAKopE,eAAiC,CAE3F,IAAK,GADDp2D,GAAO,GACFJ,EAAI,EAAGA,EAAI3J,EAAIwB,WAAWlS,QAC3B0Q,EAAIwB,WAAWmI,GAAG9H,WAAcgnB,EAAQ8sD,IADHhsE,EAErCI,EAAOJ,CAK0B,oBAA9BvS,GAAML,KAAKopE,iBAClBp2D,EAAO3S,EAAML,KAAKopE,gBAIlBzvE,EADO,EAAPqZ,EACO/J,EAAIsJ,kBAEJtJ,EAAI0J,cAAcK,OAG7BrZ,GAAOsP,EAAIsJ,iBAGflS,GAAM8yD,OACN9yD,EAAM+yD,iBACNz5D,EAAKqT,YAAYjN,EAAK7D,EAAKmC,EAAK,SAASmR,GACrCnP,EAAM8yD,OACN9yD,EAAM+yD,gBAEN,IAAIuc,GAAK,GACT,IAAiB,WAAb1mE,EAAIpG,KAAmB,CACvB,GAAIg8E,IAAMxgF,EAAMnC,GAAOsT,EAASjX,OAAS,CAChCo3E,GAALkP,IACAlP,EAAKkP,GAGb,GAAIx+E,EAAML,KAAK8+E,KACX,IAAK,GAAIzsE,GAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,EACbpa,GAAEgN,QACFhN,EAAE87C,OAAS,GAAItB,GAAQ,OAAQpyC,EAAML,KAAK8+E,KAAKxiF,QAAQ,OAAQrE,EAAEgN,UAI7EnL,EAAS,KAAM0V,EAAUmgE,QAKrChJ,EAAiBzoE,UAAU0yE,qBAAuB,SAAS7wE,EAAKsB,EAAKuQ,EAAKyB,EAAWvZ,GAEjF,GAAIuG,GAAQ9B,IACZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBACN70D,KAAKq9E,UAAUjlE,IAAIxD,gBAAgBpT,EAAKsB,EAAKuQ,EAAKyB,EAAW,SAASvb,EAAGmB,GAKrE,MAJAoH,GAAM8yD,OACN9yD,EAAM+yD,iBAGCt5D,EAAShC,EAAGmB,MAI3B0tE,EAAiBzoE,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK9X,GACjE,GAAIuG,GAAQ9B,IACZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBACN70D,KAAKq9E,UAAUjlE,IAAIpE,kBAAkBZ,iBAAiB5R,EAAKsB,EAAKuQ,EAAK,SAAS+E,GAC1EtW,EAAM8yD,OACN9yD,EAAM+yD,iBACFz8C,EAAIpe,OAAS,GAAgB,OAAXoe,EAAI,IACtB7c,EAAS6c,EAAI,OAKzBgwD,EAAiBzoE,UAAU80D,UAAY,WACnC,GAAI/pD,GAAM1K,KAAKq9E,UAAUjlE,GACzB,IAAI1N,EAAmC,CAEnC,IAAK,GADD81E,IAAU,GACLnsE,EAAI,EAAGA,EAAI3J,EAAIwB,WAAWlS,SAAUqa,EACzCmsE,EAAOtjF,KAAKwN,EAAIwB,WAAWmI,GAAG9H,UAElC,OAAOi0E,GAEP,MAAO,OAIfpY,EAAiBzoE,UAAUmiB,OAAS,SAASuzC,EAAO95D,GAChD,IAAKyE,KAAKggF,cAA6C,IAA7BhgF,KAAKggF,aAAahmF,OACxC,MAAOuB,GAAS,KAAM,uBAG1B,IAAIwE,GAAQC,KAAKggF,aAAa,EAC9B,OAAOjgF,GAAMuW,OAAO++C,EAAO95D,IAG/B6sE,EAAiBzoE,UAAU0tE,eAAiB,SAAS9xE,GACjD,MAAIyE,MAAKyB,KAAKg/E,oBACH,MAEXzgF,MAAKq9E,UAAUtS,MAAM,SAASrgE,GAC1B,GAAKA,GAEDA,EAAImC,QAAUnC,EAAImB,kBAAoBnB,EAAImC,OAAOgG,OAAO7Y,OAAQ,CAChE,GAAI0mF,GAAM,SAASpkE,EAASkgD,GACxB,IAAK,GAAI1jC,GAAK,EAAGA,EAAK0jC,EAAYjgD,IAAIviB,SAAU8+B,EAC5C,GAAI0jC,EAAYjgD,IAAIuc,GAAImsB,aACpB,MAER,KAAK,GAAInxC,GAAKpJ,EAAImB,kBAAmBiI,EAAKpJ,EAAImC,OAAOgG,OAAO7Y,SAAU8Z,EAAI,CACtE,GAAIpa,GAAIgR,EAAImC,OAAOgG,OAAOiB,EAC1B0oD,GAAY7/C,IAAIjjB,EAAEkc,QAAS0G,EAAQ5iB,EAAEoD,QAI7CvB,GAASmlF,OAOrBtY,EAAiBzoE,UAAUqJ,cAAgB,SAASzN,GAGhDyE,KAAKq9E,UAAUtS,MAAM,SAASrgE,GAC1B,IAAKA,EACD,MAAOnP,GAAS,KAAM,YAG1B,IAAI0N,GAAa,GAAIxD,EACrB,IAAgB,UAAZiF,EAAIpG,KAAkB,CACtB,GAAI4E,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,OACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,UAAW,KAAM4E,GAE7CA,EAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,MACnBF,EAASG,OAAS,GAClBH,EAASM,MAAO,EAChBN,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,eAAgB,KAAM4E,EAElD,IAAIS,GAAU,GAAIjE,EAClBiE,GAAQR,MAAQ,MAChBQ,EAAQJ,QAAU,QAClBI,EAAQP,QAAU,QAClBO,EAAQN,OAAS,GACjBM,EAAQD,OAAS,GACjBC,EAAQH,MAAO,EACfG,EAAQF,OAAQ,EAChBR,EAAWK,WAAWhF,KAAM,cAAe,KAAMqF,EAEjD,IAAIC,GAAY,GAAIlE,EACpBkE,GAAUT,MAAQ,YAClBS,EAAUC,OAAS,QACnBD,EAAUE,OAAS,QACnBF,EAAUP,OAAO,GACjBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAMsF,OAC3C,CACH,GAAIV,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,YACjBD,EAASW,OAAS,QAClBX,EAASY,OAAS,QAClBZ,EAASG,OAAO,GAChBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,GAOlD,MAJ6B,KAAzBwB,EAAImB,mBAA2BnB,EAAIkB,YAAc,KACjD3C,EAAW03E,UAAW,GAGnBplF,EAAS0N,MAoBxBo/D,EAAuB1oE,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WAEnE0oE,EAAuB1oE,UAAU49B,KAAO,WACpC,GAAIz7B,GAAQ9B,KACRmpC,EAAMnpC,KAAKmpC,KAAOnpC,KAAKo9E,UAAUj0C,KAAOnpC,KAAKo9E,UAAUoB,OACvDxnE,EAAOhX,KAAKo9E,UAAUpmE,MAAQhX,KAAKo9E,UAAUqB,QAE7CvwE,EAAM,SAASE,EAAKuL,GACpB7X,EAAMouE,UAAY,KAClBpuE,EAAM6vE,kBAEFvjE,EACAtM,EAAMisB,OAAOkb,aAAaC,QAAS,OAAQ03C,WAAYxyE,GAAM,SAASyyE,EAAMlnE,GACpEA,GACA7X,EAAMwsB,MAAQ3U,EACd7X,EAAM27E,UAAU9T,QAAQ,QAExB7nE,EAAM++E,KAAOA,EACb/+E,EAAM27E,UAAU9T,QAAQv7D,OAIhCtM,EAAMwsB,MAAQ3U,EACd7X,EAAM27E,UAAU9T,QAAQ,OAI5B3yD,GACAhX,KAAK+tB,OAAOkb,aAAaC,QAAS,aAAclyB,KAAMA,GAAO9I,GAE7DlO,KAAK+tB,OAAOkb,aACRC,QAAS,aACTC,IAAKg1C,EAAiBh1C,GACtBvvB,SAAU5Z,KAAK09E,YACf7K,UAAW7yE,KAAKo9E,UAAUvK,UAC1Br5D,YAAaxZ,KAAKo9E,UAAU5jE,aAC9BtL,IAIVm6D,EAAuB1oE,UAAUq8C,aAAe,WAC5C,GAAIN,IAAQ14B,MAAM,EAIlB,IAFIhjB,KAAK6gF,MAA0B,UAAlB7gF,KAAK6gF,KAAKv8E,OACvBo3C,EAAKukC,WAAY,GACjBjgF,KAAK6gF,MAAQ7gF,KAAK6gF,KAAKb,cAAgBhgF,KAAK6gF,KAAKb,aAAahmF,OAAS,EAAG,CAC1E0hD,EAAK55B,SACL,KAAK,GAAIo+D,GAAM,EAAGA,EAAMlgF,KAAK6gF,KAAKb,aAAahmF,SAAUkmF,EACrDxkC,EAAK55B,OAAO5kB,KAAK8C,KAAK6gF,KAAKb,aAAaE,GAAKlzE,OAGrD,MAAO0uC,IAGX2sB,EAAuB1oE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GACjF,GAAIuG,GAAQ9B,IAEZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBAEN70D,KAAKy9E,UAAU1S,MAAM,SAAS38D,GAC1B,IAAKA,EAGD,MAFAtM,GAAM8yD,OACN9yD,EAAM+yD,iBACCt5D,EAASuG,EAAMwsB,OAAS,2BAA4B,KAAM,KAGrE,IAAI7Z,GAAO,GACP0rE,GAAezrB,GAA0B,IAAjBA,EAAM16D,QAAgB2rC,EAAa+uB,EAAO,YAAc,CAIpF,IAHI5yD,EAAML,KAAK2+E,YACXD,GAAc,GAEK,UAAnBr+E,EAAM++E,KAAKv8E,MAAoB67E,GAAqD,mBAA9Br+E,GAAML,KAAKopE,eAAiC,CAClG,IAAK,GAAIx2D,GAAI,EAAGA,EAAIvS,EAAM++E,KAAK30E,WAAWlS,QAClC8H,EAAM++E,KAAK30E,WAAWmI,IAAMkf,IADgBlf,EAE5CI,EAAOJ,EAAI,CAKsB,oBAA9BvS,GAAML,KAAKopE,iBAClBp2D,EAAO3S,EAAML,KAAKopE,gBAI1B/oE,EAAMisB,OAAOkb,aAAaC,QAAS,QAAS03C,WAAYxyE,EAAK5M,IAAKA,EAAK7D,IAAKA,EAAKmC,IAAKA,EAAK2U,KAAMA,GAAO,SAASxD,EAAUqd,GACvHxsB,EAAM8yD,OACN9yD,EAAM+yD,gBAEN,IAAIuc,GAAK,GACT,IAAwB,WAApBtvE,EAAM++E,KAAKv8E,KAAmB,CAC9B,GAAIg8E,IAAMxgF,EAAMnC,GAAOsT,EAASjX,OAAS,CAChCo3E,GAALkP,IACAlP,EAAKkP,GAGb,GAAIx+E,EAAML,KAAK8+E,KACX,IAAK,GAAIzsE,GAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,EACbpa,GAAEgN,QACFhN,EAAE87C,OAAS,GAAItB,GAAQ,OAAQpyC,EAAML,KAAK8+E,KAAKxiF,QAAQ,OAAQrE,EAAEgN,UAI7EnL,EAAS+yB,EAAOrd,EAAUmgE,QAMtC/I,EAAuB1oE,UAAU0yE,qBAAuB,SAAS7wE,EAAKsB,EAAKuQ,EAAKyB,EAAWvZ,GACvF,GAAIuG,GAAQ9B,IACZA,MAAK40D,OACL50D,KAAK60D,iBACL70D,KAAK+tB,OAAOkb,aAAaC,QAAS,YAAa03C,WAAY5gF,KAAKy9E,UAAUrlE,IAAK5W,IAAKA,EAAKsB,IAAKA,EAAKuQ,IAAKA,EAAKyB,UAAWA,EAAWgsE,OAAO,GAAQ,SAASjjF,EAAQ8b,GAI/J,MAHAnK,SAAQC,IAAI5R,EAAQ8b,GACpB7X,EAAM8yD,OACN9yD,EAAM+yD,iBACCt5D,EAASsC,EAAQ8b,MAIhC0uD,EAAuB1oE,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK9X,GACvE,GAAIuG,GAAQ9B,IACZA,MAAK40D,OACL50D,KAAK60D,iBACL70D,KAAK+tB,OAAOkb,aAAaC,QAAS,OAAQ03C,WAAY5gF,KAAKy9E,UAAUrlE,IAAK5W,IAAKA,EAAKsB,IAAKA,EAAKuQ,IAAKA,GAAM,SAASxV,EAAQ8b,GACtH7X,EAAM8yD,OACN9yD,EAAM+yD,iBACFh3D,EAAO7D,OAAS,GAAmB,OAAd6D,EAAO,IAC5BtC,EAASsC,EAAO,OAK5BwqE,EAAuB1oE,UAAU80D,UAAY,WACzC,GAAIosB,GAAO7gF,KAAK6gF,IAChB,OAAIA,GACOA,EAAK30E,WAEL,MAIfm8D,EAAuB1oE,UAAUmiB,OAAS,SAASuzC,EAAO95D,GACtD,IAAKyE,KAAK6gF,KAAKb,cAAkD,IAAlChgF,KAAK6gF,KAAKb,aAAahmF,OAClD,MAAOuB,GAAS,KAAM,uBAG1B,IAAIuG,GAAQ9B,IACZA,MAAK40D,OACL50D,KAAK60D,gBACL,IAAI90D,GAAQC,KAAK6gF,KAAKb,aAAa,EACnChgF,MAAK+tB,OAAOkb,aAAaC,QAAS,SAAU03C,WAAY5gF,KAAKy9E,UAAUrlE,IAAKi9C,MAAOA,EAAOt1D,MAAOA,GAAQ,SAASlC,EAAQ8b,GACtH7X,EAAM8yD,OACN9yD,EAAM+yD,iBAENt5D,EAASsC,EAAQ8b,MAIzB0uD,EAAuB1oE,UAAU0tE,eAAiB,SAAS9xE,GACvD,GAAIyE,KAAKyB,KAAKg/E,mBACV,OAAO,CAEX,IAAI3+E,GAAQ9B,IACZA,MAAKy9E,UAAU1S,MAAM,SAAS38D,GAC1B,GAAI1D,GAAM5I,EAAM++E,IAChB,IAAKn2E,GAEDA,EAAImC,QAAUnC,EAAImB,kBAAoBnB,EAAImC,OAAOgG,OAAO7Y,OAAQ,CAChE,GAAI0mF,GAAM,SAASpkE,EAASkgD,GACxB,IAAK,GAAI1jC,GAAK,EAAGA,EAAK0jC,EAAYjgD,IAAIviB,SAAU8+B,EAC5C,GAAI0jC,EAAYjgD,IAAIuc,GAAImsB,aACpB,MAER,KAAK,GAAInxC,GAAKpJ,EAAImB,kBAAmBiI,EAAKpJ,EAAImC,OAAOgG,OAAO7Y,SAAU8Z,EAAI,CACtE,GAAIpa,GAAIgR,EAAImC,OAAOgG,OAAOiB,EAC1B0oD,GAAY7/C,IAAIjjB,EAAEkc,QAAS0G,EAAQ5iB,EAAEoD,QAI7CvB,GAASmlF,OAOrBrY,EAAuB1oE,UAAUqJ,cAAgB,SAASzN,GACtD,GAAIuG,GAAQ9B,IAEZA,MAAKy9E,UAAU1S,MAAM,SAAS38D,GAC1B,GAAI1D,GAAM5I,EAAM++E,IAChB,KAAKn2E,EACD,MAAOnP,GAAS,KAAM,YAG1B,IAAI0N,GAAa,GAAIxD,EACrB,IAAgB,UAAZiF,EAAIpG,KAAkB,CACtB,GAAI4E,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,OACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,UAAW,KAAM4E,GAE7CA,EAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,MACnBF,EAASG,OAAS,GAClBH,EAASM,MAAO,EAChBN,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,eAAgB,KAAM4E,EAElD,IAAIS,GAAU,GAAIjE,EAClBiE,GAAQR,MAAQ,MAChBQ,EAAQJ,QAAU,QAClBI,EAAQP,QAAU,QAClBO,EAAQN,OAAS,GACjBM,EAAQD,OAAS,GACjBC,EAAQH,MAAO,EACfG,EAAQF,OAAQ,EAChBR,EAAWK,WAAWhF,KAAM,cAAe,KAAMqF,EAEjD,IAAIC,GAAY,GAAIlE,EACpBkE,GAAUT,MAAQ,YAClBS,EAAUC,OAAS,QACnBD,EAAUE,OAAS,QACnBF,EAAUP,OAAO,GACjBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAMsF,OAC3C,CACH,GAAIV,GAAW,GAAIxD,EACnBwD,GAASC,MAAQ,YACjBD,EAASW,OAAS,QAClBX,EAASY,OAAS,QAClBZ,EAASG,OAAO,GAChBJ,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,GAQlD,MAJ6B,KAAzBwB,EAAImB,mBAA2BnB,EAAIkB,YAAc,KACjD3C,EAAW03E,UAAW,GAGnBplF,EAAS0N,MAsFxBq/D,EAAiB3oE,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WAE7D2oE,EAAiB3oE,UAAU49B,KAAO,WAC9B,GACIwjD,GAAMC,EADNl/E,EAAQ9B,IAERA,MAAK69E,UAAUc,SACfoC,EAAO,GAAIhqE,GAAc/W,KAAK69E,UAAUc,SACxCqC,EAAO,GAAIjqE,GAAc/W,KAAK69E,UAAUoD,WAExCF,EAAO,GAAI9pE,GAAajX,KAAK69E,UAAUa,QAASllE,YAAaxZ,KAAKyB,KAAK+X,YAAaI,SAAU5Z,KAAKyB,KAAKmY,WACxGonE,EAAO,GAAI/pE,GAAajX,KAAK69E,UAAUqD,QAAWlhF,KAAK69E,UAAUa,OAAS,QACjDllE,YAAaxZ,KAAKyB,KAAK+X,YAAaI,SAAU5Z,KAAKyB,KAAKmY,YAErFze,EAAQ4lF,EAAMC,EAAM,KAAM,SAAStkF,EAAKid,GACpC7X,EAAMouE,UAAY,KAClBpuE,EAAM6vE,kBAEFj1E,EACAoF,EAAMi8E,UAAUpU,QAAQjtE,IAExBoF,EAAMwsB,MAAQ3U,EACd7X,EAAMi8E,UAAUpU,QAAQ,UAKpCrB,EAAiB3oE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GAC3E,GAAIiI,GAAQkxD,GAA0B,GAAhBA,EAAM16D,QAA6B,WAAZ06D,EAAM,GAE/C5yD,EAAQ9B,IAEZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBAEN70D,KAAK+9E,UAAUhT,MAAM,SAASruE,GAC1B,MAAKA,OAMLA,GAAIhB,MAAM8F,EAAK7D,EAAKmC,EAAK,SAASqhF,EAAY7yD,GAI1C,GAHAxsB,EAAM8yD,OACN9yD,EAAM+yD,iBAEFvmC,EACA/yB,EAAS+yB,EAAO,KAAM,UACnB,CAEH,IAAK,GADDrd,MACKmwE,EAAK,EAAGA,EAAKD,EAAWnnF,SAAUonF,EAAI,CAC3C,GAAIjoF,GAAIgoF,EAAWC,GAEf1nF,EAAIikF,EAAmBxkF,EAAG2I,EAAML,KAAKq8E,SACrCpkF,IACAuX,EAAS/T,KAAKxD,GAEtB6B,EAAS,KAAM0V,EAAU,QAE7BzN,MAAOA,KAtBP1B,EAAM8yD,OACN9yD,EAAM+yD,iBACCt5D,EAASuG,EAAMwsB,OAAS,0BAwB3Cg6C,EAAiB3oE,UAAU80D,UAAY,WACnC,MAAO,MAGX6T,EAAiB3oE,UAAUqJ,cAAgB,SAASzN,GAChDyE,KAAK+9E,UAAUhT,MAAM,SAASruE,GAC1B,GAAIuM,GAAa,GAAIxD,GAEjBmE,EAAY,GAAIlE,EACpBkE,GAAUT,MAAQ,YAClBS,EAAUC,OAAS,QACnBD,EAAUE,OAAS,MACnBF,EAAUP,OAAO,GACjBJ,EAAWK,WAAWhF,KAAM,WAAY,MAAOsF,GAC/CX,EAAWK,WAAWhF,KAAM,WAAY,SAAUsF,EAElD,IAAIV,GAAW,GAAIxD,EAUnB,OATAwD,GAASC,MAAQ,aACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,OACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,OAAQ,OAAQ4E,GAErC3N,EAAS0N,MAqBxBs/D,EAAuB5oE,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WAEnE4oE,EAAuB5oE,UAAU49B,KAAO,WAAgB,GAAIz7B,GAAQ9B,KAC5DmpC,EAAMnpC,KAAK69E,UAAU10C,KAAOnpC,KAAK69E,UAAUa,OAC3C2C,EAAWrhF,KAAK69E,UAAUwD,UAAYrhF,KAAK69E,UAAUqD,QAAU/3C,EAAM,OAErEnyB,EAAOhX,KAAK69E,UAAUc,SAAW3+E,KAAK69E,UAAU7mE,KAChDsqE,EAAYthF,KAAK69E,UAAUoD,SAAWjhF,KAAK69E,UAAUyD,UAErDpzE,EAAM,SAASrQ,EAAQ8b,GACvB7X,EAAMouE,UAAY,KAClBpuE,EAAM6vE,kBAEF9zE,EACAiE,EAAM27E,UAAU9T,QAAQ9rE,IAExBiE,EAAMwsB,MAAQ3U,EACd7X,EAAM27E,UAAU9T,QAAQ,OAI5B3yD,GACAhX,KAAK+tB,OAAOkb,aAAaC,QAAS,aAAclyB,KAAMA,EAAMsqE,UAAWA,GAAYpzE,GAEnFlO,KAAK+tB,OAAOkb,aACRC,QAAS,aACTC,IAAKg1C,EAAiBh1C,GACtBvvB,SAAU5Z,KAAK09E,YACf2D,SAAUlD,EAAiBkD,GAC3B7nE,YAAaxZ,KAAK69E,UAAUrkE,YAC5Ble,YAAa0E,KAAK69E,UAAUviF,aAC9B4S,IAIVq6D,EAAuB5oE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GACjF,GAAIiI,GAAQkxD,GAA0B,GAAhBA,EAAM16D,QAA6B,WAAZ06D,EAAM,GAC/C5yD,EAAQ9B,IAEZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBAEN70D,KAAKy9E,UAAU1S,MAAM,SAAS38D,GAC1B,MAAKA,OAMLtM,GAAMisB,OAAOkb,aAAaC,QAAS,QAAS03C,WAAYxyE,EAAK5M,IAAKA,EAAK7D,IAAKA,EAAKmC,IAAKA,EAAK2B,MAAO+B,MAAOA,IAAS,SAAS29E,EAAY7yD,GAMnI,GAHAxsB,EAAM8yD,OACN9yD,EAAM+yD,iBAEFvmC,EACA/yB,EAAS+yB,EAAO,KAAM,UACnB,CAEH,IAAK,GADDrd,MACKmwE,EAAK,EAAGA,EAAKD,EAAWnnF,SAAUonF,EAAI,CAC3C,GAAIjoF,GAAIgoF,EAAWC,GACf1nF,EAAIikF,EAAmBxkF,EAAG2I,EAAML,KAAKq8E,SACrCpkF,IACAuX,EAAS/T,KAAKxD,GAEtB6B,EAAS,KAAM0V,EAAU,SArB7BnP,EAAM8yD,OACN9yD,EAAM+yD,iBACCt5D,EAASuG,EAAMwsB,OAAS,0BAyB3Ci6C,EAAuB5oE,UAAU80D,UAAY,WACzC,MAAO,MAGX8T,EAAuB5oE,UAAUqJ,cAAgB,SAASzN,GACtDyE,KAAKy9E,UAAU1S,MAAM,SAASruE,GAC1B,GAAIuM,GAAa,GAAIxD,GAEjBmE,EAAY,GAAIlE,EACpBkE,GAAUT,MAAQ,YAClBS,EAAUC,OAAS,QACnBD,EAAUE,OAAS,MACnBF,EAAUP,OAAO,GACjBJ,EAAWK,WAAWhF,KAAM,WAAY,MAAOsF,GAC/CX,EAAWK,WAAWhF,KAAM,WAAY,SAAUsF,EAElD,IAAIV,GAAW,GAAIxD,EASnB,OARAwD,GAASC,MAAQ,aACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,OACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,OAAQ,OAAQ4E,GACrC3N,EAAS0N,MAaxBi/D,EAAoBvoE,UAAU4xE,oBAAsB,SAASQ,GACzD/xE,KAAK8vE,kBAAkB5yE,KAAK60E,IAGhC7J,EAAoBvoE,UAAUmyE,uBAAyB,SAASC,GAC5D,GAAIrsC,GAAMC,EAAa3lC,KAAK8vE,kBAAmBiC,EAC3CrsC,IAAO,GACP1lC,KAAK8vE,kBAAkBx+D,OAAOo0B,EAAK,IAG3CwiC,EAAoBvoE,UAAUk1D,eAAiB,WAC3C,IAAK,GAAI8X,GAAK,EAAGA,EAAK3sE,KAAK8vE,kBAAkB91E,SAAU2yE,EACnD,IACI3sE,KAAK8vE,kBAAkBnD,GAAI3sE,KAAK40D,MAClC,MAAO57D,GACLwW,QAAQC,IAAIzW,KAKxBkvE,EAAoBvoE,UAAUqJ,cAAgB,SAASzN,GACnD,MAAOyE,MAAK23B,OAAO3uB,cAAczN,IAGrC2sE,EAAoBvoE,UAAU80D,UAAY,WACtC,MAAOz0D,MAAK23B,OAAO88B,aAGvByT,EAAoBvoE,UAAU0tE,eAAiB,SAAS9xE,GACpD,MAAIyE,MAAK23B,OAAO01C,eACLrtE,KAAK23B,OAAO01C,eAAe9xE,GADtC,QAIJ2sE,EAAoBvoE,UAAU4hF,iBAAmB,SAASjqC,EAAMkqC,GAC5D,GAAoB,IAAhBlqC,EAAKt9C,OAAc,MAAOs9C,EAE9BA,GAAKt2C,KAAK,SAASygF,EAAIC,GACnB,GAAIxsE,GAAIusE,EAAG3kF,KAAO4kF,EAAG5kF,IACrB,OAAIoY,GACOA,GACXA,EAAIusE,EAAGl7E,MAAQm7E,EAAGn7E,MACd2O,EACOA,EACJusE,EAAGh7E,IAAMi7E,EAAGj7E,MAKvB,KAAK,GAFDk7E,MACAC,EAAatqC,EAAK,GACbvhB,EAAK,EAAGA,EAAKuhB,EAAKt9C,SAAU+7B,EAAI,CACrC,GAAIzd,GAAKg/B,EAAKvhB,EAGVzd,GAAGxb,MAAQ8kF,EAAW9kF,MAAQwb,EAAG/R,MAASq7E,EAAWn7E,IAAM+6E,GAC3DG,EAAMzkF,KAAK0kF,GACXA,EAAatpE,GAEbspE,EAAa,GAAI50C,GAAW40C,EAAW9kF,KAAMY,KAAKC,IAAIikF,EAAWr7E,MAAO+R,EAAG/R,OAAQ7I,KAAKoC,IAAI8hF,EAAWn7E,IAAK6R,EAAG7R,MAIvH,MADAk7E,GAAMzkF,KAAK0kF,GACJD,GAGXzZ,EAAoBvoE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,EAAU0uE,GACxF,GAAInoE,GAAQ9B,KACR6hF,EAAc/hF,EAAMnC,EAAM,CAE9BmE,GAAM8yD,OACN9yD,EAAM+yD,iBAEN70D,KAAKktB,QAAQihB,qBAAqB3sC,EAAK7D,EAAKmC,EAAK,SAASgiF,GACtD,GAAoB,IAAhBA,EAAK9nF,OACL8H,EAAM8yD,OACN9yD,EAAM+yD,iBAENt5D,EAAS,2CAA6Cg4B,OACnD,CACHuuD,EAAOhgF,EAAMy/E,iBAAiBO,EAAMpkF,KAAKoC,IAAI,IAAK,IAAO+hF,GAEzD,IAGIE,GAHAC,KACAC,EAAY,KACZ/wC,EAAQ4wC,EAAK9nF,MAGjB8nF,GAAKz6E,IAAI,SAASg5B,GACdv+B,EAAM61B,OAAOj8B,MAAM2kC,EAAIvjC,KAAMujC,EAAI95B,MAAO85B,EAAI55B,IAAK8sB,EAAOmhC,EAAOC,EAAM,SAASr7C,EAAQrI,EAAUixE,GAI5F,GAHI5oE,IAAWyoE,IACXA,EAAczoE,GAEdrI,EACA,IAAK,GAAI6C,GAAK,EAAGA,EAAK7C,EAASjX,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIuX,EAAS6C,GACbsgE,EAAK16E,EAAE6J,OACe,KAAtB6wE,EAAGp3E,QAAQ,SACXo3E,EAAKA,EAAG5lE,OAAO,GAGnB,IAAIq/B,GAAW/rC,EAAMorB,QAAQ0gB,WAAWwmC,EAAI16E,EAAEiE,IAAKjE,EAAEoG,IAErD,IAAwB,IAApB+tC,EAAS7zC,OACLN,EAAE+/C,OAAS//C,EAAE+/C,MAAMz/C,OAAS,GAC3BgoF,EAAe9kF,KAAKxD,OAGzB,KAAK,GAAIyoF,GAAK,EAAGA,EAAKt0C,EAAS7zC,SAAUmoF,EAAI,CACzC,GAAIr5E,GAAI+kC,EAASs0C,GACbhR,EAAKrrE,EAAYpM,EACrBy3E,GAAG5tE,QAAUuF,EAAEvF,QACf4tE,EAAGxzE,IAAMmL,EAAEnL,IACXwzE,EAAGrxE,IAAMgJ,EAAEhJ,IACPgJ,EAAEmlC,aACFkjC,EAAGljC,WAAanlC,EAAEmlC,YAClBnlC,EAAEklC,aACFmjC,EAAGnjC,WAAallC,EAAEklC,YAElBllC,EAAE6kC,UACmB,KAAjBj0C,EAAEmN,YACFsqE,EAAGtqE,YAAc,IACO,KAAjBnN,EAAEmN,cACTsqE,EAAGtqE,YAAc,MAGzBm7E,EAAe9kF,KAAKi0E,IAMpC,GAAIiR,GAAKtgF,EAAMorB,QAAQigB,SAAS9M,EAAIvjC,KAAMujC,EAAI95B,OAC1C87E,EAAKvgF,EAAMorB,QAAQigB,SAAS9M,EAAIvjC,KAAMujC,EAAI55B,IAE9C,IAAI27E,GAAMC,EAAI,CACV,GAAIC,GAAkB,GAAIlkF,GAAMgkF,EAAGt/E,IAAKu/E,EAAGv/E,IAEvCm/E,GADAA,EACY5jF,EAAM4jF,EAAWK,GAEjBA,IAGlBpxC,EACY,IAAVA,IACApvC,EAAM8yD,OACN9yD,EAAM+yD,iBACNt5D,EAASwmF,EAAaC,EAAgBE,EAAQD,KAEnDhY,SASnBzB,EAAmB7oE,UAAU80D,UAAY,WACrC,MAAO,OAGX+T,EAAmB7oE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMzmD,GAC7E,MAAOA,GAAI,QAAU,MAGzBs6D,EAAmB7oE,UAAUqJ,cAAgB,SAASzN,GAClD,GAAI0N,GAAa,GAAIxD,GACjB05E,EAAW,GAAIz5E,EAKnB,OAJAy5E,GAASh2E,MAAQ,MACjBg2E,EAAS/1E,QAAU,OACnB+1E,EAAS51E,QAAU,QACnBN,EAAWK,WAAWhF,KAAM,WAAY,KAAM66E,GACvC5jF,EAAS0N,IAMpB0+D,EAAoBhoE,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAK60D,EAAMzmD,GAChE,MAAOA,GAAI,KAAM,OAOrB8vE,EAAqBr+E,UAAU80D,UAAY,WACvC,MAAO,OAGXupB,EAAqBr+E,UAAUqJ,cAAgB,SAASzN,GACpD,GAAI0N,GAAa,GAAIxD,GAEjB8uD,EAAW,GAAI7uD,EACnB6uD,GAASprD,MAAQ,MACjBorD,EAAShrD,QAAU,QACnBgrD,EAASnrD,QAAU,MACnBmrD,EAASlrD,OAAS,GAClBkrD,EAAS/qD,MAAO,EAChB+qD,EAAS7qD,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,eAAgB,KAAMiwD,EAElD,IAAI5qD,GAAU,GAAIjE,EAClBiE,GAAQR,MAAQ,MAChBQ,EAAQJ,QAAU,QAClBI,EAAQP,QAAU,QAClBO,EAAQN,OAAS,GACjBM,EAAQD,OAAS,GACjBC,EAAQH,MAAO,EACfG,EAAQF,OAAQ,EAChBR,EAAWK,WAAWhF,KAAM,cAAe,KAAMqF,EAEjD,IAAIT,GAAW,GAAIxD,EAUnB,OATAwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAU,QACnBF,EAASG,OAAS,EAClBH,EAASM,MAAO,EAChBN,EAASO,OAAQ,EACjBP,EAASQ,OAAS,GAClBT,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,GAEvC3N,EAAS0N,IAGpB+0E,EAAqBr+E,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GAC/E,GAAIm5D,GAA0B,IAAjBA,EAAM16D,OAEf,WADAuB,GAAS,QAAUg4B,EAIvB,IAAIisD,KAEJx/E,MAAKwsE,MAAMv7D,SACP,GAAI+7B,GAAWxrC,EAAK7D,EAAKmC,GACzB0/E,EACA,SAASvuE,EAAUqI,GACf/d,EAAS+d,EAAQrI,EAAU,QAKvCiK,EAAQvb,UAAU0jB,uBAAyB,SAASjqB,EAAGk4E,GACnD,MAAKl4E,GAAE4iD,aAEK5iD,EAAE4iD,eAAes1B,IADlB,GAIQ,mBAAZp3E,KACPA,EAAOJ,SACHm6D,kBAAmBA,EAEnB7wB,qBAAsBA,EACtBE,sBAAuBA,EACvBC,kBAAmBA,EACnB2kC,oBAAqBA,EACrBC,qBAAsBA,EACtBC,iBAAkBA,EAClBC,uBAAwBA,EACxBC,iBAAkBA,EAClBC,uBAAwBA,EACxBC,mBAAoBA,EACpBb,oBAAqBA,EAErBtT,6BAA8BD,EAC9B7uD,sBAAuBD,EACvBy0D,WAAYD,GAIhBtgE,EAAQ,iBAERA,EAAQ,kBAERA,EAAQ,kBACRA,EAAQ,cACRA,EAAQ,YACRA,EAAQ,SACRA,EAAQ,oBtC6ndT45E,QAAQ,EAAEmP,WAAW,EAAE3xC,WAAW,EAAEhsC,QAAQ,EAAE8hB,aAAa,EAAEijB,aAAa,EAAEkH,UAAU,EAAE9mC,QAAQ,GAAGspE,WAAW,GAAGmP,gBAAgB,GAAGC,WAAW,GAAGC,aAAa,GAAGC,iBAAiB,GAAG3X,YAAY,GAAGlmE,UAAU,GAAG89E,UAAU,GAAGC,iBAAiB,GAAGC,gBAAgB,GAAGx4C,SAAS,GAAGy4C,WAAW,GAAG94E,UAAU,GAAG+4E,QAAQ,KAAKC,IAAI,SAASzpF,EAAQU,EAAOJ,GACzV,YuCv2gBA,SAASk2B,GAAcwS,GACnB,MAAIA,GAAK2G,IACE3G,EAAK2G,IACL3G,EAAKxrB,KACL,QAAUwrB,EAAKxrB,KAAKla,KACpB0lC,EAAKi8C,QACL,QAAUj8C,EAAKi8C,QAAQ3hF,KACvB0lC,EAAKm8C,QACL,QAAUn8C,EAAKm8C,QAAQ7hF,KACvB0lC,EAAKW,WACL,QAAUX,EAAKW,WAAWrmC,KAG9B0lC,EAAKg8C,QAAUh8C,EAAKk8C,QAAUl8C,EAAKy7C,OAASz7C,EAAKU,WAAa,4CAGzE,QAASjT,GAAeuS,GACpB,MAAIA,GAAKmY,eACEnY,EAAKmY,eACW,YAAlBnY,EAAKS,WAA2BT,EAAKU,WAAaV,EAAKW,WACrD,8CAEAnT,EAAcwS,GAG7B,QAASzS,GAA2Bx2B,EAAGmB,GACnC,GAAIs1B,EAAcz2B,IAAMy2B,EAAct1B,GAClC,OAAO,CAEX,IAAInB,EAAE2zB,SAAWxyB,EAAEwyB,QACf,OAAO,CAEX,IAAI3zB,EAAE0pC,WAAavoC,EAAEuoC,UACjB,OAAO,CAEX,IAAI1pC,EAAEmrC,QAAS,CACX,IAAKhqC,EAAEgqC,SAAWhqC,EAAEgqC,QAAQ1qC,QAAUT,EAAEmrC,QAAQ1qC,OAC5C,OAAO,CACX,KAAK,GAAI+/C,GAAK,EAAGA,EAAKxgD,EAAEmrC,QAAQ1qC,SAAU+/C,EACtC,IAAKhqB,EAA2Bx2B,EAAEmrC,QAAQqV,GAAKr/C,EAAEgqC,QAAQqV,IACrD,OAAO,MAGf,IAAIr/C,EAAEgqC,QACF,OAAO,CAGf,QAAO,EAGX,QAAS5U,GAAgBv2B,EAAGmB,GACxB,GAAIs1B,EAAcz2B,IAAMy2B,EAAct1B,IAClCu1B,EAAe12B,IAAM02B,EAAev1B,GACpC,OAAO,CAEX,IAAInB,EAAE2zB,SAAWxyB,EAAEwyB,QACf,OAAO,CAEX,IAAI3zB,EAAE0pC,WAAavoC,EAAEuoC,UACjB,OAAO,CAEX,IAAI1pC,EAAEmrC,QAAS,CACX,IAAKhqC,EAAEgqC,SAAWhqC,EAAEgqC,QAAQ1qC,QAAUT,EAAEmrC,QAAQ1qC,OAC5C,OAAO,CACX,KAAK,GAAI+/C,GAAK,EAAGA,EAAKxgD,EAAEmrC,QAAQ1qC,SAAU+/C,EACtC,IAAKjqB,EAAgBv2B,EAAEmrC,QAAQqV,GAAKr/C,EAAEgqC,QAAQqV,IAC1C,OAAO,MAGf,IAAIr/C,EAAEgqC,QACF,OAAO,CAGf,QAAO,EAGY,mBAAZxqC,KACPA,EAAOJ,SACHg2B,gBAAiBA,EACjBC,2BAA4BA,EAC5BC,cAAeA,EACfC,eAAgBA,SvCq2gBlBizD,IAAI,SAAS1pF,EAAQU,EAAOJ,GwCv7gBlC,YAGA,SAASsE,GAAMT,EAAKmC,GAEhB,GAAmB,gBAARnC,IAAmC,gBAARmC,GAClC,KAAM,aAAenC,EAAM,IAAMmC,CACrCE,MAAKsvC,KAAO3xC,EACZqC,KAAKuvC,KAAOzvC,EA+BhB,QAASqjF,GAAUh7E,GAGf,GAAIi7E,GAASj7E,EAAOnH,KAAKqiF,GAErBC,KACA7iE,EAAU2iE,EAAOG,OACrBH,GAAOxnE,QAAQ,SAAS8pC,GAChBA,EAAMpW,MAAQ7uB,EAAQ8uB,KAClBmW,EAAMnW,KAAO9uB,EAAQ8uB,OACrB9uB,EAAQ8uB,KAAOmW,EAAMnW,OAIzB+zC,EAAOpmF,KAAKujB,GACZA,EAAUilC,KAGlB49B,EAAOpmF,KAAKujB,GACZzgB,KAAKwjF,QAAUF,EA8FnB,QAASjlF,GAAM4zE,EAAIwP,GAUf,MATOxP,aAAckR,KACVlR,YAAcx8B,SACjBw8B,GAAMA,IACVA,EAAK,GAAIkR,GAAUlR,IAGnBwP,GACAxP,EAAGwR,YAAYhC,GAEZxP,EAGX,QAAS3zE,GAAa2zE,EAAIwP,GAOtB,IANA,GAAIiC,GAAKzR,EAAG9pE,SACRw7E,EAAKlC,EAAGt5E,SACRy7E,EAAKF,EAAG1pF,OAAQ6pF,EAAKF,EAAG3pF,OACxB8pF,EAAK,EAAGC,EAAK,EACbC,KAEQJ,EAALE,GAAgBD,EAALE,GAAS,CACvB,GAAI9R,GAAKyR,EAAGI,GAAKrC,EAAKkC,EAAGI,GACrBE,EAASvmF,KAAKoC,IAAImyE,EAAGt0E,MAAO8jF,EAAG9jF,OAC/BumF,EAASxmF,KAAKC,IAAIs0E,EAAGnyE,MAAO2hF,EAAG3hF,MAC/BokF,IAAUD,GACVD,EAAG9mF,KAAK,GAAIkB,GAAM6lF,EAAQC,IAE1BjS,EAAGnyE,MAAQ2hF,EAAG3hF,QACZikF,IAEAD,EAIV,MAAiB,IAAbE,EAAGhqF,OACI,KACa,GAAbgqF,EAAGhqF,OACHgqF,EAAG,GAEH,GAAIb,GAAUa,GAI7B,QAAS3kB,GAASjmE,GAGd,IAAK,GAFD46E,GAAM,EACNuG,EAAKnhF,EAAE+O,SACFi5E,EAAK,EAAGA,EAAK7G,EAAGvgF,SAAUonF,EAAI,CACnC,GAAIjoF,GAAIohF,EAAG6G,EACXpN,IAAQ76E,EAAE2G,MAAQ3G,EAAEwE,MAAQ,EAEhC,MAAOq2E,GAKX,QAASmQ,GAAW5qF,EAAGmB,GAEnB,MAAInB,GAAEoE,MAAQjD,EAAEiD,MACL,GACApE,EAAEoE,MAAQjD,EAAEiD,MACZ,EACApE,EAAEuG,MAAQpF,EAAEoF,MACZ,GACApF,EAAEoF,MAAQvG,EAAEuG,MACZ,EAEA,EAIf,QAASujF,GAAY9pF,EAAGmB,GAEpB,MAAInB,GAAE+1C,KAAO50C,EAAE40C,KACJ,GACA/1C,EAAE+1C,KAAO50C,EAAE40C,KACX,EACA/1C,EAAEg2C,KAAO70C,EAAE60C,KACX,GACA70C,EAAE60C,KAAOh2C,EAAEg2C,KACX,EAEA,EA9NfnxC,EAAMuB,UAAUhC,IAAM,WAClB,MAAOqC,MAAKsvC,MAGhBlxC,EAAMuB,UAAUG,IAAM,WAClB,MAAOE,MAAKuvC,MAGhBnxC,EAAMuB,UAAUyQ,SAAW,SAAStN,GAChC,MAAOA,IAAO9C,KAAKsvC,MAAQxsC,GAAO9C,KAAKuvC,MAG3CnxC,EAAMuB,UAAUykF,aAAe,WAC3B,OAAO,GAGXhmF,EAAMuB,UAAUwI,OAAS,WACrB,OAAQnI,OAGZ5B,EAAMuB,UAAU0kF,YAAc,SAASl8E,GACnCA,EAAOjL,KAAK8C,OAGhB5B,EAAMuB,UAAUtD,SAAW,WACvB,MAAO,IAAM2D,KAAKsvC,KAAO,IAAMtvC,KAAKuvC,KAAO,KAyB/C4zC,EAAUxjF,UAAUhC,IAAM,WACtB,MAAOqC,MAAKwjF,QAAQ,GAAG7lF,OAG3BwlF,EAAUxjF,UAAUG,IAAM,WACtB,MAAOE,MAAKwjF,QAAQxjF,KAAKwjF,QAAQxpF,OAAS,GAAG8F,OAIjDqjF,EAAUxjF,UAAU2kF,YAAc,SAASxhF,GAEvC,GAAI3J,GAAI6G,KAAKmI,QACb,IAAIrF,EAAM9C,KAAKF,MAAO,MAAO3G,GAAEa,MAC/B,IAAI8I,EAAM9C,KAAKrC,MAAO,MAAO,EAG7B,KADA,GAAIpE,GAAE,EAAGmB,EAAEvB,EAAEa,OAAS,EACVU,GAALnB,GAAQ,CACX,GAAIuP,GAAIpL,KAAK6mF,OAAOhrF,EAAEmB,GAAG,EACzB,IAAIoI,EAAM3J,EAAE2P,GAAGymC,KACXh2C,EAAIuP,EAAE,MAEL,CAAA,KAAIhG,EAAM3J,EAAE2P,GAAGwmC,MAIhB,MAAOxmC,EAHPpO,GAAIoO,EAAE,GAMd,MAAOvP,IAGX4pF,EAAUxjF,UAAUyQ,SAAW,SAAStN,GACpC,GAAInC,GAAKX,KAAKskF,YAAYxhF,EAC1B,OAAInC,GAAKX,KAAKwjF,QAAQxpF,QAAUgG,KAAKwjF,QAAQ7iF,GAAIyP,SAAStN,IAC/C,GAEJ,GAGXqgF,EAAUxjF,UAAU8jF,YAAc,SAAS/9B,GACvC,GAAI/kD,GAAKX,KAAKskF,YAAY5+B,EAAMpW,KAChC,IAAI3uC,IAAOX,KAAKwjF,QAAQxpF,OAEpB,WADAgG,MAAKwjF,QAAQtmF,KAAKwoD,EAItB,IAAIvsD,GAAI6G,KAAKmI,QACb,IAAIu9C,EAAMnW,KAAOp2C,EAAEwH,GAAI2uC,KAEnB,WADAtvC,MAAKwjF,QAAQlyE,OAAO3Q,EAAG,EAAE+kD,EAKzBvsD,GAAEwH,GAAI2uC,KAAOoW,EAAMpW,OAAMoW,EAAMpW,KAAOn2C,EAAEwH,GAAI2uC,KAEhD,KADA,GAAIirB,GAAK55D,EAAG,EACL45D,EAAKphE,EAAEa,QAAUb,EAAEohE,GAAIjrB,MAAQoW,EAAMnW,MACxCgrB,GAEJA,KAEIphE,EAAEohE,GAAIhrB,KAAOmW,EAAMnW,OAAMmW,EAAMnW,KAAOp2C,EAAEohE,GAAIhrB,MAGhDvvC,KAAKwjF,QAAQlyE,OAAO3Q,EAAG45D,EAAG55D,EAAG,EAAE+kD,IAInCy9B,EAAUxjF,UAAUykF,aAAe,WAC/B,MAAOpkF,MAAKwjF,QAAQxpF,OAAS,GAGjCmpF,EAAUxjF,UAAUwI,OAAS,WACzB,MAAOnI,MAAKwjF,SAGhBL,EAAUxjF,UAAU0kF,YAAc,SAASl8E,GACvC,IAAK,GAAIi5E,GAAK,EAAGA,EAAKphF,KAAKwjF,QAAQxpF,SAAUonF,EACzCj5E,EAAOjL,KAAK8C,KAAKwjF,QAAQpC,KAGjC+B,EAAUxjF,UAAUtD,SAAW,WAE3B,IAAK,GADDjD,GAAI,GACCD,EAAI,EAAGA,EAAI6G,KAAKwjF,QAAQxpF,SAAUb,EACnCA,EAAE,IACFC,GAAQ,KAEZA,GAAQ4G,KAAKwjF,QAAQrqF,GAAGkD,UAE5B,OAAOjD,IAwFY,mBAAZc,KACPA,EAAOJ,SACHsE,MAAOA,EACPC,MAAOA,EACPC,aAAcA,EACd+gE,SAAUA,EACVmlB,UAAWL,EACXd,YAAaA,SxCg8gBfoB,IAAI,SAASjrF,EAAQU,EAAOJ,GyCprhBlC,YAEA,SAAS4qF,GAAYpgF,EAAM+0C,EAAQ3yC,GAC/B1G,KAAKsE,KAAOA,EACZtE,KAAKq5C,OAASA,EACdr5C,KAAK0G,MAAQA,EAkBjB,QAAS03E,GAAehmC,GAEpB,GADAp4C,KAAK2kF,YACDvsC,EACA,IAAK,GAAItkC,GAAK,EAAGA,EAAKskC,EAAQp+C,SAAU8Z,EACpC9T,KAAK2c,IAAIy7B,EAAQtkC,IAnB7B4wE,EAAY/kF,UAAUilF,OAAS,SAASvrF,GACpC,MAAO2G,MAAKsE,MAAQjL,EAAEiL,MAAQtE,KAAKq5C,QAAUhgD,EAAEggD,QAAUr5C,KAAK0G,OAASrN,EAAEqN,OAG7Eg+E,EAAY/kF,UAAUtD,SAAW,WAC7B,GAAI+0E,KAOJ,OANIpxE,MAAKsE,MACL8sE,EAAGl0E,KAAK,QAAU8C,KAAKsE,MACvBtE,KAAKq5C,QACL+3B,EAAGl0E,KAAK,UAAY8C,KAAKq5C,QACzBr5C,KAAK0G,OACL0qE,EAAGl0E,KAAK,SAAW8C,KAAK0G,OACrB,eAAiB0qE,EAAG54B,KAAK,KAAO,KAY3C4lC,EAAez+E,UAAUgd,IAAM,SAAS3N,GACpC,GAAIoiE,GAAKpiE,EAAO3S,UACX2D,MAAK2kF,SAASvT,KACfpxE,KAAK2kF,SAASvT,GAAMpiE,EACpBhP,KAAK6kF,MAAQ,OAIrBzG,EAAez+E,UAAUs/E,OAAS,SAAS6F,GAEvC,IAAK,GADDjrF,GAAIirF,EAAUhZ,OACTh4D,EAAK,EAAGA,EAAKja,EAAEG,SAAU8Z,EAC9B9T,KAAK2c,IAAI9iB,EAAEia,KAInBsqE,EAAez+E,UAAUq/E,eAAiB,SAAS8F,GAE/C,IAAK,GADDjrF,GAAIirF,EAAUhZ,OACTh4D,EAAK,EAAGA,EAAKja,EAAEG,SAAU8Z,EAC9B,IAAK9T,KAAK2kF,SAAS7wE,EAAGzX,YAClB,OAAO,CAEf,QAAO,GAGX+hF,EAAez+E,UAAUmsE,KAAO,WAC5B,IAAK9rE,KAAK6kF,MAAO,CACb7kF,KAAK6kF,QACL,KAAK,GAAIzzE,KAAKpR,MAAK2kF,SACX3kF,KAAK2kF,SAAShoC,eAAevrC,IAC7BpR,KAAK6kF,MAAM3nF,KAAK8C,KAAK2kF,SAASvzE,IAI1C,MAAOpR,MAAK6kF,OAGhBzG,EAAez+E,UAAUwqE,SAAW,WAGhC,IAAK,GAFDzV,MACAoX,EAAO9rE,KAAK8rE,OACPh4D,EAAK,EAAGA,EAAKg4D,EAAK9xE,SAAU8Z,EAAI,CACrC,GAAI9E,GAAS88D,EAAKh4D,GACdxP,EAAO0K,EAAO1K,IAClB,KAAKA,GAAgB,WAARA,EACT,MAAO,KACPowD,GAAM13D,QAAQsH,GAAQ,GACtBowD,EAAMx3D,KAAKoH,GAEnB,MAAOowD,IAGY,mBAAZx6D,KACPA,EAAOJ,SACH4qF,YAAaA,EACbtG,eAAgBA,SzC4rhBlB2G,IAAI,SAASvrF,EAAQU,EAAOJ,G0CzxhBlC,YAkBA,SAASskC,GAAW9kB,EAAQkD,GACxBie,EAASje,GACTA,EAAKogC,aAAatjC,GAMtB,QAASmhB,GAASje,GACd,GAAIvB,GAAUuB,EAAKvB,QAEf0zD,EAAY1zD,EAAQ8H,MAChB/T,OAAO,SAAA/V,GAAA,MAA8B,UAAzBA,EAAEuqB,UAAUuE,UACjB9uB,EAAEuqB,UAAUkE,MAAMonD,WAAatyD,EAAKgH,UAAUoE,IAAIknD,UAEjEH,GAAU/yD,QAAQ,SAAA3iB,GAAA,MAAKgiB,GAAQ8c,YAAY9+B,K1C4vhB/CyjD,OAAO8S,eAAe11D,EAAS,cAC3BsK,OAAO,IAEXtK,E0C9xhBSskC,WAAAA,E1C+xhBTtkC,E0C/xhBqB2gC,SAAAA,O1Cm0hBfuqD,IAAI,SAASxrF,EAAQU,EAAOJ,GAClC,Y2C9zhBA,IAAwB,mBAAbN,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAEhB8oE,GADcz8D,EAAMsV,YACJtV,EAAMy8D,eAEtB5zC,EAAUl1B,EAAQ,aAElB4/E,EAAa5/E,EAAQ,mBAAmB4/E,WAExC5W,EAAOhpE,EAAQ,eACfipE,EAASD,EAAKC,OACdE,EAAWH,EAAKG,SAChBD,EAAUF,EAAKE,QAEftnD,EAAK5hB,EAAQ,gBACbm2B,EAAmBvU,EAAGuU,iBACtBrU,EAAgBF,EAAGE,aAI3BJ,GAAQvb,UAAUm5D,QAAU,SAASr3D,GACjCA,EAAOA,KACP,IAAI0oB,GAAgB1oB,EAAK0oB,eAAiB,GACtCgR,EAAU,EACV6rB,EAAMvlD,EAAK+b,OAASxd,KAAKmpB,kBAEzButC,EAAY12D,KAAKmpB,kBACjBwtC,EAAc32D,KAAKuzB,KACvBvzB,MAAKmpB,kBAAoB69B,EACzBhnD,KAAKuzB,MAAQvzB,KAAKmpB,mBAAqBnpB,KAAKosB,QAAUpsB,KAAKmsB,UAE3D,IAAIzxB,GAAIsF,KACJilF,EAAUnpE,SAASopE,eAAeC,eAAe1iB,EAAQ,MAAO,MAEhE2iB,EAAW9iB,EAAcG,EAAQ,IAAK,MACtC4iB,WAAY,YACZ/hB,SAAU,OAEd2hB,GAAQ9yB,gBAAgBn2C,YAAYopE,EAEpC,IAAIjmE,GAAS,GAEb,IAAI1d,EAAK+0D,OAAQ,CACf,GAAI8uB,GAAkBhjB,EAAcG,EAAQ,IACzCH,EAAcG,EAAQ,OAAQ,8BAAgC/zC,GAC1DpnB,EAAI5M,EAAEyuB,kBAAoBhK,EAAU,IACpCsyB,EAAG,GACHgmB,YAAa,EACb6L,SAAU,OACjBqC,WAAY,MACZnzB,KAAM,SAEN8yC,GAAgBj/D,aAAa,cAAes8C,GAC5C2iB,EAAgBj/D,aAAa,aAAc,gCAE3C++D,EAASppE,YAAYspE,GAGnB7jF,EAAKg1D,QACL2uB,EAASppE,YACLsmD,EAAcG,EAAQ,OAAQziE,KAAKwB,IAAM,IAAM8Z,EAActb,KAAKmsB,WAAa,KAAO7Q,EAActb,KAAKosB,UACrG9kB,EAAG6X,EAAS,IACZsyB,EAAG,GACHgmB,YAAa,EACb6L,SAAU,OACVqC,WAAY,UAKxB,IAAI4f,GAAWjjB,EAAcG,EAAQ,OAAQ,MAC5Cn7D,EAAG6X,EACHsyB,EAAG,GACHj0B,MAAO9iB,EAAEyuB,kBACT8L,OAAQ,MAELoiC,EAAOiL,EAAcG,EAAQ,WAAY8iB,GAAW99E,GAAI,eAC5D29E,GAASppE,YAAYq7C,EAKrB,KAAK,GAHDv0D,GAAM,GACN+uB,EAAaywC,EAAcG,EAAQ,IAAK,SAEnC55D,EAAK,EAAGA,EAAKnO,EAAEqoB,MAAM/oB,SAAU6O,EAAI,CACxC,GAAI2T,GAAO9hB,EAAEqoB,MAAMla,EACnB2T,GAAKq6C,eAAiBr6C,EAAKwY,SAC3BxY,EAAKs6C,iBAAmBt6C,EAAKqjB,WAC7BrjB,EAAKu6C,mBAAqBv6C,EAAK+X,YAE/B,IAAMxM,GAAWrtB,EAAEwjC,gBAAgB1hB,EAC/BuL,IAAYA,EAASm1B,iBACrBn1B,EAASm1B,gBAAgB1gC,EAAMA,EAAKgf,SAASshB,WAAW,MAG5D,IAAI0oC,GAAUljB,EAAcG,EAAQ,IAAK,MAAOgjB,SAAU,oBAAqBC,SAAU,YACxFC,EAAarjB,EAAcG,EAAQ,KACnCmjB,EAAa9iF,EAEb+iF,EAAiBvjB,EAAcG,EAAQ,OAAQ,MAAOn7D,EAAG,EAAGmqC,EAAGm0C,EAAYpoE,MAAO,QAASyX,OAAQ,GAAIud,KAAMh2B,EAAKoe,YAGtH,IAFA4qD,EAAQxpE,YAAY6pE,GAEhBrpE,EAAKyf,eAAgB,CACrB,GAAI6pD,GAAW1M,EAAW58D,EAAMA,EAAKugC,gBAErCyoC,GAAQxpE,YAAYsmD,EAAcG,EAAQ,IAAKqjB,GAAWziB,UAAW,aAAgBlkD,EAAU,KAAOrc,EAAM,OAC5GA,GAAO,OACJ,CACA,IAAK0Z,EAAKwY,SACb,QAKG,KAAK,GAFJ16B,IAAWkiB,EAAK4e,iBAAmB1gC,EAAEyxB,WAAazxB,EAAE64B,MACjDgkC,GAAW,EACNv2C,EAAM,EAAGA,EAAMxE,EAAKwY,SAASh7B,SAAUgnB,EAAK,CACjDle,GAAOq4B,CAIb,KAAK,GAHDopB,GAAU/nC,EAAKwY,SAAShU,GAExB+kE,KACKt4D,EAAK,EAAGA,EAAK82B,EAAQl3B,OAAOrzB,SAAUyzB,EAAI,CACzC,GAAItkB,GAAQo7C,EAAQl3B,OAAOI,EAC3Bs4D,GAAc7oF,KAAKiM,EAAM05D,SAKnC,GAFA2iB,EAAQxpE,YAAYsmD,EAAcG,EAAQ,IAAKsjB,GAAgB1iB,UAAW,cAAgBlkD,EAAO7kB,GAAU,KAAOwI,EAAM,OAEpHyhD,EAAQhvB,MAAO,CACTgiC,GAAW,CACjB,IAAIz8D,GAAIypD,EAAQhvB,MACNmR,EAAI6d,EAAQtvB,OAEZuiC,EAAU,CACV9wB,GAAI,KACJ8wB,EAAU,GAAM9wB,EAAE,GAAM,GAE5B,IAAI4nB,GAAa5nB,GAAK8wB,EAAU,GAC5BjJ,GAAezzD,EAAEgF,IAAMhF,EAAE6C,MAAQ65D,EAAU,GAEjD37C,EAAO,GAAI6mD,EACf7mD,GAAK+yC,OAAOzvC,EAAS,EAAGrc,GACxB+Y,EAAKgzC,OAAO1vC,EAAQrc,GACpB+Y,EAAKgzC,OAAO1vC,EAAQrc,EAAMyhD,EAAQtvB,QAClCpZ,EAAKgzC,OAAO1vC,EAAS,EAAGrc,EAAMyhD,EAAQtvB,OAChC,KAAK,GAAIh8B,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXzyC,GAAK+yC,OAAOzvC,EAAQrc,EAAMgsD,GAC1BjzC,EAAKgzC,OAAO1vC,EAAO,EAAGrc,EAAMgsD,GAGtC62B,EAAW3pE,YAAYsmD,EAAcG,EAAQ,OAAQ,MAAOvtD,EAAG2G,EAAKinD,aAActwB,KAAM,OAAQwN,OAAQ,QAASyX,YAAa,SAC9HkuB,EAAW3pE,YAAYsmD,EAAcG,EAAQ,OAAQ9yC,EAAiB70B,EAAEgF,MAAOwH,EAAG6X,EAAS,EAAGsyB,EAAG3uC,EAAM,EAAG6iE,WAAY,SACtHggB,EAAW3pE,YAAYsmD,EAAcG,EAAQ,OAAQ9yC,EAAiB70B,EAAE6C,MAAO2J,EAAG6X,EAAS,EAAGsyB,EAAG3uC,EAAOyhD,EAAQtvB,OAAQ0wC,WAAY,QAC9H,KAAK,GAAI1sE,GAAI,EAAOu+D,EAAQ,EAAZv+D,IAAiBA,EAAG,CAChC,GAAI61D,GAAK71D,EAAEq1D,CACXq3B,GAAW3pE,YAAYsmD,EAAcG,EAAQ,OAAQ9yC,EAAkB,EAAI70B,EAAEgF,IAAQ7G,EAAEs1D,IAClFjnD,EAAG6X,EAAS,EAAGsyB,EAAG3uC,EAAOgsD,EAAK,EAAG6W,WAAY,UAIhE7iE,GAAOyhD,EAAQtvB,OAASkG,EAGChR,EAAnBrnB,EAAM8iF,IACN9iF,EAAM8iF,EAAaz7D,GAI3B,GAAIutC,EAEAA,GAD4B,gBAArBl7C,GAAK+G,OAAOzmB,KACP0f,EAAK+G,OAAOzmB,KAEZ0f,EAAKgH,UAAU1mB,KAClC6oF,EAAW3pE,YACPsmD,EACHG,EAAQ,OACR/K,GACCpwD,EAAG6X,GAAUo4C,EAAW,GAAK,IAAK9lB,GAAI3uC,EAAI8iF,EAAW,GAAG,EAAGtiB,SAAU,OAAQqC,WAAY,SAG3FkgB,EAAex/D,aAAa,SAAUvjB,EAAM8iF,GAC5C/zD,EAAW7V,YAAYsmD,EAAcG,EAAQ,KAAM+iB,EAASG,KAEzDnpE,EAAKwY,SAAWxY,EAAKq6C,eACrBr6C,EAAKqjB,WAAarjB,EAAKs6C,iBACvBt6C,EAAK+X,aAAe/X,EAAKu6C,mBAG7B,GAAIt1D,EAAK0f,WAEL,IAAK,GADDA,GAAanhB,KAAKmhB,eACb2X,EAAK,EAAGA,EAAK3X,EAAWnnB,SAAU8+B,EAAI,CAC3C,GAAI4N,GAAIvlB,EAAW2X,EACnB,KAAK4N,EAAEllC,KAAOxB,KAAKwB,KAAOklC,EAAEllC,KAAQ,MAAQxB,KAAKwB,MAASklC,EAAE/oC,IAAMqC,KAAKosB,SAAWsa,EAAE5mC,IAAME,KAAKmsB,UAAW,CACtG,GAAI6+B,IAAQttD,KAAKoC,IAAI4mC,EAAE/oC,IAAKqC,KAAKmsB,WAAansB,KAAKmsB,WAAansB,KAAKuzB,MACjE03B,GAAQvtD,KAAKC,IAAI+oC,EAAE5mC,IAAKE,KAAKosB,SAAWpsB,KAAKmsB,WAAansB,KAAKuzB,KAEnE1B,GAAW7V,YAAYsmD,EAAcG,EAAQ,OAAQ,MAAOn7D,EAAG6X,EAAS6rC,EAAMvZ,EAAG,GAAIj0B,MAAQytC,EAAKD,EAAO/1B,OAAQnyB,EAAI,GAC/Dk9C,OAAQ,OAAQxN,KAAMxyC,KAAK4pB,qBAAsB87C,YAAa1lE,KAAK6pB,0BAKrI,GAAI+tC,GAAW,EACG,WAAdn2D,EAAKgxB,MACLmlC,EAAWz4C,GAAWnf,KAAKosB,QAAUpsB,KAAKmsB,WAAWnsB,KAAKuzB,MAAS,EAC9C,QAAd9xB,EAAKgxB,MACZmlC,EAAWz4C,EACU,SAAd1d,EAAKgxB,QACZmlC,EAAWz4C,GAAWnf,KAAKosB,QAAUpsB,KAAKmsB,WAAWnsB,KAAKuzB,OAE1DqkC,GAAY,GACZ/lC,EAAW7V,YAAYsmD,EAAcG,EAAQ,OAAQ,MAAOwD,GAAIrO,EAAUsO,GAAI,GAAIC,GAAIvO,EAAUwO,GAAItjE,EAC9Ck9C,OAAQ,UAGlEolC,EAASppE,YAAY6V,GACrBozD,EAAQ9yB,gBAAgB9rC,aAAa,QAAS3rB,EAAEyuB,kBAAoB,GAAKhK,GACzE8lE,EAAQ9yB,gBAAgB9rC,aAAa,SAAUvjB,EAAM,IAGrD9C,KAAKmpB,kBAAoButC,EACzB12D,KAAKuzB,MAAQojC,CAEb,IAAIqvB,GAAA,MACJ,IAA8B,mBAAnBC,eACPD,GAAM,GAAIC,gBAAgBC,kBAAkBjB,OACzC,CACH,GAAMkB,GAAOlB,EAAQ9yB,eACrBg0B,GAAK9/D,aAAa,QAAS,8BAC3B2/D,EAAMG,EAAKC,UAGf,MAAI3kF,GAAK+5E,QAA0B,WAAhB/5E,EAAK+5E,OACbwK,EAEA,GAAIp3D,OAAMo3D,IAAO1hF,KAAM,qB3C+zhBnCoiB,aAAa,EAAEI,eAAe,GAAGixC,kBAAkB,GAAGsO,cAAc,GAAGp8D,UAAU,GAAGwgC,YAAY,KAAK47C,IAAI,SAAS7sF,EAAQU,EAAOJ,GACpI,Y4CxiiBA,SAAS4oE,KACL1iE,KAAK+rD,OAJT,GAAI0W,GAAS,6BACTE,EAAW,8BAMfD,GAAQ/iE,UAAUivD,OAAS,SAAStnD,EAAGmqC;AACnCzxC,KAAK+rD,IAAI7uD,KAAK,KAAOoK,EAAI,IAAMmqC,IAGnCixB,EAAQ/iE,UAAUkvD,OAAS,SAASvnD,EAAGmqC,GACnCzxC,KAAK+rD,IAAI7uD,KAAK,KAAOoK,EAAI,IAAMmqC,IAGnCixB,EAAQ/iE,UAAUy3D,UAAY,WAC1Bp3D,KAAK+rD,IAAI7uD,KAAK,MAGlBwlE,EAAQ/iE,UAAUmjE,WAAa,WAC3B,MAAO9iE,MAAK+rD,IAAIvT,KAAK,MAGF,mBAAZt+C,KACPA,EAAOJ,SACH2oE,OAAQA,EACRE,SAAUA,EACVD,QAASA,S5C0jiBX4jB,IAAI,SAAS9sF,EAAQU,EAAOJ,G6CrliBlC,YAkBA,SAASysF,GAAmB5uD,GACxBs8B,EAAkBl6D,KAAKiG,MACvBA,KAAKkwE,UAAY,aACjBlwE,KAAK23B,OAASA,EAEd33B,KAAKwmF,YAAc,GAAIp3D,EACvB,IAAIttB,GAAQ9B,KAGRkF,EAAS40D,EAAqBniC,EAAO20C,QACzC,KAAKpnE,EACD,KAAM,4BAA8ByyB,EAAO20C,OAE3CtsE,MAAKkF,OAASA,CAGlB,IAAI9J,GAAM2E,CACNC,MAAK23B,OAAO3gB,MACZ5b,EAAO,GAAI2b,GAAc/W,KAAK23B,OAAO3gB,MACrCjX,EAAQ,GAAIgX,GAAc/W,KAAK23B,OAAO2pD,aAEtClmF,EAAO,GAAI6b,GAAajX,KAAK23B,OAAOwR,KAAM3vB,YAAaxZ,KAAK23B,OAAOne,YAAaI,SAAU5Z,KAAK23B,OAAO/d,WACtG7Z,EAAQ,GAAIkX,GAAajX,KAAK23B,OAAO8uD,UAAazmF,KAAK23B,OAAOwR,IAAM,QAC1C3vB,YAAaxZ,KAAK23B,OAAOne,YAAaI,SAAU5Z,KAAK23B,OAAO/d,YAE1F8sE,EAAatrF,EAAM2E,EAAO,SAAS4mF,EAAOhtE,GACtC7X,EAAM0kF,YAAY7c,QAAQgd,GAC1BA,EAAMC,YAAY,SAASna,EAAO9yD,GAC9B,GAAI8yD,EAAO,CAEP,IAAK,GADDC,GAAUxnE,EAAOa,cAAc,cAC1B4mE,EAAK,EAAGA,EAAKF,EAAMzyE,SAAU2yE,EAClCD,EAAQvmE,MAAMsmE,EAAME,GAExBD,GAAQ/jE,WAGhB7G,EAAMouE,UAAY,KAClBpuE,EAAM6vE,oBArDd,GAAwB,mBAAbn4E,GACP,GAAI6L,GAAK7L,EAAQ,oBACb46D,EAAyC/uD,EAAGgvD,6BAC5CyF,EAAuBz0D,EAAG00D,WAC1B9F,EAAoB5uD,EAAG4uD,kBAEvB91D,EAAM3E,EAAQ,SACdyd,EAAe9Y,EAAI8Y,aACnBF,EAAgB5Y,EAAI4Y,cAEpBlR,EAAQrM,EAAQ,WAChB41B,EAAUvpB,EAAMupB,QAEhBs3D,EAAeltF,EAAQ,WAAWktF,YA4C1CH,GAAmB5mF,UAAY+8C,OAAO4X,OAAOL,EAAkBt0D,WAE/D4mF,EAAmB5mF,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GAC7E,GAAIuG,GAAQ9B,IAEZ8B,GAAM8yD,OACN9yD,EAAM+yD,iBAEN70D,KAAKwmF,YAAYzb,MAAM,SAAS4b,GAC5BA,EAAMjrF,MAAM8F,EAAK7D,EAAKmC,EAAK,SAAS6B,EAAS2sB,GACzCxsB,EAAM8yD,OACN9yD,EAAM+yD,gBAIN,KAAK,GAFD5jD,MACAy7D,EAAU5qE,EAAMoD,OAAOa,cAAc,SAASrM,GAAIuX,EAAS/T,KAAKxD,KAC3D0nF,EAAK,EAAGA,EAAKz/E,EAAQ3H,SAAUonF,EACpC,CAAQ1U,EAAQvmE,MAAMxE,EAAQy/E,IAElC1U,EAAQ/jE,QACRpN,EAAS,KAAM0V,EAAU,UAMrCs1E,EAAmB5mF,UAAUqJ,cAAgB,SAASzN,GAC9CyE,KAAKkF,QAAUlF,KAAKkF,OAAO8D,eAC3BhJ,KAAKkF,OAAO8D,cAAczN,IAGlCgrF,EAAmB5mF,UAAU0tE,eAAiB,SAAS9xE,GAC/CyE,KAAKkF,QAAUlF,KAAKkF,OAAOmoE,gBAC3BrtE,KAAKkF,OAAOmoE,eAAe9xE,IAInC64D,EAAuC,QAAS,SAASz8B,GACrD,OAAQ1mB,SAAU,GAAIs1E,GAAmB5uD,Q7C8liB1C/yB,QAAQ,EAAEoF,mBAAmB,GAAGspE,UAAU,GAAGrpE,UAAU,KAAK48E,IAAI,SAASrtF,EAAQU,EAAOJ,G8C9riB3F,YAwBA,SAASgtF,MAGT,QAASJ,GAAatrF,EAAM+3E,EAAK53E,GAC7B,GAAIorF,GAAQ,GAAIG,EAChBH,GAAMvrF,KAAOA,EACburF,EAAMxT,IAAMA,EAEZwT,EAAMxT,IAAIz3E,MAAM,SAASC,GACrB,IAAKA,EACD,MAAOJ,GAAS,KAAM,wBAG1B,IAAIwrF,GAAU/qF,EAAOL,EAAQA,EAAOM,YAChC5B,EAAQ,GAAI6B,YAAW6qF,GACvB5qF,EAAQ1B,EAAQJ,EAAO,EAC3B,IAAI8B,GAAS42E,EACT,MAAOx3E,GAAS,KAAM,oBAG1B,IAAIgC,GAAO9C,EAAQJ,EAAO,EAC1BssF,GAAMK,OAASvsF,EAAQJ,EAAO,GAC9BssF,EAAMM,OAASxsF,EAAQJ,EAAO,IAC9BssF,EAAMO,SAAWzsF,EAAQJ,EAAO,IAChCssF,EAAMQ,OAAS1sF,EAAQJ,EAAO,IAC9BssF,EAAM9F,KAAOpmF,EAAQJ,EAAO,IAC5BssF,EAAMS,KAAO3sF,EAAQJ,EAAO,GACXI,GAAQJ,EAAO,GAEhCssF,GAAMxpF,UAEN,IAAI5C,GAAI,EACRosF,GAAMhqF,cACNgqF,EAAM/pF,aACN,KAAK,GAAInD,GAAI,EAAO8D,EAAJ9D,IAAYA,EAAG,CAG3B,IAFA,GAAIqD,GAAO,KAEE,CACT,GAAI0V,GAAKnY,EAAME,IACf,IAAU,GAANiY,EACA,KAEJ1V,IAAQP,OAAOC,aAAagW,GAGhCm0E,EAAMhqF,WAAWG,GAAQrD,EACE,GAAvBqD,EAAKE,QAAQ,OACb2pF,EAAMhqF,WAAWG,EAAKG,UAAU,IAAMxD,EAEtCktF,EAAMhqF,WAAW,MAAQG,GAAQrD,EAErCktF,EAAM/pF,WAAWM,KAAKJ,GAI1B,IAAK,GADDjC,GAAgB,IACX2C,EAAM,EAASD,EAANC,IAAcA,EAAK,CACjC,GAAIC,GAAalD,EACbC,EAAOC,EAAQJ,EAAOE,EAAIA,IAAK,CACnC,KAAK,GAAIG,GAAI,EAAOF,EAAJE,IAAYA,EAAG,CAC3B,GACIC,IADMF,EAAQJ,EAAOE,GACbE,EAAQJ,EAAOE,EAAE,GAC7BA,IAAK,EAAa,GAARI,EAEd,GAAIC,GAAQH,EAAQJ,EAAOE,EAAIA,IAAK,CAGpC,KAAK,GADDO,GAAIP,EACCd,EAAI,EAAOmB,EAAJnB,IAAaA,EAAG,CAC5B,GAAIsB,GAAIC,EAAQX,EAAOS,EACvB,IAD2BA,GAAK,EAC5BC,EAAG,CACH,GAAIE,GAAKF,EAAEG,KACPH,GAAET,OAAS,IACXW,GAAM,OAEDJ,EAALI,IACAJ,EAAgBI,EACpB,QAGRV,GAAc,EAARK,CAIFJ,GAAO,IACPmsF,EAAMxpF,QAAQK,GAAO,GAAItB,YAAW6qF,EAAStpF,EAAYlD,EAAIkD,IAIrEkpF,EAAMU,UAAYxsF,EAElBU,EAASorF,KACT9qF,QAAS,MAhHjB,GAAIk3E,GAAc,QAElB,IAAwB,mBAAbv5E,GACP,GAAI0E,GAAQ1E,EAAQ,WAKhB2E,GAJQD,EAAME,MACNF,EAAMG,MACCH,EAAMI,aAEf9E,EAAQ,UACdiB,EAAU0D,EAAI1D,QAMdkE,GALYR,EAAII,UACLJ,EAAIK,SACHL,EAAIO,UACJP,EAAIM,UAELjF,EAAQ,eACnBwB,EAAU2D,EAAS3D,QACnBgB,EAAS2C,EAAS3C,OAClB4C,EAAWD,EAASC,SACpBC,EAAQF,EAASE,KAkGzBioF,GAAUnnF,UAAUC,eAAiB,SAASC,EAAOlC,EAAKmC,GACtD,GAAIC,GAAQC,KAAK7C,QAAQ0C,EACzB,KAAKE,EACD,QAKJ,KAAK,GAFDE,GAAWrB,EAASjB,EAAKmC,GACzBI,KACKzG,EAAI,EAAGA,EAAIwG,EAASjG,SAAUP,EACnCyG,EAAQD,EAASxG,KAAM,CAM3B,KAAK,GAJD0G,MAAiBC,KAEjB5F,EAAOC,EAAQsF,EAAO,GACtBxF,EAAI,EACCG,EAAI,EAAOF,EAAJE,IAAYA,EAAG,CAC3B,GAAIyD,GAAM1D,EAAQsF,EAAOxF,GACrBI,EAAQF,EAAQsF,EAAOxF,EAAE,EAE7B,IADAA,GAAK,EACD2F,EAAQ/B,GACR,IAAK,GAAIkC,GAAI,EAAO1F,EAAJ0F,IAAaA,EAAG,CAC5B,GAAIC,GAAKtF,EAAQ+E,EAAOxF,GAAG,GACvBgG,EAAKvF,EAAQ+E,EAAOxF,EAAI,GAAG,IACxB,KAAN4D,EAAaiC,EAAcD,GAAYjD,KAAK,GAAI2B,GAAMyB,EAAIC,IAC3DhG,GAAK,OAGTA,IAAe,GAARI,EAOf,IAAK,GAHDC,GAAQH,EAAQsF,EAAOxF,GACvBiG,EAAS,KACTC,EAAS/C,KAAKC,IAAIA,GAAK,GAAI/C,EAAQ,GAAI8F,EAAShD,KAAKC,IAAImC,GAAK,GAAIlF,EAAQ,GACrEnB,EAAIgH,EAAaC,GAALjH,IAAeA,EAAG,CACnC,GAAIkH,GAAM3F,EAAQ+E,EAAOxF,EAAI,EAAS,EAAJd,EAC7BkH,MAGAH,GAAUG,EAAGzF,MAAQsF,EAAOtF,OAASyF,EAAGrG,OAASkG,EAAOlG,UACzDkG,EAASG,GAIjB,GAAIC,KACJ,IAAc,MAAVJ,EACA,IAAK,GAAI/G,GAAI,EAAGA,EAAI2G,EAAYpG,SAAUP,EAAG,CACzC,GAAIoH,GAAOT,EAAY3G,EACnBoH,GAAKC,KAAK5F,OAASsF,EAAOtF,OAAS2F,EAAKC,KAAKxG,QAAUkG,EAAOlG,QAC9DsG,EAAkB1D,KAAK2D,GAInCT,EAAcQ,CAGd,KAAK,GADDG,MACKtH,EAAI,EAAGA,EAAI2G,EAAYpG,SAAUP,EACtCsH,EAAU7D,KAAKkD,EAAY3G,GAE/B,KAAK,GAAIA,GAAI,EAAGA,EAAI0G,EAAWnG,SAAUP,EACrCsH,EAAU7D,KAAKiD,EAAW1G,GAG9BsH,GAAUC,KAAK,SAASC,EAAIC,GACxB,GAAIC,GAAMF,EAAGG,KAAKlG,MAAQgG,EAAGE,KAAKlG,KAClC,OAAW,IAAPiG,EACOA,EAEAF,EAAGG,KAAK9G,OAAS4G,EAAGE,KAAK9G,QAGxC,IAAI+G,KACJ,IAAIN,EAAU/G,OAAS,EAAG,CAEtB,IAAK,GADDsH,GAAMP,EAAU,GACXtH,EAAI,EAAGA,EAAIsH,EAAU/G,SAAUP,EAAG,CACvC,GAAI8H,GAAKR,EAAUtH,EACf8H,GAAGH,KAAKlG,OAASoG,EAAIR,KAAK5F,MAC1BoG,EAAM,GAAIzC,GAAMyC,EAAIF,KAAMG,EAAGT,OAE7BO,EAAanE,KAAKoE,GAClBA,EAAMC,GAGdF,EAAanE,KAAKoE,GAGtB,MAAOD,IAGXylF,EAAUnnF,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKvE,GAuBhD,QAASmG,KACL,GAAI3B,GAASnC,EAAO5D,OAChB,MAAOuB,GAASoG,EACb,IAAKvG,EAQL,CACH,GAAIwG,GAAK,GAAI1F,YAAWd,EAIxB,OAHA0G,GAAMwlF,YAAY1lF,EAAIhE,EAAOmC,GAAOqB,KAAK9G,OAAQqH,EAAShE,EAAKmC,EAAKynF,GACpEnsF,EAAO,OACL2E,EACK2B,IAZP,GAAIrB,GAAIzC,EAAOmC,GACXkC,EAAW5B,EAAEe,KAAKlG,MAClBgH,EAAW7B,EAAES,KAAK5F,MAAP,KACf4G,GAAM1G,KAAKK,MAAMwG,EAAUC,EAAWD,GAAUvG,MAAM,SAASvC,GAE3D,MADAiC,GAAOY,EAAO7C,EAAGkH,EAAES,KAAK5F,MAAQmF,EAAEe,KAAKlG,MAAQ,GACxCwG,MA/BnB,GAAII,GAAQ9B,KAERgC,EAAQhC,KAAKrD,WAAW6E,EAC5B,IAAaW,QAATH,EACA,MAAOzG,MAEX,IAEIqC,GAFA2pF,EAAevnF,KAAKpD,WAAWoF,EAGrBG,UAAVH,EACApE,MAEAA,EAASoC,KAAKJ,eAAeoC,EAAOrE,EAAKmC,GACpClC,GACDrC,EAAS,KAAM,wBAIvB,IAEIH,GAFAuG,KACA5B,EAAQ,CAsBZ2B,MAGJolF,EAAUnnF,UAAU2nF,YAAc,SAAS1lF,EAAItH,EAAQmI,EAAM9E,EAAKmC,EAAK0B,GACpEgmF,EACC,OAAa,CAET,IADA,GAAIphF,GAAO,GACJ9L,EAASsH,EAAG5H,QAAQ,CACvB,GAAIwY,GAAK5Q,EAAGtH,IACZ,IAAU,IAANkY,EAAU,CACV,GAAInM,GAAOD,EAAKE,MAAM,IAEtB,IAAID,EAAKrG,KAAKinF,OAAS,IAAMzlF,EAAK,CAC9B,GAAI2N,GAAO3I,SAASH,EAAKrG,KAAKknF,SAAW,IACrC93E,EAAOD,CACPnP,MAAKmnF,OAAS,IACd/3E,EAAO5I,SAASH,EAAKrG,KAAKmnF,OAAS,KACrB,MAAdnnF,KAAKgnF,UAAoB73E,EAEjBrP,GAARqP,GAAeC,GAAQzR,GACvB8E,EAAKvF,KAAKkJ,GAElB,QAASohF,GAETphF,GAAQ7J,OAAOC,aAAagW,GAGpC,SAIRs0E,EAAUnnF,UAAUinF,YAAc,SAASrrF,GACvC,GAAIs1B,GAAO7wB,IAIX6wB,GAAKz1B,KAAKK,MAAM,EAAGo1B,EAAKw2D,WAAW3rF,MAAM,SAASmF,GAC9C,IAAKA,EACD,MAAOtF,GAAS,KAAM,eAI1B,KAFA,GAAIqG,GAAK,GAAI1F,YAAWF,EAAO6E,EAAMA,EAAK5E,aACtCuvE,EAAM,EAAGplE,EAAO,GAAIqmE,KACjBjB,EAAM5pE,EAAG5H,QAAQ,CACpB,GAAIwY,GAAK5Q,EAAG4pE,IACZ,IAAU,IAANh5D,EAAU,CACV,GAAIpM,EAAKgR,WAAW,IAAMyZ,EAAKgwD,KAI3B,MAAOtlF,GAASkxE,EAHhBA,GAAMvvE,KAAKkJ,GACXA,EAAO,OAKXA,IAAQ7J,OAAOC,aAAagW,GAGpCjX,EAASkxE,MAIM,mBAAZvyE,KACPA,EAAOJ,SACH4sF,aAAcA,EACd3T,YAAaA,M9C2siBlBnuE,QAAQ,EAAEC,aAAa,GAAGC,UAAU,KAAK2iF,IAAI,SAASjuF,EAAQU,EAAOJ,GACxE,YAYA,SAASyiD,GAAwB9kC,GAAO,GAAIA,GAAOA,EAAI+kC,WAAc,MAAO/kC,EAAc,IAAIglC,KAAa,IAAW,MAAPhlC,EAAe,IAAK,GAAIrJ,KAAOqJ,GAAWilC,OAAO/8C,UAAUg9C,eAAe5iD,KAAK0d,EAAKrJ,KAAMquC,EAAOruC,GAAOqJ,EAAIrJ,GAAgC,OAAtBquC,GAAAA,WAAiBhlC,EAAYglC,EAElQ,QAASirC,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI13B,WAAU,qCAEhH,QAAS23B,GAA2Bh3D,EAAM92B,GAAQ,IAAK82B,EAAQ,KAAM,IAAIi3D,gBAAe,4DAAgE,QAAO/tF,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B82B,EAAP92B,EAElO,QAASguF,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/3B,WAAU,iEAAoE+3B,GAAeD,GAASroF,UAAY+8C,OAAO4X,OAAO2zB,GAAcA,EAAWtoF,WAAa+X,aAAetT,MAAO4jF,EAAUE,YAAY,EAAOC,UAAU,EAAMC,cAAc,KAAeH,IAAYvrC,OAAO2rC,eAAiB3rC,OAAO2rC,eAAeL,EAAUC,GAAcD,EAASM,UAAYL,GAhBje,GAAIM,GAAe,WAAc,QAASC,GAAiB9lD,EAAQiR,GAAS,IAAK,GAAIl6C,GAAI,EAAGA,EAAIk6C,EAAM35C,OAAQP,IAAK,CAAE,GAAIgvF,GAAa90C,EAAMl6C,EAAIgvF,GAAWP,WAAaO,EAAWP,aAAc,EAAOO,EAAWL,cAAe,EAAU,SAAWK,KAAYA,EAAWN,UAAW,GAAMzrC,OAAO8S,eAAe9sB,EAAQ+lD,EAAWr6E,IAAKq6E,IAAiB,MAAO,UAAUb,EAAac,EAAYC,GAAiJ,MAA9HD,IAAYF,EAAiBZ,EAAYjoF,UAAW+oF,GAAiBC,GAAaH,EAAiBZ,EAAae,GAAqBf,M+CxgjBhiBgB,EAAApvF,EAAA,uBAIAukD,EAAAvkD,EAAA,YAGA42D,EAAA52D,EAAA,SAAY4jD,E/CygjBJb,EAAwB6T,G+CtgjB1By4B,E/CqhjBW,SAAUC,G+CphjBvB,QAAAD,GAAYlxD,GAAQ+vD,EAAA1nF,KAAA6oF,EAAA,IAAAv1D,GAAAu0D,EAAA7nF,MAAA6oF,EAAAP,WAAA5rC,OAAAqsC,eAAAF,IAAA9uF,KAAAiG,MAAA,OAGhBszB,GAAKriB,SAAWmsC,EAAEC,aAAc1lB,EAAO1mB,UAHvBqiB,E/CijjBpB,MA5BAy0D,GAAUc,EAAYC,GAWtBP,EAAaM,IACTz6E,IAAK,aACLhK,MAAO,S+C5hjBAo+B,GACP,GAAIlmB,GAAU,GAAAyhC,GAAAn4C,UAEd,KAAK,GAAIwI,KAAOo0B,GACZlmB,EAAQlO,GAAOo0B,EAAKp0B,M/CgijBxBA,IAAK,QACLhK,MAAO,S+C7hjBL5C,EAAK7D,EAAKmC,EAAKyzB,EAAOmhC,EAAOC,EAAMp5D,GACrC,GAAI0V,GAAWmsC,EAAExhC,QAAQ5b,KAAKgpF,WAAYhpF,KAAKiR,SAC/C,OAAO1V,GAAS,KAAM0V,EAAU,O/CiijB7B43E,GACTD,EAAgB30B,oB+C7hjBlB,EAAA20B,EAAAv0B,8BAA6B,cAAe,SAAA18B,GACxC,OAAS1mB,SAAU,GAAI43E,GAAWlxD,Q/CkijBnC44B,WAAW,GAAG04B,sBAAsB,GAAGp4B,MAAQ,MAAMq4B,IAAI,SAAS1vF,EAAQU,EAAOJ,GgDjkjBpF,YAmBA,SAASqvF,GAASrrF,GACdkC,KAAKm5B,WACLn5B,KAAKlC,IAAMA,EAGf,QAASsrF,MAUT,QAASC,GAAWrwD,GAChBh5B,KAAKg5B,IAAMA,EA6Gf,QAAStJ,GAAgB45D,EAAQ/tF,EAAUkG,GACvCA,EAAOA,MACPA,EAAKwX,MAAO,EAEZqW,EAAQg6D,EAAQ,SAASC,EAAS5vE,GAC9B,GAAIA,EACA,MAAOpe,GAAS,KAAMoe,EAG1B,IAAItT,GAAOkjF,EAAQjjF,MAAMkjF,GACrBxwD,EAAM,GAAImwD,GAASG,EACnB7nF,GAAK+X,cACLwf,EAAIxf,YAAc/X,EAAK+X,YAE3B,KAAK,GAAI3f,GAAI,EAAGA,EAAIwM,EAAKrM,OAAS,EAAGH,GAAK,EACtCm/B,EAAI3yB,EAAKxM,EAAE,IAAMwM,EAAKxM,EAAE,EAI5B,IAAIm/B,EAAIywD,YAAa,CACjB,GAAIC,GAASC,EAAYL,EAAQtwD,EAAIywD,YACrCn6D,GAAQo6D,EAAQ,SAASE,EAASjwE,GAC9B,GAAIA,EACA,MAAOpe,GAAS,KAAMoe,EAI1B,KAAK,GADDkwE,GAAUD,EAAQtjF,MAAMwjF,GACnB1wF,EAAI,EAAGA,EAAIywF,EAAQ7vF,SAAUZ,EAAG,CACrC,GAAIiN,GAAOwjF,EAAQzwF,GAAGkN,MAAMkjF,GACxBO,EAAS,GAAIV,GAAWrwD,EACxBv3B,GAAK+X,cACLuwE,EAAOvwE,YAAc/X,EAAK+X,YAG9B,KAAK,GAAI3f,GAAI,EAAGA,EAAIwM,EAAKrM,OAAS,EAAGH,GAAK,EACtCkwF,EAAO1jF,EAAKxM,EAAE,IAAMwM,EAAKxM,EAAE,EAG3BkwF,GAAOC,aACPD,EAAOC,WAAaL,EAAYD,EAAQK,EAAOC,aAG/CD,EAAO7wD,QAAU6wD,EAAOE,UACxBF,EAAOG,OAASP,EAAYD,EAAQK,EAAOE,SAC3CjxD,EAAIG,QAAQ4wD,EAAO7wD,QAAU6wD,GAIrCxuF,EAASy9B,IAEVv3B,OAEHlG,GAAS,KAAM,mBAEpBkG,GAuOP,QAAS0oF,GAAatoE,EAAG6kB,GACrB,MAAI7kB,GAAEuoE,UAAY1jD,EAAE0jD,SACR,EAAMvoE,EAAEuoE,SAAa,EAAM1jD,EAAE0jD,SAC9BvoE,EAAEuoE,SACF,EACA1jD,EAAE0jD,SACF,GAEAvoE,EAAEwoE,WAAWxzE,cAAc6vB,EAAE2jD,YAnb5C,GAAwB,mBAAb7wF,GACP,GAAIqM,GAAQrM,EAAQ,WAChB81B,EAAUzpB,EAAMypB,QAChBq6D,EAAc9jF,EAAM8jF,YACpB7jF,EAAcD,EAAMC,YAEpBN,EAAMhM,EAAQ,SACdiM,EAAgBD,EAAIC,cACpBC,EAAWF,EAAIE,QAGvB,IAAIokF,GAAqB,UACrBN,EAAqB,iBACrBc,EAAuB,gBAEvBC,EAAsB,gCAU1BnB,GAAczpF,UAAU2pC,IAAM,SAASl4B,GACnC,MAAIpR,MAAKoR,GACEpR,KAAKoR,GACPpR,KAAKwqF,QACHxqF,KAAKwqF,QAAQlhD,IAAIl4B,GADvB,QAQTi4E,EAAW1pF,UAAU8qF,UAAY,SAASlvF,GACtC,GAAIuG,GAAQ9B,IACZ,OAAIA,MAAK0qF,QACEnvF,EAASyE,KAAK0qF,aAGzBp7D,GAAQtvB,KAAKkqF,OAAQ,SAASS,EAAWhxE,GACrC,GAAIA,EACA,MAAOpe,GAAS,KAAMoe,EAI1BgxE,GAAYA,EAAU5sF,QAAQ,OAAQ,IAKtC,KAAK,GAHD6sF,MACAC,KACAhB,EAAUc,EAAUrkF,MAAMwjF,GACrB1wF,EAAI,EAAGA,EAAIywF,EAAQ7vF,SAAUZ,EAAG,CACrC,GAAIiN,GAAOwjF,EAAQzwF,GAAG2E,QAAQ,QAAS,IAAIuI,MAAMkjF,GAC7CsB,EAAQ,GAAI1B,EAChB0B,GAAMC,IAAMjpF,CACZ,KAAK,GAAIjI,GAAI,EAAGA,EAAIwM,EAAKrM,OAAS,EAAGH,GAAK,EAAG,CACzC,GAAIuX,GAAI/K,EAAKxM,EAAE,GAAIkB,EAAIsL,EAAKxM,EAAE,EAC9B,IAAIuX,EAAE2/B,MAAMu5C,GAAuB,CAC1BQ,EAAME,YACPF,EAAME,aAIV,KAAK,GAHDC,GAASlwF,EAAEuL,MAAM,MACjB4kF,EAAQD,EAAO,GACfE,GAAYruF,KAAMmuF,EAAO,GAAI9oC,QAAUipC,WAClCC,EAAO,EAAGA,EAAOJ,EAAOjxF,SAAUqxF,EAAM,CAC7C,GAAI7jF,GAAMyjF,EAAOI,GAAM/kF,MAAM,IAC7B6kF,GAAShpC,KAAKjlD,KAAKsK,EAAI,IACvB2jF,EAASC,OAAOluF,KAAKsK,EAAI,IAE7BsjF,EAAME,UAAUE,GAASC,MACtB,IAAU,cAAN/5E,EAAmB,CAC1B,GAAI65E,GAASlwF,EAAEuL,MAAM,cACrBwkF,GAAMQ,MACN,KAAK,GAAID,GAAO,EAAGA,EAAOJ,EAAOjxF,OAAS,EAAGqxF,GAAQ,EACjDP,EAAMQ,IAAIL,EAAOI,EAAK,IAAMJ,EAAOI,EAAO,OAG9CP,GAAMzkF,EAAKxM,EAAE,IAAMwM,EAAKxM,EAAE,GAI9BixF,EAAMA,QAAUA,EAAMxmF,MAAQwmF,EAAMS,WAAaT,EAAMv2E,MAAQu2E,EAAMU,cACrEZ,EAAO1tF,KAAK4tF,GACZD,EAAWC,EAAMA,OAASA,GAQlC,IAAK,GAFDW,MACAC,KACK7iF,EAAK,EAAGA,EAAK+hF,EAAO5wF,SAAU6O,EAAI,CACvC,GAAIiiF,GAAQF,EAAO/hF,GACf2tB,GAAM,CACV,IAAIs0D,EAAMa,OAAQ,CACd,GAAIC,GAAQd,EAAMa,OAAOrlF,MAAM,OAC3BqlF,EAASd,EAAWe,EAAM,GAC1BD,IACAb,EAAMN,QAAUmB,EAEXA,EAAO72C,WACR62C,EAAO72C,aACX62C,EAAO72C,SAAS53C,KAAK4tF,GAEjBa,IACAn1D,GAAM,IAEVhnB,QAAQC,IAAI,wBAA0Bm8E,EAAM,GAAK,IAAMd,EAAMa,OAAS,KAI1Eb,EAAMe,eACNH,EAAWxuF,KAAK4tF,GACTt0D,GACPi1D,EAAUvuF,KAAK4tF,GAIvB,IAAK,GAAI19C,GAAK,EAAGA,EAAKs+C,EAAW1xF,SAAUozC,EAAI,CAC3C,GAAI0+C,GAAOJ,EAAWt+C,EACtB,IAAK0+C,EAAKh3C,SAAV,CAIA,IAAK,GADDi3C,IAAgB,EACX19E,EAAK,EAAGA,EAAKy9E,EAAKh3C,SAAS96C,SAAUqU,EAAI,CAC9C,GAAI+C,GAAI06E,EAAKh3C,SAASzmC,EAClB+C,GAAEmD,OACFnD,EAAEi5E,WAAayB,EAAKzB,WAAa,KAAOj5E,EAAEi5E,WAC1CoB,EAAUvuF,KAAKkU,GACf26E,GAAgB,GAGnBA,GACDN,EAAUvuF,KAAK4uF,IAIvB,MADAhqF,GAAM4oF,QAAUe,EACTlwF,EAASuG,EAAM4oF,QAAS,QAC/BlxE,YAAaxZ,KAAKwZ,YAAaP,MAAM,KA6D7CmwE,EAAczpF,UAAUqsF,kBAAoB,WACxC,GAAIr0D,IACA76B,KAAMkD,KAAKqqF,WACXl2C,KAAMn0C,KAAKisF,UAEXjsF,MAAK+qF,IAAI79D,UACTyK,EAAOzK,QAAUltB,KAAK+qF,IAAI79D,QAG9B,IAAIg/D,GAAclsF,KAAKspC,IAAI,cAC3B,IAAI4iD,EAAa,CACb,GAAIN,GAAQM,EAAY5lF,MAAM,MAC9BqxB,GAAOw0D,QAAU5B,EAAsBqB,EAAM,GAGjD,GAAIQ,GAAapsF,KAAKspC,IAAI,aAK1B,IAJI8iD,IACAz0D,EAAO2gD,QAAUqR,EAAY3pF,KAAK+qF,IAAIb,OAAQkC,IAG5B,YAAlBpsF,KAAKurF,UAAyB,CAC9B5zD,EAAOy4C,MAAQ,SACfz4C,EAAO+M,UACP,IAAIoQ,GAAW90C,KAAK80C,YACpBnd,GAAOvW,SACPuW,EAAOmzC,cAAe,CAEtB,KAAK,GAAI19B,GAAK,EAAGA,EAAK0H,EAAS96C,SAAUozC,EAAI,CACzC,GAAI56B,GAAKsiC,EAAS1H,GACd9sC,EAAKkS,EAAGw5E,mBAGZ,IAFAr0D,EAAO+M,QAAQxnC,KAAKoD,GAEhBA,EAAG8gB,MACH,IAAK,GAAI2U,GAAK,EAAGA,EAAKz1B,EAAG8gB,MAAMpnB,SAAU+7B,EAAI,CACzC,GAAI3U,GAAQ9gB,EAAG8gB,MAAM2U,EACrB3U,GAAMi4B,OAAS7mC,EAAG63E,WACI,sBAAlBrqF,KAAKqsF,YACLjrE,EAAMA,MAAMgqC,MAAQ,IACxBzzB,EAAOvW,MAAMlkB,KAAKkkB,IAI9B,MAAOuW,GAEP,GAAIrzB,GAAOtE,KAAKsE,IAChB,KAAKA,EAAM,CAEP,IADA,GAAI/J,GAAIyF,KACDzF,EAAEiwF,UAAYjwF,EAAE+J,MACnB/J,EAAIA,EAAEiwF,OAEVlmF,GAAO/J,EAAE+J,KAEb,GAAKA,EAAL,CAEA,GAAIgoF,GAAWhoF,EAAKgC,MAAM,MAC1B,IAAmB,UAAfgmF,EAAS,IAAkBtsF,KAAKwrF,WAAY,CAC5C,GAAIe,GAAwB,EAAZD,EAAS,GACrBE,EAAyB,KAAfF,EAAS,EASvB,OAPA30D,GAAO6mD,OAASmL,EAAY3pF,KAAK+qF,IAAIb,OAAQlqF,KAAKwrF,YAClD7zD,EAAOvW,MAAQphB,KAAKysF,eAChBzsF,KAAK+qF,IAAIvxE,cACTme,EAAOne,aAAc,GAErB+yE,GAAa,IAAMC,IACnB70D,EAAOP,qBAAsB,GAC1BO,EACJ,MAAmB,UAAf20D,EAAS,IAAkBtsF,KAAKwrF,YACvC7zD,EAAO6mD,OAASmL,EAAY3pF,KAAK+qF,IAAIb,OAAQlqF,KAAKwrF,YAClD7zD,EAAOvW,MAAQphB,KAAK0sF,eACpB/0D,EAAOmzC,cAAe,EAElB9qE,KAAK2sF,YAAiC,MAAnB3sF,KAAK2sF,aACxBh1D,EAAOrU,mBAAwCnhB,SAAnBnC,KAAK4sF,UAA2B,EAAM5sF,KAAK4sF,UAAa,GAGpF5sF,KAAK+qF,IAAIvxE,cACTme,EAAOne,aAAc,GAGlBme,GACe,OAAf20D,EAAS,IAAgBtsF,KAAKwrF,YACrC7zD,EAAO+mD,OAASiL,EAAY3pF,KAAK+qF,IAAIb,OAAQlqF,KAAKwrF,YAC9CxrF,KAAK+qF,IAAIvxE,cACTme,EAAOne,aAAc,GAElBme,GACe,YAAf20D,EAAS,IAAoBtsF,KAAKwrF,YACzC7zD,EAAOwR,IAAMwgD,EAAY3pF,KAAK+qF,IAAIb,OAAQlqF,KAAKwrF,YAC/C7zD,EAAOsL,UAAY,QACnBtL,EAAO20C,QAAU,MACbtsE,KAAK+qF,IAAIvxE,cACTme,EAAOne,aAAc,GAElBme,OAEPnoB,SAAQC,IAAI,eAAiBzP,KAAKsE,QAK9C8kF,EAAczpF,UAAU+sF,aAAe,WACnC,GAAIpoF,GAAOtE,KAAKsE,IAChB,KAAKA,EAAM,CAEP,IADA,GAAI/J,GAAIyF,KACDzF,EAAEiwF,UAAYjwF,EAAE+J,MACnB/J,EAAIA,EAAEiwF,OAEVlmF,GAAO/J,EAAE+J,KAEb,GAAKA,EAAL,CAEA,GAEI3G,GAAKmC,EAFLwsF,EAAWhoF,EAAKgC,MAAM,MAGtBgmF,GAAStyF,QAAU,IACnB2D,EAAM,EAAM2uF,EAAS,GACrBxsF,EAAM,EAAMwsF,EAAS,GAGzB,IAAIr3D,EACJ,IAAIj1B,KAAK6sF,gBAAiB,CACtB,GAAIC,GAAU9sF,KAAK6sF,gBAAgBvmF,MAAM,IACnB,IAAlBwmF,EAAQ9yF,OACRi7B,EAAsB,EAAb63D,EAAQ,GAEjBt9E,QAAQC,IAAI,yDAIpB,GAAIs9E,GAAQ,MACR/sF,MAAKgtF,mBACLD,EAAQ/sF,KAAKgtF,iBAGjB,IAAIlmF,GAAQ,QACRmmF,EAAW,IACXjtF,MAAK8G,QACLA,EAAQ,OAAS9G,KAAK8G,MAAQ,KAE9B9G,KAAKitF,WACLA,EAAW,OAASjtF,KAAKitF,SAAW,IAGxC,IAAIhkF,GAAa,GAAIxD,GACjByD,EAAW,GAAIxD,EAmBnB,OAlBa,UAATqnF,EACA7jF,EAASC,MAAQ,QAEjBD,EAASC,MAAQ,YAGjB8jF,GACA/jF,EAASW,OAAS/C,EAClBoC,EAASY,OAASmjF,GAElB/jF,EAASE,QAAUtC,EAEvBoC,EAASG,OAAS4rB,GAAU,IACxBt3B,GAAOmC,KACPoJ,EAASmyD,IAAM19D,EACfuL,EAASuyD,IAAM37D,GAEnBmJ,EAAWK,WAAWhF,KAAM,WAAY,KAAM4E,GACvCD,EAAWorC,SAGtB+0C,EAAczpF,UAAU8sF,aAAe,WACnC,GAAIzlF,GAAoD,OAAzC,GAAGhH,KAAKspC,IAAI,YAAYmN,cACnCxZ,EAAaj9B,KAAKspC,IAAI,eAAiB,OACvCxiC,EAAQ9G,KAAKspC,IAAI,QAEjBxiC,GADAA,EACQ,OAASA,EAAQ,IAEjB,MAEZ,IAAImC,GAAa,GAAIxD,GACjByD,EAAW,GAAIxD,EACnBwD,GAASC,MAAQ,MACjBD,EAASK,QAAU,QACnBL,EAASE,QAAUtC,EACnBoC,EAASG,OAAwB,QAAd4zB,GAAsC,QAAdA,EAAwB,GAAK,EACxE/zB,EAASM,KAAsB,QAAdyzB,GAAsC,QAAdA,EACzC/zB,EAASO,MAAuB,QAAdwzB,GAAsC,QAAdA,EAC1C/zB,EAASQ,OAAS,GACd1C,IACAkC,EAAS+4C,QAAS,EAEtB,IAAIpT,GAAM7uC,KAAKspC,IAAI,gBACnB,IAAIuF,EAAK,CACL,GAAIq+C,GAAUr+C,EAAIvoC,MAAM,OAEpB6mF,EAAOrnF,EAAYoD,EACvBikF,GAAK/jF,QAAU,OAAS8jF,EAAQ,GAAK,IACrCjkF,EAAWK,WAAWhF,KAAM,SAAUuC,YAAa,KAAM,KAAMsmF,EAE/D,IAAIC,GAAQtnF,EAAYoD,EACxBkkF,GAAMhkF,QAAU,OAAS8jF,EAAQ,GAAK,IACtCjkF,EAAWK,WAAWhF,KAAM,SAAUuC,YAAa,KAAM,KAAMumF,OAE/DnkF,GAAWK,WAAWhF,KAAM,UAAW,KAAM4E,EAGjD,IAAImkF,GAAU,GAAI3nF,EAClB2nF,GAAQlkF,MAAQ,MAChBkkF,EAAQ9jF,QAAU,QACdvC,IACAqmF,EAAQprC,QAAS,GACrBorC,EAAQjkF,QAAU,MAClBikF,EAAQhkF,OAAS,GACjBgkF,EAAQ7jF,MAAO,EACf6jF,EAAQ3jF,OAAS,GACjBT,EAAWK,WAAWhF,KAAM,eAAgB,KAAM+oF,EAElD,IAAI1jF,GAAU,GAAIjE,EAUlB,OATAiE,GAAQR,MAAQ,MAChBQ,EAAQJ,QAAU,QAClBI,EAAQP,QAAU,QAClBO,EAAQN,OAAS,GACjBM,EAAQD,OAAS,GACjBC,EAAQH,MAAO,EACfG,EAAQF,OAAQ,EAChBR,EAAWK,WAAWhF,KAAM,cAAe,KAAMqF,GAE1CV,EAAWorC,QAeC,mBAAZn6C,KACPA,EAAOJ,SACH41B,gBAAiBA,EACjBy6D,aAAcA,MhD0jjBnBpgF,QAAQ,GAAGE,UAAU,KAAKqjF,IAAI,SAAS9zF,EAAQU,EAAOJ,GiDt/jBzD,YAEA,IAAwB,mBAAbN,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAChBsM,EAAcD,EAAMC,WAG5BoV,GAAQvb,UAAU23B,mBAAqB,WAInC,IAAK,GAHDrP,MACAosB,KAEKrzB,EAAM,EAAGA,EAAMhhB,KAAK6iB,cAAc7oB,SAAUgnB,EAAK,CACtD,GAAIxE,GAAOxc,KAAK+iB,MAAM/iB,KAAK6iB,cAAc7B,GAC5CiH,GAAQ/qB,KAAK4I,EAAY0W,EAAKgH,WAE3B,KAAK,GADDkV,GAAKlc,EAAKvT,WAAWorC,OAChBte,EAAK,EAAGA,EAAK2C,EAAG1+B,SAAU+7B,EAAI,CACnC,GAAI8gB,GAAKne,EAAG3C,GACRw3D,EAAMznF,EAAY+wC,EACtB02C,GAAIl0C,OAAS78B,EAAKgH,UAAU1mB,KAAKiB,QAAQ,WAAY,QACrDwvF,EAAIz2C,UAAY,KAChBy2C,EAAInsE,MAAQtb,EAAY+wC,EAAGz1B,OACFjf,SAArBorF,EAAInsE,MAAM1X,SACV6jF,EAAInsE,MAAM1X,OAASsX,GAEnBxE,EAAKq5C,WACL03B,EAAInsE,MAAMi6C,IAAM7+C,EAAKq5C,UAErBr5C,EAAKu5C,WACLw3B,EAAInsE,MAAMq6C,IAAMj/C,EAAKu5C,UAGzB1hB,EAAOn3C,KAAKqwF,IAIpBvtF,KAAKu3B,SACPz6B,KAAM,SACNszE,MAAO,SACP1rC,QAASzc,EACT6iD,cAAc,EACX1pD,MAAOizB,IAERr0C,KAAK4hB,gBAAgB5hB,KAAK+iB,MAAM/oB,OAAS,MjDigkB1C0sB,aAAa,EAAEzc,UAAU,KAAKujF,IAAI,SAASh0F,EAAQU,EAAOJ,GkD9ikB7D,YAolBA,SAAS2zF,GAAYxkF,GACjB,IAAK,GAAI8sB,GAAK,EAAGA,EAAK9sB,EAAWorC,OAAOr6C,SAAU+7B,EAAI,CAClD,GAAI2C,GAAKzvB,EAAWorC,OAAOte,GAAI3U,KAC/B,IAAiB,eAAbsX,EAAGvvB,MACH,MAAOuvB,IAtlBnB,GAAwB,mBAAbl/B,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBrV,EAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,YAEpB3V,EAAMhM,EAAQ,SACdg9C,EAAmBhxC,EAAIgxC,iBAEvBG,GADuBnxC,EAAIkxC,qBACVlxC,EAAImxC,gBAErB7vC,EAAQtN,EAAQ,WAChBk4C,EAAmB5qC,EAAM4qC,iBAEzB1hB,EAAgBx2B,EAAQ,mBAAmBw2B,aAGnD,IAAI09D,IACAC,KAAK,EACLC,IAAI,EACJC,MAAM,EACNC,QAAQ,EACRC,OAAO,EACPC,UAAU,EACVC,UAAU,EAGd/yE,GAAQvb,UAAUmjB,cAAgB,SAAStG,GAGvC,GAAoB,SAAhBxc,KAAK2e,QAAqB3e,KAAKgkB,mBAAqBxH,EACpDxc,KAAK+jB,gBACL/jB,KAAK0e,UAAU,YACZ,CAAA,IAAKlC,EACR,MAEA,IAAI0xE,GAAiB,SAAS9sE,GACtBA,EAAMonC,SAGO,GAAb2lC,GACmB,YAAf/sE,EAAMjY,OAAuBukF,EAAwBtsE,EAAMjY,OAC3DiY,EAAM7X,QAAU6kF,EAAehqF,MAE/Bgd,EAAMhY,QAAUglF,EAAehqF,MAEnCgd,EAAMvX,OAASuX,EAAMtX,OAASsX,EAAMsnC,OAAS,OAE7CtnC,EAAMvX,OAASukF,EAAehqF,MAC9Bgd,EAAMtX,OAASukF,EAAgBjqF,MAC3B+pF,EAAY,EACZ/sE,EAAMsnC,OAAS4lC,EAAgBlqF,MAE/Bgd,EAAMsnC,OAAS,MAGvBtnC,EAAM61B,UAAY,KAClB71B,EAAMqrC,WAAa8hC,EAAmBnqF,MACtCgd,EAAMorC,YAAcgiC,EAAoBpqF,QAGxCqqF,EAAmB,SAASC,GAI5B,IAAK,GAHD93C,GAAMD,EAAen6B,EAAKvT,YAC1B6+B,EAAUtrB,EAAKvB,QAAQ8sB,sBAElBtuC,EAAI,EAAGA,EAAIm9C,EAAIvC,OAAOr6C,SAAUP,EAAG,CACxC,GAAIo9C,GAAKD,EAAIvC,OAAO56C,EAChBo9C,GAAGpiC,MAAQoiC,EAAGpiC,MAAQqzB,GAI1B4mD,EAAQ73C,EAAGz1B,OAGf,MAAOw1B,IAGP+3C,EAAc,SAAS12E,GACvBuE,EAAKoyE,gBAAgBH,EAAiBP,IAG1CluF,MAAKgkB,iBAAmBxH,CAExB,IAAIqyE,GAAW1zE,EAAY,MAAO,MAAO0B,UAAW,cAEhDiyE,EAAc3zE,EAAY,MAAO,WAAaqB,EAAK+G,OAAOwrE,MAAQvyE,EAAKgH,UAAU1mB,MAAQ,IAAK,MACzF89B,WAAY,OAAQo0D,cAAe,MAAOC,aAAc,MAAOhgC,UAAW,UACnF4/B,GAAS7yE,YAAY8yE,EAErB,IAAII,GAAQ/zE,EAAY,OACnBA,EAAY,IAAKqB,EAAKgH,UAAU2wB,QAEjCg7C,KACAC,EAAQp/D,EAAcxT,EAAKgH,UAU/B,KATI4rE,GAC6B,GAA5BA,EAAMpyF,QAAQ,YACe,GAA7BoyF,EAAMpyF,QAAQ,aACS,GAAvBoyF,EAAMpyF,QAAQ,OACL,8CAAVoyF,GAEAD,EAAWjyF,KAAKie,EAAY,KAAMA,EAAY,IAAK,mBAAoBe,KAAMkzE,MAG7E5yE,EAAKgH,UAAU0J,QAAS,CACxB,GAAIyT,GAAS3gC,KAAK6oB,OAAOrM,EAAKgH,UAAU0J,SAASyT,MACjDwuD,GAAWjyF,KAAKie,EAAY,KAAO,eAAiBwlB,EAAOW,KAAOX,EAAOp1B,UAGzE4jF,EAAWn1F,OAAS,GACpBk1F,EAAMlzE,YAAYb,EAAY,KAAMg0E,IAGxCN,EAAS7yE,YAAYkzE,EAErB,IAAIG,GAAiBl0E,EAAY,OAAQ,mCAAoC,MAAOkG,QAAS,SACzFiuE,EAAan0E,EAAY,OAAQ,OAAQk0E,GAAiB,MACvDz0D,WAAY,OAAQo0D,cAAe,MAAOC,aAAc,MAAOhgC,UAAW,UACjF4/B,GAAS7yE,YAAYszE,EAErB,IAAIC,GAAgBp0E,EAAY,QAAS,MAAO7W,KAAM,SAClDkrF,EAAmBr0E,EAAY,QAAS,MAAO7W,KAAM,WAAYuzB,SAAU73B,KAAKgxB,iBAEhFy+D,EAAat0E,EAAY,SAC7Bs0E,GAAWzzE,YAAYb,EAAY,SAAU,aAAc/W,MAAO,eAClEqrF,EAAWzzE,YAAYb,EAAY,SAAU,aAAc/W,MAAO,cAClEqrF,EAAWzzE,YAAYb,EAAY,SAAU,UAAW/W,MAAO,cAC/DqrF,EAAWzzE,YAAYb,EAAY,SAAU,WAAY/W,MAAO,YAEhE,IAAIgqF,GAAiBjzE,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,YAClEiqF,EAAkBlzE,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,YACnEkqF,EAAkBnzE,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,YAEnEmqF,EAAqBpzE,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,YACtEoqF,EAAsBrzE,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,WAE3E,KACIgqF,EAAe9pF,KAAO+pF,EAAgB/pF,KAAOgqF,EAAgBhqF,KAAO,QACpEiqF,EAAmBjqF,KAAOkqF,EAAoBlqF,KAAO,QACvD,MAAOtL,IAIT,GAAI02F,IAAmBtB,EAAgBC,EAAiBC,GACpDqB,EAAgBx0E,EAAY,IAAK,MAAO0B,UAAW,sBACnD+yE,EAAiBz0E,EAAY,IAAK,MAAO0B,UAAW,uBACpDsxE,EAAY,EACZ0B,EAAmB10E,EAAY,KAAMu0E,GACrCI,EAAe,SAAS52F,GACxBi1F,EAAYj1F,CACZ,KAAK,GAAIO,GAAI,EAAOP,EAAJO,IAASA,EACrBi2F,EAAgBj2F,GAAG2nB,MAAMC,QAAU,OACvC,KAAK,GAAI5nB,GAAIP,EAAGO,EAAIi2F,EAAgB11F,SAAUP,EAC1Ci2F,EAAgBj2F,GAAG2nB,MAAMC,QAAU,OAE3CsuE,GAAcnuE,iBAAiB,QAAS,SAASvJ,GAC7B,EAAZk2E,IACA2B,EAAa3B,EAAY,GACzBQ,EAAY,SAEjB,GACHiB,EAAepuE,iBAAiB,QAAS,SAASvJ,GAC1Ck2E,EAAY,IACZ2B,EAAa3B,EAAY,GACzBQ,EAAY,SAEjB,EAEH,IAAIoB,GAAe50E,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,QAChE4rF,EAAe70E,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,SAChE6rF,EAAgB90E,EAAY,QAAS,MAAO7W,KAAM,aAClD4rF,EAAgB/0E,EAAY,QAAS,MAAO7W,KAAM,aAElD6rF,EAAkBh1E,EAAY,QAAS,MAAO7W,KAAM,WAAYqhB,QAAqCxjB,SAA5Bqa,EAAK8G,qBAC9E8sE,EAAuBj1E,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAOoY,EAAK8G,mBAAoBuU,UAAWs4D,EAAgBxqE,UAE5H0qE,EAAkBl1E,EAAY,QAAS,MAAO7W,KAAM,OAAQF,MAAO,OAEnEksF,EAAan1E,EAAY,QAAS,MAAO7W,KAAM,aAC/CisF,EAAYp1E,EAAY,QAAS,MAAO7W,KAAM,SAC9CksF,EAAcr1E,EAAY,QAAS,MAAO7W,KAAM,aAEhDmsF,EAAY,IAChB,IAAIj0E,EAAKvT,WAAWorC,OAAOr6C,OAAS,EAChC,CAAQy2F,EAAYj0E,EAAKvT,WAAWorC,OAAO,GAAGjzB,MAGlD,GAAI+d,GAAU,WA8BV,GA7BgC,gBAArB3iB,GAAK+G,OAAOzmB,KACnByyF,EAAcnrF,MAAQoY,EAAK+G,OAAOzmB,KAElCyyF,EAAcnrF,MAAQoY,EAAKgH,UAAU1mB,KAEzC0yF,EAAiB7pE,QAAUnJ,EAAKgb,OAE5Bhb,EAAKuY,YACLs7D,EAAgBjsF,MAAQ,GAAKoY,EAAKuY,YAC3B07D,GAAaA,EAAUpnF,SAC9BgnF,EAAgBjsF,MAAQ,GAAKqsF,EAAUpnF,QAGL,gBAA3BmT,GAAK8G,oBACZ6sE,EAAgBxqE,SAAU,EAC1ByqE,EAAqBv4D,UAAW,EAC5BjxB,WAAWwpF,EAAqBhsF,QAAUoY,EAAK8G,qBAC/C8sE,EAAqBhsF,MAAQoY,EAAK8G,sBAEtC6sE,EAAgBxqE,SAAU,EAC1ByqE,EAAqBv4D,UAAW,GAGN,gBAAnBrb,GAAKsnC,WACZysC,EAAUnsF,MAAQ,GAAKoY,EAAKsnC,WAE5BysC,EAAUnsF,MAAQ,IAAMoY,EAAKgH,UAAUsgC,YAActnC,EAAKvB,QAAQsO,mBAGlE/M,EAAKvT,WAAWorC,OAAOr6C,OAAS,EAAG,CAMnC,IAAK,GALDZ,GAAI,KACJs3F,GAAe,EAAOC,GAAuB,EAC7C7oD,EAAUtrB,EAAKvB,QAAQ8sB,sBACvB6oD,EAAmB,EAEd76D,EAAK,EAAGA,EAAKvZ,EAAKvT,WAAWorC,OAAOr6C,SAAU+7B,EAAI,CACvD,GAAI8gB,GAAKr6B,EAAKvT,WAAWorC,OAAOte,EAChC,KAAI8gB,EAAGpiC,MAAQoiC,EAAGpiC,MAAQqzB,EAA1B,GAGE8oD,CACF,IAAIl4D,GAAKlc,EAAKvT,WAAWorC,OAAOte,GAAI3U,KAE/BhoB,KACDA,EAAIq3F,EAAY/3D,IAGJ,YAAZA,EAAGvvB,OAAmC,aAAZuvB,EAAGvvB,OAAoC,YAAZuvB,EAAGvvB,OAAuBqtC,EAAiB9d,EAAGqxB,YAC9F2mC,IACDt3F,EAAIq3F,EAAY/3D,GACpBg4D,GAAiB,IAGzB,IAAKt3F,EACD,MAGJi2F,GAAejuE,MAAMC,QAAWuvE,GAAoBp0E,EAAKvT,WAAWorC,OAAOr6C,OAAU,OAAS,SAE9F22F,EAAuBD,GAAsC,GAApBE,CACxBx3F,GAAE0Q,QAAU1Q,EAAEovD,MAE3BkoC,IACAG,GAAOzvE,MAAMC,QAAU,YACvByvE,GAAO1vE,MAAMC,QAAU,YACvB0vE,GAAQ3vE,MAAMC,QAAU,OACxB2vE,GAAS5vE,MAAMC,QAAU,SAEzBwvE,GAAOzvE,MAAMC,QAAU,OACvByvE,GAAO1vE,MAAMC,QAAU,OACvB0vE,GAAQ3vE,MAAMC,QAAU,YACxBivE,EAAW3qE,QAAU6wB,EAAiBi6C,EAAUjnF,MAChD+mF,EAAU14D,UAAY2e,EAAiBi6C,EAAUjnF,MACjDwnF,GAAS5vE,MAAMC,QAAU,YACzBmvE,EAAY7qE,QAAU6wB,EAAiBi6C,EAAUhnF,QAGjDknF,GACAM,EAAS7vE,MAAMC,QAAU,YACzB6vE,EAAS9vE,MAAMC,QAAU,cAEzB4vE,EAAS7vE,MAAMC,QAAU,OACzB6vE,EAAS9vE,MAAMC,QAAU,OAI7B,IAAI8sE,GAAY,CACZ/0F,GAAEyQ,QACFukF,EAAehqF,MAAQstC,EAAiBt4C,EAAEyQ,QAAQipC,cAC9C15C,EAAE0Q,SACFukF,EAAgBjqF,MAAQstC,EAAiBt4C,EAAE0Q,QAAQgpC,cAC/C15C,EAAEsvD,QACF4lC,EAAgBlqF,MAAQstC,EAAiBt4C,EAAEsvD,QAAQ5V,cACnDq7C,EAAY,GAEZA,EAAY,IAIL,YAAX/0F,EAAE+P,OAAkC,OAAX/P,EAAE+P,OAAkB/P,EAAEmQ,QAC/C6kF,EAAehqF,MAAQstC,EAAiBt4C,EAAEmQ,SAASupC,cAC5C15C,EAAEgQ,UACTglF,EAAehqF,MAAQstC,EAAiBt4C,EAAEgQ,SAAS0pC,eAG3Dg9C,EAAa3B,GAET/0F,EAAEqzD,aACF8hC,EAAmBnqF,MAAQstC,EAAiBt4C,EAAEqzD,YAAY3Z,eAAiB15C,EAAEqzD,YAC7ErzD,EAAEozD,cACFgiC,EAAoBpqF,MAAQstC,EAAiBt4C,EAAEozD,aAAa1Z,eAAiB15C,EAAEozD,aAC/EhW,EAAiBp9C,EAAE2wD,SACnB0lC,EAAWrrF,MAAQ,UAEnBqrF,EAAWrrF,MAAQhL,EAAE+P,KAGzB,IAAIgoF,GAAaC,CACjB,IAAcjvF,SAAV/I,EAAEiiE,IAAmB,CACrB,GAAI/zD,GAAIV,WAAWxN,EAAEiiE,IAChB1oD,OAAMrL,KACP6pF,EAAc7pF,GAUtB,GARKkV,EAAKs5C,iBAA8B3zD,SAAV/I,EAAEiiE,KAAuCl5D,SAAlBqa,EAAKq5C,UAItDo6B,EAActqE,SAAU,EACxBoqE,EAAal4D,UAAW,IAJxBo4D,EAActqE,SAAU,EACxBoqE,EAAal4D,UAAW,GAMd11B,SAAV/I,EAAEqiE,IAAmB,CACrB,GAAIn0D,GAAIV,WAAWxN,EAAEqiE,IAChB9oD,OAAMrL,KACP8pF,EAAc9pF,GAEjBkV,EAAKw5C,iBAA8B7zD,SAAV/I,EAAEqiE,KAAuCt5D,SAAlBqa,EAAKu5C,UAItDm6B,EAAcvqE,SAAU,EACxBqqE,EAAan4D,UAAW,IAJxBq4D,EAAcvqE,SAAU,EACxBqqE,EAAan4D,UAAW,GAMP11B,QAAjBqa,EAAKq5C,WACLs7B,EAAc30E,EAAKq5C,UAEF1zD,QAAjBqa,EAAKu5C,WACLq7B,EAAc50E,EAAKu5C,UAEI,gBAAhBo7B,IAA4BA,GAAevqF,WAAWmpF,EAAa3rF,SAC1E2rF,EAAa3rF,MAAQ+sF,GAEE,gBAAhBC,IAA4BA,GAAexqF,WAAWopF,EAAa5rF,SAC1E4rF,EAAa5rF,MAAQgtF,EAGzB,IAAIC,GAAW5D,EAAYjxE,EAAKvT,WAC5BooF,IACAC,EAAelwE,MAAMC,QAAU,YAC/BkwE,EAAkB5rE,QAAmC,aAAxB0rE,EAAShlC,WACtCmlC,EAAapwE,MAAMC,QAAU,YAC7BowE,EAAgB9rE,QAAW6wB,EAAiB66C,EAAS9vC,cACrDmwC,EAAkBtwE,MAAMC,QAAU,YAClCswE,EAAqBhsE,QAAuCxjB,SAA5BkvF,EAAS3kC,gBAAgC2kC,EAAS3kC,kBAAmB,EACrGl9C,QAAQC,IAAI4hF,EAAS3kC,kBAErB4kC,EAAelwE,MAAMC,QAAU,OAC/BmwE,EAAapwE,MAAMC,QAAU,OAC7BqwE,EAAkBtwE,MAAMC,QAAU,QAGlCgwE,GAAYE,EAAkB5rE,UAAYgrE,GAC1CiB,GAAmBxwE,MAAMC,QAAU,YACnCwwE,GAAoBzwE,MAAMC,QAAU,cAEpCuwE,GAAmBxwE,MAAMC,QAAU,OACnCwwE,GAAoBzwE,MAAMC,QAAU,QAIxCqvE,GAAkBl0E,EAAKvB,QAAQoI,uBAAuB7G,EAAK4G,cAAe,aAC1E0uE,GAAa1wE,MAAMC,QAAU,YAE7BywE,GAAa1wE,MAAMC,QAAU,QAGjCkwE,EAAoBp2E,EAAY,QAAS,MAAO7W,KAAM,aACtDgtF,EAAiBn2E,EAAY,MAC5BA,EAAY,KAAM,kCAClBA,EAAY,KAAMo2E,IACvBA,GAAkB/vE,iBAAiB,SAAU,SAASvJ,GAClD,GAAI2+B,GAAMD,EAAen6B,EAAKvT,YAC1BooF,EAAW5D,EAAY72C,EAC3By6C,GAAShlC,WAAaklC,EAAkB5rE,QAAU,WAAa,OAC/DnJ,EAAKoyE,gBAAgBh4C,IAGzB,IAAI66C,GAAkBt2E,EAAY,QAAS,MAAO7W,KAAM,aACpDktF,EAAer2E,EAAY,MAC1BA,EAAY,KAAM,mBAClBA,EAAY,KAAMs2E,IACvBA,GAAgBjwE,iBAAiB,SAAU,SAASvJ,GAChD,GAAI2+B,GAAMD,EAAen6B,EAAKvT,YAC1BooF,EAAW5D,EAAY72C,EAC3By6C,GAAS9vC,aAAekwC,EAAgB9rE,QAAU,MAAQ,KAC1DnJ,EAAKoyE,gBAAgBh4C,IAGzB,IAAI+6C,GAAuBx2E,EAAY,QAAS,MAAO7W,KAAM,aACzDotF,EAAoBv2E,EAAY,MAC/BA,EAAY,KAAM,mDAClBA,EAAY,KAAMw2E,IACvBA,GAAqBnwE,iBAAiB,SAAU,SAASvJ,GACrD,GAAI2+B,GAAMD,EAAen6B,EAAKvT,YAC1BooF,EAAW5D,EAAY72C,EAC3By6C,GAAS3kC,gBAAkBilC,EAAqBhsE,QAChDnW,QAAQC,IAAI4hF,EAAS3kC,gBACrBlwC,EAAKoyE,gBAAgBh4C,IAGzB,IAAIq6C,GAAW91E,EAAY,MAClBA,EAAY,KAAM,SAClBA,EAAY,KAAMs0E,KACvByB,EAAW/1E,EAAY,MAClBA,EAAY,MAAO,YAAaw0E,EAAeC,IAC/CC,IACL+B,GAAqBz2E,EAAY,MAC5BA,EAAY,KAAM,qBAClBA,EAAY,KAAMozE,KACvBsD,GAAsB12E,EAAY,MAC7BA,EAAY,KAAM,sBAClBA,EAAY,KAAMqzE,KACvBqC,GAAS11E,EAAY,MAChBA,EAAY,KAAM,aAClBA,EAAY,MAAO80E,EAAe,IAAKF,MAC5Ce,GAAS31E,EAAY,MAChBA,EAAY,KAAM,aAClBA,EAAY,MAAO+0E,EAAe,IAAKF,MAC5C8B,GACC32E,EAAY,MACRA,EAAY,KAAM,mBAClBA,EAAY,MAAOg1E,EAAiB,IAAKC,MAC9CW,GAAU51E,EAAY,MACjBA,EAAY,KAAM,iBAClBA,EAAY,MAAOm1E,EAAY,WAAYC,MAChDS,GAAW71E,EAAY,MAClBA,EAAY,KAAM,kBAClBA,EAAY,KAAMq1E,KAGvBuB,GAAY52E,EAAY,SACvBA,EAAY,MACRA,EAAY,KAAM,WAAaqC,MAAO,QAASyxC,UAAW,UAC1DsgC,IAEJp0E,EAAY,MACRA,EAAY,KAAM,cAClBq0E,IAEJr0E,EAAY,MACRA,EAAY,KAAM,UAClBA,EAAY,KAAMk1E,KAEvBY,EACAC,EACAU,GACAC,GACAhB,GACAC,GACAgB,GACAf,GACAC,GACAM,EACAE,EACAE,GAIJvyD,KAEA0vD,EAAS7yE,YAAY+1E,GAErB,IAAIzrE,IAAcnL,EAAY,SAAU,eAAgB0B,UAAW,QAAS0J,WAAY,OAAQC,YAAa,OAAQnF,QAAS,SAC9HiF,IAAY9E,iBAAiB,QAAS,SAASvJ,GAC3CuE,EAAKw1E,gBACN,GACHnD,EAAS7yE,YAAYsK,IAErBipE,EAAc/tE,iBAAiB,QAAS,SAASvJ,GAC7CuE,EAAK0Y,aAAap4B,KAAMyyF,EAAcnrF,UACvC,GAEHorF,EAAiBhuE,iBAAiB,SAAU,SAASvJ,GACjDuE,EAAK0Y,aAAasC,OAAQg4D,EAAiB7pE,YAC5C,EAEH,KAAK,GAAIynB,IAAK,EAAGA,GAAKsiD,EAAgB11F,SAAUozC,GAC5CsiD,EAAgBtiD,IAAI5rB,iBAAiB,SAAUmtE,GAAa,EAGhEJ,GAAmB/sE,iBAAiB,SAAUmtE,GAAa,GAC3DH,EAAoBhtE,iBAAiB,SAAUmtE,GAAa,GAE5Dc,EAAWjuE,iBAAiB,SAAU,SAASvJ,GAC3C,GAAI2+B,GAAM63C,EAAiB,SAASrmF,GACP,YAArBqnF,EAAWrrF,OACXgE,EAAG2hD,SAAU,EACb3hD,EAAGe,MAAQ,MACXf,EAAG8gD,KAAO,MAEV9gD,EAAGe,MAAQsmF,EAAWrrF,MACtBgE,EAAG2hD,QAAU5nD,QAEjB+rF,EAAe9lF,IAEnBoU,GAAKoyE,gBAAgBh4C,KACtB,GAEHq5C,EAAczuE,iBAAiB,SAAU,SAASvJ,GAC9C,GAAIuqB,IAAQszB,iBAAkBm6B,EAActqE,QAC5CoqE,GAAal4D,UAAYo4D,EAActqE,OACvC,IAAIre,GAAIV,WAAWmpF,EAAa3rF,MAC5B6rF,GAActqE,SAAwB,gBAANre,KAAmBqL,MAAMrL,KACzDk7B,EAAKqzB,SAAWjvD,WAAWU,IAC/BkV,EAAK0Y,YAAYsN,KAErButD,EAAavuE,iBAAiB,QAAS,SAASvJ,GAC5C,GAAI3Q,GAAIV,WAAWmpF,EAAa3rF,MACf,iBAANkD,IAAmBqL,MAAMrL,IAChCkV,EAAK0Y,aAAa2gC,SAAUvuD,MACjC,GAEH4oF,EAAc1uE,iBAAiB,SAAU,SAASvJ,GAC9C,GAAIuqB,IAAQwzB,iBAAkBk6B,EAAcvqE,QAC5CqqE,GAAan4D,UAAYq4D,EAAcvqE,OACvC,IAAIre,GAAIV,WAAWopF,EAAa5rF,MAC5B8rF,GAAcvqE,SAAwB,gBAANre,KAAmBqL,MAAMrL,KACzDk7B,EAAKuzB,SAAWnvD,WAAWU,IAC/BkV,EAAK0Y,YAAYsN,KAErBwtD,EAAaxuE,iBAAiB,QAAS,SAASvJ,GAC5C,GAAI3Q,GAAIV,WAAWopF,EAAa5rF,MACf,iBAANkD,IAAmBqL,MAAMrL,IAChCkV,EAAK0Y,aAAa6gC,SAAUzuD,MACjC,GAEH+oF,EAAgB7uE,iBAAiB,QAAS,SAASvJ,GAC/C,GAAI3Q,GAAIV,WAAWypF,EAAgBjsF,MAClB,iBAANkD,IAAmBqL,MAAMrL,IAChCkV,EAAK0Y,aAAaD,OAAQv3B,KAAKC,IAAI,IAAO,EAAF2J,OAC7C,EAEH,IAAI2qF,IAAc,WAEd,GADA7B,EAAqBv4D,UAAYs4D,EAAgBxqE,QAC7CwqE,EAAgBxqE,QAAS,CACzB,GAAIre,GAAIV,WAAWwpF,EAAqBhsF,MACvB,iBAANkD,IAAmBqL,MAAMrL,IAChCkV,EAAK0Y,aAAa5R,mBAAoB1c,WAAWwpF,EAAqBhsF,aAG1EoY,GAAK0Y,aAAa5R,mBAAoB,OAG9C6sE,GAAgB3uE,iBAAiB,SAAU,SAASvJ,GAChDg6E,OACD,GACH7B,EAAqB5uE,iBAAiB,QAAS,SAASvJ,GACpDg6E,OACD,GAEHzB,EAAYhvE,iBAAiB,SAAU,SAASvJ,GAC5C,GAAI2+B,GAAM63C,EAAiB,SAASrtE,GAChCA,EAAM3X,MAAQ+mF,EAAY7qE,QAAU,MAAQ,MAEhDnJ,GAAKoyE,gBAAgBh4C,KACtB,GACH05C,EAAW9uE,iBAAiB,SAAU,SAASvJ,GAC3C,GAAI2+B,GAAM63C,EAAiB,SAASrtE,GAChCA,EAAM5X,KAAO8mF,EAAW3qE,QAAU,MAAQ,MAE9CnJ,GAAKoyE,gBAAgBh4C,KACtB,GACH25C,EAAU/uE,iBAAiB,QAAS,SAASvJ,GACzC,GAAI3Q,GAAId,SAAS+pF,EAAUnsF,MACV,iBAANkD,IAAkBA,EAAI,GAC7BkV,EAAK0Y,aAAa4uB,WAAYx8C,MAEnC,GAGHtH,KAAKqkB,cAAcwqE,GACnB7uF,KAAK0e,UAAU,QAEflC,EAAK8E,gBAAgB6d,EAErB,IAAI+yD,IAAe11E,EAAKvB,QAAQsY,KAChC/W,GAAKvB,QAAQmF,gBAAgB,WACrB5D,EAAKvB,QAAQsY,OAAS2+D,KACtBA,GAAe11E,EAAKvB,QAAQsY,MAC5B4L,WlDw/jBbzY,aAAa,EAAE21B,UAAU,EAAEtyC,QAAQ,GAAGogC,kBAAkB,GAAGlgC,UAAU,KAAKkoF,IAAI,SAAS34F,EAAQU,EAAOJ,GmDtklBzG,YAgCA,SAASy1B,GAAQtU,EAAS0c,EAAQpU,EAAQqX,GAC1C,GAAAtH,GAAAtzB,IAuCI,IAtCAA,KAAKujB,OAASA,MACdvjB,KAAKyH,GAAK,UAAY2qF,EACtBpyF,KAAKib,QAAUA,EACfjb,KAAKwjB,UAAY1d,EAAY6xB,GAC7B33B,KAAK46B,WAAaA,EAElB56B,KAAKw7B,SAAWrgB,EAAY,SAAU,MACTqC,MAAO,KAAsC,EAA/Bxd,KAAKib,QAAQkO,mBAAuB,KAClD8L,OAAQ,KACRpY,UAAW,kBACX01C,SAAU,eACVpzC,OAAQ,MAAOkzE,OAAQ,QACpDryF,KAAKykC,eAAiBtpB,EAAY,MAAOnb,KAAKw7B,UAAW3e,UAAW,yBACjC+d,WAAYA,EACZ23B,SAAU,WACVp3B,QAAS,MAAOhc,OAAQ,MACxBkzE,OAAQ,MACR12D,KAAM,UACN22D,UAAW,UAC9CtyF,KAAK0kC,QAAUvpB,EAAY,SAAU,MAC/BqC,QAA0C,EAA/Bxd,KAAKib,QAAQkO,mBACxB8L,OAAQ,KACRpY,UAAW,qBAEjB7c,KAAKuyF,SAAWp3E,EAAY,MAAO,IAAK0B,UAAW,aACnD7c,KAAKwyF,eAAiBr3E,EAAY,MAAOnb,KAAKuyF,UAAW11E,UAAW,oBACpE7c,KAAKynC,aAAetsB,EAChB,SAAU,MACTqC,MAAO,KAAMyX,OAAQ,KACrBpY,UAAW,kBAEhB7c,KAAKm8B,aAAehhB,EAAY,IAAK,MAAO0B,UAAW,gBACvD7c,KAAKu8B,WAAaphB,EAAY,IAAK,MAAO0B,UAAW,sBACrD7c,KAAKslC,aAAerqB,EAAQ6W,WAAW,IACvC9xB,KAAKslC,aAAalkB,MAAMC,QAAU,OAClCrhB,KAAKi3B,YAAc9b,EAAY,MAAOnb,KAAKwjB,UAAU2wB,MAAOt3B,UAAW,qBACvE7c,KAAKq8B,WAAalhB,EAAY,UAAY0B,UAAW,aACrD7c,KAAKq8B,WAAWrgB,YAAYhc,KAAKm8B,cAC7BxE,EAAOw0D,QACPnsF,KAAKq8B,WAAWrgB,YAAYb,EAAY,MAAO,MAAOgK,IAAKwS,EAAOw0D,QAAS3uE,MAAO,KAAMyX,OAAQ,YAC7F,IAAI0C,EAAOzK,QAAS,CACvB,GAAI3hB,GAAU,IACVvL,MAAKib,QAAQ4N,OAAO8O,EAAOzK,WAC3B3hB,EAAUvL,KAAKib,QAAQ4N,OAAO8O,EAAOzK,SAASyT,OAAOp1B,SACrDA,GACAvL,KAAKq8B,WAAWrgB,YAAYb,EAAY,OAAQ,GAAK5P,EAAS,MAAO+3D,SAAU,MAAO1oC,WAAY,QAAS9zB,MAAO,QAASksD,YAAa,MAAOC,aAAc,MAAOw/B,WAAY,MAAOzD,cAAe,MAAOzoE,WAAY,MAAOmsE,aAAc,UAEtP1yF,KAAK2yF,YAAcx3E,EAAY,OAAQwc,EAAO76B,MAC9CkD,KAAKq8B,WAAWrgB,YAAYb,EAAY,QAASnb,KAAK2yF,YAAa3yF,KAAKi3B,cAAepa,UAAW,uBAClG7c,KAAKq8B,WAAWrgB,YAAYhc,KAAKu8B,YACjCv8B,KAAKq8B,WAAWrgB,YAAYhc,KAAKslC,cAEjCtlC,KAAK0G,MAAQyU,EAAY,QACrBnb,KAAKq8B,aACLxf,UAAW,yBAEf,IAAI+1E,GAAU,QAAUj7D,EAAO9a,UAAY,IAAM8a,EAAO9a,UAAY,GACpE7c,MAAKy2B,IAAMtb,EAAY,OAAQnb,KAAKykC,eACLzkC,KAAK0kC,QACL1kC,KAAKynC,eACX5qB,UAAW+1E,IAE/Bh4D,IACD56B,KAAKy2B,IAAIrV,MAAMwZ,WAAa,QAG3B3f,EAAQmP,iBACTpqB,KAAKy2B,IAAIza,YAAYhc,KAAK0G,OAC9B1G,KAAKy2B,IAAIza,YAAYhc,KAAKwyF,gBAE1BxyF,KAAKu0B,aAAe,GACpBv0B,KAAKq3B,QAAS,EACdr3B,KAAK6yF,YAAc,EACfl7D,EAAOrU,qBACPtjB,KAAKsjB,mBAAqBqU,EAAOrU,oBAEjCtjB,KAAKwjB,UAAU4T,sBACfp3B,KAAKq3B,QAAS,GAElBr3B,KAAK8yF,eAAgB,EAEjBn7D,EAAOo7D,mBACP/yF,KAAKm8D,qBAAqBxkC,EAAOo7D,mBAGrC/yF,KAAKq+E,aAEL,IAAIv8E,GAAQ9B,IACRA,MAAKojB,eAAiBpjB,KAAKojB,cAAciqD,iBAAmB11C,EAAOq7D,qBACnEhzF,KAAKojB,cAAciqD,eAAe,SAASqT,GACnCA,GACA5+E,EAAMq6D,qBAAqBukB,KAInC1gF,KAAKojB,eAAiBpjB,KAAKojB,cAAcsuD,uBACzC1xE,KAAKizF,kBAAoB,SAASC,GAC9BpxF,EAAM6zB,OAAOu9D,EAAO,KAExBlzF,KAAKojB,cAAcsuD,qBAAqB1xE,KAAKizF,oBAG7CjzF,KAAKojB,eAAiBpjB,KAAKojB,cAAcmuD,sBACzCvxE,KAAKmzF,iBAAmB,SAASv+B,GACzBA,EAAO,EACP9yD,EAAMwjC,aAAalkB,MAAMC,QAAU,eAEnCvf,EAAMwjC,aAAalkB,MAAMC,QAAU,OAEvCvf,EAAMmZ,QAAQmqB,gBAElBplC,KAAKojB,cAAcmuD,oBAAoBvxE,KAAKmzF,mBAGhDnzF,KAAKozF,aACLpzF,KAAKqzF,2BACLrzF,KAAKy4B,mBAAqB,GAAI5gB,GAAQ,SAACiC,EAAS+U,GAAV,MAAqByE,GAAKggE,2BAA6Bx5E,InD47kBjG,GAAI5C,GAA4B,kBAAXK,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAO5X,UAAY,eAAkB8X,GmDhllBtQ,IAAwB,mBAAbje,GACP,GAAIqM,GAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,YACpBE,EAAiBxV,EAAMwV,eACvBvV,EAAcD,EAAMC,YAEpBupB,GADUxpB,EAAMo2D,QACFp2D,EAAMwpB,aACpBsW,EAAe9/B,EAAM8/B,aAErBngC,EAAMhM,EAAQ,SACdiM,EAAgBD,EAAIC,cACpBC,EAAWF,EAAIE,SAEfiS,EAAOne,EAAQ,UACfoe,EAAWD,EAAKC,SAEhBwJ,EAAQ5nB,EAAQ,WAChBkrF,EAActjE,EAAMsjE,YACpBtG,EAAiBh9D,EAAMg9D,eAEvB1yB,EAAKlyD,EAAQ,mBACbw2B,EAAgB07B,EAAG17B,cAEnBnY,EAAUre,EAAQ,eAAeqe,QAEjC0lD,EAAe/jE,EAAQ,cAAc+jE,YAG7C,IAAI60B,GAAgB,CAmpBpB,IAxhBA7iE,EAAQ5vB,UAAUuwB,QAAU,WACpBlwB,KAAKojB,cAAcyuD,yBACnB7xE,KAAKojB,cAAcyuD,wBAAwB7xE,KAAKizF,mBAEhDjzF,KAAKojB,cAAc0uD,wBACnB9xE,KAAKojB,cAAc0uD,uBAAuB9xE,KAAKmzF,mBAIvD5jE,EAAQ5vB,UAAUu/B,cAAgB,SAASxkC,GACvCsF,KAAK46B,WAAalgC,EAClBsF,KAAKykC,eAAerjB,MAAMwZ,WAAalgC,GAG3C60B,EAAQ5vB,UAAUtD,SAAW,WACzB,MAAO2D,MAAKyH,IAGhB8nB,EAAQ5vB,UAAUw8D,qBAAuB,SAAS5hE,GACzCyF,KAAKo8D,qBACNp8D,KAAKo8D,uBACTp8D,KAAKo8D,mBAAmBl/D,KAAK3C,IAGjCg1B,EAAQ5vB,UAAU49B,KAAO,WACrB,GAAI/gB,GAAOxc,IACX,OAAO,IAAI6X,GAAQ,SAAUiC,EAAS+U,GAE9BrS,EAAKgH,UAAUpC,OACf5E,EAAK+2E,eAAel/C,OAAQ73B,EAAKgH,UAAUpC,QAC3CtH,EAAQ0C,KAERA,EAAKlD,OAAS,sBACdkD,EAAKoiE,gBAAgB,SAASlmD,EAAI/e,GAC9B,GAAIA,IAAQ+e,EAAI,CACZlc,EAAK8R,MAAQ,eACb,IAAIoK,GAAK,GAAIjzB,GACT05E,EAAW,GAAIz5E,EACnBy5E,GAASh2E,MAAQ,MACjBg2E,EAAS/1E,QAAU,OACnB+1E,EAAS51E,QAAU,QACnBmvB,EAAGpvB,WAAWhF,KAAM,WAAY,KAAM66E,GACtC3iE,EAAK+2E,cAAc76D,OAEnBlc,GAAK+2E,cAAc76D,GACfA,EAAGioD,WACHnkE,EAAKgH,UAAU4T,qBAAsB,EACrC5a,EAAK6a,QAAS,EACd7a,EAAKkhB,eAETlhB,EAAKmhB,mBAET7jB,GAAQ0C,SAMxB+S,EAAQ5vB,UAAU4zF,cAAgB,SAAS76D,GACvC14B,KAAKwzF,eAAiB1tF,EAAY4yB,EAClC,KAAK,GAAI3C,GAAK,EAAGA,EAAK/1B,KAAKwzF,eAAen/C,OAAOr6C,SAAU+7B,EAAI,CAC3D,GAAI8gB,GAAK72C,KAAKwzF,eAAen/C,OAAOte,GAAMjwB,EAAY9F,KAAKwzF,eAAen/C,OAAOte,GACjF8gB,GAAGC,UAAYD,EAAGE,SAAWF,EAAGG,QAAU,KAC1CH,EAAGz1B,MAAQtb,EAAY+wC,EAAGz1B,OAC1By1B,EAAGz1B,MAAM3Z,GAAK,WAAazH,KAAK6yF,YAEpC7yF,KAAKyzF,uBAAyB77E,EAASyX,EAAYrvB,KAAKwzF,iBACxDxzF,KAAK29B,qBAGTpO,EAAQ5vB,UAAUmqE,UAAY,WAC1B,MAAO9pE,MAAKojB,eAGhBmM,EAAQ5vB,UAAUggF,gBAAkB,SAASpsD,GACzC,GAAImgE,GAAM1zF,KAAKkqE,sBAAsB32C,EACrC,OAAImgE,GACOA,EAAIvpB,WADf,QAIJ56C,EAAQ5vB,UAAUuqE,sBAAwB,SAAS32C,GAC/C,GAAIuU,GAAU9nC,KAAKib,QAAQ8sB,qBAE3B,IAAI/nC,KAAKiJ,WAAY,CAGjB,IAAK,GAFDorC,GAAS,GAAI+pC,GACb1lD,EAAK14B,KAAKiJ,WAAWorC,OAChBte,EAAK,EAAGA,EAAK2C,EAAG1+B,SAAU+7B,EAAI,CACnC,GAAI8gB,GAAKne,EAAG3C,EACP8gB,GAAGpiC,MAAQoiC,EAAGpiC,MAAQqzB,GACvBuM,EAAO13B,IAAI,GAAI+nE,GAAY7tC,EAAGvyC,KAAMuyC,EAAGwC,OAAQxC,EAAGnwC,QAG1D,MAAO2tC,KAIf9kB,EAAQ5vB,UAAUqqE,cAAgB,SAASz2C,GACvC,GAAIogE,GAAuB,QAAvBA,GAAgCv6F,GAChC,MAAIA,GAAEslF,QAAUtlF,EAAEulF,SAAWvlF,EAAEolF,QAAUplF,EAAEqlF,SAChC,EACArlF,EAAEsrC,QACFtrC,EAAEsrC,QAAQkvD,KAAKD,IAEf,EAIf,OAAI3zF,MAAKi8B,gBAA0B,EAAR1I,GAChB,EACAogE,EAAqB3zF,KAAKwjB,YAAsB,GAAR+P,GACxC,GAEJ,GAGXhE,EAAQ5vB,UAAU8qE,YAAc,SAASjpE,EAAK69D,EAAU9rC,EAAOtiB,EAAU2mC,GACrE53C,KAAK+mC,gBAAkB91B,EACvBjR,KAAK+8C,gBAAkBnF,EACvB53C,KAAK6zF,SAAWryF,EAChBxB,KAAKwmD,cAAgB6Y,EAIjBpuD,IACAssD,EAAav9D,MACbA,KAAK8zF,yBAKbvkE,EAAQ5vB,UAAU23D,KAAO,WACrB9nD,QAAQC,IAAI,qDAGhB8f,EAAQ5vB,UAAUyoC,gBAAkB,SAAS5mC,EAAKsB,EAAKuQ,EAAK60B,EAAO3sC,GAC/D,GAAIyE,KAAKsjB,mBAAoB,CACzB,GAAI9F,GAAQxd,KAAKib,QAAQmR,QAAUpsB,KAAKib,QAAQkR,UAAY,CAC5DrpB,GAAOA,EAAS0a,EAAQnK,EAAO,EAAI,EACnCrT,KAAKojB,cAAcivD,qBAAqB7wE,EAAKsB,EAAKuQ,EAAKrT,KAAKsjB,mBAAoB/nB,OAC7E,CACH,GAAIyE,KAAKwmD,eAAiB1jD,GAAO9C,KAAKwmD,cAAc7oD,OAASmF,GAAO9C,KAAKwmD,cAAc1mD,OAC/EE,KAAK+mC,gBAAiB,CAEtB,IAAK,GADDpzB,GAAc,KACTG,EAAK,EAAGA,EAAK9T,KAAK+mC,gBAAgB/sC,SAAU8Z,EAAI,CACrD,GAAIpa,GAAIsG,KAAK+mC,gBAAgBjzB,EACxBpa,GAAEiE,KAAQjE,EAAEoG,MAGbpG,EAAEggD,SAAWhgD,EAAEggD,QAAQ1/C,OAAS,IAG1B,EAANqZ,EACa,GAAT60B,GAAcxuC,EAAEoG,KAAOgD,GAAOpJ,EAAEiE,IAAMmF,IACjC6Q,GAAeja,EAAEiE,IAAMgW,EAAYhW,KACnCjE,EAAEiE,KAAOgW,EAAYhW,KAAOjE,EAAEoG,IAAM6T,EAAY7T,OACjD6T,EAAcja,GAEXA,EAAEoG,IAAMgD,KACV6Q,GAAeja,EAAEoG,IAAM6T,EAAY7T,KACnCpG,EAAEoG,KAAO6T,EAAY7T,KAAOpG,EAAEiE,IAAMgW,EAAYhW,KAChDjE,EAAEiE,KAAOgW,EAAYogF,MAAQpgF,EAAY7T,KAAOgD,KACjD6Q,EAAcja,GAIT,GAATwuC,GAAcxuC,EAAEiE,KAAOmF,GAAOpJ,EAAEoG,IAAMgD,IACjC6Q,GAAeja,EAAEoG,IAAM6T,EAAY7T,KACnCpG,EAAEoG,KAAO6T,EAAY7T,KAAOpG,EAAEiE,IAAMgW,EAAYhW,OACjDgW,EAAcja,GAEXA,EAAEiE,IAAMmF,KACV6Q,GAAeja,EAAEiE,IAAMgW,EAAYhW,KACnCjE,EAAEiE,KAAOgW,EAAYhW,KAAOjE,EAAEoG,IAAM6T,EAAY7T,KAChDpG,EAAEoG,KAAO6T,EAAY7T,KAAO6T,EAAYhW,KAAOmF,KAChD6Q,EAAcja,KAK9B,GAAIia,EACA,MAAOpY,GAASoY,EAGhB7Q,GADM,EAANuQ,EACMrT,KAAKib,QAAQojB,WAAW1gC,IAExBqC,KAAKib,QAAQojB,WAAWv+B,IAK1CE,KAAKg0F,aAAaxyF,EAAKsB,EAAKuQ,EAAK9X,KAIzCg0B,EAAQ5vB,UAAUq0F,aAAe,SAASxyF,EAAKsB,EAAKuQ,EAAK9X,GACrD,GAAIs1B,GAAO7wB,IACXA,MAAKojB,cAAcglB,gBAAgB5mC,EAAKsB,EAAKuQ,EAAK,SAASiJ,GAClDA,GACD/gB,EAAS+gB,EAEb,IAAIoc,GAAK7H,EAAK5V,QAAQ0d,mBACjBD,IACDn9B,EAAS+gB,GAEboc,EAAGE,WAAWtc,EAAQ/Y,QAAS,SAASwyB,GAChCA,EACAx6B,EAAS+gB,GAETuU,EAAKmjE,aAAa13E,EAAQ/Y,QAAS8P,EAAM,EAAI,KAAc,EAAGA,EAAK9X,QAMnFg0B,EAAQ5vB,UAAU+9B,YAAc,WAC7B19B,KAAKu8B,WAAW1f,UAAY7c,KAAKq3B,OAAS,qBAAuB,oBAC7Dr3B,KAAKwjB,UAAU4T,oBACdp3B,KAAKu8B,WAAWnb,MAAMC,QAAU,eAEhCrhB,KAAKu8B,WAAWnb,MAAMC,QAAU,QAIxCkO,EAAQ5vB,UAAUu3B,aAAe,WAC7Bl3B,KAAKioC,cAAgBvqC,KAAKoC,IAAIpC,KAAKoC,IAAIE,KAAKu0B,aAAcv0B,KAAK0G,MAAMutF,aAAe,GAAIj0F,KAAKib,QAAQkP,eACrGnqB,KAAKy2B,IAAIrV,MAAM6T,OAAS,GAAKj1B,KAAKioC,cAAgB,KAClDjoC,KAAKib,QAAQic,gBAIjB3H,EAAQ5vB,UAAUmlC,YAAc,WAC5B,GAAI7rC,GAAI+G,KACJtF,EAAIsF,KAAKib,QACT+P,EAAStwB,EAAEswB,QAAUwB,OAAOqc,iBAAmB,CAEnD5vC,GAAEyrC,QAAQzP,OAASh8B,EAAEuiC,SAASvG,OAC9Bh8B,EAAEyrC,QAAQlnB,MAAQwN,EAA+B,EAAtBtwB,EAAEyuB,kBAAwBzuB,EAAEyuB,iBAEvD,IAAItH,GAAI5oB,EAAEyrC,QAAQoY,WAAW,KACzB9xB,IACAnJ,EAAE0R,MAAM,EAAG,EAGf,IAAItK,GAASvuB,EAAEyxB,UACXwa,EAAWjsC,EAAEyxB,UACbya,EAASlsC,EAAE0xB,OAEf,IAAIpsB,KAAKonD,mBAAoB,CACzB,GAAI9sD,IAAW0F,KAAKo7B,iBAAmBp7B,KAAKib,QAAQkR,WAAWnsB,KAAKib,QAAQsY,KAC5E1R,GAAEslC,OACFtlC,EAAEylC,UAAUhtD,EAAQ,EACpB,IAAI+rD,IAAa/rD,EAAS,CACtB0F,MAAKwjB,UAAUib,YACf4nB,GAAa,IACjBrmD,KAAKonD,mBAAmBkQ,KAAKz1C,EAAGwkC,EAAW3rD,EAAEyuB,kBAAkB7uB,GAC/DunB,EAAE27B,UAGN,IAAK,GAAI1kB,GAAK,EAAGA,EAAKp+B,EAAEymB,WAAWnnB,SAAU8+B,EAAI,CAC7C,GAAI4N,GAAIhsC,EAAEymB,WAAW2X,IACf4N,EAAEllC,MAAQ9G,EAAE8G,KAASklC,EAAEllC,MAAS,MAAQ9G,EAAE8G,MAAUklC,EAAE/oC,IAAMipC,GAAUF,EAAE5mC,IAAM6mC,IAChF9kB,EAAE2sC,YAAc9zD,EAAEmvB,sBAClBhI,EAAE6kC,UAAYhsD,EAAEkvB,qBAChB/H,EAAE8kC,UAAUjgB,EAAE/oC,IAAMsrB,GAAUvuB,EAAE64B,MACrB,GACCmT,EAAE5mC,IAAM4mC,EAAE/oC,KAAOjD,EAAE64B,MACpBt6B,EAAEyrC,QAAQzP,SAK7Bh8B,EAAEyrC,QAAQtjB,MAAM5D,MAAQ9iB,EAAEyuB,kBAC1BlwB,EAAEyrC,QAAQtjB,MAAM6T,OAASh8B,EAAEuiC,SAASpa,MAAM6T,OAC1Ch8B,EAAEyrC,QAAQtjB,MAAMua,KAAO;EAI3BpM,EAAQ5vB,UAAUi9C,aAAe,SAAStjC,GACtC,GAAIuX,GAAO7wB,IACX,IAAIsZ,EAAQ,CACRtZ,KAAKsZ,OAASA,EACdtZ,KAAKk0F,mBACIlkE,GAAchwB,KAAKwjB,UACK,YAA7BgJ,OAAOD,SAASK,UAA2E,GAAlDoD,EAAchwB,KAAKwjB,WAAWxmB,QAAQ,UAAkBgD,KAAKm0F,cACtGn0F,KAAKm0F,aAAc,EACnBn0F,KAAKib,QAAQ6tB,oBAAoBhwB,KAC7B,SAASs7E,GACAA,IACDvjE,EAAKwjE,UAAW,EAChBxjE,EAAKqjE,4BAMjBl0F,MAAKsZ,SACLtZ,KAAKsZ,OAAS,KACdtZ,KAAKk0F,sBAKjB3kE,EAAQ5vB,UAAUg2B,OAAS,SAASzG,EAASrzB,GASzC,GARwB,gBAAbA,KACPA,EAAU,KAEVmE,KAAKs0F,sBACLj6E,aAAara,KAAKs0F,qBAClBt0F,KAAKs0F,oBAAsB,MAG3BplE,GAEA,GADAlvB,KAAKu0F,YAAYrlE,GACbrzB,EAAU,EAAG,CACb,GAAIiG,GAAQ9B,IACZA,MAAKs0F,oBAAsBr6E,WAAW,WAClCnY,EAAMoyF,qBACPr4F,QAGPmE,MAAKk0F,qBAIb3kE,EAAQ5vB,UAAU40F,YAAc,SAASrlE,EAASmlE,GAC9Ch5E,EAAerb,KAAKuyF,UAChB8B,EACAr0F,KAAKuyF,SAASv2E,YACVb,EACI,QACCA,EAAY,IAAK,mBAAoBe,KAAMlc,KAAKib,QAAQyQ,eAAgBgX,OAAQ,WAChFxT,KAITlvB,KAAKuyF,SAASxwE,YAAcmN,EAEhClvB,KAAKuyF,SAASnxE,MAAMozE,QAAU,IAGlCjlE,EAAQ5vB,UAAU80F,aAAe,WAC7Bz0F,KAAKuyF,SAASnxE,MAAMozE,QAAU,GAGlCjlE,EAAQ5vB,UAAUu0F,kBAAoB,WAC9Bl0F,KAAKsZ,OACLtZ,KAAKu0F,YAAYv0F,KAAKsZ,OAAQtZ,KAAKq0F,UAEnCr0F,KAAKy0F,gBAIbllE,EAAQ5vB,UAAUqyF,UAAY,SAASzuE,GACnCvjB,KAAKujB,OAASA,MACdvjB,KAAK29B,oBACL39B,KAAK00F,uBAGTnlE,EAAQ5vB,UAAUivF,gBAAkB,SAAS+F,GACzC30F,KAAKk1B,aACDjsB,WAAY0rF,EACZC,mBAAoB50F,KAAKyzF,0BAIjClkE,EAAQ5vB,UAAUu1B,YAAc,SAAS2/D,GACrC,IAAK,GAAIzjF,KAAKyjF,GACV70F,KAAKujB,OAAOnS,GAAKyjF,EAAUzjF,EAE/BpR,MAAK29B,oBACL39B,KAAK00F,uBAGTnlE,EAAQ5vB,UAAUg+B,kBAAoB,WAClC,GAAIm3D,IAAe,EACfC,GAAe,CAEa,iBAArB/0F,MAAKujB,OAAOzmB,KACnBkD,KAAK2yF,YAAY5wE,YAAc/hB,KAAKujB,OAAOzmB,KAE3CkD,KAAK2yF,YAAY5wE,YAAc/hB,KAAKwjB,UAAU1mB,IAElD,IAAIk4F,GAAeh1F,KAAKujB,OAAO0R,QAAUj1B,KAAKwjB,UAAUuR,WACpDigE,IAAgBh1F,KAAK+0B,cACrB/0B,KAAK+0B,YAAcigE,EACnBF,GAAe,GAGf90F,KAAK81D,iBAAmB91D,KAAKujB,OAAOuyC,kBACpC91D,KAAK81D,gBAAkB91D,KAAKujB,OAAOuyC,gBACnCg/B,GAAe,EAGnB,IAAIj/B,GAAmC1zD,QAAxBnC,KAAKujB,OAAOsyC,SAAwB71D,KAAKujB,OAAOsyC,SAAW71D,KAAKwjB,UAAUqyC,QACrF71D,MAAK61D,UAAYA,IACjB71D,KAAK61D,SAAWA,EAChBi/B,GAAe,GAGf90F,KAAKg2D,iBAAmBh2D,KAAKujB,OAAOyyC,kBACpCh2D,KAAKg2D,gBAAkBh2D,KAAKujB,OAAOyyC,gBACnC8+B,GAAe,EAGnB,IAAI/+B,GAAmC5zD,QAAxBnC,KAAKujB,OAAOwyC,SAAwB/1D,KAAKujB,OAAOwyC,SAAW/1D,KAAKwjB,UAAUuyC,QACrF/1D,MAAK+1D,UAAYA,IACjB/1D,KAAK+1D,SAAWA,EAChB++B,GAAe,EAGnB,IAAIxxE,GAAqB,IACcnhB,UAAnCnC,KAAKujB,OAAOD,mBACZA,EAAqBtjB,KAAKujB,OAAOD,mBACUnhB,SAAtCnC,KAAKwjB,UAAUF,qBACpBA,EAAqBtjB,KAAKwjB,UAAUF,oBACpCA,GAAsBtjB,KAAKsjB,qBAC3BtjB,KAAKsjB,mBAAqBA,EAC1BwxE,GAAe,EAInB,IAAI7rF,GAAa,IACbjJ,MAAKujB,OAAOqxE,oBAAsB50F,KAAKyzF,yBACvCxqF,EAAajJ,KAAKujB,OAAOta,YAC7BA,EAAaA,GAAcjJ,KAAKwzF,eAC5BxzF,KAAKiJ,aAAeA,IACpBjJ,KAAKiJ,WAAaA,EAClB6rF,GAAe,EAGnB,IAAIG,GAAsC9yF,SAAvBnC,KAAKujB,OAAOiU,OAAuBx3B,KAAKujB,OAAOiU,OAASx3B,KAAKwjB,UAAUgU,MACtFy9D,KAAiBj1F,KAAKw3B,SACtBx3B,KAAKw3B,OAASy9D,EACdF,GAAe,EAGnB,IAAIG,GAAoBh+E,EAAkC,WAA3BlX,KAAKujB,OAAOugC,YACvC9jD,KAAKujB,OAAOugC,WAAa9jD,KAAKwjB,UAAUsgC,YAAc9jD,KAAKib,QAAQsO,iBACnE2rE,IAAoBl1F,KAAK8jD,aACzB9jD,KAAK8jD,WAAaoxC,EAClBJ,GAAe,EAGnB,IAAIK,EAEAA,GADuBhzF,SAAvBnC,KAAKujB,OAAO8T,OACGr3B,KAAKujB,OAAO8T,OACMl1B,SAA1BnC,KAAKwjB,UAAU6T,OACPr3B,KAAKwjB,UAAU6T,OAEfr3B,KAAKwjB,UAAU4T,qBAAsB,GAAQ,EAE5D+9D,IAAiBn1F,KAAKq3B,SACtBr3B,KAAKq3B,OAAS89D,EACdL,GAAe,EACf90F,KAAK09B,eAGLo3D,GACA90F,KAAKo1F,iBAELL,GACA/0F,KAAKib,QAAQob,gBAGrB9G,EAAQ5vB,UAAUy1F,eAAiB,WAC/B,GAAKp1F,KAAK+mC,gBAAV,CAGA,GAAIvqB,GAAOxc,IAENA,MAAKq1F,gBACNr1F,KAAKq1F,cAAgBp7E,WAAW,WAC5BsjD,EAAa/gD,EAEb,IAAIuL,GAAWvL,EAAKvB,QAAQijB,gBAAgB1hB,EAC5CuL,GAAS0S,SAASje,GAClBA,EAAK64E,cAAgB,MACtB,OAGX9lE,EAAQ5vB,UAAU21F,mBAAqB,WACtCt1F,KAAKozF,cAIN7jE,EAAQ5vB,UAAU2hB,gBAAkB,SAASznB,GACzCmG,KAAKozF,UAAUl2F,KAAKrD,IAGxB01B,EAAQ5vB,UAAUwmC,mBAAqB,SAAStsC,GAC5C,GAAI6rC,GAAMC,EAAa3lC,KAAKozF,UAAWv5F,EACnC6rC,IAAO,GACP1lC,KAAKozF,UAAU9hF,OAAOo0B,EAAK,IAInCnW,EAAQ5vB,UAAU+0F,oBAAsB,SAASa,GAC7C,IAAK,GAAI5oB,GAAK,EAAGA,EAAK3sE,KAAKozF,UAAUp5F,SAAU2yE,EAC3C,IACI3sE,KAAKozF,UAAUzmB,GAAI4oB,GACrB,MAAOv8F,GACLwW,QAAQC,IAAIzW,GAGpBgH,KAAKib,QAAQqb,cAGjB/G,EAAQ5vB,UAAU61F,6BAA+B,WAC/Cx1F,KAAKqzF,4BAGP9jE,EAAQ5vB,UAAU81F,0BAA4B,SAASjwD,GACnDxlC,KAAKqzF,wBAAwBn2F,KAAKsoC,IAGtCjW,EAAQ5vB,UAAU+1F,6BAA+B,SAASlwD,GACtD,GAAIE,GAAMC,EAAa3lC,KAAKqzF,wBAAyB7tD,EACjDE,IAAO,GACP1lC,KAAKqzF,wBAAwB/hF,OAAOo0B,EAAK,IAIjDnW,EAAQ5vB,UAAUm0F,qBAAuB,WACrC,IAAK,GAAInnB,GAAK,EAAGA,EAAK3sE,KAAKqzF,wBAAwBr5F,SAAU2yE,EACzD,IACI3sE,KAAKqzF,wBAAwB1mB,GAAI5yE,KAAKiG,MACxC,MAAOhH,GACLwW,QAAQC,IAAIzW,KAKxBu2B,EAAQ5vB,UAAU8pE,YAAc,WAC5BzpE,KAAKszF,8BAGc,mBAAZp5F,GAAyB,CAChCA,EAAOJ,SACHy1B,QAASA,EAIJ/1B,GAAQ,qBnD+hlBlBuQ,QAAQ,GAAG4rF,iBAAiB,GAAGC,aAAa,GAAGj7E,SAAS,GAAGwvB,kBAAkB,GAAGy4C,UAAU,GAAG34E,UAAU,GAAG2Q,cAAc,MAAMi7E,IAAI,SAASr8F,EAAQU,EAAOJ,GoDttmB7J,YAiEA,SAASg8F,GAAeC,EAAgBC,GACpC,IAAK,GAAIv8F,GAAI,EAAGA,EAAIs8F,EAAe/7F,SAAUP,EAAG,CAC5C,GAAIiB,GAAIq7F,EAAet8F,EACnBiB,KAAMs7F,EACNt7F,EAAEgiB,UAAUC,IAAI,UAEhBjiB,EAAEgiB,UAAUqC,OAAO,WArE/B,GAAwB,mBAAbvlB,GACP,GAAIyhB,GAAUzhB,EAAQ,cAClB0hB,EAAUD,EAAQC,QAElBwwC,EAAKlyD,EAAQ,mBACbs2B,EAAkB47B,EAAG57B,gBAErBjqB,EAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,YACpBE,EAAiBxV,EAAMwV,eACvBiP,EAAWzkB,EAAMykB,SAEjBmF,EAAOj2B,EAAQ,UACf2wF,EAAe16D,EAAK06D,aACpBz6D,EAAkBD,EAAKC,gBAEvBumE,EAAQz8F,EAAQ,WAChBu3D,EAAuBklC,EAAMllC,qBAE7BwhB,EAAgB/4E,EAAQ,WAAW+4E,cAInCp0E,EAAM3E,EAAQ,SACdyd,EAAe9Y,EAAI8Y,aACnBF,EAAgB5Y,EAAI4Y,cACpBtc,EAAU0D,EAAI1D,QAEdkE,EAAWnF,EAAQ,cACnBwC,EAAS2C,EAAS3C,OAElBU,EAAMlD,EAAQ,SAEd8D,GADYZ,EAAIN,UACJM,EAAIY,WAEhB61E,EAAM35E,EAAQ,WACdu5E,EAAcI,EAAIJ,YAElBvtE,EAAMhM,EAAQ,SACd8xC,EAAY9lC,EAAI8lC,UAChB0B,EAAaxnC,EAAIwnC,WACjB7L,EAAc37B,EAAI27B,YAClB2S,EAActuC,EAAIsuC,YAElB6f,EAAkBn6D,EAAQ,YAAYm6D,eAG9Cz4C,GAAQvb,UAAUu2F,gBAAkB,SAASv+D,GACzC,IAAK,GAAI9uB,GAAK,EAAGA,EAAK7I,KAAK+iB,MAAM/oB,SAAU6O,EACvC,GAAIinB,EAAgB9vB,KAAK+iB,MAAMla,GAAI2a,UAAWmU,GAC1C,MAAO33B,MAAK+iB,MAAMla,EAE1B,QAAO,GAGXqS,EAAQvb,UAAUw2F,WAAa,SAASr5F,EAAMs5F,GAC1C,GAAIC,GAAYl7E,EAAY,IAAKre,GAAOof,KAAM,KAI9C,OAHIk6E,IACAp2F,KAAKod,YAAYi5E,EAAWD,GAEzBj7E,EAAY,KAAMk7E,IAc7Bn7E,EAAQvb,UAAUwiB,eAAiB,SAASlK,GAsTxC,QAASq+E,GAAY1L,GACjB2L,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,OAC1Bo1E,GAAUr1E,MAAMC,QAAU,OAE1Bq1E,IAAa,EACbr7E,EAAes7E,GAMf,KAAK,GAJDC,GAAe,EAEfC,EAAO17E,EAAY,MAAO,SAAWqC,MAAO,SAC5CyK,KACKxuB,EAAI,EAAGA,EAAImxF,EAAO5wF,SAAUP,EACjCwuB,EAAQ/qB,KAAK0tF,EAAOnxF,GAGxBwuB,GAAQjnB,KAAK,SAASzH,EAAGmB,GACrB,MAAOnB,GAAE8wF,WAAW5zC,cAAcqgD,OAAOjgF,cAAcnc,EAAE2vF,WAAW5zC,cAAcqgD,SAMtF,KAAK,GAHDnvF,MACAovF,KAEKluF,EAAK,EAAGA,EAAKof,EAAQjuB,SAAU6O,EAAI,CACxC,GAAIiiF,GAAQ7iE,EAAQpf,EAChBiiF,GAAMh2C,UAAYg2C,EAAMh2C,SAAS96C,OAAS,GAAwB,YAAnB8wF,EAAMS,UACrD5jF,EAAOzK,KAAK4tF,GAEZiM,EAAK75F,KAAK4tF,GAGdiM,EAAK/8F,OAAS,GACd2N,EAAOzK,MACHmtF,WAAY,SACZD,SAAU,KACVt1C,SAAUiiD,IAGlBpvF,EAAO3G,KAAKmpF,EAGZ,KAAK,GADD6M,MACKvpE,EAAK,EAAGA,EAAK9lB,EAAO3N,SAAUyzB,EAAI,CACvC,GAAII,GAAQlmB,EAAO8lB,GACfwpE,EAAKppE,GACJopE,EAAGC,YAAcD,EAAGzM,SAAWyM,EAAGzM,QAAQ0M,aAC3CD,EAAKA,EAAGzM,QAEZ,IAAI2M,KACJ,IAAIF,EAAGC,WAEH,IAAK,GADDE,GAAQH,EAAGC,WAAW5wF,MAAM,eACvB+wF,EAAM,EAAGA,EAAMD,EAAMp9F,OAAS,EAAGq9F,GAAO,EAC7CF,EAAOC,EAAMC,EAAM,IAAMD,EAAMC,EAAM,EAI7C,IAAIF,EAAOG,MAAQH,EAAOI,KAAM,CAM5B,IAAK,GALDD,GAAOH,EAAOG,KAAMC,EAAOJ,EAAOI,KAClCC,EAAMP,EAAGjM,UAAUsM,GACnBG,EAAMR,EAAGjM,UAAUuM,GAEnBG,KACKtqD,EAAK,EAAGA,EAAKvf,EAAMinB,SAAS96C,SAAUozC,EAAI,CAC/C,GAAI+H,GAAQtnB,EAAMinB,SAAS1H,GACvBuqD,EAAKxiD,EAAMm2C,IAAIgM,GAAOM,EAAKziD,EAAMm2C,IAAIiM,EACpCG,GAAKC,KACND,EAAKC,OACTD,EAAKC,GAAIC,GAAMziD,EAGnB,GAAI0iD,GAAS18E,EAAY,QAAS,MAAO0B,UAAW,wCAAyCi7E,YAAa,UAElGn8F,EAASwf,EAAY,KACzBxf,GAAOqgB,YAAYb,EAAY,KAAM,SAAWqC,MAAO,QAASyX,OAAQ,UACxE,KAAK,GAAIc,GAAK,EAAGA,EAAKyhE,EAAIpM,OAAOpxF,SAAU+7B,EAAI,CAC3C,GAAI2Q,GAAIvrB,EAAY,KAAMA,EAAY,MAAOq8E,EAAIpM,OAAOr1D,OAAUstC,UAAW,iBAC9B00B,gBAAiB,UACjBC,gBAAiB,sCACjBC,sBAAuB,UACvBhpC,UAAW,aAAezxC,MAAO,OACPyX,OAAQ,QACR1P,cAAe,UACxF5pB,GAAOqgB,YAAY0qB,GAEvBmxD,EAAO77E,YAAYrgB,EAIvB,KAAK,GADDu8F,GAAQ/8E,EAAY,QAAS,MAAO0B,UAAW,wCAC1Cs7E,EAAK,EAAGA,EAAKV,EAAIrM,OAAOpxF,SAAUm+F,EAAI,CAC3C,GAAIP,GAAKH,EAAIt1C,KAAKg2C,GACd1hE,EAAMtb,EAAY,KACtBsb,GAAIza,YAAYb,EAAY,KAAMs8E,EAAIrM,OAAO+M,OAE7C,KAAK,GAAIn6D,GAAK,EAAGA,EAAKw5D,EAAIpM,OAAOpxF,SAAUgkC,EAAI,CAC3C,GAAI25D,GAAKH,EAAIr1C,KAAKnkB,GACdo6D,EAAOj9E,EAAY,KACvB,IAAIu8E,EAAKC,IAAOD,EAAKC,GAAIC,GAAK,CAC1B,GAAI9M,GAAQ4M,EAAKC,GAAIC,GACjBS,EAAKvN,EAAMkB,mBACf,KAAKqM,EACD,QAEJ,IAAIl/F,GAAIgiB,EAAY,MAChBm9E,EAAKn9E,EAAY,KACrBm9E,GAAGl3E,MAAM6tC,UAAY,QAErB,IAAIv0D,GAAIygB,EAAY,QACpBzgB,GAAE4J,KAAO,WACT5J,EAAE69F,iBAAmBF,EACjBG,KACA99F,EAAE+9F,kBAAoBD,IAE1BxB,EAAQ95F,KAAKxC,GACb09F,EAAKp8E,YAAYthB,GACjBA,EAAE8mB,iBAAiB,SAAU,SAASvJ,GAC9BA,EAAGyqB,OAAO/c,QACV7jB,EAAMy1B,QAAQtf,EAAGyqB,OAAO61D,kBAExBz2F,EAAMs6B,WAAWnkB,EAAGyqB,OAAO61D,oBAKvC9hE,EAAIza,YAAYo8E,GAEpBF,EAAMl8E,YAAYya,GAEtBohE,EAAO77E,YAAYk8E,GACnBrB,EAAK76E,YAAY+0C,EAAqBljC,EAAMw8D,WAAYwN,EAAY,GAAJpqE,QAC7D,CACH,GAAIirE,GAAWv9E,EAAY,QAAS,MAAO0B,UAAW,wCAClD87E,EAAOx9E,EAAY,QAASu9E,GAAW77E,UAAW,wCAAyCW,MAAO,OAAQs6E,YAAa,UACvHpyD,EAAM,CAEV7X,GAAMinB,SAAS9zC,KAAKmpF,EACpB,KAAK,GAAI1wF,GAAI,EAAGA,EAAIo0B,EAAMinB,SAAS96C,SAAUP,EAAG,CAC5C,GAAMm/F,GAAW,QAAUhC,EAEvB9L,EAAQj9D,EAAMinB,SAASr7C,GACvB4+F,EAAKvN,EAAMkB,mBACf,IAAKqM,EAAL,CAGA,GAAIl/F,GAAIgiB,EAAY,MAChBm9E,EAAKn9E,EAAY,KAAM,SAAWqC,MAAO,QAC7C86E,GAAGl3E,MAAM6tC,UAAY,QAErB,IAAIv0D,GAAIygB,EAAY,QACpBzgB,GAAE4J,KAAO,WACT5J,EAAE69F,iBAAmBF,EACrB39F,EAAE+M,GAAKmxF,EACHJ,KACA99F,EAAE+9F,kBAAoBD,IAE1BxB,EAAQ95F,KAAKxC,GACb49F,EAAGt8E,YAAYthB,GACfA,EAAE8mB,iBAAiB,SAAU,SAASvJ,GAC9BA,EAAGyqB,OAAO/c,QACV7jB,EAAMy1B,QAAQtf,EAAGyqB,OAAO61D,kBAExBz2F,EAAMs6B,WAAWnkB,EAAGyqB,OAAO61D,oBAInCp/F,EAAE6iB,YAAYs8E,EACd,IAAIO,GAAK19E,EAAY,QAAS,MAAO29E,QAASF,GAC9CC,GAAG78E,YAAYF,SAASuW,eAAey4D,EAAMT,aACzCS,EAAMmB,WAAanB,EAAMmB,UAAUjyF,OAAS,GAC5C8H,EAAMsb,YAAYy7E,EAAI/N,EAAMmB,WAEhC9yF,EAAE6iB,YAAYb,EAAY,KAAM09E,IAChCH,EAAS18E,YAAY7iB,KACnBusC,GAGF/9B,EAAO3N,OAAS,GAA0B,WAArB6zB,EAAMw8D,WAC3BwM,EAAK76E,YAAY+0C,EAAqBljC,EAAMw8D,WAAYsO,EAAU,GAAJlrE,IAE9DopE,EAAK76E,YAAY28E,IAM7B,GAAII,GAAY,WACZ,IAAK,GAAI99F,GAAK,EAAGA,EAAK+7F,EAAQh9F,SAAUiB,EAAI,CACxC,GAAIP,GAAIs8F,EAAQ/7F,GACZhC,EAAI6I,EAAMo0F,gBAAgBx7F,EAAE69F,iBAC5Bt/F,IACAyB,EAAEirB,SAAU,EACZjrB,EAAEm9B,SAA+B,MAApB5+B,EAAEgjC,gBAEfvhC,EAAEirB,SAAU,GAIxBozE,KACAj3F,EAAMwf,gBAAgB,SAASznB,GAC3Bk/F,MAGJpC,GAAW36E,YAAY66E,GAqB3B,QAASmC,KACLlD,EAAeC,EAAgBkD,GAC/BvC,GAAa,MAEbH,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,OAE1BhG,EAAes7E,GACf,IAAIuC,GAAa/9E,EAAY,MAAO,SAAW63C,YAAa,OAAQC,aAAc,QAClFimC,GAAWl9E,YAAYb,EAAY,KAAM,8BACzC+9E,EAAWl9E,YAAYb,EAAY,KAAM,+EAAgFA,EAAY,IAAK,gBAAiBe,KAAM,yCAA0C,0EAE3Mg9E,EAAWl9E,YAAYb,EAAY,OACnC+9E,EAAWl9E,YAAYF,SAASuW,eAAe,UAC/C8mE,EAAUh+E,EAAY,QAAS,IAAKtK,KAAM,GAAIzM,MAAO,oDAAqDoZ,MAAO,SACjH07E,EAAWl9E,YAAYm9E,GAEvBD,EAAWl9E,YAAYb,EAAY,OACnC+9E,EAAWl9E,YAAYb,EAAY,IAAK,WACxC+9E,EAAWl9E,YAAYb,EAAY,OACnC+9E,EAAWl9E,YAAYF,SAASuW,eAAe,WAC/C+mE,GAAWj+E,EAAY,QAAS,MAAO7W,KAAM,OAAQ+0F,SAAU,aAC/DH,EAAWl9E,YAAYo9E,IAEvBF,EAAWl9E,YAAYb,EAAY,IAAK,4EAExCw7E,GAAW36E,YAAYk9E,GACvBC,EAAQt1E,QAGZ,QAASy1E,KACLxD,EAAeC,EAAgBwD,GAC/BhD,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,OAE1Bq1E,GAAa,cACbH,GAAcn1E,MAAM6b,WAAa,SAEjC5hB,EAAes7E,GAEf,IAAIuC,GAAa/9E,EAAY,MAAO,SAAW63C,YAAa,OAAQC,aAAc,QAClFimC,GAAWl9E,YAAYb,EAAY,KAAM,4BACzC+9E,EAAWl9E,YAAYb,EAAY,KAAM,mGAEzCg+E,EAAUh+E,EAAY,QAAS,IAAKtK,KAAM,IAAKzM,MAAO,yDAA0DoZ,MAAO,SACvH07E,EAAWl9E,YAAYm9E,GAEvBxC,GAAW36E,YAAYk9E,GAEvBC,EAAQt1E,QAQZ,QAAS21E,KACL1D,EAAeC,EAAgB0D,GAC/BlD,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,OAE1Bq1E,GAAa,MAEbr7E,EAAes7E,GAEf,IAAI+C,GAAav+E,EAAY,MAAO,SAAY63C,YAAa,OAAQC,aAAc,QACnFymC,GAAW19E,YAAYb,EAAY,KAAM,wBACzCu+E,EAAW19E,YAAYb,EAAY,IAAK,yIAExCu+E,EAAW19E,YAAYF,SAASuW,eAAe,UAC/CqnE,EAAW19E,YAAYb,EAAY,OACnCg+E,EAAUh+E,EAAY,QAAS,IAAKtK,KAAM,GAAIzM,MAAO,qDAAsDoZ,MAAO,SAClHk8E,EAAW19E,YAAYm9E,GAEvBO,EAAW19E,YAAYb,EAAY,IAAK,4JACxCw7E,GAAW36E,YAAY09E,GAEvBP,EAAQt1E,QAWZ,QAAS81E,KACL,GAAIjD,IACA,GAAmB,QAAfA,GAAsB,CACtB,GAAIkD,GAAOT,EAAQ/0F,MAAM0yF,MACpB,YAAW/tF,KAAK6wF,KACjBA,EAAO,UAAYA,EAEvB,IAAIC,GAAM,GAAIvuD,IAAWxuC,KAAM,YAAaqsC,IAAKywD,GACjDE,IAAUD,OACP,IAAmB,QAAfnD,GAAsB,CAC7B,GAAIqD,GAAWX,GAASY,KAExB,IAAID,GAAYA,EAAS//F,OAAS,EAC9BigG,GAAeF,OACZ,CACH,GAAIH,GAAOT,EAAQ/0F,MAAM0yF,MACpB,YAAW/tF,KAAK6wF,KACjBA,EAAO,UAAYA,EAEvB,IAAIjiE,IAAUwR,IAAKywD,GACfM,EAAQN,EAAKnjD,aACsC,IAAnDyjD,EAAMl9F,QAAQ,mCACdk9F,EAAMl9F,QAAQ,eAAiB,IAE/B26B,EAAOk7C,UAAY,UAEvBsnB,GAAUxiE,QAEX,IAAmB,UAAf++D,GACP8C,QACG,IAAmB,cAAf9C,GACPsC,QACG,IAAmB,cAAftC,GACP4C,QACG,IAAmB,eAAf5C,GAA6B,CACpC,GAAIqD,GAAWX,GAASY,KACpBD,IAAYA,EAAS//F,OAAS,GAAK+/F,EAAS,IAC5CK,GAAenZ,QAAU8Y,EAAS,GAClCM,EAAYD,KAEZE,EAAaF,QAEd,IAAmB,eAAf1D,GAA6B,CACpC,GAAIqD,GAAWX,GAASY,KACpBD,IAAYA,EAAS//F,OAAS,GAAK+/F,EAAS,IAC5CK,GAAe9Y,UAAYyY,EAAS,GACpCQ,EAAiBH,KAEjBI,EAAeJ,QAEhB,IAAmB,aAAf1D,IAA4C,iBAAfA,GAA+B,CACnE0D,GAAet9F,KAAO29F,GAASr2F,KAC/B,IAAI0E,GAAI4xF,GAAOt2F,KACN,gBAAL0E,EACAsxF,GAAeltE,QAAUpkB,EAEzBsxF,GAAeltE,QAAU/qB,OAEzBw4F,KACAP,GAAe7hD,QAAUoiD,GAAUh1E,SAGnCi1E,GAASx2F,MAAMpK,OAAS,GAAK6gG,GAASz2F,MAAMpK,OAAS,IACrDogG,GAAel+C,MAAQ0+C,GAASx2F,MAChCg2F,GAAeh+C,MAAQy+C,GAASz2F,OAGpCtC,EAAMy1B,QAAQ6iE,IAEI,gBAAd1D,GACAsC,IAEAQ,QACD,IAAmB,gBAAf9C,GAA8B,CACrC,GAAIkD,GAAOT,EAAQ/0F,MAAM0yF,MACpB,YAAW/tF,KAAK6wF,KACjBA,EAAO,UAAYA,GAGvBkB,EAAUlB,OACP,IAAmB,aAAflD,GAA2B,CAClC,IAAK,GAAIvU,GAAK,EAAGA,EAAK4Y,GAAY/gG,SAAUmoF,EAAI,CAC5C,GAAI/oF,GAAI2hG,GAAY5Y,EACpB,KAAI/oF,EAAE4hG,SAGa,OAAf5hG,EAAE6pC,WAAuB7pC,EAAEkoF,WAAcloF,EAAEioF,YAE5B,SAAfjoF,EAAE6pC,WAAyB7pC,EAAEkoF,WAAcloF,EAAEioF,UAAjD,CAGA,GAAIwY,GAAMoB,GAAiB7hG,EACvBygG,KACAA,EAAIjkC,WAAY,EAChB9zD,EAAMy1B,QAAQsiE,KAItBb,SAGJl3F,GAAMogB,kBAId,QAAS44E,GAAUlB,EAAMn4F,EAAM+wE,GAC3B/wE,EAAOA,KACP,KAAK,GAAIq3B,GAAK,EAAGA,EAAKh3B,EAAM+oB,WAAW7wB,SAAU8+B,EAAI,CACjD,GAAI4N,GAAI5kC,EAAM+oB,WAAWiO,EACzB,IAAI4N,EAAE1N,IAAIl7B,KAAO87F,EAAM,CACnB,IAAK,GAAI3+F,GAAK,EAAGA,EAAK86F,EAAe/7F,SAAUiB,EACvC86F,EAAe96F,GAAI+9B,KAAO0N,GAC1BovD,EAAeC,EAAgBA,EAAe96F,GAStD,YANAyrC,GAAE+jD,UAAU,SAASG,EAAQjxE,GACrBA,GACAnK,QAAQC,IAAIkK,GAEhB28E,EAAY1L,MAOxBl7D,EAAgBkqE,EAAM,SAAS5gE,EAAKrf,GAChC,GAAIA,EACA,MAAK64D,IAGLn3D,EAAes7E,IACfA,GAAW36E,YAAYb,EAAY,KAAM,kCACzCw7E,GAAW36E,YAAYb,EAAY,IAAKxB,SACxC+8E,GAAa,cALFoE,EAAUlB,GAAOpgF,aAAa,IAAO,EAQhD,IAAI0hF,GAAU,KACVC,EAAgB,IACpB,KAAK,GAAIjiE,KAAUF,GAAIG,QAAS,CAC5B,GAAIjM,GAAU,KACVkuE,GAAO,CAEX,IAAIliE,GAAUp3B,EAAMib,YAAYqc,SAC5BgiE,GAAO,MAEN,KAAK,GAAIjzD,KAAOrmC,GAAM+mB,OAAQ,CAC3B,GAAI/f,GAAIhH,EAAM+mB,OAAOsf,EACjBjP,IAAUpwB,EAAE63B,OAAOvH,WACnBlM,EAAUib,EACVizD,GAAO,GAKnB,GAAIA,EAAM,CACN,GAAIriE,IAAMj7B,IAAK87F,EAAM1gE,OAAQA,EACzBz3B,GAAK+X,cACLuf,EAAGvf,aAAc,GACjB0T,IACA6L,EAAG7L,QAAUA,EACb8L,EAAIG,QAAQD,GAAQhM,QAAUA,GAElCprB,EAAM8oB,KAAK1tB,KAAK67B,GAChBj3B,EAAM+oB,WAAW3tB,KAAK87B,EAAIG,QAAQD,GAElC,IAAImiE,GAAYC,EAActiE,EAAIG,QAAQD,GAC1CqiE,GAAiBv/E,YAAYq/E,GAExBnuE,GAAYguE,IACbA,EAAUliE,EAAIG,QAAQD,GACtBiiE,EAAgBE,IAK5B,MAAIH,IACAp5F,EAAMw0B,aACNw/D,EAAeC,EAAgBoF,GAC/BD,EAAQzQ,UAAU,SAASG,EAAQjxE,GAC/B28E,EAAY1L,KAHhB9oF,SAMAuZ,EAAes7E,IACfA,GAAW36E,YAAYb,EAAY,KAAM,4BACzCw7E,GAAW36E,YAAYb,EAAY,IAAK,wHACxCw7E,GAAW36E,YAAYb,EAAY,IAAK,0BAA4BrZ,EAAMib,YAAYqc,gBACtFs9D,GAAa,eAItBj1F,GAoCP,QAAS+5F,GAAkB3B,EAAKrnB,GAQ5B,QAASipB,KACL,MAAKjpB,GAGMkpB,GAAqB7B,GAFrB2B,EAAkB3B,GAAK,GATtC,GAAI1wD,GAAM0wD,EAAI1wD,GACd,IAAIqpC,EAAO,CACP,GAAIzhC,GAAQ,kBAAkBhoC,KAAKogC,EAC/B4H,KACA5H,EAAM4H,EAAM,GAAK,YAUzB,GAAI5P,GAAYgI,GAAM3vB,YAAaqgF,EAAIrgF,cAAcyO,QACjD,SAASA,GACL,IAAKA,GAA6B,GAAlBA,EAAQjuB,OACpB,MAAOyhG,IAGX,IAAIrqB,GAAK,IACT,IAAsB,GAAlBnpD,EAAQjuB,OACRo3E,EAAKnpD,EAAQ,OAEb,KAAK,GAAIxuB,GAAI,EAAGA,EAAIwuB,EAAQjuB,SAAUP,EAClC,GAAIwuB,EAAQxuB,GAAG0vC,MAAQ0wD,EAAI1wD,IAAK,CAC5BioC,EAAKnpD,EAAQxuB,EACb,OAKZ,GAAIkiG,IAAmB,EAAOC,GAAkB,CAChD,IAAIxqB,IACAyoB,EAAI/8F,KAAOs0E,EAAGt0E,KACd+8F,EAAI1lD,KAAOi9B,EAAGj9B,KACVi9B,EAAG74B,QACHshD,EAAIthD,SAAU,EAEdshD,EAAIthD,SAAU,EAEd64B,EAAGp1B,eACH69C,EAAI79C,aAAeo1B,EAAGp1B,cAE1B4/C,GAAkB,EAEdxqB,EAAGzwC,QAA8B,GAApBywC,EAAGzwC,OAAO3mC,QAAa,CACpC,GAAI2mC,GAASywC,EAAGzwC,OAAO,EACvB,IAAImT,EAAYnT,EAAQ7+B,EAAMib,aAC1B4+E,GAAmB,MAChB,IAAI75F,EAAM+mB,OACb,IAAK,GAAIzX,KAAKtP,GAAM+mB,OACZirB,EAAYnT,EAAQ7+B,EAAM+mB,OAAOzX,GAAGuvB,UACpCk5D,EAAI3sE,QAAU9b,EACduqF,GAAmB,GAOvC,MAAOD,IAAqB7B,EAAK8B,EAAkBC,IAEvD,WACI,MAAOH,OA4FnB,QAASnB,GAAaT,GAClBtD,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,SAE1BhG,EAAes7E,IACfD,GAAa,aACbC,GAAW36E,YAAYb,EAAY,KAAM,yBACzCw7E,GAAW36E,YAAYb,EAAY,IAAK,0SAExCw7E,GAAW36E,YAAYF,SAASuW,eAAe,iBAC/C+mE,GAAWj+E,EAAY,QAAS,MAAO7W,KAAM,SAC7CqyF,GAAW36E,YAAYo9E,IACvBgB,GAAiBP,EAGrB,QAASW,GAAeX,GACpBtD,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,SAE1BhG,EAAes7E,IACfD,GAAa,aACbC,GAAW36E,YAAYb,EAAY,KAAM,yBACzCw7E,GAAW36E,YAAYb,EAAY,IAAK,uQAExCw7E,GAAW36E,YAAYF,SAASuW,eAAe,iBAC/C+mE,GAAWj+E,EAAY,QAAS,MAAO7W,KAAM,SAC7CqyF,GAAW36E,YAAYo9E,IACvBgB,GAAiBP,EAGrB,QAASQ,GAAYR,GACjB,GAAIgC,EAEAA,GADAhC,EAAI5Y,QACK,GAAIlqE,GAAc8iF,EAAI5Y,SACT,UAAjB4Y,EAAIhnB,UACA,GAAIlf,GAAgBkmC,EAAInb,OAAS,QAEjC,GAAIznE,GAAa4iF,EAAInb,OAAS,QAASllE,YAAaqgF,EAAIrgF,cAErEqiF,EAAOpgG,MAAM,EAAG,KAAKC,MAAM,SAASvC,GAC5B,GAAI2iG,IAAS,CACb,IAAI3iG,EAAG,CACH,GAAIyI,GAAK,GAAI1F,YAAW/C,GACpB4iG,EAASthG,EAAQmH,EAAI,EACzBk6F,GAAUC,GAAUz+F,EAExB,MAAIw+F,GACOJ,GAAqB7B,GAAK,GAAO,GAAO,GAExCmC,EAAmB,mLAK1C,QAASzB,GAAiBV,GACtB,GAAIgC,EAEAA,GADAhC,EAAIvY,UACK,GAAIvqE,GAAc8iF,EAAIvY,WAEtB,GAAIrqE,GAAa4iF,EAAI1wD,IAAM,QAExC0yD,EAAOpgG,MAAM,EAAG,OAAOC,MAAM,SAASvC,GAClC,GAAI8iG,IAAW,CACf,IAAI9iG,EAAG,CACH,GAAIyI,GAAK,GAAI1F,YAAW/C,EACxB,IAAa,IAATyI,EAAG,IAAqB,KAATA,EAAG,GAAW,CAC7B,GAAI7F,GAAMC,EAAO7C,EACjByI,GAAK,GAAI1F,YAAWH,EACpB,IAAIsmF,GAAK5nF,EAAQmH,EAAI,EACrBq6F,GAAY5Z,GAAMtP,GAG1B,MAAIkpB,GACOP,GAAqB7B,GAAK,GAAO,GAAO,GAExCmC,EAAmB,qMAKtC,QAASA,GAAmB9sE,GACxBqnE,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,SAE1BhG,EAAes7E,IACfznE,EAAUA,GAAW,oCACrBynE,GAAW36E,YAAYb,EAAY,KAAM,6BACzCw7E,GAAW36E,YAAYb,EAAY,IAAK+T,IACxCynE,GAAW36E,YAAYb,EAAY,IAAK,6DACxCu7E,GAAa,YA1kCjB,GAAoB,QAAhB12F,KAAK2e,OAGL,MAFA3e,MAAK+jB,oBACL/jB,MAAK0e,UAAU,OAInB,IAKIw9E,GAAUC,EALVr6F,EAAQ9B,KAER+xD,EAAQ52C,EAAY,MAAO,MAAO0B,UAAW,cAAgBW,MAAO,OAAQ6D,QAAS,eAAgBgE,UAAW,aAAcC,aAAc,aAAcC,cAAe,MAAO0tC,aAAc,SAE9L8iC,IAIJ,KAAK/1F,KAAK0qB,eAAgB,CACtB,GAAI2rE,GAAYr2F,KAAKm2F,WAAW,WAAY,sDAC5CJ,GAAe74F,KAAKm5F,EAEpB,KAAK,GAAIvtF,KAAK9I,MAAKwqB,gBAAiB,CAChC,GAAI2mD,GAAM,SAASirB,GACf,GAAIC,GAAYv6F,EAAMq0F,WAAWr0F,EAAM+mB,OAAOuzE,GAAIzxD,OAAQ,kCAAoC7oC,EAAM+mB,OAAOuzE,GAAIzxD,OAC/GorD,GAAe74F,KAAKm/F,GACpBA,EAAU76E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBm0E,EAAeC,EAAgBsG,GAC/BH,EAASp6F,EAAM0oB,gBAAgB4xE,GAAKA,KACrC,GACJjrB,GAAGroE,IAKd,IAAK,GADDwzF,MACKvmE,EAAK,EAAGA,EAAK/1B,KAAKuqB,eAAevwB,SAAU+7B,EAAI,CACpD,GAAI38B,GAAI4G,KAAKuqB,eAAewL,GACxBlU,EAAIzoB,EAAEy0B,OAAS,UACfyuE,GAAgBz6E,GAChBy6E,EAAgBz6E,GAAG3kB,KAAK9D,GAExBkjG,EAAgBz6E,IAAMzoB,GAK9B,GAAIkiG,GAAgB,SAASriE,GACzB,GAAID,GAAMC,EAAID,IACVujE,EAAgBphF,EAAY,IAAK,MAAO0B,UAAW,mBAAoB+e,OAAQ,iBAC/El1B,EAAQsyB,EAAIK,UAAYL,EAAIqxD,YAAc,SAC1CpxD,GAAI/L,UACJxmB,EAAQA,EAAQ,KAAOuyB,EAAIC,OAAS,IACxC,IAAIsjE,GAAYrhF,EAAY,QAASzU,EAAO,IAAK61F,IAC7ClB,EAAYv5F,EAAMq0F,WAAWqG,EAAWxjE,EAAIizD,UA4GhD,OA3GAoP,GAAUriE,IAAMC,EAChB88D,EAAe74F,KAAKm+F,GAEpBA,EAAU75E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBm0E,EAAeC,EAAgBsF,GAC/BhgF,EAAes7E,GACf,IAAI8F,GAAS36F,EAAMgwB,WAAW,GAC9B2qE,GAAOr7E,MAAMmF,WAAa,OAC1Bk2E,EAAOr7E,MAAMoF,YAAc,OAC3Bi2E,EAAOr7E,MAAMs7E,UAAY,QACzB/F,GAAW36E,YAAYb,EAAY,MAAOshF,EAAQ,MAAOxtC,UAAW,YAEpEsnC,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,OAC1Bo1E,GAAUr1E,MAAMC,QAAU,OAE1B4X,EAAIwxD,UAAU,SAASG,EAAQjxE,GACvBA,GACAnK,QAAQC,IAAIkK,GAGhB28E,EAAY1L,OAEjB,GAEH2R,EAAc/6E,iBAAiB,QAAS,SAASvJ,GAC7CA,EAAGyJ,iBAAkBzJ,EAAG0J,iBAExB,IAAIg7E,GAAgBxhF,EAAY,KAAMA,EAAY,IAAK,eACnDyhF,EAAYzhF,EAAY,KAAOA,EAAY,IAAK,eAChD0hF,EAAa1hF,EAAY,KAAOA,EAAY,IAAK,gBACjD2hF,EAAU3hF,EAAY,MAAOwhF,EAAeC,EAAWC,IAAchgF,UAAW,kBAAmBwE,QAAS,UAE5GqwC,EAAMz5C,EAAGqjB,QAASs2B,EAAK35C,EAAGwjB,OAC9Bi2B,IAAO51C,SAASq2C,gBAAgBC,YAAct2C,SAAS4b,KAAK06B,WAC5DR,GAAO91C,SAASq2C,gBAAgBt+B,WAAa/X,SAAS4b,KAAK7D,UAE3DipE,EAAQ17E,MAAMmxC,SAAW,WACzBuqC,EAAQ17E,MAAMoV,IAAM,IAAMo7B,EAAG,IAAM,KACnCkrC,EAAQ17E,MAAMua,KAAO,IAAM+1B,EAAG,IAAM,KACpC5vD,EAAM21B,aAAazb,YAAY8gF,EAE/B,IAAIC,GAAe,QAAfA,GAAwB9kF,GACxBzI,QAAQC,IAAI,MACZqM,SAAS4b,KAAKvT,oBAAoB,QAAS44E,GAAc,GACzDj7F,EAAM21B,aAAa/S,YAAYo4E,GAEnChhF,UAAS4b,KAAKlW,iBAAiB,QAASu7E,GAAc,GAEtDJ,EAAcn7E,iBAAiB,QAAS,SAASvJ,GAC7C,IAAK,GAAI6gB,GAAK,EAAGA,EAAKh3B,EAAM+oB,WAAW7wB,SAAU8+B,EAC7C,GAAIh3B,EAAM+oB,WAAWiO,GAAIoxD,QAAUjxD,EAAIixD,OAAQ,CAC3CpoF,EAAM+oB,WAAWvZ,OAAOwnB,EAAI,EAC5B,OAGR,IAAK,GAAIA,GAAK,EAAGA,EAAKh3B,EAAM8oB,KAAK5wB,SAAU8+B,EAAI,CAC3C,GAAIC,GAAKj3B,EAAM8oB,KAAKkO,EAGpB,IAFkB,gBAAPC,KACPA,GAAMj7B,IAAKi7B,IACXA,EAAGj7B,KAAOm7B,EAAID,IAAIl7B,MAAQi7B,EAAGG,QAAUH,EAAGG,QAAUD,EAAIC,OAAQ,CAChEp3B,EAAM8oB,KAAKtZ,OAAOwnB,EAAI,EACtB,QAKRh3B,EAAMw0B,aAENilE,EAAiB72E,YAAY22E,GAC7BvF,EAAeC,EAAgBwD,GAC/BD,MACD,GAGHsD,EAAUp7E,iBAAiB,QAAS,SAASvJ,GACzCghB,EAAIwxD,UAAU,SAASG,EAAQjxE,GACvBA,GACAnK,QAAQC,IAAIkK,EAGhB,KAAK,GAAI9Q,GAAK,EAAGA,EAAK+hF,EAAO5wF,SAAU6O,EAAI,CACvC,GAAIwvF,GAAKzN,EAAO/hF,GAAImjF,mBACflqF,GAAMo0F,gBAAgBmC,IACvBv2F,EAAMy1B,QAAQ8gE,QAI3B,GAEHwE,EAAWr7E,iBAAiB,QAAS,SAASvJ,GAC1CghB,EAAIwxD,UAAU,SAASG,EAAQjxE,GACvBA,GACAnK,QAAQC,IAAIkK,EAGhB,KAAK,GAAI9Q,GAAK,EAAGA,EAAK+hF,EAAO5wF,SAAU6O,EAAI,CACvC,GAAIwvF,GAAKzN,EAAO/hF,GAAImjF,mBAChBlqF,GAAMo0F,gBAAgBmC,IACtBv2F,EAAMs6B,WAAWi8D,QAI9B,KACJ,GAEIgD,GAGP2B,EAAiB,KACjBC,EAAkB,IACtB,KAAK,GAAIp7E,KAAKy6E,IACV,SAAUz6E,EAAGw2E,GACT,GAAI6E,GAAYp7F,EAAMq0F,WAAWt0E,EAAG,kDACpCq7E,GAAU17E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBm0E,EAAeC,EAAgBmH,GAC/BhB,EAAS,GAAI5xE,GAAS+tE,MACvB,GACHtC,EAAe74F,KAAKggG,KAEfF,GAAkBl7F,EAAM6oB,sBAAwB7oB,EAAM6oB,sBAAwB9I,KAC/Em7E,EAAiBE,EACjBD,EAAkB5E,IAEvBx2E,EAAGy6E,EAAgBz6E,GAE1B,IAAI43E,GAAaz5F,KAAKm2F,WAAW,MAAO,kCACxCJ,GAAe74F,KAAKu8F,EACpB,IAAIR,GAAYj5F,KAAKm2F,WAAW,QAAS,yCACzCJ,GAAe74F,KAAK+7F,EAGpB,KAAK,GAAIngE,GAAK,EAAGA,EAAK94B,KAAK6qB,WAAW7wB,SAAU8+B,EAAI,CAChD,GAAIE,GAAMh5B,KAAK6qB,WAAWiO,EAC1BwiE,GAActiE,GAGlB,GAAIugE,GAAev5F,KAAKm2F,WAAW,IAAK,6BACxCJ,GAAe74F,KAAKq8F,EAGpB,IAAIgC,GAAmBpgF,EAAY,KAAM46E,GAAiBl5E,UAAW,iBAAkBoyE,aAAc,OACrGl9B,GAAM/1C,YAAYu/E,EAElB,IAAIpC,GAASsB,GAAUC,GAAQC,GAAWvB,GAAUwB,GAAUC,GAC1DnE,IAAa,EACb0D,GAAiB,KAEjB+C,GAAShiF,EAAY,OAAQ,SAAWkG,QAAS,eAAgB7D,MAAO,QAC5E2/E,IAAO37E,iBAAiB,SAAU,SAASvJ,GAGnC,MAFAA,GAAG0J,kBAAmB1J,EAAGyJ,iBACzBi4E,KACO,IACZ,EACH,IAAIhD,IAAax7E,EAAY,MAC7Bw7E,IAAWv1E,MAAMmxC,SAAW,WAC5BokC,GAAWv1E,MAAMg8E,SAAW,SAE5BD,GAAOnhF,YAAY26E,GAEnB,IAAI6B,IACA6E,EAGJnB,GAAW,SAASoB,EAAUpwE,GAC1BqpE,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,OAC1Bo1E,GAAUr1E,MAAMC,QAAU,OACtBg8E,IACAA,GAAeE,eAAepB,GAElC3D,GAAYtrE,EACZmwE,GAAiBC,EACjBD,GAAeG,mBAAmBrB,IAGtCA,EAAmB,SAASmB,GACxB5G,IAAa,CACb,IAAIM,KAEJ,IADA37E,EAAes7E,KACV2G,EAED,WADA3G,IAAW36E,YAAYb,EAAY,IAAK,0GAS5C,KAAK,GALDu9E,GAAWv9E,EAAY,QAAS,MAAO0B,UAAW,wCAAyCW,MAAO,SAClGm7E,EAAOx9E,EAAY,QAASu9E,GAAW77E,UAAW,wCAAyCW,MAAO,OAAQs6E,YAAa,UACvHpyD,EAAM,EAENzd,KACKxuB,EAAI,EAAGA,EAAI6jG,EAAStjG,SAAUP,EACnCwuB,EAAQ/qB,KAAKogG,EAAS7jG,GAG1BwuB,GAAQjnB,KAAK,SAASzH,EAAGmB,GACrB,MAAOnB,GAAEuD,KAAK25C,cAAcqgD,OAAOjgF,cAAcnc,EAAEoC,KAAK25C,cAAcqgD,SAG1E,KAAK,GAAIr9F,GAAI,EAAGA,EAAIwuB,EAAQjuB,SAAUP,EAAG,CACrC,GAAIk+B,GAAS1P,EAAQxuB,GACjBN,EAAIgiB,EAAY,MAEhBm9E,EAAKn9E,EAAY,KAAM,SAAWqC,MAAO,QAE7C,IADA86E,EAAGl3E,MAAM6tC,UAAY,UAChBt3B,EAAOgc,OAAShc,EAAOgc,MAAM8pD,KAAM,CACpC,GAAI/iG,GAAIygB,EAAY,QACpBzgB,GAAE4J,KAAO,WACT5J,EAAE69F,iBAAmB5gE,EACrBj9B,EAAE+M,GAAK,WAAahO,EAChB++F,KACA99F,EAAE+9F,kBAAoBD,IAG1BF,EAAGt8E,YAAYthB,GACfs8F,EAAQ95F,KAAKxC,GACbA,EAAE8mB,iBAAiB,SAAU,SAASvJ,GAC9BA,EAAGyqB,OAAO/c,QACV7jB,EAAMy1B,QAAQtf,EAAGyqB,OAAO61D,kBAExBz2F,EAAMs6B,WAAWnkB,EAAGyqB,OAAO61D,wBAInCD,GAAGt8E,YAAYF,SAASuW,eAAe,MACvCvwB,EAAMsb,YAAYk7E,EAAIn9E,EAAY,QAAS,gEAAiEA,EAAY,IAAK,QAASe,KAAM,+BAAgC,MAEhL/iB,GAAE6iB,YAAYs8E,EACd,IAAIO,GAAK19E,EAAY,QAAS,MAAO29E,QAAS,WAAar/F,GAC3Do/F,GAAG78E,YAAYF,SAASuW,eAAesF,EAAO76B,OAC1C66B,EAAOwc,MAAQxc,EAAOwc,KAAKn6C,OAAS,GACpC8H,EAAMsb,YAAYy7E,EAAIlhE,EAAOwc,MAEjCh7C,EAAE6iB,YAAYb,EAAY,KAAM09E,IAChCH,EAAS18E,YAAY7iB,KACnBusC,EAGN,GAAIqzD,GAAY,WACZ,IAAK,GAAI99F,GAAK,EAAGA,EAAK+7F,EAAQh9F,SAAUiB,EAAI,CACxC,GAAIP,GAAIs8F,EAAQ/7F,GACZhC,EAAI6I,EAAMo0F,gBAAgBx7F,EAAE69F,iBAC5Bt/F,GACAyB,EAAEirB,SAAU,EAEZjrB,EAAEirB,SAAU,GAIxBozE,KACAj3F,EAAMwf,gBAAgB,SAASznB,GAC3Bk/F,MAGJpC,GAAW36E,YAAY28E,IA8MvBtC,GACAA,EAAU70E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBm0E,EAAeC,EAAgBM,GAC/B6F,EAASp6F,EAAMuoB,oBAChB,GAGP4uE,EAAUz3E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxBq3E,MACD,GACHO,EAAa/3E,iBAAiB,QAAS,SAASvJ,GAC5CA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxB23E,MACD,GAyDHG,EAAWj4E,iBAAiB,QAAS,SAASvJ,GAC1CA,EAAGyJ,iBAAkBzJ,EAAG0J,kBACxB63E,MACD,EA6BH,IAAIhD,IAAYr7E,EAAY,SAAU,OAAQ0B,UAAW,mBACzD25E,IAAUh1E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAG0J,kBAAmB1J,EAAGyJ,iBACzBi4E,MACD,EAoMH,IAAIG,IAAY,QAAZA,IAAqBD,EAAKrnB,GAC1B,GAAIn0C,GAAav8B,EAAMu8B,UACvB,KAAKA,EAED,WADAqK,OAAM,qDAGV,IAAIg1D,GAA4E,EAAtEhgG,KAAKoC,IAAIu+B,EAAW1gC,KAAM0gC,EAAW1gC,IAAM0gC,EAAWv+B,IAAM,KAAO,GACzE69F,EAAc,GAAI3wD,GAAW3O,EAAW78B,IAAKk8F,EAAKhgG,KAAKC,IAAI+/F,EAAM,GAAIr/D,EAAWv+B,KACpF+5F,GAAI5oF,SAAS0sF,KAAiB,SAAS1sF,EAAUqI,GAC7C,IAAIA,EAWG,CACH,GAAIw5D,GAAqB,GAAI90E,QAAO,eAChC+yC,EAAQ+hC,EAAmB/pE,KAAK8wF,EAAI1wD,IAMxC,OALI4H,KACA8oD,EAAI/8F,KAAOi0C,EAAM,QAGrByqD,GAAkB3B,GAjBlB,MAAKrnB,IAIDn3D,EAAes7E,IACfA,GAAW36E,YAAYb,EAAY,KAAM,0BACzCw7E,GAAW36E,YAAYb,EAAY,IAAK,YAAc0+E,EAAI1wD,IAAM,6CAChEutD,GAAa,WANbmD,EAAIrgF,aAAc,MAClBsgF,IAAUD,GAAK,OA2F3BoB,GAAmB,SAAS7hG,GAC5B,GAAIygG,IAAO/8F,KAAM1D,EAAE0D,KAUnB,OATI1D,GAAEogB,cACFqgF,EAAIrgF,YAAcpgB,EAAEogB,aAEpBpgB,EAAE8zB,SAAwB,eAAb9zB,EAAE8zB,UACf2sE,EAAI3sE,QAAU9zB,EAAE8zB,SAEhB9zB,EAAEy5E,YACFgnB,EAAIhnB,UAAYz5E,EAAEy5E,WAEH,OAAfz5E,EAAE6pC,WACE7pC,EAAE4d,KACF6iF,EAAIpb,QAAUrlF,EAAE4d,KACX5d,EAAE+vC,MACP0wD,EAAIrb,OAASplF,EAAE+vC,KACZ0wD,GACe,OAAfzgG,EAAE6pC,WACL7pC,EAAE4d,MACF6iF,EAAIlb,QAAUvlF,EAAE4d,KAChB6iF,EAAI5Y,QAAU7nF,EAAEkoF,YAEhBuY,EAAInb,OAAStlF,EAAE+vC,IACf0wD,EAAI3Y,OAAS9nF,EAAEioF,UAEZwY,GACe,SAAfzgG,EAAE6pC,WACT42D,EAAI52D,UAAY,QAChB42D,EAAIvtB,QAAUlzE,EAAEkzE,QACZlzE,EAAE4d,MACF6iF,EAAI7iF,KAAO5d,EAAE4d,KACb6iF,EAAIvY,UAAYloF,EAAEkoF,YAElBuY,EAAI1wD,IAAM/vC,EAAE+vC,IACZ0wD,EAAIxY,SAAWjoF,EAAEioF,UAEdwY,GACe,YAAfzgG,EAAE6pC,WACT42D,EAAI52D,UAAY,WAChB42D,EAAIvtB,QAAUlzE,EAAEkzE,QACZlzE,EAAE4d,KACF6iF,EAAI7iF,KAAO5d,EAAE4d,KAEb6iF,EAAI1wD,IAAM/vC,EAAE+vC,IACT0wD,GAPJ,QAWPM,GAAY,SAASxiE,GACrB46C,EAAc56C,EAAQ,SAASA,EAAQhe,GACnC,IAAIA,EAwBG,CACH,GAAIkgF,GAAMoB,GAAiBtjE,EAC3B,OAAwB,OAApBA,EAAOsL,UACAo3D,EAAYR,GACQ,SAApBliE,EAAOsL,UACPs3D,EAAiBV,GAEjB6B,GAAqB7B,GAAK,GAAO,GAAO,GA9BnDx+E,EAAes7E,GACf,IAAIiH,GAAWziF,EAAY,MAC3ByiF,GAAS5hF,YAAYb,EAAY,KAAM,gCACvCyiF,EAAS5hF,YAAYb,EAAY,IAAK,GAAKxB,IAC3Cg9E,GAAW36E,YAAY4hF,GACvBpuF,QAAQC,IAAIkoB,GACqB,WAA7BnL,OAAOD,SAASK,UAAwD,GAA/B+K,EAAOwR,IAAInsC,QAAQ,UAC5D8E,EAAMgnC,oBAAoBhwB,KACtB,SAASs7E,GACAA,GACDwJ,EAAS5hF,YACLb,EAAY,KACRA,EAAY,SAAU,kBACtB,mHACAA,EAAY,IAAK,eAAgBe,KAAMpa,EAAM4pB,eAAgBgX,OAAQ,gBAQ7Fg0D,GAAa,eA8GrBgF,GAAuB,SAAS7B,EAAK8B,EAAkBC,EAAiBiC,GAyBxE,GAxBAtH,GAAcn1E,MAAMC,QAAU,OAC9Bm1E,GAAUp1E,MAAMC,QAAU,SAC1Bo1E,GAAUr1E,MAAMC,QAAU,SAE1BhG,EAAes7E,IACfA,GAAW36E,YAAYb,EAAY,KAAM,4BACzCw7E,GAAW36E,YAAYF,SAASuW,eAAe,YAC/CooE,GAAWt/E,EAAY,QAAS,IAAK/W,MAAOy1F,EAAI/8F,OAChD65F,GAAW36E,YAAYy+E,IAIvBG,GAAWz/E,EAAY,QAAS,IAGhC0/E,GAAW1/E,EAAY,QAAS,IAIhCw7E,GAAW36E,YAAYb,EAAY,OACnCw7E,GAAW36E,YAAYb,EAAY,OACnCw7E,GAAW36E,YAAYb,EAAY,KAAM,wBACzCu/E,GAASv/E,EAAY,SAAU,MAC/Bu/E,GAAO1+E,YAAYb,EAAY,SAAUrZ,EAAMmb,mBAAmBnb,EAAMib,cAAe3Y,MAAO,iBAC1FtC,EAAM+mB,OACN,IAAK,GAAIi1E,KAAOh8F,GAAM+mB,OAAQ,CAC1B,GAAIvoB,GAAKwB,EAAM+mB,OAAOi1E,GAAKn9D,MAC3B+5D,IAAO1+E,YAAYb,EAAY,SAAUrZ,EAAMmb,mBAAmB3c,IAAM8D,MAAO05F,KAGvFpD,GAAOt2F,MAAQy1F,EAAI3sE,SAAW,cAC9BypE,GAAW36E,YAAY0+E,IAEnBiB,EACAhF,GAAW36E,YAAYb,EAAY,IAAK,iEAExCw7E,GAAW36E,YAAYb,EAAY,KAAMA,EAAY,IAAK,aAAc,2FACxEw7E,GAAW36E,YAAYb,EAAY,IAAK,6FAGvC0iF,IACDlH,GAAW36E,YAAYF,SAASuW,eAAe,mBAC/CsoE,GAAYx/E,EAAY,QAAS,MAAO7W,KAAM,WAAYqhB,SAAS,IACxC,mBAAhBk0E,GAAIthD,UACXoiD,GAAUh1E,QAAUk0E,EAAIthD,SAE5Bo+C,GAAW36E,YAAY2+E,IACnBiB,EACAjF,GAAW36E,YAAYb,EAAY,IAAK,gEAExCw7E,GAAW36E,YAAYb,EAAY,KAAMA,EAAY,IAAK,aAAc,sEAI5E0+E,EAAIpb,SACJkY,GAAW36E,YAAYb,EAAY,KAAMA,EAAY,IAAK,aAAc,uHAG5Es/E,GAAS52E,QAGL6yE,GADe,QAAfA,IAAuC,eAAfA,IAA8C,eAAfA,GAC1C,eAEA,WACjB0D,GAAiBP,GAGjBkB,GAAc,KACdd,GAAiB,SAASF,GAC1B,GAAIgE,GAAahD,KACjBrE,IAAa,UACb,KAAK,GAAI5iF,GAAK,EAAGA,EAAKimF,EAAS//F,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIqgG,EAASjmF,EACbpa,IACAqkG,EAAW7gG,MAAM8Z,KAAMtd,IAI/B,IAAK,GAAIoa,GAAK,EAAGA,EAAKiqF,EAAW/jG,SAAU8Z,EACvCkqF,GAAcD,EAAWjqF,GAE7BmqF,OAGAD,GAAgB,SAAS1lF,GACzBi6D,EAAcj6D,EAAI,SAASqf,EAAQhe,GAC3BA,IACAge,EAAOrJ,MAAQ3U,EAKnB,KAAK,GAFDukF,MACAC,KAAWC,KACNroE,EAAK,EAAGA,EAAKglE,GAAY/gG,SAAU+7B,EAAI,CAC5C,GAAI38B,GAAI2hG,GAAYhlE,EACD,QAAf38B,EAAE6pC,WAAuB7pC,EAAEkoF,YAC3B6c,EAAK/kG,EAAE4d,KAAKla,MAAQ1D,GAEL,SAAfA,EAAE6pC,WAAyB7pC,EAAEkoF,YAC7B8c,EAAQhlG,EAAE4d,KAAKla,MAAQ1D,GAI/B,IAAK,GAAI28B,GAAK,EAAGA,EAAKglE,GAAY/gG,SAAU+7B,EAAI,CAC5C,GAAI38B,GAAI2hG,GAAYhlE,EACpB,IAAoB,QAAhB38B,EAAE6pC,UAAqB,CACvB,GAAIo7D,GAAa,GAAIrgG,QAAO,eACxB+yC,EAAQstD,EAAWt1F,KAAK3P,EAAE4d,KAAKla,KAC/Bi0C,IAASotD,EAAKptD,EAAM,MACpBotD,EAAKptD,EAAM,IAAIuwC,UAAYloF,EAAE4d,KAC7BknF,EAAYhhG,KAAK64B,QAElB,IAAoB,gBAAhB38B,EAAE6pC,UAA6B,CACtC,GAAIq7D,GAAa,GAAItgG,QAAO,eACxB+yC,EAAQutD,EAAWv1F,KAAK3P,EAAE4d,KAAKla,KAC/Bi0C,IAASqtD,EAAQrtD,EAAM,MACvBqtD,EAAQrtD,EAAM,IAAIuwC,UAAYloF,EAAE4d,KAChCknF,EAAYhhG,KAAK64B,KAK7B,IAAK,GAAI96B,GAAKijG,EAAYlkG,OAAS,EAAGiB,GAAM,IAAKA,EAC7C8/F,GAAYzpF,OAAO4sF,EAAYjjG,GAAK,EAGxCgjG,SAIJA,GAAuB,WACvB5iF,EAAes7E,GACf,IAAI4H,IAAa,EACbC,EAAYrjF,EAAY,QAAS4/E,GAClC/rF,OAAO,SAAS5V,GAAI,OAAQA,EAAE4hG,SAC9B3zF,IAAI,SAASjO,GACZ,GAAIq9B,GAAMtb,EAAY,KACtBsb,GAAIza,YAAYb,EAAY,KAAM/hB,EAAE0D,MAAQ1D,EAAE4d,KAAKla,MACnD,IAAI2hG,EAEAA,GADArlG,EAAEk1B,MACYnT,EAAY,OAAQ,QAAS,MAAOrU,MAAO,QAClD1N,EAAE6pC,UACK7pC,EAAEkzE,SAAWlzE,EAAE6pC,UAEfnhC,EAAMgwB,WAAW,GAGnC,IAAI4sE,GACAC,EAAQ,SASZ,IARmB,OAAfvlG,EAAE6pC,WAAqC,YAAf7pC,EAAE6pC,UAC1B07D,EAAQ,OACc,OAAfvlG,EAAE6pC,UACT07D,EAAQvlG,EAAEkoF,UAAY,OAAS,cACT,SAAfloF,EAAE6pC,YACT07D,EAAQvlG,EAAEkoF,UAAY,OAAS,eAGtB,QAATqd,EAAiB,CAGjB,GAFAD,EAAMvjF,EAAY,SAAU,KAAM,MAAOqC,MAAO,UAChDkhF,EAAI1iF,YAAYb,EAAY,SAAUrZ,EAAMmb,mBAAmBnb,EAAMib,cAAe3Y,MAAO,iBACvFtC,EAAM+mB,OACN,IAAK,GAAIi1E,KAAOh8F,GAAM+mB,OAAQ,CAC1B,GAAIvoB,GAAKwB,EAAM+mB,OAAOi1E,GAAKn9D,MAC3B+9D,GAAI1iF,YAAYb,EAAY,SAAUrZ,EAAMmb,mBAAmB3c,IAAM8D,MAAO05F,KAGpFY,EAAIt6F,MAAQhL,EAAE8zB,SAAW,cAEzBwxE,EAAIl9E,iBAAiB,SAAU,SAASvJ,GACpC7e,EAAE8zB,QAAUwxE,EAAIt6F,MAChBoL,QAAQC,IAAIrW,KACb,OACa,eAATulG,IACPD,EAAMvjF,EAAY,OAAQ,kBAAoBrU,MAAO,QACrDy3F,GAAa,EAGjB,OAAOpjF,GAAY,MAAOA,EAAY,KAAM/hB,EAAE0D,MAAQ1D,EAAE4d,KAAKla,MACnCqe,EAAY,KAAMsjF,GAClBtjF,EAAY,KAAMujF,QAE3C7hF,UAAW,uCAGhB,IAFA85E,GAAW36E,YAAYwiF,GAEnBD,EAAY,CACZ5H,GAAW36E,YAAYb,EAAY,IAAK,uQACxCw7E,GAAW36E,YAAYF,SAASuW,eAAe,mBAC/C,IAAIusE,GAAYzjF,EAAY,QAAS,MAAO7W,KAAM,OAAQ+0F,SAAU,YACpE1C,IAAW36E,YAAY4iF,GACvBA,EAAUp9E,iBAAiB,SAAU,SAASvJ,GAC1CzI,QAAQC,IAAI,kBAEZ,KAAK,GADDsqF,GAAW6E,EAAU5E,UAChBlmF,EAAK,EAAGA,EAAKimF,EAAS//F,SAAU8Z,EAAI,CACzC,GAAIpa,GAAIqgG,EAASjmF,EACjB,IAAIpa,EAAG,CACH,GAAI4e,IAAMtB,KAAMtd,EAAGshG,QAAQ,EAC3BD,IAAY79F,KAAKob,GACjB0lF,GAAc1lF,OAGvB,KAIPm+E,GAAYt7E,EAAY,SAAU,UAAW0B,UAAW,OAC5D45E,IAAUj1E,iBAAiB,QAAS,SAASvJ,GACzCA,EAAG0J,kBAAmB1J,EAAGyJ,iBACN,iBAAfg1E,GACAsC,IAEAQ,MACL,EAEH,IAAIjD,IAAgBp7E,EAAY,SAAU,WAAY0B,UAAW,OACjE05E,IAAc/0E,iBAAiB,QAAS,SAASvJ,GAC7CA,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB5f,EAAM+2B,cAAc2/D,MACrB,GACHx4F,KAAKod,YAAYm5E,GAAe,+CAEhC,IAAIsI,IAAe1jF,EAAY,OAAQq7E,GAAW,IAAKC,GAAW,IAAKF,IACvEsI,IAAaz9E,MAAMjC,OAAS,OAC5Bg+E,GAAOnhF,YAAY6iF,IAEnB9sC,EAAM/1C,YAAYmhF,IAClBjB,EAASp6F,EAAMuoB,kBAEfrqB,KAAKqkB,cAAc0tC,GACnB/xD,KAAK0e,UAAU,OAEXs+E,IACAlH,EAAeC,EAAgBiH,GAC/Bd,EAAS,GAAI5xE,GAAS2yE,QpDsqmB3B7pB,QAAQ,EAAExuE,QAAQ,EAAE8hB,aAAa,EAAE3c,QAAQ,GAAG8/B,UAAU,GAAGwpC,WAAW,GAAGxuE,aAAa,GAAGi6F,UAAU,GAAG30D,kBAAkB,GAAGmpC,UAAU,GAAGjpC,SAAS,GAAGpgC,UAAU,KAAK80F,IAAI,SAASvlG,EAAQU,EAAOJ,GqDzipBlM,YAEA,SAAS09E,GAAYe,EAAIC,EAAKj9E,GAC1Bi9E,EAAI5/D,YAAY,SAASomF,GACrB,IAAKA,EACD,MAAOzjG,GAAS,KAAM,6BAM1B,KAAK,GAJD8K,GAAO24F,EAAQ14F,MAAM,wBAErBg9C,KACA27C,KACKp2F,EAAK,EAAGA,EAAKxC,EAAKrM,OAAQ6O,GAAM,EACrCy6C,EAAKpmD,KAAKmJ,EAAKwC,IACfo2F,EAAQ/hG,KAAKsJ,SAASH,EAAKwC,EAAG,GAAI,IAGtC,OAAOtN,GAAS,GAAI2jG,GAAU57C,EAAM27C,EAAS1mB,MAIrD,QAAS2mB,GAAU57C,EAAM27C,EAAS1mB,GAC9Bv4E,KAAKsjD,KAAOA,EACZtjD,KAAKi/F,QAAUA,EACfj/F,KAAKu4E,GAAKA,EAGd2mB,EAAUv/F,UAAU2W,OAAS,SAAS++C,EAAO95D,GAIzC,IAAK,GAHD4jG,GAEAC,GAAQ/pC,EAAQ,SAASp4D,UAAU,EAAE,GAAGw5C,cACnCh9C,EAAI,EAAGA,EAAIuG,KAAKsjD,KAAKtpD,SAAUP,EACpC,GAAI2lG,EAAKvoF,cAAc7W,KAAKsjD,KAAK7pD,IAAM,EAAG,CACtC0lG,EAAUn/F,KAAKu4E,GAAG98E,MAAMuE,KAAKi/F,QAAQxlG,EAAI,GAAIuG,KAAKi/F,QAAQxlG,GAAKuG,KAAKi/F,QAAQxlG,EAAI,GAChF,OAIH0lG,IACDA,EAAUn/F,KAAKu4E,GAAG98E,MAAMuE,KAAKi/F,QAAQj/F,KAAKi/F,QAAQjlG,OAAS,KAG/DmlG,EAAQvmF,YAAY,SAASymF,GAEzB,IAAK,GADD5yB,GAAQ4yB,EAAI/4F,MAAM,MACbqmE,EAAK,EAAGA,EAAKF,EAAMzyE,SAAU2yE,EAClC,GAAoD,GAAhDF,EAAME,GAAI3vE,QAAQq4D,EAAM5e,cAAgB,KACxC,MAAOl7C,GAASkxE,EAAME,GAAIrmE,MAAM,KAGxC,OAAO/K,GAAS,SAID,mBAAZrB,KACPA,EAAOJ,SACH09E,YAAaA,SrDsjpBf8nB,IAAI,SAAS9lG,EAAQU,EAAOJ,GsD5mpBlC,YAiBA,SAASylG,MAGT,QAASriB,GAAWzK,EAAWvkE,GAC3B,GAAIivE,GAAK,GAAIoiB,EACbpiB,GAAG/hF,KAAOq3E,CACV,IAAI+sB,GAAkBC,EAClBC,EAAoB,CAExBviB,GAAG/hF,KAAKK,MAAM,EAAG+jG,GAAiB9jG,MAAM,SAASvC,GAC7C,IAAKA,EACD,MAAO+U,GAAI,KAAM,uBAErB,IAAItM,GAAK,GAAI1F,YAAW/C,GACpBgD,EAAQ1B,EAAQmH,EAAI,EACxB,IAAIzF,GAASwjG,EACTxiB,EAAG1iF,QAAUA,MACV,CAAA,GAAI0B,GAASyjG,EAGhB,MAAO1xF,GAAI,KAAM,6BAA+B/R,EAAME,SAAS,IAF/D8gF,GAAG1iF,QAAU6c,EAKjB,GAAI/L,GAAU4xE,EAAG1iF,QAAQmH,EAAI,EAC7B,IAAe,GAAX2J,EACA,MAAO2C,GAAI,KAAM,uBAAyB3C,EAG9C4xE,GAAG0iB,SAAW1iB,EAAG1iF,QAAQmH,EAAI,GAC7Bu7E,EAAG2iB,UAEH,IAAIvlG,GAAI,GAAId,EAAE,EACVJ,EAAI,EAEJ0mG,EAAe,QAAfA,KACA,KAAOtmG,EAAI0jF,EAAG0iB,UAAU,CACpB,GAAIvnF,GAAK1W,EAAGrH,EACZ,IAAIA,EAAI+d,EAAK,GAAK1W,EAAG5H,OAGjB,MAFA0lG,IAAuBF,EACvBA,EAAkB9hG,KAAKoC,IAAI2/F,EAAkB/hG,KAAK6mF,MAAMmb,EAAoBviB,EAAG0iB,SAASpmG,IACjF0jF,EAAG/hF,KAAKK,MAAMpC,EAAIkB,EAAGilG,GAAiB9jG,MAAM,SAAUvC,GACzDE,GAAKkB,EACLA,EAAI,EACJqH,EAAK,GAAI1F,YAAW/C,GACpB4mG,QAGFxlG,CAEF,KAAK,GADDuC,GAAO,GACFC,EAAI,EAAQub,GAALvb,IAAWA,EACvBD,GAAQP,OAAOC,aAAaoF,EAAGrH,KAEnC,IAAID,GAAS6iF,EAAG1iF,QAAQmH,EAAIrH,EAC5BA,IAAK,EACL4iF,EAAG2iB,QAAQhjG,GAAQ,GAAIkjG,GAAU7iB,EAAI7iF,KACnCb,EAGV,MAAOyU,GAAIivE,GAGf4iB,OAwBR,QAASC,GAAUC,EAAK3lG,GACpB0F,KAAKigG,IAAMA,EACXjgG,KAAK1F,OAASA,EAtGlB,GAAwB,mBAAbd,GACP,GAAI2E,GAAM3E,EAAQ,SACdiB,EAAU0D,EAAI1D,QACd6c,EAAYnZ,EAAImZ,UAEhBpZ,EAAQ1E,EAAQ,WAChB4E,EAAQF,EAAME,MACdC,EAAQH,EAAMG,MACdC,EAAeJ,EAAMI,YAG7B,IAAIqhG,GAAe,UACfC,EAAkB,WAClBH,EAAoB,KAoExBF,GAAW5/F,UAAUkgF,OAAS,SAASr+E,GACnC,GAAIuC,GAAM/D,KAAK8/F,QAAQt+F,EAIvB,OAHKuC,KACDA,EAAM/D,KAAK8/F,QAAQ,MAAQt+F,IAExBuC,GAGXw7F,EAAW5/F,UAAUjE,MAAQ,SAAS8F,EAAK7D,EAAKmC,EAAKoO,GACjD,GAAInK,GAAM/D,KAAK6/E,OAAOr+E,EACtB,OAAKuC,GAEapG,GAAPmC,EACAoO,EAAI,QAEXnK,GAAIrI,MAAMiC,EAAKmC,EAAKoO,GAJbA,EAAI,KAAM,iBAAmB1M,IAa5Cw+F,EAAUrgG,UAAU49B,KAAO,SAASrvB,GAChC,GAAIlO,KAAKkgG,UACL,MAAOhyF,IAGX,IAAIpM,GAAQ9B,IACZ8B,GAAMm+F,IAAI7kG,KAAKK,MAAMqG,EAAMxH,OAAQ,GAAGoB,MAAM,SAASioF,GACjD,IAAKA,EACD,MAAOz1E,GAAI,eAEf,IAAItM,GAAK,GAAI1F,YAAWynF,EACxB7hF,GAAMq+F,QAAUr+F,EAAMm+F,IAAIxlG,QAAQmH,EAAI,GACtCE,EAAMs+F,UAAYt+F,EAAMm+F,IAAIxlG,QAAQmH,EAAI,GACxCE,EAAMm+F,IAAI7kG,KAAKK,MAAMqG,EAAMxH,OAAS,EAAmB,EAAhBwH,EAAMs+F,UAAc,GAAG1kG,MAAM,SAAS2kG,GACzE,IAAKA,EACD,MAAOnyF,GAAI,eAIf,KAAK,GAFDtM,GAAK,GAAI1F,YAAWmkG,GACpBC,EAAM,KACD5lG,EAAI,EAAGA,EAAIoH,EAAMs+F,YAAa1lG,EAAG,CACtC,GAAI6lG,GAAQz+F,EAAMm+F,IAAIxlG,QAAQmH,EAAQ,EAAJlH,GAC9B8lG,EAAQ1+F,EAAMm+F,IAAIxlG,QAAQmH,EAA4B,GAAvBlH,EAAIoH,EAAMs+F,YACzCK,EAAK,GAAIriG,GAAMmiG,EAAOA,EAAQC,EAAQ,EAItCF,GAHCA,EAGKjiG,EAAMiiG,EAAKG,GAFXA,EASd,MAJA3+F,GAAM4+F,QAAUJ,EAChBx+F,EAAM6+F,UAAY7+F,EAAMm+F,IAAIxlG,QAAQmH,EAAoB,EAAhBE,EAAMs+F,WAC9Ct+F,EAAM2B,WAAc3B,EAAMq+F,QAAU,GAAG,EAAG,EAC1Cr+F,EAAMo+F,UAAYp+F,EAAMxH,OAAS,GAA4C,GAArCwH,EAAMs+F,UAAYt+F,EAAM6+F,WACzDzyF,QAKnB,IAAI0yF,IAAgB,IAAK,IAAK,IAAK,IAEnCZ,GAAUrgG,UAAUjE,MAAQ,SAASiC,EAAKmC,EAAKoO,KACzCvQ,IAAOmC,CACT,IAAIgC,GAAQ9B,IACZA,MAAKu9B,KAAK,SAASjP,GACf,GAAIA,EACA,MAAOpgB,GAAI,KAAMogB,EAGrB,IAAIrsB,GAAWtE,GAAO,EAClBuE,EAAWpC,EAAM,GAAK,CAC1B,OAAe,GAAXmC,GAAgBC,EAAWJ,EAAM2B,UAC1ByK,EAAI,8BAAgCvQ,EAAM,IAAMmC,OAG3DgC,GAAMm+F,IAAI7kG,KAAKK,MAAMqG,EAAMo+F,UAAYj+F,EAAUC,EAAWD,GAAU8I,SAASrP,MAAM,SAASvC,GAgB1F,QAAS0nG,GAAQC,GACb,KAAcA,GAAPt1B,GAAY,CACf,GAGItyE,GAHA6nG,GAAMv1B,GAAO,GAAKvpE,EAClB+yC,EAAW,EAANw2B,EACLw1B,EAAKC,EAAQF,EAGb7nG,GADM,GAAN87C,EACKgsD,GAAM,EAAK,EACH,GAANhsD,EACFgsD,GAAM,EAAK,EACH,GAANhsD,EACFgsD,GAAM,EAAK,EAEL,EAANA,EAETE,GAAUN,EAAa1nG,KACrBsyE,GA/BV,GAAS,MAALryE,EACA,MAAO+U,GAAI,kBAEf,IAAI+yF,GAAU,GAAI/kG,YAAW/C,GAEzBgoG,IACJ,IAAIr/F,EAAM4+F,QAAS,CACf,GAAIU,GAAO9iG,EAAa,GAAIF,GAAMT,EAAKmC,GAAMgC,EAAM4+F,QAC/CU,KACAD,EAASC,EAAKj5F,UA0BtB,IAAK,GAtBD+4F,GAAS,GACT11B,EAAM7tE,EAqBDjD,EAAI,EAAGA,EAAIymG,EAAOnnG,SAAUU,EAAG,CACpC,GAAI+lG,GAAKU,EAAOzmG;AAChB,GAAI8wE,EAAMi1B,EAAG9iG,MACT,KAAM,eAKV,KAHI6tE,EAAMi1B,EAAG9iG,OACTkjG,EAAQJ,EAAG9iG,MAAQ,GAEhB6tE,GAAOi1B,EAAG3gG,OACbohG,GAAU,MACR11B,EAMV,MAHW1rE,IAAP0rE,GACAq1B,EAAQ/gG,GAELoO,EAAIgzF,QAKvBlB,EAAUrgG,UAAU3F,OAAS,SAASkU,GAClC,GAAIpM,GAAQ9B,IACZA,MAAKu9B,KAAK,SAASjP,GACf,MAAIA,GACOpgB,EAAI,KAAMogB,GAEVpgB,EAAIpM,EAAMq+F,YAKN,mBAAZjmG,KACPA,EAAOJ,SACHojF,WAAYA,MtDynpBjBt4E,QAAQ,EAAEE,UAAU,KAAKu8F,IAAI,SAAS7nG,EAAQU,EAAOJ,GuDh2pBxD,YA6BA,SAASmiE,GAAQ1iE,EAAGwB,GAChB,IAAK,GAAItB,GAAI,EAAGA,EAAIF,EAAES,SAAUP,EAC5B,GAAIF,EAAEE,IAAMsB,EACR,MAGRxB,GAAE2D,KAAKnC,GAGX,QAAS2jC,GAAMjnB,EAAKrG,EAAGrW,GACf0c,EAAIrG,GACJqG,EAAIrG,GAAGlU,KAAKnC,GAEZ0c,EAAIrG,IAAMrW,GAIlB,QAAS2jE,GAASjnD,EAAKrG,EAAGrW,GACtB,GAAIxB,GAAIke,EAAIrG,EACZ,IAAI7X,EAAG,CACH,IAAK,GAAIE,GAAI,EAAGA,EAAIF,EAAES,SAAUP,EAC5B,GAAIF,EAAEE,IAAMsB,EACR,MAGRxB,GAAE2D,KAAKnC,OAEP0c,GAAIrG,IAAMrW,GAKlB,QAAS6gE,GAAKriE,EAAGmB,EAAG2F,EAAG6U,GAEnB,MAAI3b,GACOA,EACAmB,EACAA,EACA2F,EACAA,EACA6U,EACAA,EADJ,OAKX,QAAS+mD,GAAQpiE,EAAGR,GAEhB,IAAK,GAAII,GAAI,EAAGA,EAAII,EAAEG,SAAUP,EAC5B,GAAII,EAAEJ,IAAMJ,EACR,MAGRQ,GAAEqD,KAAK7D,GAKX,QAASssC,GAAapsC,EAAG+N,GACrB,IAAK/N,EACD,MAAO,EAGX,KAAK,GAAIE,GAAI,EAAGA,EAAIF,EAAES,SAAUP,EAC5B,GAAIF,EAAEE,KAAO6N,EACT,MAAO7N,EAGf,OAAO,GAGX,QAAS6nG,GAAY/nG,EAAG+N,GACpB,GAAI7N,GAAIksC,EAAapsC,EAAG+N,EACxB,OAAI7N,IAAK,GACLF,EAAE+X,OAAO7X,EAAG,IACL,IAEJ,EAQX,QAAS0hB,GAAY9W,EAAKywC,EAAUysD,EAASltD,GAEzC,GAAI+c,GAAMt1C,SAASwpD,cAAcjhE,EACjC,IAAIywC,EAAU,CACHA,YAAoBW,SACvBX,GAAYA,GAEhB,KAAK,GAAIr7C,GAAI,EAAGA,EAAIq7C,EAAS96C,SAAUP,EAAG,CACtC,GAAI4G,GAAIy0C,EAASr7C,EACb4G,KACgB,gBAALA,GACPA,EAAIyb,SAASuW,eAAehyB,GACT,gBAALA,KACdA,EAAIyb,SAASuW,eAAe,GAAKhyB,IAErC+wD,EAAIp1C,YAAY3b,KAK5B,GAAIkhG,EACA,IAAK,GAAI1nG,KAAK0nG,GACV,IACInwC,EAAIv3D,GAAK0nG,EAAQ1nG,GACnB,MAAOb,GAEL,KADAwW,SAAQC,IAAI,iBAAmB5V,GACzBb,EAIlB,GAAIq7C,EACA,IAAK,GAAIx6C,KAAKw6C,GACV+c,EAAIhwC,MAAMvnB,GAAKw6C,EAAOx6C,EAG9B,OAAOu3D,GAGX,QAASkR,GAAck/B,EAAWn9F,EAAKywC,EAAUysD,GAE7C,GAAInwC,GAAMt1C,SAAS2lF,gBAAgBD,EAAWn9F,EAC9C,IAAIywC,EAAU,CACHA,YAAoBW,SACvBX,GAAYA,GAEhB,KAAK,GAAIr7C,GAAI,EAAGA,EAAIq7C,EAAS96C,SAAUP,EAAG,CACtC,GAAI4G,GAAIy0C,EAASr7C,EACD,iBAAL4G,KACPA,EAAIyb,SAASuW,eAAehyB,IAEhC+wD,EAAIp1C,YAAY3b,IAKxB,MADAqhG,GAAStwC,EAAKmwC,GACPnwC,EAKX,QAASuwC,GAAQlrF,EAAMrI,EAAKhK,GAExB,GAAIgqE,GAAOwzB,EAAgBxzF,EAC3B,KAAKggE,EAAM,CAEP,IAAK,GADDyzB,GAAQ,GACHxhG,EAAI,EAAGA,EAAI+N,EAAIpU,SAAUqG,EAAG,CACjC,GAAIkE,GAAK6J,EAAInR,UAAUoD,EAAGA,EAAE,GACxByhG,EAAMv9F,EAAGkyC,aACTqrD,IAAOv9F,EACPs9F,EAAQA,EAAQ,IAAMC,EAEtBD,GAAgBt9F,EAGxBq9F,EAAgBxzF,GAAOyzF,EACvBzzB,EAAOyzB,EAEXprF,EAAK4P,aAAa+nD,EAAMhqE,GAG5B,QAASs9F,GAASjrF,EAAM8qF,GAEpB,GAAIA,EACA,IAAK,GAAI1nG,KAAK0nG,GACVI,EAAQlrF,EAAM5c,EAAG0nG,EAAQ1nG,IAOrC,QAASwhB,GAAe5E,GAEpB,GAAKA,GAASA,EAAKs+B,WAInB,KAAOt+B,EAAKs+B,WAAW/6C,OAAS,GAC5Byc,EAAKiO,YAAYjO,EAAKwI,YAU9B,QAASoQ,GAAYh2B,EAAG0oG,GACpB,GAAiB,mBAAN1oG,GACP,MAAO,WACJ,IAAS,MAALA,EACP,MAAO,MACJ,IAAgB,gBAALA,GACd,MAAO,IAAMA,EAAI,GACd,IAAgB,gBAALA,GACd,MAAO,GAAKA,CACT,IAAgB,iBAALA,GACd,MAAO,GAAKA,CACT,IAAgB,WAAZ,mBAAOA,GAAP,YAAA6d,EAAO7d,IAAe,CAC7B,GAAIA,YAAao8C,OAAO,CAEpB,IAAK,GADDr8C,GAAI,KACCK,EAAI,EAAGA,EAAIJ,EAAEW,SAAUP,EAC5BL,GAAU,MAALA,EAAY,GAAMA,EAAI,MAASi2B,EAAYh2B,EAAEI,GAAIsoG,EAE1D,OAAO,KAAO3oG,EAAEA,EAAE,IAAM,IAExB2oG,EAAMA,KACN,IAAI3oG,GAAI,IACR,KAAK,GAAIgY,KAAK/X,GACN0oG,EAAI3wF,IAECjP,QAALiP,GAAkC,kBAAT/X,GAAE+X,KAC3BhY,GAAU,MAALA,EAAY,GAAMA,EAAI,MAASgY,EAAI,KAAOie,EAAYh2B,EAAE+X,GAAI2wF,GAGzE,OAAO,KAAO3oG,EAAEA,EAAE,IAAM,IAG5B,MAAA,mBAAeC,GAAf,YAAA6d,EAAe7d,GAIvB,QAASyM,GAAYzM,GACjB,GAAIH,KACJ,KAAK,GAAIkY,KAAK/X,GACVH,EAAEkY,GAAK/X,EAAE+X,EAEb,OAAOlY,GAGX,QAASoxB,GAAShjB,GACdtH,KAAKoE,MAAQkD,EACbtH,KAAKozF,aA2BT,QAAShkE,KACLpvB,KAAKgiG,SA0BT,QAASC,GAAQnkG,GACb,MAAOA,GAAM,SAAW8Z,EAAS,GAAK3I,KAAKC,MAAQ,OAASgzF,GAGhE,QAAS5yE,GAAQxxB,EAAKvC,EAAUkG,GACxBA,GAAQA,EAAKwX,OACbnb,EAAMmkG,EAAQnkG,GAElB,KACI,GAAIjC,EACA4F,IAAQA,EAAK5F,UACbA,EAAUoe,WACN,WAGI,MAFAzK,SAAQC,IAAI,cAAgB3R,GAC5Bib,EAAImB,QACG3e,EAAS,KAAM,YAE1BkG,EAAK5F,SAIb,IAAIkd,GAAM,GAAIC,eACdD,GAAIK,mBAAqB,WACF,GAAlBL,EAAIM,aACGxd,GACAwe,aAAaxe,GAChBkd,EAAIO,OAAS,KAAOP,EAAIO,QAAU,IACzC/d,EAAS,KAAM,cAAgBwd,EAAIO,QAEnC/d,EAASwd,EAAIQ,gBAKfR,EAAIG,KAAK,MAAOpb,GAAK,GACrBib,EAAIqB,aAAe,OAEf3Y,GAAQA,EAAK+X,cACbT,EAAIU,iBAAkB,GAE1BV,EAAIW,OACN,MAAO1gB,GACLuC,EAAS,KAAM,aAAevC,IAItC,QAAS2wF,GAAYz1B,EAAMj4C,GAGvB,GAA4B,GAAxBA,EAAIjf,QAAQ,UAA0C,GAAzBif,EAAIjf,QAAQ,UACzC,MAAOif,EAGX,IAAI0wD,GAAKzY,EAAKiuC,YAAY,IAC1B,OAAIx1B,IAAM,EACCzY,EAAK1lD,OAAO,EAAGm+D,EAAK,GAAK1wD,EAEzBA,EAuEf,QAASkiE,GAAiBliE,GACtB,MAAOd,GAAY,IAAK,MAAOe,KAAMD,IAAMC,KvD26oB/C,GAAIhF,GAA4B,kBAAXK,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,QAAUE,IAAQF,OAAO5X,UAAY,eAAkB8X,GuD12pBtQ,IAAwB,mBAAbje,GACP,GAAIme,GAAOne,EAAQ,UACfoe,EAAWD,EAAKC,QAGxB,IAoKIgqF,IApKa,GAAI5jG,QAAO,UAYJ,GAAIA,QAAO,eA0PnCssB,GAAS3qB,UAAUyiG,YAAc,SAAS1oG,GACtCsG,KAAKozF,UAAUl2F,KAAKxD,IAGxB4wB,EAAS3qB,UAAU69F,mBAAqB,SAAS9jG,GAC7CsG,KAAKozF,UAAUl2F,KAAKxD,GACpBA,EAAEsG,KAAKoE,QAGXkmB,EAAS3qB,UAAU49F,eAAiB,SAAS7jG,GACzC4nG,EAAYthG,KAAKozF,UAAW15F,IAGhC4wB,EAAS3qB,UAAU2pC,IAAM,WACrB,MAAOtpC,MAAKoE,OAGhBkmB,EAAS3qB,UAAUwtB,IAAM,SAAS7lB,GAC9BtH,KAAKoE,MAAQkD,CACb,KAAK,GAAI7N,GAAI,EAAGA,EAAIuG,KAAKozF,UAAUp5F,SAAUP,EACzCuG,KAAKozF,UAAU35F,GAAG6N,IAQ1B8nB,EAAQzvB,UAAUgqE,QAAU,SAASriE,GACjC,GAAiBnF,SAAbnC,KAAKoY,IACL,KAAM,qCAGVpY,MAAKoY,IAAM9Q,CACX,KAAK,GAAI7N,GAAI,EAAGA,EAAIuG,KAAKgiG,MAAMhoG,SAAUP,EACrCuG,KAAKgiG,MAAMvoG,GAAG6N,EAElBtH,MAAKgiG,MAAQ,MAGjB5yE,EAAQzvB,UAAUorE,MAAQ,SAASrxE,GAC/B,MAAiByI,UAAbnC,KAAKoY,KACL1e,EAAEsG,KAAKoY,KACApY,KAAKoY,SAEZpY,MAAKgiG,MAAM9kG,KAAKxD,GAIxB,IAAIwoG,GAAuB,EA+DvB3/B,GACA8/B,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IACPC,IAAO,IAWL,SAAU7pG,QAAOoD,YACnBpD,OAAOoD,UAAUm3F,KAAO,WACpB,MAAO92F,MAAKjC,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,MAIjC,mBAAZ7D,KACPA,EAAOJ,SACHw1B,QAASA,EACTq6D,YAAaA,EACbxL,iBAAkBA,EAClBr4E,YAAaA,EACb44B,MAAOA,EACPu9B,QAASA,EACTyC,SAAUA,EACV/4B,aAAcA,EACdi2B,KAAMA,EAENzgD,YAAaA,EACbmnD,cAAeA,EACfjnD,eAAgBA,EAEhBgU,YAAaA,EAEb/E,SAAUA,EACV8E,QAASA,EAETmzC,uBAAwBA,MvD61pB7B5nD,SAAS,KAAK0rF,IAAI,SAAS7sG,EAAQU,EAAOJ,GwDh0qB7C,YAaA,SAASwsG,KACLtmG,KAAKs8D,QAWT,QAASiqC,GAAgBrhG,EAAQzC,GAC7BzC,KAAKkF,OAASA,EACdlF,KAAKyC,KAAQA,EAzBjB,GAAwB,mBAAbjJ,GACP,CAAA,GAAI6L,GAAK7L,EAAQ,oBACb8L,EAAkCD,EAAGE,sBAErCC,EAAMhM,EAAQ,SACdiM,EAAgBD,EAAIC,cACpBC,EAAWF,EAAIE,SACfE,EAAaJ,EAAII,UACNJ,GAAIG,SAOvB,GAAI6gG,GAAc,wBACdC,EAAkB,mBAClBC,EAAsB,4BAE1BJ,GAAU3mG,UAAUoG,cAAgB,SAAStD,GACzC,MAAO,IAAI8jG,GAAgBvmG,KAAMyC,IAQrC8jG,EAAgB5mG,UAAUwG,MAAQ,SAASC,GACvC,GAAmB,GAAfA,EAAKpM,OAET,GAAe,KAAXoM,EAAK,GAAT,CA4BA,GAAIC,GAAOD,EAAKE,MAAM,KAClB5M,EAAI,GAAIkM,EACZlM,GAAE6J,QAAU8C,EAAK,GACjB3M,EAAE+N,GAAKpB,EAAK,GACZ3M,EAAEitG,UAAYtgG,EAAK,GACnB3M,EAAEgoD,WAAar7C,EAAK,GAAGC,MAAM,KAC7B5M,EAAEiE,IAAM6I,SAASH,EAAK,IACtB3M,EAAEoG,IAAMpG,EAAEiE,IAAMjE,EAAEitG,UAAU3sG,OAAS,CAErC,IAAI4sG,GAAWvgG,EAAK,GAAGC,MAAMkgG,EAC7B9sG,GAAE4iE,OACF,KAAK,GAAIzzD,GAAK,EAAGA,EAAK+9F,EAAS5sG,OAAQ6O,GAAM,EACzCnP,EAAE4iE,KAAKsqC,EAAS/9F,EAAK,IAAM+9F,EAAS/9F,EAAK,EAI7C,IAAIu8D,GAAM1rE,EAAEgoD,WAAW,GACnBlkD,EAAM9D,EAAEitG,SACRvhC,GAAIprE,OAASwD,EAAIxD,QACjBN,EAAE4K,KAAO,YACe,GAApB8gE,EAAIpoE,QAAQQ,IACZ9D,EAAE+nD,UAAY2jB,EAAI52D,OAAOhR,EAAIxD,QAC7BN,EAAEiE,KAAOH,EAAIxD,OACbN,EAAEoG,IAAMpG,EAAEiE,IAAM,GAEhBjE,EAAE+nD,UAAY2jB,GAEXA,EAAIprE,OAASwD,EAAIxD,OACxBN,EAAE4K,KAAO,WAET5K,EAAE4K,KAAO,eAGbtE,KAAKyC,KAAK/I,OA5DN,IAAI0M,EAAKpM,OAAS,GAAgB,KAAXoM,EAAK,GAAW,CACnC,GAAI0C,GAAI29F,EAAgB19F,KAAK3C,EAC7B,IAAI0C,EAAG,CAGH,IAAK,GAFDzC,GAAOyC,EAAE,GAAGxC,MAAMogG,GAClBj/F,EAAK,KAAM0sC,EAAO,KACbtrC,EAAK,EAAGA,EAAKxC,EAAKrM,OAAS,EAAG6O,GAAM,EAAG,CAC5C,GAAIuF,GAAM/H,EAAKwC,EAAK,GAChBzE,EAAQiC,EAAKwC,EAAK,GAAG9K,QAAQ,KAAM,GAC5B,OAAPqQ,EACA3G,EAAKrD,EACS,eAAPgK,IACP+lC,EAAO/vC,GAGXqD,GAAM0sC,GACNn0C,KAAKkF,OAAOo3D,KAAKp/D,MACZuK,GAAIA,EACJ0sC,KAAMA,IAInB,SA0CZoyD,EAAgB5mG,UAAUgJ,MAAQ,aAElC29F,EAAU3mG,UAAUqJ,cAAgB,SAASzN,GACzC,GAAI0N,GAAa,GAAIxD,GAGb+uD,EAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,cACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,iBACnBirD,EAASprD,QAAU,UACnBorD,EAASlM,YAAc,QACvBr/C,EAAWK,WAAWhF,KAAM,aAAc,KAAMkwD,EAGhD,IAAIA,GAAW,GAAI9uD,EACnB8uD,GAASrrD,MAAQ,WACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,mBACnBirD,EAASprD,QAAU,UACnBorD,EAASlM,YAAc,QACvBr/C,EAAWK,WAAWhF,KAAM,YAAa,KAAMkwD,EAG/C,IAAIA,GAAW,GAAI9uD,EAUvB,OATI8uD,GAASrrD,MAAQ,WACjBqrD,EAAShrD,KAAO,MAChBgrD,EAAS/qD,MAAQ,KACjB+qD,EAASjrD,QAAU,iBACnBirD,EAASprD,QAAU,UACnBorD,EAASlM,YAAc,QACvBr/C,EAAWK,WAAWhF,KAAM,WAAY,KAAMkwD,GAG3Cj5D,EAAS0N,IAGpBq9F,EAAU3mG,UAAU0tE,eAAiB,SAAS9xE,GAC1C,GAAIs1B,GAAO7wB,KACP0gF,EAAM,SAASpkE,EAASkgD,GAIxB,GAHAA,EAAY7/C,IAAI,cAAeL,EAAQqqF,WACvCnqC,EAAY7/C,IAAI,eAAgBL,EAAQolC,WAAWlJ,KAAK,MAEpDl8B,EAAQggD,KACR,IAAK,GAAIrmD,GAAK,EAAGA,EAAK4a,EAAKyrC,KAAKtiE,SAAUic,EAAI,CAC1C,GAAIqmD,GAAOzrC,EAAKyrC,KAAKrmD,GACjB4wF,EAAMvqF,EAAQggD,KAAKA,EAAK70D,GAChBtF,UAAR0kG,GACArqC,EAAY7/C,IAAI2/C,EAAKnoB,KAAM0yD,IAK3CtrG,GAASmlF,IAGbp7E,EAAgC,MAAO,WAAY,MAAO,IAAIghG,OxD20qB3Dv8F,QAAQ,GAAGC,mBAAmB,KAAK88F,IAAI,SAASttG,EAAQU,EAAOJ,GyDt+qBlE,YAEA,IAAI40B,IACAirD,OAAQ,EACRotB,MAAQ,EACRC,MAAQ,GACRC,MAAQ,EACRC,OAAQ,WAGZx4E,GAAQryB,SAAW,WACf,GAAI8qG,GAAK,GAAKnnG,KAAK+mG,MAAQ,IAAM/mG,KAAKgnG,MAAQ,IAAMhnG,KAAKinG,KAOzD,OANIjnG,MAAKonG,QACLD,GAAUnnG,KAAKonG,OAEfpnG,KAAKknG,QAAyB,IAAflnG,KAAKknG,SACpBC,EAAKA,EAAK,IAAMnnG,KAAKknG,QAElBC,GAGY,mBAAZjtG,KACPA,EAAOJ,QAAU40B,QzDm/qBf24E,IAAI,SAAS7tG,EAAQU,EAAOJ,G0DxgrBlC,YAOA,SAASyhB,GAAe9Z,GA+BpB,QAAS6lG,GAAOC,GACZA,EAAK7pG,KAAKC,IAAI4pG,EAAItoD,GAClBsoD,EAAK7pG,KAAKoC,IAAIynG,EAAIxoD,GAClBj8C,EAAMykG,EACNC,EAAMpmF,MAAMua,KAAO,GAAK74B,EAAM,KAGlC,QAAS2kG,GAAQF,GACbA,EAAK7pG,KAAKC,IAAI4pG,EAAItoD,GAClBsoD,EAAK7pG,KAAKoC,IAAIynG,EAAIxoD,GAClB2oD,EAAOH,EACPI,EAAOvmF,MAAMua,KAAO,GAAK+rE,EAAO,KAzCpCjmG,EAAOA,KAEP,IAAIs9C,GAAS,EAAGE,EAASx9C,EAAK+b,OAAS,IACnC7f,EAAM,EAAGmC,EAAM,IACfgD,EAAM,GAAI4kG,EAAO,IACjBE,KACA9c,EAAQ3vE,EAAY,KAAM,MAAO0B,UAAW,iBAAkBW,MAAO,IAAa,EAAPyhC,GAAY,OACvFuoD,EAAQrsF,EAAY,KAAM,MAAO0B,UAAW,wBAC5C8qF,EAASxsF,EAAY,KAAM,MAAO0B,UAAW,iBAC7CgrF,EAAS1sF,EAAY,OAAQ2vE,EAAO0c,EAAOG,IAAU9qF,UAAW,WAAaW,MAAO,KAAc,EAAPyhC,GAAY,IAAM,MAEjH4oD,GAAOlnF,aAAe,WAClB,IAAK,GAAIgsD,GAAK,EAAGA,EAAKi7B,EAAO5tG,SAAU2yE,EACnCk7B,EAAOnjF,YAAYkjF,EAAOj7B,GAE9Bi7B,OAGJC,EAAO3nF,SAAW,SAAS2mF,EAAKiB,GAC5B,GACIphG,GAAQyU,EAAY,MAAO2sF,GAAMjrF,UAAW,iBAC5C8e,KAAM,IAAOojB,GAAW8nD,EAAMlpG,IAAQshD,EAASF,IAAUj/C,EAAInC,GAAM,GAAK,MAE5EkqG,GAAO7rF,YAAYtV,GACnBkhG,EAAO1qG,KAAKwJ,GAGhB,IAAIqhG,GAAWjsF,SAASksF,YAAY,aACpCD,GAASE,UAAU,UAAU,GAAM,GAgBnCvrD,OAAO8S,eAAeq4C,EAAQ,SAC1Bv+D,IAAK,WAAa,MAAO3rC,IAASmF,EAAIi8C,IAAWj/C,EAAInC,IAASshD,EAASF,IACvE5xB,IAAK,SAASpyB,GACZ,GAAIwsG,GAAKxoD,GAAWhkD,EAAE4C,IAAQshD,EAAOF,IAAUj/C,EAAInC,EACnD2pG,GAAOC,MAIb7qD,OAAO8S,eAAeq4C,EAAQ,UAC1Bv+D,IAAK,WAAa,MAAO3rC,IAAS+pG,EAAK3oD,IAAWj/C,EAAInC,IAASshD,EAASF,IACxE5xB,IAAK,SAASpyB,GACZ,GAAIwsG,GAAKxoD,GAAWhkD,EAAE4C,IAAQshD,EAAOF,IAAUj/C,EAAInC,EACnD8pG,GAAQF,MAId7qD,OAAO8S,eAAeq4C,EAAQ,UAC1Bv+D,IAAK,WAAY,MAAOk+D,GAAM9qF,UAAUtM,SAAS,UAAY,EAAI,GACjE+c,IAAK,SAAS7lB,GACD,GAALA,GACAkgG,EAAM9qF,UAAUC,IAAI,UACpBgrF,EAAOjrF,UAAUqC,OAAO,YAExB4oF,EAAOjrF,UAAUC,IAAI,UACrB6qF,EAAM9qF,UAAUqC,OAAO,cAKnC29B,OAAO8S,eAAeq4C,EAAQ,OAC5Bv+D,IAAK,WAAY,MAAO3rC,IACxBwvB,IAAK,SAASpyB,GAAI4C,EAAM5C,KAG1B2hD,OAAO8S,eAAeq4C,EAAQ,OAC5Bv+D,IAAK,WAAY,MAAOxpC,IACxBqtB,IAAK,SAASpyB,GAAI+E,EAAM/E,IAG1B,IAAIT,GACA07F,EAEAkS,EAAiB,SAASjwF,GAC1B+9E,EAAQh2F,MAAQwnG,EAAQ,EAAI,EACxBxR,GAAS6R,EAAOnnF,SAChBmnF,EAAOnnF,OAASs1E,EAChB6R,EAAOM,cAAcJ,IAEzB9vF,EAAG0J,kBAAmB1J,EAAGyJ,iBACzB8K,OAAOhL,iBAAiB,YAAa4mF,GAAkB,GACvD57E,OAAOhL,iBAAiB,UAAW6mF,GAAqB,GACxD/tG,EAAS2d,EAAGqjB,SAAoB,GAAT06D,EAAalzF,EAAM4kG,GAG9CF,GAAMhmF,iBAAiB,YAAa0mF,GAAgB,GACpDP,EAAOnmF,iBAAiB,YAAa0mF,GAAgB,EAErD,IAAIE,GAAmB,SAASnwF,GACf,GAAT+9E,EACAsR,EAAOrvF,EAAGqjB,QAAUhhC,GAEpBmtG,EAAQxvF,EAAGqjB,QAAUhhC,GACzButG,EAAOM,cAAcJ,IAGrBM,EAAsB,QAAtBA,GAA+BpwF,GAC/BuU,OAAOrI,oBAAoB,YAAaikF,GAAkB,GAC1D57E,OAAOrI,oBAAoB,UAAWkkF,GAAqB,GAG/D,OAAOR,GAxHX,GAAwB,mBAAbruG,GACP,GAAIqM,GAAQrM,EAAQ,WAChB2hB,EAActV,EAAMsV,WAyHL,oBAAZjhB,KACPA,EAAOJ,QAAUyhB,K1DoirBlBtR,UAAU,KAAKq+F,IAAI,SAAS9uG,EAAQU,EAAOJ,IAC9C,SAAWyuG,G2D7qrBX,YAcA,SAAAC,GAAAC,EAAAr6F,EAAAhK,GACAqkG,EAAAr6F,IAAAsuC,OAAAgsD,GAAAD,EAAAr6F,GACA+5E,UAAA,EACAC,cAAA,EACAhkF,MAAAA,IAVA,GANA5K,EAAA,gBAEAA,EAAA,+BAEAA,EAAA,4BAEA+uG,EAAAI,eACA,KAAA,IAAAhvG,OAAA,iDAEA4uG,GAAAI,gBAAA,CAEA,IAAAD,GAAA,gBASAF,GAAAjsG,OAAAoD,UAAA,UAAA,GAAAipG,UACAJ,EAAAjsG,OAAAoD,UAAA,WAAA,GAAAkpG,QAEA,gMAAAviG,MAAA,KAAAsV,QAAA,SAAAxN,MACAA,IAAAo6F,EAAA/yD,MAAArnC,EAAA06F,SAAA/uG,KAAAuI,QAAA8L,S3DgrrBGrU,KAAKiG,KAAuB,mBAAXuoG,QAAyBA,OAAyB,mBAAT13E,MAAuBA,KAAyB,mBAAXrE,QAAyBA,aAExHu8E,2BAA2B,GAAGC,eAAe,IAAIC,8BAA8B,MAAMC,IAAI,SAAS1vG,EAAQU,EAAOJ,G4D5srBpHN,EAAA,oCACAU,EAAAJ,QAAAN,EAAA,uBAAAwE,OAAAmrG,S5D+srBGC,sBAAsB,GAAGC,mCAAmC,MAAMC,IAAI,SAAS9vG,EAAQU,EAAOJ,G6DhtrBjGI,EAAAJ,QAAA,SAAAg9B,GACA,GAAA,kBAAAA,GAAA,KAAAo5B,WAAAp5B,EAAA,sBACA,OAAAA,S7DotrBMyyE,IAAI,SAAS/vG,EAAQU,EAAOJ,G8DttrBlC,GAAA0vG,GAAAhwG,EAAA,SACAU,GAAAJ,QAAA,SAAAg9B,EAAA2hB,GACA,GAAA,gBAAA3hB,IAAA,UAAA0yE,EAAA1yE,GAAA,KAAAo5B,WAAAzX,EACA,QAAA3hB,K9D0trBG2yE,SAAS,KAAKC,IAAI,SAASlwG,EAAQU,EAAOJ,G+D5trB7C,GAAA6vG,GAAAnwG,EAAA,UAAA,eACAowG,EAAAn0D,MAAA91C,SACAwC,SAAAynG,EAAAD,IAAAnwG,EAAA,WAAAowG,EAAAD,MACAzvG,EAAAJ,QAAA,SAAAsU,GACAw7F,EAAAD,GAAAv7F,IAAA,K/DiurBGy7F,UAAU,IAAIC,SAAS,MAAMC,IAAI,SAASvwG,EAAQU,EAAOJ,GgEturB5DI,EAAAJ,QAAA,SAAAg9B,EAAA8wD,EAAA9qF,EAAAktG,GACA,KAAAlzE,YAAA8wD,KAAAzlF,SAAA6nG,GAAAA,IAAAlzE,GACA,KAAAo5B,WAAApzD,EAAA,0BACA,OAAAg6B,ShE0urBMmzE,IAAI,SAASzwG,EAAQU,EAAOJ,GiE7urBlC,GAAAowG,GAAA1wG,EAAA,eACAU,GAAAJ,QAAA,SAAAg9B,GACA,IAAAozE,EAAApzE,GAAA,KAAAo5B,WAAAp5B,EAAA,qBACA,OAAAA,MjEivrBGqzE,eAAe,MAAMC,IAAI,SAAS5wG,EAAQU,EAAOJ,GkEnvrBpD,YACA,IAAAuwG,GAAA7wG,EAAA,gBACA8wG,EAAA9wG,EAAA,wBACA+wG,EAAA/wG,EAAA,eAEAU,GAAAJ,WAAA0wG,YAAA,SAAA9nE,EAAAn8B,GACA,GAAAkiG,GAAA4B,EAAArqG,MACAgiC,EAAAuoE,EAAA9B,EAAAzuG,QACAywG,EAAAH,EAAA5nE,EAAAV,GACAs1C,EAAAgzB,EAAA/jG,EAAAy7B,GACAv7B,EAAAi+C,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,OACA+uC,EAAAxzC,KAAAC,KAAAwE,SAAAsE,EAAAu7B,EAAAsoE,EAAA7jG,EAAAu7B,IAAAs1C,EAAAt1C,EAAAyoE,GACAC,EAAA,CAMA,KALAD,EAAAnzB,GAAAA,EAAApmC,EAAAu5D,IACAC,EAAA,GACApzB,GAAApmC,EAAA,EACAu5D,GAAAv5D,EAAA,GAEAA,KAAA,GACAomC,IAAAmxB,GAAAA,EAAAgC,GAAAhC,EAAAnxB,SACAmxB,GAAAgC,GACAA,GAAAC,EACApzB,GAAAozB,CACA,OAAAjC,MlEwvrBGkC,uBAAuB,IAAIC,eAAe,IAAIC,eAAe,MAAMC,IAAI,SAAStxG,EAAQU,EAAOJ,GmE/wrBlG,YACA,IAAAuwG,GAAA7wG,EAAA,gBACA8wG,EAAA9wG,EAAA,wBACA+wG,EAAA/wG,EAAA,eACAU,GAAAJ,QAAA,SAAAsK,GAOA,IANA,GAAAqkG,GAAA4B,EAAArqG,MACAhG,EAAAuwG,EAAA9B,EAAAzuG,QACA+wG,EAAArmD,UAAA1qD,OACA+F,EAAAuqG,EAAAS,EAAA,EAAArmD,UAAA,GAAAviD,OAAAnI,GACAyM,EAAAskG,EAAA,EAAArmD,UAAA,GAAAviD,OACA6oG,EAAA7oG,SAAAsE,EAAAzM,EAAAswG,EAAA7jG,EAAAzM,GACAgxG,EAAAjrG,GAAA0oG,EAAA1oG,KAAAqE,CACA,OAAAqkG,MnEoxrBGkC,uBAAuB,IAAIC,eAAe,IAAIC,eAAe,MAAMI,IAAI,SAASzxG,EAAQU,EAAOJ,GoEjyrBlG,GAAAoxG,GAAA1xG,EAAA,YAEAU,GAAAJ,QAAA,SAAAqxG,EAAAC,GACA,GAAAvtG,KAEA,OADAqtG,GAAAC,GAAA,EAAAttG,EAAAX,KAAAW,EAAAutG,GACAvtG,KpEqyrBGwtG,YAAY,KAAKC,IAAI,SAAS9xG,EAAQU,EAAOJ,GqExyrBhD,GAAAyxG,GAAA/xG,EAAA,iBACA+wG,EAAA/wG,EAAA,gBACA8wG,EAAA9wG,EAAA,uBACAU,GAAAJ,QAAA,SAAA0xG,GACA,MAAA,UAAAC,EAAAC,EAAAC,GACA,GAGAvnG,GAHAqkG,EAAA8C,EAAAE,GACAzxG,EAAAuwG,EAAA9B,EAAAzuG,QACA+F,EAAAuqG,EAAAqB,EAAA3xG,EAIA,IAAAwxG,GAAAE,GAAAA,GAAA,KAAA1xG,EAAA+F,GAGA,GAFAqE,EAAAqkG,EAAA1oG,KAEAqE,GAAAA,EAAA,OAAA,MAEA,MAAApK,EAAA+F,EAAAA,IAAA,IAAAyrG,GAAAzrG,IAAA0oG,KACAA,EAAA1oG,KAAA2rG,EAAA,MAAAF,IAAAzrG,GAAA,CACA,QAAAyrG,GAAA,OrE+yrBGb,uBAAuB,IAAIiB,gBAAgB,IAAIhB,eAAe,MAAMiB,IAAI,SAASryG,EAAQU,EAAOJ,GsE5zrBnG,GAAA8gE,GAAAphE,EAAA,UACAsyG,EAAAtyG,EAAA,cACA6wG,EAAA7wG,EAAA,gBACA+wG,EAAA/wG,EAAA,gBACAuyG,EAAAvyG,EAAA,0BACAU,GAAAJ,QAAA,SAAAkyG,EAAAC,GACA,GAAAC,GAAA,GAAAF,EACAG,EAAA,GAAAH,EACAI,EAAA,GAAAJ,EACAK,EAAA,GAAAL,EACAM,EAAA,GAAAN,EACAO,EAAA,GAAAP,GAAAM,EACAh4C,EAAA23C,GAAAF,CACA,OAAA,UAAAN,EAAAe,EAAAC,GAQA,IAPA,GAMA5F,GAAAzuF,EANAqwF,EAAA4B,EAAAoB,GACA56E,EAAAi7E,EAAArD,GACA/uG,EAAAkhE,EAAA4xC,EAAAC,EAAA,GACAzyG,EAAAuwG,EAAA15E,EAAA72B,QACA+F,EAAA,EACAlC,EAAAquG,EAAA53C,EAAAm3C,EAAAzxG,GAAAmyG,EAAA73C,EAAAm3C,EAAA,GAAAtpG,OAEAnI,EAAA+F,EAAAA,IAAA,IAAAwsG,GAAAxsG,IAAA8wB,MACAg2E,EAAAh2E,EAAA9wB,GACAqY,EAAA1e,EAAAmtG,EAAA9mG,EAAA0oG,GACAuD,GACA,GAAAE,EAAAruG,EAAAkC,GAAAqY,MACA,IAAAA,EAAA,OAAA4zF,GACA,IAAA,GAAA,OAAA,CACA,KAAA,GAAA,MAAAnF,EACA,KAAA,GAAA,MAAA9mG,EACA,KAAA,GAAAlC,EAAAX,KAAA2pG,OACA,IAAAwF,EAAA,OAAA,CAGA,OAAAC,GAAA,GAAAF,GAAAC,EAAAA,EAAAxuG,MtEw0rBG6uG,0BAA0B,GAAGC,SAAS,GAAGC,aAAa,IAAIhC,eAAe,IAAIC,eAAe,MAAMgC,IAAI,SAASrzG,EAAQU,EAAOJ,GuEj3rBjI,GAAAgzG,GAAAtzG,EAAA,iBACA6wG,EAAA7wG,EAAA,gBACAsyG,EAAAtyG,EAAA,cACA+wG,EAAA/wG,EAAA,eAEAU,GAAAJ,QAAA,SAAA2yG,EAAAD,EAAAzB,EAAAgC,EAAAC,GACAF,EAAAN,EACA,IAAA/D,GAAA4B,EAAAoC,GACA57E,EAAAi7E,EAAArD,GACAzuG,EAAAuwG,EAAA9B,EAAAzuG,QACA+F,EAAAitG,EAAAhzG,EAAA,EAAA,EACAP,EAAAuzG,EAAA,GAAA,CACA,IAAA,EAAAjC,EAAA,OAAA,CACA,GAAAhrG,IAAA8wB,GAAA,CACAk8E,EAAAl8E,EAAA9wB,GACAA,GAAAtG,CACA,OAGA,GADAsG,GAAAtG,EACAuzG,EAAA,EAAAjtG,EAAAA,GAAA/F,EACA,KAAAk2D,WAAA,+CAGA,KAAA88C,EAAAjtG,GAAA,EAAA/F,EAAA+F,EAAAA,GAAAtG,EAAAsG,IAAA8wB,KACAk8E,EAAAP,EAAAO,EAAAl8E,EAAA9wB,GAAAA,EAAA0oG,GAEA,OAAAsE,MvEq3rBGE,gBAAgB,GAAGL,aAAa,IAAIhC,eAAe,IAAIC,eAAe,MAAMqC,IAAI,SAAS1zG,EAAQU,EAAOJ,GwE/4rB3G,GAAAowG,GAAA1wG,EAAA,gBACAy2D,EAAAz2D,EAAA,eACA2zG,EAAA3zG,EAAA,UAAA,UAEAU,GAAAJ,QAAA,SAAAszG,GACA,GAAAthF,EASA,OARAmkC,GAAAm9C,KACAthF,EAAAshF,EAAA11F,YAEA,kBAAAoU,IAAAA,IAAA2pB,QAAAwa,EAAAnkC,EAAAnsB,aAAAmsB,EAAA3pB,QACA+nG,EAAAp+E,KACAA,EAAAA,EAAAqhF,GACA,OAAArhF,IAAAA,EAAA3pB,UAEAA,SAAA2pB,EAAA2pB,MAAA3pB,KxEm5rBGuhF,cAAc,IAAIlD,eAAe,IAAIL,SAAS,MAAMwD,IAAI,SAAS9zG,EAAQU,EAAOJ,GyEh6rBnF,GAAAyzG,GAAA/zG,EAAA,+BAEAU,GAAAJ,QAAA,SAAAszG,EAAApzG,GACA,MAAA,KAAAuzG,EAAAH,IAAApzG,MzEq6rBGwzG,+BAA+B,KAAKC,IAAI,SAASj0G,EAAQU,EAAOJ,G0Ez6rBnE,YACA,IAAAgzG,GAAAtzG,EAAA,iBACA0wG,EAAA1wG,EAAA,gBACAk0G,EAAAl0G,EAAA,aACAm0G,KAAAlyG,MACAmyG,KAEAC,EAAA,SAAAC,EAAA9rE,EAAA+rE,GACA,KAAA/rE,IAAA4rE,IAAA,CACA,IAAA,GAAA10G,MAAAO,EAAA,EAAAuoC,EAAAvoC,EAAAA,IAAAP,EAAAO,GAAA,KAAAA,EAAA,GAEAm0G,GAAA5rE,GAAA8mE,SAAA,MAAA,gBAAA5vG,EAAAs/C,KAAA,KAAA,KACA,MAAAo1D,GAAA5rE,GAAA8rE,EAAAC,GAGA7zG,GAAAJ,QAAAgvG,SAAAxmG,MAAA,SAAAmqG,GACA,GAAAuB,GAAAlB,EAAA9sG,MACAiuG,EAAAN,EAAA5zG,KAAA2qD,UAAA,GACAwpD,EAAA,WACA,GAAAH,GAAAE,EAAAnrD,OAAA6qD,EAAA5zG,KAAA2qD,WACA,OAAA1kD,gBAAAkuG,GAAAL,EAAAG,EAAAD,EAAA/zG,OAAA+zG,GAAAL,EAAAM,EAAAD,EAAAtB,GAGA,OADAvC,GAAA8D,EAAAruG,aAAAuuG,EAAAvuG,UAAAquG,EAAAruG,WACAuuG,K1E66rBGjB,gBAAgB,GAAGkB,YAAY,IAAIhE,eAAe,MAAMiE,IAAI,SAAS50G,EAAQU,EAAOJ,G2En8rBvF,GAAA0vG,GAAAhwG,EAAA,UACAgrG,EAAAhrG,EAAA,UAAA,eAEA60G,EAAA,aAAA7E,EAAA,WAAA,MAAA9kD,eAGA4pD,EAAA,SAAAx3E,EAAA1oB,GACA,IACA,MAAA0oB,GAAA1oB,GACA,MAAApV,KAGAkB,GAAAJ,QAAA,SAAAg9B,GACA,GAAA2xE,GAAAz8E,EAAAuiF,CACA,OAAApsG,UAAA20B,EAAA,YAAA,OAAAA,EAAA,OAEA,iBAAA9K,EAAAsiF,EAAA7F,EAAA/rD,OAAA5lB,GAAA0tE,IAAAx4E,EAEAqiF,EAAA7E,EAAAf,GAEA,WAAA8F,EAAA/E,EAAAf,KAAA,kBAAAA,GAAA+F,OAAA,YAAAD,K3Ew8rBG9E,SAAS,GAAGK,SAAS,MAAM2E,IAAI,SAASj1G,EAAQU,EAAOJ,G4E79rB1D,GAAAuC,MAAAA,QAEAnC,GAAAJ,QAAA,SAAAg9B,GACA,MAAAz6B,GAAAtC,KAAA+8B,GAAAr7B,MAAA,EAAA,U5Ei+rBMizG,IAAI,SAASl1G,EAAQU,EAAOJ,G6Ep+rBlC,YACA,IAAA60G,GAAAn1G,EAAA,gBAAAE,EACA46D,EAAA96D,EAAA,oBACAo1G,EAAAp1G,EAAA,mBACAohE,EAAAphE,EAAA,UACAq1G,EAAAr1G,EAAA,kBACA0xG,EAAA1xG,EAAA,aACAs1G,EAAAt1G,EAAA,kBACAoP,EAAApP,EAAA,gBACAu1G,EAAAv1G,EAAA,kBACAw1G,EAAAx1G,EAAA,kBACAy1G,EAAAz1G,EAAA,WAAAy1G,QACAC,EAAA11G,EAAA,0BACA0vD,EAAA8lD,EAAA,KAAA,OAEAG,EAAA,SAAA1C,EAAAr+F,GAEA,GACAghG,GADArvG,EAAAkvG,EAAA7gG,EAEA,IAAA,MAAArO,EAAA,MAAA0sG,GAAAz8C,GAAAjwD,EAEA,KAAAqvG,EAAA3C,EAAA4C,GAAAD,EAAAA,EAAAA,EAAAl2G,EACA,GAAAk2G,EAAAh+F,GAAAhD,EAAA,MAAAghG,GAIAl1G,GAAAJ,SACAw1G,eAAA,SAAAC,EAAAC,EAAAtD,EAAAuD,GACA,GAAA3jF,GAAAyjF,EAAA,SAAA9C,EAAAiD,GACAb,EAAApC,EAAA3gF,EAAA0jF,EAAA,MACA/C,EAAA19C,GAAAygD,EACA/C,EAAAz8C,GAAAsE,EAAA,MACAm4C,EAAA4C,GAAAltG,OACAsqG,EAAAkD,GAAAxtG,OACAsqG,EAAAvjD,GAAA,EACA/mD,QAAAutG,GAAAxE,EAAAwE,EAAAxD,EAAAO,EAAAgD,GAAAhD,IAsDA,OApDAmC,GAAA9iF,EAAAnsB,WAGAmnD,MAAA,WACA,IAAA,GAAA2lD,GAAAyC,EAAAlvG,KAAAwvG,GAAAp0G,EAAAqxG,EAAAz8C,GAAAo/C,EAAA3C,EAAA4C,GAAAD,EAAAA,EAAAA,EAAAl2G,EACAk2G,EAAAj2G,GAAA,EACAi2G,EAAA70G,IAAA60G,EAAA70G,EAAA60G,EAAA70G,EAAArB,EAAAiJ,cACA/G,GAAAg0G,EAAA31G,EAEAgzG,GAAA4C,GAAA5C,EAAAkD,GAAAxtG,OACAsqG,EAAAvjD,GAAA,GAIA0mD,SAAA,SAAAxhG,GACA,GAAAq+F,GAAAyC,EAAAlvG,KAAAwvG,GACAJ,EAAAD,EAAA1C,EAAAr+F,EACA,IAAAghG,EAAA,CACA,GAAA1+E,GAAA0+E,EAAAl2G,EACA22G,EAAAT,EAAA70G,QACAkyG,GAAAz8C,GAAAo/C,EAAA31G,GACA21G,EAAAj2G,GAAA,EACA02G,IAAAA,EAAA32G,EAAAw3B,GACAA,IAAAA,EAAAn2B,EAAAs1G,GACApD,EAAA4C,IAAAD,IAAA3C,EAAA4C,GAAA3+E,GACA+7E,EAAAkD,IAAAP,IAAA3C,EAAAkD,GAAAE,GACApD,EAAAvjD,KACA,QAAAkmD,GAIAxzF,QAAA,SAAA4wF,GACA0C,EAAAlvG,KAAAwvG,EAGA,KAFA,GACAJ,GADA11G,EAAAkhE,EAAA4xC,EAAA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,OAAA,GAEAitG,EAAAA,EAAAA,EAAAl2G,EAAA8G,KAAAqvG,IAGA,IAFA31G,EAAA01G,EAAAr0G,EAAAq0G,EAAAh+F,EAAApR,MAEAovG,GAAAA,EAAAj2G,GAAAi2G,EAAAA,EAAA70G,GAKAu1G,IAAA,SAAA1hG,GACA,QAAA+gG,EAAAD,EAAAlvG,KAAAwvG,GAAAphG,MAGA4gG,GAAAL,EAAA7iF,EAAAnsB,UAAA,QACA2pC,IAAA,WACA,MAAA4lE,GAAAlvG,KAAAwvG,GAAAtmD,MAGAp9B,GAEAikF,IAAA,SAAAtD,EAAAr+F,EAAAhK,GACA,GACAyrG,GAAA9vG,EADAqvG,EAAAD,EAAA1C,EAAAr+F,EAoBA,OAjBAghG,GACAA,EAAAr0G,EAAAqJ,GAGAqoG,EAAAkD,GAAAP,GACA31G,EAAAsG,EAAAkvG,EAAA7gG,GAAA,GACAgD,EAAAhD,EACArT,EAAAqJ,EACA7J,EAAAs1G,EAAApD,EAAAkD,GACAz2G,EAAAiJ,OACAhJ,GAAA,GAEAszG,EAAA4C,KAAA5C,EAAA4C,GAAAD,GACAS,IAAAA,EAAA32G,EAAAk2G,GACA3C,EAAAvjD,KAEA,MAAAnpD,IAAA0sG,EAAAz8C,GAAAjwD,GAAAqvG,IACA3C,GAEA0C,SAAAA,EACAa,UAAA,SAAAlkF,EAAA0jF,EAAAtD,GAGA4C,EAAAhjF,EAAA0jF,EAAA,SAAAS,EAAAC,GACAlwG,KAAA+uD,GAAAmgD,EAAAe,EAAAT,GACAxvG,KAAAmwG,GAAAD,EACAlwG,KAAA2vG,GAAAxtG,QACA,WAKA,IAJA,GAAAsqG,GAAAzsG,KACAkwG,EAAAzD,EAAA0D,GACAf,EAAA3C,EAAAkD,GAEAP,GAAAA,EAAAj2G,GAAAi2G,EAAAA,EAAA70G,CAEA,OAAAkyG,GAAA19C,KAAA09C,EAAAkD,GAAAP,EAAAA,EAAAA,EAAAl2G,EAAAuzG,EAAA19C,GAAAsgD,IAMA,QAAAa,EAAAtnG,EAAA,EAAAwmG,EAAAh+F,GACA,UAAA8+F,EAAAtnG,EAAA,EAAAwmG,EAAAr0G,GACA6N,EAAA,GAAAwmG,EAAAh+F,EAAAg+F,EAAAr0G,KANA0xG,EAAA19C,GAAA5sD,OACAyG,EAAA,KAMAsjG,EAAA,UAAA,UAAAA,GAAA,GAGA6C,EAAAS,O7Ey+rBGY,iBAAiB,GAAGzD,SAAS,GAAG0D,iBAAiB,GAAGhF,YAAY,GAAGiF,iBAAiB,IAAIC,eAAe,IAAIC,UAAU,IAAIC,mBAAmB,IAAIC,eAAe,IAAIC,kBAAkB,IAAIC,iBAAiB,IAAIC,yBAAyB,MAAMC,IAAI,SAASt3G,EAAQU,EAAOJ,G8ErnsB5Q,GAAAi3G,GAAAv3G,EAAA,cACA89E,EAAA99E,EAAA,yBACAU,GAAAJ,QAAA,SAAA01G,GACA,MAAA,YACA,GAAAuB,EAAA/wG,OAAAwvG,EAAA,KAAAt/C,WAAAs/C,EAAA,wBACA,OAAAl4B,GAAAt3E,U9E2nsBGgxG,yBAAyB,GAAGC,aAAa,KAAKC,IAAI,SAAS13G,EAAQU,EAAOJ,G+EjosB7E,YACA,IAAA80G,GAAAp1G,EAAA,mBACA23G,EAAA33G,EAAA,WAAA23G,QACAC,EAAA53G,EAAA,gBACA0wG,EAAA1wG,EAAA,gBACAq1G,EAAAr1G,EAAA,kBACA0xG,EAAA1xG,EAAA,aACA63G,EAAA73G,EAAA,oBACA83G,EAAA93G,EAAA,UACA01G,EAAA11G,EAAA,0BACA+3G,EAAAF,EAAA,GACAG,EAAAH,EAAA,GACA5pG,EAAA,EAGAgqG,EAAA,SAAAhF,GACA,MAAAA,GAAAkD,KAAAlD,EAAAkD,GAAA,GAAA+B,KAEAA,EAAA,WACA1xG,KAAAzG,MAEAo4G,EAAA,SAAAnlC,EAAAp+D,GACA,MAAAmjG,GAAA/kC,EAAAjzE,EAAA,SAAAu9B,GACA,MAAAA,GAAA,KAAA1oB,IAGAsjG,GAAA/xG,WACA2pC,IAAA,SAAAl7B,GACA,GAAAghG,GAAAuC,EAAA3xG,KAAAoO,EACA,OAAAghG,GAAAA,EAAA,GAAA,QAEAU,IAAA,SAAA1hG,GACA,QAAAujG,EAAA3xG,KAAAoO,IAEA+e,IAAA,SAAA/e,EAAAhK,GACA,GAAAgrG,GAAAuC,EAAA3xG,KAAAoO,EACAghG,GAAAA,EAAA,GAAAhrG,EACApE,KAAAzG,EAAA2D,MAAAkR,EAAAhK,KAEAwrG,SAAA,SAAAxhG,GACA,GAAArO,GAAAyxG,EAAAxxG,KAAAzG,EAAA,SAAAu9B,GACA,MAAAA,GAAA,KAAA1oB,GAGA,QADArO,GAAAC,KAAAzG,EAAA+X,OAAAvR,EAAA,MACAA,IAIA7F,EAAAJ,SACAw1G,eAAA,SAAAC,EAAAC,EAAAtD,EAAAuD,GACA,GAAA3jF,GAAAyjF,EAAA,SAAA9C,EAAAiD,GACAb,EAAApC,EAAA3gF,EAAA0jF,EAAA,MACA/C,EAAA19C,GAAAygD,EACA/C,EAAAz8C,GAAAvoD,IACAglG,EAAAkD,GAAAxtG,OACAA,QAAAutG,GAAAxE,EAAAwE,EAAAxD,EAAAO,EAAAgD,GAAAhD,IAoBA,OAlBAmC,GAAA9iF,EAAAnsB,WAGAiwG,SAAA,SAAAxhG,GACA,IAAA87F,EAAA97F,GAAA,OAAA,CACA,IAAAhT,GAAA+1G,EAAA/iG,EACA,OAAAhT,MAAA,EAAAq2G,EAAAvC,EAAAlvG,KAAAwvG,IAAA,UAAAphG,GACAhT,GAAAk2G,EAAAl2G,EAAA4E,KAAAgwD,WAAA50D,GAAA4E,KAAAgwD,KAIA8/C,IAAA,SAAA1hG,GACA,IAAA87F,EAAA97F,GAAA,OAAA,CACA,IAAAhT,GAAA+1G,EAAA/iG,EACA,OAAAhT,MAAA,EAAAq2G,EAAAvC,EAAAlvG,KAAAwvG,IAAAM,IAAA1hG,GACAhT,GAAAk2G,EAAAl2G,EAAA4E,KAAAgwD,OAGAlkC,GAEAikF,IAAA,SAAAtD,EAAAr+F,EAAAhK,GACA,GAAAhJ,GAAA+1G,EAAAC,EAAAhjG,IAAA,EAGA,OAFAhT,MAAA,EAAAq2G,EAAAhF,GAAAt/E,IAAA/e,EAAAhK,GACAhJ,EAAAqxG,EAAAz8C,IAAA5rD,EACAqoG,GAEAmF,QAAAH,K/EqosBGrB,iBAAiB,GAAGyB,eAAe,GAAGC,mBAAmB,GAAGzG,YAAY,GAAG0G,SAAS,IAAI5H,eAAe,IAAIqG,UAAU,IAAIG,kBAAkB,IAAIE,yBAAyB,MAAMmB,IAAI,SAASx4G,EAAQU,EAAOJ,GgFxtsB7M,YACA,IAAAyuG,GAAA/uG,EAAA,aACAy4G,EAAAz4G,EAAA,aACA04G,EAAA14G,EAAA,eACAo1G,EAAAp1G,EAAA,mBACAqnF,EAAArnF,EAAA,WACA0xG,EAAA1xG,EAAA,aACAq1G,EAAAr1G,EAAA,kBACA0wG,EAAA1wG,EAAA,gBACA24G,EAAA34G,EAAA,YACA44G,EAAA54G,EAAA,kBACA64G,EAAA74G,EAAA,wBACA84G,EAAA94G,EAAA,yBAEAU,GAAAJ,QAAA,SAAA01G,EAAAD,EAAAgD,EAAAC,EAAAtG,EAAAuG,GACA,GAAAC,GAAAnK,EAAAiH,GACA1jF,EAAA4mF,EACAjD,EAAAvD,EAAA,MAAA,MACAv/E,EAAAb,GAAAA,EAAAnsB,UACA8oG,KACAkK,EAAA,SAAAC,GACA,GAAA5E,GAAArhF,EAAAimF,EACAV,GAAAvlF,EAAAimF,EACA,UAAAA,EAAA,SAAAr5G,GACA,MAAAk5G,KAAAvI,EAAA3wG,IAAA,EAAAy0G,EAAAj0G,KAAAiG,KAAA,IAAAzG,EAAA,EAAAA,IACA,OAAAq5G,EAAA,SAAAr5G,GACA,MAAAk5G,KAAAvI,EAAA3wG,IAAA,EAAAy0G,EAAAj0G,KAAAiG,KAAA,IAAAzG,EAAA,EAAAA,IACA,OAAAq5G,EAAA,SAAAr5G,GACA,MAAAk5G,KAAAvI,EAAA3wG,GAAA4I,OAAA6rG,EAAAj0G,KAAAiG,KAAA,IAAAzG,EAAA,EAAAA,IACA,OAAAq5G,EAAA,SAAAr5G,GAAA,MAAAy0G,GAAAj0G,KAAAiG,KAAA,IAAAzG,EAAA,EAAAA,GAAAyG,MACA,SAAAzG,EAAAmB,GAAA,MAAAszG,GAAAj0G,KAAAiG,KAAA,IAAAzG,EAAA,EAAAA,EAAAmB,GAAAsF,OAGA,IAAA,kBAAA8rB,KAAA2mF,GAAA9lF,EAAA/Q,UAAAu2F,EAAA,YACA,GAAArmF,IAAA+mF,UAAAniF,UAMA,CACA,GAAAi3D,GAAA,GAAA77D,GAEAgnF,EAAAnrB,EAAA8nB,GAAAgD,MAAA,EAAA,IAAA9qB,EAEAorB,EAAAZ,EAAA,WAAAxqB,EAAAmoB,IAAA,KAEAkD,EAAAZ,EAAA,SAAAjH,GAAA,GAAAr/E,GAAAq/E,KAEA8H,GAAAR,GAAAN,EAAA,WAIA,IAFA,GAAAe,GAAA,GAAApnF,GACA/rB,EAAA,EACAA,KAAAmzG,EAAAzD,GAAA1vG,EAAAA,EACA,QAAAmzG,EAAApD,KAAA,IAEAkD,KACAlnF,EAAAyjF,EAAA,SAAA7sE,EAAAgtE,GACAb,EAAAnsE,EAAA5W,EAAA0jF,EACA,IAAA/C,GAAA6F,EAAA,GAAAI,GAAAhwE,EAAA5W,EAEA,OADA3pB,SAAAutG,GAAAxE,EAAAwE,EAAAxD,EAAAO,EAAAgD,GAAAhD,GACAA,IAEA3gF,EAAAnsB,UAAAgtB,EACAA,EAAAjV,YAAAoU,IAEAinF,GAAAE,KACAN,EAAA,UACAA,EAAA,OACAzG,GAAAyG,EAAA,SAEAM,GAAAH,IAAAH,EAAAlD,GAEAgD,GAAA9lF,EAAAm6B,aAAAn6B,GAAAm6B,UApCAh7B,GAAA0mF,EAAAlD,eAAAC,EAAAC,EAAAtD,EAAAuD,GACAb,EAAA9iF,EAAAnsB,UAAA4yG,GACA1xB,EAAAsyB,MAAA,CA4CA,OAPAd,GAAAvmF,EAAA0jF,GAEA/G,EAAA+G,GAAA1jF,EACAmmF,EAAAA,EAAAlmF,EAAAkmF,EAAAmB,EAAAnB,EAAAnE,GAAAhiF,GAAA4mF,GAAAjK,GAEAgK,GAAAD,EAAAxC,UAAAlkF,EAAA0jF,EAAAtD,GAEApgF,KhF4tsBGskF,iBAAiB,GAAGiD,YAAY,GAAGC,WAAW,GAAGjI,YAAY,GAAGkI,YAAY,GAAGC,yBAAyB,IAAIrJ,eAAe,IAAIsJ,iBAAiB,IAAIjD,UAAU,IAAIkD,cAAc,IAAI/C,kBAAkB,IAAIgD,uBAAuB,MAAMC,IAAI,SAASp6G,EAAQU,EAAOJ,GiF/ysBtQ,GAAA+5G,GAAA35G,EAAAJ,SAAAyR,QAAA,QACA,iBAAAuoG,OAAAA,IAAAD,QjFkzsBME,IAAI,SAASv6G,EAAQU,EAAOJ,GkFnzsBlC,YACA,IAAAk6G,GAAAx6G,EAAA,gBACAy6G,EAAAz6G,EAAA,mBAEAU,GAAAJ,QAAA,SAAAi2C,EAAAhwC,EAAAqE,GACArE,IAAAgwC,GAAAikE,EAAAt6G,EAAAq2C,EAAAhwC,EAAAk0G,EAAA,EAAA7vG,IACA2rC,EAAAhwC,GAAAqE,KlFuzsBGssG,eAAe,IAAIwD,mBAAmB,MAAMC,IAAI,SAAS36G,EAAQU,EAAOJ,GmF5zsB3E,GAAAgzG,GAAAtzG,EAAA,gBACAU,GAAAJ,QAAA,SAAAk0G,EAAAvB,EAAAzyG,GAEA,GADA8yG,EAAAkB,GACA7rG,SAAAsqG,EAAA,MAAAuB,EACA,QAAAh0G,GACA,IAAA,GAAA,MAAA,UAAAT,GACA,MAAAy0G,GAAAj0G,KAAA0yG,EAAAlzG,GAEA,KAAA,GAAA,MAAA,UAAAA,EAAAmB,GACA,MAAAszG,GAAAj0G,KAAA0yG,EAAAlzG,EAAAmB,GAEA,KAAA,GAAA,MAAA,UAAAnB,EAAAmB,EAAA2F,GACA,MAAA2tG,GAAAj0G,KAAA0yG,EAAAlzG,EAAAmB,EAAA2F,IAGA,MAAA,YACA,MAAA2tG,GAAAh7B,MAAAy5B,EAAA/nD,enFk0sBGuoD,gBAAgB,KAAKmH,IAAI,SAAS56G,EAAQU,EAAOJ,GoFn1sBpD,YAEA,IAAAq4G,GAAA34G,EAAA,YACA66G,EAAAplG,KAAAtP,UAAA00G,QACAC,EAAArlG,KAAAtP,UAAA40G,YAEAC,EAAA,SAAAj4B,GACA,MAAAA,GAAA,EAAAA,EAAA,IAAAA,EAIAriF,GAAAJ,QAAAq4G,EAAA,WACA,MAAA,4BAAAmC,EAAAv6G,KAAA,GAAAkV,MAAA,MAAA,QACAkjG,EAAA,WACAmC,EAAAv6G,KAAA,GAAAkV,MAAAwlG,QACA,WACA,IAAAC,SAAAL,EAAAt6G,KAAAiG,OAAA,KAAA20G,YAAA,qBACA,IAAAz/F,GAAAlV,KACAyxC,EAAAv8B,EAAA0/F,iBACA9rG,EAAAoM,EAAA2/F,qBACAz7G,EAAA,EAAAq4C,EAAA,IAAAA,EAAA,KAAA,IAAA,EACA,OAAAr4C,IAAA,QAAAsE,KAAAq8B,IAAA0X,IAAAh2C,MAAArC,EAAA,GAAA,IACA,IAAAo7G,EAAAt/F,EAAA4/F,cAAA,GAAA,IAAAN,EAAAt/F,EAAA6/F,cACA,IAAAP,EAAAt/F,EAAA8/F,eAAA,IAAAR,EAAAt/F,EAAA+/F,iBACA,IAAAT,EAAAt/F,EAAAggG,iBAAA,KAAApsG,EAAA,GAAAA,EAAA,IAAA0rG,EAAA1rG,IAAA,KACAwrG,IpFs1sBGhB,WAAW,KAAK6B,IAAI,SAAS37G,EAAQU,EAAOJ,GqF/2sB/C,YACA,IAAAs3G,GAAA53G,EAAA,gBACA47G,EAAA57G,EAAA,mBACA67G,EAAA,QAEAn7G,GAAAJ,QAAA,SAAAw7G,GACA,GAAA,WAAAA,GAAAA,IAAAD,GAAA,YAAAC,EAAA,KAAAplD,WAAA,iBACA,OAAAklD,GAAAhE,EAAApxG,MAAAs1G,GAAAD,MrFm3sBGxD,eAAe,GAAG0D,kBAAkB,MAAMC,IAAI,SAASh8G,EAAQU,EAAOJ,GsFz3sBzEI,EAAAJ,QAAA,SAAAg9B,GACA,GAAA30B,QAAA20B,EAAA,KAAAo5B,WAAA,yBAAAp5B,EACA,OAAAA,StF83sBM2+E,IAAI,SAASj8G,EAAQU,EAAOJ,GuFh4sBlCI,EAAAJ,SAAAN,EAAA,YAAA,WACA,MAAA,IAAAkjD,OAAA8S,kBAAA,KAAAlmB,IAAA,WAAA,MAAA,MAAA/vC,MvFq4sBG+5G,WAAW,KAAKoC,IAAI,SAASl8G,EAAQU,EAAOJ,GwFv4sB/C,GAAAowG,GAAA1wG,EAAA,gBACAsiB,EAAAtiB,EAAA,aAAAsiB,SAEAwkE,EAAA4pB,EAAApuF,IAAAouF,EAAApuF,EAAAwpD,cACAprE,GAAAJ,QAAA,SAAAg9B,GACA,MAAAwpD,GAAAxkE,EAAAwpD,cAAAxuC,SxF24sBGy8E,YAAY,GAAGpJ,eAAe,MAAMwL,IAAI,SAASn8G,EAAQU,EAAOJ,GyF/4sBnEI,EAAAJ,QAAA,gGAEAwM,MAAA,UzFm5sBMsvG,IAAI,SAASp8G,EAAQU,EAAOJ,G0Fr5sBlC,GAAA+7G,GAAAr8G,EAAA,kBACAs8G,EAAAt8G,EAAA,kBACAu8G,EAAAv8G,EAAA,gBACAU,GAAAJ,QAAA,SAAAg9B,GACA,GAAAj5B,GAAAg4G,EAAA/+E,GACAk/E,EAAAF,EAAAp8G,CACA,IAAAs8G,EAKA,IAJA,GAGA5nG,GAHA6nG,EAAAD,EAAAl/E,GACAo/E,EAAAH,EAAAr8G,EACAD,EAAA,EAEAw8G,EAAAj8G,OAAAP,GAAAy8G,EAAAn8G,KAAA+8B,EAAA1oB,EAAA6nG,EAAAx8G,OAAAoE,EAAAX,KAAAkR,EACA,OAAAvQ,M1F05sBGs4G,iBAAiB,IAAIC,iBAAiB,IAAIC,gBAAgB,MAAMC,IAAI,SAAS98G,EAAQU,EAAOJ,G2Fv6sB/F,GAAAyuG,GAAA/uG,EAAA,aACAq6G,EAAAr6G,EAAA,WACA+8G,EAAA/8G,EAAA,WACA04G,EAAA14G,EAAA,eACAohE,EAAAphE,EAAA,UACAg9G,EAAA,YAEAvE,EAAA,SAAA3tG,EAAAxH,EAAA66B,GACA,GAQAvpB,GAAAqoG,EAAA9qC,EAAAxrD,EARAu2F,EAAApyG,EAAA2tG,EAAAnE,EACA6I,EAAAryG,EAAA2tG,EAAAlmF,EACA6qF,EAAAtyG,EAAA2tG,EAAA4E,EACAC,EAAAxyG,EAAA2tG,EAAA8E,EACAC,EAAA1yG,EAAA2tG,EAAA1D,EACA7rE,EAAAi0E,EAAApO,EAAAqO,EAAArO,EAAAzrG,KAAAyrG,EAAAzrG,QAAAyrG,EAAAzrG,QAAA05G,GACA18G,EAAA68G,EAAA9C,EAAAA,EAAA/2G,KAAA+2G,EAAA/2G,OACAm6G,EAAAn9G,EAAA08G,KAAA18G,EAAA08G,MAEAG,KAAAh/E,EAAA76B,EACA,KAAAsR,IAAAupB,GAEA8+E,GAAAC,GAAAh0E,GAAAvgC,SAAAugC,EAAAt0B,GAEAu9D,GAAA8qC,EAAA/zE,EAAA/K,GAAAvpB,GAEA+R,EAAA62F,GAAAP,EAAA77C,EAAA+Q,EAAA48B,GAAAuO,GAAA,kBAAAnrC,GAAA/Q,EAAAkuC,SAAA/uG,KAAA4xE,GAAAA,EAEAjpC,GAAAwvE,EAAAxvE,EAAAt0B,EAAAu9D,EAAArnE,EAAA2tG,EAAAiF,GAEAp9G,EAAAsU,IAAAu9D,GAAA4qC,EAAAz8G,EAAAsU,EAAA+R,GACA22F,GAAAG,EAAA7oG,IAAAu9D,IAAAsrC,EAAA7oG,GAAAu9D,GAGA48B,GAAAsL,KAAAA,EAEA5B,EAAAnE,EAAA,EACAmE,EAAAlmF,EAAA,EACAkmF,EAAA4E,EAAA,EACA5E,EAAA8E,EAAA,EACA9E,EAAA1D,EAAA,GACA0D,EAAAmB,EAAA,GACAnB,EAAAiF,EAAA,GACAjF,EAAA70D,EAAA,IACAljD,EAAAJ,QAAAm4G,I3F06sBGkF,UAAU,GAAGxK,SAAS,GAAG4G,YAAY,GAAG1J,UAAU,IAAI6J,cAAc,MAAM0D,IAAI,SAAS59G,EAAQU,EAAOJ,G4Fp9sBzG,GAAAu9G,GAAA79G,EAAA,UAAA,QACAU,GAAAJ,QAAA,SAAA84G,GACA,GAAA0E,GAAA,GACA,KACA,MAAA1E,GAAA0E,GACA,MAAAt+G,GACA,IAEA,MADAs+G,GAAAD,IAAA,GACA,MAAAzE,GAAA0E,GACA,MAAA59G,KACA,OAAA,K5Fw9sBGowG,SAAS,MAAMyN,IAAI,SAAS/9G,EAAQU,EAAOJ,G6Fl+sB9CI,EAAAJ,QAAA,SAAAiP,GACA,IACA,QAAAA,IACA,MAAA/P,GACA,OAAA,S7Fu+sBMw+G,IAAI,SAASh+G,EAAQU,EAAOJ,G8F3+sBlC,YACA,IAAAy8G,GAAA/8G,EAAA,WACA04G,EAAA14G,EAAA,eACA24G,EAAA34G,EAAA,YACAi+G,EAAAj+G,EAAA,cACAk+G,EAAAl+G,EAAA,SAEAU,GAAAJ,QAAA,SAAA84G,EAAA54G,EAAA+O,GACA,GAAA4uG,GAAAD,EAAA9E,GACAgF,EAAA7uG,EAAA0uG,EAAAE,EAAA,GAAA/E,IACAiF,EAAAD,EAAA,GACAE,EAAAF,EAAA,EACAzF,GAAA,WACA,GAAA1J,KAEA,OADAA,GAAAkP,GAAA,WAAA,MAAA,IACA,GAAA,GAAA/E,GAAAnK,OAEAyJ,EAAA31G,OAAAoD,UAAAizG,EAAAiF,GACAtB,EAAAv4G,OAAA2B,UAAAg4G,EAAA,GAAA39G,EAGA,SAAA2mD,EAAAm/B,GAAA,MAAAg4B,GAAA/9G,KAAA4mD,EAAA3gD,KAAA8/E,IAGA,SAAAn/B,GAAA,MAAAm3D,GAAA/9G,KAAA4mD,EAAA3gD,Y9Fi/sBG+3G,aAAa,GAAGzE,WAAW,GAAGzJ,UAAU,IAAI6J,cAAc,IAAI5J,SAAS,MAAMkO,IAAI,SAASx+G,EAAQU,EAAOJ,G+FzgtB5G,YAEA,IAAAs3G,GAAA53G,EAAA,eACAU,GAAAJ,QAAA,WACA,GAAA2yG,GAAA2E,EAAApxG,MACAnC,EAAA,EAMA,OALA4uG,GAAAlE,SAAA1qG,GAAA,KACA4uG,EAAAwL,aAAAp6G,GAAA,KACA4uG,EAAAyL,YAAAr6G,GAAA,KACA4uG,EAAA0L,UAAAt6G,GAAA,KACA4uG,EAAA2L,SAAAv6G,GAAA,KACAA,K/F6gtBGg0G,eAAe,KAAKwG,IAAI,SAAS7+G,EAAQU,EAAOJ,GgGxhtBnD,YAQA,SAAAw+G,GAAA51E,EAAA0qE,EAAAz1E,EAAA4gF,EAAAhyG,EAAAiyG,EAAAC,EAAAC,GAMA,IALA,GAGA15E,GAAA25E,EAHAC,EAAAryG,EACAsyG,EAAA,EACAC,EAAAL,EAAA79C,EAAA69C,EAAAC,EAAA,IAAA,EAGAH,EAAAM,GAAA,CACA,GAAAA,IAAAlhF,GAAA,CASA,GARAqH,EAAA85E,EAAAA,EAAAnhF,EAAAkhF,GAAAA,EAAAzL,GAAAz1E,EAAAkhF,GAEAF,GAAA,EACAzO,EAAAlrE,KACA25E,EAAA35E,EAAA+5E,GACAJ,EAAAx2G,SAAAw2G,IAAAA,EAAA1oD,EAAAjxB,IAGA25E,GAAAH,EAAA,EACAI,EAAAN,EAAA51E,EAAA0qE,EAAApuE,EAAAurE,EAAAvrE,EAAAhlC,QAAA4+G,EAAAJ,EAAA,GAAA,MACA,CACA,GAAAI,GAAA,iBAAA,KAAA1oD,YACAxtB,GAAAk2E,GAAA55E,EAGA45E,IAEAC,IAEA,MAAAD,GAjCA,GAAA3oD,GAAAz2D,EAAA,eACA0wG,EAAA1wG,EAAA,gBACA+wG,EAAA/wG,EAAA,gBACAohE,EAAAphE,EAAA,UACAu/G,EAAAv/G,EAAA,UAAA,qBAgCAU,GAAAJ,QAAAw+G,IhG2htBG3L,SAAS,GAAGU,cAAc,IAAIlD,eAAe,IAAIS,eAAe,IAAId,SAAS,MAAMkP,IAAI,SAASx/G,EAAQU,EAAOJ,GiGjktBlH,GAAA8gE,GAAAphE,EAAA,UACAO,EAAAP,EAAA,gBACAy/G,EAAAz/G,EAAA,oBACA43G,EAAA53G,EAAA,gBACA+wG,EAAA/wG,EAAA,gBACA0/G,EAAA1/G,EAAA,8BACA2/G,KACAC,KACAt/G,EAAAI,EAAAJ,QAAA,SAAA41G,EAAAmD,EAAA7E,EAAAvB,EAAArB,GACA,GAGApxG,GAAA4O,EAAA4O,EAAA3Z,EAHAw7G,EAAAjO,EAAA,WAAA,MAAAsE,IAAAwJ,EAAAxJ,GACAh2G,EAAAkhE,EAAAozC,EAAAvB,EAAAoG,EAAA,EAAA,GACA9yG,EAAA,CAEA,IAAA,kBAAAs5G,GAAA,KAAAnpD,WAAAw/C,EAAA,oBAEA,IAAAuJ,EAAAI,IAAA,IAAAr/G,EAAAuwG,EAAAmF,EAAA11G,QAAAA,EAAA+F,EAAAA,IAEA,GADAlC,EAAAg1G,EAAAn5G,EAAA03G,EAAAxoG,EAAA8mG,EAAA3vG,IAAA,GAAA6I,EAAA,IAAAlP,EAAAg2G,EAAA3vG,IACAlC,IAAAs7G,GAAAt7G,IAAAu7G,EAAA,MAAAv7G,OACA,KAAA2Z,EAAA6hG,EAAAt/G,KAAA21G,KAAA9mG,EAAA4O,EAAAkZ,QAAAC,MAEA,GADA9yB,EAAA9D,EAAAyd,EAAA9d,EAAAkP,EAAAxE,MAAAyuG,GACAh1G,IAAAs7G,GAAAt7G,IAAAu7G,EAAA,MAAAv7G,GAGA/D,GAAAq/G,MAAAA,EACAr/G,EAAAs/G,OAAAA,IjGoktBGvH,eAAe,GAAGlF,SAAS,GAAG2M,mBAAmB,IAAIC,eAAe,IAAI3O,eAAe,IAAI4O,6BAA6B,MAAMC,IAAI,SAASjgH,EAAQU,EAAOJ,GkG3ltB7J,GAAAyuG,GAAAruG,EAAAJ,QAAA,mBAAA0yB,SAAAA,OAAA9uB,MAAAA,KACA8uB,OAAA,mBAAAqE,OAAAA,KAAAnzB,MAAAA,KAAAmzB,KAEAi4E,SAAA,gBACA,iBAAA4Q,OAAAA,IAAAnR,QlG+ltBMoR,KAAK,SAASngH,EAAQU,EAAOJ,GmGpmtBnC,GAAA6iD,MAAAA,cACAziD,GAAAJ,QAAA,SAAAg9B,EAAA1oB,GACA,MAAAuuC,GAAA5iD,KAAA+8B,EAAA1oB,SnGwmtBMwrG,KAAK,SAASpgH,EAAQU,EAAOJ,GoG1mtBnC,GAAA60G,GAAAn1G,EAAA,gBACAy6G,EAAAz6G,EAAA,mBACAU,GAAAJ,QAAAN,EAAA,kBAAA,SAAAu2C,EAAA3hC,EAAAhK,GACA,MAAAuqG,GAAAj1G,EAAAq2C,EAAA3hC,EAAA6lG,EAAA,EAAA7vG,KACA,SAAA2rC,EAAA3hC,EAAAhK,GAEA,MADA2rC,GAAA3hC,GAAAhK,EACA2rC,KpG8mtBGsgE,iBAAiB,GAAGK,eAAe,IAAIwD,mBAAmB,MAAM2F,KAAK,SAASrgH,EAAQU,EAAOJ,GqGpntBhG,GAAAgiB,GAAAtiB,EAAA,aAAAsiB,QACA5hB,GAAAJ,QAAAgiB,GAAAA,EAAAq2C,kBrGuntBGohD,YAAY,KAAKuG,KAAK,SAAStgH,EAAQU,EAAOJ,GsGxntBjDI,EAAAJ,SAAAN,EAAA,oBAAAA,EAAA,YAAA,WACA,MAAA,IAAAkjD,OAAA8S,eAAAh2D,EAAA,iBAAA,OAAA,KAAA8vC,IAAA,WAAA,MAAA,MAAA/vC,MtG4ntBG82G,iBAAiB,GAAG0J,gBAAgB,GAAGzG,WAAW,KAAK0G,KAAK,SAASxgH,EAAQU,EAAOJ,GuG7ntBvF,GAAAowG,GAAA1wG,EAAA,gBACA6uF,EAAA7uF,EAAA,gBAAA2zB,GACAjzB,GAAAJ,QAAA,SAAA2yG,EAAA/pE,EAAA5W,GACA,GACAirF,GADAF,EAAAn0E,EAAAhrB,WAIA,OAFAm/F,KAAA/qF,GAAA,kBAAA+qF,KAAAE,EAAAF,EAAAl3G,aAAAmsB,EAAAnsB,WAAAuqG,EAAA6M,IAAA1uB,GACAA,EAAAokB,EAAAsK,GACAtK,KvGiotBGtC,eAAe,IAAI8P,eAAe,MAAMC,KAAK,SAAS1gH,EAAQU,EAAOJ,GwGvotBxEI,EAAAJ,QAAA,SAAAk0G,EAAAD,EAAAtB,GACA,GAAA0N,GAAAh4G,SAAAsqG,CACA,QAAAsB,EAAA/zG,QACA,IAAA,GAAA,MAAAmgH,GAAAnM,IACAA,EAAAj0G,KAAA0yG,EACA,KAAA,GAAA,MAAA0N,GAAAnM,EAAAD,EAAA,IACAC,EAAAj0G,KAAA0yG,EAAAsB,EAAA,GACA,KAAA,GAAA,MAAAoM,GAAAnM,EAAAD,EAAA,GAAAA,EAAA,IACAC,EAAAj0G,KAAA0yG,EAAAsB,EAAA,GAAAA,EAAA,GACA,KAAA,GAAA,MAAAoM,GAAAnM,EAAAD,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACAC,EAAAj0G,KAAA0yG,EAAAsB,EAAA,GAAAA,EAAA,GAAAA,EAAA,GACA,KAAA,GAAA,MAAAoM,GAAAnM,EAAAD,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACAC,EAAAj0G,KAAA0yG,EAAAsB,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,MAAAC,GAAAh7B,MAAAy5B,EAAAsB,SxG4otBMqM,KAAK,SAAS5gH,EAAQU,EAAOJ,GyGzptBnC,GAAA0vG,GAAAhwG,EAAA,SAEAU,GAAAJ,QAAA4iD,OAAA,KAAA29D,qBAAA,GAAA39D,OAAA,SAAA5lB,GACA,MAAA,UAAA0yE,EAAA1yE,GAAAA,EAAAxwB,MAAA,IAAAo2C,OAAA5lB,MzG8ptBG2yE,SAAS,KAAK6Q,KAAK,SAAS9gH,EAAQU,EAAOJ,G0GjqtB9C,GAAAygH,GAAA/gH,EAAA,gBACA4xG,EAAA5xG,EAAA,UAAA,YACAowG,EAAAn0D,MAAA91C,SAEAzF,GAAAJ,QAAA,SAAAg9B,GACA,MAAA30B,UAAA20B,IAAAyjF,EAAA9kE,QAAA3e,GAAA8yE,EAAAwB,KAAAt0E,M1GsqtBG0jF,eAAe,IAAI1Q,SAAS,MAAM2Q,KAAK,SAASjhH,EAAQU,EAAOJ,G2G3qtBlE,GAAA0vG,GAAAhwG,EAAA,SACAU,GAAAJ,QAAA27C,MAAAwa,SAAA,SAAA6vB,GACA,MAAA,SAAA0pB,EAAA1pB,M3GgrtBG2pB,SAAS,KAAKiR,KAAK,SAASlhH,EAAQU,EAAOJ,G4GlrtB9C,GAAAowG,GAAA1wG,EAAA,gBACA+qF,EAAA7mF,KAAA6mF,KACArqF,GAAAJ,QAAA,SAAAg9B,GACA,OAAAozE,EAAApzE,IAAA49E,SAAA59E,IAAAytD,EAAAztD,KAAAA,K5GurtBGqzE,eAAe,MAAMwQ,KAAK,SAASnhH,EAAQU,EAAOJ,G6G3rtBrDI,EAAAJ,QAAA,SAAAg9B,GACA,MAAA,gBAAAA,GAAA,OAAAA,EAAA,kBAAAA,S7G+rtBM8jF,KAAK,SAASphH,EAAQU,EAAOJ,G8G/rtBnC,GAAAowG,GAAA1wG,EAAA,gBACAgwG,EAAAhwG,EAAA,UACA69G,EAAA79G,EAAA,UAAA,QACAU,GAAAJ,QAAA,SAAAg9B,GACA,GAAA+jF,EACA,OAAA3Q,GAAApzE,KAAA30B,UAAA04G,EAAA/jF,EAAAugF,MAAAwD,EAAA,UAAArR,EAAA1yE,O9GostBG2yE,SAAS,GAAGU,eAAe,IAAIL,SAAS,MAAMgR,KAAK,SAASthH,EAAQU,EAAOJ,G+GzstB9E,GAAAs3G,GAAA53G,EAAA,eACAU,GAAAJ,QAAA,SAAA0d,EAAAw2F,EAAA5pG,EAAAyuG,GACA,IACA,MAAAA,GAAA7E,EAAAoD,EAAAhtG,GAAA,GAAAA,EAAA,IAAA4pG,EAAA5pG,GAEA,MAAApL,GACA,GAAA+hH,GAAAvjG,EAAA,SAEA,MADArV,UAAA44G,GAAA3J,EAAA2J,EAAAhhH,KAAAyd,IACAxe,M/G+stBG64G,eAAe,KAAKmJ,KAAK,SAASxhH,EAAQU,EAAOJ,GgHxttBpD,YACA,IAAAw6D,GAAA96D,EAAA,oBACAivF,EAAAjvF,EAAA,oBACA64G,EAAA74G,EAAA,wBACAyhH,IAGAzhH,GAAA,WAAAyhH,EAAAzhH,EAAA,UAAA,YAAA,WAAA,MAAAwG,QAEA9F,EAAAJ,QAAA,SAAA8tF,EAAA4nB,EAAA9+E,GACAk3D,EAAAjoF,UAAA20D,EAAA2mD,GAAAvqF,KAAA+3D,EAAA,EAAA/3D,KACA2hF,EAAAzqB,EAAA4nB,EAAA,gBhH4ttBG3F,UAAU,IAAI4G,mBAAmB,IAAIyD,mBAAmB,IAAIP,uBAAuB,IAAI7J,SAAS,MAAMoR,KAAK,SAAS1hH,EAAQU,EAAOJ,GiHvutBtI,YACA,IAAAqhH,GAAA3hH,EAAA,cACAy4G,EAAAz4G,EAAA,aACA04G,EAAA14G,EAAA,eACA+8G,EAAA/8G,EAAA,WACAs2G,EAAAt2G,EAAA,UACA+gH,EAAA/gH,EAAA,gBACA4hH,EAAA5hH,EAAA,kBACA64G,EAAA74G,EAAA,wBACAuvF,EAAAvvF,EAAA,iBACA4xG,EAAA5xG,EAAA,UAAA,YACA6hH,OAAA/3D,MAAA,WAAAA,QACAg4D,EAAA,aACAC,EAAA,OACAC,EAAA,SAEAC,EAAA,WAAA,MAAAz7G,MAEA9F,GAAAJ,QAAA,SAAA44G,EAAAlD,EAAA5nB,EAAAl3D,EAAAgrF,EAAAC,EAAAC,GACAR,EAAAxzB,EAAA4nB,EAAA9+E,EACA,IAeA6hF,GAAAnkG,EAAA6sG,EAfAY,EAAA,SAAA3L,GACA,IAAAmL,GAAAnL,IAAAvjF,GAAA,MAAAA,GAAAujF,EACA,QAAAA,GACA,IAAAqL,GAAA,MAAA,YAAA,MAAA,IAAA3zB,GAAA5nF,KAAAkwG,GACA,KAAAsL,GAAA,MAAA,YAAA,MAAA,IAAA5zB,GAAA5nF,KAAAkwG,IACA,MAAA,YAAA,MAAA,IAAAtoB,GAAA5nF,KAAAkwG,KAEA1L,EAAAgL,EAAA,YACAsM,EAAAJ,GAAAF,EACAO,GAAA,EACApvF,EAAA+lF,EAAA/yG,UACAq8G,EAAArvF,EAAAy+E,IAAAz+E,EAAA2uF,IAAAI,GAAA/uF,EAAA+uF,GACAO,EAAAD,GAAAH,EAAAH,GACAQ,EAAAR,EAAAI,EAAAD,EAAA,WAAAI,EAAA95G,OACAg6G,EAAA,SAAA3M,EAAA7iF,EAAAkmF,SAAAmJ,EAAAA,CAwBA,IArBAG,IACAlB,EAAAlyB,EAAAozB,EAAApiH,KAAA,GAAA24G,KACAuI,IAAAv+D,OAAA/8C,WAAAs7G,EAAAvqF,OAEA2hF,EAAA4I,EAAAzW,GAAA,GAEA2W,GAAArL,EAAAmL,EAAA7P,IAAAmL,EAAA0E,EAAA7P,EAAAqQ,KAIAK,GAAAE,GAAAA,EAAAl/G,OAAA0+G,IACAO,GAAA,EACAE,EAAA,WAAA,MAAAD,GAAAjiH,KAAAiG,QAGAm7G,IAAAS,IAAAP,IAAAU,GAAApvF,EAAAy+E,IACAmL,EAAA5pF,EAAAy+E,EAAA6Q,GAGA1B,EAAA/K,GAAAyM,EACA1B,EAAA/V,GAAAiX,EACAC,EAMA,GALAnJ,GACA6J,OAAAN,EAAAG,EAAAJ,EAAAL,GACAl4D,KAAAq4D,EAAAM,EAAAJ,EAAAN,GACA1I,QAAAqJ,GAEAN,EAAA,IAAAxtG,IAAAmkG,GACAnkG,IAAAue,IAAAulF,EAAAvlF,EAAAve,EAAAmkG,EAAAnkG,QACA6jG,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAuN,GAAAU,GAAAvM,EAAA+C,EAEA,OAAAA,MjH2utBGc,YAAY,GAAGtB,SAAS,IAAIlI,UAAU,IAAIwS,iBAAiB,IAAI7B,eAAe,IAAI8B,aAAa,IAAIC,gBAAgB,IAAI7I,cAAc,IAAIC,uBAAuB,IAAI7J,SAAS,MAAM0S,KAAK,SAAShjH,EAAQU,EAAOJ,GkH/ytBnN,GAAAsxG,GAAA5xG,EAAA,UAAA,YACAijH,GAAA,CAEA,KACA,GAAAC,IAAA,GAAAtR,IACAsR,GAAA,UAAA,WAAAD,GAAA,GAEAhnE,MAAA6hC,KAAAolC,EAAA,WAAA,KAAA,KACA,MAAA1jH,IAEAkB,EAAAJ,QAAA,SAAAiP,EAAA4zG,GACA,IAAAA,IAAAF,EAAA,OAAA,CACA,IAAAG,IAAA,CACA,KACA,GAAAltD,IAAA,GACAy7C,EAAAz7C,EAAA07C,IACAD,GAAAz6E,KAAA,WAAA,OAAAC,KAAAisF,GAAA,IACAltD,EAAA07C,GAAA,WAAA,MAAAD,IACApiG,EAAA2mD,GACA,MAAA12D,IACA,MAAA4jH,MlHmztBG9S,SAAS,MAAM+S,KAAK,SAASrjH,EAAQU,EAAOJ,GmHv0tB/CI,EAAAJ,QAAA,SAAA62B,EAAAvsB,GACA,OAAAA,MAAAA,EAAAusB,OAAAA,SnH20tBMmsF,KAAK,SAAStjH,EAAQU,EAAOJ,GoH50tBnCI,EAAAJ,gBpH+0tBMijH,KAAK,SAASvjH,EAAQU,EAAOJ,GqH/0tBnCI,EAAAJ,SAAA,OrHk1tBMkjH,KAAK,SAASxjH,EAAQU,EAAOJ,GsHj1tBnC,GAAAmjH,GAAAv/G,KAAAw/G,KACAhjH,GAAAJ,SAAAmjH,GAEAA,EAAA,IAAA,oBAAAA,EAAA,IAAA,oBAEA,QAAAA,EAAA,QACA,SAAA31G,GACA,MAAA,KAAAA,GAAAA,GAAAA,EAAAA,GAAA,MAAA,KAAAA,EAAAA,EAAAA,EAAAA,EAAA,EAAA5J,KAAAyiB,IAAA7Y,GAAA,GACA21G,OtHq1tBME,KAAK,SAAS3jH,EAAQU,EAAOJ,GuH71tBnC,GAAAsjH,GAAA5jH,EAAA,gBACAs6E,EAAAp2E,KAAAo2E,IACAupC,EAAAvpC,EAAA,EAAA,KACAwpC,EAAAxpC,EAAA,EAAA,KACAypC,EAAAzpC,EAAA,EAAA,MAAA,EAAAwpC,GACAE,EAAA1pC,EAAA,EAAA,MAEA2pC,EAAA,SAAAvkH,GACA,MAAAA,GAAA,EAAAmkH,EAAA,EAAAA,EAGAnjH,GAAAJ,QAAA4D,KAAAggH,QAAA,SAAAp2G,GACA,GAEA/N,GAAAsE,EAFA8/G,EAAAjgH,KAAAq8B,IAAAzyB,GACAs2G,EAAAR,EAAA91G,EAEA,OAAAk2G,GAAAG,EAAAC,EAAAH,EAAAE,EAAAH,EAAAF,GAAAE,EAAAF,GACA/jH,GAAA,EAAA+jH,EAAAD,GAAAM,EACA9/G,EAAAtE,GAAAA,EAAAokH,GAEA9/G,EAAA0/G,GAAA1/G,GAAAA,EAAA+/G,GAAAxuC,EAAAA,GACAwuC,EAAA//G,MvHk2tBGggH,eAAe,MAAMC,KAAK,SAAStkH,EAAQU,EAAOJ,GwHt3tBrDI,EAAAJ,QAAA4D,KAAAqgH,OAAA,SAAAz2G,GACA,OAAAA,GAAAA,GAAA,OAAA,KAAAA,EAAAA,EAAAA,EAAAA,EAAA,EAAA5J,KAAA+R,IAAA,EAAAnI,SxH23tBM02G,KAAK,SAASxkH,EAAQU,EAAOJ,GyH53tBnCI,EAAAJ,QAAA4D,KAAA61B,OAAA,SAAAjsB,EAAA22G,EAAAC,EAAAC,EAAAC,GACA,MACA,KAAA15D,UAAA1qD,QAEAsN,GAAAA,GAEA22G,GAAAA,GAEAC,GAAAA,GAEAC,GAAAA,GAEAC,GAAAA,EACA3J,IACAntG,IAAA8nE,EAAAA,GAAA9nE,MAAA8nE,EAAAA,GAAA9nE,GACAA,EAAA22G,IAAAG,EAAAD,IAAAD,EAAAD,GAAAE,QzHi4tBME,KAAK,SAAS7kH,EAAQU,EAAOJ,G0Hh5tBnCI,EAAAJ,QAAA4D,KAAA0/G,MAAA,SAAA91G,GAEA,MAAA,KAAAA,GAAAA,IAAAA,GAAAA,EAAAA,EAAA,EAAAA,EAAA,GAAA,Q1Hq5tBMg3G,KAAK,SAAS9kH,EAAQU,EAAOJ,G2Hx5tBnC,GAAAykH,GAAA/kH,EAAA,UAAA,QACA0wG,EAAA1wG,EAAA,gBACAs2G,EAAAt2G,EAAA,UACAglH,EAAAhlH,EAAA,gBAAAE,EACA+N,EAAA,EACAg3G,EAAA/hE,OAAA+hE,cAAA,WACA,OAAA,GAEAC,GAAAllH,EAAA,YAAA,WACA,MAAAilH,GAAA/hE,OAAAiiE,yBAEAC,EAAA,SAAA9nF,GACA0nF,EAAA1nF,EAAAynF,GAAAn6G,OACA3K,EAAA,OAAAgO,EACA4mD,SAGA4gD,EAAA,SAAAn4E,EAAAw9B,GAEA,IAAA41C,EAAApzE,GAAA,MAAA,gBAAAA,GAAAA,GAAA,gBAAAA,GAAA,IAAA,KAAAA,CACA,KAAAg5E,EAAAh5E,EAAAynF,GAAA,CAEA,IAAAE,EAAA3nF,GAAA,MAAA,GAEA,KAAAw9B,EAAA,MAAA,GAEAsqD,GAAA9nF,GAEA,MAAAA,GAAAynF,GAAA9kH,GAEA03G,EAAA,SAAAr6E,EAAAw9B,GACA,IAAAw7C,EAAAh5E,EAAAynF,GAAA,CAEA,IAAAE,EAAA3nF,GAAA,OAAA,CAEA,KAAAw9B,EAAA,OAAA,CAEAsqD,GAAA9nF,GAEA,MAAAA,GAAAynF,GAAAlwD,GAGAwwD,EAAA,SAAA/nF,GAEA,MADA4nF,IAAA79B,EAAAsyB,MAAAsL,EAAA3nF,KAAAg5E,EAAAh5E,EAAAynF,IAAAK,EAAA9nF,GACAA,GAEA+pD,EAAA3mF,EAAAJ,SACA84G,IAAA2L,EACApL,MAAA,EACAlE,QAAAA,EACAkC,QAAAA,EACA0N,SAAAA,K3H45tBGvL,WAAW,GAAGvB,SAAS,IAAI5H,eAAe,IAAIuG,eAAe,IAAIoO,SAAS,MAAMC,KAAK,SAASvlH,EAAQU,EAAOJ,G4H/8tBhH,GAAAklH,GAAAxlH,EAAA,aACAy4G,EAAAz4G,EAAA,aACAylH,EAAAzlH,EAAA,aAAA,YACAgzE,EAAAyyC,EAAAzyC,QAAAyyC,EAAAzyC,MAAA,IAAAhzE,EAAA,oBAEA0lH,EAAA,SAAAx8E,EAAAy8E,EAAA7qD,GACA,GAAA8qD,GAAA5yC,EAAAljC,IAAA5G,EACA,KAAA08E,EAAA,CACA,IAAA9qD,EAAA,MACAkY,GAAAr/C,IAAAuV,EAAA08E,EAAA,GAAAJ,IAEA,GAAAK,GAAAD,EAAA91E,IAAA61E,EACA,KAAAE,EAAA,CACA,IAAA/qD,EAAA,MACA8qD,GAAAjyF,IAAAgyF,EAAAE,EAAA,GAAAL,IACA,MAAAK,IAEAC,EAAA,SAAAC,EAAA9W,EAAAsO,GACA,GAAAyI,GAAAN,EAAAzW,EAAAsO,GAAA,EACA,OAAA50G,UAAAq9G,GAAA,EAAAA,EAAA1P,IAAAyP,IAEAE,EAAA,SAAAF,EAAA9W,EAAAsO,GACA,GAAAyI,GAAAN,EAAAzW,EAAAsO,GAAA,EACA,OAAA50G,UAAAq9G,EAAAr9G,OAAAq9G,EAAAl2E,IAAAi2E,IAEAG,EAAA,SAAAH,EAAAI,EAAAlX,EAAAsO,GACAmI,EAAAzW,EAAAsO,GAAA,GAAA5pF,IAAAoyF,EAAAI,IAEAC,EAAA,SAAAl9E,EAAAy8E,GACA,GAAAK,GAAAN,EAAAx8E,EAAAy8E,GAAA,GACA77D,IAEA,OADAk8D,IAAAA,EAAA5jG,QAAA,SAAAikG,EAAAzxG,GAAAk1C,EAAApmD,KAAAkR,KACAk1C,GAEAw8D,EAAA,SAAAhpF,GACA,MAAA30B,UAAA20B,GAAA,gBAAAA,GAAAA,EAAAv6B,OAAAu6B,IAEA3W,EAAA,SAAAsoF,GACAwJ,EAAAA,EAAA4E,EAAA,UAAApO,GAGAvuG,GAAAJ,SACA0yE,MAAAA,EACAnlE,IAAA63G,EACApP,IAAAwP,EACAh2E,IAAAm2E,EACAtyF,IAAAuyF,EACAp8D,KAAAs8D,EACAxxG,IAAA0xG,EACA3/F,IAAAA,K5Hm9tBGkzF,YAAY,GAAG0M,YAAY,IAAIC,YAAY,IAAIC,iBAAiB,MAAMC,KAAK,SAAS1mH,EAAQU,EAAOJ,G6HpguBtG,GAAAyuG,GAAA/uG,EAAA,aACA2mH,EAAA3mH,EAAA,WAAA2zB,IACAizF,EAAA7X,EAAA8X,kBAAA9X,EAAA+X,uBACAC,EAAAhY,EAAAgY,QACA1oG,EAAA0wF,EAAA1wF,QACA2oG,EAAA,WAAAhnH,EAAA,UAAA+mH,EAEArmH,GAAAJ,QAAA,WACA,GAAAiiB,GAAAonD,EAAAxtC,EAEAhtB,EAAA,WACA,GAAAgjF,GAAAqiB,CAEA,KADAwS,IAAA70B,EAAA40B,EAAAE,SAAA90B,EAAA+0B,OACA3kG,GAAA,CACAiyF,EAAAjyF,EAAAiyF,GACAjyF,EAAAA,EAAA2U,IACA;AACAs9E,IACA,MAAAh1G,GAGA,KAFA+iB,GAAA4Z,IACAwtC,EAAAhhE,OACAnJ,GAEAmqE,EAAAhhE,OACAwpF,GAAAA,EAAAg1B,QAIA,IAAAH,EACA7qF,EAAA,WACA4qF,EAAAK,SAAAj4G,QAGA,IAAAy3G,EAAA,CACA,GAAAS,IAAA,EACApqG,EAAAqF,SAAAuW,eAAA,GACA,IAAA+tF,GAAAz3G,GAAAm4G,QAAArqG,GAAAsqG,eAAA,IACAprF,EAAA,WACAlf,EAAArb,KAAAylH,GAAAA,OAGA,IAAAhpG,GAAAA,EAAAiC,QAAA,CACA,GAAAknG,GAAAnpG,EAAAiC,SACA6b,GAAA,WACAqrF,EAAAloG,KAAAnQ,QASAgtB,GAAA,WAEAwqF,EAAApmH,KAAAwuG,EAAA5/F,GAIA,OAAA,UAAAqlG,GACA,GAAAiT,IAAAjT,GAAAA,EAAAt9E,KAAAvuB,OACAghE,KAAAA,EAAAzyC,KAAAuwF,GACAllG,IACAA,EAAAklG,EACAtrF,KACAwtC,EAAA89C,M7HyguBGxX,SAAS,GAAG8J,YAAY,GAAG2N,UAAU,MAAMC,KAAK,SAAS3nH,EAAQU,EAAOJ,G8H1kuB3E,YAIA,SAAAsnH,GAAAt1F,GACA,GAAAhS,GAAA+U,CACA7uB,MAAAghH,QAAA,GAAAl1F,GAAA,SAAAu1F,EAAAC,GACA,GAAAn/G,SAAA2X,GAAA3X,SAAA0sB,EAAA,KAAAqhC,WAAA,0BACAp2C,GAAAunG,EACAxyF,EAAAyyF,IAEAthH,KAAA8Z,QAAAgzF,EAAAhzF,GACA9Z,KAAA6uB,OAAAi+E,EAAAj+E,GAVA,GAAAi+E,GAAAtzG,EAAA,gBAaAU,GAAAJ,QAAAJ,EAAA,SAAAoyB,GACA,MAAA,IAAAs1F,GAAAt1F,M9H8kuBGmhF,gBAAgB,KAAKsU,KAAK,SAAS/nH,EAAQU,EAAOJ,G+H9luBrD,YAEA,IAAA+7G,GAAAr8G,EAAA,kBACAs8G,EAAAt8G,EAAA,kBACAu8G,EAAAv8G,EAAA,iBACA6wG,EAAA7wG,EAAA,gBACAsyG,EAAAtyG,EAAA,cACAgoH,EAAA9kE,OAAA+kE,MAGAvnH,GAAAJ,SAAA0nH,GAAAhoH,EAAA,YAAA,WACA,GAAAqyB,MACA0iF,KAEAsI,EAAAt/F,SACAmqG,EAAA,sBAGA,OAFA71F,GAAAgrF,GAAA,EACA6K,EAAAp7G,MAAA,IAAAsV,QAAA,SAAAxK,GAAAm9F,EAAAn9F,GAAAA,IACA,GAAAowG,KAAA31F,GAAAgrF,IAAAn6D,OAAA4G,KAAAk+D,KAAAjT,IAAA/1D,KAAA,KAAAkpE,IACA,SAAAh/E,EAAA/K,GAMA,IALA,GAAA3L,GAAAq+E,EAAA3nE,GACAqoE,EAAArmD,UAAA1qD,OACA+F,EAAA,EACAi2G,EAAAF,EAAAp8G,EACAw8G,EAAAH,EAAAr8G,EACAqxG,EAAAhrG,GAMA,IALA,GAIAqO,GAJAyoG,EAAA/K,EAAApnD,UAAA3kD,MACAujD,EAAA0yD,EAAAH,EAAAgB,GAAA/zD,OAAAkzD,EAAAa,IAAAhB,EAAAgB,GACA78G,EAAAspD,EAAAtpD,OACA+C,EAAA,EAEA/C,EAAA+C,GAAAm5G,EAAAn8G,KAAA88G,EAAAzoG,EAAAk1C,EAAAvmD,QAAAivB,EAAA5d,GAAAyoG,EAAAzoG,GACA,OAAA4d,IACAw1F,I/HimuBGlO,WAAW,GAAG1G,aAAa,IAAIuJ,iBAAiB,IAAIC,iBAAiB,IAAIC,gBAAgB,IAAIxL,eAAe,MAAM8W,KAAK,SAASnoH,EAAQU,EAAOJ,GgIjouBlJ,GAAAs3G,GAAA53G,EAAA,gBACAooH,EAAApoH,EAAA,iBACAqoH,EAAAroH,EAAA,oBACAsoH,EAAAtoH,EAAA,iBAAA,YACAuoH,EAAA,aACAvL,EAAA,YAGAwL,EAAA,WAEA,GAIAC,GAJAC,EAAA1oH,EAAA,iBAAA,UACAC,EAAAooH,EAAA7nH,OACAmoH,EAAA,IACAC,EAAA,GAYA,KAVAF,EAAA9gG,MAAAC,QAAA,OACA7nB,EAAA,WAAAwiB,YAAAkmG,GACAA,EAAA/8F,IAAA,cAGA88F,EAAAC,EAAAG,cAAAvmG,SACAmmG,EAAA/oG,OACA+oG,EAAAK,MAAAH,EAAA,SAAAC,EAAA,oBAAAD,EAAA,UAAAC,GACAH,EAAAM,QACAP,EAAAC,EAAAnU,EACAr0G,WAAAuoH,GAAAxL,GAAAqL,EAAApoH,GACA,OAAAuoH,KAGA9nH,GAAAJ,QAAA4iD,OAAA4X,QAAA,SAAAm0C,EAAA+Z,GACA,GAAA3kH,EAQA,OAPA,QAAA4qG,GACAsZ,EAAAvL,GAAApF,EAAA3I,GACA5qG,EAAA,GAAAkkH,GACAA,EAAAvL,GAAA,KAEA34G,EAAAikH,GAAArZ,GACA5qG,EAAAmkH,IACA7/G,SAAAqgH,EAAA3kH,EAAA+jH,EAAA/jH,EAAA2kH,MhIsouBG3Q,eAAe,GAAGkI,gBAAgB,GAAG0I,mBAAmB,GAAGC,UAAU,IAAIC,gBAAgB,IAAIC,gBAAgB,MAAMC,KAAK,SAASrpH,EAAQU,EAAOJ,GiI7quBnJ,GAAAs3G,GAAA53G,EAAA,gBACAspH,EAAAtpH,EAAA,qBACA47G,EAAA57G,EAAA,mBACAm1G,EAAAjyD,OAAA8S,cAEA11D,GAAAJ,EAAAF,EAAA,kBAAAkjD,OAAA8S,eAAA,SAAAi5C,EAAAsO,EAAAgM,GAIA,GAHA3R,EAAA3I,GACAsO,EAAA3B,EAAA2B,GAAA,GACA3F,EAAA2R,GACAD,EAAA,IACA,MAAAnU,GAAAlG,EAAAsO,EAAAgM,GACA,MAAA/pH,IACA,GAAA,OAAA+pH,IAAA,OAAAA,GAAA,KAAA7yD,WAAA,2BAEA,OADA,SAAA6yD,KAAAta,EAAAsO,GAAAgM,EAAA3+G,OACAqkG,KjIiruBGoJ,eAAe,GAAGxB,iBAAiB,GAAG2S,oBAAoB,IAAIzN,kBAAkB,MAAM0N,KAAK,SAASzpH,EAAQU,EAAOJ,GkI/ruBtH,GAAA60G,GAAAn1G,EAAA,gBACA43G,EAAA53G,EAAA,gBACAq8G,EAAAr8G,EAAA,iBAEAU,GAAAJ,QAAAN,EAAA,kBAAAkjD,OAAA8rC,iBAAA,SAAAigB,EAAA+Z,GACApR,EAAA3I,EAKA,KAJA,GAGAsO,GAHAzzD,EAAAuyD,EAAA2M,GACAxoH,EAAAspD,EAAAtpD,OACAP,EAAA,EAEAO,EAAAP,GAAAk1G,EAAAj1G,EAAA+uG,EAAAsO,EAAAzzD,EAAA7pD,KAAA+oH,EAAAzL,GACA,OAAAtO,MlImsuBGoJ,eAAe,GAAGxB,iBAAiB,GAAGK,eAAe,IAAI0F,iBAAiB,MAAM8M,KAAK,SAAS1pH,EAAQU,EAAOJ,GmI9suBhH,YAEAI,GAAAJ,QAAAN,EAAA,gBAAAA,EAAA,YAAA,WACA,GAAAkoH,GAAAhkH,KAAA+vE,QAGA01C,kBAAAppH,KAAA,KAAA2nH,EAAA,oBACAloH,GAAA,aAAAkoH,OnIktuBGpO,WAAW,GAAGC,YAAY,GAAG+I,aAAa,MAAM8G,KAAK,SAAS5pH,EAAQU,EAAOJ,GoIztuBhF,GAAAi8G,GAAAv8G,EAAA,iBACAy6G,EAAAz6G,EAAA,oBACA+xG,EAAA/xG,EAAA,iBACA47G,EAAA57G,EAAA,mBACAs2G,EAAAt2G,EAAA,UACAspH,EAAAtpH,EAAA,qBACA6pH,EAAA3mE,OAAA4mE,wBAEAxpH,GAAAJ,EAAAF,EAAA,kBAAA6pH,EAAA,SAAA5a,EAAAsO,GAGA,GAFAtO,EAAA8C,EAAA9C,GACAsO,EAAA3B,EAAA2B,GAAA,GACA+L,EAAA,IACA,MAAAO,GAAA5a,EAAAsO,GACA,MAAA/9G,IACA,MAAA82G,GAAArH,EAAAsO,GAAA9C,GAAA8B,EAAAr8G,EAAAK,KAAA0uG,EAAAsO,GAAAtO,EAAAsO,IAAA,UpI6tuBG1G,iBAAiB,GAAG0B,SAAS,IAAIiR,oBAAoB,IAAI3M,gBAAgB,IAAInC,mBAAmB,IAAItI,gBAAgB,IAAI2J,kBAAkB,MAAMgO,KAAK,SAAS/pH,EAAQU,EAAOJ,GqI1uuBhL,GAAAyxG,GAAA/xG,EAAA,iBACAgqH,EAAAhqH,EAAA,kBAAAE,EACA2C,KAAAA,SAEAonH,EAAA,gBAAAj3F,SAAAA,QAAAkwB,OAAAgnE,oBACAhnE,OAAAgnE,oBAAAl3F,WAEAm3F,EAAA,SAAA7sF,GACA,IACA,MAAA0sF,GAAA1sF,GACA,MAAA99B,GACA,MAAAyqH,GAAAhoH,SAIAvB,GAAAJ,QAAAJ,EAAA,SAAAo9B,GACA,MAAA2sF,IAAA,mBAAApnH,EAAAtC,KAAA+8B,GAAA6sF,EAAA7sF,GAAA0sF,EAAAjY,EAAAz0E,OrI+uuBG8sF,iBAAiB,IAAIhY,gBAAgB,MAAMiY,KAAK,SAASrqH,EAAQU,EAAOJ,GsI/vuB3E,GAAAgqH,GAAAtqH,EAAA,2BACAuqH,EAAAvqH,EAAA,oBAAAspD,OAAA,SAAA,YAEAhpD,GAAAJ,EAAAgjD,OAAAgnE,qBAAA,SAAAjb,GACA,MAAAqb,GAAArb,EAAAsb,MtIowuBGtB,mBAAmB,GAAGuB,0BAA0B,MAAMC,KAAK,SAASzqH,EAAQU,EAAOJ,GuIzwuBtFA,EAAAJ,EAAAgjD,OAAAwnE,2BvI4wuBMC,KAAK,SAAS3qH,EAAQU,EAAOJ,GwI3wuBnC,GAAAg2G,GAAAt2G,EAAA,UACA6wG,EAAA7wG,EAAA,gBACAsoH,EAAAtoH,EAAA,iBAAA,YACA4qH,EAAA1nE,OAAA/8C,SAEAzF,GAAAJ,QAAA4iD,OAAAqsC,gBAAA,SAAA0f,GAEA,MADAA,GAAA4B,EAAA5B,GACAqH,EAAArH,EAAAqZ,GAAArZ,EAAAqZ,GACA,kBAAArZ,GAAA/wF,aAAA+wF,YAAAA,GAAA/wF,YACA+wF,EAAA/wF,YAAA/X,UACA8oG,YAAA/rD,QAAA0nE,EAAA,QxIgxuBGrS,SAAS,IAAI6Q,gBAAgB,IAAI/X,eAAe,MAAMwZ,KAAK,SAAS7qH,EAAQU,EAAOJ,GyI3xuBtF,GAAAg2G,GAAAt2G,EAAA,UACA+xG,EAAA/xG,EAAA,iBACAmsC,EAAAnsC,EAAA,sBAAA,GACAsoH,EAAAtoH,EAAA,iBAAA,WAEAU,GAAAJ,QAAA,SAAAi2C,EAAAu0E,GACA,GAGAl2G,GAHAq6F,EAAA8C,EAAAx7D,GACAt2C,EAAA,EACAoE,IAEA,KAAAuQ,IAAAq6F,GAAAr6F,GAAA0zG,GAAAhS,EAAArH,EAAAr6F,IAAAvQ,EAAAX,KAAAkR,EAEA,MAAAk2G,EAAAtqH,OAAAP,GAAAq2G,EAAArH,EAAAr6F,EAAAk2G,EAAA7qH,SACAksC,EAAA9nC,EAAAuQ,IAAAvQ,EAAAX,KAAAkR,GAEA,OAAAvQ,MzI+xuBG0mH,oBAAoB,GAAGxS,SAAS,IAAI6Q,gBAAgB,IAAIhX,gBAAgB,MAAM4Y,KAAK,SAAShrH,EAAQU,EAAOJ,G0I7yuB9G,GAAAgqH,GAAAtqH,EAAA,2BACAqoH,EAAAroH,EAAA,mBAEAU,GAAAJ,QAAA4iD,OAAA4G,MAAA,SAAAmlD,GACA,MAAAqb,GAAArb,EAAAoZ,M1IkzuBGY,mBAAmB,GAAGuB,0BAA0B,MAAMS,KAAK,SAASjrH,EAAQU,EAAOJ,G2IvzuBtFA,EAAAJ,KAAA2gH,0B3I0zuBMqK,KAAK,SAASlrH,EAAQU,EAAOJ,G4IzzuBnC,GAAAm4G,GAAAz4G,EAAA,aACAq6G,EAAAr6G,EAAA,WACA24G,EAAA34G,EAAA,WACAU,GAAAJ,QAAA,SAAA84G,EAAA7pG,GACA,GAAAilG,IAAA6F,EAAAn3D,YAAAk2D,IAAAl2D,OAAAk2D,GACAzyF,IACAA,GAAAyyF,GAAA7pG,EAAAilG,GACAiE,EAAAA,EAAA4E,EAAA5E,EAAAnE,EAAAqE,EAAA,WAAAnE,EAAA,KAAA,SAAA7tF,M5I8zuBGg3F,UAAU,GAAG9D,YAAY,GAAGC,WAAW,KAAKqR,KAAK,SAASnrH,EAAQU,EAAOJ,G6It0uB5E,GAAA+7G,GAAAr8G,EAAA,kBACA+xG,EAAA/xG,EAAA,iBACA08G,EAAA18G,EAAA,iBAAAE,CACAQ,GAAAJ,QAAA,SAAA8qH,GACA,MAAA,UAAA9tF,GAOA,IANA,GAKA1oB,GALAq6F,EAAA8C,EAAAz0E,GACAwsB,EAAAuyD,EAAApN,GACAzuG,EAAAspD,EAAAtpD,OACAP,EAAA,EACAoE,KAEA7D,EAAAP,GAAAy8G,EAAAn8G,KAAA0uG,EAAAr6F,EAAAk1C,EAAA7pD,OACAoE,EAAAX,KAAA0nH,GAAAx2G,EAAAq6F,EAAAr6F,IAAAq6F,EAAAr6F,GACA,OAAAvQ,O7I20uBGu4G,iBAAiB,IAAIC,gBAAgB,IAAIzK,gBAAgB,MAAMiZ,KAAK,SAASrrH,EAAQU,EAAOJ,G8Iv1uB/F,GAAA0pH,GAAAhqH,EAAA,kBACAs8G,EAAAt8G,EAAA,kBACA43G,EAAA53G,EAAA,gBACAsrH,EAAAtrH,EAAA,aAAAsrH,OACA5qH,GAAAJ,QAAAgrH,GAAAA,EAAAC,SAAA,SAAAjuF,GACA,GAAAwsB,GAAAkgE,EAAA9pH,EAAA03G,EAAAt6E,IACAk/E,EAAAF,EAAAp8G,CACA,OAAAs8G,GAAA1yD,EAAAR,OAAAkzD,EAAAl/E,IAAAwsB,K9I41uBGuuD,eAAe,GAAG0B,YAAY,GAAGqQ,iBAAiB,IAAIzN,iBAAiB,MAAM6O,KAAK,SAASxrH,EAAQU,EAAOJ,G+Ip2uB7G,GAAAmrH,GAAAzrH,EAAA,aAAAoN,WACAs+G,EAAA1rH,EAAA,kBAAAs9F,IAEA58F,GAAAJ,QAAA,EAAAmrH,EAAAzrH,EAAA,gBAAA,UAAA41E,EAAAA,GAAA,SAAA+1C,GACA,GAAAxkE,GAAAukE,EAAA3oH,OAAA4oH,GAAA,GACAtnH,EAAAonH,EAAAtkE,EACA,OAAA,KAAA9iD,GAAA,KAAA8iD,EAAA20B,OAAA,IAAA,EAAAz3E,GACAonH,I/Iu2uBG1R,YAAY,GAAG6R,iBAAiB,IAAIC,eAAe,MAAMC,KAAK,SAAS9rH,EAAQU,EAAOJ,GgJ92uBzF,GAAAyrH,GAAA/rH,EAAA,aAAAgN,SACA0+G,EAAA1rH,EAAA,kBAAAs9F,KACA0uB,EAAAhsH,EAAA,gBACAisH,EAAA,aAEAvrH,GAAAJ,QAAA,IAAAyrH,EAAAC,EAAA,OAAA,KAAAD,EAAAC,EAAA,QAAA,SAAAL,EAAAO,GACA,GAAA/kE,GAAAukE,EAAA3oH,OAAA4oH,GAAA,EACA,OAAAI,GAAA5kE,EAAA+kE,IAAA,IAAAD,EAAA1+G,KAAA45C,GAAA,GAAA,MACA4kE,IhJi3uBGhS,YAAY,GAAG6R,iBAAiB,IAAIC,eAAe,MAAMM,KAAK,SAASnsH,EAAQU,EAAOJ,GiJz3uBzFI,EAAAJ,QAAA,SAAAiP,GACA,IACA,OAAA/P,GAAA,EAAA+B,EAAAgO,KACA,MAAA/P,GACA,OAAAA,GAAA,EAAA+B,EAAA/B,UjJ83uBM4sH,KAAK,SAASpsH,EAAQU,EAAOJ,GkJl4uBnC,GAAAs3G,GAAA53G,EAAA,gBACA0wG,EAAA1wG,EAAA,gBACAqsH,EAAArsH,EAAA,4BAEAU,GAAAJ,QAAA,SAAAgyB,EAAAxkB,GAEA,GADA8pG,EAAAtlF,GACAo+E,EAAA5iG,IAAAA,EAAAoQ,cAAAoU,EAAA,MAAAxkB,EACA,IAAAw+G,GAAAD,EAAAnsH,EAAAoyB,GACAhS,EAAAgsG,EAAAhsG,OAEA,OADAA,GAAAxS,GACAw+G,EAAA9E,WlJs4uBGnP,eAAe,GAAG1H,eAAe,IAAI4b,4BAA4B,MAAMC,KAAK,SAASxsH,EAAQU,EAAOJ,GmJh5uBvGI,EAAAJ,QAAA,SAAAmsH,EAAA7hH,GACA,OACA8jF,aAAA,EAAA+9B,GACA79B,eAAA,EAAA69B,GACA99B,WAAA,EAAA89B,GACA7hH,MAAAA,SnJq5uBM8hH,KAAK,SAAS1sH,EAAQU,EAAOJ,GoJ15uBnC,GAAAo4G,GAAA14G,EAAA,cACAU,GAAAJ,QAAA,SAAA4oC,EAAAvd,EAAAy3F,GACA,IAAA,GAAAxuG,KAAA+W,GAAA+sF,EAAAxvE,EAAAt0B,EAAA+W,EAAA/W,GAAAwuG,EACA,OAAAl6E,MpJ85uBGgxE,cAAc,MAAMyS,KAAK,SAAS3sH,EAAQU,EAAOJ,GqJj6uBpD,GAAAyuG,GAAA/uG,EAAA,aACA+8G,EAAA/8G,EAAA,WACAs2G,EAAAt2G,EAAA,UACA4sH,EAAA5sH,EAAA,UAAA,OACA6sH,EAAA,WACAC,EAAAxd,SAAAud,GACAE,GAAA,GAAAD,GAAAhgH,MAAA+/G,EAEA7sH,GAAA,WAAAgtH,cAAA,SAAA1vF,GACA,MAAAwvF,GAAAvsH,KAAA+8B,KAGA58B,EAAAJ,QAAA,SAAA2uG,EAAAr6F,EAAAy4F,EAAA+V,GACA,GAAA6J,GAAA,kBAAA5f,EACA4f,KAAA3W,EAAAjJ,EAAA,SAAA0P,EAAA1P,EAAA,OAAAz4F,IACAq6F,EAAAr6F,KAAAy4F,IACA4f,IAAA3W,EAAAjJ,EAAAuf,IAAA7P,EAAA1P,EAAAuf,EAAA3d,EAAAr6F,GAAA,GAAAq6F,EAAAr6F,GAAAm4G,EAAA/tE,KAAAj8C,OAAA6R,MACAq6F,IAAAF,EACAE,EAAAr6F,GAAAy4F,EACA+V,EAGAnU,EAAAr6F,GACAq6F,EAAAr6F,GAAAy4F,EAEA0P,EAAA9N,EAAAr6F,EAAAy4F,UALA4B,GAAAr6F,GACAmoG,EAAA9N,EAAAr6F,EAAAy4F,OAOAiC,SAAAnpG,UAAA0mH,EAAA,WACA,MAAA,kBAAArmH,OAAAA,KAAAomH,IAAAE,EAAAvsH,KAAAiG,UrJq6uBGm3G,UAAU,GAAG5D,YAAY,GAAGxB,SAAS,IAAIlI,UAAU,IAAIiV,SAAS,MAAM4H,KAAK,SAASltH,EAAQU,EAAOJ,GsJl8uBtGI,EAAAJ,QAAA,SAAA6sH,EAAA5oH,GACA,GAAA6oH,GAAA7oH,IAAA2+C,OAAA3+C,GAAA,SAAA8oH,GACA,MAAA9oH,GAAA8oH,IACA9oH,CACA,OAAA,UAAA+4B,GACA,MAAAv6B,QAAAu6B,GAAA/4B,QAAA4oH,EAAAC,UtJu8uBME,KAAK,SAASttH,EAAQU,EAAOJ,GuJ38uBnCI,EAAAJ,QAAA4iD,OAAA4jC,IAAA,SAAAh5E,EAAAmqC,GAEA,MAAAnqC,KAAAmqC,EAAA,IAAAnqC,GAAA,EAAAA,IAAA,EAAAmqC,EAAAnqC,GAAAA,GAAAmqC,GAAAA,QvJg9uBMs1E,KAAK,SAASvtH,EAAQU,EAAOJ,GwJn9uBnC,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAszG,EAAAtzG,EAAA,iBACAohE,EAAAphE,EAAA,UACA0xG,EAAA1xG,EAAA,YAEAU,GAAAJ,QAAA,SAAAktH,GACA/U,EAAAA,EAAA4E,EAAAmQ,GAAA1vC,KAAA,SAAA3/C,GACA,GACAzK,GAAArB,EAAA3yB,EAAAm1B,EADAyqF,EAAAp0D,UAAA,EAKA,OAHAooD,GAAA9sG,MACAktB,EAAA/qB,SAAA22G,EACA5rF,GAAA4/E,EAAAgM,GACA32G,QAAAw1B,EAAA,GAAA33B,OACA6rB,KACAqB,GACAh0B,EAAA,EACAm1B,EAAAusC,EAAAk+C,EAAAp0D,UAAA,GAAA,GACAwmD,EAAAvzE,GAAA,EAAA,SAAAsvF,GACAp7F,EAAA3uB,KAAAmxB,EAAA44F,EAAA/tH,SAGAgyG,EAAAvzE,GAAA,EAAA9L,EAAA3uB,KAAA2uB,GAEA,GAAA7rB,MAAA6rB,UxJw9uBGohF,gBAAgB,GAAGN,SAAS,GAAG0G,YAAY,GAAGhI,YAAY,KAAK6b,KAAK,SAAS1tH,EAAQU,EAAOJ,GyJj/uB/F,YAEA,IAAAm4G,GAAAz4G,EAAA,YAEAU,GAAAJ,QAAA,SAAAktH,GACA/U,EAAAA,EAAA4E,EAAAmQ,GAAA/1C,GAAA,WAGA,IAFA,GAAAj3E,GAAA0qD,UAAA1qD,OACA6xB,EAAA4pB,MAAAz7C,GACAA,KAAA6xB,EAAA7xB,GAAA0qD,UAAA1qD,EACA,OAAA,IAAAgG,MAAA6rB,SzJs/uBGwnF,YAAY,KAAK8T,KAAK,SAAS3tH,EAAQU,EAAOJ,G0J7/uBjD,GAAAowG,GAAA1wG,EAAA,gBACA43G,EAAA53G,EAAA,gBACAm7B,EAAA,SAAA8zE,EAAA97E,GAEA,GADAykF,EAAA3I,IACAyB,EAAAv9E,IAAA,OAAAA,EAAA,KAAAujC,WAAAvjC,EAAA,6BAEAzyB,GAAAJ,SACAqzB,IAAAuvB,OAAA2rC,iBAAA,gBACA,SAAAthF,EAAAqgH,EAAAj6F,GACA,IACAA,EAAA3zB,EAAA,UAAAsvG,SAAA/uG,KAAAP,EAAA,kBAAAE,EAAAgjD,OAAA/8C,UAAA,aAAAwtB,IAAA,GACAA,EAAApmB,MACAqgH,IAAArgH,YAAA0uC,QACA,MAAAz8C,GAAAouH,GAAA,EACA,MAAA,UAAA3e,EAAA97E,GAIA,MAHAgI,GAAA8zE,EAAA97E,GACAy6F,EAAA3e,EAAAngB,UAAA37D,EACAQ,EAAAs7E,EAAA97E,GACA87E,QAEA,GAAAtmG,QACAwyB,MAAAA,K1JmgvBGk9E,eAAe,GAAGlF,SAAS,GAAGxC,eAAe,IAAIkd,iBAAiB,MAAMC,KAAK,SAAS9tH,EAAQU,EAAOJ,G2J1hvBxG,YACA,IAAAyuG,GAAA/uG,EAAA,aACAm1G,EAAAn1G,EAAA,gBACAw1G,EAAAx1G,EAAA,kBACA2zG,EAAA3zG,EAAA,UAAA,UAEAU,GAAAJ,QAAA,SAAA84G,GACA,GAAA9mF,GAAAy8E,EAAAqK,EACA5D,IAAAljF,IAAAA,EAAAqhF,IAAAwB,EAAAj1G,EAAAoyB,EAAAqhF,GACA/kB,cAAA,EACA9+C,IAAA,WAAA,MAAAtpC,Y3J+hvBGqwG,iBAAiB,GAAGkD,YAAY,GAAG7C,eAAe,IAAI5G,SAAS,MAAMyd,KAAK,SAAS/tH,EAAQU,EAAOJ,G4JzivBrG,GAAAi2G,GAAAv2G,EAAA,gBAAAE,EACAo2G,EAAAt2G,EAAA,UACAgrG,EAAAhrG,EAAA,UAAA,cAEAU,GAAAJ,QAAA,SAAAg9B,EAAAzyB,EAAAmjH,GACA1wF,IAAAg5E,EAAAh5E,EAAA0wF,EAAA1wF,EAAAA,EAAAn3B,UAAA6kG,IAAAuL,EAAAj5E,EAAA0tE,GAAApc,cAAA,EAAAhkF,MAAAC,O5J6ivBG0tG,SAAS,IAAIrB,eAAe,IAAI5G,SAAS,MAAM2d,KAAK,SAASjuH,EAAQU,EAAOJ,G6JljvB/E,GAAAmlH,GAAAzlH,EAAA,aAAA,QACAkuH,EAAAluH,EAAA,SACAU,GAAAJ,QAAA,SAAAsU,GACA,MAAA6wG,GAAA7wG,KAAA6wG,EAAA7wG,GAAAs5G,EAAAt5G,O7JsjvBG2xG,YAAY,IAAIjB,SAAS,MAAM6I,KAAK,SAASnuH,EAAQU,EAAOJ,G8JzjvB/D,GAAAyuG,GAAA/uG,EAAA,aACAouH,EAAA,qBACAp7C,EAAA+7B,EAAAqf,KAAArf,EAAAqf,MACA1tH,GAAAJ,QAAA,SAAAsU,GACA,MAAAo+D,GAAAp+D,KAAAo+D,EAAAp+D,U9J6jvBGmlG,YAAY,KAAKsU,KAAK,SAASruH,EAAQU,EAAOJ,G+JhkvBjD,GAAAs3G,GAAA53G,EAAA,gBACAszG,EAAAtzG,EAAA,iBACA2zG,EAAA3zG,EAAA,UAAA,UACAU,GAAAJ,QAAA,SAAA2uG,EAAAqf,GACA,GACAjR,GADA/qF,EAAAslF,EAAA3I,GAAA/wF,WAEA,OAAAvV,UAAA2pB,GAAA3pB,SAAA00G,EAAAzF,EAAAtlF,GAAAqhF,IAAA2a,EAAAhb,EAAA+J,M/JqkvBG5J,gBAAgB,GAAG4E,eAAe,GAAG/H,SAAS,MAAMie,KAAK,SAASvuH,EAAQU,EAAOJ,GgK5kvBpF,YACA,IAAAq4G,GAAA34G,EAAA,WAEAU,GAAAJ,QAAA,SAAAu/C,EAAAymC,GACA,QAAAzmC,GAAA84D,EAAA,WAEAryB,EAAAzmC,EAAAt/C,KAAA,KAAA,aAAA,GAAAs/C,EAAAt/C,KAAA,WhKilvBGu5G,WAAW,KAAK0U,KAAK,SAASxuH,EAAQU,EAAOJ,GiKvlvBhD,GAAAmuH,GAAAzuH,EAAA,iBACAi+G,EAAAj+G,EAAA,aAGAU,GAAAJ,QAAA,SAAAusH,GACA,MAAA,UAAA5Z,EAAA3pG,GACA,GAGAvJ,GAAAmB,EAHAtB,EAAAmD,OAAAk7G,EAAAhL,IACAhzG,EAAAwuH,EAAAnlH,GACAjJ,EAAAT,EAAAY,MAEA,OAAA,GAAAP,GAAAA,GAAAI,EAAAwsH,EAAA,GAAAlkH,QACA5I,EAAAH,EAAAge,WAAA3d,GACA,MAAAF,GAAAA,EAAA,OAAAE,EAAA,IAAAI,IAAAa,EAAAtB,EAAAge,WAAA3d,EAAA,IAAA,OAAAiB,EAAA,MACA2rH,EAAAjtH,EAAAk8E,OAAA77E,GAAAF,EACA8sH,EAAAjtH,EAAAqC,MAAAhC,EAAAA,EAAA,IAAAF,EAAA,OAAA,KAAAmB,EAAA,OAAA,WjK4lvBGq9G,aAAa,GAAGmQ,gBAAgB,MAAMC,KAAK,SAAS3uH,EAAQU,EAAOJ,GkKzmvBtE,GAAA+gH,GAAArhH,EAAA,gBACAi+G,EAAAj+G,EAAA,aAEAU,GAAAJ,QAAA,SAAA2yG,EAAA2b,EAAA5Y,GACA,GAAAqL,EAAAuN,GAAA,KAAAl4D,WAAA,UAAAs/C,EAAA,yBACA,OAAAjzG,QAAAk7G,EAAAhL,OlK8mvBGsL,aAAa,GAAGsQ,eAAe,MAAMC,KAAK,SAAS9uH,EAAQU,EAAOJ,GmKpnvBrE,GAAAm4G,GAAAz4G,EAAA,aACA24G,EAAA34G,EAAA,YACAi+G,EAAAj+G,EAAA,cACA+uH,EAAA,KAEAC,EAAA,SAAA7nE,EAAAt8C,EAAAokH,EAAArkH,GACA,GAAAyyG,GAAAt6G,OAAAk7G,EAAA92D,IACA+nE,EAAA,IAAArkH,CAEA,OADA,KAAAokH,IAAAC,GAAA,IAAAD,EAAA,KAAAlsH,OAAA6H,GAAArG,QAAAwqH,EAAA,UAAA,KACAG,EAAA,IAAA7R,EAAA,KAAAxyG,EAAA,IAEAnK,GAAAJ,QAAA,SAAA01G,EAAAzmG,GACA,GAAA0/F,KACAA,GAAA+G,GAAAzmG,EAAAy/G,GACAvW,EAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAqE,EAAA,WACA,GAAAprG,GAAA,GAAAyoG,GAAA,IACA,OAAAzoG,KAAAA,EAAA0vC,eAAA1vC,EAAAT,MAAA,KAAAtM,OAAA,IACA,SAAAyuG,MnKwnvBGsP,aAAa,GAAG1E,YAAY,GAAGC,WAAW,KAAKqV,KAAK,SAASnvH,EAAQU,EAAOJ,GoKxovB/E,GAAAywG,GAAA/wG,EAAA,gBACA0yD,EAAA1yD,EAAA,oBACAi+G,EAAAj+G,EAAA,aAEAU,GAAAJ,QAAA,SAAA2yG,EAAAvgC,EAAA08C,EAAAjtF,GACA,GAAAk7E,GAAAt6G,OAAAk7G,EAAAhL,IACAoc,EAAAhS,EAAA78G,OACA8uH,EAAA3mH,SAAAymH,EAAA,IAAArsH,OAAAqsH,GACAG,EAAAxe,EAAAr+B,EACA,IAAA28C,GAAAE,GAAA,IAAAD,EAAA,MAAAjS,EACA,IAAAmS,GAAAD,EAAAF,EACAI,EAAA/8D,EAAAnyD,KAAA+uH,EAAAprH,KAAAwrH,KAAAF,EAAAF,EAAA9uH,QAEA,OADAivH,GAAAjvH,OAAAgvH,IAAAC,EAAAA,EAAAxtH,MAAA,EAAAutH,IACArtF,EAAAstF,EAAApS,EAAAA,EAAAoS,KpK6ovBGlR,aAAa,GAAGoR,mBAAmB,IAAIve,eAAe,MAAMwe,KAAK,SAAS5vH,EAAQU,EAAOJ,GqK3pvB5F,YACA,IAAAmuH,GAAAzuH,EAAA,iBACAi+G,EAAAj+G,EAAA,aAEAU,GAAAJ,QAAA,SAAAo3C,GACA,GAAAi0E,GAAA5oH,OAAAk7G,EAAAz3G,OACAoY,EAAA,GACAlf,EAAA+uH,EAAA/2E,EACA,IAAA,EAAAh4C,GAAAA,GAAAk2E,EAAAA,EAAA,KAAAulC,YAAA,0BACA,MAAAz7G,EAAA,GAAAA,KAAA,KAAAisH,GAAAA,GAAA,EAAAjsH,IAAAkf,GAAA+sG,EACA,OAAA/sG,MrK+pvBG2/F,aAAa,GAAGmQ,gBAAgB,MAAMmB,KAAK,SAAS7vH,EAAQU,EAAOJ,GsKzqvBtE,GAAAm4G,GAAAz4G,EAAA,aACAi+G,EAAAj+G,EAAA,cACA24G,EAAA34G,EAAA,YACA8vH,EAAA9vH,EAAA,gBACAy+C,EAAA,IAAAqxE,EAAA,IACAC,EAAA,KACAC,EAAAxrH,OAAA,IAAAi6C,EAAAA,EAAA,KACAwxE,EAAAzrH,OAAAi6C,EAAAA,EAAA,MAEAyxE,EAAA,SAAA9W,EAAA7pG,EAAA4gH,GACA,GAAAxpG,MACAypG,EAAAzX,EAAA,WACA,QAAAmX,EAAA1W,MAAA2W,EAAA3W,MAAA2W,IAEAvb,EAAA7tF,EAAAyyF,GAAAgX,EAAA7gH,EAAA+tF,GAAAwyB,EAAA1W,EACA+W,KAAAxpG,EAAAwpG,GAAA3b,GACAiE,EAAAA,EAAA8E,EAAA9E,EAAAnE,EAAA8b,EAAA,SAAAzpG,IAMA22E,EAAA4yB,EAAA5yB,KAAA,SAAAn2C,EAAAqrD,GAIA,MAHArrD,GAAApkD,OAAAk7G,EAAA92D,IACA,EAAAqrD,IAAArrD,EAAAA,EAAA5iD,QAAAyrH,EAAA,KACA,EAAAxd,IAAArrD,EAAAA,EAAA5iD,QAAA0rH,EAAA,KACA9oE,EAGAzmD,GAAAJ,QAAA4vH,ItK4qvBG3R,aAAa,GAAG1E,YAAY,GAAGC,WAAW,GAAG+R,eAAe,MAAMwE,KAAK,SAASrwH,EAAQU,EAAOJ,GuKzsvBlGI,EAAAJ,QAAA,uDvK6svBMgwH,KAAK,SAAStwH,EAAQU,EAAOJ,GwK7svBnC,GAaAiwH,GAAAC,EAAAt9F,EAbAkuC,EAAAphE,EAAA,UACAk0G,EAAAl0G,EAAA,aACAywH,EAAAzwH,EAAA,WACA0wH,EAAA1wH,EAAA,iBACA+uG,EAAA/uG,EAAA,aACA+mH,EAAAhY,EAAAgY,QACA4J,EAAA5hB,EAAA6hB,aACAC,EAAA9hB,EAAA+hB,eACAC,EAAAhiB,EAAAgiB,eACAC,EAAAjiB,EAAAiiB,SACAC,EAAA,EACAzoB,KACA0oB,EAAA,qBAEArtD,EAAA,WACA,GAAA51D,IAAAzH,IAEA,IAAAgiG,EAAArlD,eAAAl1C,GAAA,CACA,GAAAumG,GAAAhM,EAAAv6F,SACAu6F,GAAAv6F,GACAumG,MAGAj8B,EAAA,SAAA44C,GACAttD,EAAAtjE,KAAA4wH,EAAAvvH,MAGA+uH,IAAAE,IACAF,EAAA,SAAAnc,GAGA,IAFA,GAAAD,MACAt0G,EAAA,EACAirD,UAAA1qD,OAAAP,GAAAs0G,EAAA7wG,KAAAwnD,UAAAjrD,KAMA,OALAuoG,KAAAyoB,GAAA,WAEA/c,EAAA,kBAAAM,GAAAA,EAAAlF,SAAAkF,GAAAD,IAEAgc,EAAAU,GACAA,GAEAJ,EAAA,SAAA5iH,SACAu6F,GAAAv6F,IAGA,WAAAjO,EAAA,UAAA+mH,GACAwJ,EAAA,SAAAtiH,GACA84G,EAAAK,SAAAhmD,EAAAyC,EAAA51D,EAAA,KAGA+iH,GAAAA,EAAAt7G,IACA66G,EAAA,SAAAtiH,GACA+iH,EAAAt7G,IAAA0rD,EAAAyC,EAAA51D,EAAA,KAGA8iH,GACAP,EAAA,GAAAO,GACA79F,EAAAs9F,EAAAY,MACAZ,EAAAa,MAAA38F,UAAA6jD,EACAg4C,EAAAnvD,EAAAluC,EAAA0B,YAAA1B,EAAA,IAGA67E,EAAA/mF,kBAAA,kBAAA4M,eAAAm6E,EAAAuiB,eACAf,EAAA,SAAAtiH,GACA8gG,EAAAn6E,YAAA3mB,EAAA,GAAA,MAEA8gG,EAAA/mF,iBAAA,UAAAuwD,GAAA,IAGAg4C,EADAW,IAAAR,GAAA,UACA,SAAAziH,GACAwiH,EAAAjuG,YAAAkuG,EAAA,WAAAQ,GAAA,WACAT,EAAAvlG,YAAA1kB,MACAq9D,EAAAtjE,KAAA0N,KAKA,SAAAA,GACAwS,WAAA2gD,EAAAyC,EAAA51D,EAAA,GAAA,KAIAvN,EAAAJ,SACAqzB,IAAAg9F,EACArjE,MAAAujE,KxKitvBG5gB,SAAS,GAAGkD,SAAS,GAAGoN,gBAAgB,GAAGxG,YAAY,GAAGmP,UAAU,IAAIvU,YAAY,MAAM4c,KAAK,SAASvxH,EAAQU,EAAOJ,GyKnyvB1H,GAAAmuH,GAAAzuH,EAAA,iBACAsG,EAAApC,KAAAoC,IACAnC,EAAAD,KAAAC,GACAzD,GAAAJ,QAAA,SAAAiG,EAAA/F,GAEA,MADA+F,GAAAkoH,EAAAloH,GACA,EAAAA,EAAAD,EAAAC,EAAA/F,EAAA,GAAA2D,EAAAoC,EAAA/F,MzKuyvBGkuH,gBAAgB,MAAM8C,KAAK,SAASxxH,EAAQU,EAAOJ,G0K3yvBtD,GAAAmuH,GAAAzuH,EAAA,iBACA+wG,EAAA/wG,EAAA,eACAU,GAAAJ,QAAA,SAAAg9B,GACA,GAAA30B,SAAA20B,EAAA,MAAA,EACA,IAAAm0F,GAAAhD,EAAAnxF,GACA98B,EAAAuwG,EAAA0gB,EACA,IAAAA,IAAAjxH,EAAA,KAAA26G,YAAA,gBACA,OAAA36G,M1KgzvBGkuH,gBAAgB,IAAItd,eAAe,MAAMsgB,KAAK,SAAS1xH,EAAQU,EAAOJ,G2KvzvBzE,GAAAovH,GAAAxrH,KAAAwrH,KACA3kC,EAAA7mF,KAAA6mF,KACArqF,GAAAJ,QAAA,SAAAg9B,GACA,MAAAnkB,OAAAmkB,GAAAA,GAAA,GAAAA,EAAA,EAAAytD,EAAA2kC,GAAApyF,S3K4zvBMq0F,KAAK,SAAS3xH,EAAQU,EAAOJ,G4K/zvBnC,GAAAgyG,GAAAtyG,EAAA,cACAi+G,EAAAj+G,EAAA,aACAU,GAAAJ,QAAA,SAAAg9B,GACA,MAAAg1E,GAAA2L,EAAA3gF,O5Ko0vBGihF,aAAa,GAAGnL,aAAa,MAAMwe,KAAK,SAAS5xH,EAAQU,EAAOJ,G6Kv0vBnE,GAAAmuH,GAAAzuH,EAAA,iBACAmE,EAAAD,KAAAC,GACAzD,GAAAJ,QAAA,SAAAg9B,GACA,MAAAA,GAAA,EAAAn5B,EAAAsqH,EAAAnxF,GAAA,kBAAA,K7K40vBGoxF,gBAAgB,MAAMmD,KAAK,SAAS7xH,EAAQU,EAAOJ,G8K/0vBtD,GAAA29G,GAAAj+G,EAAA,aACAU,GAAAJ,QAAA,SAAAg9B,GACA,MAAA4lB,QAAA+6D,EAAA3gF,O9Ko1vBGihF,aAAa,KAAKuT,KAAK,SAAS9xH,EAAQU,EAAOJ,G+Kt1vBlD,GAAAowG,GAAA1wG,EAAA,eAGAU,GAAAJ,QAAA,SAAAg9B,EAAA+/E,GACA,IAAA3M,EAAApzE,GAAA,MAAAA,EACA,IAAAk3E,GAAAnH,CACA,IAAAgQ,GAAA,mBAAA7I,EAAAl3E,EAAAz6B,YAAA6tG,EAAArD,EAAAmH,EAAAj0G,KAAA+8B,IAAA,MAAA+vE,EACA,IAAA,mBAAAmH,EAAAl3E,EAAAy0F,WAAArhB,EAAArD,EAAAmH,EAAAj0G,KAAA+8B,IAAA,MAAA+vE,EACA,KAAAgQ,GAAA,mBAAA7I,EAAAl3E,EAAAz6B,YAAA6tG,EAAArD,EAAAmH,EAAAj0G,KAAA+8B,IAAA,MAAA+vE,EACA,MAAA32C,WAAA,8C/K21vBGi6C,eAAe,MAAMqhB,KAAK,SAAShyH,EAAQU,EAAOJ,GgLr2vBrD,YACA,IAAAN,EAAA,kBAAA,CACA,GAAA2hH,GAAA3hH,EAAA,cACA+uG,EAAA/uG,EAAA,aACA24G,EAAA34G,EAAA,YACAy4G,EAAAz4G,EAAA,aACAiyH,EAAAjyH,EAAA,YACAkyH,EAAAlyH,EAAA,mBACAohE,EAAAphE,EAAA,UACAq1G,EAAAr1G,EAAA,kBACAmyH,EAAAnyH,EAAA,oBACA+8G,EAAA/8G,EAAA,WACAo1G,EAAAp1G,EAAA,mBACAyuH,EAAAzuH,EAAA,iBACA+wG,EAAA/wG,EAAA,gBACAoyH,EAAApyH,EAAA,eACA8wG,EAAA9wG,EAAA,wBACA47G,EAAA57G,EAAA,mBACAs2G,EAAAt2G,EAAA,UACAu3G,EAAAv3G,EAAA,cACA0wG,EAAA1wG,EAAA,gBACA6wG,EAAA7wG,EAAA,gBACAy/G,EAAAz/G,EAAA,oBACA86D,EAAA96D,EAAA,oBACAuvF,EAAAvvF,EAAA,iBACAgqH,EAAAhqH,EAAA,kBAAAE,EACAw/G,EAAA1/G,EAAA,8BACAkuH,EAAAluH,EAAA,UACAk+G,EAAAl+G,EAAA,UACA63G,EAAA73G,EAAA,oBACAqyH,EAAAryH,EAAA,qBACA+zG,EAAA/zG,EAAA,0BACAsyH,EAAAtyH,EAAA,wBACA+gH,EAAA/gH,EAAA,gBACA44G,EAAA54G,EAAA,kBACAu1G,EAAAv1G,EAAA,kBACAuyH,EAAAvyH,EAAA,iBACAwyH,EAAAxyH,EAAA,wBACAyyH,EAAAzyH,EAAA,gBACA0yH,EAAA1yH,EAAA,kBACAm1G,EAAAsd,EAAAvyH,EACA2pH,EAAA6I,EAAAxyH,EACAi7G,EAAApM,EAAAoM,WACAzkD,EAAAq4C,EAAAr4C,UACAh0D,EAAAqsG,EAAArsG,WACAiwH,EAAA,cACAC,EAAA,SAAAD,EACAE,EAAA,oBACA7V,EAAA,YACA5M,EAAAn0D,MAAA+gE,GACA8V,EAAAZ,EAAAhxG,YACA6xG,EAAAb,EAAAc,SACAC,EAAApb,EAAA,GACAqb,GAAArb,EAAA,GACAsb,GAAAtb,EAAA,GACAub,GAAAvb,EAAA,GACAE,GAAAF,EAAA,GACAG,GAAAH,EAAA,GACAwb,GAAAhB,GAAA,GACAlmF,GAAAkmF,GAAA,GACAiB,GAAAhB,EAAA1P,OACA2Q,GAAAjB,EAAAxoE,KACA0pE,GAAAlB,EAAAjZ,QACAoa,GAAArjB,EAAAzH,YACA+qB,GAAAtjB,EAAA36B,OACAk+C,GAAAvjB,EAAAwjB,YACAC,GAAAzjB,EAAApxD,KACA80E,GAAA1jB,EAAA5oG,KACA2sG,GAAA/D,EAAAnuG,MACA8xH,GAAA3jB,EAAAvtG,SACAmxH,GAAA5jB,EAAA6jB,eACAriB,GAAAsM,EAAA,YACAlT,GAAAkT,EAAA,eACAgW,GAAAhG,EAAA,qBACAiG,GAAAjG,EAAA,mBACAkG,GAAAnC,EAAAoC,OACAC,GAAArC,EAAAsC,MACAC,GAAAvC,EAAAuC,KACAC,GAAA,gBAEAC,GAAA7c,EAAA,EAAA,SAAA5I,EAAAzuG,GACA,MAAAm0H,IAAA5gB,EAAA9E,EAAAA,EAAAklB,KAAA3zH,KAGAo0H,GAAAjc,EAAA,WAEA,MAAA,KAAA,GAAAj2G,GAAA,GAAAwa,cAAA,IAAArU,QAAA,KAGAgsH,KAAAnyH,KAAAA,EAAAs6G,GAAArpF,KAAAglF,EAAA,WACA,GAAAj2G,GAAA,GAAAixB,UAGAmhG,GAAA,SAAAx3F,EAAAy3F,GACA,GAAAj0H,GAAA2tH,EAAAnxF,EACA,IAAA,EAAAx8B,GAAAA,EAAAi0H,EAAA,KAAA5Z,GAAA,gBACA,OAAAr6G,IAGA40G,GAAA,SAAAp4E,GACA,GAAAozE,EAAApzE,IAAAg3F,KAAAh3F,GAAA,MAAAA,EACA,MAAAo5B,GAAAp5B,EAAA,2BAGAq3F,GAAA,SAAAriG,EAAA9xB,GACA,KAAAkwG,EAAAp+E,IAAA4hG,KAAA5hG,IACA,KAAAokC,GAAA,uCACA,OAAA,IAAApkC,GAAA9xB,IAGAw0H,GAAA,SAAA/lB,EAAA38B,GACA,MAAA2iD,IAAAlhB,EAAA9E,EAAAA,EAAAklB,KAAA7hD,IAGA2iD,GAAA,SAAA3iG,EAAAggD,GAIA,IAHA,GAAA/rE,GAAA,EACA/F,EAAA8xE,EAAA9xE,OACA6D,EAAAswH,GAAAriG,EAAA9xB,GACAA,EAAA+F,GAAAlC,EAAAkC,GAAA+rE,EAAA/rE,IACA,OAAAlC,IAGA6wH,GAAA,SAAA53F,EAAA1oB,EAAAugH,GACAhgB,EAAA73E,EAAA1oB,GAAAk7B,IAAA,WAAA,MAAAtpC,MAAA6vD,GAAA8+D,OAGAC,GAAA,SAAAj3F,GACA,GAKAl+B,GAAAO,EAAAoiH,EAAAv+G,EAAA+K,EAAA4O,EALAixF,EAAA4B,EAAA1yE,GACAozE,EAAArmD,UAAA1qD,OACA60H,EAAA9jB,EAAA,EAAArmD,UAAA,GAAAviD,OACA+qB,EAAA/qB,SAAA0sH,EACAxV,EAAAH,EAAAzQ,EAEA,IAAAtmG,QAAAk3G,IAAAJ,EAAAI,GAAA,CACA,IAAA7hG,EAAA6hG,EAAAt/G,KAAA0uG,GAAA2T,KAAA3iH,EAAA,IAAAmP,EAAA4O,EAAAkZ,QAAAC,KAAAl3B,IACA2iH,EAAAl/G,KAAA0L,EAAAxE,MACAqkG,GAAA2T,EAGA,IADAlvF,GAAA69E,EAAA,IAAA8jB,EAAAj0D,EAAAi0D,EAAAnqE,UAAA,GAAA,IACAjrD,EAAA,EAAAO,EAAAuwG,EAAA9B,EAAAzuG,QAAA6D,EAAAswH,GAAAnuH,KAAAhG,GAAAA,EAAAP,EAAAA,IACAoE,EAAApE,GAAAyzB,EAAA2hG,EAAApmB,EAAAhvG,GAAAA,GAAAgvG,EAAAhvG,EAEA,OAAAoE,IAGAixH,GAAA,WAIA,IAHA,GAAA/uH,GAAA,EACA/F,EAAA0qD,UAAA1qD,OACA6D,EAAAswH,GAAAnuH,KAAAhG,GACAA,EAAA+F,GAAAlC,EAAAkC,GAAA2kD,UAAA3kD,IACA,OAAAlC,IAIAkxH,KAAA7yH,GAAAi2G,EAAA,WAAAqb,GAAAzzH,KAAA,GAAAmC,GAAA,MAEA8yH,GAAA,WACA,MAAAxB,IAAAx6C,MAAA+7C,GAAAphB,GAAA5zG,KAAAm1G,GAAAlvG,OAAAkvG,GAAAlvG,MAAA0kD,YAGA/3B,IACA69E,WAAA,SAAA9nE,EAAAn8B,GACA,MAAAylH,GAAAjyH,KAAAm1G,GAAAlvG,MAAA0iC,EAAAn8B,EAAAm+C,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEA8sH,MAAA,SAAAziB,GACA,MAAAogB,IAAA1d,GAAAlvG,MAAAwsG,EAAA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAqwC,KAAA,SAAApuC,GACA,MAAA2nH,GAAA/4C,MAAAk8B,GAAAlvG,MAAA0kD,YAEA11C,OAAA,SAAAw9F,GACA,MAAAgiB,IAAAxuH,KAAA0sH,GAAAxd,GAAAlvG,MAAAwsG,EACA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,UAEAkiD,KAAA,SAAA6qE,GACA,MAAA3d,IAAArC,GAAAlvG,MAAAkvH,EAAAxqE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAgtH,UAAA,SAAAD,GACA,MAAA1d,IAAAtC,GAAAlvG,MAAAkvH,EAAAxqE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAyZ,QAAA,SAAA4wF,GACAigB,EAAAvd,GAAAlvG,MAAAwsG,EAAA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAnF,QAAA,SAAAoyH,GACA,MAAAzpF,IAAAupE,GAAAlvG,MAAAovH,EAAA1qE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAktH,SAAA,SAAAD,GACA,MAAAvC,IAAA3d,GAAAlvG,MAAAovH,EAAA1qE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAq2C,KAAA,SAAA82E,GACA,MAAAjC,IAAAr6C,MAAAk8B,GAAAlvG,MAAA0kD,YAEAy9C,YAAA,SAAAitB,GACA,MAAAnC,IAAAj6C,MAAAk8B,GAAAlvG,MAAA0kD,YAEAr9C,IAAA,SAAAwnH,GACA,MAAAX,IAAAhf,GAAAlvG,MAAA6uH,EAAAnqE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEA8sE,OAAA,SAAAu9B,GACA,MAAA0gB,IAAAl6C,MAAAk8B,GAAAlvG,MAAA0kD,YAEA0oE,YAAA,SAAA5gB,GACA,MAAA2gB,IAAAn6C,MAAAk8B,GAAAlvG,MAAA0kD,YAEA9lB,QAAA,WAMA,IALA,GAIAx6B,GAJAqoG,EAAAzsG,KACAhG,EAAAk1G,GAAAzC,GAAAzyG,OACAu1H,EAAA7xH,KAAA6mF,MAAAvqF,EAAA,GACA+F,EAAA,EAEAwvH,EAAAxvH,GACAqE,EAAAqoG,EAAA1sG,GACA0sG,EAAA1sG,KAAA0sG,IAAAzyG,GACAyyG,EAAAzyG,GAAAoK,CACA,OAAAqoG,IAEA7Y,KAAA,SAAA4Y,GACA,MAAAmgB,IAAAzd,GAAAlvG,MAAAwsG,EAAA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,SAEAnB,KAAA,SAAAwuH,GACA,MAAAlC,IAAAvzH,KAAAm1G,GAAAlvG,MAAAwvH,IAEAC,SAAA,SAAAC,EAAAjpH,GACA,GAAAgiG,GAAAyG,GAAAlvG,MACAhG,EAAAyuG,EAAAzuG,OACA21H,EAAArlB,EAAAolB,EAAA11H,EACA,OAAA,KAAAuzG,EAAA9E,EAAAA,EAAAklB,MACAllB,EAAApmG,OACAomG,EAAAmnB,WAAAD,EAAAlnB,EAAA4jB,kBACA9hB,GAAApoG,SAAAsE,EAAAzM,EAAAswG,EAAA7jG,EAAAzM,IAAA21H,MAKAE,GAAA,SAAAtpH,EAAAE,GACA,MAAA+nH,IAAAxuH,KAAA2tG,GAAA5zG,KAAAm1G,GAAAlvG,MAAAuG,EAAAE,KAGAqpH,GAAA,SAAAC,GACA7gB,GAAAlvG,KACA,IAAA1F,GAAAg0H,GAAA5pE,UAAA,GAAA,GACA1qD,EAAAgG,KAAAhG,OACAmrB,EAAAklF,EAAA0lB,GACA/tF,EAAAuoE,EAAAplF,EAAAnrB,QACA+F,EAAA,CACA,IAAAiiC,EAAA1nC,EAAAN,EAAA,KAAA26G,GAAAsZ,GACA,MAAAjsF,EAAAjiC,GAAAC,KAAA1F,EAAAyF,GAAAolB,EAAAplB,MAGAiwH,IACAnd,QAAA,WACA,MAAAma,IAAAjzH,KAAAm1G,GAAAlvG,QAEAsjD,KAAA,WACA,MAAAypE,IAAAhzH,KAAAm1G,GAAAlvG,QAEAo8G,OAAA,WACA,MAAA0Q,IAAA/yH,KAAAm1G,GAAAlvG,SAIAiwH,GAAA,SAAAvtF,EAAAt0B,GACA,MAAA87F,GAAAxnE,IACAA,EAAAorF,KACA,gBAAA1/G,IACAA,IAAAs0B,IACAnmC,QAAA6R,IAAA7R,OAAA6R,IAEA8hH,GAAA,SAAAxtF,EAAAt0B,GACA,MAAA6hH,IAAAvtF,EAAAt0B,EAAAgnG,EAAAhnG,GAAA,IACAu9G,EAAA,EAAAjpF,EAAAt0B,IACAi1G,EAAA3gF,EAAAt0B,IAEA+hH,GAAA,SAAAztF,EAAAt0B,EAAA+lC,GACA,QAAA87E,GAAAvtF,EAAAt0B,EAAAgnG,EAAAhnG,GAAA,KACA87F,EAAA/1D,IACA27D,EAAA37D,EAAA,WACA27D,EAAA37D,EAAA,QACA27D,EAAA37D,EAAA,QAEAA,EAAAi0C,cACA0nB,EAAA37D,EAAA,cAAAA,EAAAg0C,UACA2nB,EAAA37D,EAAA,gBAAAA,EAAA+zC,WAIAymB,EAAAjsE,EAAAt0B,EAAA+lC,IAFAzR,EAAAt0B,GAAA+lC,EAAA/vC,MACAs+B,GAIAkrF,MACA1B,EAAAxyH,EAAAw2H,GACAjE,EAAAvyH,EAAAy2H,IAGAle,EAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA8f,GAAA,UACAtK,yBAAA4M,GACA1gE,eAAA2gE,KAGAhe,EAAA,WAAAob,GAAAxzH,aACAwzH,GAAAC,GAAA,WACA,MAAAH,IAAAtzH,KAAAiG,OAIA,IAAAowH,IAAAxhB,KAAAjiF,GACAiiF,GAAAwhB,GAAAJ,IACAzZ,EAAA6Z,GAAAhlB,GAAA4kB,GAAA5T,QACAxN,EAAAwhB,IACA30H,MAAAo0H,GACA1iG,IAAA2iG,GACAp4G,YAAA,aACArb,SAAAkxH,GACAE,eAAAuB,KAEAN,GAAA0B,GAAA,SAAA,KACA1B,GAAA0B,GAAA,aAAA,KACA1B,GAAA0B,GAAA,aAAA,KACA1B,GAAA0B,GAAA,SAAA,KACAzhB,EAAAyhB,GAAA5rB,IACAl7D,IAAA,WAAA,MAAAtpC,MAAA8tH,OAIA5zH,EAAAJ,QAAA,SAAA84G,EAAA2b,EAAAhf,EAAA8gB,GACAA,IAAAA,CACA,IAAA7gB,GAAAoD,GAAAyd,EAAA,UAAA,IAAA,QACAC,EAAA,MAAA1d,EACA2d,EAAA,MAAA3d,EACA4d,EAAAjoB,EAAAiH,GACAkD,EAAA8d,MACAlsB,EAAAksB,GAAAznC,EAAAynC,GACA5U,GAAA4U,IAAA/E,EAAAgF,IACAhoB,KACAioB,EAAAF,GAAAA,EAAAha,GACAma,EAAA,SAAAlkB,EAAA1sG,GACA,GAAA3E,GAAAqxG,EAAA58C,EACA,OAAAz0D,GAAAL,EAAAu1H,GAAAvwH,EAAAwuH,EAAAnzH,EAAA/B,EAAA+0H,KAEAwC,EAAA,SAAAnkB,EAAA1sG,EAAAqE,GACA,GAAAhJ,GAAAqxG,EAAA58C,EACAwgE,KAAAjsH,GAAAA,EAAA1G,KAAAsd,MAAA5W,IAAA,EAAA,EAAAA,EAAA,IAAA,IAAA,IAAAA,GACAhJ,EAAAL,EAAAw1H,GAAAxwH,EAAAwuH,EAAAnzH,EAAA/B,EAAA+K,EAAAgqH,KAEAyC,EAAA,SAAApkB,EAAA1sG,GACA4uG,EAAAlC,EAAA1sG,GACAupC,IAAA,WACA,MAAAqnF,GAAA3wH,KAAAD,IAEAotB,IAAA,SAAA/oB,GACA,MAAAwsH,GAAA5wH,KAAAD,EAAAqE,IAEA8jF,YAAA,IAGA0zB,IACA4U,EAAAjhB,EAAA,SAAA9C,EAAArxG,EAAA01H,EAAAC,GACAliB,EAAApC,EAAA+jB,EAAAhhB,EAAA,KACA,IAEAntG,GAAApG,EAAAjC,EAAAg3H,EAFAjxH,EAAA,EACAzF,EAAA,CAEA,IAAA4vG,EAAA9uG,GAIA,CAAA,KAAAA,YAAAkxH,KAAA0E,EAAAjgB,EAAA31G,KAAA+wH,GAAA6E,GAAA5E,GAaA,MAAA0B,MAAA1yH,GACAqzH,GAAA+B,EAAAp1H,GAEAwzH,GAAA70H,KAAAy2H,EAAAp1H,EAfAiH,GAAAjH,EACAd,EAAAg0H,GAAAwC,EAAAvC,EACA,IAAA0C,GAAA71H,EAAAa,UACA,IAAAkG,SAAA4uH,EAAA,CACA,GAAAE,EAAA1C,EAAA,KAAA5Z,GAAAsZ,GAEA,IADAhyH,EAAAg1H,EAAA32H,EACA,EAAA2B,EAAA,KAAA04G,GAAAsZ,QAGA,IADAhyH,EAAAsuG,EAAAwmB,GAAAxC,EACAtyH,EAAA3B,EAAA22H,EAAA,KAAAtc,GAAAsZ,GAEAj0H,GAAAiC,EAAAsyH,MAfAv0H,GAAA4xH,EAAAxwH,GACAa,EAAAjC,EAAAu0H,EACAlsH,EAAA,GAAAiqH,GAAArwH,EA0BA,KAPAs6G,EAAA9J,EAAA,MACA/xG,EAAA2H,EACAhJ,EAAAiB,EACAT,EAAAoC,EACAjD,EAAAgB,EACAe,EAAA,GAAAwxH,GAAAlqH,KAEArI,EAAA+F,GAAA8wH,EAAApkB,EAAA1sG,OAEA2wH,EAAAF,EAAAha,GAAAliD,EAAA87D,IACA7Z,EAAAma,EAAA,cAAAF,IACAre,EAAA,WACAqe,EAAA,MACAre,EAAA,WACA,GAAAqe,GAAA,OACApe,EAAA,SAAAjH,GACA,GAAAqlB,GACA,GAAAA,GAAA,MACA,GAAAA,GAAA,KACA,GAAAA,GAAArlB,KACA,KACAqlB,EAAAjhB,EAAA,SAAA9C,EAAArxG,EAAA01H,EAAAC,GACAliB,EAAApC,EAAA+jB,EAAAhhB,EACA,IAAAwhB,EAGA,OAAA9mB,GAAA9uG,GACAA,YAAAkxH,KAAA0E,EAAAjgB,EAAA31G,KAAA+wH,GAAA6E,GAAA5E,EACAjqH,SAAA4uH,EACA,GAAAre,GAAAt3G,EAAAkzH,GAAAwC,EAAAvC,GAAAwC,GACA5uH,SAAA2uH,EACA,GAAApe,GAAAt3G,EAAAkzH,GAAAwC,EAAAvC,IACA,GAAA7b,GAAAt3G,GAEA0yH,KAAA1yH,GAAAqzH,GAAA+B,EAAAp1H,GACAwzH,GAAA70H,KAAAy2H,EAAAp1H,GATA,GAAAs3G,GAAAkZ,EAAAxwH,MAWAqxH,EAAAnoB,IAAAwE,SAAAnpG,UAAA6jH,EAAA9Q,GAAA5vD,OAAA0gE,EAAAlf,IAAAkf,EAAA9Q,GAAA,SAAAtkG,GACAA,IAAAoiH,IAAAja,EAAAia,EAAApiH,EAAAskG,EAAAtkG,MAEAoiH,EAAAha,GAAAka,EACAvV,IAAAuV,EAAAh5G,YAAA84G,GAEA,IAAAU,GAAAR,EAAAtlB,IACA+lB,IAAAD,IACA,UAAAA,EAAAp0H,MAAAqF,QAAA+uH,EAAAp0H,MACAs0H,EAAApB,GAAA5T,MACA7F,GAAAia,EAAA9C,IAAA,GACAnX,EAAAma,EAAA5C,GAAAte,GACA+G,EAAAma,EAAA1C,IAAA,GACAzX,EAAAma,EAAA/C,GAAA6C,IAEAH,EAAA,GAAAG,GAAA,GAAAhsB,KAAAgL,EAAAhL,KAAAksB,KACA/hB,EAAA+hB,EAAAlsB,IACAl7D,IAAA,WAAA,MAAAkmE,MAIA/G,EAAA+G,GAAAghB,EAEAve,EAAAA,EAAAlmF,EAAAkmF,EAAAmB,EAAAnB,EAAAnE,GAAA0iB,GAAA9d,GAAAjK,GAEAwJ,EAAAA,EAAA4E,EAAArH,GACA6c,kBAAAkC,IAGAtc,EAAAA,EAAA4E,EAAA5E,EAAAnE,EAAAqE,EAAA,WAAAO,EAAAzhC,GAAAl3E,KAAAy2H,EAAA,KAAAhhB,GACAl4B,KAAAs3C,GACA39C,GAAA69C,KAGAzC,IAAAqE,IAAAna,EAAAma,EAAArE,EAAAkC,GAEAtc,EAAAA,EAAA8E,EAAAvH,EAAA7iF,IAEAoiF,EAAAS,GAEAyC,EAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAugB,GAAA7e,GAAAriF,IAAA2iG,KAEA7d,EAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAqjB,EAAA3hB,EAAAwgB,IAEA7U,GAAAuV,EAAAr0H,UAAAkxH,KAAAmD,EAAAr0H,SAAAkxH,IAEAtb,EAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAqE,EAAA,WACA,GAAAqe,GAAA,GAAA/0H,UACA+zG,GAAA/zG,MAAAo0H,KAEA5d,EAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAqE,EAAA,WACA,OAAA,EAAA,GAAAsb,kBAAA,GAAA+C,IAAA,EAAA,IAAA/C,qBACAtb,EAAA,WACAue,EAAAjD,eAAA1zH,MAAA,EAAA,OACAy1G,GAAAie,eAAAuB,KAEAzU,EAAA/K,GAAA2hB,EAAAD,EAAAE,EACAjW,GAAAgW,GAAA5a,EAAAma,EAAAtlB,GAAAgmB,QAEAl3H,GAAAJ,QAAA,ehLw2vBGs2G,iBAAiB,GAAGihB,uBAAuB,GAAGC,gBAAgB,GAAG/M,oBAAoB,GAAGzS,mBAAmB,GAAGb,aAAa,GAAGtE,SAAS,GAAG0D,iBAAiB,GAAGgD,YAAY,GAAGC,WAAW,GAAGC,YAAY,GAAGxB,SAAS,IAAIlI,UAAU,IAAIyP,mBAAmB,IAAInP,eAAe,IAAIsJ,iBAAiB,IAAI+G,eAAe,IAAI8B,aAAa,IAAI7L,mBAAmB,IAAIC,eAAe,IAAI2W,iBAAiB,IAAIzD,iBAAiB,IAAIrH,gBAAgB,IAAIrI,mBAAmB,IAAIvD,kBAAkB,IAAIC,iBAAiB,IAAI2gB,yBAAyB,IAAI5mB,uBAAuB,IAAI6mB,cAAc,IAAItJ,gBAAgB,IAAItd,eAAe,IAAIC,eAAe,IAAI0K,kBAAkB,IAAIkc,WAAW,IAAIC,kBAAkB,IAAI5S,SAAS,IAAIhV,SAAS,IAAI0P,6BAA6B,IAAImY,uBAAuB,MAAMC,KAAK,SAASp4H,EAAQU,EAAOJ,GiLv0wBzyB,YAyCA,SAAA+3H,GAAAztH,EAAA0tH,EAAAC,GACA,GAOA/4H,GAAA8P,EAAAzI,EAPAgC,EAAAozC,MAAAs8E,GACAC,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAE,EAAA,KAAAL,EAAAh+C,EAAA,EAAA,KAAAA,EAAA,EAAA,KAAA,EACAr6E,EAAA,EACAL,EAAA,EAAAgL,GAAA,IAAAA,GAAA,EAAA,EAAAA,EAAA,EAAA,CAkCA,KAhCAA,EAAA21B,EAAA31B,GAEAA,GAAAA,GAAAA,IAAAgrE,GAEAtmE,EAAA1E,GAAAA,EAAA,EAAA,EACApL,EAAAi5H,IAEAj5H,EAAAurF,EAAA90E,EAAArL,GAAAguH,GACAhuH,GAAA/D,EAAAyzE,EAAA,GAAA96E,IAAA,IACAA,IACAqH,GAAA,GAGA+D,GADApL,EAAAk5H,GAAA,EACAC,EAAA9xH,EAEA8xH,EAAAr+C,EAAA,EAAA,EAAAo+C,GAEA9tH,EAAA/D,GAAA,IACArH,IACAqH,GAAA,GAEArH,EAAAk5H,GAAAD,GACAnpH,EAAA,EACA9P,EAAAi5H,GACAj5H,EAAAk5H,GAAA,GACAppH,GAAA1E,EAAA/D,EAAA,GAAAyzE,EAAA,EAAAg+C,GACA94H,GAAAk5H,IAEAppH,EAAA1E,EAAA0vE,EAAA,EAAAo+C,EAAA,GAAAp+C,EAAA,EAAAg+C,GACA94H,EAAA,IAGA84H,GAAA,EAAAzvH,EAAA5I,KAAA,IAAAqP,EAAAA,GAAA,IAAAgpH,GAAA,GAGA,IAFA94H,EAAAA,GAAA84H,EAAAhpH,EACAkpH,GAAAF,EACAE,EAAA,EAAA3vH,EAAA5I,KAAA,IAAAT,EAAAA,GAAA,IAAAg5H,GAAA,GAEA,MADA3vH,KAAA5I,IAAA,IAAAL,EACAiJ,EAEA,QAAAgwH,GAAAhwH,EAAAyvH,EAAAC,GACA,GAOAjpH,GAPAkpH,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAK,EAAAN,EAAA,EACAv4H,EAAAs4H,EAAA,EACA34H,EAAAiJ,EAAA5I,KACAT,EAAA,IAAAI,CAGA,KADAA,IAAA,EACAk5H,EAAA,EAAAt5H,EAAA,IAAAA,EAAAqJ,EAAA5I,GAAAA,IAAA64H,GAAA,GAIA,IAHAxpH,EAAA9P,GAAA,IAAAs5H,GAAA,EACAt5H,KAAAs5H,EACAA,GAAAR,EACAQ,EAAA,EAAAxpH,EAAA,IAAAA,EAAAzG,EAAA5I,GAAAA,IAAA64H,GAAA,GACA,GAAA,IAAAt5H,EACAA,EAAA,EAAAk5H,MACA,CAAA,GAAAl5H,IAAAi5H,EACA,MAAAnpH,GAAA2rG,IAAAr7G,GAAAg2E,EAAAA,CAEAtmE,IAAAgrE,EAAA,EAAAg+C,GACA94H,GAAAk5H,EACA,OAAA94H,EAAA,GAAA,GAAA0P,EAAAgrE,EAAA,EAAA96E,EAAA84H,GAGA,QAAAS,GAAAC,GACA,MAAAA,GAAA,IAAA,GAAAA,EAAA,IAAA,GAAAA,EAAA,IAAA,EAAAA,EAAA,GAEA,QAAAC,GAAA37F,GACA,OAAA,IAAAA,GAEA,QAAA47F,GAAA57F,GACA,OAAA,IAAAA,EAAAA,GAAA,EAAA,KAEA,QAAA67F,GAAA77F,GACA,OAAA,IAAAA,EAAAA,GAAA,EAAA,IAAAA,GAAA,GAAA,IAAAA,GAAA,GAAA,KAEA,QAAA87F,GAAA97F,GACA,MAAA+6F,GAAA/6F,EAAA,GAAA,GAEA,QAAA+7F,GAAA/7F,GACA,MAAA+6F,GAAA/6F,EAAA,GAAA,GAGA,QAAA43F,GAAA5iG,EAAA1d,EAAAugH,GACAhgB,EAAA7iF,EAAA0qF,GAAApoG,GAAAk7B,IAAA,WAAA,MAAAtpC,MAAA2uH,MAGA,QAAArlF,GAAA/0B,EAAAi+G,EAAAzyH,EAAA+yH,GACA,GAAAC,IAAAhzH,EACAizH,EAAApH,EAAAmH,EACA,IAAAC,EAAAR,EAAAj+G,EAAA0+G,GAAA,KAAAte,GAAAue,EACA,IAAA1mD,GAAAj4D,EAAA4+G,GAAAC,GACA7sH,EAAAysH,EAAAz+G,EAAA8+G,GACAC,EAAA9mD,EAAA/wE,MAAA8K,EAAAA,EAAAisH,EACA,OAAAM,GAAAQ,EAAAA,EAAA10F,UAEA,QAAAzR,GAAA5Y,EAAAi+G,EAAAzyH,EAAAwzH,EAAAnvH,EAAA0uH,GACA,GAAAC,IAAAhzH,EACAizH,EAAApH,EAAAmH,EACA,IAAAC,EAAAR,EAAAj+G,EAAA0+G,GAAA,KAAAte,GAAAue,EAIA,KAAA,GAHA1mD,GAAAj4D,EAAA4+G,GAAAC,GACA7sH,EAAAysH,EAAAz+G,EAAA8+G,GACAC,EAAAC,GAAAnvH,GACA3K,EAAA,EAAA+4H,EAAA/4H,EAAAA,IAAA+yE,EAAAjmE,EAAA9M,GAAA65H,EAAAR,EAAAr5H,EAAA+4H,EAAA/4H,EAAA,GAxJA,GAAA8uG,GAAA/uG,EAAA,aACAw1G,EAAAx1G,EAAA,kBACA2hH,EAAA3hH,EAAA,cACAiyH,EAAAjyH,EAAA,YACA+8G,EAAA/8G,EAAA,WACAo1G,EAAAp1G,EAAA,mBACA24G,EAAA34G,EAAA,YACAq1G,EAAAr1G,EAAA,kBACAyuH,EAAAzuH,EAAA,iBACA+wG,EAAA/wG,EAAA,gBACAoyH,EAAApyH,EAAA,eACAgqH,EAAAhqH,EAAA,kBAAAE,EACAi1G,EAAAn1G,EAAA,gBAAAE,EACAqyH,EAAAvyH,EAAA,iBACA64G,EAAA74G,EAAA,wBACA2yH,EAAA,cACAqH,EAAA,WACAhd,EAAA,YACAyX,EAAA,gBACAiF,EAAA,eACA5G,EAAA/jB,EAAA4jB,GACAI,EAAAhkB,EAAAirB,GACA91H,EAAA6qG,EAAA7qG,KACAi3G,EAAApM,EAAAoM,WAEAvlC,EAAAm5B,EAAAn5B,SACAqkD,EAAAnH,EACAvyF,EAAAr8B,EAAAq8B,IACA+5C,EAAAp2E,EAAAo2E,IACAyQ,EAAA7mF,EAAA6mF,MACA90E,EAAA/R,EAAA+R,IACA2iH,EAAA10H,EAAA00H,IACAsB,EAAA,SACAC,EAAA,aACAC,EAAA,aACAT,EAAAnkB,EAAA,KAAA0kB,EACAT,EAAAjkB,EAAA,KAAA2kB,EACAN,EAAArkB,EAAA,KAAA4kB,CAsHA,IAAAnI,EAAAgF,IAgFA,CACA,IAAAte,EAAA,WACAma,EAAA,OACAna,EAAA,WACA,GAAAma,GAAA,OACAna,EAAA,WAIA,MAHA,IAAAma,GACA,GAAAA,GAAA,KACA,GAAAA,GAAA7X,KACA6X,EAAAxvH,MAAAqvH,IACA,CACAG,EAAA,SAAAtyH,GAEA,MADA60G,GAAA7uG,KAAAssH,GACA,GAAAmH,GAAA7H,EAAA5xH,IAGA,KAAA,GAAAoU,GADAylH,EAAAvH,EAAA9V,GAAAid,EAAAjd,GACAlzD,EAAAkgE,EAAAiQ,GAAA12H,GAAA,EAAAumD,EAAAtpD,OAAA+C,KACAqR,EAAAk1C,EAAAvmD,QAAAuvH,IAAA/V,EAAA+V,EAAAl+G,EAAAqlH,EAAArlH,GAEA+sG,KAAA0Y,EAAAn8G,YAAA40G,GAGA,GAAA/3G,IAAA,GAAAg4G,GAAA,GAAAD,GAAA,IACAwH,GAAAvH,EAAA/V,GAAAud,OACAx/G,IAAAw/G,QAAA,EAAA,YACAx/G,GAAAw/G,QAAA,EAAA,aACAx/G,GAAAy/G,QAAA,KAAAz/G,GAAAy/G,QAAA,KAAAplB,EAAA2d,EAAA/V,IACAud,QAAA,SAAAnE,EAAAxrH,GACA0vH,GAAA/5H,KAAAiG,KAAA4vH,EAAAxrH,GAAA,IAAA,KAEA6vH,SAAA,SAAArE,EAAAxrH,GACA0vH,GAAA/5H,KAAAiG,KAAA4vH,EAAAxrH,GAAA,IAAA,OAEA,OAhHAkoH,GAAA,SAAAtyH,GACA60G,EAAA7uG,KAAAssH,EAAAH,EACA,IAAAlwH,GAAA2vH,EAAA5xH,EACAgG,MAAAozH,GAAArH,EAAAhyH,KAAA07C,MAAAx5C,GAAA,GACA+D,KAAAizH,GAAAh3H,GAGAswH,EAAA,SAAAlqH,EAAAutH,EAAA3zH,GACA4yG,EAAA7uG,KAAAusH,EAAAiH,GACA3kB,EAAAxsG,EAAAiqH,EAAAkH,EACA,IAAAU,GAAA7xH,EAAA4wH,GACA34H,EAAA2tH,EAAA2H,EACA,IAAA,EAAAt1H,GAAAA,EAAA45H,EAAA,KAAAvf,GAAA,gBAEA,IADA14G,EAAAkG,SAAAlG,EAAAi4H,EAAA55H,EAAAiwG,EAAAtuG,GACA3B,EAAA2B,EAAAi4H,EAAA,KAAAvf,GAAAsZ,EACAjuH,MAAAmzH,GAAA9wH,EACArC,KAAAqzH,GAAA/4H,EACA0F,KAAAizH,GAAAh3H,GAGA+yG,IACA0f,EAAApC,EAAAqH,EAAA,MACAjF,EAAAnC,EAAAmH,EAAA,MACAhF,EAAAnC,EAAAoH,EAAA,MACAjF,EAAAnC,EAAAqH,EAAA,OAGAhlB,EAAA2d,EAAA/V,IACAwd,QAAA,SAAApE,GACA,MAAAtmF,GAAAtpC,KAAA,EAAA4vH,GAAA,IAAA,IAAA,IAEAuE,SAAA,SAAAvE,GACA,MAAAtmF,GAAAtpC,KAAA,EAAA4vH,GAAA,IAEAwE,SAAA,SAAAxE,GACA,GAAA4C,GAAAlpF,EAAAtpC,KAAA,EAAA4vH,EAAAlrE,UAAA,GACA,QAAA8tE,EAAA,IAAA,EAAAA,EAAA,KAAA,IAAA,IAEA6B,UAAA,SAAAzE,GACA,GAAA4C,GAAAlpF,EAAAtpC,KAAA,EAAA4vH,EAAAlrE,UAAA,GACA,OAAA8tE,GAAA,IAAA,EAAAA,EAAA,IAEA8B,SAAA,SAAA1E,GACA,MAAA2C,GAAAjpF,EAAAtpC,KAAA,EAAA4vH,EAAAlrE,UAAA,MAEA6vE,UAAA,SAAA3E,GACA,MAAA2C,GAAAjpF,EAAAtpC,KAAA,EAAA4vH,EAAAlrE,UAAA,OAAA,GAEA8vE,WAAA,SAAA5E,GACA,MAAAyC,GAAA/oF,EAAAtpC,KAAA,EAAA4vH,EAAAlrE,UAAA,IAAA,GAAA,IAEA+vE,WAAA,SAAA7E,GACA,MAAAyC,GAAA/oF,EAAAtpC,KAAA,EAAA4vH,EAAAlrE,UAAA,IAAA,GAAA,IAEAqvE,QAAA,SAAAnE,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAA6C,EAAAruH,IAEA6vH,SAAA,SAAArE,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAA6C,EAAAruH,IAEAswH,SAAA,SAAA9E,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAA8C,EAAAtuH,EAAAsgD,UAAA,KAEAiwE,UAAA,SAAA/E,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAA8C,EAAAtuH,EAAAsgD,UAAA,KAEAkwE,SAAA,SAAAhF,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAA+C,EAAAvuH,EAAAsgD,UAAA,KAEAmwE,UAAA,SAAAjF,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAA+C,EAAAvuH,EAAAsgD,UAAA,KAEAowE,WAAA,SAAAlF,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAAiD,EAAAzuH,EAAAsgD,UAAA,KAEAqwE,WAAA,SAAAnF,EAAAxrH,GACA+oB,EAAAntB,KAAA,EAAA4vH,EAAAgD,EAAAxuH,EAAAsgD,UAAA,MAsCA2tD,GAAAia,EAAAH,GACA9Z,EAAAka,EAAAiH,GACAjd,EAAAgW,EAAA/V,GAAAiV,EAAAuC,MAAA,GACAl0H,EAAAqyH,GAAAG,EACAxyH,EAAA05H,GAAAjH,IjL00wBGnc,iBAAiB,GAAGkhB,gBAAgB,GAAGjhB,iBAAiB,GAAGiD,WAAW,GAAGC,YAAY,GAAG1J,UAAU,IAAIyS,aAAa,IAAI5L,eAAe,IAAIkT,iBAAiB,IAAIjT,kBAAkB,IAAIgD,uBAAuB,IAAI6d,cAAc,IAAItJ,gBAAgB,IAAItd,eAAe,IAAI6mB,WAAW,MAAMuD,KAAK,SAASx7H,EAAQU,EAAOJ,GkL9kxB1T,IAfA,GASAm7H,GATA1sB,EAAA/uG,EAAA,aACA+8G,EAAA/8G,EAAA,WACAkuH,EAAAluH,EAAA,UACAu0H,EAAArG,EAAA,eACAsG,EAAAtG,EAAA,QACA+I,KAAAloB,EAAA7tF,cAAA6tF,EAAAikB,UACAqB,EAAA4C,EACAh3H,EAAA,EACAI,EAAA,EAGAq7H,EAAA,iHAEA5uH,MAAA,KAEAzM,EAAAJ,IACAw7H,EAAA1sB,EAAA2sB,EAAAz7H,QACA88G,EAAA0e,EAAAt1H,UAAAouH,GAAA,GACAxX,EAAA0e,EAAAt1H,UAAAquH,GAAA,IACAH,GAAA,CAGA3zH,GAAAJ,SACA22H,IAAAA,EACA5C,OAAAA,EACAE,MAAAA,EACAC,KAAAA,KlLimxBGza,YAAY,GAAG1J,UAAU,IAAIiV,SAAS,MAAMqW,KAAK,SAAS37H,EAAQU,EAAOJ,GmL3nxB5E,GAAA2N,GAAA,EACA0lD,EAAAzvD,KAAA+vE,QACAvzE,GAAAJ,QAAA,SAAAsU,GACA,MAAA,UAAA00C,OAAA3gD,SAAAiM,EAAA,GAAAA,EAAA,QAAA3G,EAAA0lD,GAAA9wD,SAAA,WnL+nxBM+4H,KAAK,SAAS57H,EAAQU,EAAOJ,GoLloxBnC,GAAAowG,GAAA1wG,EAAA,eACAU,GAAAJ,QAAA,SAAAg9B,EAAAk1E,GACA,IAAA9B,EAAApzE,IAAAA,EAAAi4B,KAAAi9C,EAAA,KAAA97C,WAAA,0BAAA87C,EAAA,aACA,OAAAl1E,MpLsoxBGqzE,eAAe,MAAMkrB,KAAK,SAAS77H,EAAQU,EAAOJ,GqLzoxBrD,GAAAyuG,GAAA/uG,EAAA,aACAq6G,EAAAr6G,EAAA,WACA2hH,EAAA3hH,EAAA,cACA87H,EAAA97H,EAAA,cACAg2D,EAAAh2D,EAAA,gBAAAE,CACAQ,GAAAJ,QAAA,SAAAgD,GACA,GAAAy4H,GAAA1hB,EAAAt8F,SAAAs8F,EAAAt8F,OAAA4jG,KAAA5S,EAAAhxF,WACA,MAAAza,EAAAw4E,OAAA,IAAAx4E,IAAAy4H,IAAA/lE,EAAA+lE,EAAAz4H,GAAAsH,MAAAkxH,EAAA57H,EAAAoD,QrL6oxBGq6G,UAAU,GAAG5D,YAAY,GAAG+I,aAAa,IAAI5L,eAAe,IAAI8kB,aAAa,MAAMC,KAAK,SAASj8H,EAAQU,EAAOJ,GsLppxBnHA,EAAAJ,EAAAF,EAAA,YtLupxBGswG,SAAS,MAAM4rB,KAAK,SAASl8H,EAAQU,EAAOJ,GuLvpxB/C,GAAA0yE,GAAAhzE,EAAA,aAAA,OACAkuH,EAAAluH,EAAA,UACA+d,EAAA/d,EAAA,aAAA+d,OACAo+G,EAAA,kBAAAp+G,GAEAq+G,EAAA17H,EAAAJ,QAAA,SAAAgD,GACA,MAAA0vE,GAAA1vE,KAAA0vE,EAAA1vE,GACA64H,GAAAp+G,EAAAza,KAAA64H,EAAAp+G,EAAAmwG,GAAA,UAAA5qH,IAGA84H,GAAAppD,MAAAA,IvL0pxBG+mC,YAAY,GAAGwM,YAAY,IAAIjB,SAAS,MAAM+W,KAAK,SAASr8H,EAAQU,EAAOJ,GwLpqxB9E,GAAAi3G,GAAAv3G,EAAA,cACA4xG,EAAA5xG,EAAA,UAAA,YACA+gH,EAAA/gH,EAAA,eACAU,GAAAJ,QAAAN,EAAA,WAAAs8H,kBAAA,SAAAh/F,GACA,MAAA30B,SAAA20B,EAAAA,EAAAs0E,IACAt0E,EAAA,eACAyjF,EAAAxJ,EAAAj6E,IAFA,UxL0qxBGm6E,aAAa,GAAGkG,UAAU,GAAGqD,eAAe,IAAI1Q,SAAS,MAAMisB,KAAK,SAASv8H,EAAQU,EAAOJ,GyL7qxB/F,GAAAm4G,GAAAz4G,EAAA,aACAw8H,EAAAx8H,EAAA,eAAA,sBAAA,OAEAy4G,GAAAA,EAAA4E,EAAA,UAAA1N,OAAA,SAAAryE,GAAA,MAAAk/F,GAAAl/F,QzLirxBGu8E,YAAY,GAAG4iB,cAAc,MAAMC,KAAK,SAAS18H,EAAQU,EAAOJ,G0LprxBnE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA8E,EAAA,SAAAvM,WAAAhxG,EAAA,0BAEAA,EAAA,yBAAA,gB1LwrxBG28H,wBAAwB,GAAG9E,uBAAuB,GAAGhe,YAAY,KAAK+iB,KAAK,SAAS58H,EAAQU,EAAOJ,G2L7rxBtG,YACA,IAAAm4G,GAAAz4G,EAAA,aACA68H,EAAA78H,EAAA,oBAAA,EAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,uBAAAy1H,OAAA,GAAA,SAEAA,MAAA,SAAAziB,GACA,MAAA6pB,GAAAr2H,KAAAwsG,EAAA9nD,UAAA,S3LksxBGotD,mBAAmB,GAAGuB,YAAY,GAAGijB,mBAAmB,MAAMC,KAAK,SAAS/8H,EAAQU,EAAOJ,G4LxsxB9F,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA8E,EAAA,SAAAvkE,KAAAh5C,EAAA,mBAEAA,EAAA,yBAAA,U5L4sxBG28H,wBAAwB,GAAG7E,gBAAgB,GAAGje,YAAY,KAAKmjB,KAAK,SAASh9H,EAAQU,EAAOJ,G6LjtxB/F,YACA,IAAAm4G,GAAAz4G,EAAA,aACAi9H,EAAAj9H,EAAA,oBAAA,EAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,uBAAAwV,QAAA,GAAA,SAEAA,OAAA,SAAAw9F,GACA,MAAAiqB,GAAAz2H,KAAAwsG,EAAA9nD,UAAA,S7LstxBGotD,mBAAmB,GAAGuB,YAAY,GAAGijB,mBAAmB,MAAMI,KAAK,SAASl9H,EAAQU,EAAOJ,G8L7txB9F,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAm9H,EAAAn9H,EAAA,oBAAA,GACAo5G,EAAA,YACAgkB,GAAA,CAEAhkB,SAAAn9D,MAAA,GAAAm9D,GAAA,WAAAgkB,GAAA,IACA3kB,EAAAA,EAAA8E,EAAA9E,EAAAnE,EAAA8oB,EAAA,SACAzH,UAAA,SAAA3iB,GACA,MAAAmqB,GAAA32H,KAAAwsG,EAAA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,WAGA3I,EAAA,yBAAAo5G,K9LguxBGujB,wBAAwB,GAAGrkB,mBAAmB,GAAGuB,YAAY,KAAKwjB,KAAK,SAASr9H,EAAQU,EAAOJ,G+L7uxBlG,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAm9H,EAAAn9H,EAAA,oBAAA,GACAo5G,EAAA,OACAgkB,GAAA,CAEAhkB,SAAAn9D,MAAA,GAAAm9D,GAAA,WAAAgkB,GAAA,IACA3kB,EAAAA,EAAA8E,EAAA9E,EAAAnE,EAAA8oB,EAAA,SACAvyE,KAAA,SAAAmoD,GACA,MAAAmqB,GAAA32H,KAAAwsG,EAAA9nD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,WAGA3I,EAAA,yBAAAo5G,K/LgvxBGujB,wBAAwB,GAAGrkB,mBAAmB,GAAGuB,YAAY,KAAKyjB,KAAK,SAASt9H,EAAQU,EAAOJ,GgM7vxBlG,YACA,IAAAm4G,GAAAz4G,EAAA,aACAu9H,EAAAv9H,EAAA,oBAAA,GACAw9H,EAAAx9H,EAAA,uBAAAoiB,SAAA,EAEAq2F,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAkpB,EAAA,SAEAp7G,QAAA,SAAA4wF,GACA,MAAAuqB,GAAA/2H,KAAAwsG,EAAA9nD,UAAA,ShMkwxBGotD,mBAAmB,GAAGuB,YAAY,GAAGijB,mBAAmB,MAAMW,KAAK,SAASz9H,EAAQU,EAAOJ,GiM1wxB9F,YACA,IAAA8gE,GAAAphE,EAAA,UACAy4G,EAAAz4G,EAAA,aACA6wG,EAAA7wG,EAAA,gBACAO,EAAAP,EAAA,gBACAy/G,EAAAz/G,EAAA,oBACA+wG,EAAA/wG,EAAA,gBACA09H,EAAA19H,EAAA,sBACA0/G,EAAA1/G,EAAA,6BAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAt0G,EAAA,kBAAA,SAAA2xG,GAAA11D,MAAA6hC,KAAA6zB,KAAA,SAEA7zB,KAAA,SAAAy4C,GACA,GAOA/1H,GAAA6D,EAAA+K,EAAA4O,EAPAixF,EAAA4B,EAAA0lB,GACAjkG,EAAA,kBAAA9rB,MAAAA,KAAAy1C,MACAs1D,EAAArmD,UAAA1qD,OACA60H,EAAA9jB,EAAA,EAAArmD,UAAA,GAAAviD,OACA+qB,EAAA/qB,SAAA0sH,EACA9uH,EAAA,EACAs5G,EAAAH,EAAAzQ,EAIA,IAFAv7E,IAAA2hG,EAAAj0D,EAAAi0D,EAAA9jB,EAAA,EAAArmD,UAAA,GAAAviD,OAAA,IAEAA,QAAAk3G,GAAAvtF,GAAA2pB,OAAAwjE,EAAAI,GAMA,IADAr/G,EAAAuwG,EAAA9B,EAAAzuG,QACA6D,EAAA,GAAAiuB,GAAA9xB,GAAAA,EAAA+F,EAAAA,IACAm3H,EAAAr5H,EAAAkC,EAAAmtB,EAAA2hG,EAAApmB,EAAA1oG,GAAAA,GAAA0oG,EAAA1oG,QANA,KAAAyX,EAAA6hG,EAAAt/G,KAAA0uG,GAAA5qG,EAAA,GAAAiuB,KAAAljB,EAAA4O,EAAAkZ,QAAAC,KAAA5wB,IACAm3H,EAAAr5H,EAAAkC,EAAAmtB,EAAAnzB,EAAAyd,EAAAq3G,GAAAjmH,EAAAxE,MAAArE,IAAA,GAAA6I,EAAAxE,MASA,OADAvG,GAAA7D,OAAA+F,EACAlC,OjM+wxBGs5H,qBAAqB,GAAGxqB,SAAS,GAAG0G,YAAY,GAAGiG,mBAAmB,IAAIC,eAAe,IAAI9F,iBAAiB,IAAI7I,eAAe,IAAIC,eAAe,IAAI2O,6BAA6B,MAAM4d,KAAK,SAAS59H,EAAQU,EAAOJ,GkMjzxB3N,YACA,IAAAm4G,GAAAz4G,EAAA,aACA69H,EAAA79H,EAAA,sBAAA,GACAwiH,KAAAh/G,QACAs6H,IAAAtb,GAAA,GAAA,GAAAh/G,QAAA,GAAA,GAAA,CAEAi1G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAwpB,IAAA99H,EAAA,oBAAAwiH,IAAA,SAEAh/G,QAAA,SAAAoyH,GACA,MAAAkI,GAEAtb,EAAAhpC,MAAAhzE,KAAA0kD,YAAA,EACA2yE,EAAAr3H,KAAAovH,EAAA1qE,UAAA,SlMszxBG6/D,oBAAoB,GAAGlR,YAAY,GAAGijB,mBAAmB,MAAMiB,KAAK,SAAS/9H,EAAQU,EAAOJ,GmMj0xB/F,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,SAAA5mD,QAAAz2D,EAAA,mBnMq0xBG65G,YAAY,GAAGhG,cAAc,MAAMmqB,KAAK,SAASh+H,EAAQU,EAAOJ,GoMx0xBnE,YACA,IAAA29H,GAAAj+H,EAAA,yBACAoP,EAAApP,EAAA,gBACA+gH,EAAA/gH,EAAA,gBACA+xG,EAAA/xG,EAAA,gBAMAU,GAAAJ,QAAAN,EAAA,kBAAAi8C,MAAA,QAAA,SAAAw6D,EAAAC,GACAlwG,KAAA+uD,GAAAw8C,EAAA0E,GACAjwG,KAAAgwD,GAAA,EACAhwD,KAAAmwG,GAAAD,GAEA,WACA,GAAAzH,GAAAzoG,KAAA+uD,GACAmhD,EAAAlwG,KAAAmwG,GACApwG,EAAAC,KAAAgwD,IACA,QAAAy4C,GAAA1oG,GAAA0oG,EAAAzuG,QACAgG,KAAA+uD,GAAA5sD,OACAyG,EAAA,IAEA,QAAAsnG,EAAAtnG,EAAA,EAAA7I,GACA,UAAAmwG,EAAAtnG,EAAA,EAAA6/F,EAAA1oG,IACA6I,EAAA,GAAA7I,EAAA0oG,EAAA1oG,MACA,UAGAw6G,EAAAmd,UAAAnd,EAAA9kE,MAEAgiF,EAAA,QACAA,EAAA,UACAA,EAAA,apM20xBGtB,wBAAwB,GAAG7lB,iBAAiB,IAAIC,eAAe,IAAIiK,eAAe,IAAI5O,gBAAgB,MAAM+rB,KAAK,SAASn+H,EAAQU,EAAOJ,GqM52xB5I,YAEA,IAAAm4G,GAAAz4G,EAAA,aACA+xG,EAAA/xG,EAAA,iBACA6zH,KAAA70E,IAGAy5D,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,eAAAkjD,SAAAljD,EAAA,oBAAA6zH,IAAA,SACA70E,KAAA,SAAA82E,GACA,MAAAjC,GAAAtzH,KAAAwxG,EAAAvrG,MAAAmC,SAAAmtH,EAAA,IAAAA,QrMi3xBGjc,YAAY,GAAGzG,aAAa;AAAI0pB,mBAAmB,IAAI1qB,gBAAgB,MAAMgsB,KAAK,SAASp+H,EAAQU,EAAOJ,GsM13xB7G,YACA,IAAAm4G,GAAAz4G,EAAA,aACA+xG,EAAA/xG,EAAA,iBACAyuH,EAAAzuH,EAAA,iBACA+wG,EAAA/wG,EAAA,gBACAwiH,KAAA7Z,YACAm1B,IAAAtb,GAAA,GAAA,GAAA7Z,YAAA,GAAA,GAAA,CAEA8P,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAwpB,IAAA99H,EAAA,oBAAAwiH,IAAA,SAEA7Z,YAAA,SAAAitB,GAEA,GAAAkI,EAAA,MAAAtb,GAAAhpC,MAAAhzE,KAAA0kD,YAAA,CACA,IAAA+jD,GAAA8C,EAAAvrG,MACAhG,EAAAuwG,EAAA9B,EAAAzuG,QACA+F,EAAA/F,EAAA,CAGA,KAFA0qD,UAAA1qD,OAAA,IAAA+F,EAAArC,KAAAC,IAAAoC,EAAAkoH,EAAAvjE,UAAA,MACA,EAAA3kD,IAAAA,EAAA/F,EAAA+F,GACAA,GAAA,EAAAA,IAAA,GAAAA,IAAA0oG,IAAAA,EAAA1oG,KAAAqvH,EAAA,MAAArvH,IAAA,CACA,OAAA,QtM+3xBGszG,YAAY,GAAGijB,mBAAmB,IAAIpO,gBAAgB,IAAItc,gBAAgB,IAAIhB,eAAe,MAAMitB,KAAK,SAASr+H,EAAQU,EAAOJ,GuMl5xBnI,YACA,IAAAm4G,GAAAz4G,EAAA,aACA00H,EAAA10H,EAAA,oBAAA,EAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,uBAAA6N,KAAA,GAAA,SAEAA,IAAA,SAAAmlG,GACA,MAAA0hB,GAAAluH,KAAAwsG,EAAA9nD,UAAA,SvMu5xBGotD,mBAAmB,GAAGuB,YAAY,GAAGijB,mBAAmB,MAAMwB,KAAK,SAASt+H,EAAQU,EAAOJ,GwM95xB9F,YACA,IAAAm4G,GAAAz4G,EAAA,aACA09H,EAAA19H,EAAA,qBAGAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,EAAAt0G,EAAA,YAAA,WACA,QAAAs0G,MACA,QAAAr4D,MAAAw7B,GAAAl3E,KAAA+zG,YAAAA,MACA,SAEA78B,GAAA,WAIA,IAHA,GAAAlxE,GAAA,EACAgrG,EAAArmD,UAAA1qD,OACA6D,EAAA,IAAA,kBAAAmC,MAAAA,KAAAy1C,OAAAs1D,GACAA,EAAAhrG,GAAAm3H,EAAAr5H,EAAAkC,EAAA2kD,UAAA3kD,KAEA,OADAlC,GAAA7D,OAAA+wG,EACAltG,OxMm6xBGs5H,qBAAqB,GAAG9jB,YAAY,GAAGC,WAAW,KAAKykB,KAAK,SAASv+H,EAAQU,EAAOJ,GyMn7xBvF,YACA,IAAAm4G,GAAAz4G,EAAA,aACAw+H,EAAAx+H,EAAA,kBAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,uBAAA4zH,aAAA,GAAA,SAEAA,YAAA,SAAA5gB,GACA,MAAAwrB,GAAAh4H,KAAAwsG,EAAA9nD,UAAA1qD,OAAA0qD,UAAA,IAAA,QzMw7xBGuzE,kBAAkB,GAAG5kB,YAAY,GAAGijB,mBAAmB,MAAM4B,KAAK,SAAS1+H,EAAQU,EAAOJ,G0M/7xB7F,YACA,IAAAm4G,GAAAz4G,EAAA,aACAw+H,EAAAx+H,EAAA,kBAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,uBAAAy1E,QAAA,GAAA,SAEAA,OAAA,SAAAu9B,GACA,MAAAwrB,GAAAh4H,KAAAwsG,EAAA9nD,UAAA1qD,OAAA0qD,UAAA,IAAA,Q1Mo8xBGuzE,kBAAkB,GAAG5kB,YAAY,GAAGijB,mBAAmB,MAAM6B,KAAK,SAAS3+H,EAAQU,EAAOJ,G2M38xB7F,YACA,IAAAm4G,GAAAz4G,EAAA,aACAywH,EAAAzwH,EAAA,WACAgwG,EAAAhwG,EAAA,UACA8wG,EAAA9wG,EAAA,wBACA+wG,EAAA/wG,EAAA,gBACAm0G,KAAAlyG,KAGAw2G,GAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAt0G,EAAA,YAAA,WACAywH,GAAAtc,EAAA5zG,KAAAkwH,KACA,SACAxuH,MAAA,SAAAi0H,EAAAjpH,GACA,GAAAu7B,GAAAuoE,EAAAvqG,KAAAhG,QACAg3H,EAAAxnB,EAAAxpG,KAEA,IADAyG,EAAAtE,SAAAsE,EAAAu7B,EAAAv7B,EACA,SAAAuqH,EAAA,MAAArjB,GAAA5zG,KAAAiG,KAAA0vH,EAAAjpH,EAMA,KALA,GAAAF,GAAA+jG,EAAAolB,EAAA1tF,GACAo2F,EAAA9tB,EAAA7jG,EAAAu7B,GACAnxB,EAAA05F,EAAA6tB,EAAA7xH,GACA8xH,EAAA5iF,MAAA5kC,GACApX,EAAA,EACAoX,EAAApX,EAAAA,IAAA4+H,EAAA5+H,GAAA,UAAAu3H,EACAhxH,KAAAs1E,OAAA/uE,EAAA9M,GACAuG,KAAAuG,EAAA9M,EACA,OAAA4+H,Q3Mg9xBG5uB,SAAS,GAAG4J,YAAY,GAAGC,WAAW,GAAGoP,UAAU,IAAI/X,uBAAuB,IAAIC,eAAe,MAAM0tB,KAAK,SAAS9+H,EAAQU,EAAOJ,G4Mz+xBvI,YACA,IAAAm4G,GAAAz4G,EAAA,aACA++H,EAAA/+H,EAAA,oBAAA,EAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAt0G,EAAA,uBAAAo6F,MAAA,GAAA,SAEAA,KAAA,SAAA4Y,GACA,MAAA+rB,GAAAv4H,KAAAwsG,EAAA9nD,UAAA,S5M8+xBGotD,mBAAmB,GAAGuB,YAAY,GAAGijB,mBAAmB,MAAMkC,KAAK,SAASh/H,EAAQU,EAAOJ,G6Mr/xB9F,YACA,IAAAm4G,GAAAz4G,EAAA,aACAszG,EAAAtzG,EAAA,iBACA6wG,EAAA7wG,EAAA,gBACA24G,EAAA34G,EAAA,YACAi/H,KAAAz3H,KACA+F,GAAA,EAAA,EAAA,EAEAkrG,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAAqE,EAAA,WAEAprG,EAAA/F,KAAAmB,YACAgwG,EAAA,WAEAprG,EAAA/F,KAAA,UAEAxH,EAAA,oBAAAi/H,IAAA,SAEAz3H,KAAA,SAAAwuH,GACA,MAAArtH,UAAAqtH,EACAiJ,EAAA1+H,KAAAswG,EAAArqG,OACAy4H,EAAA1+H,KAAAswG,EAAArqG,MAAA8sG,EAAA0iB,S7M0/xBGviB,gBAAgB,GAAGoG,YAAY,GAAGC,WAAW,GAAGgjB,mBAAmB,IAAIzrB,eAAe,MAAM6tB,KAAK,SAASl/H,EAAQU,EAAOJ,G8M9gyB5HN,EAAA,kBAAA,W9MihyBGo3G,iBAAiB,MAAM+nB,KAAK,SAASn/H,EAAQU,EAAOJ,G+MhhyBvD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAA3nG,IAAA,WAAA,OAAA,GAAAD,OAAAolG,e/MohyBGhB,YAAY,KAAKulB,KAAK,SAASp/H,EAAQU,EAAOJ,GgNthyBjD,GAAAm4G,GAAAz4G,EAAA,aACA+6G,EAAA/6G,EAAA,wBAGAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAA7+F,KAAAtP,UAAA40G,cAAAA,GAAA,QACAA,YAAAA,MhN2hyBGskB,wBAAwB,GAAGxlB,YAAY,KAAKylB,KAAK,SAASt/H,EAAQU,EAAOJ,GiNjiyB5E,YACA,IAAAm4G,GAAAz4G,EAAA,aACA6wG,EAAA7wG,EAAA,gBACA47G,EAAA57G,EAAA,kBAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAt0G,EAAA,YAAA,WACA,MAAA,QAAA,GAAAyV,MAAAwlG,KAAAskB,UACA,IAAA9pH,KAAAtP,UAAAo5H,OAAAh/H,MAAAw6G,YAAA,WAAA,MAAA,QACA,QAEAwkB,OAAA,SAAA3qH,GACA,GAAAq6F,GAAA4B,EAAArqG,MACAg5H,EAAA5jB,EAAA3M,EACA,OAAA,gBAAAuwB,IAAAtkB,SAAAskB,GAAAvwB,EAAA8L,cAAA,UjNsiyBGlB,YAAY,GAAGC,WAAW,GAAGzI,eAAe,IAAI0K,kBAAkB,MAAM0jB,KAAK,SAASz/H,EAAQU,EAAOJ,GkNnjyBxG,GAAAo/H,GAAA1/H,EAAA,UAAA,eACAmzB,EAAA1d,KAAAtP,SAEAu5H,KAAAvsG,IAAAnzB,EAAA,WAAAmzB,EAAAusG,EAAA1/H,EAAA,2BlNsjyBG2/H,uBAAuB,GAAGtvB,UAAU,IAAIC,SAAS,MAAMsvB,KAAK,SAAS5/H,EAAQU,EAAOJ,GmNzjyBvF,GAAAu/H,GAAApqH,KAAAtP,UACA25H,EAAA,eACAjT,EAAA,WACAC,EAAA+S,EAAAhT,GACAhS,EAAAglB,EAAAhlB,OACA,IAAAplG,MAAAwlG,KAAA,IAAA6kB,GACA9/H,EAAA,eAAA6/H,EAAAhT,EAAA,WACA,GAAAjiH,GAAAiwG,EAAAt6G,KAAAiG,KAEA,OAAAoE,KAAAA,EAAAkiH,EAAAvsH,KAAAiG,MAAAs5H,MnN8jyBG5lB,cAAc,MAAM6lB,KAAK,SAAS//H,EAAQU,EAAOJ,GoNtkyBpD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA8E,EAAA,YAAAz0G,KAAA9I,EAAA,epN0kyBGggI,UAAU,GAAGnmB,YAAY,KAAKomB,KAAK,SAASjgI,EAAQU,EAAOJ,GqN7kyB9D,YACA,IAAAowG,GAAA1wG,EAAA,gBACAuvF,EAAAvvF,EAAA,iBACAkgI,EAAAlgI,EAAA,UAAA,eACAmgI,EAAA7wB,SAAAnpG,SAEA+5H,KAAAC,IAAAngI,EAAA,gBAAAE,EAAAigI,EAAAD,GAAAt1H,MAAA,SAAAqkG,GACA,GAAA,kBAAAzoG,QAAAkqG,EAAAzB,GAAA,OAAA,CACA,KAAAyB,EAAAlqG,KAAAL,WAAA,MAAA8oG,aAAAzoG,KAEA,MAAAyoG,EAAA1f,EAAA0f,IAAA,GAAAzoG,KAAAL,YAAA8oG,EAAA,OAAA,CACA,QAAA,OrNilyBG0B,eAAe,IAAIuG,eAAe,IAAI6L,gBAAgB,IAAIzS,SAAS,MAAM8vB,KAAK,SAASpgI,EAAQU,EAAOJ,GsN5lyBzG,GAAA60G,GAAAn1G,EAAA,gBAAAE,EACAmgI,EAAA/wB,SAAAnpG,UACAm6H,EAAA,wBACAtqB,EAAA,MAGAA,KAAAqqB,IAAArgI,EAAA,mBAAAm1G,EAAAkrB,EAAArqB,GACApnB,cAAA,EACA9+C,IAAA,WACA,IACA,OAAA,GAAAtpC,MAAA+wC,MAAA+oF,GAAA,GACA,MAAA9gI,GACA,MAAA,StNkmyBGq3G,iBAAiB,GAAGK,eAAe,MAAMqpB,KAAK,SAASvgI,EAAQU,EAAOJ,GuN9myBzE,YACA,IAAAkgI,GAAAxgI,EAAA,wBACA01G,EAAA11G,EAAA,0BACAygI,EAAA,KAGA//H,GAAAJ,QAAAN,EAAA,iBAAAygI,EAAA,SAAA3wF,GACA,MAAA,YAAA,MAAAA,GAAAtpC,KAAA0kD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,WAGAmnC,IAAA,SAAAl7B,GACA,GAAAghG,GAAA4qB,EAAA7qB,SAAAD,EAAAlvG,KAAAi6H,GAAA7rH,EACA,OAAAghG,IAAAA,EAAAr0G,GAGAoyB,IAAA,SAAA/e,EAAAhK,GACA,MAAA41H,GAAAjqB,IAAAb,EAAAlvG,KAAAi6H,GAAA,IAAA7rH,EAAA,EAAAA,EAAAhK,KAEA41H,GAAA,KvNinyBGE,gBAAgB,GAAGC,uBAAuB,GAAGtpB,yBAAyB,MAAMupB,KAAK,SAAS5gI,EAAQU,EAAOJ,GwNloyB5G,GAAAm4G,GAAAz4G,EAAA,aACAukH,EAAAvkH,EAAA,iBACA6gI,EAAA38H,KAAA28H,KACAC,EAAA58H,KAAA68H,KAEAtoB,GAAAA,EAAA4E,EAAA5E,EAAAnE,IAAAwsB,GAEA,KAAA58H,KAAA6mF,MAAA+1C,EAAAn/D,OAAAC,aAEAk/D,EAAAlrD,EAAAA,IAAAA,EAAAA,GACA,QACAmrD,MAAA,SAAAjzH,GACA,OAAAA,GAAAA,GAAA,EAAAmtG,IAAAntG,EAAA,kBACA5J,KAAA+R,IAAAnI,GAAA5J,KAAA00H,IACArU,EAAAz2G,EAAA,EAAA+yH,EAAA/yH,EAAA,GAAA+yH,EAAA/yH,EAAA,SxNwoyBG+rG,YAAY,GAAGmnB,gBAAgB,MAAMC,KAAK,SAASjhI,EAAQU,EAAOJ,GyNnpyBrE,QAAA4gI,GAAApzH,GACA,MAAAotG,UAAAptG,GAAAA,IAAA,GAAAA,EAAA,EAAAA,GAAAozH,GAAApzH,GAAA5J,KAAA+R,IAAAnI,EAAA5J,KAAA28H,KAAA/yH,EAAAA,EAAA,IAAAA,EAJA,GAAA2qG,GAAAz4G,EAAA,aACAmhI,EAAAj9H,KAAAg9H,KAOAzoB,GAAAA,EAAA4E,EAAA5E,EAAAnE,IAAA6sB,GAAA,EAAAA,EAAA,GAAA,GAAA,QAAAD,MAAAA,MzN0pyBGrnB,YAAY,KAAKunB,KAAK,SAASphI,EAAQU,EAAOJ,G0NlqyBjD,GAAAm4G,GAAAz4G,EAAA,aACAqhI,EAAAn9H,KAAAo9H,KAGA7oB,GAAAA,EAAA4E,EAAA5E,EAAAnE,IAAA+sB,GAAA,EAAAA,GAAA,GAAA,GAAA,QACAC,MAAA,SAAAxzH,GACA,MAAA,KAAAA,GAAAA,GAAAA,EAAA5J,KAAA+R,KAAA,EAAAnI,IAAA,EAAAA,IAAA,O1NwqyBG+rG,YAAY,KAAK0nB,KAAK,SAASvhI,EAAQU,EAAOJ,G2N9qyBjD,GAAAm4G,GAAAz4G,EAAA,aACA4jH,EAAA5jH,EAAA,eAEAy4G,GAAAA,EAAA4E,EAAA,QACAmkB,KAAA,SAAA1zH,GACA,MAAA81G,GAAA91G,GAAAA,GAAA5J,KAAAo2E,IAAAp2E,KAAAq8B,IAAAzyB,GAAA,EAAA,Q3NoryBG+rG,YAAY,GAAGwK,eAAe,MAAMod,KAAK,SAASzhI,EAAQU,EAAOJ,G4NzryBpE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACAqkB,MAAA,SAAA5zH,GACA,OAAAA,KAAA,GAAA,GAAA5J,KAAA6mF,MAAA7mF,KAAA+R,IAAAnI,EAAA,IAAA5J,KAAAy9H,OAAA,Q5N+ryBG9nB,YAAY,KAAK+nB,KAAK,SAAS5hI,EAAQU,EAAOJ,G6NnsyBjD,GAAAm4G,GAAAz4G,EAAA,aACA2mB,EAAAziB,KAAAyiB,GAEA8xF,GAAAA,EAAA4E,EAAA,QACAwkB,KAAA,SAAA/zH,GACA,OAAA6Y,EAAA7Y,GAAAA,GAAA6Y,GAAA7Y,IAAA,O7NysyBG+rG,YAAY,KAAKioB,KAAK,SAAS9hI,EAAQU,EAAOJ,G8N9syBjD,GAAAm4G,GAAAz4G,EAAA,aACAyjH,EAAAzjH,EAAA,gBAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAmP,GAAAv/G,KAAAw/G,OAAA,QAAAA,MAAAD,M9NktyBG5J,YAAY,GAAGkoB,gBAAgB,MAAMC,KAAK,SAAShiI,EAAQU,EAAOJ,G+NrtyBrE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAA6G,OAAAlkH,EAAA,sB/NytyBG65G,YAAY,GAAGooB,iBAAiB,MAAMC,KAAK,SAASliI,EAAQU,EAAOJ,GgO3tyBtE,GAAAm4G,GAAAz4G,EAAA,aACAugC,EAAAr8B,KAAAq8B,GAEAk4E,GAAAA,EAAA4E,EAAA,QACA8kB,MAAA,SAAAC,EAAAp7G,GAMA,IALA,GAIAs/D,GAAA+7C,EAJAC,EAAA,EACAriI,EAAA,EACAsxG,EAAArmD,UAAA1qD,OACA+hI,EAAA,EAEAhxB,EAAAtxG,GACAqmF,EAAA/lD,EAAA2qB,UAAAjrD,MACAqmF,EAAAi8C,GACAF,EAAAE,EAAAj8C,EACAg8C,EAAAA,EAAAD,EAAAA,EAAA,EACAE,EAAAj8C,GACAA,EAAA,GACA+7C,EAAA/7C,EAAAi8C,EACAD,GAAAD,EAAAA,GACAC,GAAAh8C,CAEA,OAAAi8C,KAAA3sD,EAAAA,EAAAA,EAAAA,EAAA2sD,EAAAr+H,KAAA28H,KAAAyB,QhOiuyBGzoB,YAAY,KAAK2oB,KAAK,SAASxiI,EAAQU,EAAOJ,GiOtvyBjD,GAAAm4G,GAAAz4G,EAAA,aACAyiI,EAAAv+H,KAAAw+H,IAGAjqB,GAAAA,EAAA4E,EAAA5E,EAAAnE,EAAAt0G,EAAA,YAAA,WACA,MAAA,IAAAyiI,EAAA,WAAA,IAAA,GAAAA,EAAAjiI,SACA,QACAkiI,KAAA,SAAA50H,EAAAmqC,GACA,GAAA0qF,GAAA,MACAC,GAAA90H,EACA+0H,GAAA5qF,EACA6qF,EAAAH,EAAAC,EACAG,EAAAJ,EAAAE,CACA,OAAA,GAAAC,EAAAC,IAAAJ,EAAAC,IAAA,IAAAG,EAAAD,GAAAH,EAAAE,IAAA,KAAA,KAAA,QjO4vyBGhpB,YAAY,GAAGC,WAAW,KAAKkpB,KAAK,SAAShjI,EAAQU,EAAOJ,GkOzwyB/D,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACA4lB,MAAA,SAAAn1H,GACA,MAAA5J,MAAA+R,IAAAnI,GAAA5J,KAAAg/H,YlO+wyBGrpB,YAAY,KAAKspB,KAAK,SAASnjI,EAAQU,EAAOJ,GmOnxyBjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAAkH,MAAAvkH,EAAA,qBnOuxyBG65G,YAAY,GAAGmnB,gBAAgB,MAAMoC,KAAK,SAASpjI,EAAQU,EAAOJ,GoOzxyBrE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACAgmB,KAAA,SAAAv1H,GACA,MAAA5J,MAAA+R,IAAAnI,GAAA5J,KAAA00H,SpO+xyBG/e,YAAY,KAAKypB,KAAK,SAAStjI,EAAQU,EAAOJ,GqOnyyBjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAAuG,KAAA5jH,EAAA,oBrOuyyBG65G,YAAY,GAAGwK,eAAe,MAAMkf,KAAK,SAASvjI,EAAQU,EAAOJ,GsOzyyBpE,GAAAm4G,GAAAz4G,EAAA,aACA0jH,EAAA1jH,EAAA,iBACA2mB,EAAAziB,KAAAyiB,GAGA8xF,GAAAA,EAAA4E,EAAA5E,EAAAnE,EAAAt0G,EAAA,YAAA,WACA,MAAA,SAAAkE,KAAAs/H,KAAA,UACA,QACAA,KAAA,SAAA11H,GACA,MAAA5J,MAAAq8B,IAAAzyB,GAAAA,GAAA,GACA41G,EAAA51G,GAAA41G,GAAA51G,IAAA,GACA6Y,EAAA7Y,EAAA,GAAA6Y,GAAA7Y,EAAA,KAAA5J,KAAAu/H,EAAA,QtO+yyBG5pB,YAAY,GAAGC,WAAW,GAAGioB,gBAAgB,MAAM2B,KAAK,SAAS1jI,EAAQU,EAAOJ,GuO1zyBnF,GAAAm4G,GAAAz4G,EAAA,aACA0jH,EAAA1jH,EAAA,iBACA2mB,EAAAziB,KAAAyiB,GAEA8xF,GAAAA,EAAA4E,EAAA,QACAsmB,KAAA,SAAA71H,GACA,GAAA/N,GAAA2jH,EAAA51G,GAAAA,GACA5M,EAAAwiH,GAAA51G,EACA,OAAA/N,IAAA61E,EAAAA,EAAA,EAAA10E,GAAA00E,EAAAA,EAAA,IAAA71E,EAAAmB,IAAAylB,EAAA7Y,GAAA6Y,GAAA7Y,SvOg0yBG+rG,YAAY,GAAGkoB,gBAAgB,MAAM6B,KAAK,SAAS5jI,EAAQU,EAAOJ,GwOx0yBrE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACAwmB,MAAA,SAAAvmG,GACA,OAAAA,EAAA,EAAAp5B,KAAA6mF,MAAA7mF,KAAAwrH,MAAApyF,QxO80yBGu8E,YAAY,KAAKiqB,KAAK,SAAS9jI,EAAQU,EAAOJ,GyOn1yBjD,YACA,IAAAyuG,GAAA/uG,EAAA,aACAs2G,EAAAt2G,EAAA,UACAgwG,EAAAhwG,EAAA,UACA84G,EAAA94G,EAAA,0BACA47G,EAAA57G,EAAA,mBACA24G,EAAA34G,EAAA,YACAgqH,EAAAhqH,EAAA,kBAAAE,EACA2pH,EAAA7pH,EAAA,kBAAAE,EACAi1G,EAAAn1G,EAAA,gBAAAE,EACAwrH,EAAA1rH,EAAA,kBAAAs9F,KACAue,EAAA,SACAkoB,EAAAh1B,EAAA8M,GACA3C,EAAA6qB,EACA5wG,EAAA4wG,EAAA59H,UAEA69H,EAAAh0B,EAAAhwG,EAAA,oBAAAmzB,KAAA0oF,EACAooB,EAAA,QAAAlhI,QAAAoD,UAGA+9H,EAAA,SAAAC,GACA,GAAA7mG,GAAAs+E,EAAAuoB,GAAA,EACA,IAAA,gBAAA7mG,IAAAA,EAAA98B,OAAA,EAAA,CACA88B,EAAA2mG,EAAA3mG,EAAAggE,OAAAouB,EAAApuF,EAAA,EACA,IACA8mG,GAAAlY,EAAAmY,EADAC,EAAAhnG,EAAA1f,WAAA,EAEA,IAAA,KAAA0mH,GAAA,KAAAA,GAEA,GADAF,EAAA9mG,EAAA1f,WAAA,GACA,KAAAwmH,GAAA,MAAAA,EAAA,MAAAnpB,SACA,IAAA,KAAAqpB,EAAA,CACA,OAAAhnG,EAAA1f,WAAA,IACA,IAAA,IAAA,IAAA,IAAAsuG,EAAA,EAAAmY,EAAA,EAAA,MACA,KAAA,IAAA,IAAA,KAAAnY,EAAA,EAAAmY,EAAA,EAAA,MACA,SAAA,OAAA/mG,EAEA,IAAA,GAAAl9B,GAAAmkI,EAAAjnG,EAAAr7B,MAAA,GAAAhC,EAAA,EAAAI,EAAAkkI,EAAA/jI,OAAAH,EAAAJ,EAAAA,IAIA,GAHAG,EAAAmkI,EAAA3mH,WAAA3d,GAGA,GAAAG,GAAAA,EAAAikI,EAAA,MAAAppB,IACA,OAAAjuG,UAAAu3H,EAAArY,IAEA,OAAA5uF,EAGA,KAAAymG,EAAA,UAAAA,EAAA,QAAAA,EAAA,QAAA,CACAA,EAAA,SAAAn5H,GACA,GAAA0yB,GAAA4tB,UAAA1qD,OAAA,EAAA,EAAAoK,EACAqoG,EAAAzsG,IACA,OAAAysG,aAAA8wB,KAEAC,EAAArrB,EAAA,WAAAxlF,EAAA4+F,QAAAxxH,KAAA0yG,KAAAjD,EAAAiD,IAAA4I,GACA/C,EAAA,GAAAI,GAAAgrB,EAAA5mG,IAAA21E,EAAA8wB,GAAAG,EAAA5mG,GAEA,KAAA,GAMA1oB,GANAk1C,EAAA9pD,EAAA,kBAAAgqH,EAAA9Q,GAAA,6KAMApsG,MAAA,KAAAvJ,EAAA,EAAAumD,EAAAtpD,OAAA+C,EAAAA,IACA+yG,EAAA4C,EAAAtkG,EAAAk1C,EAAAvmD,MAAA+yG,EAAAytB,EAAAnvH,IACAugG,EAAA4uB,EAAAnvH,EAAAi1G,EAAA3Q,EAAAtkG,GAGAmvH,GAAA59H,UAAAgtB,EACAA,EAAAjV,YAAA6lH,EACA/jI,EAAA,eAAA+uG,EAAA8M,EAAAkoB,MzOu1yBG9zB,SAAS,GAAG4G,iBAAiB,GAAGiD,WAAW,GAAGC,YAAY,GAAGxB,SAAS,IAAIyB,yBAAyB,IAAI/C,mBAAmB,IAAIC,eAAe,IAAI2W,iBAAiB,IAAIzD,iBAAiB,IAAIlQ,cAAc,IAAI0R,iBAAiB,IAAI7P,kBAAkB,MAAMyoB,KAAK,SAASxkI,EAAQU,EAAOJ,G0Oz5yB1R,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UAAAwG,QAAA3/G,KAAAo2E,IAAA,EAAA,S1O65yBGu/B,YAAY,KAAK4qB,KAAK,SAASzkI,EAAQU,EAAOJ,G2O/5yBjD,GAAAm4G,GAAAz4G,EAAA,aACA0kI,EAAA1kI,EAAA,aAAAk7G,QAEAzC,GAAAA,EAAA4E,EAAA,UACAnC,SAAA,SAAA59E,GACA,MAAA,gBAAAA,IAAAonG,EAAApnG,Q3Oq6yBGu8E,YAAY,GAAGE,YAAY,KAAK4qB,KAAK,SAAS3kI,EAAQU,EAAOJ,G4O16yBhE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UAAAunB,UAAA5kI,EAAA,qB5O86yBG65G,YAAY,GAAGgrB,gBAAgB,MAAMC,KAAK,SAAS9kI,EAAQU,EAAOJ,G6Oh7yBrE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UACAlkG,MAAA,SAAAs4G,GAEA,MAAAA,IAAAA,O7Os7yBG5X,YAAY,KAAKkrB,KAAK,SAAS/kI,EAAQU,EAAOJ,G8O37yBjD,GAAAm4G,GAAAz4G,EAAA,aACA4kI,EAAA5kI,EAAA,iBACAugC,EAAAr8B,KAAAq8B,GAEAk4E,GAAAA,EAAA4E,EAAA,UACA2nB,cAAA,SAAAvT,GACA,MAAAmT,GAAAnT,IAAAlxF,EAAAkxF,IAAA,sB9Oi8yBG5X,YAAY,GAAGgrB,gBAAgB,MAAMI,KAAK,SAASjlI,EAAQU,EAAOJ,G+Ov8yBrE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UAAA6nB,iBAAA,qB/O28yBGrrB,YAAY,KAAKsrB,KAAK,SAASnlI,EAAQU,EAAOJ,GgP78yBjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UAAA+nB,iBAAA,sBhPi9yBGvrB,YAAY,KAAKwrB,KAAK,SAASrlI,EAAQU,EAAOJ,GiPp9yBjD,GAAAm4G,GAAAz4G,EAAA,aACAyrH,EAAAzrH,EAAA,iBAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA3yC,OAAAv0D,YAAAq+G,GAAA,UAAAr+G,WAAAq+G,MjPu9yBG5R,YAAY,GAAGyrB,iBAAiB,MAAMC,KAAK,SAASvlI,EAAQU,EAAOJ,GkP19yBtE,GAAAm4G,GAAAz4G,EAAA,aACA+rH,EAAA/rH,EAAA,eAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA3yC,OAAA30D,UAAA++G,GAAA,UAAA/+G,SAAA++G,MlP69yBGlS,YAAY,GAAG2rB,eAAe,MAAMC,KAAK,SAASzlI,EAAQU,EAAOJ,GmPh+yBpE,YACA,IAAAm4G,GAAAz4G,EAAA,aACAyuH,EAAAzuH,EAAA,iBACA0lI,EAAA1lI,EAAA,qBACA0yD,EAAA1yD,EAAA,oBACA2lI,EAAA,GAAApoD,QACAwN,EAAA7mF,KAAA6mF,MACAnpF,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACAgkI,EAAA,wCACAC,EAAA,IAEAC,EAAA,SAAApmI,EAAAmH,GAGA,IAFA,GAAA5G,GAAA,GACAwb,EAAA5U,IACA5G,EAAA,GACAwb,GAAA/b,EAAAkC,EAAA3B,GACA2B,EAAA3B,GAAAwb,EAAA,IACAA,EAAAsvE,EAAAtvE,EAAA,MAGAsqH,EAAA,SAAArmI,GAGA,IAFA,GAAAO,GAAA,EACA4G,EAAA,IACA5G,GAAA,GACA4G,GAAAjF,EAAA3B,GACA2B,EAAA3B,GAAA8qF,EAAAlkF,EAAAnH,GACAmH,EAAAA,EAAAnH,EAAA,KAGAsmI,EAAA,WAGA,IAFA,GAAA/lI,GAAA,EACAL,EAAA,KACAK,GAAA,GACA,GAAA,KAAAL,GAAA,IAAAK,GAAA,IAAA2B,EAAA3B,GAAA,CACA,GAAAR,GAAAsD,OAAAnB,EAAA3B,GACAL,GAAA,KAAAA,EAAAH,EAAAG,EAAA8yD,EAAAnyD,KAAAslI,EAAA,EAAApmI,EAAAe,QAAAf,EAEA,MAAAG,IAEA06E,EAAA,SAAAxsE,EAAApO,EAAAg2E,GACA,MAAA,KAAAh2E,EAAAg2E,EAAAh2E,EAAA,IAAA,EAAA46E,EAAAxsE,EAAApO,EAAA,EAAAg2E,EAAA5nE,GAAAwsE,EAAAxsE,EAAAA,EAAApO,EAAA,EAAAg2E,IAEAz/D,EAAA,SAAAnI,GAGA,IAFA,GAAApO,GAAA,EACAitE,EAAA7+D,EACA6+D,GAAA,MACAjtE,GAAA,GACAitE,GAAA,IAEA,MAAAA,GAAA,GACAjtE,GAAA,EACAitE,GAAA,CACA,OAAAjtE,GAGA+4G,GAAAA,EAAA8E,EAAA9E,EAAAnE,KAAAqxB,IACA,UAAA,KAAApoD,QAAA,IACA,MAAA,GAAAA,QAAA,IACA,SAAA,MAAAA,QAAA,IACA,wBAAA,kBAAAA,QAAA,MACAv9E,EAAA,YAAA,WAEA2lI,EAAAplI,YACA,UACAg9E,QAAA,SAAA0oD,GACA,GAIAzmI,GAAAqb,EAAAtX,EAAAqU,EAJA9J,EAAA43H,EAAAl/H,KAAAo/H,GACA1lI,EAAAuuH,EAAAwX,GACArmI,EAAA,GACA0P,EAAAu2H,CAEA,IAAA,EAAA3lI,GAAAA,EAAA,GAAA,KAAAi7G,YAAAyqB,EAEA,IAAA93H,GAAAA,EAAA,MAAA,KACA,IAAA,OAAAA,GAAAA,GAAA,KAAA,MAAA/K,QAAA+K,EAKA,IAJA,EAAAA,IACAlO,EAAA,IACAkO,GAAAA,GAEAA,EAAA,MAKA,GAJAtO,EAAAyW,EAAAnI,EAAAwsE,EAAA,EAAA,GAAA,IAAA,GACAz/D,EAAA,EAAArb,EAAAsO,EAAAwsE,EAAA,GAAA96E,EAAA,GAAAsO,EAAAwsE,EAAA,EAAA96E,EAAA,GACAqb,GAAA,iBACArb,EAAA,GAAAA,EACAA,EAAA,EAAA,CAGA,IAFAsmI,EAAA,EAAAjrH,GACAtX,EAAArD,EACAqD,GAAA,GACAuiI,EAAA,IAAA,GACAviI,GAAA,CAIA,KAFAuiI,EAAAxrD,EAAA,GAAA/2E,EAAA,GAAA,GACAA,EAAA/D,EAAA,EACA+D,GAAA,IACAwiI,EAAA,GAAA,IACAxiI,GAAA,EAEAwiI,GAAA,GAAAxiI,GACAuiI,EAAA,EAAA,GACAC,EAAA,GACAz2H,EAAA02H,QAEAF,GAAA,EAAAjrH,GACAirH,EAAA,IAAAtmI,EAAA,GACA8P,EAAA02H,IAAAtzE,EAAAnyD,KAAAslI,EAAA3lI,EAQA,OALAA,GAAA,GACA0X,EAAAtI,EAAA9O,OACA8O,EAAA1P,GAAAM,GAAA0X,EAAA,KAAA86C,EAAAnyD,KAAAslI,EAAA3lI,EAAA0X,GAAAtI,EAAAA,EAAArN,MAAA,EAAA2V,EAAA1X,GAAA,IAAAoP,EAAArN,MAAA2V,EAAA1X,KAEAoP,EAAA1P,EAAA0P,EACAA,OnPq+yBG42H,oBAAoB,GAAGrsB,YAAY,GAAGC,WAAW,GAAG6V,mBAAmB,IAAIjB,gBAAgB,MAAMyX,KAAK,SAASnmI,EAAQU,EAAOJ,GoPplzBjI,YACA,IAAAm4G,GAAAz4G,EAAA,aACAomI,EAAApmI,EAAA,YACA0lI,EAAA1lI,EAAA,qBACAqmI,EAAA,GAAAC,WAEA7tB,GAAAA,EAAA8E,EAAA9E,EAAAnE,GAAA8xB,EAAA,WAEA,MAAA,MAAAC,EAAA9lI,KAAA,EAAAoI,YACAy9H,EAAA,WAEAC,EAAA9lI,YACA,UACA+lI,YAAA,SAAAC,GACA,GAAAtzB,GAAAyyB,EAAAl/H,KAAA,4CACA,OAAAmC,UAAA49H,EAAAF,EAAA9lI,KAAA0yG,GAAAozB,EAAA9lI,KAAA0yG,EAAAszB,QpPylzBGL,oBAAoB,GAAGrsB,YAAY,GAAGC,WAAW,KAAK0sB,KAAK,SAASxmI,EAAQU,EAAOJ,GqPvmzBtF,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,EAAA,UAAA2T,OAAAjoH,EAAA,wBrP2mzBG65G,YAAY,GAAG4sB,mBAAmB,MAAMC,KAAK,SAAS1mI,EAAQU,EAAOJ,GsP9mzBxE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UAAAviD,OAAA96D,EAAA,wBtPinzBG65G,YAAY,GAAG5C,mBAAmB,MAAM0vB,KAAK,SAAS3mI,EAAQU,EAAOJ,GuPnnzBxE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAt0G,EAAA,kBAAA,UAAAgvF,iBAAAhvF,EAAA,qBvPsnzBG62G,iBAAiB,GAAGgD,YAAY,GAAGsP,gBAAgB,MAAMyd,KAAK,SAAS5mI,EAAQU,EAAOJ,GwPxnzBzF,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAt0G,EAAA,kBAAA,UAAAg2D,eAAAh2D,EAAA,gBAAAE,MxP2nzBG22G,iBAAiB,GAAGgD,YAAY,GAAG3C,eAAe,MAAM2vB,KAAK,SAAS7mI,EAAQU,EAAOJ,GyP5nzBxF,GAAAowG,GAAA1wG,EAAA,gBACAqnF,EAAArnF,EAAA,WAAAqlH,QAEArlH,GAAA,iBAAA,SAAA,SAAA8mI,GACA,MAAA,UAAAxpG,GACA,MAAAwpG,IAAAp2B,EAAApzE,GAAAwpG,EAAAz/C,EAAA/pD,IAAAA,OzPkozBGqzE,eAAe,IAAIqG,UAAU,IAAI+vB,gBAAgB,MAAMC,KAAK,SAAShnI,EAAQU,EAAOJ,G0PvozBvF,GAAAyxG,GAAA/xG,EAAA,iBACAinI,EAAAjnI,EAAA,kBAAAE,CAEAF,GAAA,iBAAA,2BAAA,WACA,MAAA,UAAAs9B,EAAA1oB,GACA,MAAAqyH,GAAAl1B,EAAAz0E,GAAA1oB,Q1P6ozBGi5G,iBAAiB,IAAIkZ,gBAAgB,IAAI30B,gBAAgB,MAAM80B,KAAK,SAASlnI,EAAQU,EAAOJ,G2PlpzB/FN,EAAA,iBAAA,sBAAA,WACA,MAAAA,GAAA,sBAAAE,M3PupzBGinI,qBAAqB,IAAIJ,gBAAgB,MAAMK,KAAK,SAASpnI,EAAQU,EAAOJ,G4PxpzB/E,GAAAuwG,GAAA7wG,EAAA,gBACAqnI,EAAArnI,EAAA,gBAEAA,GAAA,iBAAA,iBAAA,WACA,MAAA,UAAAs9B,GACA,MAAA+pG,GAAAx2B,EAAAvzE,S5P8pzBGylF,gBAAgB,IAAIgkB,gBAAgB,IAAI11B,eAAe,MAAMi2B,KAAK,SAAStnI,EAAQU,EAAOJ,G6PnqzB7F,GAAAowG,GAAA1wG,EAAA,eAEAA,GAAA,iBAAA,eAAA,SAAAunI,GACA,MAAA,UAAAjqG,GACA,MAAAozE,GAAApzE,GAAAiqG,EAAAA,EAAAjqG,IAAA,GAAA,O7PyqzBGqzE,eAAe,IAAIo2B,gBAAgB,MAAMS,KAAK,SAASxnI,EAAQU,EAAOJ,G8P7qzBzE,GAAAowG,GAAA1wG,EAAA,eAEAA,GAAA,iBAAA,WAAA,SAAAynI,GACA,MAAA,UAAAnqG,GACA,MAAAozE,GAAApzE,GAAAmqG,EAAAA,EAAAnqG,IAAA,GAAA,O9PmrzBGqzE,eAAe,IAAIo2B,gBAAgB,MAAMW,KAAK,SAAS1nI,EAAQU,EAAOJ,G+PvrzBzE,GAAAowG,GAAA1wG,EAAA,eAEAA,GAAA,iBAAA,WAAA,SAAA2nI,GACA,MAAA,UAAArqG,GACA,MAAAozE,GAAApzE,GAAAqqG,EAAAA,EAAArqG,IAAA,GAAA,O/P6rzBGqzE,eAAe,IAAIo2B,gBAAgB,MAAMa,KAAK,SAAS5nI,EAAQU,EAAOJ,GgQjszBzE,GAAAm4G,GAAAz4G,EAAA,YACAy4G,GAAAA,EAAA4E,EAAA,UAAAv2B,GAAA9mF,EAAA,qBhQqszBG65G,YAAY,GAAGguB,gBAAgB,MAAMC,KAAK,SAAS9nI,EAAQU,EAAOJ,GiQtszBrE,GAAAuwG,GAAA7wG,EAAA,gBACAsqH,EAAAtqH,EAAA,iBAEAA,GAAA,iBAAA,OAAA,WACA,MAAA,UAAAs9B,GACA,MAAAgtF,GAAAzZ,EAAAvzE,SjQ4szBGs/E,iBAAiB,IAAImqB,gBAAgB,IAAI11B,eAAe,MAAM02B,KAAK,SAAS/nI,EAAQU,EAAOJ,GkQjtzB9F,GAAAowG,GAAA1wG,EAAA,gBACAqnF,EAAArnF,EAAA,WAAAqlH,QAEArlH,GAAA,iBAAA,oBAAA,SAAAgoI,GACA,MAAA,UAAA1qG,GACA,MAAA0qG,IAAAt3B,EAAApzE,GAAA0qG,EAAA3gD,EAAA/pD,IAAAA,OlQutzBGqzE,eAAe,IAAIqG,UAAU,IAAI+vB,gBAAgB,MAAMkB,KAAK,SAASjoI,EAAQU,EAAOJ,GmQ5tzBvF,GAAAowG,GAAA1wG,EAAA,gBACAqnF,EAAArnF,EAAA,WAAAqlH,QAEArlH,GAAA,iBAAA,OAAA,SAAAkoI,GACA,MAAA,UAAA5qG,GACA,MAAA4qG,IAAAx3B,EAAApzE,GAAA4qG,EAAA7gD,EAAA/pD,IAAAA,OnQkuzBGqzE,eAAe,IAAIqG,UAAU,IAAI+vB,gBAAgB,MAAMoB,KAAK,SAASnoI,EAAQU,EAAOJ,GoQvuzBvF,GAAAm4G,GAAAz4G,EAAA,YACAy4G,GAAAA,EAAA4E,EAAA,UAAAxuB,eAAA7uF,EAAA,gBAAA2zB,QpQ2uzBGkmF,YAAY,GAAG4G,eAAe,MAAM2nB,KAAK,SAASpoI,EAAQU,EAAOJ,GqQ7uzBpE,YAEA,IAAAi3G,GAAAv3G,EAAA,cACAuN,IACAA,GAAAvN,EAAA,UAAA,gBAAA,IACAuN,EAAA,IAAA,cACAvN,EAAA,eAAAkjD,OAAA/8C,UAAA,WAAA,WACA,MAAA,WAAAoxG,EAAA/wG,MAAA,MACA,KrQivzBGixG,aAAa,GAAGyC,cAAc,IAAI5J,SAAS,MAAM+3B,KAAK,SAASroI,EAAQU,EAAOJ,GsQzvzBjF,GAAAm4G,GAAAz4G,EAAA,aACAyrH,EAAAzrH,EAAA,iBAEAy4G,GAAAA,EAAAlmF,EAAAkmF,EAAAnE,GAAAlnG,YAAAq+G,IAAAr+G,WAAAq+G,MtQ4vzBG5R,YAAY,GAAGyrB,iBAAiB,MAAMgD,KAAK,SAAStoI,EAAQU,EAAOJ,GuQ/vzBtE,GAAAm4G,GAAAz4G,EAAA,aACA+rH,EAAA/rH,EAAA,eAEAy4G,GAAAA,EAAAlmF,EAAAkmF,EAAAnE,GAAAtnG,UAAA++G,IAAA/+G,SAAA++G,MvQkwzBGlS,YAAY,GAAG2rB,eAAe,MAAM+C,KAAK,SAASvoI,EAAQU,EAAOJ,GwQrwzBpE,YACA,IAqBAkoI,GAAAC,EAAAC,EAAAC,EArBAhnB,EAAA3hH,EAAA,cACA+uG,EAAA/uG,EAAA,aACAohE,EAAAphE,EAAA,UACAu3G,EAAAv3G,EAAA,cACAy4G,EAAAz4G,EAAA,aACA0wG,EAAA1wG,EAAA,gBACAszG,EAAAtzG,EAAA,iBACAq1G,EAAAr1G,EAAA,kBACA0xG,EAAA1xG,EAAA,aACA+zG,EAAA/zG,EAAA,0BACAynH,EAAAznH,EAAA,WAAA2zB,IACAi1G,EAAA5oI,EAAA,kBACA6oI,EAAA7oI,EAAA,6BACA8oI,EAAA9oI,EAAA,cACA+oI,EAAA/oI,EAAA,sBACAgpI,EAAA,UACAtyE,EAAAq4C,EAAAr4C,UACAqwD,EAAAhY,EAAAgY,QACAkiB,EAAAl6B,EAAAi6B,GACAhiB,EAAA,WAAAzP,EAAAwP,GACAmiB,EAAA,aAEA7c,EAAAoc,EAAAI,EAAA3oI,EAEAipI,IAAA,WACA,IAEA,GAAA3hB,GAAAyhB,EAAA3oH,QAAA,GACA8oH,GAAA5hB,EAAAtpG,gBAAAle,EAAA,UAAA,YAAA,SAAAuP,GACAA,EAAA25H,EAAAA,GAGA,QAAAliB,GAAA,kBAAAqiB,yBAAA7hB,EAAAloG,KAAA4pH,YAAAE,GACA,MAAA5pI,QAIA8pI,EAAA,SAAAhsG,GACA,GAAAhe,EACA,OAAAoxF,GAAApzE,IAAA,mBAAAhe,EAAAge,EAAAhe,MAAAA,GAAA,GAEA6c,EAAA,SAAAqrF,EAAA+hB,GACA,IAAA/hB,EAAApxD,GAAA,CACAoxD,EAAApxD,IAAA,CACA,IAAAlkB,GAAAs1E,EAAAgiB,EACAZ,GAAA,WAgCA,IA/BA,GAAAh+H,GAAA48G,EAAAiiB,GACAC,EAAA,GAAAliB,EAAAjxD,GACAt2D,EAAA,EACA4jE,EAAA,SAAA8lE,GACA,GAIAtlI,GAAAib,EAJA0sB,EAAA09F,EAAAC,EAAAD,GAAAC,EAAAC,KACAtpH,EAAAqpH,EAAArpH,QACA+U,EAAAs0G,EAAAt0G,OACA4xF,EAAA0iB,EAAA1iB,MAEA,KACAj7E,GACA09F,IACA,GAAAliB,EAAAqiB,IAAAC,EAAAtiB,GACAA,EAAAqiB,GAAA,GAEA79F,KAAA,EAAA3nC,EAAAuG,GAEAq8G,GAAAA,EAAAE,QACA9iH,EAAA2nC,EAAAphC,GACAq8G,GAAAA,EAAAC,QAEA7iH,IAAAslI,EAAAniB,QACAnyF,EAAAqhC,EAAA,yBACAp3C,EAAAgqH,EAAAjlI,IACAib,EAAA/e,KAAA8D,EAAAic,EAAA+U,GACA/U,EAAAjc,IACAgxB,EAAAzqB,GACA,MAAApL,GACA61B,EAAA71B,KAGA0yC,EAAA1xC,OAAAP,GAAA4jE,EAAA3xB,EAAAjyC,KACAunH,GAAAgiB,MACAhiB,EAAApxD,IAAA,EACAmzE,IAAA/hB,EAAAqiB,IAAAE,EAAAviB,OAGAuiB,EAAA,SAAAviB,GACAC,EAAAlnH,KAAAwuG,EAAA,WACA,GAEA1qG,GAAA2nC,EAAAh2B,EAFApL,EAAA48G,EAAAiiB,GACAO,EAAAC,EAAAziB,EAeA,IAbAwiB,IACA3lI,EAAAykI,EAAA,WACA9hB,EACAD,EAAAmjB,KAAA,qBAAAt/H,EAAA48G,IACAx7E,EAAA+iE,EAAAo7B,sBACAn+F,GAAAw7E,QAAAA,EAAA4iB,OAAAx/H,KACAoL,EAAA+4F,EAAA/4F,UAAAA,EAAA8e,OACA9e,EAAA8e,MAAA,8BAAAlqB,KAIA48G,EAAAqiB,GAAA7iB,GAAAijB,EAAAziB,GAAA,EAAA,GACAA,EAAA6iB,GAAA1hI,OACAqhI,GAAA3lI,EAAA7E,EAAA,KAAA6E,GAAA9C,KAGA0oI,EAAA,SAAAziB,GACA,GAAA,GAAAA,EAAAqiB,GAAA,OAAA,CAIA,KAHA,GAEAF,GAFAz3F,EAAAs1E,EAAA6iB,IAAA7iB,EAAAgiB,GACAvpI,EAAA,EAEAiyC,EAAA1xC,OAAAP,GAEA,GADA0pI,EAAAz3F,EAAAjyC,KACA0pI,EAAAC,OAAAK,EAAAN,EAAAniB,SAAA,OAAA,CACA,QAAA,GAEAsiB,EAAA,SAAAtiB,GACAC,EAAAlnH,KAAAwuG,EAAA,WACA,GAAA/iE,EACAg7E,GACAD,EAAAmjB,KAAA,mBAAA1iB,IACAx7E,EAAA+iE,EAAAu7B,qBACAt+F,GAAAw7E,QAAAA,EAAA4iB,OAAA5iB,EAAAiiB,QAIAc,EAAA,SAAA3/H,GACA,GAAA48G,GAAAhhH,IACAghH,GAAAnxD,KACAmxD,EAAAnxD,IAAA,EACAmxD,EAAAA,EAAAgjB,IAAAhjB,EACAA,EAAAiiB,GAAA7+H,EACA48G,EAAAjxD,GAAA,EACAixD,EAAA6iB,KAAA7iB,EAAA6iB,GAAA7iB,EAAAgiB,GAAAvnI,SACAk6B,EAAAqrF,GAAA,KAEAijB,EAAA,SAAA7/H,GACA,GACA0U,GADAkoG,EAAAhhH,IAEA,KAAAghH,EAAAnxD,GAAA,CACAmxD,EAAAnxD,IAAA,EACAmxD,EAAAA,EAAAgjB,IAAAhjB,CACA,KACA,GAAAA,IAAA58G,EAAA,KAAA8rD,GAAA,qCACAp3C,EAAAgqH,EAAA1+H,IACAg+H,EAAA,WACA,GAAA7yB,IAAAy0B,GAAAhjB,EAAAnxD,IAAA,EACA,KACA/2C,EAAA/e,KAAAqK,EAAAw2D,EAAAqpE,EAAA10B,EAAA,GAAA30C,EAAAmpE,EAAAx0B,EAAA,IACA,MAAAv2G,GACA+qI,EAAAhqI,KAAAw1G,EAAAv2G,OAIAgoH,EAAAiiB,GAAA7+H,EACA48G,EAAAjxD,GAAA,EACAp6B,EAAAqrF,GAAA,IAEA,MAAAhoH,GACA+qI,EAAAhqI,MAAAiqI,GAAAhjB,EAAAnxD,IAAA,GAAA72D,KAKA2pI,KAEAF,EAAA,SAAAyB,GACAr1B,EAAA7uG,KAAAyiI,EAAAD,EAAA,MACA11B,EAAAo3B,GACAlC,EAAAjoI,KAAAiG,KACA,KACAkkI,EAAAtpE,EAAAqpE,EAAAjkI,KAAA,GAAA46D,EAAAmpE,EAAA/jI,KAAA,IACA,MAAA2Z,GACAoqH,EAAAhqI,KAAAiG,KAAA2Z,KAIAqoH,EAAA,SAAAkC,GACAlkI,KAAAgjI,MACAhjI,KAAA6jI,GAAA1hI,OACAnC,KAAA+vD,GAAA,EACA/vD,KAAA6vD,IAAA,EACA7vD,KAAAijI,GAAA9gI,OACAnC,KAAAqjI,GAAA,EACArjI,KAAA4vD,IAAA,GAEAoyE,EAAAriI,UAAAnG,EAAA,mBAAAipI,EAAA9iI,WAEAmZ,KAAA,SAAAqrH,EAAAC,GACA,GAAAjB,GAAAtd,EAAAtY,EAAAvtG,KAAAyiI,GAOA,OANAU,GAAAD,GAAA,kBAAAiB,GAAAA,GAAA,EACAhB,EAAAC,KAAA,kBAAAgB,IAAAA,EACAjB,EAAA1iB,OAAAD,EAAAD,EAAAE,OAAAt+G,OACAnC,KAAAgjI,GAAA9lI,KAAAimI,GACAnjI,KAAA6jI,IAAA7jI,KAAA6jI,GAAA3mI,KAAAimI,GACAnjI,KAAA+vD,IAAAp6B,EAAA31B,MAAA,GACAmjI,EAAAniB,SAGAqjB,QAAA,SAAAD,GACA,MAAApkI,MAAA8Y,KAAA3W,OAAAiiI,MAGAlC,EAAA,WACA,GAAAlhB,GAAA,GAAAghB,EACAhiI,MAAAghH,QAAAA,EACAhhH,KAAA8Z,QAAA8gD,EAAAqpE,EAAAjjB,EAAA,GACAhhH,KAAA6uB,OAAA+rC,EAAAmpE,EAAA/iB,EAAA,IAEAqhB,EAAA3oI,EAAAmsH,EAAA,SAAA/5F,GACA,MAAAA,KAAA22G,GAAA32G,IAAAq2G,EACA,GAAAD,GAAAp2G,GACAm2G,EAAAn2G,KAIAmmF,EAAAA,EAAAlmF,EAAAkmF,EAAAmB,EAAAnB,EAAAnE,GAAA60B,GAAA9qH,QAAA4qH,IACAjpI,EAAA,wBAAAipI,EAAAD,GACAhpI,EAAA,kBAAAgpI,GACAL,EAAA3oI,EAAA,WAAAgpI,GAGAvwB,EAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA60B,EAAAH,GAEA3zG,OAAA,SAAA11B,GACA,GAAAmrI,GAAAze,EAAA7lH,MACAshH,EAAAgjB,EAAAz1G,MAEA,OADAyyF,GAAAnoH,GACAmrI,EAAAtjB,WAGA/O,EAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAqN,IAAAwnB,GAAAH,GAEA1oH,QAAA,SAAAxS,GACA,MAAAi7H,GAAApnB,GAAAn7G,OAAAmiI,EAAAM,EAAAziI,KAAAsH,MAGA2qG,EAAAA,EAAA4E,EAAA5E,EAAAnE,IAAA60B,GAAAnpI,EAAA,kBAAA,SAAA2xG,GACAs3B,EAAA3vG,IAAAq4E,GAAA,SAAAu3B,MACAF,GAEA1vG,IAAA,SAAA48E,GACA,GAAA5jF,GAAA9rB,KACAskI,EAAAze,EAAA/5F,GACAhS,EAAAwqH,EAAAxqH,QACA+U,EAAAy1G,EAAAz1G,OACAhxB,EAAAykI,EAAA,WACA,GAAAlmB,MACAr8G,EAAA,EACAwkI,EAAA,CACAr5B,GAAAwE,GAAA,EAAA,SAAAsR,GACA,GAAAwjB,GAAAzkI,IACA0kI,GAAA,CACAroB,GAAAl/G,KAAAiF,QACAoiI,IACAz4G,EAAAhS,QAAAknG,GAAAloG,KAAA,SAAA1U,GACAqgI,IACAA,GAAA,EACAroB,EAAAooB,GAAApgI,IACAmgI,GAAAzqH,EAAAsiG,KACAvtF,OAEA01G,GAAAzqH,EAAAsiG,IAGA,OADAv+G,GAAA7E,GAAA61B,EAAAhxB,EAAA9C,GACAupI,EAAAtjB,SAGA0jB,KAAA,SAAAh1B,GACA,GAAA5jF,GAAA9rB,KACAskI,EAAAze,EAAA/5F,GACA+C,EAAAy1G,EAAAz1G,OACAhxB,EAAAykI,EAAA,WACAp3B,EAAAwE,GAAA,EAAA,SAAAsR,GACAl1F,EAAAhS,QAAAknG,GAAAloG,KAAAwrH,EAAAxqH,QAAA+U,MAIA,OADAhxB,GAAA7E,GAAA61B,EAAAhxB,EAAA9C,GACAupI,EAAAtjB,axQ0wzBG/T,gBAAgB,GAAGmD,iBAAiB,GAAGa,aAAa,GAAGkG,UAAU,GAAGxK,SAAS,GAAG0G,YAAY,GAAGhI,YAAY,GAAGkI,YAAY,GAAGpJ,eAAe,IAAIsJ,iBAAiB,IAAI6I,aAAa,IAAIqoB,eAAe,IAAI5e,4BAA4B,IAAI6e,aAAa,IAAIC,qBAAqB,IAAIl0B,kBAAkB,IAAIC,iBAAiB,IAAI+C,uBAAuB,IAAI4d,yBAAyB,IAAIrQ,UAAU,IAAIpX,SAAS,MAAMg7B,KAAK,SAAStrI,EAAQU,EAAOJ,GyQ9h0Bnb,GAAAm4G,GAAAz4G,EAAA,aACAszG,EAAAtzG,EAAA,iBACA43G,EAAA53G,EAAA,gBACAurI,GAAAvrI,EAAA,aAAAsrH,aAAA9xC,MACAgyD,EAAAl8B,SAAA91B,KAEAi/B,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAt0G,EAAA,YAAA,WACAurI,EAAA,gBACA,WACA/xD,MAAA,SAAAtwC,EAAAuiG,EAAAC,GACA,GAAAl5G,GAAA8gF,EAAApqE,GACAyiG,EAAA/zB,EAAA8zB,EACA,OAAAH,GAAAA,EAAA/4G,EAAAi5G,EAAAE,GAAAH,EAAAjrI,KAAAiyB,EAAAi5G,EAAAE,QzQoi0BGl4B,gBAAgB,GAAG4E,eAAe,GAAGwB,YAAY,GAAGC,WAAW,GAAGC,YAAY,KAAK6xB,KAAK,SAAS5rI,EAAQU,EAAOJ,G0Qhj0BnH,GAAAm4G,GAAAz4G,EAAA,aACA86D,EAAA96D,EAAA,oBACAszG,EAAAtzG,EAAA,iBACA43G,EAAA53G,EAAA,gBACA0wG,EAAA1wG,EAAA,gBACA24G,EAAA34G,EAAA,YACA8I,EAAA9I,EAAA,WACA6rI,GAAA7rI,EAAA,aAAAsrH,aAAAjX,UAIAy3B,EAAAnzB,EAAA,WACA,QAAArE,MACA,QAAAu3B,EAAA,gBAAAv3B,YAAAA,MAEAy3B,GAAApzB,EAAA,WACAkzB,EAAA,eAGApzB,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAAw3B,GAAAC,GAAA,WACA13B,UAAA,SAAA23B,EAAAz3B,GACAjB,EAAA04B,GACAp0B,EAAArD,EACA,IAAA03B,GAAA/gF,UAAA1qD,OAAA,EAAAwrI,EAAA14B,EAAApoD,UAAA,GACA,IAAA6gF,IAAAD,EAAA,MAAAD,GAAAG,EAAAz3B,EAAA03B,EACA,IAAAD,GAAAC,EAAA,CAEA,OAAA13B,EAAA/zG,QACA,IAAA,GAAA,MAAA,IAAAwrI,EACA,KAAA,GAAA,MAAA,IAAAA,GAAAz3B,EAAA,GACA,KAAA,GAAA,MAAA,IAAAy3B,GAAAz3B,EAAA,GAAAA,EAAA,GACA,KAAA,GAAA,MAAA,IAAAy3B,GAAAz3B,EAAA,GAAAA,EAAA,GAAAA,EAAA,GACA,KAAA,GAAA,MAAA,IAAAy3B,GAAAz3B,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IAGA,GAAA23B,IAAA,KAEA,OADAA,GAAAxoI,KAAA81E,MAAA0yD,EAAA33B,GACA,IAAAzrG,EAAA0wE,MAAAwyD,EAAAE,IAGA,GAAA/4G,GAAA84G,EAAA9lI,UACAgoF,EAAArzB,EAAA41C,EAAAv9E,GAAAA,EAAA+vB,OAAA/8C,WACA9B,EAAAirG,SAAA91B,MAAAj5E,KAAAyrI,EAAA79C,EAAAomB,EACA,OAAA7D,GAAArsG,GAAAA,EAAA8pF,O1Qsj0BGslB,gBAAgB,GAAG4E,eAAe,GAAG2nB,UAAU,GAAGnmB,YAAY,GAAGC,WAAW,GAAGC,YAAY,GAAGpJ,eAAe,IAAIsG,mBAAmB,MAAMk1B,KAAK,SAASnsI,EAAQU,EAAOJ,G2Qjm0B1K,GAAA60G,GAAAn1G,EAAA,gBACAy4G,EAAAz4G,EAAA,aACA43G,EAAA53G,EAAA,gBACA47G,EAAA57G,EAAA,kBAGAy4G,GAAAA,EAAA4E,EAAA5E,EAAAnE,EAAAt0G,EAAA,YAAA,WAEAsrH,QAAAt1D,eAAAm/C,EAAAj1G,KAAA,GAAA0K,MAAA,IAAA,GAAAA,MAAA,MACA,WACAorD,eAAA,SAAA9sB,EAAAkjG,EAAAz3D,GACAijC,EAAA1uE,GACAkjG,EAAAxwB,EAAAwwB,GAAA,GACAx0B,EAAAjjC,EACA,KAEA,MADAwgC,GAAAj1G,EAAAgpC,EAAAkjG,EAAAz3D,IACA,EACA,MAAAn1E,GACA,OAAA,Q3Qwm0BG64G,eAAe,GAAGwB,YAAY,GAAGC,WAAW,GAAG5C,eAAe,IAAI6E,kBAAkB,MAAMswB,KAAK,SAASrsI,EAAQU,EAAOJ,G4Q1n0B1H,GAAAm4G,GAAAz4G,EAAA,aACA6pH,EAAA7pH,EAAA,kBAAAE,EACA03G,EAAA53G,EAAA,eAEAy4G,GAAAA,EAAA4E,EAAA,WACAivB,eAAA,SAAApjG,EAAAkjG,GACA,GAAAzxF,GAAAkvE,EAAAjS,EAAA1uE,GAAAkjG,EACA,OAAAzxF,KAAAA,EAAAi0C,cAAA,QAAA1lD,GAAAkjG,Q5Qgo0BG/zB,eAAe,GAAGwB,YAAY,GAAGgU,iBAAiB,MAAM0e,KAAK,SAASvsI,EAAQU,EAAOJ,G6Qxo0BxF,YAEA,IAAAm4G,GAAAz4G,EAAA,aACA43G,EAAA53G,EAAA,gBACAwsI,EAAA,SAAA/1B,GACAjwG,KAAA+uD,GAAAqiD,EAAAnB,GACAjwG,KAAAgwD,GAAA,CACA,IACA5hD,GADAk1C,EAAAtjD,KAAAmwG,KAEA,KAAA/hG,IAAA6hG,GAAA3sD,EAAApmD,KAAAkR,GAEA5U,GAAA,kBAAAwsI,EAAA,SAAA,WACA,GAEA53H,GAFAq+F,EAAAzsG,KACAsjD,EAAAmpD,EAAA0D,EAEA,GACA,IAAA1D,EAAAz8C,IAAA1M,EAAAtpD,OAAA,OAAAoK,MAAAjC,OAAAwuB,MAAA,YACAviB,EAAAk1C,EAAAmpD,EAAAz8C,QAAAy8C,GAAA19C,IACA,QAAA3qD,MAAAgK,EAAAuiB,MAAA,KAGAshF,EAAAA,EAAA4E,EAAA,WACAovB,UAAA,SAAAvjG,GACA,MAAA,IAAAsjG,GAAAtjG,Q7Q6o0BGmvE,eAAe,GAAGwB,YAAY,GAAGgJ,iBAAiB,MAAM6pB,KAAK,SAAS1sI,EAAQU,EAAOJ,G8Qnq0BxF,GAAAupH,GAAA7pH,EAAA,kBACAy4G,EAAAz4G,EAAA,aACA43G,EAAA53G,EAAA,eAEAy4G,GAAAA,EAAA4E,EAAA,WACAyM,yBAAA,SAAA5gF,EAAAkjG,GACA,MAAAviB,GAAA3pH,EAAA03G,EAAA1uE,GAAAkjG,Q9Qyq0BG/zB,eAAe,GAAGwB,YAAY,GAAGgU,iBAAiB,MAAM8e,KAAK,SAAS3sI,EAAQU,EAAOJ,G+Q/q0BxF,GAAAm4G,GAAAz4G,EAAA,aACA4sI,EAAA5sI,EAAA,iBACA43G,EAAA53G,EAAA,eAEAy4G,GAAAA,EAAA4E,EAAA,WACA9tB,eAAA,SAAArmD,GACA,MAAA0jG,GAAAh1B,EAAA1uE,S/Qqr0BGmvE,eAAe,GAAGwB,YAAY,GAAGkJ,gBAAgB,MAAM8pB,KAAK,SAAS7sI,EAAQU,EAAOJ,GgRpr0BvF,QAAAwvC,GAAA5G,EAAAkjG,GACA,GACAzxF,GAAAxnB,EADA25G,EAAA5hF,UAAA1qD,OAAA,EAAA0oC,EAAAgiB,UAAA,EAEA,OAAA0sD,GAAA1uE,KAAA4jG,EAAA5jG,EAAAkjG,IACAzxF,EAAAkvE,EAAA3pH,EAAAgpC,EAAAkjG,IAAA91B,EAAA37D,EAAA,SACAA,EAAA/vC,MACAjC,SAAAgyC,EAAA7K,IACA6K,EAAA7K,IAAAvvC,KAAAusI,GACAnkI,OACA+nG,EAAAv9E,EAAAo8D,EAAArmD,IAAA4G,EAAA3c,EAAAi5G,EAAAU,GAAA,OAhBA,GAAAjjB,GAAA7pH,EAAA,kBACAuvF,EAAAvvF,EAAA,iBACAs2G,EAAAt2G,EAAA,UACAy4G,EAAAz4G,EAAA,aACA0wG,EAAA1wG,EAAA,gBACA43G,EAAA53G,EAAA,eAcAy4G,GAAAA,EAAA4E,EAAA,WAAAvtE,IAAAA,MhR+r0BGuoE,eAAe,GAAGwB,YAAY,GAAGtB,SAAS,IAAI5H,eAAe,IAAIkd,iBAAiB,IAAI9K,gBAAgB,MAAMgqB,KAAK,SAAS/sI,EAAQU,EAAOJ,GiRlt0B5I,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,WACA/G,IAAA,SAAAptE,EAAAkjG,GACA,MAAAA,KAAAljG,QjRwt0BG2wE,YAAY,KAAKmzB,KAAK,SAAShtI,EAAQU,EAAOJ,GkR5t0BjD,GAAAm4G,GAAAz4G,EAAA,aACA43G,EAAA53G,EAAA,gBACAunI,EAAArkF,OAAA+hE,YAEAxM,GAAAA,EAAA4E,EAAA,WACA4H,aAAA,SAAA/7E,GAEA,MADA0uE,GAAA1uE,GACAq+F,EAAAA,EAAAr+F,IAAA,OlRku0BGmvE,eAAe,GAAGwB,YAAY,KAAKozB,KAAK,SAASjtI,EAAQU,EAAOJ,GmRzu0BnE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,WAAAkO,QAAAvrH,EAAA,mBnR6u0BG65G,YAAY,GAAGqzB,cAAc,MAAMC,KAAK,SAASntI,EAAQU,EAAOJ,GoR/u0BnE,GAAAm4G,GAAAz4G,EAAA,aACA43G,EAAA53G,EAAA,gBACAgoI,EAAA9kF,OAAAiiE,iBAEA1M,GAAAA,EAAA4E,EAAA,WACA8H,kBAAA,SAAAj8E,GACA0uE,EAAA1uE,EACA,KAEA,MADA8+F,IAAAA,EAAA9+F,IACA,EACA,MAAA1pC,GACA,OAAA,QpRsv0BG64G,eAAe,GAAGwB,YAAY,KAAKuzB,KAAK,SAASptI,EAAQU,EAAOJ,GqRjw0BnE,GAAAm4G,GAAAz4G,EAAA,aACAqtI,EAAArtI,EAAA,eAEAqtI,IAAA50B,EAAAA,EAAA4E,EAAA,WACAxuB,eAAA,SAAA3lD,EAAA/V,GACAk6G,EAAAlyG,MAAA+N,EAAA/V,EACA,KAEA,MADAk6G,GAAA15G,IAAAuV,EAAA/V,IACA,EACA,MAAA3zB,GACA,OAAA,QrRww0BGq6G,YAAY,GAAG4G,eAAe,MAAM6sB,KAAK,SAASttI,EAAQU,EAAOJ,GsRzw0BpE,QAAAqzB,GAAAuV,EAAAkjG,EAAAmB,GACA,GAEAC,GAAAr6G,EAFA25G,EAAA5hF,UAAA1qD,OAAA,EAAA0oC,EAAAgiB,UAAA,GACAuiF,EAAA5jB,EAAA3pH,EAAA03G,EAAA1uE,GAAAkjG,EAEA,KAAAqB,EAAA,CACA,GAAA/8B,EAAAv9E,EAAAo8D,EAAArmD,IACA,MAAAvV,GAAAR,EAAAi5G,EAAAmB,EAAAT,EAEAW,GAAAhzB,EAAA,GAEA,MAAAnE,GAAAm3B,EAAA,SACAA,EAAA9+C,YAAA,GAAA+hB,EAAAo8B,IACAU,EAAA3jB,EAAA3pH,EAAA4sI,EAAAV,IAAA3xB,EAAA,GACA+yB,EAAA5iI,MAAA2iI,EACAp4B,EAAAj1G,EAAA4sI,EAAAV,EAAAoB,IACA,IAJA,EAMA7kI,SAAA8kI,EAAA95G,KAAA,GAAA85G,EAAA95G,IAAApzB,KAAAusI,EAAAS,IAAA,GA1BA,GAAAp4B,GAAAn1G,EAAA,gBACA6pH,EAAA7pH,EAAA,kBACAuvF,EAAAvvF,EAAA,iBACAs2G,EAAAt2G,EAAA,UACAy4G,EAAAz4G,EAAA,aACAy6G,EAAAz6G,EAAA,oBACA43G,EAAA53G,EAAA,gBACA0wG,EAAA1wG,EAAA,eAsBAy4G,GAAAA,EAAA4E,EAAA,WAAA1pF,IAAAA,MtRsx0BG0kF,eAAe,GAAGwB,YAAY,GAAGtB,SAAS,IAAI5H,eAAe,IAAIuG,eAAe,IAAI2W,iBAAiB,IAAI9K,gBAAgB,IAAIrI,mBAAmB,MAAMgzB,KAAK,SAAS1tI,EAAQU,EAAOJ,GuRpz0BtL,GAAAyuG,GAAA/uG,EAAA,aACA84G,EAAA94G,EAAA,0BACAm1G,EAAAn1G,EAAA,gBAAAE,EACA8pH,EAAAhqH,EAAA,kBAAAE,EACAmhH,EAAArhH,EAAA,gBACA2tI,EAAA3tI,EAAA,YACA4tI,EAAA7+B,EAAAvqG,OACA00G,EAAA00B,EACAz6G,EAAAy6G,EAAAznI,UACA0nI,EAAA,KACAC,EAAA,KAEAC,EAAA,GAAAH,GAAAC,KAAAA,CAEA,IAAA7tI,EAAA,qBAAA+tI,GAAA/tI,EAAA,YAAA,WAGA,MAFA8tI,GAAA9tI,EAAA,UAAA,WAAA,EAEA4tI,EAAAC,IAAAA,GAAAD,EAAAE,IAAAA,GAAA,QAAAF,EAAAC,EAAA,QACA,CACAD,EAAA,SAAA7sI,EAAAb,GACA,GAAA8tI,GAAAxnI,eAAAonI,GACAK,EAAA5sB,EAAAtgH,GACAmtI,EAAAvlI,SAAAzI,CACA,QAAA8tI,GAAAC,GAAAltI,EAAAmd,cAAA0vH,GAAAM,EAAAntI,EACA+3G,EAAAi1B,EACA,GAAA70B,GAAA+0B,IAAAC,EAAAntI,EAAAo9B,OAAAp9B,EAAAb,GACAg5G,GAAA+0B,EAAAltI,YAAA6sI,IAAA7sI,EAAAo9B,OAAAp9B,EAAAktI,GAAAC,EAAAP,EAAAptI,KAAAQ,GAAAb,GACA8tI,EAAAxnI,KAAA2sB,EAAAy6G,GASA,KAAA,GAPAO,IAAA,SAAAv5H,GACAA,IAAAg5H,IAAAz4B,EAAAy4B,EAAAh5H,GACAg6E,cAAA,EACA9+C,IAAA,WAAA,MAAAopE,GAAAtkG,IACA+e,IAAA,SAAA2J,GAAA47E,EAAAtkG,GAAA0oB,OAGAwsB,EAAAkgE,EAAA9Q,GAAAj5G,EAAA,EAAA6pD,EAAAtpD,OAAAP,GAAAkuI,EAAArkF,EAAA7pD,KACAkzB,GAAAjV,YAAA0vH,EACAA,EAAAznI,UAAAgtB,EACAnzB,EAAA,eAAA+uG,EAAA,SAAA6+B,GAGA5tI,EAAA,kBAAA,YvRuz0BG62G,iBAAiB,GAAGiD,WAAW,GAAGs0B,WAAW,GAAGr0B,YAAY,GAAGC,yBAAyB,IAAI6U,eAAe,IAAI3X,eAAe,IAAIkT,iBAAiB,IAAIlQ,cAAc,IAAI9C,iBAAiB,IAAI9G,SAAS,MAAM+9B,KAAK,SAASruI,EAAQU,EAAOJ,GwRh20B7ON,EAAA,mBAAA,KAAA,KAAAsuI,OAAAtuI,EAAA,gBAAAE,EAAAsE,OAAA2B,UAAA,SACAyoF,cAAA,EACA9+C,IAAA9vC,EAAA,gBxRq20BG62G,iBAAiB,GAAGu3B,WAAW,GAAGl3B,eAAe,MAAMq3B,KAAK,SAASvuI,EAAQU,EAAOJ,GyRv20BvFN,EAAA,iBAAA,QAAA,EAAA,SAAAi+G,EAAAJ,EAAA2wB,GAEA,OAAA,SAAAC,GACA,YACA,IAAAx/B,GAAAgP,EAAAz3G,MACAguG,EAAA7rG,QAAA8lI,EAAA9lI,OAAA8lI,EAAA5wB,EACA,OAAAl1G,UAAA6rG,EAAAA,EAAAj0G,KAAAkuI,EAAAx/B,GAAA,GAAAzqG,QAAAiqI,GAAA5wB,GAAA96G,OAAAksG,KACAu/B,OzR420BGE,gBAAgB,KAAKC,KAAK,SAAS3uI,EAAQU,EAAOJ,G0Rn30BrDN,EAAA,iBAAA,UAAA,EAAA,SAAAi+G,EAAA2wB,EAAAC,GAEA,OAAA,SAAAC,EAAAC,GACA,YACA,IAAA9/B,GAAAgP,EAAAz3G,MACAguG,EAAA7rG,QAAAmmI,EAAAnmI,OAAAmmI,EAAAF,EACA,OAAAjmI,UAAA6rG,EACAA,EAAAj0G,KAAAuuI,EAAA7/B,EAAA8/B,GACAF,EAAAtuI,KAAAwC,OAAAksG,GAAA6/B,EAAAC,IACAF,O1Rw30BGH,gBAAgB,KAAKM,KAAK,SAAShvI,EAAQU,EAAOJ,G2Rj40BrDN,EAAA,iBAAA,SAAA,EAAA,SAAAi+G,EAAAgxB,EAAAC,GAEA,OAAA,SAAAT,GACA,YACA,IAAAx/B,GAAAgP,EAAAz3G,MACAguG,EAAA7rG,QAAA8lI,EAAA9lI,OAAA8lI,EAAAQ,EACA,OAAAtmI,UAAA6rG,EAAAA,EAAAj0G,KAAAkuI,EAAAx/B,GAAA,GAAAzqG,QAAAiqI,GAAAQ,GAAAlsI,OAAAksG,KACAigC,O3Rs40BGR,gBAAgB,KAAKS,KAAK,SAASnvI,EAAQU,EAAOJ,G4R740BrDN,EAAA,iBAAA,QAAA,EAAA,SAAAi+G,EAAAmxB,EAAAC,GACA,YACA,IAAAhuB,GAAArhH,EAAA,gBACAsvI,EAAAD,EACAE,KAAA7rI,KACA8rI,EAAA,QACAC,EAAA,SACAC,EAAA,WACA,IACA,KAAA,OAAAF,GAAA,QAAA,IACA,GAAA,OAAAA,GAAA,OAAA,IAAAC,IACA,GAAA,KAAAD,GAAA,WAAAC,IACA,GAAA,IAAAD,GAAA,YAAAC,IACA,IAAAD,GAAA,QAAAC,GAAA,GACA,GAAAD,GAAA,MAAAC,GACA,CACA,GAAAE,GAAAhnI,SAAA,OAAA4G,KAAA,IAAA,EAEA8/H,GAAA,SAAAvZ,EAAA8Z,GACA,GAAAzoF,GAAApkD,OAAAyD,KACA,IAAAmC,SAAAmtH,GAAA,IAAA8Z,EAAA,QAEA,KAAAvuB,EAAAyU,GAAA,MAAAwZ,GAAA/uI,KAAA4mD,EAAA2uE,EAAA8Z,EACA,IASAC,GAAAt4F,EAAAu4F,EAAAC,EAAA9vI,EATA+hF,KACAssD,GAAAxY,EAAArX,WAAA,IAAA,KACAqX,EAAApX,UAAA,IAAA,KACAoX,EAAAnX,QAAA,IAAA,KACAmX,EAAAlX,OAAA,IAAA,IACAoxB,EAAA,EACAC,EAAAtnI,SAAAinI,EAAA,WAAAA,IAAA,EAEAM,EAAA,GAAA1rI,QAAAsxH,EAAA33F,OAAAmwG,EAAA,IAIA,KADAqB,IAAAE,EAAA,GAAArrI,QAAA,IAAA0rI,EAAA/xG,OAAA,WAAAmwG,KACA/2F,EAAA24F,EAAA3gI,KAAA43C,MAEA2oF,EAAAv4F,EAAAhxC,MAAAgxC,EAAA,GAAAk4F,KACAK,EAAAE,IACAhuD,EAAAt+E,KAAAyjD,EAAAllD,MAAA+tI,EAAAz4F,EAAAhxC,SAGAopI,GAAAp4F,EAAAk4F,GAAA,GAAAl4F,EAAA,GAAAhzC,QAAAsrI,EAAA,WACA,IAAA5vI,EAAA,EAAAA,EAAAirD,UAAAukF,GAAA,EAAAxvI,IAAA0I,SAAAuiD,UAAAjrD,KAAAs3C,EAAAt3C,GAAA0I,UAEA4uC,EAAAk4F,GAAA,GAAAl4F,EAAAhxC,MAAA4gD,EAAAsoF,IAAAF,EAAA/1D,MAAAwI,EAAAzqC,EAAAt1C,MAAA,IACA8tI,EAAAx4F,EAAA,GAAAk4F,GACAO,EAAAF,EACA9tD,EAAAytD,IAAAQ,MAEAC,EAAAR,KAAAn4F,EAAAhxC,OAAA2pI,EAAAR,IAKA,OAHAM,KAAA7oF,EAAAsoF,IACAM,IAAAG,EAAA3iI,KAAA,MAAAy0E,EAAAt+E,KAAA,IACAs+E,EAAAt+E,KAAAyjD,EAAAllD,MAAA+tI,IACAhuD,EAAAytD,GAAAQ,EAAAjuD,EAAA//E,MAAA,EAAAguI,GAAAjuD,OAGA,IAAAwtD,GAAA7mI,OAAA,GAAA8mI,KACAJ,EAAA,SAAAvZ,EAAA8Z,GACA,MAAAjnI,UAAAmtH,GAAA,IAAA8Z,KAAAN,EAAA/uI,KAAAiG,KAAAsvH,EAAA8Z,IAIA,QAAA,SAAA9Z,EAAA8Z,GACA,GAAA3gC,GAAAgP,EAAAz3G,MACAguG,EAAA7rG,QAAAmtH,EAAAntH,OAAAmtH,EAAAsZ,EACA,OAAAzmI,UAAA6rG,EAAAA,EAAAj0G,KAAAu1H,EAAA7mB,EAAA2gC,GAAAP,EAAA9uI,KAAAwC,OAAAksG,GAAA6mB,EAAA8Z,IACAP,O5Rk50BGX,gBAAgB,GAAG7f,eAAe,MAAMshB,KAAK,SAASnwI,EAAQU,EAAOJ,G6Rv90BxE,YACAN,GAAA,qBACA,IAAA43G,GAAA53G,EAAA,gBACA2tI,EAAA3tI,EAAA,YACAw1G,EAAAx1G,EAAA,kBACA6sH,EAAA,WACAC,EAAA,IAAAD,GAEA7d,EAAA,SAAAwF,GACAx0G,EAAA,eAAAwE,OAAA2B,UAAA0mH,EAAArY,GAAA,GAIAx0G,GAAA,YAAA,WAAA,MAAA,QAAA8sH,EAAAvsH,MAAA49B,OAAA,IAAAmwG,MAAA,QACAt/B,EAAA,WACA,GAAAprD,GAAAg0D,EAAApxG,KACA,OAAA,IAAA8iD,OAAA1F,EAAAzlB,OAAA,IACA,SAAAylB,GAAAA,EAAA0qF,OAAA94B,GAAA5xD,YAAAp/C,QAAAmpI,EAAAptI,KAAAqjD,GAAAj7C,UAGAmkH,EAAAxpH,MAAAupH,GACA7d,EAAA,WACA,MAAA8d,GAAAvsH,KAAAiG,U7R490BG6xG,eAAe,GAAGxB,iBAAiB,GAAGiD,WAAW,GAAGs0B,WAAW,GAAGl0B,cAAc,IAAIk2B,qBAAqB,MAAMC,KAAK,SAASrwI,EAAQU,EAAOJ,G8Rl/0B/I,YACA,IAAAkgI,GAAAxgI,EAAA,wBACA01G,EAAA11G,EAAA,0BACAswI,EAAA,KAGA5vI,GAAAJ,QAAAN,EAAA,iBAAAswI,EAAA,SAAAxgG,GACA,MAAA,YAAA,MAAAA,GAAAtpC,KAAA0kD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,WAGAwa,IAAA,SAAAvY,GACA,MAAA41H,GAAAjqB,IAAAb,EAAAlvG,KAAA8pI,GAAA1lI,EAAA,IAAAA,EAAA,EAAAA,EAAAA,KAEA41H,K9Rq/0BGE,gBAAgB,GAAGC,uBAAuB,GAAGtpB,yBAAyB,MAAMk5B,KAAK,SAASvwI,EAAQU,EAAOJ,G+Rlg1B5G,YAEAN,GAAA,kBAAA,SAAA,SAAAgvH,GACA,MAAA,UAAA1rH,GACA,MAAA0rH,GAAAxoH,KAAA,IAAA,OAAAlD,Q/Rug1BGktI,iBAAiB,MAAMC,KAAK,SAASzwI,EAAQU,EAAOJ,GgS3g1BvD,YAEAN,GAAA,kBAAA,MAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,MAAA,GAAA,ShSgh1BGgqI,iBAAiB,MAAME,KAAK,SAAS1wI,EAAQU,EAAOJ,GiSph1BvD,YAEAN,GAAA,kBAAA,QAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,QAAA,GAAA,SjSyh1BGgqI,iBAAiB,MAAMG,KAAK,SAAS3wI,EAAQU,EAAOJ,GkS7h1BvD,YAEAN,GAAA,kBAAA,OAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,IAAA,GAAA,SlSki1BGgqI,iBAAiB,MAAMI,KAAK,SAAS5wI,EAAQU,EAAOJ,GmSti1BvD,YACA,IAAAm4G,GAAAz4G,EAAA,aACA6wI,EAAA7wI,EAAA,iBAAA,EACAy4G,GAAAA,EAAA8E,EAAA,UAEAuzB,YAAA,SAAAxnI,GACA,MAAAunI,GAAArqI,KAAA8C,QnS2i1BGuwG,YAAY,GAAGk3B,eAAe,MAAMC,KAAK,SAAShxI,EAAQU,EAAOJ,GoShj1BpE,YACA,IAAAm4G,GAAAz4G,EAAA,aACA+wG,EAAA/wG,EAAA,gBACAixI,EAAAjxI,EAAA,qBACAkxI,EAAA,WACAC,EAAA,GAAAD,EAEAz4B,GAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAt0G,EAAA,sBAAAkxI,GAAA,UACAE,SAAA,SAAAxiB,GACA,GAAA3b,GAAAg+B,EAAAzqI,KAAAooH,EAAAsiB,GACAG,EAAAnmF,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,OACA6/B,EAAAuoE,EAAAkC,EAAAzyG,QACAyM,EAAAtE,SAAA0oI,EAAA7oG,EAAAtkC,KAAAC,IAAA4sG,EAAAsgC,GAAA7oG,GACAlgB,EAAAvlB,OAAA6rH,EACA,OAAAuiB,GACAA,EAAA5wI,KAAA0yG,EAAA3qF,EAAArb,GACAgmG,EAAAhxG,MAAAgL,EAAAqb,EAAA9nB,OAAAyM,KAAAqb,OpSsj1BGuxF,YAAY,GAAGy3B,qBAAqB,GAAGC,oBAAoB,IAAIngC,eAAe,MAAMogC,KAAK,SAASxxI,EAAQU,EAAOJ,GqSvk1BpH,YAEAN,GAAA,kBAAA,QAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,KAAA,GAAA,SrS4k1BGgqI,iBAAiB,MAAMiB,KAAK,SAASzxI,EAAQU,EAAOJ,GsShl1BvD,YAEAN,GAAA,kBAAA,YAAA,SAAAgvH,GACA,MAAA,UAAA1hH,GACA,MAAA0hH,GAAAxoH,KAAA,OAAA,QAAA8G,QtSql1BGkjI,iBAAiB,MAAMkB,KAAK,SAAS1xI,EAAQU,EAAOJ,GuSzl1BvD,YAEAN,GAAA,kBAAA,WAAA,SAAAgvH,GACA,MAAA,UAAA33G,GACA,MAAA23G,GAAAxoH,KAAA,OAAA,OAAA6Q,QvS8l1BGm5H,iBAAiB,MAAMmB,KAAK,SAAS3xI,EAAQU,EAAOJ,GwSlm1BvD,GAAAm4G,GAAAz4G,EAAA,aACA8wG,EAAA9wG,EAAA,wBACAgD,EAAAD,OAAAC,aACA4uI,EAAA7uI,OAAA8uI,aAGAp5B,GAAAA,EAAA4E,EAAA5E,EAAAnE,KAAAs9B,GAAA,GAAAA,EAAApxI,QAAA,UAEAqxI,cAAA,SAAA/jI,GAKA,IAJA,GAGA1N,GAHAwe,KACA2yF,EAAArmD,UAAA1qD,OACAP,EAAA,EAEAsxG,EAAAtxG,GAAA,CAEA,GADAG,GAAA8qD,UAAAjrD,KACA6wG,EAAA1wG,EAAA,WAAAA,EAAA,KAAA+6G,YAAA/6G,EAAA,6BACAwe,GAAAlb,KAAA,MAAAtD,EACA4C,EAAA5C,GACA4C,IAAA5C,GAAA,QAAA,IAAA,MAAAA,EAAA,KAAA,QAEA,MAAAwe,GAAAogC,KAAA,SxSum1BG66D,YAAY,GAAG1I,uBAAuB,MAAM2gC,KAAK,SAAS9xI,EAAQU,EAAOJ,GyS1n1B5E,YACA,IAAAm4G,GAAAz4G,EAAA,aACAixI,EAAAjxI,EAAA,qBACA+xI,EAAA,UAEAt5B,GAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAt0G,EAAA,sBAAA+xI,GAAA,UACAlc,SAAA,SAAAjH,GACA,SAAAqiB,EAAAzqI,KAAAooH,EAAAmjB,GACAvuI,QAAAorH,EAAA1jE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,azSgo1BGkxG,YAAY,GAAGy3B,qBAAqB,GAAGC,oBAAoB,MAAMS,KAAK,SAAShyI,EAAQU,EAAOJ,G0Szo1BjG,YAEAN,GAAA,kBAAA,UAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,IAAA,GAAA,S1S8o1BGgqI,iBAAiB,MAAMyB,KAAK,SAASjyI,EAAQU,EAAOJ,G2Slp1BvD,YACA,IAAAuwI,GAAA7wI,EAAA,iBAAA,EAGAA,GAAA,kBAAA+C,OAAA,SAAA,SAAA0zG,GACAjwG,KAAA+uD,GAAAxyD,OAAA0zG,GACAjwG,KAAAgwD,GAAA,GAEA,WACA,GAEA07E,GAFAjjC,EAAAzoG,KAAA+uD,GACAhvD,EAAAC,KAAAgwD,EAEA,OAAAjwD,IAAA0oG,EAAAzuG,QAAAoK,MAAAjC,OAAAwuB,MAAA,IACA+6G,EAAArB,EAAA5hC,EAAA1oG,GACAC,KAAAgwD,IAAA07E,EAAA1xI,QACAoK,MAAAsnI,EAAA/6G,MAAA,Q3Ssp1BG2/E,iBAAiB,IAAIi6B,eAAe,MAAMoB,KAAK,SAASnyI,EAAQU,EAAOJ,G4Srq1B1E,YAEAN,GAAA,kBAAA,OAAA,SAAAgvH,GACA,MAAA,UAAA1qH,GACA,MAAA0qH,GAAAxoH,KAAA,IAAA,OAAAlC,Q5S0q1BGksI,iBAAiB,MAAM4B,KAAK,SAASpyI,EAAQU,EAAOJ,G6S9q1BvD,GAAAm4G,GAAAz4G,EAAA,aACA+xG,EAAA/xG,EAAA,iBACA+wG,EAAA/wG,EAAA,eAEAy4G,GAAAA,EAAA4E,EAAA;AAEAg1B,IAAA,SAAAC,GAMA,IALA,GAAAC,GAAAxgC,EAAAugC,EAAAD,KACA7pG,EAAAuoE,EAAAwhC,EAAA/xI,QACA+wG,EAAArmD,UAAA1qD,OACAoe,KACA3e,EAAA,EACAuoC,EAAAvoC,GACA2e,EAAAlb,KAAAX,OAAAwvI,EAAAtyI,OACAsxG,EAAAtxG,GAAA2e,EAAAlb,KAAAX,OAAAmoD,UAAAjrD,IACA,OAAA2e,GAAAogC,KAAA,S7Smr1BG66D,YAAY,GAAGzH,gBAAgB,IAAIhB,eAAe,MAAMohC,KAAK,SAASxyI,EAAQU,EAAOJ,G8Sls1BxF,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA8E,EAAA,UAEA7qD,OAAA1yD,EAAA,wB9Sss1BG65G,YAAY,GAAG8V,mBAAmB,MAAM8iB,KAAK,SAASzyI,EAAQU,EAAOJ,G+S1s1BxE,YAEAN,GAAA,kBAAA,QAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,QAAA,GAAA,S/S+s1BGgqI,iBAAiB,MAAMkC,KAAK,SAAS1yI,EAAQU,EAAOJ,GgTlt1BvD,YACA,IAAAm4G,GAAAz4G,EAAA,aACA+wG,EAAA/wG,EAAA,gBACAixI,EAAAjxI,EAAA,qBACA2yI,EAAA,aACAC,EAAA,GAAAD,EAEAl6B,GAAAA,EAAA8E,EAAA9E,EAAAnE,EAAAt0G,EAAA,sBAAA2yI,GAAA,UACAE,WAAA,SAAAjkB,GACA,GAAA3b,GAAAg+B,EAAAzqI,KAAAooH,EAAA+jB,GACApsI,EAAAwqG,EAAA7sG,KAAAC,IAAA+mD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,OAAAsqG,EAAAzyG,SACA8nB,EAAAvlB,OAAA6rH,EACA,OAAAgkB,GACAA,EAAAryI,KAAA0yG,EAAA3qF,EAAA/hB,GACA0sG,EAAAhxG,MAAAsE,EAAAA,EAAA+hB,EAAA9nB,UAAA8nB,OhTwt1BGuxF,YAAY,GAAGy3B,qBAAqB,GAAGC,oBAAoB,IAAIngC,eAAe,MAAM0hC,KAAK,SAAS9yI,EAAQU,EAAOJ,GiTvu1BpH,YAEAN,GAAA,kBAAA,SAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,SAAA,GAAA,SjT4u1BGgqI,iBAAiB,MAAMuC,KAAK,SAAS/yI,EAAQU,EAAOJ,GkThv1BvD,YAEAN,GAAA,kBAAA,MAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,MAAA,GAAA,SlTqv1BGgqI,iBAAiB,MAAMwC,KAAK,SAAShzI,EAAQU,EAAOJ,GmTzv1BvD,YAEAN,GAAA,kBAAA,MAAA,SAAAgvH,GACA,MAAA,YACA,MAAAA,GAAAxoH,KAAA,MAAA,GAAA,SnT8v1BGgqI,iBAAiB,MAAMyC,KAAK,SAASjzI,EAAQU,EAAOJ,GoTlw1BvD,YAEAN,GAAA,kBAAA,OAAA,SAAA0rH,GACA,MAAA,YACA,MAAAA,GAAAllH,KAAA,QpTuw1BGolH,iBAAiB,MAAMsnB,KAAK,SAASlzI,EAAQU,EAAOJ,GqT3w1BvD,YAEA,IAAAyuG,GAAA/uG,EAAA,aACAs2G,EAAAt2G,EAAA,UACAw1G,EAAAx1G,EAAA,kBACAy4G,EAAAz4G,EAAA,aACA04G,EAAA14G,EAAA,eACA+kH,EAAA/kH,EAAA,WAAAo5G,IACAgtB,EAAApmI,EAAA,YACAylH,EAAAzlH,EAAA,aACA64G,EAAA74G,EAAA,wBACAkuH,EAAAluH,EAAA,UACAk+G,EAAAl+G,EAAA,UACA87H,EAAA97H,EAAA,cACAmzI,EAAAnzI,EAAA,iBACAozI,EAAApzI,EAAA,gBACAy2D,EAAAz2D,EAAA,eACA43G,EAAA53G,EAAA,gBACA+xG,EAAA/xG,EAAA,iBACA47G,EAAA57G,EAAA,mBACAy6G,EAAAz6G,EAAA,oBACAqzI,EAAArzI,EAAA,oBACAszI,EAAAtzI,EAAA,sBACA0yH,EAAA1yH,EAAA,kBACAyyH,EAAAzyH,EAAA,gBACAsqH,EAAAtqH,EAAA,kBACA6pH,EAAA6I,EAAAxyH,EACAi1G,EAAAsd,EAAAvyH,EACA8pH,EAAAspB,EAAApzI,EACA67H,EAAAhtB,EAAAhxF,OACAw1H,EAAAxkC,EAAAxnE,KACAisG,EAAAD,GAAAA,EAAAxrG,UACAi1E,EAAA,YACAy2B,EAAAv1B,EAAA,WACAwhB,EAAAxhB,EAAA,eACAxB,KAAAmE,qBACA6yB,EAAAjuB,EAAA,mBACAkuB,EAAAluB,EAAA,WACAmuB,EAAAnuB,EAAA,cACAmF,EAAA1nE,OAAA85D,GACAmsB,EAAA,kBAAApN,GACA8X,EAAA9kC,EAAA8kC,QAEAzc,GAAAyc,IAAAA,EAAA72B,KAAA62B,EAAA72B,GAAA82B,UAGAC,EAAAv+B,GAAA4wB,EAAA,WACA,MAEA,IAFAiN,EAAAl+B,KAAA,KACArlE,IAAA,WAAA,MAAAqlE,GAAA3uG,KAAA,KAAAoE,MAAA,IAAA7K,MACAA,IACA,SAAAu9B,EAAA1oB,EAAA05G,GACA,GAAA0lB,GAAAnqB,EAAAe,EAAAh2G,EACAo/H,UAAAppB,GAAAh2G,GACAugG,EAAA73E,EAAA1oB,EAAA05G,GACA0lB,GAAA12G,IAAAstF,GAAAzV,EAAAyV,EAAAh2G,EAAAo/H,IACA7+B,EAEA8+B,EAAA,SAAAppI,GACA,GAAAqpI,GAAAP,EAAA9oI,GAAAwoI,EAAAtX,EAAA/e,GAEA,OADAk3B,GAAAv9B,GAAA9rG,EACAqpI,GAGAC,EAAAhL,GAAA,gBAAApN,GAAA/9G,SAAA,SAAAsf,GACA,MAAA,gBAAAA,IACA,SAAAA,GACA,MAAAA,aAAAy+F,IAGAvhB,EAAA,SAAAl9E,EAAA1oB,EAAA05G,GAKA,MAJAhxF,KAAAstF,GAAApQ,EAAAo5B,EAAAh/H,EAAA05G,GACA1W,EAAAt6E,GACA1oB,EAAAgnG,EAAAhnG,GAAA,GACAgjG,EAAA0W,GACAhY,EAAAq9B,EAAA/+H,IACA05G,EAAA5/B,YAIA4nB,EAAAh5E,EAAAm2G,IAAAn2G,EAAAm2G,GAAA7+H,KAAA0oB,EAAAm2G,GAAA7+H,IAAA,GACA05G,EAAA+kB,EAAA/kB,GAAA5/B,WAAA+rB,EAAA,GAAA,OAJAnE,EAAAh5E,EAAAm2G,IAAAt+B,EAAA73E,EAAAm2G,EAAAh5B,EAAA,OACAn9E,EAAAm2G,GAAA7+H,IAAA,GAIAm/H,EAAAz2G,EAAA1oB,EAAA05G,IACAnZ,EAAA73E,EAAA1oB,EAAA05G,IAEA8lB,EAAA,SAAA92G,EAAAigF,GACA3F,EAAAt6E,EAKA,KAJA,GAGA1oB,GAHAk1C,EAAAspF,EAAA71B,EAAAxL,EAAAwL,IACAt9G,EAAA,EACAI,EAAAypD,EAAAtpD,OAEAH,EAAAJ,GAAAu6G,EAAAl9E,EAAA1oB,EAAAk1C,EAAA7pD,KAAAs9G,EAAA3oG,GACA,OAAA0oB,IAEAm1E,EAAA,SAAAn1E,EAAAigF,GACA,MAAA50G,UAAA40G,EAAA81B,EAAA/1G,GAAA82G,EAAAf,EAAA/1G,GAAAigF,IAEA82B,EAAA,SAAAz/H,GACA,GAAA6uH,GAAA/mB,EAAAn8G,KAAAiG,KAAAoO,EAAAgnG,EAAAhnG,GAAA,GACA,OAAApO,QAAAokH,GAAAtU,EAAAq9B,EAAA/+H,KAAA0hG,EAAAs9B,EAAAh/H,IAAA,EACA6uH,IAAAntB,EAAA9vG,KAAAoO,KAAA0hG,EAAAq9B,EAAA/+H,IAAA0hG,EAAA9vG,KAAAitI,IAAAjtI,KAAAitI,GAAA7+H,GAAA6uH,GAAA,GAEAwD,EAAA,SAAA3pG,EAAA1oB,GAGA,GAFA0oB,EAAAy0E,EAAAz0E,GACA1oB,EAAAgnG,EAAAhnG,GAAA,GACA0oB,IAAAstF,IAAAtU,EAAAq9B,EAAA/+H,IAAA0hG,EAAAs9B,EAAAh/H,GAAA,CACA,GAAA05G,GAAAzE,EAAAvsF,EAAA1oB,EAEA,QADA05G,IAAAhY,EAAAq9B,EAAA/+H,IAAA0hG,EAAAh5E,EAAAm2G,IAAAn2G,EAAAm2G,GAAA7+H,KAAA05G,EAAA5/B,YAAA,GACA4/B,IAEAgmB,EAAA,SAAAh3G,GAKA,IAJA,GAGA1oB,GAHAk2G,EAAAd,EAAAjY,EAAAz0E,IACAj5B,KACApE,EAAA,EAEA6qH,EAAAtqH,OAAAP,GACAq2G,EAAAq9B,EAAA/+H,EAAAk2G,EAAA7qH,OAAA2U,GAAA6+H,GAAA7+H,GAAAmwG,GAAA1gH,EAAAX,KAAAkR,EACA,OAAAvQ,IAEAkwI,EAAA,SAAAj3G,GAMA,IALA,GAIA1oB,GAJA4/H,EAAAl3G,IAAAstF,EACAE,EAAAd,EAAAwqB,EAAAZ,EAAA7hC,EAAAz0E,IACAj5B,KACApE,EAAA,EAEA6qH,EAAAtqH,OAAAP,GACAq2G,EAAAq9B,EAAA/+H,EAAAk2G,EAAA7qH,QAAAu0I,EAAAl+B,EAAAsU,EAAAh2G,IAAA,IAAAvQ,EAAAX,KAAAiwI,EAAA/+H,GACA,OAAAvQ,GAIA8kI,KACApN,EAAA,WACA,GAAAv1H,eAAAu1H,GAAA,KAAArlE,WAAA,+BACA,IAAA7rD,GAAAqjH,EAAAhjE,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,QACA2tH,EAAA,SAAA1rH,GACApE,OAAAokH,GAAA0L,EAAA/1H,KAAAqzI,EAAAhpI,GACA0rG,EAAA9vG,KAAAitI,IAAAn9B,EAAA9vG,KAAAitI,GAAA5oI,KAAArE,KAAAitI,GAAA5oI,IAAA,GACAkpI,EAAAvtI,KAAAqE,EAAA4vG,EAAA,EAAA7vG,IAGA,OADA4qG,IAAA4hB,GAAA2c,EAAAnpB,EAAA//G,GAAA+jF,cAAA,EAAAj7D,IAAA2iG,IACA2d,EAAAppI,IAEA6tG,EAAAqjB,EAAA/e,GAAA,WAAA,WACA,MAAAx2G,MAAAmwG,KAGA+b,EAAAxyH,EAAA+mI,EACAxU,EAAAvyH,EAAAs6G,EACAx6G,EAAA,kBAAAE,EAAAozI,EAAApzI,EAAAo0I,EACAt0I,EAAA,iBAAAE,EAAAm0I,EACAr0I,EAAA,kBAAAE,EAAAq0I,EAEA/+B,IAAAx1G,EAAA,eACA04G,EAAAkS,EAAA,uBAAAypB,GAAA,GAGAvY,EAAA57H,EAAA,SAAAoD,GACA,MAAA2wI,GAAA/1B,EAAA56G,MAIAm1G,EAAAA,EAAAlmF,EAAAkmF,EAAAmB,EAAAnB,EAAAnE,GAAA60B,GAAAprH,OAAAg+G,GAEA,KAAA,GAAA0Y,IAAA,iHAGA3nI,MAAA,KAAAvJ,GAAA,EAAAkxI,GAAAj0I,OAAA+C,IAAA26G,EAAAu2B,GAAAlxI,MAEA,KAAA,GAAAmxI,IAAApqB,EAAApM,EAAAlrC,OAAAp7D,GAAA,EAAA88H,GAAAl0I,OAAAoX,IAAAu7H,EAAAuB,GAAA98H,MAEA6gG,GAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA60B,EAAA,UAEAwL,MAAA,SAAA//H,GACA,MAAA0hG,GAAAo9B,EAAA9+H,GAAA,IACA8+H,EAAA9+H,GACA8+H,EAAA9+H,GAAAmnH,EAAAnnH,IAGAggI,OAAA,SAAAV,GACA,IAAAC,EAAAD,GAAA,KAAAx9E,WAAAw9E,EAAA,oBACA,KAAA,GAAAt/H,KAAA8+H,GAAA,GAAAA,EAAA9+H,KAAAs/H,EAAA,MAAAt/H,IAEAigI,UAAA,WAAAzd,GAAA,GACA0d,UAAA,WAAA1d,GAAA,KAGA3e,EAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA60B,EAAA,UAEAruE,OAAA23C,EAEAz8C,eAAAwkD,EAEAxrB,iBAAAolD,EAEAtqB,yBAAAmd,EAEA/c,oBAAAoqB,EAEA5pB,sBAAA6pB,IAIAhB,GAAA96B,EAAAA,EAAA4E,EAAA5E,EAAAnE,IAAA60B,GAAA/C,EAAA,WACA,GAAA/oB,GAAA0e,GAIA,OAAA,UAAAyX,GAAAn2B,KAAA,MAAAm2B,GAAAzzI,EAAAs9G,KAAA,MAAAm2B,EAAAtwF,OAAAm6D,OACA,QACAt1E,UAAA,SAAAzK,GACA,GAAA30B,SAAA20B,IAAA62G,EAAA72G,GAAA,CAIA,IAHA,GAEA8vF,GAAA2nB,EAFAxgC,GAAAj3E,GACAr9B,EAAA,EAEAirD,UAAA1qD,OAAAP,GAAAs0G,EAAA7wG,KAAAwnD,UAAAjrD,KAQA,OAPAmtH,GAAA7Y,EAAA,GACA,kBAAA6Y,KAAA2nB,EAAA3nB,IACA2nB,IAAAt+E,EAAA22D,MAAAA,EAAA,SAAAx4G,EAAAhK,GAEA,MADAmqI,KAAAnqI,EAAAmqI,EAAAx0I,KAAAiG,KAAAoO,EAAAhK,IACAupI,EAAAvpI,GAAA,OAAAA,IAEA2pG,EAAA,GAAA6Y,EACAomB,EAAAh6D,MAAA+5D,EAAAh/B,OAKAwnB,EAAA/e,GAAA0iB,IAAA1/H,EAAA,WAAA+7H,EAAA/e,GAAA0iB,EAAA3D,EAAA/e,GAAA+U,SAEAlZ,EAAAkjB,EAAA,UAEAljB,EAAA30G,KAAA,QAAA,GAEA20G,EAAA9J,EAAAxnE,KAAA,QAAA,KrT8w1BG8wE,eAAe,GAAGxB,iBAAiB,GAAGm+B,eAAe,GAAGn7B,YAAY,GAAGC,WAAW,GAAGC,YAAY,GAAGxB,SAAS,IAAIlI,UAAU,IAAIwD,cAAc,IAAIiP,aAAa,IAAI9L,UAAU,IAAIC,mBAAmB,IAAIC,eAAe,IAAI2W,iBAAiB,IAAIzD,iBAAiB,IAAI+c,qBAAqB,IAAIxqB,iBAAiB,IAAIC,iBAAiB,IAAIC,gBAAgB,IAAInC,mBAAmB,IAAIR,cAAc,IAAIC,uBAAuB,IAAIoM,YAAY,IAAInU,gBAAgB,IAAI2J,kBAAkB,IAAIuJ,SAAS,IAAIhV,SAAS,IAAI2kC,gBAAgB,IAAIjZ,aAAa,MAAMkZ,KAAK,SAASl1I,EAAQU,EAAOJ,GsTv/1B1jB,YACA,IAAAm4G,GAAAz4G,EAAA,aACAiyH,EAAAjyH,EAAA,YACA6I,EAAA7I,EAAA,mBACA43G,EAAA53G,EAAA,gBACA8wG,EAAA9wG,EAAA,wBACA+wG,EAAA/wG,EAAA,gBACA0wG,EAAA1wG,EAAA,gBACAkhB,EAAAlhB,EAAA,aAAAkhB,YACA6yF,EAAA/zG,EAAA,0BACA8yH,EAAAjqH,EAAAqY,YACA6xG,EAAAlqH,EAAAmqH,SACAmiB,EAAAljB,EAAAgF,KAAA/1G,EAAAk0H,OACA/e,EAAAvD,EAAA3sH,UAAAlE,MACAuyH,EAAAvC,EAAAuC,KACA7B,EAAA,aAEAla,GAAAA,EAAAlmF,EAAAkmF,EAAAmB,EAAAnB,EAAAnE,GAAApzF,IAAA4xG,IAAA5xG,YAAA4xG,IAEAra,EAAAA,EAAA4E,EAAA5E,EAAAnE,GAAA2d,EAAAoC,OAAA1B,GAEAyiB,OAAA,SAAA93G,GACA,MAAA63G,IAAAA,EAAA73G,IAAAozE,EAAApzE,IAAAk3F,IAAAl3F,MAIAm7E,EAAAA,EAAA8E,EAAA9E,EAAAiF,EAAAjF,EAAAnE,EAAAt0G,EAAA,YAAA,WACA,OAAA,GAAA8yH,GAAA,GAAA7wH,MAAA,EAAA0G,QAAAlG,aACAkwH,GAEA1wH,MAAA,SAAA8K,EAAAE,GACA,GAAAtE,SAAA0tH,GAAA1tH,SAAAsE,EAAA,MAAAopH,GAAA91H,KAAAq3G,EAAApxG,MAAAuG,EAQA,KAPA,GAAAy7B,GAAAovE,EAAApxG,MAAA/D,WACA6hI,EAAAxzB,EAAA/jG,EAAAy7B,GACA6sG,EAAAvkC,EAAAnoG,SAAAsE,EAAAu7B,EAAAv7B,EAAAu7B,GACAnkC,EAAA,IAAA0vG,EAAAvtG,KAAAssH,IAAA/hB,EAAAskC,EAAA/Q,IACAgR,EAAA,GAAAviB,GAAAvsH,MACA+uI,EAAA,GAAAxiB,GAAA1uH,GACAkC,EAAA,EACA8uI,EAAA/Q,GACAiR,EAAA9a,SAAAl0H,IAAA+uI,EAAA3a,SAAA2J,KACA,OAAAjgI,MAIArE,EAAA,kBAAA2yH,KtT0/1BGta,eAAe,GAAGwB,YAAY,GAAGC,WAAW,GAAGC,YAAY,GAAGpJ,eAAe,IAAIyG,iBAAiB,IAAI2gB,yBAAyB,IAAI5mB,uBAAuB,IAAIC,eAAe,IAAI6mB,WAAW,IAAIC,kBAAkB,MAAMsd,KAAK,SAASx1I,EAAQU,EAAOJ,GuTvi2BxP,GAAAm4G,GAAAz4G,EAAA,YACAy4G,GAAAA,EAAAlmF,EAAAkmF,EAAAmB,EAAAnB,EAAAnE,GAAAt0G,EAAA,YAAAi3H,KACAjE,SAAAhzH,EAAA,mBAAAgzH,avT2i2BGnZ,YAAY,GAAGoe,WAAW,IAAIC,kBAAkB,MAAMud,KAAK,SAASz1I,EAAQU,EAAOJ,GwT7i2BtFN,EAAA,kBAAA,UAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,QxTkj2BGk1I,iBAAiB,MAAMC,KAAK,SAAS31I,EAAQU,EAAOJ,GyTpj2BvDN,EAAA,kBAAA,UAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,QzTyj2BGk1I,iBAAiB,MAAME,KAAK,SAAS51I,EAAQU,EAAOJ,G0T3j2BvDN,EAAA,kBAAA,QAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,Q1Tgk2BGk1I,iBAAiB,MAAMG,KAAK,SAAS71I,EAAQU,EAAOJ,G2Tlk2BvDN,EAAA,kBAAA,QAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,Q3Tuk2BGk1I,iBAAiB,MAAMI,KAAK,SAAS91I,EAAQU,EAAOJ,G4Tzk2BvDN,EAAA,kBAAA,OAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,Q5T8k2BGk1I,iBAAiB,MAAMK,KAAK,SAAS/1I,EAAQU,EAAOJ,G6Thl2BvDN,EAAA,kBAAA,SAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,Q7Tql2BGk1I,iBAAiB,MAAMM,KAAK,SAASh2I,EAAQU,EAAOJ,G8Tvl2BvDN,EAAA,kBAAA,SAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,Q9T4l2BGk1I,iBAAiB,MAAMO,KAAK,SAASj2I,EAAQU,EAAOJ,G+T9l2BvDN,EAAA,kBAAA,QAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,Q/Tmm2BGk1I,iBAAiB,MAAMQ,KAAK,SAASl2I,EAAQU,EAAOJ,GgUrm2BvDN,EAAA,kBAAA,QAAA,EAAA,SAAA+jC,GACA,MAAA,UAAAniC,EAAAw0H,EAAA51H,GACA,MAAAujC,GAAAv9B,KAAA5E,EAAAw0H,EAAA51H,MAEA,KhUwm2BGk1I,iBAAiB,MAAMS,KAAK,SAASn2I,EAAQU,EAAOJ,GiU5m2BvD,YACA,IAaA81I,GAbAC,EAAAr2I,EAAA,oBAAA,GACA04G,EAAA14G,EAAA,eACAqnF,EAAArnF,EAAA,WACAioH,EAAAjoH,EAAA,oBACAs2I,EAAAt2I,EAAA,sBACA0wG,EAAA1wG,EAAA,gBACA24G,EAAA34G,EAAA,YACA01G,EAAA11G,EAAA,0BACAu2I,EAAA,UACA5+B,EAAAtwB,EAAAswB,QACAsN,EAAA/hE,OAAA+hE,aACAhN,EAAAq+B,EAAAl+B,QACAlgG,KAGA69F,EAAA,SAAAjmE,GACA,MAAA,YACA,MAAAA,GAAAtpC,KAAA0kD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,UAIAowG,GAEAjpE,IAAA,SAAAl7B,GACA,GAAA87F,EAAA97F,GAAA,CACA,GAAAhT,GAAA+1G,EAAA/iG,EACA,OAAAhT,MAAA,EAAAq2G,EAAAvC,EAAAlvG,KAAA+vI,IAAAzmG,IAAAl7B,GACAhT,EAAAA,EAAA4E,KAAAgwD,IAAA7tD,SAIAgrB,IAAA,SAAA/e,EAAAhK,GACA,MAAA0rI,GAAA//B,IAAAb,EAAAlvG,KAAA+vI,GAAA3hI,EAAAhK,KAKA4rI,EAAA91I,EAAAJ,QAAAN,EAAA,iBAAAu2I,EAAAxgC,EAAAgD,EAAAu9B,GAAA,GAAA,EAGA39B,GAAA,WAAA,MAAA,KAAA,GAAA69B,IAAA7iH,KAAAuvB,OAAAuzF,QAAAvzF,QAAAhrC,GAAA,GAAA43B,IAAA53B,OACAk+H,EAAAE,EAAAxgC,eAAAC,EAAAwgC,GACAtuB,EAAAmuB,EAAAjwI,UAAA4yG,GACA1xB,EAAAsyB,MAAA,EACA08B,GAAA,SAAA,MAAA,MAAA,OAAA,SAAAzhI,GACA,GAAAue,GAAAqjH,EAAArwI,UACA05C,EAAA1sB,EAAAve,EACA8jG,GAAAvlF,EAAAve,EAAA,SAAA7U,EAAAmB,GAEA,GAAAwvG,EAAA3wG,KAAAklH,EAAAllH,GAAA,CACAyG,KAAAqvG,KAAArvG,KAAAqvG,GAAA,GAAAugC,GACA,IAAA/xI,GAAAmC,KAAAqvG,GAAAjhG,GAAA7U,EAAAmB,EACA,OAAA,OAAA0T,EAAApO,KAAAnC,EAEA,MAAAw7C,GAAAt/C,KAAAiG,KAAAzG,EAAAmB,UjUkn2BGo3G,mBAAmB,GAAGooB,gBAAgB,GAAGgW,qBAAqB,GAAG58B,WAAW,GAAGnJ,eAAe,IAAIqG,UAAU,IAAIyvB,mBAAmB,IAAIvsB,cAAc,IAAI7C,yBAAyB,MAAMs/B,KAAK,SAAS32I,EAAQU,EAAOJ,GkUzq2BxN,YACA,IAAAg2I,GAAAt2I,EAAA,sBACA01G,EAAA11G,EAAA,0BACA42I,EAAA,SAGA52I,GAAA,iBAAA42I,EAAA,SAAA9mG,GACA,MAAA,YAAA,MAAAA,GAAAtpC,KAAA0kD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,WAGAwa,IAAA,SAAAvY,GACA,MAAA0rI,GAAA//B,IAAAb,EAAAlvG,KAAAowI,GAAAhsI,GAAA,KAEA0rI,GAAA,GAAA,KlU4q2BG5V,gBAAgB,GAAGgW,qBAAqB,GAAGr/B,yBAAyB,MAAMw/B,KAAK,SAAS72I,EAAQU,EAAOJ,GmUzr2B1G,YAEA,IAAAm4G,GAAAz4G,EAAA,aACA8+G,EAAA9+G,EAAA,yBACA6wG,EAAA7wG,EAAA,gBACA+wG,EAAA/wG,EAAA,gBACAszG,EAAAtzG,EAAA,iBACA82I,EAAA92I,EAAA,0BAEAy4G,GAAAA,EAAA8E,EAAA,SACAw5B,QAAA,SAAA/jC,GACA,GACA+L,GAAA1sF,EADA48E,EAAA4B,EAAArqG,KAMA,OAJA8sG,GAAAN,GACA+L,EAAAhO,EAAA9B,EAAAzuG,QACA6xB,EAAAykH,EAAA7nC,EAAA,GACA6P,EAAAzsF,EAAA48E,EAAAA,EAAA8P,EAAA,EAAA,EAAA/L,EAAA9nD,UAAA,IACA74B,KAIAryB,EAAA,yBAAA,anU4r2BGyzG,gBAAgB,GAAGkpB,wBAAwB,GAAGzpB,0BAA0B,GAAG2G,YAAY,GAAGm9B,wBAAwB,GAAG5lC,eAAe,IAAIC,eAAe,MAAM4lC,KAAK,SAASj3I,EAAQU,EAAOJ,GoUjt2B7L,YAEA,IAAAm4G,GAAAz4G,EAAA,aACA8+G,EAAA9+G,EAAA,yBACA6wG,EAAA7wG,EAAA,gBACA+wG,EAAA/wG,EAAA,gBACAyuH,EAAAzuH,EAAA,iBACA82I,EAAA92I,EAAA,0BAEAy4G,GAAAA,EAAA8E,EAAA,SACA5nC,QAAA,WACA,GAAAuhE,GAAAhsF,UAAA,GACA+jD,EAAA4B,EAAArqG,MACAu4G,EAAAhO,EAAA9B,EAAAzuG,QACA6xB,EAAAykH,EAAA7nC,EAAA,EAEA,OADA6P,GAAAzsF,EAAA48E,EAAAA,EAAA8P,EAAA,EAAAp2G,SAAAuuI,EAAA,EAAAzoB,EAAAyoB,IACA7kH,KAIAryB,EAAA,yBAAA,apUot2BG28H,wBAAwB,GAAGzpB,0BAA0B,GAAG2G,YAAY,GAAGm9B,wBAAwB,GAAGtoB,gBAAgB,IAAItd,eAAe,IAAIC,eAAe,MAAM8lC,KAAK,SAASn3I,EAAQU,EAAOJ,GqUxu2B9L,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAo3I,EAAAp3I,EAAA,sBAAA,EAEAy4G,GAAAA,EAAA8E,EAAA,SACAsY,SAAA,SAAA3jB,GACA,MAAAklC,GAAA5wI,KAAA0rG,EAAAhnD,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,WAIA3I,EAAA,yBAAA,crU2u2BG28H,wBAAwB,GAAG5R,oBAAoB,GAAGlR,YAAY,KAAKw9B,KAAK,SAASr3I,EAAQU,EAAOJ,GsUrv2BnG,GAAAm4G,GAAAz4G,EAAA,aACA4oI,EAAA5oI,EAAA,kBACA+mH,EAAA/mH,EAAA,aAAA+mH,QACAC,EAAA,WAAAhnH,EAAA,UAAA+mH,EAEAtO,GAAAA,EAAAlmF,GACA+kH,KAAA,SAAA9iC,GACA,GAAAyS,GAAAD,GAAAD,EAAAE,MACA2hB,GAAA3hB,EAAAA,EAAAn+G,KAAA0rG,GAAAA,QtU2v2BGvE,SAAS,GAAG4J,YAAY,GAAGE,YAAY,GAAGoxB,eAAe,MAAMoM,KAAK,SAASv3I,EAAQU,EAAOJ,GuUnw2B/F,GAAAm4G,GAAAz4G,EAAA,aACAgwG,EAAAhwG,EAAA,SAEAy4G,GAAAA,EAAA4E,EAAA,SACAm6B,QAAA,SAAAl6G,GACA,MAAA,UAAA0yE,EAAA1yE,QvUyw2BG2yE,SAAS,GAAG4J,YAAY,KAAK49B,KAAK,SAASz3I,EAAQU,EAAOJ,GwU9w2B7D,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAAlmF,GAAAw8E,OAAA/uG,EAAA,iBxUkx2BG65G,YAAY,GAAGE,YAAY,KAAK29B,KAAK,SAAS13I,EAAQU,EAAOJ,GyUpx2BhEN,EAAA,0BAAA,SzUwx2BG23I,yBAAyB,MAAMC,KAAK,SAAS53I,EAAQU,EAAOJ,G0Uxx2B/DN,EAAA,wBAAA,S1U4x2BG63I,uBAAuB,MAAMC,KAAK,SAAS93I,EAAQU,EAAOJ,G2U5x2B7D,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAA70D,EAAA,OAAA27E,OAAAv/H,EAAA,yBAAA,W3Ugy2BG+3I,wBAAwB,GAAGl+B,YAAY,KAAKm+B,KAAK,SAASh4I,EAAQU,EAAOJ,G4Uly2B5E,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACA5tD,MAAA,SAAA3hD,EAAAmqI,EAAAC,GACA,MAAAh0I,MAAAC,IAAA+zI,EAAAh0I,KAAAoC,IAAA2xI,EAAAnqI,S5Uwy2BG+rG,YAAY,KAAKs+B,KAAK,SAASn4I,EAAQU,EAAOJ,G6U5y2BjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAA+6B,YAAAl0I,KAAAm0I,GAAA,Q7Ugz2BGx+B,YAAY,KAAKy+B,KAAK,SAASt4I,EAAQU,EAAOJ,G8Ulz2BjD,GAAAm4G,GAAAz4G,EAAA,aACAu4I,EAAA,IAAAr0I,KAAAm0I,EAEA5/B,GAAAA,EAAA4E,EAAA,QACAm7B,QAAA,SAAAC,GACA,MAAAA,GAAAF,O9Uwz2BG1+B,YAAY,KAAK6+B,KAAK,SAAS14I,EAAQU,EAAOJ,G+U7z2BjD,GAAAm4G,GAAAz4G,EAAA,aACA+5B,EAAA/5B,EAAA,iBACAkkH,EAAAlkH,EAAA,iBAEAy4G,GAAAA,EAAA4E,EAAA,QACA30B,OAAA,SAAA56E,EAAA22G,EAAAC,EAAAC,EAAAC,GACA,MAAAV,GAAAnqF,EAAAjsB,EAAA22G,EAAAC,EAAAC,EAAAC,S/Um02BG/K,YAAY,GAAGooB,iBAAiB,IAAI0W,gBAAgB,MAAMC,KAAK,SAAS54I,EAAQU,EAAOJ,GgVz02B1F,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACAw7B,MAAA,SAAAC,EAAArsE,EAAAssE,EAAArsE,GACA,GAAAssE,GAAAF,IAAA,EACAG,EAAAxsE,IAAA,EACAysE,EAAAH,IAAA,CACA,OAAAE,IAAAvsE,IAAA,KAAAssE,EAAAE,GAAAF,EAAAE,KAAAF,EAAAE,IAAA,MAAA,IAAA,OhV+02BGr/B,YAAY,KAAKs/B,KAAK,SAASn5I,EAAQU,EAAOJ,GiVt12BjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACA+7B,MAAA,SAAAt5I,EAAAyB,GACA,GAAAohI,GAAA,MACA0W,GAAAv5I,EACAw5I,GAAA/3I,EACAg4I,EAAAF,EAAA1W,EACA6W,EAAAF,EAAA3W,EACA8W,EAAAJ,GAAA,GACAK,EAAAJ,GAAA,GACA75I,GAAAg6I,EAAAD,IAAA,IAAAD,EAAAC,IAAA,GACA,OAAAC,GAAAC,GAAAj6I,GAAA,MAAA85I,EAAAG,IAAA,IAAAj6I,EAAAkjI,IAAA,SjV412BG9oB,YAAY,KAAK8/B,KAAK,SAAS35I,EAAQU,EAAOJ,GkVx22BjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACAu8B,MAAA,SAAAd,EAAArsE,EAAAssE,EAAArsE,GACA,GAAAssE,GAAAF,IAAA,EACAG,EAAAxsE,IAAA,EACAysE,EAAAH,IAAA,CACA,OAAAE,IAAAvsE,IAAA,MAAAssE,EAAAE,IAAAF,EAAAE,GAAAF,EAAAE,IAAA,KAAA,IAAA,OlV822BGr/B,YAAY,KAAKggC,KAAK,SAAS75I,EAAQU,EAAOJ,GmVr32BjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAAk7B,YAAA,IAAAr0I,KAAAm0I,OnVy32BGx+B,YAAY,KAAKigC,KAAK,SAAS95I,EAAQU,EAAOJ,GoV332BjD,GAAAm4G,GAAAz4G,EAAA,aACAo4I,EAAAl0I,KAAAm0I,GAAA,GAEA5/B,GAAAA,EAAA4E,EAAA,QACAo7B,QAAA,SAAAD,GACA,MAAAA,GAAAJ,OpVi42BGv+B,YAAY,KAAKkgC,KAAK,SAAS/5I,EAAQU,EAAOJ,GqVt42BjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAAtjF,MAAA/5B,EAAA,qBrV042BG65G,YAAY,GAAG8+B,gBAAgB,MAAMqB,KAAK,SAASh6I,EAAQU,EAAOJ,GsV542BrE,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QAAA48B,QAAA,SAAAnsI,GAEA,OAAAA,GAAAA,IAAAA,EAAAA,EAAA,GAAAA,EAAA,EAAAA,GAAA8nE,EAAAA,EAAA9nE,EAAA,OtVi52BG+rG,YAAY,KAAKqgC,KAAK,SAASl6I,EAAQU,EAAOJ,GuVr52BjD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,QACA88B,MAAA,SAAAr6I,EAAAyB,GACA,GAAAohI,GAAA,MACA0W,GAAAv5I,EACAw5I,GAAA/3I,EACAg4I,EAAAF,EAAA1W,EACA6W,EAAAF,EAAA3W,EACA8W,EAAAJ,IAAA,GACAK,EAAAJ,IAAA,GACA75I,GAAAg6I,EAAAD,IAAA,IAAAD,EAAAC,IAAA,GACA,OAAAC,GAAAC,GAAAj6I,IAAA,MAAA85I,EAAAG,IAAA,IAAAj6I,EAAAkjI,KAAA,SvV252BG9oB,YAAY,KAAKugC,KAAK,SAASp6I,EAAQU,EAAOJ,GwVx62BjD,YACA,IAAAm4G,GAAAz4G,EAAA,aACA6wG,EAAA7wG,EAAA,gBACAszG,EAAAtzG,EAAA,iBACAw6G,EAAAx6G,EAAA,eAGAA,GAAA,mBAAAy4G,EAAAA,EAAA8E,EAAAv9G,EAAA,wBAAA,UACAq6I,iBAAA,SAAA98B,EAAA4Z,GACA3c,EAAAt6G,EAAA2wG,EAAArqG,MAAA+2G,GAAAztE,IAAAwjE,EAAA6jB,GAAAzoC,YAAA,EAAAE,cAAA,SxV662BG6kB,gBAAgB,GAAGoD,iBAAiB,GAAGgD,YAAY,GAAG3C,eAAe,IAAIojC,uBAAuB,IAAIjpC,eAAe,MAAMkpC,KAAK,SAASv6I,EAAQU,EAAOJ,GyVt72BzJ,YACA,IAAAm4G,GAAAz4G,EAAA,aACA6wG,EAAA7wG,EAAA,gBACAszG,EAAAtzG,EAAA,iBACAw6G,EAAAx6G,EAAA,eAGAA,GAAA,mBAAAy4G,EAAAA,EAAA8E,EAAAv9G,EAAA,wBAAA,UACA2pH,iBAAA,SAAApM,EAAA6Z,GACA5c,EAAAt6G,EAAA2wG,EAAArqG,MAAA+2G,GAAA5pF,IAAA2/E,EAAA8jB,GAAA1oC,YAAA,EAAAE,cAAA,SzV272BG6kB,gBAAgB,GAAGoD,iBAAiB,GAAGgD,YAAY,GAAG3C,eAAe,IAAIojC,uBAAuB,IAAIjpC,eAAe,MAAMmpC,KAAK,SAASx6I,EAAQU,EAAOJ,G0Vn82BzJ,GAAAm4G,GAAAz4G,EAAA,aACA0iH,EAAA1iH,EAAA,uBAAA,EAEAy4G,GAAAA,EAAA4E,EAAA,UACAhE,QAAA,SAAA/7E,GACA,MAAAolF,GAAAplF,Q1Vy82BGu8E,YAAY,GAAG4gC,qBAAqB,MAAMC,KAAK,SAAS16I,EAAQU,EAAOJ,G2V982B1E,GAAAm4G,GAAAz4G,EAAA,aACAurH,EAAAvrH,EAAA,eACA+xG,EAAA/xG,EAAA,iBACA6pH,EAAA7pH,EAAA,kBACA09H,EAAA19H,EAAA,qBAEAy4G,GAAAA,EAAA4E,EAAA,UACAs9B,0BAAA,SAAApkG,GAOA,IANA,GAKA3hC,GAAA+lC,EALAs0D,EAAA8C,EAAAx7D,GACAqkG,EAAA/wB,EAAA3pH,EACA4pD,EAAAyhE,EAAAtc,GACA5qG,KACApE,EAAA,EAEA6pD,EAAAtpD,OAAAP,GACA06C,EAAAigG,EAAA3rC,EAAAr6F,EAAAk1C,EAAA7pD,MACA0I,SAAAgyC,GAAA+iF,EAAAr5H,EAAAuQ,EAAA+lC,EAEA,OAAAt2C,Q3Vo92BGs5H,qBAAqB,GAAG9jB,YAAY,GAAGgU,iBAAiB,IAAIqf,cAAc,IAAI96B,gBAAgB,MAAMyoC,KAAK,SAAS76I,EAAQU,EAAOJ,G4Vv+2BpI,YACA,IAAAm4G,GAAAz4G,EAAA,aACA6wG,EAAA7wG,EAAA,gBACA47G,EAAA57G,EAAA,mBACAuvF,EAAAvvF,EAAA,iBACA8pH,EAAA9pH,EAAA,kBAAAE,CAGAF,GAAA,mBAAAy4G,EAAAA,EAAA8E,EAAAv9G,EAAA,wBAAA,UACA86I,iBAAA,SAAAv9B,GACA,GAEA+Q,GAFArf,EAAA4B,EAAArqG,MACA0hH,EAAAtM,EAAA2B,GAAA,EAEA,GACA,IAAA+Q,EAAAxE,EAAA7a,EAAAiZ,GAAA,MAAAoG,GAAAx+E,UACAm/D,EAAA1f,EAAA0f,S5V4+2BG4H,iBAAiB,GAAGgD,YAAY,GAAGygC,uBAAuB,IAAIzsB,iBAAiB,IAAI9K,gBAAgB,IAAI1R,eAAe,IAAI0K,kBAAkB,MAAMg/B,KAAK,SAAS/6I,EAAQU,EAAOJ,G6V3/2BlL,YACA,IAAAm4G,GAAAz4G,EAAA,aACA6wG,EAAA7wG,EAAA,gBACA47G,EAAA57G,EAAA,mBACAuvF,EAAAvvF,EAAA,iBACA8pH,EAAA9pH,EAAA,kBAAAE,CAGAF,GAAA,mBAAAy4G,EAAAA,EAAA8E,EAAAv9G,EAAA,wBAAA,UACAg7I,iBAAA,SAAAz9B,GACA,GAEA+Q,GAFArf,EAAA4B,EAAArqG,MACA0hH,EAAAtM,EAAA2B,GAAA,EAEA,GACA,IAAA+Q,EAAAxE,EAAA7a,EAAAiZ,GAAA,MAAAoG,GAAA36F,UACAs7E,EAAA1f,EAAA0f,S7Vgg3BG4H,iBAAiB,GAAGgD,YAAY,GAAGygC,uBAAuB,IAAIzsB,iBAAiB,IAAI9K,gBAAgB,IAAI1R,eAAe,IAAI0K,kBAAkB,MAAMk/B,KAAK,SAASj7I,EAAQU,EAAOJ,G8V9g3BlL,GAAAm4G,GAAAz4G,EAAA,aACAk7I,EAAAl7I,EAAA,uBAAA,EAEAy4G,GAAAA,EAAA4E,EAAA,UACAuF,OAAA,SAAAtlF,GACA,MAAA49G,GAAA59G,Q9Voh3BGu8E,YAAY,GAAG4gC,qBAAqB,MAAMU,KAAK,SAASn7I,EAAQU,EAAOJ,G+V1h3B1E,YAEA,IAAAm4G,GAAAz4G,EAAA,aACA+uG,EAAA/uG,EAAA,aACAq6G,EAAAr6G,EAAA,WACA4oI,EAAA5oI,EAAA,kBACAo7I,EAAAp7I,EAAA,UAAA,cACAszG,EAAAtzG,EAAA,iBACA43G,EAAA53G,EAAA,gBACAq1G,EAAAr1G,EAAA,kBACAo1G,EAAAp1G,EAAA,mBACA+8G,EAAA/8G,EAAA,WACA0xG,EAAA1xG,EAAA,aACA4/G,EAAAlO,EAAAkO,OAEAyC,EAAA,SAAA7N,GACA,MAAA,OAAAA,EAAA7rG,OAAA2qG,EAAAkB,IAGA6mC,EAAA,SAAAC,GACA,GAAAC,GAAAD,EAAA9R,EACA+R,KACAD,EAAA9R,GAAA7gI,OACA4yI,MAIAC,EAAA,SAAAF,GACA,MAAA3yI,UAAA2yI,EAAAG,IAGAC,EAAA,SAAAJ,GACAE,EAAAF,KACAA,EAAAG,GAAA9yI,OACA0yI,EAAAC,KAIAK,EAAA,SAAAC,EAAAC,GACAjkC,EAAAgkC,GACAp1I,KAAAgjI,GAAA7gI,OACAnC,KAAAi1I,GAAAG,EACAA,EAAA,GAAAE,GAAAt1I,KACA,KACA,GAAA+0I,GAAAM,EAAAD,GACAN,EAAAC,CACA,OAAAA,IACA,kBAAAA,GAAAQ,YAAAR,EAAA,WAAAD,EAAAS,eACAzoC,EAAAioC,GACA/0I,KAAAgjI,GAAA+R,GAEA,MAAA/7I,GAEA,WADAo8I,GAAA9mH,MAAAt1B,GAEAg8I,EAAAh1I,OAAA60I,EAAA70I,MAGAm1I,GAAAx1I,UAAAivG,MACA2mC,YAAA,WAAAL,EAAAl1I,QAGA,IAAAs1I,GAAA,SAAAR,GACA90I,KAAA+vD,GAAA+kF,EAGAQ,GAAA31I,UAAAivG,MACAl+E,KAAA,SAAAtsB,GACA,GAAA0wI,GAAA90I,KAAA+vD,EACA,KAAAilF,EAAAF,GAAA,CACA,GAAAM,GAAAN,EAAAG,EACA,KACA,GAAAnsI,GAAA+yG,EAAAu5B,EAAA1kH,KACA,IAAA5nB,EAAA,MAAAA,GAAA/O,KAAAq7I,EAAAhxI,GACA,MAAApL,GACA,IACAk8I,EAAAJ,GACA,QACA,KAAA97I,OAKAs1B,MAAA,SAAAlqB,GACA,GAAA0wI,GAAA90I,KAAA+vD,EACA,IAAAilF,EAAAF,GAAA,KAAA1wI,EACA,IAAAgxI,GAAAN,EAAAG,EACAH,GAAAG,GAAA9yI,MACA,KACA,GAAA2G,GAAA+yG,EAAAu5B,EAAA9mH,MACA,KAAAxlB,EAAA,KAAA1E,EACAA,GAAA0E,EAAA/O,KAAAq7I,EAAAhxI,GACA,MAAApL,GACA,IACA67I,EAAAC,GACA,QACA,KAAA97I,IAGA,MADA67I,GAAAC,GACA1wI,GAEAoxI,SAAA,SAAApxI,GACA,GAAA0wI,GAAA90I,KAAA+vD,EACA,KAAAilF,EAAAF,GAAA,CACA,GAAAM,GAAAN,EAAAG,EACAH,GAAAG,GAAA9yI,MACA,KACA,GAAA2G,GAAA+yG,EAAAu5B,EAAAI,SACApxI,GAAA0E,EAAAA,EAAA/O,KAAAq7I,EAAAhxI,GAAAjC,OACA,MAAAnJ,GACA,IACA67I,EAAAC,GACA,QACA,KAAA97I,IAGA,MADA67I,GAAAC,GACA1wI,KAKA,IAAAqxI,GAAA,SAAAJ,GACAxmC,EAAA7uG,KAAAy1I,EAAA,aAAA,MAAApmC,GAAAvC,EAAAuoC,GAGAzmC,GAAA6mC,EAAA91I,WACA+1I,UAAA,SAAAN,GACA,MAAA,IAAAD,GAAAC,EAAAp1I,KAAAqvG,KAEAzzF,QAAA,SAAAoyF,GACA,GAAAvB,GAAAzsG,IACA,OAAA,KAAA6zG,EAAAh8F,SAAA0wF,EAAA1wF,SAAA,SAAAiC,EAAA+U,GACAi+E,EAAAkB,EACA,IAAA8mC,GAAAroC,EAAAipC,WACAhlH,KAAA,SAAAtsB,GACA,IACA,MAAA4pG,GAAA5pG,GACA,MAAApL,GACA61B,EAAA71B,GACA87I,EAAAS,gBAGAjnH,MAAAO,EACA2mH,SAAA17H,SAMA80F,EAAA6mC,GACAn+D,KAAA,SAAAhwE,GACA,GAAAwkB,GAAA,kBAAA9rB,MAAAA,KAAAy1I,EACAp8F,EAAAwiE,EAAAzK,EAAA9pG,GAAAstI,GACA,IAAAv7F,EAAA,CACA,GAAAs8F,GAAAvkC,EAAA/3D,EAAAt/C,KAAAuN,GACA,OAAAquI,GAAAj+H,cAAAoU,EAAA6pH,EAAA,GAAA7pH,GAAA,SAAAspH,GACA,MAAAO,GAAAD,UAAAN,KAGA,MAAA,IAAAtpH,GAAA,SAAAspH,GACA,GAAAzkH,IAAA,CAeA,OAdAyxG,GAAA,WACA,IAAAzxG,EAAA,CACA,IACA,GAAAu6E,EAAA5jG,GAAA,EAAA,SAAAwvB,GAEA,MADAs+G,GAAA1kH,KAAAoG,GACAnG,EAAAyoF,EAAA,WACAA,EAAA,OACA,MAAApgH,GACA,GAAA23B,EAAA,KAAA33B,EAEA,YADAo8I,GAAA9mH,MAAAt1B,GAEAo8I,EAAAI,cAGA,WAAA7kH,GAAA,MAGAsgD,GAAA,WACA,IAAA,GAAAx3E,GAAA,EAAAI,EAAA6qD,UAAA1qD,OAAAu0E,EAAA94B,MAAA57C,GAAAA,EAAAJ,GAAA80E,EAAA90E,GAAAirD,UAAAjrD,IACA,OAAA,KAAA,kBAAAuG,MAAAA,KAAAy1I,GAAA,SAAAL,GACA,GAAAzkH,IAAA,CASA,OARAyxG,GAAA,WACA,IAAAzxG,EAAA,CACA,IAAA,GAAA5zB,GAAA,EAAAA,EAAAwxE,EAAAv0E,SAAA+C,EAEA,GADAq4I,EAAA1kH,KAAA69C,EAAAxxE,IACA4zB,EAAA,MACAykH,GAAAI,cAGA,WAAA7kH,GAAA,QAKA4lF,EAAAk/B,EAAA91I,UAAAi1I,EAAA,WAAA,MAAA50I,QAEAiyG,EAAAA,EAAAlmF,GAAA6pH,WAAAH,IAEAj8I,EAAA,kBAAA,gB/V6h3BGyzG,gBAAgB,GAAGmD,iBAAiB,GAAGyB,eAAe,GAAGsF,UAAU,GAAG9D,YAAY,GAAGhI,YAAY,GAAGkI,YAAY,GAAG1J,UAAU,IAAI86B,eAAe,IAAIh0B,kBAAkB,IAAIC,iBAAiB,IAAI9G,SAAS,MAAM+rC,KAAK,SAASr8I,EAAQU,EAAOJ,GgWlu3B9O,YACA,IAAAm4G,GAAAz4G,EAAA,aACAq6G,EAAAr6G,EAAA,WACA+uG,EAAA/uG,EAAA,aACA+zG,EAAA/zG,EAAA,0BACA+oI,EAAA/oI,EAAA,qBAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAA70D,EAAA,WAAA04F,UAAA,SAAAC,GACA,GAAAjqH,GAAAyhF,EAAAvtG,KAAA6zG,EAAAh8F,SAAA0wF,EAAA1wF,SACA4uG,EAAA,kBAAAsvB,EACA,OAAA/1I,MAAA8Y,KACA2tG,EAAA,SAAAn/G,GACA,MAAAi7H,GAAAz2G,EAAAiqH,KAAAj9H,KAAA,WAAA,MAAAxR,MACAyuI,EACAtvB,EAAA,SAAAztH,GACA,MAAAupI,GAAAz2G,EAAAiqH,KAAAj9H,KAAA,WAAA,KAAA9f,MACA+8I,QhWwu3BG5+B,UAAU,GAAG9D,YAAY,GAAGE,YAAY,GAAGsxB,qBAAqB,IAAItT,yBAAyB,MAAMykB,KAAK,SAASx8I,EAAQU,EAAOJ,GiWzv3BnI,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAqsH,EAAArsH,EAAA,6BACA8oI,EAAA9oI,EAAA,aAEAy4G,GAAAA,EAAA4E,EAAA,WAAAo/B,MAAA,SAAAzpC,GACA,GAAAsZ,GAAAD,EAAAnsH,EAAAsG,MACAnC,EAAAykI,EAAA91B,EAEA,QADA3uG,EAAA7E,EAAA8sH,EAAAj3F,OAAAi3F,EAAAhsG,SAAAjc,EAAA9C,GACA+qH,EAAA9E,ajW6v3BG3N,YAAY,GAAG0S,4BAA4B,IAAI6e,aAAa,MAAMsR,KAAK,SAAS18I,EAAQU,EAAOJ,GkWvw3BlG,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAsmH,EAAAq2B,EAAA/nI,IACAsxG,EAAAy2B,EAAAhpH,GAEAgpH,GAAAh2H,KAAAi2H,eAAA,SAAAC,EAAAC,EAAA5zG,EAAAy8E,GACAO,EAAA22B,EAAAC,EAAAllC,EAAA1uE,GAAAo9E,EAAAX,SlW2w3BGtN,eAAe,GAAG0kC,cAAc,MAAMC,KAAK,SAASh9I,EAAQU,EAAOJ,GmWjx3BtE,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAsmH,EAAAq2B,EAAA/nI,IACA8wG,EAAAi3B,EAAA9uI,IACAmlE,EAAA2pE,EAAA3pE,KAEA2pE,GAAAh2H,KAAAs2H,eAAA,SAAAJ,EAAA3zG,GACA,GAAAy8E,GAAAz6D,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,IACA86D,EAAAN,EAAA9N,EAAA1uE,GAAAy8E,GAAA,EACA,IAAAh9G,SAAAq9G,IAAAA,EAAA,UAAA62B,GAAA,OAAA,CACA,IAAA72B,EAAA3uG,KAAA,OAAA,CACA,IAAAuuG,GAAA5yC,EAAAljC,IAAA5G,EAEA,OADA08E,GAAA,UAAAD,KACAC,EAAAvuG,MAAA27D,EAAA,UAAA9pC,QnWqx3BGmvE,eAAe,GAAG0kC,cAAc,MAAMG,KAAK,SAASl9I,EAAQU,EAAOJ,GoWly3BtE,GAAA68I,GAAAn9I,EAAA,aACA89E,EAAA99E,EAAA,0BACA28I,EAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAuvF,EAAAvvF,EAAA,iBACAomH,EAAAu2B,EAAA7yF,KACAw8D,EAAAq2B,EAAA/nI,IAEAwoI,EAAA,SAAAnuC,EAAAsO,GACA,GAAA8/B,GAAAj3B,EAAAnX,EAAAsO,GACAprB,EAAA5C,EAAA0f,EACA,IAAA,OAAA9c,EAAA,MAAAkrD,EACA,IAAAC,GAAAF,EAAAjrD,EAAAorB,EACA,OAAA+/B,GAAA98I,OAAA68I,EAAA78I,OAAAs9E,EAAA,GAAAq/D,GAAAE,EAAA/zF,OAAAg0F,KAAAA,EAAAD,EAGAV,GAAAh2H,KAAA42H,gBAAA,SAAAr0G,GACA,MAAAk0G,GAAAxlC,EAAA1uE,GAAAgiB,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,UpWsy3BGmtD,eAAe,GAAGb,yBAAyB,GAAGulC,cAAc,IAAIh6B,gBAAgB,IAAIy6B,YAAY,MAAMC,KAAK,SAASz9I,EAAQU,EAAOJ,GqWvz3BtI,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAuvF,EAAAvvF,EAAA,iBACA8lH,EAAA62B,EAAArmC,IACA2P,EAAA02B,EAAA7sG,IACAw2E,EAAAq2B,EAAA/nI,IAEA8oI,EAAA,SAAA33B,EAAA9W,EAAAsO,GACA,GAAAogC,GAAA73B,EAAAC,EAAA9W,EAAAsO,EACA,IAAAogC,EAAA,MAAA13B,GAAAF,EAAA9W,EAAAsO,EACA,IAAAprB,GAAA5C,EAAA0f,EACA,OAAA,QAAA9c,EAAAurD,EAAA33B,EAAA5zB,EAAAorB,GAAA50G,OAGAg0I,GAAAh2H,KAAAi3H,YAAA,SAAAf,EAAA3zG,GACA,MAAAw0G,GAAAb,EAAAjlC,EAAA1uE,GAAAgiB,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,UrW2z3BGmtD,eAAe,GAAG0kC,cAAc,IAAIh6B,gBAAgB,MAAM86B,KAAK,SAAS79I,EAAQU,EAAOJ,GsW103B1F,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAomH,EAAAu2B,EAAA7yF,KACAw8D,EAAAq2B,EAAA/nI,GAEA+nI,GAAAh2H,KAAAm3H,mBAAA,SAAA50G,GACA,MAAAk9E,GAAAxO,EAAA1uE,GAAAgiB,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,UtW803BGmtD,eAAe,GAAG0kC,cAAc,MAAMgB,KAAK,SAAS/9I,EAAQU,EAAOJ,GuWp13BtE,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAimH,EAAA02B,EAAA7sG,IACAw2E,EAAAq2B,EAAA/nI,GAEA+nI,GAAAh2H,KAAAq3H,eAAA,SAAAnB,EAAA3zG,GACA,MAAA+8E,GAAA42B,EAAAjlC,EAAA1uE,GACAgiB,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,UvWw13BGmtD,eAAe,GAAG0kC,cAAc,MAAMkB,KAAK,SAASj+I,EAAQU,EAAOJ,GwW/13BtE,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACAuvF,EAAAvvF,EAAA,iBACA8lH,EAAA62B,EAAArmC,IACAgQ,EAAAq2B,EAAA/nI,IAEAspI,EAAA,SAAAn4B,EAAA9W,EAAAsO,GACA,GAAAogC,GAAA73B,EAAAC,EAAA9W,EAAAsO,EACA,IAAAogC,EAAA,OAAA,CACA,IAAAxrD,GAAA5C,EAAA0f,EACA,OAAA,QAAA9c,EAAA+rD,EAAAn4B,EAAA5zB,EAAAorB,IAAA,EAGAo/B,GAAAh2H,KAAAw3H,YAAA,SAAAtB,EAAA3zG,GACA,MAAAg1G,GAAArB,EAAAjlC,EAAA1uE,GAAAgiB,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,UxWm23BGmtD,eAAe,GAAG0kC,cAAc,IAAIh6B,gBAAgB,MAAMq7B,KAAK,SAASp+I,EAAQU,EAAOJ,GyWj33B1F,GAAAq8I,GAAA38I,EAAA,eACA43G,EAAA53G,EAAA,gBACA8lH,EAAA62B,EAAArmC,IACAgQ,EAAAq2B,EAAA/nI,GAEA+nI,GAAAh2H,KAAA03H,eAAA,SAAAxB,EAAA3zG,GACA,MAAA48E,GAAA+2B,EAAAjlC,EAAA1uE,GACAgiB,UAAA1qD,OAAA,EAAAmI,OAAA29G,EAAAp7D,UAAA,UzWq33BGmtD,eAAe,GAAG0kC,cAAc,MAAMuB,KAAK,SAASt+I,EAAQU,EAAOJ,G0W533BtE,GAAAi+I,GAAAv+I,EAAA,eACA43G,EAAA53G,EAAA,gBACAszG,EAAAtzG,EAAA,iBACAsmH,EAAAi4B,EAAA3pI,IACAsxG,EAAAq4B,EAAA5qH,GAEA4qH,GAAA53H,KAAAg2H,SAAA,SAAAE,EAAAC,GACA,MAAA,UAAA5zG,EAAAy8E,GACAO,EACA22B,EAAAC,GACAn0I,SAAAg9G,EAAA/N,EAAAtE,GAAApqE,GACAo9E,EAAAX,U1Wk43BGlS,gBAAgB,GAAG4E,eAAe,GAAG0kC,cAAc,MAAMyB,KAAK,SAASx+I,EAAQU,EAAOJ,G2W543BzFN,EAAA,0BAAA,S3Wg53BG23I,yBAAyB,MAAM8G,KAAK,SAASz+I,EAAQU,EAAOJ,G4Wh53B/DN,EAAA,wBAAA,S5Wo53BG63I,uBAAuB,MAAM6G,KAAK,SAAS1+I,EAAQU,EAAOJ,G6Wp53B7D,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA8E,EAAA9E,EAAA70D,EAAA,OAAA27E,OAAAv/H,EAAA,yBAAA,W7Ww53BG+3I,wBAAwB,GAAGl+B,YAAY,KAAK8kC,KAAK,SAAS3+I,EAAQU,EAAOJ,G8W353B5E,YAEA,IAAAm4G,GAAAz4G,EAAA,aACA6wI,EAAA7wI,EAAA,iBAAA,EAEAy4G,GAAAA,EAAA8E,EAAA,UACAqhC,GAAA,SAAAt1I,GACA,MAAAunI,GAAArqI,KAAA8C,Q9Wg63BGuwG,YAAY,GAAGk3B,eAAe,MAAM8N,KAAK,SAAS7+I,EAAQU,EAAOJ,G+Wv63BpE,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAi+G,EAAAj+G,EAAA,cACA+wG,EAAA/wG,EAAA,gBACAqhH,EAAArhH,EAAA,gBACA8+I,EAAA9+I,EAAA,YACA++I,EAAAv6I,OAAA2B,UAEA64I,EAAA,SAAAvQ,EAAAtnF,GACA3gD,KAAA+hE,GAAAkmE,EACAjoI,KAAA+vD,GAAApP,EAGAnnD,GAAA,kBAAAg/I,EAAA,gBAAA,WACA,GAAAznG,GAAA/wC,KAAA+hE,GAAAh5D,KAAA/I,KAAA+vD,GACA,QAAA3rD,MAAA2sC,EAAApgB,KAAA,OAAAogB,KAGAkhE,EAAAA,EAAA8E,EAAA,UACA0hC,SAAA,SAAAxQ,GAEA,GADAxwB,EAAAz3G,OACA66G,EAAAotB,GAAA,KAAA/3E,WAAA+3E,EAAA,oBACA,IAAApxB,GAAAt6G,OAAAyD,MACA8nI,EAAA,SAAAyQ,GAAAh8I,OAAA0rI,EAAAH,OAAAwQ,EAAAv+I,KAAAkuI,GACA36G,EAAA,GAAAtvB,QAAAiqI,EAAAtwG,QAAAmwG,EAAA9qI,QAAA,KAAA8qI,EAAA,IAAAA,EAEA,OADAx6G,GAAAg8G,UAAA/+B,EAAA09B,EAAAqB,WACA,GAAAkP,GAAAlrH,EAAAupF,Q/W463BGkB,aAAa,GAAG1E,YAAY,GAAGu0B,WAAW,GAAGvf,eAAe,IAAIhM,iBAAiB,IAAIzR,eAAe,MAAM8tC,KAAK,SAASl/I,EAAQU,EAAOJ,GgXv83B1I,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAm/I,EAAAn/I,EAAA,gBAEAy4G,GAAAA,EAAA8E,EAAA,UACAlO,OAAA,SAAA38B,GACA,MAAAysE,GAAA34I,KAAAksE,EAAAxnB,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,QAAA,QhX483BGkxG,YAAY,GAAGulC,gBAAgB,MAAMC,KAAK,SAASr/I,EAAQU,EAAOJ,GiXn93BrE,YAEA,IAAAm4G,GAAAz4G,EAAA,aACAm/I,EAAAn/I,EAAA,gBAEAy4G,GAAAA,EAAA8E,EAAA,UACAnO,SAAA,SAAA18B,GACA,MAAAysE,GAAA34I,KAAAksE,EAAAxnB,UAAA1qD,OAAA,EAAA0qD,UAAA,GAAAviD,QAAA,QjXw93BGkxG,YAAY,GAAGulC,gBAAgB,MAAME,KAAK,SAASt/I,EAAQU,EAAOJ,GkX/93BrE,YAEAN,GAAA,kBAAA,WAAA,SAAA0rH,GACA,MAAA,YACA,MAAAA,GAAAllH,KAAA,KAEA,elXk+3BGolH,iBAAiB,MAAM2zB,KAAK,SAASv/I,EAAQU,EAAOJ,GmXx+3BvD,YAEAN,GAAA,kBAAA,YAAA,SAAA0rH,GACA,MAAA,YACA,MAAAA,GAAAllH,KAAA,KAEA,anX2+3BGolH,iBAAiB,MAAM4zB,KAAK,SAASx/I,EAAQU,EAAOJ,GoXj/3BvDN,EAAA,iBAAA,mBpXo/3BGi1I,gBAAgB,MAAMwK,KAAK,SAASz/I,EAAQU,EAAOJ,GqXp/3BtDN,EAAA,iBAAA,gBrXu/3BGi1I,gBAAgB,MAAMyK,KAAK,SAAS1/I,EAAQU,EAAOJ,GsXt/3BtD,GAAAm4G,GAAAz4G,EAAA,YAEAy4G,GAAAA,EAAA4E,EAAA,UAAAtO,OAAA/uG,EAAA,iBtX0/3BG65G,YAAY,GAAGE,YAAY,KAAK4lC,KAAK,SAAS3/I,EAAQU,EAAOJ,GuX5/3BhEN,EAAA,0BAAA,avXgg4BG23I,yBAAyB,MAAMiI,KAAK,SAAS5/I,EAAQU,EAAOJ,GwXhg4B/DN,EAAA,wBAAA,axXog4BG63I,uBAAuB,MAAMgI,KAAK,SAAS7/I,EAAQU,EAAOJ,GyXpg4B7DN,EAAA,0BAAA,azXwg4BG23I,yBAAyB,MAAMmI,KAAK,SAAS9/I,EAAQU,EAAOJ,G0Xxg4B/DN,EAAA,wBAAA,a1X4g4BG63I,uBAAuB,MAAMkI,KAAK,SAAS//I,EAAQU,EAAOJ,G2Xh+3B7D,IAAA,GA7CAk2H,GAAAx2H,EAAA,wBACAq8G,EAAAr8G,EAAA,kBACA04G,EAAA14G,EAAA,eACA+uG,EAAA/uG,EAAA,aACA+8G,EAAA/8G,EAAA,WACA+gH,EAAA/gH,EAAA,gBACAk+G,EAAAl+G,EAAA,UACA4xG,EAAAsM,EAAA,YACA8hC,EAAA9hC,EAAA,eACA+hC,EAAAl/B,EAAA9kE,MAEAikG,GACAC,aAAA,EACAC,qBAAA,EACAC,cAAA,EACAC,gBAAA,EACAC,aAAA,EACAC,eAAA,EACAC,cAAA,EACAC,sBAAA,EACAC,UAAA,EACAC,mBAAA,EACAC,gBAAA,EACAC,iBAAA,EACAC,mBAAA,EACAC,WAAA,EACAC,eAAA,EACAC,cAAA,EACAC,UAAA,EACAC,kBAAA,EACAC,QAAA,EACAC,aAAA,EACAC,eAAA,EACAC,eAAA,EACAC,gBAAA,EACAC,cAAA,EACAC,eAAA,EACAC,kBAAA,EACAC,kBAAA,EACAC,gBAAA,EACAC,kBAAA,EACAC,eAAA,EACAC,WAAA,GAGAC,EAAA7lC,EAAA6jC,GAAAjgJ,EAAA,EAAAA,EAAAiiJ,EAAA1hJ,OAAAP,IAAA,CACA,GAIA2U,GAJAohG,EAAAksC,EAAAjiJ,GACAkiJ,EAAAjC,EAAAlqC,GACAosC,EAAArzC,EAAAiH,GACA7iF,EAAAivH,GAAAA,EAAAj8I,SAEA,IAAAgtB,IACAA,EAAAy+E,IAAAmL,EAAA5pF,EAAAy+E,EAAAquC,GACA9sH,EAAA6sH,IAAAjjC,EAAA5pF,EAAA6sH,EAAAhqC,GACA+K,EAAA/K,GAAAiqC,EACAkC,GAAA,IAAAvtI,IAAA4hH,GAAArjG,EAAAve,IAAA8jG,EAAAvlF,EAAAve,EAAA4hH,EAAA5hH,IAAA,M3Xkh4BGmlG,YAAY,GAAG1J,UAAU,IAAI2Q,eAAe,IAAIpE,iBAAiB,IAAI1C,cAAc,IAAI5J,SAAS,IAAI6nB,uBAAuB,MAAMkqB,KAAK,SAASriJ,EAAQU,EAAOJ,G4Xzk4BjK,GAAAm4G,GAAAz4G,EAAA,aACAsiJ,EAAAtiJ,EAAA,UACAy4G,GAAAA,EAAAlmF,EAAAkmF,EAAA1D,GACA6b,aAAA0xB,EAAA3uH,IACAm9F,eAAAwxB,EAAAh1F,U5X6k4BGusD,YAAY,GAAG6N,UAAU,MAAM66B,KAAK,SAASviJ,EAAQU,EAAOJ,G6Xhl4B/D,GAAAyuG,GAAA/uG,EAAA,aACAy4G,EAAAz4G,EAAA,aACAkf,EAAA6vF,EAAA7vF,UACAjd,KAAAA,MACAugJ,IAAAtjI,GAAA,WAAA3R,KAAA2R,EAAAC,WACA80H,EAAA,SAAAtgH,GACA,MAAA,UAAA6gF,EAAAiuC,GACA,GAAAC,GAAAx3F,UAAA1qD,OAAA,EACA+zG,EAAAmuC,EAAAzgJ,EAAA1B,KAAA2qD,UAAA,IAAA,CACA,OAAAv3B,GAAA+uH,EAAA,YAEA,kBAAAluC,GAAAA,EAAAlF,SAAAkF,IAAAh7B,MAAAhzE,KAAA+tG,IACAC,EAAAiuC,IAGAhqC,GAAAA,EAAAlmF,EAAAkmF,EAAA1D,EAAA0D,EAAAnE,EAAAkuC,GACA/hI,WAAAwzH,EAAAllC,EAAAtuF,YACAmZ,YAAAq6G,EAAAllC,EAAAn1E,iB7Xql4BGigF,YAAY,GAAGE,YAAY,KAAK4oC,KAAK,SAAS3iJ,EAAQU,EAAOJ,G8Xvm4BhEN,EAAA,wBACAA,EAAA,+BACAA,EAAA,wCACAA,EAAA,0CACAA,EAAA,oDACAA,EAAA,yCACAA,EAAA,6BACAA,EAAA,+CACAA,EAAA,+BACAA,EAAA,6BACAA,EAAA,2CACAA,EAAA,kCACAA,EAAA,kCACAA,EAAA,sCACAA,EAAA,+BACAA,EAAA,2BACAA,EAAA,yCACAA,EAAA,kCACAA,EAAA,+BACAA,EAAA,+BACAA,EAAA,uCACAA,EAAA,2BACAA,EAAA,6BACAA,EAAA,oCACAA,EAAA,iCACAA,EAAA,qCACAA,EAAA,gCACAA,EAAA,kCACAA,EAAA,mCACAA,EAAA,+BACAA,EAAA,wCACAA,EAAA,yCACAA,EAAA,yCACAA,EAAA,oCACAA,EAAA,kCACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,2BACAA,EAAA,4BACAA,EAAA,2BACAA,EAAA,4BACAA,EAAA,6BACAA,EAAA,4BACAA,EAAA,2BACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,2BACAA,EAAA,2BACAA,EAAA,2BACAA,EAAA,2BACAA,EAAA,4BACAA,EAAA,wCACAA,EAAA,4BACAA,EAAA,6BACAA,EAAA,iCACAA,EAAA,sCACAA,EAAA,kCACAA,EAAA,iCACAA,EAAA,+BACAA,EAAA,oCACAA,EAAA,+BACAA,EAAA,4BACAA,EAAA,8BACAA,EAAA,6BACAA,EAAA,8BACAA,EAAA,kCACAA,EAAA,iCACAA,EAAA,gCACAA,EAAA,6BACAA,EAAA,8BACAA,EAAA,+BACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,0BACAA,EAAA,8BACAA,EAAA,oCACAA,EAAA,gCACAA,EAAA,mCACAA,EAAA,gCACAA,EAAA,4BACAA,EAAA,0BACAA,EAAA,4BACAA,EAAA,6BACAA,EAAA,4BACAA,EAAA,gCACAA,EAAA,2BACAA,EAAA,8BACAA,EAAA,4BACAA,EAAA,6BACAA,EAAA,8BACAA,EAAA,oCACAA,EAAA,gCACAA,EAAA,qCACAA,EAAA,mCACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,kCACAA,EAAA,+BACAA,EAAA,gCACAA,EAAA,oCACAA,EAAA,kCACAA,EAAA,8BACAA,EAAA,8BACAA,EAAA,gCACAA,EAAA,+BACAA,EAAA,8BACAA,EAAA,yBACAA,EAAA,qBACAA,EAAA,qBACAA,EAAA,0BACAA,EAAA,0BACAA,EAAA,oCACAA,EAAA,iCACAA,EAAA,kCACAA,EAAA,mCACAA,EAAA,2CACAA,EAAA,mCACAA,EAAA,oCACAA,EAAA,mCACAA,EAAA,oCACAA,EAAA,qCACAA,EAAA,qCACAA,EAAA,+BACAA,EAAA,mCACAA,EAAA,yCACAA,EAAA,yCACAA,EAAA,mCACAA,EAAA,6BACAA,EAAA,qDACAA,EAAA,0CACAA,EAAA,6BACAA,EAAA,uCACAA,EAAA,kCACAA,EAAA,4CACAA,EAAA,6BACAA,EAAA,0CACAA,EAAA,gCACAA,EAAA,gCACAA,EAAA,+BACAA,EAAA,2BACAA,EAAA,kCACAA,EAAA,gCACAA,EAAA,kCACAA,EAAA,mCACAA,EAAA,kCACAA,EAAA,uCACAA,EAAA,mCACAA,EAAA,qDACAA,EAAA,+BACAA,EAAA,gCACAA,EAAA,sCACAA,EAAA,sCACAA,EAAA,sCACAA,EAAA,sCACAA,EAAA,6BACAA,EAAA,6BACAA,EAAA,wBACAA,EAAA,wBACAA,EAAA,6BACAA,EAAA,6BACAA,EAAA,0BACAA,EAAA,0BACAA,EAAA,+BACAA,EAAA,+BACAA,EAAA,wBACAA,EAAA,+BACAA,EAAA,gCACAA,EAAA,4BACAA,EAAA,kCACAA,EAAA,8BACAA,EAAA,6BACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,kCACAA,EAAA,8BACAA,EAAA,4BACAA,EAAA,4BACAA,EAAA,8BACAA,EAAA,iCACAA,EAAA,6BACAA,EAAA,yCACAA,EAAA,yCACAA,EAAA;AACAA,EAAA,2CACAA,EAAA,0CACAA,EAAA,+CACAA,EAAA,sCACAA,EAAA,0CACAA,EAAA,kCACAA,EAAA,sBACAA,EAAA,4BACAA,EAAA,wBACAA,EAAA,2BACAA,EAAA,8BACAU,EAAAJ,QAAAN,EAAA,qB9X0m4BG4iJ,kBAAkB,GAAGC,kCAAkC,IAAIC,4BAA4B,IAAIC,2BAA2B,IAAIC,6BAA6B,IAAIC,2BAA2B,IAAIC,iCAAiC,IAAIC,+BAA+B,IAAIC,2BAA2B,IAAIC,+BAA+B,IAAIC,+BAA+B,IAAIC,+BAA+B,IAAIC,2BAA2B,IAAIC,oCAAoC,IAAIC,0BAA0B,IAAIC,yBAAyB,IAAIC,6BAA6B,IAAIC,mCAAmC,IAAIC,4BAA4B,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,8BAA8B,IAAIC,yBAAyB,IAAIC,mCAAmC,IAAIC,6BAA6B,IAAIC,kCAAkC,IAAIC,+BAA+B,IAAIC,8BAA8B,IAAIC,sCAAsC,IAAIC,8BAA8B,IAAIC,oBAAoB,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,0BAA0B,IAAIC,2BAA2B,IAAIC,0BAA0B,IAAIC,2BAA2B,IAAIC,4BAA4B,IAAIC,2BAA2B,IAAIC,0BAA0B,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,0BAA0B,IAAIC,0BAA0B,IAAIC,0BAA0B,IAAIC,0BAA0B,IAAIC,2BAA2B,IAAIC,mCAAmC,IAAIC,+BAA+B,IAAIC,iCAAiC,IAAIC,kCAAkC,IAAIC,8BAA8B,IAAIC,uCAAuC,IAAIC,wCAAwC,IAAIC,wCAAwC,IAAIC,mCAAmC,IAAIC,iCAAiC,IAAIC,gCAAgC,IAAIC,oCAAoC,IAAIC,8BAA8B,IAAIC,8BAA8B,IAAIC,yCAAyC,IAAIC,uCAAuC,IAAIC,8BAA8B,IAAIC,mDAAmD,IAAIC,8CAA8C,IAAIC,wCAAwC,IAAIC,0BAA0B,IAAIC,qCAAqC,IAAIC,iCAAiC,IAAIC,iCAAiC,IAAIC,4BAA4B,IAAIC,0CAA0C,IAAIC,4BAA4B,IAAIC,wCAAwC,IAAIC,iCAAiC,IAAIC,4BAA4B,IAAIC,0BAA0B,IAAIC,wBAAwB,IAAIC,8BAA8B,IAAIC,kCAAkC,IAAIC,wCAAwC,IAAIC,wCAAwC,IAAIC,kCAAkC,IAAIC,4BAA4B,IAAIC,oDAAoD,IAAIC,yCAAyC,IAAIC,4BAA4B,IAAIC,sCAAsC,IAAIC,iCAAiC,IAAIC,2CAA2C,IAAIC,4BAA4B,IAAIC,yCAAyC,IAAIC,mCAAmC,IAAIC,6BAA6B,IAAIC,6BAA6B,IAAIC,+BAA+B,IAAIC,8BAA8B,IAAIC,6BAA6B,IAAIC,iCAAiC,IAAIC,oBAAoB,IAAIC,8BAA8B,IAAIC,2BAA2B,IAAIC,6BAA6B,IAAIC,4BAA4B,IAAIC,qCAAqC,IAAIC,iCAAiC,IAAIC,6BAA6B,IAAIC,iCAAiC,IAAIC,gCAAgC,IAAIC,uCAAuC,IAAIC,gCAAgC,IAAIC,+BAA+B,IAAIC,gCAAgC,IAAIC,4BAA4B,IAAIC,2BAA2B,IAAIC,8BAA8B,IAAIC,6BAA6B,IAAIC,mCAAmC,IAAIC,8BAA8B,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,4BAA4B,IAAIC,uBAAuB,IAAIC,mCAAmC,IAAIC,gCAAgC,IAAIC,oCAAoC,IAAIC,oCAAoC,IAAIC,kCAAkC,IAAIC,kCAAkC,IAAIC,iCAAiC,IAAIC,mCAAmC,IAAIC,mCAAmC,IAAIC,kCAAkC,IAAIC,0CAA0C,IAAIC,yBAAyB,IAAIC,yBAAyB,IAAIC,+BAA+B,IAAIC,8BAA8B,IAAIC,+BAA+B,IAAIC,qBAAqB,IAAIC,+BAA+B,IAAIC,uBAAuB,IAAIC,yBAAyB,IAAIC,uBAAuB,IAAIC,4BAA4B,IAAIC,2BAA2B,IAAIC,iCAAiC,IAAIC,6BAA6B,IAAIC,4BAA4B,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,2BAA2B,IAAIC,iCAAiC,IAAIC,6BAA6B,IAAIC,2BAA2B,IAAIC,6BAA6B,IAAIC,2BAA2B,IAAIC,qCAAqC,IAAIC,qCAAqC,IAAIC,+BAA+B,IAAIC,oDAAoD,IAAIC,qCAAqC,IAAIC,qCAAqC,IAAIC,8BAA8B,IAAIC,2BAA2B,IAAIC,gCAAgC,IAAIC,4BAA4B,IAAIC,wCAAwC,IAAIC,wCAAwC,IAAIC,qCAAqC,IAAIC,0CAA0C,IAAIC,yCAAyC,IAAIC,8CAA8C,IAAIC,qCAAqC,IAAIC,yCAAyC,IAAIC,iCAAiC,IAAIC,yBAAyB,IAAIC,uBAAuB,IAAIC,4BAA4B,IAAIC,0BAA0B,IAAIC,iCAAiC,IAAIC,+BAA+B,IAAIC,iCAAiC,IAAIC,iCAAiC,IAAIC,kCAAkC,IAAIC,sCAAsC,IAAIC,kCAAkC,IAAIC,8BAA8B,IAAIC,8BAA8B,IAAIC,4BAA4B,IAAIC,8BAA8B,IAAIC,4BAA4B,IAAIC,6BAA6B,IAAIC,0BAA0B,IAAIC,uBAAuB,MAAMC,KAAK,SAASjvJ,EAAQU,EAAOJ,IACz2N,SAAWymH,EAAQhY,I+Xvy4BnB,WACA,YACA,SAAAmgD,GAAAphJ,GACA,MAAA,kBAAAA,IAAA,gBAAAA,IAAA,OAAAA,EAGA,QAAAqhJ,GAAArhJ,GACA,MAAA,kBAAAA,GAGA,QAAAshJ,GAAAthJ,GACA,MAAA,gBAAAA,IAAA,OAAAA,EAkCA,QAAAuhJ,GAAAC,GACAC,EAAAD,EAGA,QAAAE,GAAAC,GACAC,EAAAD,EAcA,QAAAE,KAGA,MAAA,YACA5oC,EAAAK,SAAAwoC,IAKA,QAAAC,KACA,MAAA,YACAC,EAAAF,IAIA,QAAAG,KACA,GAAAC,GAAA,EACApU,EAAA,GAAAqU,GAAAL,GACA3yI,EAAAqF,SAAAuW,eAAA,GAGA,OAFA+iH,GAAAt0B,QAAArqG,GAAAsqG,eAAA,IAEA,WACAtqG,EAAArb,KAAAouJ,IAAAA,EAAA,GAKA,QAAAE,KACA,GAAA1/B,GAAA,GAAAO,eAEA,OADAP,GAAAa,MAAA38F,UAAAk7H,EACA,WACAp/B,EAAAY,MAAAx8F,YAAA,IAIA,QAAAu7H,KACA,MAAA,YACA1vI,WAAAmvI,EAAA,IAKA,QAAAA,KACA,IAAA,GAAA3vJ,GAAA,EAAAmwJ,EAAAnwJ,EAAAA,GAAA,EAAA,CACA,GAAA8B,GAAAsuJ,GAAApwJ,GACAqmF,EAAA+pE,GAAApwJ,EAAA,EAEA8B,GAAAukF,GAEA+pE,GAAApwJ,GAAA0I,OACA0nJ,GAAApwJ,EAAA,GAAA0I,OAGAynJ,EAAA,EAGA,QAAAE,KACA,IACA,GAAA3wJ,GAAAK,EACAuwJ,EAAA5wJ,EAAA,QAEA,OADAmwJ,GAAAS,EAAAC,WAAAD,EAAAE,aACAZ,IACA,MAAArwJ,GACA,MAAA2wJ,MAkBA,QAAAO,MAQA,QAAAC,KACA,MAAA,IAAAj6F,WAAA,4CAGA,QAAAk6F,KACA,MAAA,IAAAl6F,WAAA,wDAGA,QAAAm6F,GAAArpC,GACA,IACA,MAAAA,GAAAloG,KACA,MAAAwV,GAEA,MADAg8H,IAAAh8H,MAAAA,EACAg8H,IAIA,QAAAC,GAAAzxI,EAAA1U,EAAAomJ,EAAAC,GACA,IACA3xI,EAAA/e,KAAAqK,EAAAomJ,EAAAC,GACA,MAAAzxJ,GACA,MAAAA,IAIA,QAAA0xJ,GAAA1pC,EAAA2pC,EAAA7xI,GACAowI,EAAA,SAAAloC,GACA,GAAA4pC,IAAA,EACAt8H,EAAAi8H,EAAAzxI,EAAA6xI,EAAA,SAAAvmJ,GACAwmJ,IACAA,GAAA,EACAD,IAAAvmJ,EACAymJ,EAAA7pC,EAAA58G,GAEA0mJ,EAAA9pC,EAAA58G,KAEA,SAAAw/H,GACAgnB,IACAA,GAAA,EAEAG,EAAA/pC,EAAA4iB,KACA,YAAA5iB,EAAAgqC,QAAA,sBAEAJ,GAAAt8H,IACAs8H,GAAA,EACAG,EAAA/pC,EAAA1yF,KAEA0yF,GAGA,QAAAiqC,GAAAjqC,EAAA2pC,GACAA,EAAAO,SAAAC,GACAL,EAAA9pC,EAAA2pC,EAAAS,SACAT,EAAAO,SAAAG,GACAN,EAAA/pC,EAAA2pC,EAAAS,SAEAE,EAAAX,EAAAxoJ,OAAA,SAAAiC,GACAymJ,EAAA7pC,EAAA58G,IACA,SAAAw/H,GACAmnB,EAAA/pC,EAAA4iB,KAKA,QAAA2nB,GAAAvqC,EAAAwqC,GACA,GAAAA,EAAA9zI,cAAAspG,EAAAtpG,YACAuzI,EAAAjqC,EAAAwqC,OACA,CACA,GAAA1yI,GAAAuxI,EAAAmB,EAEA1yI,KAAAwxI,GACAS,EAAA/pC,EAAAspC,GAAAh8H,OACAnsB,SAAA2W,EACAgyI,EAAA9pC,EAAAwqC,GACA7C,EAAA7vI,GACA4xI,EAAA1pC,EAAAwqC,EAAA1yI,GAEAgyI,EAAA9pC,EAAAwqC,IAKA,QAAAX,GAAA7pC,EAAA58G,GACA48G,IAAA58G,EACA2mJ,EAAA/pC,EAAAmpC,KACAzB,EAAAtkJ,GACAmnJ,EAAAvqC,EAAA58G,GAEA0mJ,EAAA9pC,EAAA58G,GAIA,QAAAqnJ,GAAAzqC,GACAA,EAAA0qC,UACA1qC,EAAA0qC,SAAA1qC,EAAAoqC,SAGAO,EAAA3qC,GAGA,QAAA8pC,GAAA9pC,EAAA58G,GACA48G,EAAAkqC,SAAAU,KAEA5qC,EAAAoqC,QAAAhnJ,EACA48G,EAAAkqC,OAAAC,GAEA,IAAAnqC,EAAA6qC,aAAA7xJ,QACAkvJ,EAAAyC,EAAA3qC,IAIA,QAAA+pC,GAAA/pC,EAAA4iB,GACA5iB,EAAAkqC,SAAAU,KACA5qC,EAAAkqC,OAAAG,GACArqC,EAAAoqC,QAAAxnB,EAEAslB,EAAAuC,EAAAzqC,IAGA,QAAAsqC,GAAA3/D,EAAAx2C,EAAA22G,EAAAC,GACA,GAAAC,GAAArgE,EAAAkgE,aACA7xJ,EAAAgyJ,EAAAhyJ,MAEA2xF,GAAA+/D,SAAA,KAEAM,EAAAhyJ,GAAAm7C,EACA62G,EAAAhyJ,EAAAmxJ,IAAAW,EACAE,EAAAhyJ,EAAAqxJ,IAAAU,EAEA,IAAA/xJ,GAAA2xF,EAAAu/D,QACAhC,EAAAyC,EAAAhgE,GAIA,QAAAggE,GAAA3qC,GACA,GAAAgrC,GAAAhrC,EAAA6qC,aACAI,EAAAjrC,EAAAkqC,MAEA,IAAA,IAAAc,EAAAhyJ,OAAA,CAIA,IAAA,GAFAm7C,GAAA55C,EAAAw4B,EAAAitF,EAAAoqC,QAEA3xJ,EAAA,EAAAA,EAAAuyJ,EAAAhyJ,OAAAP,GAAA,EACA07C,EAAA62G,EAAAvyJ,GACA8B,EAAAywJ,EAAAvyJ,EAAAwyJ,GAEA92G,EACA+2G,EAAAD,EAAA92G,EAAA55C,EAAAw4B,GAEAx4B,EAAAw4B,EAIAitF,GAAA6qC,aAAA7xJ,OAAA,GAGA,QAAAmyJ,KACAnsJ,KAAAsuB,MAAA,KAKA,QAAA89H,GAAA7wJ,EAAAw4B,GACA,IACA,MAAAx4B,GAAAw4B,GACA,MAAA/6B,GAEA,MADAqzJ,IAAA/9H,MAAAt1B,EACAqzJ,IAIA,QAAAH,GAAAD,EAAAjrC,EAAAzlH,EAAAw4B,GACA,GACA3vB,GAAAkqB,EAAAg+H,EAAAC,EADAC,EAAA7D,EAAAptJ,EAGA,IAAAixJ,GAWA,GAVApoJ,EAAAgoJ,EAAA7wJ,EAAAw4B,GAEA3vB,IAAAioJ,IACAE,GAAA,EACAj+H,EAAAlqB,EAAAkqB,MACAlqB,EAAA,MAEAkoJ,GAAA,EAGAtrC,IAAA58G,EAEA,WADA2mJ,GAAA/pC,EAAAopC,SAKAhmJ,GAAA2vB,EACAu4H,GAAA,CAGAtrC,GAAAkqC,SAAAU,KAEAY,GAAAF,EACAzB,EAAA7pC,EAAA58G,GACAmoJ,EACAxB,EAAA/pC,EAAA1yF,GACA29H,IAAAd,GACAL,EAAA9pC,EAAA58G,GACA6nJ,IAAAZ,IACAN,EAAA/pC,EAAA58G,IAIA,QAAAqoJ,GAAAzrC,EAAApnG,GACA,IACAA,EAAA,SAAAxV,GACAymJ,EAAA7pC,EAAA58G,IACA,SAAAw/H,GACAmnB,EAAA/pC,EAAA4iB,KAEA,MAAA5qI,GACA+xJ,EAAA/pC,EAAAhoH,IAIA,QAAA0zJ,GAAA9kE,EAAAvM,GACA,GAAAsxE,GAAA3sJ,IAEA2sJ,GAAAC,qBAAAhlE,EACA+kE,EAAA3rC,QAAA,GAAAp5B,GAAAsiE,GAEAyC,EAAAE,eAAAxxE,IACAsxE,EAAAG,OAAAzxE,EACAsxE,EAAA3yJ,OAAAqhF,EAAArhF,OACA2yJ,EAAAI,WAAA1xE,EAAArhF,OAEA2yJ,EAAAK,QAEA,IAAAL,EAAA3yJ,OACA8wJ,EAAA6B,EAAA3rC,QAAA2rC,EAAAvB,UAEAuB,EAAA3yJ,OAAA2yJ,EAAA3yJ,QAAA,EACA2yJ,EAAAM,aACA,IAAAN,EAAAI,YACAjC,EAAA6B,EAAA3rC,QAAA2rC,EAAAvB,WAIAL,EAAA4B,EAAA3rC,QAAA2rC,EAAAO,oBA2EA,QAAAC,GAAAt6C,GACA,MAAA,IAAAu6C,IAAAptJ,KAAA6yG,GAAAmO,QAGA,QAAAqsC,GAAAx6C,GAaA,QAAAi5C,GAAA1nJ,GACAymJ,EAAA7pC,EAAA58G,GAGA,QAAA2nJ,GAAAnoB,GACAmnB,EAAA/pC,EAAA4iB,GAhBA,GAAAh8C,GAAA5nF,KAEAghH,EAAA,GAAAp5B,GAAAsiE,EAEA,KAAAoD,EAAAz6C,GAEA,MADAk4C,GAAA/pC,EAAA,GAAA9wD,WAAA,oCACA8wD,CAaA,KAAA,GAVAhnH,GAAA64G,EAAA74G,OAUAP,EAAA,EAAAunH,EAAAkqC,SAAAU,IAAA5xJ,EAAAP,EAAAA,IACA6xJ,EAAA1jE,EAAA9tE,QAAA+4F,EAAAp5G,IAAA0I,OAAA2pJ,EAAAC,EAGA,OAAA/qC,GAGA,QAAAusC,GAAAx9G,GAEA,GAAA63C,GAAA5nF,IAEA,IAAA+vC,GAAA,gBAAAA,IAAAA,EAAAr4B,cAAAkwE,EACA,MAAA73C,EAGA,IAAAixE,GAAA,GAAAp5B,GAAAsiE,EAEA,OADAW,GAAA7pC,EAAAjxE,GACAixE,EAGA,QAAAwsC,GAAA5pB,GAEA,GAAAh8C,GAAA5nF,KACAghH,EAAA,GAAAp5B,GAAAsiE,EAEA,OADAa,GAAA/pC,EAAA4iB,GACA5iB,EAMA,QAAAysC,KACA,KAAA,IAAAv9F,WAAA,sFAGA,QAAAw9F,KACA,KAAA,IAAAx9F,WAAA,yHA2GA,QAAAy9F,GAAA/zI,GACA5Z,KAAA4tJ,IAAAC,KACA7tJ,KAAAkrJ,OAAA/oJ,OACAnC,KAAAorJ,QAAAjpJ,OACAnC,KAAA6rJ,gBAEA3B,IAAAtwI,IACA+uI,EAAA/uI,IACA6zI,IAGAztJ,eAAA2tJ,IACAD,IAGAjB,EAAAzsJ,KAAA4Z,IAsQA,QAAAk0I,KACA,GAAAC,EAEA,IAAA,mBAAAxlD,GACAwlD,EAAAxlD,MACA,IAAA,mBAAA13E,MACAk9H,EAAAl9H,SAEA,KACAk9H,EAAAjlD,SAAA,iBACA,MAAA9vG,GACA,KAAA,IAAAW,OAAA,4EAIA,GAAAo9G,GAAAg3C,EAAAl2I,UAEAk/F,GAAA,qBAAAr6D,OAAA/8C,UAAAtD,SAAAtC,KAAAg9G,EAAAj9F,YAAAi9F,EAAAi3C,QAIAD,EAAAl2I,QAAAo2I,IA55BA,GAAAC,EAMAA,GALAz4G,MAAAwa,QAKAxa,MAAAwa,QAJA,SAAA3oD,GACA,MAAA,mBAAAo1C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,GAMA,IAGAgiJ,GACAP,EAwGAoF,EA5GAb,EAAAY,EACAtE,EAAA,EAKAV,MAJA7sJ,SAIA,SAAAd,EAAAukF,GACA+pE,GAAAD,GAAAruJ,EACAsuJ,GAAAD,EAAA,GAAA9pE,EACA8pE,GAAA,EACA,IAAAA,IAIAb,EACAA,EAAAK,GAEA+E,OAaAC,EAAA,mBAAA5hI,QAAAA,OAAArqB,OACAksJ,EAAAD,MACA3E,EAAA4E,EAAAhuC,kBAAAguC,EAAA/tC,uBACAguC,EAAA,mBAAA/tC,IAAA,wBAAAlkH,SAAAtC,KAAAwmH,GAGAguC,GAAA,mBAAAC,oBACA,mBAAA1jC,gBACA,mBAAAP,gBA4CAs/B,GAAA,GAAAp0G,OAAA,IA6BA04G,GADAG,EACAnF,IACAM,EACAF,IACAgF,GACA7E,IACAvnJ,SAAAisJ,GAAA,kBAAA50J,GACAswJ,IAEAH,GAKA,IAAAiC,IAAA,OACAT,GAAA,EACAE,GAAA,EAEAf,GAAA,GAAA6B,GAkKAE,GAAA,GAAAF,EAwFAO,GAAA/sJ,UAAAktJ,eAAA,SAAAxxE,GACA,MAAAiyE,GAAAjyE,IAGAqxE,EAAA/sJ,UAAAutJ,iBAAA,WACA,MAAA,IAAAvzJ,OAAA,4CAGA+yJ,EAAA/sJ,UAAAqtJ,MAAA,WACAhtJ,KAAAorJ,QAAA,GAAA31G,OAAAz1C,KAAAhG,QAGA,IAAAozJ,IAAAV,CAEAA,GAAA/sJ,UAAAstJ,WAAA,WAOA,IAAA,GANAN,GAAA3sJ,KAEAhG,EAAA2yJ,EAAA3yJ,OACAgnH,EAAA2rC,EAAA3rC,QACA3lC,EAAAsxE,EAAAG,OAEArzJ,EAAA,EAAAunH,EAAAkqC,SAAAU,IAAA5xJ,EAAAP,EAAAA,IACAkzJ,EAAA8B,WAAApzE,EAAA5hF,GAAAA,IAIAizJ,EAAA/sJ,UAAA8uJ,WAAA,SAAAr/C,EAAA31G,GACA,GAAAkzJ,GAAA3sJ,KACAK,EAAAssJ,EAAAC,oBAEAhE,GAAAx5C,GACAA,EAAA13F,cAAArX,GAAA+uG,EAAA87C,SAAAU,IACAx8C,EAAAs8C,SAAA,KACAiB,EAAA+B,WAAAt/C,EAAA87C,OAAAzxJ,EAAA21G,EAAAg8C,UAEAuB,EAAAgC,cAAAtuJ,EAAAyZ,QAAAs1F,GAAA31G,IAGAkzJ,EAAAI,aACAJ,EAAAvB,QAAA3xJ,GAAA21G,IAIAs9C,EAAA/sJ,UAAA+uJ,WAAA,SAAA/vD,EAAAllG,EAAA2K,GACA,GAAAuoJ,GAAA3sJ,KACAghH,EAAA2rC,EAAA3rC,OAEAA,GAAAkqC,SAAAU,KACAe,EAAAI,aAEApuD,IAAA0sD,GACAN,EAAA/pC,EAAA58G,GAEAuoJ,EAAAvB,QAAA3xJ,GAAA2K,GAIA,IAAAuoJ,EAAAI,YACAjC,EAAA9pC,EAAA2rC,EAAAvB,UAIAsB,EAAA/sJ,UAAAgvJ,cAAA,SAAA3tC,EAAAvnH,GACA,GAAAkzJ,GAAA3sJ,IAEAsrJ,GAAAtqC,EAAA7+G,OAAA,SAAAiC,GACAuoJ,EAAA+B,WAAAvD,GAAA1xJ,EAAA2K,IACA,SAAAw/H,GACA+oB,EAAA+B,WAAArD,GAAA5xJ,EAAAmqI,KAMA,IAAAgrB,IAAAzB,EA4BA0B,GAAAxB,EAaAyB,GAAAvB,EAQAwB,GAAAvB,EAEAK,GAAA,EAUAI,GAAAN,CA2HAA,GAAA76H,IAAA87H,GACAjB,EAAAjpB,KAAAmqB,GACAlB,EAAA7zI,QAAAg1I,GACAnB,EAAA9+H,OAAAkgI,GACApB,EAAAqB,cAAAnG,EACA8E,EAAAsB,SAAAjG,EACA2E,EAAAuB,MAAAhG,EAEAyE,EAAAhuJ,WACA+X,YAAAi2I,EAmMA70I,KAAA,SAAAgzI,EAAAC,GACA,GAAApgE,GAAA3rF,KACA2+F,EAAAhT,EAAAu/D,MAEA,IAAAvsD,IAAAwsD,KAAAW,GAAAntD,IAAA0sD,KAAAU,EACA,MAAA/rJ,KAGA,IAAAm1C,GAAA,GAAAn1C,MAAA0X,YAAAwyI,GACArsJ,EAAA8tF,EAAAy/D,OAEA,IAAAzsD,EAAA,CACA,GAAApjG,GAAAmpD,UAAAi6C,EAAA,EACAuqD,GAAA,WACAgD,EAAAvtD,EAAAxpD,EAAA55C,EAAAsC,SAGAytJ,GAAA3/D,EAAAx2C,EAAA22G,EAAAC,EAGA,OAAA52G,IA8BAkvF,QAAA,SAAA0nB,GACA,MAAA/rJ,MAAA8Y,KAAA,KAAAizI,IA0BA,IAAAoD,IAAArB,EAEAsB,IACAv3I,QAAAo2I,GACAoB,SAAAF,GAIA,mBAAA3mD,SAAAA,OAAA,IACAA,OAAA,WAAA,MAAA4mD,MACA,mBAAAl1J,IAAAA,EAAA,QACAA,EAAA,QAAAk1J,GACA,mBAAApvJ,QACAA,KAAA,WAAAovJ,IAGAD,OACAp1J,KAAAiG,Q/Xmz4BGjG,KAAKiG,KAAKxG,EAAQ,YAA8B,mBAAX+uG,QAAyBA,OAAyB,mBAAT13E,MAAuBA,KAAyB,mBAAXrE,QAAyBA,aAE5I8iI,SAAW,MAAMC,KAAK,SAAS/1J,EAAQU,EAAOJ,GgYvg6BjD,QAAA01J,MA+IA,QAAAC,KACAzvJ,KAAA0vJ,KAAA,GAgSA,QAAAC,GAAAt7I,EAAAu7I,EAAAvhG,GACAruD,KAAA6vJ,MAAA,GAAA3kJ,YAAA,EAAA4kJ,GACA9vJ,KAAAwsB,OAAA,GAAAtwB,YAAAmyD,GACAruD,KAAAyG,IAAA4nD,EACAruD,KAAA4vJ,QAAAA,EACA5vJ,KAAA+vJ,KAAAC,EACAhwJ,KAAAymB,MAAApS,EAAA,MAEArU,KAAA27B,KAAA,EAEA37B,KAAA28D,MAAA,EACA38D,KAAAD,MAAA,EACAC,KAAAiwJ,MAAA,KACAjwJ,KAAA+gG,GAAA,GAAA71F,YAAA,GACAlL,KAAAm9E,GAAA,GAAAjyE,YAAA,GAEAlL,KAAAkwJ,MAAA,GAAAC,GAEAnwJ,KAAAmjE,KAAA,EAGAnjE,KAAAowJ,KAAA,EACApwJ,KAAAqwJ,KAAA,EACArwJ,KAAAswJ,KAAA,EACAtwJ,KAAAsiH,MAAA,EACAtiH,KAAA20B,MAAA,EAEA30B,KAAAuwJ,QAAA,GAAAC,GA4gBA,QAAAL,MA6fA,QAAAK,MAwPA,QAAAC,GAAAl2I,EAAA+9E,EAAA/vF,EAAAmoJ,EAAAr8I,GAKA,MAJAkG,GAAA,GAAAo2I,EACAr4D,EAAA,GAAAs4D,GACAroJ,EAAA,GAAAsoJ,GACAH,EAAA,GAAAI,GACAC,EA4BA,QAAA3jJ,GAAA+X,EAAAkrB,EAAA2gH,EAAA1gH,EAAAY,GACA,GAAA,GAAAA,EAAA,CAGA,IAAA/rB,EACA,KAAA,WACA,KAAA6rI,EACA,KAAA,YAGA,IAAA3gH,GAAAa,GAAA/rB,EAAAnrB,OACAi3J,EAAA9rI,EAAA6rI,EAAA1gH,GACA4gH,GACAD,EAAA9rI,EAAAsqG,SAAAp/E,EAAAA,EAAAa,GAAA8/G,EAAA1gH,GACA,GAAAnrB,EAAAknG,mBAAAn7E,EAAA,IACA+/G,EAAA,GAAA/0J,YAAAipB,EAAA9iB,OAAA8iB,EAAAyqG,WAAAv/E,EAAAa,GAAA8/G,EAAA1gH,GAEA6gH,EAAAhsI,EAAAkrB,EAAA2gH,EAAA1gH,EAAAY,IAKA,QAAAigH,GAAAhsI,EAAAkrB,EAAA2gH,EAAA1gH,EAAAY,GAIA,IAAA,GAAAz3C,GAAA,EAAAy3C,EAAAz3C,IAAAA,EACAu3J,EAAA1gH,EAAA72C,GAAA0rB,EAAAkrB,EAAA52C,GAIA,QAAAw3J,GAAA9rI,EAAA6rI,EAAA1gH,GACA0gH,EAAA7jI,IAAAhI,EAAAmrB,GAoDA,QAAApjC,GAAA7K,EAAAkE,EAAAvM,EAAAo3J,GAMA/uJ,EALAkE,EAEAvM,EAGA,GAAAkC,YAAAmG,EAAAkE,EAAAvM,GAFA,GAAAkC,YAAAmG,EAAAkE,EAAAlE,EAAApG,WAAAsK,GAFA,GAAArK,YAAAmG,EAOA,IAAAgS,GAAA,GAAAm7I,EACAn7I,GAAAg9I,YAAAC,GAAA,GACAj9I,EAAAk9I,QAAAlvJ,EACAgS,EAAAm9I,cAAA,EACAn9I,EAAAo9I,SAAApvJ,EAAArI,MAIA,KAFA,GAAAuxE,MACAE,EAAA,IACA,CACA,GAAAimF,GAAA,GAAAx1J,YAAA,KACAmY,GAAAs9I,SAAAD,EACAr9I,EAAAu9I,eAAA,EACAv9I,EAAAw9I,UAAAH,EAAA13J,MACA,IAAAsf,GAAAjF,EAAAy9I,QAAAC,EACA,IAAAz4I,GAAAy3I,GAAAz3I,GAAA04I,GAAA14I,GAAA24I,EACA,KAAA59I,GAAAokC,GAEA,IAAA,GAAApkC,EAAAw9I,UAAA,CACA,GAAAK,GAAA,GAAAh2J,YAAAw1J,EAAA13J,OAAAqa,EAAAw9I,UACAzkJ,GAAAskJ,EAAA,EAAAQ,EAAA,EAAAR,EAAA13J,OAAAqa,EAAAw9I,WACAH,EAAAQ,EAIA,GAFA3mF,EAAAruE,KAAAw0J,GACAjmF,GAAAimF,EAAA13J,OACAsf,GAAA04I,GAAA14I,GAAA24I,EACA,MAQA,GAJAb,IACAA,EAAA,IAAA7qJ,GAAA,GAAA8N,EAAAm9I,eAGA,GAAAjmF,EAAAvxE,OACA,MAAAuxE,GAAA,GAAAlpE,MAIA,KAAA,GAFAspE,GAAA,GAAAzvE,YAAAuvE,GACA7vC,EAAA,EACAniC,EAAA,EAAAA,EAAA8xE,EAAAvxE,SAAAP,EAAA,CACA,GAAAiB,GAAA6wE,EAAA9xE,EACA2T,GAAA1S,EAAA,EAAAixE,EAAA/vC,EAAAlhC,EAAAV,QACA4hC,GAAAlhC,EAAAV,OAEA,MAAA2xE,GAAAtpE,OAxlEA,GAAA8vJ,GAAA,GACAb,EAAAa,EAEArC,EAAA,KACAsC,EAAA,GAGAC,EAAA,GAEAN,EAAA,EAIAO,EAAA,EAEAC,EAAA,EAEAxB,EAAA,EACAiB,EAAA,EACAQ,EAAA,EAEAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAV,EAAA,GAGAW,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GAEAC,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,KAAA,KAAA,KAAA,KAAA,MAAA,MAAA,OAEA1D,EAAA,EACA2D,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EAEAxD,EAAA,EACAC,GAAA,EAEAC,IACA,GAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,EAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,EAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IAEA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,EAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,EAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IACA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,EAAA,EAAA,GAAA,EAAA,EAAA,KAEAC,IACA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,KACA,GAAA,EAAA,EAAA,GAAA,EAAA,KAAA,GAAA,EAAA,GAAA,GAAA,EAAA,MACA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,KACA,GAAA,EAAA,EAAA,GAAA,EAAA,KAAA,GAAA,EAAA,IAAA,IAAA,EAAA,MACA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,KACA,GAAA,EAAA,EAAA,GAAA,EAAA,KAAA,GAAA,EAAA,GAAA,GAAA,EAAA,MACA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,MACA,GAAA,EAAA,GAAA,GAAA,EAAA,KAAA,GAAA,EAAA,IAAA,IAAA,EAAA,OAIAsD,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAIAC,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,KAGAC,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IACA,IAAA,IAAA,IAAA,IAAA,KAAA,KAAA,KAAA,KAAA,KAAA,KACA,KAAA,MAAA,MAAA,OAGAC,IACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,GAAA,GAUA/E,GAAA7vJ,UAAA0xJ,YAAA,SAAAhjG,EAAA9pC,GAQA,MAPA8pC,KACAA,EAAAijG,GAEA/sI,IACAA,GAAA,GAEAvkB,KAAAw0J,OAAA,GAAA/E,GACAzvJ,KAAAw0J,OAAAnD,YAAArxJ,KAAAukB,GAAA8pC,EAAAA,IAGAmhG,EAAA7vJ,UAAAmyJ,QAAA,SAAAp4J,GACA,MAAA,OAAAsG,KAAAw0J,OAAA/B,EACAzyJ,KAAAw0J,OAAA1C,QAAA9xJ,KAAAtG,IAGA81J,EAAA7vJ,UAAA80J,WAAA,WACA,GAAA,MAAAz0J,KAAAw0J,OAAA,MAAA/B,EACA,IAAA13C,GAAAy5C,OAAAC,WAAAz0J,KAEA,OADAA,MAAAw0J,OAAA,KACAz5C,GAEAy0C,EAAA7vJ,UAAA+0J,YAAA,WAEA,MAAAF,QAAAE,YAAA10J,OAEAwvJ,EAAA7vJ,UAAAg1J,qBAAA,SAAAC,EAAAC,GAEA,MAAAL,QAAAG,qBAAA30J,KAAA40J,EAAAC,IAmHApF,EAAA9vJ,UAAAm1J,aAAA,SAAAzgJ,GACA,MAAA,OAAAA,GAAA,MAAAA,EAAAmgJ,OAAA/B,GAEAp+I,EAAA0gJ,SAAA1gJ,EAAA2gJ,UAAA,EACA3gJ,EAAAokC,IAAA,KACApkC,EAAAmgJ,OAAAzE,KAAA,GAAA17I,EAAAmgJ,OAAAjwI,OAAA4uI,EAAAP,EACAv+I,EAAAmgJ,OAAAjoH,OAAA9lB,MAAApS,EAAA,MACA08I,IAGAtB,EAAA9vJ,UAAA80J,WAAA,SAAApgJ,GAIA,MAHA,OAAArU,KAAAusC,QACAvsC,KAAAusC,OAAA0oH,KAAA5gJ,GACArU,KAAAusC,OAAA,KACAwkH,GAGAtB,EAAA9vJ,UAAA0xJ,YAAA,SAAAh9I,EAAAg6C,GAYA,MAXAh6C,GAAAokC,IAAA,KACAz4C,KAAAusC,OAAA,KAGAhoB,OAAA,EACA,EAAA8pC,IACAA,GAAAA,EACA9pC,OAAA,GAIA,EAAA8pC,GAAAA,EAAA,IACAruD,KAAAy0J,WAAApgJ,GACAo+I,IAEAzyJ,KAAAk1J,MAAA7mG,EAEAh6C,EAAAmgJ,OAAAjoH,OAAA,GAAAojH,GAAAt7I,EACA,GAAAA,EAAAmgJ,OAAAjwI,OAAA,KAAAvkB,KACA,GAAAquD,GAGAruD,KAAA80J,aAAAzgJ,GACA08I,IAGAtB,EAAA9vJ,UAAAmyJ,QAAA,SAAAz9I,EAAA3a,GACA,GAAAP,GAAAuB,CAEA,IAAA,MAAA2Z,GAAA,MAAAA,EAAAmgJ,QAAA,MAAAngJ,EAAAk9I,QACA,MAAAkB,EAGA,KAFA/4J,EAAAA,GAAA44J,EAAAL,EAAAlB,EACA53J,EAAA84J,IAEA,OAAA59I,EAAAmgJ,OAAAzE,MACA,IAAA6C,GAEA,GAAA,GAAAv+I,EAAAo9I,SAAA,MAAAt4J,EAGA,IAHAA,EAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,YACA,IAAA1gJ,EAAAmgJ,OAAAn7G,OAAAhlC,EAAAk9I,QAAAl9I,EAAAm9I,oBAAAe,EAAA,CACAl+I,EAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAokC,IAAA,6BACApkC,EAAAmgJ,OAAAW,OAAA,CACA,OAEA,IAAA9gJ,EAAAmgJ,OAAAn7G,QAAA,GAAA,EAAAhlC,EAAAmgJ,OAAAU,MAAA,CACA7gJ,EAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAokC,IAAA,sBACApkC,EAAAmgJ,OAAAW,OAAA,CACA,OAEA9gJ,EAAAmgJ,OAAAzE,KAAA8C,CACA,KAAAA,GAEA,GAAA,GAAAx+I,EAAAo9I,SAAA,MAAAt4J,EAKA,IALAA,EAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACAr6J,EAAA,IAAA2Z,EAAAk9I,QAAAl9I,EAAAm9I,mBAEAn9I,EAAAmgJ,OAAAn7G,QAAA,GAAA3+C,GAAA,IAAA,EAAA,CACA2Z,EAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAokC,IAAA,yBACApkC,EAAAmgJ,OAAAW,OAAA,CACA,OAGA,GAAA,IAAAz6J,EAAA23J,GAAA,CACAh+I,EAAAmgJ,OAAAzE,KAAAoD,CACA,OAEA9+I,EAAAmgJ,OAAAzE,KAAA+C,CACA,KAAAA,GAEA,GAAA,GAAAz+I,EAAAo9I,SAAA,MAAAt4J,EAAAA,GAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,MAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,mBAAA,GAAA,WACAn9I,EAAAmgJ,OAAAzE,KAAAgD,CACA,KAAAA,GAEA,GAAA,GAAA1+I,EAAAo9I,SAAA,MAAAt4J,EAAAA,GAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,OAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,mBAAA,GAAA,SACAn9I,EAAAmgJ,OAAAzE,KAAAiD,CACA,KAAAA,GAEA,GAAA,GAAA3+I,EAAAo9I,SAAA,MAAAt4J,EAAAA,GAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,OAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,mBAAA,EAAA,MACAn9I,EAAAmgJ,OAAAzE,KAAAkD,CACA,KAAAA,GAEA,MAAA,IAAA5+I,EAAAo9I,SAAAt4J,GAAAA,EAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,MAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,iBACAn9I,EAAAghJ,MAAAhhJ,EAAAmgJ,OAAAY,KACA/gJ,EAAAmgJ,OAAAzE,KAAAmD,EACAV,EACA,KAAAU,GAIA,MAHA7+I,GAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAokC,IAAA,kBACApkC,EAAAmgJ,OAAAW,OAAA,EACA1C,CACA,KAAAU,GAGA,GADAh6J,EAAAkb,EAAAmgJ,OAAAjoH,OAAA+oH,KAAAjhJ,EAAAlb,GACAA,GAAAu5J,EAAA,CACAr+I,EAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAmgJ,OAAAW,OAAA,CACA,OAKA,GAHAh8J,GAAA43J,IACA53J,EAAAO,GAEAP,GAAA64J,EACA,MAAA74J,EAIA,IAFAA,EAAAO,EACA2a,EAAAmgJ,OAAAjoH,OAAA9lB,MAAApS,EAAAA,EAAAmgJ,OAAA9E,KACA,GAAAr7I,EAAAmgJ,OAAAjwI,OAAA,CACAlQ,EAAAmgJ,OAAAzE,KAAAyD,CACA,OAEAn/I,EAAAmgJ,OAAAzE,KAAAqD,CACA,KAAAA,GAEA,GAAA,GAAA/+I,EAAAo9I,SAAA,MAAAt4J,EAAAA,GAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,MAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,mBAAA,GAAA,WACAn9I,EAAAmgJ,OAAAzE,KAAAsD,CACA,KAAAA,GAEA,GAAA,GAAAh/I,EAAAo9I,SAAA,MAAAt4J,EAAAA,GAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,OAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,mBAAA,GAAA,SACAn9I,EAAAmgJ,OAAAzE,KAAAuD,CACA,KAAAA,GAEA,GAAA,GAAAj/I,EAAAo9I,SAAA,MAAAt4J,EAAAA,GAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,OAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,mBAAA,EAAA,MACAn9I,EAAAmgJ,OAAAzE,KAAAwD,CACA,KAAAA,GAEA,GAAA,GAAAl/I,EAAAo9I,SAAA,MAAAt4J,EAKA,IALAA,EAAAO,EAEA2a,EAAAo9I,WAAAp9I,EAAA0gJ,WACA1gJ,EAAAmgJ,OAAAY,MAAA,IAAA/gJ,EAAAk9I,QAAAl9I,EAAAm9I,iBAEAn9I,EAAAmgJ,OAAA9E,IAAA,IAAAr7I,EAAAmgJ,OAAA,KAAA,CACAngJ,EAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAokC,IAAA,uBACApkC,EAAAmgJ,OAAAW,OAAA,CACA,OAGA9gJ,EAAAmgJ,OAAAzE,KAAAyD,CACA,KAAAA,GACA,MAAAxB,EACA,KAAAyB,GACA,MAAAf,EACA,SACA,MAAAD,KAMAhD,EAAA9vJ,UAAAg1J,qBAAA,SAAAtgJ,EAAAugJ,EAAAC,GACA,GAAA90J,GAAA,EACA/F,EAAA66J,CACA,OAAA,OAAAxgJ,GAAA,MAAAA,EAAAmgJ,QAAAngJ,EAAAmgJ,OAAAzE,MAAAmD,EACAT,EAEAp+I,EAAAkhJ,OAAAC,QAAA,EAAAZ,EAAA,EAAAC,IAAAxgJ,EAAAghJ,MACA3C,GAGAr+I,EAAAghJ,MAAAhhJ,EAAAkhJ,OAAAC,QAAA,EAAA,KAAA,EAAA,GAEAx7J,GAAA,GAAAqa,EAAAmgJ,OAAAU,QACAl7J,GAAA,GAAAqa,EAAAmgJ,OAAAU,OAAA,EACAn1J,EAAA80J,EAAA76J,GAEAqa,EAAAmgJ,OAAAjoH,OAAAkpH,eAAAb,EAAA70J,EAAA/F,GACAqa,EAAAmgJ,OAAAzE,KAAAoD,EACApC,GAIA,IAAA2E,KAAA,EAAA,EAAA,IAAA,IAEAjG,GAAA9vJ,UAAA+0J,YAAA,SAAArgJ,GACA,GAAAnb,GACAqB,EACAuO,EACA3P,EAAAk1D,CAGA,IAAA,MAAAh6C,GAAA,MAAAA,EAAAmgJ,OACA,MAAA/B,EAKA,IAJAp+I,EAAAmgJ,OAAAzE,MAAA0D,IACAp/I,EAAAmgJ,OAAAzE,KAAA0D,EACAp/I,EAAAmgJ,OAAAW,OAAA,GAEA,IAAAj8J,EAAAmb,EAAAo9I,UACA,MAAAQ,EAKA,KAJA13J,EAAA8Z,EAAAm9I,cACA1oJ,EAAAuL,EAAAmgJ,OAAAW,OAGA,GAAAj8J,GAAA,EAAA4P,GACAuL,EAAAk9I,QAAAh3J,IAAAm7J,GAAA5sJ,GACAA,IAGAA,EADA,GAAAuL,EAAAk9I,QAAAh3J,GACA,EAGA,EAAAuO,EAEAvO,IAAArB,GAUA,OANAmb,GAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cACAn9I,EAAAm9I,cAAAj3J,EACA8Z,EAAAo9I,SAAAv4J,EACAmb,EAAAmgJ,OAAAW,OAAArsJ,EAGA,GAAAA,EACA4pJ,GAEAv5J,EAAAkb,EAAA0gJ,SAAA1mG,EAAAh6C,EAAA2gJ,UACAh1J,KAAA80J,aAAAzgJ,GACAA,EAAA0gJ,SAAA57J,EAAAkb,EAAA2gJ,UAAA3mG,EACAh6C,EAAAmgJ,OAAAzE,KAAAoD,EACApC,IASAtB,EAAA9vJ,UAAAg2J,iBAAA,SAAAthJ,GACA,MAAA,OAAAA,GAAA,MAAAA,EAAAmgJ,QAAA,MAAAngJ,EAAAmgJ,OAAAjoH,OACAkmH,EACAp+I,EAAAmgJ,OAAAjoH,OAAAqpH,aAQA,IAAAC,KAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAmCAlG,GAAAhwJ,UAAA8mB,MAAA,SAAApS,EAAAhU,GACAA,IAAAA,EAAA,GAAAL,KAAA20B,OACA30B,KAAA+vJ,MAAAiE,GACAh0J,KAAAkwJ,MAAA+E,KAAA5gJ,GAEArU,KAAA+vJ,KAAAC,EACAhwJ,KAAAowJ,KAAA,EACApwJ,KAAAqwJ,KAAA,EACArwJ,KAAAswJ,KAAAtwJ,KAAAsiH,MAAA,EAEAtiH,KAAA4vJ,UACAv7I,EAAAghJ,MAAAr1J,KAAA20B,MAAAtgB,EAAAkhJ,OAAAC,QAAA,EAAA,KAAA,EAAA,KAGA7F,EAAAhwJ,UAAA21J,KAAA,SAAAjhJ,EAAAlb,GACA,GAAAF,GACAyB,EACA0W,EACA7W,EACArB,EACA4B,EACAgO,CAOA,KAJAvO,EAAA8Z,EAAAm9I,cAAAt4J,EAAAmb,EAAAo9I,SAAA/2J,EAAAsF,KAAAqwJ,KAAAj/I,EAAApR,KAAAowJ,KACAt1J,EAAAkF,KAAAsiH,MAAAx5G,EAAAhO,EAAAkF,KAAAswJ,KAAAtwJ,KAAAswJ,KAAAx1J,EAAA,EAAAkF,KAAAyG,IAAA3L,IAIA,OAAAkF,KAAA+vJ,MACA,IAAAC,GAEA,KAAA,EAAA5+I,GAAA,CACA,GAAA,GAAAlY,EAQA,MAJA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EACAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAPAA,GAAA43J,EASA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAKA,OAHAnY,EAAA,EAAAyB,EACAsF,KAAAmjE,KAAA,EAAAlqE,EAEAA,IAAA,GACA,IAAA,GACAyB,KAAA,EAAA0W,GAAA,EACAnY,EAAA,EAAAmY,EAEA1W,KAAA,EAAA0W,GAAA,EACApR,KAAA+vJ,KAAA4D,CACA,MACA,KAAA,GAEA,GAAAp5I,GAAA,GAAArP,YAAA,GACAotF,EAAA,GAAAptF,YAAA,GACA3C,KACAmoJ,IAEAD,GAAAl2I,EAAA+9E,EAAA/vF,EAAAmoJ,EAAAr8I,GACArU,KAAAkwJ,MAAA3yH,KAAAhjB,EAAA,GAAA+9E,EAAA,GAAA/vF,EAAA,GAAA,EAAAmoJ,EAAA,GAAA,EAAAr8I,GAGA3Z,KAAA,EAAA0W,GAAA,EAEApR,KAAA+vJ,KAAAiE,CACA,MACA,KAAA,GAEAt5J,KAAA,EAAA0W,GAAA,EAEApR,KAAA+vJ,KAAA8D,CACA,MACA,KAAA,GAUA,MARAn5J,MAAA,EAAA0W,GAAA,EACApR,KAAA+vJ,KAAA0D,EACAp/I,EAAAokC,IAAA,qBACAt/C,EAAAu5J,EAEA1yJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,GAEA,KACA,KAAAw6J,GACA,KAAA,GAAAviJ,GAAA,CACA,GAAA,GAAAlY,EAQA,MAJA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EACAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAPAA,GAAA43J,EASA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAGA,KAAA1W,IAAA,GAAA,SAAA,MAAAA,GAQA,MAPAsF,MAAA+vJ,KAAA0D,EACAp/I,EAAAokC,IAAA,+BACAt/C,EAAAu5J,EAEA1yJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAEA6G,MAAA27B,KAAA,MAAAjhC,EACAA,EAAA0W,EAAA,EACApR,KAAA+vJ,KAAA,GAAA/vJ,KAAA27B,KAAAi4H,EAAA,GAAA5zJ,KAAAmjE,KAAA8wF,EAAAjE,CACA,MACA,KAAA4D,GACA,GAAA,GAAA16J,EAIA,MAHA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACA+nH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAGA,IAAA,GAAA2P,IACAhO,GAAA2L,KAAA,GAAA6pJ,OACAx1J,EAAA,EAAAgO,EAAAhO,EAAAkF,KAAAswJ,KAAAtwJ,KAAAswJ,KAAAx1J,EAAA,EAAAkF,KAAAyG,IAAA3L,GAEA,GAAAgO,IACA9I,KAAAsiH,MAAAxnH,EACA3B,EAAA6G,KAAA81J,cAAAzhJ,EAAAlb,GACA2B,EAAAkF,KAAAsiH,MAAAx5G,EAAAhO,EAAAkF,KAAAswJ,KAAAtwJ,KAAAswJ,KAAAx1J,EAAA,EAAAkF,KAAAyG,IAAA3L,EACAA,GAAAkF,KAAAyG,KAAA,GAAAzG,KAAAswJ,OACAx1J,EAAA,EAAAgO,EAAAhO,EAAAkF,KAAAswJ,KAAAtwJ,KAAAswJ,KAAAx1J,EAAA,EAAAkF,KAAAyG,IAAA3L,GAEA,GAAAgO,IAIA,MAHA9I,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAYA,IARAA,EAAA43J,EAEA93J,EAAA+G,KAAA27B,KACA1iC,EAAAC,IAAAD,EAAAC,GACAD,EAAA6P,IAAA7P,EAAA6P,GACAsE,EAAAiH,EAAAk9I,QAAAh3J,EAAAyF,KAAAwsB,OAAA1xB,EAAA7B,GACAsB,GAAAtB,EAAAC,GAAAD,EACA6B,GAAA7B,EAAA6P,GAAA7P,EACA,IAAA+G,KAAA27B,MAAA1iC,GACA,KACA+G,MAAA+vJ,KAAA,GAAA/vJ,KAAAmjE,KAAA8wF,EAAAjE,CACA,MACA,KAAA6D,GAEA,KAAA,GAAAziJ,GAAA,CACA,GAAA,GAAAlY,EAQA,MAJA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EACAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAPAA,GAAA43J,EASA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAIA,GADApR,KAAA28D,MAAA1jE,EAAA,MAAAyB,GACA,GAAAzB,GAAA,KAAAA,GAAA,EAAA,IAAA,GASA,MAPA+G,MAAA+vJ,KAAAoE,EACA9/I,EAAAokC,IAAA,sCACAt/C,EAAAu5J,EAEA1yJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAGA,IADAF,EAAA,KAAA,GAAAA,IAAAA,GAAA,EAAA,IACA,MAAA+G,KAAAiwJ,OAAAjwJ,KAAAiwJ,MAAAj2J,OAAAf,EACA+G,KAAAiwJ,MAAA,GAAA/kJ,YAAAjS,OAGA,KAAA,GAAAQ,GAAA,EAAAR,EAAAQ,EAAAA,IACAuG,KAAAiwJ,MAAAx2J,GAAA,CAIAiB,MAAA,GAAA0W,GAAA,GAEApR,KAAAD,MAAA,EACAgwJ,KAAA+D,CACA,KAAAA,GACA,KAAA9zJ,KAAAD,MAAA,GAAAC,KAAA28D,QAAA,KAAA,CACA,KAAA,EAAAvrD,GAAA,CACA,GAAA,GAAAlY,EAQA,MAJA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EACAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAPAA,GAAA43J,EASA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAGApR,KAAAiwJ,MAAA4F,GAAA71J,KAAAD,UAAA,EAAArF,EAEAA,KAAA,EAAA0W,GAAA,EAGA,KAAApR,KAAAD,MAAA,IACAC,KAAAiwJ,MAAA4F,GAAA71J,KAAAD,UAAA,CAKA,IAFAC,KAAA+gG,GAAA,GAAA,EACA9nG,EAAA+G,KAAAuwJ,QAAAwF,mBAAA/1J,KAAAiwJ,MAAAjwJ,KAAA+gG,GAAA/gG,KAAAm9E,GAAAn9E,KAAA6vJ,MAAAx7I,GACApb,GAAA83J,EAUA,MATA53J,GAAAF,EACAE,GAAAu5J,IACA1yJ,KAAAiwJ,MAAA,KACAjwJ,KAAA+vJ,KAAAoE,GAGAn0J,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACA+nH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAGA6G,MAAAD,MAAA,EACAC,KAAA+vJ,KAAAgE,CACA,KAAAA,GACA,OAAA,CAEA,GADA96J,EAAA+G,KAAA28D,QACA38D,KAAAD,MAAA,KAAA,GAAA9G,IAAAA,GAAA,EAAA,KACA,KAGA,IACAQ,GAAAsD,EAAAsD,CAIA,KAFApH,EAAA+G,KAAA+gG,GAAA,GAEA,EAAA3vF,GAAA,CACA,GAAA,GAAAlY,EAQA,MAJA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EACAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAPAA,GAAA43J,EASA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAUA,GAHAnY,EAAA+G,KAAA6vJ,MAAA,GAAA7vJ,KAAAm9E,GAAA,IAAAziF,EAAAg5J,EAAAz6J,KAAA,GACAoH,EAAAL,KAAA6vJ,MAAA,GAAA7vJ,KAAAm9E,GAAA,IAAAziF,EAAAg5J,EAAAz6J,KAAA,GAEA,GAAAoH,EACA3F,KAAA,EAAA0W,GAAA,EACApR,KAAAiwJ,MAAAjwJ,KAAAD,SAAAM,MAEA,CAIA,IAHA5G,EAAA,IAAA4G,EAAA,EAAAA,EAAA,GACAtD,EAAA,IAAAsD,EAAA,GAAA,EAEApH,EAAAQ,EAAA2X,GAAA,CACA,GAAA,GAAAlY,EAQA,MAJA8G,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EACAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAPAA,GAAA43J,EASA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAWA,GARA1W,KAAA,EAAA0W,GAAA,EAEArU,GAAArC,EAAAg5J,EAAAj6J,GAEAiB,KAAA,EAAA0W,GAAA,EAEA3X,EAAAuG,KAAAD,MACA9G,EAAA+G,KAAA28D,MACAljE,EAAAsD,EAAA,KAAA,GAAA9D,IAAAA,GAAA,EAAA,KACA,IAAAoH,GAAA,EAAA5G,EASA,MARAuG,MAAAiwJ,MAAA,KACAjwJ,KAAA+vJ,KAAAoE,EACA9/I,EAAAokC,IAAA,4BACAt/C,EAAAu5J,EAEA1yJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAGAkH,GAAA,IAAAA,EAAAL,KAAAiwJ,MAAAx2J,EAAA,GAAA,CACA,GACAuG,MAAAiwJ,MAAAx2J,KAAA4G,QAEA,KAAAtD,EACAiD,MAAAD,MAAAtG,GAIAuG,KAAAm9E,GAAA,GAAA,EAEA,IAAA5iE,GAAA,GAAArP,YAAA,GACAotF,EAAA,GAAAptF,YAAA,GACA3C,EAAA,GAAA2C,YAAA,GACAwlJ,EAAA,GAAAxlJ,YAAA,EASA,IARAqP,EAAA,GAAA,EACA+9E,EAAA,GAAA,EAEAr/F,EAAA+G,KAAA28D,MACA1jE,EAAA+G,KAAAuwJ,QAAAyF,sBAAA,KAAA,GAAA/8J,GACA,GAAAA,GAAA,EAAA,IACA+G,KAAAiwJ,MAAA11I,EAAA+9E,EAAA/vF,EAAAmoJ,EAAA1wJ,KAAA6vJ,MAAAx7I,GAEApb,GAAA83J,EAUA,MATA93J,IAAAy5J,IACA1yJ,KAAAiwJ,MAAA,KACAjwJ,KAAA+vJ,KAAA0D,GAEAt6J,EAAAF,EAEA+G,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAEA6G,MAAAkwJ,MAAA3yH,KAAAhjB,EAAA,GAAA+9E,EAAA,GAAAt4F,KAAA6vJ,MAAAtnJ,EAAA,GAAAvI,KAAA6vJ,MAAAa,EAAA,GAAAr8I,GAEArU,KAAA+vJ,KAAAiE,CACA,KAAAA,GAKA,GAJAh0J,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,GAEA3B,EAAA6G,KAAAkwJ,MAAAoF,KAAAt1J,KAAAqU,EAAAlb,KAAA64J,EACA,MAAAhyJ,MAAA81J,cAAAzhJ,EAAAlb,EAQA,IANAA,EAAA43J,EACA/wJ,KAAAkwJ,MAAA+E,KAAA5gJ,GAEA9Z,EAAA8Z,EAAAm9I,cAAAt4J,EAAAmb,EAAAo9I,SAAA/2J,EAAAsF,KAAAqwJ,KAAAj/I,EAAApR,KAAAowJ,KACAt1J,EAAAkF,KAAAsiH,MAAAx5G,EAAAhO,EAAAkF,KAAAswJ,KAAAtwJ,KAAAswJ,KAAAx1J,EAAA,EAAAkF,KAAAyG,IAAA3L,EAEA,GAAAkF,KAAAmjE,KAAA,CACAnjE,KAAA+vJ,KAAAC,CACA,OAEAhwJ,KAAA+vJ,KAAAkE,CACA,KAAAA,GAIA,GAHAj0J,KAAAsiH,MAAAxnH,EACA3B,EAAA6G,KAAA81J,cAAAzhJ,EAAAlb,GACA2B,EAAAkF,KAAAsiH,MAAAx5G,EAAAhO,EAAAkF,KAAAswJ,KAAAtwJ,KAAAswJ,KAAAx1J,EAAA,EAAAkF,KAAAyG,IAAA3L,EACAkF,KAAAswJ,MAAAtwJ,KAAAsiH,MAIA,MAHAtiH,MAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAEA42J,MAAAyD,CACA,KAAAU,GAMA,MALA/6J,GAAA64J,EAEAhyJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EACA,KAAAg7J,GAMA,MALAh7J,GAAAu5J,EAEA1yJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,EAEA,SAMA,MALAA,GAAAs5J,EAEAzyJ,KAAAqwJ,KAAA31J,EAAAsF,KAAAowJ,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAyF,KAAAsiH,MAAAxnH,EACAkF,KAAA81J,cAAAzhJ,EAAAlb,KAKAw2J,EAAAhwJ,UAAAs1J,KAAA,SAAA5gJ,GACArU,KAAAymB,MAAApS,EAAA,MACArU,KAAAwsB,OAAA,KACAxsB,KAAA6vJ,MAAA,MAGAF,EAAAhwJ,UAAA81J,eAAA,SAAAvgJ,EAAA3O,EAAArN,GACAkU,EAAA8H,EAAA3O,EAAAimB,OAAA,EAAAtzB,GACA8G,KAAAswJ,KAAAtwJ,KAAAsiH,MAAAppH,GAKAy2J,EAAAhwJ,UAAAi2J,WAAA,WACA,MAAA51J,MAAA+vJ,MAAA4D,GAIAhE,EAAAhwJ,UAAAm2J,cAAA,SAAAzhJ,EAAAlb,GACA,GAAAD,GACAqB,EACAO,CAuDA,OApDAP,GAAA8Z,EAAAu9I,eACA92J,EAAAkF,KAAAswJ,KAGAp3J,GAAA4B,GAAAkF,KAAAsiH,MAAAtiH,KAAAsiH,MAAAtiH,KAAAyG,KAAA3L,EACA5B,EAAAmb,EAAAw9I,YAAA34J,EAAAmb,EAAAw9I,WACA,GAAA34J,GAAAC,GAAA84J,IAAA94J,EAAA43J,GAGA18I,EAAAw9I,WAAA34J,EACAmb,EAAA2gJ,WAAA97J,EAGA,MAAA8G,KAAA4vJ,UACAv7I,EAAAghJ,MAAAr1J,KAAA20B,MAAAtgB,EAAAkhJ,OAAAC,QAAAx1J,KAAA20B,MAAA30B,KAAAwsB,OAAA1xB,EAAA5B,IAGAkU,EAAApN,KAAAwsB,OAAA1xB,EAAAuZ,EAAAs9I,SAAAp3J,EAAArB,GACAqB,GAAArB,EACA4B,GAAA5B,EAGA4B,GAAAkF,KAAAyG,MAEA3L,EAAA,EACAkF,KAAAsiH,OAAAtiH,KAAAyG,MACAzG,KAAAsiH,MAAA,GAGAppH,EAAA8G,KAAAsiH,MAAAxnH,EACA5B,EAAAmb,EAAAw9I,YAAA34J,EAAAmb,EAAAw9I,WACA,GAAA34J,GAAAC,GAAA84J,IAAA94J,EAAA43J,GAGA18I,EAAAw9I,WAAA34J,EACAmb,EAAA2gJ,WAAA97J,EAGA,MAAA8G,KAAA4vJ,UACAv7I,EAAAghJ,MAAAr1J,KAAA20B,MAAAtgB,EAAAkhJ,OAAAC,QAAAx1J,KAAA20B,MAAA30B,KAAAwsB,OAAA1xB,EAAA5B,IAGAkU,EAAApN,KAAAwsB,OAAA1xB,EAAAuZ,EAAAs9I,SAAAp3J,EAAArB,GACAqB,GAAArB,EACA4B,GAAA5B,GAIAmb,EAAAu9I,eAAAr3J,EACAyF,KAAAswJ,KAAAx1J,EAGA3B,EAOA,IAAA88J,IAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,CAKAvG,GAAAxwJ,UAAA49B,KAAA,SAAAhjB,EAAA+9E,EAAA/vF,EAAAouJ,EAAAjG,EAAAkG,EAAAviJ,GACArU,KAAA+vJ,KAAAkG,GACAj2J,KAAA62J,MAAAt8I,EACAva,KAAA82J,MAAAx+D,EACAt4F,KAAA+2J,MAAAxuJ,EACAvI,KAAAg3J,YAAAL,EACA32J,KAAAi3J,MAAAvG,EACA1wJ,KAAAk3J,YAAAN,EACA52J,KAAAm3J,KAAA,MAGAhH,EAAAxwJ,UAAA21J,KAAA,SAAAl8J,EAAAib,EAAAlb,GACA,GAAA4D,GAEAq6J,EACAp+J,EAIAE,EACA4B,EACAgO,EACApP,EANAgB,EAAA,EACA0W,EAAA,EACA7W,EAAA,CAWA,KAJAA,EAAA8Z,EAAAm9I,cAAAt4J,EAAAmb,EAAAo9I,SAAA/2J,EAAAtB,EAAAi3J,KAAAj/I,EAAAhY,EAAAg3J,KACAt1J,EAAA1B,EAAAkpH,MAAAx5G,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,IAIA,OAAAkF,KAAA+vJ,MAEA,IAAAkG,IACA,GAAAntJ,GAAA,KAAA5P,GAAA,KAEAE,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA3B,EAAA6G,KAAAq3J,aAAAr3J,KAAA62J,MAAA72J,KAAA82J,MACA92J,KAAA+2J,MAAA/2J,KAAAg3J,YACAh3J,KAAAi3J,MAAAj3J,KAAAk3J,YACA99J,EAAAib,GAEA9Z,EAAA8Z,EAAAm9I,cAAAt4J,EAAAmb,EAAAo9I,SAAA/2J,EAAAtB,EAAAi3J,KAAAj/I,EAAAhY,EAAAg3J,KACAt1J,EAAA1B,EAAAkpH,MAAAx5G,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,EAEA3B,GAAA43J,GAAA,CACA/wJ,KAAA+vJ,KAAA52J,GAAA64J,EAAAwE,GAAAE,EACA,OAGA12J,KAAAo1J,KAAAp1J,KAAA62J,MACA72J,KAAAm3J,KAAAn3J,KAAA+2J,MACA/2J,KAAAs3J,WAAAt3J,KAAAg3J,YAEAh3J,KAAA+vJ,KAAAmG,EACA,KAAAA,IAGA,IAFAn5J,EAAAiD,KAAAo1J,KAEA,EAAAhkJ,GAAA,CACA,GAAA,GAAAlY,EAMA,MAHAE,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EANAA,GAAA43J,EAQA73J,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAUA,GAPAgmJ,EAAA,GAAAp3J,KAAAs3J,YAAA58J,EAAAg5J,EAAA32J,KAEArC,KAAAsF,KAAAm3J,KAAAC,EAAA,GACAhmJ,GAAApR,KAAAm3J,KAAAC,EAAA,GAEAp+J,EAAAgH,KAAAm3J,KAAAC,GAEA,GAAAp+J,EAAA;AACAgH,KAAAu3J,IAAAv3J,KAAAm3J,KAAAC,EAAA,GACAp3J,KAAA+vJ,KAAAwG,EACA,OAEA,GAAA,IAAA,GAAAv9J,GAAA,CACAgH,KAAAspC,IAAA,GAAAtwC,EACAgH,KAAAgiC,IAAAhiC,KAAAm3J,KAAAC,EAAA,GACAp3J,KAAA+vJ,KAAAoG,EACA,OAEA,GAAA,IAAA,GAAAn9J,GAAA,CACAgH,KAAAo1J,KAAAp8J,EACAgH,KAAAs3J,WAAAF,EAAA,EAAAp3J,KAAAm3J,KAAAC,EAAA,EACA,OAEA,GAAA,IAAA,GAAAp+J,GAAA,CACAgH,KAAA+vJ,KAAAyG,EACA,OASA,MAPAx2J,MAAA+vJ,KAAA2G,GACAriJ,EAAAokC,IAAA,8BACAt/C,EAAAu5J,EAEAt5J,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAEA,KAAAg9J,IAGA,IAFAp5J,EAAAiD,KAAAspC,IAEA,EAAAl4B,GAAA,CACA,GAAA,GAAAlY,EAMA,MAHAE,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EANAA,GAAA43J,EAQA73J,IAAAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAGApR,KAAAgiC,KAAAtnC,EAAAg5J,EAAA32J,GAEArC,IAAAqC,EACAqU,GAAArU,EAEAiD,KAAAo1J,KAAAp1J,KAAA82J,MACA92J,KAAAm3J,KAAAn3J,KAAAi3J,MACAj3J,KAAAs3J,WAAAt3J,KAAAk3J,YACAl3J,KAAA+vJ,KAAAqG,EACA,KAAAA,IAGA,IAFAr5J,EAAAiD,KAAAo1J,KAEA,EAAAhkJ,GAAA,CACA,GAAA,GAAAlY,EAMA,MAHAE,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EANAA,GAAA43J,EAQA73J,IAAAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EASA,GANAgmJ,EAAA,GAAAp3J,KAAAs3J,YAAA58J,EAAAg5J,EAAA32J,KAEArC,IAAAsF,KAAAm3J,KAAAC,EAAA,GACAhmJ,GAAApR,KAAAm3J,KAAAC,EAAA,GAEAp+J,EAAAgH,KAAAm3J,KAAAC,GACA,IAAA,GAAAp+J,GAAA,CACAgH,KAAAspC,IAAA,GAAAtwC,EACAgH,KAAAw3J,KAAAx3J,KAAAm3J,KAAAC,EAAA,GACAp3J,KAAA+vJ,KAAAsG,EACA,OAEA,GAAA,IAAA,GAAAr9J,GAAA,CACAgH,KAAAo1J,KAAAp8J,EACAgH,KAAAs3J,WAAAF,EAAA,EAAAp3J,KAAAm3J,KAAAC,EAAA,EACA,OASA,MAPAp3J,MAAA+vJ,KAAA2G,GACAriJ,EAAAokC,IAAA,wBACAt/C,EAAAu5J,EAEAt5J,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAEA,KAAAk9J,IAGA,IAFAt5J,EAAAiD,KAAAspC,IAEA,EAAAl4B,GAAA,CACA,GAAA,GAAAlY,EAMA,MAHAE,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EANAA,GAAA43J,EAQA73J,IAAAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EACAA,GAAA,EAGApR,KAAAw3J,MAAA98J,EAAAg5J,EAAA32J,GAEArC,IAAAqC,EACAqU,GAAArU,EAEAiD,KAAA+vJ,KAAAuG,EACA,KAAAA,IAEA,IADA58J,EAAAoB,EAAAkF,KAAAw3J,KACA,EAAA99J,GACAA,GAAAN,EAAAqN,GAEA,MAAA,GAAAzG,KAAAgiC,KAAA,CAEA,GAAA,GAAAl5B,IACAhO,GAAA1B,EAAAqN,KAAA,GAAArN,EAAAk3J,OAAAx1J,EAAA,EAAAgO,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,GACA,GAAAgO,IACA1P,EAAAkpH,MAAAxnH,EAAA3B,EAAAC,EAAA08J,cAAAzhJ,EAAAlb,GACA2B,EAAA1B,EAAAkpH,MAAAx5G,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,EAEAA,GAAA1B,EAAAqN,KAAA,GAAArN,EAAAk3J,OAAAx1J,EAAA,EAAAgO,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,GAEA,GAAAgO,IAIA,MAHA1P,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAKAC,GAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAA9yB,KAAAoP,IAEApP,GAAAN,EAAAqN,MACA/M,EAAA,GACAsG,KAAAgiC,MAEAhiC,KAAA+vJ,KAAAkG,EACA,MACA,KAAAM,IACA,GAAA,GAAAztJ,IACAhO,GAAA1B,EAAAqN,KAAA,GAAArN,EAAAk3J,OAAAx1J,EAAA,EAAAgO,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,GACA,GAAAgO,IACA1P,EAAAkpH,MAAAxnH,EAAA3B,EAAAC,EAAA08J,cAAAzhJ,EAAAlb,GACA2B,EAAA1B,EAAAkpH,MAAAx5G,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,EAEAA,GAAA1B,EAAAqN,KAAA,GAAArN,EAAAk3J,OAAAx1J,EAAA,EAAAgO,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,GACA,GAAAgO,IAIA,MAHA1P,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAIAA,GAAA43J,EAEA33J,EAAAozB,OAAA1xB,KAAAkF,KAAAu3J,IAAAzuJ,IAEA9I,KAAA+vJ,KAAAkG,EACA,MACA,KAAAO,IAUA,GATAplJ,EAAA,IACAA,GAAA,EACAlY,IACAqB,KAGAnB,EAAAkpH,MAAAxnH,EAAA3B,EAAAC,EAAA08J,cAAAzhJ,EAAAlb,GACA2B,EAAA1B,EAAAkpH,MAAAx5G,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,EAEA1B,EAAAk3J,MAAAl3J,EAAAkpH,MAIA,MAHAlpH,GAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAEA6G,MAAA+vJ,KAAA0G,EACA,KAAAA,IAKA,MAJAt9J,GAAA64J,EACA54J,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAEA,KAAAu9J,IAOA,MALAv9J,GAAAu5J,EAEAt5J,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,EAEA,SAMA,MALAA,GAAAs5J,EAEAr5J,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EACA1B,EAAA08J,cAAAzhJ,EAAAlb,KAKAg3J,EAAAxwJ,UAAAs1J,KAAA,SAAA5gJ,KASA87I,EAAAxwJ,UAAA03J,aAAA,SAAA98I,EAAA+9E,EAAA/vF,EAAAouJ,EAAAjG,EAAAkG,EAAAx9J,EAAAib,GACA,GAAApb,GACAw+J,EACAC,EACA1+J,EACA0B,EACA0W,EACA7W,EACArB,EACA4B,EACAgO,EACA6uJ,EACAC,EACAv3J,EACA6U,EACA/b,EAEA0+J,CAGAt9J,GAAA8Z,EAAAm9I,cAAAt4J,EAAAmb,EAAAo9I,SAAA/2J,EAAAtB,EAAAi3J,KAAAj/I,EAAAhY,EAAAg3J,KACAt1J,EAAA1B,EAAAkpH,MAAAx5G,EAAAhO,EAAA1B,EAAAk3J,KAAAl3J,EAAAk3J,KAAAx1J,EAAA,EAAA1B,EAAAqN,IAAA3L,EAGA68J,EAAAjE,EAAAn5I,GACAq9I,EAAAlE,EAAAp7D,EAGA,GAAA,CAEA,KAAA,GAAAlnF,GACAlY,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EAAAA,GAAA,CAOA,IAJAnY,EAAAyB,EAAAi9J,EACAF,EAAAlvJ,EACAmvJ,EAAAf,EACAkB,EAAA,GAAAH,EAAAz+J,GACA,IAAAD,EAAAy+J,EAAAI,IAOA,OAAA,CAIA,GAFAn9J,IAAA+8J,EAAAI,EAAA,GAAAzmJ,GAAAqmJ,EAAAI,EAAA,GAEA,IAAA,GAAA7+J,GAAA,CAOA,IANAA,GAAA,GACAqH,EAAAo3J,EAAAI,EAAA,IAAAn9J,EAAAg5J,EAAA16J,IAEA0B,IAAA1B,EAAAoY,GAAApY,EAGA,GAAAoY,GACAlY,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EAAAA,GAAA,CASA,KANAnY,EAAAyB,EAAAk9J,EACAH,EAAA/G,EACAgH,EAAAd,EACAiB,EAAA,GAAAH,EAAAz+J,GACAD,EAAAy+J,EAAAI,KAEA,CAIA,GAFAn9J,IAAA+8J,EAAAI,EAAA,GAAAzmJ,GAAAqmJ,EAAAI,EAAA,GAEA,IAAA,GAAA7+J,GAAA,CAGA,IADAA,GAAA,GACA,EAAAoY,GACAlY,IACAwB,IAAA,IAAA2Z,EAAAk9I,QAAAh3J,OAAA6W,EAAAA,GAAA,CASA,IANA8D,EAAAuiJ,EAAAI,EAAA,IAAAn9J,EAAAg5J,EAAA16J,IAEA0B,IAAA,EAAA0W,GAAA,EAGAtI,GAAAzI,EACAvF,GAAAoa,EAEA/b,EAAA2B,EAAAoa,EACApa,EAAA3B,EAAA,GAAA,EAAA2B,EAAA3B,GACAC,EAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAArzB,KACAC,EAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAArzB,KACAkH,GAAA,IAGAjH,EAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAArzB,KACAC,EAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAArzB,KACAkH,GAAA,OAGA,CACAlH,EAAA2B,EAAAoa,CACA,GACA/b,IAAAC,EAAAqN,UACA,EAAAtN,EAEA,IADAH,EAAAI,EAAAqN,IAAAtN,EACAkH,EAAArH,EAAA,CAEA,GADAqH,GAAArH,EACA8B,EAAA3B,EAAA,GAAAH,EAAA8B,EAAA3B,GACA,EAAAC,GAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAArzB,WACA,KAAAH,OAGAoU,GAAAhU,EAAAozB,OAAArzB,EAAAC,EAAAozB,OAAA1xB,EAAA9B,GACA8B,GAAA9B,EAAAG,GAAAH,EAAAA,EAAA,CAEAG,GAAA,GAMA,EAAAC,GAAAozB,OAAA1xB,KAAA1B,EAAAozB,OAAArzB,WACA,KAAAkH,EACA,OAEA,GAAA,IAAA,GAAArH,GAeA,MARAqb,GAAAokC,IAAA,wBAEAp4C,EAAAgU,EAAAo9I,SAAAv4J,EAAAmH,EAAAA,EAAA+Q,GAAA,EAAAA,GAAA,EAAA/Q,EAAAnH,GAAAmH,EAAA9F,GAAA8F,EAAA+Q,GAAA/Q,GAAA,EAEAjH,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EAEA43J,CAdAz5J,IAAAw+J,EAAAI,EAAA,GACA5+J,GAAAyB,EAAAg5J,EAAA16J,GACA6+J,EAAA,GAAAH,EAAAz+J,GACAD,EAAAy+J,EAAAI,GAeA,MAGA,GAAA,IAAA,GAAA7+J,GAaA,MAAA,KAAA,GAAAA,IAEAqH,EAAAgU,EAAAo9I,SAAAv4J,EAAAmH,EAAAA,EAAA+Q,GAAA,EAAAA,GAAA,EAAA/Q,EAAAnH,GAAAmH,EAAA9F,GAAA8F,EAAA+Q,GAAA/Q,GAAA,EAEAjH,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EAEAk3J,IAGA39I,EAAAokC,IAAA,8BAEAp4C,EAAAgU,EAAAo9I,SAAAv4J,EAAAmH,EAAAA,EAAA+Q,GAAA,EAAAA,GAAA,EAAA/Q,EAAAnH,GAAAmH,EAAA9F,GAAA8F,EAAA+Q,GAAA/Q,GAAA,EAEAjH,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EAEA43J,EA5BA,IAHAz5J,GAAAw+J,EAAAI,EAAA,GACA5+J,GAAAyB,EAAAg5J,EAAA16J,GACA6+J,EAAA,GAAAH,EAAAz+J,GACA,IAAAD,EAAAy+J,EAAAI,IAAA,CAEAn9J,IAAA+8J,EAAAI,EAAA,GAAAzmJ,GAAAqmJ,EAAAI,EAAA,GAEAz+J,EAAAozB,OAAA1xB,KAAA28J,EAAAI,EAAA,GACA/uJ,GACA,YAtHApO,KAAA+8J,EAAAI,EAAA,GAAAzmJ,GAAAqmJ,EAAAI,EAAA,GAEAz+J,EAAAozB,OAAA1xB,KAAA28J,EAAAI,EAAA,GACA/uJ,UA8IAA,GAAA,KAAA5P,GAAA,GASA,OANAmH,GAAAgU,EAAAo9I,SAAAv4J,EAAAmH,EAAAA,EAAA+Q,GAAA,EAAAA,GAAA,EAAA/Q,EAAAnH,GAAAmH,EAAA9F,GAAA8F,EAAA+Q,GAAA/Q,GAAA,EAEAjH,EAAAi3J,KAAA31J,EAAAtB,EAAAg3J,KAAAh/I,EACAiD,EAAAo9I,SAAAv4J,EAAAmb,EAAA0gJ,UAAAx6J,EAAA8Z,EAAAm9I,cAAAn9I,EAAAm9I,cAAAj3J,EACAnB,EAAAkpH,MAAAxnH,EAEAi2J,GAUAP,EAAA7wJ,UAAAm4J,WAAA,SAAAp9J,EAAAq9J,EAAA7+J,EAAAE,EAAA8b,EAAAlc,EAAAC,EAAA6P,EAAAkvJ,EAAAC,EAAAl9J,GAQA,GAAAxB,GACAG,EACAmoB,EACA6kB,EACAjtC,EACAsD,EACAqU,EACAvX,EACAq+J,EACA39J,EACAO,EACAuzD,EACA8pG,EACA1mH,EACAp9B,CAIA9Z,GAAA,EAAAd,EAAAP,CACA,GACA8G,MAAAK,EAAA3F,EAAAq9J,EAAAx9J,MAAAA,IAAAd,UACA,GAAAA,EAEA,IAAAuG,KAAAK,EAAA,IAAAnH,EAGA,MAFAD,GAAA,GAAA,GACA6P,EAAA,GAAA,EACAioJ,CAKA,KADAl3J,EAAAiP,EAAA,GACA/L,EAAA,EAAAq1J,GAAAr1J,GACA,GAAAiD,KAAAK,EAAAtD,GADAA,KAMA,IAJAqU,EAAArU,EACAA,EAAAlD,IACAA,EAAAkD,GAEAtD,EAAA24J,EAAA,GAAA34J,GACA,GAAAuG,KAAAK,EAAA5G,GADAA,KAUA,IAPAooB,EAAApoB,EACAI,EAAAJ,IACAI,EAAAJ,GAEAqP,EAAA,GAAAjP,EAGA43C,EAAA,GAAA10C,EAAAtD,EAAAsD,EAAAA,IAAA00C,IAAA,EACA,IAAAA,GAAAzxC,KAAAK,EAAAtD,IAAA,EACA,MAAA21J,EAGA,KAAAjhH,GAAAzxC,KAAAK,EAAA5G,IAAA,EACA,MAAAi5J,EAOA,KALA1yJ,KAAAK,EAAA5G,IAAAg4C,EAGAzxC,KAAAsH,EAAA,GAAAvK,EAAA,EACAxC,EAAA,EAAA49J,EAAA,EACA,KAAA1+J,GACAuG,KAAAsH,EAAA6wJ,GAAAp7J,GAAAiD,KAAAK,EAAA9F,GACA49J,IACA59J,GAIAd,GAAA,EAAAc,EAAA,CACA,GACA,KAAAwC,EAAArC,EAAAq9J,EAAAx9J,MACAyF,KAAAjF,EAAAiF,KAAAsH,EAAAvK,MAAAtD,GAEAc,YAEAd,EAAAP,EAaA,KAZAA,EAAA8G,KAAAsH,EAAAua,GAGA7hB,KAAAsH,EAAA,GAAA7N,EAAA,EACAc,EAAA,EACAmsC,EAAA,GACA2nB,GAAAx0D,EACAmG,KAAA1G,EAAA,GAAA,EACAwB,EAAA,EACAuZ,EAAA,EAGAwN,GAAAzQ,EAAAA,IAEA,IADA7X,EAAAyG,KAAAK,EAAA+Q,GACA,GAAA7X,KAAA,CAGA,KAAA6X,EAAAi9C,EAAAx0D,GAAA,CAMA,GALA6sC,IACA2nB,GAAAx0D,EAEAwa,EAAAwN,EAAAwsC,EACAh6C,EAAAA,EAAAxa,EAAAA,EAAAwa,GACA3a,EAAA,IAAAqD,EAAAqU,EAAAi9C,IAAA90D,EAAA,IAEAG,GAAAH,EAAA,EACA4+J,EAAA/mJ,EACAiD,EAAAtX,GACA,OAAAA,EAAAsX,MACA3a,IAAA,IAAAsG,KAAAK,IAAA83J,KAEAz+J,GAAAsG,KAAAK,EAAA83J,EAOA,IAHA9jJ,EAAA,GAAAtX,EAGAiD,KAAAi4J,GAAA,GAAA5jJ,EAAAy7I,EACA,MAAA4C,EAEA1yJ,MAAA1G,EAAAotC,GAAA5rC,EAAAkF,KAAAi4J,GAAA,GACAj4J,KAAAi4J,GAAA,IAAA5jJ,EAGA,GAAAqyB,GACA1mC,KAAAsH,EAAAo/B,GAAAjtC,EACAuG,KAAA7G,EAAA,GAAA4D,EACAiD,KAAA7G,EAAA,GAAAU,EACAkD,EAAAtD,IAAA40D,EAAAx0D,EACAmG,KAAA7G,EAAA,GAAA2B,EAAAkF,KAAA1G,EAAAotC,EAAA,GAAA3pC,EACAqQ,EAAApN,KAAA7G,EAAA,EAAA6+J,EAAA,GAAAh4J,KAAA1G,EAAAotC,EAAA,GAAA3pC,GAAA,IAGA9D,EAAA,GAAA6B,EAoBA,IAfAkF,KAAA7G,EAAA,GAAAiY,EAAAi9C,EACA9zD,GAAArB,EACA8G,KAAA7G,EAAA,GAAA,IAEA4B,EAAAR,GAAAnB,GACA4G,KAAA7G,EAAA,GAAA6G,KAAAjF,EAAAR,GAAA,IAAA,EAAA,GACAyF,KAAA7G,EAAA,GAAA6G,KAAAjF,EAAAR,OAGAyF,KAAA7G,EAAA,GAAAH,EAAAgH,KAAAjF,EAAAR,GAAAnB,GAAA,GAAA,GACA4G,KAAA7G,EAAA,GAAA+b,EAAAlV,KAAAjF,EAAAR,KAAAnB,IAIAM,EAAA,GAAA0X,EAAAi9C,EACAtxD,EAAAtD,IAAA40D,EAAAh6C,EAAAtX,EAAAA,GAAArD,EACA0T,EAAApN,KAAA7G,EAAA,EAAA6+J,EAAA,GAAAl9J,EAAAiC,GAAA,EAIA,KAAAA,EAAA,GAAAqU,EAAA,EAAA,IAAA3X,EAAAsD,GAAAA,KAAA,EACAtD,GAAAsD,CAMA,KAJAtD,GAAAsD,EAGAm7J,GAAA,GAAA7pG,GAAA,GACA50D,EAAAy+J,IAAAl4J,KAAAsH,EAAAo/B,IACAA,IACA2nB,GAAAx0D,EACAq+J,GAAA,GAAA7pG,GAAA,EAKA,MAAA,IAAA5c,GAAA,GAAA5vB,EAAAowI,EAAAlB,GAGAP,EAAA7wJ,UAAAo2J,mBAAA,SAAA11J,EAAA0gG,EAAA5jB,EAAA66E,EAAA3jJ,GACA,GAAAxW,EAYA,OAXAmC,MAAAo4J,aAAA,IACAp4J,KAAAi4J,GAAA,GAAA,EACAp6J,EAAAmC,KAAA83J,WAAAz3J,EAAA,EAAA,GAAA,GAAA,KAAA,KAAA88E,EAAA4jB,EAAAi3D,EAAAh4J,KAAAi4J,GAAAj4J,KAAAjF,GAEA8C,GAAA60J,EACAr+I,EAAAokC,IAAA,2CAEA56C,GAAAo0J,GAAA,GAAAlxD,EAAA,MACA1sF,EAAAokC,IAAA,sCACA56C,EAAA60J,GAEA70J,GAGA2yJ,EAAA7wJ,UAAAq2J,sBAAA,SAAA/yJ,EAAAo1J,EAAAh4J,EAAAka,EAAA+9E,EAAA/vF,EAAAmoJ,EAAAsH,EAAA3jJ,GACA,GAAAxW,EAMA,OAHAmC,MAAAo4J,aAAA,KACAp4J,KAAAi4J,GAAA,GAAA,EACAp6J,EAAAmC,KAAA83J,WAAAz3J,EAAA,EAAA4C,EAAA,IAAAmxJ,GAAAC,GAAA9rJ,EAAAgS,EAAAy9I,EAAAh4J,KAAAi4J,GAAAj4J,KAAAjF,GACA8C,GAAAkzJ,GAAA,GAAAx2I,EAAA,IACA1c,GAAA60J,EACAr+I,EAAAokC,IAAA,qCAEA56C,GAAA80J,IACAt+I,EAAAokC,IAAA,iCACA56C,EAAA60J,GAEA70J,IAIAmC,KAAAo4J,aAAA,KACAv6J,EAAAmC,KAAA83J,WAAAz3J,EAAA4C,EAAAo1J,EAAA,EAAA/D,GAAAC,GAAA7D,EAAAp4D,EAAA0/D,EAAAh4J,KAAAi4J,GAAAj4J,KAAAjF,GAEA8C,GAAAkzJ,GAAA,GAAAz4D,EAAA,IAAAr1F,EAAA,KACApF,GAAA60J,EACAr+I,EAAAokC,IAAA,+BAEA56C,GAAAo0J,GACA59I,EAAAokC,IAAA,2BACA56C,EAAA60J,GAEA70J,GAAA80J,IACAt+I,EAAAokC,IAAA,mCACA56C,EAAA60J,GAEA70J,GAGAkzJ,IAoBAP,EAAA7wJ,UAAAy4J,aAAA,SAAAE,GACA,MAAAt4J,KAAAi4J,KACAj4J,KAAAi4J,GAAA,GAAA/sJ,YAAA,GACAlL,KAAAjF,EAAA,GAAAmQ,YAAAotJ,GACAt4J,KAAAK,EAAA,GAAA6K,YAAAknJ,EAAA,GACApyJ,KAAA7G,EAAA,GAAA+R,YAAA,GACAlL,KAAA1G,EAAA,GAAA4R,YAAAknJ,GACApyJ,KAAAsH,EAAA,GAAA4D,YAAAknJ,EAAA,IAEApyJ,KAAAjF,EAAAf,OAAAs+J,IACAt4J,KAAAjF,EAAA,GAAAmQ,YAAAotJ,GAEA,KAAA,GAAA7+J,GAAA,EAAA6+J,EAAA7+J,EAAAA,IAAAuG,KAAAjF,EAAAtB,GAAA,CACA,KAAA,GAAAA,GAAA,EAAA24J,EAAA,EAAA34J,EAAAA,IAAAuG,KAAAK,EAAA5G,GAAA,CACA,KAAA,GAAAA,GAAA,EAAA,EAAAA,EAAAA,IAAAuG,KAAA7G,EAAAM,GAAA,CAEA2T,GAAApN,KAAAK,EAAA,EAAAL,KAAA1G,EAAA,EAAA84J,GAEAhlJ,EAAApN,KAAAK,EAAA,EAAAL,KAAAsH,EAAA,EAAA8qJ,EAAA,GAGA,IAAAmG,IAAA,GAAAr8J,YAAA,GACAg1J,GAAA,kBAAAqH,IAAA9oC,QA+IA,oBAAA,KACAv1H,EAAAJ,SACAqT,cAAAD,EACAE,UAAAA,ShY+v6BMorJ,KAAK,SAASh/J,EAAQU,EAAOJ,GiYn2+BnC,QAAA2+J,KACA,KAAA,IAAA9+J,OAAA,mCAEA,QAAA++J,KACA,KAAA,IAAA/+J,OAAA,qCAsBA,QAAAg/J,GAAAC,GACA,GAAAC,IAAA5+I,WAEA,MAAAA,YAAA2+I,EAAA,EAGA,KAAAC,IAAAJ,IAAAI,IAAA5+I,WAEA,MADA4+I,GAAA5+I,WACAA,WAAA2+I,EAAA,EAEA,KAEA,MAAAC,GAAAD,EAAA,GACA,MAAA5/J,GACA,IAEA,MAAA6/J,GAAA9+J,KAAA,KAAA6+J,EAAA,GACA,MAAA5/J,GAEA,MAAA6/J,GAAA9+J,KAAAiG,KAAA44J,EAAA,KAMA,QAAAE,GAAA3D,GACA,GAAA4D,IAAA1+I,aAEA,MAAAA,cAAA86I,EAGA,KAAA4D,IAAAL,IAAAK,IAAA1+I,aAEA,MADA0+I,GAAA1+I,aACAA,aAAA86I,EAEA,KAEA,MAAA4D,GAAA5D,GACA,MAAAn8J,GACA,IAEA,MAAA+/J,GAAAh/J,KAAA,KAAAo7J,GACA,MAAAn8J,GAGA,MAAA+/J,GAAAh/J,KAAAiG,KAAAm1J,KAYA,QAAA6D,KACAC,GAAAC,IAGAD,GAAA,EACAC,EAAAl/J,OACAgoG,EAAAk3D,EAAAp2G,OAAAk/C,GAEAm3D,EAAA,GAEAn3D,EAAAhoG,QACAo/J,KAIA,QAAAA,KACA,IAAAH,EAAA,CAGA,GAAAp9J,GAAA88J,EAAAK,EACAC,IAAA,CAGA,KADA,GAAAj3H,GAAAggE,EAAAhoG,OACAgoC,GAAA,CAGA,IAFAk3H,EAAAl3D,EACAA,OACAm3D,EAAAn3H,GACAk3H,GACAA,EAAAC,GAAA97F,KAGA87F,GAAA,GACAn3H,EAAAggE,EAAAhoG,OAEAk/J,EAAA,KACAD,GAAA,EACAH,EAAAj9J,IAiBA,QAAAw9J,GAAAT,EAAAU,GACAt5J,KAAA44J,IAAAA,EACA54J,KAAAs5J,MAAAA,EAYA,QAAAC,MAhKA,GAOAV,GACAE,EARAx4C,EAAArmH,EAAAJ,YAgBA,WACA,IAEA++J,EADA,kBAAA5+I,YACAA,WAEAw+I,EAEA,MAAAz/J,GACA6/J,EAAAJ,EAEA,IAEAM,EADA,kBAAA1+I,cACAA,aAEAq+I,EAEA,MAAA1/J,GACA+/J,EAAAL,KAuDA,IAEAQ,GAFAl3D,KACAi3D,GAAA,EAEAE,EAAA,EAyCA54C,GAAAK,SAAA,SAAAg4C,GACA,GAAA7qD,GAAA,GAAAt4D,OAAAiP,UAAA1qD,OAAA,EACA,IAAA0qD,UAAA1qD,OAAA,EACA,IAAA,GAAAP,GAAA,EAAAA,EAAAirD,UAAA1qD,OAAAP,IACAs0G,EAAAt0G,EAAA,GAAAirD,UAAAjrD,EAGAuoG,GAAA9kG,KAAA,GAAAm8J,GAAAT,EAAA7qD,IACA,IAAA/L,EAAAhoG,QAAAi/J,GACAN,EAAAS,IASAC,EAAA15J,UAAA09D,IAAA,WACAr9D,KAAA44J,IAAA5lF,MAAA,KAAAhzE,KAAAs5J,QAEA/4C,EAAAzjG,MAAA,UACAyjG,EAAAtlG,SAAA,EACAslG,EAAAi5C,OACAj5C,EAAAk5C,QACAl5C,EAAAh1G,QAAA,GACAg1G,EAAAm5C,YAIAn5C,EAAAo5C,GAAAJ,EACAh5C,EAAAne,YAAAm3D,EACAh5C,EAAAq5C,KAAAL,EACAh5C,EAAAs5C,IAAAN,EACAh5C,EAAAhjB,eAAAg8D,EACAh5C,EAAAu5C,mBAAAP,EACAh5C,EAAAmjB,KAAA61B,EACAh5C,EAAAw5C,gBAAAR,EACAh5C,EAAAy5C,oBAAAT,EAEAh5C,EAAAntB,UAAA,SAAAt2F,GAAA,UAEAyjH,EAAA05C,QAAA,SAAAn9J,GACA,KAAA,IAAAnD,OAAA,qCAGA4mH,EAAA25C,IAAA,WAAA,MAAA,KACA35C,EAAA45C,MAAA,SAAA9mJ,GACA,KAAA,IAAA1Z,OAAA,mCAEA4mH,EAAA65C,MAAA,WAAA,MAAA,SjYi3+BMC,KAAK,SAAS7gK,EAAQU,EAAOJ,IkYni/BnC,WAEA,YA4BA,IAAAwgK,IAAAC,4BAAA,GAGAC,EAAA,SAAAthK,EAAA80G,GAEA,OAAA90G,GACA,IAAA,GACA,MAAA,YACA,MAAA80G,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,GACA,MAAAzsD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,GACA,MAAAw6D,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,GACA,MAAAu6D,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,GACA,MAAA1sD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,EAAAC,GACA,MAAA3sD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,GACA,MAAA5sD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,GACA,MAAA7sD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,GACA,MAAA9sD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,GACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,MAAA/sD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,KAAA,IACA,MAAA,UAAA+1G,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,MAAAhtD,GAAAh7B,MAAAhzE,KAAA0kD,WAEA,SACA,KAAA,IAAA/qD,OAAA,iFAIAshK,EAAA,SAAA9vD,GAGA,IAFA,GACAz6E,GADAo7C,OAEAp7C,EAAAy6E,EAAAz6E,QAAAC,MACAm7C,EAAA5uE,KAAAwzB,EAAAtsB,MAEA,OAAA0nE,IAGAovF,EAAA,WACA,MAAAzlH,OAAA91C,UAAAlE,MAAA1B,KAAA2qD,YAGAy2G,EAAA,SAAAC,GACA,MAAA,IAAAp9J,QAAAo9J,EAAAzjI,QAAAyjI,EAAA7yD,OAAA,IAAA,KAAA6yD,EAAAnjD,WAAA,IAAA,KAAAmjD,EAAAljD,UAAA,IAAA,KAAAkjD,EAAAhjD,OAAA,IAAA,KAAAgjD,EAAAjjD,QAAA,IAAA,MAGAkjD,EAAA,SAAA3hK,GACA,MAAA,YACA,OAAAA,EAAAs5E,MAAAhzE,KAAA0kD,aAeA42G,EAAA,SAAAC,EAAAC,GACAD,EAAAA,MACAC,EAAAA,KACA,IAAA91H,GACA+1H,EAAAF,EAAAvhK,OACA0hK,EAAAF,EAAAxhK,OACA6D,IAEA,KADA6nC,EAAA,EACA+1H,EAAA/1H,GACA7nC,EAAAA,EAAA7D,QAAAuhK,EAAA71H,GACAA,GAAA,CAGA,KADAA,EAAA,EACAg2H,EAAAh2H,GACA7nC,EAAAA,EAAA7D,QAAAwhK,EAAA91H,GACAA,GAAA,CAEA,OAAA7nC,IAGA89J,EAAA,SAAAC,EAAAt0J,EAAAwkE,GAGA,IAFA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAA,CACA,GAAAk2H,EAAAt0J,EAAAwkE,EAAApmC,IACA,OAAA,CAEAA,IAAA,EAEA,OAAA,GAGAm2H,EAAA,SAAA7tD,EAAAliC,GAIA,IAHA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACA6D,KACAmkC,EAAA0D,GACAsoE,EAAAliC,EAAApmC,MACA7nC,EAAAA,EAAA7D,QAAA8xE,EAAApmC,IAEAA,GAAA,CAEA,OAAA7nC,IAGAi+J,EAAA,SAAAx0J,GACA,OACAy0J,qBAAAz0J,EACA00J,wBAAA,IAKAC,EAAA,SAAAviK,GAEA,GAAAq3C,GAAAx0C,OAAA7C,GAAAq3C,MAAA,kBACA,OAAA,OAAAA,EAAA,GAAAA,EAAA,IAGAmrH,EAAA,SAAAC,EAAA1kJ,GACA,MAAAilC,QAAA/8C,UAAAg9C,eAAA5iD,KAAA0d,EAAA0kJ,IAGAC,EAAA,SAAA90J,GACA,MAAAA,IAGA+0J,EAAA,WACA,GAAAhgK,GAAAqgD,OAAA/8C,UAAAtD,QACA,OAAA,uBAAAA,EAAAtC,KAAA2qD,WAAA,SAAAp9C,GACA,MAAA,uBAAAjL,EAAAtC,KAAAuN,IACA,SAAAA,GACA,MAAA40J,GAAA,SAAA50J,OAgBAg1J,EAAA7mH,MAAAwa,SAAA,SAAA42C,GACA,MAAA,OAAAA,GAAAA,EAAA7sG,QAAA,GAAA,mBAAA0iD,OAAA/8C,UAAAtD,SAAAtC,KAAA8sG,IAGA01D,EAAA,SAAAj1J,GACA,MAAA,sBAAAo1C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,IAWAk1J,EAAArhG,OAAAijE,WAAA,SAAAllI,GACA,MAAAA,IAAA,IAAAA,GAGAujK,EAAA,SAAAn1J,GACA,MAAA,oBAAAo1C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,IAGAo1J,EAAA,SAAAp1J,GACA,MAAA,oBAAAo1C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,IAGAq1J,EAAA,SAAApjK,GACA,MAAA,OAAAA,GAAA,gBAAAA,IAAAA,EAAA,+BAAA,GAGAqjK,EAAA,SAAAt1J,GACA,MAAA,oBAAAo1C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,IAGAu1J,EAAA,SAAAv1J,GACA,MAAA,oBAAAo1C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,IAGAw1J,EAAA,SAAArlJ,GACA,MAAA,kBAAAA,GAAA,sBAGAslJ,EAAA,SAAA/uD,EAAAgvD,GAIA,IAHA,GAAAt3H,GAAA,EACA1D,EAAAg7H,EAAAhjK,OACA6D,EAAA43C,MAAAzT,GACAA,EAAA0D,GACA7nC,EAAA6nC,GAAAsoE,EAAAgvD,EAAAt3H,IACAA,GAAA,CAEA,OAAA7nC,IAIAo/J,EAAA,SAAAv6H,GACA,GAAA,MAAAA,EACA,KAAA,IAAAwtB,WAAA,6CAKA,KAHA,GAAAsrB,GAAA9+B,OAAAha,GACAgD,EAAA,EACA1rC,EAAA0qD,UAAA1qD,OACAA,EAAA0rC,GAAA,CACA,GAAA/N,GAAA+sB,UAAAhf,EACA,IAAA,MAAA/N,EACA,IAAA,GAAAulI,KAAAvlI,GACAukI,EAAAgB,EAAAvlI,KACA6jD,EAAA0hF,GAAAvlI,EAAAulI,GAIAx3H,IAAA,EAEA,MAAA81C,IAGA2hF,EAAA,SAAA71J,GACA,OAAAA,IAGA81J,EAAA,SAAA1jK,EAAAmoB,GACA,MAAA,YACA,MAAAA,GAAA9nB,KAAAiG,KAAAtG,EAAAs5E,MAAAhzE,KAAA0kD,cAIA24G,EAAA,SAAA3jK,EAAAmoB,GACA,MAAA,YACA,GAAA+4C,GAAA56D,IACA,OAAAtG,GAAAs5E,MAAApY,EAAAlW,WAAA5rC,KAAA,SAAAxR,GACA,MAAAua,GAAA9nB,KAAA6gE,EAAAtzD,OAMAg2J,EAAA,SAAAlkK,GACA,GAAAmkK,GAAAnkK,EAAA2E,QAAA,MAAA,QAAAA,QAAA,QAAA,OACAA,QAAA,MAAA,OAAAA,QAAA,MAAA,OAAAA,QAAA,MAAA,OAAAA,QAAA,MAAA,OAAAA,QAAA,MAAA,OAAAA,QAAA,MAAA,MACA,OAAA,IAAAw/J,EAAAx/J,QAAA,KAAA,OAAA,KAGAy/J,EAAA,SAAAl2J,GACA,MAAAA,IAAAA,EAAA,wBAAAA,GACAy0J,qBAAAz0J,EACA00J,wBAAA,IAqBAyB,EAAA,QAAAA,IAAA1vD,EAAAz2B,EAAAmzB,GACA,OAAA/lD,UAAA1qD,QACA,IAAA,GACA,MAAAyjK,IAAA1vD,EAAA,EAAAA,EAAA/zG,OACA,KAAA,GACA,MAAAyjK,IAAA1vD,EAAAz2B,EAAAy2B,EAAA/zG,OACA,SAIA,IAHA,GAAA8xE,MACApmC,EAAA,EACA1D,EAAAtkC,KAAAoC,IAAA,EAAApC,KAAAC,IAAAowG,EAAA/zG,OAAAywG,GAAAnzB,GACAt1C,EAAA0D,GACAomC,EAAApmC,GAAAqoE,EAAAz2B,EAAA5xC,GACAA,GAAA,CAEA,OAAAomC,KAOA4xF,EAAA,WACA,GAAAC,GAAA,SAAAzkK,GACA,OAAA,GAAAA,EAAA,IAAA,IAAAA,EAEA,OAAA,kBAAA+V,MAAAtP,UAAA40G,YAAA,SAAAr/F,GACA,MAAAA,GAAAq/F,eACA,SAAAr/F,GACA,MAAAA,GAAA0/F,iBAAA,IAAA+oD,EAAAzoJ,EAAA4/F,cAAA,GAAA,IAAA6oD,EAAAzoJ,EAAA6/F,cAAA,IAAA4oD,EAAAzoJ,EAAA8/F,eAAA,IAAA2oD,EAAAzoJ,EAAA+/F,iBAAA,IAAA0oD,EAAAzoJ,EAAAggG,iBAAA,KAAAhgG,EAAA2/F,qBAAA,KAAA99B,QAAA,GAAAt7E,MAAA,EAAA,GAAA,QAIAmiK,GACArgI,KAAA,WACA,MAAAv9B,MAAA69J,GAAA,wBAEAhgK,OAAA,SAAAA,GACA,MAAAmC,MAAA69J,GAAA,uBAAAhgK,KAIAigK,EAAA,WACA,QAAAC,GAAA/vD,GACAhuG,KAAAtG,EAAAs0G,EAWA,MATA+vD,GAAAp+J,UAAA,qBAAA,WACA,KAAA,IAAAhG,OAAA,kCAEAokK,EAAAp+J,UAAA,uBAAA,SAAAuvE,GACA,MAAAA,IAEA6uF,EAAAp+J,UAAA,qBAAA,SAAAuvE,EAAA5nE,GACA,MAAAtH,MAAAtG,EAAAw1E,EAAA5nE,IAEA,SAAA0mG,GACA,MAAA,IAAA+vD,GAAA/vD,OAIAgwD,EAAA,SAAA9kK,EAAA4yE,GAIA,IAHA,GAAApmC,GAAA,EACA0jG,EAAAt9D,EAAA9xE,QAAAd,EAAA,GACAg2E,EAAA,GAAAz5B,OAAA2zF,GAAA,EAAAA,EAAA,GACAA,EAAA1jG,GACAwpC,EAAAxpC,GAAA+3H,EAAA3xF,EAAApmC,EAAAA,EAAAxsC,GACAwsC,GAAA,CAEA,OAAAwpC,IAGA+uF,EAAA,kBAAAvhH,QAAA+kE,OAAA/kE,OAAA+kE,OAAAw7C,EAYAiB,EAAA,SAAAC,EAAAnwD,GACA,MAAA,YACA,GAAAh0G,GAAA0qD,UAAA1qD,MACA,IAAA,IAAAA,EACA,MAAAg0G,IAEA,IAAAv2F,GAAAitC,UAAA1qD,EAAA,EACA,OAAAsiK,GAAA7kJ,IAAA,kBAAAA,GAAA0mJ,GAAAnwD,EAAAh7B,MAAAhzE,KAAA0kD,WAAAjtC,EAAA0mJ,GAAAnrF,MAAAv7D,EAAAgmJ,EAAA/4G,UAAA,EAAA1qD,EAAA,MAYAokK,EAAA,SAAApwD,GACA,MAAA,SAAAlhC,GAAAvzE,GACA,MAAA,KAAAmrD,UAAA1qD,QAAA2iK,EAAApjK,GACAuzE,EAEAkhC,EAAAh7B,MAAAhzE,KAAA0kD,aAaA25G,EAAA,SAAArwD,GACA,MAAA,SAAAjhC,GAAAxzE,EAAAmB,GACA,OAAAgqD,UAAA1qD,QACA,IAAA,GACA,MAAA+yE,EACA,KAAA,GACA,MAAA4vF,GAAApjK,GAAAwzE,EAAAqxF,EAAA,SAAAhrC,GACA,MAAAplB,GAAAz0G,EAAA65H,IAEA,SACA,MAAAupC,GAAApjK,IAAAojK,EAAAjiK,GAAAqyE,EAAA4vF,EAAApjK,GAAA6kK,EAAA,SAAAv6B,GACA,MAAA71B,GAAA61B,EAAAnpI,KACAiiK,EAAAjiK,GAAA0jK,EAAA,SAAAhrC,GACA,MAAAplB,GAAAz0G,EAAA65H,KACAplB,EAAAz0G,EAAAmB,MAaA4jK,EAAA,SAAAtwD,GACA,MAAA,SAAAuwD,GAAAhlK,EAAAmB,EAAA2F,GACA,OAAAqkD,UAAA1qD,QACA,IAAA,GACA,MAAAukK,EACA,KAAA,GACA,MAAA5B,GAAApjK,GAAAglK,EAAAF,EAAA,SAAAjrC,EAAA4P,GACA,MAAAh1B,GAAAz0G,EAAA65H,EAAA4P,IAEA,KAAA,GACA,MAAA25B,GAAApjK,IAAAojK,EAAAjiK,GAAA6jK,EAAA5B,EAAApjK,GAAA8kK,EAAA,SAAAx6B,EAAAb,GACA,MAAAh1B,GAAA61B,EAAAnpI,EAAAsoI,KACA25B,EAAAjiK,GAAA2jK,EAAA,SAAAjrC,EAAA4P,GACA,MAAAh1B,GAAAz0G,EAAA65H,EAAA4P,KACAo7B,EAAA,SAAAp7B,GACA,MAAAh1B,GAAAz0G,EAAAmB,EAAAsoI,IAEA,SACA,MAAA25B,GAAApjK,IAAAojK,EAAAjiK,IAAAiiK,EAAAt8J,GAAAk+J,EAAA5B,EAAApjK,IAAAojK,EAAAjiK,GAAA2jK,EAAA,SAAAx6B,EAAAzQ,GACA,MAAAplB,GAAA61B,EAAAzQ,EAAA/yH,KACAs8J,EAAApjK,IAAAojK,EAAAt8J,GAAAg+J,EAAA,SAAAx6B,EAAAb,GACA,MAAAh1B,GAAA61B,EAAAnpI,EAAAsoI,KACA25B,EAAAjiK,IAAAiiK,EAAAt8J,GAAAg+J,EAAA,SAAAjrC,EAAA4P,GACA,MAAAh1B,GAAAz0G,EAAA65H,EAAA4P,KACA25B,EAAApjK,GAAA6kK,EAAA,SAAAv6B,GACA,MAAA71B,GAAA61B,EAAAnpI,EAAA2F,KACAs8J,EAAAjiK,GAAA0jK,EAAA,SAAAhrC,GACA,MAAAplB,GAAAz0G,EAAA65H,EAAA/yH,KACAs8J,EAAAt8J,GAAA+9J,EAAA,SAAAp7B,GACA,MAAAh1B,GAAAz0G,EAAAmB,EAAAsoI,KACAh1B,EAAAz0G,EAAAmB,EAAA2F,MAeAm+J,EAAA,QAAAA,IAAAxkK,EAAAykK,EAAAzwD,GACA,MAAA,YAKA,IAJA,GAAA0wD,MACAC,EAAA,EACAhjI,EAAA3hC,EACA4kK,EAAA,EACAA,EAAAH,EAAAzkK,QAAA2kK,EAAAj6G,UAAA1qD,QAAA,CACA,GAAA6D,EACA+gK,GAAAH,EAAAzkK,UAAA2iK,EAAA8B,EAAAG,KAAAD,GAAAj6G,UAAA1qD,QACA6D,EAAA4gK,EAAAG,IAEA/gK,EAAA6mD,UAAAi6G,GACAA,GAAA,GAEAD,EAAAE,GAAA/gK,EACA8+J,EAAA9+J,KACA89B,GAAA,GAEAijI,GAAA,EAEA,MAAA,IAAAjjI,EAAAqyE,EAAAh7B,MAAAhzE,KAAA0+J,GAAAlE,EAAA7+H,EAAA6iI,GAAAxkK,EAAA0kK,EAAA1wD,MAkBA6wD,EAAA,SAAAV,EAAAN,EAAA7vD,GACA,MAAA,YACA,GAAAh0G,GAAA0qD,UAAA1qD,MACA,IAAA,IAAAA,EACA,MAAAg0G,IAEA,IAAAv2F,GAAAitC,UAAA1qD,EAAA,EACA,KAAAsiK,EAAA7kJ,GAAA,CACA,GAAAs2F,GAAA0vD,EAAA/4G,UAAA,EAAA1qD,EAAA,EACA,IAAA,kBAAAyd,GAAA0mJ,GACA,MAAA1mJ,GAAA0mJ,GAAAnrF,MAAAv7D,EAAAs2F,EAEA,IAAA+uD,EAAArlJ,GAAA,CACA,GAAAqnJ,GAAAjB,EAAA7qF,MAAA,KAAA+6B,EACA,OAAA+wD,GAAArnJ,IAGA,MAAAu2F,GAAAh7B,MAAAhzE,KAAA0kD,aAIAq6G,EAAA,SAAAnD,EAAA9vF,GAEA,IADA,GAAApmC,GAAAomC,EAAA9xE,OAAA,EACA0rC,GAAA,GAAAk2H,EAAA9vF,EAAApmC,KACAA,GAAA,CAEA,OAAA+3H,GAAA3xF,EAAA,EAAApmC,EAAA,IAGAs5H,EAAA,WACA,QAAAC,GAAAvlK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EACAsG,KAAA8yB,KAAA,EAgBA,MAdAmsI,GAAAt/J,UAAA,qBAAAi+J,EAAArgI,KACA0hI,EAAAt/J,UAAA,uBAAA,SAAA9B,GAIA,MAHAmC,MAAA8yB,MACAj1B,EAAAmC,KAAA69J,GAAA,qBAAAhgK,GAAA,IAEAmC,KAAA69J,GAAA,uBAAAhgK,IAEAohK,EAAAt/J,UAAA,qBAAA,SAAA9B,EAAAw9E,GAKA,MAJAr7E,MAAAtG,EAAA2hF,KACAr7E,KAAA8yB,KAAA,EACAj1B,EAAA2/J,EAAAx9J,KAAA69J,GAAA,qBAAAhgK,GAAA,KAEAA,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAoB,GAAAvlK,EAAAmkK,QAIAqB,EAAA,WACA,QAAAC,GAAAzlK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EACAsG,KAAAo/J,KAAA,EAgBA,MAdAD,GAAAx/J,UAAA,qBAAAi+J,EAAArgI,KACA4hI,EAAAx/J,UAAA,uBAAA,SAAA9B,GAIA,MAHAmC,MAAAo/J,MACAvhK,EAAAmC,KAAA69J,GAAA,qBAAAhgK,GAAA,IAEAmC,KAAA69J,GAAA,uBAAAhgK,IAEAshK,EAAAx/J,UAAA,qBAAA,SAAA9B,EAAAw9E,GAKA,MAJAr7E,MAAAtG,EAAA2hF,KACAr7E,KAAAo/J,KAAA,EACAvhK,EAAA2/J,EAAAx9J,KAAA69J,GAAA,qBAAAhgK,GAAA,KAEAA,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAsB,GAAAzlK,EAAAmkK,QAIAwB,EAAA,WACA,QAAAC,GAAApmK,EAAA2kK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAA8C,IAAA,EACA9C,KAAAu/J,MAAA,EACAv/J,KAAAkvE,IAAA,GAAAz5B,OAAAv8C,GAsBA,MApBAomK,GAAA3/J,UAAA,qBAAAi+J,EAAArgI,KACA+hI,EAAA3/J,UAAA,uBAAA,SAAA9B,GAEA,MADAmC,MAAAkvE,IAAA,KACAlvE,KAAA69J,GAAA,uBAAAhgK,IAEAyhK,EAAA3/J,UAAA,qBAAA,SAAA9B,EAAAw9E,GAEA,MADAr7E,MAAAwsE,MAAA6O,GACAr7E,KAAAu/J,KAAAv/J,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAAw/J,WAAA3hK,GAEAyhK,EAAA3/J,UAAA6sE,MAAA,SAAA6O,GACAr7E,KAAAkvE,IAAAlvE,KAAA8C,KAAAu4E,EACAr7E,KAAA8C,KAAA,EACA9C,KAAA8C,MAAA9C,KAAAkvE,IAAAl1E,SACAgG,KAAA8C,IAAA,EACA9C,KAAAu/J,MAAA,IAGAD,EAAA3/J,UAAA6/J,QAAA,WACA,MAAAlE,GAAAmC,EAAAz9J,KAAAkvE,IAAAlvE,KAAA8C,KAAA26J,EAAAz9J,KAAAkvE,IAAA,EAAAlvE,KAAA8C,OAEAu7J,EAAA,SAAAnlK,EAAA2kK,GACA,MAAA,IAAAyB,GAAApmK,EAAA2kK,QAIA4B,EAAA,WACA,QAAAC,GAAAxmK,EAAA2kK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAA9G,EAAAA,EAWA,MATAwmK,GAAA//J,UAAA,qBAAAi+J,EAAArgI,KACAmiI,EAAA//J,UAAA,uBAAAi+J,EAAA//J,OACA6hK,EAAA//J,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,MAAAr7E,MAAA9G,EAAA,GACA8G,KAAA9G,GAAA,EACA2E,GAEAmC,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,IAEAgjF,EAAA,SAAAnlK,EAAA2kK,GACA,MAAA,IAAA6B,GAAAxmK,EAAA2kK,QAIA8B,EAAA,WACA,QAAAC,GAAA1mK,EAAA2kK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAA8C,IAAA,EACA9C,KAAAu/J,MAAA,EACAv/J,KAAAkvE,IAAA,GAAAz5B,OAAAv8C,GAsBA,MApBA0mK,GAAAjgK,UAAA,qBAAAi+J,EAAArgI,KACAqiI,EAAAjgK,UAAA,uBAAA,SAAA9B,GAEA,MADAmC,MAAAkvE,IAAA,KACAlvE,KAAA69J,GAAA,uBAAAhgK,IAEA+hK,EAAAjgK,UAAA,qBAAA,SAAA9B,EAAAw9E,GAKA,MAJAr7E,MAAAu/J,OACA1hK,EAAAmC,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAAkvE,IAAAlvE,KAAA8C,OAEA9C,KAAAwsE,MAAA6O,GACAx9E,GAEA+hK,EAAAjgK,UAAA6sE,MAAA,SAAA6O,GACAr7E,KAAAkvE,IAAAlvE,KAAA8C,KAAAu4E,EACAr7E,KAAA8C,KAAA,EACA9C,KAAA8C,MAAA9C,KAAAkvE,IAAAl1E,SACAgG,KAAA8C,IAAA,EACA9C,KAAAu/J,MAAA,IAGAlB,EAAA,SAAAnlK,EAAA2kK,GACA,MAAA,IAAA+B,GAAA1mK,EAAA2kK,QAIAgC,EAAA,WACA,QAAAC,GAAAlE,EAAAiC,GACA79J,KAAA69J,GAAAA,EACA79J,KAAA47J,KAAAA,EACA57J,KAAA+/J,UAAA59J,OACAnC,KAAAggK,gBAAA,EAkBA,MAhBAF,GAAAngK,UAAA,qBAAA,WACA,MAAAK,MAAA69J,GAAA,wBAEAiC,EAAAngK,UAAA,uBAAA,SAAA9B,GACA,MAAAmC,MAAA69J,GAAA,uBAAAhgK,IAEAiiK,EAAAngK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,GAAA4kF,IAAA,CAOA,OANAjgK,MAAAggK,eAEAhgK,KAAA47J,KAAA57J,KAAA+/J,UAAA1kF,KACA4kF,GAAA,GAFAjgK,KAAAggK,gBAAA,EAIAhgK,KAAA+/J,UAAA1kF,EACA4kF,EAAApiK,EAAAmC,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,IAEAgjF,EAAA,SAAAzC,EAAAiC,GACA,MAAA,IAAAiC,GAAAlE,EAAAiC,QAIAqC,EAAA,WACA,QAAAC,GAAAzmK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EAaA,MAXAymK,GAAAxgK,UAAA,qBAAAi+J,EAAArgI,KACA4iI,EAAAxgK,UAAA,uBAAAi+J,EAAA//J,OACAsiK,EAAAxgK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,GAAAr7E,KAAAtG,EAAA,CACA,GAAAsG,KAAAtG,EAAA2hF,GACA,MAAAx9E,EAEAmC,MAAAtG,EAAA,KAEA,MAAAsG,MAAA69J,GAAA,qBAAAhgK,EAAAw9E,IAEAgjF,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAsC,GAAAzmK,EAAAmkK,QAIAuC,EAAA,WACA,QAAAC,GAAA3mK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EAOA,MALA2mK,GAAA1gK,UAAA,qBAAAi+J,EAAArgI,KACA8iI,EAAA1gK,UAAA,uBAAAi+J,EAAA//J,OACAwiK,EAAA1gK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,MAAAr7E,MAAAtG,EAAA2hF,GAAAr7E,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,GAAAx9E,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAwC,GAAA3mK,EAAAmkK,QAIAyC,EAAA,WACA,QAAAC,GAAA7mK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EACAsG,KAAA+3E,OAAA,EAgBA,MAdAwoF,GAAA5gK,UAAA,qBAAAi+J,EAAArgI,KACAgjI,EAAA5gK,UAAA,uBAAA,SAAA9B,GAIA,MAHAmC,MAAA+3E,QACAl6E,EAAAmC,KAAA69J,GAAA,qBAAAhgK,EAAA,SAEAmC,KAAA69J,GAAA,uBAAAhgK,IAEA0iK,EAAA5gK,UAAA,qBAAA,SAAA9B,EAAAw9E,GAKA,MAJAr7E,MAAAtG,EAAA2hF,KACAr7E,KAAA+3E,OAAA,EACAl6E,EAAA2/J,EAAAx9J,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,KAEAx9E,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAA0C,GAAA7mK,EAAAmkK,QAIA2C,GAAA,WACA,QAAAC,GAAA/mK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EACAsG,KAAA0lC,IAAA,GACA1lC,KAAA+3E,OAAA,EAiBA,MAfA0oF,GAAA9gK,UAAA,qBAAAi+J,EAAArgI,KACAkjI,EAAA9gK,UAAA,uBAAA,SAAA9B,GAIA,MAHAmC,MAAA+3E,QACAl6E,EAAAmC,KAAA69J,GAAA,qBAAAhgK,EAAA,KAEAmC,KAAA69J,GAAA,uBAAAhgK,IAEA4iK,EAAA9gK,UAAA,qBAAA,SAAA9B,EAAAw9E,GAMA,MALAr7E,MAAA0lC,KAAA,EACA1lC,KAAAtG,EAAA2hF,KACAr7E,KAAA+3E,OAAA,EACAl6E,EAAA2/J,EAAAx9J,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAA0lC,OAEA7nC,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAA4C,GAAA/mK,EAAAmkK,QAIA6C,GAAA,WACA,QAAAC,GAAAjnK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EAYA,MAVAinK,GAAAhhK,UAAA,qBAAAi+J,EAAArgI,KACAojI,EAAAhhK,UAAA,uBAAA,SAAA9B,GACA,MAAAmC,MAAA69J,GAAA,uBAAA79J,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAAmjE,QAEAw9F,EAAAhhK,UAAA,qBAAA,SAAA9B,EAAAw9E,GAIA,MAHAr7E,MAAAtG,EAAA2hF,KACAr7E,KAAAmjE,KAAAkY,GAEAx9E,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAA8C,GAAAjnK,EAAAmkK,QAIA+C,GAAA,WACA,QAAAC,GAAAnnK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EACAsG,KAAA0lC,IAAA,GACA1lC,KAAA8gK,QAAA,GAaA,MAXAD,GAAAlhK,UAAA,qBAAAi+J,EAAArgI,KACAsjI,EAAAlhK,UAAA,uBAAA,SAAA9B,GACA,MAAAmC,MAAA69J,GAAA,uBAAA79J,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAA8gK,WAEAD,EAAAlhK,UAAA,qBAAA,SAAA9B,EAAAw9E,GAKA,MAJAr7E,MAAA0lC,KAAA,EACA1lC,KAAAtG,EAAA2hF,KACAr7E,KAAA8gK,QAAA9gK,KAAA0lC,KAEA7nC,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAgD,GAAAnnK,EAAAmkK,QAIAkD,GAAA,WACA,QAAAC,GAAAtnK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EAOA,MALAsnK,GAAArhK,UAAA,qBAAAi+J,EAAArgI,KACAyjI,EAAArhK,UAAA,uBAAAi+J,EAAA//J,OACAmjK,EAAArhK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,MAAAr7E,MAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAAtG,EAAA2hF,KAEAgjF,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAmD,GAAAtnK,EAAAmkK,QAIAoD,GAAA,WACA,QAAAC,GAAAhoK,EAAA2kK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAA9G,EAAAA,EAYA,MAVAgoK,GAAAvhK,UAAA,qBAAAi+J,EAAArgI,KACA2jI,EAAAvhK,UAAA,uBAAAi+J,EAAA//J,OACAqjK,EAAAvhK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,MAAA,KAAAr7E,KAAA9G,EACAskK,EAAA3/J,IAEAmC,KAAA9G,GAAA,EACA8G,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,KAGAgjF,EAAA,SAAAnlK,EAAA2kK,GACA,MAAA,IAAAqD,GAAAhoK,EAAA2kK,QAIAsD,GAAA,WACA,QAAAC,GAAA1nK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EAOA,MALA0nK,GAAAzhK,UAAA,qBAAAi+J,EAAArgI,KACA6jI,EAAAzhK,UAAA,uBAAAi+J,EAAA//J,OACAujK,EAAAzhK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,MAAAr7E,MAAAtG,EAAA2hF,GAAAr7E,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,GAAAmiF,EAAA3/J,IAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAuD,GAAA1nK,EAAAmkK,QAqBAlhJ,GAAA0hJ,EAAA,SAAA9kK,EAAAmB,GACA,MAAAygE,QAAA5hE,GAAA4hE,OAAAzgE,KA0BA2mK,GAAA/C,EAAA,SAAAtwD,EAAAtoE,EAAAomC,GACA,GAAApmC,GAAAomC,EAAA9xE,QAAA0rC,GAAAomC,EAAA9xE,OACA,MAAA8xE,EAEA,IAAAvlE,GAAA,EAAAm/B,EAAAomC,EAAA9xE,OAAA,EACAsnK,EAAA/6J,EAAAm/B,EACAm/C,EAAAy2E,EAAAxvF,EAEA,OADA+Y,GAAAy8E,GAAAtzD,EAAAliC,EAAAw1F,IACAz8E,IA4BA/xD,GAAAurI,EAAAQ,EAAA,MAAAG,EAAA,SAAAhxD,EAAAliC,GAEA,IADA,GAAApmC,GAAA,EACAA,EAAAomC,EAAA9xE,QAAA,CACA,IAAAg0G,EAAAliC,EAAApmC,IACA,OAAA,CAEAA,IAAA,EAEA,OAAA,KAsBA67H,GAAAnD,EAAA,SAAAv3D,GACA,MAAA,YACA,MAAAA,MAuBA26D,GAAAnD,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,IAAAmB,IA4BA0kK,GAAAf,EAAAQ,EAAA,MAAAK,EAAA,SAAAlxD,EAAAliC,GAEA,IADA,GAAApmC,GAAA,EACAA,EAAAomC,EAAA9xE,QAAA,CACA,GAAAg0G,EAAAliC,EAAApmC,IACA,OAAA,CAEAA,IAAA,EAEA,OAAA,KA0BA+7H,GAAApD,EAAAQ,EAAA,WAAAQ,EAAArB,IAsBA0D,GAAArD,EAAA,SAAA3yD,EAAA5/B,GACA,MAAAwvF,GAAAxvF,GAAA4/B,MAsBA14B,GAAAqrF,EAAA,SAAArwD,EAAAD,GACA,MAAAC,GAAAh7B,MAAAhzE,KAAA+tG,KAuBA4zD,GAAArD,EAAA,SAAAnC,EAAAt1D,EAAApvF,GACA,GAAA5Z,KACA,KAAA,GAAAtD,KAAAkd,GACA5Z,EAAAtD,GAAAkd,EAAAld,EAGA,OADAsD,GAAAs+J,GAAAt1D,EACAhpG,IAuBA+jK,GAAAtD,EAAA,QAAAsD,IAAA/lJ,EAAAgrF,EAAApvF,GACA,OAAAoE,EAAA7hB,QACA,IAAA,GACA,MAAA6sG,EACA,KAAA,GACA,MAAA86D,IAAA9lJ,EAAA,GAAAgrF,EAAApvF,EACA,SACA,MAAAkqJ,IAAA9lJ,EAAA,GAAA+lJ,GAAAnE,EAAA5hJ,EAAA,GAAAgrF,EAAAnqD,OAAAjlC,EAAAoE,EAAA,MAAApE,MAoBAnV,GAAA+7J,EAAA,SAAArwD,EAAA6zD,GACA,MAAArH,GAAAxsD,EAAAh0G,OAAA,WACA,MAAAg0G,GAAAh7B,MAAA6uF,EAAAn9G,eAwBAuE,GAAAq1G,EAAA,SAAA3gK,EAAAmC,EAAAsE,GACA,GAAAzG,EAAAmC,EACA,KAAA,IAAAnG,OAAA,6DAEA,OAAAgE,GAAAyG,EAAAzG,EAAAyG,EAAAtE,EAAAA,EAAAsE,IAsBA09J,GAAA1D,EAAA,SAAAxC,GACA,MAAA,UAAAriK,EAAAmB,GACA,MAAAkhK,GAAAriK,EAAAmB,GAAA,GAAAkhK,EAAAlhK,EAAAnB,GAAA,EAAA,KA8CAwoK,GAAA1D,EAAA,SAAArkK,EAAAg0G,GACA,MAAA,KAAAh0G,EACAokK,EAAApwD,GAEAwsD,EAAAxgK,EAAAwkK,EAAAxkK,KAAAg0G,MAkBAg0D,GAAArlJ,GAAA,IAuBA0gC,GAAAghH,EAAA,SAAAnpJ,EAAAna,GACA,MAAA,OAAAA,GAAAA,IAAAA,EAAAma,EAAAna,IAyBAknK,GAAA3D,EAAA,SAAA1C,EAAA99B,EAAAokC,GAIA,IAHA,GAAAv2F,MACAjmC,EAAA,EACAy8H,EAAArkC,EAAA9jI,OACAmoK,EAAAz8H,GACAi2H,EAAAC,EAAA99B,EAAAp4F,GAAAw8H,IAAAvG,EAAAC,EAAA99B,EAAAp4F,GAAAimC,IACAA,EAAAzuE,KAAA4gI,EAAAp4F,IAEAA,GAAA,CAEA,OAAAimC,KAmBAy2F,GAAA/D,EAAA,SAAAlC,EAAA1kJ,GACA,GAAA5Z,KACA,KAAA,GAAAtD,KAAAkd,GACAld,IAAA4hK,IACAt+J,EAAAtD,GAAAkd,EAAAld,GAGA,OAAAsD,KAqBAwkK,GAAAhE,EAAA,QAAAgE,IAAAxmJ,EAAApE,GACA,OAAAoE,EAAA7hB,QACA,IAAA,GACA,MAAAyd,EACA,KAAA,GACA,MAAA2qJ,IAAAvmJ,EAAA,GAAApE,EACA,SACA,GAAAsE,GAAAF,EAAA,GACAymJ,EAAA7E,EAAA5hJ,EAAA,EACA,OAAA,OAAApE,EAAAsE,GAAAtE,EAAAkqJ,GAAA5lJ,EAAAsmJ,GAAAC,EAAA7qJ,EAAAsE,IAAAtE,MA0BA8nH,GAAA8+B,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,GAAAmB,IA4BA6nK,GAAAlE,EAAAQ,EAAA,YAAAqB,EAAA,SAAAtE,EAAA9vF,GAGA,IAFA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAAk2H,EAAA9vF,EAAApmC,KACAA,GAAA,CAEA,OAAA+3H,GAAA3xF,EAAApmC,MA0BAg9F,GAAA07B,EAAA,SAAA92J,GACA,MAAA,OAAAA,GAAA,kBAAAA,GAAAo7H,MAAAp7H,EAAAo7H,QAAA,MAAAp7H,GAAA,MAAAA,EAAAoQ,aAAA,kBAAApQ,GAAAoQ,YAAAgrH,MAAAp7H,EAAAoQ,YAAAgrH,QAAA45B,EAAAh1J,MAAAu1J,EAAAv1J,GAAA,GAAAo1J,EAAAp1J,MAAA+0J,EAAA/0J,GAAA,WACA,MAAAo9C,cAEA,SA8BA89G,GAAAnE,EAAA,QAAAmE,IAAAC,EAAA1yH,GACA,GACA2yH,GAAAt0J,EAAA9J,EADAzG,IAEA,KAAAuQ,IAAA2hC,GACA2yH,EAAAD,EAAAr0J,GACA9J,QAAAo+J,GACA7kK,EAAAuQ,GAAA,aAAA9J,EAAAo+J,EAAA3yH,EAAA3hC,IAAA,WAAA9J,EAAAk+J,GAAAC,EAAAr0J,GAAA2hC,EAAA3hC,IAAA2hC,EAAA3hC,EAEA,OAAAvQ,KA2BAwmD,GAAAg6G,EAAAQ,EAAA,OAAAyB,EAAA,SAAAtyD,EAAAliC,GAGA,IAFA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAA,CACA,GAAAsoE,EAAAliC,EAAApmC,IACA,MAAAomC,GAAApmC,EAEAA,IAAA,MA4BAypF,GAAAkvC,EAAAQ,EAAA,YAAA2B,GAAA,SAAAxyD,EAAAliC,GAGA,IAFA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAA,CACA,GAAAsoE,EAAAliC,EAAApmC,IACA,MAAAA,EAEAA,IAAA,EAEA,MAAA,MA2BAi9H,GAAAtE,EAAAQ,EAAA,WAAA6B,GAAA,SAAA1yD,EAAAliC,GAEA,IADA,GAAApmC,GAAAomC,EAAA9xE,OAAA,EACA0rC,GAAA,GAAA,CACA,GAAAsoE,EAAAliC,EAAApmC,IACA,MAAAomC,GAAApmC,EAEAA,IAAA,MA4BAk9H,GAAAvE,EAAAQ,EAAA,gBAAA+B,GAAA,SAAA5yD,EAAAliC,GAEA,IADA,GAAApmC,GAAAomC,EAAA9xE,OAAA,EACA0rC,GAAA,GAAA,CACA,GAAAsoE,EAAAliC,EAAApmC,IACA,MAAAA,EAEAA,IAAA,EAEA,MAAA,MAoCA9pB,GAAAyiJ,EAAAH,EAAA,UAAA,SAAAlwD,EAAAliC,GAGA,IAFA,GAAA9pC,GAAA8pC,EAAA9xE,OACA0rC,EAAA,EACA1D,EAAA0D,GACAsoE,EAAAliC,EAAApmC,IACAA,GAAA,CAEA,OAAAomC,MAkBA+2F,GAAAzE,EAAA,SAAA0E,GAIA,IAHA,GAAAp9H,GAAA,EACA1D,EAAA8gI,EAAA9oK,OACA2xE,KACA3pC,EAAA0D,GACA42H,EAAAwG,EAAAp9H,KAAAo9H,EAAAp9H,GAAA1rC,SACA2xE,EAAAm3F,EAAAp9H,GAAA,IAAAo9H,EAAAp9H,GAAA,IAEAA,GAAA,CAEA,OAAAimC,KA6BAo3F,GAAA1E,EAAA,SAAArwD,EAAAliC,GAIA,IAHA,GAAA1zD,MACAstB,EAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAA,CAEA,IADA,GAAAs9H,GAAAt9H,EAAA,EACA1D,EAAAghI,GAAAh1D,EAAAliC,EAAApmC,GAAAomC,EAAAk3F,KACAA,GAAA,CAEA5qJ,GAAAlb,KAAA4uE,EAAArwE,MAAAiqC,EAAAs9H,IACAt9H,EAAAs9H,EAEA,MAAA5qJ,KAwBAgqG,GAAAi8C,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,GAAAmB,IAwBAuoK,GAAA5E,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,IAAAmB,IA2BAo1G,GAAAuuD,EAAAnC,GA4BAgH,GAAA7E,EAAA,SAAAlC,EAAA1kJ,GACA,MAAA0kJ,KAAA1kJ,KA8BA0rJ,GAAA9E,EAAA,SAAA9kK,EAAAmB,GAEA,MAAAnB,KAAAmB,EAGA,IAAAnB,GAAA,EAAAA,IAAA,EAAAmB,EAGAnB,IAAAA,GAAAmB,IAAAA,IAsBA0oK,GAAAhF,EAAAhC,GA2BAiH,GAAA/E,EAAA,SAAAgF,EAAAC,EAAAC,GACA,MAAAzB,IAAArkK,KAAAoC,IAAAwjK,EAAAtpK,OAAAupK,EAAAvpK,OAAAwpK,EAAAxpK,QAAA,WACA,MAAAspK,GAAAtwF,MAAAhzE,KAAA0kD,WAAA6+G,EAAAvwF,MAAAhzE,KAAA0kD,WAAA8+G,EAAAxwF,MAAAhzE,KAAA0kD,eAmBAgmD,GAAA/tF,GAAA,GAoBA8mJ,GAAAnF,EAAA,SAAA54H,EAAAg+H,EAAA53F,GACApmC,EAAAA,EAAAomC,EAAA9xE,QAAA0rC,GAAA,EAAAA,EAAAomC,EAAA9xE,MACA,IAAA6D,GAAA4/J,EAAA3xF,EAEA,OADAjuE,GAAAyT,OAAAo0B,EAAA,EAAAg+H,GACA7lK,IAqBA8lK,GAAArF,EAAA,SAAA54H,EAAAk+H,EAAA93F,GAEA,MADApmC,GAAAA,EAAAomC,EAAA9xE,QAAA0rC,GAAA,EAAAA,EAAAomC,EAAA9xE,OACAshK,EAAAA,EAAAmC,EAAA3xF,EAAA,EAAApmC,GAAAk+H,GAAAnG,EAAA3xF,EAAApmC,MAoBAm+H,GAAAxF,EAAAH,EAAA,cAAA,SAAA5uC,EAAAxjD,GAIA,IAHA,GAAAH,MACAjmC,EAAA,EACA1rC,EAAA8xE,EAAA9xE,OACAA,EAAA0rC,GACAA,IAAA1rC,EAAA,EACA2xE,EAAAzuE,KAAA4uE,EAAApmC,IAEAimC,EAAAzuE,KAAA4uE,EAAApmC,GAAA4pF,GAEA5pF,GAAA,CAEA,OAAAimC,MA0BA2U,GAAA+9E,EAAA,SAAAyF,EAAAj9D,GACA,MAAA,OAAAA,GAAAA,EAAAnvF,cAAAosJ,GAAAj9D,YAAAi9D,KAsBAC,GAAA3F,EAAA,SAAA92J,GACA,MAAAg1J,GAAAh1J,IACA,EAEAA,EAGA,gBAAAA,IACA,EAEAA,YAAA/K,SACA,EAEA,IAAA+K,EAAA2G,WACA3G,EAAAtN,OAEA,IAAAsN,EAAAtN,QACA,EAEAsN,EAAAtN,OAAA,EACAsN,EAAAq1C,eAAA,IAAAr1C,EAAAq1C,eAAAr1C,EAAAtN,OAAA,IAEA,GAjBA,IAqCAgqK,GAAA5F,EAAA,SAAA92J,GACA,MAAA,OAAAA,IAsBAg8C,GAAA,WAEA,GAAA2gH,KAAA5nK,SAAA,MAAAg+G,qBAAA,YACA6pD,GACA,cACA,UACA,gBACA,WACA,uBACA,iBACA,kBAGAC,EAAA,WAEA,MAAAz/G,WAAA21D,qBAAA,aAEAjqG,EAAA,SAAA07D,EAAAs4F,GAEA,IADA,GAAA1+H,GAAA,EACAA,EAAAomC,EAAA9xE,QAAA,CACA,GAAA8xE,EAAApmC,KAAA0+H,EACA,OAAA,CAEA1+H,IAAA,EAEA,OAAA,EAEA,OAEA04H,GAFA,kBAAA1hH,QAAA4G,MAAA6gH,EAEA,SAAA1sJ,GACA,GAAAilC,OAAAjlC,KAAAA,EACA,QAEA,IAAA0kJ,GAAAkI,EACAC,KACAC,EAAAJ,GAAA9H,EAAA5kJ,EACA,KAAA0kJ,IAAA1kJ,IACAykJ,EAAAC,EAAA1kJ,IAAA8sJ,GAAA,WAAApI,IACAmI,EAAAA,EAAAtqK,QAAAmiK,EAGA,IAAA8H,EAEA,IADAI,EAAAH,EAAAlqK,OAAA,EACAqqK,GAAA,GACAlI,EAAA+H,EAAAG,GACAnI,EAAAC,EAAA1kJ,KAAArH,EAAAk0J,EAAAnI,KACAmI,EAAAA,EAAAtqK,QAAAmiK,GAEAkI,GAAA,CAGA,OAAAC,IAxBA,SAAA7sJ,GACA,MAAAilC,QAAAjlC,KAAAA,KAAAilC,OAAA4G,KAAA7rC,QA+CA+sJ,GAAApG,EAAA,SAAA3mJ,GACA,GAAA0kJ,GACAmI,IACA,KAAAnI,IAAA1kJ,GACA6sJ,EAAAA,EAAAtqK,QAAAmiK,CAEA,OAAAmI,KAkBAtqK,GAAAokK,EAAA,SAAAtyF,GACA,MAAA,OAAAA,GAAAwU,GAAAnlB,OAAA2Q,EAAA9xE,QAAA8xE,EAAA9xE,OAAAy6G,MAwBA0N,GAAAk8C,EAAA,SAAA9kK,EAAAmB,GACA,MAAAA,GAAAnB,IAwBAkrK,GAAApG,EAAA,SAAA9kK,EAAAmB,GACA,MAAAA,IAAAnB,IA6BAmrK,GAAApG,EAAA,SAAAtwD,EAAA9+B,EAAApD,GAKA,IAJA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACA6D,KACA8mK,GAAAz1F,GACAltC,EAAA0D,GACAi/H,EAAA32D,EAAA22D,EAAA,GAAA74F,EAAApmC,IACA7nC,EAAA6nC,GAAAi/H,EAAA,GACAj/H,GAAA,CAEA,QACAi/H,EAAA,GACA9mK,KAiCA+mK,GAAAtG,EAAA,SAAAtwD,EAAA9+B,EAAApD,GAIA,IAHA,GAAApmC,GAAAomC,EAAA9xE,OAAA,EACA6D,KACA8mK,GAAAz1F,GACAxpC,GAAA,GACAi/H,EAAA32D,EAAA22D,EAAA,GAAA74F,EAAApmC,IACA7nC,EAAA6nC,GAAAi/H,EAAA,GACAj/H,GAAA,CAEA,QACAi/H,EAAA,GACA9mK,KAyBAkzC,GAAAstH,EAAA,SAAA/wI,EAAA63F,GACA,MAAAA,GAAAp0E,MAAAzjB,SAmCAu3I,GAAAxG,EAAA,SAAAv1J,EAAAvO,GACA,MAAAiiK,GAAA1zJ,IAGA0zJ,EAAAjiK,IAAA,EAAAA,EACAk6G,KAEA3rG,EAAAvO,EAAAA,GAAAA,EALAk6G,MAyBA30G,GAAAu+J,EAAA,SAAA9kK,EAAAmB,GACA,MAAAA,GAAAnB,EAAAmB,EAAAnB,IA2BAurK,GAAAxG,EAAA,SAAA5kK,EAAAH,EAAAmB,GACA,MAAAhB,GAAAgB,GAAAhB,EAAAH,GAAAmB,EAAAnB,IAyBA62E,GAAAiuF,EAAA,SAAAxkK,EAAAV,GACA,MAAA8kK,MAAApkK,EAAAV,KAmBA4rK,GAAA3G,EAAA,SAAAtyF,GACA,MAAAmyF,GAAAjrF,MAAA,UAAAlwB,OAAAgpB,MA6BAk5F,GAAA1G,EAAA,SAAAtwD,EAAAn0G,EAAAV,GACA,GACAiY,GADAvT,IAEA,KAAAuT,IAAAvX,GACAqiK,EAAA9qJ,EAAAvX,KACAgE,EAAAuT,GAAA8qJ,EAAA9qJ,EAAAjY,GAAA60G,EAAA58F,EAAAvX,EAAAuX,GAAAjY,EAAAiY,IAAAvX,EAAAuX,GAGA,KAAAA,IAAAjY,GACA+iK,EAAA9qJ,EAAAjY,KAAA+iK,EAAA9qJ,EAAAvT,KACAA,EAAAuT,GAAAjY,EAAAiY,GAGA,OAAAvT,KAoBAF,GAAA0gK,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,GAAAmB,EAAAA,EAAAnB,IA2BA0rK,GAAA3G,EAAA,SAAA5kK,EAAAH,EAAAmB,GACA,MAAAhB,GAAAgB,GAAAhB,EAAAH,GAAAmB,EAAAnB,IA4BA2rK,GAAA7G,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,GAAAmB,IAuBA4kI,GAAA++B,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,GAAAmB,IA6BAyqK,GAAA9G,EAAA,SAAAnlK,EAAA80G,GACA,OAAA90G,GACA,IAAA,GACA,MAAA,YACA,MAAA80G,GAAAj0G,KAAAiG,MAEA,KAAA,GACA,MAAA,UAAAy6J,GACA,MAAAzsD,GAAAj0G,KAAAiG,KAAAy6J,GAEA,KAAA,GACA,MAAA,UAAAA,EAAAjnH,GACA,MAAAw6D,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,GAEA,KAAA,GACA,MAAA,UAAAinH,EAAAjnH,EAAAC,GACA,MAAAu6D,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,GAEA,KAAA,GACA,MAAA,UAAAgnH,EAAAjnH,EAAAC,EAAAinH,GACA,MAAA1sD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,GAEA,KAAA,GACA,MAAA,UAAAD,EAAAjnH,EAAAC,EAAAinH,EAAAC,GACA,MAAA3sD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,EAAAC,GAEA,KAAA,GACA,MAAA,UAAAF,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,GACA,MAAA5sD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,GAEA,KAAA,GACA,MAAA,UAAAH,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,GACA,MAAA7sD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,GAEA,KAAA,GACA,MAAA,UAAAJ,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,GACA,MAAA9sD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,GAEA,KAAA,GACA,MAAA,UAAAL,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,MAAA/sD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GAEA,KAAA,IACA,MAAA,UAAAN,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,MAAAhtD,GAAAj0G,KAAAiG,KAAAy6J,EAAAjnH,EAAAC,EAAAinH,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GAEA,SACA,KAAA,IAAArhK,OAAA,gFAkBAyrK,GAAAhH,EAAA,SAAAllK,GACA,OAAAA,IAyBAmsK,GAAAhH,EAAAhD,EAAAwD,EAAA,MAAAK,EAAAE,MAqBAkG,GAAAlH,EAAA,SAAA7kK,GACA,OAAAA,IA0BAgsK,GAAAlH,EAAA,SAAA/jK,EAAAwxE,GACA,GAAApmC,GAAA,EAAAprC,EAAAwxE,EAAA9xE,OAAAM,EAAAA,CACA,OAAAuiK,GAAA/wF,GAAAA,EAAAwJ,OAAA5vC,GAAAomC,EAAApmC,KAkBA8/H,GAAApH,EAAA,SAAAllK,GACA,MAAA,YACA,MAAAqsK,IAAArsK,EAAAwrD,cAwBA+gH,GAAApH,EAAA,SAAAjwJ,EAAAy4F,GACA,GAAApvF,KAEA,OADAA,GAAArJ,GAAAy4F,EACApvF,IAqBAw5D,GAAAmtF,EAAAjB,GAqBAvD,GAAAwE,EAAA,SAAApwD,GACA,GACAnwG,GADA6nK,GAAA,CAEA,OAAAlL,GAAAxsD,EAAAh0G,OAAA,WACA,MAAA0rK,GACA7nK,GAEA6nK,GAAA,EACA7nK,EAAAmwG,EAAAh7B,MAAAhzE,KAAA0kD,gBAyBAs/B,GAAAq6E,EAAA,SAAA9kK,EAAAmB,GACA,MAAAnB,IAAAmB,IA8BAirK,GAAA,WAGA,GAAAC,GAAA,SAAAt+J,GACA,OACAlD,MAAAkD,EACAD,IAAA,SAAA3N,GACA,MAAAksK,GAAAlsK,EAAA4N,MAIA,OAAAg3J,GAAA,SAAAuH,EAAAnsK,EAAA4N,GAIA,MAAAu+J,GAAA,SAAAp0H,GACA,MAAAm0H,GAAAlsK,EAAA+3C,MACAnqC,GAAAlD,WAoBA0hK,GAAAzH,EAAA,SAAA0H,EAAAC,GACA,OACAD,EACAC,KAoBAnqJ,GAAAwiJ,EAAA,SAAA4H,EAAAxuJ,GAGA,IAFA,GAAAovF,GAAApvF,EACAiuB,EAAA,EACAA,EAAAugI,EAAAjsK,QAAA,CACA,GAAA,MAAA6sG,EACA,MAEAA,GAAAA,EAAAo/D,EAAAvgI,IACAA,GAAA,EAEA,MAAAmhE,KAqBAq/D,GAAA5H,EAAA,SAAAppJ,EAAA3a,EAAAkd,GACA,MAAA4lC,IAAAnoC,EAAA2G,GAAAthB,EAAAkd,MAqBA0uJ,GAAA7H,EAAA,SAAA1C,EAAAwK,EAAA3uJ,GACA,MAAA2uJ,GAAApsK,OAAA,GAAA4hK,EAAA//I,GAAAuqJ,EAAA3uJ,MAqBAmkD,GAAAyiG,EAAA,SAAA/5C,EAAA7sG,GAGA,IAFA,GAAA5Z,MACA6nC,EAAA,EACAA,EAAA4+E,EAAAtqH,QACAsqH,EAAA5+E,IAAAjuB,KACA5Z,EAAAymH,EAAA5+E,IAAAjuB,EAAA6sG,EAAA5+E,KAEAA,GAAA,CAEA,OAAA7nC,KAqBAwoK,GAAAhI,EAAA,SAAA/5C,EAAA7sG,GAIA,IAHA,GAAA5Z,MACA6nC,EAAA,EACA1D,EAAAsiF,EAAAtqH,OACAgoC,EAAA0D,GAAA,CACA,GAAA5oC,GAAAwnH,EAAA5+E,EACA7nC,GAAAf,GAAA2a,EAAA3a,GACA4oC,GAAA,EAEA,MAAA7nC,KAuBAyoK,GAAAjI,EAAA,SAAAt3J,EAAA0Q,GACA,GAAA5Z,KACA,KAAA,GAAAs+J,KAAA1kJ,GACA1Q,EAAA0Q,EAAA0kJ,GAAAA,EAAA1kJ,KACA5Z,EAAAs+J,GAAA1kJ,EAAA0kJ,GAGA,OAAAt+J,KAoBA0oK,GAAAlI,EAAA,SAAA3yD,EAAA5/B,GACA,MAAAwvF,IAAA5vD,GAAA5/B,KAoBAqwF,GAAAkC,EAAA,SAAA9jK,EAAAkd,GACA,MAAAA,GAAAld,KA6BAisK,GAAAlI,EAAA,SAAAz3D,EAAAtsG,EAAAkd,GACA,MAAA,OAAAA,GAAAykJ,EAAA3hK,EAAAkd,GAAAA,EAAAld,GAAAssG,IAqBA4/D,GAAAnI,EAAA,SAAA1C,EAAA9+J,EAAA2a,GACA,MAAAmkJ,GAAAnkJ,EAAA3a,MAuBA62C,GAAA0qH,EAAA,SAAAqI,EAAAjvJ,GAIA,IAHA,GAAAuqB,GAAA0kI,EAAA1sK,OACA2xE,KACAjmC,EAAA,EACA1D,EAAA0D,GACAimC,EAAAjmC,GAAAjuB,EAAAivJ,EAAAhhI,IACAA,GAAA,CAEA,OAAAimC,KAmBAjmB,GAAA24G,EAAA,SAAA/mF,EAAAmzB,GACA,IAAAgyD,EAAAnlF,KAAAmlF,EAAAhyD,GACA,KAAA,IAAAv6C,WAAA,0CAIA,KAFA,GAAAryD,MACA3E,EAAAo+E,EACAmzB,EAAAvxG,GACA2E,EAAAX,KAAAhE,GACAA,GAAA,CAEA,OAAA2E,KAoCAuvH,GAAAkxC,EAAA,SAAAtwD,EAAA9+B,EAAApD,GAEA,IADA,GAAApmC,GAAAomC,EAAA9xE,OAAA,EACA0rC,GAAA,GACAwpC,EAAA8+B,EAAA9+B,EAAApD,EAAApmC,IACAA,GAAA,CAEA,OAAAwpC,KA0BAy3F,GAAAvI,EAAAZ,GAqBAz+I,GAAAu/I,EAAA,SAAA/3J,EAAA2qC,EAAA46B,GACA,MAAAwvF,GAAAmC,EAAA3xF,EAAA,EAAApuE,KAAAC,IAAA4I,EAAAulE,EAAA9xE,SAAAyjK,EAAA3xF,EAAApuE,KAAAC,IAAAmuE,EAAA9xE,OAAAuM,EAAA2qC,OAuBAnzC,GAAAugK,EAAA,SAAAsI,EAAAC,EAAA1hD,GACA,MAAAA,GAAApnH,QAAA6oK,EAAAC,KA2BAjoI,GAAAw/H,EAAA,SAAAtyF,GACA,MAAA+wF,GAAA/wF,GAAAA,EAAAxlE,MAAA,IAAAs4B,UAAA4Z,KAAA,IAAAilH,EAAA3xF,GAAAltC,YAsBAkoI,GAAAxI,EAAA,SAAAtwD,EAAA9+B,EAAApD,GAIA,IAHA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACA6D,GAAAqxE,GACAltC,EAAA0D,GACAwpC,EAAA8+B,EAAA9+B,EAAApD,EAAApmC,IACA7nC,EAAA6nC,EAAA,GAAAwpC,EACAxpC,GAAA,CAEA,OAAA7nC,KAyBAsvB,GAAAmxI,EAAA,SAAAuH,EAAA9qK,EAAAuM,GACA,MAAAq+J,IAAAE,EAAAtE,GAAAxmK,GAAAuM,KA2BA7L,GAAA6iK,EAAAJ,EAAA,QAAA,SAAAvyD,EAAAigB,EAAA9/C,GACA,MAAAr2B,OAAA91C,UAAAlE,MAAA1B,KAAA+xE,EAAA6/B,EAAAigB,MAuBA5qH,GAAAq9J,EAAA,SAAAyD,EAAAh2F,GACA,MAAA2xF,GAAA3xF,GAAA9qE,KAAA8gK,KAmCAiF,GAAA1I,EAAA,SAAArwD,EAAAliC,GACA,MAAA2xF,GAAA3xF,GAAA9qE,KAAA,SAAAzH,EAAAmB,GACA,GAAA+lE,GAAAutC,EAAAz0G,GACAwnG,EAAAiN,EAAAtzG,EACA,OAAAqmG,GAAAtgC,EAAA,GAAAA,EAAAsgC,EAAA,EAAA,MAsBAimE,GAAA3I,EAAA,SAAAt+J,EAAAu5J,GACA,OACA79J,GAAA,EAAAsE,EAAAu5J,GACA79J,GAAAsE,EAAA/F,GAAAs/J,GAAAA,MAqBA2N,GAAA5I,EAAA,SAAAnlK,EAAA4yE,GACA,GAAA,GAAA5yE,EACA,KAAA,IAAAS,OAAA,0DAIA,KAFA,GAAAkE,MACA6nC,EAAA,EACAA,EAAAomC,EAAA9xE,QACA6D,EAAAX,KAAAzB,GAAAiqC,EAAAA,GAAAxsC,EAAA4yE,GAEA,OAAAjuE,KAsBAqpK,GAAA7I,EAAA,SAAAzC,EAAA9vF,GAIA,IAHA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAguB,KACAga,EAAA0D,IAAAk2H,EAAA9vF,EAAApmC,KACA1d,EAAA9qB,KAAA4uE,EAAApmC,IACAA,GAAA,CAEA,QACA1d,EACAy1I,EAAA3xF,EAAApmC,MA2BAyhI,GAAA9I,EAAA,SAAA9kK,EAAAmB,GACA,MAAAygE,QAAA5hE,GAAA4hE,OAAAzgE,KA8BA4nK,GAAApE,EAAA,OAAAziK,GAAA,EAAA2zE,EAAAA,IAyCAg4F,GAAA/I,EAAAQ,EAAA,OAAAoC,GAAA,SAAA/nK,EAAAmuK,GACA,MAAA5rK,IAAA,EAAA,EAAAvC,EAAAk2E,EAAAA,EAAAl2E,EAAAmuK,MAyBAC,GAAAjJ,EAAA,SAAArwD,EAAAliC,GAEA,IADA,GAAApmC,GAAAomC,EAAA9xE,OAAA,EACA0rC,GAAA,GAAAsoE,EAAAliC,EAAApmC,KACAA,GAAA,CAEA,OAAA+3H,GAAA3xF,EAAApmC,EAAA,EAAA0pC,EAAAA,KA6BAm4F,GAAAlJ,EAAAQ,EAAA,YAAAsC,GAAA,SAAAnzD,EAAAliC,GAGA,IAFA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAAsoE,EAAAliC,EAAApmC,KACAA,GAAA,CAEA,OAAA+3H,GAAA3xF,EAAA,EAAApmC,MAoBA8hI,GAAAnJ,EAAA,SAAArwD,EAAA1mG,GAEA,MADA0mG,GAAA1mG,GACAA,IAsBAmgK,GAAApJ,EAAA,SAAArwD,EAAA90G,GACA,GAEA4yE,GAFA9pC,EAAAm5B,OAAAjiE,GACAwsC,EAAA,CAEA,IAAA,EAAA1D,GAAArvB,MAAAqvB,GACA,KAAA,IAAA2yE,YAAA,kCAGA,KADA7oC,EAAA,GAAAr2B,OAAAzT,GACAA,EAAA0D,GACAomC,EAAApmC,GAAAsoE,EAAAtoE,GACAA,GAAA,CAEA,OAAAomC,KAqBA47F,GAAAtJ,EAAA,SAAA3mJ,GACA,GAAAqrJ,KACA,KAAA,GAAA3G,KAAA1kJ,GACAykJ,EAAAC,EAAA1kJ,KACAqrJ,EAAAA,EAAA9oK,SACAmiK,EACA1kJ,EAAA0kJ,IAIA,OAAA2G,KAwBA6E,GAAAvJ,EAAA,SAAA3mJ,GACA,GAAAqrJ,KACA,KAAA,GAAA3G,KAAA1kJ,GACAqrJ,EAAAA,EAAA9oK,SACAmiK,EACA1kJ,EAAA0kJ,GAGA,OAAA2G,KAyBA8E,GAAAxJ,EAAA,SAAAyJ,GAGA,IAFA,GAAApuK,GAAA,EACAoE,KACApE,EAAAouK,EAAA7tK,QAAA,CAGA,IAFA,GAAA8tK,GAAAD,EAAApuK,GACAsD,EAAA,EACAA,EAAA+qK,EAAA9tK,QACA,mBAAA6D,GAAAd,KACAc,EAAAd,OAEAc,EAAAd,GAAAG,KAAA4qK,EAAA/qK,IACAA,GAAA,CAEAtD,IAAA,EAEA,MAAAoE,KAkBAi5F,GAAA,WACA,GAAA0uB,GAAA,kDACAuiD,EAAA,IACAC,EAAA,kBAAAzrK,QAAAoD,UAAAm3F,IACA,OAOAsnE,GAPA4J,IAAAxiD,EAAA1uB,QAAAixE,EAAAjxE,OAOA,SAAAquB,GACA,MAAAA,GAAAruB,QAPA,SAAAquB,GACA,GAAA8iD,GAAA,GAAAjqK,QAAA,KAAAwnH,EAAA,KAAAA,EAAA,MACA0iD,EAAA,GAAAlqK,QAAA,IAAAwnH,EAAA,KAAAA,EAAA,MACA,OAAAL,GAAApnH,QAAAkqK,EAAA,IAAAlqK,QAAAmqK,EAAA,SA8BAC,GAAA9J,EAAA,SAAA+J,EAAAC,GACA,MAAA7N,GAAA4N,EAAApuK,OAAA,WACA,IACA,MAAAouK,GAAAp1F,MAAAhzE,KAAA0kD,WACA,MAAA1rD,GACA,MAAAqvK,GAAAr1F,MAAAhzE,KAAAs7J,GAAAtiK,GAAA0rD,iBA4BApgD,GAAA85J,EAAA,SAAAv3D,GACA,MAAA,QAAAA,EAAA,OAAA1kG,SAAA0kG,EAAA,YAAAnqD,OAAA/8C,UAAAtD,SAAAtC,KAAA8sG,GAAAprG,MAAA,EAAA,MA0BA6sK,GAAAlK,EAAA,SAAApwD,GACA,MAAA,YACA,MAAAA,GAAAyvD,EAAA/4G,eA8BA6jH,GAAAnK,EAAA,SAAApwD,GACA,MAAAm3D,IAAA,EAAAn3D,KAsBAw6D,GAAAnK,EAAA,SAAA7lD,EAAAxK,GACA,MAAA+zD,IAAAvpD,EAAA,WAKA,IAJA,GAGAiwD,GAHAC,EAAA,EACAtkK,EAAA4pG,EACAtoE,EAAA,EAEA8yE,GAAAkwD,GAAA,kBAAAtkK,IACAqkK,EAAAC,IAAAlwD,EAAA9zD,UAAA1qD,OAAA0rC,EAAAthC,EAAApK,OACAoK,EAAAA,EAAA4uE,MAAAhzE,KAAAy9J,EAAA/4G,UAAAhf,EAAA+iI,IACAC,GAAA,EACAhjI,EAAA+iI,CAEA,OAAArkK,OA4BAukK,GAAAtK,EAAA,SAAArwD,EAAAx1F,GAGA,IAFA,GAAAstJ,GAAA93D,EAAAx1F,GACA3a,KACAioK,GAAAA,EAAA9rK,QACA6D,EAAAA,EAAA7D,QAAA8rK,EAAA,GACAA,EAAA93D,EAAA83D,EAAA,GAEA,OAAAjoK,KAyBA+qK,GAAAvK,EAAA,SAAAzC,EAAA9vF,GAKA,IAJA,GAGAs4F,GAHA1+H,EAAA,EACA1D,EAAA8pC,EAAA9xE,OACA6D,KAEAmkC,EAAA0D,GACA0+H,EAAAt4F,EAAApmC,GACAi2H,EAAAC,EAAAwI,EAAAvmK,KACAA,EAAAA,EAAA7D,QAAAoqK,GAEA1+H,GAAA,CAEA,OAAA7nC,KA4BAgrK,GAAAvK,EAAA,SAAA1C,EAAAkN,EAAAxhK,GACA,MAAAs0J,GAAAt0J,GAAAA,EAAAwhK,EAAAxhK,KAsBAyhK,GAAAzK,EAAA,SAAA1C,EAAA5tD,EAAAzwE,GAEA,IADA,GAAAspE,GAAAtpE,GACAq+H,EAAA/0D,IACAA,EAAAmH,EAAAnH,EAEA,OAAAA,KAsBA71C,GAAAstG,EAAA,SAAA54H,EAAAp+B,EAAAwkE,GACA,MAAAu1F,IAAAE,GAAAj6J,GAAAo+B,EAAAomC,KA8BAk9F,GAAA3K,EAAA,SAAArwD,EAAAi7D,GACA,MAAAlH,IAAAkH,EAAAjvK,OAAA,WAGA,IAFA,GAAA+zG,MACAroE,EAAA,EACAA,EAAAujI,EAAAjvK,QACA+zG,EAAA7wG,KAAA+rK,EAAAvjI,GAAA3rC,KAAAiG,KAAA0kD,UAAAhf,KACAA,GAAA,CAEA,OAAAsoE,GAAAh7B,MAAAhzE,KAAA+tG,EAAAjrD,OAAA26G,EAAA/4G,UAAAukH,EAAAjvK,cAoBAoiH,GAAAgiD,EAAA,SAAA3mJ,GAKA,IAJA,GAAAk8B,GAAA2P,GAAA7rC,GACAuqB,EAAA2R,EAAA35C,OACAkvK,KACAxjI,EAAA,EACA1D,EAAA0D,GACAwjI,EAAAxjI,GAAAjuB,EAAAk8B,EAAAjO;AACAA,GAAA,CAEA,OAAAwjI,KAuBAC,GAAA/K,EAAA,SAAA3mJ,GACA,GAAA0kJ,GACAh1D,IACA,KAAAg1D,IAAA1kJ,GACA0vF,EAAAA,EAAAntG,QAAAyd,EAAA0kJ,EAEA,OAAAh1D,KA2BA5yF,GAAA,WAEA,GAAA60J,GAAA,SAAA9hK,GACA,OACAlD,MAAAkD,EACAD,IAAA,WACA,MAAArH,QAIA,OAAAq+J,GAAA,SAAAwH,EAAAv+J,GAGA,MAAAu+J,GAAAuD,GAAA9hK,GAAAlD,WAgCAilK,GAAA/K,EAAA,SAAA1C,EAAA0N,EAAAhiK,GACA,MAAAs0J,GAAAt0J,GAAAgiK,EAAAhiK,GAAAA,IAqCAiiK,GAAAlL,EAAA,SAAAmL,EAAAC,GACA,IAAA,GAAAtN,KAAAqN,GACA,GAAAtN,EAAAC,EAAAqN,KAAAA,EAAArN,GAAAsN,EAAAtN,IACA,OAAA,CAGA,QAAA,IA6BA1uB,GAAA4wB,EAAA,SAAArwD,EAAAuB,GACA,MAAAwyD,IAAA/zD,EAAAh0G,OAAA,WACA,MAAAu1G,GAAAv8B,MAAAhzE,KAAAs7J,GAAAttD,GAAAtpD,gBAsBAglH,GAAArL,EAAA,SAAA9kK,EAAAmB,GAOA,IALA,GAEAqC,GAFA2oC,EAAA,EACAikI,EAAApwK,EAAAS,OAEA4vK,EAAAlvK,EAAAV,OACA6D,KACA8rK,EAAAjkI,GAAA,CAEA,IADA3oC,EAAA,EACA6sK,EAAA7sK,GACAc,EAAAA,EAAA7D,SACAT,EAAAmsC,GACAhrC,EAAAqC,IAEAA,GAAA,CAEA2oC,IAAA,EAEA,MAAA7nC,KAqBAgsK,GAAAxL,EAAA,SAAA9kK,EAAAmB,GAIA,IAHA,GAAAovK,MACApkI,EAAA,EACA1D,EAAAtkC,KAAAC,IAAApE,EAAAS,OAAAU,EAAAV,QACAgoC,EAAA0D,GACAokI,EAAApkI,IACAnsC,EAAAmsC,GACAhrC,EAAAgrC,IAEAA,GAAA,CAEA,OAAAokI,KAoBAC,GAAA1L,EAAA,SAAA/6G,EAAA84D,GAIA,IAHA,GAAA12E,GAAA,EACA1D,EAAAtkC,KAAAC,IAAA2lD,EAAAtpD,OAAAoiH,EAAApiH,QACA2xE,KACA3pC,EAAA0D,GACAimC,EAAAroB,EAAA5d,IAAA02E,EAAA12E,GACAA,GAAA,CAEA,OAAAimC,KA0BAq+F,GAAA1L,EAAA,SAAAtwD,EAAAz0G,EAAAmB,GAIA,IAHA,GAAAovK,MACApkI,EAAA,EACA1D,EAAAtkC,KAAAC,IAAApE,EAAAS,OAAAU,EAAAV,QACAgoC,EAAA0D,GACAokI,EAAApkI,GAAAsoE,EAAAz0G,EAAAmsC,GAAAhrC,EAAAgrC,IACAA,GAAA,CAEA,OAAAokI,KAkBAh8D,GAAAyzD,IAAA,GAiBAv1I,GAAAu1I,IAAA,GAYA0I,GAAA,QAAAA,IAAA7lK,EAAA8lK,EAAAC,EAAAC,GACA,GAAAC,GAAA,SAAAC,GAGA,IAFA,GAAAtoI,GAAAkoI,EAAAlwK,OACA0rC,EAAA,EACA1D,EAAA0D,GAAA,CACA,GAAAthC,IAAA8lK,EAAAxkI,GACA,MAAAykI,GAAAzkI,EAEAA,IAAA,EAEAwkI,EAAAxkI,EAAA,GAAAthC,EACA+lK,EAAAzkI,EAAA,GAAA4kI,CACA,KAAA,GAAAl8J,KAAAhK,GACAkmK,EAAAl8J,GAAAg8J,EAAAH,GAAA7lK,EAAAgK,GAAA87J,EAAAC,GAAA,GAAA/lK,EAAAgK,EAEA,OAAAk8J,GAEA,QAAAhmK,GAAAF,IACA,IAAA,SACA,MAAAimK,MACA,KAAA,QACA,MAAAA,MACA,KAAA,OACA,MAAA,IAAAp7J,MAAA7K,EAAAmnH,UACA,KAAA,SACA,MAAA4vC,GAAA/2J,EACA,SACA,MAAAA,KAIAmmK,GAAA,SAAAznH,GACA,MAAAu7G,GAAA,SAAArwD,EAAAD,GACA,MAAAysD,GAAA98J,KAAAoC,IAAA,EAAAkuG,EAAAh0G,OAAA+zG,EAAA/zG,QAAA,WACA,MAAAg0G,GAAAh7B,MAAAhzE,KAAA8iD,EAAAirD,EAAArpD,iBAKA8lH,GAAA,SAAAtxK,EAAAmuK,GACA,MAAAD,IAAAluK,EAAAmuK,EAAArtK,OAAAqtK,EAAArtK,OAAAd,EAAA,EAAAmuK,IAIAoD,GAAA,QAAAA,IAAAlxK,EAAAmB,EAAAgwK,EAAAC,GACA,GAAAxH,GAAA5pK,EAAAmB,GACA,OAAA,CAEA,IAAA4J,GAAA/K,KAAA+K,GAAA5J,GACA,OAAA,CAEA,IAAA,MAAAnB,GAAA,MAAAmB,EACA,OAAA,CAEA,IAAA,kBAAAnB,GAAAqrF,QAAA,kBAAAlqF,GAAAkqF,OACA,MAAA,kBAAArrF,GAAAqrF,QAAArrF,EAAAqrF,OAAAlqF,IAAA,kBAAAA,GAAAkqF,QAAAlqF,EAAAkqF,OAAArrF,EAEA,QAAA+K,GAAA/K,IACA,IAAA,YACA,IAAA,QACA,IAAA,SACA,GAAA,kBAAAA,GAAAme,aAAA,YAAAukJ,EAAA1iK,EAAAme,aACA,MAAAne,KAAAmB,CAEA,MACA,KAAA,UACA,IAAA,SACA,IAAA,SACA,SAAAnB,UAAAmB,KAAAyoK,GAAA5pK,EAAAgyH,UAAA7wH,EAAA6wH,WACA,OAAA,CAEA,MACA,KAAA,OACA,IAAA43C,GAAA5pK,EAAAgyH,UAAA7wH,EAAA6wH,WACA,OAAA,CAEA,MACA,KAAA,QACA,MAAAhyH,GAAAuD,OAAApC,EAAAoC,MAAAvD,EAAA21B,UAAAx0B,EAAAw0B,OACA,KAAA,SACA,GAAA31B,EAAAo+B,SAAAj9B,EAAAi9B,QAAAp+B,EAAAgvG,SAAA7tG,EAAA6tG,QAAAhvG,EAAA0+G,aAAAv9G,EAAAu9G,YAAA1+G,EAAA2+G,YAAAx9G,EAAAw9G,WAAA3+G,EAAA6+G,SAAA19G,EAAA09G,QAAA7+G,EAAA4+G,UAAAz9G,EAAAy9G,QACA,OAAA,CAEA,MACA,KAAA,MACA,IAAA,MACA,IAAAsyD,GAAAxP,EAAA1hK,EAAAs5G,WAAAooD,EAAAvgK,EAAAm4G,WAAA63D,EAAAC,GACA,OAAA,CAEA,MACA,KAAA,YACA,IAAA,aACA,IAAA,oBACA,IAAA,aACA,IAAA,cACA,IAAA,aACA,IAAA,cACA,IAAA,eACA,IAAA,eACA,KACA,KAAA,cACA,KACA,SAEA,OAAA,EAEA,GAAAC,GAAAtnH,GAAA/pD,EACA,IAAAqxK,EAAA5wK,SAAAspD,GAAA5oD,GAAAV,OACA,OAAA,CAGA,KADA,GAAA0rC,GAAAglI,EAAA1wK,OAAA,EACA0rC,GAAA,GAAA,CACA,GAAAglI,EAAAhlI,KAAAnsC,EACA,MAAAoxK,GAAAjlI,KAAAhrC,CAEAgrC,IAAA,EAKA,IAHAglI,EAAAxtK,KAAA3D,GACAoxK,EAAAztK,KAAAxC,GACAgrC,EAAAklI,EAAA5wK,OAAA,EACA0rC,GAAA,GAAA,CACA,GAAAt3B,GAAAw8J,EAAAllI,EACA,KAAAw2H,EAAA9tJ,EAAA1T,KAAA+vK,GAAA/vK,EAAA0T,GAAA7U,EAAA6U,GAAAs8J,EAAAC,GACA,OAAA,CAEAjlI,IAAA,EAIA,MAFAglI,GAAAG,MACAF,EAAAE,OACA,GASAC,GAAA,SAAAC,GACA,MAAA,SAAAC,GAAAl/F,GAKA,IAJA,GAAA1nE,GAAAwlK,EAAA7sK,EACAc,KACA6nC,EAAA,EACAikI,EAAA79F,EAAA9xE,OACA2vK,EAAAjkI,GAAA,CACA,GAAAq+H,GAAAj4F,EAAApmC,IAIA,IAHAthC,EAAA2mK,EAAAC,EAAAl/F,EAAApmC,IAAAomC,EAAApmC,GACA3oC,EAAA,EACA6sK,EAAAxlK,EAAApK,OACA4vK,EAAA7sK,GACAc,EAAAA,EAAA7D,QAAAoK,EAAArH,GACAA,GAAA,MAGAc,GAAAA,EAAA7D,QAAA8xE,EAAApmC,EAEAA,IAAA,EAEA,MAAA7nC,KAIAotK,GAAA,WACA,QAAAC,GAAArN,EAAA3uF,EAAApD,GAGA,IAFA,GAAApmC,GAAA,EACA1D,EAAA8pC,EAAA9xE,OACAgoC,EAAA0D,GAAA,CAEA,GADAwpC,EAAA2uF,EAAA,qBAAA3uF,EAAApD,EAAApmC,IACAwpC,GAAAA,EAAA,wBAAA,CACAA,EAAAA,EAAA,qBACA,OAEAxpC,GAAA,EAEA,MAAAm4H,GAAA,uBAAA3uF,GAEA,QAAAi8F,GAAAtN,EAAA3uF,EAAAi8B,GAEA,IADA,GAAAviG,GAAAuiG,EAAAz6E,QACA9nB,EAAA+nB,MAAA,CAEA,GADAu+C,EAAA2uF,EAAA,qBAAA3uF,EAAAtmE,EAAAxE,OACA8qE,GAAAA,EAAA,wBAAA,CACAA,EAAAA,EAAA,qBACA,OAEAtmE,EAAAuiG,EAAAz6E,OAEA,MAAAmtI,GAAA,uBAAA3uF,GAEA,QAAAk8F,GAAAvN,EAAA3uF,EAAAz3D,GACA,MAAAomJ,GAAA,uBAAApmJ,EAAAw3D,OAAA3sE,GAAAu7J,EAAA,qBAAAA,GAAA3uF,IAEA,GAAAm8F,GAAA,mBAAA9zJ,QAAAA,OAAAC,SAAA,YACA,OAAA,UAAAw2F,EAAA9+B,EAAApD,GAIA,GAHA,kBAAAkiC,KACAA,EAAA8vD,EAAA9vD,IAEA+1D,GAAAj4F,GACA,MAAAo/F,GAAAl9D,EAAA9+B,EAAApD,EAEA,IAAA,kBAAAA,GAAAmD,OACA,MAAAm8F,GAAAp9D,EAAA9+B,EAAApD,EAEA,IAAA,MAAAA,EAAAu/F,GACA,MAAAF,GAAAn9D,EAAA9+B,EAAApD,EAAAu/F,KAEA,IAAA,kBAAAv/F,GAAAp7C,KACA,MAAAy6I,GAAAn9D,EAAA9+B,EAAApD,EAEA,MAAA,IAAA5b,WAAA,8CAIAo7G,GAAA,WACA,GAAAC,IACAC,oBAAA/1H,MACAg2H,oBAAA,SAAApE,EAAA//J,GAEA,MADA+/J,GAAAnqK,KAAAoK,GACA+/J,GAEAqE,sBAAAtP,GAEAuP,GACAH,oBAAAjvK,OACAkvK,oBAAA,SAAAlyK,EAAAmB,GACA,MAAAnB,GAAAmB,GAEAgxK,sBAAAtP,GAEAwP,GACAJ,oBAAA9uH,OACA+uH,oBAAA,SAAA5tK,EAAAw9E,GACA,MAAA4iF,GAAApgK,EAAAkmK,GAAA1oF,GAAAoqF,GAAApqF,EAAA,GAAAA,EAAA,IAAAA,IAEAqwF,sBAAAtP,EAEA,OAAA,UAAA3kJ,GACA,GAAAqlJ,EAAArlJ,GACA,MAAAA,EAEA,IAAAssJ,GAAAtsJ,GACA,MAAA8zJ,EAEA,IAAA,gBAAA9zJ,GACA,MAAAk0J,EAEA,IAAA,gBAAAl0J,GACA,MAAAm0J,EAEA,MAAA,IAAAjyK,OAAA,iCAAA8d,OAIAo0J,GAAA,WACA,QAAAC,GAAA99D,EAAA6vD,GACA79J,KAAAtG,EAAAs0G,EACAhuG,KAAA+rK,YACA/rK,KAAA69J,GAAAA,EAmBA,MAjBAiO,GAAAnsK,UAAA,qBAAAi+J,EAAArgI,KACAuuI,EAAAnsK,UAAA,uBAAA,SAAA9B,GAEA,MADAmC,MAAA+rK,SAAA,KACA/rK,KAAA69J,GAAA,uBAAAhgK,IAEAiuK,EAAAnsK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,MAAAr7E,MAAAtG,EAAA2hF,GAAAr7E,KAAAgsK,OAAAnuK,EAAAw9E,GAAAr7E,KAAA2I,MAAA9K,EAAAw9E,IAEAywF,EAAAnsK,UAAAgJ,MAAA,SAAA9K,EAAAw9E,GAGA,MAFAx9E,GAAAotK,GAAAjrK,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAA+rK,UACA/rK,KAAA+rK,YACA/rK,KAAA69J,GAAA,qBAAAhgK,EAAAw9E,IAEAywF,EAAAnsK,UAAAqsK,OAAA,SAAAnuK,EAAAw9E,GAEA,MADAr7E,MAAA+rK,SAAA7uK,KAAAm+E,GACAx9E,GAEAwgK,EAAA,SAAArwD,EAAA6vD,GACA,MAAA,IAAAiO,GAAA99D,EAAA6vD,QAIAoO,GAAA,WACA,QAAAC,GAAAxyK,EAAAmkK,GACA79J,KAAA69J,GAAAA,EACA79J,KAAAtG,EAAAA,EACAsG,KAAAmsK,UA0BA,MAxBAD,GAAAvsK,UAAA,qBAAAi+J,EAAArgI,KACA2uI,EAAAvsK,UAAA,uBAAA,SAAA9B,GACA,GAAAuQ,EACA,KAAAA,IAAApO,MAAAmsK,OACA,GAAAjQ,EAAA9tJ,EAAApO,KAAAmsK,UACAtuK,EAAAmC,KAAA69J,GAAA,qBAAAhgK,EAAAmC,KAAAmsK,OAAA/9J,IACAvQ,EAAA,yBAAA,CACAA,EAAAA,EAAA,qBACA,OAKA,MADAmC,MAAAmsK,OAAA,KACAnsK,KAAA69J,GAAA,uBAAAhgK,IAEAquK,EAAAvsK,UAAA,qBAAA,SAAA9B,EAAAw9E,GACA,GAAAjtE,GAAApO,KAAAtG,EAAA2hF,EAMA,OALAr7E,MAAAmsK,OAAA/9J,GAAApO,KAAAmsK,OAAA/9J,KACAA,MAGApO,KAAAmsK,OAAA/9J,GAAA,GAAAszJ,GAAArmF,EAAAr7E,KAAAmsK,OAAA/9J,GAAA,IACAvQ,GAEAwgK,EAAA,SAAA3kK,EAAAmkK,GACA,MAAA,IAAAqO,GAAAxyK,EAAAmkK,QA4BAuO,GAAAhO,EAAA,SAAApwD,GACA,MAAA+zD,IAAA/zD,EAAAh0G,OAAA,WACA,GAAA0rC,GAAA,EACA2mI,EAAA3nH,UAAA,GACAonB,EAAApnB,UAAAA,UAAA1qD,OAAA,GACA+zG,EAAA0vD,EAAA/4G,UASA,OARAqpD,GAAA,GAAA,WACA,GAAAlwG,GAAAwuK,EAAAr5F,MAAAhzE,KAAAs7J,EAAA52G,WACAhf,EACAomC,IAGA,OADApmC,IAAA,EACA7nC,GAEAmwG,EAAAh7B,MAAAhzE,KAAA+tG,OA8BAu+D,GAAAlO,EAAA,SAAApwD,GACA,MAAAm3D,IAAA,EAAAn3D,KAuBAu+D,GAAAnO,EAAA,SAAAh6J,GACA,MAAA,OAAAA,GAAA,kBAAAA,GAAAmoK,MAAAnoK,EAAAmoK,QAAAtC,GAAA7lK,SAAA,KA4CAooK,GAAApO,EAAA,SAAApwD,GACA,MAAA+zD,IAAA/zD,EAAAh0G,OAAAg0G,KA2BAy+D,GAAApO,EAAAQ,EAAA,OAAAY,EAAA,SAAAvmK,EAAAmuK,GACA,MAAA5rK,IAAAiC,KAAAoC,IAAA,EAAA5G,GAAAk2E,EAAAA,EAAAi4F,MAwBAqF,GAAArO,EAAAQ,EAAA,WAAAc,EAAA6K,KAuBAmC,GAAAtO,EAAAQ,EAAA,gBAAAgN,GAAA9M,IA2BAn6E,GAAAy5E,EAAA,SAAA9kK,EAAAmB,GACA,MAAA+vK,IAAAlxK,EAAAmB,WA8BAsU,GAAAqvJ,EAAAQ,EAAA,SAAAuB,EAAA,SAAAxE,EAAAgR,GACA,MAAAlQ,GAAAkQ,GAAA3B,GAAA,SAAA/7F,EAAA9gE,GAIA,MAHAwtJ,GAAAgR,EAAAx+J,MACA8gE,EAAA9gE,GAAAw+J,EAAAx+J,IAEA8gE,MACA5rB,GAAAspH,IACA/Q,EAAAD,EAAAgR,MAoBAz9F,GAAAivF,EAAA0M,IAAA,IAqBA+B,GAAAzO,EAAA,SAAApwD,GACA,MAAAw+D,IAAA,SAAAjzK,EAAAmB,GACA,GAAAqzG,GAAA0vD,EAAA/4G,UAGA,OAFAqpD,GAAA,GAAArzG,EACAqzG,EAAA,GAAAx0G,EACAy0G,EAAAh7B,MAAAhzE,KAAA+tG,OAyBAhyF,GAAAwpJ,GAAA,GA0BAhoI,GAAA9hC,GAAA,EAAA,IAqCAqxK,GAAAxO,EAAA,SAAA1C,EAAAmR,EAAAC,GACA,GAAAC,GAAAC,CACAH,GAAA/yK,OAAAgzK,EAAAhzK,QACAizK,EAAAF,EACAG,EAAAF,IAEAC,EAAAD,EACAE,EAAAH,EAIA,KAFA,GAAAI,MACAznI,EAAA,EACAA,EAAAwnI,EAAAlzK,QACA2hK,EAAAC,EAAAsR,EAAAxnI,GAAAunI,KACAE,EAAAA,EAAAnzK,QAAAkzK,EAAAxnI,IAEAA,GAAA,CAEA,OAAAkjI,IAAAhN,EAAAuR,KAwCAC,GAAA9O,EAAA,SAAApvF,EAAA2uF,EAAA/xF,GACA,MAAAgxF,GAAA5tF,GAAA+7F,GAAApN,EAAA3uF,GAAAA,EAAA,uBAAApD,GAAAm/F,GAAApN,EAAAyN,GAAAp8F,IAAA+6F,GAAA/6F,SAAA,GAAApD,KAyBAuhG,GAAAjP,EAAA,SAAA3mJ,GAKA,IAJA,GAAAk8B,GAAA2P,GAAA7rC,GACAuqB,EAAA2R,EAAA35C,OACA0rC,EAAA,EACAimC,KACA3pC,EAAA0D,GAAA,CACA,GAAAt3B,GAAAulC,EAAAjO,GACAmhE,EAAApvF,EAAArJ,GACA09D,EAAAowF,EAAAr1D,EAAAl7B,GAAAA,EAAAk7B,GAAAl7B,EAAAk7B,KACA/6B,GAAAA,EAAA9xE,QAAAoU,EACAs3B,GAAA,EAEA,MAAAimC,KA6BA2hG,GAAAlP,EAAA,SAAA3mJ,GAKA,IAJA,GAAAk8B,GAAA2P,GAAA7rC,GACAuqB,EAAA2R,EAAA35C,OACA0rC,EAAA,EACAimC,KACA3pC,EAAA0D,GAAA,CACA,GAAAt3B,GAAAulC,EAAAjO,EACAimC,GAAAl0D,EAAArJ,IAAAA,EACAs3B,GAAA,EAEA,MAAAimC,KAwBA4hG,GAAAnP,EAAA,SAAA92J,GACA,MAAA,OAAAA,GAAAs9E,GAAAt9E,EAAAo7H,GAAAp7H,MAuBA67D,GAAAoiG,GAAA,IAqBApjE,GAAAk8D,EAAA,SAAA37H,EAAA2kI,GACA,GAAA,kBAAAA,GAAAllE,aAAAm6D,EAAA+K,GAEA,CAEA,IADA,GAAA3hI,GAAA2hI,EAAArtK,OAAA,EACA0rC,GAAA,GAAA,CACA,GAAAk/C,GAAAyiF,EAAA3hI,GAAAhD,GACA,MAAAgD,EAEAA,IAAA,EAEA,MAAA,GATA,MAAA2hI,GAAAllE,YAAAz/D,KA6CAr7B,GAAAg3J,EAAAQ,EAAA,MAAAkC,GAAA,SAAA/yD,EAAAgvD,GACA,OAAAtgH,OAAA/8C,UAAAtD,SAAAtC,KAAAijK,IACA,IAAA,oBACA,MAAA+E,IAAA/E,EAAAhjK,OAAA,WACA,MAAAg0G,GAAAj0G,KAAAiG,KAAAg9J,EAAAhqF,MAAAhzE,KAAA0kD,aAEA,KAAA,kBACA,MAAAumH,IAAA,SAAA/7F,EAAA9gE,GAEA,MADA8gE,GAAA9gE,GAAA4/F,EAAAgvD,EAAA5uJ,IACA8gE,MACA5rB,GAAA05G,GACA,SACA,MAAAD,GAAA/uD,EAAAgvD,OAyBAwQ,GAAAnP,EAAA,SAAArwD,EAAAv2F,GACA,MAAAwzJ,IAAA,SAAA/7F,EAAA9gE,GAEA,MADA8gE,GAAA9gE,GAAA4/F,EAAAv2F,EAAArJ,GAAAA,EAAAqJ,GACAy3D,MACA5rB,GAAA7rC,MA2BAg2J,GAAAnP,EAAA,SAAAtwD,EAAAn0G,EAAAV,GACA,MAAA6rK,IAAA,SAAAnlD,EAAAlQ,EAAA5tC,GACA,MAAAisC,GAAA2B,EAAA5tC,IACAloE,EAAAV,KA8BAu0K,GAAAnD,GAAAjP,GAyBAqS,GAAApD,GAAAsC,GAAAvR,IAyBAsS,GAAAtP,EAAA,SAAAuP,EAAAhnE,EAAApvF,GACA,MAAAmtE,IAAA/oE,GAAAgyJ,EAAAp2J,GAAAovF,KAqBAinE,GAAAzP,EAAA,SAAA9jK,EAAAuxE,GACA,MAAAzkE,IAAA80J,GAAA5hK,GAAAuxE,KAuBAiiG,GAAA/E,GAAAjM,GACAsJ,GACAjD,KA2BA4K,GAAA1P,EAAA,SAAAxhK,EAAA+pG,EAAApvF,GACA,MAAAgvJ,IAAA7hF,GAAAiiB,GAAA/pG,EAAA2a,KAuBAw2J,GAAA3P,EAAA,SAAAh6J,EAAAxH,EAAA2a,GACA,MAAAgvJ,IAAAnmF,GAAAh8E,GAAAxH,EAAA2a,KAoCAw3D,GAAAqvF,EAAA2M,IA4CAiD,GAAA1P,EAAA,KAAA,SAAA2P,EAAAC,EAAAC,EAAAviG,GACA,MAAAm/F,IAAA,SAAA/7F,EAAAw0F,GACA,GAAAt1J,GAAAigK,EAAA3K,EAEA,OADAx0F,GAAA9gE,GAAA+/J,EAAAjS,EAAA9tJ,EAAA8gE,GAAAA,EAAA9gE,GAAAggK,EAAA1K,GACAx0F,MACApD,KAyBAj9C,GAAAwvI,EAAA,SAAAzC,EAAAgR,GACA,MAAA59J,IAAAqsJ,EAAAO,GAAAgR,KAsBA1gH,GAAAmyG,EAAA,SAAAj6J,EAAAlL,GACA,MAAAuuK,IAAAlG,GAAAn9J,GAAAlL,KAkBA4iI,GAAA7sD,GAAAtyD,GAAA,GAwBA2xJ,GAAAjQ,EAAA,SAAAnlK,EAAAmuK,GACA,MAAAoF,IAAAvzK,GAAA,EAAAmuK,EAAArtK,OAAAd,EAAA,EAAAmuK,KA+CAkH,GAAAxM,GAAA,EAAA,SAAAlE,EAAA7vD,EAAA9+B,EAAApD,GACA,MAAAm/F,IAAApN,EAAA,kBAAA7vD,GAAA8vD,EAAA9vD,GAAAA,GAAA9+B,EAAApD,KAyBA0iG,GAAAlQ,EAAA,SAAA1C,EAAAmR,EAAAC,GACA,MAAApE,IAAAhN,EAAAN,EAAAyR,EAAAC,MA8BAyB,GAAApQ,EAAA,SAAAmL,EAAAC,GACA,MAAAF,IAAAliK,GAAAu9E,GAAA4kF,GAAAC,KAGAiF,GAAA,WACA,GAAAC,GAAA,SAAA9Q,GACA,OACA2N,oBAAA5N,EAAArgI,KACAmuI,sBAAA,SAAA7tK,GACA,MAAAggK,GAAA,uBAAAhgK,IAEA4tK,oBAAA,SAAA5tK,EAAAw9E,GACA,GAAA0/B,GAAA8iD,EAAA,qBAAAhgK,EAAAw9E,EACA,OAAA0/B,GAAA,wBAAA+gD,EAAA/gD,GAAAA,IAIA,OAAA,UAAA8iD,GACA,GAAA+Q,GAAAD,EAAA9Q,EACA,QACA2N,oBAAA5N,EAAArgI,KACAmuI,sBAAA,SAAA7tK,GACA,MAAA+wK,GAAA,uBAAA/wK,IAEA4tK,oBAAA,SAAA5tK,EAAAw9E,GACA,MAAA0oF,IAAA1oF,GAAA4vF,GAAA2D,EAAA/wK,EAAAw9E,GAAA4vF,GAAA2D,EAAA/wK,GAAAw9E,UAaAwzF,GAAA,SAAA/iG,EAAAvyE,EAAAmsC,GACA,GAAAopI,GAAA1K,CAEA,IAAA,kBAAAt4F,GAAA9uE,QACA,aAAAzD,IACA,IAAA,SACA,GAAA,IAAAA,EAAA,CAGA,IADAu1K,EAAA,EAAAv1K,EACAmsC,EAAAomC,EAAA9xE,QAAA,CAEA,GADAoqK,EAAAt4F,EAAApmC,GACA,IAAA0+H,GAAA,EAAAA,IAAA0K,EACA,MAAAppI,EAEAA,IAAA,EAEA,MAAA,GACA,GAAAnsC,IAAAA,EAAA,CAEA,KAAAmsC,EAAAomC,EAAA9xE,QAAA,CAEA,GADAoqK,EAAAt4F,EAAApmC,GACA,gBAAA0+H,IAAAA,IAAAA,EACA,MAAA1+H,EAEAA,IAAA,EAEA,MAAA,GAGA,MAAAomC,GAAA9uE,QAAAzD,EAAAmsC,EAEA,KAAA,SACA,IAAA,UACA,IAAA,WACA,IAAA,YACA,MAAAomC,GAAA9uE,QAAAzD,EAAAmsC,EACA,KAAA,SACA,GAAA,OAAAnsC,EAEA,MAAAuyE,GAAA9uE,QAAAzD,EAAAmsC,GAKA,KAAAA,EAAAomC,EAAA9xE,QAAA,CACA,GAAA4qF,GAAA9Y,EAAApmC,GAAAnsC,GACA,MAAAmsC,EAEAA,IAAA,EAEA,MAAA,IAGAqpI,GAAA1Q,EAAA,SAAA3kK,EAAAmkK,GACA,MAAAx2J,IAAA3N,EAAAg1K,GAAA7Q,MA4BAmR,GAAA5Q,EAAA,SAAA6Q,GACA,MAAAlN,IAAA9yF,GAAAnvE,GAAA,EAAAguK,GAAA,SAAAmB,IAAA,WAGA,IAFA,GAAAvpI,GAAA,EACA1D,EAAAitI,EAAAj1K,OACAgoC,EAAA0D,GAAA,CACA,IAAAupI,EAAAvpI,GAAAstC,MAAAhzE,KAAA0kD,WACA,OAAA,CAEAhf,IAAA,EAEA,OAAA,MAsBAwpI,GAAA9Q,EAAA,SAAAtyF,GAGA,IAFA,GAAA9pC,GAAA8pC,EAAA9xE,OACA0rC,EAAA,EACA1D,EAAA0D,GAAA,CACA,GAAAmpI,GAAA/iG,EAAAA,EAAApmC,GAAAA,EAAA,IAAA,EACA,OAAA,CAEAA,IAAA,EAEA,OAAA,IA2BAypI,GAAA/Q,EAAA,SAAA6Q,GACA,MAAAlN,IAAA9yF,GAAAnvE,GAAA,EAAAguK,GAAA,SAAAmB,IAAA,WAGA,IAFA,GAAAvpI,GAAA,EACA1D,EAAAitI,EAAAj1K,OACAgoC,EAAA0D,GAAA,CACA,GAAAupI,EAAAvpI,GAAAstC,MAAAhzE,KAAA0kD,WACA,OAAA,CAEAhf,IAAA,EAEA,OAAA,MAuBA0pI,GAAA/Q,EAAA,SAAAgR,EAAArhE,GACA,MAAA,kBAAAqhE,GAAAD,GAAAC,EAAAD,GAAAphE,GAAA,kBAAAqhE,GAAAtN,GAAArkK,KAAAoC,IAAAuvK,EAAAr1K,OAAAg0G,EAAAh0G,QAAA,WACA,MAAAq1K,GAAAr8F,MAAAhzE,KAAA0kD,WAAAspD,EAAAh7B,MAAAhzE,KAAA0kD,cAEAumH,GAAA,SAAA/7F,EAAAx1E,GACA,MAAA4hK,GAAApsF,EAAA7nE,GAAA3N,EAAAs0G,QACAqhE,KA2BAC,GAAAlR,EAAA,QAAAkR,IAAA9F,GAIA,MAHAA,GAAAniK,GAAA,SAAAtM,GACA,MAAA,kBAAAA,GAAAA,EAAAu0K,GAAAv0K,IACAyuK,GACAzH,GAAA9yF,GAAAnvE,GAAA,EAAAguK,GAAA,SAAA1xD,GAAAotD,KAAA,WACA,GAAAz7D,GAAArpD,SACA,OAAAr9C,IAAA,SAAA3N,GACA,MAAAs5E,IAAAt5E,EAAAq0G,IACAy7D,OAgCAzvK,GAAAyyK,GAAA,SAAAx+D,GACA,MAAAA,GAAAh7B,MAAAhzE,KAAAy9J,EAAA/4G,UAAA,MAsBAhZ,GAAA2yH,EAAAQ,EAAA,QAAAkQ,GAAA,SAAA/gE,EAAAuhE,GACA,MAAA,kBAAAA,GACA,WACA,MAAAA,GAAAx1K,KAAAiG,KAAAguG,EAAAh7B,MAAAhzE,KAAA0kD,YAAAsuB,MAAAhzE,KAAA0kD,YAGAomH,IAAA,GAAAzjK,GAAA2mG,EAAAuhE,OA6BAC,GAAApR,EAAA,SAAA0E,GACA,GAAA2M,GAAAxgG,GAAAnvE,GAAA,EAAAuH,GAAA,SAAAy+J,GACA,MAAAA,GAAA,GAAA9rK,QACA8oK,GACA,OAAAtI,GAAAiV,EAAA,WAEA,IADA,GAAA/pI,GAAA,EACAA,EAAAo9H,EAAA9oK,QAAA,CACA,GAAA8oK,EAAAp9H,GAAA,GAAAstC,MAAAhzE,KAAA0kD,WACA,MAAAo+G,GAAAp9H,GAAA,GAAAstC,MAAAhzE,KAAA0kD,UAEAhf,IAAA,OAiCAgqI,GAAArR,EAAA,SAAAnlK,EAAAy2K,GACA,GAAAz2K,EAAA,GACA,KAAA,IAAAS,OAAA,8CAEA,OAAA,KAAAT,EACA,WACA,MAAA,IAAAy2K,IAGAnD,GAAArH,GAAAjsK,EAAA,SAAA02K,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,OAAA3rH,UAAA1qD,QACA,IAAA,GACA,MAAA,IAAA21K,GAAAC,EACA,KAAA,GACA,MAAA,IAAAD,GAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAF,GAAAC,EAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAH,GAAAC,EAAAC,EAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAJ,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAL,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAN,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAP,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,KAAA,GACA,MAAA,IAAAR,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,KAAA,IACA,MAAA,IAAAT,GAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,SAiCAC,GAAAjS,EAAA,SAAAkS,EAAA34D,GACA,MAAAmqD,IAAA9yF,GAAAnvE,GAAA,EAAAguK,GAAA,SAAAl2D,IAAA,WACA,GAAA7J,GAAArpD,UACA+lF,EAAAzqI,IACA,OAAAuwK,GAAAv9F,MAAAy3D,EAAAsyB,EAAA,SAAA/uD,GACA,MAAAA,GAAAh7B,MAAAy3D,EAAA18B,IACA6J,QAyBA44D,GAAAtC,GAAA,SAAAh/F,EAAAuhG,GACA,MAAAvhG,GAAA,GACA,GAyBAwhG,GAAArS,EAAAQ,EAAA,kBAAAgB,EAAA,SAAAjE,EAAA9vF,GACA,GAAAjuE,MACA6nC,EAAA,EACA1D,EAAA8pC,EAAA9xE,MACA,IAAA,IAAAgoC,EAEA,IADAnkC,EAAA,GAAAiuE,EAAA,GACA9pC,EAAA0D,GACAk2H,EAAAz4F,GAAAtlE,GAAAiuE,EAAApmC,MACA7nC,EAAAA,EAAA7D,QAAA8xE,EAAApmC,IAEAA,GAAA,CAGA,OAAA7nC,MAoBA8yK,GAAArS,EAAA,SAAA5kK,EAAA4N,EAAAmqC,GACA,MAAAmzC,IAAAlrF,EAAA4N,GAAA5N,EAAA+3C,MAwBAm/H,GAAAtS,EAAA,SAAAnC,EAAA0U,EAAAC,GACA,MAAAlsF,IAAAisF,EAAA1U,GAAA2U,EAAA3U,MA2CA4U,GAAA1S,EAAAQ,EAAA,UAAAoN,GAAAiC,GAAA,SAAAh/F,EAAAk1F,GAKA,MAJA,OAAAl1F,IACAA,MAEAA,EAAAhyE,KAAAknK,GACAl1F,GACA,QAsBA8hG,GAAA9C,GAAA,SAAAh/F,EAAAuhG,GACA,MAAAA,IACA,MAqBAzzK,GAAAqhK,EAAA,SAAA37H,EAAA2kI,GACA,MAAA,kBAAAA,GAAArqK,SAAAs/J,EAAA+K,GAAAwH,GAAAxH,EAAA3kI,EAAA,GAAA2kI,EAAArqK,QAAA0lC,KAmBAuuI,GAAA7S,EAAA,SAAAxmD,GACA,MAAA04D,IAAApV,EAAAtjD,KA0BAiuD,GAAAxH,EAAA,SAAA1tC,EAAAC,GACA,MAAA,UAAAsgD,GACA,MAAA,UAAAxuI,GACA,MAAAr7B,IAAA,SAAAwc,GACA,MAAA+sG,GAAA/sG,EAAA6e,IACAwuI,EAAAvgD,EAAAjuF,SAyBAyuI,GAAA/S,EAAA,SAAAllK,GACA,MAAA2sK,IAAAN,GAAArsK,GAAA83D,GAAA93D,MAuBAk4K,GAAAhT,EAAA,SAAA7jK,GACA,MAAAsrK,IAAAhqJ,GAAAthB,GAAAqnK,GAAArnK,MAuBA82K,GAAAjT,EAAA,SAAAhtJ,GACA,MAAAy0J,IAAA1J,GAAA/qJ,GAAAuwJ,GAAAvwJ,MAoBAkgK,GAAAjT,EAAA,SAAAoR,EAAAzhE,GACA,GAAAujE,GAAAxP,GAAA0N,EAAAzhE,EACA,OAAA+zD,IAAA0N,EAAA,WACA,MAAAxE,IAAAmE,GAAA/nK,GAAAkqK,EAAA7sH,UAAA,IAAA+4G,EAAA/4G,UAAA,QAmBA8sH,GAAApT,EAAA,SAAAtyF,GACA,MAAAgwD,IAAAhwD,GAAAA,EAAA9xE,SAmBAy3K,GAAArT,EAAA,SAAAtyF,GACA,GAAA9pC,GAAA8pC,EAAA9xE,MACA,IAAA,IAAAgoC,EACA,MAAAyyE,IAEA,IAAAj3F,GAAA,EAAAwkB,EAAA,EACA0D,GAAA1D,EAAAxkB,GAAA,CACA,OAAAg0J,IAAA/T,EAAA3xF,GAAA9qE,KAAA,SAAAzH,EAAAmB,GACA,MAAAA,GAAAnB,EAAA,GAAAA,EAAAmB,EAAA,EAAA,IACAe,MAAAiqC,EAAAA,EAAAloB,MA0BAk0J,GAAAT,IACAjiK,GACA6f,KAyBAmgD,GAAA,WACA,GAAA,IAAAtqB,UAAA1qD,OACA,KAAA,IAAAL,OAAA,sCAEA,OAAA6gK,GAAA91G,UAAA,GAAA1qD,OAAAi1E,GAAAmuF,EAAA14G,UAAA,GAAA49G,GAAA59G,cAqBAitH,GAAA,WACA,GAAA,IAAAjtH,UAAA1qD,OACA,KAAA,IAAAL,OAAA,uCAEA,OAAA6gK,GAAA91G,UAAA,GAAA1qD,OAAAi1E,GAAAouF,EAAA34G,UAAA,GAAA49G,GAAA59G,cAkBAktH,GAAA3iG,GAAAqwD,GAAA,GA0BA1nF,GAAAymH,EAAA,SAAAptF,EAAA4gG,GACA,MAAA,kBAAAA,GAAAj6H,SAAAi6H,EAAAj6H,SAAAq5B,GAAAm8C,GAAA,SAAAl+C,EAAA5nE,GACA,MAAA8nK,IAAA/nK,GAAAk/J,GAAAj/J,GAAA4nE,IACA+B,MAAA4gG,KA6BAC,GAAAxT,EAAA,SAAArtF,EAAAv3E,EAAAm4K,GACA,MAAAj6H,IAAAq5B,EAAA5pE,GAAA3N,EAAAm4K,MAoBAE,GAAArmI,GAAA0wH,GAEA4V,GAAA,SAAAz4K,EAAAuyE,GACA,MAAA+iG,IAAA/iG,EAAAvyE,EAAA,IAAA,GAIA04K,GAAA,QAAAA,IAAA3qK,EAAA4qK,GACA,GAAAC,GAAA,SAAA1gI,GACA,GAAA41H,GAAA6K,EAAApvH,QAAAx7C,GACA,OAAA0qK,IAAAvgI,EAAA41H,GAAA,aAAA4K,GAAAxgI,EAAA41H,IAGA+K,EAAA,SAAA36J,EAAA6rC,GACA,MAAAy5G,GAAA,SAAA3rJ,GACA,MAAAksJ,GAAAlsJ,GAAA,KAAA+gK,EAAA16J,EAAArG,KACAkyC,EAAA7nD,QAAAuF,QAEA,QAAA07C,OAAA/8C,UAAAtD,SAAAtC,KAAAuN,IACA,IAAA,qBACA,MAAA,qCAAAy1J,EAAAoV,EAAA7qK,GAAAkxC,KAAA,MAAA,IACA,KAAA,iBACA,MAAA,IAAAukH,EAAAoV,EAAA7qK,GAAAw7C,OAAAsvH,EAAA9qK,EAAAunB,GAAA,SAAAzd,GACA,MAAA,QAAArK,KAAAqK,IACAkyC,GAAAh8C,MAAAkxC,KAAA,MAAA,GACA,KAAA,mBACA,MAAA,gBAAAlxC,GAAA,eAAA6qK,EAAA7qK,EAAAikH,WAAA,IAAAjkH,EAAAjL,UACA,KAAA,gBACA,MAAA,aAAAsW,MAAArL,EAAAikH,WAAA4mD,EAAA19D,KAAA6oD,EAAAI,EAAAp2J,KAAA,GACA,KAAA,gBACA,MAAA,MACA,KAAA,kBACA,MAAA,gBAAAA,GAAA,cAAA6qK,EAAA7qK,EAAAikH,WAAA,IAAA,EAAAjkH,MAAA8nE,EAAAA,GAAA,KAAA9nE,EAAAjL,SAAA,GACA,KAAA,kBACA,MAAA,gBAAAiL,GAAA,cAAA6qK,EAAA7qK,EAAAikH,WAAA,IAAA+xC,EAAAh2J,EACA,KAAA,qBACA,MAAA,WACA,SACA,GAAA,kBAAAA,GAAAjL,SAAA,CACA,GAAAg2K,GAAA/qK,EAAAjL,UACA,IAAA,oBAAAg2K,EACA,MAAAA,GAGA,MAAA,IAAAD,EAAA9qK,EAAAg8C,GAAAh8C,IAAAkxC,KAAA,MAAA,MAwBA85H,GAAA,WACA,GAAA,IAAA5tH,UAAA1qD,OACA,KAAA,IAAAL,OAAA,yCAEA,OAAAq1E,IAAAgE,MAAAhzE,KAAA4+B,GAAA8lB,aAoCA6tH,GAAA,WACA,MAAAD,IAAAt/F,MAAAhzE,KAAAumK,GAAAnD,GAAA/7J,GAAAqkC,GAAAgZ,cAqBA8tH,GAAA,WACA,GAAA,IAAA9tH,UAAA1qD,OACA,KAAA,IAAAL,OAAA,0CAEA,OAAAg4K,IAAA3+F,MAAAhzE,KAAA4+B,GAAA8lB,aA4BAmpD,GAAAuwD,EAAA,SAAAuR,GACA,MAAAD,IAAAC,EAAA31K,OAAA21K,KAsBAv/J,GAAAiuJ,EAAA2T,IAoBAS,GAAApU,EAAA,SAAAvgC,EAAAokC,GAIA,IAHA,GAAAv2F,MACAjmC,EAAA,EACAy8H,EAAArkC,EAAA9jI,OACAmoK,EAAAz8H,GACAssI,GAAAl0C,EAAAp4F,GAAAw8H,IAAA8P,GAAAl0C,EAAAp4F,GAAAimC,KACAA,EAAAA,EAAA3xE,QAAA8jI,EAAAp4F,IAEAA,GAAA,CAEA,OAAAimC,KAuBA+mG,GAAAtU,EAAAS,EAAA,cAAAgB,EAAAj7E,IAAA8rF,GAAA9rF,MAwBA+tF,GAAAvU,EAAA,SAAApwD,GACA,MAAAsjE,IAAAtjE,EAAAh0G,OAAAg0G,KAmBA4kE,GAAAvU,EAAA,SAAA/5C,EAAA7sG,GACA,GAAA5Z,KACA,KAAA,GAAAs+J,KAAA1kJ,GACAu6J,GAAA7V,EAAA73C,KACAzmH,EAAAs+J,GAAA1kJ,EAAA0kJ,GAGA,OAAAt+J,KAoCAg1K,GAAA,WACA,MAAAN,IAAAv/F,MAAAhzE,KAAA4+B,GAAA8lB,aAuCAroD,GAAA+hK,EAAA,SAAAv3D,GACA,MAAAorE,IAAAprE,QAsBAisE,GAAAzU,EAAA,SAAAgJ,EAAAv7F,GACA,MAAAj9C,IAAAg+I,GAAAmF,IAAA3K,GAAAv7F,KA2BAinG,GAAA,WACA,QAAAA,KAEA/yK,KAAAgzK,WAAA,kBAAAr8B,KAAA,GAAAA,KAAA,KACA32I,KAAAizK,UAqBA,QAAAC,GAAA9O,EAAA+O,EAAAhmJ,GACA,GACAimJ,GAAAC,EADA/uK,QAAA8/J,EAEA,QAAA9/J,GACA,IAAA,SACA,IAAA,SAEA,MAAA,KAAA8/J,GAAAj3I,EAAA8lJ,OAAA,OAAA,EAAA7O,MAAAh1F,EAAAA,GAOA,OAAAjiD,EAAA6lJ,WACAG,GACAC,EAAAjmJ,EAAA6lJ,WAAAniK,KACAsc,EAAA6lJ,WAAAr2J,IAAAynJ,GACAiP,EAAAlmJ,EAAA6lJ,WAAAniK,KACAwiK,EAAAD,GAEAjmJ,EAAA6lJ,WAAAljE,IAAAs0D,GAGA9/J,IAAA6oB,GAAA8lJ,OAMA7O,IAAAj3I,GAAA8lJ,OAAA3uK,IACA6uK,GAEAA,IACAhmJ,EAAA8lJ,OAAA3uK,GAAA8/J,IAAA,GAEA+O,IAXAA,IACAhmJ,EAAA8lJ,OAAA3uK,MACA6oB,EAAA8lJ,OAAA3uK,GAAA8/J,IAAA,GAEA+O,IArBAA,IACAhmJ,EAAA8lJ,OAAA,OAAA,GAEAE,EA4BA,KAAA,UAGA,GAAA7uK,IAAA6oB,GAAA8lJ,OAAA,CACA,GAAAK,GAAAlP,EAAA,EAAA,CACA,OAAAj3I,GAAA8lJ,OAAA3uK,GAAAgvK,IACAH,GAEAA,IACAhmJ,EAAA8lJ,OAAA3uK,GAAAgvK,IAAA,GAEAH,GAYA,MATAA,KACAhmJ,EAAA8lJ,OAAA3uK,GAAA8/J,IACA,GACA,KAEA,GACA,IAGA+O,CAEA,KAAA,WAEA,MAAA,QAAAhmJ,EAAA6lJ,WACAG,GACAC,EAAAjmJ,EAAA6lJ,WAAAniK,KACAsc,EAAA6lJ,WAAAr2J,IAAAynJ,GACAiP,EAAAlmJ,EAAA6lJ,WAAAniK,KACAwiK,EAAAD,GAEAjmJ,EAAA6lJ,WAAAljE,IAAAs0D,GAGA9/J,IAAA6oB,GAAA8lJ,OAMAjB,GAAA5N,EAAAj3I,EAAA8lJ,OAAA3uK,KAOA6uK,GANAA,GACAhmJ,EAAA8lJ,OAAA3uK,GAAApH,KAAAknK,GAEA+O,IATAA,IACAhmJ,EAAA8lJ,OAAA3uK,IAAA8/J,IAEA+O,EAUA,KAAA,YACA,MAAAhmJ,GAAA8lJ,OAAA3uK,IACA6uK,GAEAA,IACAhmJ,EAAA8lJ,OAAA3uK,IAAA,GAEA6uK,EAEA,KAAA,SACA,GAAA,OAAA/O,EACA,MAAAj3I,GAAA8lJ,OAAA,SAMAE,GALAA,IACAhmJ,EAAA8lJ,OAAA,SAAA,GAEAE,EAKA,SAIA,MADA7uK,GAAAo4C,OAAA/8C,UAAAtD,SAAAtC,KAAAqqK,GACA9/J,IAAA6oB,GAAA8lJ,OAOAjB,GAAA5N,EAAAj3I,EAAA8lJ,OAAA3uK,KAMA6uK,GALAA,GACAhmJ,EAAA8lJ,OAAA3uK,GAAApH,KAAAknK,GAEA+O,IAVAA,IACAhmJ,EAAA8lJ,OAAA3uK,IAAA8/J,IAEA+O,IAYA,MArJAJ,GAAApzK,UAAAgd,IAAA,SAAAynJ,GACA,MAAA8O,GAAA9O,GAAA,EAAApkK,OAEA+yK,EAAApzK,UAAAmwG,IAAA,SAAAs0D,GACA,MAAA8O,GAAA9O,GAAA,EAAApkK,OAiJA+yK,KA8BAQ,GAAAlV,EAAA,SAAA3kK,EAAAmoB,GACA,MAAA06I,GAAA7iK,GAAA,WACA,MAAAA,GAAAs5E,MAAAhzE,KAAA0kD,YAAA7iC,EAAAmxD,MAAAhzE,KAAA0kD,YACAiuH,GAAAnR,IAAA9nK,EAAAmoB,KA6BA2xJ,GAAAb,GAAArN,IA6BAmO,GAAApV,EAAA,SAAA3kK,EAAAmoB,GACA,MAAA06I,GAAA7iK,GAAA,WACA,MAAAA,GAAAs5E,MAAAhzE,KAAA0kD,YAAA7iC,EAAAmxD,MAAAhzE,KAAA0kD,YACAiuH,GAAA3uF,IAAAtqF,EAAAmoB,KA0BA6xJ,GAAArV,EAAA,SAAAoR,EAAAp2H,GACA,MAAA0oH,IAAA0N,EAAA,EAAA,WACA,GAAA/sI,GAAAgiB,UAAA+qH,EACA,IAAA,MAAA/sI,GAAA49C,GAAAwoB,SAAApmE,EAAA2W,IACA,MAAA3W,GAAA2W,GAAA25B,MAAAtwC,EAAA+6H,EAAA/4G,UAAA,EAAA+qH,GAEA,MAAA,IAAAv/G,WAAA7zD,GAAAqmC,GAAA,kCAAA2W,EAAA,SAuBAb,GAAAk7H,GAAA,EAAA,QA4BAC,GAAAvV,EAAA,SAAApwD,GACA,GAAA4lE,KACA,OAAApZ,GAAAxsD,EAAAh0G,OAAA,WACA,GAAAoU,GAAA/R,GAAAqoD,UAIA,OAHAw3G,GAAA9tJ,EAAAwlK,KACAA,EAAAxlK,GAAA4/F,EAAAh7B,MAAAhzE,KAAA0kD,YAEAkvH,EAAAxlK,OAwBA9H,GAAAotK,GAAA,EAAA,SAmBA3sK,GAAAs3J,EAAA,SAAAjD,EAAAj2C,GACA,IAAAy3C,EAAAxB,GACA,KAAA,IAAAlrG,WAAA,0EAAA7zD,GAAA++J,GAEA,OAAAD,GAAAC,GAAAr0J,KAAAo+G,KAkBA0uD,GAAAH,GAAA,EAAA,eAiBAI,GAAAJ,GAAA,EAAA,eAoBAK,GAAA1V,EAAA,SAAArwD,EAAAliC,GAKA,IAJA,GAGAkoG,GAAA5P,EAHAj3I,EAAA,GAAA4lJ,IACAl1K,KACA6nC,EAAA,EAEAA,EAAAomC,EAAA9xE,QACAoqK,EAAAt4F,EAAApmC,GACAsuI,EAAAhmE,EAAAo2D,GACAj3I,EAAAxQ,IAAAq3J,IACAn2K,EAAAX,KAAAknK,GAEA1+H,GAAA,CAEA,OAAA7nC,KAwBAilD,GAAA+pH,GAAA6G,GAAA,EAAA,WAoBAO,GAAA5V,EAAA,SAAA0O,EAAAC,GACA,MAAAlqH,IAAA2vH,GAAA1F,EAAAC,GAAAyF,GAAAzF,EAAAD,MAyBAmH,GAAA5V,EAAA,SAAA1C,EAAAmR,EAAAC,GACA,MAAAlqH,IAAAm/G,GAAArG,EAAAmR,EAAAC,GAAA/K,GAAArG,EAAAoR,EAAAD,MAoBAoH,GAAAJ,GAAA3Q,IAmBA9kK,GAAA+/J,EAAA,SAAA0O,EAAAC,GACA,GAAAC,GAAAC,CAQA,OAPAH,GAAA/yK,OAAAgzK,EAAAhzK,QACAizK,EAAAF,EACAG,EAAAF,IAEAC,EAAAD,EACAE,EAAAH,GAEAoH,GAAAtY,EAAAgR,GAAAmF,IAAA/E,GAAAC,MAoBA7uK,GAAAggK,EAAAiU,GAAA6B,GAAA7Y,IAEAl+G,IACA0wD,EAAAA,GACA9hF,EAAAA,GACAsuI,GAAAA,EACA39I,IAAAA,GACAyvJ,SAAAA,GACA/K,OAAAA,GACAvuI,IAAAA,GACAk8I,QAAAA,GACAE,QAAAA,GACA3N,OAAAA,GACAC,IAAAA,GACApC,IAAAA,GACA+P,QAAAA,GACAC,GAAAA,GACA3N,SAAAA,GACAC,OAAAA,GACA1uF,MAAAA,GACAs8F,UAAAA,GACA3N,MAAAA,GACAC,UAAAA,GACA0K,OAAAA,GACAhqK,KAAAA,GACAixK,KAAAA,GACAx5K,KAAAA,GACA2xC,MAAAA,GACAud,MAAAA,GACAsjH,MAAAA,GACAzK,WAAAA,GACA0R,WAAAA,GACAlB,QAAAA,GACAC,SAAAA,GACAC,SAAAA,GACA1vH,OAAAA,GACA0sH,KAAAA,GACA3hE,UAAAA,GACA6hE,WAAAA,GACAt/J,SAAAA,GACAkgK,SAAAA,GACAE,QAAAA,GACAhE,MAAAA,GACAzK,OAAAA,GACAC,IAAAA,GACA3kH,UAAAA,GACAo1H,WAAAA,GACAxQ,eAAAA,GACAG,OAAAA,GACAC,WAAAA,GACA9iC,OAAAA,GACAktC,KAAAA,GACAC,SAAAA,GACAC,cAAAA,GACA+F,YAAAA,GACAhC,gBAAAA,GACAnO,UAAAA,GACAkR,OAAAA,GACA/wC,MAAAA,GACAiuC,KAAAA,GACAC,QAAAA,GACAhsF,OAAAA,GACA49E,OAAAA,GACAxzJ,OAAAA,GACAq1C,KAAAA,GACA8qE,UAAAA,GACAwzC,SAAAA,GACAC,cAAAA,GACAzzF,QAAAA,GACA09F,KAAAA,GACAjxJ,QAAAA,GACAinJ,UAAAA,GACAkO,QAAAA,GACAhO,UAAAA,GACA3gD,GAAAA,GACA6gD,IAAAA,GACAnzD,IAAAA,GACAozD,MAAAA,GACAnnJ,KAAAA,GACAonJ,UAAAA,GACAC,SAAAA,GACAC,OAAAA,GACA34D,IAAAA,GACAsmE,QAAAA,GACAh0K,QAAAA,GACAugC,KAAAA,GACAkmI,OAAAA,GACAE,UAAAA,GACArlK,aAAAA,GACAwuK,iBAAAA,GACAjJ,YAAAA,GACAuJ,KAAAA,GACAC,OAAAA,GACAC,UAAAA,GACAoG,QAAAA,GACApzF,GAAAA,GACAyjF,YAAAA,GACAwJ,QAAAA,GACAvJ,MAAAA,GACAxrH,KAAAA,GACAy4H,KAAAA,GACA3tH,KAAAA,GACAkhH,OAAAA,GACArhG,KAAAA,GACAg/B,YAAAA,GACAnoG,OAAAA,GACA6rK,KAAAA,GACAsL,UAAAA,GACAC,SAAAA,GACAC,SAAAA,GACAsB,KAAAA,GACArB,MAAAA,GACAnvD,GAAAA,GACAsiD,IAAAA,GACAp9J,IAAAA,GACAq9J,SAAAA,GACAE,cAAAA,GACA4I,cAAAA,GACAz8H,MAAAA,GACA8zH,QAAAA,GACA/kK,IAAAA,GACAglK,MAAAA,GACA0M,KAAAA,GACAC,OAAAA,GACAkC,QAAAA,GACAvjG,MAAAA,GACA20F,SAAAA,GACA0I,UAAAA,GACAzI,aAAAA,GACArnK,IAAAA,GACAsnK,MAAAA,GACAC,OAAAA,GACA5lC,SAAAA,GACA6lC,KAAAA,GACAC,OAAAA,GACAC,KAAAA,GACAC,IAAAA,GACAC,IAAAA,GACAC,OAAAA,GACAC,MAAAA,GACAx0F,GAAAA,GACA2hG,KAAAA,GACAhZ,KAAAA,GACA51E,GAAAA,GACA2hF,KAAAA,GACAG,KAAAA,GACA4H,QAAAA,GACAC,aAAAA,GACA+D,UAAAA,GACA71J,KAAAA,GACA+xJ,OAAAA,GACA1H,OAAAA,GACAC,cAAAA,GACAvqG,KAAAA,GACAyqG,QAAAA,GACAC,OAAAA,GACAt3F,KAAAA,GACA6jG,MAAAA,GACAlB,MAAAA,GACA7D,MAAAA,GACAvH,QAAAA,GACAqL,QAAAA,GACA7D,QAAAA,GACA5R,KAAAA,GACA6R,OAAAA,GACAC,OAAAA,GACAzH,OAAAA,GACAC,cAAAA,GACA9yH,MAAAA,GACA+R,MAAAA,GACAupB,OAAAA,GACAi/F,SAAAA,GACA9gD,YAAAA,GACAu5C,QAAAA,GACA93I,OAAAA,GACA9P,OAAAA,GACAmtC,OAAAA,GACAnuD,QAAAA,GACA6gC,QAAAA,GACAkoI,KAAAA,GACAlvH,SAAAA,GACAzqB,IAAAA,GACA1xB,MAAAA,GACAuF,KAAAA,GACA+lK,OAAAA,GACAzgK,MAAAA,GACA0gK,QAAAA,GACAC,WAAAA,GACAC,UAAAA,GACAC,SAAAA,GACArrC,IAAAA,GACAm4C,oBAAAA,GACAC,wBAAAA,GACA5R,KAAAA,GACA8E,KAAAA,GACAkH,SAAAA,GACAhH,cAAAA,GACAC,UAAAA,GACAC,IAAAA,GACAzgK,KAAAA,GACA0gK,MAAAA,GACAoM,QAAAA,GACAnM,QAAAA,GACAC,UAAAA,GACAtrK,SAAAA,GACAy3K,QAAAA,GACAvF,UAAAA,GACA3G,UAAAA,GACAkK,SAAAA,GACAh7E,KAAAA,GACAqxE,SAAAA,GACA7jK,KAAAA,GACAgkK,QAAAA,GACAC,MAAAA,GACAC,SAAAA,GACAG,OAAAA,GACAtqK,MAAAA,GACAmwK,UAAAA,GACA2F,KAAAA,GACAJ,OAAAA,GACAnL,SAAAA,GACAC,OAAAA,GACAkJ,OAAAA,GACAhJ,MAAAA,GACA/3G,OAAAA,GACAg4G,QAAAA,GACA5sD,OAAAA,GACA+sD,SAAAA,GACA50J,KAAAA,GACA80J,KAAAA,GACAE,MAAAA,GACAkF,QAAAA,GACAqE,QAAAA,GACArlC,KAAAA,GACAi8B,MAAAA,GACAG,IAAAA,GACAE,OAAAA,GACAC,QAAAA,GAMA,iBAAAlwK,GACAI,EAAAJ,QAAAsjD,GACA,kBAAAorD,SAAAA,OAAA4rE,IACA5rE,OAAA,WAAA,MAAAprD,MAEAp9C,KAAAo9C,EAAAA,KAGArjD,KAAAiG,WlY2i/BMq0K,KAAK,SAAS76K,EAAQU,EAAOJ,IACnC,SAAWyuG,ImYjnwCX,SAAAA,GACA,YA2BA,SAAAklC,GAAA6mC,EAAAC,EAAA1jJ,EAAA2jJ,GAEA,GAAAC,GAAAF,GAAAA,EAAA50K,oBAAA+0K,GAAAH,EAAAG,EACAC,EAAAj4H,OAAA4X,OAAAmgH,EAAA90K,WACA8qI,EAAA,GAAAmqC,GAAAJ,MAMA,OAFAG,GAAAE,QAAAC,EAAAR,EAAAzjJ,EAAA45G,GAEAkqC,EAcA,QAAAxM,GAAAn6D,EAAAv2F,EAAAqoE,GACA,IACA,OAAAx7E,KAAA,SAAAw7E,IAAAkuB,EAAAj0G,KAAA0d,EAAAqoE,IACA,MAAAnmE,GACA,OAAArV,KAAA,QAAAw7E,IAAAnmE,IAiBA,QAAA+6J,MACA,QAAAK,MACA,QAAAC,MA4BA,QAAAC,GAAAt1K,IACA,OAAA,QAAA,UAAAic,QAAA,SAAAy9B,GACA15C,EAAA05C,GAAA,SAAAymC,GACA,MAAA9/E,MAAA60K,QAAAx7H,EAAAymC,MAoCA,QAAAo1F,GAAAP,GACA,QAAAjnE,GAAAr0D,EAAAymC,EAAAhmE,EAAA+U,GACA,GAAAjsB,GAAAulK,EAAAwM,EAAAt7H,GAAAs7H,EAAA70F,EACA,IAAA,UAAAl9E,EAAA0B,KAEA,CACA,GAAAzG,GAAA+E,EAAAk9E,IACA17E,EAAAvG,EAAAuG,KACA,OAAAA,IACA,gBAAAA,IACA+yI,EAAAp9I,KAAAqK,EAAA,WACAyT,QAAAiC,QAAA1V,EAAA+wK,SAAAr8J,KAAA,SAAA1U,GACAspG,EAAA,OAAAtpG,EAAA0V,EAAA+U,IACA,SAAAlV,GACA+zF,EAAA,QAAA/zF,EAAAG,EAAA+U,KAIAhX,QAAAiC,QAAA1V,GAAA0U,KAAA,SAAAs8J,GAgBAv3K,EAAAuG,MAAAgxK,EACAt7J,EAAAjc,IACAgxB,GAhCAA,EAAAjsB,EAAAk9E,KA0CA,QAAAu1F,GAAAh8H,EAAAymC,GACA,QAAAw1F,KACA,MAAA,IAAAz9J,SAAA,SAAAiC,EAAA+U,GACA6+E,EAAAr0D,EAAAymC,EAAAhmE,EAAA+U,KAIA,MAAA0mJ,GAaAA,EAAAA,EAAAz8J,KACAw8J,EAGAA,GACAA,IA/BA,gBAAA/sE,GAAAgY,SAAAhY,EAAAgY,QAAAE,SACA/S,EAAAnF,EAAAgY,QAAAE,OAAAn+G,KAAAorG,GAGA,IAAA6nE,EAgCAv1K,MAAA60K,QAAAQ,EAwBA,QAAAP,GAAAR,EAAAzjJ,EAAA45G,GACA,GAAA9rC,GAAA62E,CAEA,OAAA,UAAAn8H,EAAAymC,GACA,GAAA6e,IAAA82E,EACA,KAAA,IAAA97K,OAAA,+BAGA,IAAAglG,IAAA+2E,EAAA,CACA,GAAA,UAAAr8H,EACA,KAAAymC,EAKA,OAAA61F,KAMA,IAHAlrC,EAAApxF,OAAAA,EACAoxF,EAAA3qD,IAAAA,IAEA,CACA,GAAA81F,GAAAnrC,EAAAmrC,QACA,IAAAA,EAAA,CACA,GAAAC,GAAAC,EAAAF,EAAAnrC,EACA,IAAAorC,EAAA,CACA,GAAAA,IAAAE,EAAA,QACA,OAAAF,IAIA,GAAA,SAAAprC,EAAApxF,OAGAoxF,EAAAurC,KAAAvrC,EAAAwrC,MAAAxrC,EAAA3qD,QAEA,IAAA,UAAA2qD,EAAApxF,OAAA,CACA,GAAAslD,IAAA62E,EAEA,KADA72E,GAAA+2E,EACAjrC,EAAA3qD,GAGA2qD,GAAAyrC,kBAAAzrC,EAAA3qD,SAEA,WAAA2qD,EAAApxF,QACAoxF,EAAA0rC,OAAA,SAAA1rC,EAAA3qD,IAGA6e,GAAA82E,CAEA,IAAA7yK,GAAAulK,EAAAmM,EAAAzjJ,EAAA45G,EACA,IAAA,WAAA7nI,EAAA0B,KAAA,CAOA,GAJAq6F,EAAA8rC,EAAA95G,KACA+kJ,EACAU,EAEAxzK,EAAAk9E,MAAAi2F,EACA,QAGA,QACA3xK,MAAAxB,EAAAk9E,IACAnvD,KAAA85G,EAAA95G,MAGA,UAAA/tB,EAAA0B,OACAq6F,EAAA+2E,EAGAjrC,EAAApxF,OAAA,QACAoxF,EAAA3qD,IAAAl9E,EAAAk9E,OAUA,QAAAg2F,GAAAF,EAAAnrC,GACA,GAAApxF,GAAAu8H,EAAAp+J,SAAAizH,EAAApxF,OACA,IAAAA,IAAAl3C,EAAA,CAKA,GAFAsoI,EAAAmrC,SAAA,KAEA,UAAAnrC,EAAApxF,OAAA,CACA,GAAAu8H,EAAAp+J,SAAAo+J,YAGAnrC,EAAApxF,OAAA,SACAoxF,EAAA3qD,IAAA39E,EACA2zK,EAAAF,EAAAnrC,GAEA,UAAAA,EAAApxF,QAGA,MAAA08H,EAIAtrC,GAAApxF,OAAA,QACAoxF,EAAA3qD,IAAA,GAAA5vB,WACA,kDAGA,MAAA6lH,GAGA,GAAAnzK,GAAAulK,EAAA9uH,EAAAu8H,EAAAp+J,SAAAizH,EAAA3qD,IAEA,IAAA,UAAAl9E,EAAA0B,KAIA,MAHAmmI,GAAApxF,OAAA,QACAoxF,EAAA3qD,IAAAl9E,EAAAk9E,IACA2qD,EAAAmrC,SAAA,KACAG,CAGA,IAAAz5G,GAAA15D,EAAAk9E,GAEA,OAAAxjB,GAOAA,EAAA3rC,MAGA85G,EAAAmrC,EAAAS,YAAA/5G,EAAAl4D,MAGAqmI,EAAA/5G,KAAAklJ,EAAAU,QAQA,WAAA7rC,EAAApxF,SACAoxF,EAAApxF,OAAA,OACAoxF,EAAA3qD,IAAA39E,GAUAsoI,EAAAmrC,SAAA,KACAG,GANAz5G,GA3BAmuE,EAAApxF,OAAA,QACAoxF,EAAA3qD,IAAA,GAAA5vB,WAAA,oCACAu6E,EAAAmrC,SAAA,KACAG,GAoDA,QAAAQ,GAAAC,GACA,GAAApnE,IAAAqnE,OAAAD,EAAA,GAEA,KAAAA,KACApnE,EAAAsnE,SAAAF,EAAA,IAGA,IAAAA,KACApnE,EAAAunE,WAAAH,EAAA,GACApnE,EAAAwnE,SAAAJ,EAAA,IAGAx2K,KAAA62K,WAAA35K,KAAAkyG,GAGA,QAAA0nE,GAAA1nE,GACA,GAAAxsG,GAAAwsG,EAAA2nE,cACAn0K,GAAA0B,KAAA,eACA1B,GAAAk9E,IACAsvB,EAAA2nE,WAAAn0K,EAGA,QAAAgyK,GAAAJ,GAIAx0K,KAAA62K,aAAAJ,OAAA,SACAjC,EAAA54J,QAAA26J,EAAAv2K,MACAA,KAAAymB,OAAA,GA8BA,QAAA21F,GAAA1M,GACA,GAAAA,EAAA,CACA,GAAAsnE,GAAAtnE,EAAAunE,EACA,IAAAD,EACA,MAAAA,GAAAj9K,KAAA21G,EAGA,IAAA,kBAAAA,GAAAh/E,KACA,MAAAg/E,EAGA,KAAA/8F,MAAA+8F,EAAA11G,QAAA,CACA,GAAAP,GAAA,GAAAi3B,EAAA,QAAAA,KACA,OAAAj3B,EAAAi2G,EAAA11G,QACA,GAAAm9I,EAAAp9I,KAAA21G,EAAAj2G,GAGA,MAFAi3B,GAAAtsB,MAAAsrG,EAAAj2G,GACAi3B,EAAAC,MAAA,EACAD,CAOA,OAHAA,GAAAtsB,MAAAjC,EACAuuB,EAAAC,MAAA,EAEAD,EAGA,OAAAA,GAAAA,KAAAA,GAKA,OAAAA,KAAAilJ,GAIA,QAAAA,KACA,OAAAvxK,MAAAjC,EAAAwuB,MAAA,GAjgBA,GAEAxuB,GAFA+0K,EAAAx6H,OAAA/8C,UACAw3I,EAAA+/B,EAAAv6H,eAEA44E,EAAA,kBAAAh+G,QAAAA,UACA0/J,EAAA1hD,EAAA/9G,UAAA,aACA2/J,EAAA5hD,EAAA6hD,eAAA,kBACAC,EAAA9hD,EAAA+hD,aAAA,gBAEAC,EAAA,gBAAAr9K,GACAs9K,EAAAjvE,EAAAkvE,kBACA,IAAAD,EAQA,YAPAD,IAGAr9K,EAAAJ,QAAA09K,GASAA,GAAAjvE,EAAAkvE,mBAAAF,EAAAr9K,EAAAJ,WAcA09K,EAAA/pC,KAAAA,CAoBA,IAAA+nC,GAAA,iBACAY,EAAA,iBACAX,EAAA,YACAC,EAAA,YAIAK,KAYA96D,IACAA,GAAAg8D,GAAA,WACA,MAAAj3K,MAGA,IAAAomI,GAAA1pF,OAAAqsC,eACA2uF,EAAAtxC,GAAAA,EAAAA,EAAAhqB,OACAs7D,IACAA,IAAAR,GACA//B,EAAAp9I,KAAA29K,EAAAT,KAGAh8D,EAAAy8D,EAGA,IAAAC,GAAA3C,EAAAr1K,UACA+0K,EAAA/0K,UAAA+8C,OAAA4X,OAAA2mD,EACA85D,GAAAp1K,UAAAg4K,EAAAjgK,YAAAs9J,EACAA,EAAAt9J,YAAAq9J,EACAC,EAAAqC,GACAtC,EAAA6C,YAAA,oBAYAJ,EAAAK,oBAAA,SAAAC,GACA,GAAAC,GAAA,kBAAAD,IAAAA,EAAApgK,WACA,OAAAqgK,GACAA,IAAAhD,GAGA,uBAAAgD,EAAAH,aAAAG,EAAAj7K,OACA,GAGA06K,EAAA9hB,KAAA,SAAAoiB,GAUA,MATAp7H,QAAA2rC,eACA3rC,OAAA2rC,eAAAyvF,EAAA9C,IAEA8C,EAAAxvF,UAAA0sF,EACAqC,IAAAS,KACAA,EAAAT,GAAA,sBAGAS,EAAAn4K,UAAA+8C,OAAA4X,OAAAqjH,GACAG,GAOAN,EAAAQ,MAAA,SAAAl4F,GACA,OAAAq1F,QAAAr1F,IAkFAm1F,EAAAC,EAAAv1K,WACAu1K,EAAAv1K,UAAAw3K,GAAA,WACA,MAAAn3K,OAEAw3K,EAAAtC,cAAAA,EAKAsC,EAAAphI,MAAA,SAAAk+H,EAAAC,EAAA1jJ,EAAA2jJ,GACA,GAAArpE,GAAA,GAAA+pE,GACAznC,EAAA6mC,EAAAC,EAAA1jJ,EAAA2jJ,GAGA,OAAAgD,GAAAK,oBAAAtD,GACAppE,EACAA,EAAAz6E,OAAA5X,KAAA,SAAAjb,GACA,MAAAA,GAAA8yB,KAAA9yB,EAAAuG,MAAA+mG,EAAAz6E,UAsKAukJ,EAAA0C,GAEAA,EAAAN,GAAA,YAOAM,EAAAV,GAAA,WACA,MAAAj3K,OAGA23K,EAAAt7K,SAAA,WACA,MAAA,sBAkCAm7K,EAAAl0H,KAAA,SAAAvT,GACA,GAAAuT,KACA,KAAA,GAAAl1C,KAAA2hC,GACAuT,EAAApmD,KAAAkR,EAMA,OAJAk1C,GAAA1kB,UAIA,QAAAlO,KACA,KAAA4yB,EAAAtpD,QAAA,CACA,GAAAoU,GAAAk1C,EAAAunH,KACA,IAAAz8J,IAAA2hC,GAGA,MAFArf,GAAAtsB,MAAAgK,EACAsiB,EAAAC,MAAA,EACAD,EAQA,MADAA,GAAAC,MAAA,EACAD,IAsCA8mJ,EAAAp7D,OAAAA,EAMAw4D,EAAAj1K,WACA+X,YAAAk9J,EAEAnuJ,MAAA,SAAAwxJ,GAcA,GAbAj4K,KAAA6vG,KAAA,EACA7vG,KAAA0wB,KAAA,EAGA1wB,KAAAg2K,KAAAh2K,KAAAi2K,MAAA9zK,EACAnC,KAAA2wB,MAAA,EACA3wB,KAAA41K,SAAA,KAEA51K,KAAAq5C,OAAA,OACAr5C,KAAA8/E,IAAA39E,EAEAnC,KAAA62K,WAAAj7J,QAAAk7J,IAEAmB,EACA,IAAA,GAAAn7K,KAAAkD,MAEA,MAAAlD,EAAAw4E,OAAA,IACA6hE,EAAAp9I,KAAAiG,KAAAlD,KACA6V,OAAA7V,EAAArB,MAAA,MACAuE,KAAAlD,GAAAqF,IAMAwyC,KAAA,WACA30C,KAAA2wB,MAAA,CAEA,IAAAunJ,GAAAl4K,KAAA62K,WAAA,GACAsB,EAAAD,EAAAnB,UACA,IAAA,UAAAoB,EAAA7zK,KACA,KAAA6zK,GAAAr4F,GAGA,OAAA9/E,MAAAo4K,MAGAlC,kBAAA,SAAAmC,GAMA,QAAAC,GAAAlmJ,EAAAmmJ,GAYA,MAXA31K,GAAA0B,KAAA,QACA1B,EAAAk9E,IAAAu4F,EACA5tC,EAAA/5G,KAAA0B,EAEAmmJ,IAGA9tC,EAAApxF,OAAA,OACAoxF,EAAA3qD,IAAA39E,KAGAo2K,EAjBA,GAAAv4K,KAAA2wB,KACA,KAAA0nJ,EAmBA,KAAA,GAhBA5tC,GAAAzqI,KAgBAvG,EAAAuG,KAAA62K,WAAA78K,OAAA,EAAAP,GAAA,IAAAA,EAAA,CACA,GAAA21G,GAAApvG,KAAA62K,WAAAp9K,GACAmJ,EAAAwsG,EAAA2nE,UAEA,IAAA,SAAA3nE,EAAAqnE,OAIA,MAAA6B,GAAA,MAGA,IAAAlpE,EAAAqnE,QAAAz2K,KAAA6vG,KAAA,CACA,GAAA2oE,GAAArhC,EAAAp9I,KAAAq1G,EAAA,YACAqpE,EAAAthC,EAAAp9I,KAAAq1G,EAAA,aAEA,IAAAopE,GAAAC,EAAA,CACA,GAAAz4K,KAAA6vG,KAAAT,EAAAsnE,SACA,MAAA4B,GAAAlpE,EAAAsnE,UAAA,EACA,IAAA12K,KAAA6vG,KAAAT,EAAAunE,WACA,MAAA2B,GAAAlpE,EAAAunE,gBAGA,IAAA6B,GACA,GAAAx4K,KAAA6vG,KAAAT,EAAAsnE,SACA,MAAA4B,GAAAlpE,EAAAsnE,UAAA,OAGA,CAAA,IAAA+B,EAMA,KAAA,IAAA9+K,OAAA,yCALA,IAAAqG,KAAA6vG,KAAAT,EAAAunE,WACA,MAAA2B,GAAAlpE,EAAAunE,gBAUAR,OAAA,SAAA7xK,EAAAw7E,GACA,IAAA,GAAArmF,GAAAuG,KAAA62K,WAAA78K,OAAA,EAAAP,GAAA,IAAAA,EAAA,CACA,GAAA21G,GAAApvG,KAAA62K,WAAAp9K,EACA,IAAA21G,EAAAqnE,QAAAz2K,KAAA6vG,MACAsnC,EAAAp9I,KAAAq1G,EAAA,eACApvG,KAAA6vG,KAAAT,EAAAunE,WAAA,CACA,GAAA+B,GAAAtpE,CACA,QAIAspE,IACA,UAAAp0K,GACA,aAAAA,IACAo0K,EAAAjC,QAAA32F,GACAA,GAAA44F,EAAA/B,aAGA+B,EAAA,KAGA,IAAA91K,GAAA81K,EAAAA,EAAA3B,aAIA,OAHAn0K,GAAA0B,KAAAA,EACA1B,EAAAk9E,IAAAA,EAEA44F,GACA14K,KAAAq5C,OAAA,OACAr5C,KAAA0wB,KAAAgoJ,EAAA/B,WACAZ,GAGA/1K,KAAAw1I,SAAA5yI,IAGA4yI,SAAA,SAAA5yI,EAAAg0K,GACA,GAAA,UAAAh0K,EAAA0B,KACA,KAAA1B,GAAAk9E,GAcA,OAXA,UAAAl9E,EAAA0B,MACA,aAAA1B,EAAA0B,KACAtE,KAAA0wB,KAAA9tB,EAAAk9E,IACA,WAAAl9E,EAAA0B,MACAtE,KAAAo4K,KAAAp4K,KAAA8/E,IAAAl9E,EAAAk9E,IACA9/E,KAAAq5C,OAAA,SACAr5C,KAAA0wB,KAAA,OACA,WAAA9tB,EAAA0B,MAAAsyK,IACA52K,KAAA0wB,KAAAkmJ,GAGAb,GAGA4C,OAAA,SAAAhC,GACA,IAAA,GAAAl9K,GAAAuG,KAAA62K,WAAA78K,OAAA,EAAAP,GAAA,IAAAA,EAAA,CACA,GAAA21G,GAAApvG,KAAA62K,WAAAp9K,EACA,IAAA21G,EAAAunE,aAAAA,EAGA,MAFA32K,MAAAw1I,SAAApmC,EAAA2nE,WAAA3nE,EAAAwnE,UACAE,EAAA1nE,GACA2mE,IAKA1xC,QAAA,SAAAoyC,GACA,IAAA,GAAAh9K,GAAAuG,KAAA62K,WAAA78K,OAAA,EAAAP,GAAA,IAAAA,EAAA,CACA,GAAA21G,GAAApvG,KAAA62K,WAAAp9K,EACA,IAAA21G,EAAAqnE,SAAAA,EAAA,CACA,GAAA7zK,GAAAwsG,EAAA2nE,UACA,IAAA,UAAAn0K,EAAA0B,KAAA,CACA,GAAAs0K,GAAAh2K,EAAAk9E,GACAg3F,GAAA1nE,GAEA,MAAAwpE,IAMA,KAAA,IAAAj/K,OAAA,0BAGAk/K,cAAA,SAAAnpE,EAAA2mE,EAAAC,GAaA,MAZAt2K,MAAA41K,UACAp+J,SAAA4kG,EAAA1M,GACA2mE,WAAAA,EACAC,QAAAA,GAGA,SAAAt2K,KAAAq5C,SAGAr5C,KAAA8/E,IAAA39E,GAGA4zK,KAOA,gBAAAxtE,GAAAA,EACA,gBAAA/7E,QAAAA,OACA,gBAAAqE,MAAAA,KAAA7wB,QnY+nwCGjG,KAAKiG,KAAuB,mBAAXuoG,QAAyBA,OAAyB,mBAAT13E,MAAuBA,KAAyB,mBAAXrE,QAAyBA,qBAEhH","file":"dalliance-all.js","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o 0)\n bi += 65536;\n\n if (bi < minBlockIndex)\n minBlockIndex = bi;\n break;\n }\n }\n p += (nintv * 8);\n\n return {\n minBlockIndex: minBlockIndex,\n nbin: nbin,\n length: p - offset\n };\n}\n\n\nfunction makeBam(data, bai, indexChunks, callback, attempted) {\n // Do an initial probe on the BAM file to catch any mixed-content errors.\n data.slice(0, 10).fetch(function(header) {\n if (header) {\n return makeBam2(data, bai, indexChunks, callback, attempted);\n } else {\n return callback(null, \"Couldn't access BAM.\");\n }\n }, {timeout: 5000});\n}\n\nfunction makeBam2(data, bai, indexChunks, callback, attempted) {\n var bam = new BamFile();\n bam.data = data;\n bam.bai = bai;\n bam.indexChunks = indexChunks;\n\n var minBlockIndex = bam.indexChunks ? bam.indexChunks.minBlockIndex : 1000000000;\n\n // Fills out bam.chrToIndex and bam.indexToChr based on the first few bytes of the BAM.\n function parseBamHeader(r) {\n if (!r) {\n return callback(null, \"Couldn't access BAM\");\n }\n\n var unc = unbgzf(r, r.byteLength);\n var uncba = new Uint8Array(unc);\n\n var magic = readInt(uncba, 0);\n if (magic != BAM_MAGIC) {\n return callback(null, \"Not a BAM file, magic=0x\" + magic.toString(16));\n }\n var headLen = readInt(uncba, 4);\n var header = '';\n for (var i = 0; i < headLen; ++i) {\n header += String.fromCharCode(uncba[i + 8]);\n }\n\n var nRef = readInt(uncba, headLen + 8);\n var p = headLen + 12;\n\n bam.chrToIndex = {};\n bam.indexToChr = [];\n for (var i = 0; i < nRef; ++i) {\n var lName = readInt(uncba, p);\n var name = '';\n for (var j = 0; j < lName-1; ++j) {\n name += String.fromCharCode(uncba[p + 4 + j]);\n }\n var lRef = readInt(uncba, p + lName + 4);\n bam.chrToIndex[name] = i;\n if (name.indexOf('chr') == 0) {\n bam.chrToIndex[name.substring(3)] = i;\n } else {\n bam.chrToIndex['chr' + name] = i;\n }\n bam.indexToChr.push(name);\n\n p = p + 8 + lName;\n }\n\n if (bam.indices) {\n return callback(bam);\n }\n }\n\n function parseBai(header) {\n if (!header) {\n return \"Couldn't access BAI\";\n }\n\n var uncba = new Uint8Array(header);\n var baiMagic = readInt(uncba, 0);\n if (baiMagic != BAI_MAGIC) {\n return callback(null, 'Not a BAI file, magic=0x' + baiMagic.toString(16));\n }\n\n var nref = readInt(uncba, 4);\n\n bam.indices = [];\n\n var p = 8;\n for (var ref = 0; ref < nref; ++ref) {\n var blockStart = p;\n var o = _getBaiRefLength(uncba, blockStart);\n p += o.length;\n\n minBlockIndex = Math.min(o.minBlockIndex, minBlockIndex);\n\n var nbin = o.nbin;\n\n if (nbin > 0) {\n bam.indices[ref] = new Uint8Array(header, blockStart, p - blockStart);\n }\n }\n\n return true;\n }\n\n if (!bam.indexChunks) {\n bam.bai.fetch(function(header) { // Do we really need to fetch the whole thing? :-(\n var result = parseBai(header);\n if (result !== true) {\n if (bam.bai.url && typeof(attempted) === \"undefined\") {\n // Already attempted x.bam.bai not there so now trying x.bai\n bam.bai.url = bam.data.url.replace(new RegExp('.bam$'), '.bai');\n \n // True lets us know we are making a second attempt\n makeBam2(data, bam.bai, indexChunks, callback, true);\n }\n else {\n // We've attempted x.bam.bai & x.bai and nothing worked\n callback(null, result);\n }\n } else {\n bam.data.slice(0, minBlockIndex).fetch(parseBamHeader);\n }\n }); // Timeout on first request to catch Chrome mixed-content error.\n } else {\n var chunks = bam.indexChunks.chunks;\n bam.indices = []\n for (var i = 0; i < chunks.length; i++) {\n bam.indices[i] = null; // To be filled out lazily as needed\n }\n bam.data.slice(0, minBlockIndex).fetch(parseBamHeader);\n }\n}\n\n\n\nBamFile.prototype.blocksForRange = function(refId, min, max) {\n var index = this.indices[refId];\n if (!index) {\n return [];\n }\n\n var intBinsL = reg2bins(min, max);\n var intBins = [];\n for (var i = 0; i < intBinsL.length; ++i) {\n intBins[intBinsL[i]] = true;\n }\n var leafChunks = [], otherChunks = [];\n\n var nbin = readInt(index, 0);\n var p = 4;\n for (var b = 0; b < nbin; ++b) {\n var bin = readInt(index, p);\n var nchnk = readInt(index, p+4);\n// dlog('bin=' + bin + '; nchnk=' + nchnk);\n p += 8;\n if (intBins[bin]) {\n for (var c = 0; c < nchnk; ++c) {\n var cs = readVob(index, p);\n var ce = readVob(index, p + 8);\n (bin < 4681 ? otherChunks : leafChunks).push(new Chunk(cs, ce));\n p += 16;\n }\n } else {\n p += (nchnk * 16);\n }\n }\n // console.log('leafChunks = ' + JSON.stringify(leafChunks));\n // console.log('otherChunks = ' + JSON.stringify(otherChunks));\n\n var nintv = readInt(index, p);\n // console.log('nintv=' + nintv);\n var lowest = null;\n var minLin = Math.min(min>>14, nintv - 1), maxLin = Math.min(max>>14, nintv - 1);\n for (var i = minLin; i <= maxLin; ++i) {\n var lb = readVob(index, p + 4 + (i * 8));\n if (!lb) {\n continue;\n }\n if (!lowest || lb.block < lowest.block || (lb.block == lowest.block && lb.offset < lowest.offset)) {\n lowest = lb;\n }\n }\n // console.log('Lowest LB = ' + lowest);\n\n var prunedOtherChunks = [];\n if (lowest != null) {\n for (var i = 0; i < otherChunks.length; ++i) {\n var chnk = otherChunks[i];\n if (chnk.maxv.block > lowest.block || (chnk.maxv.block == lowest.block && chnk.maxv.offset >= lowest.offset)) {\n prunedOtherChunks.push(chnk);\n }\n }\n }\n // console.log('prunedOtherChunks = ' + JSON.stringify(prunedOtherChunks));\n otherChunks = prunedOtherChunks;\n\n var intChunks = [];\n for (var i = 0; i < otherChunks.length; ++i) {\n intChunks.push(otherChunks[i]);\n }\n for (var i = 0; i < leafChunks.length; ++i) {\n intChunks.push(leafChunks[i]);\n }\n\n intChunks.sort(function(c0, c1) {\n var dif = c0.minv.block - c1.minv.block;\n if (dif != 0) {\n return dif;\n } else {\n return c0.minv.offset - c1.minv.offset;\n }\n });\n var mergedChunks = [];\n if (intChunks.length > 0) {\n var cur = intChunks[0];\n for (var i = 1; i < intChunks.length; ++i) {\n var nc = intChunks[i];\n if (nc.minv.block == cur.maxv.block /* && nc.minv.offset == cur.maxv.offset */) { // no point splitting mid-block\n cur = new Chunk(cur.minv, nc.maxv);\n } else {\n mergedChunks.push(cur);\n cur = nc;\n }\n }\n mergedChunks.push(cur);\n }\n // console.log('mergedChunks = ' + JSON.stringify(mergedChunks));\n\n return mergedChunks;\n}\n\nBamFile.prototype.fetch = function(chr, min, max, callback, opts) {\n var thisB = this;\n opts = opts || {};\n\n var chrId = this.chrToIndex[chr];\n var chunks;\n if (chrId === undefined) {\n chunks = [];\n } else {\n // Fetch this portion of the BAI if it hasn't been loaded yet.\n if (this.indices[chrId] === null && this.indexChunks.chunks[chrId]) {\n var start_stop = this.indexChunks.chunks[chrId];\n return this.bai.slice(start_stop[0], start_stop[1]).fetch(function(data) {\n var buffer = new Uint8Array(data);\n this.indices[chrId] = buffer;\n return this.fetch(chr, min, max, callback, opts);\n }.bind(this));\n }\n\n chunks = this.blocksForRange(chrId, min, max);\n if (!chunks) {\n callback(null, 'Error in index fetch');\n }\n }\n \n var records = [];\n var index = 0;\n var data;\n\n function tramp() {\n if (index >= chunks.length) {\n return callback(records);\n } else if (!data) {\n var c = chunks[index];\n var fetchMin = c.minv.block;\n var fetchMax = c.maxv.block + (1<<16); // *sigh*\n // console.log('fetching ' + fetchMin + ':' + fetchMax);\n thisB.data.slice(fetchMin, fetchMax - fetchMin).fetch(function(r) {\n data = unbgzf(r, c.maxv.block - c.minv.block + 1);\n return tramp();\n });\n } else {\n var ba = new Uint8Array(data);\n var finished = thisB.readBamRecords(ba, chunks[index].minv.offset, records, min, max, chrId, opts);\n data = null;\n ++index;\n if (finished)\n return callback(records);\n else\n return tramp();\n }\n }\n tramp();\n}\n\nvar SEQRET_DECODER = ['=', 'A', 'C', 'x', 'G', 'x', 'x', 'x', 'T', 'x', 'x', 'x', 'x', 'x', 'x', 'N'];\nvar CIGAR_DECODER = ['M', 'I', 'D', 'N', 'S', 'H', 'P', '=', 'X', '?', '?', '?', '?', '?', '?', '?'];\n\nfunction BamRecord() {\n}\n\nBamFile.prototype.readBamRecords = function(ba, offset, sink, min, max, chrId, opts) {\n while (true) {\n var blockSize = readInt(ba, offset);\n var blockEnd = offset + blockSize + 4;\n if (blockEnd > ba.length) {\n return false;\n }\n\n var record = new BamRecord();\n\n var refID = readInt(ba, offset + 4);\n var pos = readInt(ba, offset + 8);\n \n var bmn = readInt(ba, offset + 12);\n var bin = (bmn & 0xffff0000) >> 16;\n var mq = (bmn & 0xff00) >> 8;\n var nl = bmn & 0xff;\n\n var flag_nc = readInt(ba, offset + 16);\n var flag = (flag_nc & 0xffff0000) >> 16;\n var nc = flag_nc & 0xffff;\n \n var lseq = readInt(ba, offset + 20);\n \n var nextRef = readInt(ba, offset + 24);\n var nextPos = readInt(ba, offset + 28);\n \n var tlen = readInt(ba, offset + 32);\n \n record.segment = this.indexToChr[refID];\n record.flag = flag;\n record.pos = pos;\n record.mq = mq;\n if (opts.light)\n record.seqLength = lseq;\n\n if (!opts.light || opts.includeName) {\n var readName = '';\n for (var j = 0; j < nl-1; ++j) {\n readName += String.fromCharCode(ba[offset + 36 + j]);\n }\n record.readName = readName;\n }\n \n if (!opts.light) {\n if (nextRef >= 0) {\n record.nextSegment = this.indexToChr[nextRef];\n record.nextPos = nextPos;\n }\n \n var p = offset + 36 + nl;\n\n var cigar = '';\n for (var c = 0; c < nc; ++c) {\n var cigop = readInt(ba, p);\n cigar = cigar + (cigop>>4) + CIGAR_DECODER[cigop & 0xf];\n p += 4;\n }\n record.cigar = cigar;\n \n var seq = '';\n var seqBytes = (lseq + 1) >> 1;\n for (var j = 0; j < seqBytes; ++j) {\n var sb = ba[p + j];\n seq += SEQRET_DECODER[(sb & 0xf0) >> 4];\n if (seq.length < lseq)\n seq += SEQRET_DECODER[(sb & 0x0f)];\n }\n p += seqBytes;\n record.seq = seq;\n\n var qseq = '';\n for (var j = 0; j < lseq; ++j) {\n qseq += String.fromCharCode(ba[p + j] + 33);\n }\n p += lseq;\n record.quals = qseq;\n\n while (p < blockEnd) {\n var tag = String.fromCharCode(ba[p], ba[p + 1]);\n var type = String.fromCharCode(ba[p + 2]);\n var value;\n\n if (type == 'A') {\n value = String.fromCharCode(ba[p + 3]);\n p += 4;\n } else if (type == 'i' || type == 'I') {\n value = readInt(ba, p + 3);\n p += 7;\n } else if (type == 'c' || type == 'C') {\n value = ba[p + 3];\n p += 4;\n } else if (type == 's' || type == 'S') {\n value = readShort(ba, p + 3);\n p += 5;\n } else if (type == 'f') {\n value = readFloat(ba, p + 3);\n p += 7;\n } else if (type == 'Z' || type == 'H') {\n p += 3;\n value = '';\n for (;;) {\n var cc = ba[p++];\n if (cc == 0) {\n break;\n } else {\n value += String.fromCharCode(cc);\n }\n }\n } else if (type == 'B') {\n var atype = String.fromCharCode(ba[p + 3]);\n var alen = readInt(ba, p + 4);\n var elen;\n var reader;\n if (atype == 'i' || atype == 'I' || atype == 'f') {\n elen = 4;\n if (atype == 'f')\n reader = readFloat;\n else\n reader = readInt;\n } else if (atype == 's' || atype == 'S') {\n elen = 2;\n reader = readShort;\n } else if (atype == 'c' || atype == 'C') {\n elen = 1;\n reader = readByte;\n } else {\n throw 'Unknown array type ' + atype;\n }\n\n p += 8;\n value = [];\n for (var i = 0; i < alen; ++i) {\n value.push(reader(ba, p));\n p += elen;\n }\n } else {\n throw 'Unknown type '+ type;\n }\n record[tag] = value;\n }\n }\n\n if (!min || record.pos <= max && record.pos + lseq >= min) {\n if (chrId === undefined || refID == chrId) {\n sink.push(record);\n }\n }\n if (record.pos > max) {\n return true;\n }\n offset = blockEnd;\n }\n\n // Exits via top of loop.\n};\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n makeBam: makeBam,\n BAM_MAGIC: BAM_MAGIC,\n BAI_MAGIC: BAI_MAGIC,\n BamFlags: BamFlags\n };\n}\n","(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o 0) bi += 65536;\n\n if (bi < minBlockIndex) minBlockIndex = bi;\n break;\n }\n }\n p += nintv * 8;\n\n return {\n minBlockIndex: minBlockIndex,\n nbin: nbin,\n length: p - offset\n };\n}\n\nfunction makeBam(data, bai, indexChunks, callback, attempted) {\n // Do an initial probe on the BAM file to catch any mixed-content errors.\n data.slice(0, 10).fetch(function (header) {\n if (header) {\n return makeBam2(data, bai, indexChunks, callback, attempted);\n } else {\n return callback(null, \"Couldn't access BAM.\");\n }\n }, { timeout: 5000 });\n}\n\nfunction makeBam2(data, bai, indexChunks, callback, attempted) {\n var bam = new BamFile();\n bam.data = data;\n bam.bai = bai;\n bam.indexChunks = indexChunks;\n\n var minBlockIndex = bam.indexChunks ? bam.indexChunks.minBlockIndex : 1000000000;\n\n // Fills out bam.chrToIndex and bam.indexToChr based on the first few bytes of the BAM.\n function parseBamHeader(r) {\n if (!r) {\n return callback(null, \"Couldn't access BAM\");\n }\n\n var unc = unbgzf(r, r.byteLength);\n var uncba = new Uint8Array(unc);\n\n var magic = readInt(uncba, 0);\n if (magic != BAM_MAGIC) {\n return callback(null, \"Not a BAM file, magic=0x\" + magic.toString(16));\n }\n var headLen = readInt(uncba, 4);\n var header = '';\n for (var i = 0; i < headLen; ++i) {\n header += String.fromCharCode(uncba[i + 8]);\n }\n\n var nRef = readInt(uncba, headLen + 8);\n var p = headLen + 12;\n\n bam.chrToIndex = {};\n bam.indexToChr = [];\n for (var i = 0; i < nRef; ++i) {\n var lName = readInt(uncba, p);\n var name = '';\n for (var j = 0; j < lName - 1; ++j) {\n name += String.fromCharCode(uncba[p + 4 + j]);\n }\n var lRef = readInt(uncba, p + lName + 4);\n bam.chrToIndex[name] = i;\n if (name.indexOf('chr') == 0) {\n bam.chrToIndex[name.substring(3)] = i;\n } else {\n bam.chrToIndex['chr' + name] = i;\n }\n bam.indexToChr.push(name);\n\n p = p + 8 + lName;\n }\n\n if (bam.indices) {\n return callback(bam);\n }\n }\n\n function parseBai(header) {\n if (!header) {\n return \"Couldn't access BAI\";\n }\n\n var uncba = new Uint8Array(header);\n var baiMagic = readInt(uncba, 0);\n if (baiMagic != BAI_MAGIC) {\n return callback(null, 'Not a BAI file, magic=0x' + baiMagic.toString(16));\n }\n\n var nref = readInt(uncba, 4);\n\n bam.indices = [];\n\n var p = 8;\n for (var ref = 0; ref < nref; ++ref) {\n var blockStart = p;\n var o = _getBaiRefLength(uncba, blockStart);\n p += o.length;\n\n minBlockIndex = Math.min(o.minBlockIndex, minBlockIndex);\n\n var nbin = o.nbin;\n\n if (nbin > 0) {\n bam.indices[ref] = new Uint8Array(header, blockStart, p - blockStart);\n }\n }\n\n return true;\n }\n\n if (!bam.indexChunks) {\n bam.bai.fetch(function (header) {\n // Do we really need to fetch the whole thing? :-(\n var result = parseBai(header);\n if (result !== true) {\n if (bam.bai.url && typeof attempted === \"undefined\") {\n // Already attempted x.bam.bai not there so now trying x.bai\n bam.bai.url = bam.data.url.replace(new RegExp('.bam$'), '.bai');\n\n // True lets us know we are making a second attempt\n makeBam2(data, bam.bai, indexChunks, callback, true);\n } else {\n // We've attempted x.bam.bai & x.bai and nothing worked\n callback(null, result);\n }\n } else {\n bam.data.slice(0, minBlockIndex).fetch(parseBamHeader);\n }\n }); // Timeout on first request to catch Chrome mixed-content error.\n } else {\n var chunks = bam.indexChunks.chunks;\n bam.indices = [];\n for (var i = 0; i < chunks.length; i++) {\n bam.indices[i] = null; // To be filled out lazily as needed\n }\n bam.data.slice(0, minBlockIndex).fetch(parseBamHeader);\n }\n}\n\nBamFile.prototype.blocksForRange = function (refId, min, max) {\n var index = this.indices[refId];\n if (!index) {\n return [];\n }\n\n var intBinsL = reg2bins(min, max);\n var intBins = [];\n for (var i = 0; i < intBinsL.length; ++i) {\n intBins[intBinsL[i]] = true;\n }\n var leafChunks = [],\n otherChunks = [];\n\n var nbin = readInt(index, 0);\n var p = 4;\n for (var b = 0; b < nbin; ++b) {\n var bin = readInt(index, p);\n var nchnk = readInt(index, p + 4);\n // dlog('bin=' + bin + '; nchnk=' + nchnk);\n p += 8;\n if (intBins[bin]) {\n for (var c = 0; c < nchnk; ++c) {\n var cs = readVob(index, p);\n var ce = readVob(index, p + 8);\n (bin < 4681 ? otherChunks : leafChunks).push(new Chunk(cs, ce));\n p += 16;\n }\n } else {\n p += nchnk * 16;\n }\n }\n // console.log('leafChunks = ' + JSON.stringify(leafChunks));\n // console.log('otherChunks = ' + JSON.stringify(otherChunks));\n\n var nintv = readInt(index, p);\n // console.log('nintv=' + nintv);\n var lowest = null;\n var minLin = Math.min(min >> 14, nintv - 1),\n maxLin = Math.min(max >> 14, nintv - 1);\n for (var i = minLin; i <= maxLin; ++i) {\n var lb = readVob(index, p + 4 + i * 8);\n if (!lb) {\n continue;\n }\n if (!lowest || lb.block < lowest.block || lb.block == lowest.block && lb.offset < lowest.offset) {\n lowest = lb;\n }\n }\n // console.log('Lowest LB = ' + lowest);\n\n var prunedOtherChunks = [];\n if (lowest != null) {\n for (var i = 0; i < otherChunks.length; ++i) {\n var chnk = otherChunks[i];\n if (chnk.maxv.block > lowest.block || chnk.maxv.block == lowest.block && chnk.maxv.offset >= lowest.offset) {\n prunedOtherChunks.push(chnk);\n }\n }\n }\n // console.log('prunedOtherChunks = ' + JSON.stringify(prunedOtherChunks));\n otherChunks = prunedOtherChunks;\n\n var intChunks = [];\n for (var i = 0; i < otherChunks.length; ++i) {\n intChunks.push(otherChunks[i]);\n }\n for (var i = 0; i < leafChunks.length; ++i) {\n intChunks.push(leafChunks[i]);\n }\n\n intChunks.sort(function (c0, c1) {\n var dif = c0.minv.block - c1.minv.block;\n if (dif != 0) {\n return dif;\n } else {\n return c0.minv.offset - c1.minv.offset;\n }\n });\n var mergedChunks = [];\n if (intChunks.length > 0) {\n var cur = intChunks[0];\n for (var i = 1; i < intChunks.length; ++i) {\n var nc = intChunks[i];\n if (nc.minv.block == cur.maxv.block /* && nc.minv.offset == cur.maxv.offset */) {\n // no point splitting mid-block\n cur = new Chunk(cur.minv, nc.maxv);\n } else {\n mergedChunks.push(cur);\n cur = nc;\n }\n }\n mergedChunks.push(cur);\n }\n // console.log('mergedChunks = ' + JSON.stringify(mergedChunks));\n\n return mergedChunks;\n};\n\nBamFile.prototype.fetch = function (chr, min, max, callback, opts) {\n var thisB = this;\n opts = opts || {};\n\n var chrId = this.chrToIndex[chr];\n var chunks;\n if (chrId === undefined) {\n chunks = [];\n } else {\n // Fetch this portion of the BAI if it hasn't been loaded yet.\n if (this.indices[chrId] === null && this.indexChunks.chunks[chrId]) {\n var start_stop = this.indexChunks.chunks[chrId];\n return this.bai.slice(start_stop[0], start_stop[1]).fetch(function (data) {\n var buffer = new Uint8Array(data);\n this.indices[chrId] = buffer;\n return this.fetch(chr, min, max, callback, opts);\n }.bind(this));\n }\n\n chunks = this.blocksForRange(chrId, min, max);\n if (!chunks) {\n callback(null, 'Error in index fetch');\n }\n }\n\n var records = [];\n var index = 0;\n var data;\n\n function tramp() {\n if (index >= chunks.length) {\n return callback(records);\n } else if (!data) {\n var c = chunks[index];\n var fetchMin = c.minv.block;\n var fetchMax = c.maxv.block + (1 << 16); // *sigh*\n // console.log('fetching ' + fetchMin + ':' + fetchMax);\n thisB.data.slice(fetchMin, fetchMax - fetchMin).fetch(function (r) {\n data = unbgzf(r, c.maxv.block - c.minv.block + 1);\n return tramp();\n });\n } else {\n var ba = new Uint8Array(data);\n var finished = thisB.readBamRecords(ba, chunks[index].minv.offset, records, min, max, chrId, opts);\n data = null;\n ++index;\n if (finished) return callback(records);else return tramp();\n }\n }\n tramp();\n};\n\nvar SEQRET_DECODER = ['=', 'A', 'C', 'x', 'G', 'x', 'x', 'x', 'T', 'x', 'x', 'x', 'x', 'x', 'x', 'N'];\nvar CIGAR_DECODER = ['M', 'I', 'D', 'N', 'S', 'H', 'P', '=', 'X', '?', '?', '?', '?', '?', '?', '?'];\n\nfunction BamRecord() {}\n\nBamFile.prototype.readBamRecords = function (ba, offset, sink, min, max, chrId, opts) {\n while (true) {\n var blockSize = readInt(ba, offset);\n var blockEnd = offset + blockSize + 4;\n if (blockEnd > ba.length) {\n return false;\n }\n\n var record = new BamRecord();\n\n var refID = readInt(ba, offset + 4);\n var pos = readInt(ba, offset + 8);\n\n var bmn = readInt(ba, offset + 12);\n var bin = (bmn & 0xffff0000) >> 16;\n var mq = (bmn & 0xff00) >> 8;\n var nl = bmn & 0xff;\n\n var flag_nc = readInt(ba, offset + 16);\n var flag = (flag_nc & 0xffff0000) >> 16;\n var nc = flag_nc & 0xffff;\n\n var lseq = readInt(ba, offset + 20);\n\n var nextRef = readInt(ba, offset + 24);\n var nextPos = readInt(ba, offset + 28);\n\n var tlen = readInt(ba, offset + 32);\n\n record.segment = this.indexToChr[refID];\n record.flag = flag;\n record.pos = pos;\n record.mq = mq;\n if (opts.light) record.seqLength = lseq;\n\n if (!opts.light || opts.includeName) {\n var readName = '';\n for (var j = 0; j < nl - 1; ++j) {\n readName += String.fromCharCode(ba[offset + 36 + j]);\n }\n record.readName = readName;\n }\n\n if (!opts.light) {\n if (nextRef >= 0) {\n record.nextSegment = this.indexToChr[nextRef];\n record.nextPos = nextPos;\n }\n\n var p = offset + 36 + nl;\n\n var cigar = '';\n for (var c = 0; c < nc; ++c) {\n var cigop = readInt(ba, p);\n cigar = cigar + (cigop >> 4) + CIGAR_DECODER[cigop & 0xf];\n p += 4;\n }\n record.cigar = cigar;\n\n var seq = '';\n var seqBytes = lseq + 1 >> 1;\n for (var j = 0; j < seqBytes; ++j) {\n var sb = ba[p + j];\n seq += SEQRET_DECODER[(sb & 0xf0) >> 4];\n if (seq.length < lseq) seq += SEQRET_DECODER[sb & 0x0f];\n }\n p += seqBytes;\n record.seq = seq;\n\n var qseq = '';\n for (var j = 0; j < lseq; ++j) {\n qseq += String.fromCharCode(ba[p + j] + 33);\n }\n p += lseq;\n record.quals = qseq;\n\n while (p < blockEnd) {\n var tag = String.fromCharCode(ba[p], ba[p + 1]);\n var type = String.fromCharCode(ba[p + 2]);\n var value;\n\n if (type == 'A') {\n value = String.fromCharCode(ba[p + 3]);\n p += 4;\n } else if (type == 'i' || type == 'I') {\n value = readInt(ba, p + 3);\n p += 7;\n } else if (type == 'c' || type == 'C') {\n value = ba[p + 3];\n p += 4;\n } else if (type == 's' || type == 'S') {\n value = readShort(ba, p + 3);\n p += 5;\n } else if (type == 'f') {\n value = readFloat(ba, p + 3);\n p += 7;\n } else if (type == 'Z' || type == 'H') {\n p += 3;\n value = '';\n for (;;) {\n var cc = ba[p++];\n if (cc == 0) {\n break;\n } else {\n value += String.fromCharCode(cc);\n }\n }\n } else if (type == 'B') {\n var atype = String.fromCharCode(ba[p + 3]);\n var alen = readInt(ba, p + 4);\n var elen;\n var reader;\n if (atype == 'i' || atype == 'I' || atype == 'f') {\n elen = 4;\n if (atype == 'f') reader = readFloat;else reader = readInt;\n } else if (atype == 's' || atype == 'S') {\n elen = 2;\n reader = readShort;\n } else if (atype == 'c' || atype == 'C') {\n elen = 1;\n reader = readByte;\n } else {\n throw 'Unknown array type ' + atype;\n }\n\n p += 8;\n value = [];\n for (var i = 0; i < alen; ++i) {\n value.push(reader(ba, p));\n p += elen;\n }\n } else {\n throw 'Unknown type ' + type;\n }\n record[tag] = value;\n }\n }\n\n if (!min || record.pos <= max && record.pos + lseq >= min) {\n if (chrId === undefined || refID == chrId) {\n sink.push(record);\n }\n }\n if (record.pos > max) {\n return true;\n }\n offset = blockEnd;\n }\n\n // Exits via top of loop.\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n makeBam: makeBam,\n BAM_MAGIC: BAM_MAGIC,\n BAI_MAGIC: BAI_MAGIC,\n BamFlags: BamFlags\n };\n}\n\n},{\"./bin\":4,\"./lh3utils\":26,\"./spans\":41}],2:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// bedwig.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var sa = require('./sourceadapters');\n var dalliance_registerParserFactory = sa.registerParserFactory;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n}\n\nfunction BedWigParser(type) {\n this.type = type;\n}\n\nBedWigParser.prototype.createSession = function (sink) {\n if (this.type == 'wig') return new WigParseSession(this, sink);else return new BedParseSession(this, sink);\n};\n\nvar __KV_REGEXP = /([^=]+)=(.+)/;\nvar __SPACE_REGEXP = /\\s/;\nvar BED_COLOR_REGEXP = new RegExp(\"^[0-9]+,[0-9]+,[0-9]+\");\n\nfunction BedParseSession(parser, sink) {\n this.parser = parser;\n this.sink = sink;\n}\n\nBedParseSession.prototype.parse = function (line) {\n var toks = line.split(__SPACE_REGEXP);\n if (toks.length < 3) return;\n\n var start = parseInt(toks[1]) + 1;\n var end = parseInt(toks[2]);\n\n var f = { segment: toks[0],\n min: start,\n max: end };\n\n if (toks.length > 3 && toks[3] !== '.') {\n f.label = toks[3];\n }\n\n if (toks.length > 4) {\n f.score = parseFloat(toks[4]);\n }\n\n if (toks.length > 5) {\n f.orientation = toks[5];\n }\n\n if (toks.length > 8) {\n var color = toks[8];\n if (BED_COLOR_REGEXP.test(color)) {\n f.itemRgb = 'rgb(' + color + ')';\n }\n }\n\n if (toks.length >= 12) {\n var thickStart = parseInt(toks[6]);\n var thickEnd = parseInt(toks[7]);\n var blockCount = parseInt(toks[9]);\n var blockSizes = toks[10].split(',').map(function (x) {\n return parseInt(x);\n });\n var blockStarts = toks[11].split(',').map(function (x) {\n return parseInt(x);\n });\n\n f.type = 'transcript';\n var grp = new DASGroup();\n grp.id = toks[3];\n grp.type = 'transcript';\n grp.notes = [];\n f.groups = [grp];\n\n if (toks.length > 12) {\n var geneId = toks[12];\n var geneName = geneId;\n if (toks.length > 13) {\n geneName = toks[13];\n }\n var gg = new DASGroup();\n gg.id = geneId;\n gg.label = geneName;\n gg.type = 'gene';\n f.groups.push(gg);\n }\n\n var spans = null;\n for (var b = 0; b < blockCount; ++b) {\n var bmin = blockStarts[b] + start;\n var bmax = bmin + blockSizes[b];\n var span = new Range(bmin, bmax);\n if (spans) {\n spans = union(spans, span);\n } else {\n spans = span;\n }\n }\n\n var tsList = spans.ranges();\n for (var s = 0; s < tsList.length; ++s) {\n var ts = tsList[s];\n var bf = shallowCopy(f);\n bf.min = ts.min();\n bf.max = ts.max();\n this.sink(bf);\n }\n\n if (thickEnd > thickStart) {\n var codingRegion = f.orientation == '+' ? new Range(thickStart, thickEnd + 3) : new Range(thickStart - 3, thickEnd);\n // +/- 3 to account for stop codon\n\n var tl = intersection(spans, codingRegion);\n if (tl) {\n f.type = 'translation';\n var tlList = tl.ranges();\n var readingFrame = 0;\n for (var s = 0; s < tlList.length; ++s) {\n // Record reading frame for every exon\n var index = s;\n if (f.orientation == '-') index = tlList.length - s - 1;\n var ts = tlList[index];\n var bf = shallowCopy(f);\n bf.min = ts.min();\n bf.max = ts.max();\n f.readframe = readingFrame;\n var length = ts.max() - ts.min();\n readingFrame = (readingFrame + length) % 3;\n this.sink(bf);\n }\n }\n }\n } else {\n this.sink(f);\n }\n};\n\nBedParseSession.prototype.flush = function () {};\n\nfunction WigParseSession(parser, sink) {\n this.parser = parser;\n this.sink = sink;\n this.wigState = null;\n}\n\nWigParseSession.prototype.parse = function (line) {\n var toks = line.split(__SPACE_REGEXP);\n\n if (toks[0] == 'fixedStep') {\n this.wigState = 'fixedStep';\n this.chr = this.pos = this.step = null;\n this.span = 1;\n\n for (var ti = 1; ti < toks.length; ++ti) {\n var m = __KV_REGEXP.exec(toks[ti]);\n if (m) {\n if (m[1] == 'chrom') {\n this.chr = m[2];\n } else if (m[1] == 'start') {\n this.pos = parseInt(m[2]);\n } else if (m[1] == 'step') {\n this.step = parseInt(m[2]);\n } else if (m[1] == 'span') {\n this.span = parseInt(m[2]);\n }\n }\n }\n } else if (toks[0] == 'variableStep') {\n this.wigState = 'variableStep';\n this.chr = null;\n this.span = 1;\n\n for (var ti = 1; ti < toks.length; ++ti) {\n var m = __KV_REGEXP.exec(toks[ti]);\n if (m[1] == 'chrom') {\n this.chr = m[2];\n } else if (m[1] == 'span') {\n this.span = parseInt(m[2]);\n }\n }\n } else {\n if (!this.wigState) {\n if (toks.length < 4) return;\n\n var f = { segment: toks[0],\n min: parseInt(toks[1]) + 1,\n max: parseInt(toks[2]),\n score: parseFloat(toks[3]) };\n\n this.sink(f);\n } else if (this.wigState == 'fixedStep') {\n if (toks.length != 1) return;\n var score = parseFloat(toks[0]);\n var f = { segment: this.chr, min: this.pos, max: this.pos + this.span - 1, score: score };\n this.pos += this.step;\n this.sink(f);\n } else if (this.wigState == 'variableStep') {\n if (toks.length != 2) return;\n var pos = parseInt(toks[0]);\n var score = parseFloat(toks[1]);\n var f = { segment: this.chr, min: pos, max: pos + this.span - 1, score: score };\n this.sink(f);\n }\n }\n};\n\nWigParseSession.prototype.flush = function () {};\n\nBedWigParser.prototype.getStyleSheet = function (callback) {\n var thisB = this;\n var stylesheet = new DASStylesheet();\n\n if (this.type == 'wig') {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'HISTOGRAM';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n } else {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'red';\n wigStyle.HEIGHT = 10;\n wigStyle.BUMP = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'translation' }, null, wigStyle);\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({ type: 'transcript' }, null, tsStyle);\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'white';\n densStyle.COLOR2 = 'black';\n densStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'density' }, null, densStyle);\n }\n\n return callback(stylesheet);\n};\n\ndalliance_registerParserFactory('bed', function (t) {\n return new BedWigParser(t);\n});\ndalliance_registerParserFactory('wig', function (t) {\n return new BedWigParser(t);\n});\n\n},{\"./das\":10,\"./sourceadapters\":39,\"./spans\":41,\"./utils\":56}],3:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// bigwig.js: indexed binary WIG (and BED) files\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var das = require('./das');\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var bin = require('./bin');\n var readInt = bin.readInt;\n\n var jszlib = require('jszlib');\n var jszlib_inflate_buffer = jszlib.inflateBuffer;\n var arrayCopy = jszlib.arrayCopy;\n}\n\nvar BIG_WIG_MAGIC = 0x888FFC26;\nvar BIG_WIG_MAGIC_BE = 0x26FC8F88;\nvar BIG_BED_MAGIC = 0x8789F2EB;\nvar BIG_BED_MAGIC_BE = 0xEBF28987;\n\nvar BIG_WIG_TYPE_GRAPH = 1;\nvar BIG_WIG_TYPE_VSTEP = 2;\nvar BIG_WIG_TYPE_FSTEP = 3;\n\nvar M1 = 256;\nvar M2 = 256 * 256;\nvar M3 = 256 * 256 * 256;\nvar M4 = 256 * 256 * 256 * 256;\n\nvar BED_COLOR_REGEXP = new RegExp(\"^[0-9]+,[0-9]+,[0-9]+\");\n\nfunction bwg_readOffset(ba, o) {\n var offset = ba[o] + ba[o + 1] * M1 + ba[o + 2] * M2 + ba[o + 3] * M3 + ba[o + 4] * M4;\n return offset;\n}\n\nfunction BigWig() {}\n\nBigWig.prototype.readChromTree = function (callback) {\n var thisB = this;\n this.chromsToIDs = {};\n this.idsToChroms = {};\n this.maxID = 0;\n\n var udo = this.unzoomedDataOffset;\n var eb = udo - this.chromTreeOffset & 3;\n udo = udo + 4 - eb;\n\n this.data.slice(this.chromTreeOffset, udo - this.chromTreeOffset).fetch(function (bpt) {\n var ba = new Uint8Array(bpt);\n var sa = new Int16Array(bpt);\n var la = new Int32Array(bpt);\n var bptMagic = la[0];\n var blockSize = la[1];\n var keySize = la[2];\n var valSize = la[3];\n var itemCount = bwg_readOffset(ba, 16);\n var rootNodeOffset = 32;\n\n var bptReadNode = function bptReadNode(offset) {\n var nodeType = ba[offset];\n var cnt = sa[offset / 2 + 1];\n offset += 4;\n for (var n = 0; n < cnt; ++n) {\n if (nodeType == 0) {\n offset += keySize;\n var childOffset = bwg_readOffset(ba, offset);\n offset += 8;\n childOffset -= thisB.chromTreeOffset;\n bptReadNode(childOffset);\n } else {\n var key = '';\n for (var ki = 0; ki < keySize; ++ki) {\n var charCode = ba[offset++];\n if (charCode != 0) {\n key += String.fromCharCode(charCode);\n }\n }\n var chromId = ba[offset + 3] << 24 | ba[offset + 2] << 16 | ba[offset + 1] << 8 | ba[offset + 0];\n var chromSize = ba[offset + 7] << 24 | ba[offset + 6] << 16 | ba[offset + 5] << 8 | ba[offset + 4];\n offset += 8;\n\n thisB.chromsToIDs[key] = chromId;\n if (key.indexOf('chr') == 0) {\n thisB.chromsToIDs[key.substr(3)] = chromId;\n }\n thisB.idsToChroms[chromId] = key;\n thisB.maxID = Math.max(thisB.maxID, chromId);\n }\n }\n };\n bptReadNode(rootNodeOffset);\n\n callback(thisB);\n });\n};\n\nfunction BigWigView(bwg, cirTreeOffset, cirTreeLength, isSummary) {\n this.bwg = bwg;\n this.cirTreeOffset = cirTreeOffset;\n this.cirTreeLength = cirTreeLength;\n this.isSummary = isSummary;\n}\n\nBigWigView.prototype.readWigData = function (chrName, min, max, callback) {\n var chr = this.bwg.chromsToIDs[chrName];\n if (chr === undefined) {\n // Not an error because some .bwgs won't have data for all chromosomes.\n return callback([]);\n } else {\n this.readWigDataById(chr, min, max, callback);\n }\n};\n\nBigWigView.prototype.readWigDataById = function (chr, min, max, callback) {\n var thisB = this;\n if (!this.cirHeader) {\n this.bwg.data.slice(this.cirTreeOffset, 48).fetch(function (result) {\n thisB.cirHeader = result;\n var la = new Int32Array(thisB.cirHeader);\n thisB.cirBlockSize = la[1];\n thisB.readWigDataById(chr, min, max, callback);\n });\n return;\n }\n\n var blocksToFetch = [];\n var outstanding = 0;\n\n var beforeBWG = Date.now();\n\n var filter = function filter(chromId, fmin, fmax, toks) {\n return (chr < 0 || chromId == chr) && fmin <= max && fmax >= min;\n };\n\n var cirFobRecur = function cirFobRecur(offset, level) {\n if (thisB.bwg.instrument) console.log('level=' + level + '; offset=' + offset + '; time=' + (Date.now() | 0));\n\n outstanding += offset.length;\n\n if (offset.length == 1 && offset[0] - thisB.cirTreeOffset == 48 && thisB.cachedCirRoot) {\n cirFobRecur2(thisB.cachedCirRoot, 0, level);\n --outstanding;\n if (outstanding == 0) {\n thisB.fetchFeatures(filter, blocksToFetch, callback);\n }\n return;\n }\n\n var maxCirBlockSpan = 4 + thisB.cirBlockSize * 32; // Upper bound on size, based on a completely full leaf node.\n var spans;\n for (var i = 0; i < offset.length; ++i) {\n var blockSpan = new Range(offset[i], offset[i] + maxCirBlockSpan);\n spans = spans ? union(spans, blockSpan) : blockSpan;\n }\n\n var fetchRanges = spans.ranges();\n for (var r = 0; r < fetchRanges.length; ++r) {\n var fr = fetchRanges[r];\n cirFobStartFetch(offset, fr, level);\n }\n };\n\n var cirFobStartFetch = function cirFobStartFetch(offset, fr, level, attempts) {\n var length = fr.max() - fr.min();\n thisB.bwg.data.slice(fr.min(), fr.max() - fr.min()).fetch(function (resultBuffer) {\n for (var i = 0; i < offset.length; ++i) {\n if (fr.contains(offset[i])) {\n cirFobRecur2(resultBuffer, offset[i] - fr.min(), level);\n\n if (offset[i] - thisB.cirTreeOffset == 48 && offset[i] - fr.min() == 0) thisB.cachedCirRoot = resultBuffer;\n\n --outstanding;\n if (outstanding == 0) {\n thisB.fetchFeatures(filter, blocksToFetch, callback);\n }\n }\n }\n });\n };\n\n var cirFobRecur2 = function cirFobRecur2(cirBlockData, offset, level) {\n var ba = new Uint8Array(cirBlockData);\n var sa = new Int16Array(cirBlockData);\n var la = new Int32Array(cirBlockData);\n\n var isLeaf = ba[offset];\n var cnt = sa[offset / 2 + 1];\n offset += 4;\n\n if (isLeaf != 0) {\n for (var i = 0; i < cnt; ++i) {\n var lo = offset / 4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = bwg_readOffset(ba, offset + 16);\n var blockSize = bwg_readOffset(ba, offset + 24);\n if ((chr < 0 || startChrom < chr || startChrom == chr && startBase <= max) && (chr < 0 || endChrom > chr || endChrom == chr && endBase >= min)) {\n blocksToFetch.push({ offset: blockOffset, size: blockSize });\n }\n offset += 32;\n }\n } else {\n var recurOffsets = [];\n for (var i = 0; i < cnt; ++i) {\n var lo = offset / 4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = bwg_readOffset(ba, offset + 16);\n if ((chr < 0 || startChrom < chr || startChrom == chr && startBase <= max) && (chr < 0 || endChrom > chr || endChrom == chr && endBase >= min)) {\n recurOffsets.push(blockOffset);\n }\n offset += 24;\n }\n if (recurOffsets.length > 0) {\n cirFobRecur(recurOffsets, level + 1);\n }\n }\n };\n\n cirFobRecur([thisB.cirTreeOffset + 48], 1);\n};\n\nBigWigView.prototype.fetchFeatures = function (filter, blocksToFetch, callback) {\n var thisB = this;\n\n blocksToFetch.sort(function (b0, b1) {\n return (b0.offset | 0) - (b1.offset | 0);\n });\n\n if (blocksToFetch.length == 0) {\n callback([]);\n } else {\n var features = [];\n var createFeature = function createFeature(chr, fmin, fmax, opts) {\n if (!opts) {\n opts = {};\n }\n\n var f = new DASFeature();\n f._chromId = chr;\n f.segment = thisB.bwg.idsToChroms[chr];\n f.min = fmin;\n f.max = fmax;\n f.type = thisB.bwg.type;\n\n for (var k in opts) {\n f[k] = opts[k];\n }\n\n features.push(f);\n };\n\n var tramp = function tramp() {\n if (blocksToFetch.length == 0) {\n var afterBWG = Date.now();\n // dlog('BWG fetch took ' + (afterBWG - beforeBWG) + 'ms');\n callback(features);\n return; // just in case...\n } else {\n var block = blocksToFetch[0];\n if (block.data) {\n thisB.parseFeatures(block.data, createFeature, filter);\n blocksToFetch.splice(0, 1);\n tramp();\n } else {\n var fetchStart = block.offset;\n var fetchSize = block.size;\n var bi = 1;\n while (bi < blocksToFetch.length && blocksToFetch[bi].offset == fetchStart + fetchSize) {\n fetchSize += blocksToFetch[bi].size;\n ++bi;\n }\n\n thisB.bwg.data.slice(fetchStart, fetchSize).fetch(function (result) {\n var offset = 0;\n var bi = 0;\n while (offset < fetchSize) {\n var fb = blocksToFetch[bi];\n\n var data;\n if (thisB.bwg.uncompressBufSize > 0) {\n data = jszlib_inflate_buffer(result, offset + 2, fb.size - 2);\n } else {\n var tmp = new Uint8Array(fb.size); // FIXME is this really the best we can do?\n arrayCopy(new Uint8Array(result, offset, fb.size), 0, tmp, 0, fb.size);\n data = tmp.buffer;\n }\n fb.data = data;\n\n offset += fb.size;\n ++bi;\n }\n tramp();\n });\n }\n }\n };\n tramp();\n }\n};\n\nBigWigView.prototype.parseFeatures = function (data, createFeature, filter) {\n var ba = new Uint8Array(data);\n\n if (this.isSummary) {\n var sa = new Int16Array(data);\n var la = new Int32Array(data);\n var fa = new Float32Array(data);\n\n var itemCount = data.byteLength / 32;\n for (var i = 0; i < itemCount; ++i) {\n var chromId = la[i * 8];\n var start = la[i * 8 + 1];\n var end = la[i * 8 + 2];\n var validCnt = la[i * 8 + 3];\n var minVal = fa[i * 8 + 4];\n var maxVal = fa[i * 8 + 5];\n var sumData = fa[i * 8 + 6];\n var sumSqData = fa[i * 8 + 7];\n\n if (filter(chromId, start + 1, end)) {\n var summaryOpts = { type: 'bigwig', score: sumData / validCnt, maxScore: maxVal };\n if (this.bwg.type == 'bigbed') {\n summaryOpts.type = 'density';\n }\n createFeature(chromId, start + 1, end, summaryOpts);\n }\n }\n } else if (this.bwg.type == 'bigwig') {\n var sa = new Int16Array(data);\n var la = new Int32Array(data);\n var fa = new Float32Array(data);\n\n var chromId = la[0];\n var blockStart = la[1];\n var blockEnd = la[2];\n var itemStep = la[3];\n var itemSpan = la[4];\n var blockType = ba[20];\n var itemCount = sa[11];\n\n if (blockType == BIG_WIG_TYPE_FSTEP) {\n for (var i = 0; i < itemCount; ++i) {\n var score = fa[i + 6];\n var fmin = blockStart + i * itemStep + 1,\n fmax = blockStart + i * itemStep + itemSpan;\n if (filter(chromId, fmin, fmax)) createFeature(chromId, fmin, fmax, { score: score });\n }\n } else if (blockType == BIG_WIG_TYPE_VSTEP) {\n for (var i = 0; i < itemCount; ++i) {\n var start = la[i * 2 + 6] + 1;\n var end = start + itemSpan - 1;\n var score = fa[i * 2 + 7];\n if (filter(chromId, start, end)) createFeature(chromId, start, end, { score: score });\n }\n } else if (blockType == BIG_WIG_TYPE_GRAPH) {\n for (var i = 0; i < itemCount; ++i) {\n var start = la[i * 3 + 6] + 1;\n var end = la[i * 3 + 7];\n var score = fa[i * 3 + 8];\n if (start > end) {\n start = end;\n }\n if (filter(chromId, start, end)) createFeature(chromId, start, end, { score: score });\n }\n } else {\n console.log('Currently not handling bwgType=' + blockType);\n }\n } else if (this.bwg.type == 'bigbed') {\n var offset = 0;\n var dfc = this.bwg.definedFieldCount;\n var schema = this.bwg.schema;\n\n while (offset < ba.length) {\n var chromId = ba[offset + 3] << 24 | ba[offset + 2] << 16 | ba[offset + 1] << 8 | ba[offset + 0];\n var start = ba[offset + 7] << 24 | ba[offset + 6] << 16 | ba[offset + 5] << 8 | ba[offset + 4];\n var end = ba[offset + 11] << 24 | ba[offset + 10] << 16 | ba[offset + 9] << 8 | ba[offset + 8];\n offset += 12;\n var rest = '';\n while (true) {\n var ch = ba[offset++];\n if (ch != 0) {\n rest += String.fromCharCode(ch);\n } else {\n break;\n }\n }\n\n var featureOpts = {};\n\n var bedColumns;\n if (rest.length > 0) {\n bedColumns = rest.split('\\t');\n } else {\n bedColumns = [];\n }\n if (bedColumns.length > 0 && dfc > 3) {\n featureOpts.label = bedColumns[0];\n }\n if (bedColumns.length > 1 && dfc > 4) {\n var score = parseInt(bedColumns[1]);\n if (!isNaN(score)) featureOpts.score = score;\n }\n if (bedColumns.length > 2 && dfc > 5) {\n featureOpts.orientation = bedColumns[2];\n }\n if (bedColumns.length > 5 && dfc > 8) {\n var color = bedColumns[5];\n if (BED_COLOR_REGEXP.test(color)) {\n featureOpts.itemRgb = 'rgb(' + color + ')';\n }\n }\n\n if (bedColumns.length > dfc - 3 && schema) {\n for (var col = dfc - 3; col < bedColumns.length; ++col) {\n featureOpts[schema.fields[col + 3].name] = bedColumns[col];\n }\n }\n\n if (filter(chromId, start + 1, end, bedColumns)) {\n if (dfc < 12) {\n createFeature(chromId, start + 1, end, featureOpts);\n } else {\n var thickStart = bedColumns[3] | 0;\n var thickEnd = bedColumns[4] | 0;\n var blockCount = bedColumns[6] | 0;\n var blockSizes = bedColumns[7].split(',');\n var blockStarts = bedColumns[8].split(',');\n\n if (featureOpts.exonFrames) {\n var exonFrames = featureOpts.exonFrames.split(',');\n featureOpts.exonFrames = undefined;\n }\n\n featureOpts.type = 'transcript';\n var grp = new DASGroup();\n for (var k in featureOpts) {\n grp[k] = featureOpts[k];\n }\n grp.id = bedColumns[0];\n grp.segment = this.bwg.idsToChroms[chromId];\n grp.min = start + 1;\n grp.max = end;\n grp.notes = [];\n featureOpts.groups = [grp];\n\n // Moving towards using bigGenePred model, but will\n // still support old Dalliance-style BED12+gene-name for the\n // foreseeable future.\n if (bedColumns.length > 9) {\n var geneId = featureOpts.geneName || bedColumns[9];\n var geneName = geneId;\n if (bedColumns.length > 10) {\n geneName = bedColumns[10];\n }\n if (featureOpts.geneName2) geneName = featureOpts.geneName2;\n\n var gg = shallowCopy(grp);\n gg.id = geneId;\n gg.label = geneName;\n gg.type = 'gene';\n featureOpts.groups.push(gg);\n }\n\n var spanList = [];\n for (var b = 0; b < blockCount; ++b) {\n var bmin = (blockStarts[b] | 0) + start;\n var bmax = bmin + (blockSizes[b] | 0);\n var span = new Range(bmin, bmax);\n spanList.push(span);\n }\n var spans = union(spanList);\n\n var tsList = spans.ranges();\n for (var s = 0; s < tsList.length; ++s) {\n var ts = tsList[s];\n createFeature(chromId, ts.min() + 1, ts.max(), featureOpts);\n }\n\n if (thickEnd > thickStart) {\n var codingRegion = featureOpts.orientation == '+' ? new Range(thickStart, thickEnd + 3) : new Range(thickStart - 3, thickEnd);\n // +/- 3 to account for stop codon\n\n var tl = intersection(spans, codingRegion);\n if (tl) {\n featureOpts.type = 'translation';\n var tlList = tl.ranges();\n var readingFrame = 0;\n\n var tlOffset = 0;\n while (tlList[0].min() > tsList[tlOffset].max()) {\n tlOffset++;\n }for (var s = 0; s < tlList.length; ++s) {\n // Record reading frame for every exon\n var index = s;\n if (featureOpts.orientation == '-') index = tlList.length - s - 1;\n var ts = tlList[index];\n featureOpts.readframe = readingFrame;\n if (exonFrames) {\n var brf = parseInt(exonFrames[index + tlOffset]);\n if (typeof brf === 'number' && brf >= 0 && brf <= 2) {\n featureOpts.readframe = brf;\n featureOpts.readframeExplicit = true;\n }\n }\n var length = ts.max() - ts.min();\n readingFrame = (readingFrame + length) % 3;\n createFeature(chromId, ts.min() + 1, ts.max(), featureOpts);\n }\n }\n }\n }\n }\n }\n } else {\n throw Error(\"Don't know what to do with \" + this.bwg.type);\n }\n};\n\n//\n// nasty cut/paste, should roll back in!\n//\n\nBigWigView.prototype.getFirstAdjacent = function (chrName, pos, dir, callback) {\n var chr = this.bwg.chromsToIDs[chrName];\n if (chr === undefined) {\n // Not an error because some .bwgs won't have data for all chromosomes.\n return callback([]);\n } else {\n this.getFirstAdjacentById(chr, pos, dir, callback);\n }\n};\n\nBigWigView.prototype.getFirstAdjacentById = function (chr, pos, dir, callback) {\n var thisB = this;\n if (!this.cirHeader) {\n this.bwg.data.slice(this.cirTreeOffset, 48).fetch(function (result) {\n thisB.cirHeader = result;\n var la = new Int32Array(thisB.cirHeader);\n thisB.cirBlockSize = la[1];\n thisB.getFirstAdjacentById(chr, pos, dir, callback);\n });\n return;\n }\n\n var blockToFetch = null;\n var bestBlockChr = -1;\n var bestBlockOffset = -1;\n\n var outstanding = 0;\n\n var beforeBWG = Date.now();\n\n var cirFobRecur = function cirFobRecur(offset, level) {\n outstanding += offset.length;\n\n var maxCirBlockSpan = 4 + thisB.cirBlockSize * 32; // Upper bound on size, based on a completely full leaf node.\n var spans;\n for (var i = 0; i < offset.length; ++i) {\n var blockSpan = new Range(offset[i], offset[i] + maxCirBlockSpan);\n spans = spans ? union(spans, blockSpan) : blockSpan;\n }\n\n var fetchRanges = spans.ranges();\n for (var r = 0; r < fetchRanges.length; ++r) {\n var fr = fetchRanges[r];\n cirFobStartFetch(offset, fr, level);\n }\n };\n\n var cirFobStartFetch = function cirFobStartFetch(offset, fr, level, attempts) {\n var length = fr.max() - fr.min();\n thisB.bwg.data.slice(fr.min(), fr.max() - fr.min()).fetch(function (resultBuffer) {\n for (var i = 0; i < offset.length; ++i) {\n if (fr.contains(offset[i])) {\n cirFobRecur2(resultBuffer, offset[i] - fr.min(), level);\n --outstanding;\n if (outstanding == 0) {\n if (!blockToFetch) {\n if (dir > 0 && (chr != 0 || pos > 0)) {\n return thisB.getFirstAdjacentById(0, 0, dir, callback);\n } else if (dir < 0 && (chr != thisB.bwg.maxID || pos < 1000000000)) {\n return thisB.getFirstAdjacentById(thisB.bwg.maxID, 1000000000, dir, callback);\n }\n return callback([]);\n }\n\n thisB.fetchFeatures(function (chrx, fmin, fmax, toks) {\n return dir < 0 && (chrx < chr || fmax < pos) || dir > 0 && (chrx > chr || fmin > pos);\n }, [blockToFetch], function (features) {\n var bestFeature = null;\n var bestChr = -1;\n var bestPos = -1;\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n var chrx = f._chromId,\n fmin = f.min,\n fmax = f.max;\n if (bestFeature == null || dir < 0 && (chrx > bestChr || fmax > bestPos) || dir > 0 && (chrx < bestChr || fmin < bestPos)) {\n bestFeature = f;\n bestPos = dir < 0 ? fmax : fmin;\n bestChr = chrx;\n }\n }\n\n if (bestFeature != null) return callback([bestFeature]);else return callback([]);\n });\n }\n }\n }\n });\n };\n\n var cirFobRecur2 = function cirFobRecur2(cirBlockData, offset, level) {\n var ba = new Uint8Array(cirBlockData);\n var sa = new Int16Array(cirBlockData);\n var la = new Int32Array(cirBlockData);\n\n var isLeaf = ba[offset];\n var cnt = sa[offset / 2 + 1];\n offset += 4;\n\n if (isLeaf != 0) {\n for (var i = 0; i < cnt; ++i) {\n var lo = offset / 4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = bwg_readOffset(ba, offset + 16);\n var blockSize = bwg_readOffset(ba, offset + 24);\n if (dir < 0 && (startChrom < chr || startChrom == chr && startBase <= pos) || dir > 0 && (endChrom > chr || endChrom == chr && endBase >= pos)) {\n // console.log('Got an interesting block: startBase=' + startChrom + ':' + startBase + '; endBase=' + endChrom + ':' + endBase + '; offset=' + blockOffset + '; size=' + blockSize);\n if (/_random/.exec(thisB.bwg.idsToChroms[startChrom])) {\n // dlog('skipping random: ' + thisB.bwg.idsToChroms[startChrom]);\n } else if (blockToFetch == null || dir < 0 && (endChrom > bestBlockChr || endChrom == bestBlockChr && endBase > bestBlockOffset) || dir > 0 && (startChrom < bestBlockChr || startChrom == bestBlockChr && startBase < bestBlockOffset)) {\n // dlog('best is: startBase=' + startChrom + ':' + startBase + '; endBase=' + endChrom + ':' + endBase + '; offset=' + blockOffset + '; size=' + blockSize);\n blockToFetch = { offset: blockOffset, size: blockSize };\n bestBlockOffset = dir < 0 ? endBase : startBase;\n bestBlockChr = dir < 0 ? endChrom : startChrom;\n }\n }\n offset += 32;\n }\n } else {\n var bestRecur = -1;\n var bestPos = -1;\n var bestChr = -1;\n for (var i = 0; i < cnt; ++i) {\n var lo = offset / 4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = la[lo + 4] << 32 | la[lo + 5];\n if (dir < 0 && (startChrom < chr || startChrom == chr && startBase <= pos) && endChrom >= chr || dir > 0 && (endChrom > chr || endChrom == chr && endBase >= pos) && startChrom <= chr) {\n if (bestRecur < 0 || endBase > bestPos) {\n bestRecur = blockOffset;\n bestPos = dir < 0 ? endBase : startBase;\n bestChr = dir < 0 ? endChrom : startChrom;\n }\n }\n offset += 24;\n }\n if (bestRecur >= 0) {\n cirFobRecur([bestRecur], level + 1);\n }\n }\n };\n\n cirFobRecur([thisB.cirTreeOffset + 48], 1);\n};\n\nBigWig.prototype.readWigData = function (chrName, min, max, callback) {\n this.getUnzoomedView().readWigData(chrName, min, max, callback);\n};\n\nBigWig.prototype.getUnzoomedView = function () {\n if (!this.unzoomedView) {\n var cirLen = 4000;\n var nzl = this.zoomLevels[0];\n if (nzl) {\n cirLen = this.zoomLevels[0].dataOffset - this.unzoomedIndexOffset;\n }\n this.unzoomedView = new BigWigView(this, this.unzoomedIndexOffset, cirLen, false);\n }\n return this.unzoomedView;\n};\n\nBigWig.prototype.getZoomedView = function (z) {\n var zh = this.zoomLevels[z];\n if (!zh.view) {\n zh.view = new BigWigView(this, zh.indexOffset, /* this.zoomLevels[z + 1].dataOffset - zh.indexOffset */4000, true);\n }\n return zh.view;\n};\n\nfunction makeBwg(data, callback, name) {\n var bwg = new BigWig();\n bwg.data = data;\n bwg.name = name;\n bwg.data.slice(0, 512).salted().fetch(function (result) {\n if (!result) {\n return callback(null, \"Couldn't fetch file\");\n }\n\n var header = result;\n var ba = new Uint8Array(header);\n var sa = new Int16Array(header);\n var la = new Int32Array(header);\n var magic = ba[0] + M1 * ba[1] + M2 * ba[2] + M3 * ba[3];\n if (magic == BIG_WIG_MAGIC) {\n bwg.type = 'bigwig';\n } else if (magic == BIG_BED_MAGIC) {\n bwg.type = 'bigbed';\n } else if (magic == BIG_WIG_MAGIC_BE || magic == BIG_BED_MAGIC_BE) {\n return callback(null, \"Currently don't support big-endian BBI files\");\n } else {\n return callback(null, \"Not a supported format, magic=0x\" + magic.toString(16));\n }\n\n bwg.version = sa[2]; // 4\n bwg.numZoomLevels = sa[3]; // 6\n bwg.chromTreeOffset = bwg_readOffset(ba, 8);\n bwg.unzoomedDataOffset = bwg_readOffset(ba, 16);\n bwg.unzoomedIndexOffset = bwg_readOffset(ba, 24);\n bwg.fieldCount = sa[16]; // 32\n bwg.definedFieldCount = sa[17]; // 34\n bwg.asOffset = bwg_readOffset(ba, 36);\n bwg.totalSummaryOffset = bwg_readOffset(ba, 44);\n bwg.uncompressBufSize = la[13]; // 52\n bwg.extHeaderOffset = bwg_readOffset(ba, 56);\n\n bwg.zoomLevels = [];\n for (var zl = 0; zl < bwg.numZoomLevels; ++zl) {\n var zlReduction = la[zl * 6 + 16];\n var zlData = bwg_readOffset(ba, zl * 24 + 72);\n var zlIndex = bwg_readOffset(ba, zl * 24 + 80);\n bwg.zoomLevels.push({ reduction: zlReduction, dataOffset: zlData, indexOffset: zlIndex });\n }\n\n bwg.readChromTree(function () {\n bwg.getAutoSQL(function (as) {\n bwg.schema = as;\n return callback(bwg);\n });\n });\n }, { timeout: 5000 }); // Potential timeout on first request to catch mixed-content errors on\n // Chromium.\n}\n\nBigWig.prototype._tsFetch = function (zoom, chr, min, max, callback) {\n var bwg = this;\n if (zoom >= this.zoomLevels.length - 1) {\n if (!this.topLevelReductionCache) {\n this.getZoomedView(this.zoomLevels.length - 1).readWigDataById(-1, 0, 300000000, function (feats) {\n bwg.topLevelReductionCache = feats;\n return bwg._tsFetch(zoom, chr, min, max, callback);\n });\n } else {\n var f = [];\n var c = this.topLevelReductionCache;\n for (var fi = 0; fi < c.length; ++fi) {\n if (c[fi]._chromId == chr) {\n f.push(c[fi]);\n }\n }\n return callback(f);\n }\n } else {\n var view;\n if (zoom < 0) {\n view = this.getUnzoomedView();\n } else {\n view = this.getZoomedView(zoom);\n }\n return view.readWigDataById(chr, min, max, callback);\n }\n};\n\nBigWig.prototype.thresholdSearch = function (chrName, referencePoint, dir, threshold, callback) {\n dir = dir < 0 ? -1 : 1;\n var bwg = this;\n var initialChr = this.chromsToIDs[chrName];\n var candidates = [{ chrOrd: 0, chr: initialChr, zoom: bwg.zoomLevels.length - 4, min: 0, max: 300000000, fromRef: true }];\n for (var i = 1; i <= this.maxID + 1; ++i) {\n var chrId = (initialChr + dir * i) % (this.maxID + 1);\n if (chrId < 0) chrId += this.maxID + 1;\n candidates.push({ chrOrd: i, chr: chrId, zoom: bwg.zoomLevels.length - 1, min: 0, max: 300000000 });\n }\n\n function fbThresholdSearchRecur() {\n if (candidates.length == 0) {\n return callback(null);\n }\n candidates.sort(function (c1, c2) {\n var d = c1.zoom - c2.zoom;\n if (d != 0) return d;\n\n d = c1.chrOrd - c2.chrOrd;\n if (d != 0) return d;else return c1.min - c2.min * dir;\n });\n\n var candidate = candidates.splice(0, 1)[0];\n bwg._tsFetch(candidate.zoom, candidate.chr, candidate.min, candidate.max, function (feats) {\n var rp = dir > 0 ? 0 : 300000000;\n if (candidate.fromRef) rp = referencePoint;\n\n for (var fi = 0; fi < feats.length; ++fi) {\n var f = feats[fi];\n var score;\n if (f.maxScore != undefined) score = f.maxScore;else score = f.score;\n\n if (dir > 0) {\n if (score > threshold) {\n if (candidate.zoom < 0) {\n if (f.min > rp) return callback(f);\n } else if (f.max > rp) {\n candidates.push({ chr: candidate.chr, chrOrd: candidate.chrOrd, zoom: candidate.zoom - 2, min: f.min, max: f.max, fromRef: candidate.fromRef });\n }\n }\n } else {\n if (score > threshold) {\n if (candidate.zoom < 0) {\n if (f.max < rp) return callback(f);\n } else if (f.min < rp) {\n candidates.push({ chr: candidate.chr, chrOrd: candidate.chrOrd, zoom: candidate.zoom - 2, min: f.min, max: f.max, fromRef: candidate.fromRef });\n }\n }\n }\n }\n fbThresholdSearchRecur();\n });\n }\n\n fbThresholdSearchRecur();\n};\n\nBigWig.prototype.getAutoSQL = function (callback) {\n var thisB = this;\n if (!this.asOffset) return callback(null);\n\n this.data.slice(this.asOffset, 2048).fetch(function (result) {\n var ba = new Uint8Array(result);\n var s = '';\n for (var i = 0; i < ba.length; ++i) {\n if (ba[i] == 0) break;\n s += String.fromCharCode(ba[i]);\n }\n\n /* \n * Quick'n'dirty attempt to parse autoSql format.\n * See: http://www.linuxjournal.com/files/linuxjournal.com/linuxjournal/articles/059/5949/5949l2.html\n */\n\n var header_re = /(\\w+)\\s+(\\w+)\\s+(\"([^\"]+)\")?\\s+\\(\\s*/;\n var field_re = /([\\w\\[\\]]+)\\s+(\\w+)\\s*;\\s*(\"([^\"]+)\")?\\s*/g;\n\n var headerMatch = header_re.exec(s);\n if (headerMatch) {\n var as = {\n declType: headerMatch[1],\n name: headerMatch[2],\n comment: headerMatch[4],\n\n fields: []\n };\n\n s = s.substring(headerMatch[0]);\n for (var m = field_re.exec(s); m != null; m = field_re.exec(s)) {\n as.fields.push({ type: m[1],\n name: m[2],\n comment: m[4] });\n }\n\n return callback(as);\n }\n });\n};\n\nBigWig.prototype.getExtraIndices = function (callback) {\n var thisB = this;\n if (this.version < 4 || this.extHeaderOffset == 0 || this.type != 'bigbed') {\n return callback(null);\n } else {\n this.data.slice(this.extHeaderOffset, 64).fetch(function (result) {\n if (!result) {\n return callback(null, \"Couldn't fetch extension header\");\n }\n\n var ba = new Uint8Array(result);\n var sa = new Int16Array(result);\n var la = new Int32Array(result);\n\n var extHeaderSize = sa[0];\n var extraIndexCount = sa[1];\n var extraIndexListOffset = bwg_readOffset(ba, 4);\n\n if (extraIndexCount == 0) {\n return callback(null);\n }\n\n // FIXME 20byte records only make sense for single-field indices.\n // Right now, these seem to be the only things around, but the format\n // is actually more general.\n thisB.data.slice(extraIndexListOffset, extraIndexCount * 20).fetch(function (eil) {\n if (!eil) {\n return callback(null, \"Couldn't fetch index info\");\n }\n\n var ba = new Uint8Array(eil);\n var sa = new Int16Array(eil);\n var la = new Int32Array(eil);\n\n var indices = [];\n for (var ii = 0; ii < extraIndexCount; ++ii) {\n var eiType = sa[ii * 10];\n var eiFieldCount = sa[ii * 10 + 1];\n var eiOffset = bwg_readOffset(ba, ii * 20 + 4);\n var eiField = sa[ii * 10 + 8];\n var index = new BBIExtraIndex(thisB, eiType, eiFieldCount, eiOffset, eiField);\n indices.push(index);\n }\n callback(indices);\n });\n });\n }\n};\n\nfunction BBIExtraIndex(bbi, type, fieldCount, offset, field) {\n this.bbi = bbi;\n this.type = type;\n this.fieldCount = fieldCount;\n this.offset = offset;\n this.field = field;\n}\n\nBBIExtraIndex.prototype.lookup = function (name, callback) {\n var thisB = this;\n\n this.bbi.data.slice(this.offset, 32).fetch(function (bpt) {\n var ba = new Uint8Array(bpt);\n var sa = new Int16Array(bpt);\n var la = new Int32Array(bpt);\n var bptMagic = la[0];\n var blockSize = la[1];\n var keySize = la[2];\n var valSize = la[3];\n var itemCount = bwg_readOffset(ba, 16);\n var rootNodeOffset = 32;\n\n function bptReadNode(nodeOffset) {\n thisB.bbi.data.slice(nodeOffset, 4 + blockSize * (keySize + valSize)).fetch(function (node) {\n var ba = new Uint8Array(node);\n var sa = new Uint16Array(node);\n var la = new Uint32Array(node);\n\n var nodeType = ba[0];\n var cnt = sa[1];\n\n var offset = 4;\n if (nodeType == 0) {\n var lastChildOffset = null;\n for (var n = 0; n < cnt; ++n) {\n var key = '';\n for (var ki = 0; ki < keySize; ++ki) {\n var charCode = ba[offset++];\n if (charCode != 0) {\n key += String.fromCharCode(charCode);\n }\n }\n\n var childOffset = bwg_readOffset(ba, offset);\n offset += 8;\n\n if (name.localeCompare(key) < 0 && lastChildOffset) {\n bptReadNode(lastChildOffset);\n return;\n }\n lastChildOffset = childOffset;\n }\n bptReadNode(lastChildOffset);\n } else {\n for (var n = 0; n < cnt; ++n) {\n var key = '';\n for (var ki = 0; ki < keySize; ++ki) {\n var charCode = ba[offset++];\n if (charCode != 0) {\n key += String.fromCharCode(charCode);\n }\n }\n\n // Specific for EI case.\n if (key == name) {\n var start = bwg_readOffset(ba, offset);\n var length = readInt(ba, offset + 8);\n\n return thisB.bbi.getUnzoomedView().fetchFeatures(function (chr, min, max, toks) {\n if (toks && toks.length > thisB.field - 3) return toks[thisB.field - 3] == name;\n }, [{ offset: start, size: length }], callback);\n }\n offset += valSize;\n }\n return callback([]);\n }\n });\n }\n\n bptReadNode(thisB.offset + rootNodeOffset);\n });\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n makeBwg: makeBwg,\n BIG_BED_MAGIC: BIG_BED_MAGIC,\n BIG_WIG_MAGIC: BIG_WIG_MAGIC\n };\n}\n\n},{\"./bin\":4,\"./das\":10,\"./spans\":41,\"./utils\":56,\"jszlib\":385}],4:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// bin.js general binary data support\n//\n\n\"use strict\";\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var sha1 = require('./sha1');\n var b64_sha1 = sha1.b64_sha1;\n\n var Promise = require('es6-promise').Promise;\n}\n\nfunction BlobFetchable(b) {\n this.blob = b;\n}\n\nBlobFetchable.prototype.slice = function (start, length) {\n var b;\n\n if (this.blob.slice) {\n if (length) {\n b = this.blob.slice(start, start + length);\n } else {\n b = this.blob.slice(start);\n }\n } else {\n if (length) {\n b = this.blob.webkitSlice(start, start + length);\n } else {\n b = this.blob.webkitSlice(start);\n }\n }\n return new BlobFetchable(b);\n};\n\nBlobFetchable.prototype.salted = function () {\n return this;\n};\n\nif (typeof FileReader !== 'undefined') {\n // console.log('defining async BlobFetchable.fetch');\n\n BlobFetchable.prototype.fetch = function (callback) {\n var reader = new FileReader();\n reader.onloadend = function (ev) {\n callback(bstringToBuffer(reader.result));\n };\n reader.readAsBinaryString(this.blob);\n };\n} else {\n // if (console && console.log)\n // console.log('defining sync BlobFetchable.fetch');\n\n BlobFetchable.prototype.fetch = function (callback) {\n var reader = new FileReaderSync();\n try {\n var res = reader.readAsArrayBuffer(this.blob);\n callback(res);\n } catch (e) {\n callback(null, e);\n }\n };\n}\n\nfunction URLFetchable(url, start, end, opts) {\n if (!opts) {\n if ((typeof start === 'undefined' ? 'undefined' : _typeof(start)) === 'object') {\n opts = start;\n start = undefined;\n } else {\n opts = {};\n }\n }\n\n this.url = url;\n this.start = start || 0;\n if (end) {\n this.end = end;\n }\n this.opts = opts;\n}\n\nURLFetchable.prototype.slice = function (s, l) {\n if (s < 0) {\n throw 'Bad slice ' + s;\n }\n\n var ns = this.start,\n ne = this.end;\n if (ns && s) {\n ns = ns + s;\n } else {\n ns = s || ns;\n }\n if (l && ns) {\n ne = ns + l - 1;\n } else {\n ne = ne || l - 1;\n }\n return new URLFetchable(this.url, ns, ne, this.opts);\n};\n\nvar seed = 0;\nvar isSafari = typeof navigator !== 'undefined' && navigator.userAgent.indexOf('Safari') >= 0 && navigator.userAgent.indexOf('Chrome') < 0;\n\nURLFetchable.prototype.fetchAsText = function (callback) {\n var thisB = this;\n\n this.getURL().then(function (url) {\n try {\n var req = new XMLHttpRequest();\n var length;\n if ((isSafari || thisB.opts.salt) && url.indexOf('?') < 0) {\n url = url + '?salt=' + b64_sha1('' + Date.now() + ',' + ++seed);\n }\n req.open('GET', url, true);\n\n if (thisB.end) {\n if (thisB.end - thisB.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + thisB.start + '-' + thisB.end);\n length = thisB.end - thisB.start + 1;\n }\n\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status == 200 || req.status == 206) {\n return callback(req.responseText);\n } else {\n return callback(null);\n }\n }\n };\n if (thisB.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n } catch (e) {\n return callback(null);\n }\n }).catch(function (err) {\n console.log(err);\n return callback(null, err);\n });\n};\n\nURLFetchable.prototype.salted = function () {\n var o = shallowCopy(this.opts);\n o.salt = true;\n return new URLFetchable(this.url, this.start, this.end, o);\n};\n\nURLFetchable.prototype.getURL = function () {\n if (this.opts.resolver) {\n return this.opts.resolver(this.url).then(function (urlOrObj) {\n if (typeof urlOrObj === 'string') {\n return urlOrObj;\n } else {\n return urlOrObj.url;\n }\n });\n } else {\n return Promise.resolve(this.url);\n }\n};\n\nURLFetchable.prototype.fetch = function (callback, opts) {\n var thisB = this;\n\n opts = opts || {};\n var attempt = opts.attempt || 1;\n var truncatedLength = opts.truncatedLength;\n if (attempt > 3) {\n return callback(null);\n }\n\n this.getURL().then(function (url) {\n try {\n var timeout;\n if (opts.timeout && !thisB.opts.credentials) {\n timeout = setTimeout(function () {\n console.log('timing out ' + url);\n req.abort();\n return callback(null, 'Timeout');\n }, opts.timeout);\n }\n\n var req = new XMLHttpRequest();\n var length;\n if ((isSafari || thisB.opts.salt) && url.indexOf('?') < 0) {\n url = url + '?salt=' + b64_sha1('' + Date.now() + ',' + ++seed);\n }\n req.open('GET', url, true);\n req.overrideMimeType('text/plain; charset=x-user-defined');\n if (thisB.end) {\n if (thisB.end - thisB.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + thisB.start + '-' + thisB.end);\n length = thisB.end - thisB.start + 1;\n }\n req.responseType = 'arraybuffer';\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (timeout) clearTimeout(timeout);\n if (req.status == 200 || req.status == 206) {\n if (req.response) {\n var bl = req.response.byteLength;\n if (length && length != bl && (!truncatedLength || bl != truncatedLength)) {\n return thisB.fetch(callback, { attempt: attempt + 1, truncatedLength: bl });\n } else {\n return callback(req.response);\n }\n } else if (req.mozResponseArrayBuffer) {\n return callback(req.mozResponseArrayBuffer);\n } else {\n var r = req.responseText;\n if (length && length != r.length && (!truncatedLength || r.length != truncatedLength)) {\n return thisB.fetch(callback, { attempt: attempt + 1, truncatedLength: r.length });\n } else {\n return callback(bstringToBuffer(req.responseText));\n }\n }\n } else {\n return thisB.fetch(callback, { attempt: attempt + 1 });\n }\n }\n };\n if (thisB.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n } catch (e) {\n return callback(null);\n }\n }).catch(function (err) {\n console.log(err);\n return callback(null, err);\n });\n};\n\nfunction bstringToBuffer(result) {\n if (!result) {\n return null;\n }\n\n var ba = new Uint8Array(result.length);\n for (var i = 0; i < ba.length; ++i) {\n ba[i] = result.charCodeAt(i);\n }\n return ba.buffer;\n}\n\n// Read from Uint8Array\n\nvar convertBuffer = new ArrayBuffer(8);\nvar ba = new Uint8Array(convertBuffer);\nvar fa = new Float32Array(convertBuffer);\n\nfunction readFloat(buf, offset) {\n ba[0] = buf[offset];\n ba[1] = buf[offset + 1];\n ba[2] = buf[offset + 2];\n ba[3] = buf[offset + 3];\n return fa[0];\n}\n\nfunction readInt64(ba, offset) {\n return ba[offset + 7] << 24 | ba[offset + 6] << 16 | ba[offset + 5] << 8 | ba[offset + 4];\n}\n\nfunction readInt(ba, offset) {\n return ba[offset + 3] << 24 | ba[offset + 2] << 16 | ba[offset + 1] << 8 | ba[offset];\n}\n\nfunction readShort(ba, offset) {\n return ba[offset + 1] << 8 | ba[offset];\n}\n\nfunction readByte(ba, offset) {\n return ba[offset];\n}\n\nfunction readIntBE(ba, offset) {\n return ba[offset] << 24 | ba[offset + 1] << 16 | ba[offset + 2] << 8 | ba[offset + 3];\n}\n\n// Exports if we are being used as a module\n\nif (typeof module !== 'undefined') {\n module.exports = {\n BlobFetchable: BlobFetchable,\n URLFetchable: URLFetchable,\n\n readInt: readInt,\n readIntBE: readIntBE,\n readInt64: readInt64,\n readShort: readShort,\n readByte: readByte,\n readFloat: readFloat\n };\n}\n\n},{\"./sha1\":38,\"./utils\":56,\"es6-promise\":384}],5:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// browser-us.js: standard UI wiring\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n\n var nf = require('./numformats');\n var formatLongInt = nf.formatLongInt;\n\n var makeZoomSlider = require('./zoomslider');\n\n // For side effects\n\n require('./tier-edit');\n require('./export-config');\n require('./export-ui');\n require('./export-image');\n require('./svg-export');\n require('./session');\n}\n\n/*\n * Quite a bit of this ought to be done using a templating system, but\n * since web-components isn't quite ready for prime time yet we'll stick\n * with constructing it all in Javascript for now...\n */\n\nBrowser.prototype.initUI = function (holder, genomePanel) {\n if (!this.noSourceCSS) {\n ['bootstrap-scoped.css', 'dalliance-scoped.css', 'font-awesome.min.css'].forEach(function (path) {\n document.head.appendChild(makeElement('link', '', {\n rel: 'stylesheet',\n href: this.resolveURL('$$css/' + path)\n }));\n }.bind(this));\n }\n\n var b = this;\n\n if (!b.disableDefaultFeaturePopup) {\n this.addFeatureListener(function (ev, feature, hit, tier) {\n b.featurePopup(ev, feature, hit, tier);\n });\n }\n\n holder.classList.add('dalliance');\n var toolbar = b.toolbar = makeElement('div', null, { className: 'btn-toolbar toolbar' });\n\n var title = b.coordSystem.speciesName + ' ' + b.nameForCoordSystem(b.coordSystem);\n if (this.setDocumentTitle) {\n document.title = title + ' :: dalliance';\n }\n\n var locField = makeElement('input', '', { className: 'loc-field' });\n b.makeTooltip(locField, 'Enter a genomic location or gene name');\n var locStatusField = makeElement('p', '', { className: 'loc-status' });\n\n var zoomInBtn = makeElement('a', [makeElement('i', null, { className: 'fa fa-search-plus' })], { className: 'btn' });\n var zoomSlider = new makeZoomSlider({ width: b.zoomSliderWidth });\n b.makeTooltip(zoomSlider, \"Highlighted button shows current zoom level, gray button shows inactive zoom level (click or tap SPACE to toggle).\");\n\n var zoomOutBtn = makeElement('a', [makeElement('i', null, { className: 'fa fa-search-minus' })], { className: 'btn' });\n\n var clearHighlightsButton = makeElement('a', [makeElement('i', null, { className: 'fa fa-eraser' })], { className: 'btn' });\n\n var addTrackBtn = makeElement('a', [makeElement('i', null, { className: 'fa fa-plus' })], { className: 'btn' });\n var favBtn = makeElement('a', [makeElement('i', null, { className: 'fa fa-bookmark' })], { className: 'btn' });\n var svgBtn = makeElement('a', [makeElement('i', null, { className: 'fa fa-print' })], { className: 'btn' });\n var resetBtn = makeElement('a', [makeElement('i', null, { className: 'fa fa-refresh' })], { className: 'btn' });\n var optsButton = makeElement('a', [makeElement('i', null, { className: 'fa fa-cogs' })], { className: 'btn' });\n var helpButton = makeElement('a', [makeElement('i', null, { className: 'fa fa-question' })], { className: 'btn' });\n\n var tierEditButton = makeElement('a', [makeElement('i', null, { className: 'fa fa-road' })], { className: 'btn' });\n b.makeTooltip(tierEditButton, 'Configure currently selected track(s) (E)');\n\n var leapLeftButton = makeElement('a', [makeElement('i', null, { className: 'fa fa-angle-left' })], { className: 'btn' }, { width: '5px' });\n var leapRightButton = makeElement('a', [makeElement('i', null, { className: 'fa fa-angle-right' })], { className: 'btn pull-right' }, { width: '5px' });\n\n var modeButtons = makeElement('div', null, { className: 'btn-group pull-right' });\n if (!this.noTrackAdder) modeButtons.appendChild(addTrackBtn);\n if (!this.noTrackEditor) modeButtons.appendChild(tierEditButton);\n if (!this.noExport) modeButtons.appendChild(svgBtn);\n if (!this.noOptions) modeButtons.appendChild(optsButton);\n if (!this.noHelp) modeButtons.appendChild(helpButton);\n\n this.setUiMode = function (m) {\n this.uiMode = m;\n var mb = { help: helpButton, add: addTrackBtn, opts: optsButton, 'export': svgBtn, tier: tierEditButton };\n for (var x in mb) {\n if (x == m) mb[x].classList.add('active');else mb[x].classList.remove('active');\n }\n };\n\n if (!this.noLeapButtons) toolbar.appendChild(leapRightButton);\n\n if (modeButtons.firstChild) toolbar.appendChild(modeButtons);\n\n if (!this.noLeapButtons) toolbar.appendChild(leapLeftButton);\n if (!this.noTitle) {\n toolbar.appendChild(makeElement('div', makeElement('h4', title, {}, { margin: '0px' }), { className: 'btn-group title' }));\n }\n if (!this.noLocationField) toolbar.appendChild(makeElement('div', [locField, locStatusField], { className: 'btn-group loc-group' }));\n if (!this.noClearHighlightsButton) toolbar.appendChild(clearHighlightsButton);\n\n if (!this.noZoomSlider) {\n toolbar.appendChild(makeElement('div', [zoomInBtn, makeElement('span', zoomSlider, { className: 'btn' }), zoomOutBtn], { className: 'btn-group' }));\n }\n\n if (this.toolbarBelow) {\n holder.appendChild(genomePanel);\n holder.appendChild(toolbar);\n } else {\n holder.appendChild(toolbar);\n holder.appendChild(genomePanel);\n }\n\n var lt2 = Math.log(2) / Math.log(10);\n var lt5 = Math.log(5) / Math.log(10);\n var roundSliderValue = function roundSliderValue(x) {\n var ltx = (x / b.zoomExpt + Math.log(b.zoomBase)) / Math.log(10);\n\n var whole = ltx | 0;\n var frac = ltx - whole;\n var rounded;\n\n if (frac < 0.01) rounded = whole;else if (frac <= lt2 + 0.01) rounded = whole + lt2;else if (frac <= lt5 + 0.01) rounded = whole + lt5;else {\n rounded = whole + 1;\n }\n\n return (rounded * Math.log(10) - Math.log(b.zoomBase)) * b.zoomExpt;\n };\n\n var markSlider = function markSlider(x) {\n zoomSlider.addLabel(x, humanReadableScale(Math.exp(x / b.zoomExpt) * b.zoomBase));\n };\n\n this.addViewListener(function (chr, min, max, _oldZoom, zoom) {\n locField.value = chr + ':' + formatLongInt(min) + '..' + formatLongInt(max);\n zoomSlider.min = zoom.min | 0;\n zoomSlider.max = zoom.max | 0;\n if (zoom.isSnapZooming) {\n zoomSlider.value = zoom.alternate;\n zoomSlider.value2 = zoom.current;\n zoomSlider.active = 2;\n } else {\n zoomSlider.value = zoom.current;\n zoomSlider.value2 = zoom.alternate;\n zoomSlider.active = 1;\n }\n\n if (zoom.current == zoom.min) zoomInBtn.classList.add('disabled');else zoomInBtn.classList.remove('disabled');\n\n if (zoom.current == zoom.max) zoomOutBtn.classList.add('disabled');else zoomOutBtn.classList.remove('disabled');\n\n zoomSlider.removeLabels();\n var zmin = zoom.min;\n var zmax = zoom.max;\n var zrange = zmax - zmin;\n\n var numSliderTicks = 4;\n if (b.zoomSliderWidth && b.zoomSliderWidth < 150) numSliderTicks = 3;\n markSlider(roundSliderValue(zmin));\n for (var sti = 1; sti < numSliderTicks - 1; ++sti) {\n markSlider(roundSliderValue(zmin + 1.0 * sti * zrange / (numSliderTicks - 1)));\n }\n markSlider(roundSliderValue(zmax));\n\n if (b.storeStatus) {\n b.storeViewStatus();\n }\n\n if (b.highlights.length > 0) {\n clearHighlightsButton.style.display = 'inline-block';\n } else {\n clearHighlightsButton.style.display = 'none';\n }\n });\n\n this.addTierListener(function () {\n if (b.storeStatus) {\n b.storeTierStatus();\n }\n });\n\n locField.addEventListener('keydown', function (ev) {\n if (ev.keyCode == 40) {\n ev.preventDefault();ev.stopPropagation();\n b.setSelectedTier(0);\n }if (ev.keyCode == 10 || ev.keyCode == 13) {\n ev.preventDefault();\n\n var g = locField.value;\n b.search(g, function (err) {\n if (err) {\n locStatusField.textContent = '' + err;\n } else {\n locStatusField.textContent = '';\n }\n });\n }\n }, false);\n\n var trackAddPopup;\n addTrackBtn.addEventListener('click', function (ev) {\n if (trackAddPopup && trackAddPopup.displayed) {\n b.removeAllPopups();\n } else {\n trackAddPopup = b.showTrackAdder(ev);\n }\n }, false);\n b.makeTooltip(addTrackBtn, 'Add a new track from the registry or an indexed file. (A)');\n\n zoomInBtn.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n\n b.zoomStep(-10);\n }, false);\n b.makeTooltip(zoomInBtn, 'Zoom in (+)');\n\n zoomOutBtn.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n\n b.zoomStep(10);\n }, false);\n b.makeTooltip(zoomOutBtn, 'Zoom out (-)');\n\n zoomSlider.addEventListener('change', function (ev) {\n var wantSnap = zoomSlider.active == 2;\n if (wantSnap != b.isSnapZooming) {\n b.savedZoom = b.zoomSliderValue - b.zoomMin;\n b.isSnapZooming = wantSnap;\n }\n var activeZSV = zoomSlider.active == 1 ? zoomSlider.value : zoomSlider.value2;\n\n b.zoomSliderValue = 1.0 * activeZSV;\n b.zoom(Math.exp(1.0 * activeZSV / b.zoomExpt));\n }, false);\n\n favBtn.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n }, false);\n b.makeTooltip(favBtn, 'Favourite regions');\n\n svgBtn.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n b.openExportPanel();\n }, false);\n b.makeTooltip(svgBtn, 'Export publication-quality SVG. (X)');\n\n var optsPopup;\n optsButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n\n b.toggleOptsPopup(ev);\n }, false);\n b.makeTooltip(optsButton, 'Configure options.');\n\n helpButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n b.toggleHelpPopup(ev);\n });\n b.makeTooltip(helpButton, 'Help; Keyboard shortcuts. (H)');\n\n tierEditButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n if (b.selectedTiers.length == 1) {\n b.openTierPanel(b.tiers[b.selectedTiers[0]]);\n }\n }, false);\n\n leapLeftButton.addEventListener('click', function (ev) {\n b.leap(b.reverseKeyScrolling ? -1 : 1, false);\n }, false);\n b.makeTooltip(leapLeftButton, function (ev) {\n var st = b.getSelectedTier();\n var tier;\n if (st >= 0) tier = b.tiers[st];\n\n if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof tier.quantLeapThreshold == 'number') {\n return 'Jump to the next region with a score above the threshold in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\"\" (ctrl+LEFT)';\n } else if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'leap')) {\n return 'Jump to the next feature in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\" (ctrl+LEFT)';\n } else {\n return 'Jump left (shift+LEFT)';\n }\n });\n\n leapRightButton.addEventListener('click', function (ev) {\n b.leap(b.reverseKeyScrolling ? 1 : -1, false);\n }, false);\n b.makeTooltip(leapRightButton, function (ev) {\n var st = b.getSelectedTier();\n var tier;\n if (st >= 0) tier = b.tiers[st];\n\n if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof tier.quantLeapThreshold == 'number') {\n return 'Jump to the next region with a score above the threshold in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\"\" (ctrl+RIGHT)';\n } else if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'leap')) {\n return 'Jump to the next feature in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\" (ctrl+RIGHT)';\n } else {\n return 'Jump right (shift+RIGHT)';\n }\n });\n b.addTierSelectionListener(function () {\n var st = b.getSelectedTier();\n var tier;\n if (st >= 0) tier = b.tiers[st];\n\n var canLeap = false;\n if (tier && tier.featureSource) {\n if (b.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof tier.quantLeapThreshold == 'number') canLeap = true;else if (b.sourceAdapterIsCapable(tier.featureSource, 'leap')) canLeap = true;\n }\n\n leapLeftButton.firstChild.className = canLeap ? 'fa fa-angle-double-left' : 'fa fa-angle-left';\n leapRightButton.firstChild.className = canLeap ? 'fa fa-angle-double-right' : 'fa fa-angle-right';\n });\n\n clearHighlightsButton.addEventListener('click', function (ev) {\n b.clearHighlights();\n }, false);\n b.makeTooltip(clearHighlightsButton, 'Clear highlights (C)');\n\n b.addTierSelectionWrapListener(function (dir) {\n if (dir < 0) {\n b.setSelectedTier(null);\n locField.focus();\n }\n });\n\n b.addTierSelectionListener(function (sel) {\n if (b.uiMode === 'tier') {\n if (sel.length == 0) {\n b.hideToolPanel();\n b.manipulatingTier = null;\n b.uiMode = 'none';\n } else {\n var ft = b.tiers[sel[0]];\n if (ft != b.manipulatingTier) {\n b.openTierPanel(ft);\n }\n }\n }\n });\n\n var uiKeyHandler = function uiKeyHandler(ev) {\n // console.log('bukh: ' + ev.keyCode);\n if (ev.keyCode == 65 || ev.keyCode == 97) {\n // a\n ev.preventDefault();ev.stopPropagation();\n b.showTrackAdder();\n } else if (ev.keyCode == 72 || ev.keyCode == 104) {\n // h\n ev.stopPropagation();ev.preventDefault();\n b.toggleHelpPopup(ev);\n } else if (ev.keyCode == 69 || ev.keyCode == 101) {\n //e\n ev.stopPropagation();ev.preventDefault();\n if (b.selectedTiers.length == 1) {\n b.openTierPanel(b.tiers[b.selectedTiers[0]]);\n }\n } else if (ev.keyCode == 88 || ev.keyCode == 120) {\n // x\n ev.stopPropagation();ev.preventDefault();\n b.openExportPanel();\n } else if (ev.keyCode == 67 || ev.keyCode == 99) {\n // c\n ev.stopPropagation();ev.preventDefault();\n b.clearHighlights();\n }\n };\n\n holder.addEventListener('focus', function (ev) {\n holder.addEventListener('keydown', uiKeyHandler, false);\n }, false);\n holder.addEventListener('blur', function (ev) {\n holder.removeEventListener('keydown', uiKeyHandler, false);\n }, false);\n\n holder.addEventListener('keydown', function (ev) {\n if (ev.keyCode === 27) {\n if (b.uiMode !== 'none') {\n // Only consume event if tool panel is open.\n ev.preventDefault();\n ev.stopPropagation();\n b.setUiMode('none');\n b.hideToolPanel();\n\n if (b.selectedTiers && b.selectedTiers.length > 0) {\n b.browserHolder.focus();\n }\n }\n }\n }, false);\n};\n\nBrowser.prototype.showToolPanel = function (panel, nowrap) {\n var thisB = this;\n\n if (this.activeToolPanel) {\n this.activeToolPanel.parentElement.removeChild(this.activeToolPanel);\n }\n\n var content;\n if (nowrap) content = panel;else content = makeElement('div', panel, {}, { overflowY: 'auto', width: '100%' });\n\n var divider = makeElement('div', makeElement('i', null, { className: 'fa fa-caret-right' }), { className: 'tool-divider' });\n divider.addEventListener('click', function (ev) {\n thisB.hideToolPanel();\n thisB.setUiMode('none');\n }, false);\n this.makeTooltip(divider, 'Close tool panel (ESC)');\n this.activeToolPanel = makeElement('div', [divider, content], { className: 'tool-holder' });\n this.svgHolder.appendChild(this.activeToolPanel);\n this.resizeViewer();\n\n var thisB = this;\n};\n\nBrowser.prototype.hideToolPanel = function () {\n if (this.activeToolPanel) {\n this.activeToolPanel.parentElement.removeChild(this.activeToolPanel);\n }\n this.svgHolder.style.width = '100%';\n this.activeToolPanel = null;\n this.resizeViewer();\n};\n\nBrowser.prototype.toggleHelpPopup = function (ev) {\n if (this.uiMode === 'help') {\n this.hideToolPanel();\n this.setUiMode('none');\n } else {\n var helpFrame = makeElement('iframe', null, { scrolling: 'yes', seamless: 'seamless', src: this.resolveURL('$$help/index.html'), className: 'help-panel' });\n this.showToolPanel(helpFrame, false);\n this.setUiMode('help');\n }\n};\n\nBrowser.prototype.toggleOptsPopup = function (ev) {\n var b = this;\n\n if (this.uiMode === 'opts') {\n this.hideToolPanel();\n this.setUiMode('none');\n } else {\n var optsForm = makeElement('div', null, { className: 'form-horizontal' }, { boxSizing: 'border-box', MozBoxSizing: 'border-box', display: 'inline-block', verticalAlign: 'top' });\n var optsTable = makeElement('table');\n optsTable.cellPadding = 5;\n\n var scrollModeButton = makeElement('input', '', { type: 'checkbox', checked: b.reverseScrolling });\n scrollModeButton.addEventListener('change', function (ev) {\n b.reverseScrolling = scrollModeButton.checked;\n b.storeStatus();\n }, false);\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Reverse trackpad scrolling', { align: 'right' }), makeElement('td', scrollModeButton)]));\n\n var scrollKeyButton = makeElement('input', '', { type: 'checkbox', checked: b.reverseKeyScrolling });\n scrollKeyButton.addEventListener('change', function (ev) {\n b.reverseKeyScrolling = scrollKeyButton.checked;\n b.storeStatus();\n }, false);\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Reverse scrolling buttons and keys', { align: 'right' }), makeElement('td', scrollKeyButton)]));\n\n var rulerSelect = makeElement('select');\n rulerSelect.appendChild(makeElement('option', 'Left', { value: 'left' }));\n rulerSelect.appendChild(makeElement('option', 'Center', { value: 'center' }));\n rulerSelect.appendChild(makeElement('option', 'Right', { value: 'right' }));\n rulerSelect.appendChild(makeElement('option', 'None', { value: 'none' }));\n rulerSelect.value = b.rulerLocation;\n rulerSelect.addEventListener('change', function (ev) {\n b.rulerLocation = rulerSelect.value;\n b.positionRuler();\n for (var ti = 0; ti < b.tiers.length; ++ti) {\n b.tiers[ti].paintQuant();\n }\n b.storeStatus();\n }, false);\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Vertical guideline', { align: 'right' }), makeElement('td', rulerSelect)]));\n\n var singleBaseHighlightButton = makeElement('input', '', { type: 'checkbox', checked: b.singleBaseHighlight });\n singleBaseHighlightButton.addEventListener('change', function (ev) {\n b.singleBaseHighlight = singleBaseHighlightButton.checked;\n b.positionRuler();\n b.storeStatus();\n }, false);\n singleBaseHighlightButton.setAttribute('id', 'singleBaseHightlightButton'); // making this because access is required when the key 'u' is pressed and the options are visible\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Display and highlight current genome location', { align: 'right' }), makeElement('td', singleBaseHighlightButton)]));\n\n optsForm.appendChild(optsTable);\n\n var resetButton = makeElement('button', 'Reset browser', { className: 'btn' }, { marginLeft: 'auto', marginRight: 'auto', display: 'block' });\n resetButton.addEventListener('click', function (ev) {\n b.reset();\n }, false);\n optsForm.appendChild(resetButton);\n\n this.showToolPanel(optsForm);\n this.setUiMode('opts');\n }\n};\n\nfunction humanReadableScale(x) {\n var suffix = 'bp';\n if (x > 1000000000) {\n x /= 1000000000;\n suffix = 'Gb';\n } else if (x > 1000000) {\n x /= 1000000;\n suffix = 'Mb';\n } else if (x > 1000) {\n x /= 1000;\n suffix = 'kb';\n }\n return '' + Math.round(x) + suffix;\n}\n\n},{\"./cbrowser\":6,\"./export-config\":16,\"./export-image\":17,\"./export-ui\":18,\"./numformats\":30,\"./session\":37,\"./svg-export\":44,\"./tier-edit\":51,\"./utils\":56,\"./zoomslider\":59}],6:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// cbrowser.js: canvas browser container\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var Observed = utils.Observed;\n var Awaited = utils.Awaited;\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n var miniJSONify = utils.miniJSONify;\n var shallowCopy = utils.shallowCopy;\n var textXHR = utils.textXHR;\n\n var tier = require('./tier');\n var DasTier = tier.DasTier;\n\n var sha1 = require('./sha1');\n var hex_sha1 = sha1.hex_sha1;\n\n var thub = require('./thub');\n var connectTrackHub = thub.connectTrackHub;\n\n var VERSION = require('./version');\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n var formatLongInt = nf.formatLongInt;\n\n var Chainset = require('./chainset').Chainset;\n\n var Promise = require('es6-promise').Promise;\n\n var sourcecompare = require('./sourcecompare');\n var sourcesAreEqual = sourcecompare.sourcesAreEqual;\n var sourcesAreEqualModuloStyle = sourcecompare.sourcesAreEqualModuloStyle;\n var sourceDataURI = sourcecompare.sourceDataURI;\n var sourceStyleURI = sourcecompare.sourceStyleURI;\n\n var DefaultRenderer = require('./default-renderer');\n\n var MultiRenderer = require('./multi-renderer');\n var SubRenderer = require('./sub-renderer');\n\n var DummyRenderer = require('./dummy-renderer');\n}\n\nfunction Region(chr, min, max) {\n this.min = min;\n this.max = max;\n this.chr = chr;\n}\n\nfunction Browser(opts) {\n if (!opts) {\n opts = {};\n }\n\n this.renderers = { 'default': DefaultRenderer,\n 'dummy': DummyRenderer,\n 'multi': MultiRenderer,\n 'sub': SubRenderer\n };\n\n this.defaultRenderer = opts.renderer || DefaultRenderer;\n\n this.prefix = '//www.biodalliance.org/release-0.14/';\n\n this.sources = [];\n this.tiers = [];\n this.tierGroups = {};\n\n this.searchOnlySources = [];\n this.searchOnlySourceHolders = [];\n\n this.featureListeners = [];\n this.featureHoverListeners = [];\n this.viewListeners = [];\n this.regionSelectListeners = [];\n this.tierListeners = [];\n this.tierSelectionListeners = [];\n this.tierSelectionWrapListeners = [];\n\n this.cookieKey = 'browser';\n\n this.chains = {};\n\n this.pageName = 'svgHolder';\n this.zoomFactor = 1.0;\n this.maxPixelsPerBase = 10;\n this.origin = 0;\n this.targetQuantRes = 1.0;\n this.featurePanelWidth = 750;\n this.zoomBase = 100;\n this.zoomExpt = 30.0; // Back to being fixed....\n this.zoomSliderValue = 100;\n this.entryPoints = null;\n this.currentSeqMax = -1; // init once EPs are fetched.\n\n this.highlights = [];\n this.selectedTiers = [1];\n\n this.maxViewWidth = 500000;\n this.defaultSubtierMax = 100;\n\n this.highZoomThreshold = 0.2;\n this.mediumZoomThreshold = 0.01;\n\n this.minExtraWidth = 100.0;\n this.maxExtraWidth = 1000.0;\n\n // Options.\n\n this.reverseScrolling = false;\n this.rulerLocation = 'center';\n this.defaultHighlightFill = 'red';\n this.defaultHighlightAlpha = 0.3;\n this.exportHighlights = true;\n this.exportRuler = true;\n this.exportBanner = true;\n this.exportRegion = true;\n this.singleBaseHighlight = true;\n\n // Visual config.\n\n // this.tierBackgroundColors = [\"rgb(245,245,245)\", \"rgb(230,230,250)\" /* 'white' */];\n this.tierBackgroundColors = [\"rgb(245,245,245)\", 'white'];\n this.minTierHeight = 20;\n this.noDefaultLabels = false;\n\n // Registry\n\n this.availableSources = new Observed();\n this.defaultSources = [];\n this.mappableSources = {};\n\n // Central DAS Registry no longer available 2015-05\n\n this.registry = null; // '//www.dasregistry.org/das/sources';\n this.noRegistryTabs = true;\n\n this.defaultTrackAdderTab = null;\n\n this.hubs = [];\n this.hubObjects = [];\n\n this.sourceCache = new SourceCache();\n\n this.retina = true;\n\n this.useFetchWorkers = true;\n this.maxWorkers = 2;\n this.workerPath = '$$worker-all.js';\n this.resolvers = {};\n this.resolverSeed = 1;\n\n this.assemblyNamePrimary = true;\n this.assemblyNameUcsc = true;\n\n this.defaultSearchRegionPadding = 10000;\n\n // HTTP warning support\n\n this.httpCanaryURL = 'http://www.biodalliance.org/http-canary.txt';\n this.httpWarningURL = '//www.biodalliance.org/https.html';\n\n this.initListeners = [];\n\n if (opts.baseColors) {\n this.baseColors = opts.baseColors;\n } else {\n this.baseColors = {\n A: 'green',\n C: 'blue',\n G: 'orange',\n T: 'red',\n '-': 'hotpink', // deletion\n 'I': 'red' // insertion\n };\n }\n\n if (opts.viewStart !== undefined && typeof opts.viewStart !== 'number') {\n throw Error('viewStart must be an integer');\n }\n if (opts.viewEnd !== undefined && typeof opts.viewEnd !== 'number') {\n throw Error('viewEnd must be an integer');\n }\n if (opts.offscreenInitWidth !== undefined && typeof opts.offscreenInitWidth !== 'number') {\n throw Error('offscreenInitWidth must be an integer');\n }\n\n for (var k in opts) {\n this[k] = opts[k];\n }\n\n if (typeof opts.uiPrefix === 'string' && typeof opts.prefix !== 'string') {\n this.prefix = opts.uiPrefix;\n }\n // If the prefix only starts with a single '/' this is relative to the current\n // site, so we need to prefix the prefix with //{hostname}\n if (this.prefix.indexOf('//') < 0 && this.prefix.indexOf('/') === 0) {\n var location = window.location.hostname;\n if (window.location.port) {\n location += ':' + window.location.port;\n };\n this.prefix = '//' + location + this.prefix;\n }\n if (this.prefix.indexOf('//') === 0) {\n var proto = window.location.protocol;\n if (proto == 'http:' || proto == 'https:') {\n // Protocol-relative URLs okay.\n } else {\n console.log(window.location.protocol);\n console.log('WARNING: prefix is set to a protocol-relative URL (' + this.prefix + ' when loading from a non-HTTP source');\n this.prefix = 'http:' + this.prefix;\n }\n }\n\n if (!this.coordSystem) {\n throw Error('Coordinate system must be configured');\n }\n\n if (this.chr === undefined || this.viewStart === undefined || this.viewEnd === undefined) {\n throw Error('Viewed region (chr:start..end) must be defined');\n }\n\n var thisB = this;\n\n if (document.readyState === 'complete') {\n thisB.realInit();\n } else {\n var loadListener = function loadListener(ev) {\n window.removeEventListener('load', loadListener, false);\n thisB.realInit();\n };\n window.addEventListener('load', loadListener, false);\n }\n}\n\nBrowser.prototype.resolveURL = function (url) {\n return url.replace('$$', this.prefix);\n};\n\nBrowser.prototype.destroy = function () {\n window.removeEventListener('resize', this.resizeListener, false);\n if (this.fetchWorkers) {\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = this.fetchWorkers[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var worker = _step.value;\n\n worker.terminate();\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n }\n};\n\nBrowser.prototype.realInit = function () {\n var self = this;\n var thisB = this;\n\n if (this.wasInitialized) {\n console.log('Attemping to call realInit on an already-initialized Dalliance instance');\n return;\n }\n\n this.wasInitialized = true;\n\n if (typeof navigator !== 'undefined') {\n var ua = navigator.userAgent || 'dummy';\n if (ua.indexOf('Trident') >= 0 && ua.indexOf('rv:11') >= 0) {\n // console.log('Detected IE11, disabling tier pinning.');\n this.disablePinning = true;\n }\n }\n\n this.defaultChr = this.chr;\n this.defaultStart = this.viewStart;\n this.defaultEnd = this.viewEnd;\n this.defaultSources = [];\n for (var i = 0; i < this.sources.length; ++i) {\n var s = this.sources[i];\n if (s) this.defaultSources.push(s);\n }\n\n if (this.restoreStatus) {\n this.statusRestored = this.restoreStatus();\n }\n\n if (this.injectionPoint && this.injectionPoint instanceof Element) {\n this.browserHolderHolder = this.injectionPoint;\n } else if (this.injectionPoint) {\n this.browserHolderHolder = document.getElementById(this.injectionPoint);\n if (!this.browserHolderHolder) {\n throw Error('injectionPoint must point to a valid DOM element of element ID');\n }\n } else {\n this.browserHolderHolder = document.getElementById(this.pageName);\n if (!this.browserHolderHolder) {\n throw Error('pageName must be a valid element ID (or use the injectionPoint option instead)');\n }\n }\n\n this.browserHolderHolder.classList.add('dalliance-injection-point');\n this.browserHolder = makeElement('div', null, { className: 'dalliance dalliance-root', tabIndex: -1 });\n if (this.maxHeight) {\n this.browserHolder.style.maxHeight = this.maxHeight + 'px';\n } else if (this.maxHeight != undefined) {\n this.browserHolder.style.maxHeight = null;\n }\n removeChildren(this.browserHolderHolder);\n this.browserHolderHolder.appendChild(this.browserHolder);\n this.svgHolder = makeElement('div', null, { className: 'main-holder' });\n\n this.initUI(this.browserHolder, this.svgHolder);\n\n this.pinnedTierHolder = makeElement('div', null, { className: 'tier-holder tier-holder-pinned' });\n this.tierHolder = makeElement('div', this.makeLoader(24), { className: 'tier-holder tier-holder-rest' });\n\n this.locSingleBase = makeElement('span', '', { className: 'loc-single-base' });\n var locSingleBaseHolder = makeElement('div', this.locSingleBase, { className: 'loc-single-base-holder' });\n // Add listener to update single base location\n this.addViewListener(function (chr, minFloor, maxFloor, zoomSliderValue, zoomSliderDict, min, max) {\n // Just setting textContent causes layout flickering in Blink.\n // This approach means that the element is never empty.\n var loc = Math.round((max + min) / 2);\n self.locSingleBase.appendChild(document.createTextNode(chr + ':' + formatLongInt(loc)));\n self.locSingleBase.removeChild(self.locSingleBase.firstChild);\n });\n\n if (this.disablePinning) {\n this.tierHolderHolder = this.tierHolder;\n } else {\n this.tierHolderHolder = makeElement('div', [locSingleBaseHolder, this.pinnedTierHolder, this.tierHolder], { className: 'tier-holder-holder' });\n this.svgHolder.appendChild(this.tierHolderHolder);\n }\n this.svgHolder.appendChild(this.tierHolderHolder);\n\n this.bhtmlRoot = makeElement('div');\n if (!this.disablePoweredBy) {\n this.bhtmlRoot.appendChild(makeElement('span', ['Powered by ', makeElement('a', 'Biodalliance', { href: 'http://www.biodalliance.org/' }), ' ' + VERSION], { className: 'powered-by' }));\n }\n this.browserHolder.appendChild(this.bhtmlRoot);\n\n this.resizeListener = function (ev) {\n thisB.resizeViewer();\n };\n\n this.ruler = makeElement('div', null, { className: 'guideline' });\n this.ruler2 = makeElement('div', null, { className: 'single-base-guideline' });\n this.tierHolderHolder.appendChild(this.ruler);\n this.tierHolderHolder.appendChild(this.ruler2);\n this.chainConfigs = this.chains || {};\n this.chains = {};\n for (var k in this.chainConfigs) {\n var cc = this.chainConfigs[k];\n if (cc instanceof Chainset) {\n console.log('WARNING: Should no longer use \"new Chainset\" in Biodalliance configurations.');\n }\n this.chains[k] = new Chainset(cc);\n }\n\n var promisedWorkers;\n if (this.maxWorkers > 0) {\n var pw = [];\n for (var fi = 0; fi < this.maxWorkers; ++fi) {\n pw.push(makeFetchWorker(this));\n }promisedWorkers = Promise.all(pw);\n } else {\n promisedWorkers = Promise.resolve([]);\n }\n\n this.fetchWorkers = null;\n this.nextWorker = 0;\n promisedWorkers.then(function (v) {\n console.log('Booted ' + v.length + ' workers');\n thisB.fetchWorkers = v;\n }, function (v) {\n console.log('Failed to boot workers', v);\n }).then(function () {\n if (self.offscreenInitWidth || window.getComputedStyle(thisB.browserHolderHolder).display != 'none' && thisB.tierHolder.getBoundingClientRect().width > 0) {\n setTimeout(function () {\n thisB.realInit2();\n }, 1);\n } else {\n var pollInterval = setInterval(function () {\n if (window.getComputedStyle(thisB.browserHolderHolder).display != 'none' && thisB.tierHolder.getBoundingClientRect().width > 0) {\n clearInterval(pollInterval);\n thisB.realInit2();\n }\n }, 300);\n }\n });\n};\n\nBrowser.prototype.realInit2 = function () {\n var _this = this;\n\n var thisB = this;\n\n // Remove the loader icon, if needed\n removeChildren(this.tierHolder);\n removeChildren(this.pinnedTierHolder);\n\n this.featurePanelWidth = this.tierHolder.getBoundingClientRect().width | thisB.offscreenInitWidth | 0;\n window.addEventListener('resize', this.resizeListener, false);\n\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n if (!this.zoomMax) {\n this.zoomMax = this.zoomExpt * Math.log(this.maxViewWidth / this.zoomBase);\n this.zoomMin = this.zoomExpt * Math.log(this.featurePanelWidth / this.maxPixelsPerBase / this.zoomBase);\n }\n this.zoomSliderValue = this.zoomExpt * Math.log((this.viewEnd - this.viewStart + 1) / this.zoomBase);\n\n // Event handlers\n\n this.tierHolderHolder.addEventListener('mousewheel', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n\n if (ev.wheelDeltaX) {\n var delta = ev.wheelDeltaX / 5;\n if (!thisB.reverseScrolling) {\n delta = -delta;\n }\n thisB.move(delta);\n }\n\n if (ev.wheelDeltaY) {\n var delta = ev.wheelDeltaY;\n if (thisB.reverseScrolling) {\n delta = -delta;\n }\n thisB.tierHolder.scrollTop += delta;\n }\n }, false);\n\n this.tierHolderHolder.addEventListener('MozMousePixelScroll', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n if (ev.axis == 1) {\n if (ev.detail != 0) {\n var delta = ev.detail / 4;\n if (thisB.reverseScrolling) {\n delta = -delta;\n }\n thisB.move(delta);\n }\n } else {\n var delta = ev.detail;\n if (!thisB.reverseScrolling) {\n delta = -delta;\n }\n\n thisB.tierHolder.scrollTop += delta;\n }\n }, false);\n\n this.tierHolderHolder.addEventListener('touchstart', function (ev) {\n return thisB.touchStartHandler(ev);\n }, false);\n this.tierHolderHolder.addEventListener('touchmove', function (ev) {\n return thisB.touchMoveHandler(ev);\n }, false);\n this.tierHolderHolder.addEventListener('touchend', function (ev) {\n return thisB.touchEndHandler(ev);\n }, false);\n this.tierHolderHolder.addEventListener('touchcancel', function (ev) {\n return thisB.touchCancelHandler(ev);\n }, false);\n\n var keyHandler = function keyHandler(ev) {\n // console.log('cbkh: ' + ev.keyCode);\n if (ev.keyCode == 13) {\n // enter\n var layoutsChanged = false;\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n var t = thisB.tiers[ti];\n if (t.wantedLayoutHeight && t.wantedLayoutHeight != t.layoutHeight) {\n t.layoutHeight = t.wantedLayoutHeight;\n t.clipTier();\n layoutsChanged = true;\n }\n }\n if (layoutsChanged) {\n thisB.arrangeTiers();\n }\n } else if (ev.keyCode == 32 || ev.charCode == 32) {\n // space\n if (!thisB.isSnapZooming) {\n thisB.isSnapZooming = true;\n var newZoom = (thisB.savedZoom || 0.0) + thisB.zoomMin;\n thisB.savedZoom = thisB.zoomSliderValue - thisB.zoomMin;\n thisB.zoomSliderValue = newZoom;\n thisB.zoom(Math.exp(1.0 * newZoom / thisB.zoomExpt));\n } else {\n thisB.isSnapZooming = false;\n var newZoom = (thisB.savedZoom || 20.0) + thisB.zoomMin;\n thisB.savedZoom = thisB.zoomSliderValue - thisB.zoomMin;\n thisB.zoomSliderValue = newZoom;\n thisB.zoom(Math.exp(1.0 * newZoom / thisB.zoomExpt));\n }\n ev.stopPropagation();ev.preventDefault();\n } else if (ev.keyCode == 85) {\n // u\n if (thisB.uiMode === 'opts') {\n // if the options are visible, toggle the checkbox too\n var check = document.getElementById(\"singleBaseHightlightButton\").checked;\n document.getElementById(\"singleBaseHightlightButton\").checked = !check;\n }\n thisB.singleBaseHighlight = !thisB.singleBaseHighlight;\n thisB.positionRuler();\n ev.stopPropagation();ev.preventDefault();\n } else if (ev.keyCode == 39) {\n // right arrow\n ev.stopPropagation();ev.preventDefault();\n thisB.scrollArrowKey(ev, -1);\n } else if (ev.keyCode == 37) {\n // left arrow\n ev.stopPropagation();ev.preventDefault();\n thisB.scrollArrowKey(ev, 1);\n } else if (ev.keyCode == 38 || ev.keyCode == 87) {\n // up arrow | w\n ev.stopPropagation();ev.preventDefault();\n\n if (ev.shiftKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n var ch = tt.forceHeight || tt.subtiers[0].height;\n if (ch >= 40) {\n tt.mergeConfig({ height: ch - 10 });\n }\n } else if (ev.ctrlKey || ev.metaKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n\n if (tt.quantLeapThreshold) {\n var th = tt.subtiers[0].height;\n var tq = tt.subtiers[0].quant;\n if (!tq) return;\n\n var qmin = 1.0 * tq.min;\n var qmax = 1.0 * tq.max;\n\n var qscale = (qmax - qmin) / th;\n tt.mergeConfig({ quantLeapThreshold: qmin + ((Math.round((tt.quantLeapThreshold - qmin) / qscale) | 0) + 1) * qscale });\n\n tt.notify('Threshold: ' + formatQuantLabel(tt.quantLeapThreshold));\n }\n } else if (ev.altKey) {\n var cnt = thisB.selectedTiers.length;\n if (cnt == 0) return;\n\n var st = thisB.selectedTiers[0];\n var contiguous = true;\n var mt = [];\n for (var si = 0; si < thisB.selectedTiers.length; ++si) {\n mt.push(thisB.tiers[thisB.selectedTiers[si]]);\n if (si > 0 && thisB.selectedTiers[si] - thisB.selectedTiers[si - 1] != 1) contiguous = false;\n }\n\n if (contiguous && st <= 0) return;\n\n for (var si = thisB.selectedTiers.length - 1; si >= 0; --si) {\n thisB.tiers.splice(thisB.selectedTiers[si], 1);\n }thisB.selectedTiers.splice(0, cnt);\n\n var ip = contiguous ? st - 1 : st;\n for (var si = 0; si < mt.length; ++si) {\n thisB.tiers.splice(ip + si, 0, mt[si]);\n thisB.selectedTiers.push(ip + si);\n }\n\n thisB.withPreservedSelection(thisB._ensureTiersGrouped);\n thisB.markSelectedTiers();\n thisB.notifyTierSelection();\n thisB.reorderTiers();\n thisB.notifyTier(\"selected\", st);\n } else {\n var st = thisB.getSelectedTier();\n if (st > 0) {\n thisB.setSelectedTier(st - 1);\n var nst = thisB.tiers[thisB.getSelectedTier()];\n var top = nst.row.offsetTop,\n bottom = top + nst.row.offsetHeight;\n if (top < thisB.tierHolder.scrollTop || bottom > thisB.tierHolder.scrollTop + thisB.tierHolder.offsetHeight) {\n thisB.tierHolder.scrollTop = top;\n }\n } else {\n thisB.notifyTierSelectionWrap(-1);\n }\n }\n } else if (ev.keyCode == 40 || ev.keyCode == 83) {\n // down arrow | s\n ev.stopPropagation();ev.preventDefault();\n\n if (ev.shiftKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n var ch = tt.forceHeight || tt.subtiers[0].height;\n tt.mergeConfig({ height: ch + 10 });\n } else if (ev.ctrlKey || ev.metaKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n\n if (tt.quantLeapThreshold) {\n var th = tt.subtiers[0].height;\n var tq = tt.subtiers[0].quant;\n if (!tq) return;\n\n var qmin = 1.0 * tq.min;\n var qmax = 1.0 * tq.max;\n var qscale = (qmax - qmin) / th;\n\n var it = Math.round((tt.quantLeapThreshold - qmin) / qscale) | 0;\n if (it > 1) {\n tt.mergeConfig({ quantLeapThreshold: qmin + (it - 1) * qscale });\n tt.notify('Threshold: ' + formatQuantLabel(tt.quantLeapThreshold));\n }\n }\n } else if (ev.altKey) {\n var cnt = thisB.selectedTiers.length;\n if (cnt == 0) return;\n\n var st = thisB.selectedTiers[0];\n var discontig = 0;\n var mt = [];\n for (var si = 0; si < thisB.selectedTiers.length; ++si) {\n mt.push(thisB.tiers[thisB.selectedTiers[si]]);\n if (si > 0) discontig += thisB.selectedTiers[si] - thisB.selectedTiers[si - 1] - 1;\n }\n var contiguous = discontig == 0;\n\n if (contiguous && st + cnt >= thisB.tiers.length) return;\n\n for (var si = thisB.selectedTiers.length - 1; si >= 0; --si) {\n thisB.tiers.splice(thisB.selectedTiers[si], 1);\n }thisB.selectedTiers.splice(0, cnt);\n\n var ip = contiguous ? st + 1 : st + discontig;\n for (var si = 0; si < mt.length; ++si) {\n thisB.tiers.splice(ip + si, 0, mt[si]);\n thisB.selectedTiers.push(ip + si);\n }\n\n thisB.withPreservedSelection(function () {\n thisB._ensureTiersGrouped(true);\n });\n thisB.markSelectedTiers();\n thisB.notifyTierSelection();\n thisB.reorderTiers();\n thisB.notifyTier(\"selected\", st);\n } else {\n var st = thisB.getSelectedTier();\n if (st < thisB.tiers.length - 1) {\n thisB.setSelectedTier(st + 1);\n var nst = thisB.tiers[thisB.getSelectedTier()];\n var top = nst.row.offsetTop,\n bottom = top + nst.row.offsetHeight;\n if (top < thisB.tierHolder.scrollTop || bottom > thisB.tierHolder.scrollTop + thisB.tierHolder.offsetHeight) {\n thisB.tierHolder.scrollTop = Math.min(top, bottom - thisB.tierHolder.offsetHeight);\n }\n }\n }\n } else if (ev.keyCode == 187 || ev.keyCode == 61) {\n // +\n ev.stopPropagation();ev.preventDefault();\n thisB.zoomStep(-10);\n } else if (ev.keyCode == 189 || ev.keyCode == 173) {\n // -\n ev.stopPropagation();ev.preventDefault();\n thisB.zoomStep(10);\n } else if (ev.keyCode == 73 || ev.keyCode == 105) {\n // i\n ev.stopPropagation();ev.preventDefault();\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var t = thisB.tiers[st];\n if (!t.infoVisible) {\n t.infoElement.style.display = 'block';\n t.updateHeight();\n t.infoVisible = true;\n } else {\n t.infoElement.style.display = 'none';\n t.updateHeight();\n t.infoVisible = false;\n }\n } else if (ev.keyCode == 84 || ev.keyCode == 116) {\n // t\n var bumpStatus;\n if (ev.shiftKey) {\n ev.stopPropagation();ev.preventDefault();\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n var t = thisB.tiers[ti];\n if (t.dasSource.collapseSuperGroups) {\n if (bumpStatus === undefined) {\n bumpStatus = !t.bumped;\n }\n t.mergeConfig({ bumped: bumpStatus });\n }\n }\n } else if (!ev.ctrlKey && !ev.metaKey) {\n ev.stopPropagation();ev.preventDefault();\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var t = thisB.tiers[st];\n\n if (t.dasSource.collapseSuperGroups) {\n if (bumpStatus === undefined) {\n bumpStatus = !t.bumped;\n }\n t.mergeConfig({ bumped: bumpStatus });\n }\n }\n } else if (ev.keyCode == 77 || ev.keyCode == 109) {\n // m\n ev.stopPropagation();ev.preventDefault();\n if ((ev.ctrlKey || ev.metaKey) && thisB.selectedTiers.length > 1) {\n thisB.mergeSelectedTiers();\n }\n } else if (ev.keyCode == 68 || ev.keyCode == 100) {\n // d\n ev.stopPropagation();ev.preventDefault();\n if (ev.ctrlKey || ev.metaKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n thisB.addTier(thisB.tiers[st].dasSource);\n }\n } else if (ev.keyCode == 80 || ev.keyCode == 112) {\n // p\n if (ev.ctrlKey || ev.metaKey) {\n // Need to be careful because order of tiers could change\n // once we start updating pinning.\n var tt = [];\n for (var st = 0; st < thisB.selectedTiers.length; ++st) {\n tt.push(thisB.tiers[thisB.selectedTiers[st]]);\n }\n for (var ti = 0; ti < tt.length; ++ti) {\n tt[ti].mergeConfig({ pinned: !tt[ti].pinned });\n }\n }\n } else {\n // console.log('key: ' + ev.keyCode + '; char: ' + ev.charCode);\n }\n };\n\n this.browserHolder.addEventListener('focus', function (ev) {\n thisB.browserHolder.addEventListener('keydown', keyHandler, false);\n }, false);\n this.browserHolder.addEventListener('blur', function (ev) {\n thisB.browserHolder.removeEventListener('keydown', keyHandler, false);\n }, false);\n\n // Popup support (does this really belong here? FIXME)\n this.hPopupHolder = makeElement('div');\n this.hPopupHolder.style['font-family'] = 'helvetica';\n this.hPopupHolder.style['font-size'] = '12pt';\n this.hPopupHolder.classList.add('dalliance');\n document.body.appendChild(this.hPopupHolder);\n\n for (var t = 0; t < this.sources.length; ++t) {\n var source = this.sources[t];\n if (!source) continue;\n\n var config = {};\n if (this.restoredConfigs) {\n config = this.restoredConfigs[t];\n }\n\n if (!source.disabled) {\n this.makeTier(source, config).then(function (tier) {\n thisB.refreshTier(tier);\n });\n }\n }\n\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = this.searchOnlySources[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var _source = _step2.value;\n\n if (!_source.disabled) {\n var _createSources = this.createSources(_source),\n features = _createSources.features;\n\n if (features) {\n this.searchOnlySourceHolders.push({\n dasSource: _source,\n featureSource: features\n });\n }\n }\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n\n if (this.onFirstRender) {\n Promise.all(this.tiers.map(function (t) {\n return t.firstRenderPromise;\n })).then(function () {\n return _this.onFirstRender();\n }).catch(function (err) {\n return console.log(err);\n });\n }\n\n thisB._ensureTiersGrouped();\n thisB.arrangeTiers();\n thisB.reorderTiers();\n\n var ss = this.getSequenceSource();\n if (ss) {\n ss.getSeqInfo(this.chr, function (si) {\n if (si) thisB.currentSeqMax = si.length;else thisB.currentSeqMax = -1;\n });\n }\n\n this.queryRegistry();\n for (var m in this.chains) {\n this.queryRegistry(m, true);\n }\n\n if (this.hubs) {\n for (var hi = 0; hi < this.hubs.length; ++hi) {\n var hc = this.hubs[hi];\n if (typeof hc == 'string') {\n hc = { url: hc };\n };\n\n (function (hc) {\n connectTrackHub(hc.url, function (hub, err) {\n if (err) {\n console.log(err);\n } else {\n var tdb;\n if (hc.genome) tdb = hub.genomes[hc.genome];else tdb = hub.genomes[thisB.coordSystem.ucscName];\n\n if (tdb) {\n if (hc.mapping) tdb.mapping = hc.mapping;\n if (hc.label) tdb.hub.altLabel = hc.label;\n thisB.hubObjects.push(tdb);\n }\n }\n }, hc);\n })(hc);\n }\n }\n\n if (this.fullScreen) {\n this.setFullScreenHeight();\n }\n\n if (!this.statusRestored && this.storeStatus) {\n this.storeStatus();\n }\n\n thisB.setLocation(this.chr, this.viewStart, this.viewEnd, function () {\n thisB.setSelectedTier(1);\n // Ping any init listeners.\n for (var ii = 0; ii < thisB.initListeners.length; ++ii) {\n try {\n thisB.initListeners[ii].call(thisB);\n } catch (e) {\n console.log(e);\n }\n }\n });\n};\n\n//\n// Touch event support\n//\n\nBrowser.prototype.touchStartHandler = function (ev) {\n // Events not consumed so they can be interpretted as clicks as well.\n\n this.touchOriginX = ev.touches[0].pageX;\n this.touchOriginY = ev.touches[0].pageY;\n if (ev.touches.length == 2) {\n var sep = Math.abs(ev.touches[0].pageX - ev.touches[1].pageX);\n this.zooming = true;\n this.zoomLastSep = this.zoomInitialSep = sep;\n this.zoomInitialScale = this.scale;\n }\n};\n\nBrowser.prototype.touchMoveHandler = function (ev) {\n // These events *are* consumed to ensure we never get any dragging that\n // we don't manage ourselves.\n\n ev.stopPropagation();ev.preventDefault();\n\n if (ev.touches.length == 1) {\n var touchX = ev.touches[0].pageX;\n var touchY = ev.touches[0].pageY;\n if (this.touchOriginX && touchX != this.touchOriginX) {\n this.move(touchX - this.touchOriginX);\n }\n if (this.touchOriginY && touchY != this.touchOriginY) {\n this.tierHolder.scrollTop -= touchY - this.touchOriginY;\n }\n this.touchOriginX = touchX;\n this.touchOriginY = touchY;\n } else if (this.zooming && ev.touches.length == 2) {\n var sep = Math.abs(ev.touches[0].pageX - ev.touches[1].pageX);\n if (sep != this.zoomLastSep) {\n var cp = (ev.touches[0].pageX + ev.touches[1].pageX) / 2;\n var scp = this.viewStart + cp / this.scale | 0;\n this.scale = this.zoomInitialScale * (sep / this.zoomInitialSep);\n this.viewStart = scp - cp / this.scale | 0;\n for (var i = 0; i < this.tiers.length; ++i) {\n tiers[i].getRenderer().drawTier(tiers[i]);\n }\n }\n this.zoomLastSep = sep;\n }\n};\n\nBrowser.prototype.touchEndHandler = function (ev) {};\n\nBrowser.prototype.touchCancelHandler = function (ev) {};\n\nBrowser.prototype.makeTier = function (source, config) {\n try {\n return this.realMakeTier(source, config);\n } catch (e) {\n console.log('Error initializing', source);\n console.log(e.stack || e);\n }\n};\n\nBrowser.prototype.realMakeTier = function (source, config) {\n var thisB = this;\n var background = null;\n if (this.tierBackgroundColors) {\n background = this.tierBackgroundColors[this.tiers.length % this.tierBackgroundColors.length];\n }\n\n var tier = new DasTier(this, source, config, background);\n tier.oorigin = this.viewStart;\n\n var isDragging = false;\n var dragOrigin, dragMoveOrigin;\n var hoverTimeout;\n\n var featureLookup = function featureLookup(rx, ry) {\n var st = tier.subtiers;\n if (!st) {\n return;\n }\n\n var sti = 0;\n ry -= tier.padding;;\n while (sti < st.length && ry > st[sti].height && sti < st.length - 1) {\n ry = ry - st[sti].height - tier.padding;\n ++sti;\n }\n if (sti >= st.length) {\n return;\n }\n\n var glyphs = st[sti].glyphs;\n var viewCenter = (thisB.viewStart + thisB.viewEnd) / 2;\n var offset = (tier.glyphCacheOrigin - thisB.viewStart) * thisB.scale;\n rx -= offset;\n\n return glyphLookup(glyphs, rx, ry);\n };\n\n var dragMoveHandler = function dragMoveHandler(ev) {\n ev.preventDefault();ev.stopPropagation();\n var rx = ev.clientX;\n if (rx != dragMoveOrigin) {\n thisB.move(rx - dragMoveOrigin, true);\n dragMoveOrigin = rx;\n }\n thisB.isDragging = true;\n };\n\n var dragUpHandler = function dragUpHandler(ev) {\n window.removeEventListener('mousemove', dragMoveHandler, true);\n window.removeEventListener('mouseup', dragUpHandler, true);\n thisB.move(ev.clientX - dragMoveOrigin); // Snap back (FIXME: consider animation)\n };\n\n tier.viewport.addEventListener('mousedown', function (ev) {\n thisB.browserHolder.focus();\n ev.preventDefault();\n var br = tier.row.getBoundingClientRect();\n var rx = ev.clientX,\n ry = ev.clientY;\n\n window.addEventListener('mousemove', dragMoveHandler, true);\n window.addEventListener('mouseup', dragUpHandler, true);\n dragOrigin = dragMoveOrigin = rx;\n thisB.isDragging = false; // Not dragging until a movement event arrives.\n }, false);\n\n tier.viewport.addEventListener('mousemove', function (ev) {\n var br = tier.row.getBoundingClientRect();\n var rx = ev.clientX - br.left,\n ry = ev.clientY - br.top;\n\n var hit = featureLookup(rx, ry);\n if (hit && hit.length > 0) {\n tier.row.style.cursor = 'pointer';\n } else {\n tier.row.style.cursor = 'default';\n }\n\n if (hoverTimeout) {\n clearTimeout(hoverTimeout);\n }\n\n if (isDragging) {\n // if (tier.dasSource.tier_type !== 'sequence' && rx != dragMoveOrigin) {\n // thisB.move((rx - dragMoveOrigin));\n // dragMoveOrigin = rx;\n // }\n } else {\n hoverTimeout = setTimeout(function () {\n var hit = featureLookup(rx, ry);\n if (hit && hit.length > 0) {\n thisB.notifyFeatureHover(ev, hit[hit.length - 1], hit, tier);\n }\n }, 1000);\n }\n });\n\n var doubleClickTimeout = null;\n tier.viewport.addEventListener('mouseup', function (ev) {\n var br = tier.row.getBoundingClientRect();\n var rx = ev.clientX - br.left,\n ry = ev.clientY - br.top;\n\n var hit = featureLookup(rx, ry);\n if (hit && hit.length > 0 && !thisB.isDragging) {\n if (doubleClickTimeout) {\n clearTimeout(doubleClickTimeout);\n doubleClickTimeout = null;\n thisB.featureDoubleClick(hit, rx, ry);\n } else {\n doubleClickTimeout = setTimeout(function () {\n doubleClickTimeout = null;\n thisB.notifyFeature(ev, hit[hit.length - 1], hit, tier);\n }, 500);\n }\n }\n\n if (thisB.isDragging && rx != dragOrigin && tier.sequenceSource) {\n var a = thisB.viewStart + rx / thisB.scale;\n var b = thisB.viewStart + dragOrigin / thisB.scale;\n\n var min, max;\n if (a < b) {\n min = a | 0;max = b | 0;\n } else {\n min = b | 0;max = a | 0;\n }\n\n thisB.notifyRegionSelect(thisB.chr, min, max);\n }\n thisB.isDragging = false;\n }, false);\n\n tier.viewport.addEventListener('mouseout', function (ev) {\n isDragging = false;\n });\n\n tier.removeButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n thisB.removeTier({ index: ti });\n break;\n }\n }\n }, false);\n tier.nameButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n\n if (ev.shiftKey) {\n var hitTier = -1;\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n hitTier = ti;\n break;\n }\n }\n if (hitTier >= 0) {\n var i = thisB.selectedTiers.indexOf(hitTier);\n if (i >= 0) {\n thisB.selectedTiers.splice(i, 1);\n } else {\n thisB.selectedTiers.push(hitTier);\n thisB.selectedTiers.sort();\n }\n thisB.markSelectedTiers();\n thisB.notifyTierSelection();\n\n if (thisB.selectedTiers.length > 0) {\n thisB.browserHolder.focus();\n } else {\n thisB.notifyTierSelectionWrap(-1);\n }\n }\n } else {\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n thisB.browserHolder.focus();\n if (thisB.selectedTiers.length != 1 || thisB.selectedTiers[0] != ti) {\n thisB.setSelectedTier(ti);\n return;\n }\n }\n }\n\n if (!tier.infoVisible) {\n tier.infoElement.style.display = 'block';\n tier.updateHeight();\n tier.infoVisible = true;\n } else {\n tier.infoElement.style.display = 'none';\n tier.updateHeight();\n tier.infoVisible = false;\n }\n }\n }, false);\n tier.bumpButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n var bumpStatus;\n var t = tier;\n if (t.dasSource.collapseSuperGroups) {\n if (bumpStatus === undefined) {\n bumpStatus = !t.bumped;\n }\n t.mergeConfig({ bumped: bumpStatus });\n }\n }, false);\n\n var dragLabel;\n var dragTierHolder;\n var dragTierHolderScrollLimit;\n var tierOrdinal;\n var yAtLastReorder;\n var tiersWereReordered = false;\n\n var labelDragHandler = function labelDragHandler(ev) {\n var label = tier.label;\n\n ev.stopPropagation();ev.preventDefault();\n if (!dragLabel) {\n if (tier.pinned) {\n dragTierHolder = thisB.pinnedTierHolder;\n } else {\n dragTierHolder = thisB.tierHolder;\n }\n dragTierHolderScrollLimit = dragTierHolder.scrollHeight - dragTierHolder.offsetHeight;\n\n dragLabel = label.cloneNode(true);\n dragLabel.style.cursor = 'pointer';\n dragTierHolder.appendChild(dragLabel);\n label.style.visibility = 'hidden';\n\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n tierOrdinal = ti;\n break;\n }\n }\n\n yAtLastReorder = ev.clientY;\n }\n\n var holderBCR = dragTierHolder.getBoundingClientRect();\n dragLabel.style.left = label.getBoundingClientRect().left - holderBCR.left + 'px';\n dragLabel.style.top = ev.clientY - holderBCR.top + dragTierHolder.scrollTop - 10 + 'px';\n\n var pty = ev.clientY - holderBCR.top + dragTierHolder.scrollTop;\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n var tt = thisB.tiers[ti];\n if (tt.pinned ^ tier.pinned) continue;\n\n var ttr = tt.row.getBoundingClientRect();\n pty -= ttr.bottom - ttr.top;\n if (pty < 0) {\n if (ti < tierOrdinal && ev.clientY < yAtLastReorder || ti > tierOrdinal && ev.clientY > yAtLastReorder) {\n thisB.withPreservedSelection(function () {\n thisB.tiers.splice(tierOrdinal, 1);\n thisB.tiers.splice(ti, 0, tier);\n thisB._ensureTiersGrouped(ti > tierOrdinal);\n });\n\n for (var tix = 0; tix < thisB.tiers.length; ++tix) {\n if (thisB.tiers[tix] == tier) tierOrdinal = tix;\n }yAtLastReorder = ev.clientY;\n thisB.reorderTiers();\n dragTierHolder.appendChild(dragLabel); // Because reorderTiers removes all children.\n tiersWereReordered = true;\n }\n break;\n }\n }\n\n if (dragLabel.offsetTop < dragTierHolder.scrollTop) {\n dragTierHolder.scrollTop -= dragTierHolder.scrollTop - dragLabel.offsetTop;\n } else if (dragLabel.offsetTop + dragLabel.offsetHeight > dragTierHolder.scrollTop + dragTierHolder.offsetHeight) {\n dragTierHolder.scrollTop = Math.min(dragTierHolder.scrollTop + (dragLabel.offsetTop + dragLabel.offsetHeight) - (dragTierHolder.scrollTop + dragTierHolder.offsetHeight), dragTierHolderScrollLimit);\n }\n };\n\n var labelReleaseHandler = function labelReleaseHandler(ev) {\n var label = tier.label;\n\n ev.stopPropagation();ev.preventDefault();\n if (dragLabel) {\n dragLabel.style.cursor = 'auto';\n dragTierHolder.removeChild(dragLabel);\n dragLabel = null;\n label.style.visibility = 'visible';\n }\n document.removeEventListener('mousemove', labelDragHandler, false);\n document.removeEventListener('mouseup', labelReleaseHandler, false);\n\n if (tiersWereReordered) {\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] == tier) {\n thisB.setSelectedTier(ti);\n break;\n }\n }\n thisB.notifyTier(\"reordered\", tier);\n }\n };\n\n tier.label.addEventListener('mousedown', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n tiersWereReordered = false;\n document.addEventListener('mousemove', labelDragHandler, false);\n document.addEventListener('mouseup', labelReleaseHandler, false);\n }, false);\n\n this.tiers.push(tier); // NB this currently tells any extant knownSpace about the new tier.\n\n // fetches stylesheet\n return tier.init().then(function (updatedTier) {\n updatedTier.currentlyHeight = 50;\n thisB.updateHeight();\n updatedTier.updateLabel();\n\n thisB.withPreservedSelection(thisB._ensureTiersGrouped);\n updatedTier._updateFromConfig();\n thisB.reorderTiers();\n\n return updatedTier;\n });\n};\n\nBrowser.prototype.reorderTiers = function () {\n removeChildren(this.tierHolder);\n removeChildren(this.pinnedTierHolder);\n if (this.disablePinning) {\n this.tierHolder.appendChild(this.ruler);\n this.tierHolder.appendChild(this.ruler2);\n }\n var hasPinned = false;\n var pinnedTiers = [],\n unpinnedTiers = [];\n for (var i = 0; i < this.tiers.length; ++i) {\n var t = this.tiers[i];\n var visible = ['sub', 'dummy'].indexOf(this.tiers[i].dasSource.renderer) === -1;\n if (t.pinned && !this.disablePinning) {\n pinnedTiers.push(t);\n if (visible) this.pinnedTierHolder.appendChild(this.tiers[i].row);\n hasPinned = true;\n } else {\n unpinnedTiers.push(t);\n if (visible) this.tierHolder.appendChild(this.tiers[i].row);\n }\n }\n\n this.withPreservedSelection(function () {\n this.tiers.splice(0, this.tiers.length);\n for (var i = 0; i < pinnedTiers.length; ++i) {\n this.tiers.push(pinnedTiers[i]);\n }for (var i = 0; i < unpinnedTiers.length; ++i) {\n this.tiers.push(unpinnedTiers[i]);\n }\n });\n\n if (hasPinned) this.pinnedTierHolder.classList.add('tier-holder-pinned-full');else this.pinnedTierHolder.classList.remove('tier-holder-pinned-full');\n\n this.arrangeTiers();\n};\n\nBrowser.prototype.withPreservedSelection = function (f) {\n var st = [];\n for (var xi = 0; xi < this.selectedTiers.length; ++xi) {\n st.push(this.tiers[this.selectedTiers[xi]]);\n }\n\n f.call(this);\n\n this.selectedTiers = [];\n for (var sti = 0; sti < this.tiers.length; ++sti) {\n if (st.indexOf(this.tiers[sti]) >= 0) this.selectedTiers.push(sti);\n }\n};\n\nBrowser.prototype.refreshTier = function (tier, tierCallback) {\n var renderer = this.getTierRenderer(tier);\n if (tier.dasSource.renderer === 'multi') {\n renderer.drawTier(tier);\n } else {\n var renderCallback = tierCallback || renderer.renderTier;\n if (this.knownSpace) {\n this.knownSpace.invalidate(tier, renderCallback);\n }\n }\n};\n\nBrowser.prototype.getTierRenderer = function (tier) {\n var renderer = tier.dasSource.renderer || this.defaultRenderer;\n if (typeof renderer === 'string') {\n return this.renderers[renderer];\n } else if (typeof renderer.renderTier === 'function' && typeof renderer.drawTier === 'function') {\n return renderer;\n } else {\n console.log(\"Tier doesn't have a renderer\");\n }\n};\n\n/* Internal use only, assumes selection is being managed elsewhere... */\n\nBrowser.prototype._ensureTiersGrouped = function (down) {\n var groupedTiers = {};\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (t.dasSource.tierGroup) {\n pusho(groupedTiers, t.dasSource.tierGroup, t);\n }\n }\n\n var newTiers = [];\n if (down) this.tiers.reverse();\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (t.dasSource.tierGroup) {\n var nt = groupedTiers[t.dasSource.tierGroup];\n if (nt) {\n if (down) nt.reverse();\n for (var nti = 0; nti < nt.length; ++nti) {\n newTiers.push(nt[nti]);\n }groupedTiers[t.dasSource.tierGroup] = null;\n }\n } else {\n newTiers.push(t);\n }\n }\n if (down) newTiers.reverse();\n this.tiers.splice(0, this.tiers.length);\n for (var nti = 0; nti < newTiers.length; ++nti) {\n this.tiers.push(newTiers[nti]);\n }\n};\n\nBrowser.prototype.arrangeTiers = function () {\n var arrangedTiers = [];\n var groupedTiers = {};\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (t.pinned) {\n arrangedTiers.push(t);\n if (t.dasSource.tierGroup) {\n pusho(groupedTiers, t.dasSource.tierGroup, t);\n }\n }\n }\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (!t.pinned) {\n arrangedTiers.push(t);\n if (t.dasSource.tierGroup) {\n pusho(groupedTiers, t.dasSource.tierGroup, t);\n }\n }\n }\n\n for (var g in groupedTiers) {\n var tiers = groupedTiers[g];\n var tierGroup = this.tierGroups[g];\n if (!tierGroup) {\n tierGroup = {\n element: makeElement('div', makeElement('span', g, { className: 'tier-group-label' }), { className: \"tier-group\" })\n };\n this.tierGroups[g] = tierGroup;\n }\n\n if (tierGroup.element.parentNode) tierGroup.element.parentNode.removeChild(tierGroup.element);\n\n var holder = tiers[0].pinned ? this.pinnedTierHolder : this.tierHolder;\n var min = 10000000,\n max = 0;\n for (var ti = 0; ti < tiers.length; ++ti) {\n var row = tiers[ti].row;\n min = Math.min(min, row.offsetTop);\n max = Math.max(max, row.offsetTop + row.offsetHeight);\n }\n tierGroup.element.style.top = min + 'px';\n tierGroup.element.style.left = '0px';\n tierGroup.element.style.height = max - min + 'px';\n holder.appendChild(tierGroup.element);\n }\n\n if (this.tierBackgroundColors) {\n for (var ti = 0; ti < arrangedTiers.length; ++ti) {\n var t = arrangedTiers[ti];\n t.setBackground(this.tierBackgroundColors[ti % this.tierBackgroundColors.length]);\n if (t.dasSource.tierGroup) t.label.style.left = '18px';else t.label.style.left = '2px';\n t.background = this.tierBackgroundColors[ti % this.tierBackgroundColors.length];\n }\n }\n};\n\nBrowser.prototype.refresh = function () {\n this.retrieveTierData(this.tiers);\n this.drawOverlays();\n this.positionRuler();\n};\n\nvar defaultTierRenderer = function defaultTierRenderer(status, tier) {\n console.log(\"DEPRECATED!\");\n};\n\nBrowser.prototype.retrieveTierData = function (tiers) {\n this.notifyLocation();\n var width = this.viewEnd - this.viewStart + 1;\n var minExtraW = this.minExtraWidth / this.scale | 0;\n var maxExtraW = this.maxExtraWidth / this.scale | 0;\n\n var newOrigin = (this.viewStart + this.viewEnd) / 2;\n var oh = newOrigin - this.origin;\n this.origin = newOrigin;\n this.scaleAtLastRedraw = this.scale;\n for (var t = 0; t < tiers.length; ++t) {\n var od = oh;\n if (tiers[t].originHaxx) {\n od += tiers[t].originHaxx;\n }\n tiers[t].originHaxx = od;\n }\n\n var scaledQuantRes = this.targetQuantRes / this.scale;\n\n var innerDrawnStart = Math.max(1, (this.viewStart | 0) - minExtraW);\n var innerDrawnEnd = Math.min((this.viewEnd | 0) + minExtraW, (this.currentSeqMax | 0) > 0 ? this.currentSeqMax | 0 : 1000000000);\n var outerDrawnStart = Math.max(1, (this.viewStart | 0) - maxExtraW);\n var outerDrawnEnd = Math.min((this.viewEnd | 0) + maxExtraW, (this.currentSeqMax | 0) > 0 ? this.currentSeqMax | 0 : 1000000000);\n\n if (!this.knownSpace || this.knownSpace.chr !== this.chr) {\n var ss = this.getSequenceSource();\n if (this.knownSpace) this.knownSpace.cancel();\n // known space is created based on the entire tier list, for future caching purposes, even if only a subset of the tiers are needed to be rendered now.\n this.knownSpace = new KnownSpace(this.tiers, this.chr, outerDrawnStart, outerDrawnEnd, scaledQuantRes, ss);\n }\n\n var seg = this.knownSpace.bestCacheOverlapping(this.chr, innerDrawnStart, innerDrawnEnd);\n if (seg && seg.min <= innerDrawnStart && seg.max >= innerDrawnEnd) {\n this.drawnStart = Math.max(seg.min, outerDrawnStart);\n this.drawnEnd = Math.min(seg.max, outerDrawnEnd);\n } else {\n this.drawnStart = outerDrawnStart;\n this.drawnEnd = outerDrawnEnd;\n }\n // send in the subset of tiers to retrieve.\n this.knownSpace.retrieveFeatures(tiers, this.chr, this.drawnStart, this.drawnEnd, scaledQuantRes);\n};\n\nfunction setSources(msh, availableSources, maybeMapping) {\n if (maybeMapping) {\n for (var s = 0; s < availableSources.length; ++s) {\n availableSources[s].mapping = maybeMapping;\n }\n }\n msh.set(availableSources);\n}\n\nBrowser.prototype.queryRegistry = function (maybeMapping, tryCache) {\n if (!this.registry) return;\n\n var thisB = this;\n var coords, msh;\n if (maybeMapping) {\n coords = this.chains[maybeMapping].coords;\n if (!thisB.mappableSources[maybeMapping]) {\n thisB.mappableSources[maybeMapping] = new Observed();\n }\n msh = thisB.mappableSources[maybeMapping];\n } else {\n coords = this.coordSystem;\n msh = this.availableSources;\n }\n var cacheHash = hex_sha1(miniJSONify(coords));\n if (tryCache) {\n var cacheTime = localStorage['dalliance.registry.' + cacheHash + '.last_queried'];\n if (cacheTime) {\n try {\n setSources(msh, JSON.parse(localStorage['dalliance.registry.' + cacheHash + '.sources']), maybeMapping);\n var cacheAge = (Date.now() | 0) - (cacheTime | 0);\n if (cacheAge < 12 * 60 * 60 * 1000) {\n return;\n }\n } catch (rex) {\n console.log('Bad registry cache: ' + rex);\n }\n }\n }\n\n var rurl = this.registry;\n if (rurl.indexOf('//') == 0) {\n var proto = window.location.protocol;\n if (proto != 'https:' && proto != 'http:') rurl = 'http:' + rurl;\n }\n new DASRegistry(rurl).sources(function (sources) {\n var availableSources = [];\n for (var s = 0; s < sources.length; ++s) {\n var source = sources[s];\n if (!source.coords || source.coords.length == 0) {\n continue;\n }\n var scoords = source.coords[0];\n if (scoords.taxon != coords.taxon || scoords.auth != coords.auth || scoords.version != coords.version) {\n continue;\n }\n availableSources.push(source);\n }\n\n localStorage['dalliance.registry.' + cacheHash + '.sources'] = JSON.stringify(availableSources);\n localStorage['dalliance.registry.' + cacheHash + '.last_queried'] = '' + Date.now();\n\n setSources(msh, availableSources, maybeMapping);\n }, function (error) {\n // msh.set(null);\n }, coords);\n};\n\n//\n// Navigation\n//\n\nBrowser.prototype.move = function (pos, soft) {\n var wid = this.viewEnd - this.viewStart;\n var nStart = this.viewStart - 1.0 * pos / this.scale;\n var nEnd = nStart + wid;\n\n if (!soft) {\n if (this.currentSeqMax > 0 && nEnd > this.currentSeqMax) {\n nEnd = this.currentSeqMax;\n nStart = this.viewEnd - wid;\n }\n if (nStart < 1) {\n nStart = 1;\n nEnd = nStart + wid;\n }\n }\n\n this.setLocation(null, nStart, nEnd, null, soft);\n};\n\nBrowser.prototype.zoomStep = function (delta) {\n var oz = 1.0 * this.zoomSliderValue;\n var nz = oz + delta;\n if (nz < this.zoomMin) {\n nz = this.zoomMin;\n }\n if (nz > this.zoomMax) {\n nz = this.zoomMax;\n }\n\n if (nz != oz) {\n this.zoomSliderValue = nz; // FIXME maybe ought to set inside zoom!\n this.zoom(Math.exp(1.0 * nz / this.zoomExpt));\n }\n};\n\nBrowser.prototype.zoom = function (factor) {\n this.zoomFactor = factor;\n var viewCenter = Math.round((this.viewStart + this.viewEnd) / 2.0) | 0;\n this.viewStart = viewCenter - this.zoomBase * this.zoomFactor / 2;\n this.viewEnd = viewCenter + this.zoomBase * this.zoomFactor / 2;\n if (this.currentSeqMax > 0 && this.viewEnd > this.currentSeqMax + 5) {\n var len = this.viewEnd - this.viewStart + 1;\n this.viewEnd = this.currentSeqMax;\n this.viewStart = this.viewEnd - len + 1;\n }\n if (this.viewStart < 1) {\n var len = this.viewEnd - this.viewStart + 1;\n this.viewStart = 1;\n this.viewEnd = this.viewStart + len - 1;\n }\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n var width = this.viewEnd - this.viewStart + 1;\n\n var scaleRat = this.scale / this.scaleAtLastRedraw;\n\n this.notifyLocation();\n this.refresh();\n};\n\nBrowser.prototype.spaceCheck = function (dontRefresh) {\n if (!this.knownSpace || this.knownSpace.chr !== this.chr) {\n this.refresh();\n return;\n }\n\n var width = (this.viewEnd - this.viewStart | 0) + 1;\n var minExtraW = this.minExtraWidth / this.scale | 0;\n var maxExtraW = this.maxExtraWidth / this.scale | 0;\n\n if ((this.drawnStart | 0) > Math.max(1, (this.viewStart | 0) - minExtraW | 0) || (this.drawnEnd | 0) < Math.min((this.viewEnd | 0) + minExtraW, (this.currentSeqMax | 0) > 0 ? this.currentSeqMax | 0 : 1000000000)) {\n this.refresh();\n }\n};\n\nBrowser.prototype.resizeViewer = function (skipRefresh) {\n var width = this.tierHolder.getBoundingClientRect().width | 0;\n if (width == 0) return;\n\n var oldFPW = Math.max(this.featurePanelWidth, 300); // Can get silly values stored\n // when the browser is hidden.\n this.featurePanelWidth = width | 0;\n\n if (oldFPW != this.featurePanelWidth) {\n this.zoomMax = this.zoomExpt * Math.log(this.maxViewWidth / this.zoomBase);\n this.zoomMin = this.zoomExpt * Math.log(this.featurePanelWidth / this.maxPixelsPerBase / this.zoomBase); // FIXME hard-coded minimum.\n this.zoomSliderValue = this.zoomExpt * Math.log((this.viewEnd - this.viewStart + 1) / this.zoomBase);\n\n var viewWidth = this.viewEnd - this.viewStart;\n var nve = this.viewStart + viewWidth * this.featurePanelWidth / oldFPW;\n\n this.viewEnd = nve;\n\n var wid = this.viewEnd - this.viewStart + 1;\n if (this.currentSeqMax > 0 && this.viewEnd > this.currentSeqMax) {\n this.viewEnd = this.currentSeqMax;\n this.viewStart = this.viewEnd - wid + 1;\n }\n if (this.viewStart < 1) {\n this.viewStart = 1;\n this.viewEnd = this.viewStart + wid - 1;\n }\n\n this.positionRuler();\n\n if (!skipRefresh) {\n this.spaceCheck();\n }\n this.notifyLocation();\n }\n\n if (this.fullScreen) {\n this.setFullScreenHeight();\n }\n};\n\nBrowser.prototype.setFullScreenHeight = function () {\n var rest = document.body.offsetHeight - this.browserHolder.offsetHeight;\n this.browserHolder.style.maxHeight = Math.max(300, window.innerHeight - rest - 20) + 'px';\n};\n\nBrowser.prototype.addTier = function (conf) {\n var thisB = this;\n conf = shallowCopy(conf);\n conf.disabled = false;\n\n return this.makeTier(conf).then(function (tier) {\n thisB.refreshTier(tier);\n thisB.markSelectedTiers();\n thisB.positionRuler();\n thisB.notifyTier(\"added\", tier);\n return tier;\n });\n};\n\nBrowser.prototype.removeTier = function (conf, force) {\n var target = -1;\n\n if (typeof conf.index !== 'undefined' && conf.index >= 0 && conf.index < this.tiers.length) {\n target = conf.index;\n } else {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var ts = this.tiers[ti].dasSource;\n\n if (sourcesAreEqual(conf, ts)) {\n target = ti;break;\n }\n }\n }\n\n if (target < 0) {\n throw \"Couldn't find requested tier\";\n }\n\n var targetTier = this.tiers[target];\n this.tiers.splice(target, 1);\n\n var nst = [];\n for (var sti = 0; sti < this.selectedTiers.length; ++sti) {\n var st = this.selectedTiers[sti];\n if (st < target) {\n nst.push(st);\n } else if (st > target) {\n nst.push(st - 1);\n }\n }\n this.selectedTiers = nst;\n this.markSelectedTiers();\n\n targetTier.destroy();\n if (this.knownSpace) {\n this.knownSpace.featureCache[targetTier] = null;\n }\n\n this.reorderTiers();\n this.notifyTier(\"removed\", targetTier);\n};\n\nBrowser.prototype.removeAllTiers = function () {\n var thisB = this;\n this.selectedTiers = [];\n this.markSelectedTiers();\n this.tiers.forEach(function (targetTier) {\n targetTier.destroy();\n if (thisB.knownSpace) {\n thisB.knownSpace.featureCache[targetTier] = null;\n }\n });\n this.tiers.length = 0;\n this.reorderTiers();\n this.notifyTier(\"removedAll\", null);\n};\n\nBrowser.prototype.getSequenceSource = function () {\n if (this._sequenceSource === undefined) this._sequenceSource = this._getSequenceSource();\n return this._sequenceSource;\n};\n\nBrowser.prototype._getSequenceSource = function () {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (this.tiers[ti].sequenceSource) {\n return this.tiers[ti].sequenceSource;\n }\n }\n\n for (var si = 0; si < this.defaultSources.length; ++si) {\n var s = this.defaultSources[si];\n if (s.provides_entrypoints || s.tier_type == 'sequence' || s.twoBitURI || s.twoBitBlob) {\n if (s.twoBitURI || s.twoBitBlob) {\n return new TwoBitSequenceSource(s);\n } else if (s.ensemblURI) {\n return new EnsemblSequenceSource(s);\n } else {\n return new DASSequenceSource(s);\n }\n }\n }\n};\n\nBrowser.prototype.setLocation = function (newChr, newMin, newMax, callback, soft) {\n if (typeof newMin !== 'number') {\n throw Error('minimum must be a number (got ' + JSON.stringify(newMin) + ')');\n }\n if (typeof newMax !== 'number') {\n throw Error('maximum must be a number (got ' + JSON.stringify(newMax) + ')');\n }\n\n if (newMin > newMax) {\n var oldNewMin = newMin;\n newMin = newMax;\n newMax = oldNewMin;\n } else if (newMin === newMax) {\n newMax += 1;\n }\n\n if (!callback) {\n callback = function callback(err) {\n if (err) {\n throw err;\n }\n };\n }\n var thisB = this;\n\n if ((!newChr || newChr == this.chr) && this.currentSeqMax > 0) {\n return this._setLocation(null, newMin, newMax, null, callback, soft);\n } else {\n var ss = this.getSequenceSource();\n if (!ss) {\n return callback('Need a sequence source');\n }\n\n var findChr = newChr || this.chr;\n ss.getSeqInfo(findChr, function (si) {\n if (!si) {\n var altChr;\n if (findChr.indexOf('chr') == 0) {\n altChr = findChr.substr(3);\n } else {\n altChr = 'chr' + findChr;\n }\n ss.getSeqInfo(altChr, function (si2) {\n if (!si2 && newChr) {\n return callback(\"Couldn't find sequence '\" + newChr + \"'\");\n } else if (!si2) {\n return thisB._setLocation(null, newMin, newMax, null, callback, soft);\n } else {\n return thisB._setLocation(altChr, newMin, newMax, si2, callback, soft);\n }\n });\n } else {\n return thisB._setLocation(newChr, newMin, newMax, si, callback, soft);\n }\n });\n }\n};\n\nBrowser.prototype._setLocation = function (newChr, newMin, newMax, newChrInfo, callback, soft) {\n var chrChanged = false;\n if (newChr) {\n if (newChr.indexOf('chr') == 0) newChr = newChr.substring(3);\n\n if (this.chr != newChr) chrChanged = true;\n this.chr = newChr;\n this.currentSeqMax = newChrInfo.length;\n }\n\n newMin = parseFloat(newMin);newMax = parseFloat(newMax);\n\n var newWidth = Math.max(10, newMax - newMin + 1);\n\n if (!soft) {\n var csm = this.currentSeqMax;\n if (csm <= 0) csm = 1000000000000;\n if (newMin < 1) {\n newMin = 1;newMax = newMin + newWidth - 1;\n }\n if (newMax > csm) {\n newMax = csm;\n newMin = Math.max(1, newMax - newWidth + 1);\n }\n }\n\n this.viewStart = newMin;\n this.viewEnd = newMax;\n var newScale = Math.max(this.featurePanelWidth || this.offscreenInitWidth, 50) / (this.viewEnd - this.viewStart);\n var oldScale = this.scale;\n var scaleChanged = Math.abs(newScale - oldScale) > 0.000001;\n this.scale = newScale;\n\n var newZS, oldZS;\n oldZS = this.zoomSliderValue;\n this.zoomSliderValue = newZS = this.zoomExpt * Math.log((this.viewEnd - this.viewStart + 1) / this.zoomBase);\n\n if (scaleChanged || chrChanged) {\n for (var i = 0; i < this.tiers.length; ++i) {\n this.tiers[i].viewportHolder.style.left = '5000px';\n this.tiers[i].overlay.style.left = '5000px';\n }\n\n this.refresh();\n // var self = this;\n // this.tiers.forEach(function(tier) {self.refreshTier(tier);});\n // this.refreshTier\n\n if (this.savedZoom) {\n newZS -= this.zoomMin;\n oldZS -= this.zoomMin;\n var difToActive = newZS - oldZS;\n var difToSaved = newZS - this.savedZoom;\n if (Math.abs(difToActive) > Math.abs(difToSaved)) {\n this.isSnapZooming = !this.isSnapZooming;\n this.savedZoom = oldZS;\n }\n } else {\n this.isSnapZooming = false;\n this.savedZoom = null;\n }\n } else {\n var viewCenter = (this.viewStart + this.viewEnd) / 2;\n\n for (var i = 0; i < this.tiers.length; ++i) {\n var offset = (this.viewStart - this.tiers[i].norigin) * this.scale;\n this.tiers[i].viewportHolder.style.left = '' + ((-offset | 0) - 1000) + 'px';\n this.tiers[i].drawOverlay();\n }\n }\n\n this.notifyLocation();\n\n this.spaceCheck();\n if (this.instrumentActivity) this.activityStartTime = Date.now() | 0;\n return callback();\n};\n\nBrowser.prototype.setCenterLocation = function (newChr, newCenterLoc) {\n var halfWidth = (this.viewEnd - this.viewStart) / 2,\n newMin = newCenterLoc - halfWidth,\n newMax = newCenterLoc + halfWidth;\n this.setLocation(newChr, newMin, newMax);\n};\n\nBrowser.prototype.pingActivity = function () {\n if (!this.instrumentActivity || !this.activityStartTime) return;\n\n var activity = 0;\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (this.tiers[ti].loaderButton.style.display !== 'none') ++activity;\n }\n\n if (activity == 0) {\n var now = Date.now() | 0;\n console.log('Loading took ' + (now - this.activityStartTime) + 'ms');\n this.activityStartTime = null;\n }\n};\n\nBrowser.prototype.addInitListener = function (handler) {\n this.initListeners.push(handler);\n};\n\nBrowser.prototype.addFeatureListener = function (handler, opts) {\n opts = opts || {};\n this.featureListeners.push(handler);\n};\n\nBrowser.prototype.removeFeatureListener = function (handler, opts) {\n var idx = arrayIndexOf(this.featureListeners, handler);\n if (idx >= 0) {\n this.featureListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyFeature = function (ev, feature, hit, tier) {\n for (var fli = 0; fli < this.featureListeners.length; ++fli) {\n try {\n if (this.featureListeners[fli](ev, feature, hit, tier)) return;\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.addFeatureHoverListener = function (handler, opts) {\n opts = opts || {};\n this.featureHoverListeners.push(handler);\n};\n\nBrowser.prototype.removeFeatureHoverListener = function (handler, opts) {\n var idx = arrayIndexOf(this.featureHoverListeners, handler);\n if (idx >= 0) {\n this.featureHoverListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyFeatureHover = function (ev, feature, hit, tier) {\n for (var fli = 0; fli < this.featureHoverListeners.length; ++fli) {\n try {\n this.featureHoverListeners[fli](ev, feature, hit, tier);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.addViewListener = function (handler, opts) {\n opts = opts || {};\n this.viewListeners.push(handler);\n};\n\nBrowser.prototype.removeViewListener = function (handler, opts) {\n var idx = arrayIndexOf(this.viewListeners, handler);\n if (idx >= 0) {\n this.viewListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyLocation = function () {\n var nvs = Math.max(1, this.viewStart | 0);\n var nve = this.viewEnd | 0;\n if (this.currentSeqMax > 0 && nve > this.currentSeqMax) nve = this.currentSeqMax;\n\n for (var lli = 0; lli < this.viewListeners.length; ++lli) {\n try {\n this.viewListeners[lli](this.chr, nvs, nve, this.zoomSliderValue, { current: this.zoomSliderValue,\n alternate: this.savedZoom + this.zoomMin || this.zoomMin,\n isSnapZooming: this.isSnapZooming,\n min: this.zoomMin,\n max: this.zoomMax }, this.viewStart, this.viewEnd);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.addTierListener = function (handler) {\n this.tierListeners.push(handler);\n};\n\nBrowser.prototype.removeTierListener = function (handler) {\n var idx = arrayIndexOf(this.tierListeners, handler);\n if (idx >= 0) {\n this.tierListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyTier = function (status, tier) {\n for (var tli = 0; tli < this.tierListeners.length; ++tli) {\n try {\n this.tierListeners[tli](status, tier);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.addRegionSelectListener = function (handler) {\n this.regionSelectListeners.push(handler);\n};\n\nBrowser.prototype.removeRegionSelectListener = function (handler) {\n var idx = arrayIndexOf(this.regionSelectListeners, handler);\n if (idx >= 0) {\n this.regionSelectListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyRegionSelect = function (chr, min, max) {\n for (var rli = 0; rli < this.regionSelectListeners.length; ++rli) {\n try {\n this.regionSelectListeners[rli](chr, min, max);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.highlightRegion = function (chr, min, max) {\n var thisB = this;\n\n if (chr == this.chr) {\n return this._highlightRegion(chr, min, max);\n }\n\n var ss = this.getSequenceSource();\n if (!ss) {\n throw 'Need a sequence source';\n }\n\n ss.getSeqInfo(chr, function (si) {\n if (!si) {\n var altChr;\n if (chr.indexOf('chr') == 0) {\n altChr = chr.substr(3);\n } else {\n altChr = 'chr' + chr;\n }\n ss.getSeqInfo(altChr, function (si2) {\n if (!si2) {\n // Fail silently.\n } else {\n return thisB._highlightRegion(altChr, min, max);\n }\n });\n } else {\n return thisB._highlightRegion(chr, min, max);\n }\n });\n};\n\nBrowser.prototype._highlightRegion = function (chr, min, max) {\n for (var hi = 0; hi < this.highlights.length; ++hi) {\n var h = this.highlights[hi];\n if (h.chr == chr && h.min == min && h.max == max) return;\n }\n\n this.highlights.push(new Region(chr, min, max));\n var visStart = this.viewStart - 1000 / this.scale;\n var visEnd = this.viewEnd + 1000 / this.scale;\n if ((chr == this.chr || chr == 'chr' + this.chr) && min < visEnd && max > visStart) {\n this.drawOverlays();\n }\n\n this.notifyLocation();\n};\n\nBrowser.prototype.clearHighlights = function () {\n this.highlights = [];\n this.drawOverlays();\n this.notifyLocation();\n};\n\nBrowser.prototype.drawOverlays = function () {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n this.tiers[ti].drawOverlay();\n }\n};\n\nBrowser.prototype.featuresInRegion = function (chr, min, max) {\n var features = [];\n if (chr !== this.chr) {\n return [];\n }\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var fl = this.tiers[ti].currentFeatures || [];\n for (var fi = 0; fi < fl.length; ++fi) {\n var f = fl[fi];\n if (f.min <= max && f.max >= min) {\n features.push(f);\n }\n }\n }\n return features;\n};\n\nBrowser.prototype.getSelectedTier = function () {\n if (this.selectedTiers.length > 0) return this.selectedTiers[0];else return -1;\n};\n\nBrowser.prototype.setSelectedTier = function (t) {\n if (t == null) {\n this.selectedTiers = [];\n } else {\n this.selectedTiers = [t];\n }\n this.markSelectedTiers();\n this.notifyTierSelection();\n};\n\nBrowser.prototype.markSelectedTiers = function () {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var button = this.tiers[ti].nameButton;\n\n if (this.selectedTiers.indexOf(ti) >= 0) {\n button.classList.add('active');\n } else {\n button.classList.remove('active');\n }\n }\n if (this.selectedTiers.length > 0) {\n var browserMid = this.browserHolder.offsetTop + this.browserHolder.offsetHeight / 2;\n if (browserMid > document.body.scrollTop && browserMid + 100 < document.body.scrollTop + window.innerHeight) this.browserHolder.focus();\n }\n};\n\nBrowser.prototype.addTierSelectionListener = function (handler) {\n this.tierSelectionListeners.push(handler);\n};\n\nBrowser.prototype.removeTierSelectionListener = function (handler) {\n var idx = arrayIndexOf(this.tierSelectionListeners, handler);\n if (idx >= 0) {\n this.tierSelectionListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyTierSelection = function () {\n for (var fli = 0; fli < this.tierSelectionListeners.length; ++fli) {\n try {\n this.tierSelectionListeners[fli](this.selectedTiers);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.addTierSelectionWrapListener = function (f) {\n this.tierSelectionWrapListeners.push(f);\n};\n\nBrowser.prototype.removeTierSelectionWrapListener = function (handler) {\n var idx = arrayIndexOf(this.tierSelectionWrapListeners, handler);\n if (idx >= 0) {\n this.tierSelectionWrapListeners.splice(idx, 1);\n }\n};\n\nBrowser.prototype.notifyTierSelectionWrap = function (i) {\n for (var fli = 0; fli < this.tierSelectionWrapListeners.length; ++fli) {\n try {\n this.tierSelectionWrapListeners[fli](i);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n};\n\nBrowser.prototype.positionRuler = function () {\n var display = 'none';\n var left = '';\n var right = '';\n\n if (this.rulerLocation == 'center') {\n display = 'block';\n left = '' + (this.featurePanelWidth / 2 | 0) + 'px';\n } else if (this.rulerLocation == 'left') {\n display = 'block';\n left = '0px';\n } else if (this.rulerLocation == 'right') {\n display = 'block';\n right = '0px';\n } else {\n display = 'none';\n }\n\n this.ruler.style.display = display;\n this.ruler.style.left = left;\n this.ruler.style.right = right;\n\n if (this.singleBaseHighlight) {\n this.ruler2.style.display = 'block';\n this.ruler2.style.borderWidth = '1px';\n if (this.scale < 1) {\n this.ruler2.style.width = '0px';\n this.ruler2.style.borderRightWidth = '0px';\n } else {\n this.ruler2.style.width = this.scale + 'px';\n this.ruler2.style.borderRightWidth = '1px';\n }\n // Position accompanying single base location text\n this.locSingleBase.style.visibility = 'visible';\n var centreOffset = this.featurePanelWidth / 2 - this.locSingleBase.offsetWidth / 2 + this.ruler2.offsetWidth / 2;\n this.locSingleBase.style.left = '' + (centreOffset | 0) + 'px';\n } else {\n this.locSingleBase.style.visibility = 'hidden';\n this.ruler2.style.width = '1px';\n this.ruler2.style.borderWidth = '0px';\n this.ruler2.style.display = this.rulerLocation == 'center' ? 'none' : 'block';\n }\n\n this.ruler2.style.left = '' + (this.featurePanelWidth / 2 | 0) + 'px';\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var tier = this.tiers[ti];\n var q = tier.quantOverlay;\n\n var quant;\n if (tier.subtiers && tier.subtiers.length > 0) quant = tier.subtiers[0].quant;\n\n if (q) {\n q.style.display = quant ? display : 'none';\n q.style.left = left;\n q.style.right = right;\n }\n }\n};\n\nBrowser.prototype.featureDoubleClick = function (hit, rx, ry) {\n if (!hit || hit.length == 0) return;\n\n var f = hit[hit.length - 1];\n\n if (!f.min || !f.max) {\n return;\n }\n\n var fstart = ((f.min | 0) - (this.viewStart | 0)) * this.scale;\n var fwidth = (f.max - f.min + 1) * this.scale;\n\n var newMid = ((f.min | 0) + (f.max | 0)) / 2;\n if (fwidth > 10) {\n var frac = 1.0 * (rx - fstart) / fwidth;\n if (frac < 0.3) {\n newMid = f.min | 0;\n } else if (frac > 0.7) {\n newMid = (f.max | 0) + 1;\n }\n }\n\n var width = this.viewEnd - this.viewStart;\n this.setLocation(null, newMid - width / 2, newMid + width / 2);\n};\n\nBrowser.prototype.zoomForScale = function (scale) {\n var ssScale;\n if (scale > this.highZoomThreshold) {\n ssScale = 'high';\n } else if (scale > this.mediumZoomThreshold) {\n ssScale = 'medium';\n } else {\n ssScale = 'low';\n }\n return ssScale;\n};\n\nBrowser.prototype.zoomForCurrentScale = function () {\n return this.zoomForScale(this.scale);\n};\n\nBrowser.prototype.updateHeight = function () {\n var tierTotal = 0;\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n tierTotal += this.tiers[ti].currentHeight || 30;\n }this.ruler.style.height = '' + tierTotal + 'px';\n this.ruler2.style.height = '' + tierTotal + 'px';\n this.browserHolder.style.display = 'block';\n this.browserHolder.style.display = '-webkit-flex';\n this.browserHolder.style.display = 'flex';\n // this.svgHolder.style.maxHeight = '' + Math.max(tierTotal, 500) + 'px';\n};\n\nBrowser.prototype.scrollArrowKey = function (ev, dir) {\n if (this.reverseKeyScrolling) dir = -dir;\n\n if (ev.ctrlKey || ev.metaKey) {\n var fedge = false;\n if (ev.shiftKey) {\n fedge = true;\n }\n\n this.leap(dir, fedge);\n } else if (this.scale > 1) {\n // per-base scrolling mode, tries to perfectly center.\n var mid = (this.viewStart + this.viewEnd) / 2;\n var err = mid - Math.round(mid);\n var n = 1;\n if (ev.shiftKey) n *= 10;\n if (dir > 0) {\n n = -n;\n n -= err;\n if (err > 0) n += 1;\n } else {\n n -= err;\n if (err < 0) n -= 1;\n }\n this.setLocation(null, this.viewStart + n, this.viewEnd + n);\n } else {\n this.move(ev.shiftKey ? 100 * dir : 25 * dir);\n }\n};\n\nBrowser.prototype.leap = function (dir, fedge) {\n var thisB = this;\n var pos = (thisB.viewStart + thisB.viewEnd + 1) / 2 | 0;\n if (dir > 0 && thisB.viewStart <= 1) {\n pos -= 100000000;\n } else if (dir < 0 && thisB.viewEnd >= thisB.currentSeqMax) {\n pos += 100000000;\n }\n\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tier = thisB.tiers[st];\n\n if (tier && (tier.featureSource && this.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof tier.quantLeapThreshold == 'number' || tier.featureSource && this.sourceAdapterIsCapable(tier.featureSource, 'leap'))) {\n tier.findNextFeature(thisB.chr, pos, -dir, fedge, function (nxt) {\n if (nxt) {\n var nmin = nxt.min;\n var nmax = nxt.max;\n if (fedge) {\n if (dir > 0) {\n if (nmin > pos + 1) {\n nmax = nmin;\n } else {\n nmax++;\n nmin = nmax;\n }\n } else {\n if (nmax < pos - 1) {\n nmax++;\n nmin = nmax;\n } else {\n nmax = nmin;\n }\n }\n }\n var wid = thisB.viewEnd - thisB.viewStart + 1;\n if (parseFloat(wid / 2) == parseInt(wid / 2)) {\n wid--;\n }\n var newStart = (nmin + nmax - wid) / 2 + 1;\n var newEnd = newStart + wid - 1;\n var pos2 = pos;\n thisB.setLocation(nxt.segment, newStart, newEnd);\n } else {\n alert('no next feature'); // FIXME better reporting would be nice!\n }\n });\n } else {\n this.move(100 * dir);\n }\n};\n\nfunction glyphLookup(glyphs, rx, ry, matches) {\n matches = matches || [];\n\n for (var gi = glyphs.length - 1; gi >= 0; --gi) {\n var g = glyphs[gi];\n if (!g.notSelectable && g.min() <= rx && g.max() >= rx) {\n if (g.minY) {\n if (ry < g.minY() || ry > g.maxY()) continue;\n }\n\n if (g.feature) {\n matches.push(g.feature);\n } else if (g.group) {\n matches.push(g.group);\n }\n\n if (g.glyphs) {\n return glyphLookup(g.glyphs, rx, ry, matches);\n } else if (g.glyph) {\n return glyphLookup([g.glyph], rx, ry, matches);\n } else {\n return matches;\n }\n }\n }\n return matches;\n}\n\nBrowser.prototype.nameForCoordSystem = function (cs) {\n var primary = null,\n ucsc = null;\n if (this.assemblyNamePrimary) {\n primary = '' + cs.auth;\n if (typeof cs.version !== 'undefined') primary += cs.version;\n }\n if (this.assemblyNameUcsc) {\n ucsc = cs.ucscName;\n }\n if (primary != null && ucsc != null) return primary + '/' + ucsc;else return primary || ucsc || 'unknown';\n};\n\nBrowser.prototype.makeLoader = function (size) {\n size = size || 16;\n var retina = window.devicePixelRatio > 1;\n if (size < 20) {\n return makeElement('img', null, { src: this.resolveURL('$$img/spinner_' + (retina ? 16 : 32) + '.gif'), width: '16', height: '16' });\n } else {\n return makeElement('img', null, { src: this.resolveURL('$$img/spinner_' + (retina ? 24 : 48) + '.gif'), width: '24', height: '24' });\n }\n};\n\nBrowser.prototype.canFetchPlainHTTP = function () {\n var self = this;\n if (!this._plainHTTPPromise) {\n var worker = this.getWorker();\n if (worker) {\n this._plainHTTPPromise = new Promise(function (resolve, reject) {\n worker.postCommand({ command: 'textxhr',\n uri: self.httpCanaryURL }, function (result, err) {\n if (result) {\n resolve(true);\n } else {\n resolve(false);\n }\n });\n });\n } else {\n this._plainHTTPPromise = new Promise(function (resolve, reject) {\n textXHR(self.httpCanaryURL, function (result, err) {\n if (result) {\n resolve(true);\n } else {\n resolve(false);\n }\n }, { timeout: 2000 });\n });\n }\n }\n return this._plainHTTPPromise;\n};\n\nBrowser.prototype.getWorker = function () {\n if (!this.useFetchWorkers || !this.fetchWorkers || this.fetchWorkers.length == 0) return null;\n\n if (this.nextWorker >= this.fetchWorkers.length) this.nextWorker = 0;\n return this.fetchWorkers[this.nextWorker++];\n};\n\nBrowser.prototype.registerResolver = function (resolver) {\n var id = 'res' + ++this.resolverSeed;\n this.resolvers[id] = resolver;\n return id;\n};\n\nfunction FetchWorker(browser, worker) {\n var thisB = this;\n this.tagSeed = 0;\n this.callbacks = {};\n this.browser = browser;\n this.worker = worker;\n\n this.worker.onmessage = function (ev) {\n var data = ev.data;\n\n if (!data.cmd) {\n var cb = thisB.callbacks[data.tag];\n if (cb) {\n cb(data.result, data.error);\n delete thisB.callbacks[data.tag];\n }\n } else if (data.cmd == 'resolve') {\n var resolver = thisB.browser.resolvers[data.resolver];\n if (resolver) {\n resolver(data.url).then(function (url) {\n thisB.worker.postMessage({\n tag: data.tag,\n url: url\n });\n }).catch(function (err) {\n console.log(err);\n thisB.worker.postMessage({\n tag: data.tag,\n err: err.toString()\n });\n });\n } else {\n console.log('No resolver ' + data.resolver);\n }\n } else {\n console.log('Bad worker callback ' + data.cmd);\n }\n };\n}\n\nfunction makeFetchWorker(browser) {\n var wurl = browser.resolveURL(browser.workerPath);\n if (wurl.indexOf('//') == 0) {\n var proto = window.location.protocol;\n if (proto == 'https:') wurl = 'https:' + wurl;else wurl = 'http:' + wurl;\n }\n\n var wscript = 'importScripts(\"' + wurl + '?version=' + VERSION + '\");';\n var wblob = new Blob([wscript], { type: 'application/javascript' });\n\n return new Promise(function (resolve, reject) {\n var worker = new Worker(URL.createObjectURL(wblob));\n\n worker.onmessage = function (ev) {\n if (ev.data.tag === 'init') {\n console.log('Worker initialized');\n resolve(new FetchWorker(browser, worker));\n }\n };\n\n worker.onerror = function (ev) {\n reject(ev.message);\n };\n });\n}\n\nFetchWorker.prototype.postCommand = function (cmd, callback, transfer) {\n var tag = 'x' + ++this.tagSeed;\n cmd.tag = tag;\n this.callbacks[tag] = callback;\n this.worker.postMessage(cmd, transfer);\n};\n\nFetchWorker.prototype.terminate = function () {\n this.worker.terminate();\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n Browser: Browser\n };\n\n // Required because they add stuff to Browser.prototype\n require('./browser-ui');\n require('./track-adder');\n require('./feature-popup');\n require('./tier-actions');\n require('./domui');\n require('./search');\n\n var sa = require('./sourceadapters');\n var TwoBitSequenceSource = sa.TwoBitSequenceSource;\n var EnsemblSequenceSource = sa.EnsemblSequenceSource;\n var DASSequenceSource = sa.DASSequenceSource;\n\n var KnownSpace = require('./kspace').KnownSpace;\n\n var DASRegistry = require('./das').DASRegistry;\n}\n\nfunction SourceCache() {\n this.sourcesByURI = {};\n}\n\nSourceCache.prototype.get = function (conf) {\n var scb = this.sourcesByURI[sourceDataURI(conf)];\n if (scb) {\n for (var si = 0; si < scb.configs.length; ++si) {\n if (sourcesAreEqualModuloStyle(scb.configs[si], conf)) {\n return scb.sources[si];\n }\n }\n }\n};\n\nSourceCache.prototype.put = function (conf, source) {\n var uri = sourceDataURI(conf);\n var scb = this.sourcesByURI[uri];\n if (!scb) {\n scb = { configs: [], sources: [] };\n this.sourcesByURI[uri] = scb;\n }\n scb.configs.push(conf);\n scb.sources.push(source);\n};\n\n},{\"./browser-ui\":5,\"./chainset\":7,\"./das\":10,\"./default-renderer\":11,\"./domui\":12,\"./dummy-renderer\":13,\"./feature-popup\":21,\"./kspace\":25,\"./multi-renderer\":29,\"./numformats\":30,\"./search\":35,\"./sha1\":38,\"./sourceadapters\":39,\"./sourcecompare\":40,\"./sub-renderer\":43,\"./thub\":49,\"./tier\":52,\"./tier-actions\":50,\"./track-adder\":53,\"./utils\":56,\"./version\":58,\"es6-promise\":384}],7:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// chainset.js: liftover support\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var das = require('./das');\n var DASSource = das.DASSource;\n var DASSegment = das.DASSegment;\n\n var utils = require('./utils');\n var pusho = utils.pusho;\n var shallowCopy = utils.shallowCopy;\n\n var parseCigar = require('./cigar').parseCigar;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n\n var bbi = require('./bigwig');\n var makeBwg = bbi.makeBwg;\n\n var Promise = require('es6-promise').Promise;\n}\n\nfunction Chainset(conf, srcTag, destTag, coords) {\n if (typeof conf == 'string') {\n this.uri = conf;\n this.srcTag = srcTag;\n this.destTag = destTag;\n this.coords = coords;\n } else {\n this.uri = conf.uri;\n this.srcTag = conf.srcTag;\n this.destTag = conf.destTag;\n this.coords = shallowCopy(conf.coords);\n this.type = conf.type;\n this.credentials = conf.credentials;\n }\n\n this.chainsBySrc = {};\n this.chainsByDest = {};\n this.postFetchQueues = {};\n this.fetchedTiles = {};\n this.granularity = 1000000; // size in bases of tile to fetch\n\n if (this.type == 'bigbed') {\n this.chainFetcher = new BBIChainFetcher(this.uri, this.credentials);\n } else if (this.type == 'alias') {\n this.chainFetcher = new AliasChainFetcher(conf);\n } else {\n this.chainFetcher = new DASChainFetcher(this.uri, this.srcTag, this.destTag);\n }\n};\n\nChainset.prototype.exportConfig = function () {\n return {\n uri: this.uri,\n srcTag: this.srcTag,\n destTag: this.destTag,\n coords: this.coords,\n type: this.type,\n credentials: this.credentials\n };\n};\n\nChainset.prototype.mapPoint = function (chr, pos) {\n var chains = this.chainsBySrc[chr] || [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (pos >= c.srcMin && pos <= c.srcMax) {\n var cpos;\n if (c.srcOri == '-') {\n cpos = c.srcMax - pos;\n } else {\n cpos = pos - c.srcMin;\n }\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n if (cpos >= bSrc && cpos <= bSrc + bSize) {\n var apos = cpos - bSrc;\n\n var dpos;\n if (c.destOri == '-') {\n dpos = c.destMax - bDest - apos;\n } else {\n dpos = apos + bDest + c.destMin;\n }\n return { seq: c.destChr, pos: dpos, flipped: c.srcOri != c.destOri };\n }\n }\n }\n }\n return null;\n};\n\nChainset.prototype.mapSegment = function (chr, min, max) {\n var chains = this.chainsBySrc[chr] || [];\n var mappings = [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (max >= c.srcMin && min <= c.srcMax) {\n var cmin, cmax;\n if (c.srcOri == '-') {\n cmin = c.srcMax - max;\n cmax = c.srcMax - min;\n } else {\n cmin = min - c.srcMin;\n cmax = max - c.srcMin;\n }\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n if (cmax >= bSrc && cmin <= bSrc + bSize) {\n var m = {\n segment: c.destChr,\n flipped: c.srcOri == '-' ^ c.destOri == '-' };\n\n if (c.destOri == '-') {\n if (cmin >= bSrc) {\n m.max = c.destMax - bDest - cmin + bSrc;\n } else {\n m.max = c.destMax - bDest;\n m.partialMax = bSrc - cmin;\n }\n if (cmax <= bSrc + bSize) {\n m.min = c.destMax - bDest - cmax + bSrc;\n } else {\n m.min = c.destMax - bDest - bSize;\n m.partialMin = cmax - bSrc - bSize;\n }\n } else {\n if (cmin >= bSrc) {\n m.min = c.destMin + bDest + cmin - bSrc;\n } else {\n m.min = c.destMin + bDest;\n m.partialMin = bSrc - cmin;\n }\n if (cmax <= bSrc + bSize) {\n m.max = c.destMin + bDest + cmax - bSrc;\n } else {\n m.max = c.destMin + bDest + bSize;\n m.partialMax = cmax - bSrc - bSize;\n }\n }\n mappings.push(m);\n }\n }\n }\n }\n return mappings;\n};\n\nChainset.prototype.unmapPoint = function (chr, pos) {\n var chains = this.chainsByDest[chr] || [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (pos >= c.destMin && pos <= c.destMax) {\n var cpos;\n if (c.srcOri == '-') {\n cpos = c.destMax - pos;\n } else {\n cpos = pos - c.destMin;\n }\n\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n\n if (cpos >= bDest && cpos <= bDest + bSize) {\n var apos = cpos - bDest;\n\n var dpos = apos + bSrc + c.srcMin;\n var dpos;\n if (c.destOri == '-') {\n dpos = c.srcMax - bSrc - apos;\n } else {\n dpos = apos + bSrc + c.srcMin;\n }\n return { seq: c.srcChr, pos: dpos, flipped: c.srcOri != c.destOri };\n }\n }\n // return null;\n }\n }\n return null;\n};\n\nChainset.prototype.sourceBlocksForRange = function (chr, min, max, callback) {\n var STATE_PENDING = 1;\n var STATE_FETCHED = 2;\n\n var thisCS = this;\n var minTile = min / this.granularity | 0;\n var maxTile = max / this.granularity | 0;\n\n var needsNewOrPending = false;\n var needsNewFetch = false;\n for (var t = minTile; t <= maxTile; ++t) {\n var tn = chr + '_' + t;\n if (this.fetchedTiles[tn] != STATE_FETCHED) {\n needsNewOrPending = true;\n if (this.fetchedTiles[tn] != STATE_PENDING) {\n this.fetchedTiles[tn] = STATE_PENDING;\n needsNewFetch = true;\n }\n }\n }\n\n if (needsNewOrPending) {\n if (!this.postFetchQueues[chr]) {\n this.chainFetcher.fetchChains(chr, minTile * this.granularity, (maxTile + 1) * this.granularity - 1).then(function (chains) {\n if (!thisCS.chainsByDest) thisCS.chainsByDest[chr] = [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var chain = chains[ci];\n\n {\n var cbs = thisCS.chainsBySrc[chain.srcChr];\n if (!cbs) {\n thisCS.chainsBySrc[chain.srcChr] = [chain];\n } else {\n var present = false;\n for (var oci = 0; oci < cbs.length; ++oci) {\n var oc = cbs[oci];\n if (oc.srcMin == chain.srcMin && oc.srcMax == chain.srcMax) {\n present = true;\n break;\n }\n }\n if (!present) cbs.push(chain);\n }\n }\n\n {\n var cbd = thisCS.chainsByDest[chain.destChr];\n if (!cbd) {\n thisCS.chainsByDest[chain.destChr] = [chain];\n } else {\n var present = false;\n for (var oci = 0; oci < cbd.length; ++oci) {\n var oc = cbd[oci];\n if (oc.destMin == chain.destMin && oc.destMax == chain.destMax) {\n present = true;\n break;\n }\n }\n if (!present) cbd.push(chain);\n }\n }\n }\n for (var t = minTile; t <= maxTile; ++t) {\n var tn = chr + '_' + t;\n thisCS.fetchedTiles[tn] = STATE_FETCHED;\n }\n if (thisCS.postFetchQueues[chr]) {\n var pfq = thisCS.postFetchQueues[chr];\n for (var i = 0; i < pfq.length; ++i) {\n pfq[i]();\n }\n thisCS.postFetchQueues[chr] = null;\n }\n }).catch(function (err) {\n console.log(err);\n });\n }\n\n pusho(this.postFetchQueues, chr, function () {\n // Will either succeed if the tiles that are needed have already been fetched,\n // or queue up a new fetch.\n\n thisCS.sourceBlocksForRange(chr, min, max, callback);\n });\n } else {\n var srcBlocks = [];\n var chains = this.chainsByDest[chr] || [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (min <= c.destMax && max >= c.destMin) {\n var cmin, cmax;\n if (c.srcOri == '-') {\n cmin = c.destMax - max;\n cmax = c.destMax - min;\n } else {\n cmin = min - c.destMin;\n cmax = max - c.destMin;\n }\n\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n\n if (cmax >= bDest && cmin <= bDest + bSize) {\n var amin = Math.max(cmin, bDest) - bDest;\n var amax = Math.min(cmax, bDest + bSize) - bDest;\n\n if (c.destOri == '-') {\n srcBlocks.push(new DASSegment(c.srcChr, c.srcMax - bSrc - amax, c.srcMax - bSrc - amin));\n } else {\n srcBlocks.push(new DASSegment(c.srcChr, c.srcMin + amin + bSrc, c.srcMin + amax + bSrc));\n }\n }\n }\n }\n }\n callback(srcBlocks);\n }\n};\n\nfunction DASChainFetcher(uri, srcTag, destTag) {\n this.source = new DASSource(uri);\n this.srcTag = srcTag;\n this.destTag = destTag;\n}\n\nDASChainFetcher.prototype.fetchChains = function (chr, _min, _max) {\n var thisCS = this;\n\n return new Promise(function (resolve, reject) {\n thisCS.source.alignments(chr, {}, function (aligns) {\n var chains = [];\n\n for (var ai = 0; ai < aligns.length; ++ai) {\n var aln = aligns[ai];\n for (var bi = 0; bi < aln.blocks.length; ++bi) {\n var block = aln.blocks[bi];\n var srcSeg, destSeg;\n for (var si = 0; si < block.segments.length; ++si) {\n var seg = block.segments[si];\n var obj = aln.objects[seg.object];\n if (obj.dbSource === thisCS.srcTag) {\n srcSeg = seg;\n } else if (obj.dbSource === thisCS.destTag) {\n destSeg = seg;\n }\n }\n if (srcSeg && destSeg) {\n var chain = {\n srcChr: aln.objects[srcSeg.object].accession,\n srcMin: srcSeg.min | 0,\n srcMax: srcSeg.max | 0,\n srcOri: srcSeg.strand,\n destChr: aln.objects[destSeg.object].accession,\n destMin: destSeg.min | 0,\n destMax: destSeg.max | 0,\n destOri: destSeg.strand,\n blocks: []\n };\n\n var srcops = parseCigar(srcSeg.cigar),\n destops = parseCigar(destSeg.cigar);\n\n var srcOffset = 0,\n destOffset = 0;\n var srci = 0,\n desti = 0;\n while (srci < srcops.length && desti < destops.length) {\n if (srcops[srci].op == 'M' && destops[desti].op == 'M') {\n var blockLen = Math.min(srcops[srci].cnt, destops[desti].cnt);\n chain.blocks.push([srcOffset, destOffset, blockLen]);\n if (srcops[srci].cnt == blockLen) {\n ++srci;\n } else {\n srcops[srci].cnt -= blockLen;\n }\n if (destops[desti].cnt == blockLen) {\n ++desti;\n } else {\n destops[desti] -= blockLen;\n }\n srcOffset += blockLen;\n destOffset += blockLen;\n } else if (srcops[srci].op == 'I') {\n destOffset += srcops[srci++].cnt;\n } else if (destops[desti].op == 'I') {\n srcOffset += destops[desti++].cnt;\n }\n }\n\n chains.push(chain);\n }\n }\n }\n resolve(chains);\n });\n });\n};\n\nfunction BBIChainFetcher(uri, credentials) {\n var self = this;\n this.uri = uri;\n this.credentials = credentials;\n\n this.bwg = new Promise(function (resolve, reject) {\n makeBwg(new URLFetchable(self.uri, { credentials: self.credentials,\n resolver: self.resolver }), function (bwg, err) {\n if (bwg) {\n resolve(bwg);\n } else {\n reject(err);\n }\n });\n });\n\n this.bwg.then(function (bwg, err) {\n if (err) console.log(err);\n });\n}\n\nfunction pi(x) {\n return parseInt(x);\n}\n\nfunction cleanChr(c) {\n if (c.indexOf('chr') == 0) return c.substr(3);else return c;\n}\n\nfunction bbiFeatureToChain(feature) {\n var chain = {\n srcChr: cleanChr(feature.srcChrom),\n srcMin: parseInt(feature.srcStart),\n srcMax: parseInt(feature.srcEnd),\n srcOri: feature.srcOri,\n destChr: cleanChr(feature.segment),\n destMin: feature.min - 1, // Convert back from bigbed parser\n destMax: feature.max,\n destOri: feature.ori,\n blocks: []\n };\n var srcStarts = feature.srcStarts.split(',').map(pi);\n var destStarts = feature.destStarts.split(',').map(pi);\n var blockLengths = feature.blockLens.split(',').map(pi);\n for (var bi = 0; bi < srcStarts.length; ++bi) {\n chain.blocks.push([srcStarts[bi], destStarts[bi], blockLengths[bi]]);\n }\n\n return chain;\n}\n\nBBIChainFetcher.prototype.fetchChains = function (chr, min, max) {\n return this.bwg.then(function (bwg, err) {\n if (!bwg) throw Error(\"No BWG\");\n\n return new Promise(function (resolve, reject) {\n bwg.getUnzoomedView().readWigData(chr, min, max, function (feats) {\n resolve(feats.map(bbiFeatureToChain));\n });\n });\n });\n};\n\nfunction AliasChainFetcher(conf) {\n this.conf = conf;\n this.forwardAliases = {};\n var sa = conf.sequenceAliases || [];\n for (var ai = 0; ai < sa.length; ++ai) {\n var al = sa[ai];\n if (al.length < 2) continue;\n\n var fa = [];\n for (var i = 0; i < al.length - 1; ++i) {\n fa.push(al[i]);\n }this.forwardAliases[al[al.length - 1]] = fa;\n }\n}\n\nAliasChainFetcher.prototype.fetchChains = function (chr, min, max) {\n var resp = [];\n var fa = this.forwardAliases[chr] || [];\n for (var i = 0; i < fa.length; ++i) {\n resp.push({\n srcChr: fa[i],\n srcMin: 1,\n srcMax: 1000000000,\n srcOri: '+',\n destChr: chr,\n destMin: 1,\n destMax: 1000000000,\n destOri: '+',\n blocks: [[1, 1, 1000000000]]\n });\n }\n\n return Promise.resolve(resp);\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n Chainset: Chainset\n };\n}\n\n},{\"./bigwig\":3,\"./bin\":4,\"./cigar\":8,\"./das\":10,\"./utils\":56,\"es6-promise\":384}],8:[function(require,module,exports){\n'use strict';\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// chainset.js: liftover support\n//\n\nvar CIGAR_REGEXP = new RegExp('([0-9]*)([MIDS])', 'g');\n\nfunction parseCigar(cigar) {\n var cigops = [];\n var match;\n while ((match = CIGAR_REGEXP.exec(cigar)) != null) {\n var count = match[1];\n if (count.length == 0) {\n count = 1;\n }\n cigops.push({ cnt: count | 0, op: match[2] });\n }\n return cigops;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n parseCigar: parseCigar\n };\n}\n\n},{}],9:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// color.js\n//\n\n\"use strict\";\n\nfunction DColour(red, green, blue, name) {\n this.red = red | 0;\n this.green = green | 0;\n this.blue = blue | 0;\n if (name) {\n this.name = name;\n }\n}\n\nDColour.prototype.toSvgString = function () {\n if (!this.name) {\n this.name = \"rgb(\" + this.red + \",\" + this.green + \",\" + this.blue + \")\";\n }\n\n return this.name;\n};\n\nfunction hex2(x) {\n var y = '00' + x.toString(16);\n return y.substring(y.length - 2);\n}\n\nDColour.prototype.toHexString = function () {\n return '#' + hex2(this.red) + hex2(this.green) + hex2(this.blue);\n};\n\nvar palette = {\n red: new DColour(255, 0, 0, 'red'),\n green: new DColour(0, 255, 0, 'green'),\n blue: new DColour(0, 0, 255, 'blue'),\n yellow: new DColour(255, 255, 0, 'yellow'),\n white: new DColour(255, 255, 255, 'white'),\n black: new DColour(0, 0, 0, 'black'),\n gray: new DColour(180, 180, 180, 'gray'),\n grey: new DColour(180, 180, 180, 'grey'),\n lightskyblue: new DColour(135, 206, 250, 'lightskyblue'),\n lightsalmon: new DColour(255, 160, 122, 'lightsalmon'),\n hotpink: new DColour(255, 105, 180, 'hotpink')\n};\n\nvar COLOR_RE = new RegExp('^#([0-9A-Fa-f]{2})([0-9A-Fa-f]{2})([0-9A-Fa-f]{2})$');\nvar CSS_COLOR_RE = /rgb\\(([0-9]+),([0-9]+),([0-9]+)\\)/;\n\nfunction dasColourForName(name) {\n var c = palette[name];\n if (!c) {\n var match = COLOR_RE.exec(name);\n if (match) {\n c = new DColour('0x' + match[1] | 0, '0x' + match[2] | 0, '0x' + match[3] | 0, name);\n palette[name] = c;\n } else {\n match = CSS_COLOR_RE.exec(name);\n if (match) {\n c = new DColour(match[1] | 0, match[2] | 0, match[3] | 0, name);\n palette[name] = c;\n } else {\n console.log(\"couldn't handle color: \" + name);\n c = palette.black;\n palette[name] = c;\n }\n }\n }\n return c;\n}\n\nfunction makeColourSteps(steps, stops, colours) {\n var dcolours = [];\n for (var ci = 0; ci < colours.length; ++ci) {\n dcolours.push(dasColourForName(colours[ci]));\n }\n\n var grad = [];\n STEP_LOOP: for (var si = 0; si < steps; ++si) {\n var rs = 1.0 * si / (steps - 1);\n var score = stops[0] + (stops[stops.length - 1] - stops[0]) * rs;\n for (var i = 0; i < stops.length - 1; ++i) {\n if (score >= stops[i] && score <= stops[i + 1]) {\n var frac = (score - stops[i]) / (stops[i + 1] - stops[i]);\n var ca = dcolours[i];\n var cb = dcolours[i + 1];\n\n var fill = new DColour(ca.red * (1.0 - frac) + cb.red * frac | 0, ca.green * (1.0 - frac) + cb.green * frac | 0, ca.blue * (1.0 - frac) + cb.blue * frac | 0).toSvgString();\n grad.push(fill);\n\n continue STEP_LOOP;\n }\n }\n throw 'Bad step';\n }\n\n return grad;\n}\n\nfunction makeGradient(steps, color1, color2, color3) {\n if (color3) {\n return makeColourSteps(steps, [0, 0.5, 1], [color1, color2, color3]);\n } else {\n return makeColourSteps(steps, [0, 1], [color1, color2]);\n }\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n makeColourSteps: makeColourSteps,\n makeGradient: makeGradient,\n dasColourForName: dasColourForName\n };\n}\n\n},{}],10:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// das.js: queries and low-level data model.\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n var pusho = utils.pusho;\n\n var color = require('./color');\n var makeColourSteps = color.makeColourSteps;\n}\n\nvar dasLibErrorHandler = function dasLibErrorHandler(errMsg) {\n alert(errMsg);\n};\nvar dasLibRequestQueue = new Array();\n\nfunction DASSegment(name, start, end, description) {\n this.name = name;\n this.start = start;\n this.end = end;\n this.description = description;\n}\nDASSegment.prototype.toString = function () {\n return this.name + ':' + this.start + '..' + this.end;\n};\nDASSegment.prototype.isBounded = function () {\n return this.start && this.end;\n};\nDASSegment.prototype.toDASQuery = function () {\n var q = 'segment=' + this.name;\n if (this.start && this.end) {\n q += ':' + this.start + ',' + this.end;\n }\n return q;\n};\n\nfunction DASSource(a1, a2) {\n var options;\n if (typeof a1 == 'string') {\n this.uri = a1;\n options = a2 || {};\n } else {\n options = a1 || {};\n }\n for (var k in options) {\n this[k] = options[k];\n }\n\n if (!this.coords) {\n this.coords = [];\n }\n if (!this.props) {\n this.props = {};\n }\n\n this.dasBaseURI = this.uri;\n if (this.dasBaseURI && this.dasBaseURI.substr(this.uri.length - 1) != '/') {\n this.dasBaseURI = this.dasBaseURI + '/';\n }\n}\n\nDASSource.prototype.getURI = function (uri) {\n if (this.resolver) {\n return this.resolver(uri).then(function (urlOrObj) {\n if (typeof urlOrObj === 'string') {\n return urlOrObj;\n } else {\n return urlOrObj.url;\n }\n });\n } else {\n return Promise.resolve(uri);\n }\n};\n\nfunction DASCoords() {}\n\nfunction coordsMatch(c1, c2) {\n return c1.taxon == c2.taxon && c1.auth == c2.auth && c1.version == c2.version;\n}\n\n//\n// DAS 1.6 entry_points command\n//\n\nDASSource.prototype.entryPoints = function (callback) {\n var dasURI = this.dasBaseURI + 'entry_points';\n this.doCrossDomainRequest(dasURI, function (responseXML) {\n if (!responseXML) {\n return callback([]);\n }\n\n var entryPoints = new Array();\n\n var segs = responseXML.getElementsByTagName('SEGMENT');\n for (var i = 0; i < segs.length; ++i) {\n var seg = segs[i];\n var segId = seg.getAttribute('id');\n\n var segSize = seg.getAttribute('size');\n var segMin, segMax;\n if (segSize) {\n segMin = 1;segMax = segSize | 0;\n } else {\n segMin = seg.getAttribute('start');\n if (segMin) {\n segMin |= 0;\n }\n segMax = seg.getAttribute('stop');\n if (segMax) {\n segMax |= 0;\n }\n }\n var segDesc = null;\n if (seg.firstChild) {\n segDesc = seg.firstChild.nodeValue;\n }\n entryPoints.push(new DASSegment(segId, segMin, segMax, segDesc));\n }\n callback(entryPoints);\n });\n};\n\n//\n// DAS 1.6 sequence command\n// Do we need an option to fall back to the dna command?\n//\n\nfunction DASSequence(name, start, end, alpha, seq) {\n this.name = name;\n this.start = start;\n this.end = end;\n this.alphabet = alpha;\n this.seq = seq;\n}\n\nDASSource.prototype.sequence = function (segment, callback) {\n var dasURI = this.dasBaseURI + 'sequence?' + segment.toDASQuery();\n this.doCrossDomainRequest(dasURI, function (responseXML) {\n if (!responseXML) {\n callback([]);\n return;\n } else {\n var seqs = new Array();\n\n var segs = responseXML.getElementsByTagName('SEQUENCE');\n for (var i = 0; i < segs.length; ++i) {\n var seg = segs[i];\n var segId = seg.getAttribute('id');\n var segMin = seg.getAttribute('start');\n var segMax = seg.getAttribute('stop');\n var segAlpha = 'DNA';\n var segSeq = null;\n if (seg.firstChild) {\n var rawSeq = seg.firstChild.nodeValue;\n segSeq = '';\n var idx = 0;\n while (true) {\n var space = rawSeq.indexOf('\\n', idx);\n if (space >= 0) {\n segSeq += rawSeq.substring(idx, space).toUpperCase();\n idx = space + 1;\n } else {\n segSeq += rawSeq.substring(idx).toUpperCase();\n break;\n }\n }\n }\n seqs.push(new DASSequence(segId, segMin, segMax, segAlpha, segSeq));\n }\n\n callback(seqs);\n }\n });\n};\n\n//\n// DAS 1.6 features command\n//\n\nfunction DASFeature() {}\n\nfunction DASGroup(id) {\n if (id) this.id = id;\n}\n\nfunction DASLink(desc, uri) {\n this.desc = desc;\n this.uri = uri;\n}\n\nDASSource.prototype.features = function (segment, options, callback) {\n options = options || {};\n var thisB = this;\n\n var dasURI;\n if (this.features_uri) {\n dasURI = this.features_uri;\n } else {\n var filters = [];\n\n if (segment) {\n filters.push(segment.toDASQuery());\n } else if (options.group) {\n var g = options.group;\n if (typeof g == 'string') {\n filters.push('group_id=' + g);\n } else {\n for (var gi = 0; gi < g.length; ++gi) {\n filters.push('group_id=' + g[gi]);\n }\n }\n }\n\n if (options.adjacent) {\n var adj = options.adjacent;\n if (typeof adj == 'string') {\n adj = [adj];\n }\n for (var ai = 0; ai < adj.length; ++ai) {\n filters.push('adjacent=' + adj[ai]);\n }\n }\n\n if (options.type) {\n if (typeof options.type == 'string') {\n filters.push('type=' + options.type);\n } else {\n for (var ti = 0; ti < options.type.length; ++ti) {\n filters.push('type=' + options.type[ti]);\n }\n }\n }\n\n if (options.maxbins) {\n filters.push('maxbins=' + options.maxbins);\n }\n\n if (filters.length > 0) {\n dasURI = this.dasBaseURI + 'features?' + filters.join(';');\n } else {\n callback([], 'No filters specified');\n }\n }\n\n this.doCrossDomainRequest(dasURI, function (responseXML, req) {\n if (!responseXML) {\n var msg;\n if (req.status == 0) {\n msg = 'server may not support CORS';\n } else {\n msg = 'status=' + req.status;\n }\n callback([], 'Failed request: ' + msg);\n return;\n }\n /* if (req) {\n var caps = req.getResponseHeader('X-DAS-Capabilties');\n if (caps) {\n alert(caps);\n }\n } */\n\n var features = new Array();\n var segmentMap = {};\n\n var segs = responseXML.getElementsByTagName('SEGMENT');\n for (var si = 0; si < segs.length; ++si) {\n var segmentXML = segs[si];\n var segmentID = segmentXML.getAttribute('id');\n segmentMap[segmentID] = {\n min: segmentXML.getAttribute('start'),\n max: segmentXML.getAttribute('stop')\n };\n\n var featureXMLs = segmentXML.getElementsByTagName('FEATURE');\n for (var i = 0; i < featureXMLs.length; ++i) {\n var feature = featureXMLs[i];\n var dasFeature = new DASFeature();\n\n dasFeature.segment = segmentID;\n dasFeature.id = feature.getAttribute('id');\n dasFeature.label = feature.getAttribute('label');\n\n /*\n var childNodes = feature.childNodes;\n for (var c = 0; c < childNodes.length; ++c) {\n var cn = childNodes[c];\n if (cn.nodeType == Node.ELEMENT_NODE) {\n var key = cn.tagName;\n //var val = null;\n //if (cn.firstChild) {\n // val = cn.firstChild.nodeValue;\n //}\n dasFeature[key] = 'x';\n }\n } */\n\n var spos = elementValue(feature, \"START\");\n var epos = elementValue(feature, \"END\");\n if ((spos | 0) > (epos | 0)) {\n dasFeature.min = epos | 0;\n dasFeature.max = spos | 0;\n } else {\n dasFeature.min = spos | 0;\n dasFeature.max = epos | 0;\n }\n {\n var tec = feature.getElementsByTagName('TYPE');\n if (tec.length > 0) {\n var te = tec[0];\n if (te.firstChild) {\n dasFeature.type = te.firstChild.nodeValue;\n }\n dasFeature.typeId = te.getAttribute('id');\n dasFeature.typeCv = te.getAttribute('cvId');\n }\n }\n dasFeature.type = elementValue(feature, \"TYPE\");\n if (!dasFeature.type && dasFeature.typeId) {\n dasFeature.type = dasFeature.typeId; // FIXME?\n }\n\n dasFeature.method = elementValue(feature, \"METHOD\");\n {\n var ori = elementValue(feature, \"ORIENTATION\");\n if (!ori) {\n ori = '0';\n }\n dasFeature.orientation = ori;\n }\n dasFeature.score = elementValue(feature, \"SCORE\");\n dasFeature.links = dasLinksOf(feature);\n dasFeature.notes = dasNotesOf(feature);\n\n var groups = feature.getElementsByTagName(\"GROUP\");\n for (var gi = 0; gi < groups.length; ++gi) {\n var groupXML = groups[gi];\n var dasGroup = new DASGroup();\n dasGroup.type = groupXML.getAttribute('type');\n dasGroup.id = groupXML.getAttribute('id');\n dasGroup.links = dasLinksOf(groupXML);\n dasGroup.notes = dasNotesOf(groupXML);\n if (!dasFeature.groups) {\n dasFeature.groups = new Array(dasGroup);\n } else {\n dasFeature.groups.push(dasGroup);\n }\n }\n\n // Magic notes. Check with TAD before changing this.\n if (dasFeature.notes) {\n for (var ni = 0; ni < dasFeature.notes.length; ++ni) {\n var n = dasFeature.notes[ni];\n if (n.indexOf('Genename=') == 0) {\n var gg = new DASGroup();\n gg.type = 'gene';\n gg.id = n.substring(9);\n if (!dasFeature.groups) {\n dasFeature.groups = new Array(gg);\n } else {\n dasFeature.groups.push(gg);\n }\n }\n }\n }\n\n {\n var pec = feature.getElementsByTagName('PART');\n if (pec.length > 0) {\n var parts = [];\n for (var pi = 0; pi < pec.length; ++pi) {\n parts.push(pec[pi].getAttribute('id'));\n }\n dasFeature.parts = parts;\n }\n }\n {\n var pec = feature.getElementsByTagName('PARENT');\n if (pec.length > 0) {\n var parents = [];\n for (var pi = 0; pi < pec.length; ++pi) {\n parents.push(pec[pi].getAttribute('id'));\n }\n dasFeature.parents = parents;\n }\n }\n\n features.push(dasFeature);\n }\n }\n\n callback(features, undefined, segmentMap);\n }, function (err) {\n callback([], err);\n });\n};\n\nfunction DASAlignment(type) {\n this.type = type;\n this.objects = {};\n this.blocks = [];\n}\n\nDASSource.prototype.alignments = function (segment, options, callback) {\n var dasURI = this.dasBaseURI + 'alignment?query=' + segment;\n this.doCrossDomainRequest(dasURI, function (responseXML) {\n if (!responseXML) {\n callback([], 'Failed request ' + dasURI);\n return;\n }\n\n var alignments = [];\n var aliXMLs = responseXML.getElementsByTagName('alignment');\n for (var ai = 0; ai < aliXMLs.length; ++ai) {\n var aliXML = aliXMLs[ai];\n var ali = new DASAlignment(aliXML.getAttribute('alignType'));\n var objXMLs = aliXML.getElementsByTagName('alignObject');\n for (var oi = 0; oi < objXMLs.length; ++oi) {\n var objXML = objXMLs[oi];\n var obj = {\n id: objXML.getAttribute('intObjectId'),\n accession: objXML.getAttribute('dbAccessionId'),\n version: objXML.getAttribute('objectVersion'),\n dbSource: objXML.getAttribute('dbSource'),\n dbVersion: objXML.getAttribute('dbVersion')\n };\n ali.objects[obj.id] = obj;\n }\n\n var blockXMLs = aliXML.getElementsByTagName('block');\n for (var bi = 0; bi < blockXMLs.length; ++bi) {\n var blockXML = blockXMLs[bi];\n var block = {\n order: blockXML.getAttribute('blockOrder'),\n segments: []\n };\n var segXMLs = blockXML.getElementsByTagName('segment');\n for (var si = 0; si < segXMLs.length; ++si) {\n var segXML = segXMLs[si];\n var seg = {\n object: segXML.getAttribute('intObjectId'),\n min: segXML.getAttribute('start'),\n max: segXML.getAttribute('end'),\n strand: segXML.getAttribute('strand'),\n cigar: elementValue(segXML, 'cigar')\n };\n block.segments.push(seg);\n }\n ali.blocks.push(block);\n }\n\n alignments.push(ali);\n }\n callback(alignments);\n });\n};\n\nfunction DASStylesheet() {\n this.styles = [];\n}\n\nDASStylesheet.prototype.pushStyle = function (filters, zoom, style) {\n if (!filters) {\n filters = { type: 'default' };\n }\n var styleHolder = shallowCopy(filters);\n if (zoom) {\n styleHolder.zoom = zoom;\n }\n styleHolder.style = style;\n this.styles.push(styleHolder);\n};\n\nfunction DASStyle() {}\n\nfunction parseGradient(grad) {\n var steps = grad.getAttribute('steps');\n if (steps) {\n steps = steps | 0;\n } else {\n steps = 50;\n }\n\n var stops = [];\n var colors = [];\n var se = grad.getElementsByTagName('STOP');\n for (var si = 0; si < se.length; ++si) {\n var stop = se[si];\n stops.push(1.0 * stop.getAttribute('score'));\n colors.push(stop.firstChild.nodeValue);\n }\n\n return makeColourSteps(steps, stops, colors);\n}\n\nDASSource.prototype.stylesheet = function (successCB, failureCB) {\n var dasURI,\n creds = this.credentials;\n if (this.stylesheet_uri) {\n dasURI = this.stylesheet_uri;\n creds = false;\n } else {\n dasURI = this.dasBaseURI + 'stylesheet';\n }\n\n this.getURI(dasURI).then(function (dasURI) {\n doCrossDomainRequest(dasURI, function (responseXML) {\n if (!responseXML) {\n if (failureCB) {\n failureCB();\n }\n return;\n }\n var stylesheet = new DASStylesheet();\n var typeXMLs = responseXML.getElementsByTagName('TYPE');\n for (var i = 0; i < typeXMLs.length; ++i) {\n var typeStyle = typeXMLs[i];\n\n var filter = {};\n filter.type = typeStyle.getAttribute('id'); // Am I right in thinking that this makes DASSTYLE XML invalid? Ugh.\n filter.label = typeStyle.getAttribute('label');\n filter.method = typeStyle.getAttribute('method');\n var glyphXMLs = typeStyle.getElementsByTagName('GLYPH');\n for (var gi = 0; gi < glyphXMLs.length; ++gi) {\n var glyphXML = glyphXMLs[gi];\n var zoom = glyphXML.getAttribute('zoom');\n var glyph = childElementOf(glyphXML);\n var style = new DASStyle();\n style.glyph = glyph.localName;\n var child = glyph.firstChild;\n\n while (child) {\n if (child.nodeType == Node.ELEMENT_NODE) {\n if (child.localName == 'BGGRAD') {\n style[child.localName] = parseGradient(child);\n } else {\n style[child.localName] = child.firstChild.nodeValue;\n }\n }\n child = child.nextSibling;\n }\n stylesheet.pushStyle(filter, zoom, style);\n }\n }\n successCB(stylesheet);\n }, creds);\n }).catch(function (err) {\n console.log(err);\n failureCB();\n });\n};\n\n//\n// sources command\n// \n\nfunction DASRegistry(uri, opts) {\n opts = opts || {};\n this.uri = uri;\n this.opts = opts;\n}\n\nDASRegistry.prototype.sources = function (callback, failure, opts) {\n if (!opts) {\n opts = {};\n }\n\n var filters = [];\n if (opts.taxon) {\n filters.push('organism=' + opts.taxon);\n }\n if (opts.auth) {\n filters.push('authority=' + opts.auth);\n }\n if (opts.version) {\n filters.push('version=' + opts.version);\n }\n var quri = this.uri;\n if (filters.length > 0) {\n quri = quri + '?' + filters.join('&'); // '&' as a separator to hack around dasregistry.org bug.\n }\n\n doCrossDomainRequest(quri, function (responseXML) {\n if (!responseXML && failure) {\n failure();\n return;\n }\n\n var sources = [];\n var sourceXMLs = responseXML.getElementsByTagName('SOURCE');\n for (var si = 0; si < sourceXMLs.length; ++si) {\n var sourceXML = sourceXMLs[si];\n var versionXMLs = sourceXML.getElementsByTagName('VERSION');\n if (versionXMLs.length < 1) {\n continue;\n }\n var versionXML = versionXMLs[0];\n\n var coordXMLs = versionXML.getElementsByTagName('COORDINATES');\n var coords = [];\n for (var ci = 0; ci < coordXMLs.length; ++ci) {\n var coordXML = coordXMLs[ci];\n var coord = new DASCoords();\n coord.auth = coordXML.getAttribute('authority');\n coord.taxon = coordXML.getAttribute('taxid');\n coord.version = coordXML.getAttribute('version');\n coords.push(coord);\n }\n\n var caps = [];\n var capXMLs = versionXML.getElementsByTagName('CAPABILITY');\n var uri;\n for (var ci = 0; ci < capXMLs.length; ++ci) {\n var capXML = capXMLs[ci];\n\n caps.push(capXML.getAttribute('type'));\n\n if (capXML.getAttribute('type') == 'das1:features') {\n var fep = capXML.getAttribute('query_uri');\n uri = fep.substring(0, fep.length - 'features'.length);\n }\n }\n\n var props = {};\n var propXMLs = versionXML.getElementsByTagName('PROP');\n for (var pi = 0; pi < propXMLs.length; ++pi) {\n pusho(props, propXMLs[pi].getAttribute('name'), propXMLs[pi].getAttribute('value'));\n }\n\n if (uri) {\n var source = new DASSource(uri, {\n source_uri: sourceXML.getAttribute('uri'),\n name: sourceXML.getAttribute('title'),\n desc: sourceXML.getAttribute('description'),\n coords: coords,\n props: props,\n capabilities: caps\n });\n sources.push(source);\n }\n }\n\n callback(sources);\n });\n};\n\n//\n// Utility functions\n//\n\nfunction elementValue(element, tag) {\n var children = element.getElementsByTagName(tag);\n if (children.length > 0 && children[0].firstChild) {\n var c = children[0];\n if (c.childNodes.length == 1) {\n return c.firstChild.nodeValue;\n } else {\n var s = '';\n for (var ni = 0; ni < c.childNodes.length; ++ni) {\n s += c.childNodes[ni].nodeValue;\n }\n return s;\n }\n } else {\n return null;\n }\n}\n\nfunction childElementOf(element) {\n if (element.hasChildNodes()) {\n var child = element.firstChild;\n do {\n if (child.nodeType == Node.ELEMENT_NODE) {\n return child;\n }\n child = child.nextSibling;\n } while (child != null);\n }\n return null;\n}\n\nfunction dasLinksOf(element) {\n var links = new Array();\n var maybeLinkChilden = element.getElementsByTagName('LINK');\n for (var ci = 0; ci < maybeLinkChilden.length; ++ci) {\n var linkXML = maybeLinkChilden[ci];\n if (linkXML.parentNode == element) {\n links.push(new DASLink(linkXML.firstChild ? linkXML.firstChild.nodeValue : 'Unknown', linkXML.getAttribute('href')));\n }\n }\n\n return links;\n}\n\nfunction dasNotesOf(element) {\n var notes = [];\n var maybeNotes = element.getElementsByTagName('NOTE');\n for (var ni = 0; ni < maybeNotes.length; ++ni) {\n if (maybeNotes[ni].firstChild) {\n notes.push(maybeNotes[ni].firstChild.nodeValue);\n }\n }\n return notes;\n}\n\nfunction doCrossDomainRequest(url, handler, credentials, custAuth) {\n // TODO: explicit error handlers?\n\n if (window.XDomainRequest) {\n var req = new XDomainRequest();\n req.onload = function () {\n var dom = new ActiveXObject(\"Microsoft.XMLDOM\");\n dom.async = false;\n dom.loadXML(req.responseText);\n handler(dom);\n };\n req.open(\"get\", url);\n req.send();\n } else {\n try {\n var req = new XMLHttpRequest();\n var timeout = setTimeout(function () {\n console.log('timing out ' + url);\n req.abort();\n handler(null, req);\n }, 5000);\n\n req.ontimeout = function () {\n console.log('timeout on ' + url);\n };\n\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n clearTimeout(timeout);\n if (req.status >= 200 || req.status == 0) {\n handler(req.responseXML, req);\n }\n }\n };\n req.open(\"get\", url, true);\n // IE10/11 fix: The timeout property may be set only in the time interval between a call to the open method\n // and the first call to the send method.\n req.timeout = 5000;\n if (credentials) {\n req.withCredentials = true;\n }\n if (custAuth) {\n req.setRequestHeader('X-DAS-Authorisation', custAuth);\n }\n req.overrideMimeType('text/xml');\n req.setRequestHeader('Accept', 'application/xml,*/*');\n req.send();\n } catch (e) {\n handler(null, req, e);\n }\n }\n}\n\nDASSource.prototype.doCrossDomainRequest = function (url, handler, errHandler) {\n var custAuth;\n if (this.xUser) {\n custAuth = 'Basic ' + btoa(this.xUser + ':' + this.xPass);\n }\n\n try {\n return doCrossDomainRequest(url, handler, this.credentials, custAuth);\n } catch (err) {\n if (errHandler) {\n errHandler(err);\n } else {\n throw err;\n }\n }\n};\n\nfunction isDasBooleanTrue(s) {\n s = ('' + s).toLowerCase();\n return s === 'yes' || s === 'true';\n}\n\nfunction isDasBooleanNotFalse(s) {\n if (!s) return false;\n\n s = ('' + s).toLowerCase();\n return s !== 'no' || s !== 'false';\n}\n\nfunction copyStylesheet(ss) {\n var nss = shallowCopy(ss);\n nss.styles = [];\n for (var si = 0; si < ss.styles.length; ++si) {\n var sh = nss.styles[si] = shallowCopy(ss.styles[si]);\n sh._methodRE = sh._labelRE = sh._typeRE = undefined;\n sh.style = shallowCopy(sh.style);\n sh.style.id = undefined;\n sh.style._gradient = undefined;\n }\n return nss;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n DASGroup: DASGroup,\n DASFeature: DASFeature,\n DASStylesheet: DASStylesheet,\n DASStyle: DASStyle,\n DASSource: DASSource,\n DASSegment: DASSegment,\n DASRegistry: DASRegistry,\n DASSequence: DASSequence,\n DASLink: DASLink,\n\n isDasBooleanTrue: isDasBooleanTrue,\n isDasBooleanNotFalse: isDasBooleanNotFalse,\n copyStylesheet: copyStylesheet,\n coordsMatch: coordsMatch\n };\n}\n\n},{\"./color\":9,\"./utils\":56}],11:[function(require,module,exports){\n/* jshint esversion: 6 */\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.paintQuant = exports.createQuantOverlay = exports.clearViewport = exports.drawUnmapped = exports.paint = exports.prepareViewport = exports.prepareSubtiers = exports.drawTier = exports.renderTier = undefined;\n\nvar _slicedToArray = function () { function sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"]) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; } return function (arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return sliceIterator(arr, i); } else { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); } }; }();\n\nvar _featureDraw = require(\"./feature-draw.js\");\n\nvar _sequenceDraw = require(\"./sequence-draw.js\");\n\nvar _spans = require(\"./spans.js\");\n\nvar _utils = require(\"./utils.js\");\n\nvar _glyphs = require(\"./glyphs.js\");\n\nvar Glyphs = _interopRequireWildcard(_glyphs);\n\nvar _das = require(\"./das.js\");\n\nvar _color = require(\"./color.js\");\n\nvar _cigar = require(\"./cigar.js\");\n\nvar _numformats = require(\"./numformats\");\n\nvar _ramda = require(\"ramda\");\n\nvar R = _interopRequireWildcard(_ramda);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\n// The only functions that must be exported by a renderer are renderTier\n// and drawTier, the rest are exported for use in other renderers.\nexports.renderTier = renderTier;\nexports.drawTier = drawTier;\nexports.prepareSubtiers = prepareSubtiers;\nexports.prepareViewport = prepareViewport;\nexports.paint = paint;\nexports.drawUnmapped = drawUnmapped;\nexports.clearViewport = clearViewport;\nexports.createQuantOverlay = createQuantOverlay;\nexports.paintQuant = paintQuant;\n\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\nfunction drawTier(tier) {\n var canvas = tier.viewport.getContext(\"2d\");\n var retina = tier.browser.retina && window.devicePixelRatio > 1;\n\n if (tier.sequenceSource) {\n var sequence = tier.currentSequence;\n (0, _sequenceDraw.drawSeqTier)(tier, sequence);\n } else if (tier.currentFeatures) {\n prepareSubtiers(tier, canvas);\n } else {\n console.log(\"No sequence or features in tier!\");\n }\n\n if (tier.subtiers) {\n var vOffset = R.defaultTo(0, tier.dasSource.vOffset);\n\n prepareViewport(tier, canvas, retina, true, vOffset); // NB calls canvas.save\n paint(tier, canvas, vOffset);\n canvas.restore();\n }\n\n tier.drawOverlay();\n tier.paintQuant();\n\n if (typeof tier.dasSource.drawCallback === \"function\") {\n tier.dasSource.drawCallback(canvas, tier);\n }\n\n tier.originHaxx = 0;\n tier.browser.arrangeTiers();\n}\n\nfunction glyphsForGroup(canvas, features, y, groupElement, tier) {\n var gstyle = tier.styleForFeature(groupElement);\n var label = void 0;\n var labelWanted = false;\n\n var glyphs = [];\n var strand = null;\n\n features.forEach(function (f) {\n if (f.orientation && strand === null) {\n strand = f.orientation;\n }\n\n if (!label && f.label) {\n label = f.label;\n }\n\n var style = tier.styleForFeature(f);\n if (style && !f.parts) {\n if ((0, _das.isDasBooleanTrue)(style.LABEL)) labelWanted = true;\n\n var glyph = glyphForFeature(canvas, f, y, style, tier, null, true);\n if (glyph) glyphs.push(glyph);\n }\n });\n\n if (glyphs.length === 0) return null;\n\n var connector = 'flat';\n if (gstyle && gstyle.glyph === 'LINE') {\n // Stick with flat...\n } else {\n if (tier.dasSource.collapseSuperGroups && !tier.bumped) {\n if (strand === '+' || strand === '-') {\n connector = 'collapsed' + strand;\n }\n } else {\n if (strand === '+' || strand === '-') {\n connector = 'hat' + strand;\n }\n }\n }\n\n var labelText = null;\n if (label && labelWanted || gstyle && ((0, _das.isDasBooleanTrue)(gstyle.LABEL) || (0, _das.isDasBooleanTrue)(gstyle.LABELS))) {\n // HACK, LABELS should work.\n labelText = groupElement.label || label;\n }\n\n glyphs.sort(function (g1, g2) {\n return (g1.zindex || 0) - (g2.zindex || 0);\n });\n\n var groupGlyph = new Glyphs.GroupGlyph(glyphs, connector);\n if (labelText) {\n if (strand === '+') {\n labelText = '>' + labelText;\n } else if (strand === '-') {\n labelText = '<' + labelText;\n }\n groupGlyph = new Glyphs.LabelledGlyph(canvas, groupGlyph, labelText, false);\n }\n groupGlyph.bump = true;\n return groupGlyph;\n}\n\nfunction glyphForFeature(canvas, feature, y, style, tier, forceHeight, noLabel) {\n var scale = tier.browser.scale;\n var origin = tier.browser.viewStart;\n var glyphType = style.glyph || 'BOX';\n\n var min = feature.min;\n var max = feature.max;\n var strand = feature.orientation;\n var score = feature.score;\n var label = feature.label || feature.id;\n\n // Hide glyphs that are smaller than a pixel in width.\n if (tier.dasSource.hideSubpixelGlyphs && (max - min) * scale < 1) return null;\n\n var minPos = (min - origin) * scale;\n var rawMaxPos = (max - origin + 1) * scale;\n var maxPos = Math.max(rawMaxPos, minPos + 1);\n\n forceHeight = forceHeight * 1.0;\n var height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n height = height * 1.0;\n var bump = style.BUMP && (0, _das.isDasBooleanTrue)(style.BUMP);\n\n var glyph = void 0;\n var quant = void 0;\n\n // Create the glyph\n if (glyphType === 'CROSS' || glyphType === 'EX' || glyphType === 'TRIANGLE' || glyphType === 'DOT' || glyphType === 'SQUARE' || glyphType === 'STAR' || glyphType === 'PLIMSOLL') {\n var glyphHolder = featureToCrossLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight, noLabel);\n if (glyphHolder) {\n var _glyphHolder = _slicedToArray(glyphHolder, 2);\n\n glyph = _glyphHolder[0];\n quant = _glyphHolder[1];\n }\n } else if (glyphType === 'HISTOGRAM' || glyphType === 'GRADIENT' && score !== 'undefined') {\n var _featureToGradientLik = featureToGradientLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight);\n\n var _featureToGradientLik2 = _slicedToArray(_featureToGradientLik, 2);\n\n glyph = _featureToGradientLik2[0];\n quant = _featureToGradientLik2[1];\n } else if (glyphType === 'HIDDEN') {\n glyph = new Glyphs.PaddedGlyph(null, minPos, maxPos);\n noLabel = true;\n } else if (glyphType === 'ARROW') {\n var color = style.FGCOLOR || 'purple';\n var parallel = (0, _das.isDasBooleanTrue)(style.PARALLEL);\n var sw = (0, _das.isDasBooleanTrue)(style.SOUTHWEST);\n var ne = (0, _das.isDasBooleanTrue)(style.NORTHEAST);\n glyph = new Glyphs.ArrowGlyph(minPos, maxPos, height, color, parallel, sw, ne);\n } else if (glyphType === 'ANCHORED_ARROW') {\n var stroke = style.FGCOLOR || 'none';\n var fill = style.BGCOLOR || 'green';\n glyph = new Glyphs.AArrowGlyph(minPos, maxPos, height, fill, stroke, strand);\n glyph.bump = true;\n } else if (glyphType === 'SPAN') {\n var _stroke = style.FGCOLOR || 'black';\n glyph = new Glyphs.SpanGlyph(minPos, maxPos, height, _stroke);\n } else if (glyphType === 'LINE') {\n var _stroke2 = style.FGCOLOR || 'black';\n var lineStyle = style.STYLE || 'solid';\n glyph = new Glyphs.LineGlyph(minPos, maxPos, height, lineStyle, strand, _stroke2);\n } else if (glyphType === 'PRIMERS') {\n var _stroke3 = style.FGCOLOR || 'black';\n var _fill = style.BGCOLOR || 'red';\n glyph = new Glyphs.PrimersGlyph(minPos, maxPos, height, _fill, _stroke3);\n } else if (glyphType === 'TEXT') {\n var string = style.STRING || 'text';\n var _fill2 = style.FGCOLOR || 'black';\n glyph = new Glyphs.TextGlyph(canvas, minPos, maxPos, height, _fill2, string);\n } else if (glyphType === 'TOOMANY') {\n var _stroke4 = style.FGCOLOR || 'gray';\n var _fill3 = style.BGCOLOR || 'orange';\n glyph = new Glyphs.TooManyGlyph(minPos, maxPos, height, _fill3, _stroke4);\n } else if (glyphType === 'POINT') {\n var _featureToPointGlyph = featureToPointGlyph(tier, feature, style);\n\n var _featureToPointGlyph2 = _slicedToArray(_featureToPointGlyph, 2);\n\n glyph = _featureToPointGlyph2[0];\n quant = _featureToPointGlyph2[1];\n } else if (glyphType === '__SEQUENCE') {\n glyph = sequenceGlyph(canvas, tier, feature, style, forceHeight);\n } else if (glyphType === '__INSERTION') {\n var insertionLabels = true;\n if (style.__INSERTIONS !== undefined) insertionLabels = (0, _das.isDasBooleanNotFalse)(style.__INSERTIONS);\n glyph = new Glyphs.TriangleGlyph(minPos, 5, 'S', 5, tier.browser.baseColors['I']);\n if (insertionLabels) glyph = new Glyphs.LabelledGlyph(canvas, glyph, feature.insertion || feature.altAlleles[0], false, 'center', 'above', '7px sans-serif');\n\n if (maxPos - minPos > 1) {\n var _stroke5 = style.FGCOLOR || 'red';\n var _fill4 = style.BGCOLOR || style.COLOR1 || 'green';\n var bg = new Glyphs.BoxGlyph(minPos, 5, maxPos - minPos, height, _fill4, _stroke5);\n glyph = new Glyphs.GroupGlyph([bg, glyph]);\n }\n } else if (glyphType === '__NONE') {\n return null;\n } else if (glyphType === 'BOX') {\n var _stroke6 = style.FGCOLOR || null;\n var _fill5 = style.BGCOLOR || style.COLOR1 || 'green';\n if (style.BGITEM && feature.itemRgb) _fill5 = feature.itemRgb;\n var _scale = (maxPos - minPos) / (max - min);\n if (feature.type == 'translation' && (feature.method == 'protein_coding' || feature.readframeExplicit) && (!feature.tags || feature.tags.indexOf('cds_start_NF') < 0 || feature.readframeExplicit) && (!tier.dasSource.collapseSuperGroups || tier.bumped) && _scale >= 0.5) {\n var refSeq = getRefSeq(tier, min, max);\n glyph = new Glyphs.AminoAcidGlyph(minPos, maxPos, height, _fill5, refSeq, feature.orientation, feature.readframe);\n } else {\n glyph = new Glyphs.BoxGlyph(minPos, 0, maxPos - minPos, height, _fill5, _stroke6);\n }\n }\n\n if (!glyph) return;\n\n if (((0, _das.isDasBooleanTrue)(style.LABEL) || feature.forceLabel) && label && !noLabel) {\n glyph = new Glyphs.LabelledGlyph(canvas, glyph, label, false);\n }\n\n if (bump) {\n glyph.bump = true;\n }\n\n glyph.feature = feature;\n\n if ((0, _das.isDasBooleanTrue)(style[\"HIDEAXISLABEL\"])) quant = null;\n\n if (quant) {\n glyph.quant = quant;\n }\n\n if (style.ZINDEX) {\n glyph.zindex = style.ZINDEX | 0;\n }\n\n return glyph;\n}\n\nfunction groupFeatures(tier, canvas, y) {\n var glyphs = [];\n var gbsFeatures = {};\n var gbsStyles = {};\n var stackedFeatures = [];\n\n R.map(function (features) {\n features.forEach(function (feature) {\n var style = tier.styleForFeature(feature);\n\n if (feature.parts || !style) return;\n\n if (style.glyph === 'LINEPLOT') {\n (0, _utils.pusho)(gbsFeatures, style.id, feature);\n gbsStyles[style.id] = style;\n } else if (style.glyph === 'STACKED') {\n stackedFeatures.push(feature);\n } else {\n var glyph = glyphForFeature(canvas, feature, y, style, tier);\n if (glyph) glyphs.push(glyph);\n }\n });\n }, tier.ungroupedFeatures);\n\n if (stackedFeatures.length > 0) {\n glyphs = glyphs.concat(makeStackedBars(stackedFeatures, tier));\n }\n\n for (var gbs in gbsFeatures) {\n var gf = gbsFeatures[gbs];\n var style = gbsStyles[gbs];\n if (style.glyph === 'LINEPLOT') {\n var lineGraphGlyphs = makeLinePlot(gf, style, tier, y);\n lineGraphGlyphs.forEach(function (g) {\n return glyphs.push(g);\n });\n }\n }\n\n return glyphs;\n}\n\nfunction glyphifyGroups(tier, canvas, glyphs, y) {\n var groupIds = Object.keys(tier.groupedFeatures);\n var groupGlyphs = {};\n\n groupIds.sort(function (g1, g2) {\n return tier.groupedFeatures[g2][0].score - tier.groupedFeatures[g1][0].score;\n });\n\n groupIds.forEach(function (gId) {\n var glyphs = glyphsForGroup(canvas, tier.groupedFeatures[gId], y, tier.groups[gId], tier, tier.dasSource.collapseSuperGroups && !tier.bumped ? 'collapsed_gene' : 'tent');\n\n if (glyphs) {\n glyphs.group = tier.groups[gId];\n groupGlyphs[gId] = glyphs;\n }\n });\n\n return groupGlyphs;\n}\n\nfunction bumpSubtiers(tier, glyphs, grid, gridOffset, gridSpacing) {\n var subtierMax = tier.subtierMax || tier.dasSource.subtierMax || tier.browser.defaultSubtierMax;\n\n var subtiersExceeded = false;\n\n var unbumpedST = new _featureDraw.SubTier();\n var bumpedSTs = [];\n\n // We want to add each glyph to either the subtier\n // containing unbumped subtiers, or to the first bumped subtier.\n glyphs.forEach(function (glyph) {\n // if the glyph is to be bumped...\n if (glyph.bump && (tier.bumped || tier.dasSource.collapseSuperGroups)) {\n\n var glyphTier = bumpedSTs.find(function (st) {\n return st.hasSpaceFor(glyph);\n });\n\n if (glyphTier) {\n glyphTier.add(glyph);\n } else if (bumpedSTs.length >= subtierMax) {\n subtiersExceeded = true;\n } else {\n var subtier = new _featureDraw.SubTier();\n subtier.add(glyph);\n bumpedSTs.push(subtier);\n }\n } else {\n unbumpedST.add(glyph);\n }\n });\n\n if (unbumpedST.glyphs.length > 0) {\n bumpedSTs = [unbumpedST].concat(bumpedSTs);\n }\n\n // Simple hack to make the horizontal grid in bumped subtiers (e.g. lineplots)\n // optional and configurable.\n if (grid) {\n bumpedSTs.forEach(function (subtier) {\n if (subtier.quant) {\n subtier.glyphs.unshift(new Glyphs.GridGlyph(subtier.height, gridOffset, gridSpacing));\n }\n });\n }\n\n bumpedSTs.forEach(function (subtier) {\n subtier.glyphs.sort(function (g1, g2) {\n return (g1.zindex || 0) - (g2.zindex || 0);\n });\n });\n\n return [bumpedSTs, subtiersExceeded];\n}\n\n// The whole tier is translated downward on its canvas by y pixels\nfunction prepareSubtiers(tier, canvas) {\n var y = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n var grid = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n\n\n var MIN_PADDING = 3;\n tier.padding = typeof tier.dasSource.padding === 'number' ? tier.dasSource.padding : MIN_PADDING;\n\n tier.scaleVertical = typeof tier.dasSource.scaleVertical === 'boolean' ? tier.dasSource.scaleVertical : false;\n\n var glyphs = groupFeatures(tier, canvas, y);\n\n // Merge supergroups\n if (tier.dasSource.collapseSuperGroups && !tier.bumped) {\n var _loop = function _loop(sgId) {\n var sgGroup = tier.superGroups[sgId];\n tier.groups[sgId] = (0, _utils.shallowCopy)(tier.groups[sgId]);\n var group = tier.groups[sgId];\n group.isSuperGroup = true;\n var featuresByType = {};\n\n var sgMin = 10000000000,\n sgMax = -10000000000;\n var sgSeg = null;\n\n sgGroup.forEach(function (g, i) {\n var groupedFeature = tier.groupedFeatures[sgGroup[i]];\n if (!groupedFeature) return;\n\n groupedFeature.forEach(function (feature) {\n (0, _utils.pusho)(featuresByType, feature.type, feature);\n sgMin = Math.min(feature.min, sgMin);\n sgMax = Math.max(feature.max, sgMax);\n if (feature.segment && !sgSeg) sgSeg = feature.segment;\n });\n\n if (group && !group.links || group.links.length === 0) {\n group.links = tier.groups[sgGroup[0]].links;\n }\n\n delete tier.groupedFeatures[sgGroup[i]];\n });\n\n tier.groups[sgId].max = sgMax;\n tier.groups[sgId].min = sgMin;\n tier.groups[sgId].segment = sgSeg;\n\n R.map(function (features) {\n\n var template = features[0];\n var loc = null;\n\n features.forEach(function (feature) {\n var fl = new _spans.Range(feature.min, feature.max);\n loc = loc ? (0, _spans.union)(loc, fl) : fl;\n });\n\n var mergedRanges = loc.ranges();\n\n mergedRanges.forEach(function (range) {\n var posCoverage = ((range.max() | 0) - (range.min() | 0) + 1) * sgGroup.length;\n var actCoverage = 0;\n\n features.forEach(function (feature) {\n var fmin = feature.min || 0;\n var fmax = feature.max || 0;\n if (fmin <= range.max() && fmax >= range.min()) {\n\n actCoverage += Math.min(fmax, range.max()) - Math.max(fmin, range.min()) + 1;\n }\n });\n\n var newFeature = new _das.DASFeature();\n for (var key in template) {\n newFeature[key] = template[key];\n }\n\n newFeature.min = range.min();\n newFeature.max = range.max();\n if (newFeature.label && sgGroup.length > 1) {\n newFeature.label += ' (' + sgGroup.length + ' vars)';\n }\n\n newFeature.visualWeight = 1.0 * actCoverage / posCoverage;\n\n (0, _utils.pusho)(tier.groupedFeatures, sgId, newFeature);\n });\n }, featuresByType);\n\n delete tier.superGroups[sgId]; // Do we want this?\n };\n\n for (var sgId in tier.superGroups) {\n _loop(sgId);\n }\n }\n\n // Glyphify groups.\n var groupGlyphs = glyphifyGroups(tier, canvas, glyphs, y);\n\n R.map(function (superGroup) {\n var sgGlyphs = [];\n var sgMin = 10000000000;\n var sgMax = -10000000000;\n\n superGroup.forEach(function (glyphs) {\n var gGlyphs = groupGlyphs[glyphs];\n if (gGlyphs) {\n sgGlyphs.push(gGlyphs);\n sgMin = Math.min(sgMin, gGlyphs.min());\n sgMax = Math.max(sgMax, gGlyphs.max());\n }\n });\n\n sgGlyphs.forEach(function (glyph) {\n glyphs.push(new Glyphs.PaddedGlyph(glyph, sgMin, sgMax));\n });\n }, tier.superGroups);\n\n R.map(function (glyph) {\n return glyphs.push(glyph);\n }, groupGlyphs);\n\n var _bumpSubtiers = bumpSubtiers(tier, glyphs, grid, y),\n _bumpSubtiers2 = _slicedToArray(_bumpSubtiers, 2),\n subtiers = _bumpSubtiers2[0],\n subtiersExceeded = _bumpSubtiers2[1];\n\n tier.glyphCacheOrigin = tier.browser.viewStart;\n\n if (subtiersExceeded) tier.updateStatus('Bumping limit exceeded, use the track editor to see more features');else tier.updateStatus();\n\n tier.subtiers = subtiers;\n}\n\n// Fills out areas that haven't been fetched as gray blocks\nfunction drawUnmapped(tier, canvas, padding) {\n var drawStart = tier.browser.viewStart - 1000.0 / tier.browser.scale;\n var drawEnd = tier.browser.viewEnd + 1000.0 / tier.browser.scale;\n var unmappedBlocks = [];\n if (tier.knownCoverage) {\n var knownRanges = tier.knownCoverage.ranges();\n knownRanges.forEach(function (range, index) {\n if (index === 0) {\n if (range.min() > drawStart) unmappedBlocks.push({ min: drawStart, max: range.min() - 1 });\n } else {\n unmappedBlocks.push({ min: knownRanges[index - 1].max() + 1, max: range.min() - 1 });\n }\n\n if (index == knownRanges.length - 1 && range.max() < drawEnd) {\n unmappedBlocks.push({ min: range.max() + 1, max: drawEnd });\n }\n });\n }\n if (unmappedBlocks.length > 0) {\n canvas.fillStyle = 'gray';\n unmappedBlocks.forEach(function (block) {\n var min = (block.min - tier.browser.viewStart) * tier.browser.scale + 1000;\n var max = (block.max - tier.browser.viewStart) * tier.browser.scale + 1000;\n canvas.fillRect(min, 0, max - min, padding);\n });\n }\n}\n\nfunction clearViewport(canvas, width, height) {\n canvas.clearRect(0, 0, width, height);\n}\n\n// Make the viewport & canvas the correct size for the tier\nfunction prepareViewport(tier, canvas, retina) {\n var clear = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n var vOffset = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;\n\n var desiredWidth = tier.browser.featurePanelWidth + 2000;\n if (retina) {\n desiredWidth *= 2;\n }\n\n var fpw = tier.viewport.width | 0;\n if (fpw < desiredWidth - 50) {\n tier.viewport.width = fpw = desiredWidth;\n }\n\n var lh = tier.padding + vOffset;\n\n tier.subtiers.forEach(function (s) {\n return lh += s.height + tier.padding;\n });\n\n lh += 6;\n lh = Math.max(lh, tier.browser.minTierHeight);\n\n var canvasHeight = lh;\n if (retina) {\n canvasHeight *= 2;\n }\n\n if (canvasHeight != tier.viewport.height) {\n tier.viewport.height = canvasHeight;\n }\n\n tier.viewportHolder.style.left = '-1000px';\n tier.viewport.style.width = retina ? '' + fpw / 2 + 'px' : '' + fpw + 'px';\n tier.viewport.style.height = '' + lh + 'px';\n tier.layoutHeight = Math.max(lh, tier.browser.minTierHeight);\n\n tier.updateHeight();\n tier.norigin = tier.browser.viewStart;\n\n canvas.save();\n if (retina) {\n canvas.scale(2, 2);\n }\n\n if (clear) {\n clearViewport(canvas, fpw, canvasHeight);\n }\n\n drawUnmapped(tier, canvas, lh);\n}\n\nfunction paint(tier, canvas) {\n var vOffset = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n\n var overlayLabelCanvas = new Glyphs.OverlayLabelCanvas();\n var offset = (tier.glyphCacheOrigin - tier.browser.viewStart) * tier.browser.scale + 1000;\n canvas.translate(offset, vOffset + tier.padding);\n overlayLabelCanvas.translate(0, tier.padding);\n\n tier.paintToContext(canvas, overlayLabelCanvas, offset);\n\n if (overlayLabelCanvas.glyphs.length > 0) tier.overlayLabelCanvas = overlayLabelCanvas;else tier.overlayLabelCanvas = null;\n\n canvas.restore();\n}\n\nfunction getScoreMinMax(tier, style) {\n var smin = tier.quantMin(style);\n var smax = tier.quantMax(style);\n\n if (!smax) {\n if (smin < 0) {\n smax = 0;\n } else {\n smax = 10;\n }\n }\n if (!smin) {\n smin = 0;\n }\n return [smin, smax];\n}\n\nfunction relScoreOrigin(score, smin, smax) {\n var relScore = (1.0 * score - smin) / (smax - smin);\n var relOrigin = -1.0 * smin / (smax - smin);\n\n return [relScore, relOrigin];\n}\n\nfunction getRefSeq(tier, min, max) {\n var refSeq = null;\n if (tier.currentSequence) {\n var csStart = tier.currentSequence.start | 0;\n var csEnd = tier.currentSequence.end | 0;\n if (csStart <= max && csEnd >= min) {\n var sfMin = Math.max(min, csStart);\n var sfMax = Math.min(max, csEnd);\n\n refSeq = tier.currentSequence.seq.substr(sfMin - csStart, sfMax - sfMin + 1);\n while (min < sfMin) {\n refSeq = 'N' + refSeq;\n sfMin--;\n }\n while (max > sfMax) {\n refSeq = refSeq + 'N';\n sfMax++;\n }\n }\n }\n return refSeq;\n}\n\nfunction featureToCrossLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight, noLabel) {\n var scale = tier.browser.scale;\n var origin = tier.browser.viewStart;\n\n var score = feature.score;\n var label = feature.label || feature.id;\n\n var minPos = (feature.min - origin) * scale;\n var maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n var height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n var requiredHeight = height;\n\n var glyph = null;\n var quant = null;\n\n var stroke = style.FGCOLOR || 'black';\n var fill = style.BGCOLOR || 'none';\n var outline = style.STROKECOLOR;\n\n if (style.BGITEM && feature.itemRgb) {\n stroke = feature.itemRgb;\n } else if ((0, _das.isDasBooleanTrue)(style.COLOR_BY_SCORE2)) {\n var grad = style.BGGRAD || style._gradient;\n if (!grad) {\n grad = (0, _color.makeGradient)(50, style.COLOR1, style.COLOR2, style.COLOR3);\n style._gradient = grad;\n }\n\n var score2 = feature.score2;\n if (score2 !== undefined || !stroke) {\n score2 = score2 || 0;\n\n var smin2 = style.MIN2 ? 1.0 * style.MIN2 : 0.0;\n var smax2 = style.MAX2 ? 1.0 * style.MAX2 : 1.0;\n var relScore2 = (1.0 * score2 - smin2) / (smax2 - smin2);\n\n var step = relScore2 * grad.length | 0;\n R.clamp(0, step, grad.length - 1);\n stroke = grad[step];\n }\n }\n\n var size = style.SIZE || height;\n if (style.RSIZE) {\n size = 1.0 * style.RSIZE * height;\n }\n\n if (style.STROKETHRESHOLD) {\n if (size < 1.0 * style.STROKETHRESHOLD) outline = null;\n }\n\n var mid = (minPos + maxPos) / 2;\n\n if (glyphType === 'EX') {\n glyph = new Glyphs.ExGlyph(mid, size, stroke);\n } else if (glyphType === 'TRIANGLE') {\n var dir = style.DIRECTION || 'N';\n var width = style.LINEWIDTH || size;\n glyph = new Glyphs.TriangleGlyph(mid, size, dir, width, stroke, outline);\n } else if (glyphType === 'DOT') {\n glyph = new Glyphs.DotGlyph(mid, size, stroke, outline);\n } else if (glyphType === 'PLIMSOLL') {\n glyph = new Glyphs.PlimsollGlyph(mid, size, 0.2 * size, stroke, outline);\n } else if (glyphType === 'SQUARE') {\n glyph = new Glyphs.BoxGlyph(mid - size / 2, 0, size, size, stroke, outline);\n } else if (glyphType === 'STAR') {\n var points = style.POINTS || 5;\n glyph = new Glyphs.StarGlyph(mid, size / 2, points, stroke, outline);\n } else {\n glyph = new Glyphs.CrossGlyph(mid, size, stroke);\n }\n\n if (fill && fill !== 'none' && maxPos - minPos > 5) {\n var boxGlyph = new Glyphs.BoxGlyph(minPos, 0, maxPos - minPos, size, fill);\n glyph = new Glyphs.GroupGlyph([boxGlyph, glyph]);\n }\n\n if ((0, _das.isDasBooleanTrue)(style.SCATTER)) {\n var _getScoreMinMax = getScoreMinMax(tier, style),\n _getScoreMinMax2 = _slicedToArray(_getScoreMinMax, 2),\n smin = _getScoreMinMax2[0],\n smax = _getScoreMinMax2[1];\n\n var _relScoreOrigin = relScoreOrigin(score, smin, smax),\n _relScoreOrigin2 = _slicedToArray(_relScoreOrigin, 2),\n relScore = _relScoreOrigin2[0],\n relOrigin = _relScoreOrigin2[1];\n\n if (relScore < 0.0 || relScore > 1.0) {\n // Glyph is out of bounds.\n // Should we allow for \"partially showing\" glyphs?\n\n return null;\n } else {\n var originShift = function originShift(x) {\n return (x - relOrigin) * requiredHeight;\n };\n height = Math.max(1, originShift(relScore));\n y = y + originShift(1);\n\n if (relScore >= relOrigin) y = y - height;\n\n quant = { min: smin, max: smax };\n\n var heightFudge = 0;\n var featureLabel = R.defaultTo(style.LABEL, feature.forceLabel);\n\n if ((0, _das.isDasBooleanNotFalse)(featureLabel) && label && !noLabel) {\n glyph = new Glyphs.LabelledGlyph(canvas, glyph, label, true, null, featureLabel == 'above' ? 'above' : 'below');\n if (featureLabel === 'above') {\n heightFudge = glyph.textHeight + 2;\n }\n noLabel = true;\n }\n glyph = new Glyphs.TranslatedGlyph(glyph, 0, y - size / 2 - heightFudge, requiredHeight);\n }\n }\n\n return [glyph, quant];\n}\n\nfunction featureToGradientLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight) {\n var scale = tier.browser.scale;\n var origin = tier.browser.viewStart;\n\n var score = feature.score;\n\n var minPos = (feature.min - origin) * scale;\n var maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n var height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n var requiredHeight = height * 1.0;\n\n var glyph = null;\n var quant = null;\n\n var centerOnAxis = (0, _das.isDasBooleanTrue)(style[\"AXISCENTER\"]);\n\n var _getScoreMinMax3 = getScoreMinMax(tier, style),\n _getScoreMinMax4 = _slicedToArray(_getScoreMinMax3, 2),\n smin = _getScoreMinMax4[0],\n smax = _getScoreMinMax4[1];\n\n // AUTOMIN & AUTOMAX respectively set the lower and upper bounds\n\n\n if ((0, _das.isDasBooleanTrue)(style.AUTOMIN)) {\n smin = tier.currentFeaturesMinScore * 0.95;\n console.log(\"smin:\\t\" + smin);\n }\n if ((0, _das.isDasBooleanTrue)(style.AUTOMAX)) {\n smax = tier.currentFeaturesMaxScore * 1.05;\n console.log(\"smax:\\t\" + smax);\n }\n\n if (1.0 * score < 1.0 * smin) {\n score = smin;\n }\n if (1.0 * score > 1.0 * smax) {\n score = smax;\n }\n\n // Shift smin/smax in case we want to center the histogram\n // on the horizontal axis\n if (centerOnAxis) {\n var tmin = tier.quantMin(style);\n var tmax = tier.quantMax(style);\n\n if ((0, _das.isDasBooleanTrue)(style.AUTOMIN)) {\n tmin = tier.currentFeaturesMinScore * 0.95;\n }\n if ((0, _das.isDasBooleanTrue)(style.AUTOMAX)) {\n tmax = tier.currentFeaturesMaxScore * 1.05;\n }\n\n smin = tmin - (tmax - tmin) / 2;\n smax = tmax - (tmax - tmin) / 2;\n }\n\n var _relScoreOrigin3 = relScoreOrigin(score, smin, smax),\n _relScoreOrigin4 = _slicedToArray(_relScoreOrigin3, 2),\n relScore = _relScoreOrigin4[0],\n relOrigin = _relScoreOrigin4[1];\n\n if (glyphType === 'HISTOGRAM') {\n var originShift = function originShift(x) {\n return x - Math.max(0, relOrigin);\n };\n height = Math.abs(originShift(relScore)) * requiredHeight;\n y = y + originShift(1.0) * requiredHeight;\n\n if (relScore >= relOrigin) y -= height;\n\n if (centerOnAxis) y += height / 2;\n\n if ((0, _das.isDasBooleanTrue)(style[\"HIDEAXISLABEL\"])) quant = null;else quant = { min: smin, max: smax };\n }\n\n var stroke = style.FGCOLOR || null;\n var fill = style.BGCOLOR || style.COLOR1 || 'green';\n if (style.BGITEM && feature.itemRgb) fill = feature.itemRgb;\n var alpha = style.ALPHA ? 1.0 * style.ALPHA : null;\n\n if (style.BGGRAD) {\n var grad = style.BGGRAD;\n var step = relScore * grad.length | 0;\n step = R.clamp(0, step, grad.length - 1);\n fill = grad[step];\n }\n\n if (style.COLOR2) {\n var _grad = style._gradient;\n if (!_grad) {\n _grad = (0, _color.makeGradient)(50, style.COLOR1, style.COLOR2, style.COLOR3);\n style._gradient = _grad;\n }\n\n var _step = relScore * _grad.length | 0;\n _step = R.clamp(0, _step, _grad.length - 1);\n fill = _grad[_step];\n }\n\n var tempGlyph = new Glyphs.BoxGlyph(minPos, y, maxPos - minPos, height, fill, stroke, alpha);\n glyph = new Glyphs.TranslatedGlyph(tempGlyph, 0, 0, requiredHeight);\n\n return [glyph, quant];\n}\n\nfunction featureToPointGlyph(tier, feature, style) {\n var scale = tier.browser.scale;\n var origin = tier.browser.viewStart;\n\n var score = feature.score;\n\n var minPos = (feature.min - origin) * scale;\n var maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n var height = tier.forceHeight || style.HEIGHT || 30;\n\n var glyph = null;\n var quant = null;\n\n var _getScoreMinMax5 = getScoreMinMax(tier, style),\n _getScoreMinMax6 = _slicedToArray(_getScoreMinMax5, 2),\n smin = _getScoreMinMax6[0],\n smax = _getScoreMinMax6[1];\n\n var yscale = 1.0 * height / (smax - smin);\n var relScore = (1.0 * score - smin) / (smax - smin);\n var sc = (score - 1.0 * smin) * yscale | 0;\n quant = { min: smin, max: smax };\n\n var fill = style.FGCOLOR || style.COLOR1 || 'black';\n if (style.COLOR2) {\n var grad = style._gradient;\n if (!grad) {\n grad = (0, _color.makeGradient)(50, style.COLOR1, style.COLOR2, style.COLOR3);\n style._gradient = grad;\n }\n\n var step = relScore * grad.length | 0;\n step = R.clamp(0, step, grad.length - 1);\n fill = grad[step];\n }\n\n glyph = new Glyphs.PointGlyph((minPos + maxPos) / 2, height - sc, height, fill);\n\n return [glyph, quant];\n}\n\nfunction sequenceGlyph(canvas, tier, feature, style, forceHeight) {\n var scale = tier.browser.scale;\n var origin = tier.browser.viewStart;\n\n var min = feature.min;\n var max = feature.max;\n var minPos = (feature.min - origin) * scale;\n var maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n var height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n\n var glyph = null;\n\n var rawseq = feature.seq;\n var seq = rawseq;\n var rawquals = feature.quals;\n var quals = rawquals;\n var insertionLabels = (0, _das.isDasBooleanTrue)(style.__INSERTIONS);\n\n var indels = [];\n if (feature.cigar) {\n var ops = (0, _cigar.parseCigar)(feature.cigar);\n seq = '';\n quals = '';\n var cursor = 0;\n\n ops.forEach(function (co) {\n if (co.op === 'M') {\n seq += rawseq.substr(cursor, co.cnt);\n quals += rawquals.substr(cursor, co.cnt);\n cursor += co.cnt;\n } else if (co.op === 'D') {\n seq += \"-\".repeat(co.cnt);\n quals += \"Z\".repeat(co.cnt);\n } else if (co.op === 'I') {\n var inseq = rawseq.substr(cursor, co.cnt);\n var ig = new Glyphs.TranslatedGlyph(new Glyphs.TriangleGlyph(minPos + seq.length * scale, 6, 'S', 5, tier.browser.baseColors['I']), 0, -2, 0);\n if (insertionLabels) ig = new Glyphs.LabelledGlyph(canvas, ig, inseq, false, 'center', 'above', '7px sans-serif');\n ig.feature = { label: 'Insertion: ' + inseq, type: 'insertion', method: 'insertion' };\n indels.push(ig);\n\n cursor += co.cnt;\n } else if (co.op === 'S') {\n cursor += co.cnt;\n } else {\n console.log('unknown cigop' + co.op);\n }\n });\n }\n\n var refSeq = getRefSeq(tier, min, max);\n if (seq && refSeq && (style.__SEQCOLOR === 'mismatch' || style.__SEQCOLOR === 'mismatch-all')) {\n var mismatchSeq = [];\n var match = feature.orientation === '-' ? ',' : '.';\n for (var i = 0; i < seq.length; ++i) {\n mismatchSeq.push(seq[i] == refSeq[i] ? match : seq[i]);\n }\n seq = mismatchSeq.join('');\n }\n\n var strandColor = feature.orientation === '-' ? style._minusColor || 'lightskyblue' : style._plusColor || 'lightsalmon';\n\n if (style.__disableQuals) quals = false;\n\n glyph = new Glyphs.SequenceGlyph(tier.browser.baseColors, strandColor, minPos, maxPos, height, seq, refSeq, style.__SEQCOLOR, quals, !(0, _das.isDasBooleanTrue)(style.__CLEARBG), tier.scaleVertical);\n\n if (insertionLabels) glyph = new Glyphs.TranslatedGlyph(glyph, 0, 7);\n\n if (indels.length > 0) {\n indels.splice(0, 0, glyph);\n glyph = new Glyphs.GroupGlyph(indels);\n }\n\n return glyph;\n}\n\nfunction makeLinePlot(features, style, tier, yshift) {\n yshift = yshift || 0;\n\n var origin = tier.browser.viewStart,\n scale = tier.browser.scale;\n var height = tier.forceHeight || style.HEIGHT || 30;\n var min = tier.quantMin(style);\n var max = tier.quantMax(style);\n\n // AUTOMIN & AUTOMAX respectively set the lower and upper bounds\n if ((0, _das.isDasBooleanTrue)(style.AUTOMIN)) {\n // add some basically arbitrary padding\n min = tier.currentFeaturesMinScore * 0.95;\n }\n if ((0, _das.isDasBooleanTrue)(style.AUTOMAX)) {\n max = tier.currentFeaturesMaxScore * 1.05;\n }\n\n var yscale = 1.0 * height / (max - min);\n var color = style.FGCOLOR || style.COLOR1 || 'black';\n\n var prevSign = 1;\n var curSign = null;\n\n var curGlyphPoints = [];\n var glyphSequences = [];\n\n var prevPoint = null;\n\n features.forEach(function (f) {\n var px = (((f.min | 0) + (f.max | 0)) / 2 - origin) * scale;\n var sc = (f.score - 1.0 * min) * yscale | 0;\n\n // Additive tracks are always above the x-axis, and are colored\n // depending on whether the score is positive or negative.\n if ((0, _das.isDasBooleanTrue)(style.ADDITIVE)) {\n curSign = f.score < 0 ? -1 : 1;\n\n if (curSign !== prevSign) {\n glyphSequences.push({\n points: curGlyphPoints,\n color: prevSign === 1 ? style.POSCOLOR : style.NEGCOLOR\n });\n curGlyphPoints = [];\n // Need to add the previous point to this sequence,\n // otherwise there is a gap in the resulting plot\n curGlyphPoints.push(prevPoint);\n }\n prevSign = curSign;\n } else {\n curSign = 1;\n }\n\n var py = height - sc * curSign + yshift;\n prevPoint = { x: px, y: py };\n curGlyphPoints.push(prevPoint);\n });\n\n // Need to add the final sequence of points as well.\n if ((0, _das.isDasBooleanTrue)(style.ADDITIVE)) {\n color = curSign === 1 ? style.POSCOLOR : style.NEGCOLOR;\n }\n glyphSequences.push({\n points: curGlyphPoints,\n color: color\n });\n\n var lggs = glyphSequences.map(function (gs) {\n var lgg = new Glyphs.LineGraphGlyph(gs.points, gs.color, height);\n lgg.quant = { min: min, max: max };\n\n if (style.ZINDEX) lgg.zindex = style.ZINDEX | 0;\n\n return lgg;\n });\n\n return lggs;\n}\n\nfunction makeStackedBars(features, tier) {\n var glyphs = [];\n\n var posStacks = [],\n negStacks = [];\n\n var scale = tier.browser.scale,\n origin = tier.browser.viewStart;\n for (var fi = 0; fi < features.length; ++fi) {\n var feature = features[fi];\n var style = tier.styleForFeature(feature);\n var score = feature.score * 1.0;\n\n var height = tier.forceHeight || style.HEIGHT || 12;\n var requiredHeight = height = 1.0 * height;\n\n var min = feature.min;\n var max = feature.max;\n\n var minPos = (min - origin) * scale;\n var rawMaxPos = (max - origin + 1) * scale;\n var maxPos = Math.max(rawMaxPos, minPos + 1);\n\n // This should somewhat match the 'HISTOGRAM' path.\n\n var smin = tier.quantMin(style);\n var smax = tier.quantMax(style);\n\n if (!smax) {\n if (smin < 0) {\n smax = 0;\n } else {\n smax = 10;\n }\n } else {\n smax = smax * 1.0;\n }\n\n if (!smin) {\n smin = 0;\n } else {\n smin = smin * 1.0;\n }\n\n var stackOrigin;\n if (score >= 0) {\n stackOrigin = posStacks[min] || 0;\n posStacks[min] = stackOrigin + score;\n } else {\n stackOrigin = negStacks[min] || 0;\n negStacks[min] = stackOrigin + score;\n }\n\n if (stackOrigin > smax || stackOrigin < smin) {\n // Stack has extended outside of range.\n continue;\n }\n\n if (stackOrigin + score < smin) {\n score = smin - stackOrigin;\n }\n if (stackOrigin + score > smax) {\n score = smax - stackOrigin;\n }\n\n var relScoreEnd = (score + stackOrigin - smin) / (smax - smin);\n var relScoreStart = (stackOrigin - smin) / (smax - smin);\n var relScoreMax = Math.max(relScoreStart, relScoreEnd);\n var relScoreMin = Math.min(relScoreStart, relScoreEnd);\n\n height = (relScoreMax - relScoreMin) * requiredHeight;\n var y = (1.0 - relScoreMax) * requiredHeight;\n\n var stroke = style.FGCOLOR || null;\n var fill = style.BGCOLOR || style.COLOR1 || 'green';\n if (style.BGITEM && feature.itemRgb) fill = feature.itemRgb;\n var alpha = style.ALPHA ? 1.0 * style.ALPHA : null;\n\n var gg = new Glyphs.BoxGlyph(minPos, y, maxPos - minPos, height, fill, stroke, alpha);\n gg = new Glyphs.TranslatedGlyph(gg, 0, 0, requiredHeight);\n gg.feature = feature;\n gg.quant = {\n min: smin, max: smax\n };\n if (style.ZINDEX) {\n gg.zindex = style.ZINDEX | 0;\n }\n glyphs.push(gg);\n }\n return glyphs;\n}\n\n// height is subtier height\nfunction createQuantOverlay(tier, height) {\n var retina = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n\n var width = 50;\n\n tier.quantOverlay.height = height;\n tier.quantOverlay.width = retina ? width * 2 : width;\n tier.quantOverlay.style.height = '' + (retina ? height / 2 : height) + 'px';\n tier.quantOverlay.style.width = '' + width + 'px';\n tier.quantOverlay.style.display = 'block';\n\n var canvas = tier.quantOverlay.getContext('2d');\n\n if (retina) {\n canvas.scale(2, 2);\n }\n\n return canvas;\n}\n\nfunction paintQuant(canvas, tier, quant, tics) {\n canvas.save();\n\n var h = tier.quantOverlay.height;\n var w = 100;\n\n var ticSpacing = (h + tier.padding * 2) / tics;\n var ticInterval = (quant.max - quant.min) / tics;\n\n canvas.fillStyle = 'white';\n canvas.globalAlpha = 0.6;\n if (tier.browser.rulerLocation == 'right') {\n canvas.fillRect(w - 30, 0, 30, h + tier.padding * 2);\n } else {\n canvas.fillRect(0, 0, 30, h + tier.padding * 2);\n }\n canvas.globalAlpha = 1.0;\n\n canvas.strokeStyle = 'black';\n canvas.lineWidth = 1;\n canvas.beginPath();\n if (tier.browser.rulerLocation == 'right') {\n canvas.moveTo(w - 8, tier.padding);\n canvas.lineTo(w, tier.padding);\n canvas.lineTo(w, h + tier.padding);\n canvas.lineTo(w - 8, h + tier.padding);\n\n for (var t = 1; t < tics - 1; t++) {\n var ty = t * ticSpacing;\n canvas.moveTo(w, ty);\n canvas.lineTo(w - 5, ty);\n }\n } else {\n canvas.moveTo(8, tier.padding);\n canvas.lineTo(0, tier.padding);\n canvas.lineTo(0, h + tier.padding);\n canvas.lineTo(8, h + tier.padding);\n\n for (var _t = 1; _t < tics - 1; _t++) {\n var _ty = _t * ticSpacing;\n canvas.moveTo(0, _ty);\n canvas.lineTo(5, _ty);\n }\n }\n canvas.stroke();\n\n canvas.fillStyle = 'black';\n\n if (tier.browser.rulerLocation == 'right') {\n canvas.textAlign = 'right';\n canvas.fillText((0, _numformats.formatQuantLabel)(quant.max), w - 9, 8);\n canvas.fillText((0, _numformats.formatQuantLabel)(quant.min), w - 9, h + tier.padding);\n\n for (var _t2 = 1; _t2 < tics - 1; _t2++) {\n var _ty2 = _t2 * ticSpacing;\n canvas.fillText((0, _numformats.formatQuantLabel)(1.0 * quant.max - _t2 * ticInterval), w - 9, _ty2 + 3);\n }\n } else {\n canvas.textAlign = 'left';\n canvas.fillText((0, _numformats.formatQuantLabel)(quant.max), 9, 8);\n canvas.fillText((0, _numformats.formatQuantLabel)(quant.min), 9, h + tier.padding);\n\n for (var _t3 = 1; _t3 < tics - 1; _t3++) {\n var _ty3 = _t3 * ticSpacing;\n canvas.fillText((0, _numformats.formatQuantLabel)(1.0 * quant.max - _t3 * ticInterval), 9, _ty3 + 3);\n }\n }\n\n canvas.restore();\n}\n\n},{\"./cigar.js\":8,\"./color.js\":9,\"./das.js\":10,\"./feature-draw.js\":20,\"./glyphs.js\":23,\"./numformats\":30,\"./sequence-draw.js\":36,\"./spans.js\":41,\"./utils.js\":56,\"ramda\":387}],12:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// domui.js: SVG UI components\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n}\n\nBrowser.prototype.removeAllPopups = function () {\n removeChildren(this.hPopupHolder);\n removeChildren(this.popupHolder);\n};\n\nBrowser.prototype.makeTooltip = function (ele, text) {\n var isin = false;\n var thisB = this;\n var timer = null;\n var _outlistener;\n _outlistener = function outlistener(ev) {\n isin = false;\n if (timer) {\n clearTimeout(timer);\n timer = null;\n }\n ele.removeEventListener('mouseout', _outlistener, false);\n };\n\n var setup = function setup(ev) {\n var mx = ev.clientX + window.scrollX,\n my = ev.clientY + window.scrollY;\n if (!timer) {\n timer = setTimeout(function () {\n var ttt;\n if (typeof text === 'function') {\n ttt = text();\n } else {\n ttt = text;\n }\n\n var popup = makeElement('div', [makeElement('div', null, { className: 'tooltip-arrow' }), makeElement('div', ttt, { className: 'tooltip-inner' })], { className: 'tooltip bottom in' }, {\n display: 'block',\n top: '' + (my + 20) + 'px',\n left: '' + Math.max(mx - 30, 20) + 'px'\n });\n thisB.hPopupHolder.appendChild(popup);\n var _moveHandler;\n _moveHandler = function moveHandler(ev) {\n try {\n thisB.hPopupHolder.removeChild(popup);\n } catch (e) {\n // May have been removed by other code which clears the popup layer.\n }\n window.removeEventListener('mousemove', _moveHandler, false);\n if (isin) {\n if (ele.offsetParent == null) {} else {\n setup(ev);\n }\n }\n };\n window.addEventListener('mousemove', _moveHandler, false);\n timer = null;\n }, 1000);\n }\n };\n\n ele.addEventListener('mouseover', function (ev) {\n isin = true;\n ele.addEventListener('mouseout', _outlistener, false);\n setup(ev);\n }, false);\n ele.addEventListener('DOMNodeRemovedFromDocument', function (ev) {\n isin = false;\n if (timer) {\n clearTimeout(timer);\n timer = null;\n }\n }, false);\n};\n\nBrowser.prototype.popit = function (ev, name, ele, opts) {\n var thisB = this;\n if (!opts) opts = {};\n if (!ev) ev = {};\n\n var width = opts.width || 200;\n\n var mx, my;\n\n if (ev.clientX) {\n var mx = ev.clientX,\n my = ev.clientY;\n } else {\n mx = 500;my = 50;\n }\n mx += document.documentElement.scrollLeft || document.body.scrollLeft;\n my += document.documentElement.scrollTop || document.body.scrollTop;\n var winWidth = window.innerWidth;\n\n var top = my;\n var left = Math.min(mx - width / 2 - 4, winWidth - width - 30);\n\n var popup = makeElement('div');\n popup.className = 'popover fade ' + (ev.clientX ? 'bottom ' : '') + 'in';\n popup.style.display = 'block';\n popup.style.position = 'absolute';\n popup.style.top = '' + top + 'px';\n popup.style.left = '' + left + 'px';\n popup.style.width = width + 'px';\n if (width > 276) {\n // HACK Bootstrappification...\n popup.style.maxWidth = width + 'px';\n }\n\n popup.appendChild(makeElement('div', null, { className: 'arrow' }));\n\n if (name) {\n var closeButton = makeElement('button', '', { className: 'close' });\n closeButton.innerHTML = '×';\n\n closeButton.addEventListener('mouseover', function (ev) {\n closeButton.style.color = 'red';\n }, false);\n closeButton.addEventListener('mouseout', function (ev) {\n closeButton.style.color = 'black';\n }, false);\n closeButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n thisB.removeAllPopups();\n }, false);\n var tbar = makeElement('h4', [makeElement('span', name, null, { maxWidth: '200px' }), closeButton], {/*className: 'popover-title' */}, { paddingLeft: '10px', paddingRight: '10px' });\n\n var dragOX, dragOY;\n var moveHandler, _upHandler;\n moveHandler = function moveHandler(ev) {\n ev.stopPropagation();ev.preventDefault();\n left = left + (ev.clientX - dragOX);\n if (left < 8) {\n left = 8;\n }if (left > winWidth - width - 32) {\n left = winWidth - width - 26;\n }\n top = top + (ev.clientY - dragOY);\n top = Math.max(10, top);\n popup.style.top = '' + top + 'px';\n popup.style.left = '' + Math.min(left, winWidth - width - 10) + 'px';\n dragOX = ev.clientX;dragOY = ev.clientY;\n };\n _upHandler = function upHandler(ev) {\n ev.stopPropagation();ev.preventDefault();\n window.removeEventListener('mousemove', moveHandler, false);\n window.removeEventListener('mouseup', _upHandler, false);\n };\n tbar.addEventListener('mousedown', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n dragOX = ev.clientX;dragOY = ev.clientY;\n window.addEventListener('mousemove', moveHandler, false);\n window.addEventListener('mouseup', _upHandler, false);\n }, false);\n\n popup.appendChild(tbar);\n }\n\n popup.appendChild(makeElement('div', ele, { className: 'popover-content' }, {\n padding: '0px'\n }));\n this.hPopupHolder.appendChild(popup);\n\n var popupHandle = {\n node: popup,\n displayed: true\n };\n popup.addEventListener('DOMNodeRemoved', function (ev) {\n if (ev.target == popup) {\n popupHandle.displayed = false;\n }\n }, false);\n return popupHandle;\n};\n\nfunction makeTreeTableSection(title, content, visible) {\n var ttButton = makeElement('i');\n function update() {\n if (visible) {\n ttButton.className = 'fa fa-caret-down';\n content.style.display = 'table';\n } else {\n ttButton.className = 'fa fa-caret-right';\n content.style.display = 'none';\n }\n }\n update();\n\n ttButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n visible = !visible;\n update();\n }, false);\n\n var heading = makeElement('h6', [ttButton, ' ', title], {}, { display: 'block', background: 'gray', color: 'white', width: '100%', padding: '5px 2px', margin: '0px' });\n return makeElement('div', [heading, content], {});\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n makeTreeTableSection: makeTreeTableSection\n };\n}\n\n},{\"./cbrowser\":6,\"./utils\":56}],13:[function(require,module,exports){\n/* jshint esversion: 6 */\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.drawTier = exports.renderTier = undefined;\n\nvar _defaultRenderer = require(\"./default-renderer\");\n\nvar DefaultRenderer = _interopRequireWildcard(_defaultRenderer);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nexports.renderTier = renderTier;\nexports.drawTier = drawTier;\n\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\nfunction drawTier(tier) {\n var canvas = tier.viewport.getContext(\"2d\");\n var retina = tier.browser.retina && window.devicePixelRatio > 1;\n if (retina) {\n canvas.scale(2, 2);\n }\n\n var features = tier.currentFeatures;\n var sequence = tier.currentSequence;\n if (tier.sequenceSource) {\n DefaultRenderer.drawSeqTier(tier, sequence);\n } else if (features) {\n DefaultRenderer.prepareSubtiers(tier, canvas);\n } else {\n console.log(\"No sequence or features in tier!\");\n }\n\n if (tier.subtiers) {\n DefaultRenderer.prepareViewport(tier, canvas, retina, true);\n }\n\n tier.drawOverlay();\n tier.paintQuant();\n\n if (typeof tier.dasSource.drawCallback === \"function\") {\n tier.dasSource.drawCallback(canvas, tier);\n }\n\n tier.originHaxx = 0;\n tier.browser.arrangeTiers();\n}\n\n},{\"./default-renderer\":11}],14:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// encode.js: interface for ENCODE DCC services\n//\n\n\"use strict\";\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nif (typeof require !== 'undefined') {\n var Promise = require('es6-promise').Promise;\n}\n\nfunction lookupEncodeURI(uri, json) {\n if (uri.indexOf('?') < 0) uri = uri + '?soft=true';\n\n return new Promise(function (accept, reject) {\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status >= 300) {\n reject('Error code ' + req.status);\n } else {\n var resp = JSON.parse(req.response);\n accept(json ? resp : resp.location);\n }\n }\n };\n\n req.open('GET', uri, true);\n req.setRequestHeader('Accept', 'application/json');\n req.responseType = 'text';\n req.send();\n });\n}\n\nfunction EncodeURLHolder(url) {\n this.rawurl = url;\n}\n\nEncodeURLHolder.prototype.getURLPromise = function () {\n if (this.urlPromise && this.urlPromiseValidity > Date.now()) {\n return this.urlPromise;\n } else {\n this.urlPromise = lookupEncodeURI(this.rawurl, true).then(function (resp) {\n return resp.location;\n });\n this.urlPromiseValidity = Date.now() + 12 * 3600 * 1000;\n return this.urlPromise;\n }\n};\n\nfunction EncodeFetchable(url, start, end, opts) {\n if (!opts) {\n if ((typeof start === 'undefined' ? 'undefined' : _typeof(start)) === 'object') {\n opts = start;\n start = undefined;\n } else {\n opts = {};\n }\n }\n\n this.url = typeof url === 'string' ? new EncodeURLHolder(url) : url;\n this.start = start || 0;\n if (end) {\n this.end = end;\n }\n this.opts = opts;\n}\n\nEncodeFetchable.prototype.slice = function (s, l) {\n if (s < 0) {\n throw 'Bad slice ' + s;\n }\n\n var ns = this.start,\n ne = this.end;\n if (ns && s) {\n ns = ns + s;\n } else {\n ns = s || ns;\n }\n if (l && ns) {\n ne = ns + l - 1;\n } else {\n ne = ne || l - 1;\n }\n return new EncodeFetchable(this.url, ns, ne, this.opts);\n};\n\nEncodeFetchable.prototype.fetchAsText = function (callback) {\n var self = this;\n var req = new XMLHttpRequest();\n var length;\n self.url.getURLPromise().then(function (url) {\n req.open('GET', url, true);\n\n if (self.end) {\n if (self.end - self.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + self.start + '-' + self.end);\n length = self.end - self.start + 1;\n }\n\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status == 200 || req.status == 206) {\n return callback(req.responseText);\n } else {\n return callback(null);\n }\n }\n };\n if (self.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n }).catch(function (err) {\n console.log(err);\n return callback(null);\n });\n};\n\nEncodeFetchable.prototype.salted = function () {\n return this;\n};\n\nEncodeFetchable.prototype.fetch = function (callback, attempt, truncatedLength) {\n var self = this;\n\n attempt = attempt || 1;\n if (attempt > 3) {\n return callback(null);\n }\n\n self.url.getURLPromise().then(function (url) {\n var req = new XMLHttpRequest();\n var length;\n req.open('GET', url, true);\n req.overrideMimeType('text/plain; charset=x-user-defined');\n if (self.end) {\n if (self.end - self.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + self.start + '-' + self.end);\n length = self.end - self.start + 1;\n }\n req.responseType = 'arraybuffer';\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status == 200 || req.status == 206) {\n if (req.response) {\n var bl = req.response.byteLength;\n if (length && length != bl && (!truncatedLength || bl != truncatedLength)) {\n return self.fetch(callback, attempt + 1, bl);\n } else {\n return callback(req.response);\n }\n } else if (req.mozResponseArrayBuffer) {\n return callback(req.mozResponseArrayBuffer);\n } else {\n var r = req.responseText;\n if (length && length != r.length && (!truncatedLength || r.length != truncatedLength)) {\n return self.fetch(callback, attempt + 1, r.length);\n } else {\n return callback(bstringToBuffer(req.responseText));\n }\n }\n } else {\n return self.fetch(callback, attempt + 1);\n }\n }\n };\n if (self.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n }).catch(function (err) {\n console.log(err);\n });\n};\n\nfunction bstringToBuffer(result) {\n if (!result) {\n return null;\n }\n\n var ba = new Uint8Array(result.length);\n for (var i = 0; i < ba.length; ++i) {\n ba[i] = result.charCodeAt(i);\n }\n return ba.buffer;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n lookupEncodeURI: lookupEncodeURI,\n EncodeFetchable: EncodeFetchable\n };\n}\n\n},{\"es6-promise\":384}],15:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// ensembljson.js -- query the Ensembl REST API.\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n}\n\nfunction EnsemblFeatureSource(source) {\n FeatureSourceBase.call(this);\n this.source = source;\n this.base = source.uri || '//rest.ensembl.org';\n if (this.base.indexOf('//') === 0) {\n var proto = window.location.protocol;\n if (proto == 'http:' || proto == 'https:') {\n // Protocol-relative URLs okay.\n } else {\n this.base = 'http:' + this.base;\n }\n }\n this.species = source.species || 'human';\n\n if (typeof source.type === 'string') {\n this.type = [source.type];\n } else {\n this.type = source.type || ['regulatory'];\n }\n}\n\nEnsemblFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\nEnsemblFeatureSource.prototype.constructor = EnsemblFeatureSource;\n\nEnsemblFeatureSource.prototype.getStyleSheet = function (callback) {\n var stylesheet = new DASStylesheet();\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = '__NONE';\n if (this.type.indexOf('exon') >= 0) stylesheet.pushStyle({ type: 'transcript' }, null, tsStyle);\n if (this.type.indexOf('exon') >= 0 || this.type.indexOf('transcript') >= 0) stylesheet.pushStyle({ type: 'gene' }, null, tsStyle);\n\n var cdsStyle = new DASStyle();\n cdsStyle.glyph = 'BOX';\n cdsStyle.FGCOLOR = 'black';\n cdsStyle.BGCOLOR = 'red';\n cdsStyle.HEIGHT = 8;\n cdsStyle.BUMP = true;\n cdsStyle.LABEL = true;\n cdsStyle.ZINDEX = 10;\n stylesheet.pushStyle({ type: 'cds' }, null, cdsStyle);\n\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'SQUARE';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({ type: 'variation', method: '.+_UTR_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'S';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({ type: 'variation', method: 'missense_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'N';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({ type: 'variation', method: 'splice_.+_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'STAR';\n varStyle.POINTS = 6;\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({ type: 'variation', method: 'regulatory_region_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'rgb(50,80,255)';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({ type: 'variation' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'SQUARE';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({ type: 'indel', method: '.+_UTR_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'S';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({ type: 'indel', method: 'missense_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'N';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({ type: 'indel', method: 'splice_.+_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'STAR';\n varStyle.POINTS = 6;\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({ type: 'indel', method: 'regulatory_region_variant' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({ type: 'indel' }, null, varStyle);\n }\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'orange';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n return callback(stylesheet);\n};\n\nEnsemblFeatureSource.prototype.getScales = function () {\n return [];\n};\n\nEnsemblFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n var url = this.base + '/overlap/region/' + this.species + '/' + chr + ':' + min + '-' + max;\n\n var filters = [];\n for (var ti = 0; ti < this.type.length; ++ti) {\n filters.push('feature=' + this.type[ti]);\n }\n filters.push('content-type=application/json');\n url = url + '?' + filters.join(';');\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n thisB.busy--;\n thisB.notifyActivity();\n\n if (req.status >= 300) {\n var err = 'Error code ' + req.status;\n try {\n var jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } catch (ex) {};\n\n callback(err, null);\n } else {\n var jf = JSON.parse(req.response);\n var features = [];\n for (var fi = 0; fi < jf.length; ++fi) {\n var j = jf[fi];\n\n var notes = [];\n var f = new DASFeature();\n f.segment = chr;\n f.min = j['start'] | 0;\n f.max = j['end'] | 0;\n f.type = j.feature_type || 'unknown';\n f.id = j.ID;\n\n if (j.Parent) {\n var grp = new DASGroup();\n grp.id = j.Parent;\n f.groups = [grp];\n }\n\n if (j.strand) {\n if (j.strand < 0) f.orientation = '-';else if (j.strand > 0) f.orientation = '+';\n }\n\n if (j.consequence_type) f.method = j.consequence_type;\n\n if (j.alt_alleles) {\n notes.push('Alleles=' + j.alt_alleles.join('/'));\n if (j.alt_alleles.length > 1) {\n if (j.alt_alleles[1].length != j.alt_alleles[0].length || j.alt_alleles[1] == '-') {\n f.type = 'indel';\n }\n }\n }\n\n if (notes.length > 0) {\n f.notes = notes;\n }\n features.push(f);\n }\n callback(null, features);\n }\n }\n };\n\n thisB.busy++;\n thisB.notifyActivity();\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\nEnsemblFeatureSource.prototype.capabilities = function () {\n var caps = {};\n if (this.type && this.type.indexOf('transcript') >= 0) {\n caps.search = ['gene'];\n }\n return caps;\n};\n\nEnsemblFeatureSource.prototype.search = function (query, callback) {\n var url = this.base + '/lookup/symbol/' + this.species + '/' + query + '?content-type=application/json';\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) if (req.status >= 300 || req.status < 200) {\n var err = 'Error code ' + req.status;\n try {\n var jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } catch (ex) {};\n\n if (req.status == 400) // E! returns an error if the lookup fails. Who knows?\n return callback([]);else return callback(null, err);\n } else {\n var resp = JSON.parse(req.response);\n var result = [];\n\n if (resp && resp.seq_region_name) {\n result.push({\n segment: resp.seq_region_name,\n min: resp.start,\n max: resp.end\n });\n }\n\n return callback(result);\n }\n };\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\ndalliance_registerSourceAdapterFactory('ensembl', function (source) {\n return { features: new EnsemblFeatureSource(source) };\n});\n\n},{\"./das\":10,\"./sourceadapters\":39}],16:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// export-config.js\n//\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var sha1 = require('./sha1');\n var hex_sha1 = sha1.hex_sha1;\n\n var das = require('./das');\n var copyStylesheet = das.copyStylesheet;\n}\n\nBrowser.prototype.exportFullConfig = function (opts) {\n opts = opts || {};\n\n var config = {\n chr: this.chr,\n viewStart: this.viewStart | 0,\n viewEnd: this.viewEnd | 0,\n cookieKey: 'dalliance_' + hex_sha1(Date.now()),\n\n coordSystem: this.coordSystem,\n\n sources: this.exportSourceConfig(),\n\n chains: this.exportChains()\n };\n\n if (this.prefix) config.prefix = this.prefix;\n\n return config;\n};\n\nBrowser.prototype.exportChains = function () {\n var cc = {};\n var cs = this.chains || {};\n for (var k in cs) {\n cc[k] = cs[k].exportConfig();\n }\n return cc;\n};\n\nBrowser.prototype.exportSourceConfig = function (opts) {\n opts = opts || {};\n\n var sourceConfig = [];\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var tier = this.tiers[ti];\n var source = shallowCopy(tier.dasSource);\n\n if (source.noPersist) continue;\n\n source.coords = undefined;\n source.props = undefined;\n if (!source.disabled) source.disabled = undefined;\n\n if (tier.config.stylesheet) {\n source.style = copyStylesheet(tier.config.stylesheet).styles;\n source.stylesheet_uri = undefined;\n } else if (source.style) {\n source.style = copyStylesheet({ styles: source.style }).styles;\n }\n\n if (typeof tier.config.name === 'string') {\n source.name = tier.config.name;\n }\n\n if (tier.config.height !== undefined) {\n source.forceHeight = tier.config.height;\n }\n if (tier.config.forceMin !== undefined) {\n source.forceMin = tier.config.forceMin;\n }\n if (tier.config.forceMinDynamic) source.forceMinDynamic = tier.config.forceMinDynamic;\n if (tier.config.forceMax !== undefined) {\n source.forceMax = tier.config.forceMax;\n }\n if (tier.config.bumped !== undefined) {\n source.bumped = tier.config.bumped;\n }\n if (tier.config.forceMaxDynamic) source.forceMaxDynamic = tier.config.forceMaxDynamic;\n\n sourceConfig.push(source);\n }\n\n return sourceConfig;\n};\n\nBrowser.prototype.exportPageTemplate = function (opts) {\n opts = opts || {};\n var template = '\\n' + ' \\n' + ' \\n' + ' \\n' + ' \\n' + ' \\n' + ' Dalliance goes here
\\n' + ' \\n' + '\\n';\n\n return template;\n};\n\n},{\"./cbrowser\":6,\"./das\":10,\"./sha1\":38,\"./utils\":56}],17:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// export-image.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var g = require('./glyphs');\n var OverlayLabelCanvas = g.OverlayLabelCanvas;\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n var formatLongInt = nf.formatLongInt;\n\n var VERSION = require('./version');\n\n var drawSeqTierGC = require('./sequence-draw').drawSeqTierGC;\n}\n\nfunction fillTextRightJustified(g, text, x, y) {\n g.fillText(text, x - g.measureText(text).width, y);\n}\n\nBrowser.prototype.exportImage = function (opts) {\n opts = opts || {};\n\n var fpw = opts.width || this.featurePanelWidth;\n var padding = 3;\n var ypos = 0;\n if (opts.banner || opts.region) {\n ypos = 40;\n }\n\n var backupFPW = this.featurePanelWidth;\n var backupScale = this.scale;\n this.featurePanelWidth = fpw;\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n\n var totHeight = ypos;\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (ti > 0) totHeight += padding;\n var tier = this.tiers[ti];\n\n tier.backupSubtiers = tier.subtiers;\n tier.backupOriginHaxx = tier.originHaxx;\n tier.backupLayoutHeight = tier.layoutHeight;\n\n if (tier.subtiers) {\n var renderer = this.getTierRenderer(tier);\n if (renderer && renderer.prepareSubtiers) {\n renderer.prepareSubtiers(tier, tier.viewport.getContext('2d'));\n }\n\n if (tier.subtiers) {\n var lh = tier.padding;\n for (var s = 0; s < tier.subtiers.length; ++s) {\n lh = lh + tier.subtiers[s].height + tier.padding;\n }\n lh += 6;\n tier.layoutHeight = Math.max(lh, this.minTierHeight);\n }\n }\n\n if (tier.layoutHeight !== undefined) totHeight += tier.layoutHeight;\n }\n var mult = opts.resolutionMultiplier || 1.0;\n var margin = 200;\n\n var cw = (fpw + margin) * mult | 0;\n var ch = totHeight * mult | 0;\n var c = makeElement('canvas', null, { width: cw, height: ch });\n var g = c.getContext('2d');\n g.fillStyle = 'white';\n g.fillRect(0, 0, cw, ch);\n\n g.scale(mult, mult);\n\n if (opts.region) {\n g.save();\n g.fillStyle = 'black';\n g.font = '12pt sans-serif';\n g.fillText(this.chr + ':' + formatLongInt(this.viewStart) + '..' + formatLongInt(this.viewEnd), margin + 100, 28);\n g.restore();\n }\n\n if (opts.banner) {\n g.save();\n g.fillStyle = 'black';\n g.font = '12pt sans-serif';\n fillTextRightJustified(g, 'Graphics from Biodalliance ' + VERSION, margin + fpw - 100, 28);\n g.restore();\n }\n\n g.font = '10px sans-serif';\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var tier = this.tiers[ti];\n var offset = (tier.glyphCacheOrigin - this.viewStart) * this.scale;\n\n var oc = new OverlayLabelCanvas();\n g.save(); // 1\n g.translate(0, ypos);\n\n g.save(); // 2\n g.beginPath();\n g.moveTo(margin, 0);\n g.lineTo(margin + fpw, 0);\n g.lineTo(margin + fpw, tier.layoutHeight);\n g.lineTo(margin, tier.layoutHeight);\n g.closePath();\n g.clip();\n g.translate(margin, 0);\n\n g.save(); // 3\n g.translate(offset, 0);\n if (tier.subtiers) {\n tier.paintToContext(g, oc, offset + 1000);\n } else {\n drawSeqTierGC(tier, tier.currentSequence, g);\n }\n g.restore(); // 2\n\n g.save(); // 3\n g.translate(offset, 0);\n oc.draw(g, -offset, fpw - offset);\n g.restore(); // 2\n g.restore(); // 1\n\n var hasQuant = false;\n var pos = 0;\n var subtiers = tier.subtiers || [];\n for (var sti = 0; sti < subtiers.length; ++sti) {\n var subtier = subtiers[sti];\n\n if (subtier.quant) {\n hasQuant = true;\n var q = subtier.quant;\n var h = subtier.height;\n\n var numTics = 2;\n if (h > 40) {\n numTics = 1 + (h / 20 | 0);\n }\n var ticSpacing = h / (numTics - 1);\n var ticInterval = (q.max - q.min) / (numTics - 1);\n\n g.beginPath();\n g.moveTo(margin + 5, pos);\n g.lineTo(margin, pos);\n g.lineTo(margin, pos + subtier.height);\n g.lineTo(margin + 5, pos + subtier.height);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n g.moveTo(margin, pos + ty);\n g.lineTo(margin + 3, pos + ty);\n }\n g.strokeStyle = 'black';\n g.strokeWidth = 2;\n g.stroke();\n\n g.fillStyle = 'black';\n fillTextRightJustified(g, formatQuantLabel(q.max), margin - 3, pos + 7);\n fillTextRightJustified(g, formatQuantLabel(q.min), margin - 3, pos + subtier.height);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n fillTextRightJustified(g, formatQuantLabel(1.0 * q.max - t * ticInterval), margin - 3, pos + ty + 3);\n }\n }\n\n pos += subtier.height + padding;\n }\n\n var labelName;\n if (typeof tier.config.name === 'string') labelName = tier.config.name;else labelName = tier.dasSource.name;\n var labelWidth = g.measureText(labelName).width;\n g.fillStyle = 'black';\n g.fillText(labelName, margin - (hasQuant ? 28 : 12) - labelWidth, (tier.layoutHeight + 3) / 2);\n\n g.restore(); // 0\n\n ypos += tier.layoutHeight + padding;\n\n tier.subtiers = tier.backupSubtiers;\n tier.originHaxx = tier.backupOriginHaxx;\n tier.layoutHeight = tier.backupLayoutHeight;\n }\n\n if (opts.highlights) {\n g.save();\n\n g.beginPath();\n g.moveTo(margin, 0);\n g.lineTo(margin + fpw, 0);\n g.lineTo(margin + fpw, ypos);\n g.lineTo(margin, ypos);\n g.closePath();\n g.clip();\n\n g.translate(margin + offset, 0);\n var origin = this.viewStart;\n var visStart = this.viewStart;\n var visEnd = this.viewEnd;\n\n for (var hi = 0; hi < this.highlights.length; ++hi) {\n var h = this.highlights[hi];\n if ((h.chr === this.chr || h.chr === 'chr' + this.chr) && h.min < visEnd && h.max > visStart) {\n g.globalAlpha = this.defaultHighlightAlpha;\n g.fillStyle = this.defaultHighlightFill;\n g.fillRect((h.min - origin) * this.scale, 0, (h.max - h.min) * this.scale, ypos);\n }\n }\n g.restore();\n }\n\n var rulerPos = -1;\n if (opts.ruler == 'center') {\n rulerPos = margin + (this.viewEnd - this.viewStart + 1) * this.scale / 2;\n } else if (opts.ruler == 'left') {\n rulerPos = margin;\n } else if (opts.ruler == 'right') {\n rulerPos = margin + (this.viewEnd - this.viewStart + 1) * this.scale;\n }\n if (rulerPos >= 0) {\n g.strokeStyle = 'blue';\n g.beginPath();\n g.moveTo(rulerPos, 0);\n g.lineTo(rulerPos, ypos);\n g.stroke();\n }\n\n this.featurePanelWidth = backupFPW;\n this.scale = backupScale;\n\n return c.toDataURL('image/png');\n};\n\n},{\"./cbrowser\":6,\"./glyphs\":23,\"./numformats\":30,\"./sequence-draw\":36,\"./version\":58}],18:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// export-ui.js\n//\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n}\n\nBrowser.prototype.openExportPanel = function () {\n var b = this;\n if (this.uiMode === 'export') {\n this.hideToolPanel();\n this.setUiMode('none');\n } else {\n var exportForm = makeElement('div', null, { className: 'export-form' });\n var exportSelect = makeElement('select');\n exportSelect.appendChild(makeElement('option', 'SVG', { value: 'svg' }));\n exportSelect.appendChild(makeElement('option', 'Image', { value: 'png' }));\n exportSelect.appendChild(makeElement('option', 'Dalliance config', { value: 'config' }));\n exportSelect.appendChild(makeElement('option', 'Dalliance sources', { value: 'sources' }));\n exportSelect.appendChild(makeElement('option', 'Dalliance page', { value: 'page' }));\n exportSelect.value = 'svg';\n\n exportSelect.addEventListener('change', function (ev) {\n removeChildren(exportContent);\n setupEOT();\n }, false);\n exportForm.appendChild(makeElement('p', ['Export as: ', exportSelect]));\n\n var exportHighlightsToggle = makeElement('input', null, { type: 'checkbox', checked: this.exportHighlights });\n exportHighlightsToggle.addEventListener('change', function (ev) {\n b.exportHighlights = exportHighlightsToggle.checked;\n b.storeStatus();\n }, false);\n var exportRulerToggle = makeElement('input', null, { type: 'checkbox', checked: this.exportRuler });\n exportRulerToggle.addEventListener('change', function (ev) {\n b.exportRuler = exportRulerToggle.checked;\n b.storeStatus();\n }, false);\n var exportRegionToggle = makeElement('input', null, { type: 'checkbox', checked: this.exportRegion });\n exportRegionToggle.addEventListener('change', function (ev) {\n b.exportRegion = exportRegionToggle.checked;\n b.storeStatus();\n }, false);\n var exportBannerToggle = makeElement('input', null, { type: 'checkbox', checked: this.exportBanner });\n exportBannerToggle.addEventListener('change', function (ev) {\n b.exportBanner = exportBannerToggle.checked;\n b.storeStatus();\n }, false);\n var exportScale = makeElement('input', null, { type: 'text', value: '1.0' });\n var exportWidth = makeElement('input', null, { type: 'text', value: '800' });\n\n var exportButton = makeElement('button', 'Export', { className: 'btn btn-primary' });\n exportButton.addEventListener('click', function (ev) {\n removeChildren(exportContent);\n\n var blobURL;\n var note, type, name;\n if (exportSelect.value === 'svg') {\n blobURL = URL.createObjectURL(b.makeSVG({ highlights: exportHighlightsToggle.checked,\n banner: b.exportBanner,\n region: b.exportRegion,\n ruler: exportRulerToggle.checked ? b.rulerLocation : 'none',\n width: parseInt(exportWidth.value) || 800 }));\n note = 'SVG';\n type = 'image/svg';\n name = 'dalliance-view.svg';\n } else if (exportSelect.value === 'png') {\n var mult = parseFloat(exportScale.value);\n if (mult < 0.1 || mult > 10) {\n alert('bad scale ' + mult);\n return;\n }\n\n blobURL = b.exportImage({ highlights: exportHighlightsToggle.checked,\n banner: b.exportBanner,\n region: b.exportRegion,\n ruler: exportRulerToggle.checked ? b.rulerLocation : 'none',\n resolutionMultiplier: mult,\n width: parseInt(exportWidth.value) || 800 });\n note = 'Image';\n type = 'image/png';\n name = 'dalliance-view.png';\n } else if (exportSelect.value === 'config') {\n var config = JSON.stringify(b.exportFullConfig(), null, 2);\n var blob = new Blob([config], { type: 'text/plain' });\n blobURL = URL.createObjectURL(blob);\n note = 'Configuration';\n type = 'text/plain';\n name = 'dalliance-config.json';\n } else if (exportSelect.value === 'sources') {\n var config = JSON.stringify(b.exportSourceConfig(), null, 2);\n var blob = new Blob([config], { type: 'text/plain' });\n blobURL = URL.createObjectURL(blob);\n note = 'Source array';\n type = 'text/plain';\n name = 'dalliance-sources.json';\n } else if (exportSelect.value === 'page') {\n var page = b.exportPageTemplate();\n var type = 'text/html';\n var blob = new Blob([page], { type: type });\n blobURL = URL.createObjectURL(blob);\n note = 'Page template';\n name = 'dalliance-view.html';\n }\n\n if (blobURL) {\n var downloadLink = makeElement('a', '[Download]', {\n href: blobURL,\n download: name,\n type: type\n });\n\n var previewLink = makeElement('a', '[Preview in browser]', {\n href: blobURL,\n type: type,\n target: '_new'\n });\n\n exportContent.appendChild(makeElement('p', ['' + note + ' created: ', downloadLink, previewLink]));\n }\n }, false);\n\n b.addViewListener(function () {\n removeChildren(exportContent);\n });\n b.addTierListener(function () {\n removeChildren(exportContent);\n });\n\n var exportContent = makeElement('p', '');\n\n var eotHighlights = makeElement('tr', [makeElement('th', 'Include highlights', {}, { width: '400px', textAlign: 'right' }), makeElement('td', exportHighlightsToggle)]);\n var eotGuideline = makeElement('tr', [makeElement('th', 'Include vertical guideline', {}, { textAlign: 'right' }), makeElement('td', exportRulerToggle)]);\n var eotScale = makeElement('tr', [makeElement('th', 'Scale multiplier', {}, { textAlign: 'right' }), makeElement('td', exportScale)]);\n var eotWidth = makeElement('tr', [makeElement('th', 'Width (logical px)', {}, { textAlign: 'right' }), makeElement('td', exportWidth)]);\n var eotRegion = makeElement('tr', [makeElement('th', 'Label with genomic coordinates', {}, { textAlign: 'right' }), makeElement('td', exportRegionToggle)]);\n var eotBanner = makeElement('tr', [makeElement('th', 'Include banner', {}, { textAlign: 'right' }), makeElement('td', exportBannerToggle)]);\n\n var exportOptsTable = makeElement('table', [eotHighlights, eotGuideline, eotWidth, eotScale, eotRegion], null, { width: '500px' });\n var setupEOT = function setupEOT() {\n var es = exportSelect.value;\n eotHighlights.style.display = es == 'svg' || es == 'png' ? 'table-row' : 'none';\n eotGuideline.style.display = es == 'svg' || es == 'png' ? 'table-row' : 'none';\n eotScale.style.display = es == 'png' ? 'table-row' : 'none';\n eotWidth.style.display = es == 'svg' || es == 'png' ? 'table-row' : 'none';\n eotRegion.style.display = es == 'svg' || es == 'png' ? 'table-row' : 'none';\n eotBanner.style.display = es == 'svg' || es == 'png' ? 'table-row' : 'none';\n };\n setupEOT();\n\n exportForm.appendChild(exportOptsTable);\n exportForm.appendChild(exportButton);\n exportForm.appendChild(exportContent);\n\n if (this.uiMode !== 'none') this.hideToolPanel();\n this.browserHolder.insertBefore(exportForm, this.svgHolder);\n this.activeToolPanel = exportForm;\n\n this.setUiMode('export');\n }\n};\n\n},{\"./cbrowser\":6,\"./utils\":56}],19:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// exports.js: shim to export symbols into global namespace for ease of embedding\n//\n\nrequire('babel-polyfill');\nvar browser = require('./cbrowser');\nvar chainset = require('./chainset');\nvar sa = require('./sourceadapters');\nvar utils = require('./utils');\nvar das = require('./das');\nvar sc = require('./sourcecompare');\n\nwindow.Browser = browser.Browser;\nwindow.sourcesAreEqual = sc.sourcesAreEqual;\nwindow.Chainset = chainset.Chainset; // Pre-0.12 configurations need this.\n\n// Useful for info plugins. Should be reconsidered in the future.\nwindow.makeElement = utils.makeElement;\n\n// Allow source plugins to be loaded separately.\nwindow.dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\nwindow.dalliance_registerParserFactory = sa.registerParserFactory;\nwindow.dalliance_makeParser = sa.makeParser;\n\n// DAS* objects for some plugins -- remove when plugin API changes...\n\nwindow.DASSequence = das.DASSequence;\nwindow.DASFeature = das.DASFeature;\nwindow.DASGroup = das.DASGroup;\nwindow.DASStylesheet = das.DASStylesheet;\nwindow.DASStyle = das.DASStyle;\nwindow.DASSource = das.DASSource; // Pre-0.8 configurations used this. Still some around...\n\nvar ruler = require(\"./rulers\");\nwindow.Ruler = ruler.Ruler;\nwindow.rulerDrawCallback = ruler.rulerDrawCallback;\n\n},{\"./cbrowser\":6,\"./chainset\":7,\"./das\":10,\"./rulers\":33,\"./sourceadapters\":39,\"./sourcecompare\":40,\"./utils\":56,\"babel-polyfill\":60}],20:[function(require,module,exports){\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// feature-draw.js: new feature-tier renderer\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var tier = require('./tier');\n var DasTier = tier.DasTier;\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n}\n\nfunction SubTier() {\n this.glyphs = [];\n this.height = 0;\n this.quant = null;\n}\n\nSubTier.prototype.indexFor = function (glyph) {\n var gmin = glyph.min();\n var lb = 0,\n ub = this.glyphs.length;\n while (ub > lb) {\n var mid = (lb + ub) / 2 | 0;\n if (mid >= this.glyphs.length) return this.glyphs.length;\n var mg = this.glyphs[mid];\n if (gmin < mg.min()) {\n ub = mid;\n } else {\n lb = mid + 1;\n }\n }\n return ub;\n};\n\nSubTier.prototype.add = function (glyph) {\n var ind = this.indexFor(glyph);\n this.glyphs.splice(ind, 0, glyph);\n this.height = Math.max(this.height, glyph.height());\n if (glyph.quant && this.quant == null) {\n this.quant = glyph.quant;\n }\n};\n\nSubTier.prototype.hasSpaceFor = function (glyph) {\n var ind = this.indexFor(glyph);\n if (ind > 0 && this.glyphs[ind - 1].max() >= glyph.min()) return false;\n if (ind < this.glyphs.length && this.glyphs[ind].min() <= glyph.max()) return false;\n\n return true;\n};\n\nDasTier.prototype.paintToContext = function (gc, oc, offset) {\n var subtiers = this.subtiers;\n var fpw = this.viewport.width | 0;\n\n gc.save();\n for (var s = 0; s < subtiers.length; ++s) {\n var quant = null;\n var glyphs = subtiers[s].glyphs;\n for (var i = 0; i < glyphs.length; ++i) {\n var glyph = glyphs[i];\n if (glyph.min() < fpw - offset && glyph.max() > -offset) {\n var glyph = glyphs[i];\n glyph.draw(gc, oc);\n if (glyph.quant) {\n quant = glyph.quant;\n }\n }\n }\n\n if (quant && quant.min < 0 && quant.max > 0 && this.dasSource.zeroLine) {\n var ry = subtiers[0].height * (quant.max / (quant.max - quant.min));\n gc.save();\n gc.strokeStyle = this.dasSource.zeroLine;\n gc.lineWidth = 0.5;\n gc.beginPath();\n gc.moveTo(-1000, ry);\n gc.lineTo(fpw + 1000, ry);\n gc.stroke();\n gc.restore();\n }\n\n if (this.scaleVertical) {\n var scale = this.browser.scale;\n gc.translate(0, scale + this.padding);\n oc.translate(0, scale + this.padding);\n } else {\n gc.translate(0, subtiers[s].height + this.padding);\n oc.translate(0, subtiers[s].height + this.padding);\n }\n }\n gc.restore();\n\n if (quant && this.quantLeapThreshold && this.featureSource && this.browser.sourceAdapterIsCapable(this.featureSource, 'quantLeap')) {\n var ry = subtiers[0].height * (1.0 - (this.quantLeapThreshold - quant.min) / (quant.max - quant.min));\n\n gc.save();\n gc.strokeStyle = 'red';\n gc.lineWidth = 0.3;\n gc.beginPath();\n gc.moveTo(-1000, ry);\n gc.lineTo(fpw + 1000, ry);\n gc.stroke();\n gc.restore();\n }\n};\n\nDasTier.prototype.paintQuant = function () {\n if (!this.quantOverlay) return;\n\n var retina = this.browser.retina && window.devicePixelRatio > 1;\n\n var quant;\n if (this.subtiers && this.subtiers.length > 0) quant = this.subtiers[0].quant;\n\n if (quant) {\n var h = this.subtiers[0].height;\n var w = 50;\n this.quantOverlay.height = this.viewport.height;\n this.quantOverlay.width = retina ? w * 2 : w;\n this.quantOverlay.style.height = '' + (retina ? this.quantOverlay.height / 2 : this.quantOverlay.height) + 'px';\n this.quantOverlay.style.width = '' + w + 'px';\n this.quantOverlay.style.display = 'block';\n var ctx = this.quantOverlay.getContext('2d');\n if (retina) ctx.scale(2, 2);\n\n var numTics = 2;\n if (h > 40) {\n numTics = 1 + (h / 20 | 0);\n }\n var ticSpacing = (h + this.padding * 2) / (numTics - 1);\n var ticInterval = (quant.max - quant.min) / (numTics - 1);\n\n ctx.fillStyle = 'white';\n ctx.globalAlpha = 0.6;\n if (this.browser.rulerLocation == 'right') {\n ctx.fillRect(w - 30, 0, 30, h + this.padding * 2);\n } else {\n ctx.fillRect(0, 0, 30, h + this.padding * 2);\n }\n ctx.globalAlpha = 1.0;\n\n ctx.strokeStyle = 'black';\n ctx.lineWidth = 1;\n ctx.beginPath();\n\n if (this.browser.rulerLocation == 'right') {\n ctx.moveTo(w - 8, this.padding);\n ctx.lineTo(w, this.padding);\n ctx.lineTo(w, h + this.padding);\n ctx.lineTo(w - 8, h + this.padding);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n ctx.moveTo(w, ty);\n ctx.lineTo(w - 5, ty);\n }\n } else {\n ctx.moveTo(8, this.padding);\n ctx.lineTo(0, this.padding);\n ctx.lineTo(0, h + this.padding);\n ctx.lineTo(8, h + this.padding);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n ctx.moveTo(0, ty);\n ctx.lineTo(5, ty);\n }\n }\n ctx.stroke();\n\n ctx.fillStyle = 'black';\n\n if (this.browser.rulerLocation == 'right') {\n ctx.textAlign = 'right';\n ctx.fillText(formatQuantLabel(quant.max), w - 9, 8);\n ctx.fillText(formatQuantLabel(quant.min), w - 9, h + this.padding);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n ctx.fillText(formatQuantLabel(1.0 * quant.max - t * ticInterval), w - 9, ty + 3);\n }\n } else {\n ctx.textAlign = 'left';\n ctx.fillText(formatQuantLabel(quant.max), 9, 8);\n ctx.fillText(formatQuantLabel(quant.min), 9, h + this.padding);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n ctx.fillText(formatQuantLabel(1.0 * quant.max - t * ticInterval), 9, ty + 3);\n }\n }\n } else {\n this.quantOverlay.style.display = 'none';\n }\n};\n\nDasTier.prototype.styleForFeature = function (f) {\n var ssScale = this.browser.zoomForCurrentScale();\n\n if (!this.stylesheet) {\n return null;\n }\n\n var maybe = null;\n var ss = this.stylesheet.styles;\n for (var si = 0; si < ss.length; ++si) {\n var sh = ss[si];\n if (sh.zoom && sh.zoom != ssScale) {\n continue;\n }\n\n if (sh.orientation) {\n if (sh.orientation != f.orientation) {\n continue;\n }\n }\n\n var labelRE = sh._labelRE;\n if (!labelRE || !labelRE.test) {\n labelRE = new RegExp('^' + sh.label + '$');\n sh._labelRE = labelRE;\n }\n if (sh.label && !labelRE.test(f.label)) {\n continue;\n }\n var methodRE = sh._methodRE;\n if (!methodRE || !methodRE.test) {\n methodRE = new RegExp('^' + sh.method + '$');\n sh._methodRE = methodRE;\n }\n if (sh.method && !methodRE.test(f.method)) {\n continue;\n }\n if (sh.type) {\n if (sh.type == 'default') {\n if (!maybe) {\n maybe = sh.style;\n }\n continue;\n } else {\n var typeRE = sh._typeRE;\n if (!typeRE || !typeRE.test) {\n typeRE = new RegExp('^' + sh.type + '$');\n sh._typeRE = typeRE;\n }\n if (!typeRE.test(f.type)) continue;\n }\n }\n return sh.style;\n }\n return maybe;\n};\n\nDasTier.prototype.quantMin = function (style) {\n if (this.forceMinDynamic) {\n return this.currentFeaturesMinScore || 0;\n } else if (typeof this.forceMin === 'number') {\n return this.forceMin;\n } else {\n var softMin = typeof style.SOFTMIN !== 'undefined' ? style.SOFTMIN : Number.MAX_VALUE;\n return style.MIN || Math.min(softMin, this.currentFeaturesMinScore || 0);\n }\n};\n\nDasTier.prototype.quantMax = function (style) {\n if (this.forceMaxDynamic) {\n return this.currentFeaturesMaxScore || 0;\n } else if (typeof this.forceMax === 'number') {\n return this.forceMax;\n } else {\n var softMax = typeof style.SOFTMAX !== 'undefined' ? style.SOFTMAX : Number.MIN_VALUE;\n return style.MAX || Math.max(softMax, this.currentFeaturesMaxScore || 0);\n }\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n SubTier: SubTier\n };\n}\n\n},{\"./numformats\":30,\"./tier\":52}],21:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// feature-popup.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var pick = utils.pick;\n var pushnew = utils.pushnew;\n var makeElement = utils.makeElement;\n}\n\nvar TAGVAL_NOTE_RE = new RegExp('^([A-Za-z_-]+)=(.+)');\n\nBrowser.prototype.addFeatureInfoPlugin = function (handler) {\n if (!this.featureInfoPlugins) {\n this.featureInfoPlugins = [];\n }\n this.featureInfoPlugins.push(handler);\n};\n\nfunction FeatureInfo(hit, feature, group) {\n var name = pick(group.type, feature.type);\n var fid = pick(group.label, feature.label, group.id, feature.id);\n if (!hit[0].molgenis && fid && fid.indexOf('__dazzle') != 0) {\n name = name + ': ' + fid;\n }\n\n this.hit = hit;\n this.feature = feature;\n this.group = group;\n this.title = hit[0].molgenis ? feature.id : name;\n this.sections = [];\n}\n\nFeatureInfo.prototype.setTitle = function (t) {\n this.title = t;\n};\n\nFeatureInfo.prototype.add = function (label, info) {\n if (typeof info === 'string') {\n info = makeElement('span', info);\n }\n this.sections.push({ label: label, info: info });\n};\n\nBrowser.prototype.featurePopup = function (ev, __ignored_feature, hit, tier) {\n var hi = hit.length;\n var feature = --hi >= 0 ? hit[hi] : {};\n var group = --hi >= 0 ? hit[hi] : {};\n\n var featureInfo = new FeatureInfo(hit, feature, group);\n featureInfo.tier = tier;\n var fips = this.featureInfoPlugins || [];\n for (var fipi = 0; fipi < fips.length; ++fipi) {\n try {\n fips[fipi](feature, featureInfo);\n } catch (e) {\n console.log(e.stack || e);\n }\n }\n fips = tier.featureInfoPlugins || [];\n for (fipi = 0; fipi < fips.length; ++fipi) {\n try {\n fips[fipi](feature, featureInfo);\n } catch (e) {\n console.log(e.stack || e);\n }\n }\n\n this.removeAllPopups();\n\n var table = makeElement('table', null, { className: 'table table-striped table-condensed' });\n table.style.width = '100%';\n table.style.margin = '0px';\n\n var idx = 0;\n if (feature.method && !tier.dasSource.suppressMethod) {\n var row = makeElement('tr', [makeElement('th', 'Method'), makeElement('td', feature.method)]);\n table.appendChild(row);\n ++idx;\n }\n {\n var loc;\n if (group.segment) {\n loc = group;\n } else {\n loc = feature;\n }\n var row = makeElement('tr', [makeElement('th', 'Location'), makeElement('td', loc.segment + ':' + loc.min + '-' + loc.max, {}, { minWidth: '200px' })]);\n table.appendChild(row);\n ++idx;\n }\n if (feature.score !== undefined && feature.score !== null && feature.score != '-' && !feature.suppressScore && !tier.dasSource.suppressScore) {\n var row = makeElement('tr', [makeElement('th', 'Score'), makeElement('td', '' + feature.score)]);\n table.appendChild(row);\n ++idx;\n }\n {\n var links = maybeConcat(group.links, feature.links);\n if (links && links.length > 0) {\n var row = makeElement('tr', [makeElement('th', 'Links'), makeElement('td', links.map(function (l) {\n return makeElement('div', makeElement('a', l.desc, { href: l.uri, target: '_new' }));\n }))]);\n table.appendChild(row);\n ++idx;\n }\n }\n {\n var notes = maybeConcat(group.notes, feature.notes);\n for (var ni = 0; ni < notes.length; ++ni) {\n var k = 'Note';\n var v = notes[ni];\n //---START MOLGENIS CUSTOM CODE---\n //params: do not rename, because this will make merging with dalliance changes harder\n //v is note\n //m is splitted note into array [key,value]\n //k is key\n //v is value\n if (hit[0].molgenis) {\n var m = v.split(\"=\");\n if (m.length === 2) {\n k = m[0];\n v = m[1];\n }\n }\n //---END MOLGENIS CUSTOM CODE---\n\n var row = makeElement('tr', [makeElement('th', k), makeElement('td', v)]);\n table.appendChild(row);\n ++idx;\n }\n }\n\n for (var fisi = 0; fisi < featureInfo.sections.length; ++fisi) {\n var section = featureInfo.sections[fisi];\n table.appendChild(makeElement('tr', [makeElement('th', section.label), makeElement('td', section.info)]));\n }\n //---START MOLGENIS CUSTOM CODE---\n if (hit[0].molgenis) {\n if (feature.actions) {\n var _loop = function _loop() {\n var action = feature.actions[index];\n var actionItem = makeElement('a', action.label);\n\n actionItem.addEventListener('click', function (ev) {\n eval(action.run);\n }, false);\n\n table.appendChild(makeElement('tr', [makeElement('th', \"\"), makeElement('td', actionItem)]));\n };\n\n for (var index = 0; index < feature.actions.length; ++index) {\n _loop();\n }\n }\n }\n //---END MOLGENIS CUSTOM CODE---\n this.popit(ev, featureInfo.title || 'Feature', table, { width: 450 });\n};\n\nfunction maybeConcat(a, b) {\n var l = [];\n if (a) {\n for (var i = 0; i < a.length; ++i) {\n pushnew(l, a[i]);\n }\n }\n if (b) {\n for (var i = 0; i < b.length; ++i) {\n pushnew(l, b[i]);\n }\n }\n return l;\n}\n\n},{\"./cbrowser\":6,\"./utils\":56}],22:[function(require,module,exports){\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var pusho = utils.pusho;\n var pushnewo = utils.pushnewo;\n}\n\nfunction sortFeatures(tier) {\n var dmin = tier.browser.drawnStart,\n dmax = tier.browser.drawnEnd;\n var ungroupedFeatures = {};\n var groupedFeatures = {};\n var drawnGroupedFeatures = {};\n var groupMins = {},\n groupMaxes = {};\n var groups = {};\n var superGroups = {};\n var groupsToSupers = {};\n var nonPositional = [];\n var minScore, maxScore;\n var fbid;\n\n var init_fbid = function init_fbid() {\n fbid = {};\n for (var fi = 0; fi < tier.currentFeatures.length; ++fi) {\n var f = tier.currentFeatures[fi];\n if (f.id) {\n fbid[f.id] = f;\n }\n }\n };\n\n var superParentsOf = function superParentsOf(f) {\n // FIXME: should recur.\n var spids = [];\n if (f.parents) {\n for (var pi = 0; pi < f.parents.length; ++pi) {\n var pid = f.parents[pi];\n var p = fbid[pid];\n if (!p) {\n continue;\n }\n // alert(p.type + ':' + p.typeCv);\n if (p.typeCv == 'SO:0000704') {\n pushnew(spids, pid);\n }\n }\n }\n return spids;\n };\n\n for (var fi = 0; fi < tier.currentFeatures.length; ++fi) {\n var f = tier.currentFeatures[fi];\n if (f.parts) {\n continue;\n }\n\n var drawn = f.min <= dmax && f.max >= dmin;\n\n if (!f.min || !f.max) {\n nonPositional.push(f);\n continue;\n }\n\n if (f.score && f.score != '.' && f.score != '-') {\n var sc = 1.0 * f.score;\n if (!minScore || sc < minScore) {\n minScore = sc;\n }\n if (!maxScore || sc > maxScore) {\n maxScore = sc;\n }\n }\n\n var fGroups = [];\n var fSuperGroup = null;\n if (f.groups) {\n for (var gi = 0; gi < f.groups.length; ++gi) {\n var g = f.groups[gi];\n var gid = g.id;\n if (g.type == 'gene') {\n // Like a super-grouper...\n fSuperGroup = gid;\n groups[gid] = g;\n } else if (g.type == 'translation') {\n // have to ignore this to get sensible results from bj-e :-(.\n } else {\n pusho(groupedFeatures, gid, f);\n groups[gid] = g;\n fGroups.push(gid);\n\n var ogm = groupMins[gid];\n if (!ogm || f.min < ogm) groupMins[gid] = f.min;\n\n ogm = groupMaxes[gid];\n if (!ogm || f.max > ogm) groupMaxes[gid] = f.max;\n }\n }\n }\n\n if (f.parents) {\n if (!fbid) {\n init_fbid();\n }\n for (var pi = 0; pi < f.parents.length; ++pi) {\n var pid = f.parents[pi];\n var p = fbid[pid];\n if (!p) {\n // alert(\"couldn't find \" + pid);\n continue;\n }\n if (!p.parts) {\n p.parts = [f];\n }\n pushnewo(groupedFeatures, pid, p);\n pusho(groupedFeatures, pid, f);\n\n if (!groups[pid]) {\n groups[pid] = {\n type: p.type,\n id: p.id,\n label: p.label || p.id\n };\n }\n fGroups.push(pid);\n\n var ogm = groupMins[pid];\n if (!ogm || f.min < ogm) groupMins[pid] = f.min;\n\n ogm = groupMaxes[pid];\n if (!ogm || f.max > ogm) groupMaxes[pid] = f.max;\n\n var sgs = superParentsOf(p);\n if (sgs.length > 0) {\n fSuperGroup = sgs[0];\n var sp = fbid[sgs[0]];\n groups[sgs[0]] = {\n type: sp.type,\n id: sp.id,\n label: sp.label || sp.id\n };\n if (!tier.dasSource.collapseSuperGroups) {\n tier.dasSource.collapseSuperGroups = true;\n }\n }\n }\n }\n\n if (fGroups.length == 0) {\n if (drawn) pusho(ungroupedFeatures, f.type, f);\n } else if (fSuperGroup) {\n for (var g = 0; g < fGroups.length; ++g) {\n var gid = fGroups[g];\n pushnewo(superGroups, fSuperGroup, gid);\n groupsToSupers[gid] = fSuperGroup;\n }\n }\n }\n\n for (var gid in groupedFeatures) {\n var group = groups[gid];\n if (typeof group.min !== 'number') group.min = groupMins[gid];\n if (typeof group.max !== 'number') group.max = groupMaxes[gid];\n\n if (groupMaxes[gid] >= dmin && groupMins[gid] <= dmax) drawnGroupedFeatures[gid] = groupedFeatures[gid];\n }\n\n tier.ungroupedFeatures = ungroupedFeatures;\n tier.groupedFeatures = drawnGroupedFeatures;\n tier.groups = groups;\n tier.superGroups = superGroups;\n tier.groupsToSupers = groupsToSupers;\n\n if (minScore) {\n if (minScore > 0) {\n minScore = 0;\n } else if (maxScore < 0) {\n maxScore = 0;\n }\n tier.currentFeaturesMinScore = minScore;\n tier.currentFeaturesMaxScore = maxScore;\n }\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n sortFeatures: sortFeatures\n };\n}\n\n},{\"./utils\":56}],23:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// glyphs.js: components which know how to draw themselves\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var spans = require('./spans');\n var union = spans.union;\n var Range = spans.Range;\n\n var utils = require('./utils');\n var makeElementNS = utils.makeElementNS;\n var AMINO_ACID_TRANSLATION = utils.AMINO_ACID_TRANSLATION;\n\n var svgu = require('./svg-utils');\n var NS_SVG = svgu.NS_SVG;\n var NS_XLINK = svgu.NS_XLINK;\n var SVGPath = svgu.SVGPath;\n}\n\nfunction PathGlyphBase(stroke, fill) {\n this._stroke = stroke;\n this._fill = fill;\n}\n\nPathGlyphBase.prototype.draw = function (g) {\n g.beginPath();\n this.drawPath(g);\n\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fill();\n }\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.stroke();\n }\n};\n\nPathGlyphBase.prototype.toSVG = function () {\n var g = new SVGPath();\n this.drawPath(g);\n\n return makeElementNS(NS_SVG, 'path', null, { d: g.toPathData(),\n fill: this._fill || 'none',\n stroke: this._stroke || 'none' });\n};\n\nPathGlyphBase.prototype.drawPath = function (g) {\n throw 'drawPath method on PathGlyphBase must be overridden';\n};\n\nfunction BoxGlyph(x, y, width, height, fill, stroke, alpha, radius) {\n this.x = x;\n this.y = y;\n this._width = width;\n this._height = height;\n this.fill = fill;\n this.stroke = stroke;\n this._alpha = alpha;\n this._radius = radius || 0;\n}\n\nBoxGlyph.prototype.draw = function (g) {\n var r = this._radius;\n\n if (r > 0) {\n g.beginPath();\n g.moveTo(this.x + r, this.y);\n g.lineTo(this.x + this._width - r, this.y);\n g.arcTo(this.x + this._width, this.y, this.x + this._width, this.y + r, r);\n g.lineTo(this.x + this._width, this.y + this._height - r);\n g.arcTo(this.x + this._width, this.y + this._height, this.x + this._width - r, this.y + this._height, r);\n g.lineTo(this.x + r, this.y + this._height);\n g.arcTo(this.x, this.y + this._height, this.x, this.y + this._height - r, r);\n g.lineTo(this.x, this.y + r);\n g.arcTo(this.x, this.y, this.x + r, this.y, r);\n g.closePath();\n\n if (this._alpha != null) {\n g.save();\n g.globalAlpha = this._alpha;\n }\n\n if (this.fill) {\n g.fillStyle = this.fill;\n g.fill();\n }\n if (this.stroke) {\n g.strokeStyle = this.stroke;\n g.lineWidth = 0.5;\n g.stroke();\n }\n\n if (this._alpha != null) {\n g.restore();\n }\n } else {\n if (this._alpha != null) {\n g.save();\n g.globalAlpha = this._alpha;\n }\n\n if (this.fill) {\n g.fillStyle = this.fill;\n g.fillRect(this.x, this.y, this._width, this._height);\n }\n\n if (this.stroke) {\n g.strokeStyle = this.stroke;\n g.lineWidth = 0.5;\n g.strokeRect(this.x, this.y, this._width, this._height);\n }\n\n if (this._alpha != null) {\n g.restore();\n }\n }\n};\n\nBoxGlyph.prototype.toSVG = function () {\n var s = makeElementNS(NS_SVG, 'rect', null, { x: this.x,\n y: this.y,\n width: this._width,\n height: this._height,\n stroke: this.stroke || 'none',\n strokeWidth: 0.5,\n fill: this.fill || 'none' });\n if (this._alpha != null) {\n s.setAttribute('opacity', this._alpha);\n }\n\n return s;\n};\n\nBoxGlyph.prototype.min = function () {\n return this.x;\n};\n\nBoxGlyph.prototype.max = function () {\n return this.x + this._width;\n};\n\nBoxGlyph.prototype.height = function () {\n return this.y + this._height;\n};\n\nfunction GroupGlyph(glyphs, connector) {\n this.glyphs = glyphs;\n this.connector = connector;\n this.h = glyphs[0].height();\n\n var covList = [];\n for (var g = 0; g < glyphs.length; ++g) {\n var gg = glyphs[g];\n covList.push(new Range(gg.min(), gg.max()));\n this.h = Math.max(this.h, gg.height());\n }\n this.coverage = union(covList);\n}\n\nGroupGlyph.prototype.drawConnectors = function (g) {\n var ranges = this.coverage.ranges();\n for (var r = 1; r < ranges.length; ++r) {\n var gl = ranges[r];\n var last = ranges[r - 1];\n if (last && gl.min() > last.max()) {\n var start = last.max();\n var end = gl.min();\n var mid = (start + end) / 2;\n\n if (this.connector === 'hat+') {\n g.moveTo(start, this.h / 2);\n g.lineTo(mid, 0);\n g.lineTo(end, this.h / 2);\n } else if (this.connector === 'hat-') {\n g.moveTo(start, this.h / 2);\n g.lineTo(mid, this.h);\n g.lineTo(end, this.h / 2);\n } else if (this.connector === 'collapsed+') {\n g.moveTo(start, this.h / 2);\n g.lineTo(end, this.h / 2);\n if (end - start > 4) {\n g.moveTo(mid - 2, this.h / 2 - 3);\n g.lineTo(mid + 2, this.h / 2);\n g.lineTo(mid - 2, this.h / 2 + 3);\n }\n } else if (this.connector === 'collapsed-') {\n g.moveTo(start, this.h / 2);\n g.lineTo(end, this.h / 2);\n if (end - start > 4) {\n g.moveTo(mid + 2, this.h / 2 - 3);\n g.lineTo(mid - 2, this.h / 2);\n g.lineTo(mid + 2, this.h / 2 + 3);\n }\n } else {\n g.moveTo(start, this.h / 2);\n g.lineTo(end, this.h / 2);\n }\n }\n last = gl;\n }\n};\n\nGroupGlyph.prototype.draw = function (g, oc) {\n for (var i = 0; i < this.glyphs.length; ++i) {\n var gl = this.glyphs[i];\n gl.draw(g, oc);\n }\n\n g.strokeStyle = 'black';\n g.beginPath();\n this.drawConnectors(g);\n g.stroke();\n};\n\nGroupGlyph.prototype.toSVG = function () {\n var g = makeElementNS(NS_SVG, 'g');\n for (var i = 0; i < this.glyphs.length; ++i) {\n g.appendChild(this.glyphs[i].toSVG());\n }\n\n var p = new SVGPath();\n this.drawConnectors(p);\n\n var pathData = p.toPathData();\n if (pathData.length > 0) {\n var path = makeElementNS(NS_SVG, 'path', null, { d: p.toPathData(),\n fill: 'none',\n stroke: 'black',\n strokeWidth: 0.5 });\n g.appendChild(path);\n }\n\n return g;\n};\n\nGroupGlyph.prototype.min = function () {\n return this.coverage.min();\n};\n\nGroupGlyph.prototype.max = function () {\n return this.coverage.max();\n};\n\nGroupGlyph.prototype.height = function () {\n return this.h;\n};\n\nfunction LineGraphGlyph(points, color, height) {\n this.points = points;\n this.color = color;\n this._height = height || 50;\n}\n\nLineGraphGlyph.prototype.min = function () {\n return this.points[0].x;\n // return this.points[0];\n};\n\nLineGraphGlyph.prototype.max = function () {\n return this.points[this.points.length - 1].x;\n // return this.points[this.points.length - 2];\n};\n\nLineGraphGlyph.prototype.height = function () {\n return this._height;\n};\n\nLineGraphGlyph.prototype.draw = function (g) {\n g.save();\n g.strokeStyle = this.color;\n g.lineWidth = 2;\n g.beginPath();\n this.points.forEach(function (p, i) {\n if (i === 0) g.moveTo(p.x, p.y);else g.lineTo(p.x, p.y);\n });\n g.stroke();\n g.restore();\n};\n\nLineGraphGlyph.prototype.toSVG = function () {\n var p = new SVGPath();\n for (var i = 0; i < this.points.length; ++i) {\n var x = this.points[i].x;\n var y = this.points[i].y;\n if (i == 0) {\n p.moveTo(x, y);\n } else {\n p.lineTo(x, y);\n }\n }\n\n return makeElementNS(NS_SVG, 'path', null, { d: p.toPathData(),\n fill: 'none',\n stroke: this.color,\n strokeWidth: '2px' });\n};\n\nfunction LabelledGlyph(GLOBAL_GC, glyph, text, unmeasured, anchor, align, font) {\n this.glyph = glyph;\n this.text = text;\n this.anchor = anchor || 'left';\n this.align = align || 'below';\n if (font) {\n this.font = font;\n }\n if (this.font) {\n GLOBAL_GC.save();\n GLOBAL_GC.font = this.font;\n }\n var metrics = GLOBAL_GC.measureText(text);\n if (this.font) {\n GLOBAL_GC.restore();\n }\n this.textLen = metrics.width;\n this.textHeight = 5;\n this.bump = glyph.bump;\n this.measured = !unmeasured;\n}\n\nLabelledGlyph.prototype.toSVG = function () {\n var child = this.glyph.toSVG();\n var opts = {};\n\n if (this.align == 'above') {\n child = makeElementNS(NS_SVG, 'g', child, { transform: \"translate(0, \" + (this.textHeight | 0 + 2) + \")\" });\n opts.y = this.textHeight;\n } else {\n opts.y = this.glyph.height() + 15;\n }\n\n if (this.font) {\n opts.fontSize = 7;\n }\n\n if ('center' == this.anchor) {\n opts.x = (this.glyph.min() + this.glyph.max() - this.textLen) / 2;\n } else {\n opts.x = this.glyph.min();\n }\n\n return makeElementNS(NS_SVG, 'g', [child, makeElementNS(NS_SVG, 'text', this.text, opts)]);\n};\n\nLabelledGlyph.prototype.min = function () {\n return this.glyph.min();\n};\n\nLabelledGlyph.prototype.max = function () {\n if (this.measured) return Math.max(this.glyph.max(), 1.0 * this.glyph.min() + this.textLen + 10);else return this.glyph.max();\n};\n\nLabelledGlyph.prototype.height = function () {\n var h = this.glyph.height();\n if (this.measured) {\n if (this.align == 'above') {\n h += this.textHeight + 2;\n } else {\n h += 20;\n }\n }\n return h;\n};\n\nLabelledGlyph.prototype.draw = function (g, oc) {\n if (this.align == 'above') {\n g.save();\n g.translate(0, this.textHeight + 2);\n }\n this.glyph.draw(g);\n if (this.align == 'above') {\n g.restore();\n }\n\n oc.registerGlyph(this);\n};\n\nLabelledGlyph.prototype.drawOverlay = function (g, minVisible, maxVisible) {\n g.fillStyle = 'black';\n if (this.font) {\n g.save();\n g.font = this.font;\n }\n var p;\n if ('center' == this.anchor) {\n p = (this.glyph.min() + this.glyph.max() - this.textLen) / 2;\n } else {\n p = this.glyph.min();\n if (p < minVisible) {\n p = Math.min(minVisible, this.glyph.max() - this.textLen);\n }\n }\n g.fillText(this.text, p, this.align == 'above' ? this.textHeight : this.glyph.height() + 15);\n if (this.font) {\n g.restore();\n }\n};\n\nfunction CrossGlyph(x, height, stroke) {\n this._x = x;\n this._height = height;\n this._stroke = stroke;\n}\n\nCrossGlyph.prototype.draw = function (g) {\n var hh = this._height / 2;\n\n g.beginPath();\n g.moveTo(this._x, 0);\n g.lineTo(this._x, this._height);\n g.moveTo(this._x - hh, hh);\n g.lineTo(this._x + hh, hh);\n\n g.strokeStyle = this._stroke;\n g.lineWidth = 1;\n\n g.stroke();\n};\n\nCrossGlyph.prototype.toSVG = function () {\n var hh = this._height / 2;\n\n var g = new SVGPath();\n g.moveTo(this._x, 0);\n g.lineTo(this._x, this._height);\n g.moveTo(this._x - hh, hh);\n g.lineTo(this._x + hh, hh);\n\n return makeElementNS(NS_SVG, 'path', null, { d: g.toPathData(),\n fill: 'none',\n stroke: this._stroke,\n strokeWidth: '1px' });\n};\n\nCrossGlyph.prototype.min = function () {\n return this._x - this._height / 2;\n};\n\nCrossGlyph.prototype.max = function () {\n return this._x + this._height / 2;\n};\n\nCrossGlyph.prototype.height = function () {\n return this._height;\n};\n\nfunction ExGlyph(x, height, stroke) {\n this._x = x;\n this._height = height;\n this._stroke = stroke;\n}\n\nExGlyph.prototype.draw = function (g) {\n var hh = this._height / 2;\n\n g.beginPath();\n g.moveTo(this._x - hh, 0);\n g.lineTo(this._x + hh, this._height);\n g.moveTo(this._x - hh, this._height);\n g.lineTo(this._x + hh, 0);\n\n g.strokeStyle = this._stroke;\n g.lineWidth = 1;\n\n g.stroke();\n};\n\nExGlyph.prototype.toSVG = function () {\n var hh = this._height / 2;\n\n var g = new SVGPath();\n g.moveTo(this._x - hh, 0);\n g.lineTo(this._x + hh, this._height);\n g.moveTo(this._x - hh, this._height);\n g.lineTo(this._x + hh, 0);\n\n return makeElementNS(NS_SVG, 'path', null, { d: g.toPathData(),\n fill: 'none',\n stroke: this._stroke,\n strokeWidth: '1px' });\n};\n\nExGlyph.prototype.min = function () {\n return this._x - this._height / 2;\n};\n\nExGlyph.prototype.max = function () {\n return this._x + this._height / 2;\n};\n\nExGlyph.prototype.height = function () {\n return this._height;\n};\n\nfunction TriangleGlyph(x, height, dir, width, fill, stroke) {\n PathGlyphBase.call(this, stroke, fill);\n\n this._x = x;\n this._height = height;\n this._dir = dir;\n this._width = width;\n}\n\nTriangleGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nTriangleGlyph.prototype.drawPath = function (g) {\n var hh = this._height / 2;\n var hw = this._width / 2;\n\n if (this._dir === 'S') {\n g.moveTo(this._x, this._height);\n g.lineTo(this._x - hw, 0);\n g.lineTo(this._x + hw, 0);\n } else if (this._dir === 'W') {\n g.moveTo(this._x + hw, hh);\n g.lineTo(this._x - hw, 0);\n g.lineTo(this._x - hw, this._height);\n } else if (this._dir === 'E') {\n g.moveTo(this._x - hw, hh);\n g.lineTo(this._x + hw, 0);\n g.lineTo(this._x + hw, this._height);\n } else {\n g.moveTo(this._x, 0);\n g.lineTo(this._x + hw, this._height);\n g.lineTo(this._x - hw, this._height);\n }\n\n g.closePath();\n};\n\nTriangleGlyph.prototype.min = function () {\n return this._x - this._height / 2;\n};\n\nTriangleGlyph.prototype.max = function () {\n return this._x + this._height / 2;\n};\n\nTriangleGlyph.prototype.height = function () {\n return this._height;\n};\n\nfunction DotGlyph(x, height, fill, stroke) {\n this._x = x;\n this._height = height;\n this._fill = fill;\n this._stroke = stroke;\n}\n\nDotGlyph.prototype.draw = function (g) {\n var hh = this._height / 2;\n g.fillStyle = this._stroke;\n g.beginPath();\n g.arc(this._x, hh, hh, 0, 6.29);\n\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fill();\n }\n\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.stroke();\n }\n};\n\nDotGlyph.prototype.toSVG = function () {\n var hh = this._height / 2;\n return makeElementNS(NS_SVG, 'circle', null, { cx: this._x, cy: hh, r: hh,\n fill: this._fill || 'none',\n stroke: this._stroke || 'none',\n strokeWidth: '1px' });\n};\n\nDotGlyph.prototype.min = function () {\n return this._x - this._height / 2;\n};\n\nDotGlyph.prototype.max = function () {\n return this._x + this._height / 2;\n};\n\nDotGlyph.prototype.height = function () {\n return this._height;\n};\n\nfunction PaddedGlyph(glyph, minp, maxp) {\n this.glyph = glyph;\n this._min = minp;\n this._max = maxp;\n if (glyph) {\n this.bump = glyph.bump;\n }\n}\n\nPaddedGlyph.prototype.draw = function (g, oc) {\n if (this.glyph) this.glyph.draw(g, oc);\n};\n\nPaddedGlyph.prototype.toSVG = function () {\n if (this.glyph) {\n return this.glyph.toSVG();\n } else {\n return makeElementNS(NS_SVG, 'g');\n }\n};\n\nPaddedGlyph.prototype.min = function () {\n return this._min;\n};\n\nPaddedGlyph.prototype.max = function () {\n return this._max;\n};\n\nPaddedGlyph.prototype.height = function () {\n if (this.glyph) {\n return this.glyph.height();\n } else {\n return 1;\n }\n};\n\nfunction AArrowGlyph(min, max, height, fill, stroke, ori) {\n PathGlyphBase.call(this, stroke, fill);\n this._min = min;\n this._max = max;\n this._height = height;\n this._ori = ori;\n}\n\nAArrowGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nAArrowGlyph.prototype.min = function () {\n return this._min;\n};\n\nAArrowGlyph.prototype.max = function () {\n return this._max;\n};\n\nAArrowGlyph.prototype.height = function () {\n return this._height;\n};\n\nAArrowGlyph.prototype.drawPath = function (g) {\n var maxPos = this._max;\n var minPos = this._min;\n var height = this._height;\n var lInset = 0;\n var rInset = 0;\n var minLength = this._height + 2;\n var instep = 0.333333 * this._height;\n var y = 0;\n\n if (this._ori) {\n if (this._ori === '+') {\n rInset = 0.5 * this._height;\n } else if (this._ori === '-') {\n lInset = 0.5 * this._height;\n }\n }\n\n if (maxPos - minPos < minLength) {\n minPos = (maxPos + minPos - minLength) / 2;\n maxPos = minPos + minLength;\n }\n\n g.moveTo(minPos + lInset, y + instep);\n g.lineTo(maxPos - rInset, y + instep);\n g.lineTo(maxPos - rInset, y);\n g.lineTo(maxPos, y + this._height / 2);\n g.lineTo(maxPos - rInset, y + height);\n g.lineTo(maxPos - rInset, y + instep + instep);\n g.lineTo(minPos + lInset, y + instep + instep);\n g.lineTo(minPos + lInset, y + height);\n g.lineTo(minPos, y + height / 2);\n g.lineTo(minPos + lInset, y);\n g.lineTo(minPos + lInset, y + instep);\n};\n\nfunction SpanGlyph(min, max, height, stroke) {\n PathGlyphBase.call(this, stroke, null);\n this._min = min;\n this._max = max;\n this._height = height;\n}\n\nSpanGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nSpanGlyph.prototype.min = function () {\n return this._min;\n};\nSpanGlyph.prototype.max = function () {\n return this._max;\n};\nSpanGlyph.prototype.height = function () {\n return this._height;\n};\n\nSpanGlyph.prototype.drawPath = function (g) {\n var minPos = this._min,\n maxPos = this._max;\n var height = this._height,\n hh = height / 2;\n g.moveTo(minPos, hh);\n g.lineTo(maxPos, hh);\n g.moveTo(minPos, 0);\n g.lineTo(minPos, height);\n g.moveTo(maxPos, 0);\n g.lineTo(maxPos, height);\n};\n\nfunction LineGlyph(min, max, height, style, strand, stroke) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._style = style;\n this._strand = strand;\n this._stroke = stroke;\n}\n\nLineGlyph.prototype.min = function () {\n return this._min;\n};\nLineGlyph.prototype.max = function () {\n return this._max;\n};\nLineGlyph.prototype.height = function () {\n return this._height;\n};\n\nLineGlyph.prototype.drawPath = function (g) {\n var minPos = this._min,\n maxPos = this._max;\n var height = this._height,\n hh = height / 2;\n\n if (this._style === 'hat') {\n g.moveTo(minPos, hh);\n g.lineTo((minPos + maxPos) / 2, this._strand === '-' ? height : 0);\n g.lineTo(maxPos, hh);\n } else {\n g.moveTo(minPos, hh);\n g.lineTo(maxPos, hh);\n }\n};\n\nLineGlyph.prototype.draw = function (g) {\n g.beginPath();\n this.drawPath(g);\n g.strokeStyle = this._stroke;\n if (this._style === 'dashed' && g.setLineDash) {\n g.save();\n g.setLineDash([3]);\n g.stroke();\n g.restore();\n } else {\n g.stroke();\n }\n};\n\nLineGlyph.prototype.toSVG = function () {\n var g = new SVGPath();\n this.drawPath(g);\n\n var opts = { d: g.toPathData(),\n stroke: this._stroke || 'none' };\n if (this._style === 'dashed') {\n opts['strokeDasharray'] = '3';\n }\n\n return makeElementNS(NS_SVG, 'path', null, opts);\n};\n\nfunction PrimersGlyph(min, max, height, fill, stroke) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._stroke = stroke;\n}\n\nPrimersGlyph.prototype.min = function () {\n return this._min;\n};\nPrimersGlyph.prototype.max = function () {\n return this._max;\n};\nPrimersGlyph.prototype.height = function () {\n return this._height;\n};\n\nPrimersGlyph.prototype.drawStemPath = function (g) {\n var minPos = this._min,\n maxPos = this._max;\n var height = this._height,\n hh = height / 2;\n g.moveTo(minPos, hh);\n g.lineTo(maxPos, hh);\n};\n\nPrimersGlyph.prototype.drawTrigsPath = function (g) {\n var minPos = this._min,\n maxPos = this._max;\n var height = this._height,\n hh = height / 2;\n g.moveTo(minPos, 0);\n g.lineTo(minPos + height, hh);\n g.lineTo(minPos, height);\n g.lineTo(minPos, 0);\n g.moveTo(maxPos, 0);\n g.lineTo(maxPos - height, hh);\n g.lineTo(maxPos, height);\n g.lineTo(maxPos, 0);\n};\n\nPrimersGlyph.prototype.draw = function (g) {\n g.beginPath();\n this.drawStemPath(g);\n g.strokeStyle = this._stroke;\n g.stroke();\n g.beginPath();\n this.drawTrigsPath(g);\n g.fillStyle = this._fill;\n g.fill();\n};\n\nPrimersGlyph.prototype.toSVG = function () {\n var s = new SVGPath();\n this.drawStemPath(s);\n var t = new SVGPath();\n this.drawTrigsPath(t);\n\n return makeElementNS(NS_SVG, 'g', [makeElementNS(NS_SVG, 'path', null, { d: s.toPathData(),\n stroke: this._stroke || 'none' }), makeElementNS(NS_SVG, 'path', null, { d: t.toPathData(),\n fill: this._fill || 'none' })]);\n};\n\nfunction ArrowGlyph(min, max, height, color, parallel, sw, ne) {\n PathGlyphBase.call(this, null, color);\n this._min = min;\n this._max = max;\n this._height = height;\n this._color = color;\n this._parallel = parallel;\n this._sw = sw;\n this._ne = ne;\n}\n\nArrowGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nArrowGlyph.prototype.min = function () {\n return this._min;\n};\nArrowGlyph.prototype.max = function () {\n return this._max;\n};\nArrowGlyph.prototype.height = function () {\n return this._height;\n};\n\nArrowGlyph.prototype.drawPath = function (g) {\n var min = this._min,\n max = this._max,\n height = this._height;\n\n if (this._parallel) {\n var hh = height / 2;\n var instep = 0.4 * height;\n if (this._sw) {\n g.moveTo(min + hh, height - instep);\n g.lineTo(min + hh, height);\n g.lineTo(min, hh);\n g.lineTo(min + hh, 0);\n g.lineTo(min + hh, instep);\n } else {\n g.moveTo(min, height - instep);\n g.lineTo(min, instep);\n }\n if (this._ne) {\n g.lineTo(max - hh, instep);\n g.lineTo(max - hh, 0);\n g.lineTo(max, hh);\n g.lineTo(max - hh, height);\n g.lineTo(max - hh, height - instep);\n } else {\n g.lineTo(max, instep);\n g.lineTo(max, height - instep);\n }\n g.closePath();\n } else {\n var mid = (min + max) / 2;\n var instep = 0.4 * (max - min);\n var th = height / 3;\n\n if (this._ne) {\n g.moveTo(min + instep, th);\n g.lineTo(min, th);\n g.lineTo(mid, 0);\n g.lineTo(max, th);\n g.lineTo(max - instep, th);\n } else {\n g.moveTo(min + instep, 0);\n g.lineTo(max - instep, 0);\n }\n if (this._sw) {\n g.lineTo(max - instep, height - th);\n g.lineTo(max, height - th);\n g.lineTo(mid, height);\n g.lineTo(min, height - th);\n g.lineTo(min + instep, height - th);\n } else {\n g.lineTo(max - instep, height);\n g.lineTo(min + instep, height);\n }\n g.closePath();\n }\n};\n\nfunction TooManyGlyph(min, max, height, fill, stroke) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._stroke = stroke;\n}\n\nTooManyGlyph.prototype.min = function () {\n return this._min;\n};\nTooManyGlyph.prototype.max = function () {\n return this._max;\n};\nTooManyGlyph.prototype.height = function () {\n return this._height;\n};\n\nTooManyGlyph.prototype.toSVG = function () {\n return makeElementNS(NS_SVG, 'rect', null, { x: this._min,\n y: 0,\n width: this._max - this._min,\n height: this._height,\n stroke: this._stroke || 'none',\n fill: this._fill || 'none' });\n};\n\nTooManyGlyph.prototype.draw = function (g) {\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fillRect(this._min, 0, this._max - this._min, this._height);\n }\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.strokeRect(this._min, 0, this._max - this._min, this._height);\n g.beginPath();\n for (var n = 2; n < this._height; n += 3) {\n g.moveTo(this._min, n);\n g.lineTo(this._max, n);\n }\n g.stroke();\n }\n};\n\nfunction TextGlyph(GLOBAL_GC, min, max, height, fill, string) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._string = string;\n this._textLen = GLOBAL_GC.measureText(string).width;\n}\n\nTextGlyph.prototype.min = function () {\n return this._min;\n};\nTextGlyph.prototype.max = function () {\n return Math.max(this._max, this._min + this._textLen);\n};\nTextGlyph.prototype.height = function () {\n return this._height;\n};\n\nTextGlyph.prototype.draw = function (g) {\n g.fillStyle = this._fill;\n g.fillText(this._string, this._min, this._height - 4);\n};\n\nTextGlyph.prototype.toSVG = function () {\n return makeElementNS(NS_SVG, 'text', this._string, { x: this._min, y: this._height - 4 });\n};\n\nfunction aminoTileColor(aa, start, color) {\n var ALTERNATE_COLOR = {\n 'red': 'darkred',\n 'purple': 'mediumpurple',\n 'blue': 'darkblue',\n 'green': 'darkgreen'\n };\n var color2 = ALTERNATE_COLOR[color.toLowerCase()];\n var tileColors;\n if (!color2) tileColors = ['rgb(73, 68, 149)', 'rgb(9, 0, 103)'];\n // default to UCSC colors\n else tileColors = [color, color2];\n\n if (aa == '?') return 'black';else if (aa == 'M') return 'greenyellow';else if (aa == '*') return 'crimson';else return tileColors[start % 2];\n}\n\nfunction reverseComplement(sequence) {\n var seq_dict = { 'A': 'T', 'T': 'A', 'G': 'C', 'C': 'G' };\n var rev_seq = sequence.split('').reverse().join('');\n var rev_compl_seq = [];\n for (var b = 0; b < rev_seq.length; ++b) {\n var base = rev_seq.substr(b, 1).toUpperCase();\n rev_compl_seq.push(base in seq_dict ? seq_dict[base] : 'N');\n }\n return rev_compl_seq.join('');\n}\n\nfunction AminoAcidGlyph(min, max, height, fill, seq, orientation, readframe) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._seq = seq;\n this._orientation = orientation;\n this._readframe = readframe;\n}\n\nAminoAcidGlyph.prototype.min = function () {\n return this._min;\n};\nAminoAcidGlyph.prototype.max = function () {\n return this._max;\n};\nAminoAcidGlyph.prototype.height = function () {\n return this._height;\n};\n\nAminoAcidGlyph.prototype.draw = function (gc) {\n var seq = this._seq;\n var color = this._fill;\n\n if (!seq) return;\n\n var scale = (this._max - this._min + 1) / seq.length;\n\n var prevOverhang = (3 - this._readframe) % 3;\n var nextOverhang = (seq.length - prevOverhang) % 3;\n var leftOverhang = this._orientation == '+' ? prevOverhang : nextOverhang;\n\n if (leftOverhang > 0) {\n gc.fillStyle = color;\n gc.fillRect(this._min, 0, scale * leftOverhang, this._height);\n }\n\n for (var p = leftOverhang; p < seq.length; p += 3) {\n var codon = seq.substr(p, 3).toUpperCase();\n if (this._orientation == '-') codon = reverseComplement(codon);\n var aa = codon in AMINO_ACID_TRANSLATION ? AMINO_ACID_TRANSLATION[codon] : '?';\n color = codon.length == 3 ? aminoTileColor(aa, p, this._fill) : this._fill;\n gc.fillStyle = color;\n gc.fillRect(this._min + p * scale, 0, scale * codon.length, this._height);\n\n if (scale >= 8 && codon.length == 3) {\n gc.fillStyle = 'white';\n gc.fillText(aa, this._min + (p + 1) * scale, this._height);\n }\n }\n};\n\nAminoAcidGlyph.prototype.toSVG = function () {\n var g = makeElementNS(NS_SVG, 'g');\n var seq = this._seq;\n var color = this._fill;\n\n if (!seq) return g;\n\n var scale = (this._max - this._min + 1) / seq.length;\n\n var prevOverhang = (3 - this._readframe) % 3;\n var nextOverhang = (seq.length - prevOverhang) % 3;\n var leftOverhang = this._orientation == '+' ? prevOverhang : nextOverhang;\n\n if (leftOverhang > 0) {\n g.appendChild(makeElementNS(NS_SVG, 'rect', null, {\n x: this._min,\n y: 0,\n width: scale * leftOverhang,\n height: this._height,\n fill: color }));\n }\n for (var p = leftOverhang; p < seq.length; p += 3) {\n var codon = seq.substr(p, 3).toUpperCase();\n if (this._orientation == '-') codon = reverseComplement(codon);\n var aa = codon in AMINO_ACID_TRANSLATION ? AMINO_ACID_TRANSLATION[codon] : '?';\n color = codon.length == 3 ? aminoTileColor(aa, p, this._fill) : this._fill;\n g.appendChild(makeElementNS(NS_SVG, 'rect', null, {\n x: this._min + p * scale,\n y: 0,\n width: scale * codon.length,\n height: this._height,\n fill: color }));\n\n if (scale >= 8 && codon.length == 3) {\n g.appendChild(makeElementNS(NS_SVG, 'text', aa, {\n x: this._min + (p + 1) * scale,\n y: this._height,\n fill: 'white' }));\n }\n }\n return g;\n};\n\nvar isRetina = typeof window !== 'undefined' && window.devicePixelRatio > 1;\nvar __dalliance_SequenceGlyphCache = {};\nvar altPattern = new RegExp('^[ACGT-]$');\nvar isCloseUp = function isCloseUp(scale) {\n return scale >= 8;\n};\n\nfunction SequenceGlyph(baseColors, strandColor, min, max, height, seq, ref, scheme, quals, fillbg, scaleVertical) {\n this.baseColors = baseColors;\n this._strandColor = strandColor;\n this._min = min;\n this._max = max;\n this._height = height;\n this._seq = seq;\n this._ref = ref;\n this._scheme = scheme;\n this._quals = quals;\n this._fillbg = fillbg;\n this._scaleVertical = scaleVertical;\n}\n\nSequenceGlyph.prototype.min = function () {\n return this._min;\n};\nSequenceGlyph.prototype.max = function () {\n return this._max;\n};\nSequenceGlyph.prototype.height = function () {\n return this._height;\n};\n\nSequenceGlyph.prototype.alphaForQual = function (qual) {\n return 0.1 + 0.9 * Math.max(0.0, Math.min(1.0 * qual / 30.0, 1.0));\n};\n\nSequenceGlyph.prototype.draw = function (gc) {\n var seq = this._seq;\n var ref = this._ref;\n var mismatch = this._scheme === 'mismatch' || this._scheme === 'mismatch-all';\n var all = this._scheme === 'mismatch-all';\n\n var seqLength = seq ? seq.length : this._max - this._min + 1;\n var scale = (this._max - this._min + 1) / seqLength;\n\n if (mismatch && !isCloseUp(scale)) {\n gc.fillStyle = this._strandColor;\n if (this._scaleVertical) gc.fillRect(this._min, scale, this._max - this._min, scale);else gc.fillRect(this._min, this._height / 4, this._max - this._min, this._height / 2);\n }\n\n for (var p = 0; p < seqLength; ++p) {\n var base = seq ? seq.substr(p, 1).toUpperCase() : 'N';\n\n if (!altPattern.test(base) && !isCloseUp(scale)) continue;\n\n var color = this.baseColors[base];\n\n if (this._quals) {\n var qc = this._quals.charCodeAt(p) - 33;\n var oldAlpha = gc.globalAlpha; // NB hoisted!\n gc.globalAlpha = this.alphaForQual(qc);\n }\n\n if (!color) {\n var refBase = ref ? ref.substr(p, 1).toUpperCase() : 'N';\n if (base == 'N' || refBase == 'N') color = 'gray';else color = this._strandColor;\n\n if (all) base = refBase;\n }\n\n gc.fillStyle = color;\n\n var alt = altPattern.test(base);\n if (this._fillbg || !isCloseUp(scale) || !alt) {\n if (this._scaleVertical) gc.fillRect(this._min + p * scale, scale, scale, scale);else gc.fillRect(this._min + p * scale, 0, scale, this._height);\n }\n if (isCloseUp(scale) && alt) {\n var key = color + '_' + base;\n var img = __dalliance_SequenceGlyphCache[key];\n if (!img) {\n img = document.createElement('canvas');\n if (isRetina) {\n img.width = 16;\n img.height = 20;\n } else {\n img.width = 8;\n img.height = 10;\n }\n var imgGc = img.getContext('2d');\n if (isRetina) {\n imgGc.scale(2, 2);\n }\n imgGc.fillStyle = this._fillbg ? 'black' : color;\n var w = imgGc.measureText(base).width;\n imgGc.fillText(base, 0.5 * (8.0 - w), 8);\n __dalliance_SequenceGlyphCache[key] = img;\n }\n var dy = this._scaleVertical ? scale : 0;\n if (isRetina) gc.drawImage(img, this._min + p * scale + 0.5 * (scale - 8), dy, 8, 10);else gc.drawImage(img, this._min + p * scale + 0.5 * (scale - 8), dy);\n }\n\n if (this._quals) {\n gc.globalAlpha = oldAlpha;\n }\n }\n};\n\nSequenceGlyph.prototype.toSVG = function () {\n var seq = this._seq;\n var ref = this._ref;\n var mismatch = this._scheme === 'mismatch' || this._scheme === 'mismatch-all';\n var all = this._scheme === 'mismatch-all';\n var scale = (this._max - this._min + 1) / this._seq.length;\n var g = makeElementNS(NS_SVG, 'g');\n\n for (var p = 0; p < seq.length; ++p) {\n var base = seq ? seq.substr(p, 1).toUpperCase() : 'N';\n var color = this.baseColors[base];\n\n if (!color) {\n var refBase = ref ? ref.substr(p, 1).toUpperCase() : 'N';\n if (base == 'N' || refBase == 'N') color = 'gray';else color = this._strandColor;\n\n if (all) base = refBase;\n }\n\n var alpha = 1.0;\n if (this._quals) {\n var qc = this._quals.charCodeAt(p) - 33;\n alpha = this.alphaForQual(qc);\n }\n\n var alt = altPattern.test(base);\n if (this._fillbg || !isCloseUp(scale) || !alt) {\n g.appendChild(makeElementNS(NS_SVG, 'rect', null, {\n x: this._min + p * scale,\n y: 0,\n width: scale,\n height: this._height,\n fill: color,\n fillOpacity: alpha }));\n }\n\n if (isCloseUp(scale) && alt) {\n g.appendChild(makeElementNS(NS_SVG, 'text', base, {\n x: this._min + (0.5 + p) * scale,\n y: 8,\n textAnchor: 'middle',\n fill: this._fillbg ? 'black' : color,\n fillOpacity: alpha }));\n }\n }\n\n return g;\n};\n\nfunction TranslatedGlyph(glyph, x, y, height) {\n this.glyph = glyph;\n this._height = height;\n this._x = x;\n this._y = y;\n}\n\nTranslatedGlyph.prototype.height = function () {\n if (this._height) {\n return this._height;\n } else {\n return this.glyph.height() + this._y;\n }\n};\n\nTranslatedGlyph.prototype.min = function () {\n return this.glyph.min() + this._x;\n};\n\nTranslatedGlyph.prototype.max = function () {\n return this.glyph.max() + this._x;\n};\n\nTranslatedGlyph.prototype.minY = function () {\n return this._y;\n};\n\nTranslatedGlyph.prototype.maxY = function () {\n return this._y + this.glyph.height();\n};\n\nTranslatedGlyph.prototype.draw = function (g, o) {\n g.save();\n g.translate(this._x, this._y);\n this.glyph.draw(g, o);\n g.restore();\n};\n\nTranslatedGlyph.prototype.toSVG = function () {\n var s = this.glyph.toSVG();\n s.setAttribute('transform', 'translate(' + this._x + ',' + this._y + ')');\n return s;\n};\n\nfunction PointGlyph(x, y, height, fill) {\n this._x = x;\n this._y = y;\n this._height = height;\n this._fill = fill;\n}\n\nPointGlyph.prototype.min = function () {\n return this._x - 2;\n};\n\nPointGlyph.prototype.max = function () {\n return this._x + 2;\n};\n\nPointGlyph.prototype.height = function () {\n return this._height;\n};\n\nPointGlyph.prototype.draw = function (g) {\n g.save();\n g.globalAlpha = 0.3;\n g.fillStyle = this._fill;\n g.beginPath();\n g.arc(this._x, this._y, 1.5, 0, 6.29);\n g.fill();\n g.restore();\n};\n\nPointGlyph.prototype.toSVG = function () {\n return makeElementNS(NS_SVG, 'circle', null, { cx: this._x, cy: this._y, r: 2,\n fill: this._fill,\n stroke: 'none' });\n};\n\nfunction GridGlyph(height, yOffset, spacing) {\n this._height = height || 50;\n this.yOffset = yOffset || 0;\n this.spacing = spacing || 10;\n}\n\nGridGlyph.prototype.notSelectable = true;\n\nGridGlyph.prototype.min = function () {\n return -100000;\n};\n\nGridGlyph.prototype.max = function () {\n return 100000;\n};\n\nGridGlyph.prototype.height = function () {\n return this._height;\n};\n\nGridGlyph.prototype.draw = function (g) {\n g.save();\n g.strokeStyle = 'black';\n g.lineWidth = 0.1;\n\n g.beginPath();\n for (var y = this.yOffset; y <= this._height + this.yOffset; y += this.spacing) {\n // for (var y = 0; y <= this._height; y += 10) {\n g.moveTo(-5000, y);\n g.lineTo(5000, y);\n }\n g.stroke();\n g.restore();\n};\n\nGridGlyph.prototype.toSVG = function () {\n var p = new SVGPath();\n for (var y = 0; y <= this._height; y += 10) {\n p.moveTo(-5000, y);\n p.lineTo(5000, y);\n }\n\n return makeElementNS(NS_SVG, 'path', null, { d: p.toPathData(),\n fill: 'none',\n stroke: 'black',\n strokeWidth: '0.1px' });\n};\n\nfunction StarGlyph(x, r, points, fill, stroke) {\n PathGlyphBase.call(this, stroke, fill);\n this._x = x;\n this._r = r;\n this._points = points;\n}\n\nStarGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nStarGlyph.prototype.min = function () {\n return this._x - this._r;\n};\n\nStarGlyph.prototype.max = function () {\n return this._x + this._r;\n};\n\nStarGlyph.prototype.height = function () {\n return 2 * this._r;\n};\n\nStarGlyph.prototype.drawPath = function (g) {\n var midX = this._x,\n midY = this._r,\n r = this._r;\n for (var p = 0; p < this._points; ++p) {\n var theta = p * 6.28 / this._points;\n var px = midX + r * Math.sin(theta);\n var py = midY - r * Math.cos(theta);\n if (p == 0) {\n g.moveTo(px, py);\n } else {\n g.lineTo(px, py);\n }\n theta = (p + 0.5) * 6.28 / this._points;\n px = midX + 0.4 * r * Math.sin(theta);\n py = midY - 0.4 * r * Math.cos(theta);\n g.lineTo(px, py);\n }\n g.closePath();\n};\n\nfunction PlimsollGlyph(x, height, overhang, fill, stroke) {\n this._x = x;\n this._height = height;\n this._overhang = overhang;\n this._fill = fill;\n this._stroke = stroke;\n this._hh = height / 2;\n}\n\nPlimsollGlyph.prototype.draw = function (g) {\n var hh = this._height / 2;\n g.fillStyle = this._stroke;\n g.beginPath();\n g.arc(this._x, hh, hh - this._overhang, 0, 6.29);\n g.moveTo(this._x, 0);\n g.lineTo(this._x, this._height);\n\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fill();\n }\n\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.stroke();\n }\n};\n\nPlimsollGlyph.prototype.toSVG = function () {\n var hh = this._hh;\n return makeElementNS(NS_SVG, 'g', [makeElementNS(NS_SVG, 'circle', null, { cx: this._x, cy: hh, r: hh - this._overhang }), makeElementNS(NS_SVG, 'line', null, { x1: this._x, y1: 0, x2: this._x, y2: this._height })], { fill: this._fill || 'none',\n stroke: this._stroke || 'none',\n strokeWidth: '1px' });\n};\n\nPlimsollGlyph.prototype.min = function () {\n return this._x - this._hh;\n};\n\nPlimsollGlyph.prototype.max = function () {\n return this._x + this._hh;\n};\n\nPlimsollGlyph.prototype.height = function () {\n return this._height;\n};\n\nfunction OverlayLabelCanvas() {\n this.ox = 0;\n this.oy = 0;\n this.glyphs = [];\n}\n\nOverlayLabelCanvas.prototype.translate = function (x, y) {\n this.ox += x;\n this.oy += y;\n};\n\nOverlayLabelCanvas.prototype.registerGlyph = function (g) {\n this.glyphs.push({\n x: this.ox,\n y: this.oy,\n glyph: g\n });\n};\n\nOverlayLabelCanvas.prototype.draw = function (g, minVisible, maxVisible) {\n for (var gi = 0; gi < this.glyphs.length; ++gi) {\n var gg = this.glyphs[gi];\n g.save();\n g.translate(gg.x, gg.y);\n gg.glyph.drawOverlay(g, minVisible, maxVisible);\n g.restore();\n }\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n BoxGlyph: BoxGlyph,\n GroupGlyph: GroupGlyph,\n LineGraphGlyph: LineGraphGlyph,\n LabelledGlyph: LabelledGlyph,\n CrossGlyph: CrossGlyph,\n ExGlyph: ExGlyph,\n TriangleGlyph: TriangleGlyph,\n DotGlyph: DotGlyph,\n PaddedGlyph: PaddedGlyph,\n AArrowGlyph: AArrowGlyph,\n SpanGlyph: SpanGlyph,\n LineGlyph: LineGlyph,\n PrimersGlyph: PrimersGlyph,\n ArrowGlyph: ArrowGlyph,\n TooManyGlyph: TooManyGlyph,\n TextGlyph: TextGlyph,\n SequenceGlyph: SequenceGlyph,\n AminoAcidGlyph: AminoAcidGlyph,\n TranslatedGlyph: TranslatedGlyph,\n GridGlyph: GridGlyph,\n StarGlyph: StarGlyph,\n PointGlyph: PointGlyph,\n PlimsollGlyph: PlimsollGlyph,\n\n OverlayLabelCanvas: OverlayLabelCanvas\n };\n}\n\n},{\"./spans\":41,\"./svg-utils\":45,\"./utils\":56}],24:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// jbjson.js -- query JBrowse-style REST data stores\n//\n\nif (typeof require !== 'undefined') {\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n}\n\nfunction JBrowseStore(base, query) {\n this.base = base;\n this.query = query;\n}\n\nfunction jbori(strand) {\n if (strand > 0) return '+';else if (strand < 0) return '-';\n}\n\nJBrowseStore.prototype.features = function (segment, opts, callback) {\n opts = opts || {};\n\n url = this.base + '/features/' + segment.name;\n\n var filters = [];\n if (this.query) {\n filters.push(this.query);\n }\n if (segment.isBounded) {\n filters.push('start=' + segment.start);\n filters.push('end=' + segment.end);\n }\n if (filters.length > 0) {\n url = url + '?' + filters.join('&');\n }\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status >= 300) {\n callback(null, 'Error code ' + req.status);\n } else {\n var jf = JSON.parse(req.response)['features'];\n var features = [];\n for (fi = 0; fi < jf.length; ++fi) {\n var j = jf[fi];\n\n var f = new DASFeature();\n f.segment = segment.name;\n f.min = (j['start'] | 0) + 1;\n f.max = j['end'] | 0;\n if (j.name) {\n f.label = j.name;\n }\n if (j.strand) f.orientation = jbori(j.strand);\n f.type = j.type || 'unknown';\n\n if (j.subfeatures && j.subfeatures.length > 0) {\n f.id = j.uniqueID;\n\n var blocks = [];\n var cds = [];\n var all = [];\n\n for (var si = 0; si < j.subfeatures.length; ++si) {\n var sj = j.subfeatures[si];\n var sf = shallowCopy(f);\n sf.min = sj.start + 1;\n sf.max = sj.end;\n sf.groups = [f];\n\n all.push(sf);\n blocks.push(new Range(sf.min, sf.max));\n if (sj.type === 'CDS') cds.push(sf);\n }\n\n if (cds.length > 0) {\n spans = union(blocks);\n var txGroup = shallowCopy(f);\n txGroup.type = 'transcript';\n spans.ranges().forEach(function (exon) {\n features.push({\n segment: segment.name,\n min: exon.min(),\n max: exon.max(),\n orientation: f.orientation,\n groups: [txGroup],\n type: 'transcript'\n });\n });\n\n var tlGroup = shallowCopy(f);\n cds.forEach(function (cdsExon) {\n cdsExon.type = 'translation';\n cdsExon.groups = [tlGroup];\n features.push(cdsExon);\n });\n } else {\n all.forEach(function (f) {\n features.push(f);\n });\n }\n } else {\n features.push(f);\n }\n }\n callback(features);\n }\n }\n };\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n JBrowseStore: JBrowseStore\n };\n}\n\n},{\"./das\":10,\"./spans\":41,\"./utils\":56}],25:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// kspace.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n var pusho = utils.pusho;\n\n var sa = require('./sourceadapters');\n var MappedFeatureSource = sa.MappedFeatureSource;\n var CachingFeatureSource = sa.CachingFeatureSource;\n var BWGFeatureSource = sa.BWGFeatureSource;\n var RemoteBWGFeatureSource = sa.RemoteBWGFeatureSource;\n var BAMFeatureSource = sa.BAMFeatureSource;\n var RemoteBAMFeatureSource = sa.RemoteBAMFeatureSource;\n var DummySequenceSource = sa.DummySequenceSource;\n var DummyFeatureSource = sa.DummyFeatureSource;\n\n var OverlayFeatureSource = require('./overlay').OverlayFeatureSource;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var sample = require('./sample');\n var downsample = sample.downsample;\n var getBaseCoverage = sample.getBaseCoverage;\n\n var das = require('./das');\n var DASSequence = das.DASSequence;\n\n var Promise = require('es6-promise').Promise;\n}\n\nfunction FetchPool() {\n var self = this;\n this.reqs = [];\n this.awaitedFeatures = {};\n this.requestsIssued = new Promise(function (resolve, reject) {\n self.notifyRequestsIssued = resolve;\n });\n}\n\nFetchPool.prototype.addRequest = function (xhr) {\n this.reqs.push(xhr);\n};\n\nFetchPool.prototype.abortAll = function () {\n for (var i = 0; i < this.reqs.length; ++i) {\n this.reqs[i].abort();\n }\n};\n\nfunction KSCacheBaton(chr, min, max, scale, features, status, coverage) {\n this.chr = chr;\n this.min = min;\n this.max = max;\n this.coverage = coverage;\n this.scale = scale;\n this.features = features || [];\n this.status = status;\n}\n\nKSCacheBaton.prototype.toString = function () {\n return this.chr + \":\" + this.min + \"..\" + this.max + \";scale=\" + this.scale;\n};\n\nfunction KnownSpace(tierMap, chr, min, max, scale, seqSource) {\n this.tierMap = tierMap;\n this.chr = chr;\n this.min = min;\n this.max = max;\n this.scale = scale;\n this.seqSource = seqSource || new DummySequenceSource();\n this.viewCount = 0;\n\n this.featureCache = {};\n this.latestViews = {};\n}\n\nKnownSpace.prototype.cancel = function () {\n this.cancelled = true;\n};\n\nKnownSpace.prototype.bestCacheOverlapping = function (chr, min, max) {\n var baton = this.featureCache[this.tierMap[0]];\n if (baton) {\n return baton;\n } else {\n return null;\n }\n};\n\nKnownSpace.prototype.retrieveFeatures = function (tiers, chr, min, max, scale) {\n if (scale != scale) {\n throw \"retrieveFeatures called with silly scale\";\n }\n\n if (chr != this.chr) {\n throw \"Can't extend Known Space to a new chromosome\";\n }\n if (min < 1) {\n min = 1;\n }\n\n this.min = min;\n this.max = max;\n this.scale = scale;\n\n if (this.pool) {\n this.pool.abortAll();\n }\n this.pool = new FetchPool();\n this.awaitedSeq = new Awaited();\n this.seqWasFetched = false;\n this.viewCount++;\n\n this.startFetchesForTiers(tiers);\n this.pool.notifyRequestsIssued();\n};\n\nfunction filterFeatures(features, min, max) {\n var ff = [];\n var featuresByGroup = {};\n\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (!f.min || !f.max) {\n ff.push(f);\n } else if (f.groups && f.groups.length > 0) {\n pusho(featuresByGroup, f.groups[0].id, f);\n } else if (f.min <= max && f.max >= min) {\n ff.push(f);\n }\n }\n\n for (var gid in featuresByGroup) {\n var gf = featuresByGroup[gid];\n var gmin = 100000000000,\n gmax = -100000000000;\n for (var fi = 0; fi < gf.length; ++fi) {\n var f = gf[fi];\n gmin = Math.min(gmin, f.min);\n gmax = Math.max(gmax, f.max);\n }\n if (gmin <= max || gmax >= min) {\n for (var fi = 0; fi < gf.length; ++fi) {\n ff.push(gf[fi]);\n }\n }\n }\n\n return ff;\n}\n\nKnownSpace.prototype.invalidate = function (tier) {\n if (!this.pool) {\n return;\n }\n\n this.featureCache[tier] = null;\n this.startFetchesForTiers([tier]);\n};\n\nKnownSpace.prototype.startFetchesForTiers = function (tiers) {\n var thisB = this;\n\n var awaitedSeq = this.awaitedSeq;\n var needSeq = false;\n\n var gex;\n\n for (var t = 0; t < tiers.length; ++t) {\n var tierRenderer = tiers[t].browser.getTierRenderer(tiers[t]);\n try {\n if (this.startFetchesFor(tiers[t], awaitedSeq)) {\n needSeq = true;\n }\n } catch (ex) {\n var tier = tiers[t];\n\n tier.currentFeatures = [];\n tier.currentSequence = null;\n console.log('Error fetching tier source');\n console.log(ex);\n gex = ex;\n console.log(ex.stack);\n tierRenderer.renderTier(ex, tier);\n tier.wasRendered();\n }\n }\n\n if (needSeq && !this.seqWasFetched) {\n this.seqWasFetched = true;\n var smin = this.min,\n smax = this.max;\n\n if (this.cs) {\n if (this.cs.start <= smin && this.cs.end >= smax) {\n var cachedSeq;\n if (this.cs.start == smin && this.cs.end == smax) {\n cachedSeq = this.cs;\n } else {\n cachedSeq = new DASSequence(this.cs.name, smin, smax, this.cs.alphabet, this.cs.seq.substring(smin - this.cs.start, smax + 1 - this.cs.start));\n }\n return awaitedSeq.provide(cachedSeq);\n }\n }\n\n this.seqSource.fetch(this.chr, smin, smax, this.pool, function (err, seq) {\n if (seq) {\n if (!thisB.cs || smin <= thisB.cs.start && smax >= thisB.cs.end || smin >= thisB.cs.end || smax <= thisB.cs.start || smax - smin > thisB.cs.end - thisB.cs.start) {\n thisB.cs = seq;\n }\n awaitedSeq.provide(seq);\n } else {\n console.log('Sequence loading failed', err);\n awaitedSeq.provide(null);\n }\n });\n }\n\n if (gex) throw gex;\n};\n\nKnownSpace.prototype.startFetchesFor = function (tier, awaitedSeq) {\n var thisB = this;\n\n var viewID = this.viewCount;\n var source = tier.getSource() || new DummyFeatureSource();\n var needsSeq = tier.needsSequence(this.scale);\n var baton = thisB.featureCache[tier];\n var styleFilters = tier.getActiveStyleFilters(this.scale);\n var wantedTypes;\n if (styleFilters) wantedTypes = styleFilters.typeList();\n var chr = this.chr,\n min = this.min,\n max = this.max;\n\n if (wantedTypes === undefined) {\n return false;\n }\n if (baton && baton.chr === this.chr && baton.min <= min && baton.max >= max) {\n var cachedFeatures = baton.features;\n if (baton.min < min || baton.max > max) {\n cachedFeatures = filterFeatures(cachedFeatures, min, max);\n }\n\n thisB.provision(tier, baton.chr, intersection(baton.coverage, new Range(min, max)), baton.scale, wantedTypes, cachedFeatures, baton.status, needsSeq ? awaitedSeq : null);\n\n var availableScales = source.getScales();\n\n if (baton.scale <= this.scale || !availableScales) {\n return needsSeq;\n }\n }\n\n if (source.instrument) console.log('Starting fetch ' + viewID + ' (' + min + ', ' + max + ')');\n\n source.fetch(chr, min, max, this.scale, wantedTypes, this.pool, function (status, features, scale, coverage) {\n if (source.instrument) console.log('Finishing fetch ' + viewID);\n\n var latestViewID = thisB.latestViews[tier] || -1;\n if (thisB.cancelled || latestViewID > viewID) {\n return;\n }\n\n if (!coverage) {\n coverage = new Range(min, max);\n }\n\n if (!baton || min < baton.min || max > baton.max) {\n // FIXME should be merging in some cases?\n thisB.featureCache[tier] = new KSCacheBaton(chr, min, max, scale, features, status, coverage);\n }\n\n thisB.latestViews[tier] = viewID;\n thisB.provision(tier, chr, coverage, scale, wantedTypes, features, status, needsSeq ? awaitedSeq : null);\n }, styleFilters);\n return needsSeq;\n};\n\nKnownSpace.prototype.provision = function (tier, chr, coverage, actualScale, wantedTypes, features, status, awaitedSeq) {\n var tierRenderer = tier.browser.getTierRenderer(tier);\n if (status) {\n tier.setFeatures(chr, coverage, actualScale, [], null);\n if (!features) {\n var e = new Error(status);\n status = \"Error fetching data: \" + status + \"; see browser console\";\n console.log(\"Error fetching data for tier \" + tier.dasSource.name + \":\");\n console.log(tier.dasSource);\n console.log(\"Stack trace:\");\n console.log(e.stack);\n }\n tierRenderer.renderTier(status, tier);\n tier.wasRendered();\n } else {\n var mayDownsample = false;\n var needBaseComposition = false;\n var src = tier.getSource();\n while (MappedFeatureSource.prototype.isPrototypeOf(src) || CachingFeatureSource.prototype.isPrototypeOf(src) || OverlayFeatureSource.prototype.isPrototypeOf(src)) {\n\n if (OverlayFeatureSource.prototype.isPrototypeOf(src)) {\n src = src.sources[0];\n } else {\n src = src.source;\n }\n }\n if (BWGFeatureSource.prototype.isPrototypeOf(src) || RemoteBWGFeatureSource.prototype.isPrototypeOf(src) || BAMFeatureSource.prototype.isPrototypeOf(src) || RemoteBAMFeatureSource.prototype.isPrototypeOf(src)) {\n\n mayDownsample = true;\n }\n\n if (!src.opts || !src.opts.forceReduction && !src.opts.noDownsample) {\n if ( /* (actualScale < (this.scale/2) && features.length > 200) || */\n mayDownsample && wantedTypes && wantedTypes.length == 1 && wantedTypes.indexOf('density') >= 0) {\n features = downsample(features, this.scale);\n }\n }\n\n if (wantedTypes && wantedTypes.length == 1 && wantedTypes.indexOf('base-coverage') >= 0) {\n // Base-composition coverage track\n needBaseComposition = true;\n }\n\n if (awaitedSeq) {\n awaitedSeq.await(function (seq) {\n if (needBaseComposition) {\n features = getBaseCoverage(features, seq, tier.browser.baseColors);\n }\n tier.setFeatures(chr, coverage, actualScale, features, seq);\n tierRenderer.renderTier(status, tier);\n tier.wasRendered();\n });\n } else {\n tier.setFeatures(chr, coverage, actualScale, features);\n tierRenderer.renderTier(status, tier);\n tier.wasRendered();\n }\n }\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n KnownSpace: KnownSpace\n };\n}\n\n},{\"./das\":10,\"./overlay\":31,\"./sample\":34,\"./sourceadapters\":39,\"./spans\":41,\"./utils\":56,\"es6-promise\":384}],26:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// lh3utils.js: common support for lh3's file formats\n//\n\nif (typeof require !== 'undefined') {\n var jszlib = require('jszlib');\n var jszlib_inflate_buffer = jszlib.inflateBuffer;\n var arrayCopy = jszlib.arrayCopy;\n}\n\nfunction Vob(b, o) {\n this.block = b;\n this.offset = o;\n}\n\nVob.prototype.toString = function () {\n return '' + this.block + ':' + this.offset;\n};\n\nfunction readVob(ba, offset, allowZero) {\n var block = (ba[offset + 6] & 0xff) * 0x100000000 + (ba[offset + 5] & 0xff) * 0x1000000 + (ba[offset + 4] & 0xff) * 0x10000 + (ba[offset + 3] & 0xff) * 0x100 + (ba[offset + 2] & 0xff);\n var bint = ba[offset + 1] << 8 | ba[offset];\n if (block == 0 && bint == 0 && !allowZero) {\n return null; // Should only happen in the linear index?\n } else {\n return new Vob(block, bint);\n }\n}\n\nfunction unbgzf(data, lim) {\n lim = Math.min(lim || 1, data.byteLength - 50);\n var oBlockList = [];\n var ptr = [0];\n var totalSize = 0;\n\n while (ptr[0] < lim) {\n var ba = new Uint8Array(data, ptr[0], 12); // FIXME is this enough for all credible BGZF block headers?\n var xlen = ba[11] << 8 | ba[10];\n // dlog('xlen[' + (ptr[0]) +']=' + xlen);\n var unc = jszlib_inflate_buffer(data, 12 + xlen + ptr[0], Math.min(65536, data.byteLength - 12 - xlen - ptr[0]), ptr);\n ptr[0] += 8;\n totalSize += unc.byteLength;\n oBlockList.push(unc);\n }\n\n if (oBlockList.length == 1) {\n return oBlockList[0];\n } else {\n var out = new Uint8Array(totalSize);\n var cursor = 0;\n for (var i = 0; i < oBlockList.length; ++i) {\n var b = new Uint8Array(oBlockList[i]);\n arrayCopy(b, 0, out, cursor, b.length);\n cursor += b.length;\n }\n return out.buffer;\n }\n}\n\nfunction Chunk(minv, maxv) {\n this.minv = minv;this.maxv = maxv;\n}\n\n//\n// Binning (transliterated from SAM1.3 spec)\n//\n\n/* calculate bin given an alignment covering [beg,end) (zero-based, half-close-half-open) */\nfunction reg2bin(beg, end) {\n --end;\n if (beg >> 14 == end >> 14) return ((1 << 15) - 1) / 7 + (beg >> 14);\n if (beg >> 17 == end >> 17) return ((1 << 12) - 1) / 7 + (beg >> 17);\n if (beg >> 20 == end >> 20) return ((1 << 9) - 1) / 7 + (beg >> 20);\n if (beg >> 23 == end >> 23) return ((1 << 6) - 1) / 7 + (beg >> 23);\n if (beg >> 26 == end >> 26) return ((1 << 3) - 1) / 7 + (beg >> 26);\n return 0;\n}\n\n/* calculate the list of bins that may overlap with region [beg,end) (zero-based) */\nvar MAX_BIN = ((1 << 18) - 1) / 7;\nfunction reg2bins(beg, end) {\n var i = 0,\n k,\n list = [];\n --end;\n list.push(0);\n for (k = 1 + (beg >> 26); k <= 1 + (end >> 26); ++k) {\n list.push(k);\n }for (k = 9 + (beg >> 23); k <= 9 + (end >> 23); ++k) {\n list.push(k);\n }for (k = 73 + (beg >> 20); k <= 73 + (end >> 20); ++k) {\n list.push(k);\n }for (k = 585 + (beg >> 17); k <= 585 + (end >> 17); ++k) {\n list.push(k);\n }for (k = 4681 + (beg >> 14); k <= 4681 + (end >> 14); ++k) {\n list.push(k);\n }return list;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n unbgzf: unbgzf,\n readVob: readVob,\n reg2bin: reg2bin,\n reg2bins: reg2bins,\n Chunk: Chunk\n };\n}\n\n},{\"jszlib\":385}],27:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// memstore.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var dalliance_makeParser = sa.makeParser;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n var textXHR = utils.textXHR;\n}\n\nfunction MemStore() {\n this.featuresByChr = {};\n this.maxLength = 1;\n this.chrRing = null;\n}\n\nMemStore.prototype.addFeatures = function (features) {\n var dirty = {};\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n var chr = f.segment || f.chr;\n var fa = this.featuresByChr[chr];\n if (!fa) {\n fa = [];\n this.featuresByChr[chr] = fa;\n }\n fa.push(f);\n dirty[chr] = true;\n\n var len = f.max - f.min + 1;\n if (len > this.maxLength) this.maxLength = len;\n }\n\n for (chr in dirty) {\n var fa = this.featuresByChr[chr];\n fa.sort(function (f1, f2) {\n var d = f1.min - f2.min;\n if (d != 0) return d;\n return f1.max - f2.max;\n });\n }\n this.chrRing = null;\n};\n\nMemStore.prototype._indexFor = function (fa, p) {\n var lb = 0,\n ub = fa.length;\n while (ub > lb) {\n var mid = (lb + ub) / 2 | 0;\n if (mid >= fa.length) return fa.length;\n var mg = fa[mid];\n if (p < mg.min) {\n ub = mid;\n } else {\n lb = mid + 1;\n }\n }\n return ub;\n};\n\nMemStore.prototype.fetch = function (chr, min, max) {\n var fa = this.featuresByChr[chr];\n if (!fa) {\n if (chr.indexOf('chr') == 0) fa = this.featuresByChr[chr.substring(3)];else fa = this.featuresByChr['chr' + chr];\n }\n if (!fa) return [];\n\n var mini = Math.max(0, this._indexFor(fa, min - this.maxLength - 1));\n var maxi = Math.min(fa.length - 1, this._indexFor(fa, max));\n\n var res = [];\n for (var fi = mini; fi <= maxi; ++fi) {\n var f = fa[fi];\n if (f.min <= max && f.max >= min) res.push(f);\n }\n return res;\n};\n\nMemStore.prototype.findNextFeature = function (chr, pos, dir) {\n if (this.chrRing == null) {\n this.chrRing = [];\n for (var chr in this.featuresByChr) {\n this.chrRing.push(chr);\n }\n this.chrRing.sort();\n }\n\n var fa = this.featuresByChr[chr];\n if (!fa) {\n if (chr.indexOf('chr') == 0) {\n chr = chr.substring(3);\n fa = this.featuresByChr[chr];\n } else {\n chr = 'chr' + chr;\n fa = this.featuresByChr[chr];\n }\n }\n if (!fa) return null;\n\n var i = Math.max(0, Math.min(this._indexFor(fa, pos), fa.length - 1));\n if (dir > 0) {\n while (i < fa.length) {\n var f = fa[i++];\n if (f.min > pos) return f;\n }\n var chrInd = this.chrRing.indexOf(chr) + 1;\n if (chrInd >= this.chrRing.length) chrInd = 0;\n return this.findNextFeature(this.chrRing[chrInd], 0, dir);\n } else {\n while (i >= 0) {\n var f = fa[i--];\n if (f.max < pos) return f;\n }\n var chrInd = this.chrRing.indexOf(chr) - 1;\n if (chrInd < 0) chrInd = this.chrRing.length - 1;\n return this.findNextFeature(this.chrRing[chrInd], 10000000000, dir);\n }\n};\n\nfunction MemStoreFeatureSource(source) {\n this.source = source;\n FeatureSourceBase.call(this);\n this.storeHolder = new Awaited();\n this.parser = dalliance_makeParser(source.payload);\n if (!this.parser) {\n throw \"Unsupported memstore payload: \" + source.payload;\n }\n\n var thisB = this;\n this._load(function (resp, err) {\n if (err) {\n thisB.error = err;\n thisB.storeHolder.provide(null);\n } else {\n var store = new MemStore();\n var features = [];\n var lines = resp.split('\\n');\n\n var session = thisB.parser.createSession(function (f) {\n features.push(f);\n });\n for (var li = 0; li < lines.length; ++li) {\n var line = lines[li];\n if (line.length > 0) {\n session.parse(line);\n }\n }\n session.flush();\n\n store.addFeatures(features);\n\n thisB.storeHolder.provide(store);\n }\n });\n}\n\nMemStoreFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nMemStoreFeatureSource.prototype._load = function (callback) {\n if (this.source.blob) {\n var r = new FileReader();\n r.onloadend = function () {\n return callback(r.result, r.error);\n };\n r.readAsText(this.source.blob);\n } else {\n if (this.source.credentials) var opts = { credentials: this.source.credentials };\n textXHR(this.source.uri, callback, opts);\n }\n};\n\nMemStoreFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, cnt) {\n var thisB = this;\n this.storeHolder.await(function (store) {\n if (store) {\n var f = store.fetch(chr, min, max);\n return cnt(null, f, 100000000);\n } else {\n return cnt(thisB.error);\n }\n });\n};\n\nMemStoreFeatureSource.prototype.getStyleSheet = function (callback) {\n if (this.parser && this.parser.getStyleSheet) this.parser.getStyleSheet(callback);\n};\n\nMemStoreFeatureSource.prototype.getDefaultFIPs = function (callback) {\n if (this.parser && this.parser.getDefaultFIPs) this.parser.getDefaultFIPs(callback);\n};\n\nMemStoreFeatureSource.prototype.getScales = function () {\n return 100000000;\n};\n\nMemStoreFeatureSource.prototype.findNextFeature = function (chr, pos, dir, callback) {\n var thisB = this;\n this.storeHolder.await(function (store) {\n if (store) {\n return callback(store.findNextFeature(chr, pos, dir));\n } else {\n return callback(null, thisB.error);\n }\n });\n};\n\nMemStoreFeatureSource.prototype.capabilities = function () {\n var caps = { leap: true };\n return caps;\n};\n\ndalliance_registerSourceAdapterFactory('memstore', function (source) {\n return { features: new MemStoreFeatureSource(source) };\n});\n\n},{\"./das\":10,\"./sourceadapters\":39,\"./utils\":56}],28:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// Molgenisjson.js -- query the Molgenis REST API.\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n}\n\nfunction MolgenisFeatureSource(source) {\n FeatureSourceBase.call(this);\n this.source = source;\n if (source.uri) {\n this.base = source.uri;\n } else if (source.entity) {\n this.base = window.location.origin + '/api/v2/' + source.entity + '?' + Math.random();\n } else {\n throw new Error(\"Bad molgenis track configuration: please specify 'genome_attrs.chr' and 'genome_attrs.pos'\");\n }\n\n this.species = source.species || 'human';\n\n if (typeof source.type === 'string') {\n this.type = [source.type];\n } else {\n this.type = source.type || ['regulatory'];\n }\n}\n\nMolgenisFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\nMolgenisFeatureSource.prototype.constructor = MolgenisFeatureSource;\n\nMolgenisFeatureSource.prototype.getStyleSheet = function (callback) {\n var stylesheet = new DASStylesheet();\n\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'A';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'green';\n stylesheet.pushStyle({ type: 'variant', method: 'A' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'C';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({ type: 'variant', method: 'C' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'G';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'orange';\n stylesheet.pushStyle({ type: 'variant', method: 'G' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'T';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({ type: 'variant', method: 'T' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = '?';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'darkgrey';\n stylesheet.pushStyle({ type: 'variant', method: 'unknown' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'DOT';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'purple';\n stylesheet.pushStyle({ type: 'indel' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'STAR';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'black';\n stylesheet.pushStyle({ type: 'variant', method: 'multiple' }, null, varStyle);\n }\n {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'blue';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = false;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n }\n {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'red';\n wigStyle.BGCOLOR = 'red';\n wigStyle.HEIGHT = 8;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'exon', method: 'exon' }, null, wigStyle);\n }\n {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'white';\n wigStyle.BGCOLOR = 'white';\n wigStyle.HEIGHT = 8;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'exon', method: 'intron' }, null, wigStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'HISTOGRAM';\n varStyle.BGCOLOR = 'blue';\n varStyle.HEIGHT = 50;\n stylesheet.pushStyle({ type: 'numeric' }, null, varStyle);\n }\n\n return callback(stylesheet);\n};\n\nMolgenisFeatureSource.prototype.getScales = function () {\n return [];\n};\n\nMolgenisFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n var source = this.source;\n\n if (!source.genome_attrs.chr || !source.genome_attrs.pos) {\n throw new Error(\"Bad molgenis track configuration: please specify 'genome_attrs.chr' and 'genome_attrs.pos'\");\n }\n\n var url = this.base;\n\n if (source.attrs) {\n var attributes = [];\n for (var index = 0; index < source.attrs.length; ++index) {\n var attr = source.attrs[index];\n var attrArray = attr.split(\":\");\n attributes.push(attrArray[0]);\n }\n if (attributes[source.genome_attrs.chr] === undefined) {\n attributes.push(source.genome_attrs.chr);\n }\n if (attributes[source.genome_attrs.pos] === undefined) {\n attributes.push(source.genome_attrs.pos);\n }\n if (attributes[source.genome_attrs.alt] === undefined) {\n if (source.genome_attrs.alt) {\n attributes.push(source.genome_attrs.alt);\n }\n }\n if (attributes[source.genome_attrs.ref] === undefined) {\n if (source.genome_attrs.ref) {\n attributes.push(source.genome_attrs.ref);\n }\n }\n if (attributes[source.genome_attrs.stop] === undefined) {\n if (source.genome_attrs.stop) {\n attributes.push(source.genome_attrs.stop);\n }\n }\n url += '&attrs=' + encodeURIComponent(attributes);\n }\n\n if (source.genome_attrs.stop) {\n url += '&q=' + encodeURIComponent(source.genome_attrs.chr) + '==' + chr + ';(' + source.genome_attrs.pos + '=ge=' + min + ';' + source.genome_attrs.pos + '=le=' + max + ',' + source.genome_attrs.stop + '=ge=' + min + ';' + source.genome_attrs.stop + '=le=' + max + ')';\n } else {\n url += '&q=' + encodeURIComponent(source.genome_attrs.chr) + '==' + chr + ';' + source.genome_attrs.pos + '=ge=' + min + ';' + source.genome_attrs.pos + '=le=' + max;\n }\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n thisB.busy--;\n thisB.notifyActivity();\n\n if (req.status >= 300) {\n var err = 'Error code ' + req.status;\n try {\n var jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } catch (ex) {};\n\n callback(err, null);\n } else {\n var jf = JSON.parse(req.response);\n var items = jf.items;\n var features = [];\n for (var fi = 0; fi < items.length; ++fi) {\n var entity = items[fi];\n var notes = [];\n var feature = new DASFeature();\n feature.segment = chr;\n feature.min = entity[source.genome_attrs.pos] | 0;\n if (source.genome_attrs.stop) {\n feature.max = entity[source.genome_attrs.stop] | 0;\n } else {\n feature.max = entity[source.genome_attrs.pos] | 0;\n }\n\n feature.type = entity.feature_type || 'unknown';\n var identifier;\n if (source.label_attr) {\n identifier = source.label_attr;\n } else {\n identifier = \"ID\";\n }\n feature.id = entity[identifier];\n\n //add attrs to notes for use in popup\n if (source.attrs) {\n for (var index = 0; index < source.attrs.length; ++index) {\n var attr = source.attrs[index];\n var attrArray = attr.split(\":\");\n\n var label = attrArray[1];\n var value = entity[attrArray[0]];\n\n notes.push(label + '=' + value);\n }\n }\n if (source.actions) {\n feature.actions = eval(source.actions);\n feature.entity = entity;\n }\n\n if (notes.length > 0) {\n feature.notes = notes;\n }\n\n if (source.track_type === \"NUMERIC\") {\n feature.score = entity[source.score_attr];\n }\n\n setStyleProperties(entity, feature, source);\n feature.molgenis = true;\n features.push(feature);\n }\n callback(null, features);\n }\n }\n };\n\n thisB.busy++;\n thisB.notifyActivity();\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send('');\n};\n\nfunction setStyleProperties(entity, feature, source) {\n\n var type = source.track_type;\n var altAttr = source.genome_attrs.alt;\n var refAttr = source.genome_attrs.ref;\n if (type === \"NUMERIC\") {\n feature.type = \"numeric\";\n return;\n }\n if (type === \"EXON\") {\n var labelAttr = source.label_attr;\n if (entity[labelAttr].search(source.exon_key) != -1) {\n feature.type = \"exon\";\n feature.method = \"exon\";\n return;\n } else {\n feature.type = \"exon\";\n feature.method = \"intron\";\n return;\n }\n } else if (altAttr && entity[altAttr] && refAttr && entity[refAttr]) {\n if (entity[altAttr].length > 1 || entity[refAttr].length > 1) {\n feature.type = \"indel\";\n return;\n } else if (entity[altAttr] === 'A') {\n feature.type = \"variant\";\n feature.method = \"A\";\n return;\n } else if (entity[altAttr] === 'T') {\n feature.type = \"variant\";\n feature.method = \"T\";\n return;\n } else if (entity[altAttr] === 'G') {\n feature.type = \"variant\";\n feature.method = \"G\";\n return;\n } else if (entity[altAttr] === 'C') {\n feature.type = \"variant\";\n feature.method = \"C\";\n return;\n } else if (entity[altAttr].search(',') != -1) {\n feature.type = \"variant\";\n feature.method = \"multiple\";\n return;\n } else {\n feature.type = \"variant\";\n feature.method = \"unknown\";\n return;\n }\n } else {\n feature.type = \"default\";\n return;\n }\n}\n\ndalliance_registerSourceAdapterFactory('molgenis', function (source) {\n return { features: new MolgenisFeatureSource(source) };\n});\n\n},{\"./das\":10,\"./sourceadapters\":39}],29:[function(require,module,exports){\n/* jshint esversion: 6 */\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.drawTier = exports.renderTier = undefined;\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nvar _sequenceDraw = require(\"./sequence-draw.js\");\n\nvar _glyphs = require(\"./glyphs.js\");\n\nvar _defaultRenderer = require(\"./default-renderer\");\n\nvar DefaultRenderer = _interopRequireWildcard(_defaultRenderer);\n\nvar _ramda = require(\"ramda\");\n\nvar R = _interopRequireWildcard(_ramda);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nexports.renderTier = renderTier;\nexports.drawTier = drawTier;\n\n/* Renders multiple tiers in a single track.\n Works by simply drawing several tiers to a single canvas.\n Actual rendering is done using default-renderer.es6.\n A multi-tier renderer is configured by adding the following to a tier's\n configuration:\n renderer: 'multi',\n multi: {\n multi_id: \"multi_1\",\n }\n\n All subtiers with the \"multi_1\" multi_id will be drawn to this tier's canvas.\n */\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\nfunction drawTier(multiTier) {\n var multiConfig = multiTier.dasSource.multi;\n var getSubConfig = function getSubConfig(t) {\n return t.dasSource.sub;\n };\n\n // Padding is used for finding the correct canvas size and must be set\n if (!multiTier.padding) multiTier.padding = 3;\n\n var canvas = multiTier.viewport.getContext(\"2d\");\n var retina = multiTier.browser.retina && window.devicePixelRatio > 1;\n if (retina) {\n canvas.scale(2, 2);\n }\n\n // Filter out only tiers that are to be drawn in this multitier,\n // and also have fetched data.\n var tiers = multiTier.browser.tiers.filter(function (tier) {\n return _typeof(getSubConfig(tier)) === \"object\" && getSubConfig(tier).multi_id === multiConfig.multi_id && (tier.currentFeatures || tier.currentSequence);\n });\n\n // The shortest distance from the top of the canvas to a subtier\n var minOffset = R.pipe(R.map(function (tier) {\n return tier.dasSource.sub.offset;\n }), R.reduce(function (acc, offset) {\n return offset < acc ? offset : acc;\n }, 0))(tiers);\n\n tiers.forEach(function (tier) {\n if (tier.sequenceSource) {\n (0, _sequenceDraw.drawSeqTier)(tier, tier.currentSequence);\n } else {\n // Shift subtiers up by the minimum offset,\n // so that there's no empty space at the top\n DefaultRenderer.prepareSubtiers(tier, canvas, getSubConfig(tier).offset - minOffset, false);\n }\n\n // Must be set for painting to work\n if (!multiTier.glyphCacheOrigin) multiTier.glyphCacheOrigin = tier.glyphCacheOrigin;\n });\n\n // The canvas should fit all subtiers, including offsets, but no more\n var canvasHeight = R.pipe(R.map(function (tier) {\n return R.map(function (subtier) {\n return subtier.height + getSubConfig(tier).offset;\n }, tier.subtiers);\n }), R.flatten, R.reduce(function (acc, h) {\n return h > acc ? h : acc;\n }, -Infinity), R.add(-minOffset))(tiers);\n\n prepareViewport(multiTier, canvas, retina, canvasHeight, true);\n\n tiers.sort(function (t1, t2) {\n return getSubConfig(t1).z > getSubConfig(t2).z;\n });\n\n // TODO: make it add the glyph on to the first available tier;\n // crashes if last tier is empty...\n if (multiConfig.grid && tiers && tiers[tiers.length - 1] && tiers[tiers.length - 1].subtiers[0]) {\n var grid = new _glyphs.GridGlyph(canvasHeight, multiConfig.grid_offset, multiConfig.grid_spacing);\n // pretty hacky way of adding the grid, but it works (mostly)\n tiers[tiers.length - 1].subtiers[0].glyphs.unshift(grid);\n }\n\n tiers.forEach(function (tier) {\n // Need to save and restore canvas to make sure that the subtiers are\n // drawn on top of one another, if not shifted...\n canvas.save();\n DefaultRenderer.paint(tier, canvas, retina, true);\n canvas.restore();\n });\n\n multiTier.drawOverlay();\n\n if (multiConfig.quant) {\n var quantCanvas = DefaultRenderer.createQuantOverlay(multiTier, canvasHeight + multiTier.padding * 2, retina);\n DefaultRenderer.paintQuant(quantCanvas, multiTier, multiConfig.quant, 10);\n }\n\n if (typeof multiTier.dasSource.drawCallback === \"function\") {\n multiTier.dasSource.drawCallback(canvas, multiTier);\n }\n\n multiTier.originHaxx = 0;\n multiTier.browser.arrangeTiers();\n}\n\nfunction prepareViewport(tier, canvas, retina, canvasHeight) {\n var clear = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;\n\n var desiredWidth = tier.browser.featurePanelWidth + 2000;\n if (retina) {\n desiredWidth *= 2;\n }\n\n var fpw = tier.viewport.width | 0;\n if (fpw < desiredWidth - 50) {\n tier.viewport.width = fpw = desiredWidth;\n }\n\n canvasHeight += 2 * tier.padding;\n canvasHeight = Math.max(canvasHeight, tier.browser.minTierHeight);\n\n if (canvasHeight != tier.viewport.height) {\n tier.viewport.height = canvasHeight;\n\n if (retina) {\n tier.viewport.height *= 2;\n }\n }\n\n tier.viewportHolder.style.left = '-1000px';\n tier.viewport.style.width = retina ? '' + fpw / 2 + 'px' : '' + fpw + 'px';\n tier.viewport.style.height = '' + canvasHeight + 'px';\n tier.layoutHeight = Math.max(canvasHeight, tier.browser.minTierHeight);\n\n tier.updateHeight();\n tier.norigin = tier.browser.viewStart;\n\n if (clear) {\n DefaultRenderer.clearViewport(canvas, fpw, canvasHeight);\n }\n\n DefaultRenderer.drawUnmapped(tier, canvas, canvasHeight);\n}\n\n},{\"./default-renderer\":11,\"./glyphs.js\":23,\"./sequence-draw.js\":36,\"ramda\":387}],30:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// memstore.js\n//\n\nfunction formatLongInt(n) {\n return (n | 0).toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, ',');\n}\n\nfunction formatQuantLabel(v) {\n var t = '' + v;\n var dot = t.indexOf('.');\n if (dot < 0) {\n return t;\n } else {\n var dotThreshold = 2;\n if (t.substring(0, 1) == '-') {\n ++dotThreshold;\n }\n\n if (dot >= dotThreshold) {\n return t.substring(0, dot);\n } else {\n return t.substring(0, dot + 2);\n }\n }\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n formatLongInt: formatLongInt,\n formatQuantLabel: formatQuantLabel\n };\n}\n\n},{}],31:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// overlay.js: featuresources composed from multiple underlying sources\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n var arrayIndexOf = utils.arrayIndexOf;\n}\n\nfunction OverlayFeatureSource(sources, opts) {\n this.sources = sources;\n this.opts = opts || {};\n this.activityListeners = [];\n this.readinessListeners = [];\n this.changeListeners = [];\n this.business = [];\n this.readiness = [];\n\n for (var i = 0; i < this.sources.length; ++i) {\n this.initN(i);\n }\n\n if (typeof opts.merge === 'function') {\n this.merge = opts.merge;\n } else if (opts.merge == 'concat') {\n this.merge = OverlayFeatureSource_merge_concat;\n } else if (opts.merge == 'alternates') {\n this.merge = OverlayFeatureSource_merge_concat;\n this.filterDispatchOnMethod = true;\n } else {\n this.merge = OverlayFeatureSource_merge_byKey;\n }\n}\n\nOverlayFeatureSource.prototype.initN = function (n) {\n var s = this.sources[n];\n var thisB = this;\n this.business[n] = 0;\n\n if (s.addActivityListener) {\n s.addActivityListener(function (b) {\n thisB.business[n] = b;\n thisB.notifyActivity();\n });\n }\n if (s.addChangeListener) {\n s.addChangeListener(function () {\n thisB.notifyChange();\n });\n }\n if (s.addReadinessListener) {\n s.addReadinessListener(function (r) {\n thisB.readiness[n] = r;\n thisB.notifyReadiness();\n });\n }\n};\n\nOverlayFeatureSource.prototype.addReadinessListener = function (l) {\n this.readinessListeners.push(l);\n this.notifyReadinessListener(l);\n};\n\nOverlayFeatureSource.prototype.removeReadinessListener = function (l) {\n var idx = arrayIndexOf(this.readinessListeners, l);\n if (idx >= 0) {\n this.readinessListeners.splice(idx, 1);\n }\n};\n\nOverlayFeatureSource.prototype.notifyReadiness = function () {\n for (var i = 0; i < this.readinessListeners.length; ++i) {\n this.notifyReadinessListener(this.readinessListeners[i]);\n }\n};\n\nOverlayFeatureSource.prototype.notifyReadinessListener = function (l) {\n var r = null;\n for (var i = 0; i < this.readiness.length; ++i) {\n if (this.readiness[i] != null) {\n r = this.readiness[i];break;\n }\n }\n try {\n l(r);\n } catch (e) {\n console.log(e);\n }\n};\n\nOverlayFeatureSource.prototype.addActivityListener = function (l) {\n this.activityListeners.push(l);\n};\n\nOverlayFeatureSource.prototype.removeActivityListener = function (l) {\n var idx = arrayIndexOf(this.activityListeners, l);\n if (idx >= 0) {\n this.activityListeners.splice(idx, 1);\n }\n};\n\nOverlayFeatureSource.prototype.notifyActivity = function () {\n var busy = 0;\n for (var i = 0; i < this.business.length; ++i) {\n busy += this.business[i];\n }\n\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nOverlayFeatureSource.prototype.addChangeListener = function (listener) {\n this.changeListeners.push(listener);\n};\n\nOverlayFeatureSource.prototype.removeChangeListener = function (l) {\n var idx = arrayIndexOf(this.changeListeners, l);\n if (idx >= 0) {\n this.changeListeners.splice(idx, 1);\n }\n};\n\nOverlayFeatureSource.prototype.notifyChange = function () {\n for (var li = 0; li < this.changeListeners.length; ++li) {\n try {\n this.changeListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nOverlayFeatureSource.prototype.getScales = function () {\n return this.sources[0].getScales();\n};\n\nOverlayFeatureSource.prototype.getStyleSheet = function (callback) {\n return this.sources[0].getStyleSheet(callback);\n};\n\nOverlayFeatureSource.prototype.capabilities = function () {\n var caps = {};\n var s0 = this.sources[0];\n if (s0.capabilities) caps = shallowCopy(s0.capabilities());\n\n for (var i = 1; i < this.sources.length; ++i) {\n var si = this.sources[i];\n if (si.capabilities) {\n var co = si.capabilities();\n if (co.search) {\n caps.search = co.search;\n }\n }\n }\n\n return caps;\n};\n\nOverlayFeatureSource.prototype.search = function (query, callback) {\n for (var i = 0; i < this.sources.length; ++i) {\n if (_sourceAdapterIsCapable(this.sources[i], 'search')) {\n return this.sources[i].search(query, callback);\n }\n }\n};\n\nOverlayFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback, styleFilters) {\n var sources;\n if (this.filterDispatchOnMethod) {\n sources = [];\n var sfl = styleFilters.list();\n for (var si = 0; si < this.sources.length; ++si) {\n var source = this.sources[si];\n for (var fi = 0; fi < sfl.length; ++fi) {\n var filter = sfl[fi];\n if (!filter.method || filter.method == source.name) {\n sources.push(source);\n break;\n }\n }\n }\n } else {\n sources = this.sources;\n }\n\n var baton = new OverlayBaton(this, callback, sources);\n for (var si = 0; si < sources.length; ++si) {\n this.fetchN(baton, si, sources[si], chr, min, max, scale, types, pool, styleFilters);\n }\n};\n\nOverlayFeatureSource.prototype.fetchN = function (baton, si, source, chr, min, max, scale, types, pool, styleFilters) {\n // FIXME should we try to prune styleFilters?\n source.fetch(chr, min, max, scale, types, pool, function (status, features, scale) {\n return baton.completed(si, status, features, scale);\n }, styleFilters);\n};\n\nOverlayFeatureSource.prototype.quantFindNextFeature = function (chr, pos, dir, threshold, callback) {\n return this.sources[0].quantFindNextFeature(chr, pos, dir, threshold, callback);\n};\n\nOverlayFeatureSource.prototype.findNextFeature = function (chr, pos, dir, callback) {\n return this.sources[0].findNextFeature(chr, pos, dir, callback);\n};\n\nfunction OverlayBaton(source, callback, sources) {\n this.source = source;\n this.callback = callback;\n this.sources = sources;\n this.count = sources.length;\n\n this.returnCount = 0;\n this.statusCount = 0;\n this.returns = [];\n this.features = [];\n this.statuses = [];\n this.scale = null;\n}\n\nOverlayBaton.prototype.completed = function (index, status, features, scale) {\n if (this.scale == null || index == 0) this.scale = scale;\n\n if (this.returns[index]) throw 'Multiple returns for source ' + index;\n\n this.returns[index] = true;\n this.returnCount++;\n\n this.features[index] = features;\n\n if (status) {\n this.statuses[index] = status;\n this.statusCount++;\n }\n\n if (this.returnCount == this.count) {\n if (this.statusCount > 0) {\n var message = '';\n for (var si = 0; si < this.count; ++si) {\n var s = this.statuses[si];\n if (s) {\n if (message.length > 0) message += ', ';\n message += s;\n }\n }\n return this.callback(message, null, this.scale);\n } else {\n this.callback(null, this.source.merge(this.features, this.sources), this.scale);\n }\n }\n};\n\nOverlayFeatureSource.prototype.getDefaultFIPs = function (callback) {\n for (var si = 0; si < this.sources.length; ++si) {\n var s = this.sources[si];\n if (s.getDefaultFIPs) s.getDefaultFIPs(callback);\n }\n};\n\nOverlayFeatureSource.prototype.keyForFeature = function (feature) {\n return '' + feature.min + '..' + feature.max;\n};\n\nfunction OverlayFeatureSource_merge_byKey(featureSets) {\n var omaps = [];\n\n for (var fsi = 1; fsi < featureSets.length; ++fsi) {\n var om = {};\n var of = featureSets[fsi];\n for (var fi = 0; fi < of.length; ++fi) {\n om[this.keyForFeature(of[fi])] = of[fi];\n }\n omaps.push(om);\n }\n\n var mf = [];\n var fl = featureSets[0];\n for (var fi = 0; fi < fl.length; ++fi) {\n var f = fl[fi];\n\n for (var oi = 0; oi < omaps.length; ++oi) {\n var om = omaps[oi];\n of = om[this.keyForFeature(f)];\n if (of) {\n for (var k in of) {\n if (k === 'score') {\n f.score2 = of.score;\n } else if (k === 'min' || k === 'max' || k === 'segment' || k === '_cachedStyle') {\n // do nothing\n } else {\n f[k] = of[k];\n }\n }\n }\n }\n mf.push(f);\n }\n return mf;\n}\n\nfunction OverlayFeatureSource_merge_concat(featureSets, sources) {\n var features = [];\n for (var fsi = 0; fsi < featureSets.length; ++fsi) {\n var fs = featureSets[fsi];\n var name = sources[fsi].name;\n for (var fi = 0; fi < fs.length; ++fi) {\n var f = fs[fi];\n f.method = name;\n features.push(f);\n }\n }\n return features;\n}\n\nfunction _sourceAdapterIsCapable(s, cap) {\n if (!s.capabilities) return false;else return s.capabilities()[cap];\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n OverlayFeatureSource: OverlayFeatureSource\n };\n}\n\n},{\"./utils\":56}],32:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// bedwig.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n var readInt = bin.readInt;\n\n var bbi = require('./bigwig');\n var BIG_WIG_MAGIC = bbi.BIG_WIG_MAGIC;\n var BIG_BED_MAGIC = bbi.BIG_BED_MAGIC;\n\n var lh3utils = require('./lh3utils');\n var unbgzf = lh3utils.unbgzf;\n\n var bam = require('./bam');\n var BAM_MAGIC = bam.BAM_MAGIC;\n var BAI_MAGIC = bam.BAI_MAGIC;\n\n var tbi = require('./tabix');\n var TABIX_MAGIC = tbi.TABIX_MAGIC;\n\n var EncodeFetchable = require('./encode').EncodeFetchable;\n}\n\nfunction probeResource(source, listener, retry) {\n var BED_REGEXP = new RegExp('^\\\\w+\\\\s[0-9]+\\\\s[0-9]+.*$');\n var KV_REGEXP = /([^=]+)=\\\"?([^\\\"]+)\\\"?/;\n var VCFHEAD_RE = /^##\\s*fileformat=VCFv4\\..+/;\n\n var fetchable;\n if (source.blob) fetchable = new BlobFetchable(source.blob);else if (source.transport == 'encode') fetchable = new EncodeFetchable(source.uri);else fetchable = new URLFetchable(source.uri, { credentials: source.credentials });\n\n fetchable.slice(0, 1 << 16).salted().fetch(function (result, error) {\n if (!result) {\n if (!retry) {\n source.credentials = true;\n probeResource(source, listener, true);\n }\n\n return listener(source, \"Couldn't fetch data\");\n }\n\n var ba = new Uint8Array(result);\n var la = new Uint32Array(result, 0, 1);\n var magic = la[0];\n if (magic == BIG_WIG_MAGIC || magic == BIG_BED_MAGIC) {\n source.tier_type = 'bwg';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.bw|.bb|.bigWig|.bigBed)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n source.name = match[1];\n }\n\n return listener(source, null);\n } else if (magic == BAI_MAGIC) {\n source.tier_type = 'bai';\n return listener(source, null);\n } else if (ba[0] == 31 || ba[1] == 139) {\n var unc = unbgzf(result);\n var uncba = new Uint8Array(unc);\n magic = readInt(uncba, 0);\n if (magic == BAM_MAGIC) {\n source.tier_type = 'bam';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.bam)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n source.name = match[1];\n }\n\n return listener(source, null);\n } else if (magic == TABIX_MAGIC) {\n source.tier_type = 'tabix-index';\n return listener(source, null);\n } else if (magic == 0x69662323) {\n source.tier_type = 'tabix';\n source.payload = 'vcf';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.vcf)?(.gz)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n source.name = match[1];\n }\n\n return listener(source, null);\n } else {\n console.log('magic = ' + magic.toString(16));\n return listener(source, \"Unsupported format\");\n }\n } else {\n var text = String.fromCharCode.apply(null, ba);\n var lines = text.split(\"\\n\");\n\n if (lines.length > 0 && VCFHEAD_RE.test(lines[0])) {\n source.tier_type = 'memstore';\n source.payload = 'vcf';\n var nameExtractPattern = new RegExp('/?([^/]+?)(\\.vcf)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match && !source.name) {\n source.name = match[1];\n }\n return listener(source, null);\n }\n\n for (var li = 0; li < lines.length; ++li) {\n var line = lines[li].replace('\\r', '');\n if (line.length == 0) continue;\n\n if (line.indexOf('browser') == 0) continue;\n\n if (line.indexOf('track') == 0) {\n var maybeType = 'bed';\n var toks = line.split(/\\s/);\n for (var ti = 1; ti < toks.length; ++ti) {\n var m = KV_REGEXP.exec(toks[ti]);\n if (m) {\n if (m[1] == 'type' && m[2] == 'wiggle_0') {\n maybeType = 'wig';\n } else if (m[0] == 'name') {\n source.name = m[2];\n }\n }\n }\n\n finishProbeBedWig(source, maybeType);\n return listener(source, null);\n }\n\n if (line.indexOf('fixedStep') == 0) {\n finishProbeBedWig(source, 'wig');\n return listener(source, null);\n }\n\n if (line.indexOf('variableStep') == 0) {\n finishProbeBedWig(source, 'wig');\n return listener(source, null);\n }\n\n if (BED_REGEXP.test(line)) {\n finishProbeBedWig(source, null);\n return listener(source, null);\n }\n\n break;\n }\n\n return listener(source, \"Unsupported format\");\n }\n }, { timeout: 1500 }); // Timeout to catch mixed-origin case on Chromium.\n}\n\nfunction finishProbeBedWig(source, maybeType) {\n source.tier_type = 'memstore';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.(bed|wig))?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n if (!source.name) source.name = match[1];\n if (!maybeType && match[3]) {\n maybeType = match[3];\n }\n }\n source.payload = maybeType || 'bed';\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n probeResource: probeResource\n };\n}\n\n},{\"./bam\":1,\"./bigwig\":3,\"./bin\":4,\"./encode\":14,\"./lh3utils\":26,\"./tabix\":47}],33:[function(require,module,exports){\n/* jshint esversion: 6 */\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.Ruler = Ruler;\nexports.rulerDrawCallback = rulerDrawCallback;\n\n\nfunction Ruler(options) {\n var self = this;\n\n self.value = options.value;\n self.min = options.min;\n self.max = options.max;\n self.width = options.width;\n self.color = options.color;\n\n Object.keys(self).map(function (key) {\n if (self[key] === undefined) {\n console.log(\"WARNING: Ruler option \" + key + \" not set\");\n }\n });\n}\n\nRuler.prototype.constructor = Ruler;\n\nfunction rulerDrawCallback(canvas, tier) {\n var rulers = tier.dasSource.rulers;\n\n if (!rulers) {\n console.log(\"Tier uses ruler callback but has no rulers!\");\n } else if (!(rulers instanceof Array)) {\n console.log(\"rulers.js: 'rulers' should be an Array\");\n }\n\n rulers.map(function (r) {\n var rulerY = (r.max - r.value) * r.height;\n var viewWidth = tier.viewport.width;\n var oldLineWidth = canvas.lineWidth;\n\n canvas.strokeStyle = r.color;\n canvas.beginPath();\n canvas.moveTo(-viewWidth, rulerY + r.offset);\n // Other parts of the code rely on not having changed the lineWidth...\n // So we need to change it back when we're done.\n canvas.lineWidth = r.width;\n canvas.lineTo(2 * viewWidth, rulerY + r.offset);\n canvas.stroke();\n canvas.lineWidth = oldLineWidth;\n });\n}\n\n},{}],34:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// sample.js: downsampling of quantitative features\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var das = require('./das');\n var DASFeature = das.DASFeature;\n\n var parseCigar = require('./cigar').parseCigar;\n\n var shallowCopy = require('./utils').shallowCopy;\n}\n\nvar __DS_SCALES = [1, 2, 5];\n\nfunction ds_scale(n) {\n return __DS_SCALES[n % __DS_SCALES.length] * Math.pow(10, n / __DS_SCALES.length | 0);\n}\n\nfunction DSBin(scale, min, max) {\n this.scale = scale;\n this.tot = 0;\n this.cnt = 0;\n this.hasScore = false;\n this.min = min;this.max = max;\n this.features = [];\n}\n\nfunction _featureOrder(a, b) {\n if (a.min < b.min) {\n return -1;\n } else if (a.min > b.min) {\n return 1;\n } else if (a.max < b.max) {\n return -1;\n } else if (b.max > a.max) {\n return 1;\n } else {\n return 0;\n }\n}\n\nDSBin.prototype.score = function () {\n if (this.cnt == 0) {\n return 0;\n } else if (this.hasScore) {\n return this.tot / this.cnt;\n } else {\n var features = this.features;\n features.sort(_featureOrder);\n\n var maxSeen = -10000000000;\n var cov = 0,\n lap = 0;\n\n for (var fi = 1; fi < features.length; ++fi) {\n var f = features[fi];\n var lMin = Math.max(f.min, this.min);\n var lMax = Math.min(f.max, this.max);\n lap += lMax - lMin + 1;\n\n if (lMin > maxSeen) {\n cov += lMax - lMin + 1;\n maxSeen = lMax;\n } else {\n if (lMax > maxSeen) {\n cov += lMax - maxSeen;\n maxSeen = lMax;\n }\n }\n }\n\n if (cov > 0) return 1.0 * lap / cov;else return 0;\n }\n};\n\nDSBin.prototype.feature = function (f) {\n if (f.score !== undefined) {\n this.tot += f.score;\n this.hasScore = true;\n }\n\n ++this.cnt;\n this.features.push(f);\n};\n\nfunction downsample(features, targetRez) {\n var sn = 0;\n while (ds_scale(sn + 1) < targetRez) {\n ++sn;\n }\n var scale = ds_scale(sn);\n\n var binTots = [];\n var maxBin = -10000000000;\n var minBin = 10000000000;\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.groups && f.groups.length > 0) {\n // Don't downsample complex features (?)\n return features;\n }\n\n var minLap = f.min / scale | 0;\n var maxLap = f.max / scale | 0;\n maxBin = Math.max(maxBin, maxLap);\n minBin = Math.min(minBin, minLap);\n for (var b = minLap; b <= maxLap; ++b) {\n var bm = binTots[b];\n if (!bm) {\n bm = new DSBin(scale, b * scale, (b + 1) * scale - 1);\n binTots[b] = bm;\n }\n bm.feature(f);\n }\n }\n\n var sampledFeatures = [];\n for (var b = minBin; b <= maxBin; ++b) {\n var bm = binTots[b];\n if (bm) {\n var f = new DASFeature();\n f.segment = features[0].segment;\n f.min = b * scale + 1;\n f.max = (b + 1) * scale;\n f.score = bm.score();\n f.type = 'density';\n sampledFeatures.push(f);\n }\n }\n\n var afterDS = Date.now();\n return sampledFeatures;\n}\n\n/** Data structure to store information for\na base position:\n\npos: position of the base.\n*/\nfunction BaseBin(pos) {\n\n this._pos = pos;\n this._bases = {};\n this._totalCount = 0;\n}\n\n/** Keep record for incidence of a base,\nwith related qual score and strand for a position.\n\nParams\n base: base (e.g A, T, G, C, N) observed at position.\n qual: numeric quality score.\n strand: '+' or '-'.\n*/\nBaseBin.prototype.recordBase = function (base, qual, strand) {\n if (!this._bases[base]) {\n var strandComposition = { '+': 0, '-': 0 };\n strandComposition[strand]++;\n this._bases[base] = {\n cnt: 1,\n totalQual: qual,\n strandCnt: strandComposition\n };\n } else {\n var baseComposition = this._bases[base];\n baseComposition.cnt++;\n baseComposition.totalQual += qual;\n baseComposition.strandCnt[strand]++;\n }\n this._totalCount++;\n};\n\n/** Returns count of total number of bases observed at position */\nBaseBin.prototype.totalCount = function () {\n return this._totalCount;\n};\n\n/** Returns the base position */\nBaseBin.prototype.pos = function () {\n return this._pos;\n};\n\n/** Creates a list of tag, info pairs in the form\n[tag]=[info] for each base, for use in feature-popup */\nBaseBin.prototype.infoList = function () {\n var info = [];\n var totalCount = this._totalCount;\n var totalCountStr = \"Depth=\" + totalCount.toString();\n info.push(totalCountStr);\n for (var base in this._bases) {\n var baseComposition = this._bases[base];\n var baseCnt = baseComposition.cnt;\n var basePercentage = baseCnt * 100 / totalCount;\n var plusStrandCnt = baseComposition.strandCnt['+'];\n var minusStrandCnt = baseComposition.strandCnt['-'];\n var meanQual = baseComposition.totalQual / baseCnt;\n\n var baseInfoString = [base, '=', baseCnt, ' (', basePercentage.toFixed(0), '%, ', plusStrandCnt, ' +, ', minusStrandCnt, ' -, Qual: ', meanQual.toFixed(0), ')'];\n info.push(baseInfoString.join(''));\n }\n return info;\n};\n\n/** Return a list of objects for creating a\nhistogram showing composition of different bases at a\ngiven location.\n\nCurrent implementation is hacky: the logic involves\noverlaying BoxGlyphs on top of each other, thus the score\nis not meaningful, but only used to manipulate height.\n\nParams:\n ref: reference base at position\n threshold: value between 0 and 1 representing min allele frequency\n below which the allele will be ignored in histogram.\n (interpreted as noise)\n Similar to 'allele threshold' parameter in IGV\n\nReturns a list of objects containing 2 properties\n base: such as A, T, G, C, N, - (del)\n score: a numeric score for determining height of histogram\nThe list is ordered such that a preceeding object always have a\nscore >= the current object, and the ref base will be the last item.\n\nExample: There are 50 T's and 40 A's (total depth = 90)\nat a base where ref=A. The function will return\n[T: 90, A: 40]. When creating a histogram with overlap,\nthis will give an appearance of 40 A's (bottom) and 50 T's (top):\n#######\n# T #\n# T #\n# T #\n# T #\n# T #\n#######\n# A #\n# A #\n# A #\n# A #\n#######\n*/\nBaseBin.prototype.baseScoreList = function (ref, threshold) {\n var baseScoreList = [];\n var totalCount = this._totalCount;\n var minCount = threshold * totalCount;\n for (var base in this._bases) {\n var baseCount = this._bases[base].cnt;\n if (baseCount < minCount || base == ref) continue;\n var baseScorePair = { base: base, score: totalCount };\n baseScoreList.push(baseScorePair);\n totalCount -= baseCount;\n }\n baseScoreList.push({ base: ref, score: totalCount });\n return baseScoreList;\n};\n\n/** Generates an aligned read from the raw sequence of a BAM record\nusing given cigar string.\n\nParams:\n rawseq: unaligned read sequence from Bam record\n rawquals: unaligned read quals from Bam record\n cigar: Bam cigar string from Bam record\n\nReturns an object with 2 properties:\n seq: string containing aligned read\n quals: string containing printable-character representation\n of sequencing quality score\n*/\nfunction alignSeqUsingCigar(rawseq, rawquals, cigar) {\n var ops = parseCigar(cigar);\n var seq = [];\n var quals = [];\n var cursor = 0;\n for (var ci = 0; ci < ops.length; ++ci) {\n var co = ops[ci];\n if (co.op == 'M') {\n seq.push(rawseq.substr(cursor, co.cnt));\n quals.push(rawquals.substr(cursor, co.cnt));\n cursor += co.cnt;\n } else if (co.op == 'D') {\n for (var oi = 0; oi < co.cnt; ++oi) {\n seq.push('-');\n quals.push('Z');\n }\n } else if (co.op == 'I') {\n cursor += co.cnt;\n } else if (co.op == 'S') {\n cursor += co.cnt;\n } else {\n console.log('unknown cigop' + co.op);\n }\n }\n var processedSeq = { seq: seq.join(''), quals: quals.join('') };\n return processedSeq;\n}\n\n/** Constructs the reference sequence for a given window.\n\nParams\n currentSequence: DasSequence object containing ref sequence\n in current browser view.\n min, max: min and max position for window.\n\nReturns a string containing the refseq, padded with 'N' where sequence is not\n available.\n*/\nfunction getRefSeq(currentSequence, min, max) {\n var refSeq = [];\n if (currentSequence) {\n var csStart = currentSequence.start | 0;\n var csEnd = currentSequence.end | 0;\n if (csStart <= max && csEnd >= min) {\n var sfMin = Math.max(min, csStart);\n var sfMax = Math.min(max, csEnd);\n\n for (var i = 0; i < sfMin - min; i++) {\n refSeq.push('N');\n }refSeq.push(currentSequence.seq.substr(sfMin - csStart, sfMax - sfMin + 1));\n for (var i = 0; i < max - sfMax; i++) {\n refSeq.push('N');\n }\n }\n }\n return refSeq.join('');\n}\n\n/** Constructs features necessary for a coverage track showing\nbase composition for BAM reads\n\nParams\n features: a list of features from BAM records.\n currentRefSeq: a DASSequence object containing reference sequence.\n baseColors: an object mapping base to desired colors.\n\nReturns a list of features of type base-coverage.\n*/\nfunction getBaseCoverage(features, currentRefSeq, baseColors) {\n var minBin = null;\n var maxBin = null;\n\n var allBins = [];\n\n // Populate BaseBins\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.groups && f.groups.length > 0) {\n // Don't downsample complex features\n return features;\n }\n var processedSeq = alignSeqUsingCigar(f.seq, f.quals, f.cigar);\n var seq = processedSeq.seq;\n var quals = processedSeq.quals;\n var strand = f.orientation;\n var minForFeature = f.min || 0;\n var maxForFeature = f.max || 0;\n var ind = 0;\n\n for (var b = minForFeature; b <= maxForFeature; ++b) {\n var bm = allBins[b];\n if (!bm) {\n bm = new BaseBin(b);\n allBins[b] = bm;\n }\n var base = seq.charAt(ind);\n var qual = quals.charCodeAt(ind) - 33; // Generate numeric qual score\n bm.recordBase(base, qual, strand);\n ind++;\n }\n\n if (!minBin) minBin = minForFeature;else minBin = Math.min(minBin, minForFeature);\n if (!maxBin) maxBin = maxForFeature;else maxBin = Math.max(maxBin, maxForFeature);\n }\n\n // Generate coverage features\n var refSeq = getRefSeq(currentRefSeq, minBin, maxBin);\n var baseFeatures = [];\n var ind = 0;\n for (var b = minBin; b <= maxBin; ++b) {\n var bm = allBins[b];\n if (bm) {\n var f = new DASFeature();\n f.segment = features[0].segment;\n f.min = bm.pos();\n f.max = f.min;\n f.notes = [];\n f.notes = f.notes.concat(bm.infoList());\n f.type = 'base-coverage';\n f.suppressScore = true;\n if (refSeq) {\n var refBase = refSeq.charAt(ind);\n var refString = 'Ref=' + refBase;\n f.notes.unshift(refString);\n var baseScoreList = bm.baseScoreList(refBase, 0.2);\n // TODO: shift 0.2 threshold to a config parameter\n for (var i = 0; i < baseScoreList.length; i++) {\n var base = baseScoreList[i].base;\n var score = baseScoreList[i].score;\n var fBase = shallowCopy(f);\n fBase.score = score;\n // Color by baseColor when mismatch occurs\n // otherwise, BoxGlyph to COLOR1 in style\n if (baseScoreList.length > 1 || base != refBase) fBase.itemRgb = baseColors[base];\n\n baseFeatures.push(fBase);\n }\n } else {\n // No refSeq, only show coverage height.\n baseFeatures.push(f);\n }\n }\n ind++;\n }\n return baseFeatures;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n downsample: downsample,\n getBaseCoverage: getBaseCoverage\n };\n}\n\n},{\"./cigar\":8,\"./das\":10,\"./utils\":56}],35:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// bin.js general binary data support\n//\n\n\"use strict\";\n\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n\n var connectTrix = require('./trix').connectTrix;\n}\n\nvar REGION_PATTERN = /^([\\d+,\\w,\\.,\\_,\\-]+)[\\s:]+([0-9,\\.]+?)([KkMmGg])?((-|\\.\\.|\\s)+([0-9,\\.]+)([KkMmGg])?)?$/;\n\nfunction parseLocCardinal(n, m) {\n var i = parseFloat(n.replace(/,/g, ''));\n if (m === 'k' || m === 'K') {\n return i * 1000 | 0;\n } else if (m == 'm' || m === 'M') {\n return i * 1000000 | 0;\n } else {\n return i | 0;\n }\n}\n\nBrowser.prototype.search = function (g, statusCallback, opts) {\n var thisB = this;\n opts = opts || {};\n var srPadding = opts.padding || this.defaultSearchRegionPadding;\n\n var m = REGION_PATTERN.exec(g);\n\n if (m) {\n var chr = m[1],\n start,\n end;\n if (m[6]) {\n start = parseLocCardinal(m[2], m[3]);\n end = parseLocCardinal(m[6], m[7]);\n } else {\n var width = this.viewEnd - this.viewStart + 1;\n start = parseLocCardinal(m[2], m[3]) - width / 2 | 0;\n end = start + width - 1;\n }\n this.setLocation(chr, start, end, statusCallback);\n } else {\n if (!g || g.length == 0) {\n return false;\n }\n\n var searchCount = 0;\n var foundLatch = false;\n\n var searchCallback = function searchCallback(found, err) {\n --searchCount;\n if (err) {\n return statusCallback(err);\n }\n\n if (!found) found = [];\n var min = 500000000,\n max = -100000000;\n var nchr = null;\n for (var fi = 0; fi < found.length; ++fi) {\n var f = found[fi];\n\n if (nchr == null) {\n nchr = f.segment;\n }\n min = Math.min(min, f.min);\n max = Math.max(max, f.max);\n }\n\n if (!nchr) {\n if (searchCount == 0 && !foundLatch) return statusCallback(\"no match for '\" + g + \"'\");\n } else {\n foundLatch = true;\n thisB.highlightRegion(nchr, min, max);\n\n var mid = (max + min) / 2 | 0;\n var padding = Math.max(srPadding, 0.3 * (max - min + 1) | 0);\n thisB.setLocation(nchr, min - padding, max + padding, statusCallback);\n }\n };\n\n var doTrixSearch = function doTrixSearch(tier, trix) {\n trix.lookup(g, function (result, status) {\n if (result == null || result.length < 2) {\n return tier.featureSource.search(g, searchCallback);\n } else {\n var hit = result[1].split(',')[0];\n return tier.featureSource.search(hit, searchCallback);\n }\n });\n };\n\n if (this.searchEndpoint) {\n searchCount = 1;\n return this.doDasSearch(thisB.searchEndpoint, g, searchCallback);\n }\n\n var searchSources = [].concat(_toConsumableArray(this.searchOnlySourceHolders || []), _toConsumableArray(this.tiers));\n\n for (var ti = 0; ti < searchSources.length; ++ti) {\n (function (tier) {\n if (thisB.sourceAdapterIsCapable(tier.featureSource, 'search')) {\n if (tier.dasSource.trixURI) {\n ++searchCount;\n if (tier.trix) {\n doTrixSearch(tier, tier.trix);\n } else {\n var ix = new URLFetchable(tier.dasSource.trixURI, { credentials: tier.dasSource.credentials,\n resolver: tier.dasSource.resolver });\n\n var ixx = new URLFetchable(tier.dasSource.trixxURI || tier.dasSource.trixURI + 'x', { credentials: tier.dasSource.credentials,\n resolver: tier.dasSource.resolver });\n\n connectTrix(ix, ixx, function (trix) {\n tier.trix = trix;\n doTrixSearch(tier, trix);\n });\n }\n } else {\n ++searchCount;\n tier.featureSource.search(g, searchCallback);\n }\n } else if (tier.dasSource.provides_search) {\n ++searchCount;\n thisB.doDasSearch(tier.dasSource, g, searchCallback);\n }\n })(searchSources[ti]);\n }\n }\n};\n\nBrowser.prototype.doDasSearch = function (source, g, searchCallback) {\n var thisB = this;\n source.features(null, { group: g, type: 'transcript' }, function (found) {\n if (!found) found = [];\n var min = 500000000,\n max = -100000000;\n var nchr = null;\n\n var found2 = [];\n for (var fi = 0; fi < found.length; ++fi) {\n var f = found[fi];\n\n if (f.label.toLowerCase() != g.toLowerCase()) {\n // ...because Dazzle can return spurious overlapping features.\n continue;\n }\n found2.push(f);\n }\n\n return searchCallback(found2);\n }, false);\n};\n\n},{\"./bin\":4,\"./cbrowser\":6,\"./trix\":54}],36:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2012\n//\n// sequence-draw.js: renderers for sequence-related data\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var formatLongInt = utils.formatLongInt;\n var makeElementNS = utils.makeElementNS;\n\n var svgu = require('./svg-utils');\n var NS_SVG = svgu.NS_SVG;\n var NS_XLINK = svgu.NS_XLINK;\n var SVGPath = svgu.SVGPath;\n\n var nf = require('./numformats');\n var formatLongInt = nf.formatLongInt;\n}\n\nvar MIN_TILE = 100;\nvar rulerTileColors = ['black', 'white'];\n\nvar steps = [1, 2, 5];\n\nvar NS_SVG = 'http://www.w3.org/2000/svg';\n\nfunction tileSizeForScale(scale, min) {\n if (!min) {\n min = MIN_TILE;\n }\n\n function ts(p) {\n return steps[p % steps.length] * Math.pow(10, p / steps.length | 0);\n }\n var pow = steps.length;\n while (scale * ts(pow) < min) {\n ++pow;\n }\n return ts(pow);\n}\n\nfunction drawSeqTier(tier, seq) {\n var gc = tier.viewport.getContext('2d');\n var retina = tier.browser.retina && window.devicePixelRatio > 1;\n var desiredWidth = tier.browser.featurePanelWidth + 2000;\n if (retina) {\n desiredWidth *= 2;\n }\n var fpw = tier.viewport.width | 0; // this.browser.featurePanelWidth;\n if (fpw < desiredWidth - 50) {\n tier.viewport.width = fpw = desiredWidth;\n }\n\n var height = 50;\n if (seq && seq.seq) {\n height += 25;\n }\n\n var canvasHeight = height;\n if (retina) canvasHeight *= 2;\n\n tier.viewport.height = canvasHeight;\n tier.viewport.style.height = '' + height + 'px';\n tier.viewport.style.width = retina ? '' + fpw / 2 + 'px' : '' + fpw + 'px';\n tier.layoutHeight = height;\n tier.updateHeight();\n\n if (tier.background) {\n gc.fillStyle = tier.background;\n gc.fillRect(0, 0, fpw, tier.viewport.height);\n }\n if (retina) {\n gc.scale(2, 2);\n }\n\n gc.translate(1000, 0);\n drawSeqTierGC(tier, seq, gc);\n tier.norigin = tier.browser.viewStart;\n tier.viewportHolder.style.left = '-1000px';\n}\n\nfunction drawSeqTierGC(tier, seq, gc) {\n var scale = tier.browser.scale,\n knownStart = tier.browser.viewStart - 1000 / scale | 0,\n knownEnd = tier.browser.viewEnd + 2000 / scale,\n currentSeqMax = tier.browser.currentSeqMax;\n\n var seqTierMax = knownEnd;\n if (currentSeqMax > 0 && currentSeqMax < knownEnd) {\n seqTierMax = currentSeqMax;\n }\n var tile = tileSizeForScale(scale);\n var pos = Math.max(0, (knownStart / tile | 0) * tile);\n\n var origin = tier.browser.viewStart;\n\n while (pos <= seqTierMax) {\n gc.fillStyle = pos / tile % 2 == 0 ? 'white' : 'black';\n gc.strokeStyle = 'black';\n gc.fillRect((pos - origin) * scale, 8, tile * scale, 3);\n gc.strokeRect((pos - origin) * scale, 8, tile * scale, 3);\n\n gc.fillStyle = 'black';\n gc.fillText(formatLongInt(pos), (pos - origin) * scale, 22);\n\n pos += tile;\n }\n\n if (seq && seq.seq) {\n for (var p = knownStart; p <= knownEnd; ++p) {\n if (p >= seq.start && p <= seq.end) {\n var base = seq.seq.substr(p - seq.start, 1).toUpperCase();\n var color = tier.browser.baseColors[base];\n if (!color) {\n color = 'gray';\n }\n\n gc.fillStyle = color;\n\n if (scale >= 8) {\n var w = gc.measureText(base).width;\n // console.log(scale-w);\n gc.fillText(base, (p - origin) * scale + (scale - w) * 0.5, 52);\n } else {\n gc.fillRect((p - origin) * scale, 42, scale, 12);\n }\n }\n }\n }\n}\n\nfunction svgSeqTier(tier, seq) {\n var scale = tier.browser.scale,\n knownStart = tier.browser.viewStart - 1000 / scale | 0,\n knownEnd = tier.browser.viewEnd + 2000 / scale,\n currentSeqMax = tier.browser.currentSeqMax;\n\n var fpw = tier.viewport.width | 0;\n\n var seqTierMax = knownEnd;\n if (currentSeqMax > 0 && currentSeqMax < knownEnd) {\n seqTierMax = currentSeqMax;\n }\n var tile = tileSizeForScale(scale);\n var pos = Math.max(0, (knownStart / tile | 0) * tile);\n\n var origin = tier.browser.viewStart;\n\n var g = makeElementNS(NS_SVG, 'g', [], { fontSize: '8pt' });\n while (pos <= seqTierMax) {\n g.appendChild(makeElementNS(NS_SVG, 'rect', null, { x: (pos - origin) * scale,\n y: 8,\n width: tile * scale,\n height: 3,\n fill: pos / tile % 2 == 0 ? 'white' : 'black',\n stroke: 'black' }));\n\n g.appendChild(makeElementNS(NS_SVG, 'text', formatLongInt(pos), { x: (pos - origin) * scale,\n y: 28,\n fill: 'black', stroke: 'none' }));\n\n pos += tile;\n }\n\n if (seq && seq.seq) {\n for (var p = knownStart; p <= knownEnd; ++p) {\n if (p >= seq.start && p <= seq.end) {\n var base = seq.seq.substr(p - seq.start, 1).toUpperCase();\n var color = tier.browser.baseColors[base];\n if (!color) {\n color = 'gray';\n }\n\n if (scale >= 8) {\n g.appendChild(makeElementNS(NS_SVG, 'text', base, {\n x: (0.5 + p - origin) * scale,\n y: 52,\n textAnchor: 'middle',\n fill: color }));\n } else {\n g.appendChild(makeElementNS(NS_SVG, 'rect', null, {\n x: (p - origin) * scale,\n y: 42,\n width: scale,\n height: 12,\n fill: color }));\n }\n }\n }\n }\n\n return g;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n drawSeqTier: drawSeqTier,\n drawSeqTierGC: drawSeqTierGC,\n svgSeqTier: svgSeqTier\n };\n}\n\n},{\"./numformats\":30,\"./svg-utils\":45,\"./utils\":56}],37:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// session.js\n//\n\n\"use strict\";\n\nif (typeof require != 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var sc = require('./sourcecompare');\n var sourceDataURI = sc.sourceDataURI;\n var sourcesAreEqual = sc.sourcesAreEqual;\n\n var VERSION = require('./version');\n\n var utils = require('./utils');\n var miniJSONify = utils.miniJSONify;\n\n var sha1 = require('./sha1');\n var hex_sha1 = sha1.hex_sha1;\n}\n\nBrowser.prototype.nukeStatus = function () {\n delete localStorage['dalliance.' + this.cookieKey + '.view-chr'];\n delete localStorage['dalliance.' + this.cookieKey + '.view-start'];\n delete localStorage['dalliance.' + this.cookieKey + '.view-end'];\n delete localStorage['dalliance.' + this.cookieKey + '.current-seq-length'];\n delete localStorage['dalliance.' + this.cookieKey + '.showing-alt-zoom'];\n delete localStorage['dalliance.' + this.cookieKey + '.saved-zoom'];\n\n delete localStorage['dalliance.' + this.cookieKey + '.sources'];\n delete localStorage['dalliance.' + this.cookieKey + '.hubs'];\n delete localStorage['dalliance.' + this.cookieKey + '.version'];\n\n delete localStorage['dalliance.' + this.cookieKey + '.reverse-scrolling'];\n delete localStorage['dalliance.' + this.cookieKey + '.reverse-key-scrolling'];\n delete localStorage['dalliance.' + this.cookieKey + '.ruler-location'];\n};\n\nBrowser.prototype.storeStatus = function () {\n this.storeViewStatus();\n this.storeTierStatus();\n};\n\nBrowser.prototype.storeViewStatus = function () {\n if (!this.cookieKey || this.noPersist || this.noPersistView) {\n return;\n }\n\n localStorage['dalliance.' + this.cookieKey + '.view-chr'] = this.chr;\n localStorage['dalliance.' + this.cookieKey + '.view-start'] = this.viewStart | 0;\n localStorage['dalliance.' + this.cookieKey + '.view-end'] = this.viewEnd | 0;\n localStorage['dalliance.' + this.cookieKey + '.showing-alt-zoom'] = '' + this.isSnapZooming;\n localStorage['dalliance.' + this.cookieKey + '.saved-zoom'] = this.savedZoom;\n if (this.currentSeqMax) {\n localStorage['dalliance.' + this.cookieKey + '.current-seq-length'] = this.currentSeqMax;\n }\n};\n\nBrowser.prototype.storeTierStatus = function () {\n if (!this.cookieKey || this.noPersist) {\n return;\n }\n\n var currentSourceList = [];\n for (var t = 0; t < this.tiers.length; ++t) {\n var tt = this.tiers[t];\n var ts = tt.dasSource;\n if (!ts.noPersist) {\n currentSourceList.push({ source: tt.dasSource, config: tt.config || {} });\n }\n }\n localStorage['dalliance.' + this.cookieKey + '.sources'] = JSON.stringify(currentSourceList);\n\n var coveredHubURLs = {};\n var currentHubList = [];\n for (var hi = 0; hi < this.hubObjects.length; ++hi) {\n var tdb = this.hubObjects[hi];\n var hc = { url: tdb.hub.url, genome: tdb.genome };\n if (tdb.credentials) hc.credentials = tdb.credentials;\n if (tdb.mapping) hc.mapping = tdb.mapping;\n coveredHubURLs[hc.url] = true;\n currentHubList.push(hc);\n }\n\n // Needed to handle hubs that failed to connect, or hubs that haven't\n // connected yet when we're called soon after startup.\n for (var hi = 0; hi < this.hubs.length; ++hi) {\n var hc = this.hubs[hi];\n if (typeof hc === 'string') hc = { url: hc };\n if (!coveredHubURLs[hc.url]) currentHubList.push(hc);\n }\n\n localStorage['dalliance.' + this.cookieKey + '.hubs'] = JSON.stringify(currentHubList);\n\n localStorage['dalliance.' + this.cookieKey + '.reverse-scrolling'] = this.reverseScrolling;\n localStorage['dalliance.' + this.cookieKey + '.reverse-key-scrolling'] = this.reverseKeyScrolling;\n localStorage['dalliance.' + this.cookieKey + '.single-base-highlight'] = this.singleBaseHighlight;\n localStorage['dalliance.' + this.cookieKey + '.ruler-location'] = this.rulerLocation;\n\n localStorage['dalliance.' + this.cookieKey + '.export-ruler'] = this.exportRuler;\n localStorage['dalliance.' + this.cookieKey + '.export-highlights'] = this.exportHighlights;\n\n localStorage['dalliance.' + this.cookieKey + '.version'] = VERSION.CONFIG;\n};\n\nBrowser.prototype.restoreStatus = function () {\n if (this.noPersist) return;\n\n var storedConfigVersion = localStorage['dalliance.' + this.cookieKey + '.version'];\n if (storedConfigVersion) {\n storedConfigVersion = storedConfigVersion | 0;\n } else {\n storedConfigVersion = -100;\n }\n if (VERSION.CONFIG != storedConfigVersion) {\n return;\n }\n\n var storedConfigHash = localStorage['dalliance.' + this.cookieKey + '.configHash'] || '';\n var pageConfigHash = hex_sha1(miniJSONify({\n sources: this.sources,\n hubs: this.hubs,\n rulerLocation: this.rulerLocation\n }));\n if (pageConfigHash != storedConfigHash) {\n localStorage['dalliance.' + this.cookieKey + '.configHash'] = pageConfigHash;\n return;\n }\n\n var defaultSourcesByURI = {};\n for (var si = 0; si < this.sources.length; ++si) {\n var source = this.sources[si];\n if (!source) continue;\n\n var uri = sourceDataURI(source);\n var ul = defaultSourcesByURI[uri];\n if (!ul) defaultSourcesByURI[uri] = ul = [];\n ul.push(source);\n }\n\n if (!this.noPersistView) {\n var qChr = localStorage['dalliance.' + this.cookieKey + '.view-chr'];\n var qMin = localStorage['dalliance.' + this.cookieKey + '.view-start'] | 0;\n var qMax = localStorage['dalliance.' + this.cookieKey + '.view-end'] | 0;\n if (qChr && qMin && qMax) {\n this.chr = qChr;\n this.viewStart = qMin;\n this.viewEnd = qMax;\n\n var csm = localStorage['dalliance.' + this.cookieKey + '.current-seq-length'];\n if (csm) {\n this.currentSeqMax = csm | 0;\n }\n\n this.isSnapZooming = localStorage['dalliance.' + this.cookieKey + '.showing-alt-zoom'] == 'true';\n\n var sz = parseFloat(localStorage['dalliance.' + this.cookieKey + '.saved-zoom']);\n if (typeof sz === 'number' && !isNaN(sz)) {\n this.savedZoom = sz;\n }\n }\n }\n\n var rs = localStorage['dalliance.' + this.cookieKey + '.reverse-scrolling'];\n this.reverseScrolling = rs && rs == 'true';\n var rks = localStorage['dalliance.' + this.cookieKey + '.reverse-key-scrolling'];\n this.reverseKeyScrolling = rks && rks == 'true';\n var sbh = localStorage['dalliance.' + this.cookieKey + '.single-base-highlight'];\n this.singleBaseHighlight = sbh && sbh == 'true';\n\n var rl = localStorage['dalliance.' + this.cookieKey + '.ruler-location'];\n if (rl) this.rulerLocation = rl;\n\n var x = localStorage['dalliance.' + this.cookieKey + '.export-ruler'];\n if (x) this.exportRuler = x === 'true';\n var x = localStorage['dalliance.' + this.cookieKey + '.export-highlights'];\n if (x) this.exportHighlights = x === 'true';\n\n var sourceStr = localStorage['dalliance.' + this.cookieKey + '.sources'];\n if (sourceStr) {\n var storedSources = JSON.parse(sourceStr);\n this.sources = [];\n this.restoredConfigs = [];\n for (var si = 0; si < storedSources.length; ++si) {\n var source = this.sources[si] = storedSources[si].source;\n this.restoredConfigs[si] = storedSources[si].config;\n var uri = sourceDataURI(source);\n var ul = defaultSourcesByURI[uri] || [];\n for (var osi = 0; osi < ul.length; ++osi) {\n var oldSource = ul[osi];\n if (sourcesAreEqual(source, oldSource)) {\n for (var k in oldSource) {\n if (oldSource.hasOwnProperty(k) && (typeof oldSource[k] === 'function' || oldSource[k] instanceof Blob)) {\n source[k] = oldSource[k];\n }\n }\n }\n }\n }\n }\n\n var hubStr = localStorage['dalliance.' + this.cookieKey + '.hubs'];\n if (hubStr) {\n this.hubs = JSON.parse(hubStr);\n }\n\n return true;\n};\n\nBrowser.prototype.reset = function () {\n for (var i = this.tiers.length - 1; i >= 0; --i) {\n this.removeTier({ index: i }, true);\n }\n for (var i = 0; i < this.defaultSources.length; ++i) {\n var s = this.defaultSources[i];\n if (!s.disabled) this.addTier(this.defaultSources[i]);\n }\n\n this.highlights.splice(0, this.highlights.length);\n\n this.setLocation(this.defaultChr, this.defaultStart, this.defaultEnd);\n};\n\n},{\"./cbrowser\":6,\"./sha1\":38,\"./sourcecompare\":40,\"./utils\":56,\"./version\":58}],38:[function(require,module,exports){\n/*\r\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\r\n * in FIPS 180-1\r\n * Version 2.2 Copyright Paul Johnston 2000 - 2009.\r\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\r\n * Distributed under the BSD License\r\n * See http://pajhome.org.uk/crypt/md5 for details.\r\n */\n\n\"use strict\";\n\n/*\r\n * Configurable variables. You may need to tweak these to be compatible with\r\n * the server-side, but the defaults work in most cases.\r\n */\n\nvar hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\nvar b64pad = \"\"; /* base-64 pad character. \"=\" for strict RFC compliance */\n\n/*\r\n * These are the functions you'll usually want to call\r\n * They take string arguments and return either hex or base-64 encoded strings\r\n */\nfunction hex_sha1(s) {\n return rstr2hex(rstr_sha1(str2rstr_utf8(s)));\n}\nfunction b64_sha1(s) {\n return rstr2b64(rstr_sha1(str2rstr_utf8(s)));\n}\nfunction any_sha1(s, e) {\n return rstr2any(rstr_sha1(str2rstr_utf8(s)), e);\n}\nfunction hex_hmac_sha1(k, d) {\n return rstr2hex(rstr_hmac_sha1(str2rstr_utf8(k), str2rstr_utf8(d)));\n}\nfunction b64_hmac_sha1(k, d) {\n return rstr2b64(rstr_hmac_sha1(str2rstr_utf8(k), str2rstr_utf8(d)));\n}\nfunction any_hmac_sha1(k, d, e) {\n return rstr2any(rstr_hmac_sha1(str2rstr_utf8(k), str2rstr_utf8(d)), e);\n}\n\n/*\r\n * Perform a simple self-test to see if the VM is working\r\n */\nfunction sha1_vm_test() {\n return hex_sha1(\"abc\").toLowerCase() == \"a9993e364706816aba3e25717850c26c9cd0d89d\";\n}\n\n/*\r\n * Calculate the SHA1 of a raw string\r\n */\nfunction rstr_sha1(s) {\n return binb2rstr(binb_sha1(rstr2binb(s), s.length * 8));\n}\n\n/*\r\n * Calculate the HMAC-SHA1 of a key and some data (raw strings)\r\n */\nfunction rstr_hmac_sha1(key, data) {\n var bkey = rstr2binb(key);\n if (bkey.length > 16) bkey = binb_sha1(bkey, key.length * 8);\n\n var ipad = Array(16),\n opad = Array(16);\n for (var i = 0; i < 16; i++) {\n ipad[i] = bkey[i] ^ 0x36363636;\n opad[i] = bkey[i] ^ 0x5C5C5C5C;\n }\n\n var hash = binb_sha1(ipad.concat(rstr2binb(data)), 512 + data.length * 8);\n return binb2rstr(binb_sha1(opad.concat(hash), 512 + 160));\n}\n\n/*\r\n * Convert a raw string to a hex string\r\n */\nfunction rstr2hex(input) {\n // try { hexcase } catch(e) { hexcase=0; }\n var hex_tab = hexcase ? \"0123456789ABCDEF\" : \"0123456789abcdef\";\n var output = \"\";\n var x;\n for (var i = 0; i < input.length; i++) {\n x = input.charCodeAt(i);\n output += hex_tab.charAt(x >>> 4 & 0x0F) + hex_tab.charAt(x & 0x0F);\n }\n return output;\n}\n\n/*\r\n * Convert a raw string to a base-64 string\r\n */\nfunction rstr2b64(input) {\n // try { b64pad } catch(e) { b64pad=''; }\n var tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n var output = \"\";\n var len = input.length;\n for (var i = 0; i < len; i += 3) {\n var triplet = input.charCodeAt(i) << 16 | (i + 1 < len ? input.charCodeAt(i + 1) << 8 : 0) | (i + 2 < len ? input.charCodeAt(i + 2) : 0);\n for (var j = 0; j < 4; j++) {\n if (i * 8 + j * 6 > input.length * 8) output += b64pad;else output += tab.charAt(triplet >>> 6 * (3 - j) & 0x3F);\n }\n }\n return output;\n}\n\n/*\r\n * Convert a raw string to an arbitrary string encoding\r\n */\nfunction rstr2any(input, encoding) {\n var divisor = encoding.length;\n var remainders = Array();\n var i, q, x, quotient;\n\n /* Convert to an array of 16-bit big-endian values, forming the dividend */\n var dividend = Array(Math.ceil(input.length / 2));\n for (i = 0; i < dividend.length; i++) {\n dividend[i] = input.charCodeAt(i * 2) << 8 | input.charCodeAt(i * 2 + 1);\n }\n\n /*\r\n * Repeatedly perform a long division. The binary array forms the dividend,\r\n * the length of the encoding is the divisor. Once computed, the quotient\r\n * forms the dividend for the next step. We stop when the dividend is zero.\r\n * All remainders are stored for later use.\r\n */\n while (dividend.length > 0) {\n quotient = Array();\n x = 0;\n for (i = 0; i < dividend.length; i++) {\n x = (x << 16) + dividend[i];\n q = Math.floor(x / divisor);\n x -= q * divisor;\n if (quotient.length > 0 || q > 0) quotient[quotient.length] = q;\n }\n remainders[remainders.length] = x;\n dividend = quotient;\n }\n\n /* Convert the remainders to the output string */\n var output = \"\";\n for (i = remainders.length - 1; i >= 0; i--) {\n output += encoding.charAt(remainders[i]);\n } /* Append leading zero equivalents */\n var full_length = Math.ceil(input.length * 8 / (Math.log(encoding.length) / Math.log(2)));\n for (i = output.length; i < full_length; i++) {\n output = encoding[0] + output;\n }return output;\n}\n\n/*\r\n * Encode a string as utf-8.\r\n * For efficiency, this assumes the input is valid utf-16.\r\n */\nfunction str2rstr_utf8(input) {\n var output = \"\";\n var i = -1;\n var x, y;\n\n while (++i < input.length) {\n /* Decode utf-16 surrogate pairs */\n x = input.charCodeAt(i);\n y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;\n if (0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF) {\n x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);\n i++;\n }\n\n /* Encode output as utf-8 */\n if (x <= 0x7F) output += String.fromCharCode(x);else if (x <= 0x7FF) output += String.fromCharCode(0xC0 | x >>> 6 & 0x1F, 0x80 | x & 0x3F);else if (x <= 0xFFFF) output += String.fromCharCode(0xE0 | x >>> 12 & 0x0F, 0x80 | x >>> 6 & 0x3F, 0x80 | x & 0x3F);else if (x <= 0x1FFFFF) output += String.fromCharCode(0xF0 | x >>> 18 & 0x07, 0x80 | x >>> 12 & 0x3F, 0x80 | x >>> 6 & 0x3F, 0x80 | x & 0x3F);\n }\n return output;\n}\n\n/*\r\n * Encode a string as utf-16\r\n */\nfunction str2rstr_utf16le(input) {\n var output = \"\";\n for (var i = 0; i < input.length; i++) {\n output += String.fromCharCode(input.charCodeAt(i) & 0xFF, input.charCodeAt(i) >>> 8 & 0xFF);\n }return output;\n}\n\nfunction str2rstr_utf16be(input) {\n var output = \"\";\n for (var i = 0; i < input.length; i++) {\n output += String.fromCharCode(input.charCodeAt(i) >>> 8 & 0xFF, input.charCodeAt(i) & 0xFF);\n }return output;\n}\n\n/*\r\n * Convert a raw string to an array of big-endian words\r\n * Characters >255 have their high-byte silently ignored.\r\n */\nfunction rstr2binb(input) {\n var output = Array(input.length >> 2);\n for (var i = 0; i < output.length; i++) {\n output[i] = 0;\n }for (var i = 0; i < input.length * 8; i += 8) {\n output[i >> 5] |= (input.charCodeAt(i / 8) & 0xFF) << 24 - i % 32;\n }return output;\n}\n\n/*\r\n * Convert an array of big-endian words to a string\r\n */\nfunction binb2rstr(input) {\n var output = \"\";\n for (var i = 0; i < input.length * 32; i += 8) {\n output += String.fromCharCode(input[i >> 5] >>> 24 - i % 32 & 0xFF);\n }return output;\n}\n\n/*\r\n * Calculate the SHA-1 of an array of big-endian words, and a bit length\r\n */\nfunction binb_sha1(x, len) {\n /* append padding */\n x[len >> 5] |= 0x80 << 24 - len % 32;\n x[(len + 64 >> 9 << 4) + 15] = len;\n\n var w = Array(80);\n var a = 1732584193;\n var b = -271733879;\n var c = -1732584194;\n var d = 271733878;\n var e = -1009589776;\n\n for (var i = 0; i < x.length; i += 16) {\n var olda = a;\n var oldb = b;\n var oldc = c;\n var oldd = d;\n var olde = e;\n\n for (var j = 0; j < 80; j++) {\n if (j < 16) w[j] = x[i + j];else w[j] = bit_rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);\n var t = safe_add(safe_add(bit_rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j)));\n e = d;\n d = c;\n c = bit_rol(b, 30);\n b = a;\n a = t;\n }\n\n a = safe_add(a, olda);\n b = safe_add(b, oldb);\n c = safe_add(c, oldc);\n d = safe_add(d, oldd);\n e = safe_add(e, olde);\n }\n return Array(a, b, c, d, e);\n}\n\n/*\r\n * Perform the appropriate triplet combination function for the current\r\n * iteration\r\n */\nfunction sha1_ft(t, b, c, d) {\n if (t < 20) return b & c | ~b & d;\n if (t < 40) return b ^ c ^ d;\n if (t < 60) return b & c | b & d | c & d;\n return b ^ c ^ d;\n}\n\n/*\r\n * Determine the appropriate additive constant for the current iteration\r\n */\nfunction sha1_kt(t) {\n return t < 20 ? 1518500249 : t < 40 ? 1859775393 : t < 60 ? -1894007588 : -899497514;\n}\n\n/*\r\n * Add integers, wrapping at 2^32. This uses 16-bit operations internally\r\n * to work around bugs in some JS interpreters.\r\n */\nfunction safe_add(x, y) {\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\n return msw << 16 | lsw & 0xFFFF;\n}\n\n/*\r\n * Bitwise rotate a 32-bit number to the left.\r\n */\nfunction bit_rol(num, cnt) {\n return num << cnt | num >>> 32 - cnt;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n b64_sha1: b64_sha1,\n hex_sha1: hex_sha1\n };\n}\n\n},{}],39:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// sourceadapters.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var tier = require('./tier');\n var DasTier = tier.DasTier;\n\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n var arrayIndexOf = utils.arrayIndexOf;\n var shallowCopy = utils.shallowCopy;\n var resolveUrlToPage = utils.resolveUrlToPage;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASSource = das.DASSource;\n var DASSegment = das.DASSegment;\n var DASFeature = das.DASFeature;\n var DASSequence = das.DASSequence;\n var DASLink = das.DASLink;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n\n var twoBit = require('./twoBit');\n var makeTwoBit = twoBit.makeTwoBit;\n\n var bbi = require('./bigwig');\n var makeBwg = bbi.makeBwg;\n\n var bam = require('./bam');\n var makeBam = bam.makeBam;\n var BamFlags = bam.BamFlags;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n\n var parseCigar = require('./cigar').parseCigar;\n\n var OverlayFeatureSource = require('./overlay').OverlayFeatureSource;\n\n var JBrowseStore = require('./jbjson').JBrowseStore;\n\n var Chainset = require('./chainset').Chainset;\n\n var style = require('./style');\n var StyleFilterSet = style.StyleFilterSet;\n\n var EncodeFetchable = require('./encode').EncodeFetchable;\n}\n\nvar __dalliance_sourceAdapterFactories = {};\n\nfunction dalliance_registerSourceAdapterFactory(type, factory) {\n __dalliance_sourceAdapterFactories[type] = factory;\n}\n\nvar __dalliance_parserFactories = {};\n\nfunction dalliance_registerParserFactory(type, factory) {\n __dalliance_parserFactories[type] = factory;\n}\n\nfunction dalliance_makeParser(type) {\n if (__dalliance_parserFactories[type]) {\n return __dalliance_parserFactories[type](type);\n }\n}\n\nDasTier.prototype.initSources = function () {\n var thisTier = this;\n\n var sources = this.browser.createSources(this.dasSource);\n this.featureSource = sources.features || new DummyFeatureSource();\n this.sequenceSource = sources.sequence;\n\n if (this.featureSource && this.featureSource.addChangeListener) {\n this.featureSource.addChangeListener(function () {\n thisTier.browser.refreshTier(thisTier);\n });\n }\n};\n\nBrowser.prototype.createSources = function (config) {\n var sources = this.sourceCache.get(config);\n if (sources) return sources;\n\n var fs, ss;\n\n if (config.tier_type == 'sequence' || config.twoBitURI || config.twoBitBlob) {\n if (config.twoBitURI || config.twoBitBlob) {\n ss = new TwoBitSequenceSource(config);\n } else if (config.ensemblURI) {\n ss = new EnsemblSequenceSource(config);\n } else {\n ss = new DASSequenceSource(config);\n }\n } else if (config.tier_type && __dalliance_sourceAdapterFactories[config.tier_type]) {\n var saf = __dalliance_sourceAdapterFactories[config.tier_type];\n var ns = saf(config);\n fs = ns.features;\n ss = ns.sequence;\n } else if (config.bwgURI || config.bwgBlob) {\n var worker = this.getWorker();\n if (worker) fs = new RemoteBWGFeatureSource(config, worker, this);else fs = new BWGFeatureSource(config);\n } else if (config.bamURI || config.bamBlob) {\n var worker = this.getWorker();\n if (worker) fs = new RemoteBAMFeatureSource(config, worker, this);else fs = new BAMFeatureSource(config);\n } else if (config.jbURI) {\n fs = new JBrowseFeatureSource(config);\n } else if (config.uri || config.features_uri) {\n fs = new DASFeatureSource(config);\n }\n\n if (config.overlay) {\n var sources = [];\n if (fs) sources.push(new CachingFeatureSource(fs));\n\n for (var oi = 0; oi < config.overlay.length; ++oi) {\n var cs = this.createSources(config.overlay[oi]);\n if (cs && cs.features) sources.push(cs.features);\n }\n fs = new OverlayFeatureSource(sources, config);\n }\n\n if (config.sequenceAliases) {\n fs = new MappedFeatureSource(fs, new Chainset({ type: 'alias', sequenceAliases: config.sequenceAliases }));\n }\n\n if (config.mapping) {\n fs = new MappedFeatureSource(fs, this.chains[config.mapping]);\n }\n\n if (config.name && fs && !fs.name) {\n fs.name = config.name;\n }\n\n if (typeof fs !== 'undefined' && fs !== null) {\n fs = new CachingFeatureSource(fs);\n }\n\n if (typeof fs !== 'undefined' && fs !== null || typeof ss !== 'undefined' && ss != null) {\n sources = {\n features: fs,\n sequence: ss\n };\n this.sourceCache.put(config, sources);\n }\n\n return sources;\n};\n\nDasTier.prototype.fetchStylesheet = function (cb) {\n var ssSource;\n // Somewhat ugly workaround for the special case of DAS sources...\n if (this.dasSource.stylesheet_uri || !this.dasSource.tier_type && !this.dasSource.bwgURI && !this.dasSource.bwgBlob && !this.dasSource.bamURI && !this.dasSource.bamBlob && !this.dasSource.twoBitURI && !this.dasSource.twoBitBlob && !this.dasSource.jbURI && !this.dasSource.overlay) {\n ssSource = new DASFeatureSource(this.dasSource);\n } else {\n ssSource = this.getSource();\n }\n ssSource.getStyleSheet(cb);\n};\n\nvar __cfs_id_seed = 0;\n\nfunction CachingFeatureSource(source) {\n var thisB = this;\n\n this.source = source;\n this.cfsid = 'cfs' + ++__cfs_id_seed;\n if (source.name) {\n this.name = source.name;\n }\n if (source.addChangeListener) {\n source.addChangeListener(function () {\n thisB.cfsid = 'cfs' + ++__cfs_id_seed;\n });\n }\n}\n\nCachingFeatureSource.prototype.addReadinessListener = function (listener) {\n if (this.source.addReadinessListener) return this.source.addReadinessListener(listener);else listener(null);\n};\n\nCachingFeatureSource.prototype.removeReadinessListener = function (listener) {\n if (this.source.removeReadinessListener) return this.source.removeReadinessListener(listener);\n};\n\nCachingFeatureSource.prototype.search = function (query, callback) {\n if (this.source.search) return this.source.search(query, callback);\n};\n\nCachingFeatureSource.prototype.getDefaultFIPs = function (callback) {\n if (this.source.getDefaultFIPs) return this.source.getDefaultFIPs(callback);\n};\n\nCachingFeatureSource.prototype.getStyleSheet = function (callback) {\n this.source.getStyleSheet(callback);\n};\n\nCachingFeatureSource.prototype.getScales = function () {\n return this.source.getScales();\n};\n\nCachingFeatureSource.prototype.addActivityListener = function (l) {\n if (this.source.addActivityListener) {\n this.source.addActivityListener(l);\n }\n};\n\nCachingFeatureSource.prototype.removeActivityListener = function (l) {\n if (this.source.removeActivityListener) {\n this.source.removeActivityListener(l);\n }\n};\n\nCachingFeatureSource.prototype.addChangeListener = function (l) {\n if (this.source.addChangeListener) this.source.addChangeListener(l);\n};\n\nCachingFeatureSource.prototype.removeChangeListener = function (l) {\n if (this.source.removeChangeListener) this.source.removeChangeListener(l);\n};\n\nCachingFeatureSource.prototype.findNextFeature = function (chr, pos, dir, callback) {\n this.source.findNextFeature(chr, pos, dir, callback);\n};\n\nCachingFeatureSource.prototype.quantFindNextFeature = function (chr, pos, dir, threshold, callback) {\n this.source.quantFindNextFeature(chr, pos, dir, threshold, callback);\n};\n\nCachingFeatureSource.prototype.capabilities = function () {\n if (this.source.capabilities) {\n return this.source.capabilities();\n } else {\n return {};\n }\n};\n\nCachingFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback, styleFilters) {\n if (!pool) {\n throw Error('Fetch pool is null');\n }\n\n var self = this;\n var cacheKey = this.cfsid;\n\n var awaitedFeatures = pool.awaitedFeatures[cacheKey];\n if (awaitedFeatures && awaitedFeatures.started) {\n if (awaitedFeatures.styleFilters.doesNotContain(styleFilters)) {\n // console.log('Fetch already started with wrong parameters, skipping cache.');\n self.source.fetch(chr, min, max, scale, types, pool, callback, styleFilters);\n return;\n }\n } else if (awaitedFeatures) {\n awaitedFeatures.styleFilters.addAll(styleFilters);\n } else {\n awaitedFeatures = new Awaited();\n awaitedFeatures.styleFilters = styleFilters;\n pool.awaitedFeatures[cacheKey] = awaitedFeatures;\n\n pool.requestsIssued.then(function () {\n awaitedFeatures.started = true;\n self.source.fetch(chr, min, max, scale, awaitedFeatures.styleFilters.typeList(), pool, function (status, features, scale, coverage) {\n if (!awaitedFeatures.res) awaitedFeatures.provide({ status: status, features: features, scale: scale, coverage: coverage });\n }, awaitedFeatures.styleFilters);\n }).catch(function (err) {\n console.log(err);\n });\n }\n\n awaitedFeatures.await(function (af) {\n callback(af.status, af.features, af.scale, af.coverage);\n });\n};\n\nfunction FeatureSourceBase() {\n this.busy = 0;\n this.activityListeners = [];\n this.readinessListeners = [];\n this.readiness = null;\n}\n\nFeatureSourceBase.prototype.addReadinessListener = function (listener) {\n this.readinessListeners.push(listener);\n listener(this.readiness);\n};\n\nFeatureSourceBase.prototype.removeReadinessListener = function (listener) {\n var idx = arrayIndexOf(this.readinessListeners, listener);\n if (idx >= 0) {\n this.readinessListeners.splice(idx, 1);\n }\n};\n\nFeatureSourceBase.prototype.notifyReadiness = function () {\n for (var li = 0; li < this.readinessListeners.length; ++li) {\n try {\n this.readinessListeners[li](this.readiness);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nFeatureSourceBase.prototype.addActivityListener = function (listener) {\n this.activityListeners.push(listener);\n};\n\nFeatureSourceBase.prototype.removeActivityListener = function (listener) {\n var idx = arrayIndexOf(this.activityListeners, listener);\n if (idx >= 0) {\n this.activityListeners.splice(idx, 1);\n }\n};\n\nFeatureSourceBase.prototype.notifyActivity = function () {\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nFeatureSourceBase.prototype.getScales = function () {\n return null;\n};\n\nFeatureSourceBase.prototype.fetch = function (chr, min, max, scale, types, pool, cnt) {\n return cnt(null, [], 1000000000);\n};\n\nFeatureSourceBase.prototype.getStyleSheet = function (callback) {\n var stylesheet = new DASStylesheet();\n var defStyle = new DASStyle();\n defStyle.glyph = 'BOX';\n defStyle.BGCOLOR = 'blue';\n defStyle.FGCOLOR = 'black';\n stylesheet.pushStyle({ type: 'default' }, null, defStyle);\n return callback(stylesheet);\n};\n\nfunction DASFeatureSource(dasSource) {\n this.dasSource = new DASSource(dasSource);\n this.busy = 0;\n this.activityListeners = [];\n}\n\nDASFeatureSource.prototype.addActivityListener = function (listener) {\n this.activityListeners.push(listener);\n};\n\nDASFeatureSource.prototype.removeActivityListener = function (listener) {\n var idx = arrayIndexOf(this.activityListeners, listener);\n if (idx >= 0) this.activityListeners.splice(idx, 1);\n};\n\nDASFeatureSource.prototype.notifyActivity = function () {\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nDASFeatureSource.prototype.getStyleSheet = function (callback) {\n this.dasSource.stylesheet(function (stylesheet) {\n callback(stylesheet);\n }, function () {\n callback(null, \"Couldn't fetch DAS stylesheet\");\n });\n};\n\nDASFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n if (types && types.length === 0) {\n callback(null, [], scale);\n return;\n }\n\n if (!this.dasSource.uri && !this.dasSource.features_uri) {\n // FIXME should this be making an error callback???\n return;\n }\n\n if (this.dasSource.dasStaticFeatures && this.cachedStaticFeatures) {\n return callback(null, this.cachedStaticFeatures, this.cachedStaticScale);\n }\n\n var tryMaxBins = this.dasSource.maxbins !== false;\n var fops = {\n type: types\n };\n if (tryMaxBins) {\n fops.maxbins = 1 + ((max - min) / scale | 0);\n }\n\n var thisB = this;\n thisB.busy++;\n thisB.notifyActivity();\n\n this.dasSource.features(new DASSegment(chr, min, max), fops, function (features, status) {\n\n thisB.busy--;\n thisB.notifyActivity();\n\n var retScale = scale;\n if (!tryMaxBins) {\n retScale = 0.1;\n }\n if (!status && thisB.dasSource.dasStaticFeatures) {\n thisB.cachedStaticFeatures = features;\n thisB.cachedStaticScale = retScale;\n }\n callback(status, features, retScale);\n });\n};\n\nDASFeatureSource.prototype.findNextFeature = function (chr, pos, dir, callback) {\n if (this.dasSource.capabilities && arrayIndexOf(this.dasSource.capabilities, 'das1:adjacent-feature') >= 0) {\n var thisB = this;\n if (this.dasAdjLock) {\n return console.log('Already looking for a next feature, be patient!');\n }\n this.dasAdjLock = true;\n var fops = {\n adjacent: chr + ':' + (pos | 0) + ':' + (dir > 0 ? 'F' : 'B')\n };\n var types = thisTier.getDesiredTypes(thisTier.browser.scale);\n if (types) {\n fops.types = types;\n }\n thisTier.dasSource.features(null, fops, function (res) {\n thisB.dasAdjLock = false;\n if (res.length > 0 && res[0] !== null) {\n callback(res[0]);\n }\n });\n }\n};\n\nfunction DASSequenceSource(dasSource) {\n this.dasSource = new DASSource(dasSource);\n this.awaitedEntryPoints = new Awaited();\n\n var thisB = this;\n this.dasSource.entryPoints(function (ep) {\n thisB.awaitedEntryPoints.provide(ep);\n });\n}\n\nDASSequenceSource.prototype.fetch = function (chr, min, max, pool, callback) {\n this.dasSource.sequence(new DASSegment(chr, min, max), function (seqs) {\n if (seqs.length == 1) {\n return callback(null, seqs[0]);\n } else {\n return callback(\"Didn't get sequence\");\n }\n });\n};\n\nDASSequenceSource.prototype.getSeqInfo = function (chr, cnt) {\n this.awaitedEntryPoints.await(function (ep) {\n for (var epi = 0; epi < ep.length; ++epi) {\n if (ep[epi].name == chr) {\n return cnt({ length: ep[epi].end });\n }\n }\n return cnt();\n });\n};\n\nfunction TwoBitSequenceSource(source) {\n var thisB = this;\n this.source = source;\n this.twoBit = new Awaited();\n var data;\n if (source.twoBitURI) {\n data = new URLFetchable(source.twoBitURI, { credentials: source.credentials, resolver: source.resolver });\n } else if (source.twoBitBlob) {\n data = new BlobFetchable(source.twoBitBlob);\n } else {\n throw Error(\"No twoBitURI or twoBitBlob parameter\");\n }\n\n makeTwoBit(data, function (tb, error) {\n if (error) {\n console.log(error);\n } else {\n thisB.twoBit.provide(tb);\n }\n });\n}\n\nTwoBitSequenceSource.prototype.fetch = function (chr, min, max, pool, callback) {\n this.twoBit.await(function (tb) {\n tb.fetch(chr, min, max, function (seq, err) {\n if (err) {\n return callback(err, null);\n } else {\n var sequence = new DASSequence(chr, min, max, 'DNA', seq);\n return callback(null, sequence);\n }\n });\n });\n};\n\nTwoBitSequenceSource.prototype.getSeqInfo = function (chr, cnt) {\n this.twoBit.await(function (tb) {\n var seq = tb.getSeq(chr);\n if (seq) {\n tb.getSeq(chr).length(function (l) {\n cnt({ length: l });\n });\n } else {\n cnt();\n }\n });\n};\n\nfunction EnsemblSequenceSource(source) {\n this.source = source;\n // http://data.gramene.org/ensembl/info/assembly/triticum_aestivum/2B?content-type=application/json\n // http://data.gramene.org/ensembl/sequence/region/triticum_aestivum/2B:8001..18000:1?content-type=application/json\n}\n\nEnsemblSequenceSource.prototype.fetch = function (chr, min, max, pool, callback) {\n var url = this.source.ensemblURI + '/sequence/region/' + this.source.species + '/' + chr + ':' + min + '..' + max + ':1?content-type=application/json';\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n var jr;\n if (req.status >= 300) {\n var err = 'Error code ' + req.status;\n try {\n jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } finally {\n callback(err, null);\n }\n } else {\n jr = JSON.parse(req.response);\n var sequence = new DASSequence(chr, min, max, 'DNA', jr.seq);\n return callback(null, sequence);\n }\n }\n };\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\nEnsemblSequenceSource.prototype.getSeqInfo = function (chr, cnt) {\n var url = this.source.ensemblURI + '/info/assembly/' + this.source.species + '/' + chr + '?content-type=application/json';\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status >= 300) {\n cnt();\n } else {\n var jr = JSON.parse(req.response);\n cnt(jr);\n }\n }\n };\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\nDASFeatureSource.prototype.getScales = function () {\n return [];\n};\n\nvar bwg_preflights = {};\n\nfunction BWGFeatureSource(bwgSource) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.readiness = 'Connecting';\n this.bwgSource = this.opts = bwgSource;\n thisB.bwgHolder = new Awaited();\n\n if (this.opts.preflight) {\n var pfs = bwg_preflights[this.opts.preflight];\n if (!pfs) {\n pfs = new Awaited();\n bwg_preflights[this.opts.preflight] = pfs;\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status == 200) {\n pfs.provide('success');\n } else {\n pfs.provide('failure');\n }\n }\n };\n req.open('get', this.opts.preflight + '?' + hex_sha1('salt' + Date.now()), true); // Instead, ensure we always preflight a unique URI.\n if (this.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n }\n pfs.await(function (status) {\n if (status === 'success') {\n thisB.init();\n }\n });\n } else {\n thisB.init();\n }\n}\n\nBWGFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nBWGFeatureSource.prototype.init = function () {\n var thisB = this;\n var arg;\n\n var uri = this.bwgSource.uri || this.bwgSource.bwgURI;\n if (uri) {\n if (this.bwgSource.transport === 'encode') {\n arg = new EncodeFetchable(uri, { credentials: this.opts.credentials });\n } else {\n arg = new URLFetchable(uri, { credentials: this.opts.credentials, resolver: this.opts.resolver });\n }\n } else {\n arg = new BlobFetchable(this.bwgSource.bwgBlob);\n }\n\n makeBwg(arg, function (bwg, err) {\n if (err) {\n thisB.error = err;\n thisB.readiness = null;\n thisB.notifyReadiness();\n thisB.bwgHolder.provide(null);\n } else {\n thisB.bwgHolder.provide(bwg);\n thisB.readiness = null;\n thisB.notifyReadiness();\n if (bwg.type == 'bigbed') {\n bwg.getExtraIndices(function (ei) {\n thisB.extraIndices = ei;\n });\n }\n }\n });\n};\n\nBWGFeatureSource.prototype.capabilities = function () {\n var caps = { leap: true };\n if (this.bwgHolder.res && this.bwgHolder.res.type == 'bigwig') caps.quantLeap = true;\n if (this.extraIndices && this.extraIndices.length > 0) {\n caps.search = [];\n for (var eii = 0; eii < this.extraIndices.length; ++eii) {\n caps.search.push(this.extraIndices[eii].field);\n }\n }\n return caps;\n};\n\nBWGFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n this.bwgHolder.await(function (bwg) {\n if (typeof bwg === 'undefined' || bwg === null) {\n return callback(thisB.error || \"Can't access binary file\", null, null);\n }\n\n var data;\n var wantDensity = !types || types.length === 0 || arrayIndexOf(types, 'density') >= 0;\n if (thisB.opts.clientBin) {\n wantDensity = false;\n }\n var scaleFactor = thisB.opts.scaleFactor || 1.0;\n if (bwg.type == 'bigwig' || wantDensity || typeof thisB.opts.forceReduction !== 'undefined') {\n var zoom = -1;\n for (var z = 0; z < bwg.zoomLevels.length; ++z) {\n if (bwg.zoomLevels[z].reduction <= scale * scaleFactor) {\n zoom = z;\n } else {\n break;\n }\n }\n if (typeof thisB.opts.forceReduction !== 'undefined') {\n zoom = thisB.opts.forceReduction;\n }\n\n if (zoom < 0) {\n data = bwg.getUnzoomedView();\n } else {\n data = bwg.getZoomedView(zoom);\n }\n } else {\n data = bwg.getUnzoomedView();\n }\n\n thisB.busy++;\n thisB.notifyActivity();\n data.readWigData(chr, min, max, function (features) {\n thisB.busy--;\n thisB.notifyActivity();\n\n var fs = 1000000000;\n if (bwg.type === 'bigwig') {\n var is = (max - min) / features.length / 2;\n if (is < fs) {\n fs = is;\n }\n }\n if (thisB.opts.link) {\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.label) {\n f.links = [new DASLink('Link', thisB.opts.link.replace(/\\$\\$/, f.label))];\n }\n }\n }\n callback(null, features, fs);\n });\n });\n};\n\nBWGFeatureSource.prototype.quantFindNextFeature = function (chr, pos, dir, threshold, callback) {\n // var beforeQFNF = Date.now()|0;\n var thisB = this;\n thisB.busy++;\n thisB.notifyActivity();\n this.bwgHolder.res.thresholdSearch(chr, pos, dir, threshold, function (a, b) {\n thisB.busy--;\n thisB.notifyActivity();\n // var afterQFNF = Date.now()|0;\n // console.log('QFNF took ' + (afterQFNF - beforeQFNF) + 'ms');\n return callback(a, b);\n });\n};\n\nBWGFeatureSource.prototype.findNextFeature = function (chr, pos, dir, callback) {\n var thisB = this;\n thisB.busy++;\n thisB.notifyActivity();\n this.bwgHolder.res.getUnzoomedView().getFirstAdjacent(chr, pos, dir, function (res) {\n thisB.busy--;\n thisB.notifyActivity();\n if (res.length > 0 && res[0] !== null) {\n callback(res[0]);\n }\n });\n};\n\nBWGFeatureSource.prototype.getScales = function () {\n var bwg = this.bwgHolder.res;\n if (bwg /* && bwg.type == 'bigwig' */) {\n var scales = [1]; // Can we be smarter about inferring baseline scale?\n for (var z = 0; z < bwg.zoomLevels.length; ++z) {\n scales.push(bwg.zoomLevels[z].reduction);\n }\n return scales;\n } else {\n return null;\n }\n};\n\nBWGFeatureSource.prototype.search = function (query, callback) {\n if (!this.extraIndices || this.extraIndices.length === 0) {\n return callback(null, 'No indices available');\n }\n\n var index = this.extraIndices[0];\n return index.lookup(query, callback);\n};\n\nBWGFeatureSource.prototype.getDefaultFIPs = function (callback) {\n if (this.opts.noExtraFeatureInfo) return true;\n\n this.bwgHolder.await(function (bwg) {\n if (!bwg) return;\n\n if (bwg.schema && bwg.definedFieldCount < bwg.schema.fields.length) {\n var fip = function fip(feature, featureInfo) {\n for (var hi = 0; hi < featureInfo.hit.length; ++hi) {\n if (featureInfo.hit[hi].isSuperGroup) return;\n }\n for (var fi = bwg.definedFieldCount; fi < bwg.schema.fields.length; ++fi) {\n var f = bwg.schema.fields[fi];\n featureInfo.add(f.comment, feature[f.name]);\n }\n };\n\n callback(fip);\n } else {\n // No need to do anything.\n }\n });\n};\n\nBWGFeatureSource.prototype.getStyleSheet = function (callback) {\n var thisB = this;\n\n this.bwgHolder.await(function (bwg) {\n if (!bwg) {\n return callback(null, 'bbi error');\n }\n\n var stylesheet = new DASStylesheet();\n if (bwg.type == 'bigbed') {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'bigbed' }, null, wigStyle);\n\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'red';\n wigStyle.HEIGHT = 10;\n wigStyle.BUMP = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'translation' }, null, wigStyle);\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({ type: 'transcript' }, null, tsStyle);\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'white';\n densStyle.COLOR2 = 'black';\n densStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'density' }, null, densStyle);\n } else {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'HISTOGRAM';\n wigStyle.COLOR1 = 'white';\n wigStyle.COLOR2 = 'black';\n wigStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n }\n\n if (bwg.definedFieldCount == 12 && bwg.fieldCount >= 14) {\n stylesheet.geneHint = true;\n }\n\n return callback(stylesheet);\n });\n};\n\nfunction RemoteBWGFeatureSource(bwgSource, worker, browser) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.worker = worker;\n this.readiness = 'Connecting';\n this.bwgSource = this.opts = bwgSource;\n this.keyHolder = new Awaited();\n\n if (bwgSource.resolver) {\n this.resolverKey = browser.registerResolver(bwgSource.resolver);\n }\n\n this.init();\n}\n\nRemoteBWGFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nRemoteBWGFeatureSource.prototype.init = function () {\n var thisB = this;\n var uri = this.uri || this.bwgSource.uri || this.bwgSource.bwgURI;\n var blob = this.bwgSource.blob || this.bwgSource.bwgBlob;\n\n var cnt = function cnt(key, err) {\n thisB.readiness = null;\n thisB.notifyReadiness();\n\n if (key) {\n thisB.worker.postCommand({ command: 'meta', connection: key }, function (meta, err) {\n if (err) {\n thisB.error = err;\n thisB.keyHolder.provide(null);\n } else {\n thisB.meta = meta;\n thisB.keyHolder.provide(key);\n }\n });\n } else {\n thisB.error = err;\n thisB.keyHolder.provide(null);\n }\n };\n\n if (blob) {\n this.worker.postCommand({ command: 'connectBBI', blob: blob }, cnt);\n } else {\n this.worker.postCommand({\n command: 'connectBBI',\n uri: resolveUrlToPage(uri),\n resolver: this.resolverKey,\n transport: this.bwgSource.transport,\n credentials: this.bwgSource.credentials }, cnt);\n }\n};\n\nRemoteBWGFeatureSource.prototype.capabilities = function () {\n var caps = { leap: true };\n\n if (this.meta && this.meta.type == 'bigwig') caps.quantLeap = true;\n if (this.meta && this.meta.extraIndices && this.meta.extraIndices.length > 0) {\n caps.search = [];\n for (var eii = 0; eii < this.meta.extraIndices.length; ++eii) {\n caps.search.push(this.meta.extraIndices[eii].field);\n }\n }\n return caps;\n};\n\nRemoteBWGFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.keyHolder.await(function (key) {\n if (!key) {\n thisB.busy--;\n thisB.notifyActivity();\n return callback(thisB.error || \"Can't access binary file\", null, null);\n }\n\n var zoom = -1;\n var wantDensity = !types || types.length === 0 || arrayIndexOf(types, 'density') >= 0;\n if (thisB.opts.clientBin) {\n wantDensity = false;\n }\n if (thisB.meta.type == 'bigwig' || wantDensity || typeof thisB.opts.forceReduction !== 'undefined') {\n for (var z = 1; z < thisB.meta.zoomLevels.length; ++z) {\n if (thisB.meta.zoomLevels[z] <= scale) {\n zoom = z - 1; // Scales returned in metadata start at 1, unlike \"real\" zoom levels.\n } else {\n break;\n }\n }\n if (typeof thisB.opts.forceReduction !== 'undefined') {\n zoom = thisB.opts.forceReduction;\n }\n }\n\n thisB.worker.postCommand({ command: 'fetch', connection: key, chr: chr, min: min, max: max, zoom: zoom }, function (features, error) {\n thisB.busy--;\n thisB.notifyActivity();\n\n var fs = 1000000000;\n if (thisB.meta.type === 'bigwig') {\n var is = (max - min) / features.length / 2;\n if (is < fs) {\n fs = is;\n }\n }\n if (thisB.opts.link) {\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.label) {\n f.links = [new DASLink('Link', thisB.opts.link.replace(/\\$\\$/, f.label))];\n }\n }\n }\n callback(error, features, fs);\n });\n });\n};\n\nRemoteBWGFeatureSource.prototype.quantFindNextFeature = function (chr, pos, dir, threshold, callback) {\n var thisB = this;\n this.busy++;\n this.notifyActivity();\n this.worker.postCommand({ command: 'quantLeap', connection: this.keyHolder.res, chr: chr, pos: pos, dir: dir, threshold: threshold, under: false }, function (result, err) {\n console.log(result, err);\n thisB.busy--;\n thisB.notifyActivity();\n return callback(result, err);\n });\n};\n\nRemoteBWGFeatureSource.prototype.findNextFeature = function (chr, pos, dir, callback) {\n var thisB = this;\n this.busy++;\n this.notifyActivity();\n this.worker.postCommand({ command: 'leap', connection: this.keyHolder.res, chr: chr, pos: pos, dir: dir }, function (result, err) {\n thisB.busy--;\n thisB.notifyActivity();\n if (result.length > 0 && result[0] !== null) {\n callback(result[0]);\n }\n });\n};\n\nRemoteBWGFeatureSource.prototype.getScales = function () {\n var meta = this.meta;\n if (meta) {\n return meta.zoomLevels;\n } else {\n return null;\n }\n};\n\nRemoteBWGFeatureSource.prototype.search = function (query, callback) {\n if (!this.meta.extraIndices || this.meta.extraIndices.length === 0) {\n return callback(null, 'No indices available');\n }\n\n var thisB = this;\n this.busy++;\n this.notifyActivity();\n var index = this.meta.extraIndices[0];\n this.worker.postCommand({ command: 'search', connection: this.keyHolder.res, query: query, index: index }, function (result, err) {\n thisB.busy--;\n thisB.notifyActivity();\n\n callback(result, err);\n });\n};\n\nRemoteBWGFeatureSource.prototype.getDefaultFIPs = function (callback) {\n if (this.opts.noExtraFeatureInfo) return true;\n\n var thisB = this;\n this.keyHolder.await(function (key) {\n var bwg = thisB.meta;\n if (!bwg) return;\n\n if (bwg.schema && bwg.definedFieldCount < bwg.schema.fields.length) {\n var fip = function fip(feature, featureInfo) {\n for (var hi = 0; hi < featureInfo.hit.length; ++hi) {\n if (featureInfo.hit[hi].isSuperGroup) return;\n }\n for (var fi = bwg.definedFieldCount; fi < bwg.schema.fields.length; ++fi) {\n var f = bwg.schema.fields[fi];\n featureInfo.add(f.comment, feature[f.name]);\n }\n };\n\n callback(fip);\n } else {\n // No need to do anything.\n }\n });\n};\n\nRemoteBWGFeatureSource.prototype.getStyleSheet = function (callback) {\n var thisB = this;\n\n this.keyHolder.await(function (key) {\n var bwg = thisB.meta;\n if (!bwg) {\n return callback(null, 'bbi error');\n }\n\n var stylesheet = new DASStylesheet();\n if (bwg.type == 'bigbed') {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'bigbed' }, null, wigStyle);\n\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'red';\n wigStyle.HEIGHT = 10;\n wigStyle.BUMP = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'translation' }, null, wigStyle);\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({ type: 'transcript' }, null, tsStyle);\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'white';\n densStyle.COLOR2 = 'black';\n densStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'density' }, null, densStyle);\n } else {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'HISTOGRAM';\n wigStyle.COLOR1 = 'white';\n wigStyle.COLOR2 = 'black';\n wigStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n }\n\n if (bwg.definedFieldCount == 12 && bwg.fieldCount >= 14) {\n stylesheet.geneHint = true;\n }\n\n return callback(stylesheet);\n });\n};\n\nfunction bamRecordToFeature(r, group) {\n if (r.flag & BamFlags.SEGMENT_UNMAPPED) return;\n\n var len;\n if (r.seq) len = r.seq.length;else len = r.seqLength;\n\n if (r.cigar) {\n len = 0;\n var ops = parseCigar(r.cigar);\n for (var ci = 0; ci < ops.length; ++ci) {\n var co = ops[ci];\n if (co.op == 'M' || co.op == 'D') len += co.cnt;\n }\n }\n\n var f = new DASFeature();\n f.min = r.pos + 1;\n f.max = r.pos + len;\n f.segment = r.segment;\n f.type = 'bam';\n f.id = r.readName;\n f.notes = [/* 'Sequence=' + r.seq, 'CIGAR=' + r.cigar, */'MQ=' + r.mq];\n f.cigar = r.cigar;\n f.seq = r.seq;\n f.quals = r.quals;\n f.orientation = r.flag & BamFlags.REVERSE_COMPLEMENT ? '-' : '+';\n f.bamRecord = r;\n\n if (group && r.flag & BamFlags.MULTIPLE_SEGMENTS) {\n f.groups = [{ id: r.readName,\n type: 'readpair' }];\n }\n\n return f;\n}\n\nfunction BAMFeatureSource(bamSource) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.bamSource = bamSource;\n this.opts = { credentials: bamSource.credentials, preflight: bamSource.preflight, bamGroup: bamSource.bamGroup };\n this.bamHolder = new Awaited();\n\n if (this.opts.preflight) {\n var pfs = bwg_preflights[this.opts.preflight];\n if (!pfs) {\n pfs = new Awaited();\n bwg_preflights[this.opts.preflight] = pfs;\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (req.status == 200) {\n pfs.provide('success');\n } else {\n pfs.provide('failure');\n }\n }\n };\n // req.setRequestHeader('cache-control', 'no-cache'); /* Doesn't work, not an allowed request header in CORS */\n req.open('get', this.opts.preflight + '?' + hex_sha1('salt' + Date.now()), true); // Instead, ensure we always preflight a unique URI.\n if (this.opts.credentials) {\n req.withCredentials = 'true';\n }\n req.send();\n }\n pfs.await(function (status) {\n if (status === 'success') {\n thisB.init();\n }\n });\n } else {\n thisB.init();\n }\n}\n\nBAMFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nBAMFeatureSource.prototype.init = function () {\n var thisB = this;\n var bamF, baiF;\n if (this.bamSource.bamBlob) {\n bamF = new BlobFetchable(this.bamSource.bamBlob);\n baiF = new BlobFetchable(this.bamSource.baiBlob);\n } else {\n bamF = new URLFetchable(this.bamSource.bamURI, { credentials: this.opts.credentials, resolver: this.opts.resolver });\n baiF = new URLFetchable(this.bamSource.baiURI || this.bamSource.bamURI + '.bai', { credentials: this.opts.credentials, resolver: this.opts.resolver });\n }\n makeBam(bamF, baiF, null, function (bam, err) {\n thisB.readiness = null;\n thisB.notifyReadiness();\n\n if (bam) {\n thisB.bamHolder.provide(bam);\n } else {\n thisB.error = err;\n thisB.bamHolder.provide(null);\n }\n });\n};\n\nBAMFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var light = types && types.length == 1 && types[0] == 'density';\n\n var thisB = this;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.bamHolder.await(function (bam) {\n if (!bam) {\n thisB.busy--;\n thisB.notifyActivity();\n return callback(thisB.error || \"Couldn't fetch BAM\");\n }\n\n bam.fetch(chr, min, max, function (bamRecords, error) {\n thisB.busy--;\n thisB.notifyActivity();\n\n if (error) {\n callback(error, null, null);\n } else {\n var features = [];\n for (var ri = 0; ri < bamRecords.length; ++ri) {\n var r = bamRecords[ri];\n\n var f = bamRecordToFeature(r, thisB.opts.bamGroup);\n if (f) features.push(f);\n }\n callback(null, features, 1000000000);\n }\n }, { light: light });\n });\n};\n\nBAMFeatureSource.prototype.getScales = function () {\n return 1000000000;\n};\n\nBAMFeatureSource.prototype.getStyleSheet = function (callback) {\n this.bamHolder.await(function (bam) {\n var stylesheet = new DASStylesheet();\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'black';\n densStyle.COLOR2 = 'red';\n densStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'density' }, 'low', densStyle);\n stylesheet.pushStyle({ type: 'density' }, 'medium', densStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = '__SEQUENCE';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = false;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'bam' }, 'high', wigStyle);\n\n return callback(stylesheet);\n });\n};\n\nfunction RemoteBAMFeatureSource(bamSource, worker) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.bamSource = bamSource;\n this.worker = worker;\n this.opts = { credentials: bamSource.credentials, preflight: bamSource.preflight, bamGroup: bamSource.bamGroup };\n this.keyHolder = new Awaited();\n\n if (bamSource.resolver) {\n this.resolverKey = browser.registerResolver(bamSource.resolver);\n }\n\n this.init();\n}\n\nRemoteBAMFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nRemoteBAMFeatureSource.prototype.init = function () {\n var thisB = this;\n var uri = this.bamSource.uri || this.bamSource.bamURI;\n var indexUri = this.bamSource.indexUri || this.bamSource.baiURI || uri + '.bai';\n\n var blob = this.bamSource.bamBlob || this.bamSource.blob;\n var indexBlob = this.bamSource.baiBlob || this.bamSource.indexBlob;\n\n var cnt = function cnt(result, err) {\n thisB.readiness = null;\n thisB.notifyReadiness();\n\n if (result) {\n thisB.keyHolder.provide(result);\n } else {\n thisB.error = err;\n thisB.keyHolder.provide(null);\n }\n };\n\n if (blob) {\n this.worker.postCommand({ command: 'connectBAM', blob: blob, indexBlob: indexBlob }, cnt);\n } else {\n this.worker.postCommand({\n command: 'connectBAM',\n uri: resolveUrlToPage(uri),\n resolver: this.resolverKey,\n indexUri: resolveUrlToPage(indexUri),\n credentials: this.bamSource.credentials,\n indexChunks: this.bamSource.indexChunks }, cnt);\n }\n};\n\nRemoteBAMFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var light = types && types.length == 1 && types[0] == 'density';\n var thisB = this;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.keyHolder.await(function (key) {\n if (!key) {\n thisB.busy--;\n thisB.notifyActivity();\n return callback(thisB.error || \"Couldn't fetch BAM\");\n }\n\n thisB.worker.postCommand({ command: 'fetch', connection: key, chr: chr, min: min, max: max, opts: { light: light } }, function (bamRecords, error) {\n // console.log('retrieved ' + bamRecords.length + ' via worker.');\n\n thisB.busy--;\n thisB.notifyActivity();\n\n if (error) {\n callback(error, null, null);\n } else {\n var features = [];\n for (var ri = 0; ri < bamRecords.length; ++ri) {\n var r = bamRecords[ri];\n var f = bamRecordToFeature(r, thisB.opts.bamGroup);\n if (f) features.push(f);\n }\n callback(null, features, 1000000000);\n }\n });\n });\n};\n\nRemoteBAMFeatureSource.prototype.getScales = function () {\n return 1000000000;\n};\n\nRemoteBAMFeatureSource.prototype.getStyleSheet = function (callback) {\n this.keyHolder.await(function (bam) {\n var stylesheet = new DASStylesheet();\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'black';\n densStyle.COLOR2 = 'red';\n densStyle.HEIGHT = 30;\n stylesheet.pushStyle({ type: 'density' }, 'low', densStyle);\n stylesheet.pushStyle({ type: 'density' }, 'medium', densStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = '__SEQUENCE';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = false;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'bam' }, 'high', wigStyle);\n return callback(stylesheet);\n });\n};\n\nfunction MappedFeatureSource(source, mapping) {\n this.source = source;\n this.mapping = mapping;\n\n this.activityListeners = [];\n this.busy = 0;\n}\n\nMappedFeatureSource.prototype.addActivityListener = function (listener) {\n this.activityListeners.push(listener);\n};\n\nMappedFeatureSource.prototype.removeActivityListener = function (listener) {\n var idx = arrayIndexOf(this.activityListeners, listener);\n if (idx >= 0) this.activityListeners.splice(idx, 0);\n};\n\nMappedFeatureSource.prototype.notifyActivity = function () {\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nMappedFeatureSource.prototype.getStyleSheet = function (callback) {\n return this.source.getStyleSheet(callback);\n};\n\nMappedFeatureSource.prototype.getScales = function () {\n return this.source.getScales();\n};\n\nMappedFeatureSource.prototype.getDefaultFIPs = function (callback) {\n if (this.source.getDefaultFIPs) return this.source.getDefaultFIPs(callback);\n};\n\nMappedFeatureSource.prototype.simplifySegments = function (segs, minGap) {\n if (segs.length === 0) return segs;\n\n segs.sort(function (s1, s2) {\n var d = s1.name - s2.name;\n if (d) return d;\n d = s1.start - s2.start;\n if (d) return d;\n return s1.end - s2.end; // Should never come to this...?\n });\n\n var ssegs = [];\n var currentSeg = segs[0];\n for (var si = 0; si < segs.length; ++si) {\n var ns = segs[si];\n\n // console.log(ns.name + ' ' + ns.start + ' ' + ns.end);\n if (ns.name != currentSeg.name || ns.start > currentSeg.end + minGap) {\n ssegs.push(currentSeg);\n currentSeg = ns;\n } else {\n currentSeg = new DASSegment(currentSeg.name, Math.min(currentSeg.start, ns.start), Math.max(currentSeg.end, ns.end));\n }\n }\n ssegs.push(currentSeg);\n return ssegs;\n};\n\nMappedFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback, styleFilters) {\n var thisB = this;\n var fetchLength = max - min + 1;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.mapping.sourceBlocksForRange(chr, min, max, function (mseg) {\n if (mseg.length === 0) {\n thisB.busy--;\n thisB.notifyActivity();\n\n callback(\"No mapping available for this regions\", [], scale);\n } else {\n mseg = thisB.simplifySegments(mseg, Math.max(100, 0.05 * fetchLength));\n\n var mappedFeatures = [];\n var mappedLoc = null;\n var count = mseg.length;\n var finalStatus;\n\n mseg.map(function (seg) {\n thisB.source.fetch(seg.name, seg.start, seg.end, scale, types, pool, function (status, features, fscale) {\n if (status && !finalStatus) finalStatus = status;\n\n if (features) {\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n var sn = f.segment;\n if (sn.indexOf('chr') === 0) {\n sn = sn.substr(3);\n }\n\n var mappings = thisB.mapping.mapSegment(sn, f.min, f.max);\n\n if (mappings.length === 0) {\n if (f.parts && f.parts.length > 0) {\n mappedFeatures.push(f);\n }\n } else {\n for (var mi = 0; mi < mappings.length; ++mi) {\n var m = mappings[mi];\n var mf = shallowCopy(f);\n mf.segment = m.segment;\n mf.min = m.min;\n mf.max = m.max;\n if (m.partialMin) mf.partialMin = m.partialMin;\n if (m.partialMax) mf.partialMax = m.partialMax;\n\n if (m.flipped) {\n if (f.orientation == '-') {\n mf.orientation = '+';\n } else if (f.orientation == '+') {\n mf.orientation = '-';\n }\n }\n mappedFeatures.push(mf);\n }\n }\n }\n }\n\n var m1 = thisB.mapping.mapPoint(seg.name, seg.start);\n var m2 = thisB.mapping.mapPoint(seg.name, seg.end);\n\n if (m1 && m2) {\n var segDestCoverage = new Range(m1.pos, m2.pos);\n if (mappedLoc) mappedLoc = union(mappedLoc, segDestCoverage);else mappedLoc = segDestCoverage;\n }\n\n --count;\n if (count === 0) {\n thisB.busy--;\n thisB.notifyActivity();\n callback(finalStatus, mappedFeatures, fscale, mappedLoc);\n }\n }, styleFilters);\n });\n }\n });\n};\n\nfunction DummyFeatureSource() {}\n\nDummyFeatureSource.prototype.getScales = function () {\n return null;\n};\n\nDummyFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, cnt) {\n return cnt(null, [], 1000000000);\n};\n\nDummyFeatureSource.prototype.getStyleSheet = function (callback) {\n var stylesheet = new DASStylesheet();\n var defStyle = new DASStyle();\n defStyle.glyph = 'BOX';\n defStyle.BGCOLOR = 'blue';\n defStyle.FGCOLOR = 'black';\n stylesheet.pushStyle({ type: 'default' }, null, defStyle);\n return callback(stylesheet);\n};\n\nfunction DummySequenceSource() {}\n\nDummySequenceSource.prototype.fetch = function (chr, min, max, pool, cnt) {\n return cnt(null, null);\n};\n\nfunction JBrowseFeatureSource(source) {\n this.store = new JBrowseStore(source.jbURI, source.jbQuery);\n}\n\nJBrowseFeatureSource.prototype.getScales = function () {\n return null;\n};\n\nJBrowseFeatureSource.prototype.getStyleSheet = function (callback) {\n var stylesheet = new DASStylesheet();\n\n var cdsStyle = new DASStyle();\n cdsStyle.glyph = 'BOX';\n cdsStyle.FGCOLOR = 'black';\n cdsStyle.BGCOLOR = 'red';\n cdsStyle.HEIGHT = 10;\n cdsStyle.BUMP = true;\n cdsStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'translation' }, null, cdsStyle);\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({ type: 'transcript' }, null, tsStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'green';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n\n return callback(stylesheet);\n};\n\nJBrowseFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n if (types && types.length === 0) {\n callback(null, [], scale);\n return;\n }\n\n var fops = {};\n\n this.store.features(new DASSegment(chr, min, max), fops, function (features, status) {\n callback(status, features, 100000);\n });\n};\n\nBrowser.prototype.sourceAdapterIsCapable = function (s, cap) {\n if (!s.capabilities) return false;else return s.capabilities()[cap];\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n FeatureSourceBase: FeatureSourceBase,\n\n TwoBitSequenceSource: TwoBitSequenceSource,\n EnsemblSequenceSource: EnsemblSequenceSource,\n DASSequenceSource: DASSequenceSource,\n MappedFeatureSource: MappedFeatureSource,\n CachingFeatureSource: CachingFeatureSource,\n BWGFeatureSource: BWGFeatureSource,\n RemoteBWGFeatureSource: RemoteBWGFeatureSource,\n BAMFeatureSource: BAMFeatureSource,\n RemoteBAMFeatureSource: RemoteBAMFeatureSource,\n DummyFeatureSource: DummyFeatureSource,\n DummySequenceSource: DummySequenceSource,\n\n registerSourceAdapterFactory: dalliance_registerSourceAdapterFactory,\n registerParserFactory: dalliance_registerParserFactory,\n makeParser: dalliance_makeParser\n };\n\n // Standard set of plugins.\n require('./ensembljson');\n //---START MOLGENIS CUSTOM CODE---\n require('./molgenisjson');\n //---END MOLGENIS CUSTOM CODE---\n require('./tabix-source');\n require('./memstore');\n require('./bedwig');\n require('./vcf');\n require('./test-source');\n}\n\n},{\"./bam\":1,\"./bedwig\":2,\"./bigwig\":3,\"./bin\":4,\"./cbrowser\":6,\"./chainset\":7,\"./cigar\":8,\"./das\":10,\"./encode\":14,\"./ensembljson\":15,\"./jbjson\":24,\"./memstore\":27,\"./molgenisjson\":28,\"./overlay\":31,\"./spans\":41,\"./style\":42,\"./tabix-source\":46,\"./test-source\":48,\"./tier\":52,\"./twoBit\":55,\"./utils\":56,\"./vcf\":57}],40:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2015\n//\n// sourcecompare.js\n//\n\n\nfunction sourceDataURI(conf) {\n if (conf.uri) {\n return conf.uri;\n } else if (conf.blob) {\n return 'file:' + conf.blob.name;\n } else if (conf.bwgBlob) {\n return 'file:' + conf.bwgBlob.name;\n } else if (conf.bamBlob) {\n return 'file:' + conf.bamBlob.name;\n } else if (conf.twoBitBlob) {\n return 'file:' + conf.twoBitBlob.name;\n }\n\n return conf.bwgURI || conf.bamURI || conf.jbURI || conf.twoBitURI || 'https://www.biodalliance.org/magic/no_uri';\n}\n\nfunction sourceStyleURI(conf) {\n if (conf.stylesheet_uri) return conf.stylesheet_uri;else if (conf.tier_type == 'sequence' || conf.twoBitURI || conf.twoBitBlob) return 'https://www.biodalliance.org/magic/sequence';else return sourceDataURI(conf);\n}\n\nfunction sourcesAreEqualModuloStyle(a, b) {\n if (sourceDataURI(a) != sourceDataURI(b)) return false;\n\n if (a.mapping != b.mapping) return false;\n\n if (a.tier_type != b.tier_type) return false;\n\n if (a.overlay) {\n if (!b.overlay || b.overlay.length != a.overlay.length) return false;\n for (var oi = 0; oi < a.overlay.length; ++oi) {\n if (!sourcesAreEqualModuloStyle(a.overlay[oi], b.overlay[oi])) return false;\n }\n } else {\n if (b.overlay) return false;\n }\n\n return true;\n}\n\nfunction sourcesAreEqual(a, b) {\n if (sourceDataURI(a) != sourceDataURI(b) || sourceStyleURI(a) != sourceStyleURI(b)) return false;\n\n if (a.mapping != b.mapping) return false;\n\n if (a.tier_type != b.tier_type) return false;\n\n if (a.overlay) {\n if (!b.overlay || b.overlay.length != a.overlay.length) return false;\n for (var oi = 0; oi < a.overlay.length; ++oi) {\n if (!sourcesAreEqual(a.overlay[oi], b.overlay[oi])) return false;\n }\n } else {\n if (b.overlay) return false;\n }\n\n return true;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n sourcesAreEqual: sourcesAreEqual,\n sourcesAreEqualModuloStyle: sourcesAreEqualModuloStyle,\n sourceDataURI: sourceDataURI,\n sourceStyleURI: sourceStyleURI\n };\n}\n\n},{}],41:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// spans.js: JavaScript Intset/Location port.\n//\n\n\"use strict\";\n\nfunction Range(min, max) {\n if (typeof min != 'number' || typeof max != 'number') throw 'Bad range ' + min + ',' + max;\n this._min = min;\n this._max = max;\n}\n\nRange.prototype.min = function () {\n return this._min;\n};\n\nRange.prototype.max = function () {\n return this._max;\n};\n\nRange.prototype.contains = function (pos) {\n return pos >= this._min && pos <= this._max;\n};\n\nRange.prototype.isContiguous = function () {\n return true;\n};\n\nRange.prototype.ranges = function () {\n return [this];\n};\n\nRange.prototype._pushRanges = function (ranges) {\n ranges.push(this);\n};\n\nRange.prototype.toString = function () {\n return '[' + this._min + '-' + this._max + ']';\n};\n\nfunction _Compound(ranges) {\n // given: a set of unsorted possibly overlapping ranges\n // sort the input ranges\n var sorted = ranges.sort(_rangeOrder);\n // merge overlaps between adjacent ranges\n var merged = [];\n var current = sorted.shift();\n sorted.forEach(function (range) {\n if (range._min <= current._max) {\n if (range._max > current._max) {\n current._max = range._max;\n }\n } else {\n merged.push(current);\n current = range;\n }\n });\n merged.push(current);\n this._ranges = merged;\n}\n\n_Compound.prototype.min = function () {\n return this._ranges[0].min();\n};\n\n_Compound.prototype.max = function () {\n return this._ranges[this._ranges.length - 1].max();\n};\n\n// returns the index of the first range that is not less than pos\n_Compound.prototype.lower_bound = function (pos) {\n // first check if pos is out of range\n var r = this.ranges();\n if (pos > this.max()) return r.length;\n if (pos < this.min()) return 0;\n // do a binary search\n var a = 0,\n b = r.length - 1;\n while (a <= b) {\n var m = Math.floor((a + b) / 2);\n if (pos > r[m]._max) {\n a = m + 1;\n } else if (pos < r[m]._min) {\n b = m - 1;\n } else {\n return m;\n }\n }\n return a;\n};\n\n_Compound.prototype.contains = function (pos) {\n var lb = this.lower_bound(pos);\n if (lb < this._ranges.length && this._ranges[lb].contains(pos)) {\n return true;\n }\n return false;\n};\n\n_Compound.prototype.insertRange = function (range) {\n var lb = this.lower_bound(range._min);\n if (lb === this._ranges.length) {\n // range follows this\n this._ranges.push(range);\n return;\n }\n\n var r = this.ranges();\n if (range._max < r[lb]._min) {\n // range preceeds lb\n this._ranges.splice(lb, 0, range);\n return;\n }\n\n // range overlaps lb (at least)\n if (r[lb]._min < range._min) range._min = r[lb]._min;\n var ub = lb + 1;\n while (ub < r.length && r[ub]._min <= range._max) {\n ub++;\n }\n ub--;\n // ub is the upper bound of the new range\n if (r[ub]._max > range._max) range._max = r[ub]._max;\n\n // splice range into this._ranges\n this._ranges.splice(lb, ub - lb + 1, range);\n return;\n};\n\n_Compound.prototype.isContiguous = function () {\n return this._ranges.length > 1;\n};\n\n_Compound.prototype.ranges = function () {\n return this._ranges;\n};\n\n_Compound.prototype._pushRanges = function (ranges) {\n for (var ri = 0; ri < this._ranges.length; ++ri) {\n ranges.push(this._ranges[ri]);\n }\n};\n\n_Compound.prototype.toString = function () {\n var s = '';\n for (var r = 0; r < this._ranges.length; ++r) {\n if (r > 0) {\n s = s + ',';\n }\n s = s + this._ranges[r].toString();\n }\n return s;\n};\n\nfunction union(s0, s1) {\n if (!(s0 instanceof _Compound)) {\n if (!(s0 instanceof Array)) s0 = [s0];\n s0 = new _Compound(s0);\n }\n\n if (s1) s0.insertRange(s1);\n\n return s0;\n}\n\nfunction intersection(s0, s1) {\n var r0 = s0.ranges();\n var r1 = s1.ranges();\n var l0 = r0.length,\n l1 = r1.length;\n var i0 = 0,\n i1 = 0;\n var or = [];\n\n while (i0 < l0 && i1 < l1) {\n var s0 = r0[i0],\n s1 = r1[i1];\n var lapMin = Math.max(s0.min(), s1.min());\n var lapMax = Math.min(s0.max(), s1.max());\n if (lapMax >= lapMin) {\n or.push(new Range(lapMin, lapMax));\n }\n if (s0.max() > s1.max()) {\n ++i1;\n } else {\n ++i0;\n }\n }\n\n if (or.length == 0) {\n return null; // FIXME\n } else if (or.length == 1) {\n return or[0];\n } else {\n return new _Compound(or);\n }\n}\n\nfunction coverage(s) {\n var tot = 0;\n var rl = s.ranges();\n for (var ri = 0; ri < rl.length; ++ri) {\n var r = rl[ri];\n tot += r.max() - r.min() + 1;\n }\n return tot;\n}\n\nfunction rangeOrder(a, b) {\n if (a.min() < b.min()) {\n return -1;\n } else if (a.min() > b.min()) {\n return 1;\n } else if (a.max() < b.max()) {\n return -1;\n } else if (b.max() > a.max()) {\n return 1;\n } else {\n return 0;\n }\n}\n\nfunction _rangeOrder(a, b) {\n if (a._min < b._min) {\n return -1;\n } else if (a._min > b._min) {\n return 1;\n } else if (a._max < b._max) {\n return -1;\n } else if (b._max > a._max) {\n return 1;\n } else {\n return 0;\n }\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n Range: Range,\n union: union,\n intersection: intersection,\n coverage: coverage,\n rangeOver: rangeOrder,\n _rangeOrder: _rangeOrder\n };\n}\n\n},{}],42:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2014\n//\n// style.js\n//\n\n\"use strict\";\n\nfunction StyleFilter(type, method, label) {\n this.type = type;\n this.method = method;\n this.label = label;\n}\n\nStyleFilter.prototype.equals = function (o) {\n return this.type == o.type && this.method == o.method && this.label == o.label;\n};\n\nStyleFilter.prototype.toString = function () {\n var fs = [];\n if (this.type) fs.push('type=' + this.type);\n if (this.method) fs.push('method=' + this.method);\n if (this.label) fs.push('label=' + this.label);\n return 'StyleFilter<' + fs.join(';') + '>';\n};\n\nfunction StyleFilterSet(filters) {\n this._filters = {};\n if (filters) {\n for (var fi = 0; fi < filters.length; ++fi) {\n this.add(filters[fi]);\n }\n }\n}\n\nStyleFilterSet.prototype.add = function (filter) {\n var fs = filter.toString();\n if (!this._filters[fs]) {\n this._filters[fs] = filter;\n this._list = null;\n }\n};\n\nStyleFilterSet.prototype.addAll = function (filterSet) {\n var l = filterSet.list();\n for (var fi = 0; fi < l.length; ++fi) {\n this.add(l[fi]);\n }\n};\n\nStyleFilterSet.prototype.doesNotContain = function (filterSet) {\n var l = filterSet.list();\n for (var fi = 0; fi < l.length; ++fi) {\n if (!this._filters[fi.toString()]) return true;\n }\n return false;\n};\n\nStyleFilterSet.prototype.list = function () {\n if (!this._list) {\n this._list = [];\n for (var k in this._filters) {\n if (this._filters.hasOwnProperty(k)) {\n this._list.push(this._filters[k]);\n }\n }\n }\n return this._list;\n};\n\nStyleFilterSet.prototype.typeList = function () {\n var types = [];\n var list = this.list();\n for (var fi = 0; fi < list.length; ++fi) {\n var filter = list[fi];\n var type = filter.type;\n if (!type || type == 'default') return null;\n if (types.indexOf(type) < 0) types.push(type);\n }\n return types;\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n StyleFilter: StyleFilter,\n StyleFilterSet: StyleFilterSet\n };\n}\n\n},{}],43:[function(require,module,exports){\n/* jshint esversion: 6 */\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.renderTier = renderTier;\nexports.drawTier = drawTier;\n\n/* To be used by tiers which are to be drawn in a multitier\n using the multi-renderer.\n\n Subtiers are configured by adding the following to a tier's source configuration:\n renderer: 'sub',\n sub: {\n multi_id: \"multi_1\",\n offset: 130,\n z: 2,\n }\n This would define a subtier that's to be rendered in the multi-tier with\n id \"multi_1\", with the top of the subtier at 130 pixels and at z-index 2.\n */\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\n// drawTier is called when this tier's data has been fetched,\n// so by refreshing the multiTier from here, we can be sure that\n// there's something new worth drawing in it\nfunction drawTier(tier) {\n var browser = tier.browser;\n\n var multiTier = browser.tiers.filter(function (t) {\n return t.dasSource.renderer === 'multi' && t.dasSource.multi.multi_id === tier.dasSource.sub.multi_id;\n });\n\n multiTier.forEach(function (t) {\n return browser.refreshTier(t);\n });\n}\n\n},{}],44:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// svg-export.js\n//\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var makeElementNS = utils.makeElementNS;\n\n var VERSION = require('./version');\n\n var svgSeqTier = require('./sequence-draw').svgSeqTier;\n\n var svgu = require('./svg-utils');\n var NS_SVG = svgu.NS_SVG;\n var NS_XLINK = svgu.NS_XLINK;\n var SVGPath = svgu.SVGPath;\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n var formatLongInt = nf.formatLongInt;\n}\n\nBrowser.prototype.makeSVG = function (opts) {\n opts = opts || {};\n var minTierHeight = opts.minTierHeight || 20;\n var padding = 3;\n var fpw = opts.width || this.featurePanelWidth;\n\n var backupFPW = this.featurePanelWidth;\n var backupScale = this.scale;\n this.featurePanelWidth = fpw;\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n\n var b = this;\n var saveDoc = document.implementation.createDocument(NS_SVG, 'svg', null);\n\n var saveRoot = makeElementNS(NS_SVG, 'g', null, {\n fontFamily: 'helvetica',\n fontSize: '8pt'\n });\n saveDoc.documentElement.appendChild(saveRoot);\n\n var margin = 200;\n\n if (opts.banner) {\n var dallianceAnchor = makeElementNS(NS_SVG, 'a', makeElementNS(NS_SVG, 'text', 'Graphics from Biodalliance ' + VERSION, {\n x: b.featurePanelWidth + margin - 100,\n y: 35,\n strokeWidth: 0,\n fontSize: '12pt',\n textAnchor: 'end',\n fill: 'blue'\n }));\n dallianceAnchor.setAttribute('xmlns:xlink', NS_XLINK);\n dallianceAnchor.setAttribute('xlink:href', 'http://www.biodalliance.org/');\n\n saveRoot.appendChild(dallianceAnchor);\n }\n\n if (opts.region) {\n saveRoot.appendChild(makeElementNS(NS_SVG, 'text', this.chr + ':' + formatLongInt(this.viewStart) + '..' + formatLongInt(this.viewEnd), {\n x: margin + 100,\n y: 35,\n strokeWidth: 0,\n fontSize: '12pt',\n textAnchor: 'start'\n }));\n }\n\n var clipRect = makeElementNS(NS_SVG, 'rect', null, {\n x: margin,\n y: 50,\n width: b.featurePanelWidth,\n height: 100000\n });\n var clip = makeElementNS(NS_SVG, 'clipPath', clipRect, { id: 'featureClip' });\n saveRoot.appendChild(clip);\n\n var pos = 70;\n var tierHolder = makeElementNS(NS_SVG, 'g', null, {});\n\n for (var ti = 0; ti < b.tiers.length; ++ti) {\n var tier = b.tiers[ti];\n tier.backupSubtiers = tier.subtiers;\n tier.backupOriginHaxx = tier.originHaxx;\n tier.backupLayoutHeight = tier.layoutHeight;\n\n var renderer = b.getTierRenderer(tier);\n if (renderer && renderer.prepareSubtiers) {\n renderer.prepareSubtiers(tier, tier.viewport.getContext('2d'));\n }\n\n var tierSVG = makeElementNS(NS_SVG, 'g', null, { clipPath: 'url(#featureClip)', clipRule: 'nonzero' });\n var tierLabels = makeElementNS(NS_SVG, 'g');\n var tierTopPos = pos;\n\n var tierBackground = makeElementNS(NS_SVG, 'rect', null, { x: 0, y: tierTopPos, width: '10000', height: 50, fill: tier.background });\n tierSVG.appendChild(tierBackground);\n\n if (tier.sequenceSource) {\n var seqTrack = svgSeqTier(tier, tier.currentSequence);\n\n tierSVG.appendChild(makeElementNS(NS_SVG, 'g', seqTrack, { transform: 'translate(' + margin + ', ' + pos + ')' }));\n pos += 80;\n } else {\n if (!tier.subtiers) {\n continue;\n }\n\n var offset = (tier.glyphCacheOrigin - b.viewStart) * b.scale;\n var hasQuant = false;\n for (var sti = 0; sti < tier.subtiers.length; ++sti) {\n pos += padding;\n var subtier = tier.subtiers[sti];\n\n var glyphElements = [];\n for (var gi = 0; gi < subtier.glyphs.length; ++gi) {\n var glyph = subtier.glyphs[gi];\n glyphElements.push(glyph.toSVG());\n }\n\n tierSVG.appendChild(makeElementNS(NS_SVG, 'g', glyphElements, { transform: 'translate(' + (margin + offset) + ', ' + pos + ')' }));\n\n if (subtier.quant) {\n hasQuant = true;\n var q = subtier.quant;\n var h = subtier.height;\n\n var numTics = 2;\n if (h > 40) {\n numTics = 1 + (h / 20 | 0);\n }\n var ticSpacing = h / (numTics - 1);\n var ticInterval = (q.max - q.min) / (numTics - 1);\n\n var path = new SVGPath();\n path.moveTo(margin + 5, pos);\n path.lineTo(margin, pos);\n path.lineTo(margin, pos + subtier.height);\n path.lineTo(margin + 5, pos + subtier.height);\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n path.moveTo(margin, pos + ty);\n path.lineTo(margin + 3, pos + ty);\n }\n\n tierLabels.appendChild(makeElementNS(NS_SVG, 'path', null, { d: path.toPathData(), fill: 'none', stroke: 'black', strokeWidth: '2px' }));\n tierLabels.appendChild(makeElementNS(NS_SVG, 'text', formatQuantLabel(q.max), { x: margin - 3, y: pos + 7, textAnchor: 'end' }));\n tierLabels.appendChild(makeElementNS(NS_SVG, 'text', formatQuantLabel(q.min), { x: margin - 3, y: pos + subtier.height, textAnchor: 'end' }));\n for (var t = 1; t < numTics - 1; ++t) {\n var ty = t * ticSpacing;\n tierLabels.appendChild(makeElementNS(NS_SVG, 'text', formatQuantLabel(1.0 * q.max - t * ticInterval), { x: margin - 3, y: pos + ty + 3, textAnchor: 'end' }));\n }\n }\n\n pos += subtier.height + padding;\n }\n\n if (pos - tierTopPos < minTierHeight) {\n pos = tierTopPos + minTierHeight;\n }\n }\n\n var labelName;\n if (typeof tier.config.name === 'string') labelName = tier.config.name;else labelName = tier.dasSource.name;\n tierLabels.appendChild(makeElementNS(NS_SVG, 'text', labelName, { x: margin - (hasQuant ? 20 : 12), y: (pos + tierTopPos + 8) / 2, fontSize: '10pt', textAnchor: 'end' }));\n\n tierBackground.setAttribute('height', pos - tierTopPos);\n tierHolder.appendChild(makeElementNS(NS_SVG, 'g', [tierSVG, tierLabels]));\n\n tier.subtiers = tier.backupSubtiers;\n tier.originHaxx = tier.backupOriginHaxx;\n tier.layoutHeight = tier.backupLayoutHeight;\n }\n\n if (opts.highlights) {\n var highlights = this.highlights || [];\n for (var hi = 0; hi < highlights.length; ++hi) {\n var h = highlights[hi];\n if ((h.chr == this.chr || h.chr == 'chr' + this.chr) && h.min < this.viewEnd && h.max > this.viewStart) {\n var tmin = (Math.max(h.min, this.viewStart) - this.viewStart) * this.scale;\n var tmax = (Math.min(h.max, this.viewEnd) - this.viewStart) * this.scale;\n\n tierHolder.appendChild(makeElementNS(NS_SVG, 'rect', null, { x: margin + tmin, y: 70, width: tmax - tmin, height: pos - 70,\n stroke: 'none', fill: this.defaultHighlightFill, fillOpacity: this.defaultHighlightAlpha }));\n }\n }\n }\n\n var rulerPos = -1;\n if (opts.ruler == 'center') {\n rulerPos = margin + (this.viewEnd - this.viewStart) * this.scale / 2;\n } else if (opts.ruler == 'left') {\n rulerPos = margin;\n } else if (opts.ruler == 'right') {\n rulerPos = margin + (this.viewEnd - this.viewStart) * this.scale;\n }\n if (rulerPos >= 0) {\n tierHolder.appendChild(makeElementNS(NS_SVG, 'line', null, { x1: rulerPos, y1: 70, x2: rulerPos, y2: pos,\n stroke: 'blue' }));\n }\n\n saveRoot.appendChild(tierHolder);\n saveDoc.documentElement.setAttribute('width', b.featurePanelWidth + 20 + margin);\n saveDoc.documentElement.setAttribute('height', pos + 50);\n\n this.featurePanelWidth = backupFPW;\n this.scale = backupScale;\n\n var svg = void 0;\n if (typeof XMLSerializer !== 'undefined') {\n svg = new XMLSerializer().serializeToString(saveDoc);\n } else {\n var root = saveDoc.documentElement;\n root.setAttribute('xmlns', 'http://www.w3.org/2000/svg');\n svg = root.outerHTML;\n }\n\n if (opts.output && opts.output === 'string') {\n return svg;\n } else {\n return new Blob([svg], { type: 'image/svg+xml' });\n }\n};\n\n},{\"./cbrowser\":6,\"./numformats\":30,\"./sequence-draw\":36,\"./svg-utils\":45,\"./utils\":56,\"./version\":58}],45:[function(require,module,exports){\n'use strict';\n\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// svg-utils.js\n//\n\nvar NS_SVG = 'http://www.w3.org/2000/svg';\nvar NS_XLINK = 'http://www.w3.org/1999/xlink';\n\nfunction SVGPath() {\n this.ops = [];\n}\n\nSVGPath.prototype.moveTo = function (x, y) {\n this.ops.push('M ' + x + ' ' + y);\n};\n\nSVGPath.prototype.lineTo = function (x, y) {\n this.ops.push('L ' + x + ' ' + y);\n};\n\nSVGPath.prototype.closePath = function () {\n this.ops.push('Z');\n};\n\nSVGPath.prototype.toPathData = function () {\n return this.ops.join(' ');\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n NS_SVG: NS_SVG,\n NS_XLINK: NS_XLINK,\n SVGPath: SVGPath\n };\n}\n\n},{}],46:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// tabix-source.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var dalliance_makeParser = sa.makeParser;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n\n var connectTabix = require('./tabix').connectTabix;\n}\n\nfunction TabixFeatureSource(source) {\n FeatureSourceBase.call(this);\n this.readiness = 'Connecting';\n this.source = source;\n\n this.tabixHolder = new Awaited();\n var thisB = this;\n\n var parser = dalliance_makeParser(source.payload);\n if (!parser) {\n throw 'Unsuported tabix payload ' + source.payload;\n } else {\n this.parser = parser;\n }\n\n var data, index;\n if (this.source.blob) {\n data = new BlobFetchable(this.source.blob);\n index = new BlobFetchable(this.source.indexBlob);\n } else {\n data = new URLFetchable(this.source.uri, { credentials: this.source.credentials, resolver: this.source.resolver });\n index = new URLFetchable(this.source.indexURI || this.source.uri + '.tbi', { credentials: this.source.credentials, resolver: this.source.resolver });\n }\n connectTabix(data, index, function (tabix, err) {\n thisB.tabixHolder.provide(tabix);\n tabix.fetchHeader(function (lines, err) {\n if (lines) {\n var session = parser.createSession(function () {/* Null sink because we shouldn't get records */});\n for (var li = 0; li < lines.length; ++li) {\n session.parse(lines[li]);\n }\n session.flush();\n }\n });\n thisB.readiness = null;\n thisB.notifyReadiness();\n });\n}\n\nTabixFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nTabixFeatureSource.prototype.fetch = function (chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.tabixHolder.await(function (tabix) {\n tabix.fetch(chr, min, max, function (records, error) {\n thisB.busy--;\n thisB.notifyActivity();\n\n var features = [];\n var session = thisB.parser.createSession(function (f) {\n features.push(f);\n });\n for (var ri = 0; ri < records.length; ++ri) {\n var f = session.parse(records[ri]);\n }\n session.flush();\n callback(null, features, 1000000000);\n });\n });\n};\n\nTabixFeatureSource.prototype.getStyleSheet = function (callback) {\n if (this.parser && this.parser.getStyleSheet) this.parser.getStyleSheet(callback);\n};\n\nTabixFeatureSource.prototype.getDefaultFIPs = function (callback) {\n if (this.parser && this.parser.getDefaultFIPs) this.parser.getDefaultFIPs(callback);\n};\n\ndalliance_registerSourceAdapterFactory('tabix', function (source) {\n return { features: new TabixFeatureSource(source) };\n});\n\n},{\"./bin\":4,\"./sourceadapters\":39,\"./tabix\":47,\"./utils\":56}],47:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// tabix.js: basic support for tabix-indexed flatfiles\n//\n\n\"use strict\";\n\nvar TABIX_MAGIC = 0x01494254;\n\nif (typeof require !== 'undefined') {\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var bin = require('./bin');\n var readInt = bin.readInt;\n var readShort = bin.readShort;\n var readByte = bin.readByte;\n var readInt64 = bin.readInt64;\n var readFloat = bin.readFloat;\n\n var lh3utils = require('./lh3utils');\n var readVob = lh3utils.readVob;\n var unbgzf = lh3utils.unbgzf;\n var reg2bins = lh3utils.reg2bins;\n var Chunk = lh3utils.Chunk;\n}\n\nfunction TabixFile() {}\n\nfunction connectTabix(data, tbi, callback) {\n var tabix = new TabixFile();\n tabix.data = data;\n tabix.tbi = tbi;\n\n tabix.tbi.fetch(function (header) {\n // Do we really need to fetch the whole thing? :-(\n if (!header) {\n return callback(null, \"Couldn't access Tabix\");\n }\n\n var unchead = unbgzf(header, header.byteLength);\n var uncba = new Uint8Array(unchead);\n var magic = readInt(uncba, 0);\n if (magic != TABIX_MAGIC) {\n return callback(null, 'Not a tabix index');\n }\n\n var nref = readInt(uncba, 4);\n tabix.format = readInt(uncba, 8);\n tabix.colSeq = readInt(uncba, 12);\n tabix.colStart = readInt(uncba, 16);\n tabix.colEnd = readInt(uncba, 20);\n tabix.meta = readInt(uncba, 24);\n tabix.skip = readInt(uncba, 28);\n var nameLength = readInt(uncba, 32);\n\n tabix.indices = [];\n\n var p = 36;\n tabix.chrToIndex = {};\n tabix.indexToChr = [];\n for (var i = 0; i < nref; ++i) {\n var name = '';\n\n while (true) {\n var ch = uncba[p++];\n if (ch == 0) break;\n\n name += String.fromCharCode(ch);\n }\n\n tabix.chrToIndex[name] = i;\n if (name.indexOf('chr') == 0) {\n tabix.chrToIndex[name.substring(3)] = i;\n } else {\n tabix.chrToIndex['chr' + name] = i;\n }\n tabix.indexToChr.push(name);\n }\n\n var minBlockIndex = 1000000000;\n for (var ref = 0; ref < nref; ++ref) {\n var blockStart = p;\n var nbin = readInt(uncba, p);p += 4;\n for (var b = 0; b < nbin; ++b) {\n var bin = readInt(uncba, p);\n var nchnk = readInt(uncba, p + 4);\n p += 8 + nchnk * 16;\n }\n var nintv = readInt(uncba, p);p += 4;\n\n var q = p;\n for (var i = 0; i < nintv; ++i) {\n var v = readVob(uncba, q);q += 8;\n if (v) {\n var bi = v.block;\n if (v.offset > 0) bi += 65536;\n\n if (bi < minBlockIndex) minBlockIndex = bi;\n break;\n }\n }\n p += nintv * 8;\n\n var ub = uncba;\n if (nbin > 0) {\n tabix.indices[ref] = new Uint8Array(unchead, blockStart, p - blockStart);\n }\n }\n\n tabix.headerMax = minBlockIndex;\n\n callback(tabix);\n }, { timeout: 50000 });\n}\n\n// Copy-paste from BamFile\n\nTabixFile.prototype.blocksForRange = function (refId, min, max) {\n var index = this.indices[refId];\n if (!index) {\n return [];\n }\n\n var intBinsL = reg2bins(min, max);\n var intBins = [];\n for (var i = 0; i < intBinsL.length; ++i) {\n intBins[intBinsL[i]] = true;\n }\n var leafChunks = [],\n otherChunks = [];\n\n var nbin = readInt(index, 0);\n var p = 4;\n for (var b = 0; b < nbin; ++b) {\n var bin = readInt(index, p);\n var nchnk = readInt(index, p + 4);\n p += 8;\n if (intBins[bin]) {\n for (var c = 0; c < nchnk; ++c) {\n var cs = readVob(index, p, true);\n var ce = readVob(index, p + 8, true);\n (bin < 4681 ? otherChunks : leafChunks).push(new Chunk(cs, ce));\n p += 16;\n }\n } else {\n p += nchnk * 16;\n }\n }\n\n var nintv = readInt(index, p);\n var lowest = null;\n var minLin = Math.min(min >> 14, nintv - 1),\n maxLin = Math.min(max >> 14, nintv - 1);\n for (var i = minLin; i <= maxLin; ++i) {\n var lb = readVob(index, p + 4 + i * 8);\n if (!lb) {\n continue;\n }\n if (!lowest || lb.block < lowest.block || lb.offset < lowest.offset) {\n lowest = lb;\n }\n }\n\n var prunedOtherChunks = [];\n if (lowest != null) {\n for (var i = 0; i < otherChunks.length; ++i) {\n var chnk = otherChunks[i];\n if (chnk.maxv.block >= lowest.block && chnk.maxv.offset >= lowest.offset) {\n prunedOtherChunks.push(chnk);\n }\n }\n }\n otherChunks = prunedOtherChunks;\n\n var intChunks = [];\n for (var i = 0; i < otherChunks.length; ++i) {\n intChunks.push(otherChunks[i]);\n }\n for (var i = 0; i < leafChunks.length; ++i) {\n intChunks.push(leafChunks[i]);\n }\n\n intChunks.sort(function (c0, c1) {\n var dif = c0.minv.block - c1.minv.block;\n if (dif != 0) {\n return dif;\n } else {\n return c0.minv.offset - c1.minv.offset;\n }\n });\n var mergedChunks = [];\n if (intChunks.length > 0) {\n var cur = intChunks[0];\n for (var i = 1; i < intChunks.length; ++i) {\n var nc = intChunks[i];\n if (nc.minv.block == cur.maxv.block /* && nc.minv.offset == cur.maxv.offset */) {\n // no point splitting mid-block\n cur = new Chunk(cur.minv, nc.maxv);\n } else {\n mergedChunks.push(cur);\n cur = nc;\n }\n }\n mergedChunks.push(cur);\n }\n\n return mergedChunks;\n};\n\nTabixFile.prototype.fetch = function (chr, min, max, callback) {\n var thisB = this;\n\n var chrId = this.chrToIndex[chr];\n if (chrId == undefined) return callback([]);\n\n var canonicalChr = this.indexToChr[chrId];\n\n var chunks;\n if (chrId === undefined) {\n chunks = [];\n } else {\n chunks = this.blocksForRange(chrId, min, max);\n if (!chunks) {\n callback(null, 'Error in index fetch');\n }\n }\n\n var records = [];\n var index = 0;\n var data;\n\n function tramp() {\n if (index >= chunks.length) {\n return callback(records);\n } else if (!data) {\n var c = chunks[index];\n var fetchMin = c.minv.block;\n var fetchMax = c.maxv.block + (1 << 16); // *sigh*\n thisB.data.slice(fetchMin, fetchMax - fetchMin).fetch(function (r) {\n data = unbgzf(r, c.maxv.block - c.minv.block + 1);\n return tramp();\n });\n } else {\n var ba = new Uint8Array(data);\n thisB.readRecords(ba, chunks[index].minv.offset, records, min, max, canonicalChr);\n data = null;\n ++index;\n return tramp();\n }\n }\n tramp();\n};\n\nTabixFile.prototype.readRecords = function (ba, offset, sink, min, max, chr) {\n LINE_LOOP: while (true) {\n var line = '';\n while (offset < ba.length) {\n var ch = ba[offset++];\n if (ch == 10) {\n var toks = line.split('\\t');\n\n if (toks[this.colSeq - 1] == chr) {\n var fmin = parseInt(toks[this.colStart - 1]);\n var fmax = fmin;\n if (this.colEnd > 0) fmax = parseInt(toks[this.colEnd - 1]);\n if (this.format & 0x10000) ++fmin;\n\n if (fmin <= max && fmax >= min) sink.push(line);\n }\n continue LINE_LOOP;\n } else {\n line += String.fromCharCode(ch);\n }\n }\n return;\n }\n};\n\nTabixFile.prototype.fetchHeader = function (callback) {\n var self = this;\n var fetchPtr = 0,\n ptr = 0,\n line = '';\n var lines = [];\n\n self.data.slice(0, self.headerMax).fetch(function (chnk) {\n if (!chnk) {\n return callback(null, \"Fetch failed\");\n }\n var ba = new Uint8Array(unbgzf(chnk, chnk.byteLength));\n var ptr = 0,\n line = '',\n lines = [];\n while (ptr < ba.length) {\n var ch = ba[ptr++];\n if (ch == 10) {\n if (line.charCodeAt(0) == self.meta) {\n lines.push(line);\n line = '';\n } else {\n return callback(lines);\n }\n } else {\n line += String.fromCharCode(ch);\n }\n }\n callback(lines);\n });\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n connectTabix: connectTabix,\n TABIX_MAGIC: TABIX_MAGIC\n };\n}\n\n},{\"./bin\":4,\"./lh3utils\":26,\"./spans\":41}],48:[function(require,module,exports){\n\"use strict\";\n\nvar _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _sourceadapters = require(\"./sourceadapters.js\");\n\nvar _das = require(\"./das.js\");\n\nvar _ramda = require(\"ramda\");\n\nvar R = _interopRequireWildcard(_ramda);\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } /* jshint esversion: 6 */\n\n/*\n Source that can be configured to produce any type of feature,\n useful for testing renderers.\n */\n\nvar TestSource = function (_FeatureSourceBase) {\n _inherits(TestSource, _FeatureSourceBase);\n\n function TestSource(source) {\n _classCallCheck(this, TestSource);\n\n var _this = _possibleConstructorReturn(this, (TestSource.__proto__ || Object.getPrototypeOf(TestSource)).call(this));\n\n _this.features = R.defaultTo([], source.features);\n return _this;\n }\n\n _createClass(TestSource, [{\n key: \"genFeature\",\n value: function genFeature(conf) {\n var feature = new _das.DASFeature();\n\n for (var key in conf) {\n feature[key] = conf[key];\n }\n }\n }, {\n key: \"fetch\",\n value: function fetch(chr, min, max, scale, types, pool, callback) {\n var features = R.forEach(this.genFeature, this.features);\n return callback(null, features, 1);\n }\n }]);\n\n return TestSource;\n}(_sourceadapters.FeatureSourceBase);\n\n(0, _sourceadapters.registerSourceAdapterFactory)('test-source', function (source) {\n return { features: new TestSource(source) };\n});\n\n},{\"./das.js\":10,\"./sourceadapters.js\":39,\"ramda\":387}],49:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// thub.js: support for track-hub style registries\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var textXHR = utils.textXHR;\n var relativeURL = utils.relativeURL;\n var shallowCopy = utils.shallowCopy;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n}\n\nvar THUB_STANZA_REGEXP = /\\n\\s*\\n/;\nvar THUB_PARSE_REGEXP = /(\\w+) +(.+)\\n?/;\nvar THUB_SUBGROUP_REGEXP = /subGroup[1-9]/;\n\nvar THUB_PENNANT_PREFIX = 'http://genome.ucsc.edu/images/';\n\nfunction TrackHub(url) {\n this.genomes = {};\n this.url = url;\n}\n\nfunction TrackHubTrack() {}\n\nTrackHubTrack.prototype.get = function (k) {\n if (this[k]) return this[k];else if (this._parent) return this._parent.get(k);\n};\n\nfunction TrackHubDB(hub) {\n this.hub = hub;\n}\n\nTrackHubDB.prototype.getTracks = function (callback) {\n var thisB = this;\n if (this._tracks) {\n return callback(this._tracks);\n }\n\n textXHR(this.absURL, function (trackFile, err) {\n if (err) {\n return callback(null, err);\n }\n\n // trackFile = trackFile.replace(/\\#.*/g, '');\n trackFile = trackFile.replace('\\\\\\n', ' ');\n\n var tracks = [];\n var tracksById = {};\n var stanzas = trackFile.split(THUB_STANZA_REGEXP);\n for (var s = 0; s < stanzas.length; ++s) {\n var toks = stanzas[s].replace(/\\#.*/g, '').split(THUB_PARSE_REGEXP);\n var track = new TrackHubTrack();\n track._db = thisB;\n for (var l = 0; l < toks.length - 2; l += 3) {\n var k = toks[l + 1],\n v = toks[l + 2];\n if (k.match(THUB_SUBGROUP_REGEXP)) {\n if (!track.subgroups) track.subgroups = {};\n var sgtoks = v.split(/\\s/);\n var sgtag = sgtoks[0];\n var sgrecord = { name: sgtoks[1], tags: [], titles: [] };\n for (var sgti = 2; sgti < sgtoks.length; ++sgti) {\n var grp = sgtoks[sgti].split(/=/);\n sgrecord.tags.push(grp[0]);\n sgrecord.titles.push(grp[1]);\n }\n track.subgroups[sgtag] = sgrecord;\n } else if (k === 'subGroups') {\n var sgtoks = v.split(/(\\w+)=(\\w+)/);\n track.sgm = {};\n for (var sgti = 0; sgti < sgtoks.length - 2; sgti += 3) {\n track.sgm[sgtoks[sgti + 1]] = sgtoks[sgti + 2];\n }\n } else {\n track[toks[l + 1]] = toks[l + 2];\n }\n }\n\n if (track.track && (track.type || track.container || track.view || track.bigDataUrl)) {\n tracks.push(track);\n tracksById[track.track] = track;\n } else {\n // console.log('skipping ', track);\n }\n }\n\n var toplevels = [];\n var composites = [];\n for (var ti = 0; ti < tracks.length; ++ti) {\n var track = tracks[ti];\n var top = true;\n if (track.parent) {\n var ptoks = track.parent.split(/\\s+/);\n var parent = tracksById[ptoks[0]];\n if (parent) {\n track._parent = parent;\n\n if (!parent.children) parent.children = [];\n parent.children.push(track);\n\n if (parent) top = false;\n } else {\n console.log(\"Couldn't find parent \" + ptoks[0] + '(' + track.parent + ')');\n }\n }\n if (track.compositeTrack) {\n composites.push(track);\n } else if (top) {\n toplevels.push(track);\n }\n }\n\n for (var ci = 0; ci < composites.length; ++ci) {\n var comp = composites[ci];\n if (!comp.children) continue;\n\n var parentOfViews = false;\n for (var ki = 0; ki < comp.children.length; ++ki) {\n var k = comp.children[ki];\n if (k.view) {\n k.shortLabel = comp.shortLabel + \": \" + k.shortLabel;\n toplevels.push(k);\n parentOfViews = true;\n }\n }\n if (!parentOfViews) toplevels.push(comp);\n }\n\n thisB._tracks = toplevels;\n return callback(thisB._tracks, null);\n }, { credentials: this.credentials, salt: true });\n};\n\nfunction connectTrackHub(hubURL, callback, opts) {\n opts = opts || {};\n opts.salt = true;\n\n textXHR(hubURL, function (hubFile, err) {\n if (err) {\n return callback(null, err);\n }\n\n var toks = hubFile.split(THUB_PARSE_REGEXP);\n var hub = new TrackHub(hubURL);\n if (opts.credentials) {\n hub.credentials = opts.credentials;\n }\n for (var l = 0; l < toks.length - 2; l += 3) {\n hub[toks[l + 1]] = toks[l + 2];\n }\n\n if (hub.genomesFile) {\n var genURL = relativeURL(hubURL, hub.genomesFile);\n textXHR(genURL, function (genFile, err) {\n if (err) {\n return callback(null, err);\n }\n\n var stanzas = genFile.split(THUB_STANZA_REGEXP);\n for (var s = 0; s < stanzas.length; ++s) {\n var toks = stanzas[s].split(THUB_PARSE_REGEXP);\n var gprops = new TrackHubDB(hub);\n if (opts.credentials) {\n gprops.credentials = opts.credentials;\n }\n\n for (var l = 0; l < toks.length - 2; l += 3) {\n gprops[toks[l + 1]] = toks[l + 2];\n }\n\n if (gprops.twoBitPath) {\n gprops.twoBitPath = relativeURL(genURL, gprops.twoBitPath);\n }\n\n if (gprops.genome && gprops.trackDb) {\n gprops.absURL = relativeURL(genURL, gprops.trackDb);\n hub.genomes[gprops.genome] = gprops;\n }\n }\n\n callback(hub);\n }, opts);\n } else {\n callback(null, 'No genomesFile');\n }\n }, opts);\n}\n\nTrackHubTrack.prototype.toDallianceSource = function () {\n var source = {\n name: this.shortLabel,\n desc: this.longLabel\n };\n if (this._db.mapping) {\n source.mapping = this._db.mapping;\n }\n\n var pennantIcon = this.get('pennantIcon');\n if (pennantIcon) {\n var ptoks = pennantIcon.split(/\\s+/);\n source.pennant = THUB_PENNANT_PREFIX + ptoks[0];\n }\n\n var searchTrix = this.get('searchTrix');\n if (searchTrix) {\n source.trixURI = relativeURL(this._db.absURL, searchTrix);\n }\n\n if (this.container == 'multiWig') {\n source.merge = 'concat';\n source.overlay = [];\n var children = this.children || [];\n source.style = [];\n source.noDownsample = true;\n\n for (var ci = 0; ci < children.length; ++ci) {\n var ch = children[ci];\n var cs = ch.toDallianceSource();\n source.overlay.push(cs);\n\n if (cs.style) {\n for (var si = 0; si < cs.style.length; ++si) {\n var style = cs.style[si];\n style.method = ch.shortLabel; // FIXME\n if (this.aggregate == 'transparentOverlay') style.style.ALPHA = 0.5;\n source.style.push(style);\n }\n }\n }\n return source;\n } else {\n var type = this.type;\n if (!type) {\n var p = this;\n while (p._parent && !p.type) {\n p = p._parent;\n }\n type = p.type;\n }\n if (!type) return;\n var typeToks = type.split(/\\s+/);\n if (typeToks[0] == 'bigBed' && this.bigDataUrl) {\n var bedTokens = typeToks[1] | 0;\n var bedPlus = typeToks[2] == '+';\n\n source.bwgURI = relativeURL(this._db.absURL, this.bigDataUrl);\n source.style = this.bigbedStyles();\n if (this._db.credentials) {\n source.credentials = true;\n }\n if (bedTokens >= 12 && bedPlus) source.collapseSuperGroups = true;\n return source;\n } else if (typeToks[0] == 'bigWig' && this.bigDataUrl) {\n source.bwgURI = relativeURL(this._db.absURL, this.bigDataUrl);\n source.style = this.bigwigStyles();\n source.noDownsample = true; // FIXME seems like a blunt instrument...\n\n if (this.yLineOnOff && this.yLineOnOff == 'on') {\n source.quantLeapThreshold = this.yLineMark !== undefined ? 1.0 * this.yLineMark : 0.0;\n }\n\n if (this._db.credentials) {\n source.credentials = true;\n }\n\n return source;\n } else if (typeToks[0] == 'bam' && this.bigDataUrl) {\n source.bamURI = relativeURL(this._db.absURL, this.bigDataUrl);\n if (this._db.credentials) {\n source.credentials = true;\n }\n return source;\n } else if (typeToks[0] == 'vcfTabix' && this.bigDataUrl) {\n source.uri = relativeURL(this._db.absURL, this.bigDataUrl);\n source.tier_type = 'tabix';\n source.payload = 'vcf';\n if (this._db.credentials) {\n source.credentials = true;\n }\n return source;\n } else {\n console.log('Unsupported ' + this.type);\n }\n }\n};\n\nTrackHubTrack.prototype.bigwigStyles = function () {\n var type = this.type;\n if (!type) {\n var p = this;\n while (p._parent && !p.type) {\n p = p._parent;\n }\n type = p.type;\n }\n if (!type) return;\n var typeToks = type.split(/\\s+/);\n\n var min, max;\n if (typeToks.length >= 3) {\n min = 1.0 * typeToks[1];\n max = 1.0 * typeToks[2];\n }\n\n var height;\n if (this.maxHeightPixels) {\n var mhpToks = this.maxHeightPixels.split(/:/);\n if (mhpToks.length == 3) {\n height = mhpToks[1] | 0;\n } else {\n console.log('maxHeightPixels should be of the form max:default:min');\n }\n }\n\n var gtype = 'bars';\n if (this.graphTypeDefault) {\n gtype = this.graphTypeDefault;\n }\n\n var color = 'black';\n var altColor = null;\n if (this.color) {\n color = 'rgb(' + this.color + ')';\n }\n if (this.altColor) {\n altColor = 'rgb(' + this.altColor + ')';\n }\n\n var stylesheet = new DASStylesheet();\n var wigStyle = new DASStyle();\n if (gtype == 'points') {\n wigStyle.glyph = 'POINT';\n } else {\n wigStyle.glyph = 'HISTOGRAM';\n }\n\n if (altColor) {\n wigStyle.COLOR1 = color;\n wigStyle.COLOR2 = altColor;\n } else {\n wigStyle.BGCOLOR = color;\n }\n wigStyle.HEIGHT = height || 30;\n if (min || max) {\n wigStyle.MIN = min;\n wigStyle.MAX = max;\n }\n stylesheet.pushStyle({ type: 'default' }, null, wigStyle);\n return stylesheet.styles;\n};\n\nTrackHubTrack.prototype.bigbedStyles = function () {\n var itemRgb = ('' + this.get('itemRgb')).toLowerCase() == 'on';\n var visibility = this.get('visibility') || 'full';\n var color = this.get('color');\n if (color) color = 'rgb(' + color + ')';else color = 'blue';\n\n var stylesheet = new DASStylesheet();\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = color;\n wigStyle.HEIGHT = visibility == 'full' || visibility == 'pack' ? 12 : 8;\n wigStyle.BUMP = visibility == 'full' || visibility == 'pack';\n wigStyle.LABEL = visibility == 'full' || visibility == 'pack';\n wigStyle.ZINDEX = 20;\n if (itemRgb) wigStyle.BGITEM = true;\n\n var cbs = this.get('colorByStrand');\n if (cbs) {\n var cbsToks = cbs.split(/\\s+/);\n\n var plus = shallowCopy(wigStyle);\n plus.BGCOLOR = 'rgb(' + cbsToks[0] + ')';\n stylesheet.pushStyle({ type: 'bigbed', orientation: '+' }, null, plus);\n\n var minus = shallowCopy(wigStyle);\n minus.BGCOLOR = 'rgb(' + cbsToks[1] + ')';\n stylesheet.pushStyle({ type: 'bigbed', orientation: '-' }, null, minus);\n } else {\n stylesheet.pushStyle({ type: 'bigbed' }, null, wigStyle);\n }\n\n var tlStyle = new DASStyle();\n tlStyle.glyph = 'BOX';\n tlStyle.FGCOLOR = 'black';\n if (itemRgb) tlStyle.BGITEM = true;\n tlStyle.BGCOLOR = 'red';\n tlStyle.HEIGHT = 10;\n tlStyle.BUMP = true;\n tlStyle.ZINDEX = 20;\n stylesheet.pushStyle({ type: 'translation' }, null, tlStyle);\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({ type: 'transcript' }, null, tsStyle);\n\n return stylesheet.styles;\n};\n\nfunction THUB_COMPARE(g, h) {\n if (g.priority && h.priority) {\n return 1.0 * g.priority - 1.0 * h.priority;\n } else if (g.priority) {\n return 1;\n } else if (h.priority) {\n return -1;\n } else {\n return g.shortLabel.localeCompare(h.shortLabel);\n }\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n connectTrackHub: connectTrackHub,\n THUB_COMPARE: THUB_COMPARE\n };\n}\n\n},{\"./das\":10,\"./utils\":56}],50:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// tier-actions.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n}\n\nBrowser.prototype.mergeSelectedTiers = function () {\n var sources = [];\n var styles = [];\n\n for (var sti = 0; sti < this.selectedTiers.length; ++sti) {\n var tier = this.tiers[this.selectedTiers[sti]];\n sources.push(shallowCopy(tier.dasSource));\n var ss = tier.stylesheet.styles;\n for (var si = 0; si < ss.length; ++si) {\n var sh = ss[si];\n var nsh = shallowCopy(sh);\n nsh.method = tier.dasSource.name.replace(/[()+*?]/g, '\\\\$&');\n nsh._methodRE = null;\n nsh.style = shallowCopy(sh.style);\n if (nsh.style.ZINDEX === undefined) nsh.style.ZINDEX = sti;\n\n if (tier.forceMin) {\n nsh.style.MIN = tier.forceMin;\n }\n if (tier.forceMax) {\n nsh.style.MAX = tier.forceMax;\n }\n\n styles.push(nsh);\n }\n }\n\n this.addTier({ name: 'Merged',\n merge: 'concat',\n overlay: sources,\n noDownsample: true,\n style: styles });\n\n this.setSelectedTier(this.tiers.length - 1);\n};\n\n},{\"./cbrowser\":6,\"./utils\":56}],51:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// tier-edit.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n\n var das = require('./das');\n var isDasBooleanTrue = das.isDasBooleanTrue;\n var isDasBooleanNotFalse = das.isDasBooleanNotFalse;\n var copyStylesheet = das.copyStylesheet;\n\n var color = require('./color');\n var dasColourForName = color.dasColourForName;\n\n var sourceDataURI = require('./sourcecompare').sourceDataURI;\n}\n\nvar __dalliance_smallGlyphs = {\n DOT: true,\n EX: true,\n STAR: true,\n SQUARE: true,\n CROSS: true,\n TRIANGLE: true,\n PLIMSOLL: true\n};\n\nBrowser.prototype.openTierPanel = function (tier) {\n var b = this;\n\n if (this.uiMode === 'tier' && this.manipulatingTier === tier) {\n this.hideToolPanel();\n this.setUiMode('none');\n } else if (!tier) {\n return;\n } else {\n var setStyleColors = function setStyleColors(style) {\n if (style.BGGRAD) return;\n\n if (numColors == 1) {\n if (style.glyph == 'LINEPLOT' || __dalliance_smallGlyphs[style.glyph]) {\n style.FGCOLOR = tierColorField.value;\n } else {\n style.BGCOLOR = tierColorField.value;\n }\n style.COLOR1 = style.COLOR2 = style.COLOR3 = null;\n } else {\n style.COLOR1 = tierColorField.value;\n style.COLOR2 = tierColorField2.value;\n if (numColors > 2) {\n style.COLOR3 = tierColorField3.value;\n } else {\n style.COLOR3 = null;\n }\n }\n style._gradient = null;\n style._plusColor = tierPlusColorField.value;\n style._minusColor = tierMinusColorField.value;\n };\n\n var mutateStylesheet = function mutateStylesheet(visitor) {\n var nss = copyStylesheet(tier.stylesheet);\n var ssScale = tier.browser.zoomForCurrentScale();\n\n for (var i = 0; i < nss.styles.length; ++i) {\n var sh = nss.styles[i];\n if (sh.zoom && sh.zoom != ssScale) {\n continue;\n }\n\n visitor(sh.style);\n }\n\n return nss;\n };\n\n var changeColor = function changeColor(ev) {\n tier.mergeStylesheet(mutateStylesheet(setStyleColors));\n };\n\n this.manipulatingTier = tier;\n\n var tierForm = makeElement('div', null, { className: 'tier-edit' });\n\n var aboutBanner = makeElement('div', \"About '\" + (tier.config.Name || tier.dasSource.name) + \"'\", null, { background: 'gray', paddingBottom: '5px', marginBottom: '5px', textAlign: 'center' });\n tierForm.appendChild(aboutBanner);\n\n var about = makeElement('div', [makeElement('p', tier.dasSource.desc)]);\n var aboutNotes = [];\n var sduri = sourceDataURI(tier.dasSource);\n if (sduri && (sduri.indexOf('http://') == 0 || sduri.indexOf('https://') == 0 || sduri.indexOf('//') == 0) && sduri !== 'https://www.biodalliance.org/magic/no_uri') {\n aboutNotes.push(makeElement('li', makeElement('a', '(Download data)', { href: sduri })));\n }\n\n if (tier.dasSource.mapping) {\n var coords = this.chains[tier.dasSource.mapping].coords;\n aboutNotes.push(makeElement('li', 'Mapped from ' + coords.auth + coords.version));\n }\n\n if (aboutNotes.length > 0) {\n about.appendChild(makeElement('ul', aboutNotes));\n }\n\n tierForm.appendChild(about);\n\n var semanticBanner = makeElement('span', ' (styles for current zoom level)', null, { display: 'none' });\n var editBanner = makeElement('div', ['Edit', semanticBanner], null, { background: 'gray', paddingBottom: '5px', marginBottom: '5px', textAlign: 'center' });\n tierForm.appendChild(editBanner);\n\n var tierNameField = makeElement('input', null, { type: 'text' });\n var tierPinnedToggle = makeElement('input', null, { type: 'checkbox', disabled: this.disablePinning });\n\n var glyphField = makeElement('select');\n glyphField.appendChild(makeElement('option', 'Histogram', { value: 'HISTOGRAM' }));\n glyphField.appendChild(makeElement('option', 'Line Plot', { value: 'LINEPLOT' }));\n glyphField.appendChild(makeElement('option', 'Ribbon', { value: 'GRADIENT' }));\n glyphField.appendChild(makeElement('option', 'Scatter', { value: 'SCATTER' }));\n\n var tierColorField = makeElement('input', null, { type: 'text', value: '#dd00dd' });\n var tierColorField2 = makeElement('input', null, { type: 'text', value: '#dd00dd' });\n var tierColorField3 = makeElement('input', null, { type: 'text', value: '#dd00dd' });\n\n var tierPlusColorField = makeElement('input', null, { type: 'text', value: '#ffa07a' });\n var tierMinusColorField = makeElement('input', null, { type: 'text', value: '#87cefa' });\n\n try {\n tierColorField.type = tierColorField2.type = tierColorField3.type = 'color';\n tierPlusColorField.type = tierMinusColorField.type = 'color';\n } catch (e) {\n // IE throws if attempt to set type to 'color'.\n }\n\n var tierColorFields = [tierColorField, tierColorField2, tierColorField3];\n var colorListPlus = makeElement('i', null, { className: 'fa fa-plus-circle' });\n var colorListMinus = makeElement('i', null, { className: 'fa fa-minus-circle' });\n var numColors = 1;\n var colorListElement = makeElement('td', tierColorFields);\n var setNumColors = function setNumColors(n) {\n numColors = n;\n for (var i = 0; i < n; ++i) {\n tierColorFields[i].style.display = 'block';\n }for (var i = n; i < tierColorFields.length; ++i) {\n tierColorFields[i].style.display = 'none';\n }\n };\n colorListPlus.addEventListener('click', function (ev) {\n if (numColors < 3) {\n setNumColors(numColors + 1);\n changeColor(null);\n }\n }, false);\n colorListMinus.addEventListener('click', function (ev) {\n if (numColors > 1) {\n setNumColors(numColors - 1);\n changeColor(null);\n }\n }, false);\n\n var tierMinField = makeElement('input', null, { type: 'text', value: '0.0' });\n var tierMaxField = makeElement('input', null, { type: 'text', value: '10.0' });\n var tierMinToggle = makeElement('input', null, { type: 'checkbox' });\n var tierMaxToggle = makeElement('input', null, { type: 'checkbox' });\n\n var quantLeapToggle = makeElement('input', null, { type: 'checkbox', checked: tier.quantLeapThreshold !== undefined });\n var quantLeapThreshField = makeElement('input', null, { type: 'text', value: tier.quantLeapThreshold, disabled: !quantLeapToggle.checked });\n\n var tierHeightField = makeElement('input', null, { type: 'text', value: '50' });\n\n var bumpToggle = makeElement('input', null, { type: 'checkbox' });\n var bumpLimit = makeElement('input', null, { type: 'text' });\n var labelToggle = makeElement('input', null, { type: 'checkbox' });\n\n var mainStyle = null;\n if (tier.stylesheet.styles.length > 0) {\n var s = mainStyle = tier.stylesheet.styles[0].style;\n }\n\n var refresh = function refresh() {\n if (typeof tier.config.name === 'string') tierNameField.value = tier.config.name;else tierNameField.value = tier.dasSource.name;\n\n tierPinnedToggle.checked = tier.pinned;\n\n if (tier.forceHeight) {\n tierHeightField.value = '' + tier.forceHeight;\n } else if (mainStyle && mainStyle.HEIGHT) {\n tierHeightField.value = '' + mainStyle.HEIGHT;\n }\n\n if (typeof tier.quantLeapThreshold == 'number') {\n quantLeapToggle.checked = true;\n quantLeapThreshField.disabled = false;\n if (parseFloat(quantLeapThreshField.value) != tier.quantLeapThreshold) quantLeapThreshField.value = tier.quantLeapThreshold;\n } else {\n quantLeapToggle.checked = false;\n quantLeapThreshField.disabled = true;\n }\n\n if (typeof tier.subtierMax == 'number') {\n bumpLimit.value = '' + tier.subtierMax;\n } else {\n bumpLimit.value = '' + (tier.dasSource.subtierMax || tier.browser.defaultSubtierMax);\n }\n\n if (tier.stylesheet.styles.length > 0) {\n var s = null;\n var isQuantitative = false,\n isSimpleQuantitative = false;\n var ssScale = tier.browser.zoomForCurrentScale();\n var activeStyleCount = 0;\n\n for (var si = 0; si < tier.stylesheet.styles.length; ++si) {\n var sh = tier.stylesheet.styles[si];\n if (sh.zoom && sh.zoom != ssScale) {\n continue;\n }\n ++activeStyleCount;\n var ss = tier.stylesheet.styles[si].style;\n\n if (!s) {\n s = mainStyle = ss;\n }\n\n if (ss.glyph == 'LINEPLOT' || ss.glyph == 'HISTOGRAM' || ss.glyph == 'GRADIENT' || isDasBooleanTrue(ss.SCATTER)) {\n if (!isQuantitative) s = mainStyle = ss;\n isQuantitative = true;\n }\n }\n if (!s) {\n return;\n }\n\n semanticBanner.style.display = activeStyleCount == tier.stylesheet.styles.length ? 'none' : 'inline';\n\n isSimpleQuantitative = isQuantitative && activeStyleCount == 1;\n var isGradient = s.COLOR2 || s.BGGRAD;\n\n if (isQuantitative) {\n minRow.style.display = 'table-row';\n maxRow.style.display = 'table-row';\n bumpRow.style.display = 'none';\n labelRow.style.display = 'none';\n } else {\n minRow.style.display = 'none';\n maxRow.style.display = 'none';\n bumpRow.style.display = 'table-row';\n bumpToggle.checked = isDasBooleanTrue(mainStyle.BUMP);\n bumpLimit.disabled = !isDasBooleanTrue(mainStyle.BUMP);\n labelRow.style.display = 'table-row';\n labelToggle.checked = isDasBooleanTrue(mainStyle.LABEL);\n }\n\n if (isSimpleQuantitative) {\n styleRow.style.display = 'table-row';\n colorRow.style.display = 'table-row';\n } else {\n styleRow.style.display = 'none';\n colorRow.style.display = 'none';\n }\n\n var numColors = 1;\n if (s.COLOR1) {\n tierColorField.value = dasColourForName(s.COLOR1).toHexString();\n if (s.COLOR2) {\n tierColorField2.value = dasColourForName(s.COLOR2).toHexString();\n if (s.COLOR3) {\n tierColorField3.value = dasColourForName(s.COLOR3).toHexString();\n numColors = 3;\n } else {\n numColors = 2;\n }\n }\n } else {\n if (s.glyph == 'LINEPLOT' || s.glyph == 'DOT' && s.FGCOLOR) {\n tierColorField.value = dasColourForName(s.FGCOLOR).toHexString();\n } else if (s.BGCOLOR) {\n tierColorField.value = dasColourForName(s.BGCOLOR).toHexString();\n }\n }\n setNumColors(numColors);\n\n if (s._plusColor) tierPlusColorField.value = dasColourForName(s._plusColor).toHexString() || s._plusColor;\n if (s._minusColor) tierMinusColorField.value = dasColourForName(s._minusColor).toHexString() || s._minusColor;\n if (isDasBooleanTrue(s.SCATTER)) {\n glyphField.value = 'SCATTER';\n } else {\n glyphField.value = s.glyph;\n }\n\n var setMinValue, setMaxValue;\n if (s.MIN !== undefined) {\n var x = parseFloat(s.MIN);\n if (!isNaN(x)) setMinValue = x;\n }\n if (!tier.forceMinDynamic && (s.MIN !== undefined || tier.forceMin !== undefined)) {\n tierMinToggle.checked = true;\n tierMinField.disabled = false;\n } else {\n tierMinToggle.checked = false;\n tierMinField.disabled = true;\n }\n\n if (s.MAX !== undefined) {\n var x = parseFloat(s.MAX);\n if (!isNaN(x)) setMaxValue = x;\n }\n if (!tier.forceMaxDynamic && (s.MAX !== undefined || tier.forceMax !== undefined)) {\n tierMaxToggle.checked = true;\n tierMaxField.disabled = false;\n } else {\n tierMaxToggle.checked = false;\n tierMaxField.disabled = true;\n }\n\n if (tier.forceMin != undefined) {\n setMinValue = tier.forceMin;\n }\n if (tier.forceMax != undefined) {\n setMaxValue = tier.forceMax;\n }\n if (typeof setMinValue == 'number' && setMinValue != parseFloat(tierMinField.value)) {\n tierMinField.value = setMinValue;\n }\n if (typeof setMaxValue == 'number' && setMaxValue != parseFloat(tierMaxField.value)) {\n tierMaxField.value = setMaxValue;\n }\n\n var seqStyle = getSeqStyle(tier.stylesheet);\n if (seqStyle) {\n seqMismatchRow.style.display = 'table-row';\n seqMismatchToggle.checked = seqStyle.__SEQCOLOR === 'mismatch';\n seqInsertRow.style.display = 'table-row';\n seqInsertToggle.checked = isDasBooleanTrue(seqStyle.__INSERTIONS);\n seqIgnoreQualsRow.style.display = 'table-row';\n seqIgnoreQualsToggle.checked = seqStyle.__disableQuals === undefined || seqStyle.__disableQuals === false;\n console.log(seqStyle.__disableQuals);\n } else {\n seqMismatchRow.style.display = 'none';\n seqInsertRow.style.display = 'none';\n seqIgnoreQualsRow.style.display = 'none';\n }\n\n if (seqStyle && seqMismatchToggle.checked && !isSimpleQuantitative) {\n plusStrandColorRow.style.display = 'table-row';\n minusStrandColorRow.style.display = 'table-row';\n } else {\n plusStrandColorRow.style.display = 'none';\n minusStrandColorRow.style.display = 'none';\n }\n }\n\n if (isQuantitative && tier.browser.sourceAdapterIsCapable(tier.featureSource, 'quantLeap')) quantLeapRow.style.display = 'table-row';else quantLeapRow.style.display = 'none';\n };\n\n var seqMismatchToggle = makeElement('input', null, { type: 'checkbox' });\n var seqMismatchRow = makeElement('tr', [makeElement('th', 'Highlight mismatches & strands'), makeElement('td', seqMismatchToggle)]);\n seqMismatchToggle.addEventListener('change', function (ev) {\n var nss = copyStylesheet(tier.stylesheet);\n var seqStyle = getSeqStyle(nss);\n seqStyle.__SEQCOLOR = seqMismatchToggle.checked ? 'mismatch' : 'base';\n tier.mergeStylesheet(nss);\n });\n\n var seqInsertToggle = makeElement('input', null, { type: 'checkbox' });\n var seqInsertRow = makeElement('tr', [makeElement('th', 'Show insertions'), makeElement('td', seqInsertToggle)]);\n seqInsertToggle.addEventListener('change', function (ev) {\n var nss = copyStylesheet(tier.stylesheet);\n var seqStyle = getSeqStyle(nss);\n seqStyle.__INSERTIONS = seqInsertToggle.checked ? 'yes' : 'no';\n tier.mergeStylesheet(nss);\n });\n\n var seqIgnoreQualsToggle = makeElement('input', null, { type: 'checkbox' });\n var seqIgnoreQualsRow = makeElement('tr', [makeElement('th', 'Reflect base quality as base color transparency'), makeElement('td', seqIgnoreQualsToggle)]);\n seqIgnoreQualsToggle.addEventListener('change', function (ev) {\n var nss = copyStylesheet(tier.stylesheet);\n var seqStyle = getSeqStyle(nss);\n seqStyle.__disableQuals = !seqIgnoreQualsToggle.checked;\n console.log(seqStyle.__disableQuals);\n tier.mergeStylesheet(nss);\n });\n\n var styleRow = makeElement('tr', [makeElement('th', 'Style'), makeElement('td', glyphField)]);\n var colorRow = makeElement('tr', [makeElement('th', ['Colour(s)', colorListPlus, colorListMinus]), colorListElement]);\n var plusStrandColorRow = makeElement('tr', [makeElement('th', 'Plus Strand Color'), makeElement('td', tierPlusColorField)]);\n var minusStrandColorRow = makeElement('tr', [makeElement('th', 'Minus Strand Color'), makeElement('td', tierMinusColorField)]);\n var minRow = makeElement('tr', [makeElement('th', 'Min value'), makeElement('td', [tierMinToggle, ' ', tierMinField])]);\n var maxRow = makeElement('tr', [makeElement('th', 'Max value'), makeElement('td', [tierMaxToggle, ' ', tierMaxField])]);\n var quantLeapRow = makeElement('tr', [makeElement('th', 'Threshold leap:'), makeElement('td', [quantLeapToggle, ' ', quantLeapThreshField])]);\n var bumpRow = makeElement('tr', [makeElement('th', 'Bump overlaps'), makeElement('td', [bumpToggle, ' limit: ', bumpLimit])]);\n var labelRow = makeElement('tr', [makeElement('th', 'Label features'), makeElement('td', labelToggle)]);\n\n var tierTable = makeElement('table', [makeElement('tr', [makeElement('th', 'Name', {}, { width: '150px', textAlign: 'right' }), tierNameField]), makeElement('tr', [makeElement('th', 'Pin to top'), tierPinnedToggle]), makeElement('tr', [makeElement('th', 'Height'), makeElement('td', tierHeightField)]), styleRow, colorRow, plusStrandColorRow, minusStrandColorRow, minRow, maxRow, quantLeapRow, bumpRow, labelRow, seqMismatchRow, seqInsertRow, seqIgnoreQualsRow]);\n\n refresh();\n\n tierForm.appendChild(tierTable);\n\n var resetButton = makeElement('button', 'Reset track', { className: 'btn' }, { marginLeft: 'auto', marginRight: 'auto', display: 'block' });\n resetButton.addEventListener('click', function (ev) {\n tier.setConfig({});\n }, false);\n tierForm.appendChild(resetButton);\n\n tierNameField.addEventListener('input', function (ev) {\n tier.mergeConfig({ name: tierNameField.value });\n }, false);\n\n tierPinnedToggle.addEventListener('change', function (ev) {\n tier.mergeConfig({ pinned: tierPinnedToggle.checked });\n }, false);\n\n for (var ci = 0; ci < tierColorFields.length; ++ci) {\n tierColorFields[ci].addEventListener('change', changeColor, false);\n }\n\n tierPlusColorField.addEventListener('change', changeColor, false);\n tierMinusColorField.addEventListener('change', changeColor, false);\n\n glyphField.addEventListener('change', function (ev) {\n var nss = mutateStylesheet(function (ts) {\n if (glyphField.value === 'SCATTER') {\n ts.SCATTER = true;\n ts.glyph = 'DOT';\n ts.SIZE = '3';\n } else {\n ts.glyph = glyphField.value;\n ts.SCATTER = undefined;\n }\n setStyleColors(ts);\n });\n tier.mergeStylesheet(nss);\n }, false);\n\n tierMinToggle.addEventListener('change', function (ev) {\n var conf = { forceMinDynamic: !tierMinToggle.checked };\n tierMinField.disabled = !tierMinToggle.checked;\n var x = parseFloat(tierMinField.value);\n if (tierMinToggle.checked && typeof x == 'number' && !isNaN(x)) conf.forceMin = parseFloat(x);\n tier.mergeConfig(conf);\n });\n tierMinField.addEventListener('input', function (ev) {\n var x = parseFloat(tierMinField.value);\n if (typeof x == 'number' && !isNaN(x)) tier.mergeConfig({ forceMin: x });\n }, false);\n\n tierMaxToggle.addEventListener('change', function (ev) {\n var conf = { forceMaxDynamic: !tierMaxToggle.checked };\n tierMaxField.disabled = !tierMaxToggle.checked;\n var x = parseFloat(tierMaxField.value);\n if (tierMaxToggle.checked && typeof x == 'number' && !isNaN(x)) conf.forceMax = parseFloat(x);\n tier.mergeConfig(conf);\n });\n tierMaxField.addEventListener('input', function (ev) {\n var x = parseFloat(tierMaxField.value);\n if (typeof x == 'number' && !isNaN(x)) tier.mergeConfig({ forceMax: x });\n }, false);\n\n tierHeightField.addEventListener('input', function (ev) {\n var x = parseFloat(tierHeightField.value);\n if (typeof x == 'number' && !isNaN(x)) tier.mergeConfig({ height: Math.min(500, x | 0) });\n }, false);\n\n var updateQuant = function updateQuant() {\n quantLeapThreshField.disabled = !quantLeapToggle.checked;\n if (quantLeapToggle.checked) {\n var x = parseFloat(quantLeapThreshField.value);\n if (typeof x == 'number' && !isNaN(x)) {\n tier.mergeConfig({ quantLeapThreshold: parseFloat(quantLeapThreshField.value) });\n }\n } else {\n tier.mergeConfig({ quantLeapThreshold: null });\n }\n };\n quantLeapToggle.addEventListener('change', function (ev) {\n updateQuant();\n }, false);\n quantLeapThreshField.addEventListener('input', function (ev) {\n updateQuant();\n }, false);\n\n labelToggle.addEventListener('change', function (ev) {\n var nss = mutateStylesheet(function (style) {\n style.LABEL = labelToggle.checked ? 'yes' : 'no';\n });\n tier.mergeStylesheet(nss);\n }, false);\n bumpToggle.addEventListener('change', function (ev) {\n var nss = mutateStylesheet(function (style) {\n style.BUMP = bumpToggle.checked ? 'yes' : 'no';\n });\n tier.mergeStylesheet(nss);\n }, false);\n bumpLimit.addEventListener('input', function (ev) {\n var x = parseInt(bumpLimit.value);\n if (typeof x == 'number' && x > 0) {\n tier.mergeConfig({ subtierMax: x });\n }\n }, false);\n\n this.showToolPanel(tierForm);\n this.setUiMode('tier');\n\n tier.addTierListener(refresh);\n\n var currentScale = tier.browser.scale;\n tier.browser.addViewListener(function () {\n if (tier.browser.scale != currentScale) {\n currentScale = tier.browser.scale;\n refresh();\n }\n });\n }\n};\n\nfunction getSeqStyle(stylesheet) {\n for (var si = 0; si < stylesheet.styles.length; ++si) {\n var ss = stylesheet.styles[si].style;\n if (ss.glyph === '__SEQUENCE') {\n return ss;\n }\n }\n}\n\n},{\"./cbrowser\":6,\"./color\":9,\"./das\":10,\"./sourcecompare\":40,\"./utils\":56}],52:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// tier.js: (try) to encapsulate the functionality of a browser tier.\n//\n\n\"use strict\";\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n var shallowCopy = utils.shallowCopy;\n var pushnew = utils.pushnew;\n var miniJSONify = utils.miniJSONify;\n var arrayIndexOf = utils.arrayIndexOf;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n\n var sha1 = require('./sha1');\n var b64_sha1 = sha1.b64_sha1;\n\n var style = require('./style');\n var StyleFilter = style.StyleFilter;\n var StyleFilterSet = style.StyleFilterSet;\n\n var sc = require('./sourcecompare');\n var sourceDataURI = sc.sourceDataURI;\n\n var Promise = require('es6-promise').Promise;\n\n var sortFeatures = require('./features').sortFeatures;\n}\n\nvar __tier_idSeed = 0;\n\nfunction DasTier(browser, source, config, background) {\n var _this = this;\n\n this.config = config || {};\n this.id = 'tier' + ++__tier_idSeed;\n this.browser = browser;\n this.dasSource = shallowCopy(source);\n this.background = background;\n\n this.viewport = makeElement('canvas', null, { width: '' + ((this.browser.featurePanelWidth | 0) + 2000),\n height: \"30\",\n className: 'viewport_12_5' }, { position: 'inline-block',\n margin: '0px', border: '0px' });\n this.viewportHolder = makeElement('div', this.viewport, { className: 'viewport-holder_12_5' }, { background: background,\n position: 'absolute',\n padding: '0px', margin: '0px',\n border: '0px',\n left: '-1000px',\n minHeight: '200px' });\n this.overlay = makeElement('canvas', null, { width: +(this.browser.featurePanelWidth | 0),\n height: \"30\",\n className: 'viewport-overlay' });\n\n this.notifier = makeElement('div', '', { className: 'notifier' });\n this.notifierHolder = makeElement('div', this.notifier, { className: 'notifier-holder' });\n this.quantOverlay = makeElement('canvas', null, { width: '50', height: \"56\",\n className: 'quant-overlay' });\n\n this.removeButton = makeElement('i', null, { className: 'fa fa-times' });\n this.bumpButton = makeElement('i', null, { className: 'fa fa-plus-circle' });\n this.loaderButton = browser.makeLoader(16);\n this.loaderButton.style.display = 'none';\n this.infoElement = makeElement('div', this.dasSource.desc, { className: 'track-label-info' });\n this.nameButton = makeElement('div', [], { className: 'tier-tab' });\n this.nameButton.appendChild(this.removeButton);\n if (source.pennant) {\n this.nameButton.appendChild(makeElement('img', null, { src: source.pennant, width: '16', height: '16' }));\n } else if (source.mapping) {\n var version = null;\n if (this.browser.chains[source.mapping]) version = this.browser.chains[source.mapping].coords.version;\n if (version) this.nameButton.appendChild(makeElement('span', '' + version, null, { fontSize: '8pt', background: 'black', color: 'white', paddingLeft: '3px', paddingRight: '3px', paddingTop: '1px', paddingBottom: '1px', marginLeft: '2px', borderRadius: '10px' }));\n }\n this.nameElement = makeElement('span', source.name);\n this.nameButton.appendChild(makeElement('span', [this.nameElement, this.infoElement], { className: 'track-name-holder' }));\n this.nameButton.appendChild(this.bumpButton);\n this.nameButton.appendChild(this.loaderButton);\n\n this.label = makeElement('span', [this.nameButton], { className: 'btn-group track-label' });\n\n var classes = 'tier' + (source.className ? ' ' + source.className : '');\n this.row = makeElement('div', [this.viewportHolder, this.overlay, this.quantOverlay], { className: classes });\n\n if (!background) {\n this.row.style.background = 'none';\n }\n\n if (!browser.noDefaultLabels) this.row.appendChild(this.label);\n this.row.appendChild(this.notifierHolder);\n\n this.layoutHeight = 25;\n this.bumped = true;\n this.styleIdSeed = 0;\n if (source.quantLeapThreshold) {\n this.quantLeapThreshold = source.quantLeapThreshold;\n }\n if (this.dasSource.collapseSuperGroups) {\n this.bumped = false;\n }\n this.layoutWasDone = false;\n\n if (source.featureInfoPlugin) {\n this.addFeatureInfoPlugin(source.featureInfoPlugin);\n }\n\n this.initSources();\n\n var thisB = this;\n if (this.featureSource && this.featureSource.getDefaultFIPs && !source.noSourceFeatureInfo) {\n this.featureSource.getDefaultFIPs(function (fip) {\n if (fip) thisB.addFeatureInfoPlugin(fip);\n });\n }\n\n if (this.featureSource && this.featureSource.addReadinessListener) {\n this.readinessListener = function (ready) {\n thisB.notify(ready, -1);\n };\n this.featureSource.addReadinessListener(this.readinessListener);\n }\n\n if (this.featureSource && this.featureSource.addActivityListener) {\n this.activityListener = function (busy) {\n if (busy > 0) {\n thisB.loaderButton.style.display = 'inline-block';\n } else {\n thisB.loaderButton.style.display = 'none';\n }\n thisB.browser.pingActivity();\n };\n this.featureSource.addActivityListener(this.activityListener);\n }\n\n this.listeners = [];\n this.featuresLoadedListeners = [];\n this.firstRenderPromise = new Promise(function (resolve, reject) {\n return _this._resolveFirstRenderPromise = resolve;\n });\n}\n\nDasTier.prototype.destroy = function () {\n if (this.featureSource.removeReadinessListener) {\n this.featureSource.removeReadinessListener(this.readinessListener);\n }\n if (this.featureSource.removeActivityListener) {\n this.featureSource.removeActivityListener(this.activityListener);\n }\n};\n\nDasTier.prototype.setBackground = function (b) {\n this.background = b;\n this.viewportHolder.style.background = b;\n};\n\nDasTier.prototype.toString = function () {\n return this.id;\n};\n\nDasTier.prototype.addFeatureInfoPlugin = function (p) {\n if (!this.featureInfoPlugins) this.featureInfoPlugins = [];\n this.featureInfoPlugins.push(p);\n};\n\nDasTier.prototype.init = function () {\n var tier = this;\n return new Promise(function (resolve, reject) {\n\n if (tier.dasSource.style) {\n tier.setStylesheet({ styles: tier.dasSource.style });\n resolve(tier);\n } else {\n tier.status = 'Fetching stylesheet';\n tier.fetchStylesheet(function (ss, err) {\n if (err || !ss) {\n tier.error = 'No stylesheet';\n var ss = new DASStylesheet();\n var defStyle = new DASStyle();\n defStyle.glyph = 'BOX';\n defStyle.BGCOLOR = 'blue';\n defStyle.FGCOLOR = 'black';\n ss.pushStyle({ type: 'default' }, null, defStyle);\n tier.setStylesheet(ss);\n } else {\n tier.setStylesheet(ss);\n if (ss.geneHint) {\n tier.dasSource.collapseSuperGroups = true;\n tier.bumped = false;\n tier.updateLabel();\n }\n tier._updateFromConfig();\n }\n resolve(tier);\n });\n }\n });\n};\n\nDasTier.prototype.setStylesheet = function (ss) {\n this.baseStylesheet = shallowCopy(ss);\n for (var si = 0; si < this.baseStylesheet.styles.length; ++si) {\n var sh = this.baseStylesheet.styles[si] = shallowCopy(this.baseStylesheet.styles[si]);\n sh._methodRE = sh._labelRE = sh._typeRE = null;\n sh.style = shallowCopy(sh.style);\n sh.style.id = 'style' + ++this.styleIdSeed;\n }\n this.baseStylesheetValidity = b64_sha1(miniJSONify(this.baseStylesheet));\n this._updateFromConfig();\n};\n\nDasTier.prototype.getSource = function () {\n return this.featureSource;\n};\n\nDasTier.prototype.getDesiredTypes = function (scale) {\n var sfs = this.getActiveStyleFilters(scale);\n if (sfs) return sfs.typeList();\n};\n\nDasTier.prototype.getActiveStyleFilters = function (scale) {\n var ssScale = this.browser.zoomForCurrentScale();\n\n if (this.stylesheet) {\n var styles = new StyleFilterSet();\n var ss = this.stylesheet.styles;\n for (var si = 0; si < ss.length; ++si) {\n var sh = ss[si];\n if (!sh.zoom || sh.zoom == ssScale) {\n styles.add(new StyleFilter(sh.type, sh.method, sh.label));\n }\n }\n return styles;\n }\n};\n\nDasTier.prototype.needsSequence = function (scale) {\n var sourceConfigNeedsSeq = function sourceConfigNeedsSeq(s) {\n if (s.bamURI || s.bamBlob || s.bwgURI || s.bwgBlob) {\n return true;\n } else if (s.overlay) {\n return s.overlay.some(sourceConfigNeedsSeq);\n } else {\n return false;\n }\n };\n\n if (this.sequenceSource && scale < 5) {\n return true;\n } else if (sourceConfigNeedsSeq(this.dasSource) && scale < 20) {\n return true;\n }\n return false;\n};\n\nDasTier.prototype.setFeatures = function (chr, coverage, scale, features, sequence) {\n this.currentFeatures = features;\n this.currentSequence = sequence;\n this.knownChr = chr;\n this.knownCoverage = coverage;\n\n // only notify features loaded, if they are valid\n if (features) {\n sortFeatures(this);\n this.notifyFeaturesLoaded();\n }\n};\n\nDasTier.prototype.draw = function () {\n console.log(\"Use browser.getTierRenderer(tier).drawTier(tier)\");\n};\n\nDasTier.prototype.findNextFeature = function (chr, pos, dir, fedge, callback) {\n if (this.quantLeapThreshold) {\n var width = this.browser.viewEnd - this.browser.viewStart + 1;\n pos = pos + width * dir / 2 | 0;\n this.featureSource.quantFindNextFeature(chr, pos, dir, this.quantLeapThreshold, callback);\n } else {\n if (this.knownCoverage && pos >= this.knownCoverage.min() && pos <= this.knownCoverage.max()) {\n if (this.currentFeatures) {\n var bestFeature = null;\n for (var fi = 0; fi < this.currentFeatures.length; ++fi) {\n var f = this.currentFeatures[fi];\n if (!f.min || !f.max) {\n continue;\n }\n if (f.parents && f.parents.length > 0) {\n continue;\n }\n if (dir < 0) {\n if (fedge == 1 && f.max >= pos && f.min < pos) {\n if (!bestFeature || f.min > bestFeature.min || f.min == bestFeature.min && f.max < bestFeature.max) {\n bestFeature = f;\n }\n } else if (f.max < pos) {\n if (!bestFeature || f.max > bestFeature.max || f.max == bestFeature.max && f.min < bestFeature.min || f.min == bestFeature.mmin && bestFeature.max >= pos) {\n bestFeature = f;\n }\n }\n } else {\n if (fedge == 1 && f.min <= pos && f.max > pos) {\n if (!bestFeature || f.max < bestFeature.max || f.max == bestFeature.max && f.min > bestFeature.min) {\n bestFeature = f;\n }\n } else if (f.min > pos) {\n if (!bestFeature || f.min < bestFeature.min || f.min == bestFeature.min && f.max > bestFeature.max || f.max == bestFeature.max && bestFeature.min <= pos) {\n bestFeature = f;\n }\n }\n }\n }\n if (bestFeature) {\n return callback(bestFeature);\n }\n if (dir < 0) {\n pos = this.browser.knownSpace.min;\n } else {\n pos = this.browser.knownSpace.max;\n }\n }\n }\n\n this.trySourceFNF(chr, pos, dir, callback);\n }\n};\n\nDasTier.prototype.trySourceFNF = function (chr, pos, dir, callback) {\n var self = this;\n this.featureSource.findNextFeature(chr, pos, dir, function (feature) {\n if (!feature) callback(feature);\n\n var ss = self.browser.getSequenceSource();\n if (!ss) // We're probably in trouble, but return anyway.\n callback(feature);\n\n ss.getSeqInfo(feature.segment, function (si) {\n if (si) callback(feature);else self.trySourceFNF(feature.segment, dir > 0 ? 10000000000 : 0, dir, callback);\n });\n });\n};\n\nDasTier.prototype.updateLabel = function () {\n this.bumpButton.className = this.bumped ? 'fa fa-minus-circle' : 'fa fa-plus-circle';\n if (this.dasSource.collapseSuperGroups) {\n this.bumpButton.style.display = 'inline-block';\n } else {\n this.bumpButton.style.display = 'none';\n }\n};\n\nDasTier.prototype.updateHeight = function () {\n this.currentHeight = Math.max(Math.max(this.layoutHeight, this.label.clientHeight + 2), this.browser.minTierHeight);\n this.row.style.height = '' + this.currentHeight + 'px';\n this.browser.updateHeight();\n};\n\nDasTier.prototype.drawOverlay = function () {\n var t = this;\n var b = this.browser;\n var retina = b.retina && window.devicePixelRatio > 1;\n\n t.overlay.height = t.viewport.height;\n t.overlay.width = retina ? b.featurePanelWidth * 2 : b.featurePanelWidth;\n\n var g = t.overlay.getContext('2d');\n if (retina) {\n g.scale(2, 2);\n }\n\n var origin = b.viewStart;\n var visStart = b.viewStart;\n var visEnd = b.viewEnd;\n\n if (this.overlayLabelCanvas) {\n var offset = (this.glyphCacheOrigin - this.browser.viewStart) * this.browser.scale;\n g.save();\n g.translate(offset, 0);\n var drawStart = -offset + 2;\n if (this.dasSource.tierGroup) drawStart += 15;\n this.overlayLabelCanvas.draw(g, drawStart, b.featurePanelWidth - offset);\n g.restore();\n }\n\n for (var hi = 0; hi < b.highlights.length; ++hi) {\n var h = b.highlights[hi];\n if ((h.chr === b.chr || h.chr === 'chr' + b.chr) && h.min < visEnd && h.max > visStart) {\n g.globalAlpha = b.defaultHighlightAlpha;\n g.fillStyle = b.defaultHighlightFill;\n g.fillRect((h.min - origin) * b.scale, 0, (h.max - h.min) * b.scale, t.overlay.height);\n }\n }\n\n // t.oorigin = b.viewStart;\n t.overlay.style.width = b.featurePanelWidth;\n t.overlay.style.height = t.viewport.style.height;\n t.overlay.style.left = '0px';\n};\n\nDasTier.prototype.updateStatus = function (status) {\n var self = this;\n if (status) {\n this.status = status;\n this._notifierToStatus();\n var sd = sourceDataURI(this.dasSource);\n if (window.location.protocol === 'https:' && sourceDataURI(this.dasSource).indexOf('http:') == 0 && !this.checkedHTTP) {\n this.checkedHTTP = true;\n this.browser.canFetchPlainHTTP().then(function (can) {\n if (!can) {\n self.warnHTTP = true;\n self._notifierToStatus();\n }\n });\n }\n } else {\n if (this.status) {\n this.status = null;\n this._notifierToStatus();\n }\n }\n};\n\nDasTier.prototype.notify = function (message, timeout) {\n if (typeof timeout !== 'number') timeout = 2000;\n\n if (this.notifierFadeTimeout) {\n clearTimeout(this.notifierFadeTimeout);\n this.notifierFadeTimeout = null;\n }\n\n if (message) {\n this._notifierOn(message);\n if (timeout > 0) {\n var thisB = this;\n this.notifierFadeTimeout = setTimeout(function () {\n thisB._notifierToStatus();\n }, timeout);\n }\n } else {\n this._notifierToStatus();\n }\n};\n\nDasTier.prototype._notifierOn = function (message, warnHTTP) {\n removeChildren(this.notifier);\n if (warnHTTP) {\n this.notifier.appendChild(makeElement('span', [makeElement('a', '[HTTP Warning] ', { href: this.browser.httpWarningURL, target: \"_blank\" }), message]));\n } else {\n this.notifier.textContent = message;\n }\n this.notifier.style.opacity = 0.8;\n};\n\nDasTier.prototype._notifierOff = function () {\n this.notifier.style.opacity = 0;\n};\n\nDasTier.prototype._notifierToStatus = function () {\n if (this.status) {\n this._notifierOn(this.status, this.warnHTTP);\n } else {\n this._notifierOff();\n }\n};\n\nDasTier.prototype.setConfig = function (config) {\n this.config = config || {};\n this._updateFromConfig();\n this.notifyTierListeners();\n};\n\nDasTier.prototype.mergeStylesheet = function (newStyle) {\n this.mergeConfig({\n stylesheet: newStyle,\n stylesheetValidity: this.baseStylesheetValidity\n });\n};\n\nDasTier.prototype.mergeConfig = function (newConfig) {\n for (var k in newConfig) {\n this.config[k] = newConfig[k];\n }\n this._updateFromConfig();\n this.notifyTierListeners();\n};\n\nDasTier.prototype._updateFromConfig = function () {\n var needsRefresh = false;\n var needsReorder = false;\n\n if (typeof this.config.name === 'string') this.nameElement.textContent = this.config.name;else this.nameElement.textContent = this.dasSource.name;\n\n var wantedHeight = this.config.height || this.dasSource.forceHeight;\n if (wantedHeight != this.forceHeight) {\n this.forceHeight = wantedHeight;\n needsRefresh = true;\n }\n\n if (this.forceMinDynamic != this.config.forceMinDynamic) {\n this.forceMinDynamic = this.config.forceMinDynamic;\n needsRefresh = true;\n }\n\n var forceMin = this.config.forceMin != undefined ? this.config.forceMin : this.dasSource.forceMin;\n if (this.forceMin != forceMin) {\n this.forceMin = forceMin;\n needsRefresh = true;\n }\n\n if (this.forceMaxDynamic != this.config.forceMaxDynamic) {\n this.forceMaxDynamic = this.config.forceMaxDynamic;\n needsRefresh = true;\n }\n\n var forceMax = this.config.forceMax != undefined ? this.config.forceMax : this.dasSource.forceMax;\n if (this.forceMax != forceMax) {\n this.forceMax = forceMax;\n needsRefresh = true;\n }\n\n var quantLeapThreshold = null;\n if (this.config.quantLeapThreshold !== undefined) quantLeapThreshold = this.config.quantLeapThreshold;else if (this.dasSource.quantLeapThreshold !== undefined) quantLeapThreshold = this.dasSource.quantLeapThreshold;\n if (quantLeapThreshold != this.quantLeapThreshold) {\n this.quantLeapThreshold = quantLeapThreshold;\n needsRefresh = true;\n }\n\n // Possible FIXME -- are there cases where style IDs need to be reassigned?\n var stylesheet = null;\n if (this.config.stylesheetValidity == this.baseStylesheetValidity) stylesheet = this.config.stylesheet;\n stylesheet = stylesheet || this.baseStylesheet;\n if (this.stylesheet !== stylesheet) {\n this.stylesheet = stylesheet;\n needsRefresh = true;\n }\n\n var wantedPinned = this.config.pinned !== undefined ? this.config.pinned : this.dasSource.pinned;\n if (wantedPinned !== this.pinned) {\n this.pinned = wantedPinned;\n needsReorder = true;\n }\n\n var wantedSubtierMax = _typeof(this.config.subtierMax === 'number') ? this.config.subtierMax : this.dasSource.subtierMax || this.browser.defaultSubtierMax;\n if (wantedSubtierMax != this.subtierMax) {\n this.subtierMax = wantedSubtierMax;\n needsRefresh = true;\n }\n\n var wantedBumped;\n if (this.config.bumped !== undefined) {\n wantedBumped = this.config.bumped;\n } else if (this.dasSource.bumped !== undefined) {\n wantedBumped = this.dasSource.bumped;\n } else {\n wantedBumped = this.dasSource.collapseSuperGroups ? false : true;\n }\n if (wantedBumped !== this.bumped) {\n this.bumped = wantedBumped;\n needsRefresh = true;\n this.updateLabel();\n }\n\n if (needsRefresh) this.scheduleRedraw();\n\n if (needsReorder) this.browser.reorderTiers();\n};\n\nDasTier.prototype.scheduleRedraw = function () {\n if (!this.currentFeatures) return;\n\n var tier = this;\n\n if (!this.redrawTimeout) {\n this.redrawTimeout = setTimeout(function () {\n sortFeatures(tier); // Some render actions mutate the results of this,\n // => need to re-run before refreshing.\n var renderer = tier.browser.getTierRenderer(tier);\n renderer.drawTier(tier);\n tier.redrawTimeout = null;\n }, 10);\n }\n};\nDasTier.prototype.clearTierListeners = function () {\n this.listeners = [];\n};\n\nDasTier.prototype.addTierListener = function (l) {\n this.listeners.push(l);\n};\n\nDasTier.prototype.removeTierListener = function (l) {\n var idx = arrayIndexOf(this.listeners, l);\n if (idx >= 0) {\n this.listeners.splice(idx, 1);\n }\n};\n\nDasTier.prototype.notifyTierListeners = function (change) {\n for (var li = 0; li < this.listeners.length; ++li) {\n try {\n this.listeners[li](change);\n } catch (e) {\n console.log(e);\n }\n }\n this.browser.notifyTier();\n};\n\nDasTier.prototype.clearFeaturesLoadedListeners = function () {\n this.featuresLoadedListeners = [];\n};\n\nDasTier.prototype.addFeaturesLoadedListener = function (handler) {\n this.featuresLoadedListeners.push(handler);\n};\n\nDasTier.prototype.removeFeaturesLoadedListener = function (handler) {\n var idx = arrayIndexOf(this.featuresLoadedListeners, handler);\n if (idx >= 0) {\n this.featuresLoadedListeners.splice(idx, 1);\n }\n};\n\nDasTier.prototype.notifyFeaturesLoaded = function () {\n for (var li = 0; li < this.featuresLoadedListeners.length; ++li) {\n try {\n this.featuresLoadedListeners[li].call(this);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nDasTier.prototype.wasRendered = function () {\n this._resolveFirstRenderPromise();\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n DasTier: DasTier\n };\n\n // Imported for side effects\n var fd = require('./feature-draw');\n}\n\n},{\"./das\":10,\"./feature-draw\":20,\"./features\":22,\"./sha1\":38,\"./sourcecompare\":40,\"./style\":42,\"./utils\":56,\"es6-promise\":384}],53:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// track-adder.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var sc = require('./sourcecompare');\n var sourcesAreEqual = sc.sourcesAreEqual;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n var Observed = utils.Observed;\n\n var thub = require('./thub');\n var THUB_COMPARE = thub.THUB_COMPARE;\n var connectTrackHub = thub.connectTrackHub;\n\n var domui = require('./domui');\n var makeTreeTableSection = domui.makeTreeTableSection;\n\n var probeResource = require('./probe').probeResource;\n\n // Most of this could disappear if we leave all probing to the probe module...\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n var readInt = bin.readInt;\n\n var lh3utils = require('./lh3utils');\n var unbgzf = lh3utils.unbgzf;\n\n var bam = require('./bam');\n var BAM_MAGIC = bam.BAM_MAGIC;\n var BAI_MAGIC = bam.BAI_MAGIC;\n\n var tbi = require('./tabix');\n var TABIX_MAGIC = tbi.TABIX_MAGIC;\n\n var das = require('./das');\n var DASSource = das.DASSource;\n var DASSegment = das.DASSegment;\n var DASRegistry = das.DASRegistry;\n var coordsMatch = das.coordsMatch;\n\n var EncodeFetchable = require('./encode').EncodeFetchable;\n}\n\nBrowser.prototype.currentlyActive = function (source) {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (sourcesAreEqual(this.tiers[ti].dasSource, source)) return this.tiers[ti];\n }\n return false;\n};\n\nBrowser.prototype.makeButton = function (name, tooltip) {\n var regButton = makeElement('a', name, { href: '#' });\n if (tooltip) {\n this.makeTooltip(regButton, tooltip);\n }\n return makeElement('li', regButton);\n};\n\nfunction activateButton(addModeButtons, which) {\n for (var i = 0; i < addModeButtons.length; ++i) {\n var b = addModeButtons[i];\n if (b === which) {\n b.classList.add('active');\n } else {\n b.classList.remove('active');\n }\n }\n}\n\nBrowser.prototype.showTrackAdder = function (ev) {\n if (this.uiMode === 'add') {\n this.hideToolPanel();\n this.setUiMode('none');\n return;\n }\n\n var thisB = this;\n\n var popup = makeElement('div', null, { className: 'dalliance' }, { width: '100%', display: 'inline-block', boxSizing: 'border-box', MozBoxSizing: 'border-box', verticalAlign: 'top', paddingRight: '15px' });\n\n var addModeButtons = [];\n var makeStab, makeStabObserver;\n\n if (!this.noRegistryTabs) {\n var regButton = this.makeButton('Registry', 'Browse compatible datasources from the DAS registry');\n addModeButtons.push(regButton);\n\n for (var m in this.mappableSources) {\n var mf = function mf(mm) {\n var mapButton = thisB.makeButton(thisB.chains[mm].srcTag, 'Browse datasources mapped from ' + thisB.chains[mm].srcTag);\n addModeButtons.push(mapButton);\n mapButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n activateButton(addModeButtons, mapButton);\n makeStab(thisB.mappableSources[mm], mm);\n }, false);\n };mf(m);\n }\n }\n\n var groupedDefaults = {};\n for (var si = 0; si < this.defaultSources.length; ++si) {\n var s = this.defaultSources[si];\n var g = s.group || 'Defaults';\n if (groupedDefaults[g]) {\n groupedDefaults[g].push(s);\n } else {\n groupedDefaults[g] = [s];\n }\n }\n\n var makeHubButton = function makeHubButton(tdb) {\n var hub = tdb.hub;\n var hubMenuButton = makeElement('i', null, { className: 'fa fa-list-alt' }, { cursor: 'context-menu' });\n var label = hub.altLabel || hub.shortLabel || 'Unknown';\n if (tdb.mapping) label = label + ' (' + tdb.genome + ')';\n var hbContent = makeElement('span', [label, ' ', hubMenuButton]);\n var hubButton = thisB.makeButton(hbContent, hub.longLabel);\n hubButton.hub = tdb;\n addModeButtons.push(hubButton);\n\n hubButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n activateButton(addModeButtons, hubButton);\n removeChildren(stabHolder);\n var loader = thisB.makeLoader(24);\n loader.style.marginLeft = 'auto';\n loader.style.marginRight = 'auto';\n loader.style.marginTop = '100px';\n stabHolder.appendChild(makeElement('div', loader, null, { textAlign: 'center' }));\n\n refreshButton.style.display = 'none';\n addButton.style.display = 'none';\n canButton.style.display = 'none';\n\n tdb.getTracks(function (tracks, err) {\n if (err) {\n console.log(err);\n }\n\n makeHubStab(tracks);\n });\n }, false);\n\n hubMenuButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n\n var removeHubItem = makeElement('li', makeElement('a', 'Remove hub'));\n var allOnItem = makeElement('li', makeElement('a', 'Enable all'));\n var allOffItem = makeElement('li', makeElement('a', 'Disable all'));\n var hubMenu = makeElement('ul', [removeHubItem, allOnItem, allOffItem], { className: 'dropdown-menu' }, { display: 'block' });\n\n var mx = ev.clientX,\n my = ev.clientY;\n mx += document.documentElement.scrollLeft || document.body.scrollLeft;\n my += document.documentElement.scrollTop || document.body.scrollTop;\n\n hubMenu.style.position = 'absolute';\n hubMenu.style.top = '' + (my + 10) + 'px';\n hubMenu.style.left = '' + (mx - 30) + 'px';\n thisB.hPopupHolder.appendChild(hubMenu);\n\n var clickCatcher = function clickCatcher(ev) {\n console.log('cc');\n document.body.removeEventListener('click', clickCatcher, true);\n thisB.hPopupHolder.removeChild(hubMenu);\n };\n document.body.addEventListener('click', clickCatcher, true);\n\n removeHubItem.addEventListener('click', function (ev) {\n for (var hi = 0; hi < thisB.hubObjects.length; ++hi) {\n if (thisB.hubObjects[hi].absURL == tdb.absURL) {\n thisB.hubObjects.splice(hi, 1);\n break;\n }\n }\n for (var hi = 0; hi < thisB.hubs.length; ++hi) {\n var hc = thisB.hubs[hi];\n if (typeof hc === 'string') hc = { url: hc };\n if (hc.url == tdb.hub.url && !hc.genome || hc.genome == tdb.genome) {\n thisB.hubs.splice(hi, 1);\n break;\n }\n }\n\n thisB.notifyTier();\n\n modeButtonHolder.removeChild(hubButton);\n activateButton(addModeButtons, addHubButton);\n switchToHubConnectMode();\n }, false);\n\n allOnItem.addEventListener('click', function (ev) {\n tdb.getTracks(function (tracks, err) {\n if (err) {\n console.log(err);\n }\n\n for (var ti = 0; ti < tracks.length; ++ti) {\n var ds = tracks[ti].toDallianceSource();\n if (!thisB.currentlyActive(ds)) {\n thisB.addTier(ds);\n }\n }\n });\n }, false);\n\n allOffItem.addEventListener('click', function (ev) {\n tdb.getTracks(function (tracks, err) {\n if (err) {\n console.log(err);\n }\n\n for (var ti = 0; ti < tracks.length; ++ti) {\n var ds = tracks[ti].toDallianceSource();\n if (thisB.currentlyActive(ds)) {\n thisB.removeTier(ds);\n }\n }\n });\n }, false);\n }, false);\n\n return hubButton;\n };\n\n var firstDefButton = null;\n var firstDefSources = null;\n for (var g in groupedDefaults) {\n (function (g, ds) {\n var defButton = thisB.makeButton(g, 'Browse the default set of data for this browser');\n defButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n activateButton(addModeButtons, defButton);\n makeStab(new Observed(ds));\n }, false);\n addModeButtons.push(defButton);\n\n if (!firstDefButton || thisB.defaultTrackAdderTab && thisB.defaultTrackAdderTab == g) {\n firstDefButton = defButton;\n firstDefSources = ds;\n }\n })(g, groupedDefaults[g]);\n }\n var custButton = this.makeButton('DAS', 'Add data using the DAS protocol');\n addModeButtons.push(custButton);\n var binButton = this.makeButton('Files', 'Add data from files on disk or the web');\n addModeButtons.push(binButton);\n\n for (var hi = 0; hi < this.hubObjects.length; ++hi) {\n var hub = this.hubObjects[hi];\n makeHubButton(hub);\n }\n\n var addHubButton = this.makeButton('+', 'Connect to a new track-hub');\n addModeButtons.push(addHubButton);\n\n var modeButtonHolder = makeElement('ul', addModeButtons, { className: 'nav nav-tabs' }, { marginBottom: '0px' });\n popup.appendChild(modeButtonHolder);\n\n var custURL, custName, custCS, custQuant, custFile, custUser, custPass;\n var customMode = false;\n var dataToFinalize = null;\n\n var asform = makeElement('form', null, {}, { display: 'inline-block', width: '100%' });\n asform.addEventListener('submit', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n doAdd();\n return false;\n }, true);\n var stabHolder = makeElement('div');\n stabHolder.style.position = 'relative';\n stabHolder.style.overflow = 'scroll';\n // stabHolder.style.height = '500px';\n asform.appendChild(stabHolder);\n\n var __mapping;\n var __sourceHolder;\n\n makeStab = function makeStab(msources, mapping) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'none';\n canButton.style.display = 'none';\n if (__sourceHolder) {\n __sourceHolder.removeListener(makeStabObserver);\n }\n __mapping = mapping;\n __sourceHolder = msources;\n __sourceHolder.addListenerAndFire(makeStabObserver);\n };\n\n makeStabObserver = function makeStabObserver(msources) {\n customMode = false;\n var buttons = [];\n removeChildren(stabHolder);\n if (!msources) {\n stabHolder.appendChild(makeElement('p', 'Dalliance was unable to retrieve data source information from the DAS registry, please try again later'));\n return;\n }\n\n var stabBody = makeElement('tbody', null, { className: 'table table-striped table-condensed' }, { width: '100%' });\n var stab = makeElement('table', stabBody, { className: 'table table-striped table-condensed' }, { width: '100%', tableLayout: 'fixed' });\n var idx = 0;\n\n var sources = [];\n for (var i = 0; i < msources.length; ++i) {\n sources.push(msources[i]);\n }\n\n sources.sort(function (a, b) {\n return a.name.toLowerCase().trim().localeCompare(b.name.toLowerCase().trim());\n });\n\n for (var i = 0; i < sources.length; ++i) {\n var source = sources[i];\n var r = makeElement('tr');\n\n var bd = makeElement('td', null, {}, { width: '30px' });\n bd.style.textAlign = 'center';\n if (!source.props || source.props.cors) {\n var b = makeElement('input');\n b.type = 'checkbox';\n b.dalliance_source = source;\n b.id = 'sourcecb' + i;\n if (__mapping) {\n b.dalliance_mapping = __mapping;\n }\n // b.checked = thisB.currentlyActive(source);\n bd.appendChild(b);\n buttons.push(b);\n b.addEventListener('change', function (ev) {\n if (ev.target.checked) {\n thisB.addTier(ev.target.dalliance_source);\n } else {\n thisB.removeTier(ev.target.dalliance_source);\n }\n });\n } else {\n bd.appendChild(document.createTextNode('!'));\n thisB.makeTooltip(bd, makeElement('span', [\"This data source isn't accessible because it doesn't support \", makeElement('a', \"CORS\", { href: 'http://www.w3.org/TR/cors/' }), \".\"]));\n }\n r.appendChild(bd);\n var ld = makeElement('label', null, { htmlFor: 'sourcecb' + i });\n ld.appendChild(document.createTextNode(source.name));\n if (source.desc && source.desc.length > 0) {\n thisB.makeTooltip(ld, source.desc);\n }\n r.appendChild(makeElement('td', ld));\n stabBody.appendChild(r);\n ++idx;\n }\n\n var setChecks = function setChecks() {\n for (var bi = 0; bi < buttons.length; ++bi) {\n var b = buttons[bi];\n var t = thisB.currentlyActive(b.dalliance_source);\n if (t) {\n b.checked = true;\n } else {\n b.checked = false;\n }\n }\n };\n setChecks();\n thisB.addTierListener(function (l) {\n setChecks();\n });\n\n stabHolder.appendChild(stab);\n };\n\n function makeHubStab(tracks) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'none';\n canButton.style.display = 'none';\n\n customMode = false;\n removeChildren(stabHolder);\n\n var buttonIdSeed = 0;\n\n var ttab = makeElement('div', null, {}, { width: '100%' });\n var sources = [];\n for (var i = 0; i < tracks.length; ++i) {\n sources.push(tracks[i]);\n }\n\n sources.sort(function (a, b) {\n return a.shortLabel.toLowerCase().trim().localeCompare(b.shortLabel.toLowerCase().trim());\n });\n\n var groups = [];\n var tops = [];\n\n for (var ti = 0; ti < sources.length; ++ti) {\n var track = sources[ti];\n if (track.children && track.children.length > 0 && track.container != 'multiWig') {\n groups.push(track);\n } else {\n tops.push(track);\n }\n }\n if (tops.length > 0) {\n groups.push({\n shortLabel: 'Others',\n priority: -100000000,\n children: tops });\n }\n\n groups.sort(THUB_COMPARE);\n\n var buttons = [];\n for (var gi = 0; gi < groups.length; ++gi) {\n var group = groups[gi];\n var dg = group;\n if (!dg.dimensions && dg._parent && dg._parent.dimensions) dg = dg._parent;\n\n var dprops = {};\n if (dg.dimensions) {\n var dtoks = dg.dimensions.split(/(\\w+)=(\\w+)/);\n for (var dti = 0; dti < dtoks.length - 2; dti += 3) {\n dprops[dtoks[dti + 1]] = dtoks[dti + 2];\n }\n }\n\n if (dprops.dimX && dprops.dimY) {\n var dimX = dprops.dimX,\n dimY = dprops.dimY;\n var sgX = dg.subgroups[dimX];\n var sgY = dg.subgroups[dimY];\n\n var trks = {};\n for (var ci = 0; ci < group.children.length; ++ci) {\n var child = group.children[ci];\n var vX = child.sgm[dimX],\n vY = child.sgm[dimY];\n if (!trks[vX]) trks[vX] = {};\n trks[vX][vY] = child;\n }\n\n var matrix = makeElement('table', null, { className: 'table table-striped table-condensed' }, { tableLayout: 'fixed' });\n {\n var header = makeElement('tr');\n header.appendChild(makeElement('th', null, {}, { width: '150px', height: '100px' })); // blank corner element\n for (var si = 0; si < sgX.titles.length; ++si) {\n var h = makeElement('th', makeElement('div', sgX.titles[si], {}, { transform: 'rotate(-60deg)',\n transformOrigin: '0% 100%',\n webkitTransform: 'rotate(-60deg) translate(20px,10px)',\n webkitTransformOrigin: '0% 100%',\n textAlign: 'left' }), {}, { width: '35px',\n height: '100px',\n verticalAlign: 'bottom' });\n header.appendChild(h);\n }\n matrix.appendChild(header);\n }\n\n var mbody = makeElement('tbody', null, { className: 'table table-striped table-condensed' });\n for (var yi = 0; yi < sgY.titles.length; ++yi) {\n var vY = sgY.tags[yi];\n var row = makeElement('tr');\n row.appendChild(makeElement('th', sgY.titles[yi]), {});\n\n for (var xi = 0; xi < sgX.titles.length; ++xi) {\n var vX = sgX.tags[xi];\n var cell = makeElement('td');\n if (trks[vX] && trks[vX][vY]) {\n var track = trks[vX][vY];\n var ds = track.toDallianceSource();\n if (!ds) continue;\n\n var r = makeElement('tr');\n var bd = makeElement('td');\n bd.style.textAlign = 'center';\n\n var b = makeElement('input');\n b.type = 'checkbox';\n b.dalliance_source = ds;\n if (__mapping) {\n b.dalliance_mapping = __mapping;\n }\n buttons.push(b);\n cell.appendChild(b);\n b.addEventListener('change', function (ev) {\n if (ev.target.checked) {\n thisB.addTier(ev.target.dalliance_source);\n } else {\n thisB.removeTier(ev.target.dalliance_source);\n }\n });\n }\n row.appendChild(cell);\n }\n mbody.appendChild(row);\n }\n matrix.appendChild(mbody);\n ttab.appendChild(makeTreeTableSection(group.shortLabel, matrix, gi == 0));\n } else {\n var stabBody = makeElement('tbody', null, { className: 'table table-striped table-condensed' });\n var stab = makeElement('table', stabBody, { className: 'table table-striped table-condensed' }, { width: '100%', tableLayout: 'fixed' });\n var idx = 0;\n\n group.children.sort(THUB_COMPARE);\n for (var i = 0; i < group.children.length; ++i) {\n var buttonId = 'hb' + ++buttonIdSeed;\n\n var track = group.children[i];\n var ds = track.toDallianceSource();\n if (!ds) continue;\n\n var r = makeElement('tr');\n var bd = makeElement('td', null, {}, { width: '30px' });\n bd.style.textAlign = 'center';\n\n var b = makeElement('input');\n b.type = 'checkbox';\n b.dalliance_source = ds;\n b.id = buttonId;\n if (__mapping) {\n b.dalliance_mapping = __mapping;\n }\n buttons.push(b);\n bd.appendChild(b);\n b.addEventListener('change', function (ev) {\n if (ev.target.checked) {\n thisB.addTier(ev.target.dalliance_source);\n } else {\n thisB.removeTier(ev.target.dalliance_source);\n }\n });\n\n r.appendChild(bd);\n var ld = makeElement('label', null, { htmlFor: buttonId });\n ld.appendChild(document.createTextNode(track.shortLabel));\n if (track.longLabel && track.longLabel.length > 0) {\n thisB.makeTooltip(ld, track.longLabel);\n }\n r.appendChild(makeElement('td', ld));\n stabBody.appendChild(r);\n ++idx;\n }\n\n if (groups.length > 1 || group.shortLabel !== 'Others') {\n ttab.appendChild(makeTreeTableSection(group.shortLabel, stab, gi == 0));\n } else {\n ttab.appendChild(stab);\n }\n }\n }\n\n var setChecks = function setChecks() {\n for (var bi = 0; bi < buttons.length; ++bi) {\n var b = buttons[bi];\n var t = thisB.currentlyActive(b.dalliance_source);\n if (t) {\n b.checked = true;\n b.disabled = t.sequenceSource != null;\n } else {\n b.checked = false;\n }\n }\n };\n setChecks();\n thisB.addTierListener(function (l) {\n setChecks();\n });\n\n stabHolder.appendChild(ttab);\n }\n\n if (regButton) {\n regButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n activateButton(addModeButtons, regButton);\n makeStab(thisB.availableSources);\n }, false);\n }\n\n binButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n switchToBinMode();\n }, false);\n addHubButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n switchToHubConnectMode();\n }, false);\n\n function switchToBinMode() {\n activateButton(addModeButtons, binButton);\n customMode = 'bin';\n\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'none';\n\n removeChildren(stabHolder);\n var pageHolder = makeElement('div', null, {}, { paddingLeft: '10px', paddingRight: '10px' });\n pageHolder.appendChild(makeElement('h3', 'Add custom URL-based data'));\n pageHolder.appendChild(makeElement('p', ['You can add indexed binary data hosted on an web server that supports CORS (', makeElement('a', 'full details', { href: 'http://www.biodalliance.org/bin.html' }), '). Currently supported formats are bigwig, bigbed, and indexed BAM.']));\n\n pageHolder.appendChild(makeElement('br'));\n pageHolder.appendChild(document.createTextNode('URL: '));\n custURL = makeElement('input', '', { size: 80, value: 'http://www.biodalliance.org/datasets/ensGene.bb' }, { width: '100%' });\n pageHolder.appendChild(custURL);\n\n pageHolder.appendChild(makeElement('br'));\n pageHolder.appendChild(makeElement('b', '- or -'));\n pageHolder.appendChild(makeElement('br'));\n pageHolder.appendChild(document.createTextNode('File: '));\n custFile = makeElement('input', null, { type: 'file', multiple: 'multiple' });\n pageHolder.appendChild(custFile);\n\n pageHolder.appendChild(makeElement('p', 'Clicking the \"Add\" button below will initiate a series of test queries.'));\n\n stabHolder.appendChild(pageHolder);\n custURL.focus();\n }\n\n function switchToHubConnectMode() {\n activateButton(addModeButtons, addHubButton);\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'none';\n\n customMode = 'hub-connect';\n refreshButton.style.visibility = 'hidden';\n\n removeChildren(stabHolder);\n\n var pageHolder = makeElement('div', null, {}, { paddingLeft: '10px', paddingRight: '10px' });\n pageHolder.appendChild(makeElement('h3', 'Connect to a track hub.'));\n pageHolder.appendChild(makeElement('p', ['Enter the top-level URL (usually points to a file called \"hub.txt\") of a UCSC-style track hub']));\n\n custURL = makeElement('input', '', { size: 120, value: 'http://www.biodalliance.org/datasets/testhub/hub.txt' }, { width: '100%' });\n pageHolder.appendChild(custURL);\n\n stabHolder.appendChild(pageHolder);\n\n custURL.focus();\n }\n\n custButton.addEventListener('click', function (ev) {\n ev.preventDefault();ev.stopPropagation();\n switchToCustomMode();\n }, false);\n\n function switchToCustomMode() {\n activateButton(addModeButtons, custButton);\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'none';\n\n customMode = 'das';\n\n removeChildren(stabHolder);\n\n var customForm = makeElement('div', null, {}, { paddingLeft: '10px', paddingRight: '10px' });\n customForm.appendChild(makeElement('h3', 'Add custom DAS data'));\n customForm.appendChild(makeElement('p', 'This interface is intended for adding custom or lab-specific data. Public data can be added more easily via the registry interface.'));\n\n customForm.appendChild(document.createTextNode('URL: '));\n customForm.appendChild(makeElement('br'));\n custURL = makeElement('input', '', { size: 80, value: 'http://www.derkholm.net:8080/das/medipseq_reads/' }, { width: '100%' });\n customForm.appendChild(custURL);\n\n customForm.appendChild(makeElement('p', 'Clicking the \"Add\" button below will initiate a series of test queries. If the source is password-protected, you may be prompted to enter credentials.'));\n stabHolder.appendChild(customForm);\n\n custURL.focus();\n }\n\n var addButton = makeElement('button', 'Add', { className: 'btn btn-primary' });\n addButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n doAdd();\n }, false);\n\n function doAdd() {\n if (customMode) {\n if (customMode === 'das') {\n var curi = custURL.value.trim();\n if (!/^.+:\\/\\//.exec(curi)) {\n curi = 'http://' + curi;\n }\n var nds = new DASSource({ name: 'temporary', uri: curi });\n tryAddDAS(nds);\n } else if (customMode === 'bin') {\n var fileList = custFile.files;\n\n if (fileList && fileList.length > 0) {\n tryAddMultiple(fileList);\n } else {\n var curi = custURL.value.trim();\n if (!/^.+:\\/\\//.exec(curi)) {\n curi = 'http://' + curi;\n }\n var source = { uri: curi };\n var lcuri = curi.toLowerCase();\n if (lcuri.indexOf(\"https://www.encodeproject.org/\") == 0 && lcuri.indexOf(\"@@download\") >= 0) {\n source.transport = 'encode';\n }\n tryAddBin(source);\n }\n } else if (customMode === 'reset') {\n switchToCustomMode();\n } else if (customMode === 'reset-bin') {\n switchToBinMode();\n } else if (customMode === 'reset-hub') {\n switchToHubConnectMode();\n } else if (customMode === 'prompt-bai') {\n var fileList = custFile.files;\n if (fileList && fileList.length > 0 && fileList[0]) {\n dataToFinalize.baiBlob = fileList[0];\n completeBAM(dataToFinalize);\n } else {\n promptForBAI(dataToFinalize);\n }\n } else if (customMode === 'prompt-tbi') {\n var fileList = custFile.files;\n if (fileList && fileList.length > 0 && fileList[0]) {\n dataToFinalize.indexBlob = fileList[0];\n completeTabixVCF(dataToFinalize);\n } else {\n promptForTabix(dataToFinalize);\n }\n } else if (customMode === 'finalize' || customMode === 'finalize-bin') {\n dataToFinalize.name = custName.value;\n var m = custCS.value;\n if (m != '__default__') {\n dataToFinalize.mapping = m;\n } else {\n dataToFinalize.mapping = undefined;\n }\n if (custQuant) {\n dataToFinalize.maxbins = custQuant.checked;\n }\n\n if (custUser.value.length > 1 && custPass.value.length > 1) {\n dataToFinalize.xUser = custUser.value;\n dataToFinalize.xPass = custPass.value;\n }\n\n thisB.addTier(dataToFinalize);\n\n if (customMode == 'finalize-bin') switchToBinMode();else switchToCustomMode();\n } else if (customMode === 'hub-connect') {\n var curi = custURL.value.trim();\n if (!/^.+:\\/\\//.exec(curi)) {\n curi = 'http://' + curi;\n }\n\n tryAddHub(curi);\n } else if (customMode === 'multiple') {\n for (var mi = 0; mi < multipleSet.length; ++mi) {\n var s = multipleSet[mi];\n if (s.hidden) continue;\n\n if (s.tier_type == 'bam' && !s.indexBlob && !s.indexUri) continue;\n if (s.tier_type == 'tabix' && !s.indexBlob && !s.indexUri) continue;\n\n var nds = makeSourceConfig(s);\n if (nds) {\n nds.noPersist = true;\n thisB.addTier(nds);\n }\n }\n\n switchToBinMode();\n }\n } else {\n thisB.removeAllPopups();\n }\n };\n\n function tryAddHub(curi, opts, retry) {\n opts = opts || {};\n for (var hi = 0; hi < thisB.hubObjects.length; ++hi) {\n var h = thisB.hubObjects[hi];\n if (h.hub.url == curi) {\n for (var bi = 0; bi < addModeButtons.length; ++bi) {\n if (addModeButtons[bi].hub == h) {\n activateButton(addModeButtons, addModeButtons[bi]);\n }\n }\n h.getTracks(function (tracks, err) {\n if (err) {\n console.log(err);\n }\n makeHubStab(tracks);\n });\n return;\n }\n }\n\n connectTrackHub(curi, function (hub, err) {\n if (err) {\n if (!retry) {\n return tryAddHub(curi, { credentials: true }, true);\n }\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'Error connecting to track hub'));\n stabHolder.appendChild(makeElement('p', err));\n customMode = 'reset-hub';\n return;\n } else {\n var bestHub = null;\n var bestHubButton = null;\n for (var genome in hub.genomes) {\n var mapping = null;\n var okay = false;\n\n if (genome == thisB.coordSystem.ucscName) {\n okay = true;\n } else {\n for (var mid in thisB.chains) {\n var m = thisB.chains[mid];\n if (genome == m.coords.ucscName) {\n mapping = mid;\n okay = true;\n }\n }\n }\n\n if (okay) {\n var hc = { url: curi, genome: genome };\n if (opts.credentials) hc.credentials = true;\n if (mapping) {\n hc.mapping = mapping;\n hub.genomes[genome].mapping = mapping;\n }\n thisB.hubs.push(hc);\n thisB.hubObjects.push(hub.genomes[genome]);\n\n var hubButton = makeHubButton(hub.genomes[genome]);\n modeButtonHolder.appendChild(hubButton);\n\n if (!mapping || !bestHub) {\n bestHub = hub.genomes[genome];\n bestHubButton = hubButton;\n }\n }\n }\n\n if (bestHub) {\n thisB.notifyTier();\n activateButton(addModeButtons, bestHubButton);\n bestHub.getTracks(function (tracks, err) {\n makeHubStab(tracks);\n });\n } else {\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'No data for this genome'));\n stabHolder.appendChild(makeElement('p', 'This URL appears to be a valid track-hub, but it doesn\\'t contain any data for the coordinate system of this browser'));\n stabHolder.appendChild(makeElement('p', 'coordSystem.ucscName = ' + thisB.coordSystem.ucscName));\n customMode = 'reset-hub';\n return;\n }\n }\n }, opts);\n }\n\n var tryAddDAS = function tryAddDAS(nds, retry) {\n var knownSpace = thisB.knownSpace;\n if (!knownSpace) {\n alert(\"Can't confirm track-addition to an uninit browser.\");\n return;\n }\n var tsm = Math.max(knownSpace.min, (knownSpace.min + knownSpace.max - 100) / 2) | 0;\n var testSegment = new DASSegment(knownSpace.chr, tsm, Math.min(tsm + 99, knownSpace.max));\n nds.features(testSegment, {}, function (features, status) {\n if (status) {\n if (!retry) {\n nds.credentials = true;\n tryAddDAS(nds, true);\n } else {\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'Custom data not found'));\n stabHolder.appendChild(makeElement('p', 'DAS uri: ' + nds.uri + ' is not answering features requests'));\n customMode = 'reset';\n return;\n }\n } else {\n var nameExtractPattern = new RegExp('/([^/]+)/?$');\n var match = nameExtractPattern.exec(nds.uri);\n if (match) {\n nds.name = match[1];\n }\n\n tryAddDASxSources(nds);\n return;\n }\n });\n };\n\n function tryAddDASxSources(nds, retry) {\n var uri = nds.uri;\n if (retry) {\n var match = /(.+)\\/[^\\/]+\\/?/.exec(uri);\n if (match) {\n uri = match[1] + '/sources';\n }\n }\n function sqfail() {\n if (!retry) {\n return tryAddDASxSources(nds, true);\n } else {\n return addDasCompletionPage(nds);\n }\n }\n new DASRegistry(uri, { credentials: nds.credentials }).sources(function (sources) {\n if (!sources || sources.length == 0) {\n return sqfail();\n }\n\n var fs = null;\n if (sources.length == 1) {\n fs = sources[0];\n } else {\n for (var i = 0; i < sources.length; ++i) {\n if (sources[i].uri === nds.uri) {\n fs = sources[i];\n break;\n }\n }\n }\n\n var coordsDetermined = false,\n quantDetermined = false;\n if (fs) {\n nds.name = fs.name;\n nds.desc = fs.desc;\n if (fs.maxbins) {\n nds.maxbins = true;\n } else {\n nds.maxbins = false;\n }\n if (fs.capabilities) {\n nds.capabilities = fs.capabilities;\n }\n quantDetermined = true;\n\n if (fs.coords && fs.coords.length == 1) {\n var coords = fs.coords[0];\n if (coordsMatch(coords, thisB.coordSystem)) {\n coordsDetermined = true;\n } else if (thisB.chains) {\n for (var k in thisB.chains) {\n if (coordsMatch(coords, thisB.chains[k].coords)) {\n nds.mapping = k;\n coordsDetermined = true;\n }\n }\n }\n }\n }\n return addDasCompletionPage(nds, coordsDetermined, quantDetermined);\n }, function () {\n return sqfail();\n });\n }\n\n var makeSourceConfig = function makeSourceConfig(s) {\n var nds = { name: s.name };\n if (s.credentials) nds.credentials = s.credentials;\n\n if (s.mapping && s.mapping != '__default__') nds.mapping = s.mapping;\n\n if (s.transport) nds.transport = s.transport;\n\n if (s.tier_type == 'bwg') {\n if (s.blob) nds.bwgBlob = s.blob;else if (s.uri) nds.bwgURI = s.uri;\n return nds;\n } else if (s.tier_type == 'bam') {\n if (s.blob) {\n nds.bamBlob = s.blob;\n nds.baiBlob = s.indexBlob;\n } else {\n nds.bamURI = s.uri;\n nds.baiURI = s.indexUri;\n }\n return nds;\n } else if (s.tier_type == 'tabix') {\n nds.tier_type = 'tabix';\n nds.payload = s.payload;\n if (s.blob) {\n nds.blob = s.blob;\n nds.indexBlob = s.indexBlob;\n } else {\n nds.uri = s.uri;\n nds.indexUri = s.indexUri;\n }\n return nds;\n } else if (s.tier_type == 'memstore') {\n nds.tier_type = 'memstore';\n nds.payload = s.payload;\n if (s.blob) nds.blob = s.blob;else nds.uri = s.uri;\n return nds;\n }\n };\n\n var tryAddBin = function tryAddBin(source) {\n probeResource(source, function (source, err) {\n if (err) {\n removeChildren(stabHolder);\n var tabError = makeElement('div');\n tabError.appendChild(makeElement('h2', \"Couldn't access custom data\"));\n tabError.appendChild(makeElement('p', '' + err));\n stabHolder.appendChild(tabError);\n console.log(source);\n if (window.location.protocol === 'https:' && source.uri.indexOf('http:') == 0) {\n thisB.canFetchPlainHTTP().then(function (can) {\n if (!can) {\n tabError.appendChild(makeElement('p', [makeElement('strong', 'HTTP warning: '), 'you may not be able to access HTTP resources from an instance of Biodalliance which you are accessing via HTTPS.', makeElement('a', '[More info]', { href: thisB.httpWarningURL, target: \"_blank\" })]));\n }\n });\n }\n customMode = 'reset-bin';\n } else {\n var nds = makeSourceConfig(source);\n if (source.tier_type == 'bam') {\n return completeBAM(nds);\n } else if (source.tier_type == 'tabix') {\n return completeTabixVCF(nds);\n } else {\n return addDasCompletionPage(nds, false, false, true);\n }\n }\n });\n };\n\n function promptForBAI(nds) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n customMode = 'prompt-bai';\n stabHolder.appendChild(makeElement('h2', 'Select an index file'));\n stabHolder.appendChild(makeElement('p', 'Dalliance requires a BAM index (.bai) file when displaying BAM data. These normally accompany BAM files. For security reasons, web applications like Dalliance can only access local files which you have explicity selected. Please use the file chooser below to select the appropriate BAI file'));\n\n stabHolder.appendChild(document.createTextNode('Index file: '));\n custFile = makeElement('input', null, { type: 'file' });\n stabHolder.appendChild(custFile);\n dataToFinalize = nds;\n }\n\n function promptForTabix(nds) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n customMode = 'prompt-tbi';\n stabHolder.appendChild(makeElement('h2', 'Select an index file'));\n stabHolder.appendChild(makeElement('p', 'Dalliance requires a Tabix index (.tbi) file when displaying VCF data. For security reasons, web applications like Dalliance can only access local files which you have explicity selected. Please use the file chooser below to select the appropriate BAI file'));\n\n stabHolder.appendChild(document.createTextNode('Index file: '));\n custFile = makeElement('input', null, { type: 'file' });\n stabHolder.appendChild(custFile);\n dataToFinalize = nds;\n }\n\n function completeBAM(nds) {\n var indexF;\n if (nds.baiBlob) indexF = new BlobFetchable(nds.baiBlob);else if (nds.transport == 'encode') indexF = new EncodeFetchable(nds.bamURI + '.bai');else indexF = new URLFetchable(nds.bamURI + '.bai', { credentials: nds.credentials });\n\n indexF.slice(0, 256).fetch(function (r) {\n var hasBAI = false;\n if (r) {\n var ba = new Uint8Array(r);\n var magic2 = readInt(ba, 0);\n hasBAI = magic2 == BAI_MAGIC;\n }\n if (hasBAI) {\n return addDasCompletionPage(nds, false, false, true);\n } else {\n return binFormatErrorPage('You have selected a valid BAM file, but a corresponding index (.bai) file was not found. Please index your BAM (samtools index) and place the BAI file in the same directory');\n }\n });\n }\n\n function completeTabixVCF(nds) {\n var indexF;\n if (nds.indexBlob) {\n indexF = new BlobFetchable(nds.indexBlob);\n } else {\n indexF = new URLFetchable(nds.uri + '.tbi');\n }\n indexF.slice(0, 1 << 16).fetch(function (r) {\n var hasTabix = false;\n if (r) {\n var ba = new Uint8Array(r);\n if (ba[0] == 31 || ba[1] == 139) {\n var unc = unbgzf(r);\n ba = new Uint8Array(unc);\n var m2 = readInt(ba, 0);\n hasTabix = m2 == TABIX_MAGIC;\n }\n }\n if (hasTabix) {\n return addDasCompletionPage(nds, false, false, true);\n } else {\n return binFormatErrorPage('You have selected a valid VCF file, but a corresponding index (.tbi) file was not found. Please index your VCF (\"tabix -p vcf -f myfile.vcf.gz\") and place the .tbi file in the same directory');\n }\n });\n }\n\n function binFormatErrorPage(message) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n message = message || 'Custom data format not recognized';\n stabHolder.appendChild(makeElement('h2', 'Error adding custom data'));\n stabHolder.appendChild(makeElement('p', message));\n stabHolder.appendChild(makeElement('p', 'Currently supported formats are bigBed, bigWig, and BAM.'));\n customMode = 'reset-bin';\n return;\n }\n\n var addDasCompletionPage = function addDasCompletionPage(nds, coordsDetermined, quantDetermined, quantIrrelevant) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'Add custom data: step 2'));\n stabHolder.appendChild(document.createTextNode('Label: '));\n custName = makeElement('input', '', { value: nds.name });\n stabHolder.appendChild(custName);\n\n // stabHolder.appendChild(document.createTextNode('User: '));\n custUser = makeElement('input', '');\n // stabHolder.appendChild(custUser);\n //stabHolder.appendChild(document.createTextNode('Pass: '));\n custPass = makeElement('input', '');\n // stabHolder.appendChild(custPass);\n\n\n stabHolder.appendChild(makeElement('br'));\n stabHolder.appendChild(makeElement('br'));\n stabHolder.appendChild(makeElement('h4', 'Coordinate system: '));\n custCS = makeElement('select', null);\n custCS.appendChild(makeElement('option', thisB.nameForCoordSystem(thisB.coordSystem), { value: '__default__' }));\n if (thisB.chains) {\n for (var csk in thisB.chains) {\n var cs = thisB.chains[csk].coords;\n custCS.appendChild(makeElement('option', thisB.nameForCoordSystem(cs), { value: csk }));\n }\n }\n custCS.value = nds.mapping || '__default__';\n stabHolder.appendChild(custCS);\n\n if (coordsDetermined) {\n stabHolder.appendChild(makeElement('p', \"(Based on server response, probably doesn't need changing.)\"));\n } else {\n stabHolder.appendChild(makeElement('p', [makeElement('b', 'Warning: '), \"unable to determine the correct value from server responses. Please check carefully.\"]));\n stabHolder.appendChild(makeElement('p', \"If you don't see the mapping you're looking for, please contact [email protected] \"));\n }\n\n if (!quantIrrelevant) {\n stabHolder.appendChild(document.createTextNode('Quantitative: '));\n custQuant = makeElement('input', null, { type: 'checkbox', checked: true });\n if (typeof nds.maxbins !== 'undefined') {\n custQuant.checked = nds.maxbins;\n }\n stabHolder.appendChild(custQuant);\n if (quantDetermined) {\n stabHolder.appendChild(makeElement('p', \"(Based on server response, probably doesn't need changing.)\"));\n } else {\n stabHolder.appendChild(makeElement('p', [makeElement('b', \"Warning: \"), \"unable to determine correct value. If in doubt, leave checked.\"]));\n }\n }\n\n if (nds.bwgBlob) {\n stabHolder.appendChild(makeElement('p', [makeElement('b', 'Warning: '), 'data added from local file. Due to the browser security model, the track will disappear if you reload Dalliance.']));\n }\n\n custName.focus();\n\n if (customMode === 'bin' || customMode === 'prompt-bai' || customMode === 'prompt-tbi') customMode = 'finalize-bin';else customMode = 'finalize';\n dataToFinalize = nds;\n };\n\n var multipleSet = null;\n var tryAddMultiple = function tryAddMultiple(fileList) {\n var newSources = multipleSet = [];\n customMode = 'multiple';\n for (var fi = 0; fi < fileList.length; ++fi) {\n var f = fileList[fi];\n if (f) {\n newSources.push({ blob: f });\n }\n }\n\n for (var fi = 0; fi < newSources.length; ++fi) {\n probeMultiple(newSources[fi]);\n }\n updateMultipleStatus();\n };\n\n var probeMultiple = function probeMultiple(ns) {\n probeResource(ns, function (source, err) {\n if (err) {\n source.error = err;\n }\n\n var usedIndices = [];\n var bams = {},\n tabixes = {};\n for (var si = 0; si < multipleSet.length; ++si) {\n var s = multipleSet[si];\n if (s.tier_type == 'bam' && !s.indexBlob) {\n bams[s.blob.name] = s;\n }\n if (s.tier_type == 'tabix' && !s.indexBlob) {\n tabixes[s.blob.name] = s;\n }\n }\n\n for (var si = 0; si < multipleSet.length; ++si) {\n var s = multipleSet[si];\n if (s.tier_type === 'bai') {\n var baiPattern = new RegExp('(.+)\\\\.bai$');\n var match = baiPattern.exec(s.blob.name);\n if (match && bams[match[1]]) {\n bams[match[1]].indexBlob = s.blob;\n usedIndices.push(si);\n }\n } else if (s.tier_type === 'tabix-index') {\n var tbiPattern = new RegExp('(.+)\\\\.tbi$');\n var match = tbiPattern.exec(s.blob.name);\n if (match && tabixes[match[1]]) {\n tabixes[match[1]].indexBlob = s.blob;\n usedIndices.push(si);\n }\n }\n }\n\n for (var bi = usedIndices.length - 1; bi >= 0; --bi) {\n multipleSet.splice(usedIndices[bi], 1);\n }\n\n updateMultipleStatus();\n });\n };\n\n var updateMultipleStatus = function updateMultipleStatus() {\n removeChildren(stabHolder);\n var needsIndex = false;\n var multTable = makeElement('table', multipleSet.filter(function (s) {\n return !s.hidden;\n }).map(function (s) {\n var row = makeElement('tr');\n row.appendChild(makeElement('td', s.name || s.blob.name));\n var typeContent;\n if (s.error) {\n typeContent = makeElement('span', 'Error', null, { color: 'red' });\n } else if (s.tier_type) {\n typeContent = s.payload || s.tier_type;\n } else {\n typeContent = thisB.makeLoader(16);\n }\n\n var ccs;\n var state = 'unknown';\n if (s.tier_type == 'bwg' || s.tier_type == 'memstore') {\n state = 'okay';\n } else if (s.tier_type == 'bam') {\n state = s.indexBlob ? 'okay' : 'needs-index';\n } else if (s.tier_type == 'tabix') {\n state = s.indexBlob ? 'okay' : 'needs-index';\n }\n\n if (state == 'okay') {\n ccs = makeElement('select', null, null, { width: '150px' });\n ccs.appendChild(makeElement('option', thisB.nameForCoordSystem(thisB.coordSystem), { value: '__default__' }));\n if (thisB.chains) {\n for (var csk in thisB.chains) {\n var cs = thisB.chains[csk].coords;\n ccs.appendChild(makeElement('option', thisB.nameForCoordSystem(cs), { value: csk }));\n }\n }\n ccs.value = s.mapping || '__default__';\n\n ccs.addEventListener('change', function (ev) {\n s.mapping = ccs.value;\n console.log(s);\n }, false);\n } else if (state == 'needs-index') {\n ccs = makeElement('span', 'Needs index', {}, { color: 'red' });\n needsIndex = true;\n }\n\n return makeElement('tr', [makeElement('td', s.name || s.blob.name), makeElement('td', typeContent), makeElement('td', ccs)]);\n }), { className: 'table table-striped table-condensed' });\n stabHolder.appendChild(multTable);\n\n if (needsIndex) {\n stabHolder.appendChild(makeElement('p', 'Some of these files are missing required index (.bai or .tbi) files. For security reasons, web applications like Dalliance can only access local files which you have explicity selected. Please use the file chooser below to select the appropriate index file'));\n stabHolder.appendChild(document.createTextNode('Index file(s): '));\n var indexFile = makeElement('input', null, { type: 'file', multiple: 'multiple' });\n stabHolder.appendChild(indexFile);\n indexFile.addEventListener('change', function (ev) {\n console.log('fileset changed');\n var fileList = indexFile.files || [];\n for (var fi = 0; fi < fileList.length; ++fi) {\n var f = fileList[fi];\n if (f) {\n var ns = { blob: f, hidden: true };\n multipleSet.push(ns);\n probeMultiple(ns);\n }\n }\n }, false);\n }\n };\n\n var canButton = makeElement('button', 'Cancel', { className: 'btn' });\n canButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n if (customMode === 'finalize-bin') switchToBinMode();else switchToCustomMode();\n }, false);\n\n var refreshButton = makeElement('button', 'Refresh', { className: 'btn' });\n refreshButton.addEventListener('click', function (ev) {\n ev.stopPropagation();ev.preventDefault();\n thisB.queryRegistry(__mapping);\n }, false);\n this.makeTooltip(refreshButton, 'Click to re-fetch data from the DAS registry');\n\n var buttonHolder = makeElement('div', [addButton, ' ', canButton, ' ', refreshButton]);\n buttonHolder.style.margin = '10px';\n asform.appendChild(buttonHolder);\n\n popup.appendChild(asform);\n makeStab(thisB.availableSources);\n\n this.showToolPanel(popup);\n this.setUiMode('add');\n\n if (firstDefButton) {\n activateButton(addModeButtons, firstDefButton);\n makeStab(new Observed(firstDefSources));\n }\n};\n\n},{\"./bam\":1,\"./bin\":4,\"./cbrowser\":6,\"./das\":10,\"./domui\":12,\"./encode\":14,\"./lh3utils\":26,\"./probe\":32,\"./sourcecompare\":40,\"./tabix\":47,\"./thub\":49,\"./utils\":56}],54:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// trix.js: UCSC-style free text indices\n//\n\n\"use strict\";\n\nfunction connectTrix(ix, ixx, callback) {\n ixx.fetchAsText(function (ixxData) {\n if (!ixxData) return callback(null, \"Couldn't fetch index-index\");\n\n var toks = ixxData.split(/(.+)([0-9A-F]{10})\\n/);\n\n var keys = [];\n var offsets = [];\n for (var ti = 1; ti < toks.length; ti += 3) {\n keys.push(toks[ti]);\n offsets.push(parseInt(toks[ti + 1], 16));\n }\n\n return callback(new TrixIndex(keys, offsets, ix));\n });\n}\n\nfunction TrixIndex(keys, offsets, ix) {\n this.keys = keys;\n this.offsets = offsets;\n this.ix = ix;\n}\n\nTrixIndex.prototype.lookup = function (query, callback) {\n var ixslice;\n\n var qtag = (query + ' ').substring(0, 5).toLowerCase();\n for (var i = 0; i < this.keys.length; ++i) {\n if (qtag.localeCompare(this.keys[i]) < 0) {\n ixslice = this.ix.slice(this.offsets[i - 1], this.offsets[i] - this.offsets[i - 1]);\n break;\n }\n }\n\n if (!ixslice) {\n ixslice = this.ix.slice(this.offsets[this.offsets.length - 1]);\n }\n\n ixslice.fetchAsText(function (ist) {\n var lines = ist.split('\\n');\n for (var li = 0; li < lines.length; ++li) {\n if (lines[li].indexOf(query.toLowerCase() + ' ') == 0) {\n return callback(lines[li].split(' '));\n }\n }\n return callback(null);\n });\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n connectTrix: connectTrix\n };\n}\n\n},{}],55:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// twoBit.js: packed-binary reference sequences\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var bin = require('./bin');\n var readInt = bin.readInt;\n var readIntBE = bin.readIntBE;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n}\n\nvar TWOBIT_MAGIC = 0x1a412743;\nvar TWOBIT_MAGIC_BE = 0x4327411a;\nvar HEADER_BLOCK_SIZE = 12500;\n\nfunction TwoBitFile() {}\n\nfunction makeTwoBit(fetchable, cnt) {\n var tb = new TwoBitFile();\n tb.data = fetchable;\n var headerBlockSize = HEADER_BLOCK_SIZE;\n var headerBlocksFetched = 0;\n\n tb.data.slice(0, headerBlockSize).fetch(function (r) {\n if (!r) {\n return cnt(null, \"Couldn't access data\");\n }\n var ba = new Uint8Array(r);\n var magic = readInt(ba, 0);\n if (magic == TWOBIT_MAGIC) {\n tb.readInt = readInt;\n } else if (magic == TWOBIT_MAGIC_BE) {\n tb.readInt = readIntBE;\n } else {\n return cnt(null, \"Not a .2bit file, magic=0x\" + magic.toString(16));\n }\n\n var version = tb.readInt(ba, 4);\n if (version != 0) {\n return cnt(null, 'Unsupported version ' + version);\n }\n\n tb.seqCount = tb.readInt(ba, 8);\n tb.seqDict = {};\n\n var p = 16,\n i = 0;\n var o = 0; // Offset of the current block if we need to fetch multiple header blocks.\n\n var parseSeqInfo = function parseSeqInfo() {\n while (i < tb.seqCount) {\n var ns = ba[p];\n if (p + ns + 6 >= ba.length) {\n headerBlocksFetched += headerBlockSize;\n headerBlockSize = Math.max(HEADER_BLOCK_SIZE, Math.floor(headerBlocksFetched * tb.seqCount / i));\n return tb.data.slice(o + p, headerBlockSize).fetch(function (r) {\n o += p;\n p = 0;\n ba = new Uint8Array(r);\n parseSeqInfo();\n });\n } else {\n ++p;\n var name = '';\n for (var j = 1; j <= ns; ++j) {\n name += String.fromCharCode(ba[p++]);\n }\n var offset = tb.readInt(ba, p);\n p += 4;\n tb.seqDict[name] = new TwoBitSeq(tb, offset);\n ++i;\n }\n }\n return cnt(tb);\n };\n\n parseSeqInfo();\n });\n}\n\nTwoBitFile.prototype.getSeq = function (chr) {\n var seq = this.seqDict[chr];\n if (!seq) {\n seq = this.seqDict['chr' + chr];\n }\n return seq;\n};\n\nTwoBitFile.prototype.fetch = function (chr, min, max, cnt) {\n var seq = this.getSeq(chr);\n if (!seq) {\n return cnt(null, \"Couldn't find \" + chr);\n } else if (max <= min) {\n return cnt('');\n } else {\n seq.fetch(min, max, cnt);\n }\n};\n\nfunction TwoBitSeq(tbf, offset) {\n this.tbf = tbf;\n this.offset = offset;\n}\n\nTwoBitSeq.prototype.init = function (cnt) {\n if (this.seqOffset) {\n return cnt();\n }\n\n var thisB = this;\n thisB.tbf.data.slice(thisB.offset, 8).fetch(function (r1) {\n if (!r1) {\n return cnt('Fetch failed');\n }\n var ba = new Uint8Array(r1);\n thisB._length = thisB.tbf.readInt(ba, 0);\n thisB.nBlockCnt = thisB.tbf.readInt(ba, 4);\n thisB.tbf.data.slice(thisB.offset + 8, thisB.nBlockCnt * 8 + 4).fetch(function (r2) {\n if (!r2) {\n return cnt('Fetch failed');\n }\n var ba = new Uint8Array(r2);\n var nbs = null;\n for (var b = 0; b < thisB.nBlockCnt; ++b) {\n var nbMin = thisB.tbf.readInt(ba, b * 4);\n var nbLen = thisB.tbf.readInt(ba, (b + thisB.nBlockCnt) * 4);\n var nb = new Range(nbMin, nbMin + nbLen - 1);\n if (!nbs) {\n nbs = nb;\n } else {\n nbs = union(nbs, nb);\n }\n }\n thisB.nBlocks = nbs;\n thisB.mBlockCnt = thisB.tbf.readInt(ba, thisB.nBlockCnt * 8);\n thisB.seqLength = (thisB._length + 3) / 4 | 0;\n thisB.seqOffset = thisB.offset + 16 + (thisB.nBlockCnt + thisB.mBlockCnt) * 8;\n return cnt();\n });\n });\n};\n\nvar TWOBIT_TABLE = ['T', 'C', 'A', 'G'];\n\nTwoBitSeq.prototype.fetch = function (min, max, cnt) {\n --min;--max; // Switch to zero-based.\n var thisB = this;\n this.init(function (error) {\n if (error) {\n return cnt(null, error);\n }\n\n var fetchMin = min >> 2;\n var fetchMax = max + 3 >> 2;\n if (fetchMin < 0 || fetchMax > thisB.seqLength) {\n return cnt('Coordinates out of bounds: ' + min + ':' + max);\n }\n\n thisB.tbf.data.slice(thisB.seqOffset + fetchMin, fetchMax - fetchMin).salted().fetch(function (r) {\n if (r == null) {\n return cnt('SeqFetch failed');\n }\n var seqData = new Uint8Array(r);\n\n var nSpans = [];\n if (thisB.nBlocks) {\n var intr = intersection(new Range(min, max), thisB.nBlocks);\n if (intr) {\n nSpans = intr.ranges();\n }\n }\n\n var seqstr = '';\n var ptr = min;\n function fillSeq(fsm) {\n while (ptr <= fsm) {\n var bb = (ptr >> 2) - fetchMin;\n var ni = ptr & 0x3;\n var bv = seqData[bb];\n var n;\n if (ni == 0) {\n n = bv >> 6 & 0x3;\n } else if (ni == 1) {\n n = bv >> 4 & 0x3;\n } else if (ni == 2) {\n n = bv >> 2 & 0x3;\n } else {\n n = bv & 0x3;\n }\n seqstr += TWOBIT_TABLE[n];\n ++ptr;\n }\n }\n\n for (var b = 0; b < nSpans.length; ++b) {\n var nb = nSpans[b];\n if (ptr > nb.min()) {\n throw 'N mismatch...';\n }\n if (ptr < nb.min()) {\n fillSeq(nb.min() - 1);\n }\n while (ptr <= nb.max()) {\n seqstr += 'N';\n ++ptr;\n }\n }\n if (ptr <= max) {\n fillSeq(max);\n }\n return cnt(seqstr);\n });\n });\n};\n\nTwoBitSeq.prototype.length = function (cnt) {\n var thisB = this;\n this.init(function (error) {\n if (error) {\n return cnt(null, error);\n } else {\n return cnt(thisB._length);\n }\n });\n};\n\nif (typeof module !== 'undefined') {\n module.exports = {\n makeTwoBit: makeTwoBit\n };\n}\n\n},{\"./bin\":4,\"./spans\":41}],56:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// utils.js: odds, sods, and ends.\n//\n\n\"use strict\";\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nif (typeof require !== 'undefined') {\n var sha1 = require('./sha1');\n var b64_sha1 = sha1.b64_sha1;\n}\n\nvar NUM_REGEXP = new RegExp('[0-9]+');\n\nfunction stringToNumbersArray(str) {\n var nums = new Array();\n var m;\n while (m = NUM_REGEXP.exec(str)) {\n nums.push(m[0]);\n str = str.substring(m.index + m[0].length);\n }\n return nums;\n}\n\nvar STRICT_NUM_REGEXP = new RegExp('^[0-9]+$');\n\nfunction stringToInt(str) {\n str = str.replace(new RegExp(',', 'g'), '');\n if (!STRICT_NUM_REGEXP.test(str)) {\n return null;\n }\n return str | 0;\n}\n\nfunction pushnew(a, v) {\n for (var i = 0; i < a.length; ++i) {\n if (a[i] == v) {\n return;\n }\n }\n a.push(v);\n}\n\nfunction pusho(obj, k, v) {\n if (obj[k]) {\n obj[k].push(v);\n } else {\n obj[k] = [v];\n }\n}\n\nfunction pushnewo(obj, k, v) {\n var a = obj[k];\n if (a) {\n for (var i = 0; i < a.length; ++i) {\n // indexOf requires JS16 :-(.\n if (a[i] == v) {\n return;\n }\n }\n a.push(v);\n } else {\n obj[k] = [v];\n }\n}\n\nfunction pick(a, b, c, d) {\n if (a) {\n return a;\n } else if (b) {\n return b;\n } else if (c) {\n return c;\n } else if (d) {\n return d;\n }\n}\n\nfunction pushnew(l, o) {\n for (var i = 0; i < l.length; ++i) {\n if (l[i] == o) {\n return;\n }\n }\n l.push(o);\n}\n\nfunction arrayIndexOf(a, x) {\n if (!a) {\n return -1;\n }\n\n for (var i = 0; i < a.length; ++i) {\n if (a[i] === x) {\n return i;\n }\n }\n return -1;\n}\n\nfunction arrayRemove(a, x) {\n var i = arrayIndexOf(a, x);\n if (i >= 0) {\n a.splice(i, 1);\n return true;\n }\n return false;\n}\n\n//\n// DOM utilities\n//\n\n\nfunction makeElement(tag, children, attribs, styles) {\n var ele = document.createElement(tag);\n if (children) {\n if (!(children instanceof Array)) {\n children = [children];\n }\n for (var i = 0; i < children.length; ++i) {\n var c = children[i];\n if (c) {\n if (typeof c == 'string') {\n c = document.createTextNode(c);\n } else if (typeof c == 'number') {\n c = document.createTextNode('' + c);\n }\n ele.appendChild(c);\n }\n }\n }\n\n if (attribs) {\n for (var l in attribs) {\n try {\n ele[l] = attribs[l];\n } catch (e) {\n console.log('error setting ' + l);\n throw e;\n }\n }\n }\n if (styles) {\n for (var l in styles) {\n ele.style[l] = styles[l];\n }\n }\n return ele;\n}\n\nfunction makeElementNS(namespace, tag, children, attribs) {\n var ele = document.createElementNS(namespace, tag);\n if (children) {\n if (!(children instanceof Array)) {\n children = [children];\n }\n for (var i = 0; i < children.length; ++i) {\n var c = children[i];\n if (typeof c == 'string') {\n c = document.createTextNode(c);\n }\n ele.appendChild(c);\n }\n }\n\n setAttrs(ele, attribs);\n return ele;\n}\n\nvar attr_name_cache = {};\n\nfunction setAttr(node, key, value) {\n var attr = attr_name_cache[key];\n if (!attr) {\n var _attr = '';\n for (var c = 0; c < key.length; ++c) {\n var cc = key.substring(c, c + 1);\n var lcc = cc.toLowerCase();\n if (lcc != cc) {\n _attr = _attr + '-' + lcc;\n } else {\n _attr = _attr + cc;\n }\n }\n attr_name_cache[key] = _attr;\n attr = _attr;\n }\n node.setAttribute(attr, value);\n}\n\nfunction setAttrs(node, attribs) {\n if (attribs) {\n for (var l in attribs) {\n setAttr(node, l, attribs[l]);\n }\n }\n}\n\nfunction removeChildren(node) {\n if (!node || !node.childNodes) {\n return;\n }\n\n while (node.childNodes.length > 0) {\n node.removeChild(node.firstChild);\n }\n}\n\n//\n// WARNING: not for general use!\n//\n\nfunction miniJSONify(o, exc) {\n if (typeof o === 'undefined') {\n return 'undefined';\n } else if (o == null) {\n return 'null';\n } else if (typeof o == 'string') {\n return \"'\" + o + \"'\";\n } else if (typeof o == 'number') {\n return \"\" + o;\n } else if (typeof o == 'boolean') {\n return \"\" + o;\n } else if ((typeof o === 'undefined' ? 'undefined' : _typeof(o)) == 'object') {\n if (o instanceof Array) {\n var s = null;\n for (var i = 0; i < o.length; ++i) {\n s = (s == null ? '' : s + ', ') + miniJSONify(o[i], exc);\n }\n return '[' + (s ? s : '') + ']';\n } else {\n exc = exc || {};\n var s = null;\n for (var k in o) {\n if (exc[k]) continue;\n if (k != undefined && typeof o[k] != 'function') {\n s = (s == null ? '' : s + ', ') + k + ': ' + miniJSONify(o[k], exc);\n }\n }\n return '{' + (s ? s : '') + '}';\n }\n } else {\n return typeof o === 'undefined' ? 'undefined' : _typeof(o);\n }\n}\n\nfunction shallowCopy(o) {\n var n = {};\n for (var k in o) {\n n[k] = o[k];\n }\n return n;\n}\n\nfunction Observed(x) {\n this.value = x;\n this.listeners = [];\n}\n\nObserved.prototype.addListener = function (f) {\n this.listeners.push(f);\n};\n\nObserved.prototype.addListenerAndFire = function (f) {\n this.listeners.push(f);\n f(this.value);\n};\n\nObserved.prototype.removeListener = function (f) {\n arrayRemove(this.listeners, f);\n};\n\nObserved.prototype.get = function () {\n return this.value;\n};\n\nObserved.prototype.set = function (x) {\n this.value = x;\n for (var i = 0; i < this.listeners.length; ++i) {\n this.listeners[i](x);\n }\n};\n\nfunction Awaited() {\n this.queue = [];\n}\n\nAwaited.prototype.provide = function (x) {\n if (this.res !== undefined) {\n throw \"Resource has already been provided.\";\n }\n\n this.res = x;\n for (var i = 0; i < this.queue.length; ++i) {\n this.queue[i](x);\n }\n this.queue = null; // avoid leaking closures.\n};\n\nAwaited.prototype.await = function (f) {\n if (this.res !== undefined) {\n f(this.res);\n return this.res;\n } else {\n this.queue.push(f);\n }\n};\n\nvar __dalliance_saltSeed = 0;\n\nfunction saltURL(url) {\n return url + '?salt=' + b64_sha1('' + Date.now() + ',' + ++__dalliance_saltSeed);\n}\n\nfunction textXHR(url, callback, opts) {\n if (opts && opts.salt) url = saltURL(url);\n\n try {\n var timeout;\n if (opts && opts.timeout) {\n timeout = setTimeout(function () {\n console.log('timing out ' + url);\n req.abort();\n return callback(null, 'Timeout');\n }, opts.timeout);\n }\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function () {\n if (req.readyState == 4) {\n if (timeout) clearTimeout(timeout);\n if (req.status < 200 || req.status >= 300) {\n callback(null, 'Error code ' + req.status);\n } else {\n callback(req.responseText);\n }\n }\n };\n\n req.open('GET', url, true);\n req.responseType = 'text';\n\n if (opts && opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n } catch (e) {\n callback(null, 'Exception ' + e);\n }\n}\n\nfunction relativeURL(base, rel) {\n // FIXME quite naive -- good enough for trackhubs?\n\n if (rel.indexOf('http:') == 0 || rel.indexOf('https:') == 0) {\n return rel;\n }\n\n var li = base.lastIndexOf('/');\n if (li >= 0) {\n return base.substr(0, li + 1) + rel;\n } else {\n return rel;\n }\n}\n\nvar AMINO_ACID_TRANSLATION = {\n 'TTT': 'F',\n 'TTC': 'F',\n 'TTA': 'L',\n 'TTG': 'L',\n 'CTT': 'L',\n 'CTC': 'L',\n 'CTA': 'L',\n 'CTG': 'L',\n 'ATT': 'I',\n 'ATC': 'I',\n 'ATA': 'I',\n 'ATG': 'M',\n 'GTT': 'V',\n 'GTC': 'V',\n 'GTA': 'V',\n 'GTG': 'V',\n 'TCT': 'S',\n 'TCC': 'S',\n 'TCA': 'S',\n 'TCG': 'S',\n 'CCT': 'P',\n 'CCC': 'P',\n 'CCA': 'P',\n 'CCG': 'P',\n 'ACT': 'T',\n 'ACC': 'T',\n 'ACA': 'T',\n 'ACG': 'T',\n 'GCT': 'A',\n 'GCC': 'A',\n 'GCA': 'A',\n 'GCG': 'A',\n 'TAT': 'Y',\n 'TAC': 'Y',\n 'TAA': '*', // stop\n 'TAG': '*', // stop\n 'CAT': 'H',\n 'CAC': 'H',\n 'CAA': 'Q',\n 'CAG': 'Q',\n 'AAT': 'N',\n 'AAC': 'N',\n 'AAA': 'K',\n 'AAG': 'K',\n 'GAT': 'D',\n 'GAC': 'D',\n 'GAA': 'E',\n 'GAG': 'E',\n 'TGT': 'C',\n 'TGC': 'C',\n 'TGA': '*', // stop\n 'TGG': 'W',\n 'CGT': 'R',\n 'CGC': 'R',\n 'CGA': 'R',\n 'CGG': 'R',\n 'AGT': 'S',\n 'AGC': 'S',\n 'AGA': 'R',\n 'AGG': 'R',\n 'GGT': 'G',\n 'GGC': 'G',\n 'GGA': 'G',\n 'GGG': 'G'\n};\n\nfunction resolveUrlToPage(rel) {\n return makeElement('a', null, { href: rel }).href;\n}\n\n//\n// Missing APIs\n// \n\nif (!('trim' in String.prototype)) {\n String.prototype.trim = function () {\n return this.replace(/^\\s+/, '').replace(/\\s+$/, '');\n };\n}\n\nif (typeof module !== 'undefined') {\n module.exports = {\n textXHR: textXHR,\n relativeURL: relativeURL,\n resolveUrlToPage: resolveUrlToPage,\n shallowCopy: shallowCopy,\n pusho: pusho,\n pushnew: pushnew,\n pushnewo: pushnewo,\n arrayIndexOf: arrayIndexOf,\n pick: pick,\n\n makeElement: makeElement,\n makeElementNS: makeElementNS,\n removeChildren: removeChildren,\n\n miniJSONify: miniJSONify,\n\n Observed: Observed,\n Awaited: Awaited,\n\n AMINO_ACID_TRANSLATION: AMINO_ACID_TRANSLATION\n };\n}\n\n},{\"./sha1\":38}],57:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// vcf.js\n//\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerParserFactory = sa.registerParserFactory;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n}\n\nfunction VCFParser() {\n this.info = [];\n}\n\nvar VCF_INFO_RE = /([^;=]+)(=([^;]+))?;?/;\nvar VCF_INFO_HEADER = /##INFO=<([^>]+)>/;\nvar VCF_INFO_HEADER_TOK = /([^,=]+)=([^,]+|\"[^\"]+\"),?/;\n\nVCFParser.prototype.createSession = function (sink) {\n return new VCFParseSession(this, sink);\n};\n\nfunction VCFParseSession(parser, sink) {\n this.parser = parser;\n this.sink = sink;\n}\n\nVCFParseSession.prototype.parse = function (line) {\n if (line.length == 0) return;\n if (line[0] == '#') {\n if (line.length > 1 && line[1] == '#') {\n var m = VCF_INFO_HEADER.exec(line);\n if (m) {\n var toks = m[1].split(VCF_INFO_HEADER_TOK);\n var id = null,\n desc = null;\n for (var ti = 0; ti < toks.length - 1; ti += 3) {\n var key = toks[ti + 1];\n var value = toks[ti + 2].replace(/\"/g, '');\n if (key == 'ID') {\n id = value;\n } else if (key == 'Description') {\n desc = value;\n }\n }\n if (id && desc) {\n this.parser.info.push({ id: id,\n desc: desc });\n }\n }\n return;\n } else {\n return;\n }\n }\n\n var toks = line.split('\\t');\n var f = new DASFeature();\n f.segment = toks[0];\n f.id = toks[2];\n f.refAllele = toks[3];\n f.altAlleles = toks[4].split(',');\n f.min = parseInt(toks[1]);\n f.max = f.min + f.refAllele.length - 1;\n\n var infoToks = toks[7].split(VCF_INFO_RE);\n f.info = {};\n for (var ti = 0; ti < infoToks.length; ti += 4) {\n f.info[infoToks[ti + 1]] = infoToks[ti + 3];\n }\n\n var alt = f.altAlleles[0];\n var ref = f.refAllele;\n if (alt.length > ref.length) {\n f.type = \"insertion\";\n if (alt.indexOf(ref) == 0) {\n f.insertion = alt.substr(ref.length);\n f.min += ref.length;\n f.max = f.min - 1; // Effectively \"between\" bases.\n } else {\n f.insertion = alt;\n }\n } else if (alt.length < ref.length) {\n f.type = \"deletion\";\n } else {\n f.type = 'substitution';\n }\n\n this.sink(f);\n};\n\nVCFParseSession.prototype.flush = function () {};\n\nVCFParser.prototype.getStyleSheet = function (callback) {\n var stylesheet = new DASStylesheet();\n\n {\n var varStyle = new DASStyle();\n varStyle.glyph = '__INSERTION';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'rgb(50,80,255)';\n varStyle.BGCOLOR = '#888888';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({ type: 'insertion' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'rgb(255, 60, 60)';\n varStyle.BGCOLOR = '#888888';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({ type: 'deletion' }, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'rgb(50,80,255)';\n varStyle.BGCOLOR = '#888888';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({ type: 'default' }, null, varStyle);\n }\n\n return callback(stylesheet);\n};\n\nVCFParser.prototype.getDefaultFIPs = function (callback) {\n var self = this;\n var fip = function fip(feature, featureInfo) {\n featureInfo.add(\"Ref. allele\", feature.refAllele);\n featureInfo.add(\"Alt. alleles\", feature.altAlleles.join(','));\n\n if (feature.info) {\n for (var ii = 0; ii < self.info.length; ++ii) {\n var info = self.info[ii];\n var val = feature.info[info.id];\n if (val !== undefined) {\n featureInfo.add(info.desc, val);\n }\n }\n }\n };\n callback(fip);\n};\n\ndalliance_registerParserFactory('vcf', function () {\n return new VCFParser();\n});\n\n},{\"./das\":10,\"./sourceadapters\":39}],58:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// version.js\n//\n\n\"use strict\";\n\nvar VERSION = {\n CONFIG: 5,\n MAJOR: 0,\n MINOR: 13,\n MICRO: 7,\n BRANCH: 'MOLGENIS'\n};\n\nVERSION.toString = function () {\n var vs = '' + this.MAJOR + '.' + this.MINOR + '.' + this.MICRO;\n if (this.PATCH) {\n vs = vs + this.PATCH;\n }\n if (this.BRANCH && this.BRANCH != '') {\n vs = vs + '-' + this.BRANCH;\n }\n return vs;\n};\n\nif (typeof module !== 'undefined') {\n module.exports = VERSION;\n}\n\n},{}],59:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// zoomslider.js: custom slider component\n//\n\n\n\"use strict\";\n\nif (typeof require !== 'undefined') {\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n}\n\nfunction makeZoomSlider(opts) {\n opts = opts || {};\n\n var minPos = 0,\n maxPos = opts.width || 200;\n var min = 0,\n max = 200;\n var pos = 50,\n pos2 = 100;\n var labels = [];\n var track = makeElement('hr', null, { className: 'slider-track' }, { width: '' + (maxPos | 0) + 'px' });\n var thumb = makeElement('hr', null, { className: 'slider-thumb active' });\n var thumb2 = makeElement('hr', null, { className: 'slider-thumb' });\n var slider = makeElement('div', [track, thumb, thumb2], { className: 'slider' }, { width: '' + ((maxPos | 0) + 10) + 'px' });\n\n slider.removeLabels = function () {\n for (var li = 0; li < labels.length; ++li) {\n slider.removeChild(labels[li]);\n }\n labels = [];\n };\n\n slider.addLabel = function (val, txt) {\n var pos = minPos + (val - min) * (maxPos - minPos) / (max - min) | 0;\n var label = makeElement('div', txt, { className: 'slider-label' }, {\n left: '' + (minPos + (val - min) * (maxPos - minPos) / (max - min) | 0) + 'px'\n });\n slider.appendChild(label);\n labels.push(label);\n };\n\n var onChange = document.createEvent('HTMLEvents');\n onChange.initEvent('change', true, false);\n\n function setPos(np) {\n np = Math.min(np, maxPos);\n np = Math.max(np, minPos);\n pos = np;\n thumb.style.left = '' + pos + 'px';\n }\n\n function setPos2(np) {\n np = Math.min(np, maxPos);\n np = Math.max(np, minPos);\n pos2 = np;\n thumb2.style.left = '' + pos2 + 'px';\n }\n\n Object.defineProperty(slider, 'value', {\n get: function get() {\n return min + (pos - minPos) * (max - min) / (maxPos - minPos);\n },\n set: function set(v) {\n var np = minPos + (v - min) * (maxPos - minPos) / (max - min);\n setPos(np);\n }\n });\n\n Object.defineProperty(slider, 'value2', {\n get: function get() {\n return min + (pos2 - minPos) * (max - min) / (maxPos - minPos);\n },\n set: function set(v) {\n var np = minPos + (v - min) * (maxPos - minPos) / (max - min);\n setPos2(np);\n }\n });\n\n Object.defineProperty(slider, 'active', {\n get: function get() {\n return thumb.classList.contains('active') ? 1 : 2;\n },\n set: function set(x) {\n if (x == 1) {\n thumb.classList.add('active');\n thumb2.classList.remove('active');\n } else {\n thumb2.classList.add('active');\n thumb.classList.remove('active');\n }\n }\n });\n\n Object.defineProperty(slider, 'min', {\n get: function get() {\n return min;\n },\n set: function set(v) {\n min = v;\n }\n });\n\n Object.defineProperty(slider, 'max', {\n get: function get() {\n return max;\n },\n set: function set(v) {\n max = v;\n }\n });\n\n var offset;\n var which;\n\n var thumbMouseDown = function thumbMouseDown(ev) {\n which = this == thumb ? 1 : 2;\n if (which != slider.active) {\n slider.active = which;\n slider.dispatchEvent(onChange);\n }\n ev.stopPropagation();ev.preventDefault();\n window.addEventListener('mousemove', thumbDragHandler, false);\n window.addEventListener('mouseup', thumbDragEndHandler, false);\n offset = ev.clientX - (which == 1 ? pos : pos2);\n };\n\n thumb.addEventListener('mousedown', thumbMouseDown, false);\n thumb2.addEventListener('mousedown', thumbMouseDown, false);\n\n var thumbDragHandler = function thumbDragHandler(ev) {\n if (which == 1) setPos(ev.clientX - offset);else setPos2(ev.clientX - offset);\n slider.dispatchEvent(onChange);\n };\n\n var thumbDragEndHandler = function thumbDragEndHandler(ev) {\n window.removeEventListener('mousemove', thumbDragHandler, false);\n window.removeEventListener('mouseup', thumbDragEndHandler, false);\n };\n\n return slider;\n}\n\nif (typeof module !== 'undefined') {\n module.exports = makeZoomSlider;\n}\n\n},{\"./utils\":56}],60:[function(require,module,exports){\n(function (global){\n\"use strict\";\n\nrequire(\"core-js/shim\");\n\nrequire(\"regenerator-runtime/runtime\");\n\nrequire(\"core-js/fn/regexp/escape\");\n\nif (global._babelPolyfill) {\n throw new Error(\"only one instance of babel-polyfill is allowed\");\n}\nglobal._babelPolyfill = true;\n\nvar DEFINE_PROPERTY = \"defineProperty\";\nfunction define(O, key, value) {\n O[key] || Object[DEFINE_PROPERTY](O, key, {\n writable: true,\n configurable: true,\n value: value\n });\n}\n\ndefine(String.prototype, \"padLeft\", \"\".padStart);\ndefine(String.prototype, \"padRight\", \"\".padEnd);\n\n\"pop,reverse,shift,keys,values,entries,indexOf,every,some,forEach,map,filter,find,findIndex,includes,join,slice,concat,push,splice,unshift,sort,lastIndexOf,reduce,reduceRight,copyWithin,fill\".split(\",\").forEach(function (key) {\n [][key] && define(Array, key, Function.call.bind([][key]));\n});\n}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{\"core-js/fn/regexp/escape\":61,\"core-js/shim\":383,\"regenerator-runtime/runtime\":388}],61:[function(require,module,exports){\nrequire('../../modules/core.regexp.escape');\nmodule.exports = require('../../modules/_core').RegExp.escape;\n\n},{\"../../modules/_core\":82,\"../../modules/core.regexp.escape\":186}],62:[function(require,module,exports){\nmodule.exports = function (it) {\n if (typeof it != 'function') throw TypeError(it + ' is not a function!');\n return it;\n};\n\n},{}],63:[function(require,module,exports){\nvar cof = require('./_cof');\nmodule.exports = function (it, msg) {\n if (typeof it != 'number' && cof(it) != 'Number') throw TypeError(msg);\n return +it;\n};\n\n},{\"./_cof\":77}],64:[function(require,module,exports){\n// 22.1.3.31 Array.prototype[@@unscopables]\nvar UNSCOPABLES = require('./_wks')('unscopables');\nvar ArrayProto = Array.prototype;\nif (ArrayProto[UNSCOPABLES] == undefined) require('./_hide')(ArrayProto, UNSCOPABLES, {});\nmodule.exports = function (key) {\n ArrayProto[UNSCOPABLES][key] = true;\n};\n\n},{\"./_hide\":101,\"./_wks\":184}],65:[function(require,module,exports){\nmodule.exports = function (it, Constructor, name, forbiddenField) {\n if (!(it instanceof Constructor) || (forbiddenField !== undefined && forbiddenField in it)) {\n throw TypeError(name + ': incorrect invocation!');\n } return it;\n};\n\n},{}],66:[function(require,module,exports){\nvar isObject = require('./_is-object');\nmodule.exports = function (it) {\n if (!isObject(it)) throw TypeError(it + ' is not an object!');\n return it;\n};\n\n},{\"./_is-object\":110}],67:[function(require,module,exports){\n// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\n'use strict';\nvar toObject = require('./_to-object');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\n\nmodule.exports = [].copyWithin || function copyWithin(target /* = 0 */, start /* = 0, end = @length */) {\n var O = toObject(this);\n var len = toLength(O.length);\n var to = toAbsoluteIndex(target, len);\n var from = toAbsoluteIndex(start, len);\n var end = arguments.length > 2 ? arguments[2] : undefined;\n var count = Math.min((end === undefined ? len : toAbsoluteIndex(end, len)) - from, len - to);\n var inc = 1;\n if (from < to && to < from + count) {\n inc = -1;\n from += count - 1;\n to += count - 1;\n }\n while (count-- > 0) {\n if (from in O) O[to] = O[from];\n else delete O[to];\n to += inc;\n from += inc;\n } return O;\n};\n\n},{\"./_to-absolute-index\":170,\"./_to-length\":174,\"./_to-object\":175}],68:[function(require,module,exports){\n// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\n'use strict';\nvar toObject = require('./_to-object');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\nmodule.exports = function fill(value /* , start = 0, end = @length */) {\n var O = toObject(this);\n var length = toLength(O.length);\n var aLen = arguments.length;\n var index = toAbsoluteIndex(aLen > 1 ? arguments[1] : undefined, length);\n var end = aLen > 2 ? arguments[2] : undefined;\n var endPos = end === undefined ? length : toAbsoluteIndex(end, length);\n while (endPos > index) O[index++] = value;\n return O;\n};\n\n},{\"./_to-absolute-index\":170,\"./_to-length\":174,\"./_to-object\":175}],69:[function(require,module,exports){\nvar forOf = require('./_for-of');\n\nmodule.exports = function (iter, ITERATOR) {\n var result = [];\n forOf(iter, false, result.push, result, ITERATOR);\n return result;\n};\n\n},{\"./_for-of\":98}],70:[function(require,module,exports){\n// false -> Array#indexOf\n// true -> Array#includes\nvar toIObject = require('./_to-iobject');\nvar toLength = require('./_to-length');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nmodule.exports = function (IS_INCLUDES) {\n return function ($this, el, fromIndex) {\n var O = toIObject($this);\n var length = toLength(O.length);\n var index = toAbsoluteIndex(fromIndex, length);\n var value;\n // Array#includes uses SameValueZero equality algorithm\n // eslint-disable-next-line no-self-compare\n if (IS_INCLUDES && el != el) while (length > index) {\n value = O[index++];\n // eslint-disable-next-line no-self-compare\n if (value != value) return true;\n // Array#indexOf ignores holes, Array#includes - not\n } else for (;length > index; index++) if (IS_INCLUDES || index in O) {\n if (O[index] === el) return IS_INCLUDES || index || 0;\n } return !IS_INCLUDES && -1;\n };\n};\n\n},{\"./_to-absolute-index\":170,\"./_to-iobject\":173,\"./_to-length\":174}],71:[function(require,module,exports){\n// 0 -> Array#forEach\n// 1 -> Array#map\n// 2 -> Array#filter\n// 3 -> Array#some\n// 4 -> Array#every\n// 5 -> Array#find\n// 6 -> Array#findIndex\nvar ctx = require('./_ctx');\nvar IObject = require('./_iobject');\nvar toObject = require('./_to-object');\nvar toLength = require('./_to-length');\nvar asc = require('./_array-species-create');\nmodule.exports = function (TYPE, $create) {\n var IS_MAP = TYPE == 1;\n var IS_FILTER = TYPE == 2;\n var IS_SOME = TYPE == 3;\n var IS_EVERY = TYPE == 4;\n var IS_FIND_INDEX = TYPE == 6;\n var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\n var create = $create || asc;\n return function ($this, callbackfn, that) {\n var O = toObject($this);\n var self = IObject(O);\n var f = ctx(callbackfn, that, 3);\n var length = toLength(self.length);\n var index = 0;\n var result = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined;\n var val, res;\n for (;length > index; index++) if (NO_HOLES || index in self) {\n val = self[index];\n res = f(val, index, O);\n if (TYPE) {\n if (IS_MAP) result[index] = res; // map\n else if (res) switch (TYPE) {\n case 3: return true; // some\n case 5: return val; // find\n case 6: return index; // findIndex\n case 2: result.push(val); // filter\n } else if (IS_EVERY) return false; // every\n }\n }\n return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : result;\n };\n};\n\n},{\"./_array-species-create\":74,\"./_ctx\":84,\"./_iobject\":106,\"./_to-length\":174,\"./_to-object\":175}],72:[function(require,module,exports){\nvar aFunction = require('./_a-function');\nvar toObject = require('./_to-object');\nvar IObject = require('./_iobject');\nvar toLength = require('./_to-length');\n\nmodule.exports = function (that, callbackfn, aLen, memo, isRight) {\n aFunction(callbackfn);\n var O = toObject(that);\n var self = IObject(O);\n var length = toLength(O.length);\n var index = isRight ? length - 1 : 0;\n var i = isRight ? -1 : 1;\n if (aLen < 2) for (;;) {\n if (index in self) {\n memo = self[index];\n index += i;\n break;\n }\n index += i;\n if (isRight ? index < 0 : length <= index) {\n throw TypeError('Reduce of empty array with no initial value');\n }\n }\n for (;isRight ? index >= 0 : length > index; index += i) if (index in self) {\n memo = callbackfn(memo, self[index], index, O);\n }\n return memo;\n};\n\n},{\"./_a-function\":62,\"./_iobject\":106,\"./_to-length\":174,\"./_to-object\":175}],73:[function(require,module,exports){\nvar isObject = require('./_is-object');\nvar isArray = require('./_is-array');\nvar SPECIES = require('./_wks')('species');\n\nmodule.exports = function (original) {\n var C;\n if (isArray(original)) {\n C = original.constructor;\n // cross-realm fallback\n if (typeof C == 'function' && (C === Array || isArray(C.prototype))) C = undefined;\n if (isObject(C)) {\n C = C[SPECIES];\n if (C === null) C = undefined;\n }\n } return C === undefined ? Array : C;\n};\n\n},{\"./_is-array\":108,\"./_is-object\":110,\"./_wks\":184}],74:[function(require,module,exports){\n// 9.4.2.3 ArraySpeciesCreate(originalArray, length)\nvar speciesConstructor = require('./_array-species-constructor');\n\nmodule.exports = function (original, length) {\n return new (speciesConstructor(original))(length);\n};\n\n},{\"./_array-species-constructor\":73}],75:[function(require,module,exports){\n'use strict';\nvar aFunction = require('./_a-function');\nvar isObject = require('./_is-object');\nvar invoke = require('./_invoke');\nvar arraySlice = [].slice;\nvar factories = {};\n\nvar construct = function (F, len, args) {\n if (!(len in factories)) {\n for (var n = [], i = 0; i < len; i++) n[i] = 'a[' + i + ']';\n // eslint-disable-next-line no-new-func\n factories[len] = Function('F,a', 'return new F(' + n.join(',') + ')');\n } return factories[len](F, args);\n};\n\nmodule.exports = Function.bind || function bind(that /* , ...args */) {\n var fn = aFunction(this);\n var partArgs = arraySlice.call(arguments, 1);\n var bound = function (/* args... */) {\n var args = partArgs.concat(arraySlice.call(arguments));\n return this instanceof bound ? construct(fn, args.length, args) : invoke(fn, args, that);\n };\n if (isObject(fn.prototype)) bound.prototype = fn.prototype;\n return bound;\n};\n\n},{\"./_a-function\":62,\"./_invoke\":105,\"./_is-object\":110}],76:[function(require,module,exports){\n// getting tag from 19.1.3.6 Object.prototype.toString()\nvar cof = require('./_cof');\nvar TAG = require('./_wks')('toStringTag');\n// ES3 wrong here\nvar ARG = cof(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n try {\n return it[key];\n } catch (e) { /* empty */ }\n};\n\nmodule.exports = function (it) {\n var O, T, B;\n return it === undefined ? 'Undefined' : it === null ? 'Null'\n // @@toStringTag case\n : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T\n // builtinTag case\n : ARG ? cof(O)\n // ES3 arguments fallback\n : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;\n};\n\n},{\"./_cof\":77,\"./_wks\":184}],77:[function(require,module,exports){\nvar toString = {}.toString;\n\nmodule.exports = function (it) {\n return toString.call(it).slice(8, -1);\n};\n\n},{}],78:[function(require,module,exports){\n'use strict';\nvar dP = require('./_object-dp').f;\nvar create = require('./_object-create');\nvar redefineAll = require('./_redefine-all');\nvar ctx = require('./_ctx');\nvar anInstance = require('./_an-instance');\nvar forOf = require('./_for-of');\nvar $iterDefine = require('./_iter-define');\nvar step = require('./_iter-step');\nvar setSpecies = require('./_set-species');\nvar DESCRIPTORS = require('./_descriptors');\nvar fastKey = require('./_meta').fastKey;\nvar validate = require('./_validate-collection');\nvar SIZE = DESCRIPTORS ? '_s' : 'size';\n\nvar getEntry = function (that, key) {\n // fast case\n var index = fastKey(key);\n var entry;\n if (index !== 'F') return that._i[index];\n // frozen object case\n for (entry = that._f; entry; entry = entry.n) {\n if (entry.k == key) return entry;\n }\n};\n\nmodule.exports = {\n getConstructor: function (wrapper, NAME, IS_MAP, ADDER) {\n var C = wrapper(function (that, iterable) {\n anInstance(that, C, NAME, '_i');\n that._t = NAME; // collection type\n that._i = create(null); // index\n that._f = undefined; // first entry\n that._l = undefined; // last entry\n that[SIZE] = 0; // size\n if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\n });\n redefineAll(C.prototype, {\n // 23.1.3.1 Map.prototype.clear()\n // 23.2.3.2 Set.prototype.clear()\n clear: function clear() {\n for (var that = validate(this, NAME), data = that._i, entry = that._f; entry; entry = entry.n) {\n entry.r = true;\n if (entry.p) entry.p = entry.p.n = undefined;\n delete data[entry.i];\n }\n that._f = that._l = undefined;\n that[SIZE] = 0;\n },\n // 23.1.3.3 Map.prototype.delete(key)\n // 23.2.3.4 Set.prototype.delete(value)\n 'delete': function (key) {\n var that = validate(this, NAME);\n var entry = getEntry(that, key);\n if (entry) {\n var next = entry.n;\n var prev = entry.p;\n delete that._i[entry.i];\n entry.r = true;\n if (prev) prev.n = next;\n if (next) next.p = prev;\n if (that._f == entry) that._f = next;\n if (that._l == entry) that._l = prev;\n that[SIZE]--;\n } return !!entry;\n },\n // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)\n // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)\n forEach: function forEach(callbackfn /* , that = undefined */) {\n validate(this, NAME);\n var f = ctx(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3);\n var entry;\n while (entry = entry ? entry.n : this._f) {\n f(entry.v, entry.k, this);\n // revert to the last existing entry\n while (entry && entry.r) entry = entry.p;\n }\n },\n // 23.1.3.7 Map.prototype.has(key)\n // 23.2.3.7 Set.prototype.has(value)\n has: function has(key) {\n return !!getEntry(validate(this, NAME), key);\n }\n });\n if (DESCRIPTORS) dP(C.prototype, 'size', {\n get: function () {\n return validate(this, NAME)[SIZE];\n }\n });\n return C;\n },\n def: function (that, key, value) {\n var entry = getEntry(that, key);\n var prev, index;\n // change existing entry\n if (entry) {\n entry.v = value;\n // create new entry\n } else {\n that._l = entry = {\n i: index = fastKey(key, true), // <- index\n k: key, // <- key\n v: value, // <- value\n p: prev = that._l, // <- previous entry\n n: undefined, // <- next entry\n r: false // <- removed\n };\n if (!that._f) that._f = entry;\n if (prev) prev.n = entry;\n that[SIZE]++;\n // add to index\n if (index !== 'F') that._i[index] = entry;\n } return that;\n },\n getEntry: getEntry,\n setStrong: function (C, NAME, IS_MAP) {\n // add .keys, .values, .entries, [@@iterator]\n // 23.1.3.4, 23.1.3.8, 23.1.3.11, 23.1.3.12, 23.2.3.5, 23.2.3.8, 23.2.3.10, 23.2.3.11\n $iterDefine(C, NAME, function (iterated, kind) {\n this._t = validate(iterated, NAME); // target\n this._k = kind; // kind\n this._l = undefined; // previous\n }, function () {\n var that = this;\n var kind = that._k;\n var entry = that._l;\n // revert to the last existing entry\n while (entry && entry.r) entry = entry.p;\n // get next entry\n if (!that._t || !(that._l = entry = entry ? entry.n : that._t._f)) {\n // or finish the iteration\n that._t = undefined;\n return step(1);\n }\n // return step by kind\n if (kind == 'keys') return step(0, entry.k);\n if (kind == 'values') return step(0, entry.v);\n return step(0, [entry.k, entry.v]);\n }, IS_MAP ? 'entries' : 'values', !IS_MAP, true);\n\n // add [@@species], 23.1.2.2, 23.2.2.2\n setSpecies(NAME);\n }\n};\n\n},{\"./_an-instance\":65,\"./_ctx\":84,\"./_descriptors\":88,\"./_for-of\":98,\"./_iter-define\":114,\"./_iter-step\":116,\"./_meta\":124,\"./_object-create\":129,\"./_object-dp\":130,\"./_redefine-all\":149,\"./_set-species\":156,\"./_validate-collection\":181}],79:[function(require,module,exports){\n// https://github.com/DavidBruant/Map-Set.prototype.toJSON\nvar classof = require('./_classof');\nvar from = require('./_array-from-iterable');\nmodule.exports = function (NAME) {\n return function toJSON() {\n if (classof(this) != NAME) throw TypeError(NAME + \"#toJSON isn't generic\");\n return from(this);\n };\n};\n\n},{\"./_array-from-iterable\":69,\"./_classof\":76}],80:[function(require,module,exports){\n'use strict';\nvar redefineAll = require('./_redefine-all');\nvar getWeak = require('./_meta').getWeak;\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar anInstance = require('./_an-instance');\nvar forOf = require('./_for-of');\nvar createArrayMethod = require('./_array-methods');\nvar $has = require('./_has');\nvar validate = require('./_validate-collection');\nvar arrayFind = createArrayMethod(5);\nvar arrayFindIndex = createArrayMethod(6);\nvar id = 0;\n\n// fallback for uncaught frozen keys\nvar uncaughtFrozenStore = function (that) {\n return that._l || (that._l = new UncaughtFrozenStore());\n};\nvar UncaughtFrozenStore = function () {\n this.a = [];\n};\nvar findUncaughtFrozen = function (store, key) {\n return arrayFind(store.a, function (it) {\n return it[0] === key;\n });\n};\nUncaughtFrozenStore.prototype = {\n get: function (key) {\n var entry = findUncaughtFrozen(this, key);\n if (entry) return entry[1];\n },\n has: function (key) {\n return !!findUncaughtFrozen(this, key);\n },\n set: function (key, value) {\n var entry = findUncaughtFrozen(this, key);\n if (entry) entry[1] = value;\n else this.a.push([key, value]);\n },\n 'delete': function (key) {\n var index = arrayFindIndex(this.a, function (it) {\n return it[0] === key;\n });\n if (~index) this.a.splice(index, 1);\n return !!~index;\n }\n};\n\nmodule.exports = {\n getConstructor: function (wrapper, NAME, IS_MAP, ADDER) {\n var C = wrapper(function (that, iterable) {\n anInstance(that, C, NAME, '_i');\n that._t = NAME; // collection type\n that._i = id++; // collection id\n that._l = undefined; // leak store for uncaught frozen objects\n if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\n });\n redefineAll(C.prototype, {\n // 23.3.3.2 WeakMap.prototype.delete(key)\n // 23.4.3.3 WeakSet.prototype.delete(value)\n 'delete': function (key) {\n if (!isObject(key)) return false;\n var data = getWeak(key);\n if (data === true) return uncaughtFrozenStore(validate(this, NAME))['delete'](key);\n return data && $has(data, this._i) && delete data[this._i];\n },\n // 23.3.3.4 WeakMap.prototype.has(key)\n // 23.4.3.4 WeakSet.prototype.has(value)\n has: function has(key) {\n if (!isObject(key)) return false;\n var data = getWeak(key);\n if (data === true) return uncaughtFrozenStore(validate(this, NAME)).has(key);\n return data && $has(data, this._i);\n }\n });\n return C;\n },\n def: function (that, key, value) {\n var data = getWeak(anObject(key), true);\n if (data === true) uncaughtFrozenStore(that).set(key, value);\n else data[that._i] = value;\n return that;\n },\n ufstore: uncaughtFrozenStore\n};\n\n},{\"./_an-instance\":65,\"./_an-object\":66,\"./_array-methods\":71,\"./_for-of\":98,\"./_has\":100,\"./_is-object\":110,\"./_meta\":124,\"./_redefine-all\":149,\"./_validate-collection\":181}],81:[function(require,module,exports){\n'use strict';\nvar global = require('./_global');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar redefineAll = require('./_redefine-all');\nvar meta = require('./_meta');\nvar forOf = require('./_for-of');\nvar anInstance = require('./_an-instance');\nvar isObject = require('./_is-object');\nvar fails = require('./_fails');\nvar $iterDetect = require('./_iter-detect');\nvar setToStringTag = require('./_set-to-string-tag');\nvar inheritIfRequired = require('./_inherit-if-required');\n\nmodule.exports = function (NAME, wrapper, methods, common, IS_MAP, IS_WEAK) {\n var Base = global[NAME];\n var C = Base;\n var ADDER = IS_MAP ? 'set' : 'add';\n var proto = C && C.prototype;\n var O = {};\n var fixMethod = function (KEY) {\n var fn = proto[KEY];\n redefine(proto, KEY,\n KEY == 'delete' ? function (a) {\n return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);\n } : KEY == 'has' ? function has(a) {\n return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);\n } : KEY == 'get' ? function get(a) {\n return IS_WEAK && !isObject(a) ? undefined : fn.call(this, a === 0 ? 0 : a);\n } : KEY == 'add' ? function add(a) { fn.call(this, a === 0 ? 0 : a); return this; }\n : function set(a, b) { fn.call(this, a === 0 ? 0 : a, b); return this; }\n );\n };\n if (typeof C != 'function' || !(IS_WEAK || proto.forEach && !fails(function () {\n new C().entries().next();\n }))) {\n // create collection constructor\n C = common.getConstructor(wrapper, NAME, IS_MAP, ADDER);\n redefineAll(C.prototype, methods);\n meta.NEED = true;\n } else {\n var instance = new C();\n // early implementations not supports chaining\n var HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance;\n // V8 ~ Chromium 40- weak-collections throws on primitives, but should return false\n var THROWS_ON_PRIMITIVES = fails(function () { instance.has(1); });\n // most early implementations doesn't supports iterables, most modern - not close it correctly\n var ACCEPT_ITERABLES = $iterDetect(function (iter) { new C(iter); }); // eslint-disable-line no-new\n // for early implementations -0 and +0 not the same\n var BUGGY_ZERO = !IS_WEAK && fails(function () {\n // V8 ~ Chromium 42- fails only with 5+ elements\n var $instance = new C();\n var index = 5;\n while (index--) $instance[ADDER](index, index);\n return !$instance.has(-0);\n });\n if (!ACCEPT_ITERABLES) {\n C = wrapper(function (target, iterable) {\n anInstance(target, C, NAME);\n var that = inheritIfRequired(new Base(), target, C);\n if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\n return that;\n });\n C.prototype = proto;\n proto.constructor = C;\n }\n if (THROWS_ON_PRIMITIVES || BUGGY_ZERO) {\n fixMethod('delete');\n fixMethod('has');\n IS_MAP && fixMethod('get');\n }\n if (BUGGY_ZERO || HASNT_CHAINING) fixMethod(ADDER);\n // weak collections should not contains .clear method\n if (IS_WEAK && proto.clear) delete proto.clear;\n }\n\n setToStringTag(C, NAME);\n\n O[NAME] = C;\n $export($export.G + $export.W + $export.F * (C != Base), O);\n\n if (!IS_WEAK) common.setStrong(C, NAME, IS_MAP);\n\n return C;\n};\n\n},{\"./_an-instance\":65,\"./_export\":92,\"./_fails\":94,\"./_for-of\":98,\"./_global\":99,\"./_inherit-if-required\":104,\"./_is-object\":110,\"./_iter-detect\":115,\"./_meta\":124,\"./_redefine\":150,\"./_redefine-all\":149,\"./_set-to-string-tag\":157}],82:[function(require,module,exports){\nvar core = module.exports = { version: '2.5.1' };\nif (typeof __e == 'number') __e = core; // eslint-disable-line no-undef\n\n},{}],83:[function(require,module,exports){\n'use strict';\nvar $defineProperty = require('./_object-dp');\nvar createDesc = require('./_property-desc');\n\nmodule.exports = function (object, index, value) {\n if (index in object) $defineProperty.f(object, index, createDesc(0, value));\n else object[index] = value;\n};\n\n},{\"./_object-dp\":130,\"./_property-desc\":148}],84:[function(require,module,exports){\n// optional / simple context binding\nvar aFunction = require('./_a-function');\nmodule.exports = function (fn, that, length) {\n aFunction(fn);\n if (that === undefined) return fn;\n switch (length) {\n case 1: return function (a) {\n return fn.call(that, a);\n };\n case 2: return function (a, b) {\n return fn.call(that, a, b);\n };\n case 3: return function (a, b, c) {\n return fn.call(that, a, b, c);\n };\n }\n return function (/* ...args */) {\n return fn.apply(that, arguments);\n };\n};\n\n},{\"./_a-function\":62}],85:[function(require,module,exports){\n'use strict';\n// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()\nvar fails = require('./_fails');\nvar getTime = Date.prototype.getTime;\nvar $toISOString = Date.prototype.toISOString;\n\nvar lz = function (num) {\n return num > 9 ? num : '0' + num;\n};\n\n// PhantomJS / old WebKit has a broken implementations\nmodule.exports = (fails(function () {\n return $toISOString.call(new Date(-5e13 - 1)) != '0385-07-25T07:06:39.999Z';\n}) || !fails(function () {\n $toISOString.call(new Date(NaN));\n})) ? function toISOString() {\n if (!isFinite(getTime.call(this))) throw RangeError('Invalid time value');\n var d = this;\n var y = d.getUTCFullYear();\n var m = d.getUTCMilliseconds();\n var s = y < 0 ? '-' : y > 9999 ? '+' : '';\n return s + ('00000' + Math.abs(y)).slice(s ? -6 : -4) +\n '-' + lz(d.getUTCMonth() + 1) + '-' + lz(d.getUTCDate()) +\n 'T' + lz(d.getUTCHours()) + ':' + lz(d.getUTCMinutes()) +\n ':' + lz(d.getUTCSeconds()) + '.' + (m > 99 ? m : '0' + lz(m)) + 'Z';\n} : $toISOString;\n\n},{\"./_fails\":94}],86:[function(require,module,exports){\n'use strict';\nvar anObject = require('./_an-object');\nvar toPrimitive = require('./_to-primitive');\nvar NUMBER = 'number';\n\nmodule.exports = function (hint) {\n if (hint !== 'string' && hint !== NUMBER && hint !== 'default') throw TypeError('Incorrect hint');\n return toPrimitive(anObject(this), hint != NUMBER);\n};\n\n},{\"./_an-object\":66,\"./_to-primitive\":176}],87:[function(require,module,exports){\n// 7.2.1 RequireObjectCoercible(argument)\nmodule.exports = function (it) {\n if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n return it;\n};\n\n},{}],88:[function(require,module,exports){\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !require('./_fails')(function () {\n return Object.defineProperty({}, 'a', { get: function () { return 7; } }).a != 7;\n});\n\n},{\"./_fails\":94}],89:[function(require,module,exports){\nvar isObject = require('./_is-object');\nvar document = require('./_global').document;\n// typeof document.createElement is 'object' in old IE\nvar is = isObject(document) && isObject(document.createElement);\nmodule.exports = function (it) {\n return is ? document.createElement(it) : {};\n};\n\n},{\"./_global\":99,\"./_is-object\":110}],90:[function(require,module,exports){\n// IE 8- don't enum bug keys\nmodule.exports = (\n 'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'\n).split(',');\n\n},{}],91:[function(require,module,exports){\n// all enumerable object keys, includes symbols\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nmodule.exports = function (it) {\n var result = getKeys(it);\n var getSymbols = gOPS.f;\n if (getSymbols) {\n var symbols = getSymbols(it);\n var isEnum = pIE.f;\n var i = 0;\n var key;\n while (symbols.length > i) if (isEnum.call(it, key = symbols[i++])) result.push(key);\n } return result;\n};\n\n},{\"./_object-gops\":136,\"./_object-keys\":139,\"./_object-pie\":140}],92:[function(require,module,exports){\nvar global = require('./_global');\nvar core = require('./_core');\nvar hide = require('./_hide');\nvar redefine = require('./_redefine');\nvar ctx = require('./_ctx');\nvar PROTOTYPE = 'prototype';\n\nvar $export = function (type, name, source) {\n var IS_FORCED = type & $export.F;\n var IS_GLOBAL = type & $export.G;\n var IS_STATIC = type & $export.S;\n var IS_PROTO = type & $export.P;\n var IS_BIND = type & $export.B;\n var target = IS_GLOBAL ? global : IS_STATIC ? global[name] || (global[name] = {}) : (global[name] || {})[PROTOTYPE];\n var exports = IS_GLOBAL ? core : core[name] || (core[name] = {});\n var expProto = exports[PROTOTYPE] || (exports[PROTOTYPE] = {});\n var key, own, out, exp;\n if (IS_GLOBAL) source = name;\n for (key in source) {\n // contains in native\n own = !IS_FORCED && target && target[key] !== undefined;\n // export native or passed\n out = (own ? target : source)[key];\n // bind timers to global for call from export context\n exp = IS_BIND && own ? ctx(out, global) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;\n // extend global\n if (target) redefine(target, key, out, type & $export.U);\n // export\n if (exports[key] != out) hide(exports, key, exp);\n if (IS_PROTO && expProto[key] != out) expProto[key] = out;\n }\n};\nglobal.core = core;\n// type bitmap\n$export.F = 1; // forced\n$export.G = 2; // global\n$export.S = 4; // static\n$export.P = 8; // proto\n$export.B = 16; // bind\n$export.W = 32; // wrap\n$export.U = 64; // safe\n$export.R = 128; // real proto method for `library`\nmodule.exports = $export;\n\n},{\"./_core\":82,\"./_ctx\":84,\"./_global\":99,\"./_hide\":101,\"./_redefine\":150}],93:[function(require,module,exports){\nvar MATCH = require('./_wks')('match');\nmodule.exports = function (KEY) {\n var re = /./;\n try {\n '/./'[KEY](re);\n } catch (e) {\n try {\n re[MATCH] = false;\n return !'/./'[KEY](re);\n } catch (f) { /* empty */ }\n } return true;\n};\n\n},{\"./_wks\":184}],94:[function(require,module,exports){\nmodule.exports = function (exec) {\n try {\n return !!exec();\n } catch (e) {\n return true;\n }\n};\n\n},{}],95:[function(require,module,exports){\n'use strict';\nvar hide = require('./_hide');\nvar redefine = require('./_redefine');\nvar fails = require('./_fails');\nvar defined = require('./_defined');\nvar wks = require('./_wks');\n\nmodule.exports = function (KEY, length, exec) {\n var SYMBOL = wks(KEY);\n var fns = exec(defined, SYMBOL, ''[KEY]);\n var strfn = fns[0];\n var rxfn = fns[1];\n if (fails(function () {\n var O = {};\n O[SYMBOL] = function () { return 7; };\n return ''[KEY](O) != 7;\n })) {\n redefine(String.prototype, KEY, strfn);\n hide(RegExp.prototype, SYMBOL, length == 2\n // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue)\n // 21.2.5.11 RegExp.prototype[@@split](string, limit)\n ? function (string, arg) { return rxfn.call(string, this, arg); }\n // 21.2.5.6 RegExp.prototype[@@match](string)\n // 21.2.5.9 RegExp.prototype[@@search](string)\n : function (string) { return rxfn.call(string, this); }\n );\n }\n};\n\n},{\"./_defined\":87,\"./_fails\":94,\"./_hide\":101,\"./_redefine\":150,\"./_wks\":184}],96:[function(require,module,exports){\n'use strict';\n// 21.2.5.3 get RegExp.prototype.flags\nvar anObject = require('./_an-object');\nmodule.exports = function () {\n var that = anObject(this);\n var result = '';\n if (that.global) result += 'g';\n if (that.ignoreCase) result += 'i';\n if (that.multiline) result += 'm';\n if (that.unicode) result += 'u';\n if (that.sticky) result += 'y';\n return result;\n};\n\n},{\"./_an-object\":66}],97:[function(require,module,exports){\n'use strict';\n// https://tc39.github.io/proposal-flatMap/#sec-FlattenIntoArray\nvar isArray = require('./_is-array');\nvar isObject = require('./_is-object');\nvar toLength = require('./_to-length');\nvar ctx = require('./_ctx');\nvar IS_CONCAT_SPREADABLE = require('./_wks')('isConcatSpreadable');\n\nfunction flattenIntoArray(target, original, source, sourceLen, start, depth, mapper, thisArg) {\n var targetIndex = start;\n var sourceIndex = 0;\n var mapFn = mapper ? ctx(mapper, thisArg, 3) : false;\n var element, spreadable;\n\n while (sourceIndex < sourceLen) {\n if (sourceIndex in source) {\n element = mapFn ? mapFn(source[sourceIndex], sourceIndex, original) : source[sourceIndex];\n\n spreadable = false;\n if (isObject(element)) {\n spreadable = element[IS_CONCAT_SPREADABLE];\n spreadable = spreadable !== undefined ? !!spreadable : isArray(element);\n }\n\n if (spreadable && depth > 0) {\n targetIndex = flattenIntoArray(target, original, element, toLength(element.length), targetIndex, depth - 1) - 1;\n } else {\n if (targetIndex >= 0x1fffffffffffff) throw TypeError();\n target[targetIndex] = element;\n }\n\n targetIndex++;\n }\n sourceIndex++;\n }\n return targetIndex;\n}\n\nmodule.exports = flattenIntoArray;\n\n},{\"./_ctx\":84,\"./_is-array\":108,\"./_is-object\":110,\"./_to-length\":174,\"./_wks\":184}],98:[function(require,module,exports){\nvar ctx = require('./_ctx');\nvar call = require('./_iter-call');\nvar isArrayIter = require('./_is-array-iter');\nvar anObject = require('./_an-object');\nvar toLength = require('./_to-length');\nvar getIterFn = require('./core.get-iterator-method');\nvar BREAK = {};\nvar RETURN = {};\nvar exports = module.exports = function (iterable, entries, fn, that, ITERATOR) {\n var iterFn = ITERATOR ? function () { return iterable; } : getIterFn(iterable);\n var f = ctx(fn, that, entries ? 2 : 1);\n var index = 0;\n var length, step, iterator, result;\n if (typeof iterFn != 'function') throw TypeError(iterable + ' is not iterable!');\n // fast case for arrays with default iterator\n if (isArrayIter(iterFn)) for (length = toLength(iterable.length); length > index; index++) {\n result = entries ? f(anObject(step = iterable[index])[0], step[1]) : f(iterable[index]);\n if (result === BREAK || result === RETURN) return result;\n } else for (iterator = iterFn.call(iterable); !(step = iterator.next()).done;) {\n result = call(iterator, f, step.value, entries);\n if (result === BREAK || result === RETURN) return result;\n }\n};\nexports.BREAK = BREAK;\nexports.RETURN = RETURN;\n\n},{\"./_an-object\":66,\"./_ctx\":84,\"./_is-array-iter\":107,\"./_iter-call\":112,\"./_to-length\":174,\"./core.get-iterator-method\":185}],99:[function(require,module,exports){\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nvar global = module.exports = typeof window != 'undefined' && window.Math == Math\n ? window : typeof self != 'undefined' && self.Math == Math ? self\n // eslint-disable-next-line no-new-func\n : Function('return this')();\nif (typeof __g == 'number') __g = global; // eslint-disable-line no-undef\n\n},{}],100:[function(require,module,exports){\nvar hasOwnProperty = {}.hasOwnProperty;\nmodule.exports = function (it, key) {\n return hasOwnProperty.call(it, key);\n};\n\n},{}],101:[function(require,module,exports){\nvar dP = require('./_object-dp');\nvar createDesc = require('./_property-desc');\nmodule.exports = require('./_descriptors') ? function (object, key, value) {\n return dP.f(object, key, createDesc(1, value));\n} : function (object, key, value) {\n object[key] = value;\n return object;\n};\n\n},{\"./_descriptors\":88,\"./_object-dp\":130,\"./_property-desc\":148}],102:[function(require,module,exports){\nvar document = require('./_global').document;\nmodule.exports = document && document.documentElement;\n\n},{\"./_global\":99}],103:[function(require,module,exports){\nmodule.exports = !require('./_descriptors') && !require('./_fails')(function () {\n return Object.defineProperty(require('./_dom-create')('div'), 'a', { get: function () { return 7; } }).a != 7;\n});\n\n},{\"./_descriptors\":88,\"./_dom-create\":89,\"./_fails\":94}],104:[function(require,module,exports){\nvar isObject = require('./_is-object');\nvar setPrototypeOf = require('./_set-proto').set;\nmodule.exports = function (that, target, C) {\n var S = target.constructor;\n var P;\n if (S !== C && typeof S == 'function' && (P = S.prototype) !== C.prototype && isObject(P) && setPrototypeOf) {\n setPrototypeOf(that, P);\n } return that;\n};\n\n},{\"./_is-object\":110,\"./_set-proto\":155}],105:[function(require,module,exports){\n// fast apply, http://jsperf.lnkit.com/fast-apply/5\nmodule.exports = function (fn, args, that) {\n var un = that === undefined;\n switch (args.length) {\n case 0: return un ? fn()\n : fn.call(that);\n case 1: return un ? fn(args[0])\n : fn.call(that, args[0]);\n case 2: return un ? fn(args[0], args[1])\n : fn.call(that, args[0], args[1]);\n case 3: return un ? fn(args[0], args[1], args[2])\n : fn.call(that, args[0], args[1], args[2]);\n case 4: return un ? fn(args[0], args[1], args[2], args[3])\n : fn.call(that, args[0], args[1], args[2], args[3]);\n } return fn.apply(that, args);\n};\n\n},{}],106:[function(require,module,exports){\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nvar cof = require('./_cof');\n// eslint-disable-next-line no-prototype-builtins\nmodule.exports = Object('z').propertyIsEnumerable(0) ? Object : function (it) {\n return cof(it) == 'String' ? it.split('') : Object(it);\n};\n\n},{\"./_cof\":77}],107:[function(require,module,exports){\n// check on default Array iterator\nvar Iterators = require('./_iterators');\nvar ITERATOR = require('./_wks')('iterator');\nvar ArrayProto = Array.prototype;\n\nmodule.exports = function (it) {\n return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);\n};\n\n},{\"./_iterators\":117,\"./_wks\":184}],108:[function(require,module,exports){\n// 7.2.2 IsArray(argument)\nvar cof = require('./_cof');\nmodule.exports = Array.isArray || function isArray(arg) {\n return cof(arg) == 'Array';\n};\n\n},{\"./_cof\":77}],109:[function(require,module,exports){\n// 20.1.2.3 Number.isInteger(number)\nvar isObject = require('./_is-object');\nvar floor = Math.floor;\nmodule.exports = function isInteger(it) {\n return !isObject(it) && isFinite(it) && floor(it) === it;\n};\n\n},{\"./_is-object\":110}],110:[function(require,module,exports){\nmodule.exports = function (it) {\n return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n\n},{}],111:[function(require,module,exports){\n// 7.2.8 IsRegExp(argument)\nvar isObject = require('./_is-object');\nvar cof = require('./_cof');\nvar MATCH = require('./_wks')('match');\nmodule.exports = function (it) {\n var isRegExp;\n return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : cof(it) == 'RegExp');\n};\n\n},{\"./_cof\":77,\"./_is-object\":110,\"./_wks\":184}],112:[function(require,module,exports){\n// call something on iterator step with safe closing on error\nvar anObject = require('./_an-object');\nmodule.exports = function (iterator, fn, value, entries) {\n try {\n return entries ? fn(anObject(value)[0], value[1]) : fn(value);\n // 7.4.6 IteratorClose(iterator, completion)\n } catch (e) {\n var ret = iterator['return'];\n if (ret !== undefined) anObject(ret.call(iterator));\n throw e;\n }\n};\n\n},{\"./_an-object\":66}],113:[function(require,module,exports){\n'use strict';\nvar create = require('./_object-create');\nvar descriptor = require('./_property-desc');\nvar setToStringTag = require('./_set-to-string-tag');\nvar IteratorPrototype = {};\n\n// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\nrequire('./_hide')(IteratorPrototype, require('./_wks')('iterator'), function () { return this; });\n\nmodule.exports = function (Constructor, NAME, next) {\n Constructor.prototype = create(IteratorPrototype, { next: descriptor(1, next) });\n setToStringTag(Constructor, NAME + ' Iterator');\n};\n\n},{\"./_hide\":101,\"./_object-create\":129,\"./_property-desc\":148,\"./_set-to-string-tag\":157,\"./_wks\":184}],114:[function(require,module,exports){\n'use strict';\nvar LIBRARY = require('./_library');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar hide = require('./_hide');\nvar has = require('./_has');\nvar Iterators = require('./_iterators');\nvar $iterCreate = require('./_iter-create');\nvar setToStringTag = require('./_set-to-string-tag');\nvar getPrototypeOf = require('./_object-gpo');\nvar ITERATOR = require('./_wks')('iterator');\nvar BUGGY = !([].keys && 'next' in [].keys()); // Safari has buggy iterators w/o `next`\nvar FF_ITERATOR = '@@iterator';\nvar KEYS = 'keys';\nvar VALUES = 'values';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED) {\n $iterCreate(Constructor, NAME, next);\n var getMethod = function (kind) {\n if (!BUGGY && kind in proto) return proto[kind];\n switch (kind) {\n case KEYS: return function keys() { return new Constructor(this, kind); };\n case VALUES: return function values() { return new Constructor(this, kind); };\n } return function entries() { return new Constructor(this, kind); };\n };\n var TAG = NAME + ' Iterator';\n var DEF_VALUES = DEFAULT == VALUES;\n var VALUES_BUG = false;\n var proto = Base.prototype;\n var $native = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT];\n var $default = $native || getMethod(DEFAULT);\n var $entries = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined;\n var $anyNative = NAME == 'Array' ? proto.entries || $native : $native;\n var methods, key, IteratorPrototype;\n // Fix native\n if ($anyNative) {\n IteratorPrototype = getPrototypeOf($anyNative.call(new Base()));\n if (IteratorPrototype !== Object.prototype && IteratorPrototype.next) {\n // Set @@toStringTag to native iterators\n setToStringTag(IteratorPrototype, TAG, true);\n // fix for some old engines\n if (!LIBRARY && !has(IteratorPrototype, ITERATOR)) hide(IteratorPrototype, ITERATOR, returnThis);\n }\n }\n // fix Array#{values, @@iterator}.name in V8 / FF\n if (DEF_VALUES && $native && $native.name !== VALUES) {\n VALUES_BUG = true;\n $default = function values() { return $native.call(this); };\n }\n // Define iterator\n if ((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])) {\n hide(proto, ITERATOR, $default);\n }\n // Plug for library\n Iterators[NAME] = $default;\n Iterators[TAG] = returnThis;\n if (DEFAULT) {\n methods = {\n values: DEF_VALUES ? $default : getMethod(VALUES),\n keys: IS_SET ? $default : getMethod(KEYS),\n entries: $entries\n };\n if (FORCED) for (key in methods) {\n if (!(key in proto)) redefine(proto, key, methods[key]);\n } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);\n }\n return methods;\n};\n\n},{\"./_export\":92,\"./_has\":100,\"./_hide\":101,\"./_iter-create\":113,\"./_iterators\":117,\"./_library\":118,\"./_object-gpo\":137,\"./_redefine\":150,\"./_set-to-string-tag\":157,\"./_wks\":184}],115:[function(require,module,exports){\nvar ITERATOR = require('./_wks')('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n var riter = [7][ITERATOR]();\n riter['return'] = function () { SAFE_CLOSING = true; };\n // eslint-disable-next-line no-throw-literal\n Array.from(riter, function () { throw 2; });\n} catch (e) { /* empty */ }\n\nmodule.exports = function (exec, skipClosing) {\n if (!skipClosing && !SAFE_CLOSING) return false;\n var safe = false;\n try {\n var arr = [7];\n var iter = arr[ITERATOR]();\n iter.next = function () { return { done: safe = true }; };\n arr[ITERATOR] = function () { return iter; };\n exec(arr);\n } catch (e) { /* empty */ }\n return safe;\n};\n\n},{\"./_wks\":184}],116:[function(require,module,exports){\nmodule.exports = function (done, value) {\n return { value: value, done: !!done };\n};\n\n},{}],117:[function(require,module,exports){\nmodule.exports = {};\n\n},{}],118:[function(require,module,exports){\nmodule.exports = false;\n\n},{}],119:[function(require,module,exports){\n// 20.2.2.14 Math.expm1(x)\nvar $expm1 = Math.expm1;\nmodule.exports = (!$expm1\n // Old FF bug\n || $expm1(10) > 22025.465794806719 || $expm1(10) < 22025.4657948067165168\n // Tor Browser bug\n || $expm1(-2e-17) != -2e-17\n) ? function expm1(x) {\n return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : Math.exp(x) - 1;\n} : $expm1;\n\n},{}],120:[function(require,module,exports){\n// 20.2.2.16 Math.fround(x)\nvar sign = require('./_math-sign');\nvar pow = Math.pow;\nvar EPSILON = pow(2, -52);\nvar EPSILON32 = pow(2, -23);\nvar MAX32 = pow(2, 127) * (2 - EPSILON32);\nvar MIN32 = pow(2, -126);\n\nvar roundTiesToEven = function (n) {\n return n + 1 / EPSILON - 1 / EPSILON;\n};\n\nmodule.exports = Math.fround || function fround(x) {\n var $abs = Math.abs(x);\n var $sign = sign(x);\n var a, result;\n if ($abs < MIN32) return $sign * roundTiesToEven($abs / MIN32 / EPSILON32) * MIN32 * EPSILON32;\n a = (1 + EPSILON32 / EPSILON) * $abs;\n result = a - (a - $abs);\n // eslint-disable-next-line no-self-compare\n if (result > MAX32 || result != result) return $sign * Infinity;\n return $sign * result;\n};\n\n},{\"./_math-sign\":123}],121:[function(require,module,exports){\n// 20.2.2.20 Math.log1p(x)\nmodule.exports = Math.log1p || function log1p(x) {\n return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : Math.log(1 + x);\n};\n\n},{}],122:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nmodule.exports = Math.scale || function scale(x, inLow, inHigh, outLow, outHigh) {\n if (\n arguments.length === 0\n // eslint-disable-next-line no-self-compare\n || x != x\n // eslint-disable-next-line no-self-compare\n || inLow != inLow\n // eslint-disable-next-line no-self-compare\n || inHigh != inHigh\n // eslint-disable-next-line no-self-compare\n || outLow != outLow\n // eslint-disable-next-line no-self-compare\n || outHigh != outHigh\n ) return NaN;\n if (x === Infinity || x === -Infinity) return x;\n return (x - inLow) * (outHigh - outLow) / (inHigh - inLow) + outLow;\n};\n\n},{}],123:[function(require,module,exports){\n// 20.2.2.28 Math.sign(x)\nmodule.exports = Math.sign || function sign(x) {\n // eslint-disable-next-line no-self-compare\n return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1;\n};\n\n},{}],124:[function(require,module,exports){\nvar META = require('./_uid')('meta');\nvar isObject = require('./_is-object');\nvar has = require('./_has');\nvar setDesc = require('./_object-dp').f;\nvar id = 0;\nvar isExtensible = Object.isExtensible || function () {\n return true;\n};\nvar FREEZE = !require('./_fails')(function () {\n return isExtensible(Object.preventExtensions({}));\n});\nvar setMeta = function (it) {\n setDesc(it, META, { value: {\n i: 'O' + ++id, // object ID\n w: {} // weak collections IDs\n } });\n};\nvar fastKey = function (it, create) {\n // return primitive with prefix\n if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n if (!has(it, META)) {\n // can't set metadata to uncaught frozen object\n if (!isExtensible(it)) return 'F';\n // not necessary to add metadata\n if (!create) return 'E';\n // add missing metadata\n setMeta(it);\n // return object ID\n } return it[META].i;\n};\nvar getWeak = function (it, create) {\n if (!has(it, META)) {\n // can't set metadata to uncaught frozen object\n if (!isExtensible(it)) return true;\n // not necessary to add metadata\n if (!create) return false;\n // add missing metadata\n setMeta(it);\n // return hash weak collections IDs\n } return it[META].w;\n};\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n if (FREEZE && meta.NEED && isExtensible(it) && !has(it, META)) setMeta(it);\n return it;\n};\nvar meta = module.exports = {\n KEY: META,\n NEED: false,\n fastKey: fastKey,\n getWeak: getWeak,\n onFreeze: onFreeze\n};\n\n},{\"./_fails\":94,\"./_has\":100,\"./_is-object\":110,\"./_object-dp\":130,\"./_uid\":180}],125:[function(require,module,exports){\nvar Map = require('./es6.map');\nvar $export = require('./_export');\nvar shared = require('./_shared')('metadata');\nvar store = shared.store || (shared.store = new (require('./es6.weak-map'))());\n\nvar getOrCreateMetadataMap = function (target, targetKey, create) {\n var targetMetadata = store.get(target);\n if (!targetMetadata) {\n if (!create) return undefined;\n store.set(target, targetMetadata = new Map());\n }\n var keyMetadata = targetMetadata.get(targetKey);\n if (!keyMetadata) {\n if (!create) return undefined;\n targetMetadata.set(targetKey, keyMetadata = new Map());\n } return keyMetadata;\n};\nvar ordinaryHasOwnMetadata = function (MetadataKey, O, P) {\n var metadataMap = getOrCreateMetadataMap(O, P, false);\n return metadataMap === undefined ? false : metadataMap.has(MetadataKey);\n};\nvar ordinaryGetOwnMetadata = function (MetadataKey, O, P) {\n var metadataMap = getOrCreateMetadataMap(O, P, false);\n return metadataMap === undefined ? undefined : metadataMap.get(MetadataKey);\n};\nvar ordinaryDefineOwnMetadata = function (MetadataKey, MetadataValue, O, P) {\n getOrCreateMetadataMap(O, P, true).set(MetadataKey, MetadataValue);\n};\nvar ordinaryOwnMetadataKeys = function (target, targetKey) {\n var metadataMap = getOrCreateMetadataMap(target, targetKey, false);\n var keys = [];\n if (metadataMap) metadataMap.forEach(function (_, key) { keys.push(key); });\n return keys;\n};\nvar toMetaKey = function (it) {\n return it === undefined || typeof it == 'symbol' ? it : String(it);\n};\nvar exp = function (O) {\n $export($export.S, 'Reflect', O);\n};\n\nmodule.exports = {\n store: store,\n map: getOrCreateMetadataMap,\n has: ordinaryHasOwnMetadata,\n get: ordinaryGetOwnMetadata,\n set: ordinaryDefineOwnMetadata,\n keys: ordinaryOwnMetadataKeys,\n key: toMetaKey,\n exp: exp\n};\n\n},{\"./_export\":92,\"./_shared\":159,\"./es6.map\":216,\"./es6.weak-map\":322}],126:[function(require,module,exports){\nvar global = require('./_global');\nvar macrotask = require('./_task').set;\nvar Observer = global.MutationObserver || global.WebKitMutationObserver;\nvar process = global.process;\nvar Promise = global.Promise;\nvar isNode = require('./_cof')(process) == 'process';\n\nmodule.exports = function () {\n var head, last, notify;\n\n var flush = function () {\n var parent, fn;\n if (isNode && (parent = process.domain)) parent.exit();\n while (head) {\n fn = head.fn;\n head = head.next;\n try {\n fn();\n } catch (e) {\n if (head) notify();\n else last = undefined;\n throw e;\n }\n } last = undefined;\n if (parent) parent.enter();\n };\n\n // Node.js\n if (isNode) {\n notify = function () {\n process.nextTick(flush);\n };\n // browsers with MutationObserver\n } else if (Observer) {\n var toggle = true;\n var node = document.createTextNode('');\n new Observer(flush).observe(node, { characterData: true }); // eslint-disable-line no-new\n notify = function () {\n node.data = toggle = !toggle;\n };\n // environments with maybe non-completely correct, but existent Promise\n } else if (Promise && Promise.resolve) {\n var promise = Promise.resolve();\n notify = function () {\n promise.then(flush);\n };\n // for other environments - macrotask based on:\n // - setImmediate\n // - MessageChannel\n // - window.postMessag\n // - onreadystatechange\n // - setTimeout\n } else {\n notify = function () {\n // strange IE + webpack dev server bug - use .call(global)\n macrotask.call(global, flush);\n };\n }\n\n return function (fn) {\n var task = { fn: fn, next: undefined };\n if (last) last.next = task;\n if (!head) {\n head = task;\n notify();\n } last = task;\n };\n};\n\n},{\"./_cof\":77,\"./_global\":99,\"./_task\":169}],127:[function(require,module,exports){\n'use strict';\n// 25.4.1.5 NewPromiseCapability(C)\nvar aFunction = require('./_a-function');\n\nfunction PromiseCapability(C) {\n var resolve, reject;\n this.promise = new C(function ($$resolve, $$reject) {\n if (resolve !== undefined || reject !== undefined) throw TypeError('Bad Promise constructor');\n resolve = $$resolve;\n reject = $$reject;\n });\n this.resolve = aFunction(resolve);\n this.reject = aFunction(reject);\n}\n\nmodule.exports.f = function (C) {\n return new PromiseCapability(C);\n};\n\n},{\"./_a-function\":62}],128:[function(require,module,exports){\n'use strict';\n// 19.1.2.1 Object.assign(target, source, ...)\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nvar toObject = require('./_to-object');\nvar IObject = require('./_iobject');\nvar $assign = Object.assign;\n\n// should work with symbols and should have deterministic property order (V8 bug)\nmodule.exports = !$assign || require('./_fails')(function () {\n var A = {};\n var B = {};\n // eslint-disable-next-line no-undef\n var S = Symbol();\n var K = 'abcdefghijklmnopqrst';\n A[S] = 7;\n K.split('').forEach(function (k) { B[k] = k; });\n return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars\n var T = toObject(target);\n var aLen = arguments.length;\n var index = 1;\n var getSymbols = gOPS.f;\n var isEnum = pIE.f;\n while (aLen > index) {\n var S = IObject(arguments[index++]);\n var keys = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S);\n var length = keys.length;\n var j = 0;\n var key;\n while (length > j) if (isEnum.call(S, key = keys[j++])) T[key] = S[key];\n } return T;\n} : $assign;\n\n},{\"./_fails\":94,\"./_iobject\":106,\"./_object-gops\":136,\"./_object-keys\":139,\"./_object-pie\":140,\"./_to-object\":175}],129:[function(require,module,exports){\n// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\nvar anObject = require('./_an-object');\nvar dPs = require('./_object-dps');\nvar enumBugKeys = require('./_enum-bug-keys');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar Empty = function () { /* empty */ };\nvar PROTOTYPE = 'prototype';\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar createDict = function () {\n // Thrash, waste and sodomy: IE GC bug\n var iframe = require('./_dom-create')('iframe');\n var i = enumBugKeys.length;\n var lt = '<';\n var gt = '>';\n var iframeDocument;\n iframe.style.display = 'none';\n require('./_html').appendChild(iframe);\n iframe.src = 'javascript:'; // eslint-disable-line no-script-url\n // createDict = iframe.contentWindow.Object;\n // html.removeChild(iframe);\n iframeDocument = iframe.contentWindow.document;\n iframeDocument.open();\n iframeDocument.write(lt + 'script' + gt + 'document.F=Object' + lt + '/script' + gt);\n iframeDocument.close();\n createDict = iframeDocument.F;\n while (i--) delete createDict[PROTOTYPE][enumBugKeys[i]];\n return createDict();\n};\n\nmodule.exports = Object.create || function create(O, Properties) {\n var result;\n if (O !== null) {\n Empty[PROTOTYPE] = anObject(O);\n result = new Empty();\n Empty[PROTOTYPE] = null;\n // add \"__proto__\" for Object.getPrototypeOf polyfill\n result[IE_PROTO] = O;\n } else result = createDict();\n return Properties === undefined ? result : dPs(result, Properties);\n};\n\n},{\"./_an-object\":66,\"./_dom-create\":89,\"./_enum-bug-keys\":90,\"./_html\":102,\"./_object-dps\":131,\"./_shared-key\":158}],130:[function(require,module,exports){\nvar anObject = require('./_an-object');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar toPrimitive = require('./_to-primitive');\nvar dP = Object.defineProperty;\n\nexports.f = require('./_descriptors') ? Object.defineProperty : function defineProperty(O, P, Attributes) {\n anObject(O);\n P = toPrimitive(P, true);\n anObject(Attributes);\n if (IE8_DOM_DEFINE) try {\n return dP(O, P, Attributes);\n } catch (e) { /* empty */ }\n if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported!');\n if ('value' in Attributes) O[P] = Attributes.value;\n return O;\n};\n\n},{\"./_an-object\":66,\"./_descriptors\":88,\"./_ie8-dom-define\":103,\"./_to-primitive\":176}],131:[function(require,module,exports){\nvar dP = require('./_object-dp');\nvar anObject = require('./_an-object');\nvar getKeys = require('./_object-keys');\n\nmodule.exports = require('./_descriptors') ? Object.defineProperties : function defineProperties(O, Properties) {\n anObject(O);\n var keys = getKeys(Properties);\n var length = keys.length;\n var i = 0;\n var P;\n while (length > i) dP.f(O, P = keys[i++], Properties[P]);\n return O;\n};\n\n},{\"./_an-object\":66,\"./_descriptors\":88,\"./_object-dp\":130,\"./_object-keys\":139}],132:[function(require,module,exports){\n'use strict';\n// Forced replacement prototype accessors methods\nmodule.exports = require('./_library') || !require('./_fails')(function () {\n var K = Math.random();\n // In FF throws only define methods\n // eslint-disable-next-line no-undef, no-useless-call\n __defineSetter__.call(null, K, function () { /* empty */ });\n delete require('./_global')[K];\n});\n\n},{\"./_fails\":94,\"./_global\":99,\"./_library\":118}],133:[function(require,module,exports){\nvar pIE = require('./_object-pie');\nvar createDesc = require('./_property-desc');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar has = require('./_has');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar gOPD = Object.getOwnPropertyDescriptor;\n\nexports.f = require('./_descriptors') ? gOPD : function getOwnPropertyDescriptor(O, P) {\n O = toIObject(O);\n P = toPrimitive(P, true);\n if (IE8_DOM_DEFINE) try {\n return gOPD(O, P);\n } catch (e) { /* empty */ }\n if (has(O, P)) return createDesc(!pIE.f.call(O, P), O[P]);\n};\n\n},{\"./_descriptors\":88,\"./_has\":100,\"./_ie8-dom-define\":103,\"./_object-pie\":140,\"./_property-desc\":148,\"./_to-iobject\":173,\"./_to-primitive\":176}],134:[function(require,module,exports){\n// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\nvar toIObject = require('./_to-iobject');\nvar gOPN = require('./_object-gopn').f;\nvar toString = {}.toString;\n\nvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\n ? Object.getOwnPropertyNames(window) : [];\n\nvar getWindowNames = function (it) {\n try {\n return gOPN(it);\n } catch (e) {\n return windowNames.slice();\n }\n};\n\nmodule.exports.f = function getOwnPropertyNames(it) {\n return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it));\n};\n\n},{\"./_object-gopn\":135,\"./_to-iobject\":173}],135:[function(require,module,exports){\n// 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)\nvar $keys = require('./_object-keys-internal');\nvar hiddenKeys = require('./_enum-bug-keys').concat('length', 'prototype');\n\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n return $keys(O, hiddenKeys);\n};\n\n},{\"./_enum-bug-keys\":90,\"./_object-keys-internal\":138}],136:[function(require,module,exports){\nexports.f = Object.getOwnPropertySymbols;\n\n},{}],137:[function(require,module,exports){\n// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\nvar has = require('./_has');\nvar toObject = require('./_to-object');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar ObjectProto = Object.prototype;\n\nmodule.exports = Object.getPrototypeOf || function (O) {\n O = toObject(O);\n if (has(O, IE_PROTO)) return O[IE_PROTO];\n if (typeof O.constructor == 'function' && O instanceof O.constructor) {\n return O.constructor.prototype;\n } return O instanceof Object ? ObjectProto : null;\n};\n\n},{\"./_has\":100,\"./_shared-key\":158,\"./_to-object\":175}],138:[function(require,module,exports){\nvar has = require('./_has');\nvar toIObject = require('./_to-iobject');\nvar arrayIndexOf = require('./_array-includes')(false);\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\n\nmodule.exports = function (object, names) {\n var O = toIObject(object);\n var i = 0;\n var result = [];\n var key;\n for (key in O) if (key != IE_PROTO) has(O, key) && result.push(key);\n // Don't enum bug & hidden keys\n while (names.length > i) if (has(O, key = names[i++])) {\n ~arrayIndexOf(result, key) || result.push(key);\n }\n return result;\n};\n\n},{\"./_array-includes\":70,\"./_has\":100,\"./_shared-key\":158,\"./_to-iobject\":173}],139:[function(require,module,exports){\n// 19.1.2.14 / 15.2.3.14 Object.keys(O)\nvar $keys = require('./_object-keys-internal');\nvar enumBugKeys = require('./_enum-bug-keys');\n\nmodule.exports = Object.keys || function keys(O) {\n return $keys(O, enumBugKeys);\n};\n\n},{\"./_enum-bug-keys\":90,\"./_object-keys-internal\":138}],140:[function(require,module,exports){\nexports.f = {}.propertyIsEnumerable;\n\n},{}],141:[function(require,module,exports){\n// most Object methods by ES6 should accept primitives\nvar $export = require('./_export');\nvar core = require('./_core');\nvar fails = require('./_fails');\nmodule.exports = function (KEY, exec) {\n var fn = (core.Object || {})[KEY] || Object[KEY];\n var exp = {};\n exp[KEY] = exec(fn);\n $export($export.S + $export.F * fails(function () { fn(1); }), 'Object', exp);\n};\n\n},{\"./_core\":82,\"./_export\":92,\"./_fails\":94}],142:[function(require,module,exports){\nvar getKeys = require('./_object-keys');\nvar toIObject = require('./_to-iobject');\nvar isEnum = require('./_object-pie').f;\nmodule.exports = function (isEntries) {\n return function (it) {\n var O = toIObject(it);\n var keys = getKeys(O);\n var length = keys.length;\n var i = 0;\n var result = [];\n var key;\n while (length > i) if (isEnum.call(O, key = keys[i++])) {\n result.push(isEntries ? [key, O[key]] : O[key]);\n } return result;\n };\n};\n\n},{\"./_object-keys\":139,\"./_object-pie\":140,\"./_to-iobject\":173}],143:[function(require,module,exports){\n// all object keys, includes non-enumerable and symbols\nvar gOPN = require('./_object-gopn');\nvar gOPS = require('./_object-gops');\nvar anObject = require('./_an-object');\nvar Reflect = require('./_global').Reflect;\nmodule.exports = Reflect && Reflect.ownKeys || function ownKeys(it) {\n var keys = gOPN.f(anObject(it));\n var getSymbols = gOPS.f;\n return getSymbols ? keys.concat(getSymbols(it)) : keys;\n};\n\n},{\"./_an-object\":66,\"./_global\":99,\"./_object-gopn\":135,\"./_object-gops\":136}],144:[function(require,module,exports){\nvar $parseFloat = require('./_global').parseFloat;\nvar $trim = require('./_string-trim').trim;\n\nmodule.exports = 1 / $parseFloat(require('./_string-ws') + '-0') !== -Infinity ? function parseFloat(str) {\n var string = $trim(String(str), 3);\n var result = $parseFloat(string);\n return result === 0 && string.charAt(0) == '-' ? -0 : result;\n} : $parseFloat;\n\n},{\"./_global\":99,\"./_string-trim\":167,\"./_string-ws\":168}],145:[function(require,module,exports){\nvar $parseInt = require('./_global').parseInt;\nvar $trim = require('./_string-trim').trim;\nvar ws = require('./_string-ws');\nvar hex = /^[-+]?0[xX]/;\n\nmodule.exports = $parseInt(ws + '08') !== 8 || $parseInt(ws + '0x16') !== 22 ? function parseInt(str, radix) {\n var string = $trim(String(str), 3);\n return $parseInt(string, (radix >>> 0) || (hex.test(string) ? 16 : 10));\n} : $parseInt;\n\n},{\"./_global\":99,\"./_string-trim\":167,\"./_string-ws\":168}],146:[function(require,module,exports){\nmodule.exports = function (exec) {\n try {\n return { e: false, v: exec() };\n } catch (e) {\n return { e: true, v: e };\n }\n};\n\n},{}],147:[function(require,module,exports){\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar newPromiseCapability = require('./_new-promise-capability');\n\nmodule.exports = function (C, x) {\n anObject(C);\n if (isObject(x) && x.constructor === C) return x;\n var promiseCapability = newPromiseCapability.f(C);\n var resolve = promiseCapability.resolve;\n resolve(x);\n return promiseCapability.promise;\n};\n\n},{\"./_an-object\":66,\"./_is-object\":110,\"./_new-promise-capability\":127}],148:[function(require,module,exports){\nmodule.exports = function (bitmap, value) {\n return {\n enumerable: !(bitmap & 1),\n configurable: !(bitmap & 2),\n writable: !(bitmap & 4),\n value: value\n };\n};\n\n},{}],149:[function(require,module,exports){\nvar redefine = require('./_redefine');\nmodule.exports = function (target, src, safe) {\n for (var key in src) redefine(target, key, src[key], safe);\n return target;\n};\n\n},{\"./_redefine\":150}],150:[function(require,module,exports){\nvar global = require('./_global');\nvar hide = require('./_hide');\nvar has = require('./_has');\nvar SRC = require('./_uid')('src');\nvar TO_STRING = 'toString';\nvar $toString = Function[TO_STRING];\nvar TPL = ('' + $toString).split(TO_STRING);\n\nrequire('./_core').inspectSource = function (it) {\n return $toString.call(it);\n};\n\n(module.exports = function (O, key, val, safe) {\n var isFunction = typeof val == 'function';\n if (isFunction) has(val, 'name') || hide(val, 'name', key);\n if (O[key] === val) return;\n if (isFunction) has(val, SRC) || hide(val, SRC, O[key] ? '' + O[key] : TPL.join(String(key)));\n if (O === global) {\n O[key] = val;\n } else if (!safe) {\n delete O[key];\n hide(O, key, val);\n } else if (O[key]) {\n O[key] = val;\n } else {\n hide(O, key, val);\n }\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, TO_STRING, function toString() {\n return typeof this == 'function' && this[SRC] || $toString.call(this);\n});\n\n},{\"./_core\":82,\"./_global\":99,\"./_has\":100,\"./_hide\":101,\"./_uid\":180}],151:[function(require,module,exports){\nmodule.exports = function (regExp, replace) {\n var replacer = replace === Object(replace) ? function (part) {\n return replace[part];\n } : replace;\n return function (it) {\n return String(it).replace(regExp, replacer);\n };\n};\n\n},{}],152:[function(require,module,exports){\n// 7.2.9 SameValue(x, y)\nmodule.exports = Object.is || function is(x, y) {\n // eslint-disable-next-line no-self-compare\n return x === y ? x !== 0 || 1 / x === 1 / y : x != x && y != y;\n};\n\n},{}],153:[function(require,module,exports){\n'use strict';\n// https://tc39.github.io/proposal-setmap-offrom/\nvar $export = require('./_export');\nvar aFunction = require('./_a-function');\nvar ctx = require('./_ctx');\nvar forOf = require('./_for-of');\n\nmodule.exports = function (COLLECTION) {\n $export($export.S, COLLECTION, { from: function from(source /* , mapFn, thisArg */) {\n var mapFn = arguments[1];\n var mapping, A, n, cb;\n aFunction(this);\n mapping = mapFn !== undefined;\n if (mapping) aFunction(mapFn);\n if (source == undefined) return new this();\n A = [];\n if (mapping) {\n n = 0;\n cb = ctx(mapFn, arguments[2], 2);\n forOf(source, false, function (nextItem) {\n A.push(cb(nextItem, n++));\n });\n } else {\n forOf(source, false, A.push, A);\n }\n return new this(A);\n } });\n};\n\n},{\"./_a-function\":62,\"./_ctx\":84,\"./_export\":92,\"./_for-of\":98}],154:[function(require,module,exports){\n'use strict';\n// https://tc39.github.io/proposal-setmap-offrom/\nvar $export = require('./_export');\n\nmodule.exports = function (COLLECTION) {\n $export($export.S, COLLECTION, { of: function of() {\n var length = arguments.length;\n var A = Array(length);\n while (length--) A[length] = arguments[length];\n return new this(A);\n } });\n};\n\n},{\"./_export\":92}],155:[function(require,module,exports){\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n/* eslint-disable no-proto */\nvar isObject = require('./_is-object');\nvar anObject = require('./_an-object');\nvar check = function (O, proto) {\n anObject(O);\n if (!isObject(proto) && proto !== null) throw TypeError(proto + \": can't set as prototype!\");\n};\nmodule.exports = {\n set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line\n function (test, buggy, set) {\n try {\n set = require('./_ctx')(Function.call, require('./_object-gopd').f(Object.prototype, '__proto__').set, 2);\n set(test, []);\n buggy = !(test instanceof Array);\n } catch (e) { buggy = true; }\n return function setPrototypeOf(O, proto) {\n check(O, proto);\n if (buggy) O.__proto__ = proto;\n else set(O, proto);\n return O;\n };\n }({}, false) : undefined),\n check: check\n};\n\n},{\"./_an-object\":66,\"./_ctx\":84,\"./_is-object\":110,\"./_object-gopd\":133}],156:[function(require,module,exports){\n'use strict';\nvar global = require('./_global');\nvar dP = require('./_object-dp');\nvar DESCRIPTORS = require('./_descriptors');\nvar SPECIES = require('./_wks')('species');\n\nmodule.exports = function (KEY) {\n var C = global[KEY];\n if (DESCRIPTORS && C && !C[SPECIES]) dP.f(C, SPECIES, {\n configurable: true,\n get: function () { return this; }\n });\n};\n\n},{\"./_descriptors\":88,\"./_global\":99,\"./_object-dp\":130,\"./_wks\":184}],157:[function(require,module,exports){\nvar def = require('./_object-dp').f;\nvar has = require('./_has');\nvar TAG = require('./_wks')('toStringTag');\n\nmodule.exports = function (it, tag, stat) {\n if (it && !has(it = stat ? it : it.prototype, TAG)) def(it, TAG, { configurable: true, value: tag });\n};\n\n},{\"./_has\":100,\"./_object-dp\":130,\"./_wks\":184}],158:[function(require,module,exports){\nvar shared = require('./_shared')('keys');\nvar uid = require('./_uid');\nmodule.exports = function (key) {\n return shared[key] || (shared[key] = uid(key));\n};\n\n},{\"./_shared\":159,\"./_uid\":180}],159:[function(require,module,exports){\nvar global = require('./_global');\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || (global[SHARED] = {});\nmodule.exports = function (key) {\n return store[key] || (store[key] = {});\n};\n\n},{\"./_global\":99}],160:[function(require,module,exports){\n// 7.3.20 SpeciesConstructor(O, defaultConstructor)\nvar anObject = require('./_an-object');\nvar aFunction = require('./_a-function');\nvar SPECIES = require('./_wks')('species');\nmodule.exports = function (O, D) {\n var C = anObject(O).constructor;\n var S;\n return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? D : aFunction(S);\n};\n\n},{\"./_a-function\":62,\"./_an-object\":66,\"./_wks\":184}],161:[function(require,module,exports){\n'use strict';\nvar fails = require('./_fails');\n\nmodule.exports = function (method, arg) {\n return !!method && fails(function () {\n // eslint-disable-next-line no-useless-call\n arg ? method.call(null, function () { /* empty */ }, 1) : method.call(null);\n });\n};\n\n},{\"./_fails\":94}],162:[function(require,module,exports){\nvar toInteger = require('./_to-integer');\nvar defined = require('./_defined');\n// true -> String#at\n// false -> String#codePointAt\nmodule.exports = function (TO_STRING) {\n return function (that, pos) {\n var s = String(defined(that));\n var i = toInteger(pos);\n var l = s.length;\n var a, b;\n if (i < 0 || i >= l) return TO_STRING ? '' : undefined;\n a = s.charCodeAt(i);\n return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff\n ? TO_STRING ? s.charAt(i) : a\n : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;\n };\n};\n\n},{\"./_defined\":87,\"./_to-integer\":172}],163:[function(require,module,exports){\n// helper for String#{startsWith, endsWith, includes}\nvar isRegExp = require('./_is-regexp');\nvar defined = require('./_defined');\n\nmodule.exports = function (that, searchString, NAME) {\n if (isRegExp(searchString)) throw TypeError('String#' + NAME + \" doesn't accept regex!\");\n return String(defined(that));\n};\n\n},{\"./_defined\":87,\"./_is-regexp\":111}],164:[function(require,module,exports){\nvar $export = require('./_export');\nvar fails = require('./_fails');\nvar defined = require('./_defined');\nvar quot = /\"/g;\n// B.2.3.2.1 CreateHTML(string, tag, attribute, value)\nvar createHTML = function (string, tag, attribute, value) {\n var S = String(defined(string));\n var p1 = '<' + tag;\n if (attribute !== '') p1 += ' ' + attribute + '=\"' + String(value).replace(quot, '"') + '\"';\n return p1 + '>' + S + '';\n};\nmodule.exports = function (NAME, exec) {\n var O = {};\n O[NAME] = exec(createHTML);\n $export($export.P + $export.F * fails(function () {\n var test = ''[NAME]('\"');\n return test !== test.toLowerCase() || test.split('\"').length > 3;\n }), 'String', O);\n};\n\n},{\"./_defined\":87,\"./_export\":92,\"./_fails\":94}],165:[function(require,module,exports){\n// https://github.com/tc39/proposal-string-pad-start-end\nvar toLength = require('./_to-length');\nvar repeat = require('./_string-repeat');\nvar defined = require('./_defined');\n\nmodule.exports = function (that, maxLength, fillString, left) {\n var S = String(defined(that));\n var stringLength = S.length;\n var fillStr = fillString === undefined ? ' ' : String(fillString);\n var intMaxLength = toLength(maxLength);\n if (intMaxLength <= stringLength || fillStr == '') return S;\n var fillLen = intMaxLength - stringLength;\n var stringFiller = repeat.call(fillStr, Math.ceil(fillLen / fillStr.length));\n if (stringFiller.length > fillLen) stringFiller = stringFiller.slice(0, fillLen);\n return left ? stringFiller + S : S + stringFiller;\n};\n\n},{\"./_defined\":87,\"./_string-repeat\":166,\"./_to-length\":174}],166:[function(require,module,exports){\n'use strict';\nvar toInteger = require('./_to-integer');\nvar defined = require('./_defined');\n\nmodule.exports = function repeat(count) {\n var str = String(defined(this));\n var res = '';\n var n = toInteger(count);\n if (n < 0 || n == Infinity) throw RangeError(\"Count can't be negative\");\n for (;n > 0; (n >>>= 1) && (str += str)) if (n & 1) res += str;\n return res;\n};\n\n},{\"./_defined\":87,\"./_to-integer\":172}],167:[function(require,module,exports){\nvar $export = require('./_export');\nvar defined = require('./_defined');\nvar fails = require('./_fails');\nvar spaces = require('./_string-ws');\nvar space = '[' + spaces + ']';\nvar non = '\\u200b\\u0085';\nvar ltrim = RegExp('^' + space + space + '*');\nvar rtrim = RegExp(space + space + '*$');\n\nvar exporter = function (KEY, exec, ALIAS) {\n var exp = {};\n var FORCE = fails(function () {\n return !!spaces[KEY]() || non[KEY]() != non;\n });\n var fn = exp[KEY] = FORCE ? exec(trim) : spaces[KEY];\n if (ALIAS) exp[ALIAS] = fn;\n $export($export.P + $export.F * FORCE, 'String', exp);\n};\n\n// 1 -> String#trimLeft\n// 2 -> String#trimRight\n// 3 -> String#trim\nvar trim = exporter.trim = function (string, TYPE) {\n string = String(defined(string));\n if (TYPE & 1) string = string.replace(ltrim, '');\n if (TYPE & 2) string = string.replace(rtrim, '');\n return string;\n};\n\nmodule.exports = exporter;\n\n},{\"./_defined\":87,\"./_export\":92,\"./_fails\":94,\"./_string-ws\":168}],168:[function(require,module,exports){\nmodule.exports = '\\x09\\x0A\\x0B\\x0C\\x0D\\x20\\xA0\\u1680\\u180E\\u2000\\u2001\\u2002\\u2003' +\n '\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028\\u2029\\uFEFF';\n\n},{}],169:[function(require,module,exports){\nvar ctx = require('./_ctx');\nvar invoke = require('./_invoke');\nvar html = require('./_html');\nvar cel = require('./_dom-create');\nvar global = require('./_global');\nvar process = global.process;\nvar setTask = global.setImmediate;\nvar clearTask = global.clearImmediate;\nvar MessageChannel = global.MessageChannel;\nvar Dispatch = global.Dispatch;\nvar counter = 0;\nvar queue = {};\nvar ONREADYSTATECHANGE = 'onreadystatechange';\nvar defer, channel, port;\nvar run = function () {\n var id = +this;\n // eslint-disable-next-line no-prototype-builtins\n if (queue.hasOwnProperty(id)) {\n var fn = queue[id];\n delete queue[id];\n fn();\n }\n};\nvar listener = function (event) {\n run.call(event.data);\n};\n// Node.js 0.9+ & IE10+ has setImmediate, otherwise:\nif (!setTask || !clearTask) {\n setTask = function setImmediate(fn) {\n var args = [];\n var i = 1;\n while (arguments.length > i) args.push(arguments[i++]);\n queue[++counter] = function () {\n // eslint-disable-next-line no-new-func\n invoke(typeof fn == 'function' ? fn : Function(fn), args);\n };\n defer(counter);\n return counter;\n };\n clearTask = function clearImmediate(id) {\n delete queue[id];\n };\n // Node.js 0.8-\n if (require('./_cof')(process) == 'process') {\n defer = function (id) {\n process.nextTick(ctx(run, id, 1));\n };\n // Sphere (JS game engine) Dispatch API\n } else if (Dispatch && Dispatch.now) {\n defer = function (id) {\n Dispatch.now(ctx(run, id, 1));\n };\n // Browsers with MessageChannel, includes WebWorkers\n } else if (MessageChannel) {\n channel = new MessageChannel();\n port = channel.port2;\n channel.port1.onmessage = listener;\n defer = ctx(port.postMessage, port, 1);\n // Browsers with postMessage, skip WebWorkers\n // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'\n } else if (global.addEventListener && typeof postMessage == 'function' && !global.importScripts) {\n defer = function (id) {\n global.postMessage(id + '', '*');\n };\n global.addEventListener('message', listener, false);\n // IE8-\n } else if (ONREADYSTATECHANGE in cel('script')) {\n defer = function (id) {\n html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function () {\n html.removeChild(this);\n run.call(id);\n };\n };\n // Rest old browsers\n } else {\n defer = function (id) {\n setTimeout(ctx(run, id, 1), 0);\n };\n }\n}\nmodule.exports = {\n set: setTask,\n clear: clearTask\n};\n\n},{\"./_cof\":77,\"./_ctx\":84,\"./_dom-create\":89,\"./_global\":99,\"./_html\":102,\"./_invoke\":105}],170:[function(require,module,exports){\nvar toInteger = require('./_to-integer');\nvar max = Math.max;\nvar min = Math.min;\nmodule.exports = function (index, length) {\n index = toInteger(index);\n return index < 0 ? max(index + length, 0) : min(index, length);\n};\n\n},{\"./_to-integer\":172}],171:[function(require,module,exports){\n// https://tc39.github.io/ecma262/#sec-toindex\nvar toInteger = require('./_to-integer');\nvar toLength = require('./_to-length');\nmodule.exports = function (it) {\n if (it === undefined) return 0;\n var number = toInteger(it);\n var length = toLength(number);\n if (number !== length) throw RangeError('Wrong length!');\n return length;\n};\n\n},{\"./_to-integer\":172,\"./_to-length\":174}],172:[function(require,module,exports){\n// 7.1.4 ToInteger\nvar ceil = Math.ceil;\nvar floor = Math.floor;\nmodule.exports = function (it) {\n return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);\n};\n\n},{}],173:[function(require,module,exports){\n// to indexed object, toObject with fallback for non-array-like ES3 strings\nvar IObject = require('./_iobject');\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n return IObject(defined(it));\n};\n\n},{\"./_defined\":87,\"./_iobject\":106}],174:[function(require,module,exports){\n// 7.1.15 ToLength\nvar toInteger = require('./_to-integer');\nvar min = Math.min;\nmodule.exports = function (it) {\n return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991\n};\n\n},{\"./_to-integer\":172}],175:[function(require,module,exports){\n// 7.1.13 ToObject(argument)\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n return Object(defined(it));\n};\n\n},{\"./_defined\":87}],176:[function(require,module,exports){\n// 7.1.1 ToPrimitive(input [, PreferredType])\nvar isObject = require('./_is-object');\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (it, S) {\n if (!isObject(it)) return it;\n var fn, val;\n if (S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n if (typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it))) return val;\n if (!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n throw TypeError(\"Can't convert object to primitive value\");\n};\n\n},{\"./_is-object\":110}],177:[function(require,module,exports){\n'use strict';\nif (require('./_descriptors')) {\n var LIBRARY = require('./_library');\n var global = require('./_global');\n var fails = require('./_fails');\n var $export = require('./_export');\n var $typed = require('./_typed');\n var $buffer = require('./_typed-buffer');\n var ctx = require('./_ctx');\n var anInstance = require('./_an-instance');\n var propertyDesc = require('./_property-desc');\n var hide = require('./_hide');\n var redefineAll = require('./_redefine-all');\n var toInteger = require('./_to-integer');\n var toLength = require('./_to-length');\n var toIndex = require('./_to-index');\n var toAbsoluteIndex = require('./_to-absolute-index');\n var toPrimitive = require('./_to-primitive');\n var has = require('./_has');\n var classof = require('./_classof');\n var isObject = require('./_is-object');\n var toObject = require('./_to-object');\n var isArrayIter = require('./_is-array-iter');\n var create = require('./_object-create');\n var getPrototypeOf = require('./_object-gpo');\n var gOPN = require('./_object-gopn').f;\n var getIterFn = require('./core.get-iterator-method');\n var uid = require('./_uid');\n var wks = require('./_wks');\n var createArrayMethod = require('./_array-methods');\n var createArrayIncludes = require('./_array-includes');\n var speciesConstructor = require('./_species-constructor');\n var ArrayIterators = require('./es6.array.iterator');\n var Iterators = require('./_iterators');\n var $iterDetect = require('./_iter-detect');\n var setSpecies = require('./_set-species');\n var arrayFill = require('./_array-fill');\n var arrayCopyWithin = require('./_array-copy-within');\n var $DP = require('./_object-dp');\n var $GOPD = require('./_object-gopd');\n var dP = $DP.f;\n var gOPD = $GOPD.f;\n var RangeError = global.RangeError;\n var TypeError = global.TypeError;\n var Uint8Array = global.Uint8Array;\n var ARRAY_BUFFER = 'ArrayBuffer';\n var SHARED_BUFFER = 'Shared' + ARRAY_BUFFER;\n var BYTES_PER_ELEMENT = 'BYTES_PER_ELEMENT';\n var PROTOTYPE = 'prototype';\n var ArrayProto = Array[PROTOTYPE];\n var $ArrayBuffer = $buffer.ArrayBuffer;\n var $DataView = $buffer.DataView;\n var arrayForEach = createArrayMethod(0);\n var arrayFilter = createArrayMethod(2);\n var arraySome = createArrayMethod(3);\n var arrayEvery = createArrayMethod(4);\n var arrayFind = createArrayMethod(5);\n var arrayFindIndex = createArrayMethod(6);\n var arrayIncludes = createArrayIncludes(true);\n var arrayIndexOf = createArrayIncludes(false);\n var arrayValues = ArrayIterators.values;\n var arrayKeys = ArrayIterators.keys;\n var arrayEntries = ArrayIterators.entries;\n var arrayLastIndexOf = ArrayProto.lastIndexOf;\n var arrayReduce = ArrayProto.reduce;\n var arrayReduceRight = ArrayProto.reduceRight;\n var arrayJoin = ArrayProto.join;\n var arraySort = ArrayProto.sort;\n var arraySlice = ArrayProto.slice;\n var arrayToString = ArrayProto.toString;\n var arrayToLocaleString = ArrayProto.toLocaleString;\n var ITERATOR = wks('iterator');\n var TAG = wks('toStringTag');\n var TYPED_CONSTRUCTOR = uid('typed_constructor');\n var DEF_CONSTRUCTOR = uid('def_constructor');\n var ALL_CONSTRUCTORS = $typed.CONSTR;\n var TYPED_ARRAY = $typed.TYPED;\n var VIEW = $typed.VIEW;\n var WRONG_LENGTH = 'Wrong length!';\n\n var $map = createArrayMethod(1, function (O, length) {\n return allocate(speciesConstructor(O, O[DEF_CONSTRUCTOR]), length);\n });\n\n var LITTLE_ENDIAN = fails(function () {\n // eslint-disable-next-line no-undef\n return new Uint8Array(new Uint16Array([1]).buffer)[0] === 1;\n });\n\n var FORCED_SET = !!Uint8Array && !!Uint8Array[PROTOTYPE].set && fails(function () {\n new Uint8Array(1).set({});\n });\n\n var toOffset = function (it, BYTES) {\n var offset = toInteger(it);\n if (offset < 0 || offset % BYTES) throw RangeError('Wrong offset!');\n return offset;\n };\n\n var validate = function (it) {\n if (isObject(it) && TYPED_ARRAY in it) return it;\n throw TypeError(it + ' is not a typed array!');\n };\n\n var allocate = function (C, length) {\n if (!(isObject(C) && TYPED_CONSTRUCTOR in C)) {\n throw TypeError('It is not a typed array constructor!');\n } return new C(length);\n };\n\n var speciesFromList = function (O, list) {\n return fromList(speciesConstructor(O, O[DEF_CONSTRUCTOR]), list);\n };\n\n var fromList = function (C, list) {\n var index = 0;\n var length = list.length;\n var result = allocate(C, length);\n while (length > index) result[index] = list[index++];\n return result;\n };\n\n var addGetter = function (it, key, internal) {\n dP(it, key, { get: function () { return this._d[internal]; } });\n };\n\n var $from = function from(source /* , mapfn, thisArg */) {\n var O = toObject(source);\n var aLen = arguments.length;\n var mapfn = aLen > 1 ? arguments[1] : undefined;\n var mapping = mapfn !== undefined;\n var iterFn = getIterFn(O);\n var i, length, values, result, step, iterator;\n if (iterFn != undefined && !isArrayIter(iterFn)) {\n for (iterator = iterFn.call(O), values = [], i = 0; !(step = iterator.next()).done; i++) {\n values.push(step.value);\n } O = values;\n }\n if (mapping && aLen > 2) mapfn = ctx(mapfn, arguments[2], 2);\n for (i = 0, length = toLength(O.length), result = allocate(this, length); length > i; i++) {\n result[i] = mapping ? mapfn(O[i], i) : O[i];\n }\n return result;\n };\n\n var $of = function of(/* ...items */) {\n var index = 0;\n var length = arguments.length;\n var result = allocate(this, length);\n while (length > index) result[index] = arguments[index++];\n return result;\n };\n\n // iOS Safari 6.x fails here\n var TO_LOCALE_BUG = !!Uint8Array && fails(function () { arrayToLocaleString.call(new Uint8Array(1)); });\n\n var $toLocaleString = function toLocaleString() {\n return arrayToLocaleString.apply(TO_LOCALE_BUG ? arraySlice.call(validate(this)) : validate(this), arguments);\n };\n\n var proto = {\n copyWithin: function copyWithin(target, start /* , end */) {\n return arrayCopyWithin.call(validate(this), target, start, arguments.length > 2 ? arguments[2] : undefined);\n },\n every: function every(callbackfn /* , thisArg */) {\n return arrayEvery(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n fill: function fill(value /* , start, end */) { // eslint-disable-line no-unused-vars\n return arrayFill.apply(validate(this), arguments);\n },\n filter: function filter(callbackfn /* , thisArg */) {\n return speciesFromList(this, arrayFilter(validate(this), callbackfn,\n arguments.length > 1 ? arguments[1] : undefined));\n },\n find: function find(predicate /* , thisArg */) {\n return arrayFind(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n },\n findIndex: function findIndex(predicate /* , thisArg */) {\n return arrayFindIndex(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n },\n forEach: function forEach(callbackfn /* , thisArg */) {\n arrayForEach(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n indexOf: function indexOf(searchElement /* , fromIndex */) {\n return arrayIndexOf(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n },\n includes: function includes(searchElement /* , fromIndex */) {\n return arrayIncludes(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n },\n join: function join(separator) { // eslint-disable-line no-unused-vars\n return arrayJoin.apply(validate(this), arguments);\n },\n lastIndexOf: function lastIndexOf(searchElement /* , fromIndex */) { // eslint-disable-line no-unused-vars\n return arrayLastIndexOf.apply(validate(this), arguments);\n },\n map: function map(mapfn /* , thisArg */) {\n return $map(validate(this), mapfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n reduce: function reduce(callbackfn /* , initialValue */) { // eslint-disable-line no-unused-vars\n return arrayReduce.apply(validate(this), arguments);\n },\n reduceRight: function reduceRight(callbackfn /* , initialValue */) { // eslint-disable-line no-unused-vars\n return arrayReduceRight.apply(validate(this), arguments);\n },\n reverse: function reverse() {\n var that = this;\n var length = validate(that).length;\n var middle = Math.floor(length / 2);\n var index = 0;\n var value;\n while (index < middle) {\n value = that[index];\n that[index++] = that[--length];\n that[length] = value;\n } return that;\n },\n some: function some(callbackfn /* , thisArg */) {\n return arraySome(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n sort: function sort(comparefn) {\n return arraySort.call(validate(this), comparefn);\n },\n subarray: function subarray(begin, end) {\n var O = validate(this);\n var length = O.length;\n var $begin = toAbsoluteIndex(begin, length);\n return new (speciesConstructor(O, O[DEF_CONSTRUCTOR]))(\n O.buffer,\n O.byteOffset + $begin * O.BYTES_PER_ELEMENT,\n toLength((end === undefined ? length : toAbsoluteIndex(end, length)) - $begin)\n );\n }\n };\n\n var $slice = function slice(start, end) {\n return speciesFromList(this, arraySlice.call(validate(this), start, end));\n };\n\n var $set = function set(arrayLike /* , offset */) {\n validate(this);\n var offset = toOffset(arguments[1], 1);\n var length = this.length;\n var src = toObject(arrayLike);\n var len = toLength(src.length);\n var index = 0;\n if (len + offset > length) throw RangeError(WRONG_LENGTH);\n while (index < len) this[offset + index] = src[index++];\n };\n\n var $iterators = {\n entries: function entries() {\n return arrayEntries.call(validate(this));\n },\n keys: function keys() {\n return arrayKeys.call(validate(this));\n },\n values: function values() {\n return arrayValues.call(validate(this));\n }\n };\n\n var isTAIndex = function (target, key) {\n return isObject(target)\n && target[TYPED_ARRAY]\n && typeof key != 'symbol'\n && key in target\n && String(+key) == String(key);\n };\n var $getDesc = function getOwnPropertyDescriptor(target, key) {\n return isTAIndex(target, key = toPrimitive(key, true))\n ? propertyDesc(2, target[key])\n : gOPD(target, key);\n };\n var $setDesc = function defineProperty(target, key, desc) {\n if (isTAIndex(target, key = toPrimitive(key, true))\n && isObject(desc)\n && has(desc, 'value')\n && !has(desc, 'get')\n && !has(desc, 'set')\n // TODO: add validation descriptor w/o calling accessors\n && !desc.configurable\n && (!has(desc, 'writable') || desc.writable)\n && (!has(desc, 'enumerable') || desc.enumerable)\n ) {\n target[key] = desc.value;\n return target;\n } return dP(target, key, desc);\n };\n\n if (!ALL_CONSTRUCTORS) {\n $GOPD.f = $getDesc;\n $DP.f = $setDesc;\n }\n\n $export($export.S + $export.F * !ALL_CONSTRUCTORS, 'Object', {\n getOwnPropertyDescriptor: $getDesc,\n defineProperty: $setDesc\n });\n\n if (fails(function () { arrayToString.call({}); })) {\n arrayToString = arrayToLocaleString = function toString() {\n return arrayJoin.call(this);\n };\n }\n\n var $TypedArrayPrototype$ = redefineAll({}, proto);\n redefineAll($TypedArrayPrototype$, $iterators);\n hide($TypedArrayPrototype$, ITERATOR, $iterators.values);\n redefineAll($TypedArrayPrototype$, {\n slice: $slice,\n set: $set,\n constructor: function () { /* noop */ },\n toString: arrayToString,\n toLocaleString: $toLocaleString\n });\n addGetter($TypedArrayPrototype$, 'buffer', 'b');\n addGetter($TypedArrayPrototype$, 'byteOffset', 'o');\n addGetter($TypedArrayPrototype$, 'byteLength', 'l');\n addGetter($TypedArrayPrototype$, 'length', 'e');\n dP($TypedArrayPrototype$, TAG, {\n get: function () { return this[TYPED_ARRAY]; }\n });\n\n // eslint-disable-next-line max-statements\n module.exports = function (KEY, BYTES, wrapper, CLAMPED) {\n CLAMPED = !!CLAMPED;\n var NAME = KEY + (CLAMPED ? 'Clamped' : '') + 'Array';\n var GETTER = 'get' + KEY;\n var SETTER = 'set' + KEY;\n var TypedArray = global[NAME];\n var Base = TypedArray || {};\n var TAC = TypedArray && getPrototypeOf(TypedArray);\n var FORCED = !TypedArray || !$typed.ABV;\n var O = {};\n var TypedArrayPrototype = TypedArray && TypedArray[PROTOTYPE];\n var getter = function (that, index) {\n var data = that._d;\n return data.v[GETTER](index * BYTES + data.o, LITTLE_ENDIAN);\n };\n var setter = function (that, index, value) {\n var data = that._d;\n if (CLAMPED) value = (value = Math.round(value)) < 0 ? 0 : value > 0xff ? 0xff : value & 0xff;\n data.v[SETTER](index * BYTES + data.o, value, LITTLE_ENDIAN);\n };\n var addElement = function (that, index) {\n dP(that, index, {\n get: function () {\n return getter(this, index);\n },\n set: function (value) {\n return setter(this, index, value);\n },\n enumerable: true\n });\n };\n if (FORCED) {\n TypedArray = wrapper(function (that, data, $offset, $length) {\n anInstance(that, TypedArray, NAME, '_d');\n var index = 0;\n var offset = 0;\n var buffer, byteLength, length, klass;\n if (!isObject(data)) {\n length = toIndex(data);\n byteLength = length * BYTES;\n buffer = new $ArrayBuffer(byteLength);\n } else if (data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER) {\n buffer = data;\n offset = toOffset($offset, BYTES);\n var $len = data.byteLength;\n if ($length === undefined) {\n if ($len % BYTES) throw RangeError(WRONG_LENGTH);\n byteLength = $len - offset;\n if (byteLength < 0) throw RangeError(WRONG_LENGTH);\n } else {\n byteLength = toLength($length) * BYTES;\n if (byteLength + offset > $len) throw RangeError(WRONG_LENGTH);\n }\n length = byteLength / BYTES;\n } else if (TYPED_ARRAY in data) {\n return fromList(TypedArray, data);\n } else {\n return $from.call(TypedArray, data);\n }\n hide(that, '_d', {\n b: buffer,\n o: offset,\n l: byteLength,\n e: length,\n v: new $DataView(buffer)\n });\n while (index < length) addElement(that, index++);\n });\n TypedArrayPrototype = TypedArray[PROTOTYPE] = create($TypedArrayPrototype$);\n hide(TypedArrayPrototype, 'constructor', TypedArray);\n } else if (!fails(function () {\n TypedArray(1);\n }) || !fails(function () {\n new TypedArray(-1); // eslint-disable-line no-new\n }) || !$iterDetect(function (iter) {\n new TypedArray(); // eslint-disable-line no-new\n new TypedArray(null); // eslint-disable-line no-new\n new TypedArray(1.5); // eslint-disable-line no-new\n new TypedArray(iter); // eslint-disable-line no-new\n }, true)) {\n TypedArray = wrapper(function (that, data, $offset, $length) {\n anInstance(that, TypedArray, NAME);\n var klass;\n // `ws` module bug, temporarily remove validation length for Uint8Array\n // https://github.com/websockets/ws/pull/645\n if (!isObject(data)) return new Base(toIndex(data));\n if (data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER) {\n return $length !== undefined\n ? new Base(data, toOffset($offset, BYTES), $length)\n : $offset !== undefined\n ? new Base(data, toOffset($offset, BYTES))\n : new Base(data);\n }\n if (TYPED_ARRAY in data) return fromList(TypedArray, data);\n return $from.call(TypedArray, data);\n });\n arrayForEach(TAC !== Function.prototype ? gOPN(Base).concat(gOPN(TAC)) : gOPN(Base), function (key) {\n if (!(key in TypedArray)) hide(TypedArray, key, Base[key]);\n });\n TypedArray[PROTOTYPE] = TypedArrayPrototype;\n if (!LIBRARY) TypedArrayPrototype.constructor = TypedArray;\n }\n var $nativeIterator = TypedArrayPrototype[ITERATOR];\n var CORRECT_ITER_NAME = !!$nativeIterator\n && ($nativeIterator.name == 'values' || $nativeIterator.name == undefined);\n var $iterator = $iterators.values;\n hide(TypedArray, TYPED_CONSTRUCTOR, true);\n hide(TypedArrayPrototype, TYPED_ARRAY, NAME);\n hide(TypedArrayPrototype, VIEW, true);\n hide(TypedArrayPrototype, DEF_CONSTRUCTOR, TypedArray);\n\n if (CLAMPED ? new TypedArray(1)[TAG] != NAME : !(TAG in TypedArrayPrototype)) {\n dP(TypedArrayPrototype, TAG, {\n get: function () { return NAME; }\n });\n }\n\n O[NAME] = TypedArray;\n\n $export($export.G + $export.W + $export.F * (TypedArray != Base), O);\n\n $export($export.S, NAME, {\n BYTES_PER_ELEMENT: BYTES\n });\n\n $export($export.S + $export.F * fails(function () { Base.of.call(TypedArray, 1); }), NAME, {\n from: $from,\n of: $of\n });\n\n if (!(BYTES_PER_ELEMENT in TypedArrayPrototype)) hide(TypedArrayPrototype, BYTES_PER_ELEMENT, BYTES);\n\n $export($export.P, NAME, proto);\n\n setSpecies(NAME);\n\n $export($export.P + $export.F * FORCED_SET, NAME, { set: $set });\n\n $export($export.P + $export.F * !CORRECT_ITER_NAME, NAME, $iterators);\n\n if (!LIBRARY && TypedArrayPrototype.toString != arrayToString) TypedArrayPrototype.toString = arrayToString;\n\n $export($export.P + $export.F * fails(function () {\n new TypedArray(1).slice();\n }), NAME, { slice: $slice });\n\n $export($export.P + $export.F * (fails(function () {\n return [1, 2].toLocaleString() != new TypedArray([1, 2]).toLocaleString();\n }) || !fails(function () {\n TypedArrayPrototype.toLocaleString.call([1, 2]);\n })), NAME, { toLocaleString: $toLocaleString });\n\n Iterators[NAME] = CORRECT_ITER_NAME ? $nativeIterator : $iterator;\n if (!LIBRARY && !CORRECT_ITER_NAME) hide(TypedArrayPrototype, ITERATOR, $iterator);\n };\n} else module.exports = function () { /* empty */ };\n\n},{\"./_an-instance\":65,\"./_array-copy-within\":67,\"./_array-fill\":68,\"./_array-includes\":70,\"./_array-methods\":71,\"./_classof\":76,\"./_ctx\":84,\"./_descriptors\":88,\"./_export\":92,\"./_fails\":94,\"./_global\":99,\"./_has\":100,\"./_hide\":101,\"./_is-array-iter\":107,\"./_is-object\":110,\"./_iter-detect\":115,\"./_iterators\":117,\"./_library\":118,\"./_object-create\":129,\"./_object-dp\":130,\"./_object-gopd\":133,\"./_object-gopn\":135,\"./_object-gpo\":137,\"./_property-desc\":148,\"./_redefine-all\":149,\"./_set-species\":156,\"./_species-constructor\":160,\"./_to-absolute-index\":170,\"./_to-index\":171,\"./_to-integer\":172,\"./_to-length\":174,\"./_to-object\":175,\"./_to-primitive\":176,\"./_typed\":179,\"./_typed-buffer\":178,\"./_uid\":180,\"./_wks\":184,\"./core.get-iterator-method\":185,\"./es6.array.iterator\":197}],178:[function(require,module,exports){\n'use strict';\nvar global = require('./_global');\nvar DESCRIPTORS = require('./_descriptors');\nvar LIBRARY = require('./_library');\nvar $typed = require('./_typed');\nvar hide = require('./_hide');\nvar redefineAll = require('./_redefine-all');\nvar fails = require('./_fails');\nvar anInstance = require('./_an-instance');\nvar toInteger = require('./_to-integer');\nvar toLength = require('./_to-length');\nvar toIndex = require('./_to-index');\nvar gOPN = require('./_object-gopn').f;\nvar dP = require('./_object-dp').f;\nvar arrayFill = require('./_array-fill');\nvar setToStringTag = require('./_set-to-string-tag');\nvar ARRAY_BUFFER = 'ArrayBuffer';\nvar DATA_VIEW = 'DataView';\nvar PROTOTYPE = 'prototype';\nvar WRONG_LENGTH = 'Wrong length!';\nvar WRONG_INDEX = 'Wrong index!';\nvar $ArrayBuffer = global[ARRAY_BUFFER];\nvar $DataView = global[DATA_VIEW];\nvar Math = global.Math;\nvar RangeError = global.RangeError;\n// eslint-disable-next-line no-shadow-restricted-names\nvar Infinity = global.Infinity;\nvar BaseBuffer = $ArrayBuffer;\nvar abs = Math.abs;\nvar pow = Math.pow;\nvar floor = Math.floor;\nvar log = Math.log;\nvar LN2 = Math.LN2;\nvar BUFFER = 'buffer';\nvar BYTE_LENGTH = 'byteLength';\nvar BYTE_OFFSET = 'byteOffset';\nvar $BUFFER = DESCRIPTORS ? '_b' : BUFFER;\nvar $LENGTH = DESCRIPTORS ? '_l' : BYTE_LENGTH;\nvar $OFFSET = DESCRIPTORS ? '_o' : BYTE_OFFSET;\n\n// IEEE754 conversions based on https://github.com/feross/ieee754\nfunction packIEEE754(value, mLen, nBytes) {\n var buffer = Array(nBytes);\n var eLen = nBytes * 8 - mLen - 1;\n var eMax = (1 << eLen) - 1;\n var eBias = eMax >> 1;\n var rt = mLen === 23 ? pow(2, -24) - pow(2, -77) : 0;\n var i = 0;\n var s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;\n var e, m, c;\n value = abs(value);\n // eslint-disable-next-line no-self-compare\n if (value != value || value === Infinity) {\n // eslint-disable-next-line no-self-compare\n m = value != value ? 1 : 0;\n e = eMax;\n } else {\n e = floor(log(value) / LN2);\n if (value * (c = pow(2, -e)) < 1) {\n e--;\n c *= 2;\n }\n if (e + eBias >= 1) {\n value += rt / c;\n } else {\n value += rt * pow(2, 1 - eBias);\n }\n if (value * c >= 2) {\n e++;\n c /= 2;\n }\n if (e + eBias >= eMax) {\n m = 0;\n e = eMax;\n } else if (e + eBias >= 1) {\n m = (value * c - 1) * pow(2, mLen);\n e = e + eBias;\n } else {\n m = value * pow(2, eBias - 1) * pow(2, mLen);\n e = 0;\n }\n }\n for (; mLen >= 8; buffer[i++] = m & 255, m /= 256, mLen -= 8);\n e = e << mLen | m;\n eLen += mLen;\n for (; eLen > 0; buffer[i++] = e & 255, e /= 256, eLen -= 8);\n buffer[--i] |= s * 128;\n return buffer;\n}\nfunction unpackIEEE754(buffer, mLen, nBytes) {\n var eLen = nBytes * 8 - mLen - 1;\n var eMax = (1 << eLen) - 1;\n var eBias = eMax >> 1;\n var nBits = eLen - 7;\n var i = nBytes - 1;\n var s = buffer[i--];\n var e = s & 127;\n var m;\n s >>= 7;\n for (; nBits > 0; e = e * 256 + buffer[i], i--, nBits -= 8);\n m = e & (1 << -nBits) - 1;\n e >>= -nBits;\n nBits += mLen;\n for (; nBits > 0; m = m * 256 + buffer[i], i--, nBits -= 8);\n if (e === 0) {\n e = 1 - eBias;\n } else if (e === eMax) {\n return m ? NaN : s ? -Infinity : Infinity;\n } else {\n m = m + pow(2, mLen);\n e = e - eBias;\n } return (s ? -1 : 1) * m * pow(2, e - mLen);\n}\n\nfunction unpackI32(bytes) {\n return bytes[3] << 24 | bytes[2] << 16 | bytes[1] << 8 | bytes[0];\n}\nfunction packI8(it) {\n return [it & 0xff];\n}\nfunction packI16(it) {\n return [it & 0xff, it >> 8 & 0xff];\n}\nfunction packI32(it) {\n return [it & 0xff, it >> 8 & 0xff, it >> 16 & 0xff, it >> 24 & 0xff];\n}\nfunction packF64(it) {\n return packIEEE754(it, 52, 8);\n}\nfunction packF32(it) {\n return packIEEE754(it, 23, 4);\n}\n\nfunction addGetter(C, key, internal) {\n dP(C[PROTOTYPE], key, { get: function () { return this[internal]; } });\n}\n\nfunction get(view, bytes, index, isLittleEndian) {\n var numIndex = +index;\n var intIndex = toIndex(numIndex);\n if (intIndex + bytes > view[$LENGTH]) throw RangeError(WRONG_INDEX);\n var store = view[$BUFFER]._b;\n var start = intIndex + view[$OFFSET];\n var pack = store.slice(start, start + bytes);\n return isLittleEndian ? pack : pack.reverse();\n}\nfunction set(view, bytes, index, conversion, value, isLittleEndian) {\n var numIndex = +index;\n var intIndex = toIndex(numIndex);\n if (intIndex + bytes > view[$LENGTH]) throw RangeError(WRONG_INDEX);\n var store = view[$BUFFER]._b;\n var start = intIndex + view[$OFFSET];\n var pack = conversion(+value);\n for (var i = 0; i < bytes; i++) store[start + i] = pack[isLittleEndian ? i : bytes - i - 1];\n}\n\nif (!$typed.ABV) {\n $ArrayBuffer = function ArrayBuffer(length) {\n anInstance(this, $ArrayBuffer, ARRAY_BUFFER);\n var byteLength = toIndex(length);\n this._b = arrayFill.call(Array(byteLength), 0);\n this[$LENGTH] = byteLength;\n };\n\n $DataView = function DataView(buffer, byteOffset, byteLength) {\n anInstance(this, $DataView, DATA_VIEW);\n anInstance(buffer, $ArrayBuffer, DATA_VIEW);\n var bufferLength = buffer[$LENGTH];\n var offset = toInteger(byteOffset);\n if (offset < 0 || offset > bufferLength) throw RangeError('Wrong offset!');\n byteLength = byteLength === undefined ? bufferLength - offset : toLength(byteLength);\n if (offset + byteLength > bufferLength) throw RangeError(WRONG_LENGTH);\n this[$BUFFER] = buffer;\n this[$OFFSET] = offset;\n this[$LENGTH] = byteLength;\n };\n\n if (DESCRIPTORS) {\n addGetter($ArrayBuffer, BYTE_LENGTH, '_l');\n addGetter($DataView, BUFFER, '_b');\n addGetter($DataView, BYTE_LENGTH, '_l');\n addGetter($DataView, BYTE_OFFSET, '_o');\n }\n\n redefineAll($DataView[PROTOTYPE], {\n getInt8: function getInt8(byteOffset) {\n return get(this, 1, byteOffset)[0] << 24 >> 24;\n },\n getUint8: function getUint8(byteOffset) {\n return get(this, 1, byteOffset)[0];\n },\n getInt16: function getInt16(byteOffset /* , littleEndian */) {\n var bytes = get(this, 2, byteOffset, arguments[1]);\n return (bytes[1] << 8 | bytes[0]) << 16 >> 16;\n },\n getUint16: function getUint16(byteOffset /* , littleEndian */) {\n var bytes = get(this, 2, byteOffset, arguments[1]);\n return bytes[1] << 8 | bytes[0];\n },\n getInt32: function getInt32(byteOffset /* , littleEndian */) {\n return unpackI32(get(this, 4, byteOffset, arguments[1]));\n },\n getUint32: function getUint32(byteOffset /* , littleEndian */) {\n return unpackI32(get(this, 4, byteOffset, arguments[1])) >>> 0;\n },\n getFloat32: function getFloat32(byteOffset /* , littleEndian */) {\n return unpackIEEE754(get(this, 4, byteOffset, arguments[1]), 23, 4);\n },\n getFloat64: function getFloat64(byteOffset /* , littleEndian */) {\n return unpackIEEE754(get(this, 8, byteOffset, arguments[1]), 52, 8);\n },\n setInt8: function setInt8(byteOffset, value) {\n set(this, 1, byteOffset, packI8, value);\n },\n setUint8: function setUint8(byteOffset, value) {\n set(this, 1, byteOffset, packI8, value);\n },\n setInt16: function setInt16(byteOffset, value /* , littleEndian */) {\n set(this, 2, byteOffset, packI16, value, arguments[2]);\n },\n setUint16: function setUint16(byteOffset, value /* , littleEndian */) {\n set(this, 2, byteOffset, packI16, value, arguments[2]);\n },\n setInt32: function setInt32(byteOffset, value /* , littleEndian */) {\n set(this, 4, byteOffset, packI32, value, arguments[2]);\n },\n setUint32: function setUint32(byteOffset, value /* , littleEndian */) {\n set(this, 4, byteOffset, packI32, value, arguments[2]);\n },\n setFloat32: function setFloat32(byteOffset, value /* , littleEndian */) {\n set(this, 4, byteOffset, packF32, value, arguments[2]);\n },\n setFloat64: function setFloat64(byteOffset, value /* , littleEndian */) {\n set(this, 8, byteOffset, packF64, value, arguments[2]);\n }\n });\n} else {\n if (!fails(function () {\n $ArrayBuffer(1);\n }) || !fails(function () {\n new $ArrayBuffer(-1); // eslint-disable-line no-new\n }) || fails(function () {\n new $ArrayBuffer(); // eslint-disable-line no-new\n new $ArrayBuffer(1.5); // eslint-disable-line no-new\n new $ArrayBuffer(NaN); // eslint-disable-line no-new\n return $ArrayBuffer.name != ARRAY_BUFFER;\n })) {\n $ArrayBuffer = function ArrayBuffer(length) {\n anInstance(this, $ArrayBuffer);\n return new BaseBuffer(toIndex(length));\n };\n var ArrayBufferProto = $ArrayBuffer[PROTOTYPE] = BaseBuffer[PROTOTYPE];\n for (var keys = gOPN(BaseBuffer), j = 0, key; keys.length > j;) {\n if (!((key = keys[j++]) in $ArrayBuffer)) hide($ArrayBuffer, key, BaseBuffer[key]);\n }\n if (!LIBRARY) ArrayBufferProto.constructor = $ArrayBuffer;\n }\n // iOS Safari 7.x bug\n var view = new $DataView(new $ArrayBuffer(2));\n var $setInt8 = $DataView[PROTOTYPE].setInt8;\n view.setInt8(0, 2147483648);\n view.setInt8(1, 2147483649);\n if (view.getInt8(0) || !view.getInt8(1)) redefineAll($DataView[PROTOTYPE], {\n setInt8: function setInt8(byteOffset, value) {\n $setInt8.call(this, byteOffset, value << 24 >> 24);\n },\n setUint8: function setUint8(byteOffset, value) {\n $setInt8.call(this, byteOffset, value << 24 >> 24);\n }\n }, true);\n}\nsetToStringTag($ArrayBuffer, ARRAY_BUFFER);\nsetToStringTag($DataView, DATA_VIEW);\nhide($DataView[PROTOTYPE], $typed.VIEW, true);\nexports[ARRAY_BUFFER] = $ArrayBuffer;\nexports[DATA_VIEW] = $DataView;\n\n},{\"./_an-instance\":65,\"./_array-fill\":68,\"./_descriptors\":88,\"./_fails\":94,\"./_global\":99,\"./_hide\":101,\"./_library\":118,\"./_object-dp\":130,\"./_object-gopn\":135,\"./_redefine-all\":149,\"./_set-to-string-tag\":157,\"./_to-index\":171,\"./_to-integer\":172,\"./_to-length\":174,\"./_typed\":179}],179:[function(require,module,exports){\nvar global = require('./_global');\nvar hide = require('./_hide');\nvar uid = require('./_uid');\nvar TYPED = uid('typed_array');\nvar VIEW = uid('view');\nvar ABV = !!(global.ArrayBuffer && global.DataView);\nvar CONSTR = ABV;\nvar i = 0;\nvar l = 9;\nvar Typed;\n\nvar TypedArrayConstructors = (\n 'Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array'\n).split(',');\n\nwhile (i < l) {\n if (Typed = global[TypedArrayConstructors[i++]]) {\n hide(Typed.prototype, TYPED, true);\n hide(Typed.prototype, VIEW, true);\n } else CONSTR = false;\n}\n\nmodule.exports = {\n ABV: ABV,\n CONSTR: CONSTR,\n TYPED: TYPED,\n VIEW: VIEW\n};\n\n},{\"./_global\":99,\"./_hide\":101,\"./_uid\":180}],180:[function(require,module,exports){\nvar id = 0;\nvar px = Math.random();\nmodule.exports = function (key) {\n return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));\n};\n\n},{}],181:[function(require,module,exports){\nvar isObject = require('./_is-object');\nmodule.exports = function (it, TYPE) {\n if (!isObject(it) || it._t !== TYPE) throw TypeError('Incompatible receiver, ' + TYPE + ' required!');\n return it;\n};\n\n},{\"./_is-object\":110}],182:[function(require,module,exports){\nvar global = require('./_global');\nvar core = require('./_core');\nvar LIBRARY = require('./_library');\nvar wksExt = require('./_wks-ext');\nvar defineProperty = require('./_object-dp').f;\nmodule.exports = function (name) {\n var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {});\n if (name.charAt(0) != '_' && !(name in $Symbol)) defineProperty($Symbol, name, { value: wksExt.f(name) });\n};\n\n},{\"./_core\":82,\"./_global\":99,\"./_library\":118,\"./_object-dp\":130,\"./_wks-ext\":183}],183:[function(require,module,exports){\nexports.f = require('./_wks');\n\n},{\"./_wks\":184}],184:[function(require,module,exports){\nvar store = require('./_shared')('wks');\nvar uid = require('./_uid');\nvar Symbol = require('./_global').Symbol;\nvar USE_SYMBOL = typeof Symbol == 'function';\n\nvar $exports = module.exports = function (name) {\n return store[name] || (store[name] =\n USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));\n};\n\n$exports.store = store;\n\n},{\"./_global\":99,\"./_shared\":159,\"./_uid\":180}],185:[function(require,module,exports){\nvar classof = require('./_classof');\nvar ITERATOR = require('./_wks')('iterator');\nvar Iterators = require('./_iterators');\nmodule.exports = require('./_core').getIteratorMethod = function (it) {\n if (it != undefined) return it[ITERATOR]\n || it['@@iterator']\n || Iterators[classof(it)];\n};\n\n},{\"./_classof\":76,\"./_core\":82,\"./_iterators\":117,\"./_wks\":184}],186:[function(require,module,exports){\n// https://github.com/benjamingr/RexExp.escape\nvar $export = require('./_export');\nvar $re = require('./_replacer')(/[\\\\^$*+?.()|[\\]{}]/g, '\\\\$&');\n\n$export($export.S, 'RegExp', { escape: function escape(it) { return $re(it); } });\n\n},{\"./_export\":92,\"./_replacer\":151}],187:[function(require,module,exports){\n// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\nvar $export = require('./_export');\n\n$export($export.P, 'Array', { copyWithin: require('./_array-copy-within') });\n\nrequire('./_add-to-unscopables')('copyWithin');\n\n},{\"./_add-to-unscopables\":64,\"./_array-copy-within\":67,\"./_export\":92}],188:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $every = require('./_array-methods')(4);\n\n$export($export.P + $export.F * !require('./_strict-method')([].every, true), 'Array', {\n // 22.1.3.5 / 15.4.4.16 Array.prototype.every(callbackfn [, thisArg])\n every: function every(callbackfn /* , thisArg */) {\n return $every(this, callbackfn, arguments[1]);\n }\n});\n\n},{\"./_array-methods\":71,\"./_export\":92,\"./_strict-method\":161}],189:[function(require,module,exports){\n// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\nvar $export = require('./_export');\n\n$export($export.P, 'Array', { fill: require('./_array-fill') });\n\nrequire('./_add-to-unscopables')('fill');\n\n},{\"./_add-to-unscopables\":64,\"./_array-fill\":68,\"./_export\":92}],190:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $filter = require('./_array-methods')(2);\n\n$export($export.P + $export.F * !require('./_strict-method')([].filter, true), 'Array', {\n // 22.1.3.7 / 15.4.4.20 Array.prototype.filter(callbackfn [, thisArg])\n filter: function filter(callbackfn /* , thisArg */) {\n return $filter(this, callbackfn, arguments[1]);\n }\n});\n\n},{\"./_array-methods\":71,\"./_export\":92,\"./_strict-method\":161}],191:[function(require,module,exports){\n'use strict';\n// 22.1.3.9 Array.prototype.findIndex(predicate, thisArg = undefined)\nvar $export = require('./_export');\nvar $find = require('./_array-methods')(6);\nvar KEY = 'findIndex';\nvar forced = true;\n// Shouldn't skip holes\nif (KEY in []) Array(1)[KEY](function () { forced = false; });\n$export($export.P + $export.F * forced, 'Array', {\n findIndex: function findIndex(callbackfn /* , that = undefined */) {\n return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\nrequire('./_add-to-unscopables')(KEY);\n\n},{\"./_add-to-unscopables\":64,\"./_array-methods\":71,\"./_export\":92}],192:[function(require,module,exports){\n'use strict';\n// 22.1.3.8 Array.prototype.find(predicate, thisArg = undefined)\nvar $export = require('./_export');\nvar $find = require('./_array-methods')(5);\nvar KEY = 'find';\nvar forced = true;\n// Shouldn't skip holes\nif (KEY in []) Array(1)[KEY](function () { forced = false; });\n$export($export.P + $export.F * forced, 'Array', {\n find: function find(callbackfn /* , that = undefined */) {\n return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\nrequire('./_add-to-unscopables')(KEY);\n\n},{\"./_add-to-unscopables\":64,\"./_array-methods\":71,\"./_export\":92}],193:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $forEach = require('./_array-methods')(0);\nvar STRICT = require('./_strict-method')([].forEach, true);\n\n$export($export.P + $export.F * !STRICT, 'Array', {\n // 22.1.3.10 / 15.4.4.18 Array.prototype.forEach(callbackfn [, thisArg])\n forEach: function forEach(callbackfn /* , thisArg */) {\n return $forEach(this, callbackfn, arguments[1]);\n }\n});\n\n},{\"./_array-methods\":71,\"./_export\":92,\"./_strict-method\":161}],194:[function(require,module,exports){\n'use strict';\nvar ctx = require('./_ctx');\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar call = require('./_iter-call');\nvar isArrayIter = require('./_is-array-iter');\nvar toLength = require('./_to-length');\nvar createProperty = require('./_create-property');\nvar getIterFn = require('./core.get-iterator-method');\n\n$export($export.S + $export.F * !require('./_iter-detect')(function (iter) { Array.from(iter); }), 'Array', {\n // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)\n from: function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\n var O = toObject(arrayLike);\n var C = typeof this == 'function' ? this : Array;\n var aLen = arguments.length;\n var mapfn = aLen > 1 ? arguments[1] : undefined;\n var mapping = mapfn !== undefined;\n var index = 0;\n var iterFn = getIterFn(O);\n var length, result, step, iterator;\n if (mapping) mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2);\n // if object isn't iterable or it's array with default iterator - use simple case\n if (iterFn != undefined && !(C == Array && isArrayIter(iterFn))) {\n for (iterator = iterFn.call(O), result = new C(); !(step = iterator.next()).done; index++) {\n createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value);\n }\n } else {\n length = toLength(O.length);\n for (result = new C(length); length > index; index++) {\n createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]);\n }\n }\n result.length = index;\n return result;\n }\n});\n\n},{\"./_create-property\":83,\"./_ctx\":84,\"./_export\":92,\"./_is-array-iter\":107,\"./_iter-call\":112,\"./_iter-detect\":115,\"./_to-length\":174,\"./_to-object\":175,\"./core.get-iterator-method\":185}],195:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $indexOf = require('./_array-includes')(false);\nvar $native = [].indexOf;\nvar NEGATIVE_ZERO = !!$native && 1 / [1].indexOf(1, -0) < 0;\n\n$export($export.P + $export.F * (NEGATIVE_ZERO || !require('./_strict-method')($native)), 'Array', {\n // 22.1.3.11 / 15.4.4.14 Array.prototype.indexOf(searchElement [, fromIndex])\n indexOf: function indexOf(searchElement /* , fromIndex = 0 */) {\n return NEGATIVE_ZERO\n // convert -0 to +0\n ? $native.apply(this, arguments) || 0\n : $indexOf(this, searchElement, arguments[1]);\n }\n});\n\n},{\"./_array-includes\":70,\"./_export\":92,\"./_strict-method\":161}],196:[function(require,module,exports){\n// 22.1.2.2 / 15.4.3.2 Array.isArray(arg)\nvar $export = require('./_export');\n\n$export($export.S, 'Array', { isArray: require('./_is-array') });\n\n},{\"./_export\":92,\"./_is-array\":108}],197:[function(require,module,exports){\n'use strict';\nvar addToUnscopables = require('./_add-to-unscopables');\nvar step = require('./_iter-step');\nvar Iterators = require('./_iterators');\nvar toIObject = require('./_to-iobject');\n\n// 22.1.3.4 Array.prototype.entries()\n// 22.1.3.13 Array.prototype.keys()\n// 22.1.3.29 Array.prototype.values()\n// 22.1.3.30 Array.prototype[@@iterator]()\nmodule.exports = require('./_iter-define')(Array, 'Array', function (iterated, kind) {\n this._t = toIObject(iterated); // target\n this._i = 0; // next index\n this._k = kind; // kind\n// 22.1.5.2.1 %ArrayIteratorPrototype%.next()\n}, function () {\n var O = this._t;\n var kind = this._k;\n var index = this._i++;\n if (!O || index >= O.length) {\n this._t = undefined;\n return step(1);\n }\n if (kind == 'keys') return step(0, index);\n if (kind == 'values') return step(0, O[index]);\n return step(0, [index, O[index]]);\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)\nIterators.Arguments = Iterators.Array;\n\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n\n},{\"./_add-to-unscopables\":64,\"./_iter-define\":114,\"./_iter-step\":116,\"./_iterators\":117,\"./_to-iobject\":173}],198:[function(require,module,exports){\n'use strict';\n// 22.1.3.13 Array.prototype.join(separator)\nvar $export = require('./_export');\nvar toIObject = require('./_to-iobject');\nvar arrayJoin = [].join;\n\n// fallback for not array-like strings\n$export($export.P + $export.F * (require('./_iobject') != Object || !require('./_strict-method')(arrayJoin)), 'Array', {\n join: function join(separator) {\n return arrayJoin.call(toIObject(this), separator === undefined ? ',' : separator);\n }\n});\n\n},{\"./_export\":92,\"./_iobject\":106,\"./_strict-method\":161,\"./_to-iobject\":173}],199:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toIObject = require('./_to-iobject');\nvar toInteger = require('./_to-integer');\nvar toLength = require('./_to-length');\nvar $native = [].lastIndexOf;\nvar NEGATIVE_ZERO = !!$native && 1 / [1].lastIndexOf(1, -0) < 0;\n\n$export($export.P + $export.F * (NEGATIVE_ZERO || !require('./_strict-method')($native)), 'Array', {\n // 22.1.3.14 / 15.4.4.15 Array.prototype.lastIndexOf(searchElement [, fromIndex])\n lastIndexOf: function lastIndexOf(searchElement /* , fromIndex = @[*-1] */) {\n // convert -0 to +0\n if (NEGATIVE_ZERO) return $native.apply(this, arguments) || 0;\n var O = toIObject(this);\n var length = toLength(O.length);\n var index = length - 1;\n if (arguments.length > 1) index = Math.min(index, toInteger(arguments[1]));\n if (index < 0) index = length + index;\n for (;index >= 0; index--) if (index in O) if (O[index] === searchElement) return index || 0;\n return -1;\n }\n});\n\n},{\"./_export\":92,\"./_strict-method\":161,\"./_to-integer\":172,\"./_to-iobject\":173,\"./_to-length\":174}],200:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $map = require('./_array-methods')(1);\n\n$export($export.P + $export.F * !require('./_strict-method')([].map, true), 'Array', {\n // 22.1.3.15 / 15.4.4.19 Array.prototype.map(callbackfn [, thisArg])\n map: function map(callbackfn /* , thisArg */) {\n return $map(this, callbackfn, arguments[1]);\n }\n});\n\n},{\"./_array-methods\":71,\"./_export\":92,\"./_strict-method\":161}],201:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar createProperty = require('./_create-property');\n\n// WebKit Array.of isn't generic\n$export($export.S + $export.F * require('./_fails')(function () {\n function F() { /* empty */ }\n return !(Array.of.call(F) instanceof F);\n}), 'Array', {\n // 22.1.2.3 Array.of( ...items)\n of: function of(/* ...args */) {\n var index = 0;\n var aLen = arguments.length;\n var result = new (typeof this == 'function' ? this : Array)(aLen);\n while (aLen > index) createProperty(result, index, arguments[index++]);\n result.length = aLen;\n return result;\n }\n});\n\n},{\"./_create-property\":83,\"./_export\":92,\"./_fails\":94}],202:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $reduce = require('./_array-reduce');\n\n$export($export.P + $export.F * !require('./_strict-method')([].reduceRight, true), 'Array', {\n // 22.1.3.19 / 15.4.4.22 Array.prototype.reduceRight(callbackfn [, initialValue])\n reduceRight: function reduceRight(callbackfn /* , initialValue */) {\n return $reduce(this, callbackfn, arguments.length, arguments[1], true);\n }\n});\n\n},{\"./_array-reduce\":72,\"./_export\":92,\"./_strict-method\":161}],203:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $reduce = require('./_array-reduce');\n\n$export($export.P + $export.F * !require('./_strict-method')([].reduce, true), 'Array', {\n // 22.1.3.18 / 15.4.4.21 Array.prototype.reduce(callbackfn [, initialValue])\n reduce: function reduce(callbackfn /* , initialValue */) {\n return $reduce(this, callbackfn, arguments.length, arguments[1], false);\n }\n});\n\n},{\"./_array-reduce\":72,\"./_export\":92,\"./_strict-method\":161}],204:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar html = require('./_html');\nvar cof = require('./_cof');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\nvar arraySlice = [].slice;\n\n// fallback for not array-like ES3 strings and DOM objects\n$export($export.P + $export.F * require('./_fails')(function () {\n if (html) arraySlice.call(html);\n}), 'Array', {\n slice: function slice(begin, end) {\n var len = toLength(this.length);\n var klass = cof(this);\n end = end === undefined ? len : end;\n if (klass == 'Array') return arraySlice.call(this, begin, end);\n var start = toAbsoluteIndex(begin, len);\n var upTo = toAbsoluteIndex(end, len);\n var size = toLength(upTo - start);\n var cloned = Array(size);\n var i = 0;\n for (; i < size; i++) cloned[i] = klass == 'String'\n ? this.charAt(start + i)\n : this[start + i];\n return cloned;\n }\n});\n\n},{\"./_cof\":77,\"./_export\":92,\"./_fails\":94,\"./_html\":102,\"./_to-absolute-index\":170,\"./_to-length\":174}],205:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $some = require('./_array-methods')(3);\n\n$export($export.P + $export.F * !require('./_strict-method')([].some, true), 'Array', {\n // 22.1.3.23 / 15.4.4.17 Array.prototype.some(callbackfn [, thisArg])\n some: function some(callbackfn /* , thisArg */) {\n return $some(this, callbackfn, arguments[1]);\n }\n});\n\n},{\"./_array-methods\":71,\"./_export\":92,\"./_strict-method\":161}],206:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar aFunction = require('./_a-function');\nvar toObject = require('./_to-object');\nvar fails = require('./_fails');\nvar $sort = [].sort;\nvar test = [1, 2, 3];\n\n$export($export.P + $export.F * (fails(function () {\n // IE8-\n test.sort(undefined);\n}) || !fails(function () {\n // V8 bug\n test.sort(null);\n // Old WebKit\n}) || !require('./_strict-method')($sort)), 'Array', {\n // 22.1.3.25 Array.prototype.sort(comparefn)\n sort: function sort(comparefn) {\n return comparefn === undefined\n ? $sort.call(toObject(this))\n : $sort.call(toObject(this), aFunction(comparefn));\n }\n});\n\n},{\"./_a-function\":62,\"./_export\":92,\"./_fails\":94,\"./_strict-method\":161,\"./_to-object\":175}],207:[function(require,module,exports){\nrequire('./_set-species')('Array');\n\n},{\"./_set-species\":156}],208:[function(require,module,exports){\n// 20.3.3.1 / 15.9.4.4 Date.now()\nvar $export = require('./_export');\n\n$export($export.S, 'Date', { now: function () { return new Date().getTime(); } });\n\n},{\"./_export\":92}],209:[function(require,module,exports){\n// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()\nvar $export = require('./_export');\nvar toISOString = require('./_date-to-iso-string');\n\n// PhantomJS / old WebKit has a broken implementations\n$export($export.P + $export.F * (Date.prototype.toISOString !== toISOString), 'Date', {\n toISOString: toISOString\n});\n\n},{\"./_date-to-iso-string\":85,\"./_export\":92}],210:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar toPrimitive = require('./_to-primitive');\n\n$export($export.P + $export.F * require('./_fails')(function () {\n return new Date(NaN).toJSON() !== null\n || Date.prototype.toJSON.call({ toISOString: function () { return 1; } }) !== 1;\n}), 'Date', {\n // eslint-disable-next-line no-unused-vars\n toJSON: function toJSON(key) {\n var O = toObject(this);\n var pv = toPrimitive(O);\n return typeof pv == 'number' && !isFinite(pv) ? null : O.toISOString();\n }\n});\n\n},{\"./_export\":92,\"./_fails\":94,\"./_to-object\":175,\"./_to-primitive\":176}],211:[function(require,module,exports){\nvar TO_PRIMITIVE = require('./_wks')('toPrimitive');\nvar proto = Date.prototype;\n\nif (!(TO_PRIMITIVE in proto)) require('./_hide')(proto, TO_PRIMITIVE, require('./_date-to-primitive'));\n\n},{\"./_date-to-primitive\":86,\"./_hide\":101,\"./_wks\":184}],212:[function(require,module,exports){\nvar DateProto = Date.prototype;\nvar INVALID_DATE = 'Invalid Date';\nvar TO_STRING = 'toString';\nvar $toString = DateProto[TO_STRING];\nvar getTime = DateProto.getTime;\nif (new Date(NaN) + '' != INVALID_DATE) {\n require('./_redefine')(DateProto, TO_STRING, function toString() {\n var value = getTime.call(this);\n // eslint-disable-next-line no-self-compare\n return value === value ? $toString.call(this) : INVALID_DATE;\n });\n}\n\n},{\"./_redefine\":150}],213:[function(require,module,exports){\n// 19.2.3.2 / 15.3.4.5 Function.prototype.bind(thisArg, args...)\nvar $export = require('./_export');\n\n$export($export.P, 'Function', { bind: require('./_bind') });\n\n},{\"./_bind\":75,\"./_export\":92}],214:[function(require,module,exports){\n'use strict';\nvar isObject = require('./_is-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar HAS_INSTANCE = require('./_wks')('hasInstance');\nvar FunctionProto = Function.prototype;\n// 19.2.3.6 Function.prototype[@@hasInstance](V)\nif (!(HAS_INSTANCE in FunctionProto)) require('./_object-dp').f(FunctionProto, HAS_INSTANCE, { value: function (O) {\n if (typeof this != 'function' || !isObject(O)) return false;\n if (!isObject(this.prototype)) return O instanceof this;\n // for environment w/o native `@@hasInstance` logic enough `instanceof`, but add this:\n while (O = getPrototypeOf(O)) if (this.prototype === O) return true;\n return false;\n} });\n\n},{\"./_is-object\":110,\"./_object-dp\":130,\"./_object-gpo\":137,\"./_wks\":184}],215:[function(require,module,exports){\nvar dP = require('./_object-dp').f;\nvar FProto = Function.prototype;\nvar nameRE = /^\\s*function ([^ (]*)/;\nvar NAME = 'name';\n\n// 19.2.4.2 name\nNAME in FProto || require('./_descriptors') && dP(FProto, NAME, {\n configurable: true,\n get: function () {\n try {\n return ('' + this).match(nameRE)[1];\n } catch (e) {\n return '';\n }\n }\n});\n\n},{\"./_descriptors\":88,\"./_object-dp\":130}],216:[function(require,module,exports){\n'use strict';\nvar strong = require('./_collection-strong');\nvar validate = require('./_validate-collection');\nvar MAP = 'Map';\n\n// 23.1 Map Objects\nmodule.exports = require('./_collection')(MAP, function (get) {\n return function Map() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\n}, {\n // 23.1.3.6 Map.prototype.get(key)\n get: function get(key) {\n var entry = strong.getEntry(validate(this, MAP), key);\n return entry && entry.v;\n },\n // 23.1.3.9 Map.prototype.set(key, value)\n set: function set(key, value) {\n return strong.def(validate(this, MAP), key === 0 ? 0 : key, value);\n }\n}, strong, true);\n\n},{\"./_collection\":81,\"./_collection-strong\":78,\"./_validate-collection\":181}],217:[function(require,module,exports){\n// 20.2.2.3 Math.acosh(x)\nvar $export = require('./_export');\nvar log1p = require('./_math-log1p');\nvar sqrt = Math.sqrt;\nvar $acosh = Math.acosh;\n\n$export($export.S + $export.F * !($acosh\n // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509\n && Math.floor($acosh(Number.MAX_VALUE)) == 710\n // Tor Browser bug: Math.acosh(Infinity) -> NaN\n && $acosh(Infinity) == Infinity\n), 'Math', {\n acosh: function acosh(x) {\n return (x = +x) < 1 ? NaN : x > 94906265.62425156\n ? Math.log(x) + Math.LN2\n : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1));\n }\n});\n\n},{\"./_export\":92,\"./_math-log1p\":121}],218:[function(require,module,exports){\n// 20.2.2.5 Math.asinh(x)\nvar $export = require('./_export');\nvar $asinh = Math.asinh;\n\nfunction asinh(x) {\n return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : Math.log(x + Math.sqrt(x * x + 1));\n}\n\n// Tor Browser bug: Math.asinh(0) -> -0\n$export($export.S + $export.F * !($asinh && 1 / $asinh(0) > 0), 'Math', { asinh: asinh });\n\n},{\"./_export\":92}],219:[function(require,module,exports){\n// 20.2.2.7 Math.atanh(x)\nvar $export = require('./_export');\nvar $atanh = Math.atanh;\n\n// Tor Browser bug: Math.atanh(-0) -> 0\n$export($export.S + $export.F * !($atanh && 1 / $atanh(-0) < 0), 'Math', {\n atanh: function atanh(x) {\n return (x = +x) == 0 ? x : Math.log((1 + x) / (1 - x)) / 2;\n }\n});\n\n},{\"./_export\":92}],220:[function(require,module,exports){\n// 20.2.2.9 Math.cbrt(x)\nvar $export = require('./_export');\nvar sign = require('./_math-sign');\n\n$export($export.S, 'Math', {\n cbrt: function cbrt(x) {\n return sign(x = +x) * Math.pow(Math.abs(x), 1 / 3);\n }\n});\n\n},{\"./_export\":92,\"./_math-sign\":123}],221:[function(require,module,exports){\n// 20.2.2.11 Math.clz32(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n clz32: function clz32(x) {\n return (x >>>= 0) ? 31 - Math.floor(Math.log(x + 0.5) * Math.LOG2E) : 32;\n }\n});\n\n},{\"./_export\":92}],222:[function(require,module,exports){\n// 20.2.2.12 Math.cosh(x)\nvar $export = require('./_export');\nvar exp = Math.exp;\n\n$export($export.S, 'Math', {\n cosh: function cosh(x) {\n return (exp(x = +x) + exp(-x)) / 2;\n }\n});\n\n},{\"./_export\":92}],223:[function(require,module,exports){\n// 20.2.2.14 Math.expm1(x)\nvar $export = require('./_export');\nvar $expm1 = require('./_math-expm1');\n\n$export($export.S + $export.F * ($expm1 != Math.expm1), 'Math', { expm1: $expm1 });\n\n},{\"./_export\":92,\"./_math-expm1\":119}],224:[function(require,module,exports){\n// 20.2.2.16 Math.fround(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { fround: require('./_math-fround') });\n\n},{\"./_export\":92,\"./_math-fround\":120}],225:[function(require,module,exports){\n// 20.2.2.17 Math.hypot([value1[, value2[, … ]]])\nvar $export = require('./_export');\nvar abs = Math.abs;\n\n$export($export.S, 'Math', {\n hypot: function hypot(value1, value2) { // eslint-disable-line no-unused-vars\n var sum = 0;\n var i = 0;\n var aLen = arguments.length;\n var larg = 0;\n var arg, div;\n while (i < aLen) {\n arg = abs(arguments[i++]);\n if (larg < arg) {\n div = larg / arg;\n sum = sum * div * div + 1;\n larg = arg;\n } else if (arg > 0) {\n div = arg / larg;\n sum += div * div;\n } else sum += arg;\n }\n return larg === Infinity ? Infinity : larg * Math.sqrt(sum);\n }\n});\n\n},{\"./_export\":92}],226:[function(require,module,exports){\n// 20.2.2.18 Math.imul(x, y)\nvar $export = require('./_export');\nvar $imul = Math.imul;\n\n// some WebKit versions fails with big numbers, some has wrong arity\n$export($export.S + $export.F * require('./_fails')(function () {\n return $imul(0xffffffff, 5) != -5 || $imul.length != 2;\n}), 'Math', {\n imul: function imul(x, y) {\n var UINT16 = 0xffff;\n var xn = +x;\n var yn = +y;\n var xl = UINT16 & xn;\n var yl = UINT16 & yn;\n return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0);\n }\n});\n\n},{\"./_export\":92,\"./_fails\":94}],227:[function(require,module,exports){\n// 20.2.2.21 Math.log10(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n log10: function log10(x) {\n return Math.log(x) * Math.LOG10E;\n }\n});\n\n},{\"./_export\":92}],228:[function(require,module,exports){\n// 20.2.2.20 Math.log1p(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { log1p: require('./_math-log1p') });\n\n},{\"./_export\":92,\"./_math-log1p\":121}],229:[function(require,module,exports){\n// 20.2.2.22 Math.log2(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n log2: function log2(x) {\n return Math.log(x) / Math.LN2;\n }\n});\n\n},{\"./_export\":92}],230:[function(require,module,exports){\n// 20.2.2.28 Math.sign(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { sign: require('./_math-sign') });\n\n},{\"./_export\":92,\"./_math-sign\":123}],231:[function(require,module,exports){\n// 20.2.2.30 Math.sinh(x)\nvar $export = require('./_export');\nvar expm1 = require('./_math-expm1');\nvar exp = Math.exp;\n\n// V8 near Chromium 38 has a problem with very small numbers\n$export($export.S + $export.F * require('./_fails')(function () {\n return !Math.sinh(-2e-17) != -2e-17;\n}), 'Math', {\n sinh: function sinh(x) {\n return Math.abs(x = +x) < 1\n ? (expm1(x) - expm1(-x)) / 2\n : (exp(x - 1) - exp(-x - 1)) * (Math.E / 2);\n }\n});\n\n},{\"./_export\":92,\"./_fails\":94,\"./_math-expm1\":119}],232:[function(require,module,exports){\n// 20.2.2.33 Math.tanh(x)\nvar $export = require('./_export');\nvar expm1 = require('./_math-expm1');\nvar exp = Math.exp;\n\n$export($export.S, 'Math', {\n tanh: function tanh(x) {\n var a = expm1(x = +x);\n var b = expm1(-x);\n return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x));\n }\n});\n\n},{\"./_export\":92,\"./_math-expm1\":119}],233:[function(require,module,exports){\n// 20.2.2.34 Math.trunc(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n trunc: function trunc(it) {\n return (it > 0 ? Math.floor : Math.ceil)(it);\n }\n});\n\n},{\"./_export\":92}],234:[function(require,module,exports){\n'use strict';\nvar global = require('./_global');\nvar has = require('./_has');\nvar cof = require('./_cof');\nvar inheritIfRequired = require('./_inherit-if-required');\nvar toPrimitive = require('./_to-primitive');\nvar fails = require('./_fails');\nvar gOPN = require('./_object-gopn').f;\nvar gOPD = require('./_object-gopd').f;\nvar dP = require('./_object-dp').f;\nvar $trim = require('./_string-trim').trim;\nvar NUMBER = 'Number';\nvar $Number = global[NUMBER];\nvar Base = $Number;\nvar proto = $Number.prototype;\n// Opera ~12 has broken Object#toString\nvar BROKEN_COF = cof(require('./_object-create')(proto)) == NUMBER;\nvar TRIM = 'trim' in String.prototype;\n\n// 7.1.3 ToNumber(argument)\nvar toNumber = function (argument) {\n var it = toPrimitive(argument, false);\n if (typeof it == 'string' && it.length > 2) {\n it = TRIM ? it.trim() : $trim(it, 3);\n var first = it.charCodeAt(0);\n var third, radix, maxCode;\n if (first === 43 || first === 45) {\n third = it.charCodeAt(2);\n if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\n } else if (first === 48) {\n switch (it.charCodeAt(1)) {\n case 66: case 98: radix = 2; maxCode = 49; break; // fast equal /^0b[01]+$/i\n case 79: case 111: radix = 8; maxCode = 55; break; // fast equal /^0o[0-7]+$/i\n default: return +it;\n }\n for (var digits = it.slice(2), i = 0, l = digits.length, code; i < l; i++) {\n code = digits.charCodeAt(i);\n // parseInt parses a string to a first unavailable symbol\n // but ToNumber should return NaN if a string contains unavailable symbols\n if (code < 48 || code > maxCode) return NaN;\n } return parseInt(digits, radix);\n }\n } return +it;\n};\n\nif (!$Number(' 0o1') || !$Number('0b1') || $Number('+0x1')) {\n $Number = function Number(value) {\n var it = arguments.length < 1 ? 0 : value;\n var that = this;\n return that instanceof $Number\n // check on 1..constructor(foo) case\n && (BROKEN_COF ? fails(function () { proto.valueOf.call(that); }) : cof(that) != NUMBER)\n ? inheritIfRequired(new Base(toNumber(it)), that, $Number) : toNumber(it);\n };\n for (var keys = require('./_descriptors') ? gOPN(Base) : (\n // ES3:\n 'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\n // ES6 (in case, if modules with ES6 Number statics required before):\n 'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' +\n 'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger'\n ).split(','), j = 0, key; keys.length > j; j++) {\n if (has(Base, key = keys[j]) && !has($Number, key)) {\n dP($Number, key, gOPD(Base, key));\n }\n }\n $Number.prototype = proto;\n proto.constructor = $Number;\n require('./_redefine')(global, NUMBER, $Number);\n}\n\n},{\"./_cof\":77,\"./_descriptors\":88,\"./_fails\":94,\"./_global\":99,\"./_has\":100,\"./_inherit-if-required\":104,\"./_object-create\":129,\"./_object-dp\":130,\"./_object-gopd\":133,\"./_object-gopn\":135,\"./_redefine\":150,\"./_string-trim\":167,\"./_to-primitive\":176}],235:[function(require,module,exports){\n// 20.1.2.1 Number.EPSILON\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { EPSILON: Math.pow(2, -52) });\n\n},{\"./_export\":92}],236:[function(require,module,exports){\n// 20.1.2.2 Number.isFinite(number)\nvar $export = require('./_export');\nvar _isFinite = require('./_global').isFinite;\n\n$export($export.S, 'Number', {\n isFinite: function isFinite(it) {\n return typeof it == 'number' && _isFinite(it);\n }\n});\n\n},{\"./_export\":92,\"./_global\":99}],237:[function(require,module,exports){\n// 20.1.2.3 Number.isInteger(number)\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { isInteger: require('./_is-integer') });\n\n},{\"./_export\":92,\"./_is-integer\":109}],238:[function(require,module,exports){\n// 20.1.2.4 Number.isNaN(number)\nvar $export = require('./_export');\n\n$export($export.S, 'Number', {\n isNaN: function isNaN(number) {\n // eslint-disable-next-line no-self-compare\n return number != number;\n }\n});\n\n},{\"./_export\":92}],239:[function(require,module,exports){\n// 20.1.2.5 Number.isSafeInteger(number)\nvar $export = require('./_export');\nvar isInteger = require('./_is-integer');\nvar abs = Math.abs;\n\n$export($export.S, 'Number', {\n isSafeInteger: function isSafeInteger(number) {\n return isInteger(number) && abs(number) <= 0x1fffffffffffff;\n }\n});\n\n},{\"./_export\":92,\"./_is-integer\":109}],240:[function(require,module,exports){\n// 20.1.2.6 Number.MAX_SAFE_INTEGER\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { MAX_SAFE_INTEGER: 0x1fffffffffffff });\n\n},{\"./_export\":92}],241:[function(require,module,exports){\n// 20.1.2.10 Number.MIN_SAFE_INTEGER\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { MIN_SAFE_INTEGER: -0x1fffffffffffff });\n\n},{\"./_export\":92}],242:[function(require,module,exports){\nvar $export = require('./_export');\nvar $parseFloat = require('./_parse-float');\n// 20.1.2.12 Number.parseFloat(string)\n$export($export.S + $export.F * (Number.parseFloat != $parseFloat), 'Number', { parseFloat: $parseFloat });\n\n},{\"./_export\":92,\"./_parse-float\":144}],243:[function(require,module,exports){\nvar $export = require('./_export');\nvar $parseInt = require('./_parse-int');\n// 20.1.2.13 Number.parseInt(string, radix)\n$export($export.S + $export.F * (Number.parseInt != $parseInt), 'Number', { parseInt: $parseInt });\n\n},{\"./_export\":92,\"./_parse-int\":145}],244:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toInteger = require('./_to-integer');\nvar aNumberValue = require('./_a-number-value');\nvar repeat = require('./_string-repeat');\nvar $toFixed = 1.0.toFixed;\nvar floor = Math.floor;\nvar data = [0, 0, 0, 0, 0, 0];\nvar ERROR = 'Number.toFixed: incorrect invocation!';\nvar ZERO = '0';\n\nvar multiply = function (n, c) {\n var i = -1;\n var c2 = c;\n while (++i < 6) {\n c2 += n * data[i];\n data[i] = c2 % 1e7;\n c2 = floor(c2 / 1e7);\n }\n};\nvar divide = function (n) {\n var i = 6;\n var c = 0;\n while (--i >= 0) {\n c += data[i];\n data[i] = floor(c / n);\n c = (c % n) * 1e7;\n }\n};\nvar numToString = function () {\n var i = 6;\n var s = '';\n while (--i >= 0) {\n if (s !== '' || i === 0 || data[i] !== 0) {\n var t = String(data[i]);\n s = s === '' ? t : s + repeat.call(ZERO, 7 - t.length) + t;\n }\n } return s;\n};\nvar pow = function (x, n, acc) {\n return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);\n};\nvar log = function (x) {\n var n = 0;\n var x2 = x;\n while (x2 >= 4096) {\n n += 12;\n x2 /= 4096;\n }\n while (x2 >= 2) {\n n += 1;\n x2 /= 2;\n } return n;\n};\n\n$export($export.P + $export.F * (!!$toFixed && (\n 0.00008.toFixed(3) !== '0.000' ||\n 0.9.toFixed(0) !== '1' ||\n 1.255.toFixed(2) !== '1.25' ||\n 1000000000000000128.0.toFixed(0) !== '1000000000000000128'\n) || !require('./_fails')(function () {\n // V8 ~ Android 4.3-\n $toFixed.call({});\n})), 'Number', {\n toFixed: function toFixed(fractionDigits) {\n var x = aNumberValue(this, ERROR);\n var f = toInteger(fractionDigits);\n var s = '';\n var m = ZERO;\n var e, z, j, k;\n if (f < 0 || f > 20) throw RangeError(ERROR);\n // eslint-disable-next-line no-self-compare\n if (x != x) return 'NaN';\n if (x <= -1e21 || x >= 1e21) return String(x);\n if (x < 0) {\n s = '-';\n x = -x;\n }\n if (x > 1e-21) {\n e = log(x * pow(2, 69, 1)) - 69;\n z = e < 0 ? x * pow(2, -e, 1) : x / pow(2, e, 1);\n z *= 0x10000000000000;\n e = 52 - e;\n if (e > 0) {\n multiply(0, z);\n j = f;\n while (j >= 7) {\n multiply(1e7, 0);\n j -= 7;\n }\n multiply(pow(10, j, 1), 0);\n j = e - 1;\n while (j >= 23) {\n divide(1 << 23);\n j -= 23;\n }\n divide(1 << j);\n multiply(1, 1);\n divide(2);\n m = numToString();\n } else {\n multiply(0, z);\n multiply(1 << -e, 0);\n m = numToString() + repeat.call(ZERO, f);\n }\n }\n if (f > 0) {\n k = m.length;\n m = s + (k <= f ? '0.' + repeat.call(ZERO, f - k) + m : m.slice(0, k - f) + '.' + m.slice(k - f));\n } else {\n m = s + m;\n } return m;\n }\n});\n\n},{\"./_a-number-value\":63,\"./_export\":92,\"./_fails\":94,\"./_string-repeat\":166,\"./_to-integer\":172}],245:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $fails = require('./_fails');\nvar aNumberValue = require('./_a-number-value');\nvar $toPrecision = 1.0.toPrecision;\n\n$export($export.P + $export.F * ($fails(function () {\n // IE7-\n return $toPrecision.call(1, undefined) !== '1';\n}) || !$fails(function () {\n // V8 ~ Android 4.3-\n $toPrecision.call({});\n})), 'Number', {\n toPrecision: function toPrecision(precision) {\n var that = aNumberValue(this, 'Number#toPrecision: incorrect invocation!');\n return precision === undefined ? $toPrecision.call(that) : $toPrecision.call(that, precision);\n }\n});\n\n},{\"./_a-number-value\":63,\"./_export\":92,\"./_fails\":94}],246:[function(require,module,exports){\n// 19.1.3.1 Object.assign(target, source)\nvar $export = require('./_export');\n\n$export($export.S + $export.F, 'Object', { assign: require('./_object-assign') });\n\n},{\"./_export\":92,\"./_object-assign\":128}],247:[function(require,module,exports){\nvar $export = require('./_export');\n// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\n$export($export.S, 'Object', { create: require('./_object-create') });\n\n},{\"./_export\":92,\"./_object-create\":129}],248:[function(require,module,exports){\nvar $export = require('./_export');\n// 19.1.2.3 / 15.2.3.7 Object.defineProperties(O, Properties)\n$export($export.S + $export.F * !require('./_descriptors'), 'Object', { defineProperties: require('./_object-dps') });\n\n},{\"./_descriptors\":88,\"./_export\":92,\"./_object-dps\":131}],249:[function(require,module,exports){\nvar $export = require('./_export');\n// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)\n$export($export.S + $export.F * !require('./_descriptors'), 'Object', { defineProperty: require('./_object-dp').f });\n\n},{\"./_descriptors\":88,\"./_export\":92,\"./_object-dp\":130}],250:[function(require,module,exports){\n// 19.1.2.5 Object.freeze(O)\nvar isObject = require('./_is-object');\nvar meta = require('./_meta').onFreeze;\n\nrequire('./_object-sap')('freeze', function ($freeze) {\n return function freeze(it) {\n return $freeze && isObject(it) ? $freeze(meta(it)) : it;\n };\n});\n\n},{\"./_is-object\":110,\"./_meta\":124,\"./_object-sap\":141}],251:[function(require,module,exports){\n// 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\nvar toIObject = require('./_to-iobject');\nvar $getOwnPropertyDescriptor = require('./_object-gopd').f;\n\nrequire('./_object-sap')('getOwnPropertyDescriptor', function () {\n return function getOwnPropertyDescriptor(it, key) {\n return $getOwnPropertyDescriptor(toIObject(it), key);\n };\n});\n\n},{\"./_object-gopd\":133,\"./_object-sap\":141,\"./_to-iobject\":173}],252:[function(require,module,exports){\n// 19.1.2.7 Object.getOwnPropertyNames(O)\nrequire('./_object-sap')('getOwnPropertyNames', function () {\n return require('./_object-gopn-ext').f;\n});\n\n},{\"./_object-gopn-ext\":134,\"./_object-sap\":141}],253:[function(require,module,exports){\n// 19.1.2.9 Object.getPrototypeOf(O)\nvar toObject = require('./_to-object');\nvar $getPrototypeOf = require('./_object-gpo');\n\nrequire('./_object-sap')('getPrototypeOf', function () {\n return function getPrototypeOf(it) {\n return $getPrototypeOf(toObject(it));\n };\n});\n\n},{\"./_object-gpo\":137,\"./_object-sap\":141,\"./_to-object\":175}],254:[function(require,module,exports){\n// 19.1.2.11 Object.isExtensible(O)\nvar isObject = require('./_is-object');\n\nrequire('./_object-sap')('isExtensible', function ($isExtensible) {\n return function isExtensible(it) {\n return isObject(it) ? $isExtensible ? $isExtensible(it) : true : false;\n };\n});\n\n},{\"./_is-object\":110,\"./_object-sap\":141}],255:[function(require,module,exports){\n// 19.1.2.12 Object.isFrozen(O)\nvar isObject = require('./_is-object');\n\nrequire('./_object-sap')('isFrozen', function ($isFrozen) {\n return function isFrozen(it) {\n return isObject(it) ? $isFrozen ? $isFrozen(it) : false : true;\n };\n});\n\n},{\"./_is-object\":110,\"./_object-sap\":141}],256:[function(require,module,exports){\n// 19.1.2.13 Object.isSealed(O)\nvar isObject = require('./_is-object');\n\nrequire('./_object-sap')('isSealed', function ($isSealed) {\n return function isSealed(it) {\n return isObject(it) ? $isSealed ? $isSealed(it) : false : true;\n };\n});\n\n},{\"./_is-object\":110,\"./_object-sap\":141}],257:[function(require,module,exports){\n// 19.1.3.10 Object.is(value1, value2)\nvar $export = require('./_export');\n$export($export.S, 'Object', { is: require('./_same-value') });\n\n},{\"./_export\":92,\"./_same-value\":152}],258:[function(require,module,exports){\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\n},{\"./_object-keys\":139,\"./_object-sap\":141,\"./_to-object\":175}],259:[function(require,module,exports){\n// 19.1.2.15 Object.preventExtensions(O)\nvar isObject = require('./_is-object');\nvar meta = require('./_meta').onFreeze;\n\nrequire('./_object-sap')('preventExtensions', function ($preventExtensions) {\n return function preventExtensions(it) {\n return $preventExtensions && isObject(it) ? $preventExtensions(meta(it)) : it;\n };\n});\n\n},{\"./_is-object\":110,\"./_meta\":124,\"./_object-sap\":141}],260:[function(require,module,exports){\n// 19.1.2.17 Object.seal(O)\nvar isObject = require('./_is-object');\nvar meta = require('./_meta').onFreeze;\n\nrequire('./_object-sap')('seal', function ($seal) {\n return function seal(it) {\n return $seal && isObject(it) ? $seal(meta(it)) : it;\n };\n});\n\n},{\"./_is-object\":110,\"./_meta\":124,\"./_object-sap\":141}],261:[function(require,module,exports){\n// 19.1.3.19 Object.setPrototypeOf(O, proto)\nvar $export = require('./_export');\n$export($export.S, 'Object', { setPrototypeOf: require('./_set-proto').set });\n\n},{\"./_export\":92,\"./_set-proto\":155}],262:[function(require,module,exports){\n'use strict';\n// 19.1.3.6 Object.prototype.toString()\nvar classof = require('./_classof');\nvar test = {};\ntest[require('./_wks')('toStringTag')] = 'z';\nif (test + '' != '[object z]') {\n require('./_redefine')(Object.prototype, 'toString', function toString() {\n return '[object ' + classof(this) + ']';\n }, true);\n}\n\n},{\"./_classof\":76,\"./_redefine\":150,\"./_wks\":184}],263:[function(require,module,exports){\nvar $export = require('./_export');\nvar $parseFloat = require('./_parse-float');\n// 18.2.4 parseFloat(string)\n$export($export.G + $export.F * (parseFloat != $parseFloat), { parseFloat: $parseFloat });\n\n},{\"./_export\":92,\"./_parse-float\":144}],264:[function(require,module,exports){\nvar $export = require('./_export');\nvar $parseInt = require('./_parse-int');\n// 18.2.5 parseInt(string, radix)\n$export($export.G + $export.F * (parseInt != $parseInt), { parseInt: $parseInt });\n\n},{\"./_export\":92,\"./_parse-int\":145}],265:[function(require,module,exports){\n'use strict';\nvar LIBRARY = require('./_library');\nvar global = require('./_global');\nvar ctx = require('./_ctx');\nvar classof = require('./_classof');\nvar $export = require('./_export');\nvar isObject = require('./_is-object');\nvar aFunction = require('./_a-function');\nvar anInstance = require('./_an-instance');\nvar forOf = require('./_for-of');\nvar speciesConstructor = require('./_species-constructor');\nvar task = require('./_task').set;\nvar microtask = require('./_microtask')();\nvar newPromiseCapabilityModule = require('./_new-promise-capability');\nvar perform = require('./_perform');\nvar promiseResolve = require('./_promise-resolve');\nvar PROMISE = 'Promise';\nvar TypeError = global.TypeError;\nvar process = global.process;\nvar $Promise = global[PROMISE];\nvar isNode = classof(process) == 'process';\nvar empty = function () { /* empty */ };\nvar Internal, newGenericPromiseCapability, OwnPromiseCapability, Wrapper;\nvar newPromiseCapability = newGenericPromiseCapability = newPromiseCapabilityModule.f;\n\nvar USE_NATIVE = !!function () {\n try {\n // correct subclassing with @@species support\n var promise = $Promise.resolve(1);\n var FakePromise = (promise.constructor = {})[require('./_wks')('species')] = function (exec) {\n exec(empty, empty);\n };\n // unhandled rejections tracking support, NodeJS Promise without it fails @@species test\n return (isNode || typeof PromiseRejectionEvent == 'function') && promise.then(empty) instanceof FakePromise;\n } catch (e) { /* empty */ }\n}();\n\n// helpers\nvar isThenable = function (it) {\n var then;\n return isObject(it) && typeof (then = it.then) == 'function' ? then : false;\n};\nvar notify = function (promise, isReject) {\n if (promise._n) return;\n promise._n = true;\n var chain = promise._c;\n microtask(function () {\n var value = promise._v;\n var ok = promise._s == 1;\n var i = 0;\n var run = function (reaction) {\n var handler = ok ? reaction.ok : reaction.fail;\n var resolve = reaction.resolve;\n var reject = reaction.reject;\n var domain = reaction.domain;\n var result, then;\n try {\n if (handler) {\n if (!ok) {\n if (promise._h == 2) onHandleUnhandled(promise);\n promise._h = 1;\n }\n if (handler === true) result = value;\n else {\n if (domain) domain.enter();\n result = handler(value);\n if (domain) domain.exit();\n }\n if (result === reaction.promise) {\n reject(TypeError('Promise-chain cycle'));\n } else if (then = isThenable(result)) {\n then.call(result, resolve, reject);\n } else resolve(result);\n } else reject(value);\n } catch (e) {\n reject(e);\n }\n };\n while (chain.length > i) run(chain[i++]); // variable length - can't use forEach\n promise._c = [];\n promise._n = false;\n if (isReject && !promise._h) onUnhandled(promise);\n });\n};\nvar onUnhandled = function (promise) {\n task.call(global, function () {\n var value = promise._v;\n var unhandled = isUnhandled(promise);\n var result, handler, console;\n if (unhandled) {\n result = perform(function () {\n if (isNode) {\n process.emit('unhandledRejection', value, promise);\n } else if (handler = global.onunhandledrejection) {\n handler({ promise: promise, reason: value });\n } else if ((console = global.console) && console.error) {\n console.error('Unhandled promise rejection', value);\n }\n });\n // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should\n promise._h = isNode || isUnhandled(promise) ? 2 : 1;\n } promise._a = undefined;\n if (unhandled && result.e) throw result.v;\n });\n};\nvar isUnhandled = function (promise) {\n if (promise._h == 1) return false;\n var chain = promise._a || promise._c;\n var i = 0;\n var reaction;\n while (chain.length > i) {\n reaction = chain[i++];\n if (reaction.fail || !isUnhandled(reaction.promise)) return false;\n } return true;\n};\nvar onHandleUnhandled = function (promise) {\n task.call(global, function () {\n var handler;\n if (isNode) {\n process.emit('rejectionHandled', promise);\n } else if (handler = global.onrejectionhandled) {\n handler({ promise: promise, reason: promise._v });\n }\n });\n};\nvar $reject = function (value) {\n var promise = this;\n if (promise._d) return;\n promise._d = true;\n promise = promise._w || promise; // unwrap\n promise._v = value;\n promise._s = 2;\n if (!promise._a) promise._a = promise._c.slice();\n notify(promise, true);\n};\nvar $resolve = function (value) {\n var promise = this;\n var then;\n if (promise._d) return;\n promise._d = true;\n promise = promise._w || promise; // unwrap\n try {\n if (promise === value) throw TypeError(\"Promise can't be resolved itself\");\n if (then = isThenable(value)) {\n microtask(function () {\n var wrapper = { _w: promise, _d: false }; // wrap\n try {\n then.call(value, ctx($resolve, wrapper, 1), ctx($reject, wrapper, 1));\n } catch (e) {\n $reject.call(wrapper, e);\n }\n });\n } else {\n promise._v = value;\n promise._s = 1;\n notify(promise, false);\n }\n } catch (e) {\n $reject.call({ _w: promise, _d: false }, e); // wrap\n }\n};\n\n// constructor polyfill\nif (!USE_NATIVE) {\n // 25.4.3.1 Promise(executor)\n $Promise = function Promise(executor) {\n anInstance(this, $Promise, PROMISE, '_h');\n aFunction(executor);\n Internal.call(this);\n try {\n executor(ctx($resolve, this, 1), ctx($reject, this, 1));\n } catch (err) {\n $reject.call(this, err);\n }\n };\n // eslint-disable-next-line no-unused-vars\n Internal = function Promise(executor) {\n this._c = []; // <- awaiting reactions\n this._a = undefined; // <- checked in isUnhandled reactions\n this._s = 0; // <- state\n this._d = false; // <- done\n this._v = undefined; // <- value\n this._h = 0; // <- rejection state, 0 - default, 1 - handled, 2 - unhandled\n this._n = false; // <- notify\n };\n Internal.prototype = require('./_redefine-all')($Promise.prototype, {\n // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected)\n then: function then(onFulfilled, onRejected) {\n var reaction = newPromiseCapability(speciesConstructor(this, $Promise));\n reaction.ok = typeof onFulfilled == 'function' ? onFulfilled : true;\n reaction.fail = typeof onRejected == 'function' && onRejected;\n reaction.domain = isNode ? process.domain : undefined;\n this._c.push(reaction);\n if (this._a) this._a.push(reaction);\n if (this._s) notify(this, false);\n return reaction.promise;\n },\n // 25.4.5.1 Promise.prototype.catch(onRejected)\n 'catch': function (onRejected) {\n return this.then(undefined, onRejected);\n }\n });\n OwnPromiseCapability = function () {\n var promise = new Internal();\n this.promise = promise;\n this.resolve = ctx($resolve, promise, 1);\n this.reject = ctx($reject, promise, 1);\n };\n newPromiseCapabilityModule.f = newPromiseCapability = function (C) {\n return C === $Promise || C === Wrapper\n ? new OwnPromiseCapability(C)\n : newGenericPromiseCapability(C);\n };\n}\n\n$export($export.G + $export.W + $export.F * !USE_NATIVE, { Promise: $Promise });\nrequire('./_set-to-string-tag')($Promise, PROMISE);\nrequire('./_set-species')(PROMISE);\nWrapper = require('./_core')[PROMISE];\n\n// statics\n$export($export.S + $export.F * !USE_NATIVE, PROMISE, {\n // 25.4.4.5 Promise.reject(r)\n reject: function reject(r) {\n var capability = newPromiseCapability(this);\n var $$reject = capability.reject;\n $$reject(r);\n return capability.promise;\n }\n});\n$export($export.S + $export.F * (LIBRARY || !USE_NATIVE), PROMISE, {\n // 25.4.4.6 Promise.resolve(x)\n resolve: function resolve(x) {\n return promiseResolve(LIBRARY && this === Wrapper ? $Promise : this, x);\n }\n});\n$export($export.S + $export.F * !(USE_NATIVE && require('./_iter-detect')(function (iter) {\n $Promise.all(iter)['catch'](empty);\n})), PROMISE, {\n // 25.4.4.1 Promise.all(iterable)\n all: function all(iterable) {\n var C = this;\n var capability = newPromiseCapability(C);\n var resolve = capability.resolve;\n var reject = capability.reject;\n var result = perform(function () {\n var values = [];\n var index = 0;\n var remaining = 1;\n forOf(iterable, false, function (promise) {\n var $index = index++;\n var alreadyCalled = false;\n values.push(undefined);\n remaining++;\n C.resolve(promise).then(function (value) {\n if (alreadyCalled) return;\n alreadyCalled = true;\n values[$index] = value;\n --remaining || resolve(values);\n }, reject);\n });\n --remaining || resolve(values);\n });\n if (result.e) reject(result.v);\n return capability.promise;\n },\n // 25.4.4.4 Promise.race(iterable)\n race: function race(iterable) {\n var C = this;\n var capability = newPromiseCapability(C);\n var reject = capability.reject;\n var result = perform(function () {\n forOf(iterable, false, function (promise) {\n C.resolve(promise).then(capability.resolve, reject);\n });\n });\n if (result.e) reject(result.v);\n return capability.promise;\n }\n});\n\n},{\"./_a-function\":62,\"./_an-instance\":65,\"./_classof\":76,\"./_core\":82,\"./_ctx\":84,\"./_export\":92,\"./_for-of\":98,\"./_global\":99,\"./_is-object\":110,\"./_iter-detect\":115,\"./_library\":118,\"./_microtask\":126,\"./_new-promise-capability\":127,\"./_perform\":146,\"./_promise-resolve\":147,\"./_redefine-all\":149,\"./_set-species\":156,\"./_set-to-string-tag\":157,\"./_species-constructor\":160,\"./_task\":169,\"./_wks\":184}],266:[function(require,module,exports){\n// 26.1.1 Reflect.apply(target, thisArgument, argumentsList)\nvar $export = require('./_export');\nvar aFunction = require('./_a-function');\nvar anObject = require('./_an-object');\nvar rApply = (require('./_global').Reflect || {}).apply;\nvar fApply = Function.apply;\n// MS Edge argumentsList argument is optional\n$export($export.S + $export.F * !require('./_fails')(function () {\n rApply(function () { /* empty */ });\n}), 'Reflect', {\n apply: function apply(target, thisArgument, argumentsList) {\n var T = aFunction(target);\n var L = anObject(argumentsList);\n return rApply ? rApply(T, thisArgument, L) : fApply.call(T, thisArgument, L);\n }\n});\n\n},{\"./_a-function\":62,\"./_an-object\":66,\"./_export\":92,\"./_fails\":94,\"./_global\":99}],267:[function(require,module,exports){\n// 26.1.2 Reflect.construct(target, argumentsList [, newTarget])\nvar $export = require('./_export');\nvar create = require('./_object-create');\nvar aFunction = require('./_a-function');\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar fails = require('./_fails');\nvar bind = require('./_bind');\nvar rConstruct = (require('./_global').Reflect || {}).construct;\n\n// MS Edge supports only 2 arguments and argumentsList argument is optional\n// FF Nightly sets third argument as `new.target`, but does not create `this` from it\nvar NEW_TARGET_BUG = fails(function () {\n function F() { /* empty */ }\n return !(rConstruct(function () { /* empty */ }, [], F) instanceof F);\n});\nvar ARGS_BUG = !fails(function () {\n rConstruct(function () { /* empty */ });\n});\n\n$export($export.S + $export.F * (NEW_TARGET_BUG || ARGS_BUG), 'Reflect', {\n construct: function construct(Target, args /* , newTarget */) {\n aFunction(Target);\n anObject(args);\n var newTarget = arguments.length < 3 ? Target : aFunction(arguments[2]);\n if (ARGS_BUG && !NEW_TARGET_BUG) return rConstruct(Target, args, newTarget);\n if (Target == newTarget) {\n // w/o altered newTarget, optimization for 0-4 arguments\n switch (args.length) {\n case 0: return new Target();\n case 1: return new Target(args[0]);\n case 2: return new Target(args[0], args[1]);\n case 3: return new Target(args[0], args[1], args[2]);\n case 4: return new Target(args[0], args[1], args[2], args[3]);\n }\n // w/o altered newTarget, lot of arguments case\n var $args = [null];\n $args.push.apply($args, args);\n return new (bind.apply(Target, $args))();\n }\n // with altered newTarget, not support built-in constructors\n var proto = newTarget.prototype;\n var instance = create(isObject(proto) ? proto : Object.prototype);\n var result = Function.apply.call(Target, instance, args);\n return isObject(result) ? result : instance;\n }\n});\n\n},{\"./_a-function\":62,\"./_an-object\":66,\"./_bind\":75,\"./_export\":92,\"./_fails\":94,\"./_global\":99,\"./_is-object\":110,\"./_object-create\":129}],268:[function(require,module,exports){\n// 26.1.3 Reflect.defineProperty(target, propertyKey, attributes)\nvar dP = require('./_object-dp');\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar toPrimitive = require('./_to-primitive');\n\n// MS Edge has broken Reflect.defineProperty - throwing instead of returning false\n$export($export.S + $export.F * require('./_fails')(function () {\n // eslint-disable-next-line no-undef\n Reflect.defineProperty(dP.f({}, 1, { value: 1 }), 1, { value: 2 });\n}), 'Reflect', {\n defineProperty: function defineProperty(target, propertyKey, attributes) {\n anObject(target);\n propertyKey = toPrimitive(propertyKey, true);\n anObject(attributes);\n try {\n dP.f(target, propertyKey, attributes);\n return true;\n } catch (e) {\n return false;\n }\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_fails\":94,\"./_object-dp\":130,\"./_to-primitive\":176}],269:[function(require,module,exports){\n// 26.1.4 Reflect.deleteProperty(target, propertyKey)\nvar $export = require('./_export');\nvar gOPD = require('./_object-gopd').f;\nvar anObject = require('./_an-object');\n\n$export($export.S, 'Reflect', {\n deleteProperty: function deleteProperty(target, propertyKey) {\n var desc = gOPD(anObject(target), propertyKey);\n return desc && !desc.configurable ? false : delete target[propertyKey];\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_object-gopd\":133}],270:[function(require,module,exports){\n'use strict';\n// 26.1.5 Reflect.enumerate(target)\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar Enumerate = function (iterated) {\n this._t = anObject(iterated); // target\n this._i = 0; // next index\n var keys = this._k = []; // keys\n var key;\n for (key in iterated) keys.push(key);\n};\nrequire('./_iter-create')(Enumerate, 'Object', function () {\n var that = this;\n var keys = that._k;\n var key;\n do {\n if (that._i >= keys.length) return { value: undefined, done: true };\n } while (!((key = keys[that._i++]) in that._t));\n return { value: key, done: false };\n});\n\n$export($export.S, 'Reflect', {\n enumerate: function enumerate(target) {\n return new Enumerate(target);\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_iter-create\":113}],271:[function(require,module,exports){\n// 26.1.7 Reflect.getOwnPropertyDescriptor(target, propertyKey)\nvar gOPD = require('./_object-gopd');\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\n\n$export($export.S, 'Reflect', {\n getOwnPropertyDescriptor: function getOwnPropertyDescriptor(target, propertyKey) {\n return gOPD.f(anObject(target), propertyKey);\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_object-gopd\":133}],272:[function(require,module,exports){\n// 26.1.8 Reflect.getPrototypeOf(target)\nvar $export = require('./_export');\nvar getProto = require('./_object-gpo');\nvar anObject = require('./_an-object');\n\n$export($export.S, 'Reflect', {\n getPrototypeOf: function getPrototypeOf(target) {\n return getProto(anObject(target));\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_object-gpo\":137}],273:[function(require,module,exports){\n// 26.1.6 Reflect.get(target, propertyKey [, receiver])\nvar gOPD = require('./_object-gopd');\nvar getPrototypeOf = require('./_object-gpo');\nvar has = require('./_has');\nvar $export = require('./_export');\nvar isObject = require('./_is-object');\nvar anObject = require('./_an-object');\n\nfunction get(target, propertyKey /* , receiver */) {\n var receiver = arguments.length < 3 ? target : arguments[2];\n var desc, proto;\n if (anObject(target) === receiver) return target[propertyKey];\n if (desc = gOPD.f(target, propertyKey)) return has(desc, 'value')\n ? desc.value\n : desc.get !== undefined\n ? desc.get.call(receiver)\n : undefined;\n if (isObject(proto = getPrototypeOf(target))) return get(proto, propertyKey, receiver);\n}\n\n$export($export.S, 'Reflect', { get: get });\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_has\":100,\"./_is-object\":110,\"./_object-gopd\":133,\"./_object-gpo\":137}],274:[function(require,module,exports){\n// 26.1.9 Reflect.has(target, propertyKey)\nvar $export = require('./_export');\n\n$export($export.S, 'Reflect', {\n has: function has(target, propertyKey) {\n return propertyKey in target;\n }\n});\n\n},{\"./_export\":92}],275:[function(require,module,exports){\n// 26.1.10 Reflect.isExtensible(target)\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar $isExtensible = Object.isExtensible;\n\n$export($export.S, 'Reflect', {\n isExtensible: function isExtensible(target) {\n anObject(target);\n return $isExtensible ? $isExtensible(target) : true;\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92}],276:[function(require,module,exports){\n// 26.1.11 Reflect.ownKeys(target)\nvar $export = require('./_export');\n\n$export($export.S, 'Reflect', { ownKeys: require('./_own-keys') });\n\n},{\"./_export\":92,\"./_own-keys\":143}],277:[function(require,module,exports){\n// 26.1.12 Reflect.preventExtensions(target)\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar $preventExtensions = Object.preventExtensions;\n\n$export($export.S, 'Reflect', {\n preventExtensions: function preventExtensions(target) {\n anObject(target);\n try {\n if ($preventExtensions) $preventExtensions(target);\n return true;\n } catch (e) {\n return false;\n }\n }\n});\n\n},{\"./_an-object\":66,\"./_export\":92}],278:[function(require,module,exports){\n// 26.1.14 Reflect.setPrototypeOf(target, proto)\nvar $export = require('./_export');\nvar setProto = require('./_set-proto');\n\nif (setProto) $export($export.S, 'Reflect', {\n setPrototypeOf: function setPrototypeOf(target, proto) {\n setProto.check(target, proto);\n try {\n setProto.set(target, proto);\n return true;\n } catch (e) {\n return false;\n }\n }\n});\n\n},{\"./_export\":92,\"./_set-proto\":155}],279:[function(require,module,exports){\n// 26.1.13 Reflect.set(target, propertyKey, V [, receiver])\nvar dP = require('./_object-dp');\nvar gOPD = require('./_object-gopd');\nvar getPrototypeOf = require('./_object-gpo');\nvar has = require('./_has');\nvar $export = require('./_export');\nvar createDesc = require('./_property-desc');\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\n\nfunction set(target, propertyKey, V /* , receiver */) {\n var receiver = arguments.length < 4 ? target : arguments[3];\n var ownDesc = gOPD.f(anObject(target), propertyKey);\n var existingDescriptor, proto;\n if (!ownDesc) {\n if (isObject(proto = getPrototypeOf(target))) {\n return set(proto, propertyKey, V, receiver);\n }\n ownDesc = createDesc(0);\n }\n if (has(ownDesc, 'value')) {\n if (ownDesc.writable === false || !isObject(receiver)) return false;\n existingDescriptor = gOPD.f(receiver, propertyKey) || createDesc(0);\n existingDescriptor.value = V;\n dP.f(receiver, propertyKey, existingDescriptor);\n return true;\n }\n return ownDesc.set === undefined ? false : (ownDesc.set.call(receiver, V), true);\n}\n\n$export($export.S, 'Reflect', { set: set });\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_has\":100,\"./_is-object\":110,\"./_object-dp\":130,\"./_object-gopd\":133,\"./_object-gpo\":137,\"./_property-desc\":148}],280:[function(require,module,exports){\nvar global = require('./_global');\nvar inheritIfRequired = require('./_inherit-if-required');\nvar dP = require('./_object-dp').f;\nvar gOPN = require('./_object-gopn').f;\nvar isRegExp = require('./_is-regexp');\nvar $flags = require('./_flags');\nvar $RegExp = global.RegExp;\nvar Base = $RegExp;\nvar proto = $RegExp.prototype;\nvar re1 = /a/g;\nvar re2 = /a/g;\n// \"new\" creates a new object, old webkit buggy here\nvar CORRECT_NEW = new $RegExp(re1) !== re1;\n\nif (require('./_descriptors') && (!CORRECT_NEW || require('./_fails')(function () {\n re2[require('./_wks')('match')] = false;\n // RegExp constructor can alter flags and IsRegExp works correct with @@match\n return $RegExp(re1) != re1 || $RegExp(re2) == re2 || $RegExp(re1, 'i') != '/a/i';\n}))) {\n $RegExp = function RegExp(p, f) {\n var tiRE = this instanceof $RegExp;\n var piRE = isRegExp(p);\n var fiU = f === undefined;\n return !tiRE && piRE && p.constructor === $RegExp && fiU ? p\n : inheritIfRequired(CORRECT_NEW\n ? new Base(piRE && !fiU ? p.source : p, f)\n : Base((piRE = p instanceof $RegExp) ? p.source : p, piRE && fiU ? $flags.call(p) : f)\n , tiRE ? this : proto, $RegExp);\n };\n var proxy = function (key) {\n key in $RegExp || dP($RegExp, key, {\n configurable: true,\n get: function () { return Base[key]; },\n set: function (it) { Base[key] = it; }\n });\n };\n for (var keys = gOPN(Base), i = 0; keys.length > i;) proxy(keys[i++]);\n proto.constructor = $RegExp;\n $RegExp.prototype = proto;\n require('./_redefine')(global, 'RegExp', $RegExp);\n}\n\nrequire('./_set-species')('RegExp');\n\n},{\"./_descriptors\":88,\"./_fails\":94,\"./_flags\":96,\"./_global\":99,\"./_inherit-if-required\":104,\"./_is-regexp\":111,\"./_object-dp\":130,\"./_object-gopn\":135,\"./_redefine\":150,\"./_set-species\":156,\"./_wks\":184}],281:[function(require,module,exports){\n// 21.2.5.3 get RegExp.prototype.flags()\nif (require('./_descriptors') && /./g.flags != 'g') require('./_object-dp').f(RegExp.prototype, 'flags', {\n configurable: true,\n get: require('./_flags')\n});\n\n},{\"./_descriptors\":88,\"./_flags\":96,\"./_object-dp\":130}],282:[function(require,module,exports){\n// @@match logic\nrequire('./_fix-re-wks')('match', 1, function (defined, MATCH, $match) {\n // 21.1.3.11 String.prototype.match(regexp)\n return [function match(regexp) {\n 'use strict';\n var O = defined(this);\n var fn = regexp == undefined ? undefined : regexp[MATCH];\n return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[MATCH](String(O));\n }, $match];\n});\n\n},{\"./_fix-re-wks\":95}],283:[function(require,module,exports){\n// @@replace logic\nrequire('./_fix-re-wks')('replace', 2, function (defined, REPLACE, $replace) {\n // 21.1.3.14 String.prototype.replace(searchValue, replaceValue)\n return [function replace(searchValue, replaceValue) {\n 'use strict';\n var O = defined(this);\n var fn = searchValue == undefined ? undefined : searchValue[REPLACE];\n return fn !== undefined\n ? fn.call(searchValue, O, replaceValue)\n : $replace.call(String(O), searchValue, replaceValue);\n }, $replace];\n});\n\n},{\"./_fix-re-wks\":95}],284:[function(require,module,exports){\n// @@search logic\nrequire('./_fix-re-wks')('search', 1, function (defined, SEARCH, $search) {\n // 21.1.3.15 String.prototype.search(regexp)\n return [function search(regexp) {\n 'use strict';\n var O = defined(this);\n var fn = regexp == undefined ? undefined : regexp[SEARCH];\n return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[SEARCH](String(O));\n }, $search];\n});\n\n},{\"./_fix-re-wks\":95}],285:[function(require,module,exports){\n// @@split logic\nrequire('./_fix-re-wks')('split', 2, function (defined, SPLIT, $split) {\n 'use strict';\n var isRegExp = require('./_is-regexp');\n var _split = $split;\n var $push = [].push;\n var $SPLIT = 'split';\n var LENGTH = 'length';\n var LAST_INDEX = 'lastIndex';\n if (\n 'abbc'[$SPLIT](/(b)*/)[1] == 'c' ||\n 'test'[$SPLIT](/(?:)/, -1)[LENGTH] != 4 ||\n 'ab'[$SPLIT](/(?:ab)*/)[LENGTH] != 2 ||\n '.'[$SPLIT](/(.?)(.?)/)[LENGTH] != 4 ||\n '.'[$SPLIT](/()()/)[LENGTH] > 1 ||\n ''[$SPLIT](/.?/)[LENGTH]\n ) {\n var NPCG = /()??/.exec('')[1] === undefined; // nonparticipating capturing group\n // based on es5-shim implementation, need to rework it\n $split = function (separator, limit) {\n var string = String(this);\n if (separator === undefined && limit === 0) return [];\n // If `separator` is not a regex, use native split\n if (!isRegExp(separator)) return _split.call(string, separator, limit);\n var output = [];\n var flags = (separator.ignoreCase ? 'i' : '') +\n (separator.multiline ? 'm' : '') +\n (separator.unicode ? 'u' : '') +\n (separator.sticky ? 'y' : '');\n var lastLastIndex = 0;\n var splitLimit = limit === undefined ? 4294967295 : limit >>> 0;\n // Make `global` and avoid `lastIndex` issues by working with a copy\n var separatorCopy = new RegExp(separator.source, flags + 'g');\n var separator2, match, lastIndex, lastLength, i;\n // Doesn't need flags gy, but they don't hurt\n if (!NPCG) separator2 = new RegExp('^' + separatorCopy.source + '$(?!\\\\s)', flags);\n while (match = separatorCopy.exec(string)) {\n // `separatorCopy.lastIndex` is not reliable cross-browser\n lastIndex = match.index + match[0][LENGTH];\n if (lastIndex > lastLastIndex) {\n output.push(string.slice(lastLastIndex, match.index));\n // Fix browsers whose `exec` methods don't consistently return `undefined` for NPCG\n // eslint-disable-next-line no-loop-func\n if (!NPCG && match[LENGTH] > 1) match[0].replace(separator2, function () {\n for (i = 1; i < arguments[LENGTH] - 2; i++) if (arguments[i] === undefined) match[i] = undefined;\n });\n if (match[LENGTH] > 1 && match.index < string[LENGTH]) $push.apply(output, match.slice(1));\n lastLength = match[0][LENGTH];\n lastLastIndex = lastIndex;\n if (output[LENGTH] >= splitLimit) break;\n }\n if (separatorCopy[LAST_INDEX] === match.index) separatorCopy[LAST_INDEX]++; // Avoid an infinite loop\n }\n if (lastLastIndex === string[LENGTH]) {\n if (lastLength || !separatorCopy.test('')) output.push('');\n } else output.push(string.slice(lastLastIndex));\n return output[LENGTH] > splitLimit ? output.slice(0, splitLimit) : output;\n };\n // Chakra, V8\n } else if ('0'[$SPLIT](undefined, 0)[LENGTH]) {\n $split = function (separator, limit) {\n return separator === undefined && limit === 0 ? [] : _split.call(this, separator, limit);\n };\n }\n // 21.1.3.17 String.prototype.split(separator, limit)\n return [function split(separator, limit) {\n var O = defined(this);\n var fn = separator == undefined ? undefined : separator[SPLIT];\n return fn !== undefined ? fn.call(separator, O, limit) : $split.call(String(O), separator, limit);\n }, $split];\n});\n\n},{\"./_fix-re-wks\":95,\"./_is-regexp\":111}],286:[function(require,module,exports){\n'use strict';\nrequire('./es6.regexp.flags');\nvar anObject = require('./_an-object');\nvar $flags = require('./_flags');\nvar DESCRIPTORS = require('./_descriptors');\nvar TO_STRING = 'toString';\nvar $toString = /./[TO_STRING];\n\nvar define = function (fn) {\n require('./_redefine')(RegExp.prototype, TO_STRING, fn, true);\n};\n\n// 21.2.5.14 RegExp.prototype.toString()\nif (require('./_fails')(function () { return $toString.call({ source: 'a', flags: 'b' }) != '/a/b'; })) {\n define(function toString() {\n var R = anObject(this);\n return '/'.concat(R.source, '/',\n 'flags' in R ? R.flags : !DESCRIPTORS && R instanceof RegExp ? $flags.call(R) : undefined);\n });\n// FF44- RegExp#toString has a wrong name\n} else if ($toString.name != TO_STRING) {\n define(function toString() {\n return $toString.call(this);\n });\n}\n\n},{\"./_an-object\":66,\"./_descriptors\":88,\"./_fails\":94,\"./_flags\":96,\"./_redefine\":150,\"./es6.regexp.flags\":281}],287:[function(require,module,exports){\n'use strict';\nvar strong = require('./_collection-strong');\nvar validate = require('./_validate-collection');\nvar SET = 'Set';\n\n// 23.2 Set Objects\nmodule.exports = require('./_collection')(SET, function (get) {\n return function Set() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\n}, {\n // 23.2.3.1 Set.prototype.add(value)\n add: function add(value) {\n return strong.def(validate(this, SET), value = value === 0 ? 0 : value, value);\n }\n}, strong);\n\n},{\"./_collection\":81,\"./_collection-strong\":78,\"./_validate-collection\":181}],288:[function(require,module,exports){\n'use strict';\n// B.2.3.2 String.prototype.anchor(name)\nrequire('./_string-html')('anchor', function (createHTML) {\n return function anchor(name) {\n return createHTML(this, 'a', 'name', name);\n };\n});\n\n},{\"./_string-html\":164}],289:[function(require,module,exports){\n'use strict';\n// B.2.3.3 String.prototype.big()\nrequire('./_string-html')('big', function (createHTML) {\n return function big() {\n return createHTML(this, 'big', '', '');\n };\n});\n\n},{\"./_string-html\":164}],290:[function(require,module,exports){\n'use strict';\n// B.2.3.4 String.prototype.blink()\nrequire('./_string-html')('blink', function (createHTML) {\n return function blink() {\n return createHTML(this, 'blink', '', '');\n };\n});\n\n},{\"./_string-html\":164}],291:[function(require,module,exports){\n'use strict';\n// B.2.3.5 String.prototype.bold()\nrequire('./_string-html')('bold', function (createHTML) {\n return function bold() {\n return createHTML(this, 'b', '', '');\n };\n});\n\n},{\"./_string-html\":164}],292:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $at = require('./_string-at')(false);\n$export($export.P, 'String', {\n // 21.1.3.3 String.prototype.codePointAt(pos)\n codePointAt: function codePointAt(pos) {\n return $at(this, pos);\n }\n});\n\n},{\"./_export\":92,\"./_string-at\":162}],293:[function(require,module,exports){\n// 21.1.3.6 String.prototype.endsWith(searchString [, endPosition])\n'use strict';\nvar $export = require('./_export');\nvar toLength = require('./_to-length');\nvar context = require('./_string-context');\nvar ENDS_WITH = 'endsWith';\nvar $endsWith = ''[ENDS_WITH];\n\n$export($export.P + $export.F * require('./_fails-is-regexp')(ENDS_WITH), 'String', {\n endsWith: function endsWith(searchString /* , endPosition = @length */) {\n var that = context(this, searchString, ENDS_WITH);\n var endPosition = arguments.length > 1 ? arguments[1] : undefined;\n var len = toLength(that.length);\n var end = endPosition === undefined ? len : Math.min(toLength(endPosition), len);\n var search = String(searchString);\n return $endsWith\n ? $endsWith.call(that, search, end)\n : that.slice(end - search.length, end) === search;\n }\n});\n\n},{\"./_export\":92,\"./_fails-is-regexp\":93,\"./_string-context\":163,\"./_to-length\":174}],294:[function(require,module,exports){\n'use strict';\n// B.2.3.6 String.prototype.fixed()\nrequire('./_string-html')('fixed', function (createHTML) {\n return function fixed() {\n return createHTML(this, 'tt', '', '');\n };\n});\n\n},{\"./_string-html\":164}],295:[function(require,module,exports){\n'use strict';\n// B.2.3.7 String.prototype.fontcolor(color)\nrequire('./_string-html')('fontcolor', function (createHTML) {\n return function fontcolor(color) {\n return createHTML(this, 'font', 'color', color);\n };\n});\n\n},{\"./_string-html\":164}],296:[function(require,module,exports){\n'use strict';\n// B.2.3.8 String.prototype.fontsize(size)\nrequire('./_string-html')('fontsize', function (createHTML) {\n return function fontsize(size) {\n return createHTML(this, 'font', 'size', size);\n };\n});\n\n},{\"./_string-html\":164}],297:[function(require,module,exports){\nvar $export = require('./_export');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar fromCharCode = String.fromCharCode;\nvar $fromCodePoint = String.fromCodePoint;\n\n// length should be 1, old FF problem\n$export($export.S + $export.F * (!!$fromCodePoint && $fromCodePoint.length != 1), 'String', {\n // 21.1.2.2 String.fromCodePoint(...codePoints)\n fromCodePoint: function fromCodePoint(x) { // eslint-disable-line no-unused-vars\n var res = [];\n var aLen = arguments.length;\n var i = 0;\n var code;\n while (aLen > i) {\n code = +arguments[i++];\n if (toAbsoluteIndex(code, 0x10ffff) !== code) throw RangeError(code + ' is not a valid code point');\n res.push(code < 0x10000\n ? fromCharCode(code)\n : fromCharCode(((code -= 0x10000) >> 10) + 0xd800, code % 0x400 + 0xdc00)\n );\n } return res.join('');\n }\n});\n\n},{\"./_export\":92,\"./_to-absolute-index\":170}],298:[function(require,module,exports){\n// 21.1.3.7 String.prototype.includes(searchString, position = 0)\n'use strict';\nvar $export = require('./_export');\nvar context = require('./_string-context');\nvar INCLUDES = 'includes';\n\n$export($export.P + $export.F * require('./_fails-is-regexp')(INCLUDES), 'String', {\n includes: function includes(searchString /* , position = 0 */) {\n return !!~context(this, searchString, INCLUDES)\n .indexOf(searchString, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\n\n},{\"./_export\":92,\"./_fails-is-regexp\":93,\"./_string-context\":163}],299:[function(require,module,exports){\n'use strict';\n// B.2.3.9 String.prototype.italics()\nrequire('./_string-html')('italics', function (createHTML) {\n return function italics() {\n return createHTML(this, 'i', '', '');\n };\n});\n\n},{\"./_string-html\":164}],300:[function(require,module,exports){\n'use strict';\nvar $at = require('./_string-at')(true);\n\n// 21.1.3.27 String.prototype[@@iterator]()\nrequire('./_iter-define')(String, 'String', function (iterated) {\n this._t = String(iterated); // target\n this._i = 0; // next index\n// 21.1.5.2.1 %StringIteratorPrototype%.next()\n}, function () {\n var O = this._t;\n var index = this._i;\n var point;\n if (index >= O.length) return { value: undefined, done: true };\n point = $at(O, index);\n this._i += point.length;\n return { value: point, done: false };\n});\n\n},{\"./_iter-define\":114,\"./_string-at\":162}],301:[function(require,module,exports){\n'use strict';\n// B.2.3.10 String.prototype.link(url)\nrequire('./_string-html')('link', function (createHTML) {\n return function link(url) {\n return createHTML(this, 'a', 'href', url);\n };\n});\n\n},{\"./_string-html\":164}],302:[function(require,module,exports){\nvar $export = require('./_export');\nvar toIObject = require('./_to-iobject');\nvar toLength = require('./_to-length');\n\n$export($export.S, 'String', {\n // 21.1.2.4 String.raw(callSite, ...substitutions)\n raw: function raw(callSite) {\n var tpl = toIObject(callSite.raw);\n var len = toLength(tpl.length);\n var aLen = arguments.length;\n var res = [];\n var i = 0;\n while (len > i) {\n res.push(String(tpl[i++]));\n if (i < aLen) res.push(String(arguments[i]));\n } return res.join('');\n }\n});\n\n},{\"./_export\":92,\"./_to-iobject\":173,\"./_to-length\":174}],303:[function(require,module,exports){\nvar $export = require('./_export');\n\n$export($export.P, 'String', {\n // 21.1.3.13 String.prototype.repeat(count)\n repeat: require('./_string-repeat')\n});\n\n},{\"./_export\":92,\"./_string-repeat\":166}],304:[function(require,module,exports){\n'use strict';\n// B.2.3.11 String.prototype.small()\nrequire('./_string-html')('small', function (createHTML) {\n return function small() {\n return createHTML(this, 'small', '', '');\n };\n});\n\n},{\"./_string-html\":164}],305:[function(require,module,exports){\n// 21.1.3.18 String.prototype.startsWith(searchString [, position ])\n'use strict';\nvar $export = require('./_export');\nvar toLength = require('./_to-length');\nvar context = require('./_string-context');\nvar STARTS_WITH = 'startsWith';\nvar $startsWith = ''[STARTS_WITH];\n\n$export($export.P + $export.F * require('./_fails-is-regexp')(STARTS_WITH), 'String', {\n startsWith: function startsWith(searchString /* , position = 0 */) {\n var that = context(this, searchString, STARTS_WITH);\n var index = toLength(Math.min(arguments.length > 1 ? arguments[1] : undefined, that.length));\n var search = String(searchString);\n return $startsWith\n ? $startsWith.call(that, search, index)\n : that.slice(index, index + search.length) === search;\n }\n});\n\n},{\"./_export\":92,\"./_fails-is-regexp\":93,\"./_string-context\":163,\"./_to-length\":174}],306:[function(require,module,exports){\n'use strict';\n// B.2.3.12 String.prototype.strike()\nrequire('./_string-html')('strike', function (createHTML) {\n return function strike() {\n return createHTML(this, 'strike', '', '');\n };\n});\n\n},{\"./_string-html\":164}],307:[function(require,module,exports){\n'use strict';\n// B.2.3.13 String.prototype.sub()\nrequire('./_string-html')('sub', function (createHTML) {\n return function sub() {\n return createHTML(this, 'sub', '', '');\n };\n});\n\n},{\"./_string-html\":164}],308:[function(require,module,exports){\n'use strict';\n// B.2.3.14 String.prototype.sup()\nrequire('./_string-html')('sup', function (createHTML) {\n return function sup() {\n return createHTML(this, 'sup', '', '');\n };\n});\n\n},{\"./_string-html\":164}],309:[function(require,module,exports){\n'use strict';\n// 21.1.3.25 String.prototype.trim()\nrequire('./_string-trim')('trim', function ($trim) {\n return function trim() {\n return $trim(this, 3);\n };\n});\n\n},{\"./_string-trim\":167}],310:[function(require,module,exports){\n'use strict';\n// ECMAScript 6 symbols shim\nvar global = require('./_global');\nvar has = require('./_has');\nvar DESCRIPTORS = require('./_descriptors');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar META = require('./_meta').KEY;\nvar $fails = require('./_fails');\nvar shared = require('./_shared');\nvar setToStringTag = require('./_set-to-string-tag');\nvar uid = require('./_uid');\nvar wks = require('./_wks');\nvar wksExt = require('./_wks-ext');\nvar wksDefine = require('./_wks-define');\nvar enumKeys = require('./_enum-keys');\nvar isArray = require('./_is-array');\nvar anObject = require('./_an-object');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar createDesc = require('./_property-desc');\nvar _create = require('./_object-create');\nvar gOPNExt = require('./_object-gopn-ext');\nvar $GOPD = require('./_object-gopd');\nvar $DP = require('./_object-dp');\nvar $keys = require('./_object-keys');\nvar gOPD = $GOPD.f;\nvar dP = $DP.f;\nvar gOPN = gOPNExt.f;\nvar $Symbol = global.Symbol;\nvar $JSON = global.JSON;\nvar _stringify = $JSON && $JSON.stringify;\nvar PROTOTYPE = 'prototype';\nvar HIDDEN = wks('_hidden');\nvar TO_PRIMITIVE = wks('toPrimitive');\nvar isEnum = {}.propertyIsEnumerable;\nvar SymbolRegistry = shared('symbol-registry');\nvar AllSymbols = shared('symbols');\nvar OPSymbols = shared('op-symbols');\nvar ObjectProto = Object[PROTOTYPE];\nvar USE_NATIVE = typeof $Symbol == 'function';\nvar QObject = global.QObject;\n// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\nvar setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\n\n// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\nvar setSymbolDesc = DESCRIPTORS && $fails(function () {\n return _create(dP({}, 'a', {\n get: function () { return dP(this, 'a', { value: 7 }).a; }\n })).a != 7;\n}) ? function (it, key, D) {\n var protoDesc = gOPD(ObjectProto, key);\n if (protoDesc) delete ObjectProto[key];\n dP(it, key, D);\n if (protoDesc && it !== ObjectProto) dP(ObjectProto, key, protoDesc);\n} : dP;\n\nvar wrap = function (tag) {\n var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]);\n sym._k = tag;\n return sym;\n};\n\nvar isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function (it) {\n return typeof it == 'symbol';\n} : function (it) {\n return it instanceof $Symbol;\n};\n\nvar $defineProperty = function defineProperty(it, key, D) {\n if (it === ObjectProto) $defineProperty(OPSymbols, key, D);\n anObject(it);\n key = toPrimitive(key, true);\n anObject(D);\n if (has(AllSymbols, key)) {\n if (!D.enumerable) {\n if (!has(it, HIDDEN)) dP(it, HIDDEN, createDesc(1, {}));\n it[HIDDEN][key] = true;\n } else {\n if (has(it, HIDDEN) && it[HIDDEN][key]) it[HIDDEN][key] = false;\n D = _create(D, { enumerable: createDesc(0, false) });\n } return setSymbolDesc(it, key, D);\n } return dP(it, key, D);\n};\nvar $defineProperties = function defineProperties(it, P) {\n anObject(it);\n var keys = enumKeys(P = toIObject(P));\n var i = 0;\n var l = keys.length;\n var key;\n while (l > i) $defineProperty(it, key = keys[i++], P[key]);\n return it;\n};\nvar $create = function create(it, P) {\n return P === undefined ? _create(it) : $defineProperties(_create(it), P);\n};\nvar $propertyIsEnumerable = function propertyIsEnumerable(key) {\n var E = isEnum.call(this, key = toPrimitive(key, true));\n if (this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return false;\n return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true;\n};\nvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key) {\n it = toIObject(it);\n key = toPrimitive(key, true);\n if (it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return;\n var D = gOPD(it, key);\n if (D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key])) D.enumerable = true;\n return D;\n};\nvar $getOwnPropertyNames = function getOwnPropertyNames(it) {\n var names = gOPN(toIObject(it));\n var result = [];\n var i = 0;\n var key;\n while (names.length > i) {\n if (!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META) result.push(key);\n } return result;\n};\nvar $getOwnPropertySymbols = function getOwnPropertySymbols(it) {\n var IS_OP = it === ObjectProto;\n var names = gOPN(IS_OP ? OPSymbols : toIObject(it));\n var result = [];\n var i = 0;\n var key;\n while (names.length > i) {\n if (has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true)) result.push(AllSymbols[key]);\n } return result;\n};\n\n// 19.4.1.1 Symbol([description])\nif (!USE_NATIVE) {\n $Symbol = function Symbol() {\n if (this instanceof $Symbol) throw TypeError('Symbol is not a constructor!');\n var tag = uid(arguments.length > 0 ? arguments[0] : undefined);\n var $set = function (value) {\n if (this === ObjectProto) $set.call(OPSymbols, value);\n if (has(this, HIDDEN) && has(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\n setSymbolDesc(this, tag, createDesc(1, value));\n };\n if (DESCRIPTORS && setter) setSymbolDesc(ObjectProto, tag, { configurable: true, set: $set });\n return wrap(tag);\n };\n redefine($Symbol[PROTOTYPE], 'toString', function toString() {\n return this._k;\n });\n\n $GOPD.f = $getOwnPropertyDescriptor;\n $DP.f = $defineProperty;\n require('./_object-gopn').f = gOPNExt.f = $getOwnPropertyNames;\n require('./_object-pie').f = $propertyIsEnumerable;\n require('./_object-gops').f = $getOwnPropertySymbols;\n\n if (DESCRIPTORS && !require('./_library')) {\n redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true);\n }\n\n wksExt.f = function (name) {\n return wrap(wks(name));\n };\n}\n\n$export($export.G + $export.W + $export.F * !USE_NATIVE, { Symbol: $Symbol });\n\nfor (var es6Symbols = (\n // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14\n 'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables'\n).split(','), j = 0; es6Symbols.length > j;)wks(es6Symbols[j++]);\n\nfor (var wellKnownSymbols = $keys(wks.store), k = 0; wellKnownSymbols.length > k;) wksDefine(wellKnownSymbols[k++]);\n\n$export($export.S + $export.F * !USE_NATIVE, 'Symbol', {\n // 19.4.2.1 Symbol.for(key)\n 'for': function (key) {\n return has(SymbolRegistry, key += '')\n ? SymbolRegistry[key]\n : SymbolRegistry[key] = $Symbol(key);\n },\n // 19.4.2.5 Symbol.keyFor(sym)\n keyFor: function keyFor(sym) {\n if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol!');\n for (var key in SymbolRegistry) if (SymbolRegistry[key] === sym) return key;\n },\n useSetter: function () { setter = true; },\n useSimple: function () { setter = false; }\n});\n\n$export($export.S + $export.F * !USE_NATIVE, 'Object', {\n // 19.1.2.2 Object.create(O [, Properties])\n create: $create,\n // 19.1.2.4 Object.defineProperty(O, P, Attributes)\n defineProperty: $defineProperty,\n // 19.1.2.3 Object.defineProperties(O, Properties)\n defineProperties: $defineProperties,\n // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\n getOwnPropertyDescriptor: $getOwnPropertyDescriptor,\n // 19.1.2.7 Object.getOwnPropertyNames(O)\n getOwnPropertyNames: $getOwnPropertyNames,\n // 19.1.2.8 Object.getOwnPropertySymbols(O)\n getOwnPropertySymbols: $getOwnPropertySymbols\n});\n\n// 24.3.2 JSON.stringify(value [, replacer [, space]])\n$JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function () {\n var S = $Symbol();\n // MS Edge converts symbol values to JSON as {}\n // WebKit converts symbol values to JSON as null\n // V8 throws on boxed symbols\n return _stringify([S]) != '[null]' || _stringify({ a: S }) != '{}' || _stringify(Object(S)) != '{}';\n})), 'JSON', {\n stringify: function stringify(it) {\n if (it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\n var args = [it];\n var i = 1;\n var replacer, $replacer;\n while (arguments.length > i) args.push(arguments[i++]);\n replacer = args[1];\n if (typeof replacer == 'function') $replacer = replacer;\n if ($replacer || !isArray(replacer)) replacer = function (key, value) {\n if ($replacer) value = $replacer.call(this, key, value);\n if (!isSymbol(value)) return value;\n };\n args[1] = replacer;\n return _stringify.apply($JSON, args);\n }\n});\n\n// 19.4.3.4 Symbol.prototype[@@toPrimitive](hint)\n$Symbol[PROTOTYPE][TO_PRIMITIVE] || require('./_hide')($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);\n// 19.4.3.5 Symbol.prototype[@@toStringTag]\nsetToStringTag($Symbol, 'Symbol');\n// 20.2.1.9 Math[@@toStringTag]\nsetToStringTag(Math, 'Math', true);\n// 24.3.3 JSON[@@toStringTag]\nsetToStringTag(global.JSON, 'JSON', true);\n\n},{\"./_an-object\":66,\"./_descriptors\":88,\"./_enum-keys\":91,\"./_export\":92,\"./_fails\":94,\"./_global\":99,\"./_has\":100,\"./_hide\":101,\"./_is-array\":108,\"./_library\":118,\"./_meta\":124,\"./_object-create\":129,\"./_object-dp\":130,\"./_object-gopd\":133,\"./_object-gopn\":135,\"./_object-gopn-ext\":134,\"./_object-gops\":136,\"./_object-keys\":139,\"./_object-pie\":140,\"./_property-desc\":148,\"./_redefine\":150,\"./_set-to-string-tag\":157,\"./_shared\":159,\"./_to-iobject\":173,\"./_to-primitive\":176,\"./_uid\":180,\"./_wks\":184,\"./_wks-define\":182,\"./_wks-ext\":183}],311:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar $typed = require('./_typed');\nvar buffer = require('./_typed-buffer');\nvar anObject = require('./_an-object');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\nvar isObject = require('./_is-object');\nvar ArrayBuffer = require('./_global').ArrayBuffer;\nvar speciesConstructor = require('./_species-constructor');\nvar $ArrayBuffer = buffer.ArrayBuffer;\nvar $DataView = buffer.DataView;\nvar $isView = $typed.ABV && ArrayBuffer.isView;\nvar $slice = $ArrayBuffer.prototype.slice;\nvar VIEW = $typed.VIEW;\nvar ARRAY_BUFFER = 'ArrayBuffer';\n\n$export($export.G + $export.W + $export.F * (ArrayBuffer !== $ArrayBuffer), { ArrayBuffer: $ArrayBuffer });\n\n$export($export.S + $export.F * !$typed.CONSTR, ARRAY_BUFFER, {\n // 24.1.3.1 ArrayBuffer.isView(arg)\n isView: function isView(it) {\n return $isView && $isView(it) || isObject(it) && VIEW in it;\n }\n});\n\n$export($export.P + $export.U + $export.F * require('./_fails')(function () {\n return !new $ArrayBuffer(2).slice(1, undefined).byteLength;\n}), ARRAY_BUFFER, {\n // 24.1.4.3 ArrayBuffer.prototype.slice(start, end)\n slice: function slice(start, end) {\n if ($slice !== undefined && end === undefined) return $slice.call(anObject(this), start); // FF fix\n var len = anObject(this).byteLength;\n var first = toAbsoluteIndex(start, len);\n var final = toAbsoluteIndex(end === undefined ? len : end, len);\n var result = new (speciesConstructor(this, $ArrayBuffer))(toLength(final - first));\n var viewS = new $DataView(this);\n var viewT = new $DataView(result);\n var index = 0;\n while (first < final) {\n viewT.setUint8(index++, viewS.getUint8(first++));\n } return result;\n }\n});\n\nrequire('./_set-species')(ARRAY_BUFFER);\n\n},{\"./_an-object\":66,\"./_export\":92,\"./_fails\":94,\"./_global\":99,\"./_is-object\":110,\"./_set-species\":156,\"./_species-constructor\":160,\"./_to-absolute-index\":170,\"./_to-length\":174,\"./_typed\":179,\"./_typed-buffer\":178}],312:[function(require,module,exports){\nvar $export = require('./_export');\n$export($export.G + $export.W + $export.F * !require('./_typed').ABV, {\n DataView: require('./_typed-buffer').DataView\n});\n\n},{\"./_export\":92,\"./_typed\":179,\"./_typed-buffer\":178}],313:[function(require,module,exports){\nrequire('./_typed-array')('Float32', 4, function (init) {\n return function Float32Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],314:[function(require,module,exports){\nrequire('./_typed-array')('Float64', 8, function (init) {\n return function Float64Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],315:[function(require,module,exports){\nrequire('./_typed-array')('Int16', 2, function (init) {\n return function Int16Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],316:[function(require,module,exports){\nrequire('./_typed-array')('Int32', 4, function (init) {\n return function Int32Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],317:[function(require,module,exports){\nrequire('./_typed-array')('Int8', 1, function (init) {\n return function Int8Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],318:[function(require,module,exports){\nrequire('./_typed-array')('Uint16', 2, function (init) {\n return function Uint16Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],319:[function(require,module,exports){\nrequire('./_typed-array')('Uint32', 4, function (init) {\n return function Uint32Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],320:[function(require,module,exports){\nrequire('./_typed-array')('Uint8', 1, function (init) {\n return function Uint8Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n\n},{\"./_typed-array\":177}],321:[function(require,module,exports){\nrequire('./_typed-array')('Uint8', 1, function (init) {\n return function Uint8ClampedArray(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n}, true);\n\n},{\"./_typed-array\":177}],322:[function(require,module,exports){\n'use strict';\nvar each = require('./_array-methods')(0);\nvar redefine = require('./_redefine');\nvar meta = require('./_meta');\nvar assign = require('./_object-assign');\nvar weak = require('./_collection-weak');\nvar isObject = require('./_is-object');\nvar fails = require('./_fails');\nvar validate = require('./_validate-collection');\nvar WEAK_MAP = 'WeakMap';\nvar getWeak = meta.getWeak;\nvar isExtensible = Object.isExtensible;\nvar uncaughtFrozenStore = weak.ufstore;\nvar tmp = {};\nvar InternalMap;\n\nvar wrapper = function (get) {\n return function WeakMap() {\n return get(this, arguments.length > 0 ? arguments[0] : undefined);\n };\n};\n\nvar methods = {\n // 23.3.3.3 WeakMap.prototype.get(key)\n get: function get(key) {\n if (isObject(key)) {\n var data = getWeak(key);\n if (data === true) return uncaughtFrozenStore(validate(this, WEAK_MAP)).get(key);\n return data ? data[this._i] : undefined;\n }\n },\n // 23.3.3.5 WeakMap.prototype.set(key, value)\n set: function set(key, value) {\n return weak.def(validate(this, WEAK_MAP), key, value);\n }\n};\n\n// 23.3 WeakMap Objects\nvar $WeakMap = module.exports = require('./_collection')(WEAK_MAP, wrapper, methods, weak, true, true);\n\n// IE11 WeakMap frozen keys fix\nif (fails(function () { return new $WeakMap().set((Object.freeze || Object)(tmp), 7).get(tmp) != 7; })) {\n InternalMap = weak.getConstructor(wrapper, WEAK_MAP);\n assign(InternalMap.prototype, methods);\n meta.NEED = true;\n each(['delete', 'has', 'get', 'set'], function (key) {\n var proto = $WeakMap.prototype;\n var method = proto[key];\n redefine(proto, key, function (a, b) {\n // store frozen objects on internal weakmap shim\n if (isObject(a) && !isExtensible(a)) {\n if (!this._f) this._f = new InternalMap();\n var result = this._f[key](a, b);\n return key == 'set' ? this : result;\n // store all the rest on native weakmap\n } return method.call(this, a, b);\n });\n });\n}\n\n},{\"./_array-methods\":71,\"./_collection\":81,\"./_collection-weak\":80,\"./_fails\":94,\"./_is-object\":110,\"./_meta\":124,\"./_object-assign\":128,\"./_redefine\":150,\"./_validate-collection\":181}],323:[function(require,module,exports){\n'use strict';\nvar weak = require('./_collection-weak');\nvar validate = require('./_validate-collection');\nvar WEAK_SET = 'WeakSet';\n\n// 23.4 WeakSet Objects\nrequire('./_collection')(WEAK_SET, function (get) {\n return function WeakSet() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\n}, {\n // 23.4.3.1 WeakSet.prototype.add(value)\n add: function add(value) {\n return weak.def(validate(this, WEAK_SET), value, true);\n }\n}, weak, false, true);\n\n},{\"./_collection\":81,\"./_collection-weak\":80,\"./_validate-collection\":181}],324:[function(require,module,exports){\n'use strict';\n// https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatMap\nvar $export = require('./_export');\nvar flattenIntoArray = require('./_flatten-into-array');\nvar toObject = require('./_to-object');\nvar toLength = require('./_to-length');\nvar aFunction = require('./_a-function');\nvar arraySpeciesCreate = require('./_array-species-create');\n\n$export($export.P, 'Array', {\n flatMap: function flatMap(callbackfn /* , thisArg */) {\n var O = toObject(this);\n var sourceLen, A;\n aFunction(callbackfn);\n sourceLen = toLength(O.length);\n A = arraySpeciesCreate(O, 0);\n flattenIntoArray(A, O, O, sourceLen, 0, 1, callbackfn, arguments[1]);\n return A;\n }\n});\n\nrequire('./_add-to-unscopables')('flatMap');\n\n},{\"./_a-function\":62,\"./_add-to-unscopables\":64,\"./_array-species-create\":74,\"./_export\":92,\"./_flatten-into-array\":97,\"./_to-length\":174,\"./_to-object\":175}],325:[function(require,module,exports){\n'use strict';\n// https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatten\nvar $export = require('./_export');\nvar flattenIntoArray = require('./_flatten-into-array');\nvar toObject = require('./_to-object');\nvar toLength = require('./_to-length');\nvar toInteger = require('./_to-integer');\nvar arraySpeciesCreate = require('./_array-species-create');\n\n$export($export.P, 'Array', {\n flatten: function flatten(/* depthArg = 1 */) {\n var depthArg = arguments[0];\n var O = toObject(this);\n var sourceLen = toLength(O.length);\n var A = arraySpeciesCreate(O, 0);\n flattenIntoArray(A, O, O, sourceLen, 0, depthArg === undefined ? 1 : toInteger(depthArg));\n return A;\n }\n});\n\nrequire('./_add-to-unscopables')('flatten');\n\n},{\"./_add-to-unscopables\":64,\"./_array-species-create\":74,\"./_export\":92,\"./_flatten-into-array\":97,\"./_to-integer\":172,\"./_to-length\":174,\"./_to-object\":175}],326:[function(require,module,exports){\n'use strict';\n// https://github.com/tc39/Array.prototype.includes\nvar $export = require('./_export');\nvar $includes = require('./_array-includes')(true);\n\n$export($export.P, 'Array', {\n includes: function includes(el /* , fromIndex = 0 */) {\n return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\n\nrequire('./_add-to-unscopables')('includes');\n\n},{\"./_add-to-unscopables\":64,\"./_array-includes\":70,\"./_export\":92}],327:[function(require,module,exports){\n// https://github.com/rwaldron/tc39-notes/blob/master/es6/2014-09/sept-25.md#510-globalasap-for-enqueuing-a-microtask\nvar $export = require('./_export');\nvar microtask = require('./_microtask')();\nvar process = require('./_global').process;\nvar isNode = require('./_cof')(process) == 'process';\n\n$export($export.G, {\n asap: function asap(fn) {\n var domain = isNode && process.domain;\n microtask(domain ? domain.bind(fn) : fn);\n }\n});\n\n},{\"./_cof\":77,\"./_export\":92,\"./_global\":99,\"./_microtask\":126}],328:[function(require,module,exports){\n// https://github.com/ljharb/proposal-is-error\nvar $export = require('./_export');\nvar cof = require('./_cof');\n\n$export($export.S, 'Error', {\n isError: function isError(it) {\n return cof(it) === 'Error';\n }\n});\n\n},{\"./_cof\":77,\"./_export\":92}],329:[function(require,module,exports){\n// https://github.com/tc39/proposal-global\nvar $export = require('./_export');\n\n$export($export.G, { global: require('./_global') });\n\n},{\"./_export\":92,\"./_global\":99}],330:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-map.from\nrequire('./_set-collection-from')('Map');\n\n},{\"./_set-collection-from\":153}],331:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-map.of\nrequire('./_set-collection-of')('Map');\n\n},{\"./_set-collection-of\":154}],332:[function(require,module,exports){\n// https://github.com/DavidBruant/Map-Set.prototype.toJSON\nvar $export = require('./_export');\n\n$export($export.P + $export.R, 'Map', { toJSON: require('./_collection-to-json')('Map') });\n\n},{\"./_collection-to-json\":79,\"./_export\":92}],333:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n clamp: function clamp(x, lower, upper) {\n return Math.min(upper, Math.max(lower, x));\n }\n});\n\n},{\"./_export\":92}],334:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { DEG_PER_RAD: Math.PI / 180 });\n\n},{\"./_export\":92}],335:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\nvar RAD_PER_DEG = 180 / Math.PI;\n\n$export($export.S, 'Math', {\n degrees: function degrees(radians) {\n return radians * RAD_PER_DEG;\n }\n});\n\n},{\"./_export\":92}],336:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\nvar scale = require('./_math-scale');\nvar fround = require('./_math-fround');\n\n$export($export.S, 'Math', {\n fscale: function fscale(x, inLow, inHigh, outLow, outHigh) {\n return fround(scale(x, inLow, inHigh, outLow, outHigh));\n }\n});\n\n},{\"./_export\":92,\"./_math-fround\":120,\"./_math-scale\":122}],337:[function(require,module,exports){\n// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n iaddh: function iaddh(x0, x1, y0, y1) {\n var $x0 = x0 >>> 0;\n var $x1 = x1 >>> 0;\n var $y0 = y0 >>> 0;\n return $x1 + (y1 >>> 0) + (($x0 & $y0 | ($x0 | $y0) & ~($x0 + $y0 >>> 0)) >>> 31) | 0;\n }\n});\n\n},{\"./_export\":92}],338:[function(require,module,exports){\n// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n imulh: function imulh(u, v) {\n var UINT16 = 0xffff;\n var $u = +u;\n var $v = +v;\n var u0 = $u & UINT16;\n var v0 = $v & UINT16;\n var u1 = $u >> 16;\n var v1 = $v >> 16;\n var t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);\n return u1 * v1 + (t >> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >> 16);\n }\n});\n\n},{\"./_export\":92}],339:[function(require,module,exports){\n// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n isubh: function isubh(x0, x1, y0, y1) {\n var $x0 = x0 >>> 0;\n var $x1 = x1 >>> 0;\n var $y0 = y0 >>> 0;\n return $x1 - (y1 >>> 0) - ((~$x0 & $y0 | ~($x0 ^ $y0) & $x0 - $y0 >>> 0) >>> 31) | 0;\n }\n});\n\n},{\"./_export\":92}],340:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { RAD_PER_DEG: 180 / Math.PI });\n\n},{\"./_export\":92}],341:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\nvar DEG_PER_RAD = Math.PI / 180;\n\n$export($export.S, 'Math', {\n radians: function radians(degrees) {\n return degrees * DEG_PER_RAD;\n }\n});\n\n},{\"./_export\":92}],342:[function(require,module,exports){\n// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { scale: require('./_math-scale') });\n\n},{\"./_export\":92,\"./_math-scale\":122}],343:[function(require,module,exports){\n// http://jfbastien.github.io/papers/Math.signbit.html\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { signbit: function signbit(x) {\n // eslint-disable-next-line no-self-compare\n return (x = +x) != x ? x : x == 0 ? 1 / x == Infinity : x > 0;\n} });\n\n},{\"./_export\":92}],344:[function(require,module,exports){\n// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n umulh: function umulh(u, v) {\n var UINT16 = 0xffff;\n var $u = +u;\n var $v = +v;\n var u0 = $u & UINT16;\n var v0 = $v & UINT16;\n var u1 = $u >>> 16;\n var v1 = $v >>> 16;\n var t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);\n return u1 * v1 + (t >>> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >>> 16);\n }\n});\n\n},{\"./_export\":92}],345:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar aFunction = require('./_a-function');\nvar $defineProperty = require('./_object-dp');\n\n// B.2.2.2 Object.prototype.__defineGetter__(P, getter)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __defineGetter__: function __defineGetter__(P, getter) {\n $defineProperty.f(toObject(this), P, { get: aFunction(getter), enumerable: true, configurable: true });\n }\n});\n\n},{\"./_a-function\":62,\"./_descriptors\":88,\"./_export\":92,\"./_object-dp\":130,\"./_object-forced-pam\":132,\"./_to-object\":175}],346:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar aFunction = require('./_a-function');\nvar $defineProperty = require('./_object-dp');\n\n// B.2.2.3 Object.prototype.__defineSetter__(P, setter)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __defineSetter__: function __defineSetter__(P, setter) {\n $defineProperty.f(toObject(this), P, { set: aFunction(setter), enumerable: true, configurable: true });\n }\n});\n\n},{\"./_a-function\":62,\"./_descriptors\":88,\"./_export\":92,\"./_object-dp\":130,\"./_object-forced-pam\":132,\"./_to-object\":175}],347:[function(require,module,exports){\n// https://github.com/tc39/proposal-object-values-entries\nvar $export = require('./_export');\nvar $entries = require('./_object-to-array')(true);\n\n$export($export.S, 'Object', {\n entries: function entries(it) {\n return $entries(it);\n }\n});\n\n},{\"./_export\":92,\"./_object-to-array\":142}],348:[function(require,module,exports){\n// https://github.com/tc39/proposal-object-getownpropertydescriptors\nvar $export = require('./_export');\nvar ownKeys = require('./_own-keys');\nvar toIObject = require('./_to-iobject');\nvar gOPD = require('./_object-gopd');\nvar createProperty = require('./_create-property');\n\n$export($export.S, 'Object', {\n getOwnPropertyDescriptors: function getOwnPropertyDescriptors(object) {\n var O = toIObject(object);\n var getDesc = gOPD.f;\n var keys = ownKeys(O);\n var result = {};\n var i = 0;\n var key, desc;\n while (keys.length > i) {\n desc = getDesc(O, key = keys[i++]);\n if (desc !== undefined) createProperty(result, key, desc);\n }\n return result;\n }\n});\n\n},{\"./_create-property\":83,\"./_export\":92,\"./_object-gopd\":133,\"./_own-keys\":143,\"./_to-iobject\":173}],349:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar toPrimitive = require('./_to-primitive');\nvar getPrototypeOf = require('./_object-gpo');\nvar getOwnPropertyDescriptor = require('./_object-gopd').f;\n\n// B.2.2.4 Object.prototype.__lookupGetter__(P)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __lookupGetter__: function __lookupGetter__(P) {\n var O = toObject(this);\n var K = toPrimitive(P, true);\n var D;\n do {\n if (D = getOwnPropertyDescriptor(O, K)) return D.get;\n } while (O = getPrototypeOf(O));\n }\n});\n\n},{\"./_descriptors\":88,\"./_export\":92,\"./_object-forced-pam\":132,\"./_object-gopd\":133,\"./_object-gpo\":137,\"./_to-object\":175,\"./_to-primitive\":176}],350:[function(require,module,exports){\n'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar toPrimitive = require('./_to-primitive');\nvar getPrototypeOf = require('./_object-gpo');\nvar getOwnPropertyDescriptor = require('./_object-gopd').f;\n\n// B.2.2.5 Object.prototype.__lookupSetter__(P)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __lookupSetter__: function __lookupSetter__(P) {\n var O = toObject(this);\n var K = toPrimitive(P, true);\n var D;\n do {\n if (D = getOwnPropertyDescriptor(O, K)) return D.set;\n } while (O = getPrototypeOf(O));\n }\n});\n\n},{\"./_descriptors\":88,\"./_export\":92,\"./_object-forced-pam\":132,\"./_object-gopd\":133,\"./_object-gpo\":137,\"./_to-object\":175,\"./_to-primitive\":176}],351:[function(require,module,exports){\n// https://github.com/tc39/proposal-object-values-entries\nvar $export = require('./_export');\nvar $values = require('./_object-to-array')(false);\n\n$export($export.S, 'Object', {\n values: function values(it) {\n return $values(it);\n }\n});\n\n},{\"./_export\":92,\"./_object-to-array\":142}],352:[function(require,module,exports){\n'use strict';\n// https://github.com/zenparsing/es-observable\nvar $export = require('./_export');\nvar global = require('./_global');\nvar core = require('./_core');\nvar microtask = require('./_microtask')();\nvar OBSERVABLE = require('./_wks')('observable');\nvar aFunction = require('./_a-function');\nvar anObject = require('./_an-object');\nvar anInstance = require('./_an-instance');\nvar redefineAll = require('./_redefine-all');\nvar hide = require('./_hide');\nvar forOf = require('./_for-of');\nvar RETURN = forOf.RETURN;\n\nvar getMethod = function (fn) {\n return fn == null ? undefined : aFunction(fn);\n};\n\nvar cleanupSubscription = function (subscription) {\n var cleanup = subscription._c;\n if (cleanup) {\n subscription._c = undefined;\n cleanup();\n }\n};\n\nvar subscriptionClosed = function (subscription) {\n return subscription._o === undefined;\n};\n\nvar closeSubscription = function (subscription) {\n if (!subscriptionClosed(subscription)) {\n subscription._o = undefined;\n cleanupSubscription(subscription);\n }\n};\n\nvar Subscription = function (observer, subscriber) {\n anObject(observer);\n this._c = undefined;\n this._o = observer;\n observer = new SubscriptionObserver(this);\n try {\n var cleanup = subscriber(observer);\n var subscription = cleanup;\n if (cleanup != null) {\n if (typeof cleanup.unsubscribe === 'function') cleanup = function () { subscription.unsubscribe(); };\n else aFunction(cleanup);\n this._c = cleanup;\n }\n } catch (e) {\n observer.error(e);\n return;\n } if (subscriptionClosed(this)) cleanupSubscription(this);\n};\n\nSubscription.prototype = redefineAll({}, {\n unsubscribe: function unsubscribe() { closeSubscription(this); }\n});\n\nvar SubscriptionObserver = function (subscription) {\n this._s = subscription;\n};\n\nSubscriptionObserver.prototype = redefineAll({}, {\n next: function next(value) {\n var subscription = this._s;\n if (!subscriptionClosed(subscription)) {\n var observer = subscription._o;\n try {\n var m = getMethod(observer.next);\n if (m) return m.call(observer, value);\n } catch (e) {\n try {\n closeSubscription(subscription);\n } finally {\n throw e;\n }\n }\n }\n },\n error: function error(value) {\n var subscription = this._s;\n if (subscriptionClosed(subscription)) throw value;\n var observer = subscription._o;\n subscription._o = undefined;\n try {\n var m = getMethod(observer.error);\n if (!m) throw value;\n value = m.call(observer, value);\n } catch (e) {\n try {\n cleanupSubscription(subscription);\n } finally {\n throw e;\n }\n } cleanupSubscription(subscription);\n return value;\n },\n complete: function complete(value) {\n var subscription = this._s;\n if (!subscriptionClosed(subscription)) {\n var observer = subscription._o;\n subscription._o = undefined;\n try {\n var m = getMethod(observer.complete);\n value = m ? m.call(observer, value) : undefined;\n } catch (e) {\n try {\n cleanupSubscription(subscription);\n } finally {\n throw e;\n }\n } cleanupSubscription(subscription);\n return value;\n }\n }\n});\n\nvar $Observable = function Observable(subscriber) {\n anInstance(this, $Observable, 'Observable', '_f')._f = aFunction(subscriber);\n};\n\nredefineAll($Observable.prototype, {\n subscribe: function subscribe(observer) {\n return new Subscription(observer, this._f);\n },\n forEach: function forEach(fn) {\n var that = this;\n return new (core.Promise || global.Promise)(function (resolve, reject) {\n aFunction(fn);\n var subscription = that.subscribe({\n next: function (value) {\n try {\n return fn(value);\n } catch (e) {\n reject(e);\n subscription.unsubscribe();\n }\n },\n error: reject,\n complete: resolve\n });\n });\n }\n});\n\nredefineAll($Observable, {\n from: function from(x) {\n var C = typeof this === 'function' ? this : $Observable;\n var method = getMethod(anObject(x)[OBSERVABLE]);\n if (method) {\n var observable = anObject(method.call(x));\n return observable.constructor === C ? observable : new C(function (observer) {\n return observable.subscribe(observer);\n });\n }\n return new C(function (observer) {\n var done = false;\n microtask(function () {\n if (!done) {\n try {\n if (forOf(x, false, function (it) {\n observer.next(it);\n if (done) return RETURN;\n }) === RETURN) return;\n } catch (e) {\n if (done) throw e;\n observer.error(e);\n return;\n } observer.complete();\n }\n });\n return function () { done = true; };\n });\n },\n of: function of() {\n for (var i = 0, l = arguments.length, items = Array(l); i < l;) items[i] = arguments[i++];\n return new (typeof this === 'function' ? this : $Observable)(function (observer) {\n var done = false;\n microtask(function () {\n if (!done) {\n for (var j = 0; j < items.length; ++j) {\n observer.next(items[j]);\n if (done) return;\n } observer.complete();\n }\n });\n return function () { done = true; };\n });\n }\n});\n\nhide($Observable.prototype, OBSERVABLE, function () { return this; });\n\n$export($export.G, { Observable: $Observable });\n\nrequire('./_set-species')('Observable');\n\n},{\"./_a-function\":62,\"./_an-instance\":65,\"./_an-object\":66,\"./_core\":82,\"./_export\":92,\"./_for-of\":98,\"./_global\":99,\"./_hide\":101,\"./_microtask\":126,\"./_redefine-all\":149,\"./_set-species\":156,\"./_wks\":184}],353:[function(require,module,exports){\n// https://github.com/tc39/proposal-promise-finally\n'use strict';\nvar $export = require('./_export');\nvar core = require('./_core');\nvar global = require('./_global');\nvar speciesConstructor = require('./_species-constructor');\nvar promiseResolve = require('./_promise-resolve');\n\n$export($export.P + $export.R, 'Promise', { 'finally': function (onFinally) {\n var C = speciesConstructor(this, core.Promise || global.Promise);\n var isFunction = typeof onFinally == 'function';\n return this.then(\n isFunction ? function (x) {\n return promiseResolve(C, onFinally()).then(function () { return x; });\n } : onFinally,\n isFunction ? function (e) {\n return promiseResolve(C, onFinally()).then(function () { throw e; });\n } : onFinally\n );\n} });\n\n},{\"./_core\":82,\"./_export\":92,\"./_global\":99,\"./_promise-resolve\":147,\"./_species-constructor\":160}],354:[function(require,module,exports){\n'use strict';\n// https://github.com/tc39/proposal-promise-try\nvar $export = require('./_export');\nvar newPromiseCapability = require('./_new-promise-capability');\nvar perform = require('./_perform');\n\n$export($export.S, 'Promise', { 'try': function (callbackfn) {\n var promiseCapability = newPromiseCapability.f(this);\n var result = perform(callbackfn);\n (result.e ? promiseCapability.reject : promiseCapability.resolve)(result.v);\n return promiseCapability.promise;\n} });\n\n},{\"./_export\":92,\"./_new-promise-capability\":127,\"./_perform\":146}],355:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar toMetaKey = metadata.key;\nvar ordinaryDefineOwnMetadata = metadata.set;\n\nmetadata.exp({ defineMetadata: function defineMetadata(metadataKey, metadataValue, target, targetKey) {\n ordinaryDefineOwnMetadata(metadataKey, metadataValue, anObject(target), toMetaKey(targetKey));\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125}],356:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar toMetaKey = metadata.key;\nvar getOrCreateMetadataMap = metadata.map;\nvar store = metadata.store;\n\nmetadata.exp({ deleteMetadata: function deleteMetadata(metadataKey, target /* , targetKey */) {\n var targetKey = arguments.length < 3 ? undefined : toMetaKey(arguments[2]);\n var metadataMap = getOrCreateMetadataMap(anObject(target), targetKey, false);\n if (metadataMap === undefined || !metadataMap['delete'](metadataKey)) return false;\n if (metadataMap.size) return true;\n var targetMetadata = store.get(target);\n targetMetadata['delete'](targetKey);\n return !!targetMetadata.size || store['delete'](target);\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125}],357:[function(require,module,exports){\nvar Set = require('./es6.set');\nvar from = require('./_array-from-iterable');\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar ordinaryOwnMetadataKeys = metadata.keys;\nvar toMetaKey = metadata.key;\n\nvar ordinaryMetadataKeys = function (O, P) {\n var oKeys = ordinaryOwnMetadataKeys(O, P);\n var parent = getPrototypeOf(O);\n if (parent === null) return oKeys;\n var pKeys = ordinaryMetadataKeys(parent, P);\n return pKeys.length ? oKeys.length ? from(new Set(oKeys.concat(pKeys))) : pKeys : oKeys;\n};\n\nmetadata.exp({ getMetadataKeys: function getMetadataKeys(target /* , targetKey */) {\n return ordinaryMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));\n} });\n\n},{\"./_an-object\":66,\"./_array-from-iterable\":69,\"./_metadata\":125,\"./_object-gpo\":137,\"./es6.set\":287}],358:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar ordinaryHasOwnMetadata = metadata.has;\nvar ordinaryGetOwnMetadata = metadata.get;\nvar toMetaKey = metadata.key;\n\nvar ordinaryGetMetadata = function (MetadataKey, O, P) {\n var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn) return ordinaryGetOwnMetadata(MetadataKey, O, P);\n var parent = getPrototypeOf(O);\n return parent !== null ? ordinaryGetMetadata(MetadataKey, parent, P) : undefined;\n};\n\nmetadata.exp({ getMetadata: function getMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryGetMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125,\"./_object-gpo\":137}],359:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar ordinaryOwnMetadataKeys = metadata.keys;\nvar toMetaKey = metadata.key;\n\nmetadata.exp({ getOwnMetadataKeys: function getOwnMetadataKeys(target /* , targetKey */) {\n return ordinaryOwnMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125}],360:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar ordinaryGetOwnMetadata = metadata.get;\nvar toMetaKey = metadata.key;\n\nmetadata.exp({ getOwnMetadata: function getOwnMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryGetOwnMetadata(metadataKey, anObject(target)\n , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125}],361:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar ordinaryHasOwnMetadata = metadata.has;\nvar toMetaKey = metadata.key;\n\nvar ordinaryHasMetadata = function (MetadataKey, O, P) {\n var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn) return true;\n var parent = getPrototypeOf(O);\n return parent !== null ? ordinaryHasMetadata(MetadataKey, parent, P) : false;\n};\n\nmetadata.exp({ hasMetadata: function hasMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryHasMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125,\"./_object-gpo\":137}],362:[function(require,module,exports){\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar ordinaryHasOwnMetadata = metadata.has;\nvar toMetaKey = metadata.key;\n\nmetadata.exp({ hasOwnMetadata: function hasOwnMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryHasOwnMetadata(metadataKey, anObject(target)\n , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n\n},{\"./_an-object\":66,\"./_metadata\":125}],363:[function(require,module,exports){\nvar $metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar aFunction = require('./_a-function');\nvar toMetaKey = $metadata.key;\nvar ordinaryDefineOwnMetadata = $metadata.set;\n\n$metadata.exp({ metadata: function metadata(metadataKey, metadataValue) {\n return function decorator(target, targetKey) {\n ordinaryDefineOwnMetadata(\n metadataKey, metadataValue,\n (targetKey !== undefined ? anObject : aFunction)(target),\n toMetaKey(targetKey)\n );\n };\n} });\n\n},{\"./_a-function\":62,\"./_an-object\":66,\"./_metadata\":125}],364:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-set.from\nrequire('./_set-collection-from')('Set');\n\n},{\"./_set-collection-from\":153}],365:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-set.of\nrequire('./_set-collection-of')('Set');\n\n},{\"./_set-collection-of\":154}],366:[function(require,module,exports){\n// https://github.com/DavidBruant/Map-Set.prototype.toJSON\nvar $export = require('./_export');\n\n$export($export.P + $export.R, 'Set', { toJSON: require('./_collection-to-json')('Set') });\n\n},{\"./_collection-to-json\":79,\"./_export\":92}],367:[function(require,module,exports){\n'use strict';\n// https://github.com/mathiasbynens/String.prototype.at\nvar $export = require('./_export');\nvar $at = require('./_string-at')(true);\n\n$export($export.P, 'String', {\n at: function at(pos) {\n return $at(this, pos);\n }\n});\n\n},{\"./_export\":92,\"./_string-at\":162}],368:[function(require,module,exports){\n'use strict';\n// https://tc39.github.io/String.prototype.matchAll/\nvar $export = require('./_export');\nvar defined = require('./_defined');\nvar toLength = require('./_to-length');\nvar isRegExp = require('./_is-regexp');\nvar getFlags = require('./_flags');\nvar RegExpProto = RegExp.prototype;\n\nvar $RegExpStringIterator = function (regexp, string) {\n this._r = regexp;\n this._s = string;\n};\n\nrequire('./_iter-create')($RegExpStringIterator, 'RegExp String', function next() {\n var match = this._r.exec(this._s);\n return { value: match, done: match === null };\n});\n\n$export($export.P, 'String', {\n matchAll: function matchAll(regexp) {\n defined(this);\n if (!isRegExp(regexp)) throw TypeError(regexp + ' is not a regexp!');\n var S = String(this);\n var flags = 'flags' in RegExpProto ? String(regexp.flags) : getFlags.call(regexp);\n var rx = new RegExp(regexp.source, ~flags.indexOf('g') ? flags : 'g' + flags);\n rx.lastIndex = toLength(regexp.lastIndex);\n return new $RegExpStringIterator(rx, S);\n }\n});\n\n},{\"./_defined\":87,\"./_export\":92,\"./_flags\":96,\"./_is-regexp\":111,\"./_iter-create\":113,\"./_to-length\":174}],369:[function(require,module,exports){\n'use strict';\n// https://github.com/tc39/proposal-string-pad-start-end\nvar $export = require('./_export');\nvar $pad = require('./_string-pad');\n\n$export($export.P, 'String', {\n padEnd: function padEnd(maxLength /* , fillString = ' ' */) {\n return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, false);\n }\n});\n\n},{\"./_export\":92,\"./_string-pad\":165}],370:[function(require,module,exports){\n'use strict';\n// https://github.com/tc39/proposal-string-pad-start-end\nvar $export = require('./_export');\nvar $pad = require('./_string-pad');\n\n$export($export.P, 'String', {\n padStart: function padStart(maxLength /* , fillString = ' ' */) {\n return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, true);\n }\n});\n\n},{\"./_export\":92,\"./_string-pad\":165}],371:[function(require,module,exports){\n'use strict';\n// https://github.com/sebmarkbage/ecmascript-string-left-right-trim\nrequire('./_string-trim')('trimLeft', function ($trim) {\n return function trimLeft() {\n return $trim(this, 1);\n };\n}, 'trimStart');\n\n},{\"./_string-trim\":167}],372:[function(require,module,exports){\n'use strict';\n// https://github.com/sebmarkbage/ecmascript-string-left-right-trim\nrequire('./_string-trim')('trimRight', function ($trim) {\n return function trimRight() {\n return $trim(this, 2);\n };\n}, 'trimEnd');\n\n},{\"./_string-trim\":167}],373:[function(require,module,exports){\nrequire('./_wks-define')('asyncIterator');\n\n},{\"./_wks-define\":182}],374:[function(require,module,exports){\nrequire('./_wks-define')('observable');\n\n},{\"./_wks-define\":182}],375:[function(require,module,exports){\n// https://github.com/tc39/proposal-global\nvar $export = require('./_export');\n\n$export($export.S, 'System', { global: require('./_global') });\n\n},{\"./_export\":92,\"./_global\":99}],376:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-weakmap.from\nrequire('./_set-collection-from')('WeakMap');\n\n},{\"./_set-collection-from\":153}],377:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-weakmap.of\nrequire('./_set-collection-of')('WeakMap');\n\n},{\"./_set-collection-of\":154}],378:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-weakset.from\nrequire('./_set-collection-from')('WeakSet');\n\n},{\"./_set-collection-from\":153}],379:[function(require,module,exports){\n// https://tc39.github.io/proposal-setmap-offrom/#sec-weakset.of\nrequire('./_set-collection-of')('WeakSet');\n\n},{\"./_set-collection-of\":154}],380:[function(require,module,exports){\nvar $iterators = require('./es6.array.iterator');\nvar getKeys = require('./_object-keys');\nvar redefine = require('./_redefine');\nvar global = require('./_global');\nvar hide = require('./_hide');\nvar Iterators = require('./_iterators');\nvar wks = require('./_wks');\nvar ITERATOR = wks('iterator');\nvar TO_STRING_TAG = wks('toStringTag');\nvar ArrayValues = Iterators.Array;\n\nvar DOMIterables = {\n CSSRuleList: true, // TODO: Not spec compliant, should be false.\n CSSStyleDeclaration: false,\n CSSValueList: false,\n ClientRectList: false,\n DOMRectList: false,\n DOMStringList: false,\n DOMTokenList: true,\n DataTransferItemList: false,\n FileList: false,\n HTMLAllCollection: false,\n HTMLCollection: false,\n HTMLFormElement: false,\n HTMLSelectElement: false,\n MediaList: true, // TODO: Not spec compliant, should be false.\n MimeTypeArray: false,\n NamedNodeMap: false,\n NodeList: true,\n PaintRequestList: false,\n Plugin: false,\n PluginArray: false,\n SVGLengthList: false,\n SVGNumberList: false,\n SVGPathSegList: false,\n SVGPointList: false,\n SVGStringList: false,\n SVGTransformList: false,\n SourceBufferList: false,\n StyleSheetList: true, // TODO: Not spec compliant, should be false.\n TextTrackCueList: false,\n TextTrackList: false,\n TouchList: false\n};\n\nfor (var collections = getKeys(DOMIterables), i = 0; i < collections.length; i++) {\n var NAME = collections[i];\n var explicit = DOMIterables[NAME];\n var Collection = global[NAME];\n var proto = Collection && Collection.prototype;\n var key;\n if (proto) {\n if (!proto[ITERATOR]) hide(proto, ITERATOR, ArrayValues);\n if (!proto[TO_STRING_TAG]) hide(proto, TO_STRING_TAG, NAME);\n Iterators[NAME] = ArrayValues;\n if (explicit) for (key in $iterators) if (!proto[key]) redefine(proto, key, $iterators[key], true);\n }\n}\n\n},{\"./_global\":99,\"./_hide\":101,\"./_iterators\":117,\"./_object-keys\":139,\"./_redefine\":150,\"./_wks\":184,\"./es6.array.iterator\":197}],381:[function(require,module,exports){\nvar $export = require('./_export');\nvar $task = require('./_task');\n$export($export.G + $export.B, {\n setImmediate: $task.set,\n clearImmediate: $task.clear\n});\n\n},{\"./_export\":92,\"./_task\":169}],382:[function(require,module,exports){\n// ie9- setTimeout & setInterval additional parameters fix\nvar global = require('./_global');\nvar $export = require('./_export');\nvar navigator = global.navigator;\nvar slice = [].slice;\nvar MSIE = !!navigator && /MSIE .\\./.test(navigator.userAgent); // <- dirty ie9- check\nvar wrap = function (set) {\n return function (fn, time /* , ...args */) {\n var boundArgs = arguments.length > 2;\n var args = boundArgs ? slice.call(arguments, 2) : false;\n return set(boundArgs ? function () {\n // eslint-disable-next-line no-new-func\n (typeof fn == 'function' ? fn : Function(fn)).apply(this, args);\n } : fn, time);\n };\n};\n$export($export.G + $export.B + $export.F * MSIE, {\n setTimeout: wrap(global.setTimeout),\n setInterval: wrap(global.setInterval)\n});\n\n},{\"./_export\":92,\"./_global\":99}],383:[function(require,module,exports){\nrequire('./modules/es6.symbol');\nrequire('./modules/es6.object.create');\nrequire('./modules/es6.object.define-property');\nrequire('./modules/es6.object.define-properties');\nrequire('./modules/es6.object.get-own-property-descriptor');\nrequire('./modules/es6.object.get-prototype-of');\nrequire('./modules/es6.object.keys');\nrequire('./modules/es6.object.get-own-property-names');\nrequire('./modules/es6.object.freeze');\nrequire('./modules/es6.object.seal');\nrequire('./modules/es6.object.prevent-extensions');\nrequire('./modules/es6.object.is-frozen');\nrequire('./modules/es6.object.is-sealed');\nrequire('./modules/es6.object.is-extensible');\nrequire('./modules/es6.object.assign');\nrequire('./modules/es6.object.is');\nrequire('./modules/es6.object.set-prototype-of');\nrequire('./modules/es6.object.to-string');\nrequire('./modules/es6.function.bind');\nrequire('./modules/es6.function.name');\nrequire('./modules/es6.function.has-instance');\nrequire('./modules/es6.parse-int');\nrequire('./modules/es6.parse-float');\nrequire('./modules/es6.number.constructor');\nrequire('./modules/es6.number.to-fixed');\nrequire('./modules/es6.number.to-precision');\nrequire('./modules/es6.number.epsilon');\nrequire('./modules/es6.number.is-finite');\nrequire('./modules/es6.number.is-integer');\nrequire('./modules/es6.number.is-nan');\nrequire('./modules/es6.number.is-safe-integer');\nrequire('./modules/es6.number.max-safe-integer');\nrequire('./modules/es6.number.min-safe-integer');\nrequire('./modules/es6.number.parse-float');\nrequire('./modules/es6.number.parse-int');\nrequire('./modules/es6.math.acosh');\nrequire('./modules/es6.math.asinh');\nrequire('./modules/es6.math.atanh');\nrequire('./modules/es6.math.cbrt');\nrequire('./modules/es6.math.clz32');\nrequire('./modules/es6.math.cosh');\nrequire('./modules/es6.math.expm1');\nrequire('./modules/es6.math.fround');\nrequire('./modules/es6.math.hypot');\nrequire('./modules/es6.math.imul');\nrequire('./modules/es6.math.log10');\nrequire('./modules/es6.math.log1p');\nrequire('./modules/es6.math.log2');\nrequire('./modules/es6.math.sign');\nrequire('./modules/es6.math.sinh');\nrequire('./modules/es6.math.tanh');\nrequire('./modules/es6.math.trunc');\nrequire('./modules/es6.string.from-code-point');\nrequire('./modules/es6.string.raw');\nrequire('./modules/es6.string.trim');\nrequire('./modules/es6.string.iterator');\nrequire('./modules/es6.string.code-point-at');\nrequire('./modules/es6.string.ends-with');\nrequire('./modules/es6.string.includes');\nrequire('./modules/es6.string.repeat');\nrequire('./modules/es6.string.starts-with');\nrequire('./modules/es6.string.anchor');\nrequire('./modules/es6.string.big');\nrequire('./modules/es6.string.blink');\nrequire('./modules/es6.string.bold');\nrequire('./modules/es6.string.fixed');\nrequire('./modules/es6.string.fontcolor');\nrequire('./modules/es6.string.fontsize');\nrequire('./modules/es6.string.italics');\nrequire('./modules/es6.string.link');\nrequire('./modules/es6.string.small');\nrequire('./modules/es6.string.strike');\nrequire('./modules/es6.string.sub');\nrequire('./modules/es6.string.sup');\nrequire('./modules/es6.date.now');\nrequire('./modules/es6.date.to-json');\nrequire('./modules/es6.date.to-iso-string');\nrequire('./modules/es6.date.to-string');\nrequire('./modules/es6.date.to-primitive');\nrequire('./modules/es6.array.is-array');\nrequire('./modules/es6.array.from');\nrequire('./modules/es6.array.of');\nrequire('./modules/es6.array.join');\nrequire('./modules/es6.array.slice');\nrequire('./modules/es6.array.sort');\nrequire('./modules/es6.array.for-each');\nrequire('./modules/es6.array.map');\nrequire('./modules/es6.array.filter');\nrequire('./modules/es6.array.some');\nrequire('./modules/es6.array.every');\nrequire('./modules/es6.array.reduce');\nrequire('./modules/es6.array.reduce-right');\nrequire('./modules/es6.array.index-of');\nrequire('./modules/es6.array.last-index-of');\nrequire('./modules/es6.array.copy-within');\nrequire('./modules/es6.array.fill');\nrequire('./modules/es6.array.find');\nrequire('./modules/es6.array.find-index');\nrequire('./modules/es6.array.species');\nrequire('./modules/es6.array.iterator');\nrequire('./modules/es6.regexp.constructor');\nrequire('./modules/es6.regexp.to-string');\nrequire('./modules/es6.regexp.flags');\nrequire('./modules/es6.regexp.match');\nrequire('./modules/es6.regexp.replace');\nrequire('./modules/es6.regexp.search');\nrequire('./modules/es6.regexp.split');\nrequire('./modules/es6.promise');\nrequire('./modules/es6.map');\nrequire('./modules/es6.set');\nrequire('./modules/es6.weak-map');\nrequire('./modules/es6.weak-set');\nrequire('./modules/es6.typed.array-buffer');\nrequire('./modules/es6.typed.data-view');\nrequire('./modules/es6.typed.int8-array');\nrequire('./modules/es6.typed.uint8-array');\nrequire('./modules/es6.typed.uint8-clamped-array');\nrequire('./modules/es6.typed.int16-array');\nrequire('./modules/es6.typed.uint16-array');\nrequire('./modules/es6.typed.int32-array');\nrequire('./modules/es6.typed.uint32-array');\nrequire('./modules/es6.typed.float32-array');\nrequire('./modules/es6.typed.float64-array');\nrequire('./modules/es6.reflect.apply');\nrequire('./modules/es6.reflect.construct');\nrequire('./modules/es6.reflect.define-property');\nrequire('./modules/es6.reflect.delete-property');\nrequire('./modules/es6.reflect.enumerate');\nrequire('./modules/es6.reflect.get');\nrequire('./modules/es6.reflect.get-own-property-descriptor');\nrequire('./modules/es6.reflect.get-prototype-of');\nrequire('./modules/es6.reflect.has');\nrequire('./modules/es6.reflect.is-extensible');\nrequire('./modules/es6.reflect.own-keys');\nrequire('./modules/es6.reflect.prevent-extensions');\nrequire('./modules/es6.reflect.set');\nrequire('./modules/es6.reflect.set-prototype-of');\nrequire('./modules/es7.array.includes');\nrequire('./modules/es7.array.flat-map');\nrequire('./modules/es7.array.flatten');\nrequire('./modules/es7.string.at');\nrequire('./modules/es7.string.pad-start');\nrequire('./modules/es7.string.pad-end');\nrequire('./modules/es7.string.trim-left');\nrequire('./modules/es7.string.trim-right');\nrequire('./modules/es7.string.match-all');\nrequire('./modules/es7.symbol.async-iterator');\nrequire('./modules/es7.symbol.observable');\nrequire('./modules/es7.object.get-own-property-descriptors');\nrequire('./modules/es7.object.values');\nrequire('./modules/es7.object.entries');\nrequire('./modules/es7.object.define-getter');\nrequire('./modules/es7.object.define-setter');\nrequire('./modules/es7.object.lookup-getter');\nrequire('./modules/es7.object.lookup-setter');\nrequire('./modules/es7.map.to-json');\nrequire('./modules/es7.set.to-json');\nrequire('./modules/es7.map.of');\nrequire('./modules/es7.set.of');\nrequire('./modules/es7.weak-map.of');\nrequire('./modules/es7.weak-set.of');\nrequire('./modules/es7.map.from');\nrequire('./modules/es7.set.from');\nrequire('./modules/es7.weak-map.from');\nrequire('./modules/es7.weak-set.from');\nrequire('./modules/es7.global');\nrequire('./modules/es7.system.global');\nrequire('./modules/es7.error.is-error');\nrequire('./modules/es7.math.clamp');\nrequire('./modules/es7.math.deg-per-rad');\nrequire('./modules/es7.math.degrees');\nrequire('./modules/es7.math.fscale');\nrequire('./modules/es7.math.iaddh');\nrequire('./modules/es7.math.isubh');\nrequire('./modules/es7.math.imulh');\nrequire('./modules/es7.math.rad-per-deg');\nrequire('./modules/es7.math.radians');\nrequire('./modules/es7.math.scale');\nrequire('./modules/es7.math.umulh');\nrequire('./modules/es7.math.signbit');\nrequire('./modules/es7.promise.finally');\nrequire('./modules/es7.promise.try');\nrequire('./modules/es7.reflect.define-metadata');\nrequire('./modules/es7.reflect.delete-metadata');\nrequire('./modules/es7.reflect.get-metadata');\nrequire('./modules/es7.reflect.get-metadata-keys');\nrequire('./modules/es7.reflect.get-own-metadata');\nrequire('./modules/es7.reflect.get-own-metadata-keys');\nrequire('./modules/es7.reflect.has-metadata');\nrequire('./modules/es7.reflect.has-own-metadata');\nrequire('./modules/es7.reflect.metadata');\nrequire('./modules/es7.asap');\nrequire('./modules/es7.observable');\nrequire('./modules/web.timers');\nrequire('./modules/web.immediate');\nrequire('./modules/web.dom.iterable');\nmodule.exports = require('./modules/_core');\n\n},{\"./modules/_core\":82,\"./modules/es6.array.copy-within\":187,\"./modules/es6.array.every\":188,\"./modules/es6.array.fill\":189,\"./modules/es6.array.filter\":190,\"./modules/es6.array.find\":192,\"./modules/es6.array.find-index\":191,\"./modules/es6.array.for-each\":193,\"./modules/es6.array.from\":194,\"./modules/es6.array.index-of\":195,\"./modules/es6.array.is-array\":196,\"./modules/es6.array.iterator\":197,\"./modules/es6.array.join\":198,\"./modules/es6.array.last-index-of\":199,\"./modules/es6.array.map\":200,\"./modules/es6.array.of\":201,\"./modules/es6.array.reduce\":203,\"./modules/es6.array.reduce-right\":202,\"./modules/es6.array.slice\":204,\"./modules/es6.array.some\":205,\"./modules/es6.array.sort\":206,\"./modules/es6.array.species\":207,\"./modules/es6.date.now\":208,\"./modules/es6.date.to-iso-string\":209,\"./modules/es6.date.to-json\":210,\"./modules/es6.date.to-primitive\":211,\"./modules/es6.date.to-string\":212,\"./modules/es6.function.bind\":213,\"./modules/es6.function.has-instance\":214,\"./modules/es6.function.name\":215,\"./modules/es6.map\":216,\"./modules/es6.math.acosh\":217,\"./modules/es6.math.asinh\":218,\"./modules/es6.math.atanh\":219,\"./modules/es6.math.cbrt\":220,\"./modules/es6.math.clz32\":221,\"./modules/es6.math.cosh\":222,\"./modules/es6.math.expm1\":223,\"./modules/es6.math.fround\":224,\"./modules/es6.math.hypot\":225,\"./modules/es6.math.imul\":226,\"./modules/es6.math.log10\":227,\"./modules/es6.math.log1p\":228,\"./modules/es6.math.log2\":229,\"./modules/es6.math.sign\":230,\"./modules/es6.math.sinh\":231,\"./modules/es6.math.tanh\":232,\"./modules/es6.math.trunc\":233,\"./modules/es6.number.constructor\":234,\"./modules/es6.number.epsilon\":235,\"./modules/es6.number.is-finite\":236,\"./modules/es6.number.is-integer\":237,\"./modules/es6.number.is-nan\":238,\"./modules/es6.number.is-safe-integer\":239,\"./modules/es6.number.max-safe-integer\":240,\"./modules/es6.number.min-safe-integer\":241,\"./modules/es6.number.parse-float\":242,\"./modules/es6.number.parse-int\":243,\"./modules/es6.number.to-fixed\":244,\"./modules/es6.number.to-precision\":245,\"./modules/es6.object.assign\":246,\"./modules/es6.object.create\":247,\"./modules/es6.object.define-properties\":248,\"./modules/es6.object.define-property\":249,\"./modules/es6.object.freeze\":250,\"./modules/es6.object.get-own-property-descriptor\":251,\"./modules/es6.object.get-own-property-names\":252,\"./modules/es6.object.get-prototype-of\":253,\"./modules/es6.object.is\":257,\"./modules/es6.object.is-extensible\":254,\"./modules/es6.object.is-frozen\":255,\"./modules/es6.object.is-sealed\":256,\"./modules/es6.object.keys\":258,\"./modules/es6.object.prevent-extensions\":259,\"./modules/es6.object.seal\":260,\"./modules/es6.object.set-prototype-of\":261,\"./modules/es6.object.to-string\":262,\"./modules/es6.parse-float\":263,\"./modules/es6.parse-int\":264,\"./modules/es6.promise\":265,\"./modules/es6.reflect.apply\":266,\"./modules/es6.reflect.construct\":267,\"./modules/es6.reflect.define-property\":268,\"./modules/es6.reflect.delete-property\":269,\"./modules/es6.reflect.enumerate\":270,\"./modules/es6.reflect.get\":273,\"./modules/es6.reflect.get-own-property-descriptor\":271,\"./modules/es6.reflect.get-prototype-of\":272,\"./modules/es6.reflect.has\":274,\"./modules/es6.reflect.is-extensible\":275,\"./modules/es6.reflect.own-keys\":276,\"./modules/es6.reflect.prevent-extensions\":277,\"./modules/es6.reflect.set\":279,\"./modules/es6.reflect.set-prototype-of\":278,\"./modules/es6.regexp.constructor\":280,\"./modules/es6.regexp.flags\":281,\"./modules/es6.regexp.match\":282,\"./modules/es6.regexp.replace\":283,\"./modules/es6.regexp.search\":284,\"./modules/es6.regexp.split\":285,\"./modules/es6.regexp.to-string\":286,\"./modules/es6.set\":287,\"./modules/es6.string.anchor\":288,\"./modules/es6.string.big\":289,\"./modules/es6.string.blink\":290,\"./modules/es6.string.bold\":291,\"./modules/es6.string.code-point-at\":292,\"./modules/es6.string.ends-with\":293,\"./modules/es6.string.fixed\":294,\"./modules/es6.string.fontcolor\":295,\"./modules/es6.string.fontsize\":296,\"./modules/es6.string.from-code-point\":297,\"./modules/es6.string.includes\":298,\"./modules/es6.string.italics\":299,\"./modules/es6.string.iterator\":300,\"./modules/es6.string.link\":301,\"./modules/es6.string.raw\":302,\"./modules/es6.string.repeat\":303,\"./modules/es6.string.small\":304,\"./modules/es6.string.starts-with\":305,\"./modules/es6.string.strike\":306,\"./modules/es6.string.sub\":307,\"./modules/es6.string.sup\":308,\"./modules/es6.string.trim\":309,\"./modules/es6.symbol\":310,\"./modules/es6.typed.array-buffer\":311,\"./modules/es6.typed.data-view\":312,\"./modules/es6.typed.float32-array\":313,\"./modules/es6.typed.float64-array\":314,\"./modules/es6.typed.int16-array\":315,\"./modules/es6.typed.int32-array\":316,\"./modules/es6.typed.int8-array\":317,\"./modules/es6.typed.uint16-array\":318,\"./modules/es6.typed.uint32-array\":319,\"./modules/es6.typed.uint8-array\":320,\"./modules/es6.typed.uint8-clamped-array\":321,\"./modules/es6.weak-map\":322,\"./modules/es6.weak-set\":323,\"./modules/es7.array.flat-map\":324,\"./modules/es7.array.flatten\":325,\"./modules/es7.array.includes\":326,\"./modules/es7.asap\":327,\"./modules/es7.error.is-error\":328,\"./modules/es7.global\":329,\"./modules/es7.map.from\":330,\"./modules/es7.map.of\":331,\"./modules/es7.map.to-json\":332,\"./modules/es7.math.clamp\":333,\"./modules/es7.math.deg-per-rad\":334,\"./modules/es7.math.degrees\":335,\"./modules/es7.math.fscale\":336,\"./modules/es7.math.iaddh\":337,\"./modules/es7.math.imulh\":338,\"./modules/es7.math.isubh\":339,\"./modules/es7.math.rad-per-deg\":340,\"./modules/es7.math.radians\":341,\"./modules/es7.math.scale\":342,\"./modules/es7.math.signbit\":343,\"./modules/es7.math.umulh\":344,\"./modules/es7.object.define-getter\":345,\"./modules/es7.object.define-setter\":346,\"./modules/es7.object.entries\":347,\"./modules/es7.object.get-own-property-descriptors\":348,\"./modules/es7.object.lookup-getter\":349,\"./modules/es7.object.lookup-setter\":350,\"./modules/es7.object.values\":351,\"./modules/es7.observable\":352,\"./modules/es7.promise.finally\":353,\"./modules/es7.promise.try\":354,\"./modules/es7.reflect.define-metadata\":355,\"./modules/es7.reflect.delete-metadata\":356,\"./modules/es7.reflect.get-metadata\":358,\"./modules/es7.reflect.get-metadata-keys\":357,\"./modules/es7.reflect.get-own-metadata\":360,\"./modules/es7.reflect.get-own-metadata-keys\":359,\"./modules/es7.reflect.has-metadata\":361,\"./modules/es7.reflect.has-own-metadata\":362,\"./modules/es7.reflect.metadata\":363,\"./modules/es7.set.from\":364,\"./modules/es7.set.of\":365,\"./modules/es7.set.to-json\":366,\"./modules/es7.string.at\":367,\"./modules/es7.string.match-all\":368,\"./modules/es7.string.pad-end\":369,\"./modules/es7.string.pad-start\":370,\"./modules/es7.string.trim-left\":371,\"./modules/es7.string.trim-right\":372,\"./modules/es7.symbol.async-iterator\":373,\"./modules/es7.symbol.observable\":374,\"./modules/es7.system.global\":375,\"./modules/es7.weak-map.from\":376,\"./modules/es7.weak-map.of\":377,\"./modules/es7.weak-set.from\":378,\"./modules/es7.weak-set.of\":379,\"./modules/web.dom.iterable\":380,\"./modules/web.immediate\":381,\"./modules/web.timers\":382}],384:[function(require,module,exports){\n(function (process,global){\n/*!\n * @overview es6-promise - a tiny implementation of Promises/A+.\n * @copyright Copyright (c) 2014 Yehuda Katz, Tom Dale, Stefan Penner and contributors (Conversion to ES6 API by Jake Archibald)\n * @license Licensed under MIT license\n * See https://raw.githubusercontent.com/jakearchibald/es6-promise/master/LICENSE\n * @version 3.0.2\n */\n\n(function() {\n \"use strict\";\n function lib$es6$promise$utils$$objectOrFunction(x) {\n return typeof x === 'function' || (typeof x === 'object' && x !== null);\n }\n\n function lib$es6$promise$utils$$isFunction(x) {\n return typeof x === 'function';\n }\n\n function lib$es6$promise$utils$$isMaybeThenable(x) {\n return typeof x === 'object' && x !== null;\n }\n\n var lib$es6$promise$utils$$_isArray;\n if (!Array.isArray) {\n lib$es6$promise$utils$$_isArray = function (x) {\n return Object.prototype.toString.call(x) === '[object Array]';\n };\n } else {\n lib$es6$promise$utils$$_isArray = Array.isArray;\n }\n\n var lib$es6$promise$utils$$isArray = lib$es6$promise$utils$$_isArray;\n var lib$es6$promise$asap$$len = 0;\n var lib$es6$promise$asap$$toString = {}.toString;\n var lib$es6$promise$asap$$vertxNext;\n var lib$es6$promise$asap$$customSchedulerFn;\n\n var lib$es6$promise$asap$$asap = function asap(callback, arg) {\n lib$es6$promise$asap$$queue[lib$es6$promise$asap$$len] = callback;\n lib$es6$promise$asap$$queue[lib$es6$promise$asap$$len + 1] = arg;\n lib$es6$promise$asap$$len += 2;\n if (lib$es6$promise$asap$$len === 2) {\n // If len is 2, that means that we need to schedule an async flush.\n // If additional callbacks are queued before the queue is flushed, they\n // will be processed by this flush that we are scheduling.\n if (lib$es6$promise$asap$$customSchedulerFn) {\n lib$es6$promise$asap$$customSchedulerFn(lib$es6$promise$asap$$flush);\n } else {\n lib$es6$promise$asap$$scheduleFlush();\n }\n }\n }\n\n function lib$es6$promise$asap$$setScheduler(scheduleFn) {\n lib$es6$promise$asap$$customSchedulerFn = scheduleFn;\n }\n\n function lib$es6$promise$asap$$setAsap(asapFn) {\n lib$es6$promise$asap$$asap = asapFn;\n }\n\n var lib$es6$promise$asap$$browserWindow = (typeof window !== 'undefined') ? window : undefined;\n var lib$es6$promise$asap$$browserGlobal = lib$es6$promise$asap$$browserWindow || {};\n var lib$es6$promise$asap$$BrowserMutationObserver = lib$es6$promise$asap$$browserGlobal.MutationObserver || lib$es6$promise$asap$$browserGlobal.WebKitMutationObserver;\n var lib$es6$promise$asap$$isNode = typeof process !== 'undefined' && {}.toString.call(process) === '[object process]';\n\n // test for web worker but not in IE10\n var lib$es6$promise$asap$$isWorker = typeof Uint8ClampedArray !== 'undefined' &&\n typeof importScripts !== 'undefined' &&\n typeof MessageChannel !== 'undefined';\n\n // node\n function lib$es6$promise$asap$$useNextTick() {\n // node version 0.10.x displays a deprecation warning when nextTick is used recursively\n // see https://github.com/cujojs/when/issues/410 for details\n return function() {\n process.nextTick(lib$es6$promise$asap$$flush);\n };\n }\n\n // vertx\n function lib$es6$promise$asap$$useVertxTimer() {\n return function() {\n lib$es6$promise$asap$$vertxNext(lib$es6$promise$asap$$flush);\n };\n }\n\n function lib$es6$promise$asap$$useMutationObserver() {\n var iterations = 0;\n var observer = new lib$es6$promise$asap$$BrowserMutationObserver(lib$es6$promise$asap$$flush);\n var node = document.createTextNode('');\n observer.observe(node, { characterData: true });\n\n return function() {\n node.data = (iterations = ++iterations % 2);\n };\n }\n\n // web worker\n function lib$es6$promise$asap$$useMessageChannel() {\n var channel = new MessageChannel();\n channel.port1.onmessage = lib$es6$promise$asap$$flush;\n return function () {\n channel.port2.postMessage(0);\n };\n }\n\n function lib$es6$promise$asap$$useSetTimeout() {\n return function() {\n setTimeout(lib$es6$promise$asap$$flush, 1);\n };\n }\n\n var lib$es6$promise$asap$$queue = new Array(1000);\n function lib$es6$promise$asap$$flush() {\n for (var i = 0; i < lib$es6$promise$asap$$len; i+=2) {\n var callback = lib$es6$promise$asap$$queue[i];\n var arg = lib$es6$promise$asap$$queue[i+1];\n\n callback(arg);\n\n lib$es6$promise$asap$$queue[i] = undefined;\n lib$es6$promise$asap$$queue[i+1] = undefined;\n }\n\n lib$es6$promise$asap$$len = 0;\n }\n\n function lib$es6$promise$asap$$attemptVertx() {\n try {\n var r = require;\n var vertx = r('vertx');\n lib$es6$promise$asap$$vertxNext = vertx.runOnLoop || vertx.runOnContext;\n return lib$es6$promise$asap$$useVertxTimer();\n } catch(e) {\n return lib$es6$promise$asap$$useSetTimeout();\n }\n }\n\n var lib$es6$promise$asap$$scheduleFlush;\n // Decide what async method to use to triggering processing of queued callbacks:\n if (lib$es6$promise$asap$$isNode) {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useNextTick();\n } else if (lib$es6$promise$asap$$BrowserMutationObserver) {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useMutationObserver();\n } else if (lib$es6$promise$asap$$isWorker) {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useMessageChannel();\n } else if (lib$es6$promise$asap$$browserWindow === undefined && typeof require === 'function') {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$attemptVertx();\n } else {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useSetTimeout();\n }\n\n function lib$es6$promise$$internal$$noop() {}\n\n var lib$es6$promise$$internal$$PENDING = void 0;\n var lib$es6$promise$$internal$$FULFILLED = 1;\n var lib$es6$promise$$internal$$REJECTED = 2;\n\n var lib$es6$promise$$internal$$GET_THEN_ERROR = new lib$es6$promise$$internal$$ErrorObject();\n\n function lib$es6$promise$$internal$$selfFulfillment() {\n return new TypeError(\"You cannot resolve a promise with itself\");\n }\n\n function lib$es6$promise$$internal$$cannotReturnOwn() {\n return new TypeError('A promises callback cannot return that same promise.');\n }\n\n function lib$es6$promise$$internal$$getThen(promise) {\n try {\n return promise.then;\n } catch(error) {\n lib$es6$promise$$internal$$GET_THEN_ERROR.error = error;\n return lib$es6$promise$$internal$$GET_THEN_ERROR;\n }\n }\n\n function lib$es6$promise$$internal$$tryThen(then, value, fulfillmentHandler, rejectionHandler) {\n try {\n then.call(value, fulfillmentHandler, rejectionHandler);\n } catch(e) {\n return e;\n }\n }\n\n function lib$es6$promise$$internal$$handleForeignThenable(promise, thenable, then) {\n lib$es6$promise$asap$$asap(function(promise) {\n var sealed = false;\n var error = lib$es6$promise$$internal$$tryThen(then, thenable, function(value) {\n if (sealed) { return; }\n sealed = true;\n if (thenable !== value) {\n lib$es6$promise$$internal$$resolve(promise, value);\n } else {\n lib$es6$promise$$internal$$fulfill(promise, value);\n }\n }, function(reason) {\n if (sealed) { return; }\n sealed = true;\n\n lib$es6$promise$$internal$$reject(promise, reason);\n }, 'Settle: ' + (promise._label || ' unknown promise'));\n\n if (!sealed && error) {\n sealed = true;\n lib$es6$promise$$internal$$reject(promise, error);\n }\n }, promise);\n }\n\n function lib$es6$promise$$internal$$handleOwnThenable(promise, thenable) {\n if (thenable._state === lib$es6$promise$$internal$$FULFILLED) {\n lib$es6$promise$$internal$$fulfill(promise, thenable._result);\n } else if (thenable._state === lib$es6$promise$$internal$$REJECTED) {\n lib$es6$promise$$internal$$reject(promise, thenable._result);\n } else {\n lib$es6$promise$$internal$$subscribe(thenable, undefined, function(value) {\n lib$es6$promise$$internal$$resolve(promise, value);\n }, function(reason) {\n lib$es6$promise$$internal$$reject(promise, reason);\n });\n }\n }\n\n function lib$es6$promise$$internal$$handleMaybeThenable(promise, maybeThenable) {\n if (maybeThenable.constructor === promise.constructor) {\n lib$es6$promise$$internal$$handleOwnThenable(promise, maybeThenable);\n } else {\n var then = lib$es6$promise$$internal$$getThen(maybeThenable);\n\n if (then === lib$es6$promise$$internal$$GET_THEN_ERROR) {\n lib$es6$promise$$internal$$reject(promise, lib$es6$promise$$internal$$GET_THEN_ERROR.error);\n } else if (then === undefined) {\n lib$es6$promise$$internal$$fulfill(promise, maybeThenable);\n } else if (lib$es6$promise$utils$$isFunction(then)) {\n lib$es6$promise$$internal$$handleForeignThenable(promise, maybeThenable, then);\n } else {\n lib$es6$promise$$internal$$fulfill(promise, maybeThenable);\n }\n }\n }\n\n function lib$es6$promise$$internal$$resolve(promise, value) {\n if (promise === value) {\n lib$es6$promise$$internal$$reject(promise, lib$es6$promise$$internal$$selfFulfillment());\n } else if (lib$es6$promise$utils$$objectOrFunction(value)) {\n lib$es6$promise$$internal$$handleMaybeThenable(promise, value);\n } else {\n lib$es6$promise$$internal$$fulfill(promise, value);\n }\n }\n\n function lib$es6$promise$$internal$$publishRejection(promise) {\n if (promise._onerror) {\n promise._onerror(promise._result);\n }\n\n lib$es6$promise$$internal$$publish(promise);\n }\n\n function lib$es6$promise$$internal$$fulfill(promise, value) {\n if (promise._state !== lib$es6$promise$$internal$$PENDING) { return; }\n\n promise._result = value;\n promise._state = lib$es6$promise$$internal$$FULFILLED;\n\n if (promise._subscribers.length !== 0) {\n lib$es6$promise$asap$$asap(lib$es6$promise$$internal$$publish, promise);\n }\n }\n\n function lib$es6$promise$$internal$$reject(promise, reason) {\n if (promise._state !== lib$es6$promise$$internal$$PENDING) { return; }\n promise._state = lib$es6$promise$$internal$$REJECTED;\n promise._result = reason;\n\n lib$es6$promise$asap$$asap(lib$es6$promise$$internal$$publishRejection, promise);\n }\n\n function lib$es6$promise$$internal$$subscribe(parent, child, onFulfillment, onRejection) {\n var subscribers = parent._subscribers;\n var length = subscribers.length;\n\n parent._onerror = null;\n\n subscribers[length] = child;\n subscribers[length + lib$es6$promise$$internal$$FULFILLED] = onFulfillment;\n subscribers[length + lib$es6$promise$$internal$$REJECTED] = onRejection;\n\n if (length === 0 && parent._state) {\n lib$es6$promise$asap$$asap(lib$es6$promise$$internal$$publish, parent);\n }\n }\n\n function lib$es6$promise$$internal$$publish(promise) {\n var subscribers = promise._subscribers;\n var settled = promise._state;\n\n if (subscribers.length === 0) { return; }\n\n var child, callback, detail = promise._result;\n\n for (var i = 0; i < subscribers.length; i += 3) {\n child = subscribers[i];\n callback = subscribers[i + settled];\n\n if (child) {\n lib$es6$promise$$internal$$invokeCallback(settled, child, callback, detail);\n } else {\n callback(detail);\n }\n }\n\n promise._subscribers.length = 0;\n }\n\n function lib$es6$promise$$internal$$ErrorObject() {\n this.error = null;\n }\n\n var lib$es6$promise$$internal$$TRY_CATCH_ERROR = new lib$es6$promise$$internal$$ErrorObject();\n\n function lib$es6$promise$$internal$$tryCatch(callback, detail) {\n try {\n return callback(detail);\n } catch(e) {\n lib$es6$promise$$internal$$TRY_CATCH_ERROR.error = e;\n return lib$es6$promise$$internal$$TRY_CATCH_ERROR;\n }\n }\n\n function lib$es6$promise$$internal$$invokeCallback(settled, promise, callback, detail) {\n var hasCallback = lib$es6$promise$utils$$isFunction(callback),\n value, error, succeeded, failed;\n\n if (hasCallback) {\n value = lib$es6$promise$$internal$$tryCatch(callback, detail);\n\n if (value === lib$es6$promise$$internal$$TRY_CATCH_ERROR) {\n failed = true;\n error = value.error;\n value = null;\n } else {\n succeeded = true;\n }\n\n if (promise === value) {\n lib$es6$promise$$internal$$reject(promise, lib$es6$promise$$internal$$cannotReturnOwn());\n return;\n }\n\n } else {\n value = detail;\n succeeded = true;\n }\n\n if (promise._state !== lib$es6$promise$$internal$$PENDING) {\n // noop\n } else if (hasCallback && succeeded) {\n lib$es6$promise$$internal$$resolve(promise, value);\n } else if (failed) {\n lib$es6$promise$$internal$$reject(promise, error);\n } else if (settled === lib$es6$promise$$internal$$FULFILLED) {\n lib$es6$promise$$internal$$fulfill(promise, value);\n } else if (settled === lib$es6$promise$$internal$$REJECTED) {\n lib$es6$promise$$internal$$reject(promise, value);\n }\n }\n\n function lib$es6$promise$$internal$$initializePromise(promise, resolver) {\n try {\n resolver(function resolvePromise(value){\n lib$es6$promise$$internal$$resolve(promise, value);\n }, function rejectPromise(reason) {\n lib$es6$promise$$internal$$reject(promise, reason);\n });\n } catch(e) {\n lib$es6$promise$$internal$$reject(promise, e);\n }\n }\n\n function lib$es6$promise$enumerator$$Enumerator(Constructor, input) {\n var enumerator = this;\n\n enumerator._instanceConstructor = Constructor;\n enumerator.promise = new Constructor(lib$es6$promise$$internal$$noop);\n\n if (enumerator._validateInput(input)) {\n enumerator._input = input;\n enumerator.length = input.length;\n enumerator._remaining = input.length;\n\n enumerator._init();\n\n if (enumerator.length === 0) {\n lib$es6$promise$$internal$$fulfill(enumerator.promise, enumerator._result);\n } else {\n enumerator.length = enumerator.length || 0;\n enumerator._enumerate();\n if (enumerator._remaining === 0) {\n lib$es6$promise$$internal$$fulfill(enumerator.promise, enumerator._result);\n }\n }\n } else {\n lib$es6$promise$$internal$$reject(enumerator.promise, enumerator._validationError());\n }\n }\n\n lib$es6$promise$enumerator$$Enumerator.prototype._validateInput = function(input) {\n return lib$es6$promise$utils$$isArray(input);\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._validationError = function() {\n return new Error('Array Methods must be provided an Array');\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._init = function() {\n this._result = new Array(this.length);\n };\n\n var lib$es6$promise$enumerator$$default = lib$es6$promise$enumerator$$Enumerator;\n\n lib$es6$promise$enumerator$$Enumerator.prototype._enumerate = function() {\n var enumerator = this;\n\n var length = enumerator.length;\n var promise = enumerator.promise;\n var input = enumerator._input;\n\n for (var i = 0; promise._state === lib$es6$promise$$internal$$PENDING && i < length; i++) {\n enumerator._eachEntry(input[i], i);\n }\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._eachEntry = function(entry, i) {\n var enumerator = this;\n var c = enumerator._instanceConstructor;\n\n if (lib$es6$promise$utils$$isMaybeThenable(entry)) {\n if (entry.constructor === c && entry._state !== lib$es6$promise$$internal$$PENDING) {\n entry._onerror = null;\n enumerator._settledAt(entry._state, i, entry._result);\n } else {\n enumerator._willSettleAt(c.resolve(entry), i);\n }\n } else {\n enumerator._remaining--;\n enumerator._result[i] = entry;\n }\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._settledAt = function(state, i, value) {\n var enumerator = this;\n var promise = enumerator.promise;\n\n if (promise._state === lib$es6$promise$$internal$$PENDING) {\n enumerator._remaining--;\n\n if (state === lib$es6$promise$$internal$$REJECTED) {\n lib$es6$promise$$internal$$reject(promise, value);\n } else {\n enumerator._result[i] = value;\n }\n }\n\n if (enumerator._remaining === 0) {\n lib$es6$promise$$internal$$fulfill(promise, enumerator._result);\n }\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._willSettleAt = function(promise, i) {\n var enumerator = this;\n\n lib$es6$promise$$internal$$subscribe(promise, undefined, function(value) {\n enumerator._settledAt(lib$es6$promise$$internal$$FULFILLED, i, value);\n }, function(reason) {\n enumerator._settledAt(lib$es6$promise$$internal$$REJECTED, i, reason);\n });\n };\n function lib$es6$promise$promise$all$$all(entries) {\n return new lib$es6$promise$enumerator$$default(this, entries).promise;\n }\n var lib$es6$promise$promise$all$$default = lib$es6$promise$promise$all$$all;\n function lib$es6$promise$promise$race$$race(entries) {\n /*jshint validthis:true */\n var Constructor = this;\n\n var promise = new Constructor(lib$es6$promise$$internal$$noop);\n\n if (!lib$es6$promise$utils$$isArray(entries)) {\n lib$es6$promise$$internal$$reject(promise, new TypeError('You must pass an array to race.'));\n return promise;\n }\n\n var length = entries.length;\n\n function onFulfillment(value) {\n lib$es6$promise$$internal$$resolve(promise, value);\n }\n\n function onRejection(reason) {\n lib$es6$promise$$internal$$reject(promise, reason);\n }\n\n for (var i = 0; promise._state === lib$es6$promise$$internal$$PENDING && i < length; i++) {\n lib$es6$promise$$internal$$subscribe(Constructor.resolve(entries[i]), undefined, onFulfillment, onRejection);\n }\n\n return promise;\n }\n var lib$es6$promise$promise$race$$default = lib$es6$promise$promise$race$$race;\n function lib$es6$promise$promise$resolve$$resolve(object) {\n /*jshint validthis:true */\n var Constructor = this;\n\n if (object && typeof object === 'object' && object.constructor === Constructor) {\n return object;\n }\n\n var promise = new Constructor(lib$es6$promise$$internal$$noop);\n lib$es6$promise$$internal$$resolve(promise, object);\n return promise;\n }\n var lib$es6$promise$promise$resolve$$default = lib$es6$promise$promise$resolve$$resolve;\n function lib$es6$promise$promise$reject$$reject(reason) {\n /*jshint validthis:true */\n var Constructor = this;\n var promise = new Constructor(lib$es6$promise$$internal$$noop);\n lib$es6$promise$$internal$$reject(promise, reason);\n return promise;\n }\n var lib$es6$promise$promise$reject$$default = lib$es6$promise$promise$reject$$reject;\n\n var lib$es6$promise$promise$$counter = 0;\n\n function lib$es6$promise$promise$$needsResolver() {\n throw new TypeError('You must pass a resolver function as the first argument to the promise constructor');\n }\n\n function lib$es6$promise$promise$$needsNew() {\n throw new TypeError(\"Failed to construct 'Promise': Please use the 'new' operator, this object constructor cannot be called as a function.\");\n }\n\n var lib$es6$promise$promise$$default = lib$es6$promise$promise$$Promise;\n /**\n Promise objects represent the eventual result of an asynchronous operation. The\n primary way of interacting with a promise is through its `then` method, which\n registers callbacks to receive either a promise's eventual value or the reason\n why the promise cannot be fulfilled.\n\n Terminology\n -----------\n\n - `promise` is an object or function with a `then` method whose behavior conforms to this specification.\n - `thenable` is an object or function that defines a `then` method.\n - `value` is any legal JavaScript value (including undefined, a thenable, or a promise).\n - `exception` is a value that is thrown using the throw statement.\n - `reason` is a value that indicates why a promise was rejected.\n - `settled` the final resting state of a promise, fulfilled or rejected.\n\n A promise can be in one of three states: pending, fulfilled, or rejected.\n\n Promises that are fulfilled have a fulfillment value and are in the fulfilled\n state. Promises that are rejected have a rejection reason and are in the\n rejected state. A fulfillment value is never a thenable.\n\n Promises can also be said to *resolve* a value. If this value is also a\n promise, then the original promise's settled state will match the value's\n settled state. So a promise that *resolves* a promise that rejects will\n itself reject, and a promise that *resolves* a promise that fulfills will\n itself fulfill.\n\n\n Basic Usage:\n ------------\n\n ```js\n var promise = new Promise(function(resolve, reject) {\n // on success\n resolve(value);\n\n // on failure\n reject(reason);\n });\n\n promise.then(function(value) {\n // on fulfillment\n }, function(reason) {\n // on rejection\n });\n ```\n\n Advanced Usage:\n ---------------\n\n Promises shine when abstracting away asynchronous interactions such as\n `XMLHttpRequest`s.\n\n ```js\n function getJSON(url) {\n return new Promise(function(resolve, reject){\n var xhr = new XMLHttpRequest();\n\n xhr.open('GET', url);\n xhr.onreadystatechange = handler;\n xhr.responseType = 'json';\n xhr.setRequestHeader('Accept', 'application/json');\n xhr.send();\n\n function handler() {\n if (this.readyState === this.DONE) {\n if (this.status === 200) {\n resolve(this.response);\n } else {\n reject(new Error('getJSON: `' + url + '` failed with status: [' + this.status + ']'));\n }\n }\n };\n });\n }\n\n getJSON('/posts.json').then(function(json) {\n // on fulfillment\n }, function(reason) {\n // on rejection\n });\n ```\n\n Unlike callbacks, promises are great composable primitives.\n\n ```js\n Promise.all([\n getJSON('/posts'),\n getJSON('/comments')\n ]).then(function(values){\n values[0] // => postsJSON\n values[1] // => commentsJSON\n\n return values;\n });\n ```\n\n @class Promise\n @param {function} resolver\n Useful for tooling.\n @constructor\n */\n function lib$es6$promise$promise$$Promise(resolver) {\n this._id = lib$es6$promise$promise$$counter++;\n this._state = undefined;\n this._result = undefined;\n this._subscribers = [];\n\n if (lib$es6$promise$$internal$$noop !== resolver) {\n if (!lib$es6$promise$utils$$isFunction(resolver)) {\n lib$es6$promise$promise$$needsResolver();\n }\n\n if (!(this instanceof lib$es6$promise$promise$$Promise)) {\n lib$es6$promise$promise$$needsNew();\n }\n\n lib$es6$promise$$internal$$initializePromise(this, resolver);\n }\n }\n\n lib$es6$promise$promise$$Promise.all = lib$es6$promise$promise$all$$default;\n lib$es6$promise$promise$$Promise.race = lib$es6$promise$promise$race$$default;\n lib$es6$promise$promise$$Promise.resolve = lib$es6$promise$promise$resolve$$default;\n lib$es6$promise$promise$$Promise.reject = lib$es6$promise$promise$reject$$default;\n lib$es6$promise$promise$$Promise._setScheduler = lib$es6$promise$asap$$setScheduler;\n lib$es6$promise$promise$$Promise._setAsap = lib$es6$promise$asap$$setAsap;\n lib$es6$promise$promise$$Promise._asap = lib$es6$promise$asap$$asap;\n\n lib$es6$promise$promise$$Promise.prototype = {\n constructor: lib$es6$promise$promise$$Promise,\n\n /**\n The primary way of interacting with a promise is through its `then` method,\n which registers callbacks to receive either a promise's eventual value or the\n reason why the promise cannot be fulfilled.\n\n ```js\n findUser().then(function(user){\n // user is available\n }, function(reason){\n // user is unavailable, and you are given the reason why\n });\n ```\n\n Chaining\n --------\n\n The return value of `then` is itself a promise. This second, 'downstream'\n promise is resolved with the return value of the first promise's fulfillment\n or rejection handler, or rejected if the handler throws an exception.\n\n ```js\n findUser().then(function (user) {\n return user.name;\n }, function (reason) {\n return 'default name';\n }).then(function (userName) {\n // If `findUser` fulfilled, `userName` will be the user's name, otherwise it\n // will be `'default name'`\n });\n\n findUser().then(function (user) {\n throw new Error('Found user, but still unhappy');\n }, function (reason) {\n throw new Error('`findUser` rejected and we're unhappy');\n }).then(function (value) {\n // never reached\n }, function (reason) {\n // if `findUser` fulfilled, `reason` will be 'Found user, but still unhappy'.\n // If `findUser` rejected, `reason` will be '`findUser` rejected and we're unhappy'.\n });\n ```\n If the downstream promise does not specify a rejection handler, rejection reasons will be propagated further downstream.\n\n ```js\n findUser().then(function (user) {\n throw new PedagogicalException('Upstream error');\n }).then(function (value) {\n // never reached\n }).then(function (value) {\n // never reached\n }, function (reason) {\n // The `PedgagocialException` is propagated all the way down to here\n });\n ```\n\n Assimilation\n ------------\n\n Sometimes the value you want to propagate to a downstream promise can only be\n retrieved asynchronously. This can be achieved by returning a promise in the\n fulfillment or rejection handler. The downstream promise will then be pending\n until the returned promise is settled. This is called *assimilation*.\n\n ```js\n findUser().then(function (user) {\n return findCommentsByAuthor(user);\n }).then(function (comments) {\n // The user's comments are now available\n });\n ```\n\n If the assimliated promise rejects, then the downstream promise will also reject.\n\n ```js\n findUser().then(function (user) {\n return findCommentsByAuthor(user);\n }).then(function (comments) {\n // If `findCommentsByAuthor` fulfills, we'll have the value here\n }, function (reason) {\n // If `findCommentsByAuthor` rejects, we'll have the reason here\n });\n ```\n\n Simple Example\n --------------\n\n Synchronous Example\n\n ```javascript\n var result;\n\n try {\n result = findResult();\n // success\n } catch(reason) {\n // failure\n }\n ```\n\n Errback Example\n\n ```js\n findResult(function(result, err){\n if (err) {\n // failure\n } else {\n // success\n }\n });\n ```\n\n Promise Example;\n\n ```javascript\n findResult().then(function(result){\n // success\n }, function(reason){\n // failure\n });\n ```\n\n Advanced Example\n --------------\n\n Synchronous Example\n\n ```javascript\n var author, books;\n\n try {\n author = findAuthor();\n books = findBooksByAuthor(author);\n // success\n } catch(reason) {\n // failure\n }\n ```\n\n Errback Example\n\n ```js\n\n function foundBooks(books) {\n\n }\n\n function failure(reason) {\n\n }\n\n findAuthor(function(author, err){\n if (err) {\n failure(err);\n // failure\n } else {\n try {\n findBoooksByAuthor(author, function(books, err) {\n if (err) {\n failure(err);\n } else {\n try {\n foundBooks(books);\n } catch(reason) {\n failure(reason);\n }\n }\n });\n } catch(error) {\n failure(err);\n }\n // success\n }\n });\n ```\n\n Promise Example;\n\n ```javascript\n findAuthor().\n then(findBooksByAuthor).\n then(function(books){\n // found books\n }).catch(function(reason){\n // something went wrong\n });\n ```\n\n @method then\n @param {Function} onFulfilled\n @param {Function} onRejected\n Useful for tooling.\n @return {Promise}\n */\n then: function(onFulfillment, onRejection) {\n var parent = this;\n var state = parent._state;\n\n if (state === lib$es6$promise$$internal$$FULFILLED && !onFulfillment || state === lib$es6$promise$$internal$$REJECTED && !onRejection) {\n return this;\n }\n\n var child = new this.constructor(lib$es6$promise$$internal$$noop);\n var result = parent._result;\n\n if (state) {\n var callback = arguments[state - 1];\n lib$es6$promise$asap$$asap(function(){\n lib$es6$promise$$internal$$invokeCallback(state, child, callback, result);\n });\n } else {\n lib$es6$promise$$internal$$subscribe(parent, child, onFulfillment, onRejection);\n }\n\n return child;\n },\n\n /**\n `catch` is simply sugar for `then(undefined, onRejection)` which makes it the same\n as the catch block of a try/catch statement.\n\n ```js\n function findAuthor(){\n throw new Error('couldn't find that author');\n }\n\n // synchronous\n try {\n findAuthor();\n } catch(reason) {\n // something went wrong\n }\n\n // async with promises\n findAuthor().catch(function(reason){\n // something went wrong\n });\n ```\n\n @method catch\n @param {Function} onRejection\n Useful for tooling.\n @return {Promise}\n */\n 'catch': function(onRejection) {\n return this.then(null, onRejection);\n }\n };\n function lib$es6$promise$polyfill$$polyfill() {\n var local;\n\n if (typeof global !== 'undefined') {\n local = global;\n } else if (typeof self !== 'undefined') {\n local = self;\n } else {\n try {\n local = Function('return this')();\n } catch (e) {\n throw new Error('polyfill failed because global object is unavailable in this environment');\n }\n }\n\n var P = local.Promise;\n\n if (P && Object.prototype.toString.call(P.resolve()) === '[object Promise]' && !P.cast) {\n return;\n }\n\n local.Promise = lib$es6$promise$promise$$default;\n }\n var lib$es6$promise$polyfill$$default = lib$es6$promise$polyfill$$polyfill;\n\n var lib$es6$promise$umd$$ES6Promise = {\n 'Promise': lib$es6$promise$promise$$default,\n 'polyfill': lib$es6$promise$polyfill$$default\n };\n\n /* global define:true module:true window: true */\n if (typeof define === 'function' && define['amd']) {\n define(function() { return lib$es6$promise$umd$$ES6Promise; });\n } else if (typeof module !== 'undefined' && module['exports']) {\n module['exports'] = lib$es6$promise$umd$$ES6Promise;\n } else if (typeof this !== 'undefined') {\n this['ES6Promise'] = lib$es6$promise$umd$$ES6Promise;\n }\n\n lib$es6$promise$polyfill$$default();\n}).call(this);\n\n\n}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{\"_process\":386}],385:[function(require,module,exports){\n/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Javascript ZLib\n// By Thomas Down 2010-2011\n//\n// Based very heavily on portions of jzlib (by [email protected] ), who in\n// turn credits Jean-loup Gailly and Mark Adler for the original zlib code.\n//\n// inflate.js: ZLib inflate code\n//\n\n//\n// Shared constants\n//\n\nvar MAX_WBITS=15; // 32K LZ77 window\nvar DEF_WBITS=MAX_WBITS;\nvar MAX_MEM_LEVEL=9;\nvar MANY=1440;\nvar BMAX = 15;\n\n// preset dictionary flag in zlib header\nvar PRESET_DICT=0x20;\n\nvar Z_NO_FLUSH=0;\nvar Z_PARTIAL_FLUSH=1;\nvar Z_SYNC_FLUSH=2;\nvar Z_FULL_FLUSH=3;\nvar Z_FINISH=4;\n\nvar Z_DEFLATED=8;\n\nvar Z_OK=0;\nvar Z_STREAM_END=1;\nvar Z_NEED_DICT=2;\nvar Z_ERRNO=-1;\nvar Z_STREAM_ERROR=-2;\nvar Z_DATA_ERROR=-3;\nvar Z_MEM_ERROR=-4;\nvar Z_BUF_ERROR=-5;\nvar Z_VERSION_ERROR=-6;\n\nvar METHOD=0; // waiting for method byte\nvar FLAG=1; // waiting for flag byte\nvar DICT4=2; // four dictionary check bytes to go\nvar DICT3=3; // three dictionary check bytes to go\nvar DICT2=4; // two dictionary check bytes to go\nvar DICT1=5; // one dictionary check byte to go\nvar DICT0=6; // waiting for inflateSetDictionary\nvar BLOCKS=7; // decompressing blocks\nvar CHECK4=8; // four check bytes to go\nvar CHECK3=9; // three check bytes to go\nvar CHECK2=10; // two check bytes to go\nvar CHECK1=11; // one check byte to go\nvar DONE=12; // finished check, done\nvar BAD=13; // got an error--stay here\n\nvar inflate_mask = [0x00000000, 0x00000001, 0x00000003, 0x00000007, 0x0000000f, 0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff, 0x000001ff, 0x000003ff, 0x000007ff, 0x00000fff, 0x00001fff, 0x00003fff, 0x00007fff, 0x0000ffff];\n\nvar IB_TYPE=0; // get type bits (3, including end bit)\nvar IB_LENS=1; // get lengths for stored\nvar IB_STORED=2;// processing stored block\nvar IB_TABLE=3; // get table lengths\nvar IB_BTREE=4; // get bit lengths tree for a dynamic block\nvar IB_DTREE=5; // get length, distance trees for a dynamic block\nvar IB_CODES=6; // processing fixed or dynamic block\nvar IB_DRY=7; // output remaining window bytes\nvar IB_DONE=8; // finished last block, done\nvar IB_BAD=9; // ot a data error--stuck here\n\nvar fixed_bl = 9;\nvar fixed_bd = 5;\n\nvar fixed_tl = [\n 96,7,256, 0,8,80, 0,8,16, 84,8,115,\n 82,7,31, 0,8,112, 0,8,48, 0,9,192,\n 80,7,10, 0,8,96, 0,8,32, 0,9,160,\n 0,8,0, 0,8,128, 0,8,64, 0,9,224,\n 80,7,6, 0,8,88, 0,8,24, 0,9,144,\n 83,7,59, 0,8,120, 0,8,56, 0,9,208,\n 81,7,17, 0,8,104, 0,8,40, 0,9,176,\n 0,8,8, 0,8,136, 0,8,72, 0,9,240,\n 80,7,4, 0,8,84, 0,8,20, 85,8,227,\n 83,7,43, 0,8,116, 0,8,52, 0,9,200,\n 81,7,13, 0,8,100, 0,8,36, 0,9,168,\n 0,8,4, 0,8,132, 0,8,68, 0,9,232,\n 80,7,8, 0,8,92, 0,8,28, 0,9,152,\n 84,7,83, 0,8,124, 0,8,60, 0,9,216,\n 82,7,23, 0,8,108, 0,8,44, 0,9,184,\n 0,8,12, 0,8,140, 0,8,76, 0,9,248,\n 80,7,3, 0,8,82, 0,8,18, 85,8,163,\n 83,7,35, 0,8,114, 0,8,50, 0,9,196,\n 81,7,11, 0,8,98, 0,8,34, 0,9,164,\n 0,8,2, 0,8,130, 0,8,66, 0,9,228,\n 80,7,7, 0,8,90, 0,8,26, 0,9,148,\n 84,7,67, 0,8,122, 0,8,58, 0,9,212,\n 82,7,19, 0,8,106, 0,8,42, 0,9,180,\n 0,8,10, 0,8,138, 0,8,74, 0,9,244,\n 80,7,5, 0,8,86, 0,8,22, 192,8,0,\n 83,7,51, 0,8,118, 0,8,54, 0,9,204,\n 81,7,15, 0,8,102, 0,8,38, 0,9,172,\n 0,8,6, 0,8,134, 0,8,70, 0,9,236,\n 80,7,9, 0,8,94, 0,8,30, 0,9,156,\n 84,7,99, 0,8,126, 0,8,62, 0,9,220,\n 82,7,27, 0,8,110, 0,8,46, 0,9,188,\n 0,8,14, 0,8,142, 0,8,78, 0,9,252,\n 96,7,256, 0,8,81, 0,8,17, 85,8,131,\n 82,7,31, 0,8,113, 0,8,49, 0,9,194,\n 80,7,10, 0,8,97, 0,8,33, 0,9,162,\n 0,8,1, 0,8,129, 0,8,65, 0,9,226,\n 80,7,6, 0,8,89, 0,8,25, 0,9,146,\n 83,7,59, 0,8,121, 0,8,57, 0,9,210,\n 81,7,17, 0,8,105, 0,8,41, 0,9,178,\n 0,8,9, 0,8,137, 0,8,73, 0,9,242,\n 80,7,4, 0,8,85, 0,8,21, 80,8,258,\n 83,7,43, 0,8,117, 0,8,53, 0,9,202,\n 81,7,13, 0,8,101, 0,8,37, 0,9,170,\n 0,8,5, 0,8,133, 0,8,69, 0,9,234,\n 80,7,8, 0,8,93, 0,8,29, 0,9,154,\n 84,7,83, 0,8,125, 0,8,61, 0,9,218,\n 82,7,23, 0,8,109, 0,8,45, 0,9,186,\n 0,8,13, 0,8,141, 0,8,77, 0,9,250,\n 80,7,3, 0,8,83, 0,8,19, 85,8,195,\n 83,7,35, 0,8,115, 0,8,51, 0,9,198,\n 81,7,11, 0,8,99, 0,8,35, 0,9,166,\n 0,8,3, 0,8,131, 0,8,67, 0,9,230,\n 80,7,7, 0,8,91, 0,8,27, 0,9,150,\n 84,7,67, 0,8,123, 0,8,59, 0,9,214,\n 82,7,19, 0,8,107, 0,8,43, 0,9,182,\n 0,8,11, 0,8,139, 0,8,75, 0,9,246,\n 80,7,5, 0,8,87, 0,8,23, 192,8,0,\n 83,7,51, 0,8,119, 0,8,55, 0,9,206,\n 81,7,15, 0,8,103, 0,8,39, 0,9,174,\n 0,8,7, 0,8,135, 0,8,71, 0,9,238,\n 80,7,9, 0,8,95, 0,8,31, 0,9,158,\n 84,7,99, 0,8,127, 0,8,63, 0,9,222,\n 82,7,27, 0,8,111, 0,8,47, 0,9,190,\n 0,8,15, 0,8,143, 0,8,79, 0,9,254,\n 96,7,256, 0,8,80, 0,8,16, 84,8,115,\n 82,7,31, 0,8,112, 0,8,48, 0,9,193,\n\n 80,7,10, 0,8,96, 0,8,32, 0,9,161,\n 0,8,0, 0,8,128, 0,8,64, 0,9,225,\n 80,7,6, 0,8,88, 0,8,24, 0,9,145,\n 83,7,59, 0,8,120, 0,8,56, 0,9,209,\n 81,7,17, 0,8,104, 0,8,40, 0,9,177,\n 0,8,8, 0,8,136, 0,8,72, 0,9,241,\n 80,7,4, 0,8,84, 0,8,20, 85,8,227,\n 83,7,43, 0,8,116, 0,8,52, 0,9,201,\n 81,7,13, 0,8,100, 0,8,36, 0,9,169,\n 0,8,4, 0,8,132, 0,8,68, 0,9,233,\n 80,7,8, 0,8,92, 0,8,28, 0,9,153,\n 84,7,83, 0,8,124, 0,8,60, 0,9,217,\n 82,7,23, 0,8,108, 0,8,44, 0,9,185,\n 0,8,12, 0,8,140, 0,8,76, 0,9,249,\n 80,7,3, 0,8,82, 0,8,18, 85,8,163,\n 83,7,35, 0,8,114, 0,8,50, 0,9,197,\n 81,7,11, 0,8,98, 0,8,34, 0,9,165,\n 0,8,2, 0,8,130, 0,8,66, 0,9,229,\n 80,7,7, 0,8,90, 0,8,26, 0,9,149,\n 84,7,67, 0,8,122, 0,8,58, 0,9,213,\n 82,7,19, 0,8,106, 0,8,42, 0,9,181,\n 0,8,10, 0,8,138, 0,8,74, 0,9,245,\n 80,7,5, 0,8,86, 0,8,22, 192,8,0,\n 83,7,51, 0,8,118, 0,8,54, 0,9,205,\n 81,7,15, 0,8,102, 0,8,38, 0,9,173,\n 0,8,6, 0,8,134, 0,8,70, 0,9,237,\n 80,7,9, 0,8,94, 0,8,30, 0,9,157,\n 84,7,99, 0,8,126, 0,8,62, 0,9,221,\n 82,7,27, 0,8,110, 0,8,46, 0,9,189,\n 0,8,14, 0,8,142, 0,8,78, 0,9,253,\n 96,7,256, 0,8,81, 0,8,17, 85,8,131,\n 82,7,31, 0,8,113, 0,8,49, 0,9,195,\n 80,7,10, 0,8,97, 0,8,33, 0,9,163,\n 0,8,1, 0,8,129, 0,8,65, 0,9,227,\n 80,7,6, 0,8,89, 0,8,25, 0,9,147,\n 83,7,59, 0,8,121, 0,8,57, 0,9,211,\n 81,7,17, 0,8,105, 0,8,41, 0,9,179,\n 0,8,9, 0,8,137, 0,8,73, 0,9,243,\n 80,7,4, 0,8,85, 0,8,21, 80,8,258,\n 83,7,43, 0,8,117, 0,8,53, 0,9,203,\n 81,7,13, 0,8,101, 0,8,37, 0,9,171,\n 0,8,5, 0,8,133, 0,8,69, 0,9,235,\n 80,7,8, 0,8,93, 0,8,29, 0,9,155,\n 84,7,83, 0,8,125, 0,8,61, 0,9,219,\n 82,7,23, 0,8,109, 0,8,45, 0,9,187,\n 0,8,13, 0,8,141, 0,8,77, 0,9,251,\n 80,7,3, 0,8,83, 0,8,19, 85,8,195,\n 83,7,35, 0,8,115, 0,8,51, 0,9,199,\n 81,7,11, 0,8,99, 0,8,35, 0,9,167,\n 0,8,3, 0,8,131, 0,8,67, 0,9,231,\n 80,7,7, 0,8,91, 0,8,27, 0,9,151,\n 84,7,67, 0,8,123, 0,8,59, 0,9,215,\n 82,7,19, 0,8,107, 0,8,43, 0,9,183,\n 0,8,11, 0,8,139, 0,8,75, 0,9,247,\n 80,7,5, 0,8,87, 0,8,23, 192,8,0,\n 83,7,51, 0,8,119, 0,8,55, 0,9,207,\n 81,7,15, 0,8,103, 0,8,39, 0,9,175,\n 0,8,7, 0,8,135, 0,8,71, 0,9,239,\n 80,7,9, 0,8,95, 0,8,31, 0,9,159,\n 84,7,99, 0,8,127, 0,8,63, 0,9,223,\n 82,7,27, 0,8,111, 0,8,47, 0,9,191,\n 0,8,15, 0,8,143, 0,8,79, 0,9,255\n];\nvar fixed_td = [\n 80,5,1, 87,5,257, 83,5,17, 91,5,4097,\n 81,5,5, 89,5,1025, 85,5,65, 93,5,16385,\n 80,5,3, 88,5,513, 84,5,33, 92,5,8193,\n 82,5,9, 90,5,2049, 86,5,129, 192,5,24577,\n 80,5,2, 87,5,385, 83,5,25, 91,5,6145,\n 81,5,7, 89,5,1537, 85,5,97, 93,5,24577,\n 80,5,4, 88,5,769, 84,5,49, 92,5,12289,\n 82,5,13, 90,5,3073, 86,5,193, 192,5,24577\n];\n\n // Tables for deflate from PKZIP's appnote.txt.\n var cplens = [ // Copy lengths for literal codes 257..285\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n ];\n\n // see note #13 above about 258\n var cplext = [ // Extra bits for literal codes 257..285\n 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,\n 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112 // 112==invalid\n ];\n\n var cpdist = [ // Copy offsets for distance codes 0..29\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577\n ];\n\n var cpdext = [ // Extra bits for distance codes\n 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,\n 7, 7, 8, 8, 9, 9, 10, 10, 11, 11,\n 12, 12, 13, 13];\n\n//\n// ZStream.java\n//\n\nfunction ZStream() {\n}\n\n\nZStream.prototype.inflateInit = function(w, nowrap) {\n if (!w) {\n\tw = DEF_WBITS;\n }\n if (nowrap) {\n\tnowrap = false;\n }\n this.istate = new Inflate();\n return this.istate.inflateInit(this, nowrap?-w:w);\n}\n\nZStream.prototype.inflate = function(f) {\n if(this.istate==null) return Z_STREAM_ERROR;\n return this.istate.inflate(this, f);\n}\n\nZStream.prototype.inflateEnd = function(){\n if(this.istate==null) return Z_STREAM_ERROR;\n var ret=istate.inflateEnd(this);\n this.istate = null;\n return ret;\n}\nZStream.prototype.inflateSync = function(){\n // if(istate == null) return Z_STREAM_ERROR;\n return istate.inflateSync(this);\n}\nZStream.prototype.inflateSetDictionary = function(dictionary, dictLength){\n // if(istate == null) return Z_STREAM_ERROR;\n return istate.inflateSetDictionary(this, dictionary, dictLength);\n}\n\n/*\n\n public int deflateInit(int level){\n return deflateInit(level, MAX_WBITS);\n }\n public int deflateInit(int level, boolean nowrap){\n return deflateInit(level, MAX_WBITS, nowrap);\n }\n public int deflateInit(int level, int bits){\n return deflateInit(level, bits, false);\n }\n public int deflateInit(int level, int bits, boolean nowrap){\n dstate=new Deflate();\n return dstate.deflateInit(this, level, nowrap?-bits:bits);\n }\n public int deflate(int flush){\n if(dstate==null){\n return Z_STREAM_ERROR;\n }\n return dstate.deflate(this, flush);\n }\n public int deflateEnd(){\n if(dstate==null) return Z_STREAM_ERROR;\n int ret=dstate.deflateEnd();\n dstate=null;\n return ret;\n }\n public int deflateParams(int level, int strategy){\n if(dstate==null) return Z_STREAM_ERROR;\n return dstate.deflateParams(this, level, strategy);\n }\n public int deflateSetDictionary (byte[] dictionary, int dictLength){\n if(dstate == null)\n return Z_STREAM_ERROR;\n return dstate.deflateSetDictionary(this, dictionary, dictLength);\n }\n\n*/\n\n/*\n // Flush as much pending output as possible. All deflate() output goes\n // through this function so some applications may wish to modify it\n // to avoid allocating a large strm->next_out buffer and copying into it.\n // (See also read_buf()).\n void flush_pending(){\n int len=dstate.pending;\n\n if(len>avail_out) len=avail_out;\n if(len==0) return;\n\n if(dstate.pending_buf.length<=dstate.pending_out ||\n next_out.length<=next_out_index ||\n dstate.pending_buf.length<(dstate.pending_out+len) ||\n next_out.length<(next_out_index+len)){\n System.out.println(dstate.pending_buf.length+\", \"+dstate.pending_out+\n\t\t\t \", \"+next_out.length+\", \"+next_out_index+\", \"+len);\n System.out.println(\"avail_out=\"+avail_out);\n }\n\n System.arraycopy(dstate.pending_buf, dstate.pending_out,\n\t\t next_out, next_out_index, len);\n\n next_out_index+=len;\n dstate.pending_out+=len;\n total_out+=len;\n avail_out-=len;\n dstate.pending-=len;\n if(dstate.pending==0){\n dstate.pending_out=0;\n }\n }\n\n // Read a new buffer from the current input stream, update the adler32\n // and total number of bytes read. All deflate() input goes through\n // this function so some applications may wish to modify it to avoid\n // allocating a large strm->next_in buffer and copying from it.\n // (See also flush_pending()).\n int read_buf(byte[] buf, int start, int size) {\n int len=avail_in;\n\n if(len>size) len=size;\n if(len==0) return 0;\n\n avail_in-=len;\n\n if(dstate.noheader==0) {\n adler=_adler.adler32(adler, next_in, next_in_index, len);\n }\n System.arraycopy(next_in, next_in_index, buf, start, len);\n next_in_index += len;\n total_in += len;\n return len;\n }\n\n public void free(){\n next_in=null;\n next_out=null;\n msg=null;\n _adler=null;\n }\n}\n*/\n\n\n//\n// Inflate.java\n//\n\nfunction Inflate() {\n this.was = [0];\n}\n\nInflate.prototype.inflateReset = function(z) {\n if(z == null || z.istate == null) return Z_STREAM_ERROR;\n \n z.total_in = z.total_out = 0;\n z.msg = null;\n z.istate.mode = z.istate.nowrap!=0 ? BLOCKS : METHOD;\n z.istate.blocks.reset(z, null);\n return Z_OK;\n}\n\nInflate.prototype.inflateEnd = function(z){\n if(this.blocks != null)\n this.blocks.free(z);\n this.blocks=null;\n return Z_OK;\n}\n\nInflate.prototype.inflateInit = function(z, w){\n z.msg = null;\n this.blocks = null;\n\n // handle undocumented nowrap option (no zlib header or check)\n nowrap = 0;\n if(w < 0){\n w = - w;\n nowrap = 1;\n }\n\n // set window size\n if(w<8 ||w>15){\n this.inflateEnd(z);\n return Z_STREAM_ERROR;\n }\n this.wbits=w;\n\n z.istate.blocks=new InfBlocks(z, \n\t\t\t\t z.istate.nowrap!=0 ? null : this,\n\t\t\t\t 1<>4)+8>z.istate.wbits){\n z.istate.mode = BAD;\n z.msg=\"invalid window size\";\n z.istate.marker = 5; // can't try inflateSync\n break;\n }\n z.istate.mode=FLAG;\n case FLAG:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n b = (z.next_in[z.next_in_index++])&0xff;\n\n if((((z.istate.method << 8)+b) % 31)!=0){\n z.istate.mode = BAD;\n z.msg = \"incorrect header check\";\n z.istate.marker = 5; // can't try inflateSync\n break;\n }\n\n if((b&PRESET_DICT)==0){\n z.istate.mode = BLOCKS;\n break;\n }\n z.istate.mode = DICT4;\n case DICT4:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need=((z.next_in[z.next_in_index++]&0xff)<<24)&0xff000000;\n z.istate.mode=DICT3;\n case DICT3:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<16)&0xff0000;\n z.istate.mode=DICT2;\n case DICT2:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<8)&0xff00;\n z.istate.mode=DICT1;\n case DICT1:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need += (z.next_in[z.next_in_index++]&0xff);\n z.adler = z.istate.need;\n z.istate.mode = DICT0;\n return Z_NEED_DICT;\n case DICT0:\n z.istate.mode = BAD;\n z.msg = \"need dictionary\";\n z.istate.marker = 0; // can try inflateSync\n return Z_STREAM_ERROR;\n case BLOCKS:\n\n r = z.istate.blocks.proc(z, r);\n if(r == Z_DATA_ERROR){\n z.istate.mode = BAD;\n z.istate.marker = 0; // can try inflateSync\n break;\n }\n if(r == Z_OK){\n r = f;\n }\n if(r != Z_STREAM_END){\n return r;\n }\n r = f;\n z.istate.blocks.reset(z, z.istate.was);\n if(z.istate.nowrap!=0){\n z.istate.mode=DONE;\n break;\n }\n z.istate.mode=CHECK4;\n case CHECK4:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need=((z.next_in[z.next_in_index++]&0xff)<<24)&0xff000000;\n z.istate.mode=CHECK3;\n case CHECK3:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<16)&0xff0000;\n z.istate.mode = CHECK2;\n case CHECK2:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<8)&0xff00;\n z.istate.mode = CHECK1;\n case CHECK1:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=(z.next_in[z.next_in_index++]&0xff);\n\n if(((z.istate.was[0])) != ((z.istate.need))){\n z.istate.mode = BAD;\n z.msg = \"incorrect data check\";\n z.istate.marker = 5; // can't try inflateSync\n break;\n }\n\n z.istate.mode = DONE;\n case DONE:\n return Z_STREAM_END;\n case BAD:\n return Z_DATA_ERROR;\n default:\n return Z_STREAM_ERROR;\n }\n }\n }\n\n\nInflate.prototype.inflateSetDictionary = function(z, dictionary, dictLength) {\n var index=0;\n var length = dictLength;\n if(z==null || z.istate == null|| z.istate.mode != DICT0)\n return Z_STREAM_ERROR;\n\n if(z._adler.adler32(1, dictionary, 0, dictLength)!=z.adler){\n return Z_DATA_ERROR;\n }\n\n z.adler = z._adler.adler32(0, null, 0, 0);\n\n if(length >= (1<>> 1){\n case 0: // stored \n {b>>>=(3);k-=(3);}\n t = k & 7; // go to byte boundary\n\n {b>>>=(t);k-=(t);}\n this.mode = IB_LENS; // get length of stored block\n break;\n case 1: // fixed\n {\n var bl=new Int32Array(1);\n\t var bd=new Int32Array(1);\n var tl=[];\n\t var td=[];\n\n\t inflate_trees_fixed(bl, bd, tl, td, z);\n this.codes.init(bl[0], bd[0], tl[0], 0, td[0], 0, z);\n }\n\n {b>>>=(3);k-=(3);}\n\n this.mode = IB_CODES;\n break;\n case 2: // dynamic\n\n {b>>>=(3);k-=(3);}\n\n this.mode = IB_TABLE;\n break;\n case 3: // illegal\n\n {b>>>=(3);k-=(3);}\n this.mode = BAD;\n z.msg = \"invalid block type\";\n r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\tbreak;\n case IB_LENS:\n\twhile(k<(32)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>> 16) & 0xffff) != (b & 0xffff)){\n\t this.mode = BAD;\n\t z.msg = \"invalid stored block lengths\";\n\t r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\tthis.left = (b & 0xffff);\n\tb = k = 0; // dump bits\n\tthis.mode = this.left!=0 ? IB_STORED : (this.last!=0 ? IB_DRY : IB_TYPE);\n\tbreak;\n case IB_STORED:\n\tif (n == 0){\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\n\tif(m==0){\n\t if(q==end&&read!=0){\n\t q=0; m=(qn) t = n;\n\tif(t>m) t = m;\n\tarrayCopy(z.next_in, p, this.window, q, t);\n\tp += t; n -= t;\n\tq += t; m -= t;\n\tif ((this.left -= t) != 0)\n\t break;\n\tthis.mode = (this.last != 0 ? IB_DRY : IB_TYPE);\n\tbreak;\n case IB_TABLE:\n\n\twhile(k<(14)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)< 29 || ((t >> 5) & 0x1f) > 29)\n\t {\n\t this.mode = IB_BAD;\n\t z.msg = \"too many length or distance symbols\";\n\t r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t }\n\tt = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);\n\tif(this.blens==null || this.blens.length>>=(14);k-=(14);}\n\n\tthis.index = 0;\n\tmode = IB_BTREE;\n case IB_BTREE:\n\twhile (this.index < 4 + (this.table >>> 10)){\n\t while(k<(3)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>>=(3);k-=(3);}\n\t}\n\n\twhile(this.index < 19){\n\t this.blens[INFBLOCKS_BORDER[this.index++]] = 0;\n\t}\n\n\tthis.bb[0] = 7;\n\tt = this.inftree.inflate_trees_bits(this.blens, this.bb, this.tb, this.hufts, z);\n\tif (t != Z_OK){\n\t r = t;\n\t if (r == Z_DATA_ERROR){\n\t this.blens=null;\n\t this.mode = IB_BAD;\n\t }\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\n\tthis.index = 0;\n\tthis.mode = IB_DTREE;\n case IB_DTREE:\n\twhile (true){\n\t t = this.table;\n\t if(!(this.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))){\n\t break;\n\t }\n\n\t var h; //int[]\n\t var i, j, c;\n\n\t t = this.bb[0];\n\n\t while(k<(t)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>>=(t);k-=(t);\n\t this.blens[this.index++] = c;\n\t }\n\t else { // c == 16..18\n\t i = c == 18 ? 7 : c - 14;\n\t j = c == 18 ? 11 : 3;\n\n\t while(k<(t+i)){\n\t if(n!=0){\n\t\tr=Z_OK;\n\t }\n\t else{\n\t\tthis.bitb=b; this.bitk=k; \n\t\tz.avail_in=n;\n\t\tz.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t\tthis.write=q;\n\t\treturn this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>>=(t);k-=(t);\n\n\t j += (b & inflate_mask[i]);\n\n\t b>>>=(i);k-=(i);\n\n\t i = this.index;\n\t t = this.table;\n\t if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||\n\t\t(c == 16 && i < 1)){\n\t this.blens=null;\n\t this.mode = IB_BAD;\n\t z.msg = \"invalid bit length repeat\";\n\t r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t }\n\n\t c = c == 16 ? this.blens[i-1] : 0;\n\t do{\n\t this.blens[i++] = c;\n\t }\n\t while (--j!=0);\n\t this.index = i;\n\t }\n\t}\n\n\tthis.tb[0]=-1;\n\t{\n\t var bl=new Int32Array(1);\n\t var bd=new Int32Array(1);\n\t var tl=new Int32Array(1);\n\t var td=new Int32Array(1);\n\t bl[0] = 9; // must be <= 9 for lookahead assumptions\n\t bd[0] = 6; // must be <= 9 for lookahead assumptions\n\n\t t = this.table;\n\t t = this.inftree.inflate_trees_dynamic(257 + (t & 0x1f), \n\t\t\t\t\t 1 + ((t >> 5) & 0x1f),\n\t\t\t\t\t this.blens, bl, bd, tl, td, this.hufts, z);\n\n\t if (t != Z_OK){\n\t if (t == Z_DATA_ERROR){\n\t this.blens=null;\n\t this.mode = BAD;\n\t }\n\t r = t;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t }\n\t this.codes.init(bl[0], bd[0], this.hufts, tl[0], this.hufts, td[0], z);\n\t}\n\tthis.mode = IB_CODES;\n case IB_CODES:\n\tthis.bitb=b; this.bitk=k;\n\tz.avail_in=n; z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\n\tif ((r = this.codes.proc(this, z, r)) != Z_STREAM_END){\n\t return this.inflate_flush(z, r);\n\t}\n\tr = Z_OK;\n\tthis.codes.free(z);\n\n\tp=z.next_in_index; n=z.avail_in;b=this.bitb;k=this.bitk;\n\tq=this.write;m = (q < this.read ? this.read-q-1 : this.end-q);\n\n\tif (this.last==0){\n\t this.mode = IB_TYPE;\n\t break;\n\t}\n\tthis.mode = IB_DRY;\n case IB_DRY:\n\tthis.write=q; \n\tr = this.inflate_flush(z, r); \n\tq=this.write; m = (q < this.read ? this.read-q-1 : this.end-q);\n\tif (this.read != this.write){\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z, r);\n\t}\n\tmode = DONE;\n case IB_DONE:\n\tr = Z_STREAM_END;\n\n\tthis.bitb=b; this.bitk=k; \n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\treturn this.inflate_flush(z, r);\n case IB_BAD:\n\tr = Z_DATA_ERROR;\n\n\tthis.bitb=b; this.bitk=k; \n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\treturn this.inflate_flush(z, r);\n\n default:\n\tr = Z_STREAM_ERROR;\n\n\tthis.bitb=b; this.bitk=k; \n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\treturn this.inflate_flush(z, r);\n }\n }\n }\n\nInfBlocks.prototype.free = function(z){\n this.reset(z, null);\n this.window=null;\n this.hufts=null;\n}\n\nInfBlocks.prototype.set_dictionary = function(d, start, n){\n arrayCopy(d, start, window, 0, n);\n this.read = this.write = n;\n}\n\n // Returns true if inflate is currently at the end of a block generated\n // by Z_SYNC_FLUSH or Z_FULL_FLUSH. \nInfBlocks.prototype.sync_point = function(){\n return this.mode == IB_LENS;\n}\n\n // copy as much as possible from the sliding window to the output area\nInfBlocks.prototype.inflate_flush = function(z, r){\n var n;\n var p;\n var q;\n\n // local copies of source and destination pointers\n p = z.next_out_index;\n q = this.read;\n\n // compute number of bytes to copy as far as end of window\n n = ((q <= this.write ? this.write : this.end) - q);\n if (n > z.avail_out) n = z.avail_out;\n if (n!=0 && r == Z_BUF_ERROR) r = Z_OK;\n\n // update counters\n z.avail_out -= n;\n z.total_out += n;\n\n // update check information\n if(this.checkfn != null)\n z.adler=this.check=z._adler.adler32(this.check, this.window, q, n);\n\n // copy as far as end of window\n arrayCopy(this.window, q, z.next_out, p, n);\n p += n;\n q += n;\n\n // see if more to copy at beginning of window\n if (q == this.end){\n // wrap pointers\n q = 0;\n if (this.write == this.end)\n this.write = 0;\n\n // compute bytes to copy\n n = this.write - q;\n if (n > z.avail_out) n = z.avail_out;\n if (n!=0 && r == Z_BUF_ERROR) r = Z_OK;\n\n // update counters\n z.avail_out -= n;\n z.total_out += n;\n\n // update check information\n if(this.checkfn != null)\n\tz.adler=this.check=z._adler.adler32(this.check, this.window, q, n);\n\n // copy\n arrayCopy(this.window, q, z.next_out, p, n);\n p += n;\n q += n;\n }\n\n // update pointers\n z.next_out_index = p;\n this.read = q;\n\n // done\n return r;\n }\n\n//\n// InfCodes.java\n//\n\nvar IC_START=0; // x: set up for LEN\nvar IC_LEN=1; // i: get length/literal/eob next\nvar IC_LENEXT=2; // i: getting length extra (have base)\nvar IC_DIST=3; // i: get distance next\nvar IC_DISTEXT=4;// i: getting distance extra\nvar IC_COPY=5; // o: copying bytes in window, waiting for space\nvar IC_LIT=6; // o: got literal, waiting for output space\nvar IC_WASH=7; // o: got eob, possibly still output waiting\nvar IC_END=8; // x: got eob and all data flushed\nvar IC_BADCODE=9;// x: got error\n\nfunction InfCodes() {\n}\n\nInfCodes.prototype.init = function(bl, bd, tl, tl_index, td, td_index, z) {\n this.mode=IC_START;\n this.lbits=bl;\n this.dbits=bd;\n this.ltree=tl;\n this.ltree_index=tl_index;\n this.dtree = td;\n this.dtree_index=td_index;\n this.tree=null;\n}\n\nInfCodes.prototype.proc = function(s, z, r){ \n var j; // temporary storage\n var t; // temporary pointer (int[])\n var tindex; // temporary pointer\n var e; // extra bits or operation\n var b=0; // bit buffer\n var k=0; // bits in bit buffer\n var p=0; // input data pointer\n var n; // bytes available there\n var q; // output window write pointer\n var m; // bytes to end of window or read pointer\n var f; // pointer to copy strings from\n\n // copy input/output information to locals (UPDATE macro restores)\n p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;\n q=s.write;m=q= 258 && n >= 10){\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t r = this.inflate_fast(this.lbits, this.dbits, \n\t\t\t this.ltree, this.ltree_index, \n\t\t\t this.dtree, this.dtree_index,\n\t\t\t s, z);\n\n\t p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;\n\t q=s.write;m=q>>=(this.tree[tindex+1]);\n\tk-=(this.tree[tindex+1]);\n\n\te=this.tree[tindex];\n\n\tif(e == 0){ // literal\n\t this.lit = this.tree[tindex+2];\n\t this.mode = IC_LIT;\n\t break;\n\t}\n\tif((e & 16)!=0 ){ // length\n\t this.get = e & 15;\n\t this.len = this.tree[tindex+2];\n\t this.mode = IC_LENEXT;\n\t break;\n\t}\n\tif ((e & 64) == 0){ // next table\n\t this.need = e;\n\t this.tree_index = tindex/3 + this.tree[tindex+2];\n\t break;\n\t}\n\tif ((e & 32)!=0){ // end of block\n\t this.mode = IC_WASH;\n\t break;\n\t}\n\tthis.mode = IC_BADCODE; // invalid code\n\tz.msg = \"invalid literal/length code\";\n\tr = Z_DATA_ERROR;\n\n\ts.bitb=b;s.bitk=k;\n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\ts.write=q;\n\treturn s.inflate_flush(z,r);\n\n case IC_LENEXT: // i: getting length extra (have base)\n\tj = this.get;\n\n\twhile(k<(j)){\n\t if(n!=0)r=Z_OK;\n\t else{\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t return s.inflate_flush(z,r);\n\t }\n\t n--; b|=(z.next_in[p++]&0xff)<>=j;\n\tk-=j;\n\n\tthis.need = this.dbits;\n\tthis.tree = this.dtree;\n\tthis.tree_index = this.dtree_index;\n\tthis.mode = IC_DIST;\n case IC_DIST: // i: get distance next\n\tj = this.need;\n\n\twhile(k<(j)){\n\t if(n!=0)r=Z_OK;\n\t else{\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t return s.inflate_flush(z,r);\n\t }\n\t n--; b|=(z.next_in[p++]&0xff)<>=this.tree[tindex+1];\n\tk-=this.tree[tindex+1];\n\n\te = (this.tree[tindex]);\n\tif((e & 16)!=0){ // distance\n\t this.get = e & 15;\n\t this.dist = this.tree[tindex+2];\n\t this.mode = IC_DISTEXT;\n\t break;\n\t}\n\tif ((e & 64) == 0){ // next table\n\t this.need = e;\n\t this.tree_index = tindex/3 + this.tree[tindex+2];\n\t break;\n\t}\n\tthis.mode = IC_BADCODE; // invalid code\n\tz.msg = \"invalid distance code\";\n\tr = Z_DATA_ERROR;\n\n\ts.bitb=b;s.bitk=k;\n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\ts.write=q;\n\treturn s.inflate_flush(z,r);\n\n case IC_DISTEXT: // i: getting distance extra\n\tj = this.get;\n\n\twhile(k<(j)){\n\t if(n!=0)r=Z_OK;\n\t else{\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t return s.inflate_flush(z,r);\n\t }\n\t n--; b|=(z.next_in[p++]&0xff)<>=j;\n\tk-=j;\n\n\tthis.mode = IC_COPY;\n case IC_COPY: // o: copying bytes in window, waiting for space\n f = q - this.dist;\n while(f < 0){ // modulo window size-\"while\" instead\n f += s.end; // of \"if\" handles invalid distances\n\t}\n\twhile (this.len!=0){\n\n\t if(m==0){\n\t if(q==s.end&&s.read!=0){q=0;m=q 7){ // return unused byte, if any\n\t k -= 8;\n\t n++;\n\t p--; // can always return one\n\t}\n\n\ts.write=q; r=s.inflate_flush(z,r);\n\tq=s.write;m=q= 258 && n >= 10\n // get literal/length code\n while(k<(20)){ // max bits for literal/length code\n\tn--;\n\tb|=(z.next_in[p++]&0xff)<>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\ts.window[q++] = tp[tp_index_t_3+2];\n\tm--;\n\tcontinue;\n }\n do {\n\n\tb>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\tif((e&16)!=0){\n\t e &= 15;\n\t c = tp[tp_index_t_3+2] + (b & inflate_mask[e]);\n\n\t b>>=e; k-=e;\n\n\t // decode distance base of block to copy\n\t while(k<(15)){ // max bits for distance code\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\t if((e&16)!=0){\n\t // get extra bits to add to distance base\n\t e &= 15;\n\t while(k<(e)){ // get extra bits (up to 13)\n\t\tn--;\n\t\tb|=(z.next_in[p++]&0xff)<>=(e); k-=(e);\n\n\t // do the copy\n\t m -= c;\n\t if (q >= d){ // offset before dest\n\t\t// just copy\n\t\tr=q-d;\n\t\tif(q-r>0 && 2>(q-r)){ \n\t\t s.window[q++]=s.window[r++]; // minimum count is three,\n\t\t s.window[q++]=s.window[r++]; // so unroll loop a little\n\t\t c-=2;\n\t\t}\n\t\telse{\n\t\t s.window[q++]=s.window[r++]; // minimum count is three,\n\t\t s.window[q++]=s.window[r++]; // so unroll loop a little\n\t\t c-=2;\n\t\t}\n\t }\n\t else{ // else offset after destination\n r=q-d;\n do{\n r+=s.end; // force pointer in window\n }while(r<0); // covers invalid distances\n\t\te=s.end-r;\n\t\tif(c>e){ // if source crosses,\n\t\t c-=e; // wrapped copy\n\t\t if(q-r>0 && e>(q-r)){ \n\t\t do{s.window[q++] = s.window[r++];}\n\t\t while(--e!=0);\n\t\t }\n\t\t else{\n\t\t arrayCopy(s.window, r, s.window, q, e);\n\t\t q+=e; r+=e; e=0;\n\t\t }\n\t\t r = 0; // copy rest from start of window\n\t\t}\n\n\t }\n\n\t // copy all or what's left\n do{s.window[q++] = s.window[r++];}\n\t\twhile(--c!=0);\n\t break;\n\t }\n\t else if((e&64)==0){\n\t t+=tp[tp_index_t_3+2];\n\t t+=(b&inflate_mask[e]);\n\t tp_index_t_3=(tp_index+t)*3;\n\t e=tp[tp_index_t_3];\n\t }\n\t else{\n\t z.msg = \"invalid distance code\";\n\n\t c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\n\t return Z_DATA_ERROR;\n\t }\n\t }\n\t while(true);\n\t break;\n\t}\n\n\tif((e&64)==0){\n\t t+=tp[tp_index_t_3+2];\n\t t+=(b&inflate_mask[e]);\n\t tp_index_t_3=(tp_index+t)*3;\n\t if((e=tp[tp_index_t_3])==0){\n\n\t b>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\t s.window[q++]=tp[tp_index_t_3+2];\n\t m--;\n\t break;\n\t }\n\t}\n\telse if((e&32)!=0){\n\n\t c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n \n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\n\t return Z_STREAM_END;\n\t}\n\telse{\n\t z.msg=\"invalid literal/length code\";\n\n\t c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\n\t return Z_DATA_ERROR;\n\t}\n } \n while(true);\n } \n while(m>=258 && n>= 10);\n\n // not enough input or output--restore pointers and return\n c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n\n s.bitb=b;s.bitk=k;\n z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n s.write=q;\n\n return Z_OK;\n}\n\n//\n// InfTree.java\n//\n\nfunction InfTree() {\n}\n\nInfTree.prototype.huft_build = function(b, bindex, n, s, d, e, t, m, hp, hn, v) {\n\n // Given a list of code lengths and a maximum table size, make a set of\n // tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR\n // if the given code set is incomplete (the tables are still built in this\n // case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of\n // lengths), or Z_MEM_ERROR if not enough memory.\n\n var a; // counter for codes of length k\n var f; // i repeats in table every f entries\n var g; // maximum code length\n var h; // table level\n var i; // counter, current code\n var j; // counter\n var k; // number of bits in current code\n var l; // bits per table (returned in m)\n var mask; // (1 << w) - 1, to avoid cc -O bug on HP\n var p; // pointer into c[], b[], or v[]\n var q; // points to current table\n var w; // bits before this table == (l * h)\n var xp; // pointer into x\n var y; // number of dummy codes added\n var z; // number of entries in current table\n\n // Generate counts for each bit length\n\n p = 0; i = n;\n do {\n this.c[b[bindex+p]]++; p++; i--; // assume all entries <= BMAX\n }while(i!=0);\n\n if(this.c[0] == n){ // null input--all zero length codes\n t[0] = -1;\n m[0] = 0;\n return Z_OK;\n }\n\n // Find minimum and maximum length, bound *m by those\n l = m[0];\n for (j = 1; j <= BMAX; j++)\n if(this.c[j]!=0) break;\n k = j; // minimum code length\n if(l < j){\n l = j;\n }\n for (i = BMAX; i!=0; i--){\n if(this.c[i]!=0) break;\n }\n g = i; // maximum code length\n if(l > i){\n l = i;\n }\n m[0] = l;\n\n // Adjust last length count to fill out codes, if needed\n for (y = 1 << j; j < i; j++, y <<= 1){\n if ((y -= this.c[j]) < 0){\n return Z_DATA_ERROR;\n }\n }\n if ((y -= this.c[i]) < 0){\n return Z_DATA_ERROR;\n }\n this.c[i] += y;\n\n // Generate starting offsets into the value table for each length\n this.x[1] = j = 0;\n p = 1; xp = 2;\n while (--i!=0) { // note that i == g from above\n this.x[xp] = (j += this.c[p]);\n xp++;\n p++;\n }\n\n // Make a table of values in order of bit lengths\n i = 0; p = 0;\n do {\n if ((j = b[bindex+p]) != 0){\n this.v[this.x[j]++] = i;\n }\n p++;\n }\n while (++i < n);\n n = this.x[g]; // set n to length of v\n\n // Generate the Huffman codes and for each, make the table entries\n this.x[0] = i = 0; // first Huffman code is zero\n p = 0; // grab values in bit order\n h = -1; // no tables yet--level -1\n w = -l; // bits decoded == (l * h)\n this.u[0] = 0; // just to keep compilers happy\n q = 0; // ditto\n z = 0; // ditto\n\n // go through the bit lengths (k already is bits in shortest code)\n for (; k <= g; k++){\n a = this.c[k];\n while (a--!=0){\n\t// here i is the Huffman code of length k bits for value *p\n\t// make tables up to required level\n while (k > w + l){\n h++;\n w += l; // previous table always l bits\n\t // compute minimum size table less than or equal to l bits\n z = g - w;\n z = (z > l) ? l : z; // table size upper limit\n if((f=1<<(j=k-w))>a+1){ // try a k-w bit table\n // too few codes for k-w bit table\n f -= a + 1; // deduct codes from patterns left\n xp = k;\n if(j < z){\n while (++j < z){ // try smaller tables up to z bits\n if((f <<= 1) <= this.c[++xp])\n break; // enough codes to use up j bits\n f -= this.c[xp]; // else deduct codes from patterns\n }\n\t }\n }\n z = 1 << j; // table entries for j-bit table\n\n\t // allocate new table\n if (this.hn[0] + z > MANY){ // (note: doesn't matter for fixed)\n return Z_DATA_ERROR; // overflow of MANY\n }\n this.u[h] = q = /*hp+*/ this.hn[0]; // DEBUG\n this.hn[0] += z;\n \n\t // connect to last table, if there is one\n\t if(h!=0){\n this.x[h]=i; // save pattern for backing up\n this.r[0]=j; // bits in this table\n this.r[1]=l; // bits to dump before this table\n j=i>>>(w - l);\n this.r[2] = (q - this.u[h-1] - j); // offset to this table\n arrayCopy(this.r, 0, hp, (this.u[h-1]+j)*3, 3); // connect to last table\n }\n else{\n t[0] = q; // first table is returned result\n\t }\n }\n\n\t// set up table entry in r\n this.r[1] = (k - w);\n if (p >= n){\n this.r[0] = 128 + 64; // out of values--invalid code\n\t}\n else if (v[p] < s){\n this.r[0] = (this.v[p] < 256 ? 0 : 32 + 64); // 256 is end-of-block\n this.r[2] = this.v[p++]; // simple code is just the value\n }\n else{\n this.r[0]=(e[this.v[p]-s]+16+64); // non-simple--look up in lists\n this.r[2]=d[this.v[p++] - s];\n }\n\n // fill code-like entries with r\n f=1<<(k-w);\n for (j=i>>>w;j>>= 1){\n i ^= j;\n\t}\n i ^= j;\n\n\t// backup over finished tables\n mask = (1 << w) - 1; // needed on HP, cc -O bug\n while ((i & mask) != this.x[h]){\n h--; // don't need to update q\n w -= l;\n mask = (1 << w) - 1;\n }\n }\n }\n // Return Z_BUF_ERROR if we were given an incomplete table\n return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK;\n}\n\nInfTree.prototype.inflate_trees_bits = function(c, bb, tb, hp, z) {\n var result;\n this.initWorkArea(19);\n this.hn[0]=0;\n result = this.huft_build(c, 0, 19, 19, null, null, tb, bb, hp, this.hn, this.v);\n\n if(result == Z_DATA_ERROR){\n z.msg = \"oversubscribed dynamic bit lengths tree\";\n }\n else if(result == Z_BUF_ERROR || bb[0] == 0){\n z.msg = \"incomplete dynamic bit lengths tree\";\n result = Z_DATA_ERROR;\n }\n return result;\n}\n\nInfTree.prototype.inflate_trees_dynamic = function(nl, nd, c, bl, bd, tl, td, hp, z) {\n var result;\n\n // build literal/length tree\n this.initWorkArea(288);\n this.hn[0]=0;\n result = this.huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, this.hn, this.v);\n if (result != Z_OK || bl[0] == 0){\n if(result == Z_DATA_ERROR){\n z.msg = \"oversubscribed literal/length tree\";\n }\n else if (result != Z_MEM_ERROR){\n z.msg = \"incomplete literal/length tree\";\n result = Z_DATA_ERROR;\n }\n return result;\n }\n\n // build distance tree\n this.initWorkArea(288);\n result = this.huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, this.hn, this.v);\n\n if (result != Z_OK || (bd[0] == 0 && nl > 257)){\n if (result == Z_DATA_ERROR){\n z.msg = \"oversubscribed distance tree\";\n }\n else if (result == Z_BUF_ERROR) {\n z.msg = \"incomplete distance tree\";\n result = Z_DATA_ERROR;\n }\n else if (result != Z_MEM_ERROR){\n z.msg = \"empty distance tree with lengths\";\n result = Z_DATA_ERROR;\n }\n return result;\n }\n\n return Z_OK;\n}\n/*\n static int inflate_trees_fixed(int[] bl, //literal desired/actual bit depth\n int[] bd, //distance desired/actual bit depth\n int[][] tl,//literal/length tree result\n int[][] td,//distance tree result \n ZStream z //for memory allocation\n\t\t\t\t ){\n\n*/\n\nfunction inflate_trees_fixed(bl, bd, tl, td, z) {\n bl[0]=fixed_bl;\n bd[0]=fixed_bd;\n tl[0]=fixed_tl;\n td[0]=fixed_td;\n return Z_OK;\n}\n\nInfTree.prototype.initWorkArea = function(vsize){\n if(this.hn==null){\n this.hn=new Int32Array(1);\n this.v=new Int32Array(vsize);\n this.c=new Int32Array(BMAX+1);\n this.r=new Int32Array(3);\n this.u=new Int32Array(BMAX);\n this.x=new Int32Array(BMAX+1);\n }\n if(this.v.length 100) {\n arrayCopy_fast(new Uint8Array(src.buffer, src.byteOffset + srcOffset, count), dest, destOffset);\n } else { \n arrayCopy_slow(src, srcOffset, dest, destOffset, count);\n }\n\n}\n\nfunction arrayCopy_slow(src, srcOffset, dest, destOffset, count) {\n\n // dlog('_slow call: srcOffset=' + srcOffset + '; destOffset=' + destOffset + '; count=' + count);\n\n for (var i = 0; i < count; ++i) {\n dest[destOffset + i] = src[srcOffset + i];\n }\n}\n\nfunction arrayCopy_fast(src, dest, destOffset) {\n dest.set(src, destOffset);\n}\n\n\n // largest prime smaller than 65536\nvar ADLER_BASE=65521; \n // NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1\nvar ADLER_NMAX=5552;\n\nfunction adler32(adler, /* byte[] */ buf, index, len){\n if(buf == null){ return 1; }\n\n var s1=adler&0xffff;\n var s2=(adler>>16)&0xffff;\n var k;\n\n while(len > 0) {\n k=len=16){\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n k-=16;\n }\n if(k!=0){\n do{\n s1+=buf[index++]&0xff; s2+=s1;\n }\n while(--k!=0);\n }\n s1%=ADLER_BASE;\n s2%=ADLER_BASE;\n }\n return (s2<<16)|s1;\n}\n\n\n\nfunction jszlib_inflate_buffer(buffer, start, length, afterUncOffset) {\n if (!start) {\n buffer = new Uint8Array(buffer);\n } else if (!length) {\n buffer = new Uint8Array(buffer, start, buffer.byteLength - start);\n } else {\n buffer = new Uint8Array(buffer, start, length);\n }\n\n var z = new ZStream();\n z.inflateInit(DEF_WBITS, true);\n z.next_in = buffer;\n z.next_in_index = 0;\n z.avail_in = buffer.length;\n\n var oBlockList = [];\n var totalSize = 0;\n while (true) {\n var obuf = new Uint8Array(32000);\n z.next_out = obuf;\n z.next_out_index = 0;\n z.avail_out = obuf.length;\n var status = z.inflate(Z_NO_FLUSH);\n if (status != Z_OK && status != Z_STREAM_END && status != Z_BUF_ERROR) {\n throw z.msg;\n }\n if (z.avail_out != 0) {\n var newob = new Uint8Array(obuf.length - z.avail_out);\n arrayCopy(obuf, 0, newob, 0, (obuf.length - z.avail_out));\n obuf = newob;\n }\n oBlockList.push(obuf);\n totalSize += obuf.length;\n if (status == Z_STREAM_END || status == Z_BUF_ERROR) {\n break;\n }\n }\n\n if (afterUncOffset) {\n afterUncOffset[0] = (start || 0) + z.next_in_index;\n }\n\n if (oBlockList.length == 1) {\n return oBlockList[0].buffer;\n } else {\n var out = new Uint8Array(totalSize);\n var cursor = 0;\n for (var i = 0; i < oBlockList.length; ++i) {\n var b = oBlockList[i];\n arrayCopy(b, 0, out, cursor, b.length);\n cursor += b.length;\n }\n return out.buffer;\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n inflateBuffer: jszlib_inflate_buffer,\n arrayCopy: arrayCopy\n };\n}\n\n},{}],386:[function(require,module,exports){\n// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\n},{}],387:[function(require,module,exports){\n// Ramda v0.21.0\n// https://github.com/ramda/ramda\n// (c) 2013-2016 Scott Sauyet, Michael Hurley, and David Chambers\n// Ramda may be freely distributed under the MIT license.\n\n;(function() {\n\n 'use strict';\n\n /**\n * A special placeholder value used to specify \"gaps\" within curried functions,\n * allowing partial application of any combination of arguments, regardless of\n * their positions.\n *\n * If `g` is a curried ternary function and `_` is `R.__`, the following are\n * equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2, _)(1, 3)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @constant\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @example\n *\n * var greet = R.replace('{name}', R.__, 'Hello, {name}!');\n * greet('Alice'); //=> 'Hello, Alice!'\n */\n var __ = { '@@functional/placeholder': true };\n\n /* eslint-disable no-unused-vars */\n var _arity = function _arity(n, fn) {\n /* eslint-disable no-unused-vars */\n switch (n) {\n case 0:\n return function () {\n return fn.apply(this, arguments);\n };\n case 1:\n return function (a0) {\n return fn.apply(this, arguments);\n };\n case 2:\n return function (a0, a1) {\n return fn.apply(this, arguments);\n };\n case 3:\n return function (a0, a1, a2) {\n return fn.apply(this, arguments);\n };\n case 4:\n return function (a0, a1, a2, a3) {\n return fn.apply(this, arguments);\n };\n case 5:\n return function (a0, a1, a2, a3, a4) {\n return fn.apply(this, arguments);\n };\n case 6:\n return function (a0, a1, a2, a3, a4, a5) {\n return fn.apply(this, arguments);\n };\n case 7:\n return function (a0, a1, a2, a3, a4, a5, a6) {\n return fn.apply(this, arguments);\n };\n case 8:\n return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n return fn.apply(this, arguments);\n };\n case 9:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n return fn.apply(this, arguments);\n };\n case 10:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n return fn.apply(this, arguments);\n };\n default:\n throw new Error('First argument to _arity must be a non-negative integer no greater than ten');\n }\n };\n\n var _arrayFromIterator = function _arrayFromIterator(iter) {\n var list = [];\n var next;\n while (!(next = iter.next()).done) {\n list.push(next.value);\n }\n return list;\n };\n\n var _arrayOf = function _arrayOf() {\n return Array.prototype.slice.call(arguments);\n };\n\n var _cloneRegExp = function _cloneRegExp(pattern) {\n return new RegExp(pattern.source, (pattern.global ? 'g' : '') + (pattern.ignoreCase ? 'i' : '') + (pattern.multiline ? 'm' : '') + (pattern.sticky ? 'y' : '') + (pattern.unicode ? 'u' : ''));\n };\n\n var _complement = function _complement(f) {\n return function () {\n return !f.apply(this, arguments);\n };\n };\n\n /**\n * Private `concat` function to merge two array-like objects.\n *\n * @private\n * @param {Array|Arguments} [set1=[]] An array-like object.\n * @param {Array|Arguments} [set2=[]] An array-like object.\n * @return {Array} A new, merged array.\n * @example\n *\n * _concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n */\n var _concat = function _concat(set1, set2) {\n set1 = set1 || [];\n set2 = set2 || [];\n var idx;\n var len1 = set1.length;\n var len2 = set2.length;\n var result = [];\n idx = 0;\n while (idx < len1) {\n result[result.length] = set1[idx];\n idx += 1;\n }\n idx = 0;\n while (idx < len2) {\n result[result.length] = set2[idx];\n idx += 1;\n }\n return result;\n };\n\n var _containsWith = function _containsWith(pred, x, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n if (pred(x, list[idx])) {\n return true;\n }\n idx += 1;\n }\n return false;\n };\n\n var _filter = function _filter(fn, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n while (idx < len) {\n if (fn(list[idx])) {\n result[result.length] = list[idx];\n }\n idx += 1;\n }\n return result;\n };\n\n var _forceReduced = function _forceReduced(x) {\n return {\n '@@transducer/value': x,\n '@@transducer/reduced': true\n };\n };\n\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var _functionName = function _functionName(f) {\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var match = String(f).match(/^function (\\w*)/);\n return match == null ? '' : match[1];\n };\n\n var _has = function _has(prop, obj) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n };\n\n var _identity = function _identity(x) {\n return x;\n };\n\n var _isArguments = function () {\n var toString = Object.prototype.toString;\n return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n return toString.call(x) === '[object Arguments]';\n } : function _isArguments(x) {\n return _has('callee', x);\n };\n }();\n\n /**\n * Tests whether or not an object is an array.\n *\n * @private\n * @param {*} val The object to test.\n * @return {Boolean} `true` if `val` is an array, `false` otherwise.\n * @example\n *\n * _isArray([]); //=> true\n * _isArray(null); //=> false\n * _isArray({}); //=> false\n */\n var _isArray = Array.isArray || function _isArray(val) {\n return val != null && val.length >= 0 && Object.prototype.toString.call(val) === '[object Array]';\n };\n\n var _isFunction = function _isNumber(x) {\n return Object.prototype.toString.call(x) === '[object Function]';\n };\n\n /**\n * Determine if the passed argument is an integer.\n *\n * @private\n * @param {*} n\n * @category Type\n * @return {Boolean}\n */\n var _isInteger = Number.isInteger || function _isInteger(n) {\n return n << 0 === n;\n };\n\n var _isNumber = function _isNumber(x) {\n return Object.prototype.toString.call(x) === '[object Number]';\n };\n\n var _isObject = function _isObject(x) {\n return Object.prototype.toString.call(x) === '[object Object]';\n };\n\n var _isPlaceholder = function _isPlaceholder(a) {\n return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n };\n\n var _isRegExp = function _isRegExp(x) {\n return Object.prototype.toString.call(x) === '[object RegExp]';\n };\n\n var _isString = function _isString(x) {\n return Object.prototype.toString.call(x) === '[object String]';\n };\n\n var _isTransformer = function _isTransformer(obj) {\n return typeof obj['@@transducer/step'] === 'function';\n };\n\n var _map = function _map(fn, functor) {\n var idx = 0;\n var len = functor.length;\n var result = Array(len);\n while (idx < len) {\n result[idx] = fn(functor[idx]);\n idx += 1;\n }\n return result;\n };\n\n // Based on https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\n var _objectAssign = function _objectAssign(target) {\n if (target == null) {\n throw new TypeError('Cannot convert undefined or null to object');\n }\n var output = Object(target);\n var idx = 1;\n var length = arguments.length;\n while (idx < length) {\n var source = arguments[idx];\n if (source != null) {\n for (var nextKey in source) {\n if (_has(nextKey, source)) {\n output[nextKey] = source[nextKey];\n }\n }\n }\n idx += 1;\n }\n return output;\n };\n\n var _of = function _of(x) {\n return [x];\n };\n\n var _pipe = function _pipe(f, g) {\n return function () {\n return g.call(this, f.apply(this, arguments));\n };\n };\n\n var _pipeP = function _pipeP(f, g) {\n return function () {\n var ctx = this;\n return f.apply(ctx, arguments).then(function (x) {\n return g.call(ctx, x);\n });\n };\n };\n\n // \\b matches word boundary; [\\b] matches backspace\n var _quote = function _quote(s) {\n var escaped = s.replace(/\\\\/g, '\\\\\\\\').replace(/[\\b]/g, '\\\\b') // \\b matches word boundary; [\\b] matches backspace\n .replace(/\\f/g, '\\\\f').replace(/\\n/g, '\\\\n').replace(/\\r/g, '\\\\r').replace(/\\t/g, '\\\\t').replace(/\\v/g, '\\\\v').replace(/\\0/g, '\\\\0');\n return '\"' + escaped.replace(/\"/g, '\\\\\"') + '\"';\n };\n\n var _reduced = function _reduced(x) {\n return x && x['@@transducer/reduced'] ? x : {\n '@@transducer/value': x,\n '@@transducer/reduced': true\n };\n };\n\n /**\n * An optimized, private array `slice` implementation.\n *\n * @private\n * @param {Arguments|Array} args The array or arguments object to consider.\n * @param {Number} [from=0] The array index to slice from, inclusive.\n * @param {Number} [to=args.length] The array index to slice to, exclusive.\n * @return {Array} A new, sliced array.\n * @example\n *\n * _slice([1, 2, 3, 4, 5], 1, 3); //=> [2, 3]\n *\n * var firstThreeArgs = function(a, b, c, d) {\n * return _slice(arguments, 0, 3);\n * };\n * firstThreeArgs(1, 2, 3, 4); //=> [1, 2, 3]\n */\n var _slice = function _slice(args, from, to) {\n switch (arguments.length) {\n case 1:\n return _slice(args, 0, args.length);\n case 2:\n return _slice(args, from, args.length);\n default:\n var list = [];\n var idx = 0;\n var len = Math.max(0, Math.min(args.length, to) - from);\n while (idx < len) {\n list[idx] = args[from + idx];\n idx += 1;\n }\n return list;\n }\n };\n\n /**\n * Polyfill from .\n */\n var _toISOString = function () {\n var pad = function pad(n) {\n return (n < 10 ? '0' : '') + n;\n };\n return typeof Date.prototype.toISOString === 'function' ? function _toISOString(d) {\n return d.toISOString();\n } : function _toISOString(d) {\n return d.getUTCFullYear() + '-' + pad(d.getUTCMonth() + 1) + '-' + pad(d.getUTCDate()) + 'T' + pad(d.getUTCHours()) + ':' + pad(d.getUTCMinutes()) + ':' + pad(d.getUTCSeconds()) + '.' + (d.getUTCMilliseconds() / 1000).toFixed(3).slice(2, 5) + 'Z';\n };\n }();\n\n var _xfBase = {\n init: function () {\n return this.xf['@@transducer/init']();\n },\n result: function (result) {\n return this.xf['@@transducer/result'](result);\n }\n };\n\n var _xwrap = function () {\n function XWrap(fn) {\n this.f = fn;\n }\n XWrap.prototype['@@transducer/init'] = function () {\n throw new Error('init not implemented on XWrap');\n };\n XWrap.prototype['@@transducer/result'] = function (acc) {\n return acc;\n };\n XWrap.prototype['@@transducer/step'] = function (acc, x) {\n return this.f(acc, x);\n };\n return function _xwrap(fn) {\n return new XWrap(fn);\n };\n }();\n\n var _aperture = function _aperture(n, list) {\n var idx = 0;\n var limit = list.length - (n - 1);\n var acc = new Array(limit >= 0 ? limit : 0);\n while (idx < limit) {\n acc[idx] = _slice(list, idx, idx + n);\n idx += 1;\n }\n return acc;\n };\n\n var _assign = typeof Object.assign === 'function' ? Object.assign : _objectAssign;\n\n /**\n * Similar to hasMethod, this checks whether a function has a [methodname]\n * function. If it isn't an array it will execute that function otherwise it\n * will default to the ramda implementation.\n *\n * @private\n * @param {Function} fn ramda implemtation\n * @param {String} methodname property to check for a custom implementation\n * @return {Object} Whatever the return value of the method is.\n */\n var _checkForMethod = function _checkForMethod(methodname, fn) {\n return function () {\n var length = arguments.length;\n if (length === 0) {\n return fn();\n }\n var obj = arguments[length - 1];\n return _isArray(obj) || typeof obj[methodname] !== 'function' ? fn.apply(this, arguments) : obj[methodname].apply(obj, _slice(arguments, 0, length - 1));\n };\n };\n\n /**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curry1 = function _curry1(fn) {\n return function f1(a) {\n if (arguments.length === 0 || _isPlaceholder(a)) {\n return f1;\n } else {\n return fn.apply(this, arguments);\n }\n };\n };\n\n /**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curry2 = function _curry2(fn) {\n return function f2(a, b) {\n switch (arguments.length) {\n case 0:\n return f2;\n case 1:\n return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n return fn(a, _b);\n });\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b);\n }) : fn(a, b);\n }\n };\n };\n\n /**\n * Optimized internal three-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curry3 = function _curry3(fn) {\n return function f3(a, b, c) {\n switch (arguments.length) {\n case 0:\n return f3;\n case 1:\n return _isPlaceholder(a) ? f3 : _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n });\n case 2:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f3 : _isPlaceholder(a) ? _curry2(function (_a, _c) {\n return fn(_a, b, _c);\n }) : _isPlaceholder(b) ? _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n }) : _curry1(function (_c) {\n return fn(a, b, _c);\n });\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) && _isPlaceholder(c) ? f3 : _isPlaceholder(a) && _isPlaceholder(b) ? _curry2(function (_a, _b) {\n return fn(_a, _b, c);\n }) : _isPlaceholder(a) && _isPlaceholder(c) ? _curry2(function (_a, _c) {\n return fn(_a, b, _c);\n }) : _isPlaceholder(b) && _isPlaceholder(c) ? _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n }) : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b, c);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b, c);\n }) : _isPlaceholder(c) ? _curry1(function (_c) {\n return fn(a, b, _c);\n }) : fn(a, b, c);\n }\n };\n };\n\n /**\n * Internal curryN function.\n *\n * @private\n * @category Function\n * @param {Number} length The arity of the curried function.\n * @param {Array} received An array of arguments received thus far.\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curryN = function _curryN(length, received, fn) {\n return function () {\n var combined = [];\n var argsIdx = 0;\n var left = length;\n var combinedIdx = 0;\n while (combinedIdx < received.length || argsIdx < arguments.length) {\n var result;\n if (combinedIdx < received.length && (!_isPlaceholder(received[combinedIdx]) || argsIdx >= arguments.length)) {\n result = received[combinedIdx];\n } else {\n result = arguments[argsIdx];\n argsIdx += 1;\n }\n combined[combinedIdx] = result;\n if (!_isPlaceholder(result)) {\n left -= 1;\n }\n combinedIdx += 1;\n }\n return left <= 0 ? fn.apply(this, combined) : _arity(left, _curryN(length, combined, fn));\n };\n };\n\n /**\n * Returns a function that dispatches with different strategies based on the\n * object in list position (last argument). If it is an array, executes [fn].\n * Otherwise, if it has a function with [methodname], it will execute that\n * function (functor case). Otherwise, if it is a transformer, uses transducer\n * [xf] to return a new transformer (transducer case). Otherwise, it will\n * default to executing [fn].\n *\n * @private\n * @param {String} methodname property to check for a custom implementation\n * @param {Function} xf transducer to initialize if object is transformer\n * @param {Function} fn default ramda implementation\n * @return {Function} A function that dispatches on object in list position\n */\n var _dispatchable = function _dispatchable(methodname, xf, fn) {\n return function () {\n var length = arguments.length;\n if (length === 0) {\n return fn();\n }\n var obj = arguments[length - 1];\n if (!_isArray(obj)) {\n var args = _slice(arguments, 0, length - 1);\n if (typeof obj[methodname] === 'function') {\n return obj[methodname].apply(obj, args);\n }\n if (_isTransformer(obj)) {\n var transducer = xf.apply(null, args);\n return transducer(obj);\n }\n }\n return fn.apply(this, arguments);\n };\n };\n\n var _dropLastWhile = function dropLastWhile(pred, list) {\n var idx = list.length - 1;\n while (idx >= 0 && pred(list[idx])) {\n idx -= 1;\n }\n return _slice(list, 0, idx + 1);\n };\n\n var _xall = function () {\n function XAll(f, xf) {\n this.xf = xf;\n this.f = f;\n this.all = true;\n }\n XAll.prototype['@@transducer/init'] = _xfBase.init;\n XAll.prototype['@@transducer/result'] = function (result) {\n if (this.all) {\n result = this.xf['@@transducer/step'](result, true);\n }\n return this.xf['@@transducer/result'](result);\n };\n XAll.prototype['@@transducer/step'] = function (result, input) {\n if (!this.f(input)) {\n this.all = false;\n result = _reduced(this.xf['@@transducer/step'](result, false));\n }\n return result;\n };\n return _curry2(function _xall(f, xf) {\n return new XAll(f, xf);\n });\n }();\n\n var _xany = function () {\n function XAny(f, xf) {\n this.xf = xf;\n this.f = f;\n this.any = false;\n }\n XAny.prototype['@@transducer/init'] = _xfBase.init;\n XAny.prototype['@@transducer/result'] = function (result) {\n if (!this.any) {\n result = this.xf['@@transducer/step'](result, false);\n }\n return this.xf['@@transducer/result'](result);\n };\n XAny.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.any = true;\n result = _reduced(this.xf['@@transducer/step'](result, true));\n }\n return result;\n };\n return _curry2(function _xany(f, xf) {\n return new XAny(f, xf);\n });\n }();\n\n var _xaperture = function () {\n function XAperture(n, xf) {\n this.xf = xf;\n this.pos = 0;\n this.full = false;\n this.acc = new Array(n);\n }\n XAperture.prototype['@@transducer/init'] = _xfBase.init;\n XAperture.prototype['@@transducer/result'] = function (result) {\n this.acc = null;\n return this.xf['@@transducer/result'](result);\n };\n XAperture.prototype['@@transducer/step'] = function (result, input) {\n this.store(input);\n return this.full ? this.xf['@@transducer/step'](result, this.getCopy()) : result;\n };\n XAperture.prototype.store = function (input) {\n this.acc[this.pos] = input;\n this.pos += 1;\n if (this.pos === this.acc.length) {\n this.pos = 0;\n this.full = true;\n }\n };\n XAperture.prototype.getCopy = function () {\n return _concat(_slice(this.acc, this.pos), _slice(this.acc, 0, this.pos));\n };\n return _curry2(function _xaperture(n, xf) {\n return new XAperture(n, xf);\n });\n }();\n\n var _xdrop = function () {\n function XDrop(n, xf) {\n this.xf = xf;\n this.n = n;\n }\n XDrop.prototype['@@transducer/init'] = _xfBase.init;\n XDrop.prototype['@@transducer/result'] = _xfBase.result;\n XDrop.prototype['@@transducer/step'] = function (result, input) {\n if (this.n > 0) {\n this.n -= 1;\n return result;\n }\n return this.xf['@@transducer/step'](result, input);\n };\n return _curry2(function _xdrop(n, xf) {\n return new XDrop(n, xf);\n });\n }();\n\n var _xdropLast = function () {\n function XDropLast(n, xf) {\n this.xf = xf;\n this.pos = 0;\n this.full = false;\n this.acc = new Array(n);\n }\n XDropLast.prototype['@@transducer/init'] = _xfBase.init;\n XDropLast.prototype['@@transducer/result'] = function (result) {\n this.acc = null;\n return this.xf['@@transducer/result'](result);\n };\n XDropLast.prototype['@@transducer/step'] = function (result, input) {\n if (this.full) {\n result = this.xf['@@transducer/step'](result, this.acc[this.pos]);\n }\n this.store(input);\n return result;\n };\n XDropLast.prototype.store = function (input) {\n this.acc[this.pos] = input;\n this.pos += 1;\n if (this.pos === this.acc.length) {\n this.pos = 0;\n this.full = true;\n }\n };\n return _curry2(function _xdropLast(n, xf) {\n return new XDropLast(n, xf);\n });\n }();\n\n var _xdropRepeatsWith = function () {\n function XDropRepeatsWith(pred, xf) {\n this.xf = xf;\n this.pred = pred;\n this.lastValue = undefined;\n this.seenFirstValue = false;\n }\n XDropRepeatsWith.prototype['@@transducer/init'] = function () {\n return this.xf['@@transducer/init']();\n };\n XDropRepeatsWith.prototype['@@transducer/result'] = function (result) {\n return this.xf['@@transducer/result'](result);\n };\n XDropRepeatsWith.prototype['@@transducer/step'] = function (result, input) {\n var sameAsLast = false;\n if (!this.seenFirstValue) {\n this.seenFirstValue = true;\n } else if (this.pred(this.lastValue, input)) {\n sameAsLast = true;\n }\n this.lastValue = input;\n return sameAsLast ? result : this.xf['@@transducer/step'](result, input);\n };\n return _curry2(function _xdropRepeatsWith(pred, xf) {\n return new XDropRepeatsWith(pred, xf);\n });\n }();\n\n var _xdropWhile = function () {\n function XDropWhile(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XDropWhile.prototype['@@transducer/init'] = _xfBase.init;\n XDropWhile.prototype['@@transducer/result'] = _xfBase.result;\n XDropWhile.prototype['@@transducer/step'] = function (result, input) {\n if (this.f) {\n if (this.f(input)) {\n return result;\n }\n this.f = null;\n }\n return this.xf['@@transducer/step'](result, input);\n };\n return _curry2(function _xdropWhile(f, xf) {\n return new XDropWhile(f, xf);\n });\n }();\n\n var _xfilter = function () {\n function XFilter(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XFilter.prototype['@@transducer/init'] = _xfBase.init;\n XFilter.prototype['@@transducer/result'] = _xfBase.result;\n XFilter.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.xf['@@transducer/step'](result, input) : result;\n };\n return _curry2(function _xfilter(f, xf) {\n return new XFilter(f, xf);\n });\n }();\n\n var _xfind = function () {\n function XFind(f, xf) {\n this.xf = xf;\n this.f = f;\n this.found = false;\n }\n XFind.prototype['@@transducer/init'] = _xfBase.init;\n XFind.prototype['@@transducer/result'] = function (result) {\n if (!this.found) {\n result = this.xf['@@transducer/step'](result, void 0);\n }\n return this.xf['@@transducer/result'](result);\n };\n XFind.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.found = true;\n result = _reduced(this.xf['@@transducer/step'](result, input));\n }\n return result;\n };\n return _curry2(function _xfind(f, xf) {\n return new XFind(f, xf);\n });\n }();\n\n var _xfindIndex = function () {\n function XFindIndex(f, xf) {\n this.xf = xf;\n this.f = f;\n this.idx = -1;\n this.found = false;\n }\n XFindIndex.prototype['@@transducer/init'] = _xfBase.init;\n XFindIndex.prototype['@@transducer/result'] = function (result) {\n if (!this.found) {\n result = this.xf['@@transducer/step'](result, -1);\n }\n return this.xf['@@transducer/result'](result);\n };\n XFindIndex.prototype['@@transducer/step'] = function (result, input) {\n this.idx += 1;\n if (this.f(input)) {\n this.found = true;\n result = _reduced(this.xf['@@transducer/step'](result, this.idx));\n }\n return result;\n };\n return _curry2(function _xfindIndex(f, xf) {\n return new XFindIndex(f, xf);\n });\n }();\n\n var _xfindLast = function () {\n function XFindLast(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XFindLast.prototype['@@transducer/init'] = _xfBase.init;\n XFindLast.prototype['@@transducer/result'] = function (result) {\n return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.last));\n };\n XFindLast.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.last = input;\n }\n return result;\n };\n return _curry2(function _xfindLast(f, xf) {\n return new XFindLast(f, xf);\n });\n }();\n\n var _xfindLastIndex = function () {\n function XFindLastIndex(f, xf) {\n this.xf = xf;\n this.f = f;\n this.idx = -1;\n this.lastIdx = -1;\n }\n XFindLastIndex.prototype['@@transducer/init'] = _xfBase.init;\n XFindLastIndex.prototype['@@transducer/result'] = function (result) {\n return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.lastIdx));\n };\n XFindLastIndex.prototype['@@transducer/step'] = function (result, input) {\n this.idx += 1;\n if (this.f(input)) {\n this.lastIdx = this.idx;\n }\n return result;\n };\n return _curry2(function _xfindLastIndex(f, xf) {\n return new XFindLastIndex(f, xf);\n });\n }();\n\n var _xmap = function () {\n function XMap(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XMap.prototype['@@transducer/init'] = _xfBase.init;\n XMap.prototype['@@transducer/result'] = _xfBase.result;\n XMap.prototype['@@transducer/step'] = function (result, input) {\n return this.xf['@@transducer/step'](result, this.f(input));\n };\n return _curry2(function _xmap(f, xf) {\n return new XMap(f, xf);\n });\n }();\n\n var _xtake = function () {\n function XTake(n, xf) {\n this.xf = xf;\n this.n = n;\n }\n XTake.prototype['@@transducer/init'] = _xfBase.init;\n XTake.prototype['@@transducer/result'] = _xfBase.result;\n XTake.prototype['@@transducer/step'] = function (result, input) {\n if (this.n === 0) {\n return _reduced(result);\n } else {\n this.n -= 1;\n return this.xf['@@transducer/step'](result, input);\n }\n };\n return _curry2(function _xtake(n, xf) {\n return new XTake(n, xf);\n });\n }();\n\n var _xtakeWhile = function () {\n function XTakeWhile(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XTakeWhile.prototype['@@transducer/init'] = _xfBase.init;\n XTakeWhile.prototype['@@transducer/result'] = _xfBase.result;\n XTakeWhile.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.xf['@@transducer/step'](result, input) : _reduced(result);\n };\n return _curry2(function _xtakeWhile(f, xf) {\n return new XTakeWhile(f, xf);\n });\n }();\n\n /**\n * Adds two values.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a\n * @param {Number} b\n * @return {Number}\n * @see R.subtract\n * @example\n *\n * R.add(2, 3); //=> 5\n * R.add(7)(10); //=> 17\n */\n var add = _curry2(function add(a, b) {\n return Number(a) + Number(b);\n });\n\n /**\n * Applies a function to the value at the given index of an array, returning a\n * new copy of the array with the element at the given index replaced with the\n * result of the function application.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig (a -> a) -> Number -> [a] -> [a]\n * @param {Function} fn The function to apply.\n * @param {Number} idx The index.\n * @param {Array|Arguments} list An array-like object whose value\n * at the supplied index will be replaced.\n * @return {Array} A copy of the supplied array-like object with\n * the element at index `idx` replaced with the value\n * returned by applying `fn` to the existing element.\n * @see R.update\n * @example\n *\n * R.adjust(R.add(10), 1, [0, 1, 2]); //=> [0, 11, 2]\n * R.adjust(R.add(10))(1)([0, 1, 2]); //=> [0, 11, 2]\n */\n var adjust = _curry3(function adjust(fn, idx, list) {\n if (idx >= list.length || idx < -list.length) {\n return list;\n }\n var start = idx < 0 ? list.length : 0;\n var _idx = start + idx;\n var _list = _concat(list);\n _list[_idx] = fn(list[_idx]);\n return _list;\n });\n\n /**\n * Returns `true` if all elements of the list match the predicate, `false` if\n * there are any that don't.\n *\n * Dispatches to the `all` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by every element, `false`\n * otherwise.\n * @see R.any, R.none, R.transduce\n * @example\n *\n * var lessThan2 = R.flip(R.lt)(2);\n * var lessThan3 = R.flip(R.lt)(3);\n * R.all(lessThan2)([1, 2]); //=> false\n * R.all(lessThan3)([1, 2]); //=> true\n */\n var all = _curry2(_dispatchable('all', _xall, function all(fn, list) {\n var idx = 0;\n while (idx < list.length) {\n if (!fn(list[idx])) {\n return false;\n }\n idx += 1;\n }\n return true;\n }));\n\n /**\n * Returns a function that always returns the given value. Note that for\n * non-primitives the value returned is a reference to the original value.\n *\n * This function is known as `const`, `constant`, or `K` (for K combinator) in\n * other languages and libraries.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> (* -> a)\n * @param {*} val The value to wrap in a function\n * @return {Function} A Function :: * -> val.\n * @example\n *\n * var t = R.always('Tee');\n * t(); //=> 'Tee'\n */\n var always = _curry1(function always(val) {\n return function () {\n return val;\n };\n });\n\n /**\n * Returns `true` if both arguments are `true`; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> * -> *\n * @param {Boolean} a A boolean value\n * @param {Boolean} b A boolean value\n * @return {Boolean} `true` if both arguments are `true`, `false` otherwise\n * @see R.both\n * @example\n *\n * R.and(true, true); //=> true\n * R.and(true, false); //=> false\n * R.and(false, true); //=> false\n * R.and(false, false); //=> false\n */\n var and = _curry2(function and(a, b) {\n return a && b;\n });\n\n /**\n * Returns `true` if at least one of elements of the list match the predicate,\n * `false` otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by at least one element, `false`\n * otherwise.\n * @see R.all, R.none, R.transduce\n * @example\n *\n * var lessThan0 = R.flip(R.lt)(0);\n * var lessThan2 = R.flip(R.lt)(2);\n * R.any(lessThan0)([1, 2]); //=> false\n * R.any(lessThan2)([1, 2]); //=> true\n */\n var any = _curry2(_dispatchable('any', _xany, function any(fn, list) {\n var idx = 0;\n while (idx < list.length) {\n if (fn(list[idx])) {\n return true;\n }\n idx += 1;\n }\n return false;\n }));\n\n /**\n * Returns a new list, composed of n-tuples of consecutive elements If `n` is\n * greater than the length of the list, an empty list is returned.\n *\n * Dispatches to the `aperture` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @param {Number} n The size of the tuples to create\n * @param {Array} list The list to split into `n`-tuples\n * @return {Array} The new list.\n * @see R.transduce\n * @example\n *\n * R.aperture(2, [1, 2, 3, 4, 5]); //=> [[1, 2], [2, 3], [3, 4], [4, 5]]\n * R.aperture(3, [1, 2, 3, 4, 5]); //=> [[1, 2, 3], [2, 3, 4], [3, 4, 5]]\n * R.aperture(7, [1, 2, 3, 4, 5]); //=> []\n */\n var aperture = _curry2(_dispatchable('aperture', _xaperture, _aperture));\n\n /**\n * Returns a new list containing the contents of the given list, followed by\n * the given element.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The element to add to the end of the new list.\n * @param {Array} list The list whose contents will be added to the beginning of the output\n * list.\n * @return {Array} A new list containing the contents of the old list followed by `el`.\n * @see R.prepend\n * @example\n *\n * R.append('tests', ['write', 'more']); //=> ['write', 'more', 'tests']\n * R.append('tests', []); //=> ['tests']\n * R.append(['tests'], ['write', 'more']); //=> ['write', 'more', ['tests']]\n */\n var append = _curry2(function append(el, list) {\n return _concat(list, [el]);\n });\n\n /**\n * Applies function `fn` to the argument list `args`. This is useful for\n * creating a fixed-arity function from a variadic function. `fn` should be a\n * bound function if context is significant.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> a) -> [*] -> a\n * @param {Function} fn\n * @param {Array} args\n * @return {*}\n * @see R.call, R.unapply\n * @example\n *\n * var nums = [1, 2, 3, -99, 42, 6, 7];\n * R.apply(Math.max, nums); //=> 42\n */\n var apply = _curry2(function apply(fn, args) {\n return fn.apply(this, args);\n });\n\n /**\n * Makes a shallow clone of an object, setting or overriding the specified\n * property with the given value. Note that this copies and flattens prototype\n * properties onto the new object as well. All non-primitive properties are\n * copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig String -> a -> {k: v} -> {k: v}\n * @param {String} prop the property name to set\n * @param {*} val the new value\n * @param {Object} obj the object to clone\n * @return {Object} a new object similar to the original except for the specified property.\n * @see R.dissoc\n * @example\n *\n * R.assoc('c', 3, {a: 1, b: 2}); //=> {a: 1, b: 2, c: 3}\n */\n var assoc = _curry3(function assoc(prop, val, obj) {\n var result = {};\n for (var p in obj) {\n result[p] = obj[p];\n }\n result[prop] = val;\n return result;\n });\n\n /**\n * Makes a shallow clone of an object, setting or overriding the nodes required\n * to create the given path, and placing the specific value at the tail end of\n * that path. Note that this copies and flattens prototype properties onto the\n * new object as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig [String] -> a -> {k: v} -> {k: v}\n * @param {Array} path the path to set\n * @param {*} val the new value\n * @param {Object} obj the object to clone\n * @return {Object} a new object similar to the original except along the specified path.\n * @see R.dissocPath\n * @example\n *\n * R.assocPath(['a', 'b', 'c'], 42, {a: {b: {c: 0}}}); //=> {a: {b: {c: 42}}}\n */\n var assocPath = _curry3(function assocPath(path, val, obj) {\n switch (path.length) {\n case 0:\n return val;\n case 1:\n return assoc(path[0], val, obj);\n default:\n return assoc(path[0], assocPath(_slice(path, 1), val, Object(obj[path[0]])), obj);\n }\n });\n\n /**\n * Creates a function that is bound to a context.\n * Note: `R.bind` does not provide the additional argument-binding capabilities of\n * [Function.prototype.bind](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/bind).\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @category Object\n * @sig (* -> *) -> {*} -> (* -> *)\n * @param {Function} fn The function to bind to context\n * @param {Object} thisObj The context to bind `fn` to\n * @return {Function} A function that will execute in the context of `thisObj`.\n * @see R.partial\n */\n var bind = _curry2(function bind(fn, thisObj) {\n return _arity(fn.length, function () {\n return fn.apply(thisObj, arguments);\n });\n });\n\n /**\n * Restricts a number to be within a range.\n *\n * Also works for other ordered types such as Strings and Dates.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Relation\n * @sig Ord a => a -> a -> a -> a\n * @param {Number} minimum number\n * @param {Number} maximum number\n * @param {Number} value to be clamped\n * @return {Number} Returns the clamped value\n * @example\n *\n * R.clamp(1, 10, -1) // => 1\n * R.clamp(1, 10, 11) // => 10\n * R.clamp(1, 10, 4) // => 4\n */\n var clamp = _curry3(function clamp(min, max, value) {\n if (min > max) {\n throw new Error('min must not be greater than max in clamp(min, max, value)');\n }\n return value < min ? min : value > max ? max : value;\n });\n\n /**\n * Makes a comparator function out of a function that reports whether the first\n * element is less than the second.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a, b -> Boolean) -> (a, b -> Number)\n * @param {Function} pred A predicate function of arity two.\n * @return {Function} A Function :: a -> b -> Int that returns `-1` if a < b, `1` if b < a, otherwise `0`.\n * @example\n *\n * var cmp = R.comparator((a, b) => a.age < b.age);\n * var people = [\n * // ...\n * ];\n * R.sort(cmp, people);\n */\n var comparator = _curry1(function comparator(pred) {\n return function (a, b) {\n return pred(a, b) ? -1 : pred(b, a) ? 1 : 0;\n };\n });\n\n /**\n * Returns a curried equivalent of the provided function, with the specified\n * arity. The curried function has two unusual capabilities. First, its\n * arguments needn't be provided one at a time. If `g` is `R.curryN(3, f)`, the\n * following are equivalent:\n *\n * - `g(1)(2)(3)`\n * - `g(1)(2, 3)`\n * - `g(1, 2)(3)`\n * - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value `R.__` may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is `R.__`, the\n * following are equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curry\n * @example\n *\n * var sumArgs = (...args) => R.sum(args);\n *\n * var curriedAddFourNumbers = R.curryN(4, sumArgs);\n * var f = curriedAddFourNumbers(1, 2);\n * var g = f(3);\n * g(4); //=> 10\n */\n var curryN = _curry2(function curryN(length, fn) {\n if (length === 1) {\n return _curry1(fn);\n }\n return _arity(length, _curryN(length, [], fn));\n });\n\n /**\n * Decrements its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @see R.inc\n * @example\n *\n * R.dec(42); //=> 41\n */\n var dec = add(-1);\n\n /**\n * Returns the second argument if it is not `null`, `undefined` or `NaN`\n * otherwise the first argument is returned.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {a} val The default value.\n * @param {b} val The value to return if it is not null or undefined\n * @return {*} The the second value or the default value\n * @example\n *\n * var defaultTo42 = R.defaultTo(42);\n *\n * defaultTo42(null); //=> 42\n * defaultTo42(undefined); //=> 42\n * defaultTo42('Ramda'); //=> 'Ramda'\n * defaultTo42(parseInt('string')); //=> 42\n */\n var defaultTo = _curry2(function defaultTo(d, v) {\n return v == null || v !== v ? d : v;\n });\n\n /**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Duplication is determined according to the\n * value returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.difference\n * @example\n *\n * var cmp = (x, y) => x.a === y.a;\n * var l1 = [{a: 1}, {a: 2}, {a: 3}];\n * var l2 = [{a: 3}, {a: 4}];\n * R.differenceWith(cmp, l1, l2); //=> [{a: 1}, {a: 2}]\n */\n var differenceWith = _curry3(function differenceWith(pred, first, second) {\n var out = [];\n var idx = 0;\n var firstLen = first.length;\n while (idx < firstLen) {\n if (!_containsWith(pred, first[idx], second) && !_containsWith(pred, first[idx], out)) {\n out.push(first[idx]);\n }\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a new object that does not contain a `prop` property.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Object\n * @sig String -> {k: v} -> {k: v}\n * @param {String} prop the name of the property to dissociate\n * @param {Object} obj the object to clone\n * @return {Object} a new object similar to the original but without the specified property\n * @see R.assoc\n * @example\n *\n * R.dissoc('b', {a: 1, b: 2, c: 3}); //=> {a: 1, c: 3}\n */\n var dissoc = _curry2(function dissoc(prop, obj) {\n var result = {};\n for (var p in obj) {\n if (p !== prop) {\n result[p] = obj[p];\n }\n }\n return result;\n });\n\n /**\n * Makes a shallow clone of an object, omitting the property at the given path.\n * Note that this copies and flattens prototype properties onto the new object\n * as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.11.0\n * @category Object\n * @sig [String] -> {k: v} -> {k: v}\n * @param {Array} path the path to set\n * @param {Object} obj the object to clone\n * @return {Object} a new object without the property at path\n * @see R.assocPath\n * @example\n *\n * R.dissocPath(['a', 'b', 'c'], {a: {b: {c: 42}}}); //=> {a: {b: {}}}\n */\n var dissocPath = _curry2(function dissocPath(path, obj) {\n switch (path.length) {\n case 0:\n return obj;\n case 1:\n return dissoc(path[0], obj);\n default:\n var head = path[0];\n var tail = _slice(path, 1);\n return obj[head] == null ? obj : assoc(head, dissocPath(tail, obj[head]), obj);\n }\n });\n\n /**\n * Divides two numbers. Equivalent to `a / b`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a / b`.\n * @see R.multiply\n * @example\n *\n * R.divide(71, 100); //=> 0.71\n *\n * var half = R.divide(R.__, 2);\n * half(42); //=> 21\n *\n * var reciprocal = R.divide(1);\n * reciprocal(4); //=> 0.25\n */\n var divide = _curry2(function divide(a, b) {\n return a / b;\n });\n\n /**\n * Returns a new list containing the last `n` elements of a given list, passing\n * each value to the supplied predicate function, skipping elements while the\n * predicate function returns `true`. The predicate function is passed one\n * argument: *(value)*.\n *\n * Dispatches to the `dropWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.takeWhile, R.transduce, R.addIndex\n * @example\n *\n * var lteTwo = x => x <= 2;\n *\n * R.dropWhile(lteTwo, [1, 2, 3, 4, 3, 2, 1]); //=> [3, 4, 3, 2, 1]\n */\n var dropWhile = _curry2(_dispatchable('dropWhile', _xdropWhile, function dropWhile(pred, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len && pred(list[idx])) {\n idx += 1;\n }\n return _slice(list, idx);\n }));\n\n /**\n * Returns the empty value of its argument's type. Ramda defines the empty\n * value of Array (`[]`), Object (`{}`), String (`''`), and Arguments. Other\n * types are supported if they define `.empty` and/or\n * `.prototype.empty`.\n *\n * Dispatches to the `empty` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> a\n * @param {*} x\n * @return {*}\n * @example\n *\n * R.empty(Just(42)); //=> Nothing()\n * R.empty([1, 2, 3]); //=> []\n * R.empty('unicorns'); //=> ''\n * R.empty({x: 1, y: 2}); //=> {}\n */\n // else\n var empty = _curry1(function empty(x) {\n return x != null && typeof x.empty === 'function' ? x.empty() : x != null && x.constructor != null && typeof x.constructor.empty === 'function' ? x.constructor.empty() : _isArray(x) ? [] : _isString(x) ? '' : _isObject(x) ? {} : _isArguments(x) ? function () {\n return arguments;\n }() : // else\n void 0;\n });\n\n /**\n * Creates a new object by recursively evolving a shallow copy of `object`,\n * according to the `transformation` functions. All non-primitive properties\n * are copied by reference.\n *\n * A `transformation` function will not be invoked if its corresponding key\n * does not exist in the evolved object.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {k: (v -> v)} -> {k: v} -> {k: v}\n * @param {Object} transformations The object specifying transformation functions to apply\n * to the object.\n * @param {Object} object The object to be transformed.\n * @return {Object} The transformed object.\n * @example\n *\n * var tomato = {firstName: ' Tomato ', data: {elapsed: 100, remaining: 1400}, id:123};\n * var transformations = {\n * firstName: R.trim,\n * lastName: R.trim, // Will not get invoked.\n * data: {elapsed: R.add(1), remaining: R.add(-1)}\n * };\n * R.evolve(transformations, tomato); //=> {firstName: 'Tomato', data: {elapsed: 101, remaining: 1399}, id:123}\n */\n var evolve = _curry2(function evolve(transformations, object) {\n var result = {};\n var transformation, key, type;\n for (key in object) {\n transformation = transformations[key];\n type = typeof transformation;\n result[key] = type === 'function' ? transformation(object[key]) : type === 'object' ? evolve(transformations[key], object[key]) : object[key];\n }\n return result;\n });\n\n /**\n * Returns the first element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `find` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1}, {a: 2}, {a: 3}];\n * R.find(R.propEq('a', 2))(xs); //=> {a: 2}\n * R.find(R.propEq('a', 4))(xs); //=> undefined\n */\n var find = _curry2(_dispatchable('find', _xfind, function find(fn, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n if (fn(list[idx])) {\n return list[idx];\n }\n idx += 1;\n }\n }));\n\n /**\n * Returns the index of the first element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Dispatches to the `findIndex` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1}, {a: 2}, {a: 3}];\n * R.findIndex(R.propEq('a', 2))(xs); //=> 1\n * R.findIndex(R.propEq('a', 4))(xs); //=> -1\n */\n var findIndex = _curry2(_dispatchable('findIndex', _xfindIndex, function findIndex(fn, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n if (fn(list[idx])) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n }));\n\n /**\n * Returns the last element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `findLast` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n * R.findLast(R.propEq('a', 1))(xs); //=> {a: 1, b: 1}\n * R.findLast(R.propEq('a', 4))(xs); //=> undefined\n */\n var findLast = _curry2(_dispatchable('findLast', _xfindLast, function findLast(fn, list) {\n var idx = list.length - 1;\n while (idx >= 0) {\n if (fn(list[idx])) {\n return list[idx];\n }\n idx -= 1;\n }\n }));\n\n /**\n * Returns the index of the last element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Dispatches to the `findLastIndex` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n * R.findLastIndex(R.propEq('a', 1))(xs); //=> 1\n * R.findLastIndex(R.propEq('a', 4))(xs); //=> -1\n */\n var findLastIndex = _curry2(_dispatchable('findLastIndex', _xfindLastIndex, function findLastIndex(fn, list) {\n var idx = list.length - 1;\n while (idx >= 0) {\n if (fn(list[idx])) {\n return idx;\n }\n idx -= 1;\n }\n return -1;\n }));\n\n /**\n * Iterate over an input `list`, calling a provided function `fn` for each\n * element in the list.\n *\n * `fn` receives one argument: *(value)*.\n *\n * Note: `R.forEach` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.forEach` method. For more\n * details on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach#Description\n *\n * Also note that, unlike `Array.prototype.forEach`, Ramda's `forEach` returns\n * the original array. In some libraries this function is named `each`.\n *\n * Dispatches to the `forEach` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> *) -> [a] -> [a]\n * @param {Function} fn The function to invoke. Receives one argument, `value`.\n * @param {Array} list The list to iterate over.\n * @return {Array} The original list.\n * @see R.addIndex\n * @example\n *\n * var printXPlusFive = x => console.log(x + 5);\n * R.forEach(printXPlusFive, [1, 2, 3]); //=> [1, 2, 3]\n * //-> 6\n * //-> 7\n * //-> 8\n */\n var forEach = _curry2(_checkForMethod('forEach', function forEach(fn, list) {\n var len = list.length;\n var idx = 0;\n while (idx < len) {\n fn(list[idx]);\n idx += 1;\n }\n return list;\n }));\n\n /**\n * Creates a new object out of a list key-value pairs.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [[k,v]] -> {k: v}\n * @param {Array} pairs An array of two-element arrays that will be the keys and values of the output object.\n * @return {Object} The object made by pairing up `keys` and `values`.\n * @see R.toPairs, R.pair\n * @example\n *\n * R.fromPairs([['a', 1], ['b', 2], ['c', 3]]); //=> {a: 1, b: 2, c: 3}\n */\n var fromPairs = _curry1(function fromPairs(pairs) {\n var idx = 0;\n var len = pairs.length;\n var out = {};\n while (idx < len) {\n if (_isArray(pairs[idx]) && pairs[idx].length) {\n out[pairs[idx][0]] = pairs[idx][1];\n }\n idx += 1;\n }\n return out;\n });\n\n /**\n * Takes a list and returns a list of lists where each sublist's elements are\n * all \"equal\" according to the provided equality function.\n *\n * @func\n * @memberOf R\n * @since v0.21.0\n * @category List\n * @sig (a, a -> Boolean) -> [a] -> [[a]]\n * @param {Function} fn Function for determining whether two given (adjacent)\n * elements should be in the same group\n * @param {Array} list The array to group. Also accepts a string, which will be\n * treated as a list of characters.\n * @return {List} A list that contains sublists of equal elements,\n * whose concatenations is equal to the original list.\n * @example\n *\n * groupWith(R.equals, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * // [[0], [1, 1], [2, 3, 5, 8, 13, 21]]\n *\n * groupWith((a, b) => a % 2 === b % 2, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * // [[0], [1, 1], [2], [3, 5], [8], [13, 21]]\n *\n * R.groupWith(R.eqBy(isVowel), 'aestiou')\n * // ['ae', 'st', 'iou']\n */\n var groupWith = _curry2(function (fn, list) {\n var res = [];\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n var nextidx = idx + 1;\n while (nextidx < len && fn(list[idx], list[nextidx])) {\n nextidx += 1;\n }\n res.push(list.slice(idx, nextidx));\n idx = nextidx;\n }\n return res;\n });\n\n /**\n * Returns `true` if the first argument is greater than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.lt\n * @example\n *\n * R.gt(2, 1); //=> true\n * R.gt(2, 2); //=> false\n * R.gt(2, 3); //=> false\n * R.gt('a', 'z'); //=> false\n * R.gt('z', 'a'); //=> true\n */\n var gt = _curry2(function gt(a, b) {\n return a > b;\n });\n\n /**\n * Returns `true` if the first argument is greater than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.lte\n * @example\n *\n * R.gte(2, 1); //=> true\n * R.gte(2, 2); //=> true\n * R.gte(2, 3); //=> false\n * R.gte('a', 'z'); //=> false\n * R.gte('z', 'a'); //=> true\n */\n var gte = _curry2(function gte(a, b) {\n return a >= b;\n });\n\n /**\n * Returns whether or not an object has an own property with the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n * var hasName = R.has('name');\n * hasName({name: 'alice'}); //=> true\n * hasName({name: 'bob'}); //=> true\n * hasName({}); //=> false\n *\n * var point = {x: 0, y: 0};\n * var pointHas = R.has(R.__, point);\n * pointHas('x'); //=> true\n * pointHas('y'); //=> true\n * pointHas('z'); //=> false\n */\n var has = _curry2(_has);\n\n /**\n * Returns whether or not an object or its prototype chain has a property with\n * the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n * function Rectangle(width, height) {\n * this.width = width;\n * this.height = height;\n * }\n * Rectangle.prototype.area = function() {\n * return this.width * this.height;\n * };\n *\n * var square = new Rectangle(2, 2);\n * R.hasIn('width', square); //=> true\n * R.hasIn('area', square); //=> true\n */\n var hasIn = _curry2(function hasIn(prop, obj) {\n return prop in obj;\n });\n\n /**\n * Returns true if its arguments are identical, false otherwise. Values are\n * identical if they reference the same memory. `NaN` is identical to `NaN`;\n * `0` and `-0` are not identical.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * var o = {};\n * R.identical(o, o); //=> true\n * R.identical(1, 1); //=> true\n * R.identical(1, '1'); //=> false\n * R.identical([], []); //=> false\n * R.identical(0, -0); //=> false\n * R.identical(NaN, NaN); //=> true\n */\n // SameValue algorithm\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n // Step 6.a: NaN == NaN\n var identical = _curry2(function identical(a, b) {\n // SameValue algorithm\n if (a === b) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n return a !== 0 || 1 / a === 1 / b;\n } else {\n // Step 6.a: NaN == NaN\n return a !== a && b !== b;\n }\n });\n\n /**\n * A function that does nothing but return the parameter supplied to it. Good\n * as a default or placeholder function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> a\n * @param {*} x The value to return.\n * @return {*} The input value, `x`.\n * @example\n *\n * R.identity(1); //=> 1\n *\n * var obj = {};\n * R.identity(obj) === obj; //=> true\n */\n var identity = _curry1(_identity);\n\n /**\n * Creates a function that will process either the `onTrue` or the `onFalse`\n * function depending upon the result of the `condition` predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> *) -> (*... -> *) -> (*... -> *)\n * @param {Function} condition A predicate function\n * @param {Function} onTrue A function to invoke when the `condition` evaluates to a truthy value.\n * @param {Function} onFalse A function to invoke when the `condition` evaluates to a falsy value.\n * @return {Function} A new unary function that will process either the `onTrue` or the `onFalse`\n * function depending upon the result of the `condition` predicate.\n * @see R.unless, R.when\n * @example\n *\n * var incCount = R.ifElse(\n * R.has('count'),\n * R.over(R.lensProp('count'), R.inc),\n * R.assoc('count', 1)\n * );\n * incCount({}); //=> { count: 1 }\n * incCount({ count: 1 }); //=> { count: 2 }\n */\n var ifElse = _curry3(function ifElse(condition, onTrue, onFalse) {\n return curryN(Math.max(condition.length, onTrue.length, onFalse.length), function _ifElse() {\n return condition.apply(this, arguments) ? onTrue.apply(this, arguments) : onFalse.apply(this, arguments);\n });\n });\n\n /**\n * Increments its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @see R.dec\n * @example\n *\n * R.inc(42); //=> 43\n */\n var inc = add(1);\n\n /**\n * Inserts the supplied element into the list, at index `index`. _Note that\n * this is not destructive_: it returns a copy of the list with the changes.\n * No lists have been harmed in the application of this function. \n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} index The position to insert the element\n * @param {*} elt The element to insert into the Array\n * @param {Array} list The list to insert into\n * @return {Array} A new Array with `elt` inserted at `index`.\n * @example\n *\n * R.insert(2, 'x', [1,2,3,4]); //=> [1,2,'x',3,4]\n */\n var insert = _curry3(function insert(idx, elt, list) {\n idx = idx < list.length && idx >= 0 ? idx : list.length;\n var result = _slice(list);\n result.splice(idx, 0, elt);\n return result;\n });\n\n /**\n * Inserts the sub-list into the list, at index `index`. _Note that this is not\n * destructive_: it returns a copy of the list with the changes.\n * No lists have been harmed in the application of this function. \n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig Number -> [a] -> [a] -> [a]\n * @param {Number} index The position to insert the sub-list\n * @param {Array} elts The sub-list to insert into the Array\n * @param {Array} list The list to insert the sub-list into\n * @return {Array} A new Array with `elts` inserted starting at `index`.\n * @example\n *\n * R.insertAll(2, ['x','y','z'], [1,2,3,4]); //=> [1,2,'x','y','z',3,4]\n */\n var insertAll = _curry3(function insertAll(idx, elts, list) {\n idx = idx < list.length && idx >= 0 ? idx : list.length;\n return _concat(_concat(_slice(list, 0, idx), elts), _slice(list, idx));\n });\n\n /**\n * Creates a new list with the separator interposed between elements.\n *\n * Dispatches to the `intersperse` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} separator The element to add to the list.\n * @param {Array} list The list to be interposed.\n * @return {Array} The new list.\n * @example\n *\n * R.intersperse('n', ['ba', 'a', 'a']); //=> ['ba', 'n', 'a', 'n', 'a']\n */\n var intersperse = _curry2(_checkForMethod('intersperse', function intersperse(separator, list) {\n var out = [];\n var idx = 0;\n var length = list.length;\n while (idx < length) {\n if (idx === length - 1) {\n out.push(list[idx]);\n } else {\n out.push(list[idx], separator);\n }\n idx += 1;\n }\n return out;\n }));\n\n /**\n * See if an object (`val`) is an instance of the supplied constructor. This\n * function will check up the inheritance chain, if any.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Type\n * @sig (* -> {*}) -> a -> Boolean\n * @param {Object} ctor A constructor\n * @param {*} val The value to test\n * @return {Boolean}\n * @example\n *\n * R.is(Object, {}); //=> true\n * R.is(Number, 1); //=> true\n * R.is(Object, 1); //=> false\n * R.is(String, 's'); //=> true\n * R.is(String, new String('')); //=> true\n * R.is(Object, new String('')); //=> true\n * R.is(Object, 's'); //=> false\n * R.is(Number, {}); //=> false\n */\n var is = _curry2(function is(Ctor, val) {\n return val != null && val.constructor === Ctor || val instanceof Ctor;\n });\n\n /**\n * Tests whether or not an object is similar to an array.\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Type\n * @category List\n * @sig * -> Boolean\n * @param {*} x The object to test.\n * @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.\n * @example\n *\n * R.isArrayLike([]); //=> true\n * R.isArrayLike(true); //=> false\n * R.isArrayLike({}); //=> false\n * R.isArrayLike({length: 10}); //=> false\n * R.isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true\n */\n var isArrayLike = _curry1(function isArrayLike(x) {\n if (_isArray(x)) {\n return true;\n }\n if (!x) {\n return false;\n }\n if (typeof x !== 'object') {\n return false;\n }\n if (x instanceof String) {\n return false;\n }\n if (x.nodeType === 1) {\n return !!x.length;\n }\n if (x.length === 0) {\n return true;\n }\n if (x.length > 0) {\n return x.hasOwnProperty(0) && x.hasOwnProperty(x.length - 1);\n }\n return false;\n });\n\n /**\n * Checks if the input value is `null` or `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Type\n * @sig * -> Boolean\n * @param {*} x The value to test.\n * @return {Boolean} `true` if `x` is `undefined` or `null`, otherwise `false`.\n * @example\n *\n * R.isNil(null); //=> true\n * R.isNil(undefined); //=> true\n * R.isNil(0); //=> false\n * R.isNil([]); //=> false\n */\n var isNil = _curry1(function isNil(x) {\n return x == null;\n });\n\n /**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @example\n *\n * R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\n // cover IE < 9 keys issues\n // Safari bug\n var keys = function () {\n // cover IE < 9 keys issues\n var hasEnumBug = !{ toString: null }.propertyIsEnumerable('toString');\n var nonEnumerableProps = [\n 'constructor',\n 'valueOf',\n 'isPrototypeOf',\n 'toString',\n 'propertyIsEnumerable',\n 'hasOwnProperty',\n 'toLocaleString'\n ];\n // Safari bug\n var hasArgsEnumBug = function () {\n 'use strict';\n return arguments.propertyIsEnumerable('length');\n }();\n var contains = function contains(list, item) {\n var idx = 0;\n while (idx < list.length) {\n if (list[idx] === item) {\n return true;\n }\n idx += 1;\n }\n return false;\n };\n return typeof Object.keys === 'function' && !hasArgsEnumBug ? _curry1(function keys(obj) {\n return Object(obj) !== obj ? [] : Object.keys(obj);\n }) : _curry1(function keys(obj) {\n if (Object(obj) !== obj) {\n return [];\n }\n var prop, nIdx;\n var ks = [];\n var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n for (prop in obj) {\n if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n ks[ks.length] = prop;\n }\n }\n if (hasEnumBug) {\n nIdx = nonEnumerableProps.length - 1;\n while (nIdx >= 0) {\n prop = nonEnumerableProps[nIdx];\n if (_has(prop, obj) && !contains(ks, prop)) {\n ks[ks.length] = prop;\n }\n nIdx -= 1;\n }\n }\n return ks;\n });\n }();\n\n /**\n * Returns a list containing the names of all the properties of the supplied\n * object, including prototype properties.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own and prototype properties.\n * @example\n *\n * var F = function() { this.x = 'X'; };\n * F.prototype.y = 'Y';\n * var f = new F();\n * R.keysIn(f); //=> ['x', 'y']\n */\n var keysIn = _curry1(function keysIn(obj) {\n var prop;\n var ks = [];\n for (prop in obj) {\n ks[ks.length] = prop;\n }\n return ks;\n });\n\n /**\n * Returns the number of elements in the array by returning `list.length`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [a] -> Number\n * @param {Array} list The array to inspect.\n * @return {Number} The length of the array.\n * @example\n *\n * R.length([]); //=> 0\n * R.length([1, 2, 3]); //=> 3\n */\n var length = _curry1(function length(list) {\n return list != null && is(Number, list.length) ? list.length : NaN;\n });\n\n /**\n * Returns `true` if the first argument is less than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.gt\n * @example\n *\n * R.lt(2, 1); //=> false\n * R.lt(2, 2); //=> false\n * R.lt(2, 3); //=> true\n * R.lt('a', 'z'); //=> true\n * R.lt('z', 'a'); //=> false\n */\n var lt = _curry2(function lt(a, b) {\n return a < b;\n });\n\n /**\n * Returns `true` if the first argument is less than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.gte\n * @example\n *\n * R.lte(2, 1); //=> false\n * R.lte(2, 2); //=> true\n * R.lte(2, 3); //=> true\n * R.lte('a', 'z'); //=> true\n * R.lte('z', 'a'); //=> false\n */\n var lte = _curry2(function lte(a, b) {\n return a <= b;\n });\n\n /**\n * The mapAccum function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from left to right, and returning a final value of this\n * accumulator together with the new list.\n *\n * The iterator function receives two arguments, *acc* and *value*, and should\n * return a tuple *[acc, value]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex\n * @example\n *\n * var digits = ['1', '2', '3', '4'];\n * var appender = (a, b) => [a + b, a + b];\n *\n * R.mapAccum(appender, 0, digits); //=> ['01234', ['01', '012', '0123', '01234']]\n */\n var mapAccum = _curry3(function mapAccum(fn, acc, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n var tuple = [acc];\n while (idx < len) {\n tuple = fn(tuple[0], list[idx]);\n result[idx] = tuple[1];\n idx += 1;\n }\n return [\n tuple[0],\n result\n ];\n });\n\n /**\n * The mapAccumRight function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from right to left, and returning a final value of this\n * accumulator together with the new list.\n *\n * Similar to `mapAccum`, except moves through the input list from the right to\n * the left.\n *\n * The iterator function receives two arguments, *acc* and *value*, and should\n * return a tuple *[acc, value]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex\n * @example\n *\n * var digits = ['1', '2', '3', '4'];\n * var append = (a, b) => [a + b, a + b];\n *\n * R.mapAccumRight(append, 0, digits); //=> ['04321', ['04321', '0432', '043', '04']]\n */\n var mapAccumRight = _curry3(function mapAccumRight(fn, acc, list) {\n var idx = list.length - 1;\n var result = [];\n var tuple = [acc];\n while (idx >= 0) {\n tuple = fn(tuple[0], list[idx]);\n result[idx] = tuple[1];\n idx -= 1;\n }\n return [\n tuple[0],\n result\n ];\n });\n\n /**\n * Tests a regular expression against a String. Note that this function will\n * return an empty array when there are no matches. This differs from\n * [`String.prototype.match`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/match)\n * which returns `null` when there are no matches.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig RegExp -> String -> [String | Undefined]\n * @param {RegExp} rx A regular expression.\n * @param {String} str The string to match against\n * @return {Array} The list of matches or empty array.\n * @see R.test\n * @example\n *\n * R.match(/([a-z]a)/g, 'bananas'); //=> ['ba', 'na', 'na']\n * R.match(/a/, 'b'); //=> []\n * R.match(/a/, null); //=> TypeError: null does not have a method named \"match\"\n */\n var match = _curry2(function match(rx, str) {\n return str.match(rx) || [];\n });\n\n /**\n * mathMod behaves like the modulo operator should mathematically, unlike the\n * `%` operator (and by extension, R.modulo). So while \"-17 % 5\" is -2,\n * mathMod(-17, 5) is 3. mathMod requires Integer arguments, and returns NaN\n * when the modulus is zero or negative.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} m The dividend.\n * @param {Number} p the modulus.\n * @return {Number} The result of `b mod a`.\n * @example\n *\n * R.mathMod(-17, 5); //=> 3\n * R.mathMod(17, 5); //=> 2\n * R.mathMod(17, -5); //=> NaN\n * R.mathMod(17, 0); //=> NaN\n * R.mathMod(17.2, 5); //=> NaN\n * R.mathMod(17, 5.3); //=> NaN\n *\n * var clock = R.mathMod(R.__, 12);\n * clock(15); //=> 3\n * clock(24); //=> 0\n *\n * var seventeenMod = R.mathMod(17);\n * seventeenMod(3); //=> 2\n * seventeenMod(4); //=> 1\n * seventeenMod(10); //=> 7\n */\n var mathMod = _curry2(function mathMod(m, p) {\n if (!_isInteger(m)) {\n return NaN;\n }\n if (!_isInteger(p) || p < 1) {\n return NaN;\n }\n return (m % p + p) % p;\n });\n\n /**\n * Returns the larger of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.maxBy, R.min\n * @example\n *\n * R.max(789, 123); //=> 789\n * R.max('a', 'b'); //=> 'b'\n */\n var max = _curry2(function max(a, b) {\n return b > a ? b : a;\n });\n\n /**\n * Takes a function and two values, and returns whichever value produces the\n * larger result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.max, R.minBy\n * @example\n *\n * // square :: Number -> Number\n * var square = n => n * n;\n *\n * R.maxBy(square, -3, 2); //=> -3\n *\n * R.reduce(R.maxBy(square), 0, [3, -5, 4, 1, -2]); //=> -5\n * R.reduce(R.maxBy(square), 0, []); //=> 0\n */\n var maxBy = _curry3(function maxBy(f, a, b) {\n return f(b) > f(a) ? b : a;\n });\n\n /**\n * Create a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects,\n * the value from the second object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> {k: v} -> {k: v}\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeWith, R.mergeWithKey\n * @example\n *\n * R.merge({ 'name': 'fred', 'age': 10 }, { 'age': 40 });\n * //=> { 'name': 'fred', 'age': 40 }\n *\n * var resetToDefault = R.merge(R.__, {x: 0});\n * resetToDefault({x: 5, y: 2}); //=> {x: 0, y: 2}\n */\n var merge = _curry2(function merge(l, r) {\n return _assign({}, l, r);\n });\n\n /**\n * Merges a list of objects together into one object.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig [{k: v}] -> {k: v}\n * @param {Array} list An array of objects\n * @return {Object} A merged object.\n * @see R.reduce\n * @example\n *\n * R.mergeAll([{foo:1},{bar:2},{baz:3}]); //=> {foo:1,bar:2,baz:3}\n * R.mergeAll([{foo:1},{foo:2},{bar:2}]); //=> {foo:2,bar:2}\n */\n var mergeAll = _curry1(function mergeAll(list) {\n return _assign.apply(null, [{}].concat(list));\n });\n\n /**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the key\n * and the values associated with the key in each object, with the result being\n * used as the value associated with the key in the returned object. The key\n * will be excluded from the returned object if the resulting value is\n * `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig (String -> a -> a -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.merge, R.mergeWith\n * @example\n *\n * let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n * R.mergeWithKey(concatValues,\n * { a: true, thing: 'foo', values: [10, 20] },\n * { b: true, thing: 'bar', values: [15, 35] });\n * //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }\n */\n var mergeWithKey = _curry3(function mergeWithKey(fn, l, r) {\n var result = {};\n var k;\n for (k in l) {\n if (_has(k, l)) {\n result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];\n }\n }\n for (k in r) {\n if (_has(k, r) && !_has(k, result)) {\n result[k] = r[k];\n }\n }\n return result;\n });\n\n /**\n * Returns the smaller of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.minBy, R.max\n * @example\n *\n * R.min(789, 123); //=> 123\n * R.min('a', 'b'); //=> 'a'\n */\n var min = _curry2(function min(a, b) {\n return b < a ? b : a;\n });\n\n /**\n * Takes a function and two values, and returns whichever value produces the\n * smaller result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.min, R.maxBy\n * @example\n *\n * // square :: Number -> Number\n * var square = n => n * n;\n *\n * R.minBy(square, -3, 2); //=> 2\n *\n * R.reduce(R.minBy(square), Infinity, [3, -5, 4, 1, -2]); //=> 1\n * R.reduce(R.minBy(square), Infinity, []); //=> Infinity\n */\n var minBy = _curry3(function minBy(f, a, b) {\n return f(b) < f(a) ? b : a;\n });\n\n /**\n * Divides the second parameter by the first and returns the remainder. Note\n * that this function preserves the JavaScript-style behavior for modulo. For\n * mathematical modulo see `mathMod`.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The value to the divide.\n * @param {Number} b The pseudo-modulus\n * @return {Number} The result of `b % a`.\n * @see R.mathMod\n * @example\n *\n * R.modulo(17, 3); //=> 2\n * // JS behavior:\n * R.modulo(-17, 3); //=> -2\n * R.modulo(17, -3); //=> 2\n *\n * var isOdd = R.modulo(R.__, 2);\n * isOdd(42); //=> 0\n * isOdd(21); //=> 1\n */\n var modulo = _curry2(function modulo(a, b) {\n return a % b;\n });\n\n /**\n * Multiplies two numbers. Equivalent to `a * b` but curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a * b`.\n * @see R.divide\n * @example\n *\n * var double = R.multiply(2);\n * var triple = R.multiply(3);\n * double(3); //=> 6\n * triple(4); //=> 12\n * R.multiply(2, 5); //=> 10\n */\n var multiply = _curry2(function multiply(a, b) {\n return a * b;\n });\n\n /**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly `n` parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} n The desired arity of the new function.\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n * arity `n`.\n * @example\n *\n * var takesTwoArgs = (a, b) => [a, b];\n *\n * takesTwoArgs.length; //=> 2\n * takesTwoArgs(1, 2); //=> [1, 2]\n *\n * var takesOneArg = R.nAry(1, takesTwoArgs);\n * takesOneArg.length; //=> 1\n * // Only `n` arguments are passed to the wrapped function\n * takesOneArg(1, 2); //=> [1, undefined]\n */\n var nAry = _curry2(function nAry(n, fn) {\n switch (n) {\n case 0:\n return function () {\n return fn.call(this);\n };\n case 1:\n return function (a0) {\n return fn.call(this, a0);\n };\n case 2:\n return function (a0, a1) {\n return fn.call(this, a0, a1);\n };\n case 3:\n return function (a0, a1, a2) {\n return fn.call(this, a0, a1, a2);\n };\n case 4:\n return function (a0, a1, a2, a3) {\n return fn.call(this, a0, a1, a2, a3);\n };\n case 5:\n return function (a0, a1, a2, a3, a4) {\n return fn.call(this, a0, a1, a2, a3, a4);\n };\n case 6:\n return function (a0, a1, a2, a3, a4, a5) {\n return fn.call(this, a0, a1, a2, a3, a4, a5);\n };\n case 7:\n return function (a0, a1, a2, a3, a4, a5, a6) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6);\n };\n case 8:\n return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7);\n };\n case 9:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8);\n };\n case 10:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9);\n };\n default:\n throw new Error('First argument to nAry must be a non-negative integer no greater than ten');\n }\n });\n\n /**\n * Negates its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @example\n *\n * R.negate(42); //=> -42\n */\n var negate = _curry1(function negate(n) {\n return -n;\n });\n\n /**\n * Returns `true` if no elements of the list match the predicate, `false`\n * otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is not satisfied by every element, `false` otherwise.\n * @see R.all, R.any\n * @example\n *\n * var isEven = n => n % 2 === 0;\n *\n * R.none(isEven, [1, 3, 5, 7, 9, 11]); //=> true\n * R.none(isEven, [1, 3, 5, 7, 8, 11]); //=> false\n */\n var none = _curry2(_complement(_dispatchable('any', _xany, any)));\n\n /**\n * A function that returns the `!` of its argument. It will return `true` when\n * passed false-y value, and `false` when passed a truth-y one.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> Boolean\n * @param {*} a any value\n * @return {Boolean} the logical inverse of passed argument.\n * @see R.complement\n * @example\n *\n * R.not(true); //=> false\n * R.not(false); //=> true\n * R.not(0); => true\n * R.not(1); => false\n */\n var not = _curry1(function not(a) {\n return !a;\n });\n\n /**\n * Returns the nth element of the given list or string. If n is negative the\n * element at index length + n is returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> a | Undefined\n * @sig Number -> String -> String\n * @param {Number} offset\n * @param {*} list\n * @return {*}\n * @example\n *\n * var list = ['foo', 'bar', 'baz', 'quux'];\n * R.nth(1, list); //=> 'bar'\n * R.nth(-1, list); //=> 'quux'\n * R.nth(-99, list); //=> undefined\n *\n * R.nth(2, 'abc'); //=> 'c'\n * R.nth(3, 'abc'); //=> ''\n */\n var nth = _curry2(function nth(offset, list) {\n var idx = offset < 0 ? list.length + offset : offset;\n return _isString(list) ? list.charAt(idx) : list[idx];\n });\n\n /**\n * Returns a function which returns its nth argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig Number -> *... -> *\n * @param {Number} n\n * @return {Function}\n * @example\n *\n * R.nthArg(1)('a', 'b', 'c'); //=> 'b'\n * R.nthArg(-1)('a', 'b', 'c'); //=> 'c'\n */\n var nthArg = _curry1(function nthArg(n) {\n return function () {\n return nth(n, arguments);\n };\n });\n\n /**\n * Creates an object containing a single key:value pair.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @sig String -> a -> {String:a}\n * @param {String} key\n * @param {*} val\n * @return {Object}\n * @see R.pair\n * @example\n *\n * var matchPhrases = R.compose(\n * R.objOf('must'),\n * R.map(R.objOf('match_phrase'))\n * );\n * matchPhrases(['foo', 'bar', 'baz']); //=> {must: [{match_phrase: 'foo'}, {match_phrase: 'bar'}, {match_phrase: 'baz'}]}\n */\n var objOf = _curry2(function objOf(key, val) {\n var obj = {};\n obj[key] = val;\n return obj;\n });\n\n /**\n * Returns a singleton array containing the value provided.\n *\n * Note this `of` is different from the ES6 `of`; See\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/of\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> [a]\n * @param {*} x any value\n * @return {Array} An array wrapping `x`.\n * @example\n *\n * R.of(null); //=> [null]\n * R.of([42]); //=> [[42]]\n */\n var of = _curry1(_of);\n\n /**\n * Accepts a function `fn` and returns a function that guards invocation of\n * `fn` such that `fn` can only ever be called once, no matter how many times\n * the returned function is invoked. The first value calculated is returned in\n * subsequent invocations.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a... -> b) -> (a... -> b)\n * @param {Function} fn The function to wrap in a call-only-once wrapper.\n * @return {Function} The wrapped function.\n * @example\n *\n * var addOneOnce = R.once(x => x + 1);\n * addOneOnce(10); //=> 11\n * addOneOnce(addOneOnce(50)); //=> 11\n */\n var once = _curry1(function once(fn) {\n var called = false;\n var result;\n return _arity(fn.length, function () {\n if (called) {\n return result;\n }\n called = true;\n result = fn.apply(this, arguments);\n return result;\n });\n });\n\n /**\n * Returns `true` if one or both of its arguments are `true`. Returns `false`\n * if both arguments are `false`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> * -> *\n * @param {Boolean} a A boolean value\n * @param {Boolean} b A boolean value\n * @return {Boolean} `true` if one or both arguments are `true`, `false` otherwise\n * @see R.either\n * @example\n *\n * R.or(true, true); //=> true\n * R.or(true, false); //=> true\n * R.or(false, true); //=> true\n * R.or(false, false); //=> false\n */\n var or = _curry2(function or(a, b) {\n return a || b;\n });\n\n /**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the result of applying the given function to\n * the focused value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> (a -> a) -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n * var headLens = R.lensIndex(0);\n *\n * R.over(headLens, R.toUpper, ['foo', 'bar', 'baz']); //=> ['FOO', 'bar', 'baz']\n */\n // `Identity` is a functor that holds a single value, where `map` simply\n // transforms the held value with the provided function.\n // The value returned by the getter function is first transformed with `f`,\n // then set as the value of an `Identity`. This is then mapped over with the\n // setter function of the lens.\n var over = function () {\n // `Identity` is a functor that holds a single value, where `map` simply\n // transforms the held value with the provided function.\n var Identity = function (x) {\n return {\n value: x,\n map: function (f) {\n return Identity(f(x));\n }\n };\n };\n return _curry3(function over(lens, f, x) {\n // The value returned by the getter function is first transformed with `f`,\n // then set as the value of an `Identity`. This is then mapped over with the\n // setter function of the lens.\n return lens(function (y) {\n return Identity(f(y));\n })(x).value;\n });\n }();\n\n /**\n * Takes two arguments, `fst` and `snd`, and returns `[fst, snd]`.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category List\n * @sig a -> b -> (a,b)\n * @param {*} fst\n * @param {*} snd\n * @return {Array}\n * @see R.objOf, R.of\n * @example\n *\n * R.pair('foo', 'bar'); //=> ['foo', 'bar']\n */\n var pair = _curry2(function pair(fst, snd) {\n return [\n fst,\n snd\n ];\n });\n\n /**\n * Retrieve the value at a given path.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig [String] -> {k: v} -> v | Undefined\n * @param {Array} path The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path`.\n * @example\n *\n * R.path(['a', 'b'], {a: {b: 2}}); //=> 2\n * R.path(['a', 'b'], {c: {b: 2}}); //=> undefined\n */\n var path = _curry2(function path(paths, obj) {\n var val = obj;\n var idx = 0;\n while (idx < paths.length) {\n if (val == null) {\n return;\n }\n val = val[paths[idx]];\n idx += 1;\n }\n return val;\n });\n\n /**\n * If the given, non-null object has a value at the given path, returns the\n * value at that path. Otherwise returns the provided default value.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @sig a -> [String] -> Object -> a\n * @param {*} d The default value.\n * @param {Array} p The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path` of the supplied object or the default value.\n * @example\n *\n * R.pathOr('N/A', ['a', 'b'], {a: {b: 2}}); //=> 2\n * R.pathOr('N/A', ['a', 'b'], {c: {b: 2}}); //=> \"N/A\"\n */\n var pathOr = _curry3(function pathOr(d, p, obj) {\n return defaultTo(d, path(p, obj));\n });\n\n /**\n * Returns `true` if the specified object property at given path satisfies the\n * given predicate; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Logic\n * @sig (a -> Boolean) -> [String] -> Object -> Boolean\n * @param {Function} pred\n * @param {Array} propPath\n * @param {*} obj\n * @return {Boolean}\n * @see R.propSatisfies, R.path\n * @example\n *\n * R.pathSatisfies(y => y > 0, ['x', 'y'], {x: {y: 2}}); //=> true\n */\n var pathSatisfies = _curry3(function pathSatisfies(pred, propPath, obj) {\n return propPath.length > 0 && pred(path(propPath, obj));\n });\n\n /**\n * Returns a partial copy of an object containing only the keys specified. If\n * the key does not exist, the property is ignored.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.omit, R.props\n * @example\n *\n * R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n * R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}\n */\n var pick = _curry2(function pick(names, obj) {\n var result = {};\n var idx = 0;\n while (idx < names.length) {\n if (names[idx] in obj) {\n result[names[idx]] = obj[names[idx]];\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Similar to `pick` except that this one includes a `key: undefined` pair for\n * properties that don't exist.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.pick\n * @example\n *\n * R.pickAll(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n * R.pickAll(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, e: undefined, f: undefined}\n */\n var pickAll = _curry2(function pickAll(names, obj) {\n var result = {};\n var idx = 0;\n var len = names.length;\n while (idx < len) {\n var name = names[idx];\n result[name] = obj[name];\n idx += 1;\n }\n return result;\n });\n\n /**\n * Returns a partial copy of an object containing only the keys that satisfy\n * the supplied predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig (v, k -> Boolean) -> {k: v} -> {k: v}\n * @param {Function} pred A predicate to determine whether or not a key\n * should be included on the output object.\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties that satisfy `pred`\n * on it.\n * @see R.pick, R.filter\n * @example\n *\n * var isUpperCase = (val, key) => key.toUpperCase() === key;\n * R.pickBy(isUpperCase, {a: 1, b: 2, A: 3, B: 4}); //=> {A: 3, B: 4}\n */\n var pickBy = _curry2(function pickBy(test, obj) {\n var result = {};\n for (var prop in obj) {\n if (test(obj[prop], prop, obj)) {\n result[prop] = obj[prop];\n }\n }\n return result;\n });\n\n /**\n * Returns a new list with the given element at the front, followed by the\n * contents of the list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The item to add to the head of the output list.\n * @param {Array} list The array to add to the tail of the output list.\n * @return {Array} A new array.\n * @see R.append\n * @example\n *\n * R.prepend('fee', ['fi', 'fo', 'fum']); //=> ['fee', 'fi', 'fo', 'fum']\n */\n var prepend = _curry2(function prepend(el, list) {\n return _concat([el], list);\n });\n\n /**\n * Returns a function that when supplied an object returns the indicated\n * property of that object, if it exists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig s -> {s: a} -> a | Undefined\n * @param {String} p The property name\n * @param {Object} obj The object to query\n * @return {*} The value at `obj.p`.\n * @example\n *\n * R.prop('x', {x: 100}); //=> 100\n * R.prop('x', {}); //=> undefined\n */\n var prop = _curry2(function prop(p, obj) {\n return obj[p];\n });\n\n /**\n * If the given, non-null object has an own property with the specified name,\n * returns the value of that property. Otherwise returns the provided default\n * value.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Object\n * @sig a -> String -> Object -> a\n * @param {*} val The default value.\n * @param {String} p The name of the property to return.\n * @param {Object} obj The object to query.\n * @return {*} The value of given property of the supplied object or the default value.\n * @example\n *\n * var alice = {\n * name: 'ALICE',\n * age: 101\n * };\n * var favorite = R.prop('favoriteLibrary');\n * var favoriteWithDefault = R.propOr('Ramda', 'favoriteLibrary');\n *\n * favorite(alice); //=> undefined\n * favoriteWithDefault(alice); //=> 'Ramda'\n */\n var propOr = _curry3(function propOr(val, p, obj) {\n return obj != null && _has(p, obj) ? obj[p] : val;\n });\n\n /**\n * Returns `true` if the specified object property satisfies the given\n * predicate; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Logic\n * @sig (a -> Boolean) -> String -> {String: a} -> Boolean\n * @param {Function} pred\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.propEq, R.propIs\n * @example\n *\n * R.propSatisfies(x => x > 0, 'x', {x: 1, y: 2}); //=> true\n */\n var propSatisfies = _curry3(function propSatisfies(pred, name, obj) {\n return pred(obj[name]);\n });\n\n /**\n * Acts as multiple `prop`: array of keys in, array of values out. Preserves\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> [v]\n * @param {Array} ps The property names to fetch\n * @param {Object} obj The object to query\n * @return {Array} The corresponding values or partially applied function.\n * @example\n *\n * R.props(['x', 'y'], {x: 1, y: 2}); //=> [1, 2]\n * R.props(['c', 'a', 'b'], {b: 2, a: 1}); //=> [undefined, 1, 2]\n *\n * var fullName = R.compose(R.join(' '), R.props(['first', 'last']));\n * fullName({last: 'Bullet-Tooth', age: 33, first: 'Tony'}); //=> 'Tony Bullet-Tooth'\n */\n var props = _curry2(function props(ps, obj) {\n var len = ps.length;\n var out = [];\n var idx = 0;\n while (idx < len) {\n out[idx] = obj[ps[idx]];\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a list of numbers from `from` (inclusive) to `to` (exclusive).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> Number -> [Number]\n * @param {Number} from The first number in the list.\n * @param {Number} to One more than the last number in the list.\n * @return {Array} The list of numbers in tthe set `[a, b)`.\n * @example\n *\n * R.range(1, 5); //=> [1, 2, 3, 4]\n * R.range(50, 53); //=> [50, 51, 52]\n */\n var range = _curry2(function range(from, to) {\n if (!(_isNumber(from) && _isNumber(to))) {\n throw new TypeError('Both arguments to range must be numbers');\n }\n var result = [];\n var n = from;\n while (n < to) {\n result.push(n);\n n += 1;\n }\n return result;\n });\n\n /**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * Similar to `reduce`, except moves through the input list from the right to\n * the left.\n *\n * The iterator function receives two values: *(acc, value)*\n *\n * Note: `R.reduceRight` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight#Description\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a,b -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex\n * @example\n *\n * var pairs = [ ['a', 1], ['b', 2], ['c', 3] ];\n * var flattenPairs = (acc, pair) => acc.concat(pair);\n *\n * R.reduceRight(flattenPairs, [], pairs); //=> [ 'c', 3, 'b', 2, 'a', 1 ]\n */\n var reduceRight = _curry3(function reduceRight(fn, acc, list) {\n var idx = list.length - 1;\n while (idx >= 0) {\n acc = fn(acc, list[idx]);\n idx -= 1;\n }\n return acc;\n });\n\n /**\n * Returns a value wrapped to indicate that it is the final value of the reduce\n * and transduce functions. The returned value should be considered a black\n * box: the internal structure is not guaranteed to be stable.\n *\n * Note: this optimization is unavailable to functions not explicitly listed\n * above. For instance, it is not currently supported by reduceRight.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category List\n * @sig a -> *\n * @param {*} x The final value of the reduce.\n * @return {*} The wrapped value.\n * @see R.reduce, R.transduce\n * @example\n *\n * R.reduce(\n * R.pipe(R.add, R.when(R.gte(R.__, 10), R.reduced)),\n * 0,\n * [1, 2, 3, 4, 5]) // 10\n */\n var reduced = _curry1(_reduced);\n\n /**\n * Removes the sub-list of `list` starting at index `start` and containing\n * `count` elements. _Note that this is not destructive_: it returns a copy of\n * the list with the changes.\n * No lists have been harmed in the application of this function. \n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @param {Number} start The position to start removing elements\n * @param {Number} count The number of elements to remove\n * @param {Array} list The list to remove from\n * @return {Array} A new Array with `count` elements from `start` removed.\n * @example\n *\n * R.remove(2, 3, [1,2,3,4,5,6,7,8]); //=> [1,2,6,7,8]\n */\n var remove = _curry3(function remove(start, count, list) {\n return _concat(_slice(list, 0, Math.min(start, list.length)), _slice(list, Math.min(list.length, start + count)));\n });\n\n /**\n * Replace a substring or regex match in a string with a replacement.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category String\n * @sig RegExp|String -> String -> String -> String\n * @param {RegExp|String} pattern A regular expression or a substring to match.\n * @param {String} replacement The string to replace the matches with.\n * @param {String} str The String to do the search and replacement in.\n * @return {String} The result.\n * @example\n *\n * R.replace('foo', 'bar', 'foo foo foo'); //=> 'bar foo foo'\n * R.replace(/foo/, 'bar', 'foo foo foo'); //=> 'bar foo foo'\n *\n * // Use the \"g\" (global) flag to replace all occurrences:\n * R.replace(/foo/g, 'bar', 'foo foo foo'); //=> 'bar bar bar'\n */\n var replace = _curry3(function replace(regex, replacement, str) {\n return str.replace(regex, replacement);\n });\n\n /**\n * Returns a new list or string with the elements or characters in reverse\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {Array|String} list\n * @return {Array|String}\n * @example\n *\n * R.reverse([1, 2, 3]); //=> [3, 2, 1]\n * R.reverse([1, 2]); //=> [2, 1]\n * R.reverse([1]); //=> [1]\n * R.reverse([]); //=> []\n *\n * R.reverse('abc'); //=> 'cba'\n * R.reverse('ab'); //=> 'ba'\n * R.reverse('a'); //=> 'a'\n * R.reverse(''); //=> ''\n */\n var reverse = _curry1(function reverse(list) {\n return _isString(list) ? list.split('').reverse().join('') : _slice(list).reverse();\n });\n\n /**\n * Scan is similar to reduce, but returns a list of successively reduced values\n * from the left\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (a,b -> a) -> a -> [b] -> [a]\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {Array} A list of all intermediately reduced values.\n * @example\n *\n * var numbers = [1, 2, 3, 4];\n * var factorials = R.scan(R.multiply, 1, numbers); //=> [1, 1, 2, 6, 24]\n */\n var scan = _curry3(function scan(fn, acc, list) {\n var idx = 0;\n var len = list.length;\n var result = [acc];\n while (idx < len) {\n acc = fn(acc, list[idx]);\n result[idx + 1] = acc;\n idx += 1;\n }\n return result;\n });\n\n /**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the given value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> a -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n * var xLens = R.lensProp('x');\n *\n * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}\n * R.set(xLens, 8, {x: 1, y: 2}); //=> {x: 8, y: 2}\n */\n var set = _curry3(function set(lens, v, x) {\n return over(lens, always(v), x);\n });\n\n /**\n * Returns the elements of the given list or string (or object with a `slice`\n * method) from `fromIndex` (inclusive) to `toIndex` (exclusive).\n *\n * Dispatches to the `slice` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @sig Number -> Number -> String -> String\n * @param {Number} fromIndex The start index (inclusive).\n * @param {Number} toIndex The end index (exclusive).\n * @param {*} list\n * @return {*}\n * @example\n *\n * R.slice(1, 3, ['a', 'b', 'c', 'd']); //=> ['b', 'c']\n * R.slice(1, Infinity, ['a', 'b', 'c', 'd']); //=> ['b', 'c', 'd']\n * R.slice(0, -1, ['a', 'b', 'c', 'd']); //=> ['a', 'b', 'c']\n * R.slice(-3, -1, ['a', 'b', 'c', 'd']); //=> ['b', 'c']\n * R.slice(0, 3, 'ramda'); //=> 'ram'\n */\n var slice = _curry3(_checkForMethod('slice', function slice(fromIndex, toIndex, list) {\n return Array.prototype.slice.call(list, fromIndex, toIndex);\n }));\n\n /**\n * Returns a copy of the list, sorted according to the comparator function,\n * which should accept two values at a time and return a negative number if the\n * first value is smaller, a positive number if it's larger, and zero if they\n * are equal. Please note that this is a **copy** of the list. It does not\n * modify the original.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a,a -> Number) -> [a] -> [a]\n * @param {Function} comparator A sorting function :: a -> b -> Int\n * @param {Array} list The list to sort\n * @return {Array} a new array with its elements sorted by the comparator function.\n * @example\n *\n * var diff = function(a, b) { return a - b; };\n * R.sort(diff, [4,2,7,5]); //=> [2, 4, 5, 7]\n */\n var sort = _curry2(function sort(comparator, list) {\n return _slice(list).sort(comparator);\n });\n\n /**\n * Sorts the list according to the supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord b => (a -> b) -> [a] -> [a]\n * @param {Function} fn\n * @param {Array} list The list to sort.\n * @return {Array} A new list sorted by the keys generated by `fn`.\n * @example\n *\n * var sortByFirstItem = R.sortBy(R.prop(0));\n * var sortByNameCaseInsensitive = R.sortBy(R.compose(R.toLower, R.prop('name')));\n * var pairs = [[-1, 1], [-2, 2], [-3, 3]];\n * sortByFirstItem(pairs); //=> [[-3, 3], [-2, 2], [-1, 1]]\n * var alice = {\n * name: 'ALICE',\n * age: 101\n * };\n * var bob = {\n * name: 'Bob',\n * age: -10\n * };\n * var clara = {\n * name: 'clara',\n * age: 314.159\n * };\n * var people = [clara, bob, alice];\n * sortByNameCaseInsensitive(people); //=> [alice, bob, clara]\n */\n var sortBy = _curry2(function sortBy(fn, list) {\n return _slice(list).sort(function (a, b) {\n var aa = fn(a);\n var bb = fn(b);\n return aa < bb ? -1 : aa > bb ? 1 : 0;\n });\n });\n\n /**\n * Splits a given list or string at a given index.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig Number -> [a] -> [[a], [a]]\n * @sig Number -> String -> [String, String]\n * @param {Number} index The index where the array/string is split.\n * @param {Array|String} array The array/string to be split.\n * @return {Array}\n * @example\n *\n * R.splitAt(1, [1, 2, 3]); //=> [[1], [2, 3]]\n * R.splitAt(5, 'hello world'); //=> ['hello', ' world']\n * R.splitAt(-1, 'foobar'); //=> ['fooba', 'r']\n */\n var splitAt = _curry2(function splitAt(index, array) {\n return [\n slice(0, index, array),\n slice(index, length(array), array)\n ];\n });\n\n /**\n * Splits a collection into slices of the specified length.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @sig Number -> String -> [String]\n * @param {Number} n\n * @param {Array} list\n * @return {Array}\n * @example\n *\n * R.splitEvery(3, [1, 2, 3, 4, 5, 6, 7]); //=> [[1, 2, 3], [4, 5, 6], [7]]\n * R.splitEvery(3, 'foobarbaz'); //=> ['foo', 'bar', 'baz']\n */\n var splitEvery = _curry2(function splitEvery(n, list) {\n if (n <= 0) {\n throw new Error('First argument to splitEvery must be a positive integer');\n }\n var result = [];\n var idx = 0;\n while (idx < list.length) {\n result.push(slice(idx, idx += n, list));\n }\n return result;\n });\n\n /**\n * Takes a list and a predicate and returns a pair of lists with the following properties:\n *\n * - the result of concatenating the two output lists is equivalent to the input list;\n * - none of the elements of the first output list satisfies the predicate; and\n * - if the second output list is non-empty, its first element satisfies the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [[a], [a]]\n * @param {Function} pred The predicate that determines where the array is split.\n * @param {Array} list The array to be split.\n * @return {Array}\n * @example\n *\n * R.splitWhen(R.equals(2), [1, 2, 3, 1, 2, 3]); //=> [[1], [2, 3, 1, 2, 3]]\n */\n var splitWhen = _curry2(function splitWhen(pred, list) {\n var idx = 0;\n var len = list.length;\n var prefix = [];\n while (idx < len && !pred(list[idx])) {\n prefix.push(list[idx]);\n idx += 1;\n }\n return [\n prefix,\n _slice(list, idx)\n ];\n });\n\n /**\n * Subtracts its second argument from its first argument.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a - b`.\n * @see R.add\n * @example\n *\n * R.subtract(10, 8); //=> 2\n *\n * var minus5 = R.subtract(R.__, 5);\n * minus5(17); //=> 12\n *\n * var complementaryAngle = R.subtract(90);\n * complementaryAngle(30); //=> 60\n * complementaryAngle(72); //=> 18\n */\n var subtract = _curry2(function subtract(a, b) {\n return Number(a) - Number(b);\n });\n\n /**\n * Returns all but the first element of the given list or string (or object\n * with a `tail` method).\n *\n * Dispatches to the `slice` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.head, R.init, R.last\n * @example\n *\n * R.tail([1, 2, 3]); //=> [2, 3]\n * R.tail([1, 2]); //=> [2]\n * R.tail([1]); //=> []\n * R.tail([]); //=> []\n *\n * R.tail('abc'); //=> 'bc'\n * R.tail('ab'); //=> 'b'\n * R.tail('a'); //=> ''\n * R.tail(''); //=> ''\n */\n var tail = _checkForMethod('tail', slice(1, Infinity));\n\n /**\n * Returns the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `take` method).\n *\n * Dispatches to the `take` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*}\n * @see R.drop\n * @example\n *\n * R.take(1, ['foo', 'bar', 'baz']); //=> ['foo']\n * R.take(2, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n * R.take(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.take(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.take(3, 'ramda'); //=> 'ram'\n *\n * var personnel = [\n * 'Dave Brubeck',\n * 'Paul Desmond',\n * 'Eugene Wright',\n * 'Joe Morello',\n * 'Gerry Mulligan',\n * 'Bob Bates',\n * 'Joe Dodge',\n * 'Ron Crotty'\n * ];\n *\n * var takeFive = R.take(5);\n * takeFive(personnel);\n * //=> ['Dave Brubeck', 'Paul Desmond', 'Eugene Wright', 'Joe Morello', 'Gerry Mulligan']\n */\n var take = _curry2(_dispatchable('take', _xtake, function take(n, xs) {\n return slice(0, n < 0 ? Infinity : n, xs);\n }));\n\n /**\n * Returns a new list containing the last `n` elements of a given list, passing\n * each value to the supplied predicate function, and terminating when the\n * predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropLastWhile, R.addIndex\n * @example\n *\n * var isNotOne = x => x !== 1;\n *\n * R.takeLastWhile(isNotOne, [1, 2, 3, 4]); //=> [2, 3, 4]\n */\n var takeLastWhile = _curry2(function takeLastWhile(fn, list) {\n var idx = list.length - 1;\n while (idx >= 0 && fn(list[idx])) {\n idx -= 1;\n }\n return _slice(list, idx + 1, Infinity);\n });\n\n /**\n * Returns a new list containing the first `n` elements of a given list,\n * passing each value to the supplied predicate function, and terminating when\n * the predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * Dispatches to the `takeWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropWhile, R.transduce, R.addIndex\n * @example\n *\n * var isNotFour = x => x !== 4;\n *\n * R.takeWhile(isNotFour, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3]\n */\n var takeWhile = _curry2(_dispatchable('takeWhile', _xtakeWhile, function takeWhile(fn, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len && fn(list[idx])) {\n idx += 1;\n }\n return _slice(list, 0, idx);\n }));\n\n /**\n * Runs the given function with the supplied object, then returns the object.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a -> *) -> a -> a\n * @param {Function} fn The function to call with `x`. The return value of `fn` will be thrown away.\n * @param {*} x\n * @return {*} `x`.\n * @example\n *\n * var sayX = x => console.log('x is ' + x);\n * R.tap(sayX, 100); //=> 100\n * //-> 'x is 100'\n */\n var tap = _curry2(function tap(fn, x) {\n fn(x);\n return x;\n });\n\n /**\n * Calls an input function `n` times, returning an array containing the results\n * of those function calls.\n *\n * `fn` is passed one argument: The current value of `n`, which begins at `0`\n * and is gradually incremented to `n - 1`.\n *\n * @func\n * @memberOf R\n * @since v0.2.3\n * @category List\n * @sig (Number -> a) -> Number -> [a]\n * @param {Function} fn The function to invoke. Passed one argument, the current value of `n`.\n * @param {Number} n A value between `0` and `n - 1`. Increments after each function call.\n * @return {Array} An array containing the return values of all calls to `fn`.\n * @example\n *\n * R.times(R.identity, 5); //=> [0, 1, 2, 3, 4]\n */\n var times = _curry2(function times(fn, n) {\n var len = Number(n);\n var idx = 0;\n var list;\n if (len < 0 || isNaN(len)) {\n throw new RangeError('n must be a non-negative number');\n }\n list = new Array(len);\n while (idx < len) {\n list[idx] = fn(idx);\n idx += 1;\n }\n return list;\n });\n\n /**\n * Converts an object into an array of key, value arrays. Only the object's\n * own properties are used.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own properties.\n * @see R.fromPairs\n * @example\n *\n * R.toPairs({a: 1, b: 2, c: 3}); //=> [['a', 1], ['b', 2], ['c', 3]]\n */\n var toPairs = _curry1(function toPairs(obj) {\n var pairs = [];\n for (var prop in obj) {\n if (_has(prop, obj)) {\n pairs[pairs.length] = [\n prop,\n obj[prop]\n ];\n }\n }\n return pairs;\n });\n\n /**\n * Converts an object into an array of key, value arrays. The object's own\n * properties and prototype properties are used. Note that the order of the\n * output array is not guaranteed to be consistent across different JS\n * platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own\n * and prototype properties.\n * @example\n *\n * var F = function() { this.x = 'X'; };\n * F.prototype.y = 'Y';\n * var f = new F();\n * R.toPairsIn(f); //=> [['x','X'], ['y','Y']]\n */\n var toPairsIn = _curry1(function toPairsIn(obj) {\n var pairs = [];\n for (var prop in obj) {\n pairs[pairs.length] = [\n prop,\n obj[prop]\n ];\n }\n return pairs;\n });\n\n /**\n * Transposes the rows and columns of a 2D list.\n * When passed a list of `n` lists of length `x`,\n * returns a list of `x` lists of length `n`.\n *\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [[a]] -> [[a]]\n * @param {Array} list A 2D list\n * @return {Array} A 2D list\n * @example\n *\n * R.transpose([[1, 'a'], [2, 'b'], [3, 'c']]) //=> [[1, 2, 3], ['a', 'b', 'c']]\n * R.transpose([[1, 2, 3], ['a', 'b', 'c']]) //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n *\n * If some of the rows are shorter than the following rows, their elements are skipped:\n *\n * R.transpose([[10, 11], [20], [], [30, 31, 32]]) //=> [[10, 20, 30], [11, 31], [32]]\n */\n var transpose = _curry1(function transpose(outerlist) {\n var i = 0;\n var result = [];\n while (i < outerlist.length) {\n var innerlist = outerlist[i];\n var j = 0;\n while (j < innerlist.length) {\n if (typeof result[j] === 'undefined') {\n result[j] = [];\n }\n result[j].push(innerlist[j]);\n j += 1;\n }\n i += 1;\n }\n return result;\n });\n\n /**\n * Removes (strips) whitespace from both ends of the string.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to trim.\n * @return {String} Trimmed version of `str`.\n * @example\n *\n * R.trim(' xyz '); //=> 'xyz'\n * R.map(R.trim, R.split(',', 'x, y, z')); //=> ['x', 'y', 'z']\n */\n var trim = function () {\n var ws = '\\t\\n\\x0B\\f\\r \\xA0\\u1680\\u180E\\u2000\\u2001\\u2002\\u2003' + '\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028' + '\\u2029\\uFEFF';\n var zeroWidth = '\\u200B';\n var hasProtoTrim = typeof String.prototype.trim === 'function';\n if (!hasProtoTrim || (ws.trim() || !zeroWidth.trim())) {\n return _curry1(function trim(str) {\n var beginRx = new RegExp('^[' + ws + '][' + ws + ']*');\n var endRx = new RegExp('[' + ws + '][' + ws + ']*$');\n return str.replace(beginRx, '').replace(endRx, '');\n });\n } else {\n return _curry1(function trim(str) {\n return str.trim();\n });\n }\n }();\n\n /**\n * `tryCatch` takes two functions, a `tryer` and a `catcher`. The returned\n * function evaluates the `tryer`; if it does not throw, it simply returns the\n * result. If the `tryer` *does* throw, the returned function evaluates the\n * `catcher` function and returns its result. Note that for effective\n * composition with this function, both the `tryer` and `catcher` functions\n * must return the same type of results.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig (...x -> a) -> ((e, ...x) -> a) -> (...x -> a)\n * @param {Function} tryer The function that may throw.\n * @param {Function} catcher The function that will be evaluated if `tryer` throws.\n * @return {Function} A new function that will catch exceptions and send then to the catcher.\n * @example\n *\n * R.tryCatch(R.prop('x'), R.F, {x: true}); //=> true\n * R.tryCatch(R.prop('x'), R.F, null); //=> false\n */\n var tryCatch = _curry2(function _tryCatch(tryer, catcher) {\n return _arity(tryer.length, function () {\n try {\n return tryer.apply(this, arguments);\n } catch (e) {\n return catcher.apply(this, _concat([e], arguments));\n }\n });\n });\n\n /**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n * R.type({}); //=> \"Object\"\n * R.type(1); //=> \"Number\"\n * R.type(false); //=> \"Boolean\"\n * R.type('s'); //=> \"String\"\n * R.type(null); //=> \"Null\"\n * R.type([]); //=> \"Array\"\n * R.type(/[A-z]/); //=> \"RegExp\"\n */\n var type = _curry1(function type(val) {\n return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n });\n\n /**\n * Takes a function `fn`, which takes a single array argument, and returns a\n * function which:\n *\n * - takes any number of positional arguments;\n * - passes these arguments to `fn` as an array; and\n * - returns the result.\n *\n * In other words, R.unapply derives a variadic function from a function which\n * takes an array. R.unapply is the inverse of R.apply.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Function\n * @sig ([*...] -> a) -> (*... -> a)\n * @param {Function} fn\n * @return {Function}\n * @see R.apply\n * @example\n *\n * R.unapply(JSON.stringify)(1, 2, 3); //=> '[1,2,3]'\n */\n var unapply = _curry1(function unapply(fn) {\n return function () {\n return fn(_slice(arguments));\n };\n });\n\n /**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 1 parameter. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> b) -> (a -> b)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n * arity 1.\n * @example\n *\n * var takesTwoArgs = function(a, b) {\n * return [a, b];\n * };\n * takesTwoArgs.length; //=> 2\n * takesTwoArgs(1, 2); //=> [1, 2]\n *\n * var takesOneArg = R.unary(takesTwoArgs);\n * takesOneArg.length; //=> 1\n * // Only 1 argument is passed to the wrapped function\n * takesOneArg(1, 2); //=> [1, undefined]\n */\n var unary = _curry1(function unary(fn) {\n return nAry(1, fn);\n });\n\n /**\n * Returns a function of arity `n` from a (manually) curried function.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Function\n * @sig Number -> (a -> b) -> (a -> c)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to uncurry.\n * @return {Function} A new function.\n * @see R.curry\n * @example\n *\n * var addFour = a => b => c => d => a + b + c + d;\n *\n * var uncurriedAddFour = R.uncurryN(4, addFour);\n * uncurriedAddFour(1, 2, 3, 4); //=> 10\n */\n var uncurryN = _curry2(function uncurryN(depth, fn) {\n return curryN(depth, function () {\n var currentDepth = 1;\n var value = fn;\n var idx = 0;\n var endIdx;\n while (currentDepth <= depth && typeof value === 'function') {\n endIdx = currentDepth === depth ? arguments.length : idx + value.length;\n value = value.apply(this, _slice(arguments, idx, endIdx));\n currentDepth += 1;\n idx = endIdx;\n }\n return value;\n });\n });\n\n /**\n * Builds a list from a seed value. Accepts an iterator function, which returns\n * either false to stop iteration or an array of length 2 containing the value\n * to add to the resulting list and the seed to be used in the next call to the\n * iterator function.\n *\n * The iterator function receives one argument: *(seed)*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (a -> [b]) -> * -> [b]\n * @param {Function} fn The iterator function. receives one argument, `seed`, and returns\n * either false to quit iteration or an array of length two to proceed. The element\n * at index 0 of this array will be added to the resulting array, and the element\n * at index 1 will be passed to the next call to `fn`.\n * @param {*} seed The seed value.\n * @return {Array} The final list.\n * @example\n *\n * var f = n => n > 50 ? false : [-n, n + 10];\n * R.unfold(f, 10); //=> [-10, -20, -30, -40, -50]\n */\n var unfold = _curry2(function unfold(fn, seed) {\n var pair = fn(seed);\n var result = [];\n while (pair && pair.length) {\n result[result.length] = pair[0];\n pair = fn(pair[1]);\n }\n return result;\n });\n\n /**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied predicate to\n * two list elements. Prefers the first item if two items compare equal based\n * on the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category List\n * @sig (a, a -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n * var strEq = R.eqBy(String);\n * R.uniqWith(strEq)([1, '1', 2, 1]); //=> [1, 2]\n * R.uniqWith(strEq)([{}, {}]); //=> [{}]\n * R.uniqWith(strEq)([1, '1', 1]); //=> [1]\n * R.uniqWith(strEq)(['1', 1, 1]); //=> ['1']\n */\n var uniqWith = _curry2(function uniqWith(pred, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n var item;\n while (idx < len) {\n item = list[idx];\n if (!_containsWith(pred, item, result)) {\n result[result.length] = item;\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is not satisfied, the function will return the result of\n * calling the `whenFalseFn` function with the same argument. If the predicate\n * is satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} whenFalseFn A function to invoke when the `pred` evaluates\n * to a falsy value.\n * @param {*} x An object to test with the `pred` function and\n * pass to `whenFalseFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenFalseFn`.\n * @see R.ifElse, R.when\n * @example\n *\n * // coerceArray :: (a|[a]) -> [a]\n * var coerceArray = R.unless(R.isArrayLike, R.of);\n * coerceArray([1, 2, 3]); //=> [1, 2, 3]\n * coerceArray(1); //=> [1]\n */\n var unless = _curry3(function unless(pred, whenFalseFn, x) {\n return pred(x) ? x : whenFalseFn(x);\n });\n\n /**\n * Takes a predicate, a transformation function, and an initial value,\n * and returns a value of the same type as the initial value.\n * It does so by applying the transformation until the predicate is satisfied,\n * at which point it returns the satisfactory value.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} fn The iterator function\n * @param {*} init Initial value\n * @return {*} Final value that satisfies predicate\n * @example\n *\n * R.until(R.gt(R.__, 100), R.multiply(2))(1) // => 128\n */\n var until = _curry3(function until(pred, fn, init) {\n var val = init;\n while (!pred(val)) {\n val = fn(val);\n }\n return val;\n });\n\n /**\n * Returns a new copy of the array with the element at the provided index\n * replaced with the given value.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} idx The index to update.\n * @param {*} x The value to exist at the given index of the returned array.\n * @param {Array|Arguments} list The source array-like object to be updated.\n * @return {Array} A copy of `list` with the value at index `idx` replaced with `x`.\n * @see R.adjust\n * @example\n *\n * R.update(1, 11, [0, 1, 2]); //=> [0, 11, 2]\n * R.update(1)(11)([0, 1, 2]); //=> [0, 11, 2]\n */\n var update = _curry3(function update(idx, x, list) {\n return adjust(always(x), idx, list);\n });\n\n /**\n * Accepts a function `fn` and a list of transformer functions and returns a\n * new curried function. When the new function is invoked, it calls the\n * function `fn` with parameters consisting of the result of calling each\n * supplied handler on successive arguments to the new function.\n *\n * If more arguments are passed to the returned function than transformer\n * functions, those arguments are passed directly to `fn` as additional\n * parameters. If you expect additional arguments that don't need to be\n * transformed, although you can ignore them, it's best to pass an identity\n * function so that the new function reports the correct arity.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (x1 -> x2 -> ... -> z) -> [(a -> x1), (b -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} fn The function to wrap.\n * @param {Array} transformers A list of transformer functions\n * @return {Function} The wrapped function.\n * @example\n *\n * R.useWith(Math.pow, [R.identity, R.identity])(3, 4); //=> 81\n * R.useWith(Math.pow, [R.identity, R.identity])(3)(4); //=> 81\n * R.useWith(Math.pow, [R.dec, R.inc])(3, 4); //=> 32\n * R.useWith(Math.pow, [R.dec, R.inc])(3)(4); //=> 32\n */\n var useWith = _curry2(function useWith(fn, transformers) {\n return curryN(transformers.length, function () {\n var args = [];\n var idx = 0;\n while (idx < transformers.length) {\n args.push(transformers[idx].call(this, arguments[idx]));\n idx += 1;\n }\n return fn.apply(this, args.concat(_slice(arguments, transformers.length)));\n });\n });\n\n /**\n * Returns a list of all the enumerable own properties of the supplied object.\n * Note that the order of the output array is not guaranteed across different\n * JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own properties.\n * @example\n *\n * R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]\n */\n var values = _curry1(function values(obj) {\n var props = keys(obj);\n var len = props.length;\n var vals = [];\n var idx = 0;\n while (idx < len) {\n vals[idx] = obj[props[idx]];\n idx += 1;\n }\n return vals;\n });\n\n /**\n * Returns a list of all the properties, including prototype properties, of the\n * supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own and prototype properties.\n * @example\n *\n * var F = function() { this.x = 'X'; };\n * F.prototype.y = 'Y';\n * var f = new F();\n * R.valuesIn(f); //=> ['X', 'Y']\n */\n var valuesIn = _curry1(function valuesIn(obj) {\n var prop;\n var vs = [];\n for (prop in obj) {\n vs[vs.length] = obj[prop];\n }\n return vs;\n });\n\n /**\n * Returns a \"view\" of the given data structure, determined by the given lens.\n * The lens's focus determines which portion of the data structure is visible.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> s -> a\n * @param {Lens} lens\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n * var xLens = R.lensProp('x');\n *\n * R.view(xLens, {x: 1, y: 2}); //=> 1\n * R.view(xLens, {x: 4, y: 2}); //=> 4\n */\n // `Const` is a functor that effectively ignores the function given to `map`.\n // Using `Const` effectively ignores the setter function of the `lens`,\n // leaving the value returned by the getter function unmodified.\n var view = function () {\n // `Const` is a functor that effectively ignores the function given to `map`.\n var Const = function (x) {\n return {\n value: x,\n map: function () {\n return this;\n }\n };\n };\n return _curry2(function view(lens, x) {\n // Using `Const` effectively ignores the setter function of the `lens`,\n // leaving the value returned by the getter function unmodified.\n return lens(Const)(x).value;\n });\n }();\n\n /**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is satisfied, the function will return the result of calling\n * the `whenTrueFn` function with the same argument. If the predicate is not\n * satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} whenTrueFn A function to invoke when the `condition`\n * evaluates to a truthy value.\n * @param {*} x An object to test with the `pred` function and\n * pass to `whenTrueFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenTrueFn`.\n * @see R.ifElse, R.unless\n * @example\n *\n * // truncate :: String -> String\n * var truncate = R.when(\n * R.propSatisfies(R.gt(R.__, 10), 'length'),\n * R.pipe(R.take(10), R.append('…'), R.join(''))\n * );\n * truncate('12345'); //=> '12345'\n * truncate('0123456789ABC'); //=> '0123456789…'\n */\n var when = _curry3(function when(pred, whenTrueFn, x) {\n return pred(x) ? whenTrueFn(x) : x;\n });\n\n /**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec. Each of the spec's own properties must be a predicate function.\n * Each predicate is applied to the value of the corresponding property of the\n * test object. `where` returns true if all the predicates return true, false\n * otherwise.\n *\n * `where` is well suited to declaratively expressing constraints for other\n * functions such as `filter` and `find`.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Object\n * @sig {String: (* -> Boolean)} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @example\n *\n * // pred :: Object -> Boolean\n * var pred = R.where({\n * a: R.equals('foo'),\n * b: R.complement(R.equals('bar')),\n * x: R.gt(_, 10),\n * y: R.lt(_, 20)\n * });\n *\n * pred({a: 'foo', b: 'xxx', x: 11, y: 19}); //=> true\n * pred({a: 'xxx', b: 'xxx', x: 11, y: 19}); //=> false\n * pred({a: 'foo', b: 'bar', x: 11, y: 19}); //=> false\n * pred({a: 'foo', b: 'xxx', x: 10, y: 19}); //=> false\n * pred({a: 'foo', b: 'xxx', x: 11, y: 20}); //=> false\n */\n var where = _curry2(function where(spec, testObj) {\n for (var prop in spec) {\n if (_has(prop, spec) && !spec[prop](testObj[prop])) {\n return false;\n }\n }\n return true;\n });\n\n /**\n * Wrap a function inside another to allow you to make adjustments to the\n * parameters, or do other processing either before the internal function is\n * called or with its results.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a... -> b) -> ((a... -> b) -> a... -> c) -> (a... -> c)\n * @param {Function} fn The function to wrap.\n * @param {Function} wrapper The wrapper function.\n * @return {Function} The wrapped function.\n * @example\n *\n * var greet = name => 'Hello ' + name;\n *\n * var shoutedGreet = R.wrap(greet, (gr, name) => gr(name).toUpperCase());\n *\n * shoutedGreet(\"Kathy\"); //=> \"HELLO KATHY\"\n *\n * var shortenedGreet = R.wrap(greet, function(gr, name) {\n * return gr(name.substring(0, 3));\n * });\n * shortenedGreet(\"Robert\"); //=> \"Hello Rob\"\n */\n var wrap = _curry2(function wrap(fn, wrapper) {\n return curryN(fn.length, function () {\n return wrapper.apply(this, _concat([fn], arguments));\n });\n });\n\n /**\n * Creates a new list out of the two supplied by creating each possible pair\n * from the lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The list made by combining each possible pair from\n * `as` and `bs` into pairs (`[a, b]`).\n * @example\n *\n * R.xprod([1, 2], ['a', 'b']); //=> [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]\n */\n // = xprodWith(prepend); (takes about 3 times as long...)\n var xprod = _curry2(function xprod(a, b) {\n // = xprodWith(prepend); (takes about 3 times as long...)\n var idx = 0;\n var ilen = a.length;\n var j;\n var jlen = b.length;\n var result = [];\n while (idx < ilen) {\n j = 0;\n while (j < jlen) {\n result[result.length] = [\n a[idx],\n b[j]\n ];\n j += 1;\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Creates a new list out of the two supplied by pairing up equally-positioned\n * items from both lists. The returned list is truncated to the length of the\n * shorter of the two input lists.\n * Note: `zip` is equivalent to `zipWith(function(a, b) { return [a, b] })`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by pairing up same-indexed elements of `list1` and `list2`.\n * @example\n *\n * R.zip([1, 2, 3], ['a', 'b', 'c']); //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n */\n var zip = _curry2(function zip(a, b) {\n var rv = [];\n var idx = 0;\n var len = Math.min(a.length, b.length);\n while (idx < len) {\n rv[idx] = [\n a[idx],\n b[idx]\n ];\n idx += 1;\n }\n return rv;\n });\n\n /**\n * Creates a new object out of a list of keys and a list of values.\n * Key/value pairing is truncated to the length of the shorter of the two lists.\n * Note: `zipObj` is equivalent to `pipe(zipWith(pair), fromPairs)`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [String] -> [*] -> {String: *}\n * @param {Array} keys The array that will be properties on the output object.\n * @param {Array} values The list of values on the output object.\n * @return {Object} The object made by pairing up same-indexed elements of `keys` and `values`.\n * @example\n *\n * R.zipObj(['a', 'b', 'c'], [1, 2, 3]); //=> {a: 1, b: 2, c: 3}\n */\n var zipObj = _curry2(function zipObj(keys, values) {\n var idx = 0;\n var len = Math.min(keys.length, values.length);\n var out = {};\n while (idx < len) {\n out[keys[idx]] = values[idx];\n idx += 1;\n }\n return out;\n });\n\n /**\n * Creates a new list out of the two supplied by applying the function to each\n * equally-positioned pair in the lists. The returned list is truncated to the\n * length of the shorter of the two input lists.\n *\n * @function\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a,b -> c) -> [a] -> [b] -> [c]\n * @param {Function} fn The function used to combine the two elements into one value.\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by combining same-indexed elements of `list1` and `list2`\n * using `fn`.\n * @example\n *\n * var f = (x, y) => {\n * // ...\n * };\n * R.zipWith(f, [1, 2, 3], ['a', 'b', 'c']);\n * //=> [f(1, 'a'), f(2, 'b'), f(3, 'c')]\n */\n var zipWith = _curry3(function zipWith(fn, a, b) {\n var rv = [];\n var idx = 0;\n var len = Math.min(a.length, b.length);\n while (idx < len) {\n rv[idx] = fn(a[idx], b[idx]);\n idx += 1;\n }\n return rv;\n });\n\n /**\n * A function that always returns `false`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.T\n * @example\n *\n * R.F(); //=> false\n */\n var F = always(false);\n\n /**\n * A function that always returns `true`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.F\n * @example\n *\n * R.T(); //=> true\n */\n var T = always(true);\n\n /**\n * Copies an object.\n *\n * @private\n * @param {*} value The value to be copied\n * @param {Array} refFrom Array containing the source references\n * @param {Array} refTo Array containing the copied source references\n * @param {Boolean} deep Whether or not to perform deep cloning.\n * @return {*} The copied value.\n */\n var _clone = function _clone(value, refFrom, refTo, deep) {\n var copy = function copy(copiedValue) {\n var len = refFrom.length;\n var idx = 0;\n while (idx < len) {\n if (value === refFrom[idx]) {\n return refTo[idx];\n }\n idx += 1;\n }\n refFrom[idx + 1] = value;\n refTo[idx + 1] = copiedValue;\n for (var key in value) {\n copiedValue[key] = deep ? _clone(value[key], refFrom, refTo, true) : value[key];\n }\n return copiedValue;\n };\n switch (type(value)) {\n case 'Object':\n return copy({});\n case 'Array':\n return copy([]);\n case 'Date':\n return new Date(value.valueOf());\n case 'RegExp':\n return _cloneRegExp(value);\n default:\n return value;\n }\n };\n\n var _createPartialApplicator = function _createPartialApplicator(concat) {\n return _curry2(function (fn, args) {\n return _arity(Math.max(0, fn.length - args.length), function () {\n return fn.apply(this, concat(args, arguments));\n });\n });\n };\n\n var _dropLast = function dropLast(n, xs) {\n return take(n < xs.length ? xs.length - n : 0, xs);\n };\n\n // Values of other types are only equal if identical.\n var _equals = function _equals(a, b, stackA, stackB) {\n if (identical(a, b)) {\n return true;\n }\n if (type(a) !== type(b)) {\n return false;\n }\n if (a == null || b == null) {\n return false;\n }\n if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n }\n switch (type(a)) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n return a === b;\n }\n break;\n case 'Boolean':\n case 'Number':\n case 'String':\n if (!(typeof a === typeof b && identical(a.valueOf(), b.valueOf()))) {\n return false;\n }\n break;\n case 'Date':\n if (!identical(a.valueOf(), b.valueOf())) {\n return false;\n }\n break;\n case 'Error':\n return a.name === b.name && a.message === b.message;\n case 'RegExp':\n if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n return false;\n }\n break;\n case 'Map':\n case 'Set':\n if (!_equals(_arrayFromIterator(a.entries()), _arrayFromIterator(b.entries()), stackA, stackB)) {\n return false;\n }\n break;\n case 'Int8Array':\n case 'Uint8Array':\n case 'Uint8ClampedArray':\n case 'Int16Array':\n case 'Uint16Array':\n case 'Int32Array':\n case 'Uint32Array':\n case 'Float32Array':\n case 'Float64Array':\n break;\n case 'ArrayBuffer':\n break;\n default:\n // Values of other types are only equal if identical.\n return false;\n }\n var keysA = keys(a);\n if (keysA.length !== keys(b).length) {\n return false;\n }\n var idx = stackA.length - 1;\n while (idx >= 0) {\n if (stackA[idx] === a) {\n return stackB[idx] === b;\n }\n idx -= 1;\n }\n stackA.push(a);\n stackB.push(b);\n idx = keysA.length - 1;\n while (idx >= 0) {\n var key = keysA[idx];\n if (!(_has(key, b) && _equals(b[key], a[key], stackA, stackB))) {\n return false;\n }\n idx -= 1;\n }\n stackA.pop();\n stackB.pop();\n return true;\n };\n\n /**\n * `_makeFlat` is a helper function that returns a one-level or fully recursive\n * function based on the flag passed in.\n *\n * @private\n */\n var _makeFlat = function _makeFlat(recursive) {\n return function flatt(list) {\n var value, jlen, j;\n var result = [];\n var idx = 0;\n var ilen = list.length;\n while (idx < ilen) {\n if (isArrayLike(list[idx])) {\n value = recursive ? flatt(list[idx]) : list[idx];\n j = 0;\n jlen = value.length;\n while (j < jlen) {\n result[result.length] = value[j];\n j += 1;\n }\n } else {\n result[result.length] = list[idx];\n }\n idx += 1;\n }\n return result;\n };\n };\n\n var _reduce = function () {\n function _arrayReduce(xf, acc, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n acc = xf['@@transducer/step'](acc, list[idx]);\n if (acc && acc['@@transducer/reduced']) {\n acc = acc['@@transducer/value'];\n break;\n }\n idx += 1;\n }\n return xf['@@transducer/result'](acc);\n }\n function _iterableReduce(xf, acc, iter) {\n var step = iter.next();\n while (!step.done) {\n acc = xf['@@transducer/step'](acc, step.value);\n if (acc && acc['@@transducer/reduced']) {\n acc = acc['@@transducer/value'];\n break;\n }\n step = iter.next();\n }\n return xf['@@transducer/result'](acc);\n }\n function _methodReduce(xf, acc, obj) {\n return xf['@@transducer/result'](obj.reduce(bind(xf['@@transducer/step'], xf), acc));\n }\n var symIterator = typeof Symbol !== 'undefined' ? Symbol.iterator : '@@iterator';\n return function _reduce(fn, acc, list) {\n if (typeof fn === 'function') {\n fn = _xwrap(fn);\n }\n if (isArrayLike(list)) {\n return _arrayReduce(fn, acc, list);\n }\n if (typeof list.reduce === 'function') {\n return _methodReduce(fn, acc, list);\n }\n if (list[symIterator] != null) {\n return _iterableReduce(fn, acc, list[symIterator]());\n }\n if (typeof list.next === 'function') {\n return _iterableReduce(fn, acc, list);\n }\n throw new TypeError('reduce: list must be array or iterable');\n };\n }();\n\n var _stepCat = function () {\n var _stepCatArray = {\n '@@transducer/init': Array,\n '@@transducer/step': function (xs, x) {\n xs.push(x);\n return xs;\n },\n '@@transducer/result': _identity\n };\n var _stepCatString = {\n '@@transducer/init': String,\n '@@transducer/step': function (a, b) {\n return a + b;\n },\n '@@transducer/result': _identity\n };\n var _stepCatObject = {\n '@@transducer/init': Object,\n '@@transducer/step': function (result, input) {\n return _assign(result, isArrayLike(input) ? objOf(input[0], input[1]) : input);\n },\n '@@transducer/result': _identity\n };\n return function _stepCat(obj) {\n if (_isTransformer(obj)) {\n return obj;\n }\n if (isArrayLike(obj)) {\n return _stepCatArray;\n }\n if (typeof obj === 'string') {\n return _stepCatString;\n }\n if (typeof obj === 'object') {\n return _stepCatObject;\n }\n throw new Error('Cannot create transformer for ' + obj);\n };\n }();\n\n var _xdropLastWhile = function () {\n function XDropLastWhile(fn, xf) {\n this.f = fn;\n this.retained = [];\n this.xf = xf;\n }\n XDropLastWhile.prototype['@@transducer/init'] = _xfBase.init;\n XDropLastWhile.prototype['@@transducer/result'] = function (result) {\n this.retained = null;\n return this.xf['@@transducer/result'](result);\n };\n XDropLastWhile.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.retain(result, input) : this.flush(result, input);\n };\n XDropLastWhile.prototype.flush = function (result, input) {\n result = _reduce(this.xf['@@transducer/step'], result, this.retained);\n this.retained = [];\n return this.xf['@@transducer/step'](result, input);\n };\n XDropLastWhile.prototype.retain = function (result, input) {\n this.retained.push(input);\n return result;\n };\n return _curry2(function _xdropLastWhile(fn, xf) {\n return new XDropLastWhile(fn, xf);\n });\n }();\n\n var _xgroupBy = function () {\n function XGroupBy(f, xf) {\n this.xf = xf;\n this.f = f;\n this.inputs = {};\n }\n XGroupBy.prototype['@@transducer/init'] = _xfBase.init;\n XGroupBy.prototype['@@transducer/result'] = function (result) {\n var key;\n for (key in this.inputs) {\n if (_has(key, this.inputs)) {\n result = this.xf['@@transducer/step'](result, this.inputs[key]);\n if (result['@@transducer/reduced']) {\n result = result['@@transducer/value'];\n break;\n }\n }\n }\n this.inputs = null;\n return this.xf['@@transducer/result'](result);\n };\n XGroupBy.prototype['@@transducer/step'] = function (result, input) {\n var key = this.f(input);\n this.inputs[key] = this.inputs[key] || [\n key,\n []\n ];\n this.inputs[key][1] = append(input, this.inputs[key][1]);\n return result;\n };\n return _curry2(function _xgroupBy(f, xf) {\n return new XGroupBy(f, xf);\n });\n }();\n\n /**\n * Creates a new list iteration function from an existing one by adding two new\n * parameters to its callback function: the current index, and the entire list.\n *\n * This would turn, for instance, Ramda's simple `map` function into one that\n * more closely resembles `Array.prototype.map`. Note that this will only work\n * for functions in which the iteration callback function is the first\n * parameter, and where the list is the last parameter. (This latter might be\n * unimportant if the list parameter is not used.)\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Function\n * @category List\n * @sig ((a ... -> b) ... -> [a] -> *) -> (a ..., Int, [a] -> b) ... -> [a] -> *)\n * @param {Function} fn A list iteration function that does not pass index or list to its callback\n * @return {Function} An altered list iteration function that passes (item, index, list) to its callback\n * @example\n *\n * var mapIndexed = R.addIndex(R.map);\n * mapIndexed((val, idx) => idx + '-' + val, ['f', 'o', 'o', 'b', 'a', 'r']);\n * //=> ['0-f', '1-o', '2-o', '3-b', '4-a', '5-r']\n */\n var addIndex = _curry1(function addIndex(fn) {\n return curryN(fn.length, function () {\n var idx = 0;\n var origFn = arguments[0];\n var list = arguments[arguments.length - 1];\n var args = _slice(arguments);\n args[0] = function () {\n var result = origFn.apply(this, _concat(arguments, [\n idx,\n list\n ]));\n idx += 1;\n return result;\n };\n return fn.apply(this, args);\n });\n });\n\n /**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 2 parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> c) -> (a, b -> c)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n * arity 2.\n * @example\n *\n * var takesThreeArgs = function(a, b, c) {\n * return [a, b, c];\n * };\n * takesThreeArgs.length; //=> 3\n * takesThreeArgs(1, 2, 3); //=> [1, 2, 3]\n *\n * var takesTwoArgs = R.binary(takesThreeArgs);\n * takesTwoArgs.length; //=> 2\n * // Only 2 arguments are passed to the wrapped function\n * takesTwoArgs(1, 2, 3); //=> [1, 2, undefined]\n */\n var binary = _curry1(function binary(fn) {\n return nAry(2, fn);\n });\n\n /**\n * Creates a deep copy of the value which may contain (nested) `Array`s and\n * `Object`s, `Number`s, `String`s, `Boolean`s and `Date`s. `Function`s are not\n * copied, but assigned by their reference.\n *\n * Dispatches to a `clone` method if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {*} -> {*}\n * @param {*} value The object or array to clone\n * @return {*} A new object or array.\n * @example\n *\n * var objects = [{}, {}, {}];\n * var objectsClone = R.clone(objects);\n * objects[0] === objectsClone[0]; //=> false\n */\n var clone = _curry1(function clone(value) {\n return value != null && typeof value.clone === 'function' ? value.clone() : _clone(value, [], [], true);\n });\n\n /**\n * Returns a curried equivalent of the provided function. The curried function\n * has two unusual capabilities. First, its arguments needn't be provided one\n * at a time. If `f` is a ternary function and `g` is `R.curry(f)`, the\n * following are equivalent:\n *\n * - `g(1)(2)(3)`\n * - `g(1)(2, 3)`\n * - `g(1, 2)(3)`\n * - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value `R.__` may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is `R.__`, the\n * following are equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> a) -> (* -> a)\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curryN\n * @example\n *\n * var addFourNumbers = (a, b, c, d) => a + b + c + d;\n *\n * var curriedAddFourNumbers = R.curry(addFourNumbers);\n * var f = curriedAddFourNumbers(1, 2);\n * var g = f(3);\n * g(4); //=> 10\n */\n var curry = _curry1(function curry(fn) {\n return curryN(fn.length, fn);\n });\n\n /**\n * Returns all but the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `drop` method).\n *\n * Dispatches to the `drop` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*}\n * @see R.take, R.transduce\n * @example\n *\n * R.drop(1, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n * R.drop(2, ['foo', 'bar', 'baz']); //=> ['baz']\n * R.drop(3, ['foo', 'bar', 'baz']); //=> []\n * R.drop(4, ['foo', 'bar', 'baz']); //=> []\n * R.drop(3, 'ramda'); //=> 'da'\n */\n var drop = _curry2(_dispatchable('drop', _xdrop, function drop(n, xs) {\n return slice(Math.max(0, n), Infinity, xs);\n }));\n\n /**\n * Returns a list containing all but the last `n` elements of the given `list`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements of `xs` to skip.\n * @param {Array} xs The collection to consider.\n * @return {Array}\n * @see R.takeLast\n * @example\n *\n * R.dropLast(1, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n * R.dropLast(2, ['foo', 'bar', 'baz']); //=> ['foo']\n * R.dropLast(3, ['foo', 'bar', 'baz']); //=> []\n * R.dropLast(4, ['foo', 'bar', 'baz']); //=> []\n * R.dropLast(3, 'ramda'); //=> 'ra'\n */\n var dropLast = _curry2(_dispatchable('dropLast', _xdropLast, _dropLast));\n\n /**\n * Returns a new list containing all but last the`n` elements of a given list,\n * passing each value from the right to the supplied predicate function,\n * skipping elements while the predicate function returns `true`. The predicate\n * function is passed one argument: (value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.takeLastWhile, R.addIndex\n * @example\n *\n * var lteThree = x => x <= 3;\n *\n * R.dropLastWhile(lteThree, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3, 4]\n */\n var dropLastWhile = _curry2(_dispatchable('dropLastWhile', _xdropLastWhile, _dropLastWhile));\n\n /**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * R.equals(1, 1); //=> true\n * R.equals(1, '1'); //=> false\n * R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n * var a = {}; a.v = a;\n * var b = {}; b.v = b;\n * R.equals(a, b); //=> true\n */\n var equals = _curry2(function equals(a, b) {\n return _equals(a, b, [], []);\n });\n\n /**\n * Takes a predicate and a \"filterable\", and returns a new filterable of the\n * same type containing the members of the given filterable which satisfy the\n * given predicate.\n *\n * Dispatches to the `filter` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.reject, R.transduce, R.addIndex\n * @example\n *\n * var isEven = n => n % 2 === 0;\n *\n * R.filter(isEven, [1, 2, 3, 4]); //=> [2, 4]\n *\n * R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\n // else\n var filter = _curry2(_dispatchable('filter', _xfilter, function (pred, filterable) {\n return _isObject(filterable) ? _reduce(function (acc, key) {\n if (pred(filterable[key])) {\n acc[key] = filterable[key];\n }\n return acc;\n }, {}, keys(filterable)) : // else\n _filter(pred, filterable);\n }));\n\n /**\n * Returns a new list by pulling every item out of it (and all its sub-arrays)\n * and putting them in a new array, depth-first.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b]\n * @param {Array} list The array to consider.\n * @return {Array} The flattened list.\n * @see R.unnest\n * @example\n *\n * R.flatten([1, 2, [3, 4], 5, [6, [7, 8, [9, [10, 11], 12]]]]);\n * //=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]\n */\n var flatten = _curry1(_makeFlat(true));\n\n /**\n * Returns a new function much like the supplied one, except that the first two\n * arguments' order is reversed.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a -> b -> c -> ... -> z) -> (b -> a -> c -> ... -> z)\n * @param {Function} fn The function to invoke with its first two parameters reversed.\n * @return {*} The result of invoking `fn` with its first two parameters' order reversed.\n * @example\n *\n * var mergeThree = (a, b, c) => [].concat(a, b, c);\n *\n * mergeThree(1, 2, 3); //=> [1, 2, 3]\n *\n * R.flip(mergeThree)(1, 2, 3); //=> [2, 1, 3]\n */\n var flip = _curry1(function flip(fn) {\n return curry(function (a, b) {\n var args = _slice(arguments);\n args[0] = b;\n args[1] = a;\n return fn.apply(this, args);\n });\n });\n\n /**\n * Returns the first element of the given list or string. In some libraries\n * this function is named `first`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {Array|String} list\n * @return {*}\n * @see R.tail, R.init, R.last\n * @example\n *\n * R.head(['fi', 'fo', 'fum']); //=> 'fi'\n * R.head([]); //=> undefined\n *\n * R.head('abc'); //=> 'a'\n * R.head(''); //=> ''\n */\n var head = nth(0);\n\n /**\n * Returns all but the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.last, R.head, R.tail\n * @example\n *\n * R.init([1, 2, 3]); //=> [1, 2]\n * R.init([1, 2]); //=> [1]\n * R.init([1]); //=> []\n * R.init([]); //=> []\n *\n * R.init('abc'); //=> 'ab'\n * R.init('ab'); //=> 'a'\n * R.init('a'); //=> ''\n * R.init(''); //=> ''\n */\n var init = slice(0, -1);\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of those\n * elements common to both lists. Duplication is determined according to the\n * value returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate function that determines whether\n * the two supplied elements are equal.\n * @param {Array} list1 One list of items to compare\n * @param {Array} list2 A second list of items to compare\n * @return {Array} A new list containing those elements common to both lists.\n * @see R.intersection\n * @example\n *\n * var buffaloSpringfield = [\n * {id: 824, name: 'Richie Furay'},\n * {id: 956, name: 'Dewey Martin'},\n * {id: 313, name: 'Bruce Palmer'},\n * {id: 456, name: 'Stephen Stills'},\n * {id: 177, name: 'Neil Young'}\n * ];\n * var csny = [\n * {id: 204, name: 'David Crosby'},\n * {id: 456, name: 'Stephen Stills'},\n * {id: 539, name: 'Graham Nash'},\n * {id: 177, name: 'Neil Young'}\n * ];\n *\n * R.intersectionWith(R.eqBy(R.prop('id')), buffaloSpringfield, csny);\n * //=> [{id: 456, name: 'Stephen Stills'}, {id: 177, name: 'Neil Young'}]\n */\n var intersectionWith = _curry3(function intersectionWith(pred, list1, list2) {\n var lookupList, filteredList;\n if (list1.length > list2.length) {\n lookupList = list1;\n filteredList = list2;\n } else {\n lookupList = list2;\n filteredList = list1;\n }\n var results = [];\n var idx = 0;\n while (idx < filteredList.length) {\n if (_containsWith(pred, filteredList[idx], lookupList)) {\n results[results.length] = filteredList[idx];\n }\n idx += 1;\n }\n return uniqWith(pred, results);\n });\n\n /**\n * Transforms the items of the list with the transducer and appends the\n * transformed items to the accumulator using an appropriate iterator function\n * based on the accumulator type.\n *\n * The accumulator can be an array, string, object or a transformer. Iterated\n * items will be appended to arrays and concatenated to strings. Objects will\n * be merged directly or 2-item arrays will be merged as key, value pairs.\n *\n * The accumulator can also be a transformer object that provides a 2-arity\n * reducing iterator function, step, 0-arity initial value function, init, and\n * 1-arity result extraction function result. The step function is used as the\n * iterator function in reduce. The result function is used to convert the\n * final accumulator into the return type and in most cases is R.identity. The\n * init function is used to provide the initial accumulator.\n *\n * The iteration is performed with R.reduce after initializing the transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig a -> (b -> b) -> [c] -> a\n * @param {*} acc The initial accumulator value.\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @example\n *\n * var numbers = [1, 2, 3, 4];\n * var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *\n * R.into([], transducer, numbers); //=> [2, 3]\n *\n * var intoArray = R.into([]);\n * intoArray(transducer, numbers); //=> [2, 3]\n */\n var into = _curry3(function into(acc, xf, list) {\n return _isTransformer(acc) ? _reduce(xf(acc), acc['@@transducer/init'](), list) : _reduce(xf(_stepCat(acc)), _clone(acc, [], [], false), list);\n });\n\n /**\n * Same as R.invertObj, however this accounts for objects with duplicate values\n * by putting the values into an array.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: [ s, ... ]}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object with keys\n * in an array.\n * @example\n *\n * var raceResultsByFirstName = {\n * first: 'alice',\n * second: 'jake',\n * third: 'alice',\n * };\n * R.invert(raceResultsByFirstName);\n * //=> { 'alice': ['first', 'third'], 'jake':['second'] }\n */\n var invert = _curry1(function invert(obj) {\n var props = keys(obj);\n var len = props.length;\n var idx = 0;\n var out = {};\n while (idx < len) {\n var key = props[idx];\n var val = obj[key];\n var list = _has(val, out) ? out[val] : out[val] = [];\n list[list.length] = key;\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a new object with the keys of the given object as values, and the\n * values of the given object, which are coerced to strings, as keys. Note\n * that the last key found is preferred when handling the same value.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: s}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object\n * @example\n *\n * var raceResults = {\n * first: 'alice',\n * second: 'jake'\n * };\n * R.invertObj(raceResults);\n * //=> { 'alice': 'first', 'jake':'second' }\n *\n * // Alternatively:\n * var raceResults = ['alice', 'jake'];\n * R.invertObj(raceResults);\n * //=> { 'alice': '0', 'jake':'1' }\n */\n var invertObj = _curry1(function invertObj(obj) {\n var props = keys(obj);\n var len = props.length;\n var idx = 0;\n var out = {};\n while (idx < len) {\n var key = props[idx];\n out[obj[key]] = key;\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns `true` if the given value is its type's empty value; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> Boolean\n * @param {*} x\n * @return {Boolean}\n * @see R.empty\n * @example\n *\n * R.isEmpty([1, 2, 3]); //=> false\n * R.isEmpty([]); //=> true\n * R.isEmpty(''); //=> true\n * R.isEmpty(null); //=> false\n * R.isEmpty({}); //=> true\n * R.isEmpty({length: 0}); //=> false\n */\n var isEmpty = _curry1(function isEmpty(x) {\n return x != null && equals(x, empty(x));\n });\n\n /**\n * Returns the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.init, R.head, R.tail\n * @example\n *\n * R.last(['fi', 'fo', 'fum']); //=> 'fum'\n * R.last([]); //=> undefined\n *\n * R.last('abc'); //=> 'c'\n * R.last(''); //=> ''\n */\n var last = nth(-1);\n\n /**\n * Returns the position of the last occurrence of an item in an array, or -1 if\n * the item is not included in the array. `R.equals` is used to determine\n * equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.indexOf\n * @example\n *\n * R.lastIndexOf(3, [-1,3,3,0,1,2,3,4]); //=> 6\n * R.lastIndexOf(10, [1,2,3,4]); //=> -1\n */\n var lastIndexOf = _curry2(function lastIndexOf(target, xs) {\n if (typeof xs.lastIndexOf === 'function' && !_isArray(xs)) {\n return xs.lastIndexOf(target);\n } else {\n var idx = xs.length - 1;\n while (idx >= 0) {\n if (equals(xs[idx], target)) {\n return idx;\n }\n idx -= 1;\n }\n return -1;\n }\n });\n\n /**\n * Takes a function and\n * a [functor](https://github.com/fantasyland/fantasy-land#functor),\n * applies the function to each of the functor's values, and returns\n * a functor of the same shape.\n *\n * Ramda provides suitable `map` implementations for `Array` and `Object`,\n * so this function may be applied to `[1, 2, 3]` or `{x: 1, y: 2, z: 3}`.\n *\n * Dispatches to the `map` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * Also treats functions as functors and will compose them together.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => (a -> b) -> f a -> f b\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {Array} list The list to be iterated over.\n * @return {Array} The new list.\n * @see R.transduce, R.addIndex\n * @example\n *\n * var double = x => x * 2;\n *\n * R.map(double, [1, 2, 3]); //=> [2, 4, 6]\n *\n * R.map(double, {x: 1, y: 2, z: 3}); //=> {x: 2, y: 4, z: 6}\n */\n var map = _curry2(_dispatchable('map', _xmap, function map(fn, functor) {\n switch (Object.prototype.toString.call(functor)) {\n case '[object Function]':\n return curryN(functor.length, function () {\n return fn.call(this, functor.apply(this, arguments));\n });\n case '[object Object]':\n return _reduce(function (acc, key) {\n acc[key] = fn(functor[key]);\n return acc;\n }, {}, keys(functor));\n default:\n return _map(fn, functor);\n }\n }));\n\n /**\n * An Object-specific version of `map`. The function is applied to three\n * arguments: *(value, key, obj)*. If only the value is significant, use\n * `map` instead.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig ((*, String, Object) -> *) -> Object -> Object\n * @param {Function} fn\n * @param {Object} obj\n * @return {Object}\n * @see R.map\n * @example\n *\n * var values = { x: 1, y: 2, z: 3 };\n * var prependKeyAndDouble = (num, key, obj) => key + (num * 2);\n *\n * R.mapObjIndexed(prependKeyAndDouble, values); //=> { x: 'x2', y: 'y4', z: 'z6' }\n */\n var mapObjIndexed = _curry2(function mapObjIndexed(fn, obj) {\n return _reduce(function (acc, key) {\n acc[key] = fn(obj[key], key, obj);\n return acc;\n }, {}, keys(obj));\n });\n\n /**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the values\n * associated with the key in each object, with the result being used as the\n * value associated with the key in the returned object. The key will be\n * excluded from the returned object if the resulting value is `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig (a -> a -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.merge, R.mergeWithKey\n * @example\n *\n * R.mergeWith(R.concat,\n * { a: true, values: [10, 20] },\n * { b: true, values: [15, 35] });\n * //=> { a: true, b: true, values: [10, 20, 15, 35] }\n */\n var mergeWith = _curry3(function mergeWith(fn, l, r) {\n return mergeWithKey(function (_, _l, _r) {\n return fn(_l, _r);\n }, l, r);\n });\n\n /**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided initially followed by the arguments provided to `g`.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [a, b, c, ...] -> ((d, e, f, ..., n) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partialRight\n * @example\n *\n * var multiply = (a, b) => a * b;\n * var double = R.partial(multiply, [2]);\n * double(2); //=> 4\n *\n * var greet = (salutation, title, firstName, lastName) =>\n * salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n * var sayHello = R.partial(greet, ['Hello']);\n * var sayHelloToMs = R.partial(sayHello, ['Ms.']);\n * sayHelloToMs('Jane', 'Jones'); //=> 'Hello, Ms. Jane Jones!'\n */\n var partial = _createPartialApplicator(_concat);\n\n /**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided to `g` followed by the arguments provided initially.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [d, e, f, ..., n] -> ((a, b, c, ...) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partial\n * @example\n *\n * var greet = (salutation, title, firstName, lastName) =>\n * salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n * var greetMsJaneJones = R.partialRight(greet, ['Ms.', 'Jane', 'Jones']);\n *\n * greetMsJaneJones('Hello'); //=> 'Hello, Ms. Jane Jones!'\n */\n var partialRight = _createPartialApplicator(flip(_concat));\n\n /**\n * Determines whether a nested path on an object has a specific value, in\n * `R.equals` terms. Most likely used to filter a list.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Relation\n * @sig [String] -> * -> {String: *} -> Boolean\n * @param {Array} path The path of the nested property to use\n * @param {*} val The value to compare the nested property with\n * @param {Object} obj The object to check the nested property in\n * @return {Boolean} `true` if the value equals the nested object property,\n * `false` otherwise.\n * @example\n *\n * var user1 = { address: { zipCode: 90210 } };\n * var user2 = { address: { zipCode: 55555 } };\n * var user3 = { name: 'Bob' };\n * var users = [ user1, user2, user3 ];\n * var isFamous = R.pathEq(['address', 'zipCode'], 90210);\n * R.filter(isFamous, users); //=> [ user1 ]\n */\n var pathEq = _curry3(function pathEq(_path, val, obj) {\n return equals(path(_path, obj), val);\n });\n\n /**\n * Returns a new list by plucking the same named property off all objects in\n * the list supplied.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig k -> [{k: v}] -> [v]\n * @param {Number|String} key The key name to pluck off of each object.\n * @param {Array} list The array to consider.\n * @return {Array} The list of values for the given key.\n * @see R.props\n * @example\n *\n * R.pluck('a')([{a: 1}, {a: 2}]); //=> [1, 2]\n * R.pluck(0)([[1, 2], [3, 4]]); //=> [1, 3]\n */\n var pluck = _curry2(function pluck(p, list) {\n return map(prop(p), list);\n });\n\n /**\n * Reasonable analog to SQL `select` statement.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @category Relation\n * @sig [k] -> [{k: v}] -> [{k: v}]\n * @param {Array} props The property names to project\n * @param {Array} objs The objects to query\n * @return {Array} An array of objects with just the `props` properties.\n * @example\n *\n * var abby = {name: 'Abby', age: 7, hair: 'blond', grade: 2};\n * var fred = {name: 'Fred', age: 12, hair: 'brown', grade: 7};\n * var kids = [abby, fred];\n * R.project(['name', 'grade'], kids); //=> [{name: 'Abby', grade: 2}, {name: 'Fred', grade: 7}]\n */\n // passing `identity` gives correct arity\n var project = useWith(_map, [\n pickAll,\n identity\n ]);\n\n /**\n * Returns `true` if the specified object property is equal, in `R.equals`\n * terms, to the given value; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig String -> a -> Object -> Boolean\n * @param {String} name\n * @param {*} val\n * @param {*} obj\n * @return {Boolean}\n * @see R.equals, R.propSatisfies\n * @example\n *\n * var abby = {name: 'Abby', age: 7, hair: 'blond'};\n * var fred = {name: 'Fred', age: 12, hair: 'brown'};\n * var rusty = {name: 'Rusty', age: 10, hair: 'brown'};\n * var alois = {name: 'Alois', age: 15, disposition: 'surly'};\n * var kids = [abby, fred, rusty, alois];\n * var hasBrownHair = R.propEq('hair', 'brown');\n * R.filter(hasBrownHair, kids); //=> [fred, rusty]\n */\n var propEq = _curry3(function propEq(name, val, obj) {\n return propSatisfies(equals(val), name, obj);\n });\n\n /**\n * Returns `true` if the specified object property is of the given type;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Type\n * @sig Type -> String -> Object -> Boolean\n * @param {Function} type\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.is, R.propSatisfies\n * @example\n *\n * R.propIs(Number, 'x', {x: 1, y: 2}); //=> true\n * R.propIs(Number, 'x', {x: 'foo'}); //=> false\n * R.propIs(Number, 'x', {}); //=> false\n */\n var propIs = _curry3(function propIs(type, name, obj) {\n return propSatisfies(is(type), name, obj);\n });\n\n /**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It may use\n * `R.reduced` to shortcut the iteration.\n *\n * Note: `R.reduce` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce#Description\n *\n * Dispatches to the `reduce` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduced, R.addIndex\n * @example\n *\n * var numbers = [1, 2, 3];\n * var add = (a, b) => a + b;\n *\n * R.reduce(add, 10, numbers); //=> 16\n */\n var reduce = _curry3(_reduce);\n\n /**\n * Groups the elements of the list according to the result of calling\n * the String-returning function `keyFn` on each element and reduces the elements\n * of each group to a single value via the reducer function `valueFn`.\n *\n * This function is basically a more general `groupBy` function.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category List\n * @sig ((a, b) -> a) -> a -> (b -> String) -> [b] -> {String: a}\n * @param {Function} valueFn The function that reduces the elements of each group to a single\n * value. Receives two values, accumulator for a particular group and the current element.\n * @param {*} acc The (initial) accumulator value for each group.\n * @param {Function} keyFn The function that maps the list's element into a key.\n * @param {Array} list The array to group.\n * @return {Object} An object with the output of `keyFn` for keys, mapped to the output of\n * `valueFn` for elements which produced that key when passed to `keyFn`.\n * @see R.groupBy, R.reduce\n * @example\n *\n * var reduceToNamesBy = R.reduceBy((acc, student) => acc.concat(student.name), []);\n * var namesByGrade = reduceToNamesBy(function(student) {\n * var score = student.score;\n * return score < 65 ? 'F' :\n * score < 70 ? 'D' :\n * score < 80 ? 'C' :\n * score < 90 ? 'B' : 'A';\n * });\n * var students = [{name: 'Lucy', score: 92},\n * {name: 'Drew', score: 85},\n * // ...\n * {name: 'Bart', score: 62}];\n * namesByGrade(students);\n * // {\n * // 'A': ['Lucy'],\n * // 'B': ['Drew']\n * // // ...,\n * // 'F': ['Bart']\n * // }\n */\n var reduceBy = _curryN(4, [], function reduceBy(valueFn, valueAcc, keyFn, list) {\n return _reduce(function (acc, elt) {\n var key = keyFn(elt);\n acc[key] = valueFn(_has(key, acc) ? acc[key] : valueAcc, elt);\n return acc;\n }, {}, list);\n });\n\n /**\n * The complement of `filter`.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.filter, R.transduce, R.addIndex\n * @example\n *\n * var isOdd = (n) => n % 2 === 1;\n *\n * R.reject(isOdd, [1, 2, 3, 4]); //=> [2, 4]\n *\n * R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\n var reject = _curry2(function reject(pred, filterable) {\n return filter(_complement(pred), filterable);\n });\n\n /**\n * Returns a fixed list of size `n` containing a specified identical value.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig a -> n -> [a]\n * @param {*} value The value to repeat.\n * @param {Number} n The desired size of the output list.\n * @return {Array} A new array containing `n` `value`s.\n * @example\n *\n * R.repeat('hi', 5); //=> ['hi', 'hi', 'hi', 'hi', 'hi']\n *\n * var obj = {};\n * var repeatedObjs = R.repeat(obj, 5); //=> [{}, {}, {}, {}, {}]\n * repeatedObjs[0] === repeatedObjs[1]; //=> true\n */\n var repeat = _curry2(function repeat(value, n) {\n return times(always(value), n);\n });\n\n /**\n * Adds together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The sum of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n * R.sum([2,4,6,8,100,1]); //=> 121\n */\n var sum = reduce(add, 0);\n\n /**\n * Returns a new list containing the last `n` elements of the given list.\n * If `n > list.length`, returns a list of `list.length` elements.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements to return.\n * @param {Array} xs The collection to consider.\n * @return {Array}\n * @see R.dropLast\n * @example\n *\n * R.takeLast(1, ['foo', 'bar', 'baz']); //=> ['baz']\n * R.takeLast(2, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n * R.takeLast(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.takeLast(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.takeLast(3, 'ramda'); //=> 'mda'\n */\n var takeLast = _curry2(function takeLast(n, xs) {\n return drop(n >= 0 ? xs.length - n : 0, xs);\n });\n\n /**\n * Initializes a transducer using supplied iterator function. Returns a single\n * item by iterating through the list, successively calling the transformed\n * iterator function and passing it an accumulator value and the current value\n * from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It will be\n * wrapped as a transformer to initialize the transducer. A transformer can be\n * passed directly in place of an iterator function. In both cases, iteration\n * may be stopped early with the `R.reduced` function.\n *\n * A transducer is a function that accepts a transformer and returns a\n * transformer and can be composed directly.\n *\n * A transformer is an an object that provides a 2-arity reducing iterator\n * function, step, 0-arity initial value function, init, and 1-arity result\n * extraction function, result. The step function is used as the iterator\n * function in reduce. The result function is used to convert the final\n * accumulator into the return type and in most cases is R.identity. The init\n * function can be used to provide an initial accumulator, but is ignored by\n * transduce.\n *\n * The iteration is performed with R.reduce after initializing the transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (c -> c) -> (a,b -> a) -> a -> [b] -> a\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array. Wrapped as transformer, if necessary, and used to\n * initialize the transducer\n * @param {*} acc The initial accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.reduced, R.into\n * @example\n *\n * var numbers = [1, 2, 3, 4];\n * var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *\n * R.transduce(transducer, R.flip(R.append), [], numbers); //=> [2, 3]\n */\n var transduce = curryN(4, function transduce(xf, fn, acc, list) {\n return _reduce(xf(typeof fn === 'function' ? _xwrap(fn) : fn), acc, list);\n });\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list. Duplication is determined according to the value returned by\n * applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The first and second lists concatenated, with\n * duplicates removed.\n * @see R.union\n * @example\n *\n * var l1 = [{a: 1}, {a: 2}];\n * var l2 = [{a: 1}, {a: 4}];\n * R.unionWith(R.eqBy(R.prop('a')), l1, l2); //=> [{a: 1}, {a: 2}, {a: 4}]\n */\n var unionWith = _curry3(function unionWith(pred, list1, list2) {\n return uniqWith(pred, _concat(list1, list2));\n });\n\n /**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec, false otherwise. An object satisfies the spec if, for each of the\n * spec's own properties, accessing that property of the object gives the same\n * value (in `R.equals` terms) as accessing that property of the spec.\n *\n * `whereEq` is a specialization of [`where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @sig {String: *} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @see R.where\n * @example\n *\n * // pred :: Object -> Boolean\n * var pred = R.whereEq({a: 1, b: 2});\n *\n * pred({a: 1}); //=> false\n * pred({a: 1, b: 2}); //=> true\n * pred({a: 1, b: 2, c: 3}); //=> true\n * pred({a: 1, b: 1}); //=> false\n */\n var whereEq = _curry2(function whereEq(spec, testObj) {\n return where(map(equals, spec), testObj);\n });\n\n var _flatCat = function () {\n var preservingReduced = function (xf) {\n return {\n '@@transducer/init': _xfBase.init,\n '@@transducer/result': function (result) {\n return xf['@@transducer/result'](result);\n },\n '@@transducer/step': function (result, input) {\n var ret = xf['@@transducer/step'](result, input);\n return ret['@@transducer/reduced'] ? _forceReduced(ret) : ret;\n }\n };\n };\n return function _xcat(xf) {\n var rxf = preservingReduced(xf);\n return {\n '@@transducer/init': _xfBase.init,\n '@@transducer/result': function (result) {\n return rxf['@@transducer/result'](result);\n },\n '@@transducer/step': function (result, input) {\n return !isArrayLike(input) ? _reduce(rxf, result, [input]) : _reduce(rxf, result, input);\n }\n };\n };\n }();\n\n // Array.prototype.indexOf doesn't exist below IE9\n // manually crawl the list to distinguish between +0 and -0\n // NaN\n // non-zero numbers can utilise Set\n // all these types can utilise Set\n // null can utilise Set\n // anything else not covered above, defer to R.equals\n var _indexOf = function _indexOf(list, a, idx) {\n var inf, item;\n // Array.prototype.indexOf doesn't exist below IE9\n if (typeof list.indexOf === 'function') {\n switch (typeof a) {\n case 'number':\n if (a === 0) {\n // manually crawl the list to distinguish between +0 and -0\n inf = 1 / a;\n while (idx < list.length) {\n item = list[idx];\n if (item === 0 && 1 / item === inf) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n } else if (a !== a) {\n // NaN\n while (idx < list.length) {\n item = list[idx];\n if (typeof item === 'number' && item !== item) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n }\n // non-zero numbers can utilise Set\n return list.indexOf(a, idx);\n // all these types can utilise Set\n case 'string':\n case 'boolean':\n case 'function':\n case 'undefined':\n return list.indexOf(a, idx);\n case 'object':\n if (a === null) {\n // null can utilise Set\n return list.indexOf(a, idx);\n }\n }\n }\n // anything else not covered above, defer to R.equals\n while (idx < list.length) {\n if (equals(list[idx], a)) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n };\n\n var _xchain = _curry2(function _xchain(f, xf) {\n return map(f, _flatCat(xf));\n });\n\n /**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if every one of the provided predicates is satisfied\n * by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} preds\n * @return {Function}\n * @see R.anyPass\n * @example\n *\n * var isQueen = R.propEq('rank', 'Q');\n * var isSpade = R.propEq('suit', '♠︎');\n * var isQueenOfSpades = R.allPass([isQueen, isSpade]);\n *\n * isQueenOfSpades({rank: 'Q', suit: '♣︎'}); //=> false\n * isQueenOfSpades({rank: 'Q', suit: '♠︎'}); //=> true\n */\n var allPass = _curry1(function allPass(preds) {\n return curryN(reduce(max, 0, pluck('length', preds)), function () {\n var idx = 0;\n var len = preds.length;\n while (idx < len) {\n if (!preds[idx].apply(this, arguments)) {\n return false;\n }\n idx += 1;\n }\n return true;\n });\n });\n\n /**\n * Returns `true` if all elements are unique, in `R.equals` terms, otherwise\n * `false`.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category List\n * @sig [a] -> Boolean\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if all elements are unique, else `false`.\n * @deprecated since v0.20.0\n * @example\n *\n * R.allUniq(['1', 1]); //=> true\n * R.allUniq([1, 1]); //=> false\n * R.allUniq([[42], [42]]); //=> false\n */\n var allUniq = _curry1(function allUniq(list) {\n var len = list.length;\n var idx = 0;\n while (idx < len) {\n if (_indexOf(list, list[idx], idx + 1) >= 0) {\n return false;\n }\n idx += 1;\n }\n return true;\n });\n\n /**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if at least one of the provided predicates is\n * satisfied by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} preds\n * @return {Function}\n * @see R.allPass\n * @example\n *\n * var gte = R.anyPass([R.gt, R.equals]);\n *\n * gte(3, 2); //=> true\n * gte(2, 2); //=> true\n * gte(2, 3); //=> false\n */\n var anyPass = _curry1(function anyPass(preds) {\n return curryN(reduce(max, 0, pluck('length', preds)), function () {\n var idx = 0;\n var len = preds.length;\n while (idx < len) {\n if (preds[idx].apply(this, arguments)) {\n return true;\n }\n idx += 1;\n }\n return false;\n });\n });\n\n /**\n * ap applies a list of functions to a list of values.\n *\n * Dispatches to the `ap` method of the second argument, if present. Also\n * treats functions as applicatives.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig [f] -> [a] -> [f a]\n * @param {Array} fns An array of functions\n * @param {Array} vs An array of values\n * @return {Array} An array of results of applying each of `fns` to all of `vs` in turn.\n * @example\n *\n * R.ap([R.multiply(2), R.add(3)], [1,2,3]); //=> [2, 4, 6, 4, 5, 6]\n */\n // else\n var ap = _curry2(function ap(applicative, fn) {\n return typeof applicative.ap === 'function' ? applicative.ap(fn) : typeof applicative === 'function' ? curryN(Math.max(applicative.length, fn.length), function () {\n return applicative.apply(this, arguments)(fn.apply(this, arguments));\n }) : // else\n _reduce(function (acc, f) {\n return _concat(acc, map(f, fn));\n }, [], applicative);\n });\n\n /**\n * Given a spec object recursively mapping properties to functions, creates a\n * function producing an object of the same structure, by mapping each property\n * to the result of calling its associated function with the supplied arguments.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig {k: ((a, b, ..., m) -> v)} -> ((a, b, ..., m) -> {k: v})\n * @param {Object} spec an object recursively mapping properties to functions for\n * producing the values for these properties.\n * @return {Function} A function that returns an object of the same structure\n * as `spec', with each property set to the value returned by calling its\n * associated function with the supplied arguments.\n * @see R.juxt\n * @example\n *\n * var getMetrics = R.applySpec({\n * sum: R.add,\n * nested: { mul: R.multiply }\n * });\n * getMetrics(2, 4); // => { sum: 6, nested: { mul: 8 } }\n */\n var applySpec = _curry1(function applySpec(spec) {\n spec = map(function (v) {\n return typeof v == 'function' ? v : applySpec(v);\n }, spec);\n return curryN(reduce(max, 0, pluck('length', values(spec))), function () {\n var args = arguments;\n return map(function (f) {\n return apply(f, args);\n }, spec);\n });\n });\n\n /**\n * Returns the result of calling its first argument with the remaining\n * arguments. This is occasionally useful as a converging function for\n * `R.converge`: the left branch can produce a function while the right branch\n * produces a value to be passed to that function as an argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig (*... -> a),*... -> a\n * @param {Function} fn The function to apply to the remaining arguments.\n * @param {...*} args Any number of positional arguments.\n * @return {*}\n * @see R.apply\n * @example\n *\n * var indentN = R.pipe(R.times(R.always(' ')),\n * R.join(''),\n * R.replace(/^(?!$)/gm));\n *\n * var format = R.converge(R.call, [\n * R.pipe(R.prop('indent'), indentN),\n * R.prop('value')\n * ]);\n *\n * format({indent: 2, value: 'foo\\nbar\\nbaz\\n'}); //=> ' foo\\n bar\\n baz\\n'\n */\n var call = curry(function call(fn) {\n return fn.apply(this, _slice(arguments, 1));\n });\n\n /**\n * `chain` maps a function over a list and concatenates the results. `chain`\n * is also known as `flatMap` in some libraries\n *\n * Dispatches to the `chain` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig (a -> [b]) -> [a] -> [b]\n * @param {Function} fn\n * @param {Array} list\n * @return {Array}\n * @example\n *\n * var duplicate = n => [n, n];\n * R.chain(duplicate, [1, 2, 3]); //=> [1, 1, 2, 2, 3, 3]\n */\n var chain = _curry2(_dispatchable('chain', _xchain, function chain(fn, monad) {\n if (typeof monad === 'function') {\n return function () {\n return monad.call(this, fn.apply(this, arguments)).apply(this, arguments);\n };\n }\n return _makeFlat(false)(map(fn, monad));\n }));\n\n /**\n * Returns a function, `fn`, which encapsulates if/else-if/else logic.\n * `R.cond` takes a list of [predicate, transform] pairs. All of the arguments\n * to `fn` are applied to each of the predicates in turn until one returns a\n * \"truthy\" value, at which point `fn` returns the result of applying its\n * arguments to the corresponding transformer. If none of the predicates\n * matches, `fn` returns undefined.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Logic\n * @sig [[(*... -> Boolean),(*... -> *)]] -> (*... -> *)\n * @param {Array} pairs\n * @return {Function}\n * @example\n *\n * var fn = R.cond([\n * [R.equals(0), R.always('water freezes at 0°C')],\n * [R.equals(100), R.always('water boils at 100°C')],\n * [R.T, temp => 'nothing special happens at ' + temp + '°C']\n * ]);\n * fn(0); //=> 'water freezes at 0°C'\n * fn(50); //=> 'nothing special happens at 50°C'\n * fn(100); //=> 'water boils at 100°C'\n */\n var cond = _curry1(function cond(pairs) {\n var arity = reduce(max, 0, map(function (pair) {\n return pair[0].length;\n }, pairs));\n return _arity(arity, function () {\n var idx = 0;\n while (idx < pairs.length) {\n if (pairs[idx][0].apply(this, arguments)) {\n return pairs[idx][1].apply(this, arguments);\n }\n idx += 1;\n }\n });\n });\n\n /**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type. The arity of the function\n * returned is specified to allow using variadic constructor functions.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Function\n * @sig Number -> (* -> {*}) -> (* -> {*})\n * @param {Number} n The arity of the constructor function.\n * @param {Function} Fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @example\n *\n * // Variadic constructor function\n * var Widget = () => {\n * this.children = Array.prototype.slice.call(arguments);\n * // ...\n * };\n * Widget.prototype = {\n * // ...\n * };\n * var allConfigs = [\n * // ...\n * ];\n * R.map(R.constructN(1, Widget), allConfigs); // a list of Widgets\n */\n var constructN = _curry2(function constructN(n, Fn) {\n if (n > 10) {\n throw new Error('Constructor with greater than ten arguments');\n }\n if (n === 0) {\n return function () {\n return new Fn();\n };\n }\n return curry(nAry(n, function ($0, $1, $2, $3, $4, $5, $6, $7, $8, $9) {\n switch (arguments.length) {\n case 1:\n return new Fn($0);\n case 2:\n return new Fn($0, $1);\n case 3:\n return new Fn($0, $1, $2);\n case 4:\n return new Fn($0, $1, $2, $3);\n case 5:\n return new Fn($0, $1, $2, $3, $4);\n case 6:\n return new Fn($0, $1, $2, $3, $4, $5);\n case 7:\n return new Fn($0, $1, $2, $3, $4, $5, $6);\n case 8:\n return new Fn($0, $1, $2, $3, $4, $5, $6, $7);\n case 9:\n return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8);\n case 10:\n return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8, $9);\n }\n }));\n });\n\n /**\n * Accepts a converging function and a list of branching functions and returns\n * a new function. When invoked, this new function is applied to some\n * arguments, each branching function is applied to those same arguments. The\n * results of each branching function are passed as arguments to the converging\n * function to produce the return value.\n *\n * @func\n * @memberOf R\n * @since v0.4.2\n * @category Function\n * @sig (x1 -> x2 -> ... -> z) -> [(a -> b -> ... -> x1), (a -> b -> ... -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} after A function. `after` will be invoked with the return values of\n * `fn1` and `fn2` as its arguments.\n * @param {Array} functions A list of functions.\n * @return {Function} A new function.\n * @example\n *\n * var add = (a, b) => a + b;\n * var multiply = (a, b) => a * b;\n * var subtract = (a, b) => a - b;\n *\n * //≅ multiply( add(1, 2), subtract(1, 2) );\n * R.converge(multiply, [add, subtract])(1, 2); //=> -3\n *\n * var add3 = (a, b, c) => a + b + c;\n * R.converge(add3, [multiply, add, subtract])(1, 2); //=> 4\n */\n var converge = _curry2(function converge(after, fns) {\n return curryN(reduce(max, 0, pluck('length', fns)), function () {\n var args = arguments;\n var context = this;\n return after.apply(context, _map(function (fn) {\n return fn.apply(context, args);\n }, fns));\n });\n });\n\n /**\n * Counts the elements of a list according to how many match each value of a\n * key generated by the supplied function. Returns an object mapping the keys\n * produced by `fn` to the number of occurrences in the list. Note that all\n * keys are coerced to strings because of how JavaScript objects work.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> String) -> [a] -> {*}\n * @param {Function} fn The function used to map values to keys.\n * @param {Array} list The list to count elements from.\n * @return {Object} An object mapping keys to number of occurrences in the list.\n * @example\n *\n * var numbers = [1.0, 1.1, 1.2, 2.0, 3.0, 2.2];\n * var letters = R.split('', 'abcABCaaaBBc');\n * R.countBy(Math.floor)(numbers); //=> {'1': 3, '2': 2, '3': 1}\n * R.countBy(R.toLower)(letters); //=> {'a': 5, 'b': 4, 'c': 3}\n */\n var countBy = reduceBy(function (acc, elem) {\n return acc + 1;\n }, 0);\n\n /**\n * Returns a new list without any consecutively repeating elements. Equality is\n * determined by applying the supplied predicate two consecutive elements. The\n * first element in a series of equal element is the one being preserved.\n *\n * Dispatches to the `dropRepeatsWith` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig (a, a -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n * var l = [1, -1, 1, 3, 4, -4, -4, -5, 5, 3, 3];\n * R.dropRepeatsWith(R.eqBy(Math.abs), l); //=> [1, 3, 4, -5, 3]\n */\n var dropRepeatsWith = _curry2(_dispatchable('dropRepeatsWith', _xdropRepeatsWith, function dropRepeatsWith(pred, list) {\n var result = [];\n var idx = 1;\n var len = list.length;\n if (len !== 0) {\n result[0] = list[0];\n while (idx < len) {\n if (!pred(last(result), list[idx])) {\n result[result.length] = list[idx];\n }\n idx += 1;\n }\n }\n return result;\n }));\n\n /**\n * Takes a function and two values in its domain and returns `true` if the\n * values map to the same value in the codomain; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Relation\n * @sig (a -> b) -> a -> a -> Boolean\n * @param {Function} f\n * @param {*} x\n * @param {*} y\n * @return {Boolean}\n * @example\n *\n * R.eqBy(Math.abs, 5, -5); //=> true\n */\n var eqBy = _curry3(function eqBy(f, x, y) {\n return equals(f(x), f(y));\n });\n\n /**\n * Reports whether two objects have the same value, in `R.equals` terms, for\n * the specified property. Useful as a curried predicate.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig k -> {k: v} -> {k: v} -> Boolean\n * @param {String} prop The name of the property to compare\n * @param {Object} obj1\n * @param {Object} obj2\n * @return {Boolean}\n *\n * @example\n *\n * var o1 = { a: 1, b: 2, c: 3, d: 4 };\n * var o2 = { a: 10, b: 20, c: 3, d: 40 };\n * R.eqProps('a', o1, o2); //=> false\n * R.eqProps('c', o1, o2); //=> true\n */\n var eqProps = _curry3(function eqProps(prop, obj1, obj2) {\n return equals(obj1[prop], obj2[prop]);\n });\n\n /**\n * Splits a list into sub-lists stored in an object, based on the result of\n * calling a String-returning function on each element, and grouping the\n * results according to values returned.\n *\n * Dispatches to the `groupBy` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> String) -> [a] -> {String: [a]}\n * @param {Function} fn Function :: a -> String\n * @param {Array} list The array to group\n * @return {Object} An object with the output of `fn` for keys, mapped to arrays of elements\n * that produced that key when passed to `fn`.\n * @see R.transduce\n * @example\n *\n * var byGrade = R.groupBy(function(student) {\n * var score = student.score;\n * return score < 65 ? 'F' :\n * score < 70 ? 'D' :\n * score < 80 ? 'C' :\n * score < 90 ? 'B' : 'A';\n * });\n * var students = [{name: 'Abby', score: 84},\n * {name: 'Eddy', score: 58},\n * // ...\n * {name: 'Jack', score: 69}];\n * byGrade(students);\n * // {\n * // 'A': [{name: 'Dianne', score: 99}],\n * // 'B': [{name: 'Abby', score: 84}]\n * // // ...,\n * // 'F': [{name: 'Eddy', score: 58}]\n * // }\n */\n var groupBy = _curry2(_dispatchable('groupBy', _xgroupBy, reduceBy(function (acc, item) {\n if (acc == null) {\n acc = [];\n }\n acc.push(item);\n return acc;\n }, null)));\n\n /**\n * Given a function that generates a key, turns a list of objects into an\n * object indexing the objects by the given key. Note that if multiple\n * objects generate the same value for the indexing key only the last value\n * will be included in the generated object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> String) -> [{k: v}] -> {k: {k: v}}\n * @param {Function} fn Function :: a -> String\n * @param {Array} array The array of objects to index\n * @return {Object} An object indexing each array element by the given property.\n * @example\n *\n * var list = [{id: 'xyz', title: 'A'}, {id: 'abc', title: 'B'}];\n * R.indexBy(R.prop('id'), list);\n * //=> {abc: {id: 'abc', title: 'B'}, xyz: {id: 'xyz', title: 'A'}}\n */\n var indexBy = reduceBy(function (acc, elem) {\n return elem;\n }, null);\n\n /**\n * Returns the position of the first occurrence of an item in an array, or -1\n * if the item is not included in the array. `R.equals` is used to determine\n * equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.lastIndexOf\n * @example\n *\n * R.indexOf(3, [1,2,3,4]); //=> 2\n * R.indexOf(10, [1,2,3,4]); //=> -1\n */\n var indexOf = _curry2(function indexOf(target, xs) {\n return typeof xs.indexOf === 'function' && !_isArray(xs) ? xs.indexOf(target) : _indexOf(xs, target, 0);\n });\n\n /**\n * juxt applies a list of functions to a list of values.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Function\n * @sig [(a, b, ..., m) -> n] -> ((a, b, ..., m) -> [n])\n * @param {Array} fns An array of functions\n * @return {Function} A function that returns a list of values after applying each of the original `fns` to its parameters.\n * @see R.applySpec\n * @example\n *\n * var range = R.juxt([Math.min, Math.max]);\n * range(3, 4, 9, -3); //=> [-3, 9]\n */\n var juxt = _curry1(function juxt(fns) {\n return converge(_arrayOf, fns);\n });\n\n /**\n * Returns a lens for the given getter and setter functions. The getter \"gets\"\n * the value of the focus; the setter \"sets\" the value of the focus. The setter\n * should not mutate the data structure.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig (s -> a) -> ((a, s) -> s) -> Lens s a\n * @param {Function} getter\n * @param {Function} setter\n * @return {Lens}\n * @see R.view, R.set, R.over, R.lensIndex, R.lensProp\n * @example\n *\n * var xLens = R.lens(R.prop('x'), R.assoc('x'));\n *\n * R.view(xLens, {x: 1, y: 2}); //=> 1\n * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}\n * R.over(xLens, R.negate, {x: 1, y: 2}); //=> {x: -1, y: 2}\n */\n var lens = _curry2(function lens(getter, setter) {\n return function (toFunctorFn) {\n return function (target) {\n return map(function (focus) {\n return setter(focus, target);\n }, toFunctorFn(getter(target)));\n };\n };\n });\n\n /**\n * Returns a lens whose focus is the specified index.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Number -> Lens s a\n * @param {Number} n\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n * var headLens = R.lensIndex(0);\n *\n * R.view(headLens, ['a', 'b', 'c']); //=> 'a'\n * R.set(headLens, 'x', ['a', 'b', 'c']); //=> ['x', 'b', 'c']\n * R.over(headLens, R.toUpper, ['a', 'b', 'c']); //=> ['A', 'b', 'c']\n */\n var lensIndex = _curry1(function lensIndex(n) {\n return lens(nth(n), update(n));\n });\n\n /**\n * Returns a lens whose focus is the specified path.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig [String] -> Lens s a\n * @param {Array} path The path to use.\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n * var xyLens = R.lensPath(['x', 'y']);\n *\n * R.view(xyLens, {x: {y: 2, z: 3}}); //=> 2\n * R.set(xyLens, 4, {x: {y: 2, z: 3}}); //=> {x: {y: 4, z: 3}}\n * R.over(xyLens, R.negate, {x: {y: 2, z: 3}}); //=> {x: {y: -2, z: 3}}\n */\n var lensPath = _curry1(function lensPath(p) {\n return lens(path(p), assocPath(p));\n });\n\n /**\n * Returns a lens whose focus is the specified property.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig String -> Lens s a\n * @param {String} k\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n * var xLens = R.lensProp('x');\n *\n * R.view(xLens, {x: 1, y: 2}); //=> 1\n * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}\n * R.over(xLens, R.negate, {x: 1, y: 2}); //=> {x: -1, y: 2}\n */\n var lensProp = _curry1(function lensProp(k) {\n return lens(prop(k), assoc(k));\n });\n\n /**\n * \"lifts\" a function to be the specified arity, so that it may \"map over\" that\n * many lists, Functions or other objects that satisfy the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig Number -> (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.lift, R.ap\n * @example\n *\n * var madd3 = R.liftN(3, R.curryN(3, (...args) => R.sum(args)));\n * madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n */\n var liftN = _curry2(function liftN(arity, fn) {\n var lifted = curryN(arity, fn);\n return curryN(arity, function () {\n return _reduce(ap, map(lifted, arguments[0]), _slice(arguments, 1));\n });\n });\n\n /**\n * Returns the mean of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @example\n *\n * R.mean([2, 7, 9]); //=> 6\n * R.mean([]); //=> NaN\n */\n var mean = _curry1(function mean(list) {\n return sum(list) / list.length;\n });\n\n /**\n * Returns the median of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @example\n *\n * R.median([2, 9, 7]); //=> 7\n * R.median([7, 2, 10, 9]); //=> 8\n * R.median([]); //=> NaN\n */\n var median = _curry1(function median(list) {\n var len = list.length;\n if (len === 0) {\n return NaN;\n }\n var width = 2 - len % 2;\n var idx = (len - width) / 2;\n return mean(_slice(list).sort(function (a, b) {\n return a < b ? -1 : a > b ? 1 : 0;\n }).slice(idx, idx + width));\n });\n\n /**\n * Takes a predicate and a list or other \"filterable\" object and returns the\n * pair of filterable objects of the same type of elements which do and do not\n * satisfy, the predicate, respectively.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> [f a, f a]\n * @param {Function} pred A predicate to determine which side the element belongs to.\n * @param {Array} filterable the list (or other filterable) to partition.\n * @return {Array} An array, containing first the subset of elements that satisfy the\n * predicate, and second the subset of elements that do not satisfy.\n * @see R.filter, R.reject\n * @example\n *\n * R.partition(R.contains('s'), ['sss', 'ttt', 'foo', 'bars']);\n * // => [ [ 'sss', 'bars' ], [ 'ttt', 'foo' ] ]\n *\n * R.partition(R.contains('s'), { a: 'sss', b: 'ttt', foo: 'bars' });\n * // => [ { a: 'sss', foo: 'bars' }, { b: 'ttt' } ]\n */\n var partition = juxt([\n filter,\n reject\n ]);\n\n /**\n * Performs left-to-right function composition. The leftmost function may have\n * any arity; the remaining functions must be unary.\n *\n * In some libraries this function is named `sequence`.\n *\n * **Note:** The result of pipe is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (((a, b, ..., n) -> o), (o -> p), ..., (x -> y), (y -> z)) -> ((a, b, ..., n) -> z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.compose\n * @example\n *\n * var f = R.pipe(Math.pow, R.negate, R.inc);\n *\n * f(3, 4); // -(3^4) + 1\n */\n var pipe = function pipe() {\n if (arguments.length === 0) {\n throw new Error('pipe requires at least one argument');\n }\n return _arity(arguments[0].length, reduce(_pipe, arguments[0], tail(arguments)));\n };\n\n /**\n * Performs left-to-right composition of one or more Promise-returning\n * functions. The leftmost function may have any arity; the remaining functions\n * must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a -> Promise b), (b -> Promise c), ..., (y -> Promise z)) -> (a -> Promise z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.composeP\n * @example\n *\n * // followersForUser :: String -> Promise [User]\n * var followersForUser = R.pipeP(db.getUserById, db.getFollowers);\n */\n var pipeP = function pipeP() {\n if (arguments.length === 0) {\n throw new Error('pipeP requires at least one argument');\n }\n return _arity(arguments[0].length, reduce(_pipeP, arguments[0], tail(arguments)));\n };\n\n /**\n * Multiplies together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The product of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n * R.product([2,4,6,8,100,1]); //=> 38400\n */\n var product = reduce(multiply, 1);\n\n /**\n * Transforms a [Traversable](https://github.com/fantasyland/fantasy-land#traversable)\n * of [Applicative](https://github.com/fantasyland/fantasy-land#applicative) into an\n * Applicative of Traversable.\n *\n * Dispatches to the `sequence` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> t (f a) -> f (t a)\n * @param {Function} of\n * @param {*} traversable\n * @return {*}\n * @see R.traverse\n * @example\n *\n * R.sequence(Maybe.of, [Just(1), Just(2), Just(3)]); //=> Just([1, 2, 3])\n * R.sequence(Maybe.of, [Just(1), Just(2), Nothing()]); //=> Nothing()\n *\n * R.sequence(R.of, Just([1, 2, 3])); //=> [Just(1), Just(2), Just(3)]\n * R.sequence(R.of, Nothing()); //=> [Nothing()]\n */\n var sequence = _curry2(function sequence(of, traversable) {\n return typeof traversable.sequence === 'function' ? traversable.sequence(of) : reduceRight(function (acc, x) {\n return ap(map(prepend, x), acc);\n }, of([]), traversable);\n });\n\n /**\n * Maps an [Applicative](https://github.com/fantasyland/fantasy-land#applicative)-returning\n * function over a [Traversable](https://github.com/fantasyland/fantasy-land#traversable),\n * then uses [`sequence`](#sequence) to transform the resulting Traversable of Applicative\n * into an Applicative of Traversable.\n *\n * Dispatches to the `sequence` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> (a -> f b) -> t a -> f (t b)\n * @param {Function} of\n * @param {Function} f\n * @param {*} traversable\n * @return {*}\n * @see R.sequence\n * @example\n *\n * // Returns `Nothing` if the given divisor is `0`\n * safeDiv = n => d => d === 0 ? Nothing() : Just(n / d)\n *\n * R.traverse(Maybe.of, safeDiv(10), [2, 4, 5]); //=> Just([5, 2.5, 2])\n * R.traverse(Maybe.of, safeDiv(10), [2, 0, 5]); //=> Nothing\n */\n var traverse = _curry3(function traverse(of, f, traversable) {\n return sequence(of, map(f, traversable));\n });\n\n /**\n * Shorthand for `R.chain(R.identity)`, which removes one level of nesting from\n * any [Chain](https://github.com/fantasyland/fantasy-land#chain).\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig Chain c => c (c a) -> c a\n * @param {*} list\n * @return {*}\n * @see R.flatten, R.chain\n * @example\n *\n * R.unnest([1, [2], [[3]]]); //=> [1, 2, [3]]\n * R.unnest([[1, 2], [3, 4], [5, 6]]); //=> [1, 2, 3, 4, 5, 6]\n */\n var unnest = chain(_identity);\n\n var _contains = function _contains(a, list) {\n return _indexOf(list, a, 0) >= 0;\n };\n\n // mapPairs :: (Object, [String]) -> [String]\n var _toString = function _toString(x, seen) {\n var recur = function recur(y) {\n var xs = seen.concat([x]);\n return _contains(y, xs) ? '' : _toString(y, xs);\n };\n // mapPairs :: (Object, [String]) -> [String]\n var mapPairs = function (obj, keys) {\n return _map(function (k) {\n return _quote(k) + ': ' + recur(obj[k]);\n }, keys.slice().sort());\n };\n switch (Object.prototype.toString.call(x)) {\n case '[object Arguments]':\n return '(function() { return arguments; }(' + _map(recur, x).join(', ') + '))';\n case '[object Array]':\n return '[' + _map(recur, x).concat(mapPairs(x, reject(function (k) {\n return /^\\d+$/.test(k);\n }, keys(x)))).join(', ') + ']';\n case '[object Boolean]':\n return typeof x === 'object' ? 'new Boolean(' + recur(x.valueOf()) + ')' : x.toString();\n case '[object Date]':\n return 'new Date(' + (isNaN(x.valueOf()) ? recur(NaN) : _quote(_toISOString(x))) + ')';\n case '[object Null]':\n return 'null';\n case '[object Number]':\n return typeof x === 'object' ? 'new Number(' + recur(x.valueOf()) + ')' : 1 / x === -Infinity ? '-0' : x.toString(10);\n case '[object String]':\n return typeof x === 'object' ? 'new String(' + recur(x.valueOf()) + ')' : _quote(x);\n case '[object Undefined]':\n return 'undefined';\n default:\n if (typeof x.toString === 'function') {\n var repr = x.toString();\n if (repr !== '[object Object]') {\n return repr;\n }\n }\n return '{' + mapPairs(x, keys(x)).join(', ') + '}';\n }\n };\n\n /**\n * Performs right-to-left function composition. The rightmost function may have\n * any arity; the remaining functions must be unary.\n *\n * **Note:** The result of compose is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((y -> z), (x -> y), ..., (o -> p), ((a, b, ..., n) -> o)) -> ((a, b, ..., n) -> z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.pipe\n * @example\n *\n * var f = R.compose(R.inc, R.negate, Math.pow);\n *\n * f(3, 4); // -(3^4) + 1\n */\n var compose = function compose() {\n if (arguments.length === 0) {\n throw new Error('compose requires at least one argument');\n }\n return pipe.apply(this, reverse(arguments));\n };\n\n /**\n * Returns the right-to-left Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.composeK(h, g, f)` is equivalent to `R.compose(R.chain(h), R.chain(g), R.chain(f))`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((y -> m z), (x -> m y), ..., (a -> m b)) -> (m a -> m z)\n * @param {...Function}\n * @return {Function}\n * @see R.pipeK\n * @example\n *\n * // parseJson :: String -> Maybe *\n * // get :: String -> Object -> Maybe *\n *\n * // getStateCode :: Maybe String -> Maybe String\n * var getStateCode = R.composeK(\n * R.compose(Maybe.of, R.toUpper),\n * get('state'),\n * get('address'),\n * get('user'),\n * parseJson\n * );\n *\n * getStateCode(Maybe.of('{\"user\":{\"address\":{\"state\":\"ny\"}}}'));\n * //=> Just('NY')\n * getStateCode(Maybe.of('[Invalid JSON]'));\n * //=> Nothing()\n */\n var composeK = function composeK() {\n return compose.apply(this, prepend(identity, map(chain, arguments)));\n };\n\n /**\n * Performs right-to-left composition of one or more Promise-returning\n * functions. The rightmost function may have any arity; the remaining\n * functions must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((y -> Promise z), (x -> Promise y), ..., (a -> Promise b)) -> (a -> Promise z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.pipeP\n * @example\n *\n * // followersForUser :: String -> Promise [User]\n * var followersForUser = R.composeP(db.getFollowers, db.getUserById);\n */\n var composeP = function composeP() {\n if (arguments.length === 0) {\n throw new Error('composeP requires at least one argument');\n }\n return pipeP.apply(this, reverse(arguments));\n };\n\n /**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> {*}) -> (* -> {*})\n * @param {Function} Fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @example\n *\n * // Constructor function\n * var Widget = config => {\n * // ...\n * };\n * Widget.prototype = {\n * // ...\n * };\n * var allConfigs = [\n * // ...\n * ];\n * R.map(R.construct(Widget), allConfigs); // a list of Widgets\n */\n var construct = _curry1(function construct(Fn) {\n return constructN(Fn.length, Fn);\n });\n\n /**\n * Returns `true` if the specified value is equal, in `R.equals` terms, to at\n * least one element of the given list; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Boolean\n * @param {Object} a The item to compare against.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the item is in the list, `false` otherwise.\n * @see R.any\n * @example\n *\n * R.contains(3, [1, 2, 3]); //=> true\n * R.contains(4, [1, 2, 3]); //=> false\n * R.contains([42], [[42]]); //=> true\n */\n var contains = _curry2(_contains);\n\n /**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.differenceWith\n * @example\n *\n * R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]\n * R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]\n */\n var difference = _curry2(function difference(first, second) {\n var out = [];\n var idx = 0;\n var firstLen = first.length;\n while (idx < firstLen) {\n if (!_contains(first[idx], second) && !_contains(first[idx], out)) {\n out[out.length] = first[idx];\n }\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a new list without any consecutively repeating elements. `R.equals`\n * is used to determine equality.\n *\n * Dispatches to the `dropRepeats` method of the first argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n * R.dropRepeats([1, 1, 1, 2, 3, 4, 4, 2, 2]); //=> [1, 2, 3, 4, 2]\n */\n var dropRepeats = _curry1(_dispatchable('dropRepeats', _xdropRepeatsWith(equals), dropRepeatsWith(equals)));\n\n /**\n * \"lifts\" a function of arity > 1 so that it may \"map over\" a list, Function or other\n * object that satisfies the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.liftN\n * @example\n *\n * var madd3 = R.lift(R.curry((a, b, c) => a + b + c));\n *\n * madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n *\n * var madd5 = R.lift(R.curry((a, b, c, d, e) => a + b + c + d + e));\n *\n * madd5([1,2], [3], [4, 5], [6], [7, 8]); //=> [21, 22, 22, 23, 22, 23, 23, 24]\n */\n var lift = _curry1(function lift(fn) {\n return liftN(fn.length, fn);\n });\n\n /**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [String] -> {String: *} -> {String: *}\n * @param {Array} names an array of String property names to omit from the new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with properties from `names` not on it.\n * @see R.pick\n * @example\n *\n * R.omit(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, c: 3}\n */\n var omit = _curry2(function omit(names, obj) {\n var result = {};\n for (var prop in obj) {\n if (!_contains(prop, names)) {\n result[prop] = obj[prop];\n }\n }\n return result;\n });\n\n /**\n * Returns the left-to-right Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.pipeK(f, g, h)` is equivalent to `R.pipe(R.chain(f), R.chain(g), R.chain(h))`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((a -> m b), (b -> m c), ..., (y -> m z)) -> (m a -> m z)\n * @param {...Function}\n * @return {Function}\n * @see R.composeK\n * @example\n *\n * // parseJson :: String -> Maybe *\n * // get :: String -> Object -> Maybe *\n *\n * // getStateCode :: Maybe String -> Maybe String\n * var getStateCode = R.pipeK(\n * parseJson,\n * get('user'),\n * get('address'),\n * get('state'),\n * R.compose(Maybe.of, R.toUpper)\n * );\n *\n * getStateCode(Maybe.of('{\"user\":{\"address\":{\"state\":\"ny\"}}}'));\n * //=> Just('NY')\n * getStateCode(Maybe.of('[Invalid JSON]'));\n * //=> Nothing()\n */\n var pipeK = function pipeK() {\n return composeK.apply(this, reverse(arguments));\n };\n\n /**\n * Returns the string representation of the given value. `eval`'ing the output\n * should result in a value equivalent to the input value. Many of the built-in\n * `toString` methods do not satisfy this requirement.\n *\n * If the given value is an `[object Object]` with a `toString` method other\n * than `Object.prototype.toString`, this method is invoked with no arguments\n * to produce the return value. This means user-defined constructor functions\n * can provide a suitable `toString` method. For example:\n *\n * function Point(x, y) {\n * this.x = x;\n * this.y = y;\n * }\n *\n * Point.prototype.toString = function() {\n * return 'new Point(' + this.x + ', ' + this.y + ')';\n * };\n *\n * R.toString(new Point(1, 2)); //=> 'new Point(1, 2)'\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category String\n * @sig * -> String\n * @param {*} val\n * @return {String}\n * @example\n *\n * R.toString(42); //=> '42'\n * R.toString('abc'); //=> '\"abc\"'\n * R.toString([1, 2, 3]); //=> '[1, 2, 3]'\n * R.toString({foo: 1, bar: 2, baz: 3}); //=> '{\"bar\": 2, \"baz\": 3, \"foo\": 1}'\n * R.toString(new Date('2001-02-03T04:05:06Z')); //=> 'new Date(\"2001-02-03T04:05:06.000Z\")'\n */\n var toString = _curry1(function toString(val) {\n return _toString(val, []);\n });\n\n /**\n * Returns a new list without values in the first argument.\n * `R.equals` is used to determine equality.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @param {Array} list1 The values to be removed from `list2`.\n * @param {Array} list2 The array to remove values from.\n * @return {Array} The new array without values in `list1`.\n * @see R.transduce\n * @example\n *\n * R.without([1, 2], [1, 2, 1, 3, 4]); //=> [3, 4]\n */\n var without = _curry2(function (xs, list) {\n return reject(flip(_contains)(xs), list);\n });\n\n // A simple Set type that honours R.equals semantics\n /* globals Set */\n /**\n * Combines the logic for checking whether an item is a member of the set and\n * for adding a new item to the set.\n *\n * @param item The item to check or add to the Set instance.\n * @param shouldAdd If true, the item will be added to the set if it doesn't\n * already exist.\n * @param set The set instance to check or add to.\n * @return {boolean} When shouldAdd is true, this will return true when a new\n * item was added otherwise false. When shouldAdd is false,\n * this will return true if the item already exists, otherwise\n * false.\n */\n // distinguish between +0 and -0\n // these types can all utilise Set\n // set._items['boolean'] holds a two element array\n // representing [ falseExists, trueExists ]\n // compare functions for reference equality\n /* falls through */\n // reduce the search size of heterogeneous sets by creating buckets\n // for each type.\n // scan through all previously applied items\n var _Set = function () {\n function _Set() {\n /* globals Set */\n this._nativeSet = typeof Set === 'function' ? new Set() : null;\n this._items = {};\n }\n _Set.prototype.add = function (item) {\n return hasOrAdd(item, true, this);\n };\n _Set.prototype.has = function (item) {\n return hasOrAdd(item, false, this);\n };\n /**\n * Combines the logic for checking whether an item is a member of the set and\n * for adding a new item to the set.\n *\n * @param item The item to check or add to the Set instance.\n * @param shouldAdd If true, the item will be added to the set if it doesn't\n * already exist.\n * @param set The set instance to check or add to.\n * @return {boolean} When shouldAdd is true, this will return true when a new\n * item was added otherwise false. When shouldAdd is false,\n * this will return true if the item already exists, otherwise\n * false.\n */\n function hasOrAdd(item, shouldAdd, set) {\n var type = typeof item;\n var prevSize, newSize;\n switch (type) {\n case 'string':\n case 'number':\n // distinguish between +0 and -0\n if (item === 0 && !set._items['-0'] && 1 / item === -Infinity) {\n if (shouldAdd) {\n set._items['-0'] = true;\n }\n return shouldAdd;\n }\n // these types can all utilise Set\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize > prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = {};\n set._items[type][item] = true;\n }\n return shouldAdd;\n } else if (item in set._items[type]) {\n return !shouldAdd;\n } else {\n if (shouldAdd) {\n set._items[type][item] = true;\n }\n return shouldAdd;\n }\n }\n case 'boolean':\n // set._items['boolean'] holds a two element array\n // representing [ falseExists, trueExists ]\n if (type in set._items) {\n var bIdx = item ? 1 : 0;\n if (set._items[type][bIdx]) {\n return !shouldAdd;\n } else {\n if (shouldAdd) {\n set._items[type][bIdx] = true;\n }\n return shouldAdd;\n }\n } else {\n if (shouldAdd) {\n set._items[type] = item ? [\n false,\n true\n ] : [\n true,\n false\n ];\n }\n return shouldAdd;\n }\n case 'function':\n // compare functions for reference equality\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize > prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return shouldAdd;\n }\n if (!_contains(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return shouldAdd;\n }\n }\n return !shouldAdd;\n case 'undefined':\n if (set._items[type]) {\n return !shouldAdd;\n } else {\n if (shouldAdd) {\n set._items[type] = true;\n }\n return shouldAdd;\n }\n case 'object':\n if (item === null) {\n if (!set._items['null']) {\n if (shouldAdd) {\n set._items['null'] = true;\n }\n return shouldAdd;\n }\n return !shouldAdd;\n }\n /* falls through */\n default:\n // reduce the search size of heterogeneous sets by creating buckets\n // for each type.\n type = Object.prototype.toString.call(item);\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return shouldAdd;\n }\n // scan through all previously applied items\n if (!_contains(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return shouldAdd;\n }\n return !shouldAdd;\n }\n }\n return _Set;\n }();\n\n /**\n * A function wrapping calls to the two functions in an `&&` operation,\n * returning the result of the first function if it is false-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * false-y value.\n *\n * In addition to functions, `R.both` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f a predicate\n * @param {Function} g another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `&&`s their outputs together.\n * @see R.and\n * @example\n *\n * var gt10 = x => x > 10;\n * var even = x => x % 2 === 0;\n * var f = R.both(gt10, even);\n * f(100); //=> true\n * f(101); //=> false\n */\n var both = _curry2(function both(f, g) {\n return _isFunction(f) ? function _both() {\n return f.apply(this, arguments) && g.apply(this, arguments);\n } : lift(and)(f, g);\n });\n\n /**\n * Takes a function `f` and returns a function `g` such that:\n *\n * - applying `g` to zero or more arguments will give __true__ if applying\n * the same arguments to `f` gives a logical __false__ value; and\n *\n * - applying `g` to zero or more arguments will give __false__ if applying\n * the same arguments to `f` gives a logical __true__ value.\n *\n * `R.complement` will work on all other functors as well.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> *) -> (*... -> Boolean)\n * @param {Function} f\n * @return {Function}\n * @see R.not\n * @example\n *\n * var isEven = n => n % 2 === 0;\n * var isOdd = R.complement(isEven);\n * isOdd(21); //=> true\n * isOdd(42); //=> false\n */\n var complement = lift(not);\n\n /**\n * A function wrapping calls to the two functions in an `||` operation,\n * returning the result of the first function if it is truth-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * truth-y value.\n *\n * In addition to functions, `R.either` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f a predicate\n * @param {Function} g another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `||`s their outputs together.\n * @see R.or\n * @example\n *\n * var gt10 = x => x > 10;\n * var even = x => x % 2 === 0;\n * var f = R.either(gt10, even);\n * f(101); //=> true\n * f(8); //=> true\n */\n var either = _curry2(function either(f, g) {\n return _isFunction(f) ? function _either() {\n return f.apply(this, arguments) || g.apply(this, arguments);\n } : lift(or)(f, g);\n });\n\n /**\n * Turns a named method with a specified arity into a function that can be\n * called directly supplied with arguments and a target object.\n *\n * The returned function is curried and accepts `arity + 1` parameters where\n * the final parameter is the target object.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> String -> (a -> b -> ... -> n -> Object -> *)\n * @param {Number} arity Number of arguments the returned function should take\n * before the target object.\n * @param {String} method Name of the method to call.\n * @return {Function} A new curried function.\n * @example\n *\n * var sliceFrom = R.invoker(1, 'slice');\n * sliceFrom(6, 'abcdefghijklm'); //=> 'ghijklm'\n * var sliceFrom6 = R.invoker(2, 'slice')(6);\n * sliceFrom6(8, 'abcdefghijklm'); //=> 'gh'\n */\n var invoker = _curry2(function invoker(arity, method) {\n return curryN(arity + 1, function () {\n var target = arguments[arity];\n if (target != null && is(Function, target[method])) {\n return target[method].apply(target, _slice(arguments, 0, arity));\n }\n throw new TypeError(toString(target) + ' does not have a method named \"' + method + '\"');\n });\n });\n\n /**\n * Returns a string made by inserting the `separator` between each element and\n * concatenating all the elements into a single string.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig String -> [a] -> String\n * @param {Number|String} separator The string used to separate the elements.\n * @param {Array} xs The elements to join into a string.\n * @return {String} str The string made by concatenating `xs` with `separator`.\n * @see R.split\n * @example\n *\n * var spacer = R.join(' ');\n * spacer(['a', 2, 3.4]); //=> 'a 2 3.4'\n * R.join('|', [1, 2, 3]); //=> '1|2|3'\n */\n var join = invoker(1, 'join');\n\n /**\n * Creates a new function that, when invoked, caches the result of calling `fn`\n * for a given argument set and returns the result. Subsequent calls to the\n * memoized `fn` with the same argument set will not result in an additional\n * call to `fn`; instead, the cached result for that set of arguments will be\n * returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (*... -> a) -> (*... -> a)\n * @param {Function} fn The function to memoize.\n * @return {Function} Memoized version of `fn`.\n * @example\n *\n * var count = 0;\n * var factorial = R.memoize(n => {\n * count += 1;\n * return R.product(R.range(1, n + 1));\n * });\n * factorial(5); //=> 120\n * factorial(5); //=> 120\n * factorial(5); //=> 120\n * count; //=> 1\n */\n var memoize = _curry1(function memoize(fn) {\n var cache = {};\n return _arity(fn.length, function () {\n var key = toString(arguments);\n if (!_has(key, cache)) {\n cache[key] = fn.apply(this, arguments);\n }\n return cache[key];\n });\n });\n\n /**\n * Splits a string into an array of strings based on the given\n * separator.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig (String | RegExp) -> String -> [String]\n * @param {String|RegExp} sep The pattern.\n * @param {String} str The string to separate into an array.\n * @return {Array} The array of strings from `str` separated by `str`.\n * @see R.join\n * @example\n *\n * var pathComponents = R.split('/');\n * R.tail(pathComponents('/usr/local/bin/node')); //=> ['usr', 'local', 'bin', 'node']\n *\n * R.split('.', 'a.b.c.xyz.d'); //=> ['a', 'b', 'c', 'xyz', 'd']\n */\n var split = invoker(1, 'split');\n\n /**\n * Determines whether a given string matches a given regular expression.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category String\n * @sig RegExp -> String -> Boolean\n * @param {RegExp} pattern\n * @param {String} str\n * @return {Boolean}\n * @see R.match\n * @example\n *\n * R.test(/^x/, 'xyz'); //=> true\n * R.test(/^y/, 'xyz'); //=> false\n */\n var test = _curry2(function test(pattern, str) {\n if (!_isRegExp(pattern)) {\n throw new TypeError('\\u2018test\\u2019 requires a value of type RegExp as its first argument; received ' + toString(pattern));\n }\n return _cloneRegExp(pattern).test(str);\n });\n\n /**\n * The lower case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to lower case.\n * @return {String} The lower case version of `str`.\n * @see R.toUpper\n * @example\n *\n * R.toLower('XYZ'); //=> 'xyz'\n */\n var toLower = invoker(0, 'toLowerCase');\n\n /**\n * The upper case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to upper case.\n * @return {String} The upper case version of `str`.\n * @see R.toLower\n * @example\n *\n * R.toUpper('abc'); //=> 'ABC'\n */\n var toUpper = invoker(0, 'toUpperCase');\n\n /**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied function to\n * each list element. Prefers the first item if the supplied function produces\n * the same value on two items. `R.equals` is used for comparison.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> b) -> [a] -> [a]\n * @param {Function} fn A function used to produce a value to use during comparisons.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n * R.uniqBy(Math.abs, [-1, -5, 2, 10, 1, 2]); //=> [-1, -5, 2, 10]\n */\n var uniqBy = _curry2(function uniqBy(fn, list) {\n var set = new _Set();\n var result = [];\n var idx = 0;\n var appliedItem, item;\n while (idx < list.length) {\n item = list[idx];\n appliedItem = fn(item);\n if (set.add(appliedItem)) {\n result.push(item);\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Returns the result of concatenating the given lists or strings.\n *\n * Dispatches to the `concat` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @sig String -> String -> String\n * @param {Array|String} a\n * @param {Array|String} b\n * @return {Array|String}\n *\n * @example\n *\n * R.concat([], []); //=> []\n * R.concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n * R.concat('ABC', 'DEF'); // 'ABCDEF'\n */\n var concat = flip(invoker(1, 'concat'));\n\n /**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifferenceWith\n * @example\n *\n * R.symmetricDifference([1,2,3,4], [7,6,5,4,3]); //=> [1,2,7,6,5]\n * R.symmetricDifference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5,1,2]\n */\n var symmetricDifference = _curry2(function symmetricDifference(list1, list2) {\n return concat(difference(list1, list2), difference(list2, list1));\n });\n\n /**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both. Duplication is determined according to the value\n * returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [a] -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifference\n * @example\n *\n * var eqA = R.eqBy(R.prop('a'));\n * var l1 = [{a: 1}, {a: 2}, {a: 3}, {a: 4}];\n * var l2 = [{a: 3}, {a: 4}, {a: 5}, {a: 6}];\n * R.symmetricDifferenceWith(eqA, l1, l2); //=> [{a: 1}, {a: 2}, {a: 5}, {a: 6}]\n */\n var symmetricDifferenceWith = _curry3(function symmetricDifferenceWith(pred, list1, list2) {\n return concat(differenceWith(pred, list1, list2), differenceWith(pred, list2, list1));\n });\n\n /**\n * Returns a new list containing only one copy of each element in the original\n * list. `R.equals` is used to determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n * R.uniq([1, 1, 2, 1]); //=> [1, 2]\n * R.uniq([1, '1']); //=> [1, '1']\n * R.uniq([[42], [42]]); //=> [[42]]\n */\n var uniq = uniqBy(identity);\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of those\n * elements common to both lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The list of elements found in both `list1` and `list2`.\n * @see R.intersectionWith\n * @example\n *\n * R.intersection([1,2,3,4], [7,6,5,4,3]); //=> [4, 3]\n */\n var intersection = _curry2(function intersection(list1, list2) {\n var lookupList, filteredList;\n if (list1.length > list2.length) {\n lookupList = list1;\n filteredList = list2;\n } else {\n lookupList = list2;\n filteredList = list1;\n }\n return uniq(_filter(flip(_contains)(lookupList), filteredList));\n });\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The first and second lists concatenated, with\n * duplicates removed.\n * @example\n *\n * R.union([1, 2, 3], [2, 3, 4]); //=> [1, 2, 3, 4]\n */\n var union = _curry2(compose(uniq, _concat));\n\n var R = {\n F: F,\n T: T,\n __: __,\n add: add,\n addIndex: addIndex,\n adjust: adjust,\n all: all,\n allPass: allPass,\n allUniq: allUniq,\n always: always,\n and: and,\n any: any,\n anyPass: anyPass,\n ap: ap,\n aperture: aperture,\n append: append,\n apply: apply,\n applySpec: applySpec,\n assoc: assoc,\n assocPath: assocPath,\n binary: binary,\n bind: bind,\n both: both,\n call: call,\n chain: chain,\n clamp: clamp,\n clone: clone,\n comparator: comparator,\n complement: complement,\n compose: compose,\n composeK: composeK,\n composeP: composeP,\n concat: concat,\n cond: cond,\n construct: construct,\n constructN: constructN,\n contains: contains,\n converge: converge,\n countBy: countBy,\n curry: curry,\n curryN: curryN,\n dec: dec,\n defaultTo: defaultTo,\n difference: difference,\n differenceWith: differenceWith,\n dissoc: dissoc,\n dissocPath: dissocPath,\n divide: divide,\n drop: drop,\n dropLast: dropLast,\n dropLastWhile: dropLastWhile,\n dropRepeats: dropRepeats,\n dropRepeatsWith: dropRepeatsWith,\n dropWhile: dropWhile,\n either: either,\n empty: empty,\n eqBy: eqBy,\n eqProps: eqProps,\n equals: equals,\n evolve: evolve,\n filter: filter,\n find: find,\n findIndex: findIndex,\n findLast: findLast,\n findLastIndex: findLastIndex,\n flatten: flatten,\n flip: flip,\n forEach: forEach,\n fromPairs: fromPairs,\n groupBy: groupBy,\n groupWith: groupWith,\n gt: gt,\n gte: gte,\n has: has,\n hasIn: hasIn,\n head: head,\n identical: identical,\n identity: identity,\n ifElse: ifElse,\n inc: inc,\n indexBy: indexBy,\n indexOf: indexOf,\n init: init,\n insert: insert,\n insertAll: insertAll,\n intersection: intersection,\n intersectionWith: intersectionWith,\n intersperse: intersperse,\n into: into,\n invert: invert,\n invertObj: invertObj,\n invoker: invoker,\n is: is,\n isArrayLike: isArrayLike,\n isEmpty: isEmpty,\n isNil: isNil,\n join: join,\n juxt: juxt,\n keys: keys,\n keysIn: keysIn,\n last: last,\n lastIndexOf: lastIndexOf,\n length: length,\n lens: lens,\n lensIndex: lensIndex,\n lensPath: lensPath,\n lensProp: lensProp,\n lift: lift,\n liftN: liftN,\n lt: lt,\n lte: lte,\n map: map,\n mapAccum: mapAccum,\n mapAccumRight: mapAccumRight,\n mapObjIndexed: mapObjIndexed,\n match: match,\n mathMod: mathMod,\n max: max,\n maxBy: maxBy,\n mean: mean,\n median: median,\n memoize: memoize,\n merge: merge,\n mergeAll: mergeAll,\n mergeWith: mergeWith,\n mergeWithKey: mergeWithKey,\n min: min,\n minBy: minBy,\n modulo: modulo,\n multiply: multiply,\n nAry: nAry,\n negate: negate,\n none: none,\n not: not,\n nth: nth,\n nthArg: nthArg,\n objOf: objOf,\n of: of,\n omit: omit,\n once: once,\n or: or,\n over: over,\n pair: pair,\n partial: partial,\n partialRight: partialRight,\n partition: partition,\n path: path,\n pathEq: pathEq,\n pathOr: pathOr,\n pathSatisfies: pathSatisfies,\n pick: pick,\n pickAll: pickAll,\n pickBy: pickBy,\n pipe: pipe,\n pipeK: pipeK,\n pipeP: pipeP,\n pluck: pluck,\n prepend: prepend,\n product: product,\n project: project,\n prop: prop,\n propEq: propEq,\n propIs: propIs,\n propOr: propOr,\n propSatisfies: propSatisfies,\n props: props,\n range: range,\n reduce: reduce,\n reduceBy: reduceBy,\n reduceRight: reduceRight,\n reduced: reduced,\n reject: reject,\n remove: remove,\n repeat: repeat,\n replace: replace,\n reverse: reverse,\n scan: scan,\n sequence: sequence,\n set: set,\n slice: slice,\n sort: sort,\n sortBy: sortBy,\n split: split,\n splitAt: splitAt,\n splitEvery: splitEvery,\n splitWhen: splitWhen,\n subtract: subtract,\n sum: sum,\n symmetricDifference: symmetricDifference,\n symmetricDifferenceWith: symmetricDifferenceWith,\n tail: tail,\n take: take,\n takeLast: takeLast,\n takeLastWhile: takeLastWhile,\n takeWhile: takeWhile,\n tap: tap,\n test: test,\n times: times,\n toLower: toLower,\n toPairs: toPairs,\n toPairsIn: toPairsIn,\n toString: toString,\n toUpper: toUpper,\n transduce: transduce,\n transpose: transpose,\n traverse: traverse,\n trim: trim,\n tryCatch: tryCatch,\n type: type,\n unapply: unapply,\n unary: unary,\n uncurryN: uncurryN,\n unfold: unfold,\n union: union,\n unionWith: unionWith,\n uniq: uniq,\n uniqBy: uniqBy,\n uniqWith: uniqWith,\n unless: unless,\n unnest: unnest,\n until: until,\n update: update,\n useWith: useWith,\n values: values,\n valuesIn: valuesIn,\n view: view,\n when: when,\n where: where,\n whereEq: whereEq,\n without: without,\n wrap: wrap,\n xprod: xprod,\n zip: zip,\n zipObj: zipObj,\n zipWith: zipWith\n };\n /* eslint-env amd */\n\n /* TEST_ENTRY_POINT */\n\n if (typeof exports === 'object') {\n module.exports = R;\n } else if (typeof define === 'function' && define.amd) {\n define(function() { return R; });\n } else {\n this.R = R;\n }\n\n}.call(this));\n\n},{}],388:[function(require,module,exports){\n(function (global){\n/**\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\n * additional grant of patent rights can be found in the PATENTS file in\n * the same directory.\n */\n\n!(function(global) {\n \"use strict\";\n\n var Op = Object.prototype;\n var hasOwn = Op.hasOwnProperty;\n var undefined; // More compressible than void 0.\n var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n var inModule = typeof module === \"object\";\n var runtime = global.regeneratorRuntime;\n if (runtime) {\n if (inModule) {\n // If regeneratorRuntime is defined globally and we're in a module,\n // make the exports object identical to regeneratorRuntime.\n module.exports = runtime;\n }\n // Don't bother evaluating the rest of this file if the runtime was\n // already defined globally.\n return;\n }\n\n // Define the runtime globally (as expected by generated code) as either\n // module.exports (if we're in a module) or a new, empty object.\n runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n function wrap(innerFn, outerFn, self, tryLocsList) {\n // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n var generator = Object.create(protoGenerator.prototype);\n var context = new Context(tryLocsList || []);\n\n // The ._invoke method unifies the implementations of the .next,\n // .throw, and .return methods.\n generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n return generator;\n }\n runtime.wrap = wrap;\n\n // Try/catch helper to minimize deoptimizations. Returns a completion\n // record like context.tryEntries[i].completion. This interface could\n // have been (and was previously) designed to take a closure to be\n // invoked without arguments, but in all the cases we care about we\n // already have an existing method we want to call, so there's no need\n // to create a new function object. We can even get away with assuming\n // the method takes exactly one argument, since that happens to be true\n // in every case, so we don't have to touch the arguments object. The\n // only additional allocation required is the completion record, which\n // has a stable shape and so hopefully should be cheap to allocate.\n function tryCatch(fn, obj, arg) {\n try {\n return { type: \"normal\", arg: fn.call(obj, arg) };\n } catch (err) {\n return { type: \"throw\", arg: err };\n }\n }\n\n var GenStateSuspendedStart = \"suspendedStart\";\n var GenStateSuspendedYield = \"suspendedYield\";\n var GenStateExecuting = \"executing\";\n var GenStateCompleted = \"completed\";\n\n // Returning this object from the innerFn has the same effect as\n // breaking out of the dispatch switch statement.\n var ContinueSentinel = {};\n\n // Dummy constructor functions that we use as the .constructor and\n // .constructor.prototype properties for functions that return Generator\n // objects. For full spec compliance, you may wish to configure your\n // minifier not to mangle the names of these two functions.\n function Generator() {}\n function GeneratorFunction() {}\n function GeneratorFunctionPrototype() {}\n\n // This is a polyfill for %IteratorPrototype% for environments that\n // don't natively support it.\n var IteratorPrototype = {};\n IteratorPrototype[iteratorSymbol] = function () {\n return this;\n };\n\n var getProto = Object.getPrototypeOf;\n var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n if (NativeIteratorPrototype &&\n NativeIteratorPrototype !== Op &&\n hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n // This environment has a native %IteratorPrototype%; use it instead\n // of the polyfill.\n IteratorPrototype = NativeIteratorPrototype;\n }\n\n var Gp = GeneratorFunctionPrototype.prototype =\n Generator.prototype = Object.create(IteratorPrototype);\n GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n GeneratorFunctionPrototype.constructor = GeneratorFunction;\n GeneratorFunctionPrototype[toStringTagSymbol] =\n GeneratorFunction.displayName = \"GeneratorFunction\";\n\n // Helper for defining the .next, .throw, and .return methods of the\n // Iterator interface in terms of a single ._invoke method.\n function defineIteratorMethods(prototype) {\n [\"next\", \"throw\", \"return\"].forEach(function(method) {\n prototype[method] = function(arg) {\n return this._invoke(method, arg);\n };\n });\n }\n\n runtime.isGeneratorFunction = function(genFun) {\n var ctor = typeof genFun === \"function\" && genFun.constructor;\n return ctor\n ? ctor === GeneratorFunction ||\n // For the native GeneratorFunction constructor, the best we can\n // do is to check its .name property.\n (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n : false;\n };\n\n runtime.mark = function(genFun) {\n if (Object.setPrototypeOf) {\n Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n } else {\n genFun.__proto__ = GeneratorFunctionPrototype;\n if (!(toStringTagSymbol in genFun)) {\n genFun[toStringTagSymbol] = \"GeneratorFunction\";\n }\n }\n genFun.prototype = Object.create(Gp);\n return genFun;\n };\n\n // Within the body of any async function, `await x` is transformed to\n // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n // meant to be awaited.\n runtime.awrap = function(arg) {\n return { __await: arg };\n };\n\n function AsyncIterator(generator) {\n function invoke(method, arg, resolve, reject) {\n var record = tryCatch(generator[method], generator, arg);\n if (record.type === \"throw\") {\n reject(record.arg);\n } else {\n var result = record.arg;\n var value = result.value;\n if (value &&\n typeof value === \"object\" &&\n hasOwn.call(value, \"__await\")) {\n return Promise.resolve(value.__await).then(function(value) {\n invoke(\"next\", value, resolve, reject);\n }, function(err) {\n invoke(\"throw\", err, resolve, reject);\n });\n }\n\n return Promise.resolve(value).then(function(unwrapped) {\n // When a yielded Promise is resolved, its final value becomes\n // the .value of the Promise<{value,done}> result for the\n // current iteration. If the Promise is rejected, however, the\n // result for this iteration will be rejected with the same\n // reason. Note that rejections of yielded Promises are not\n // thrown back into the generator function, as is the case\n // when an awaited Promise is rejected. This difference in\n // behavior between yield and await is important, because it\n // allows the consumer to decide what to do with the yielded\n // rejection (swallow it and continue, manually .throw it back\n // into the generator, abandon iteration, whatever). With\n // await, by contrast, there is no opportunity to examine the\n // rejection reason outside the generator function, so the\n // only option is to throw it from the await expression, and\n // let the generator function handle the exception.\n result.value = unwrapped;\n resolve(result);\n }, reject);\n }\n }\n\n if (typeof global.process === \"object\" && global.process.domain) {\n invoke = global.process.domain.bind(invoke);\n }\n\n var previousPromise;\n\n function enqueue(method, arg) {\n function callInvokeWithMethodAndArg() {\n return new Promise(function(resolve, reject) {\n invoke(method, arg, resolve, reject);\n });\n }\n\n return previousPromise =\n // If enqueue has been called before, then we want to wait until\n // all previous Promises have been resolved before calling invoke,\n // so that results are always delivered in the correct order. If\n // enqueue has not been called before, then it is important to\n // call invoke immediately, without waiting on a callback to fire,\n // so that the async generator function has the opportunity to do\n // any necessary setup in a predictable way. This predictability\n // is why the Promise constructor synchronously invokes its\n // executor callback, and why async functions synchronously\n // execute code before the first await. Since we implement simple\n // async functions in terms of async generators, it is especially\n // important to get this right, even though it requires care.\n previousPromise ? previousPromise.then(\n callInvokeWithMethodAndArg,\n // Avoid propagating failures to Promises returned by later\n // invocations of the iterator.\n callInvokeWithMethodAndArg\n ) : callInvokeWithMethodAndArg();\n }\n\n // Define the unified helper method that is used to implement .next,\n // .throw, and .return (see defineIteratorMethods).\n this._invoke = enqueue;\n }\n\n defineIteratorMethods(AsyncIterator.prototype);\n AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n return this;\n };\n runtime.AsyncIterator = AsyncIterator;\n\n // Note that simple async functions are implemented on top of\n // AsyncIterator objects; they just return a Promise for the value of\n // the final result produced by the iterator.\n runtime.async = function(innerFn, outerFn, self, tryLocsList) {\n var iter = new AsyncIterator(\n wrap(innerFn, outerFn, self, tryLocsList)\n );\n\n return runtime.isGeneratorFunction(outerFn)\n ? iter // If outerFn is a generator, return the full iterator.\n : iter.next().then(function(result) {\n return result.done ? result.value : iter.next();\n });\n };\n\n function makeInvokeMethod(innerFn, self, context) {\n var state = GenStateSuspendedStart;\n\n return function invoke(method, arg) {\n if (state === GenStateExecuting) {\n throw new Error(\"Generator is already running\");\n }\n\n if (state === GenStateCompleted) {\n if (method === \"throw\") {\n throw arg;\n }\n\n // Be forgiving, per 25.3.3.3.3 of the spec:\n // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n return doneResult();\n }\n\n context.method = method;\n context.arg = arg;\n\n while (true) {\n var delegate = context.delegate;\n if (delegate) {\n var delegateResult = maybeInvokeDelegate(delegate, context);\n if (delegateResult) {\n if (delegateResult === ContinueSentinel) continue;\n return delegateResult;\n }\n }\n\n if (context.method === \"next\") {\n // Setting context._sent for legacy support of Babel's\n // function.sent implementation.\n context.sent = context._sent = context.arg;\n\n } else if (context.method === \"throw\") {\n if (state === GenStateSuspendedStart) {\n state = GenStateCompleted;\n throw context.arg;\n }\n\n context.dispatchException(context.arg);\n\n } else if (context.method === \"return\") {\n context.abrupt(\"return\", context.arg);\n }\n\n state = GenStateExecuting;\n\n var record = tryCatch(innerFn, self, context);\n if (record.type === \"normal\") {\n // If an exception is thrown from innerFn, we leave state ===\n // GenStateExecuting and loop back for another invocation.\n state = context.done\n ? GenStateCompleted\n : GenStateSuspendedYield;\n\n if (record.arg === ContinueSentinel) {\n continue;\n }\n\n return {\n value: record.arg,\n done: context.done\n };\n\n } else if (record.type === \"throw\") {\n state = GenStateCompleted;\n // Dispatch the exception by looping back around to the\n // context.dispatchException(context.arg) call above.\n context.method = \"throw\";\n context.arg = record.arg;\n }\n }\n };\n }\n\n // Call delegate.iterator[context.method](context.arg) and handle the\n // result, either by returning a { value, done } result from the\n // delegate iterator, or by modifying context.method and context.arg,\n // setting context.delegate to null, and returning the ContinueSentinel.\n function maybeInvokeDelegate(delegate, context) {\n var method = delegate.iterator[context.method];\n if (method === undefined) {\n // A .throw or .return when the delegate iterator has no .throw\n // method always terminates the yield* loop.\n context.delegate = null;\n\n if (context.method === \"throw\") {\n if (delegate.iterator.return) {\n // If the delegate iterator has a return method, give it a\n // chance to clean up.\n context.method = \"return\";\n context.arg = undefined;\n maybeInvokeDelegate(delegate, context);\n\n if (context.method === \"throw\") {\n // If maybeInvokeDelegate(context) changed context.method from\n // \"return\" to \"throw\", let that override the TypeError below.\n return ContinueSentinel;\n }\n }\n\n context.method = \"throw\";\n context.arg = new TypeError(\n \"The iterator does not provide a 'throw' method\");\n }\n\n return ContinueSentinel;\n }\n\n var record = tryCatch(method, delegate.iterator, context.arg);\n\n if (record.type === \"throw\") {\n context.method = \"throw\";\n context.arg = record.arg;\n context.delegate = null;\n return ContinueSentinel;\n }\n\n var info = record.arg;\n\n if (! info) {\n context.method = \"throw\";\n context.arg = new TypeError(\"iterator result is not an object\");\n context.delegate = null;\n return ContinueSentinel;\n }\n\n if (info.done) {\n // Assign the result of the finished delegate to the temporary\n // variable specified by delegate.resultName (see delegateYield).\n context[delegate.resultName] = info.value;\n\n // Resume execution at the desired location (see delegateYield).\n context.next = delegate.nextLoc;\n\n // If context.method was \"throw\" but the delegate handled the\n // exception, let the outer generator proceed normally. If\n // context.method was \"next\", forget context.arg since it has been\n // \"consumed\" by the delegate iterator. If context.method was\n // \"return\", allow the original .return call to continue in the\n // outer generator.\n if (context.method !== \"return\") {\n context.method = \"next\";\n context.arg = undefined;\n }\n\n } else {\n // Re-yield the result returned by the delegate method.\n return info;\n }\n\n // The delegate iterator is finished, so forget it and continue with\n // the outer generator.\n context.delegate = null;\n return ContinueSentinel;\n }\n\n // Define Generator.prototype.{next,throw,return} in terms of the\n // unified ._invoke helper method.\n defineIteratorMethods(Gp);\n\n Gp[toStringTagSymbol] = \"Generator\";\n\n // A Generator should always return itself as the iterator object when the\n // @@iterator function is called on it. Some browsers' implementations of the\n // iterator prototype chain incorrectly implement this, causing the Generator\n // object to not be returned from this call. This ensures that doesn't happen.\n // See https://github.com/facebook/regenerator/issues/274 for more details.\n Gp[iteratorSymbol] = function() {\n return this;\n };\n\n Gp.toString = function() {\n return \"[object Generator]\";\n };\n\n function pushTryEntry(locs) {\n var entry = { tryLoc: locs[0] };\n\n if (1 in locs) {\n entry.catchLoc = locs[1];\n }\n\n if (2 in locs) {\n entry.finallyLoc = locs[2];\n entry.afterLoc = locs[3];\n }\n\n this.tryEntries.push(entry);\n }\n\n function resetTryEntry(entry) {\n var record = entry.completion || {};\n record.type = \"normal\";\n delete record.arg;\n entry.completion = record;\n }\n\n function Context(tryLocsList) {\n // The root entry object (effectively a try statement without a catch\n // or a finally block) gives us a place to store values thrown from\n // locations where there is no enclosing try statement.\n this.tryEntries = [{ tryLoc: \"root\" }];\n tryLocsList.forEach(pushTryEntry, this);\n this.reset(true);\n }\n\n runtime.keys = function(object) {\n var keys = [];\n for (var key in object) {\n keys.push(key);\n }\n keys.reverse();\n\n // Rather than returning an object with a next method, we keep\n // things simple and return the next function itself.\n return function next() {\n while (keys.length) {\n var key = keys.pop();\n if (key in object) {\n next.value = key;\n next.done = false;\n return next;\n }\n }\n\n // To avoid creating an additional object, we just hang the .value\n // and .done properties off the next function object itself. This\n // also ensures that the minifier will not anonymize the function.\n next.done = true;\n return next;\n };\n };\n\n function values(iterable) {\n if (iterable) {\n var iteratorMethod = iterable[iteratorSymbol];\n if (iteratorMethod) {\n return iteratorMethod.call(iterable);\n }\n\n if (typeof iterable.next === \"function\") {\n return iterable;\n }\n\n if (!isNaN(iterable.length)) {\n var i = -1, next = function next() {\n while (++i < iterable.length) {\n if (hasOwn.call(iterable, i)) {\n next.value = iterable[i];\n next.done = false;\n return next;\n }\n }\n\n next.value = undefined;\n next.done = true;\n\n return next;\n };\n\n return next.next = next;\n }\n }\n\n // Return an iterator with no values.\n return { next: doneResult };\n }\n runtime.values = values;\n\n function doneResult() {\n return { value: undefined, done: true };\n }\n\n Context.prototype = {\n constructor: Context,\n\n reset: function(skipTempReset) {\n this.prev = 0;\n this.next = 0;\n // Resetting context._sent for legacy support of Babel's\n // function.sent implementation.\n this.sent = this._sent = undefined;\n this.done = false;\n this.delegate = null;\n\n this.method = \"next\";\n this.arg = undefined;\n\n this.tryEntries.forEach(resetTryEntry);\n\n if (!skipTempReset) {\n for (var name in this) {\n // Not sure about the optimal order of these conditions:\n if (name.charAt(0) === \"t\" &&\n hasOwn.call(this, name) &&\n !isNaN(+name.slice(1))) {\n this[name] = undefined;\n }\n }\n }\n },\n\n stop: function() {\n this.done = true;\n\n var rootEntry = this.tryEntries[0];\n var rootRecord = rootEntry.completion;\n if (rootRecord.type === \"throw\") {\n throw rootRecord.arg;\n }\n\n return this.rval;\n },\n\n dispatchException: function(exception) {\n if (this.done) {\n throw exception;\n }\n\n var context = this;\n function handle(loc, caught) {\n record.type = \"throw\";\n record.arg = exception;\n context.next = loc;\n\n if (caught) {\n // If the dispatched exception was caught by a catch block,\n // then let that catch block handle the exception normally.\n context.method = \"next\";\n context.arg = undefined;\n }\n\n return !! caught;\n }\n\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n var record = entry.completion;\n\n if (entry.tryLoc === \"root\") {\n // Exception thrown outside of any try block that could handle\n // it, so set the completion value of the entire function to\n // throw the exception.\n return handle(\"end\");\n }\n\n if (entry.tryLoc <= this.prev) {\n var hasCatch = hasOwn.call(entry, \"catchLoc\");\n var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n if (hasCatch && hasFinally) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n } else if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else if (hasCatch) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n }\n\n } else if (hasFinally) {\n if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else {\n throw new Error(\"try statement without catch or finally\");\n }\n }\n }\n },\n\n abrupt: function(type, arg) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc <= this.prev &&\n hasOwn.call(entry, \"finallyLoc\") &&\n this.prev < entry.finallyLoc) {\n var finallyEntry = entry;\n break;\n }\n }\n\n if (finallyEntry &&\n (type === \"break\" ||\n type === \"continue\") &&\n finallyEntry.tryLoc <= arg &&\n arg <= finallyEntry.finallyLoc) {\n // Ignore the finally entry if control is not jumping to a\n // location outside the try/catch block.\n finallyEntry = null;\n }\n\n var record = finallyEntry ? finallyEntry.completion : {};\n record.type = type;\n record.arg = arg;\n\n if (finallyEntry) {\n this.method = \"next\";\n this.next = finallyEntry.finallyLoc;\n return ContinueSentinel;\n }\n\n return this.complete(record);\n },\n\n complete: function(record, afterLoc) {\n if (record.type === \"throw\") {\n throw record.arg;\n }\n\n if (record.type === \"break\" ||\n record.type === \"continue\") {\n this.next = record.arg;\n } else if (record.type === \"return\") {\n this.rval = this.arg = record.arg;\n this.method = \"return\";\n this.next = \"end\";\n } else if (record.type === \"normal\" && afterLoc) {\n this.next = afterLoc;\n }\n\n return ContinueSentinel;\n },\n\n finish: function(finallyLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.finallyLoc === finallyLoc) {\n this.complete(entry.completion, entry.afterLoc);\n resetTryEntry(entry);\n return ContinueSentinel;\n }\n }\n },\n\n \"catch\": function(tryLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc === tryLoc) {\n var record = entry.completion;\n if (record.type === \"throw\") {\n var thrown = record.arg;\n resetTryEntry(entry);\n }\n return thrown;\n }\n }\n\n // The context.catch method must only be called with a location\n // argument that corresponds to a known catch block.\n throw new Error(\"illegal catch attempt\");\n },\n\n delegateYield: function(iterable, resultName, nextLoc) {\n this.delegate = {\n iterator: values(iterable),\n resultName: resultName,\n nextLoc: nextLoc\n };\n\n if (this.method === \"next\") {\n // Deliberately forget the last sent value so that we don't\n // accidentally pass it on to the delegate.\n this.arg = undefined;\n }\n\n return ContinueSentinel;\n }\n };\n})(\n // Among the various tricks for obtaining a reference to the global\n // object, this seems to be the most reliable technique that does not\n // use indirect eval (which violates Content Security Policy).\n typeof global === \"object\" ? global :\n typeof window === \"object\" ? window :\n typeof self === \"object\" ? self : this\n);\n\n}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n\n},{}]},{},[19])\n\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// bedwig.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var sa = require('./sourceadapters');\n var dalliance_registerParserFactory = sa.registerParserFactory;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n}\n\n\nfunction BedWigParser(type) {\n this.type = type;\n}\n\nBedWigParser.prototype.createSession = function(sink) {\n if (this.type == 'wig')\n return new WigParseSession(this, sink);\n else\n return new BedParseSession(this, sink);\n}\n\nvar __KV_REGEXP=/([^=]+)=(.+)/;\nvar __SPACE_REGEXP=/\\s/;\nvar BED_COLOR_REGEXP = new RegExp(\"^[0-9]+,[0-9]+,[0-9]+\");\n\nfunction BedParseSession(parser, sink) {\n this.parser = parser;\n this.sink = sink;\n}\n\nBedParseSession.prototype.parse = function(line) {\n var toks = line.split(__SPACE_REGEXP);\n if (toks.length < 3)\n return;\n\n var start = parseInt(toks[1]) + 1;\n var end = parseInt(toks[2]);\n\n var f = {segment: toks[0], \n min: start,\n max: end};\n\n if (toks.length > 3 && toks[3] !== '.') {\n f.label = toks[3];\n }\n\n if (toks.length > 4) {\n f.score = parseFloat(toks[4])\n }\n\n if (toks.length > 5) {\n f.orientation = toks[5];\n }\n\n if (toks.length > 8) {\n var color = toks[8];\n if (BED_COLOR_REGEXP.test(color)) {\n f.itemRgb = 'rgb(' + color + ')';\n }\n }\n\n if (toks.length >= 12) {\n var thickStart = parseInt(toks[6]);\n var thickEnd = parseInt(toks[7]);\n var blockCount = parseInt(toks[9]);\n var blockSizes = toks[10].split(',').map(function(x) {return parseInt(x)});\n var blockStarts = toks[11].split(',').map(function(x) {return parseInt(x)});\n\n f.type = 'transcript'\n var grp = new DASGroup();\n grp.id = toks[3];\n grp.type = 'transcript'\n grp.notes = [];\n f.groups = [grp];\n\n if (toks.length > 12) {\n var geneId = toks[12];\n var geneName = geneId;\n if (toks.length > 13) {\n geneName = toks[13];\n }\n var gg = new DASGroup();\n gg.id = geneId;\n gg.label = geneName;\n gg.type = 'gene';\n f.groups.push(gg);\n } \n\n var spans = null;\n for (var b = 0; b < blockCount; ++b) {\n var bmin = blockStarts[b] + start;\n var bmax = bmin + blockSizes[b];\n var span = new Range(bmin, bmax);\n if (spans) {\n spans = union(spans, span);\n } else {\n spans = span;\n }\n }\n \n var tsList = spans.ranges();\n for (var s = 0; s < tsList.length; ++s) {\n var ts = tsList[s];\n var bf = shallowCopy(f);\n bf.min = ts.min();\n bf.max = ts.max();\n this.sink(bf);\n }\n\n if (thickEnd > thickStart) {\n var codingRegion = (f.orientation == '+') ? \n new Range(thickStart, thickEnd + 3) : \n new Range(thickStart - 3, thickEnd);\n // +/- 3 to account for stop codon\n\n var tl = intersection(spans, codingRegion);\n if (tl) {\n f.type = 'translation';\n var tlList = tl.ranges();\n var readingFrame = 0;\n for (var s = 0; s < tlList.length; ++s) {\n // Record reading frame for every exon\n var index = s;\n if (f.orientation == '-')\n index = tlList.length - s - 1;\n var ts = tlList[index];\n var bf = shallowCopy(f);\n bf.min = ts.min();\n bf.max = ts.max();\n f.readframe = readingFrame;\n var length = ts.max() - ts.min();\n readingFrame = (readingFrame + length) % 3;\n this.sink(bf);\n }\n }\n }\n } else {\n this.sink(f);\n }\n}\n\nBedParseSession.prototype.flush = function() {};\n\nfunction WigParseSession(parser, sink) {\n this.parser = parser;\n this.sink = sink;\n this.wigState = null;\n}\n\nWigParseSession.prototype.parse = function(line) {\n var toks = line.split(__SPACE_REGEXP);\n\n if (toks[0] == 'fixedStep') {\n this.wigState = 'fixedStep';\n this.chr = this.pos = this.step = null;\n this.span = 1;\n\n for (var ti = 1; ti < toks.length; ++ti) {\n var m = __KV_REGEXP.exec(toks[ti]);\n if (m) {\n if (m[1] == 'chrom') {\n this.chr = m[2];\n } else if (m[1] == 'start') {\n this.pos = parseInt(m[2]);\n } else if (m[1] == 'step') {\n this.step = parseInt(m[2]);\n } else if (m[1] == 'span') {\n this.span = parseInt(m[2]);\n }\n }\n }\n } else if (toks[0] == 'variableStep') {\n this.wigState = 'variableStep';\n this.chr = null;\n this.span = 1;\n\n for (var ti = 1; ti < toks.length; ++ti) {\n var m = __KV_REGEXP.exec(toks[ti]);\n if (m[1] == 'chrom') {\n this.chr = m[2];\n } else if (m[1] == 'span') {\n this.span = parseInt(m[2]);\n }\n }\n } else {\n if (!this.wigState) {\n if (toks.length < 4)\n return;\n\n var f = {segment: toks[0], \n min: parseInt(toks[1]) + 1, \n max: parseInt(toks[2]),\n score: parseFloat(toks[3])};\n\n this.sink(f);\n } else if (this.wigState == 'fixedStep') {\n if (toks.length != 1)\n return;\n var score = parseFloat(toks[0]);\n var f = {segment: this.chr, min: this.pos, max: this.pos + this.span - 1, score: score};\n this.pos += this.step;\n this.sink(f);\n } else if (this.wigState == 'variableStep') {\n if (toks.length != 2)\n return;\n var pos = parseInt(toks[0]);\n var score = parseFloat(toks[1]);\n var f = {segment: this.chr, min: pos, max: pos + this.span - 1, score: score};\n this.sink(f);\n }\n }\n}\n\nWigParseSession.prototype.flush = function() {};\n\nBedWigParser.prototype.getStyleSheet = function(callback) {\n var thisB = this;\n var stylesheet = new DASStylesheet();\n\n if (this.type == 'wig') {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'HISTOGRAM';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n } else {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue'\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'red'\n wigStyle.HEIGHT = 10;\n wigStyle.BUMP = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'translation'}, null, wigStyle);\n \n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({type: 'transcript'}, null, tsStyle);\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'white';\n densStyle.COLOR2 = 'black';\n densStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'density'}, null, densStyle);\n }\n\n return callback(stylesheet);\n}\n\ndalliance_registerParserFactory('bed', function(t) {return new BedWigParser(t)});\ndalliance_registerParserFactory('wig', function(t) {return new BedWigParser(t)});\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// bigwig.js: indexed binary WIG (and BED) files\n//\n\n\"use strict\";\n\n\nif (typeof(require) !== 'undefined') {\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var das = require('./das');\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var bin = require('./bin');\n var readInt = bin.readInt;\n\n var jszlib = require('jszlib');\n var jszlib_inflate_buffer = jszlib.inflateBuffer;\n var arrayCopy = jszlib.arrayCopy;\n}\n\nvar BIG_WIG_MAGIC = 0x888FFC26;\nvar BIG_WIG_MAGIC_BE = 0x26FC8F88;\nvar BIG_BED_MAGIC = 0x8789F2EB;\nvar BIG_BED_MAGIC_BE = 0xEBF28987;\n\n\nvar BIG_WIG_TYPE_GRAPH = 1;\nvar BIG_WIG_TYPE_VSTEP = 2;\nvar BIG_WIG_TYPE_FSTEP = 3;\n \nvar M1 = 256;\nvar M2 = 256*256;\nvar M3 = 256*256*256;\nvar M4 = 256*256*256*256;\n\nvar BED_COLOR_REGEXP = new RegExp(\"^[0-9]+,[0-9]+,[0-9]+\");\n\nfunction bwg_readOffset(ba, o) {\n var offset = ba[o] + ba[o+1]*M1 + ba[o+2]*M2 + ba[o+3]*M3 + ba[o+4]*M4;\n return offset;\n}\n\nfunction BigWig() {\n}\n\nBigWig.prototype.readChromTree = function(callback) {\n var thisB = this;\n this.chromsToIDs = {};\n this.idsToChroms = {};\n this.maxID = 0;\n\n var udo = this.unzoomedDataOffset;\n var eb = (udo - this.chromTreeOffset) & 3;\n udo = udo + 4 - eb;\n\n this.data.slice(this.chromTreeOffset, udo - this.chromTreeOffset).fetch(function(bpt) {\n var ba = new Uint8Array(bpt);\n var sa = new Int16Array(bpt);\n var la = new Int32Array(bpt);\n var bptMagic = la[0];\n var blockSize = la[1];\n var keySize = la[2];\n var valSize = la[3];\n var itemCount = bwg_readOffset(ba, 16);\n var rootNodeOffset = 32;\n\n var bptReadNode = function(offset) {\n var nodeType = ba[offset];\n var cnt = sa[(offset/2) + 1];\n offset += 4;\n for (var n = 0; n < cnt; ++n) {\n if (nodeType == 0) {\n offset += keySize;\n var childOffset = bwg_readOffset(ba, offset);\n offset += 8;\n childOffset -= thisB.chromTreeOffset;\n bptReadNode(childOffset);\n } else {\n var key = '';\n for (var ki = 0; ki < keySize; ++ki) {\n var charCode = ba[offset++];\n if (charCode != 0) {\n key += String.fromCharCode(charCode);\n }\n }\n var chromId = (ba[offset+3]<<24) | (ba[offset+2]<<16) | (ba[offset+1]<<8) | (ba[offset+0]);\n var chromSize = (ba[offset + 7]<<24) | (ba[offset+6]<<16) | (ba[offset+5]<<8) | (ba[offset+4]);\n offset += 8;\n\n thisB.chromsToIDs[key] = chromId;\n if (key.indexOf('chr') == 0) {\n thisB.chromsToIDs[key.substr(3)] = chromId;\n }\n thisB.idsToChroms[chromId] = key;\n thisB.maxID = Math.max(thisB.maxID, chromId);\n }\n }\n };\n bptReadNode(rootNodeOffset);\n\n callback(thisB);\n });\n}\n\nfunction BigWigView(bwg, cirTreeOffset, cirTreeLength, isSummary) {\n this.bwg = bwg;\n this.cirTreeOffset = cirTreeOffset;\n this.cirTreeLength = cirTreeLength;\n this.isSummary = isSummary;\n}\n\n\n\nBigWigView.prototype.readWigData = function(chrName, min, max, callback) {\n var chr = this.bwg.chromsToIDs[chrName];\n if (chr === undefined) {\n // Not an error because some .bwgs won't have data for all chromosomes.\n return callback([]);\n } else {\n this.readWigDataById(chr, min, max, callback);\n }\n}\n\nBigWigView.prototype.readWigDataById = function(chr, min, max, callback) {\n var thisB = this;\n if (!this.cirHeader) {\n this.bwg.data.slice(this.cirTreeOffset, 48).fetch(function(result) {\n thisB.cirHeader = result;\n var la = new Int32Array(thisB.cirHeader);\n thisB.cirBlockSize = la[1];\n thisB.readWigDataById(chr, min, max, callback);\n });\n return;\n }\n\n var blocksToFetch = [];\n var outstanding = 0;\n\n var beforeBWG = Date.now();\n\n var filter = function(chromId, fmin, fmax, toks) {\n return ((chr < 0 || chromId == chr) && fmin <= max && fmax >= min);\n }\n\n var cirFobRecur = function(offset, level) {\n if (thisB.bwg.instrument)\n console.log('level=' + level + '; offset=' + offset + '; time=' + (Date.now()|0));\n\n outstanding += offset.length;\n\n if (offset.length == 1 && offset[0] - thisB.cirTreeOffset == 48 && thisB.cachedCirRoot) {\n cirFobRecur2(thisB.cachedCirRoot, 0, level);\n --outstanding;\n if (outstanding == 0) {\n thisB.fetchFeatures(filter, blocksToFetch, callback);\n }\n return;\n }\n\n var maxCirBlockSpan = 4 + (thisB.cirBlockSize * 32); // Upper bound on size, based on a completely full leaf node.\n var spans;\n for (var i = 0; i < offset.length; ++i) {\n var blockSpan = new Range(offset[i], offset[i] + maxCirBlockSpan);\n spans = spans ? union(spans, blockSpan) : blockSpan;\n }\n \n var fetchRanges = spans.ranges();\n for (var r = 0; r < fetchRanges.length; ++r) {\n var fr = fetchRanges[r];\n cirFobStartFetch(offset, fr, level);\n }\n }\n\n var cirFobStartFetch = function(offset, fr, level, attempts) {\n var length = fr.max() - fr.min();\n thisB.bwg.data.slice(fr.min(), fr.max() - fr.min()).fetch(function(resultBuffer) {\n for (var i = 0; i < offset.length; ++i) {\n if (fr.contains(offset[i])) {\n cirFobRecur2(resultBuffer, offset[i] - fr.min(), level);\n\n if (offset[i] - thisB.cirTreeOffset == 48 && offset[i] - fr.min() == 0)\n thisB.cachedCirRoot = resultBuffer;\n\n --outstanding;\n if (outstanding == 0) {\n thisB.fetchFeatures(filter, blocksToFetch, callback);\n }\n }\n }\n });\n }\n\n var cirFobRecur2 = function(cirBlockData, offset, level) {\n var ba = new Uint8Array(cirBlockData);\n var sa = new Int16Array(cirBlockData);\n var la = new Int32Array(cirBlockData);\n\n var isLeaf = ba[offset];\n var cnt = sa[offset/2 + 1];\n offset += 4;\n\n if (isLeaf != 0) {\n for (var i = 0; i < cnt; ++i) {\n var lo = offset/4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = bwg_readOffset(ba, offset+16);\n var blockSize = bwg_readOffset(ba, offset+24);\n if (((chr < 0 || startChrom < chr) || (startChrom == chr && startBase <= max)) &&\n ((chr < 0 || endChrom > chr) || (endChrom == chr && endBase >= min)))\n {\n blocksToFetch.push({offset: blockOffset, size: blockSize});\n }\n offset += 32;\n }\n } else {\n var recurOffsets = [];\n for (var i = 0; i < cnt; ++i) {\n var lo = offset/4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = bwg_readOffset(ba, offset+16);\n if ((chr < 0 || startChrom < chr || (startChrom == chr && startBase <= max)) &&\n (chr < 0 || endChrom > chr || (endChrom == chr && endBase >= min)))\n {\n recurOffsets.push(blockOffset);\n }\n offset += 24;\n }\n if (recurOffsets.length > 0) {\n cirFobRecur(recurOffsets, level + 1);\n }\n }\n };\n\n cirFobRecur([thisB.cirTreeOffset + 48], 1);\n}\n\n\nBigWigView.prototype.fetchFeatures = function(filter, blocksToFetch, callback) {\n var thisB = this;\n\n blocksToFetch.sort(function(b0, b1) {\n return (b0.offset|0) - (b1.offset|0);\n });\n\n if (blocksToFetch.length == 0) {\n callback([]);\n } else {\n var features = [];\n var createFeature = function(chr, fmin, fmax, opts) {\n if (!opts) {\n opts = {};\n }\n \n var f = new DASFeature();\n f._chromId = chr;\n f.segment = thisB.bwg.idsToChroms[chr];\n f.min = fmin;\n f.max = fmax;\n f.type = thisB.bwg.type;\n \n for (var k in opts) {\n f[k] = opts[k];\n }\n \n features.push(f);\n };\n\n var tramp = function() {\n if (blocksToFetch.length == 0) {\n var afterBWG = Date.now();\n // dlog('BWG fetch took ' + (afterBWG - beforeBWG) + 'ms');\n callback(features);\n return; // just in case...\n } else {\n var block = blocksToFetch[0];\n if (block.data) {\n thisB.parseFeatures(block.data, createFeature, filter);\n blocksToFetch.splice(0, 1);\n tramp();\n } else {\n var fetchStart = block.offset;\n var fetchSize = block.size;\n var bi = 1;\n while (bi < blocksToFetch.length && blocksToFetch[bi].offset == (fetchStart + fetchSize)) {\n fetchSize += blocksToFetch[bi].size;\n ++bi;\n }\n\n thisB.bwg.data.slice(fetchStart, fetchSize).fetch(function(result) {\n var offset = 0;\n var bi = 0;\n while (offset < fetchSize) {\n var fb = blocksToFetch[bi];\n \n var data;\n if (thisB.bwg.uncompressBufSize > 0) {\n data = jszlib_inflate_buffer(result, offset + 2, fb.size - 2);\n } else {\n var tmp = new Uint8Array(fb.size); // FIXME is this really the best we can do?\n arrayCopy(new Uint8Array(result, offset, fb.size), 0, tmp, 0, fb.size);\n data = tmp.buffer;\n }\n fb.data = data;\n \n offset += fb.size;\n ++bi;\n }\n tramp();\n });\n }\n }\n }\n tramp();\n }\n}\n\nBigWigView.prototype.parseFeatures = function(data, createFeature, filter) {\n var ba = new Uint8Array(data);\n\n if (this.isSummary) {\n var sa = new Int16Array(data);\n var la = new Int32Array(data);\n var fa = new Float32Array(data);\n\n var itemCount = data.byteLength/32;\n for (var i = 0; i < itemCount; ++i) {\n var chromId = la[(i*8)];\n var start = la[(i*8)+1];\n var end = la[(i*8)+2];\n var validCnt = la[(i*8)+3];\n var minVal = fa[(i*8)+4];\n var maxVal = fa[(i*8)+5];\n var sumData = fa[(i*8)+6];\n var sumSqData = fa[(i*8)+7];\n \n if (filter(chromId, start + 1, end)) {\n var summaryOpts = {type: 'bigwig', score: sumData/validCnt, maxScore: maxVal};\n if (this.bwg.type == 'bigbed') {\n summaryOpts.type = 'density';\n }\n createFeature(chromId, start + 1, end, summaryOpts);\n }\n }\n } else if (this.bwg.type == 'bigwig') {\n var sa = new Int16Array(data);\n var la = new Int32Array(data);\n var fa = new Float32Array(data);\n\n var chromId = la[0];\n var blockStart = la[1];\n var blockEnd = la[2];\n var itemStep = la[3];\n var itemSpan = la[4];\n var blockType = ba[20];\n var itemCount = sa[11];\n \n if (blockType == BIG_WIG_TYPE_FSTEP) {\n for (var i = 0; i < itemCount; ++i) {\n var score = fa[i + 6];\n var fmin = blockStart + (i*itemStep) + 1, fmax = blockStart + (i*itemStep) + itemSpan;\n if (filter(chromId, fmin, fmax))\n createFeature(chromId, fmin, fmax, {score: score});\n }\n } else if (blockType == BIG_WIG_TYPE_VSTEP) {\n for (var i = 0; i < itemCount; ++i) {\n var start = la[(i*2) + 6] + 1;\n var end = start + itemSpan - 1;\n var score = fa[(i*2) + 7];\n if (filter(chromId, start, end))\n createFeature(chromId, start, end, {score: score});\n }\n } else if (blockType == BIG_WIG_TYPE_GRAPH) {\n for (var i = 0; i < itemCount; ++i) {\n var start = la[(i*3) + 6] + 1;\n var end = la[(i*3) + 7];\n var score = fa[(i*3) + 8];\n if (start > end) {\n start = end;\n }\n if (filter(chromId, start, end))\n createFeature(chromId, start, end, {score: score});\n }\n } else {\n console.log('Currently not handling bwgType=' + blockType);\n }\n } else if (this.bwg.type == 'bigbed') {\n var offset = 0;\n var dfc = this.bwg.definedFieldCount;\n var schema = this.bwg.schema;\n\n while (offset < ba.length) {\n var chromId = (ba[offset+3]<<24) | (ba[offset+2]<<16) | (ba[offset+1]<<8) | (ba[offset+0]);\n var start = (ba[offset+7]<<24) | (ba[offset+6]<<16) | (ba[offset+5]<<8) | (ba[offset+4]);\n var end = (ba[offset+11]<<24) | (ba[offset+10]<<16) | (ba[offset+9]<<8) | (ba[offset+8]);\n offset += 12;\n var rest = '';\n while (true) {\n var ch = ba[offset++];\n if (ch != 0) {\n rest += String.fromCharCode(ch);\n } else {\n break;\n }\n }\n\n var featureOpts = {};\n \n var bedColumns;\n if (rest.length > 0) {\n bedColumns = rest.split('\\t');\n } else {\n bedColumns = [];\n }\n if (bedColumns.length > 0 && dfc > 3) {\n featureOpts.label = bedColumns[0];\n }\n if (bedColumns.length > 1 && dfc > 4) {\n var score = parseInt(bedColumns[1]);\n if (!isNaN(score))\n featureOpts.score = score;\n }\n if (bedColumns.length > 2 && dfc > 5) {\n featureOpts.orientation = bedColumns[2];\n }\n if (bedColumns.length > 5 && dfc > 8) {\n var color = bedColumns[5];\n if (BED_COLOR_REGEXP.test(color)) {\n featureOpts.itemRgb = 'rgb(' + color + ')';\n }\n }\n\n if (bedColumns.length > dfc-3 && schema) {\n for (var col = dfc - 3; col < bedColumns.length; ++col) {\n featureOpts[schema.fields[col+3].name] = bedColumns[col];\n }\n }\n\n if (filter(chromId, start + 1, end, bedColumns)) {\n if (dfc < 12) {\n createFeature(chromId, start + 1, end, featureOpts);\n } else {\n var thickStart = bedColumns[3]|0;\n var thickEnd = bedColumns[4]|0;\n var blockCount = bedColumns[6]|0;\n var blockSizes = bedColumns[7].split(',');\n var blockStarts = bedColumns[8].split(',');\n\n if (featureOpts.exonFrames) {\n var exonFrames = featureOpts.exonFrames.split(',');\n featureOpts.exonFrames = undefined;\n }\n \n featureOpts.type = 'transcript'\n var grp = new DASGroup();\n for (var k in featureOpts) {\n grp[k] = featureOpts[k];\n }\n grp.id = bedColumns[0];\n grp.segment = this.bwg.idsToChroms[chromId];\n grp.min = start + 1;\n grp.max = end;\n grp.notes = [];\n featureOpts.groups = [grp];\n\n // Moving towards using bigGenePred model, but will\n // still support old Dalliance-style BED12+gene-name for the\n // foreseeable future.\n if (bedColumns.length > 9) {\n var geneId = featureOpts.geneName || bedColumns[9];\n var geneName = geneId;\n if (bedColumns.length > 10) {\n geneName = bedColumns[10];\n }\n if (featureOpts.geneName2)\n geneName = featureOpts.geneName2;\n\n var gg = shallowCopy(grp);\n gg.id = geneId;\n gg.label = geneName;\n gg.type = 'gene';\n featureOpts.groups.push(gg);\n }\n\n var spanList = [];\n for (var b = 0; b < blockCount; ++b) {\n var bmin = (blockStarts[b]|0) + start;\n var bmax = bmin + (blockSizes[b]|0);\n var span = new Range(bmin, bmax);\n spanList.push(span);\n }\n var spans = union(spanList);\n \n var tsList = spans.ranges();\n for (var s = 0; s < tsList.length; ++s) {\n var ts = tsList[s];\n createFeature(chromId, ts.min() + 1, ts.max(), featureOpts);\n }\n\n if (thickEnd > thickStart) {\n var codingRegion = (featureOpts.orientation == '+') ?\n new Range(thickStart, thickEnd + 3) :\n new Range(thickStart - 3, thickEnd);\n // +/- 3 to account for stop codon\n\n var tl = intersection(spans, codingRegion);\n if (tl) {\n featureOpts.type = 'translation';\n var tlList = tl.ranges();\n var readingFrame = 0;\n\n var tlOffset = 0;\n while (tlList[0].min() > tsList[tlOffset].max())\n tlOffset++;\n\n for (var s = 0; s < tlList.length; ++s) {\n // Record reading frame for every exon\n var index = s;\n if (featureOpts.orientation == '-')\n index = tlList.length - s - 1;\n var ts = tlList[index];\n featureOpts.readframe = readingFrame;\n if (exonFrames) {\n var brf = parseInt(exonFrames[index + tlOffset]);\n if (typeof(brf) === 'number' && brf >= 0 && brf <= 2) {\n featureOpts.readframe = brf;\n featureOpts.readframeExplicit = true;\n }\n }\n var length = ts.max() - ts.min();\n readingFrame = (readingFrame + length) % 3;\n createFeature(chromId, ts.min() + 1, ts.max(), featureOpts);\n }\n }\n }\n }\n }\n }\n } else {\n throw Error(\"Don't know what to do with \" + this.bwg.type);\n }\n}\n\n//\n// nasty cut/paste, should roll back in!\n//\n\nBigWigView.prototype.getFirstAdjacent = function(chrName, pos, dir, callback) {\n var chr = this.bwg.chromsToIDs[chrName];\n if (chr === undefined) {\n // Not an error because some .bwgs won't have data for all chromosomes.\n return callback([]);\n } else {\n this.getFirstAdjacentById(chr, pos, dir, callback);\n }\n}\n\nBigWigView.prototype.getFirstAdjacentById = function(chr, pos, dir, callback) {\n var thisB = this;\n if (!this.cirHeader) {\n this.bwg.data.slice(this.cirTreeOffset, 48).fetch(function(result) {\n thisB.cirHeader = result;\n var la = new Int32Array(thisB.cirHeader);\n thisB.cirBlockSize = la[1];\n thisB.getFirstAdjacentById(chr, pos, dir, callback);\n });\n return;\n }\n\n var blockToFetch = null;\n var bestBlockChr = -1;\n var bestBlockOffset = -1;\n\n var outstanding = 0;\n\n var beforeBWG = Date.now();\n\n var cirFobRecur = function(offset, level) {\n outstanding += offset.length;\n\n var maxCirBlockSpan = 4 + (thisB.cirBlockSize * 32); // Upper bound on size, based on a completely full leaf node.\n var spans;\n for (var i = 0; i < offset.length; ++i) {\n var blockSpan = new Range(offset[i], offset[i] + maxCirBlockSpan);\n spans = spans ? union(spans, blockSpan) : blockSpan;\n }\n \n var fetchRanges = spans.ranges();\n for (var r = 0; r < fetchRanges.length; ++r) {\n var fr = fetchRanges[r];\n cirFobStartFetch(offset, fr, level);\n }\n }\n\n var cirFobStartFetch = function(offset, fr, level, attempts) {\n var length = fr.max() - fr.min();\n thisB.bwg.data.slice(fr.min(), fr.max() - fr.min()).fetch(function(resultBuffer) {\n for (var i = 0; i < offset.length; ++i) {\n if (fr.contains(offset[i])) {\n cirFobRecur2(resultBuffer, offset[i] - fr.min(), level);\n --outstanding;\n if (outstanding == 0) {\n if (!blockToFetch) {\n if (dir > 0 && (chr != 0 || pos > 0)) {\n return thisB.getFirstAdjacentById(0, 0, dir, callback);\n } else if (dir < 0 && (chr != thisB.bwg.maxID || pos < 1000000000)) {\n return thisB.getFirstAdjacentById(thisB.bwg.maxID, 1000000000, dir, callback);\n }\n return callback([]);\n }\n\n thisB.fetchFeatures(function(chrx, fmin, fmax, toks) {\n return (dir < 0 && (chrx < chr || fmax < pos)) || (dir > 0 && (chrx > chr || fmin > pos));\n }, [blockToFetch], function(features) {\n var bestFeature = null;\n var bestChr = -1;\n var bestPos = -1;\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n var chrx = f._chromId, fmin = f.min, fmax = f.max;\n if (bestFeature == null || ((dir < 0) && (chrx > bestChr || fmax > bestPos)) || ((dir > 0) && (chrx < bestChr || fmin < bestPos))) {\n bestFeature = f;\n bestPos = (dir < 0) ? fmax : fmin;\n bestChr = chrx;\n }\n }\n\n if (bestFeature != null) \n return callback([bestFeature]);\n else\n return callback([]);\n });\n }\n }\n }\n });\n }\n\n var cirFobRecur2 = function(cirBlockData, offset, level) {\n var ba = new Uint8Array(cirBlockData);\n var sa = new Int16Array(cirBlockData);\n var la = new Int32Array(cirBlockData);\n\n var isLeaf = ba[offset];\n var cnt = sa[offset/2 + 1];\n offset += 4;\n\n if (isLeaf != 0) {\n for (var i = 0; i < cnt; ++i) {\n var lo = offset/4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = bwg_readOffset(ba, offset+16);\n var blockSize = bwg_readOffset(ba, offset+24);\n if ((dir < 0 && ((startChrom < chr || (startChrom == chr && startBase <= pos)))) ||\n (dir > 0 && ((endChrom > chr || (endChrom == chr && endBase >= pos)))))\n {\n // console.log('Got an interesting block: startBase=' + startChrom + ':' + startBase + '; endBase=' + endChrom + ':' + endBase + '; offset=' + blockOffset + '; size=' + blockSize);\n if (/_random/.exec(thisB.bwg.idsToChroms[startChrom])) {\n // dlog('skipping random: ' + thisB.bwg.idsToChroms[startChrom]);\n } else if (blockToFetch == null || ((dir < 0) && (endChrom > bestBlockChr || (endChrom == bestBlockChr && endBase > bestBlockOffset)) ||\n (dir > 0) && (startChrom < bestBlockChr || (startChrom == bestBlockChr && startBase < bestBlockOffset))))\n {\n // dlog('best is: startBase=' + startChrom + ':' + startBase + '; endBase=' + endChrom + ':' + endBase + '; offset=' + blockOffset + '; size=' + blockSize);\n blockToFetch = {offset: blockOffset, size: blockSize};\n bestBlockOffset = (dir < 0) ? endBase : startBase;\n bestBlockChr = (dir < 0) ? endChrom : startChrom;\n }\n }\n offset += 32;\n }\n } else {\n var bestRecur = -1;\n var bestPos = -1;\n var bestChr = -1;\n for (var i = 0; i < cnt; ++i) {\n var lo = offset/4;\n var startChrom = la[lo];\n var startBase = la[lo + 1];\n var endChrom = la[lo + 2];\n var endBase = la[lo + 3];\n var blockOffset = (la[lo + 4]<<32) | (la[lo + 5]);\n if ((dir < 0 && ((startChrom < chr || (startChrom == chr && startBase <= pos)) &&\n (endChrom >= chr))) ||\n (dir > 0 && ((endChrom > chr || (endChrom == chr && endBase >= pos)) &&\n (startChrom <= chr))))\n {\n if (bestRecur < 0 || endBase > bestPos) {\n bestRecur = blockOffset;\n bestPos = (dir < 0) ? endBase : startBase;\n bestChr = (dir < 0) ? endChrom : startChrom;\n }\n }\n offset += 24;\n }\n if (bestRecur >= 0) {\n cirFobRecur([bestRecur], level + 1);\n }\n }\n };\n \n\n cirFobRecur([thisB.cirTreeOffset + 48], 1);\n}\n\nBigWig.prototype.readWigData = function(chrName, min, max, callback) {\n this.getUnzoomedView().readWigData(chrName, min, max, callback);\n}\n\nBigWig.prototype.getUnzoomedView = function() {\n if (!this.unzoomedView) {\n var cirLen = 4000;\n var nzl = this.zoomLevels[0];\n if (nzl) {\n cirLen = this.zoomLevels[0].dataOffset - this.unzoomedIndexOffset;\n }\n this.unzoomedView = new BigWigView(this, this.unzoomedIndexOffset, cirLen, false);\n }\n return this.unzoomedView;\n}\n\nBigWig.prototype.getZoomedView = function(z) {\n var zh = this.zoomLevels[z];\n if (!zh.view) {\n zh.view = new BigWigView(this, zh.indexOffset, /* this.zoomLevels[z + 1].dataOffset - zh.indexOffset */ 4000, true);\n }\n return zh.view;\n}\n\nfunction makeBwg(data, callback, name) {\n var bwg = new BigWig();\n bwg.data = data;\n bwg.name = name;\n bwg.data.slice(0, 512).salted().fetch(function(result) {\n if (!result) {\n return callback(null, \"Couldn't fetch file\");\n }\n\n var header = result;\n var ba = new Uint8Array(header);\n var sa = new Int16Array(header);\n var la = new Int32Array(header);\n var magic = ba[0] + (M1 * ba[1]) + (M2 * ba[2]) + (M3 * ba[3]);\n if (magic == BIG_WIG_MAGIC) {\n bwg.type = 'bigwig';\n } else if (magic == BIG_BED_MAGIC) {\n bwg.type = 'bigbed';\n } else if (magic == BIG_WIG_MAGIC_BE || magic == BIG_BED_MAGIC_BE) {\n return callback(null, \"Currently don't support big-endian BBI files\");\n \n } else {\n return callback(null, \"Not a supported format, magic=0x\" + magic.toString(16));\n \n }\n\n bwg.version = sa[2]; // 4\n bwg.numZoomLevels = sa[3]; // 6\n bwg.chromTreeOffset = bwg_readOffset(ba, 8);\n bwg.unzoomedDataOffset = bwg_readOffset(ba, 16);\n bwg.unzoomedIndexOffset = bwg_readOffset(ba, 24);\n bwg.fieldCount = sa[16]; // 32\n bwg.definedFieldCount = sa[17]; // 34\n bwg.asOffset = bwg_readOffset(ba, 36);\n bwg.totalSummaryOffset = bwg_readOffset(ba, 44);\n bwg.uncompressBufSize = la[13]; // 52\n bwg.extHeaderOffset = bwg_readOffset(ba, 56);\n\n bwg.zoomLevels = [];\n for (var zl = 0; zl < bwg.numZoomLevels; ++zl) {\n var zlReduction = la[zl*6 + 16]\n var zlData = bwg_readOffset(ba, zl*24 + 72);\n var zlIndex = bwg_readOffset(ba, zl*24 + 80);\n bwg.zoomLevels.push({reduction: zlReduction, dataOffset: zlData, indexOffset: zlIndex});\n }\n\n bwg.readChromTree(function() {\n bwg.getAutoSQL(function(as) {\n bwg.schema = as;\n return callback(bwg);\n });\n });\n }, {timeout: 5000}); // Potential timeout on first request to catch mixed-content errors on\n // Chromium.\n}\n\n\nBigWig.prototype._tsFetch = function(zoom, chr, min, max, callback) {\n var bwg = this;\n if (zoom >= this.zoomLevels.length - 1) {\n if (!this.topLevelReductionCache) {\n this.getZoomedView(this.zoomLevels.length - 1).readWigDataById(-1, 0, 300000000, function(feats) {\n bwg.topLevelReductionCache = feats;\n return bwg._tsFetch(zoom, chr, min, max, callback);\n });\n } else {\n var f = [];\n var c = this.topLevelReductionCache;\n for (var fi = 0; fi < c.length; ++fi) {\n if (c[fi]._chromId == chr) {\n f.push(c[fi]);\n }\n }\n return callback(f);\n }\n } else {\n var view;\n if (zoom < 0) {\n view = this.getUnzoomedView();\n } else {\n view = this.getZoomedView(zoom);\n }\n return view.readWigDataById(chr, min, max, callback);\n }\n}\n\nBigWig.prototype.thresholdSearch = function(chrName, referencePoint, dir, threshold, callback) {\n dir = (dir<0) ? -1 : 1;\n var bwg = this;\n var initialChr = this.chromsToIDs[chrName];\n var candidates = [{chrOrd: 0, chr: initialChr, zoom: bwg.zoomLevels.length - 4, min: 0, max: 300000000, fromRef: true}]\n for (var i = 1; i <= this.maxID + 1; ++i) {\n var chrId = (initialChr + (dir*i)) % (this.maxID + 1);\n if (chrId < 0) \n chrId += (this.maxID + 1);\n candidates.push({chrOrd: i, chr: chrId, zoom: bwg.zoomLevels.length - 1, min: 0, max: 300000000})\n }\n \n function fbThresholdSearchRecur() {\n \tif (candidates.length == 0) {\n \t return callback(null);\n \t}\n \tcandidates.sort(function(c1, c2) {\n \t var d = c1.zoom - c2.zoom;\n \t if (d != 0)\n \t\t return d;\n\n d = c1.chrOrd - c2.chrOrd;\n if (d != 0)\n return d;\n \t else\n \t\t return c1.min - c2.min * dir;\n \t});\n\n\t var candidate = candidates.splice(0, 1)[0];\n bwg._tsFetch(candidate.zoom, candidate.chr, candidate.min, candidate.max, function(feats) {\n var rp = dir > 0 ? 0 : 300000000;\n if (candidate.fromRef)\n rp = referencePoint;\n \n for (var fi = 0; fi < feats.length; ++fi) {\n \t var f = feats[fi];\n var score;\n if (f.maxScore != undefined)\n score = f.maxScore;\n else\n score = f.score;\n\n if (dir > 0) {\n \t if (score > threshold) {\n \t\t if (candidate.zoom < 0) {\n \t\t if (f.min > rp)\n return callback(f);\n \t\t } else if (f.max > rp) {\n \t\t candidates.push({chr: candidate.chr, chrOrd: candidate.chrOrd, zoom: candidate.zoom - 2, min: f.min, max: f.max, fromRef: candidate.fromRef});\n \t\t }\n }\n } else {\n if (score > threshold) {\n \t\t if (candidate.zoom < 0) {\n \t if (f.max < rp)\n \t\t\t return callback(f);\n } else if (f.min < rp) {\n candidates.push({chr: candidate.chr, chrOrd: candidate.chrOrd, zoom: candidate.zoom - 2, min: f.min, max: f.max, fromRef: candidate.fromRef});\n }\n \t }\n }\n \t }\n fbThresholdSearchRecur();\n });\n }\n \n fbThresholdSearchRecur();\n}\n\nBigWig.prototype.getAutoSQL = function(callback) {\n var thisB = this;\n if (!this.asOffset)\n return callback(null);\n\n\n this.data.slice(this.asOffset, 2048).fetch(function(result) {\n var ba = new Uint8Array(result);\n var s = '';\n for (var i = 0; i < ba.length; ++i) {\n if (ba[i] == 0)\n break;\n s += String.fromCharCode(ba[i]);\n }\n \n /* \n * Quick'n'dirty attempt to parse autoSql format.\n * See: http://www.linuxjournal.com/files/linuxjournal.com/linuxjournal/articles/059/5949/5949l2.html\n */\n\n var header_re = /(\\w+)\\s+(\\w+)\\s+(\"([^\"]+)\")?\\s+\\(\\s*/;\n var field_re = /([\\w\\[\\]]+)\\s+(\\w+)\\s*;\\s*(\"([^\"]+)\")?\\s*/g;\n\n var headerMatch = header_re.exec(s);\n if (headerMatch) {\n var as = {\n declType: headerMatch[1],\n name: headerMatch[2],\n comment: headerMatch[4],\n\n fields: []\n };\n\n s = s.substring(headerMatch[0]);\n for (var m = field_re.exec(s); m != null; m = field_re.exec(s)) {\n as.fields.push({type: m[1],\n name: m[2],\n comment: m[4]});\n }\n\n return callback(as);\n }\n });\n}\n\nBigWig.prototype.getExtraIndices = function(callback) {\n var thisB = this;\n if (this.version < 4 || this.extHeaderOffset == 0 || this.type != 'bigbed') {\n return callback(null);\n } else {\n this.data.slice(this.extHeaderOffset, 64).fetch(function(result) {\n if (!result) {\n return callback(null, \"Couldn't fetch extension header\");\n }\n\n var ba = new Uint8Array(result);\n var sa = new Int16Array(result);\n var la = new Int32Array(result);\n \n var extHeaderSize = sa[0];\n var extraIndexCount = sa[1];\n var extraIndexListOffset = bwg_readOffset(ba, 4);\n\n if (extraIndexCount == 0) {\n return callback(null);\n }\n\n // FIXME 20byte records only make sense for single-field indices.\n // Right now, these seem to be the only things around, but the format\n // is actually more general.\n thisB.data.slice(extraIndexListOffset, extraIndexCount * 20).fetch(function(eil) {\n if (!eil) {\n return callback(null, \"Couldn't fetch index info\");\n }\n\n var ba = new Uint8Array(eil);\n var sa = new Int16Array(eil);\n var la = new Int32Array(eil);\n\n var indices = [];\n for (var ii = 0; ii < extraIndexCount; ++ii) {\n var eiType = sa[ii*10];\n var eiFieldCount = sa[ii*10 + 1];\n var eiOffset = bwg_readOffset(ba, ii*20 + 4);\n var eiField = sa[ii*10 + 8]\n var index = new BBIExtraIndex(thisB, eiType, eiFieldCount, eiOffset, eiField);\n indices.push(index);\n }\n callback(indices);\n });\n });\n }\n}\n\nfunction BBIExtraIndex(bbi, type, fieldCount, offset, field) {\n this.bbi = bbi;\n this.type = type;\n this.fieldCount = fieldCount;\n this.offset = offset;\n this.field = field;\n}\n\nBBIExtraIndex.prototype.lookup = function(name, callback) {\n var thisB = this;\n\n this.bbi.data.slice(this.offset, 32).fetch(function(bpt) {\n var ba = new Uint8Array(bpt);\n var sa = new Int16Array(bpt);\n var la = new Int32Array(bpt);\n var bptMagic = la[0];\n var blockSize = la[1];\n var keySize = la[2];\n var valSize = la[3];\n var itemCount = bwg_readOffset(ba, 16);\n var rootNodeOffset = 32;\n\n function bptReadNode(nodeOffset) {\n thisB.bbi.data.slice(nodeOffset, 4 + (blockSize * (keySize + valSize))).fetch(function(node) {\n var ba = new Uint8Array(node);\n var sa = new Uint16Array(node);\n var la = new Uint32Array(node);\n\n var nodeType = ba[0];\n var cnt = sa[1];\n\n var offset = 4;\n if (nodeType == 0) {\n var lastChildOffset = null;\n for (var n = 0; n < cnt; ++n) {\n var key = '';\n for (var ki = 0; ki < keySize; ++ki) {\n var charCode = ba[offset++];\n if (charCode != 0) {\n key += String.fromCharCode(charCode);\n }\n }\n\n var childOffset = bwg_readOffset(ba, offset);\n offset += 8;\n \n if (name.localeCompare(key) < 0 && lastChildOffset) {\n bptReadNode(lastChildOffset);\n return;\n }\n lastChildOffset = childOffset;\n }\n bptReadNode(lastChildOffset);\n } else {\n for (var n = 0; n < cnt; ++n) {\n var key = '';\n for (var ki = 0; ki < keySize; ++ki) {\n var charCode = ba[offset++];\n if (charCode != 0) {\n key += String.fromCharCode(charCode);\n }\n }\n \n // Specific for EI case.\n if (key == name) {\n var start = bwg_readOffset(ba, offset);\n var length = readInt(ba, offset + 8);\n\n return thisB.bbi.getUnzoomedView().fetchFeatures(\n function(chr, min, max, toks) {\n if (toks && toks.length > thisB.field - 3)\n return toks[thisB.field - 3] == name;\n }, \n [{offset: start, size: length}], \n callback);\n }\n offset += valSize;\n }\n return callback([]);\n }\n });\n }\n\n bptReadNode(thisB.offset + rootNodeOffset);\n });\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n makeBwg: makeBwg,\n BIG_BED_MAGIC: BIG_BED_MAGIC,\n BIG_WIG_MAGIC: BIG_WIG_MAGIC\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// bin.js general binary data support\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var sha1 = require('./sha1');\n var b64_sha1 = sha1.b64_sha1;\n\n var Promise = require('es6-promise').Promise;\n}\n\nfunction BlobFetchable(b) {\n this.blob = b;\n}\n\nBlobFetchable.prototype.slice = function(start, length) {\n var b;\n\n if (this.blob.slice) {\n if (length) {\n b = this.blob.slice(start, start + length);\n } else {\n b = this.blob.slice(start);\n }\n } else {\n if (length) {\n b = this.blob.webkitSlice(start, start + length);\n } else {\n b = this.blob.webkitSlice(start);\n }\n }\n return new BlobFetchable(b);\n}\n\nBlobFetchable.prototype.salted = function() {return this;}\n\nif (typeof(FileReader) !== 'undefined') {\n // console.log('defining async BlobFetchable.fetch');\n\n BlobFetchable.prototype.fetch = function(callback) {\n var reader = new FileReader();\n reader.onloadend = function(ev) {\n callback(bstringToBuffer(reader.result));\n };\n reader.readAsBinaryString(this.blob);\n }\n\n} else {\n // if (console && console.log)\n // console.log('defining sync BlobFetchable.fetch');\n\n BlobFetchable.prototype.fetch = function(callback) {\n var reader = new FileReaderSync();\n try {\n var res = reader.readAsArrayBuffer(this.blob);\n callback(res);\n } catch (e) {\n callback(null, e);\n }\n }\n}\n\nfunction URLFetchable(url, start, end, opts) {\n if (!opts) {\n if (typeof start === 'object') {\n opts = start;\n start = undefined;\n } else {\n opts = {};\n }\n }\n\n this.url = url;\n this.start = start || 0;\n if (end) {\n this.end = end;\n }\n this.opts = opts;\n}\n\nURLFetchable.prototype.slice = function(s, l) {\n if (s < 0) {\n throw 'Bad slice ' + s;\n }\n\n var ns = this.start, ne = this.end;\n if (ns && s) {\n ns = ns + s;\n } else {\n ns = s || ns;\n }\n if (l && ns) {\n ne = ns + l - 1;\n } else {\n ne = ne || l - 1;\n }\n return new URLFetchable(this.url, ns, ne, this.opts);\n}\n\nvar seed=0;\nvar isSafari = typeof(navigator) !== 'undefined' &&\n navigator.userAgent.indexOf('Safari') >= 0 &&\n navigator.userAgent.indexOf('Chrome') < 0 ;\n\nURLFetchable.prototype.fetchAsText = function(callback) {\n var thisB = this;\n\n this.getURL().then(function(url) {\n try {\n var req = new XMLHttpRequest();\n var length;\n if ((isSafari || thisB.opts.salt) && url.indexOf('?') < 0) {\n url = url + '?salt=' + b64_sha1('' + Date.now() + ',' + (++seed));\n }\n req.open('GET', url, true);\n \n if (thisB.end) {\n if (thisB.end - thisB.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + thisB.start + '-' + thisB.end);\n length = thisB.end - thisB.start + 1;\n }\n\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status == 200 || req.status == 206) {\n return callback(req.responseText);\n } else {\n return callback(null);\n }\n }\n };\n if (thisB.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n } catch (e) {\n return callback(null);\n }\n }).catch(function(err) {\n console.log(err);\n return callback(null, err);\n });\n}\n\nURLFetchable.prototype.salted = function() {\n var o = shallowCopy(this.opts);\n o.salt = true;\n return new URLFetchable(this.url, this.start, this.end, o);\n}\n\nURLFetchable.prototype.getURL = function() {\n if (this.opts.resolver) {\n return this.opts.resolver(this.url).then(function (urlOrObj) {\n if (typeof urlOrObj === 'string') {\n return urlOrObj;\n } else {\n return urlOrObj.url;\n }\n });\n } else {\n return Promise.resolve(this.url);\n }\n}\n\nURLFetchable.prototype.fetch = function(callback, opts) {\n var thisB = this;\n \n opts = opts || {};\n var attempt = opts.attempt || 1;\n var truncatedLength = opts.truncatedLength;\n if (attempt > 3) {\n return callback(null);\n }\n\n this.getURL().then(function(url) {\n try {\n var timeout;\n if (opts.timeout && !thisB.opts.credentials) {\n timeout = setTimeout(\n function() {\n console.log('timing out ' + url);\n req.abort();\n return callback(null, 'Timeout');\n },\n opts.timeout\n );\n }\n \n var req = new XMLHttpRequest();\n var length;\n if ((isSafari || thisB.opts.salt) && url.indexOf('?') < 0) {\n url = url + '?salt=' + b64_sha1('' + Date.now() + ',' + (++seed));\n }\n req.open('GET', url, true);\n req.overrideMimeType('text/plain; charset=x-user-defined');\n if (thisB.end) {\n if (thisB.end - thisB.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + thisB.start + '-' + thisB.end);\n length = thisB.end - thisB.start + 1;\n }\n req.responseType = 'arraybuffer';\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (timeout)\n clearTimeout(timeout);\n if (req.status == 200 || req.status == 206) {\n if (req.response) {\n var bl = req.response.byteLength;\n if (length && length != bl && (!truncatedLength || bl != truncatedLength)) {\n return thisB.fetch(callback, {attempt: attempt + 1, truncatedLength: bl});\n } else {\n return callback(req.response);\n }\n } else if (req.mozResponseArrayBuffer) {\n return callback(req.mozResponseArrayBuffer);\n } else {\n var r = req.responseText;\n if (length && length != r.length && (!truncatedLength || r.length != truncatedLength)) {\n return thisB.fetch(callback, {attempt: attempt + 1, truncatedLength: r.length});\n } else {\n return callback(bstringToBuffer(req.responseText));\n }\n }\n } else {\n return thisB.fetch(callback, {attempt: attempt + 1});\n }\n }\n };\n if (thisB.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n } catch (e) {\n return callback(null);\n }\n }).catch(function(err) {\n console.log(err);\n return callback(null, err);\n });\n}\n \nfunction bstringToBuffer(result) {\n if (!result) {\n return null;\n }\n\n var ba = new Uint8Array(result.length);\n for (var i = 0; i < ba.length; ++i) {\n ba[i] = result.charCodeAt(i);\n }\n return ba.buffer;\n}\n\n// Read from Uint8Array\n\nvar convertBuffer = new ArrayBuffer(8);\nvar ba = new Uint8Array(convertBuffer);\nvar fa = new Float32Array(convertBuffer);\n\nfunction readFloat(buf, offset) {\n ba[0] = buf[offset];\n ba[1] = buf[offset+1];\n ba[2] = buf[offset+2];\n ba[3] = buf[offset+3];\n return fa[0];\n}\n\nfunction readInt64(ba, offset) {\n return (ba[offset + 7] << 24) | (ba[offset + 6] << 16) | (ba[offset + 5] << 8) | (ba[offset + 4]);\n}\n\nfunction readInt(ba, offset) {\n return (ba[offset + 3] << 24) | (ba[offset + 2] << 16) | (ba[offset + 1] << 8) | (ba[offset]);\n}\n\nfunction readShort(ba, offset) {\n return (ba[offset + 1] << 8) | (ba[offset]);\n}\n\nfunction readByte(ba, offset) {\n return ba[offset];\n}\n\nfunction readIntBE(ba, offset) {\n return (ba[offset] << 24) | (ba[offset + 1] << 16) | (ba[offset + 2] << 8) | (ba[offset + 3]);\n}\n\n// Exports if we are being used as a module\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n BlobFetchable: BlobFetchable,\n URLFetchable: URLFetchable,\n\n readInt: readInt,\n readIntBE: readIntBE,\n readInt64: readInt64,\n readShort: readShort,\n readByte: readByte,\n readFloat: readFloat\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// browser-us.js: standard UI wiring\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n\n var nf = require('./numformats');\n var formatLongInt = nf.formatLongInt;\n\n var makeZoomSlider = require('./zoomslider');\n\n // For side effects\n\n require('./tier-edit');\n require('./export-config');\n require('./export-ui');\n require('./export-image');\n require('./svg-export');\n require('./session');\n}\n\n/*\n * Quite a bit of this ought to be done using a templating system, but\n * since web-components isn't quite ready for prime time yet we'll stick\n * with constructing it all in Javascript for now...\n */\n\nBrowser.prototype.initUI = function(holder, genomePanel) {\n if (!this.noSourceCSS) {\n ['bootstrap-scoped.css', 'dalliance-scoped.css', 'font-awesome.min.css'].forEach(function(path) {\n document.head.appendChild(makeElement('link', '', {\n rel: 'stylesheet',\n href: this.resolveURL('$$css/' + path)\n }));\n }.bind(this));\n }\n\n var b = this;\n\n if (!b.disableDefaultFeaturePopup) {\n this.addFeatureListener(function(ev, feature, hit, tier) {\n b.featurePopup(ev, feature, hit, tier);\n });\n }\n\n holder.classList.add('dalliance');\n var toolbar = b.toolbar = makeElement('div', null, {className: 'btn-toolbar toolbar'});\n\n var title = b.coordSystem.speciesName + ' ' + b.nameForCoordSystem(b.coordSystem);\n if (this.setDocumentTitle) {\n document.title = title + ' :: dalliance';\n }\n\n var locField = makeElement('input', '', {className: 'loc-field'});\n b.makeTooltip(locField, 'Enter a genomic location or gene name');\n var locStatusField = makeElement('p', '', {className: 'loc-status'});\n\n var zoomInBtn = makeElement('a', [makeElement('i', null, {className: 'fa fa-search-plus'})], {className: 'btn'});\n var zoomSlider = new makeZoomSlider({width: b.zoomSliderWidth});\n b.makeTooltip(zoomSlider, \"Highlighted button shows current zoom level, gray button shows inactive zoom level (click or tap SPACE to toggle).\")\n\n var zoomOutBtn = makeElement('a', [makeElement('i', null, {className: 'fa fa-search-minus'})], {className: 'btn'});\n\n var clearHighlightsButton = makeElement('a', [makeElement('i', null, {className: 'fa fa-eraser'})], {className: 'btn'});\n\n var addTrackBtn = makeElement('a', [makeElement('i', null, {className: 'fa fa-plus'})], {className: 'btn'});\n var favBtn = makeElement('a', [makeElement('i', null, {className: 'fa fa-bookmark'})], {className: 'btn'});\n var svgBtn = makeElement('a', [makeElement('i', null, {className: 'fa fa-print'})], {className: 'btn'});\n var resetBtn = makeElement('a', [makeElement('i', null, {className: 'fa fa-refresh'})], {className: 'btn'});\n var optsButton = makeElement('a', [makeElement('i', null, {className: 'fa fa-cogs'})], {className: 'btn'});\n var helpButton = makeElement('a', [makeElement('i', null, {className: 'fa fa-question'})], {className: 'btn'});\n\n var tierEditButton = makeElement('a', [makeElement('i', null, {className: 'fa fa-road'})], {className: 'btn'});\n b.makeTooltip(tierEditButton, 'Configure currently selected track(s) (E)')\n\n var leapLeftButton = makeElement('a', [makeElement('i', null, {className: 'fa fa-angle-left'})], {className: 'btn'}, {width: '5px'});\n var leapRightButton = makeElement('a', [makeElement('i', null, {className: 'fa fa-angle-right'})], {className: 'btn pull-right'}, {width: '5px'});\n\n var modeButtons = makeElement('div', null, {className: 'btn-group pull-right'});\n if (!this.noTrackAdder)\n modeButtons.appendChild(addTrackBtn);\n if (!this.noTrackEditor)\n modeButtons.appendChild(tierEditButton);\n if (!this.noExport)\n modeButtons.appendChild(svgBtn);\n if (!this.noOptions)\n modeButtons.appendChild(optsButton);\n if (!this.noHelp)\n modeButtons.appendChild(helpButton);\n\n this.setUiMode = function(m) {\n this.uiMode = m;\n var mb = {help: helpButton, add: addTrackBtn, opts: optsButton, 'export': svgBtn, tier: tierEditButton};\n for (var x in mb) {\n if (x == m)\n mb[x].classList.add('active');\n else\n mb[x].classList.remove('active');\n }\n }\n\n if (!this.noLeapButtons)\n toolbar.appendChild(leapRightButton);\n\n if (modeButtons.firstChild)\n toolbar.appendChild(modeButtons);\n \n if (!this.noLeapButtons)\n toolbar.appendChild(leapLeftButton);\n if (!this.noTitle) {\n toolbar.appendChild(makeElement('div', makeElement('h4', title, {}, {margin: '0px'}), {className: 'btn-group title'}));\n }\n if (!this.noLocationField)\n toolbar.appendChild(makeElement('div', [locField, locStatusField], {className: 'btn-group loc-group'}));\n if (!this.noClearHighlightsButton)\n toolbar.appendChild(clearHighlightsButton);\n\n if (!this.noZoomSlider) {\n toolbar.appendChild(makeElement('div', [zoomInBtn,\n makeElement('span', zoomSlider, {className: 'btn'}),\n zoomOutBtn], {className: 'btn-group'}));\n }\n \n if (this.toolbarBelow) {\n holder.appendChild(genomePanel);\n holder.appendChild(toolbar);\n } else {\n holder.appendChild(toolbar);\n holder.appendChild(genomePanel);\n }\n\n\n var lt2 = Math.log(2) / Math.log(10);\n var lt5 = Math.log(5) / Math.log(10);\n var roundSliderValue = function(x) {\n var ltx = (x / b.zoomExpt + Math.log(b.zoomBase)) / Math.log(10);\n \n var whole = ltx|0\n var frac = ltx - whole;\n var rounded\n\n if (frac < 0.01)\n rounded = whole;\n else if (frac <= (lt2 + 0.01))\n rounded = whole + lt2;\n else if (frac <= (lt5 + 0.01))\n rounded = whole + lt5;\n else {\n rounded = whole + 1;\n }\n\n return (rounded * Math.log(10) -Math.log(b.zoomBase)) * b.zoomExpt;\n }\n\n var markSlider = function(x) {\n zoomSlider.addLabel(x, humanReadableScale(Math.exp(x / b.zoomExpt) * b.zoomBase));\n }\n\n this.addViewListener(function(chr, min, max, _oldZoom, zoom) {\n locField.value = (chr + ':' + formatLongInt(min) + '..' + formatLongInt(max));\n zoomSlider.min = zoom.min|0;\n zoomSlider.max = zoom.max|0;\n if (zoom.isSnapZooming) {\n zoomSlider.value = zoom.alternate\n zoomSlider.value2 = zoom.current;\n zoomSlider.active = 2;\n } else {\n zoomSlider.value = zoom.current;\n zoomSlider.value2 = zoom.alternate;\n zoomSlider.active = 1;\n }\n\n if (zoom.current == zoom.min)\n zoomInBtn.classList.add('disabled');\n else\n zoomInBtn.classList.remove('disabled');\n\n if (zoom.current == zoom.max)\n zoomOutBtn.classList.add('disabled');\n else\n zoomOutBtn.classList.remove('disabled');\n\n zoomSlider.removeLabels();\n var zmin = zoom.min;\n var zmax = zoom.max;\n var zrange = zmax - zmin;\n\n \n var numSliderTicks = 4;\n if (b.zoomSliderWidth && b.zoomSliderWidth < 150)\n numSliderTicks = 3;\n markSlider(roundSliderValue(zmin));\n for (var sti = 1; sti < numSliderTicks - 1; ++sti) {\n markSlider(roundSliderValue(zmin + (1.0 * sti * zrange / (numSliderTicks -1))));\n }\n markSlider(roundSliderValue(zmax));\n\n if (b.storeStatus) {\n b.storeViewStatus();\n }\n\n if (b.highlights.length > 0) {\n clearHighlightsButton.style.display = 'inline-block';\n } else {\n clearHighlightsButton.style.display = 'none';\n }\n });\n\n this.addTierListener(function() {\n if (b.storeStatus) {\n b.storeTierStatus();\n }\n });\n\n locField.addEventListener('keydown', function(ev) {\n if (ev.keyCode == 40) {\n ev.preventDefault(); ev.stopPropagation();\n b.setSelectedTier(0);\n } if (ev.keyCode == 10 || ev.keyCode == 13) {\n ev.preventDefault();\n\n\n var g = locField.value;\n b.search(g, function(err) {\n if (err) {\n locStatusField.textContent = '' + err;\n } else {\n locStatusField.textContent = '';\n }\n });\n }\n }, false);\n \n var trackAddPopup;\n addTrackBtn.addEventListener('click', function(ev) {\n if (trackAddPopup && trackAddPopup.displayed) {\n b.removeAllPopups();\n } else {\n trackAddPopup = b.showTrackAdder(ev);\n }\n }, false);\n b.makeTooltip(addTrackBtn, 'Add a new track from the registry or an indexed file. (A)');\n\n zoomInBtn.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n\n b.zoomStep(-10);\n }, false);\n b.makeTooltip(zoomInBtn, 'Zoom in (+)');\n\n zoomOutBtn.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n\n b.zoomStep(10);\n }, false);\n b.makeTooltip(zoomOutBtn, 'Zoom out (-)');\n\n zoomSlider.addEventListener('change', function(ev) {\n var wantSnap = zoomSlider.active == 2;\n if (wantSnap != b.isSnapZooming) {\n b.savedZoom = b.zoomSliderValue - b.zoomMin;\n b.isSnapZooming = wantSnap;\n }\n var activeZSV = zoomSlider.active == 1 ? zoomSlider.value : zoomSlider.value2;\n\n \tb.zoomSliderValue = (1.0 * activeZSV);\n \tb.zoom(Math.exp((1.0 * activeZSV) / b.zoomExpt));\n }, false);\n\n favBtn.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n }, false);\n b.makeTooltip(favBtn, 'Favourite regions');\n\n svgBtn.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n b.openExportPanel();\n }, false);\n b.makeTooltip(svgBtn, 'Export publication-quality SVG. (X)');\n\n var optsPopup;\n optsButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n\n b.toggleOptsPopup(ev);\n }, false);\n b.makeTooltip(optsButton, 'Configure options.');\n\n helpButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n b.toggleHelpPopup(ev);\n });\n b.makeTooltip(helpButton, 'Help; Keyboard shortcuts. (H)');\n\n tierEditButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n if (b.selectedTiers.length == 1) {\n b.openTierPanel(b.tiers[b.selectedTiers[0]]);\n }\n }, false);\n\n leapLeftButton.addEventListener('click', function(ev) {\n b.leap(b.reverseKeyScrolling ? -1 : 1, false);\n }, false);\n b.makeTooltip(leapLeftButton, function(ev) {\n var st = b.getSelectedTier();\n var tier;\n if (st >= 0)\n tier = b.tiers[st];\n\n if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof(tier.quantLeapThreshold) == 'number') {\n return 'Jump to the next region with a score above the threshold in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\"\" (ctrl+LEFT)';\n } else if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'leap')) {\n return 'Jump to the next feature in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\" (ctrl+LEFT)';\n } else {\n return 'Jump left (shift+LEFT)';\n }\n });\n\n leapRightButton.addEventListener('click', function(ev) {\n b.leap(b.reverseKeyScrolling ? 1 : -1, false);\n }, false);\n b.makeTooltip(leapRightButton, function(ev) {\n var st = b.getSelectedTier();\n var tier;\n if (st >= 0)\n tier = b.tiers[st];\n\n if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof(tier.quantLeapThreshold) == 'number') {\n return 'Jump to the next region with a score above the threshold in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\"\" (ctrl+RIGHT)';\n } else if (tier && tier.featureSource && b.sourceAdapterIsCapable(tier.featureSource, 'leap')) {\n return 'Jump to the next feature in the selected track \"' + (tier.config.name || tier.dasSource.name) + '\" (ctrl+RIGHT)';\n } else {\n return 'Jump right (shift+RIGHT)';\n }\n });\n b.addTierSelectionListener(function() {\n var st = b.getSelectedTier();\n var tier;\n if (st >= 0)\n tier = b.tiers[st];\n\n var canLeap = false;\n if (tier && tier.featureSource) {\n if (b.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof(tier.quantLeapThreshold) == 'number')\n canLeap = true;\n else if (b.sourceAdapterIsCapable(tier.featureSource, 'leap'))\n canLeap = true;\n }\n\n leapLeftButton.firstChild.className = canLeap ? 'fa fa-angle-double-left' : 'fa fa-angle-left';\n leapRightButton.firstChild.className = canLeap ? 'fa fa-angle-double-right' : 'fa fa-angle-right';\n });\n\n clearHighlightsButton.addEventListener('click', function(ev) {\n b.clearHighlights();\n }, false);\n b.makeTooltip(clearHighlightsButton, 'Clear highlights (C)');\n\n b.addTierSelectionWrapListener(function(dir) {\n if (dir < 0) {\n b.setSelectedTier(null);\n locField.focus();\n }\n });\n\n b.addTierSelectionListener(function(sel) {\n if (b.uiMode === 'tier') {\n if (sel.length == 0) {\n b.hideToolPanel();\n b.manipulatingTier = null;\n b.uiMode = 'none';\n } else {\n var ft = b.tiers[sel[0]];\n if (ft != b.manipulatingTier) {\n b.openTierPanel(ft);\n }\n }\n }\n });\n\n var uiKeyHandler = function(ev) {\n // console.log('bukh: ' + ev.keyCode);\n if (ev.keyCode == 65 || ev.keyCode == 97) { // a\n ev.preventDefault(); ev.stopPropagation();\n b.showTrackAdder();\n } else if (ev.keyCode == 72 || ev.keyCode == 104) { // h\n ev.stopPropagation(); ev.preventDefault();\n b.toggleHelpPopup(ev);\n } else if (ev.keyCode == 69 || ev.keyCode == 101) { //e\n ev.stopPropagation(); ev.preventDefault();\n if (b.selectedTiers.length == 1) {\n b.openTierPanel(b.tiers[b.selectedTiers[0]]);\n }\n } else if (ev.keyCode == 88 || ev.keyCode == 120) { // x\n ev.stopPropagation(); ev.preventDefault();\n b.openExportPanel();\n } else if (ev.keyCode == 67 || ev.keyCode == 99) { // c\n ev.stopPropagation(); ev.preventDefault();\n b.clearHighlights();\n }\n };\n\n holder.addEventListener('focus', function(ev) {\n holder.addEventListener('keydown', uiKeyHandler, false);\n }, false);\n holder.addEventListener('blur', function(ev) {\n holder.removeEventListener('keydown', uiKeyHandler, false);\n }, false);\n\n holder.addEventListener('keydown', function(ev) {\n if (ev.keyCode === 27) {\n if (b.uiMode !== 'none') {\n // Only consume event if tool panel is open.\n ev.preventDefault();\n ev.stopPropagation();\n b.setUiMode('none');\n b.hideToolPanel();\n\n if (b.selectedTiers && b.selectedTiers.length > 0) {\n b.browserHolder.focus();\n }\n }\n }\n }, false);\n}\n\nBrowser.prototype.showToolPanel = function(panel, nowrap) {\n var thisB = this;\n\n if (this.activeToolPanel) {\n this.activeToolPanel.parentElement.removeChild(this.activeToolPanel);\n }\n\n var content;\n if (nowrap)\n content = panel;\n else\n content = makeElement('div', panel, {}, {overflowY: 'auto', width: '100%'});\n\n\n var divider = makeElement('div', makeElement('i', null, {className: 'fa fa-caret-right'}), {className: 'tool-divider'});\n divider.addEventListener('click', function(ev) {\n thisB.hideToolPanel();\n thisB.setUiMode('none');\n }, false);\n this.makeTooltip(divider, 'Close tool panel (ESC)');\n this.activeToolPanel = makeElement('div', [divider, content], {className: 'tool-holder'});\n this.svgHolder.appendChild(this.activeToolPanel);\n this.resizeViewer();\n\n var thisB = this;\n}\n\nBrowser.prototype.hideToolPanel = function() {\n if (this.activeToolPanel) {\n this.activeToolPanel.parentElement.removeChild(this.activeToolPanel);\n }\n this.svgHolder.style.width = '100%';\n this.activeToolPanel = null;\n this.resizeViewer();\n}\n\nBrowser.prototype.toggleHelpPopup = function(ev) {\n if (this.uiMode === 'help') {\n this.hideToolPanel();\n this.setUiMode('none');\n } else {\n var helpFrame = makeElement('iframe', null, {scrolling: 'yes', seamless: 'seamless', src: this.resolveURL('$$help/index.html'), className: 'help-panel'});\n this.showToolPanel(helpFrame, false);\n this.setUiMode('help');\n }\n}\n\nBrowser.prototype.toggleOptsPopup = function(ev) {\n var b = this;\n\n if (this.uiMode === 'opts') {\n this.hideToolPanel();\n this.setUiMode('none');\n } else {\n var optsForm = makeElement('div', null, {className: 'form-horizontal'}, {boxSizing: 'border-box', MozBoxSizing: 'border-box', display: 'inline-block', verticalAlign: 'top'});\n var optsTable = makeElement('table');\n optsTable.cellPadding = 5;\n\n var scrollModeButton = makeElement('input', '', {type: 'checkbox', checked: b.reverseScrolling});\n scrollModeButton.addEventListener('change', function(ev) {\n b.reverseScrolling = scrollModeButton.checked;\n b.storeStatus();\n }, false);\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Reverse trackpad scrolling', {align: 'right'}), makeElement('td', scrollModeButton)]));\n\n var scrollKeyButton = makeElement('input', '', {type: 'checkbox', checked: b.reverseKeyScrolling});\n scrollKeyButton.addEventListener('change', function(ev) {\n b.reverseKeyScrolling = scrollKeyButton.checked;\n b.storeStatus();\n }, false);\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Reverse scrolling buttons and keys', {align: 'right'}), makeElement('td', scrollKeyButton)]));\n\n\n var rulerSelect = makeElement('select');\n rulerSelect.appendChild(makeElement('option', 'Left', {value: 'left'}));\n rulerSelect.appendChild(makeElement('option', 'Center', {value: 'center'}));\n rulerSelect.appendChild(makeElement('option', 'Right', {value: 'right'}));\n rulerSelect.appendChild(makeElement('option', 'None', {value: 'none'}));\n rulerSelect.value = b.rulerLocation;\n rulerSelect.addEventListener('change', function(ev) {\n b.rulerLocation = rulerSelect.value;\n b.positionRuler();\n for (var ti = 0; ti < b.tiers.length; ++ti) {\n b.tiers[ti].paintQuant();\n }\n b.storeStatus();\n }, false);\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Vertical guideline', {align: 'right'}), makeElement('td', rulerSelect)]));\n \n var singleBaseHighlightButton = makeElement('input', '', {type: 'checkbox', checked: b.singleBaseHighlight}); \n singleBaseHighlightButton.addEventListener('change', function(ev) {\n b.singleBaseHighlight = singleBaseHighlightButton.checked;\n b.positionRuler();\n b.storeStatus();\n }, false);\n singleBaseHighlightButton.setAttribute('id','singleBaseHightlightButton'); // making this because access is required when the key 'u' is pressed and the options are visible\n optsTable.appendChild(makeElement('tr', [makeElement('td', 'Display and highlight current genome location', {align: 'right'}), makeElement('td', singleBaseHighlightButton)]));\n \n optsForm.appendChild(optsTable);\n\n var resetButton = makeElement('button', 'Reset browser', {className: 'btn'}, {marginLeft: 'auto', marginRight: 'auto', display: 'block'});\n resetButton.addEventListener('click', function(ev) {\n b.reset();\n }, false);\n optsForm.appendChild(resetButton);\n\n this.showToolPanel(optsForm);\n this.setUiMode('opts');\n }\n}\n\nfunction humanReadableScale(x) {\n var suffix = 'bp';\n if (x > 1000000000) {\n x /= 1000000000;\n suffix = 'Gb';\n } else if (x > 1000000) {\n x /= 1000000\n suffix = 'Mb';\n } else if (x > 1000) {\n x /= 1000;\n suffix = 'kb';\n }\n return '' + Math.round(x) + suffix;\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// cbrowser.js: canvas browser container\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var Observed = utils.Observed;\n var Awaited = utils.Awaited;\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n var miniJSONify = utils.miniJSONify;\n var shallowCopy = utils.shallowCopy;\n var textXHR = utils.textXHR;\n\n var tier = require('./tier');\n var DasTier = tier.DasTier;\n\n var sha1 = require('./sha1');\n var hex_sha1 = sha1.hex_sha1;\n\n var thub = require('./thub');\n var connectTrackHub = thub.connectTrackHub;\n\n var VERSION = require('./version');\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n var formatLongInt = nf.formatLongInt;\n\n var Chainset = require('./chainset').Chainset;\n\n var Promise = require('es6-promise').Promise;\n\n var sourcecompare = require('./sourcecompare');\n var sourcesAreEqual = sourcecompare.sourcesAreEqual;\n var sourcesAreEqualModuloStyle = sourcecompare.sourcesAreEqualModuloStyle;\n var sourceDataURI = sourcecompare.sourceDataURI;\n var sourceStyleURI = sourcecompare.sourceStyleURI;\n\n var DefaultRenderer = require('./default-renderer');\n\n var MultiRenderer = require('./multi-renderer');\n var SubRenderer = require('./sub-renderer');\n\n var DummyRenderer = require('./dummy-renderer');\n}\n\nfunction Region(chr, min, max) {\n this.min = min;\n this.max = max;\n this.chr = chr;\n}\n\nfunction Browser(opts) {\n if (!opts) {\n opts = {};\n }\n\n this.renderers =\n { 'default': DefaultRenderer,\n 'dummy': DummyRenderer,\n 'multi': MultiRenderer,\n 'sub': SubRenderer\n };\n\n this.defaultRenderer = opts.renderer || DefaultRenderer;\n\n this.prefix = '//www.biodalliance.org/release-0.14/';\n\n this.sources = [];\n this.tiers = [];\n this.tierGroups = {};\n\n this.searchOnlySources = [];\n this.searchOnlySourceHolders = [];\n\n this.featureListeners = [];\n this.featureHoverListeners = [];\n this.viewListeners = [];\n this.regionSelectListeners = [];\n this.tierListeners = [];\n this.tierSelectionListeners = [];\n this.tierSelectionWrapListeners = [];\n\n this.cookieKey = 'browser';\n\n this.chains = {};\n\n this.pageName = 'svgHolder'\n this.zoomFactor = 1.0;\n this.maxPixelsPerBase = 10;\n this.origin = 0;\n this.targetQuantRes = 1.0;\n this.featurePanelWidth = 750;\n this.zoomBase = 100;\n this.zoomExpt = 30.0; // Back to being fixed....\n this.zoomSliderValue = 100;\n this.entryPoints = null;\n this.currentSeqMax = -1; // init once EPs are fetched.\n\n this.highlights = [];\n this.selectedTiers = [1];\n\n this.maxViewWidth = 500000;\n this.defaultSubtierMax = 100;\n\n this.highZoomThreshold = 0.2;\n this.mediumZoomThreshold = 0.01\n\n this.minExtraWidth = 100.0;\n this.maxExtraWidth = 1000.0;\n \n // Options.\n\n this.reverseScrolling = false;\n this.rulerLocation = 'center';\n this.defaultHighlightFill = 'red';\n this.defaultHighlightAlpha = 0.3;\n this.exportHighlights = true;\n this.exportRuler = true;\n this.exportBanner = true;\n this.exportRegion = true;\n this.singleBaseHighlight = true;\n\n // Visual config.\n\n // this.tierBackgroundColors = [\"rgb(245,245,245)\", \"rgb(230,230,250)\" /* 'white' */];\n this.tierBackgroundColors = [\"rgb(245,245,245)\", 'white'];\n this.minTierHeight = 20;\n this.noDefaultLabels = false;\n\n // Registry\n\n this.availableSources = new Observed();\n this.defaultSources = [];\n this.mappableSources = {};\n\n // Central DAS Registry no longer available 2015-05\n\n this.registry = null; // '//www.dasregistry.org/das/sources';\n this.noRegistryTabs = true;\n\n this.defaultTrackAdderTab = null;\n\n this.hubs = [];\n this.hubObjects = [];\n\n this.sourceCache = new SourceCache();\n\n this.retina = true;\n\n this.useFetchWorkers = true;\n this.maxWorkers = 2;\n this.workerPath = '$$worker-all.js';\n this.resolvers = {};\n this.resolverSeed = 1;\n\n this.assemblyNamePrimary = true;\n this.assemblyNameUcsc = true;\n\n this.defaultSearchRegionPadding = 10000;\n\n // HTTP warning support\n\n this.httpCanaryURL = 'http://www.biodalliance.org/http-canary.txt';\n this.httpWarningURL = '//www.biodalliance.org/https.html';\n\n this.initListeners = [];\n\n if (opts.baseColors) {\n this.baseColors = opts.baseColors\n } else {\n this.baseColors = {\n A: 'green',\n C: 'blue',\n G: 'orange',\n T: 'red',\n '-' : 'hotpink', // deletion\n 'I' : 'red' // insertion\n };\n }\n\n if (opts.viewStart !== undefined && typeof(opts.viewStart) !== 'number') {\n throw Error('viewStart must be an integer');\n }\n if (opts.viewEnd !== undefined && typeof(opts.viewEnd) !== 'number') {\n throw Error('viewEnd must be an integer');\n }\n if (opts.offscreenInitWidth !== undefined && typeof(opts.offscreenInitWidth) !== 'number') {\n throw Error('offscreenInitWidth must be an integer');\n }\n\n for (var k in opts) {\n this[k] = opts[k];\n }\n \n if (typeof(opts.uiPrefix) === 'string' && typeof(opts.prefix) !== 'string') {\n this.prefix = opts.uiPrefix;\n }\n // If the prefix only starts with a single '/' this is relative to the current\n // site, so we need to prefix the prefix with //{hostname}\n if (this.prefix.indexOf('//') < 0 && this.prefix.indexOf('/') === 0) {\n var location = window.location.hostname;\n if (window.location.port) {\n location += ':' + window.location.port\n };\n this.prefix = '//' + location + this.prefix;\n }\n if (this.prefix.indexOf('//') === 0) {\n var proto = window.location.protocol;\n if (proto == 'http:' || proto == 'https:') {\n // Protocol-relative URLs okay.\n } else {\n console.log(window.location.protocol);\n console.log('WARNING: prefix is set to a protocol-relative URL (' + this.prefix + ' when loading from a non-HTTP source');\n this.prefix = 'http:' + this.prefix;\n }\n }\n\n if (!this.coordSystem) {\n throw Error('Coordinate system must be configured');\n }\n\n if (this.chr === undefined || this.viewStart === undefined || this.viewEnd === undefined) {\n throw Error('Viewed region (chr:start..end) must be defined');\n }\n\n var thisB = this;\n\n if (document.readyState === 'complete') {\n thisB.realInit();\n } else {\n var loadListener = function(ev) {\n window.removeEventListener('load', loadListener, false);\n thisB.realInit();\n }\n window.addEventListener('load', loadListener, false);\n }\n}\n\nBrowser.prototype.resolveURL = function(url) {\n return url.replace('$$', this.prefix);\n}\n\nBrowser.prototype.destroy = function() {\n window.removeEventListener('resize', this.resizeListener, false);\n if (this.fetchWorkers) {\n for (const worker of this.fetchWorkers) {\n worker.terminate();\n }\n }\n}\n\nBrowser.prototype.realInit = function() {\n var self = this;\n var thisB = this;\n\n if (this.wasInitialized) {\n console.log('Attemping to call realInit on an already-initialized Dalliance instance');\n return;\n }\n\n this.wasInitialized = true;\n\n if (typeof(navigator) !== 'undefined') {\n var ua = navigator.userAgent || 'dummy';\n if (ua.indexOf('Trident') >= 0 && ua.indexOf('rv:11') >= 0) {\n // console.log('Detected IE11, disabling tier pinning.');\n this.disablePinning = true;\n }\n }\n\n this.defaultChr = this.chr;\n this.defaultStart = this.viewStart;\n this.defaultEnd = this.viewEnd;\n this.defaultSources = [];\n for (var i = 0; i < this.sources.length; ++i) {\n var s = this.sources[i];\n if (s)\n this.defaultSources.push(s);\n }\n\n if (this.restoreStatus) {\n this.statusRestored = this.restoreStatus();\n }\n\n if (this.injectionPoint && this.injectionPoint instanceof Element) {\n this.browserHolderHolder = this.injectionPoint;\n } else if (this.injectionPoint) {\n this.browserHolderHolder = document.getElementById(this.injectionPoint);\n if (!this.browserHolderHolder) {\n throw Error('injectionPoint must point to a valid DOM element of element ID');\n }\n } else {\n this.browserHolderHolder = document.getElementById(this.pageName);\n if (!this.browserHolderHolder) {\n throw Error('pageName must be a valid element ID (or use the injectionPoint option instead)');\n }\n }\n \n this.browserHolderHolder.classList.add('dalliance-injection-point');\n this.browserHolder = makeElement('div', null, {className: 'dalliance dalliance-root', tabIndex: -1});\n if (this.maxHeight) {\n this.browserHolder.style.maxHeight = this.maxHeight + 'px';\n } else if (this.maxHeight != undefined) {\n this.browserHolder.style.maxHeight = null;\n }\n removeChildren(this.browserHolderHolder);\n this.browserHolderHolder.appendChild(this.browserHolder);\n this.svgHolder = makeElement('div', null, {className: 'main-holder'});\n\n this.initUI(this.browserHolder, this.svgHolder);\n\n this.pinnedTierHolder = makeElement('div', null, {className: 'tier-holder tier-holder-pinned'});\n this.tierHolder = makeElement('div', this.makeLoader(24), {className: 'tier-holder tier-holder-rest'});\n\n this.locSingleBase = makeElement('span', '', {className: 'loc-single-base'});\n var locSingleBaseHolder = makeElement('div', this.locSingleBase,{className: 'loc-single-base-holder'});\n // Add listener to update single base location\n this.addViewListener(function(chr, minFloor, maxFloor, zoomSliderValue, zoomSliderDict, min, max) {\n // Just setting textContent causes layout flickering in Blink.\n // This approach means that the element is never empty.\n var loc = Math.round((max + min) / 2);\n self.locSingleBase.appendChild(document.createTextNode(chr + ':' + formatLongInt(loc)));\n self.locSingleBase.removeChild(self.locSingleBase.firstChild);\n });\n\n if (this.disablePinning) {\n this.tierHolderHolder = this.tierHolder;\n } else {\n this.tierHolderHolder = makeElement('div', [locSingleBaseHolder, this.pinnedTierHolder, this.tierHolder], {className: 'tier-holder-holder'});\n this.svgHolder.appendChild(this.tierHolderHolder);\n }\n this.svgHolder.appendChild(this.tierHolderHolder);\n\n this.bhtmlRoot = makeElement('div');\n if (!this.disablePoweredBy) {\n this.bhtmlRoot.appendChild(makeElement('span', ['Powered by ', makeElement('a', 'Biodalliance', {href: 'http://www.biodalliance.org/'}), ' ' + VERSION], {className: 'powered-by'}));\n }\n this.browserHolder.appendChild(this.bhtmlRoot);\n\n this.resizeListener = function(ev) {\n thisB.resizeViewer();\n };\n\n this.ruler = makeElement('div', null, {className: 'guideline'})\n this.ruler2 = makeElement('div', null, {className: 'single-base-guideline'});\n this.tierHolderHolder.appendChild(this.ruler);\n this.tierHolderHolder.appendChild(this.ruler2);\n this.chainConfigs = this.chains || {};\n this.chains = {};\n for (var k in this.chainConfigs) {\n var cc = this.chainConfigs[k];\n if (cc instanceof Chainset) {\n console.log('WARNING: Should no longer use \"new Chainset\" in Biodalliance configurations.');\n }\n this.chains[k] = new Chainset(cc);\n }\n\n var promisedWorkers;\n if (this.maxWorkers > 0) {\n var pw = [];\n for (var fi = 0; fi < this.maxWorkers; ++fi)\n pw.push(makeFetchWorker(this));\n promisedWorkers = Promise.all(pw);\n } else {\n promisedWorkers = Promise.resolve([]);\n }\n\n this.fetchWorkers = null;\n this.nextWorker = 0;\n promisedWorkers.then(function(v) {\n console.log('Booted ' + v.length + ' workers');\n thisB.fetchWorkers = v;\n }, function(v) {\n console.log('Failed to boot workers', v);\n }).then(function() {\n if (self.offscreenInitWidth || (window.getComputedStyle(thisB.browserHolderHolder).display != 'none' &&\n thisB.tierHolder.getBoundingClientRect().width > 0))\n {\n setTimeout(function() {thisB.realInit2()}, 1);\n } else {\n var pollInterval = setInterval(function() {\n if (window.getComputedStyle(thisB.browserHolderHolder).display != 'none' &&\n thisB.tierHolder.getBoundingClientRect().width > 0)\n {\n clearInterval(pollInterval);\n thisB.realInit2();\n }\n }, 300);\n }\n });\n}\n\nBrowser.prototype.realInit2 = function() {\n var thisB = this;\n\n // Remove the loader icon, if needed\n removeChildren(this.tierHolder);\n removeChildren(this.pinnedTierHolder);\n\n this.featurePanelWidth = this.tierHolder.getBoundingClientRect().width | thisB.offscreenInitWidth | 0;\n window.addEventListener('resize', this.resizeListener, false);\n\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n if (!this.zoomMax) {\n this.zoomMax = this.zoomExpt * Math.log(this.maxViewWidth / this.zoomBase);\n this.zoomMin = this.zoomExpt * Math.log(this.featurePanelWidth / this.maxPixelsPerBase / this.zoomBase);\n }\n this.zoomSliderValue = this.zoomExpt * Math.log((this.viewEnd - this.viewStart + 1) / this.zoomBase);\n\n // Event handlers\n\n this.tierHolderHolder.addEventListener('mousewheel', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n\n if (ev.wheelDeltaX) {\n var delta = ev.wheelDeltaX/5;\n if (!thisB.reverseScrolling) {\n delta = -delta;\n }\n thisB.move(delta);\n }\n\n if (ev.wheelDeltaY) {\n var delta = ev.wheelDeltaY;\n if (thisB.reverseScrolling) {\n delta = -delta;\n }\n thisB.tierHolder.scrollTop += delta;\n }\n }, false);\n\n this.tierHolderHolder.addEventListener('MozMousePixelScroll', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n if (ev.axis == 1) {\n if (ev.detail != 0) {\n var delta = ev.detail/4;\n if (thisB.reverseScrolling) {\n delta = -delta;\n }\n thisB.move(delta);\n }\n } else {\n var delta = ev.detail;\n if (!thisB.reverseScrolling) {\n delta = -delta;\n }\n\n thisB.tierHolder.scrollTop += delta;\n }\n }, false);\n\n this.tierHolderHolder.addEventListener('touchstart', function(ev) {return thisB.touchStartHandler(ev)}, false);\n this.tierHolderHolder.addEventListener('touchmove', function(ev) {return thisB.touchMoveHandler(ev)}, false);\n this.tierHolderHolder.addEventListener('touchend', function(ev) {return thisB.touchEndHandler(ev)}, false);\n this.tierHolderHolder.addEventListener('touchcancel', function(ev) {return thisB.touchCancelHandler(ev)}, false);\n\n var keyHandler = function(ev) {\n // console.log('cbkh: ' + ev.keyCode);\n if (ev.keyCode == 13) { // enter\n var layoutsChanged = false;\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n var t = thisB.tiers[ti];\n if (t.wantedLayoutHeight && t.wantedLayoutHeight != t.layoutHeight) {\n t.layoutHeight = t.wantedLayoutHeight;\n t.clipTier();\n layoutsChanged = true;\n }\n }\n if (layoutsChanged) {\n thisB.arrangeTiers();\n }\n } else if (ev.keyCode == 32 || ev.charCode == 32) { // space\n if (!thisB.isSnapZooming) {\n thisB.isSnapZooming = true;\n var newZoom = (thisB.savedZoom || 0.0) + thisB.zoomMin;\n thisB.savedZoom = thisB.zoomSliderValue - thisB.zoomMin;\n thisB.zoomSliderValue = newZoom;\n thisB.zoom(Math.exp((1.0 * newZoom) / thisB.zoomExpt));\n } else {\n thisB.isSnapZooming = false;\n var newZoom = (thisB.savedZoom || 20.0) + thisB.zoomMin;\n thisB.savedZoom = thisB.zoomSliderValue - thisB.zoomMin;\n thisB.zoomSliderValue = newZoom;\n thisB.zoom(Math.exp((1.0 * newZoom) / thisB.zoomExpt));\n }\n ev.stopPropagation(); ev.preventDefault();\n } else if (ev.keyCode == 85) { // u\n if (thisB.uiMode === 'opts') { // if the options are visible, toggle the checkbox too\n var check = document.getElementById(\"singleBaseHightlightButton\").checked;\n document.getElementById(\"singleBaseHightlightButton\").checked = !check;\n }\n thisB.singleBaseHighlight = !thisB.singleBaseHighlight;\n thisB.positionRuler();\n ev.stopPropagation(); ev.preventDefault();\n } else if (ev.keyCode == 39) { // right arrow\n ev.stopPropagation(); ev.preventDefault();\n thisB.scrollArrowKey(ev, -1);\n } else if (ev.keyCode == 37) { // left arrow\n ev.stopPropagation(); ev.preventDefault();\n thisB.scrollArrowKey(ev, 1);\n } else if (ev.keyCode == 38 || ev.keyCode == 87) { // up arrow | w\n ev.stopPropagation(); ev.preventDefault();\n\n if (ev.shiftKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n var ch = tt.forceHeight || tt.subtiers[0].height;\n if (ch >= 40) {\n tt.mergeConfig({height: ch-10});\n }\n } else if (ev.ctrlKey || ev.metaKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n\n if (tt.quantLeapThreshold) {\n var th = tt.subtiers[0].height;\n var tq = tt.subtiers[0].quant;\n if (!tq)\n return;\n\n var qmin = 1.0 * tq.min;\n var qmax = 1.0 * tq.max;\n\n var qscale = (qmax - qmin) / th;\n tt.mergeConfig({quantLeapThreshold: qmin + ((Math.round((tt.quantLeapThreshold - qmin)/qscale)|0)+1)*qscale});\n\n tt.notify('Threshold: ' + formatQuantLabel(tt.quantLeapThreshold));\n }\n } else if (ev.altKey) {\n var cnt = thisB.selectedTiers.length;\n if (cnt == 0)\n return;\n\n var st = thisB.selectedTiers[0];\n var contiguous = true;\n var mt = [];\n for (var si = 0; si < thisB.selectedTiers.length; ++si) {\n mt.push(thisB.tiers[thisB.selectedTiers[si]]);\n if (si > 0 && thisB.selectedTiers[si] - thisB.selectedTiers[si - 1] != 1)\n contiguous = false;\n }\n\n if (contiguous && st <= 0)\n return;\n\n for (var si = thisB.selectedTiers.length - 1; si >= 0; --si)\n thisB.tiers.splice(thisB.selectedTiers[si], 1);\n\n thisB.selectedTiers.splice(0, cnt);\n\n var ip = contiguous ? st - 1 : st;\n for (var si = 0; si < mt.length; ++si) {\n thisB.tiers.splice(ip+si, 0, mt[si]);\n thisB.selectedTiers.push(ip + si);\n }\n\n thisB.withPreservedSelection(thisB._ensureTiersGrouped);\n thisB.markSelectedTiers();\n thisB.notifyTierSelection();\n thisB.reorderTiers();\n thisB.notifyTier(\"selected\", st);\n } else {\n var st = thisB.getSelectedTier();\n if (st > 0) {\n thisB.setSelectedTier(st - 1);\n var nst = thisB.tiers[thisB.getSelectedTier()];\n var top = nst.row.offsetTop, bottom = top + nst.row.offsetHeight;\n if (top < thisB.tierHolder.scrollTop || bottom > thisB.tierHolder.scrollTop + thisB.tierHolder.offsetHeight) {\n thisB.tierHolder.scrollTop = top;\n }\n } else {\n thisB.notifyTierSelectionWrap(-1);\n }\n }\n } else if (ev.keyCode == 40 || ev.keyCode == 83) { // down arrow | s\n ev.stopPropagation(); ev.preventDefault();\n\n if (ev.shiftKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n var ch = tt.forceHeight || tt.subtiers[0].height;\n tt.mergeConfig({height: ch+10});\n } else if (ev.ctrlKey || ev.metaKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tt = thisB.tiers[st];\n\n if (tt.quantLeapThreshold) {\n var th = tt.subtiers[0].height;\n var tq = tt.subtiers[0].quant;\n if (!tq)\n return;\n\n var qmin = 1.0 * tq.min;\n var qmax = 1.0 * tq.max;\n var qscale = (qmax - qmin) / th;\n\n var it = Math.round((tt.quantLeapThreshold - qmin)/qscale)|0;\n if (it > 1) {\n tt.mergeConfig({quantLeapThreshold: qmin + (it-1)*qscale});\n tt.notify('Threshold: ' + formatQuantLabel(tt.quantLeapThreshold));\n }\n }\n } else if (ev.altKey) {\n var cnt = thisB.selectedTiers.length;\n if (cnt == 0)\n return;\n\n var st = thisB.selectedTiers[0];\n var discontig = 0;\n var mt = [];\n for (var si = 0; si < thisB.selectedTiers.length; ++si) {\n mt.push(thisB.tiers[thisB.selectedTiers[si]]);\n if (si > 0)\n discontig += (thisB.selectedTiers[si] - thisB.selectedTiers[si - 1] - 1);\n }\n var contiguous = discontig == 0;\n\n if (contiguous && st + cnt >= thisB.tiers.length)\n return;\n\n for (var si = thisB.selectedTiers.length - 1; si >= 0; --si)\n thisB.tiers.splice(thisB.selectedTiers[si], 1);\n\n thisB.selectedTiers.splice(0, cnt);\n\n var ip = contiguous ? st + 1 : st + discontig;\n for (var si = 0; si < mt.length; ++si) {\n thisB.tiers.splice(ip+si, 0, mt[si]);\n thisB.selectedTiers.push(ip + si);\n }\n\n thisB.withPreservedSelection(function() {\n thisB._ensureTiersGrouped(true);\n });\n thisB.markSelectedTiers();\n thisB.notifyTierSelection();\n thisB.reorderTiers();\n thisB.notifyTier(\"selected\", st);\n } else {\n var st = thisB.getSelectedTier();\n if (st < thisB.tiers.length -1) {\n thisB.setSelectedTier(st + 1);\n var nst = thisB.tiers[thisB.getSelectedTier()];\n var top = nst.row.offsetTop, bottom = top + nst.row.offsetHeight;\n if (top < thisB.tierHolder.scrollTop || bottom > thisB.tierHolder.scrollTop + thisB.tierHolder.offsetHeight) {\n thisB.tierHolder.scrollTop = Math.min(top, bottom - thisB.tierHolder.offsetHeight);\n }\n }\n }\n } else if (ev.keyCode == 187 || ev.keyCode == 61) { // +\n ev.stopPropagation(); ev.preventDefault();\n thisB.zoomStep(-10);\n } else if (ev.keyCode == 189 || ev.keyCode == 173) { // -\n ev.stopPropagation(); ev.preventDefault();\n thisB.zoomStep(10);\n } else if (ev.keyCode == 73 || ev.keyCode == 105) { // i\n ev.stopPropagation(); ev.preventDefault();\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var t = thisB.tiers[st];\n if (!t.infoVisible) {\n t.infoElement.style.display = 'block';\n t.updateHeight();\n t.infoVisible = true;\n } else {\n t.infoElement.style.display = 'none';\n t.updateHeight();\n t.infoVisible = false;\n }\n } else if (ev.keyCode == 84 || ev.keyCode == 116) { // t\n var bumpStatus;\n if( ev.shiftKey ){\n ev.stopPropagation(); ev.preventDefault();\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n var t = thisB.tiers[ti];\n if (t.dasSource.collapseSuperGroups) {\n if (bumpStatus === undefined) {\n bumpStatus = !t.bumped;\n }\n t.mergeConfig({bumped: bumpStatus});\n }\n }\n } else if (!ev.ctrlKey && !ev.metaKey) {\n ev.stopPropagation(); ev.preventDefault();\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var t = thisB.tiers[st];\n\n if (t.dasSource.collapseSuperGroups) {\n if (bumpStatus === undefined) {\n bumpStatus = !t.bumped;\n }\n t.mergeConfig({bumped: bumpStatus});\n }\n }\n } else if (ev.keyCode == 77 || ev.keyCode == 109) { // m\n ev.stopPropagation(); ev.preventDefault();\n if ((ev.ctrlKey || ev.metaKey) && thisB.selectedTiers.length > 1) {\n thisB.mergeSelectedTiers();\n }\n } else if (ev.keyCode == 68 || ev.keyCode == 100) { // d\n ev.stopPropagation(); ev.preventDefault();\n if (ev.ctrlKey || ev.metaKey) {\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n thisB.addTier(thisB.tiers[st].dasSource);\n }\n } else if (ev.keyCode == 80 || ev.keyCode == 112) { // p\n if (ev.ctrlKey || ev.metaKey) {\n // Need to be careful because order of tiers could change\n // once we start updating pinning.\n var tt = [];\n for (var st = 0; st < thisB.selectedTiers.length; ++st) {\n tt.push(thisB.tiers[thisB.selectedTiers[st]]);\n }\n for (var ti = 0; ti < tt.length; ++ti) {\n tt[ti].mergeConfig({pinned: !tt[ti].pinned});\n }\n }\n } else {\n // console.log('key: ' + ev.keyCode + '; char: ' + ev.charCode);\n }\n };\n\n this.browserHolder.addEventListener('focus', function(ev) {\n thisB.browserHolder.addEventListener('keydown', keyHandler, false);\n }, false);\n this.browserHolder.addEventListener('blur', function(ev) {\n thisB.browserHolder.removeEventListener('keydown', keyHandler, false);\n }, false);\n\n // Popup support (does this really belong here? FIXME)\n this.hPopupHolder = makeElement('div');\n this.hPopupHolder.style['font-family'] = 'helvetica';\n this.hPopupHolder.style['font-size'] = '12pt';\n this.hPopupHolder.classList.add('dalliance');\n document.body.appendChild(this.hPopupHolder);\n\n for (var t = 0; t < this.sources.length; ++t) {\n var source = this.sources[t];\n if (!source)\n continue;\n\n var config = {};\n if (this.restoredConfigs) {\n config = this.restoredConfigs[t];\n }\n\n if (!source.disabled) {\n this.makeTier(source, config).then(function(tier) {\n thisB.refreshTier(tier);\n });\n }\n }\n\n for (const source of this.searchOnlySources) {\n if (!source.disabled) {\n const {features} = this.createSources(source);\n\n if (features) {\n this.searchOnlySourceHolders.push({\n dasSource: source,\n featureSource: features\n });\n }\n }\n }\n\n if (this.onFirstRender) {\n Promise.all(this.tiers.map(t => t.firstRenderPromise))\n .then(() => this.onFirstRender())\n .catch((err) => console.log(err));\n }\n\n thisB._ensureTiersGrouped();\n thisB.arrangeTiers();\n thisB.reorderTiers();\n\n\n var ss = this.getSequenceSource();\n if (ss) {\n ss.getSeqInfo(this.chr, function(si) {\n if (si)\n thisB.currentSeqMax = si.length;\n else\n thisB.currentSeqMax = -1;\n });\n }\n\n this.queryRegistry();\n for (var m in this.chains) {\n this.queryRegistry(m, true);\n }\n\n if (this.hubs) {\n for (var hi = 0; hi < this.hubs.length; ++hi) {\n var hc = this.hubs[hi];\n if (typeof hc == 'string') {\n hc = {url: hc};\n };\n\n (function(hc) {\n connectTrackHub(hc.url, function(hub, err) {\n if (err) {\n console.log(err);\n } else {\n var tdb;\n if (hc.genome)\n tdb = hub.genomes[hc.genome];\n else\n tdb = hub.genomes[thisB.coordSystem.ucscName];\n\n if (tdb) {\n if (hc.mapping)\n tdb.mapping = hc.mapping;\n if (hc.label)\n tdb.hub.altLabel = hc.label\n thisB.hubObjects.push(tdb);\n }\n }\n }, hc);\n })(hc);\n }\n }\n\n if (this.fullScreen) {\n this.setFullScreenHeight();\n }\n\n if (!this.statusRestored && this.storeStatus) {\n this.storeStatus();\n }\n\n thisB.setLocation(this.chr, this.viewStart, this.viewEnd, function () {\n thisB.setSelectedTier(1);\n // Ping any init listeners.\n for (var ii = 0; ii < thisB.initListeners.length; ++ii) {\n try {\n thisB.initListeners[ii].call(thisB);\n } catch (e) {\n console.log(e);\n }\n }\n });\n}\n\n//\n// Touch event support\n//\n\nBrowser.prototype.touchStartHandler = function(ev) {\n // Events not consumed so they can be interpretted as clicks as well.\n\n this.touchOriginX = ev.touches[0].pageX;\n this.touchOriginY = ev.touches[0].pageY;\n if (ev.touches.length == 2) {\n var sep = Math.abs(ev.touches[0].pageX - ev.touches[1].pageX);\n this.zooming = true;\n this.zoomLastSep = this.zoomInitialSep = sep;\n this.zoomInitialScale = this.scale;\n }\n}\n\nBrowser.prototype.touchMoveHandler = function(ev) {\n // These events *are* consumed to ensure we never get any dragging that\n // we don't manage ourselves.\n\n ev.stopPropagation(); ev.preventDefault();\n\n if (ev.touches.length == 1) {\n var touchX = ev.touches[0].pageX;\n var touchY = ev.touches[0].pageY;\n if (this.touchOriginX && touchX != this.touchOriginX) {\n this.move(touchX - this.touchOriginX);\n }\n if (this.touchOriginY && touchY != this.touchOriginY) {\n this.tierHolder.scrollTop -= (touchY - this.touchOriginY);\n }\n this.touchOriginX = touchX;\n this.touchOriginY = touchY;\n } else if (this.zooming && ev.touches.length == 2) {\n var sep = Math.abs(ev.touches[0].pageX - ev.touches[1].pageX);\n if (sep != this.zoomLastSep) {\n var cp = (ev.touches[0].pageX + ev.touches[1].pageX)/2;\n var scp = this.viewStart + (cp/this.scale)|0\n this.scale = this.zoomInitialScale * (sep/this.zoomInitialSep);\n this.viewStart = scp - (cp/this.scale)|0;\n for (var i = 0; i < this.tiers.length; ++i) {\n tiers[i].getRenderer().drawTier(tiers[i]);\n }\n }\n this.zoomLastSep = sep;\n }\n}\n\nBrowser.prototype.touchEndHandler = function(ev) {\n}\n\nBrowser.prototype.touchCancelHandler = function(ev) {\n}\n\n\nBrowser.prototype.makeTier = function(source, config) {\n try {\n return this.realMakeTier(source, config);\n } catch (e) {\n console.log('Error initializing', source);\n console.log(e.stack || e);\n }\n}\n\nBrowser.prototype.realMakeTier = function(source, config) {\n var thisB = this;\n var background = null;\n if (this.tierBackgroundColors) {\n background = this.tierBackgroundColors[this.tiers.length % this.tierBackgroundColors.length];\n }\n\n var tier = new DasTier(this, source, config, background);\n tier.oorigin = this.viewStart\n\n var isDragging = false;\n var dragOrigin, dragMoveOrigin;\n var hoverTimeout;\n\n var featureLookup = function(rx, ry) {\n var st = tier.subtiers;\n if (!st) {\n return;\n }\n\n var sti = 0;\n ry -= tier.padding;;\n while (sti < st.length && ry > st[sti].height && sti < (st.length - 1)) {\n ry = ry - st[sti].height - tier.padding;\n ++sti;\n }\n if (sti >= st.length) {\n return;\n }\n\n var glyphs = st[sti].glyphs;\n var viewCenter = (thisB.viewStart + thisB.viewEnd)/2;\n var offset = (tier.glyphCacheOrigin - thisB.viewStart)*thisB.scale;\n rx -= offset;\n\n return glyphLookup(glyphs, rx, ry);\n }\n\n var dragMoveHandler = function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n var rx = ev.clientX;\n if (rx != dragMoveOrigin) {\n thisB.move((rx - dragMoveOrigin), true);\n dragMoveOrigin = rx;\n }\n thisB.isDragging = true;\n }\n\n var dragUpHandler = function(ev) {\n window.removeEventListener('mousemove', dragMoveHandler, true);\n window.removeEventListener('mouseup', dragUpHandler, true);\n thisB.move((ev.clientX - dragMoveOrigin)); // Snap back (FIXME: consider animation)\n }\n\n\n tier.viewport.addEventListener('mousedown', function(ev) {\n thisB.browserHolder.focus();\n ev.preventDefault();\n var br = tier.row.getBoundingClientRect();\n var rx = ev.clientX, ry = ev.clientY;\n\n window.addEventListener('mousemove', dragMoveHandler, true);\n window.addEventListener('mouseup', dragUpHandler, true);\n dragOrigin = dragMoveOrigin = rx;\n thisB.isDragging = false; // Not dragging until a movement event arrives.\n }, false);\n\n tier.viewport.addEventListener('mousemove', function(ev) {\n var br = tier.row.getBoundingClientRect();\n var rx = ev.clientX - br.left, ry = ev.clientY - br.top;\n\n var hit = featureLookup(rx, ry);\n if (hit && hit.length > 0) {\n tier.row.style.cursor = 'pointer';\n } else {\n tier.row.style.cursor = 'default';\n }\n\n if (hoverTimeout) {\n clearTimeout(hoverTimeout);\n }\n\n if (isDragging) {\n // if (tier.dasSource.tier_type !== 'sequence' && rx != dragMoveOrigin) {\n // thisB.move((rx - dragMoveOrigin));\n // dragMoveOrigin = rx;\n // }\n } else {\n hoverTimeout = setTimeout(function() {\n var hit = featureLookup(rx, ry);\n if (hit && hit.length > 0) {\n thisB.notifyFeatureHover(ev, hit[hit.length - 1], hit, tier);\n }\n }, 1000);\n }\n });\n\n var doubleClickTimeout = null;\n tier.viewport.addEventListener('mouseup', function(ev) {\n var br = tier.row.getBoundingClientRect();\n var rx = ev.clientX - br.left, ry = ev.clientY - br.top;\n\n var hit = featureLookup(rx, ry);\n if (hit && hit.length > 0 && !thisB.isDragging) {\n if (doubleClickTimeout) {\n clearTimeout(doubleClickTimeout);\n doubleClickTimeout = null;\n thisB.featureDoubleClick(hit, rx, ry);\n } else {\n doubleClickTimeout = setTimeout(function() {\n doubleClickTimeout = null;\n thisB.notifyFeature(ev, hit[hit.length-1], hit, tier);\n }, 500);\n }\n }\n\n if (thisB.isDragging && rx != dragOrigin && tier.sequenceSource) {\n var a = thisB.viewStart + (rx/thisB.scale);\n var b = thisB.viewStart + (dragOrigin/thisB.scale);\n\n var min, max;\n if (a < b) {\n min = a|0; max = b|0;\n } else {\n min = b|0; max = a|0;\n }\n\n thisB.notifyRegionSelect(thisB.chr, min, max);\n }\n thisB.isDragging = false;\n }, false);\n\n tier.viewport.addEventListener('mouseout', function(ev) {\n isDragging = false;\n });\n\n tier.removeButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n thisB.removeTier({index: ti});\n break;\n }\n }\n }, false);\n tier.nameButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n\n if (ev.shiftKey) {\n var hitTier = -1;\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n hitTier = ti;\n break;\n }\n }\n if (hitTier >= 0) {\n var i = thisB.selectedTiers.indexOf(hitTier);\n if (i >= 0) {\n thisB.selectedTiers.splice(i, 1);\n } else {\n thisB.selectedTiers.push(hitTier);\n thisB.selectedTiers.sort();\n }\n thisB.markSelectedTiers();\n thisB.notifyTierSelection();\n\n if (thisB.selectedTiers.length > 0) {\n thisB.browserHolder.focus();\n } else {\n thisB.notifyTierSelectionWrap(-1);\n }\n }\n } else {\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n thisB.browserHolder.focus();\n if (thisB.selectedTiers.length != 1 || thisB.selectedTiers[0] != ti) {\n thisB.setSelectedTier(ti);\n return;\n }\n }\n }\n\n if (!tier.infoVisible) {\n tier.infoElement.style.display = 'block';\n tier.updateHeight();\n tier.infoVisible = true;\n } else {\n tier.infoElement.style.display = 'none';\n tier.updateHeight();\n tier.infoVisible = false;\n }\n }\n }, false);\n tier.bumpButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n var bumpStatus;\n var t = tier;\n if (t.dasSource.collapseSuperGroups) {\n if (bumpStatus === undefined) {\n bumpStatus = !t.bumped;\n }\n t.mergeConfig({bumped: bumpStatus});\n }\n }, false);\n\n\n var dragLabel;\n var dragTierHolder;\n var dragTierHolderScrollLimit;\n var tierOrdinal;\n var yAtLastReorder;\n var tiersWereReordered = false;\n\n var labelDragHandler = function(ev) {\n var label = tier.label;\n\n ev.stopPropagation(); ev.preventDefault();\n if (!dragLabel) {\n if (tier.pinned) {\n dragTierHolder = thisB.pinnedTierHolder;\n } else {\n dragTierHolder = thisB.tierHolder;\n }\n dragTierHolderScrollLimit = dragTierHolder.scrollHeight - dragTierHolder.offsetHeight;\n\n dragLabel = label.cloneNode(true);\n dragLabel.style.cursor = 'pointer';\n dragTierHolder.appendChild(dragLabel);\n label.style.visibility = 'hidden';\n\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] === tier) {\n tierOrdinal = ti;\n break;\n }\n }\n\n yAtLastReorder = ev.clientY;\n }\n\n var holderBCR = dragTierHolder.getBoundingClientRect();\n dragLabel.style.left = (label.getBoundingClientRect().left - holderBCR.left) + 'px';\n dragLabel.style.top = (ev.clientY - holderBCR.top + dragTierHolder.scrollTop - 10) + 'px';\n\n var pty = ev.clientY - holderBCR.top + dragTierHolder.scrollTop;\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n var tt = thisB.tiers[ti];\n if (tt.pinned ^ tier.pinned)\n continue;\n\n var ttr = tt.row.getBoundingClientRect();\n pty -= (ttr.bottom - ttr.top);\n if (pty < 0) {\n if (ti < tierOrdinal && ev.clientY < yAtLastReorder || ti > tierOrdinal && ev.clientY > yAtLastReorder) {\n thisB.withPreservedSelection(function() {\n thisB.tiers.splice(tierOrdinal, 1);\n thisB.tiers.splice(ti, 0, tier);\n thisB._ensureTiersGrouped(ti > tierOrdinal);\n });\n\n for (var tix = 0; tix < thisB.tiers.length; ++tix)\n if (thisB.tiers[tix] == tier)\n tierOrdinal = tix;\n\n yAtLastReorder = ev.clientY;\n thisB.reorderTiers();\n dragTierHolder.appendChild(dragLabel); // Because reorderTiers removes all children.\n tiersWereReordered = true;\n }\n break;\n }\n }\n\n if (dragLabel.offsetTop < dragTierHolder.scrollTop) {\n dragTierHolder.scrollTop -= (dragTierHolder.scrollTop - dragLabel.offsetTop);\n } else if ((dragLabel.offsetTop + dragLabel.offsetHeight) > (dragTierHolder.scrollTop + dragTierHolder.offsetHeight)) {\n dragTierHolder.scrollTop = Math.min(dragTierHolder.scrollTop +\n (dragLabel.offsetTop + dragLabel.offsetHeight) -\n (dragTierHolder.scrollTop + dragTierHolder.offsetHeight),\n dragTierHolderScrollLimit);\n }\n };\n\n var labelReleaseHandler = function(ev) {\n var label = tier.label;\n\n ev.stopPropagation(); ev.preventDefault();\n if (dragLabel) {\n dragLabel.style.cursor = 'auto';\n dragTierHolder.removeChild(dragLabel);\n dragLabel = null;\n label.style.visibility = 'visible';\n }\n document.removeEventListener('mousemove', labelDragHandler, false);\n document.removeEventListener('mouseup', labelReleaseHandler, false);\n\n if (tiersWereReordered) {\n for (var ti = 0; ti < thisB.tiers.length; ++ti) {\n if (thisB.tiers[ti] == tier) {\n thisB.setSelectedTier(ti);\n break;\n }\n }\n thisB.notifyTier(\"reordered\", tier);\n }\n };\n\n tier.label.addEventListener('mousedown', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n tiersWereReordered = false;\n document.addEventListener('mousemove', labelDragHandler, false);\n document.addEventListener('mouseup', labelReleaseHandler, false);\n }, false);\n\n this.tiers.push(tier); // NB this currently tells any extant knownSpace about the new tier.\n\n // fetches stylesheet\n return tier.init().then(function (updatedTier) {\n updatedTier.currentlyHeight = 50;\n thisB.updateHeight();\n updatedTier.updateLabel();\n\n thisB.withPreservedSelection(thisB._ensureTiersGrouped);\n updatedTier._updateFromConfig();\n thisB.reorderTiers();\n\n return updatedTier;\n });\n}\n\nBrowser.prototype.reorderTiers = function() {\n removeChildren(this.tierHolder);\n removeChildren(this.pinnedTierHolder);\n if (this.disablePinning) {\n this.tierHolder.appendChild(this.ruler);\n this.tierHolder.appendChild(this.ruler2);\n }\n var hasPinned = false;\n var pinnedTiers = [], unpinnedTiers = [];\n for (var i = 0; i < this.tiers.length; ++i) {\n var t = this.tiers[i];\n var visible = ['sub','dummy'].indexOf(this.tiers[i].dasSource.renderer) === -1;\n if (t.pinned && !this.disablePinning) {\n pinnedTiers.push(t);\n if (visible)\n this.pinnedTierHolder.appendChild(this.tiers[i].row);\n hasPinned = true;\n } else {\n unpinnedTiers.push(t);\n if (visible)\n this.tierHolder.appendChild(this.tiers[i].row);\n }\n }\n\n this.withPreservedSelection(function() {\n this.tiers.splice(0, this.tiers.length);\n for (var i = 0; i < pinnedTiers.length; ++i)\n this.tiers.push(pinnedTiers[i]);\n for (var i = 0; i < unpinnedTiers.length; ++i)\n this.tiers.push(unpinnedTiers[i]);\n });\n\n if (hasPinned)\n this.pinnedTierHolder.classList.add('tier-holder-pinned-full');\n else\n this.pinnedTierHolder.classList.remove('tier-holder-pinned-full');\n\n this.arrangeTiers();\n}\n\nBrowser.prototype.withPreservedSelection = function(f) {\n var st = [];\n for (var xi = 0; xi < this.selectedTiers.length; ++xi) {\n st.push(this.tiers[this.selectedTiers[xi]]);\n }\n\n f.call(this);\n\n this.selectedTiers = [];\n for (var sti = 0; sti < this.tiers.length; ++sti) {\n if (st.indexOf(this.tiers[sti]) >= 0)\n this.selectedTiers.push(sti);\n }\n}\n\nBrowser.prototype.refreshTier = function(tier, tierCallback) {\n var renderer = this.getTierRenderer(tier);\n if (tier.dasSource.renderer === 'multi') {\n renderer.drawTier(tier);\n } else {\n var renderCallback = tierCallback || renderer.renderTier;\n if (this.knownSpace) {\n this.knownSpace.invalidate(tier, renderCallback);\n }\n }\n}\n\nBrowser.prototype.getTierRenderer = function(tier) {\n var renderer = tier.dasSource.renderer || this.defaultRenderer;\n if (typeof(renderer) === 'string') {\n return this.renderers[renderer];\n } else if (typeof(renderer.renderTier) === 'function' &&\n typeof(renderer.drawTier) === 'function') {\n return renderer;\n } else {\n console.log(\"Tier doesn't have a renderer\");\n }\n}\n\n/* Internal use only, assumes selection is being managed elsewhere... */\n\nBrowser.prototype._ensureTiersGrouped = function(down) {\n var groupedTiers = {};\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (t.dasSource.tierGroup) {\n pusho(groupedTiers, t.dasSource.tierGroup, t);\n }\n }\n\n var newTiers = [];\n if (down)\n this.tiers.reverse();\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (t.dasSource.tierGroup) {\n var nt = groupedTiers[t.dasSource.tierGroup];\n if (nt) {\n if (down)\n nt.reverse();\n for (var nti = 0; nti < nt.length; ++nti)\n newTiers.push(nt[nti]);\n groupedTiers[t.dasSource.tierGroup] = null;\n }\n } else {\n newTiers.push(t);\n }\n }\n if (down)\n newTiers.reverse();\n this.tiers.splice(0, this.tiers.length);\n for (var nti = 0; nti < newTiers.length; ++nti)\n this.tiers.push(newTiers[nti]);\n}\n\nBrowser.prototype.arrangeTiers = function() {\n var arrangedTiers = [];\n var groupedTiers = {};\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (t.pinned) {\n arrangedTiers.push(t);\n if (t.dasSource.tierGroup) {\n pusho(groupedTiers, t.dasSource.tierGroup, t);\n }\n }\n\n }\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var t = this.tiers[ti];\n if (!t.pinned) {\n arrangedTiers.push(t);\n if (t.dasSource.tierGroup) {\n pusho(groupedTiers, t.dasSource.tierGroup, t);\n }\n }\n }\n\n for (var g in groupedTiers) {\n var tiers = groupedTiers[g];\n var tierGroup = this.tierGroups[g];\n if (!tierGroup) {\n tierGroup = {\n element: makeElement(\n 'div',\n makeElement('span', g, {className: 'tier-group-label'}),\n {className: \"tier-group\"})\n };\n this.tierGroups[g] = tierGroup;\n }\n\n if (tierGroup.element.parentNode)\n tierGroup.element.parentNode.removeChild(tierGroup.element);\n\n var holder = tiers[0].pinned ? this.pinnedTierHolder : this.tierHolder;\n var min = 10000000, max = 0;\n for (var ti = 0; ti < tiers.length; ++ti) {\n var row = tiers[ti].row;\n min = Math.min(min, row.offsetTop);\n max = Math.max(max, row.offsetTop + row.offsetHeight);\n }\n tierGroup.element.style.top = min + 'px';\n tierGroup.element.style.left = '0px';\n tierGroup.element.style.height = (max-min) + 'px';\n holder.appendChild(tierGroup.element);\n }\n\n if (this.tierBackgroundColors) {\n for (var ti = 0; ti < arrangedTiers.length; ++ti) {\n var t = arrangedTiers[ti];\n t.setBackground(this.tierBackgroundColors[ti % this.tierBackgroundColors.length]);\n if (t.dasSource.tierGroup)\n t.label.style.left = '18px';\n else\n t.label.style.left = '2px';\n t.background = this.tierBackgroundColors[ti % this.tierBackgroundColors.length];\n }\n }\n}\n\nBrowser.prototype.refresh = function() {\n this.retrieveTierData(this.tiers);\n this.drawOverlays();\n this.positionRuler();\n};\n\nvar defaultTierRenderer = function(status, tier) {\n console.log(\"DEPRECATED!\");\n}\n\nBrowser.prototype.retrieveTierData = function(tiers) {\n this.notifyLocation();\n var width = (this.viewEnd - this.viewStart) + 1;\n var minExtraW = (this.minExtraWidth / this.scale)|0;\n var maxExtraW = (this.maxExtraWidth / this.scale)|0;\n\n var newOrigin = (this.viewStart + this.viewEnd) / 2;\n var oh = newOrigin - this.origin;\n this.origin = newOrigin;\n this.scaleAtLastRedraw = this.scale;\n for (var t = 0; t < tiers.length; ++t) {\n var od = oh;\n if (tiers[t].originHaxx) {\n od += tiers[t].originHaxx;\n }\n tiers[t].originHaxx = od;\n }\n\n var scaledQuantRes = this.targetQuantRes / this.scale;\n\n var innerDrawnStart = Math.max(1, (this.viewStart|0) - minExtraW);\n var innerDrawnEnd = Math.min((this.viewEnd|0) + minExtraW, ((this.currentSeqMax|0) > 0 ? (this.currentSeqMax|0) : 1000000000))\n var outerDrawnStart = Math.max(1, (this.viewStart|0) - maxExtraW);\n var outerDrawnEnd = Math.min((this.viewEnd|0) + maxExtraW, ((this.currentSeqMax|0) > 0 ? (this.currentSeqMax|0) : 1000000000));\n\n if (!this.knownSpace || this.knownSpace.chr !== this.chr) {\n var ss = this.getSequenceSource();\n if (this.knownSpace)\n this.knownSpace.cancel();\n // known space is created based on the entire tier list, for future caching purposes, even if only a subset of the tiers are needed to be rendered now.\n this.knownSpace = new KnownSpace(this.tiers, this.chr, outerDrawnStart, outerDrawnEnd, scaledQuantRes, ss);\n }\n\n var seg = this.knownSpace.bestCacheOverlapping(this.chr, innerDrawnStart, innerDrawnEnd);\n if (seg && seg.min <= innerDrawnStart && seg.max >= innerDrawnEnd) {\n this.drawnStart = Math.max(seg.min, outerDrawnStart);\n this.drawnEnd = Math.min(seg.max, outerDrawnEnd);\n } else {\n this.drawnStart = outerDrawnStart;\n this.drawnEnd = outerDrawnEnd;\n }\n // send in the subset of tiers to retrieve.\n this.knownSpace.retrieveFeatures(tiers,\n this.chr,\n this.drawnStart,\n this.drawnEnd,\n scaledQuantRes);\n}\n\nfunction setSources(msh, availableSources, maybeMapping) {\n if (maybeMapping) {\n for (var s = 0; s < availableSources.length; ++s) {\n availableSources[s].mapping = maybeMapping;\n }\n }\n msh.set(availableSources);\n}\n\nBrowser.prototype.queryRegistry = function(maybeMapping, tryCache) {\n if (!this.registry)\n return;\n\n var thisB = this;\n var coords, msh;\n if (maybeMapping) {\n coords = this.chains[maybeMapping].coords;\n if (!thisB.mappableSources[maybeMapping]) {\n thisB.mappableSources[maybeMapping] = new Observed();\n }\n msh = thisB.mappableSources[maybeMapping];\n } else {\n coords = this.coordSystem;\n msh = this.availableSources;\n }\n var cacheHash = hex_sha1(miniJSONify(coords));\n if (tryCache) {\n var cacheTime = localStorage['dalliance.registry.' + cacheHash + '.last_queried'];\n if (cacheTime) {\n try {\n setSources(msh, JSON.parse(localStorage['dalliance.registry.' + cacheHash + '.sources']), maybeMapping);\n var cacheAge = (Date.now()|0) - (cacheTime|0);\n if (cacheAge < (12 * 60 * 60 * 1000)) {\n return;\n }\n } catch (rex) {\n console.log('Bad registry cache: ' + rex);\n }\n }\n }\n\n var rurl = this.registry;\n if (rurl.indexOf('//') == 0) {\n var proto = window.location.protocol;\n if (proto != 'https:' && proto != 'http:')\n rurl = 'http:' + rurl;\n }\n new DASRegistry(rurl).sources(function(sources) {\n var availableSources = [];\n for (var s = 0; s < sources.length; ++s) {\n var source = sources[s];\n if (!source.coords || source.coords.length == 0) {\n continue;\n }\n var scoords = source.coords[0];\n if (scoords.taxon != coords.taxon || scoords.auth != coords.auth || scoords.version != coords.version) {\n continue;\n }\n availableSources.push(source);\n }\n\n localStorage['dalliance.registry.' + cacheHash + '.sources'] = JSON.stringify(availableSources);\n localStorage['dalliance.registry.' + cacheHash + '.last_queried'] = '' + Date.now();\n\n setSources(msh, availableSources, maybeMapping);\n }, function(error) {\n // msh.set(null);\n }, coords);\n}\n\n//\n// Navigation\n//\n\nBrowser.prototype.move = function(pos, soft)\n{\n var wid = this.viewEnd - this.viewStart;\n var nStart = this.viewStart - ((1.0 * pos) / this.scale);\n var nEnd = nStart + wid;\n\n if (!soft) {\n if (this.currentSeqMax > 0 && nEnd > this.currentSeqMax) {\n nEnd = this.currentSeqMax;\n nStart = this.viewEnd - wid;\n }\n if (nStart < 1) {\n nStart = 1;\n nEnd = nStart + wid;\n }\n }\n\n this.setLocation(null, nStart, nEnd, null, soft);\n}\n\nBrowser.prototype.zoomStep = function(delta) {\n var oz = 1.0 * this.zoomSliderValue;\n var nz = oz + delta;\n if (nz < this.zoomMin) {\n nz= this.zoomMin;\n }\n if (nz > this.zoomMax) {\n nz = this.zoomMax;\n }\n\n if (nz != oz) {\n this.zoomSliderValue = nz; // FIXME maybe ought to set inside zoom!\n this.zoom(Math.exp((1.0 * nz) / this.zoomExpt));\n }\n}\n\nBrowser.prototype.zoom = function(factor) {\n this.zoomFactor = factor;\n var viewCenter = Math.round((this.viewStart + this.viewEnd) / 2.0)|0;\n this.viewStart = viewCenter - this.zoomBase * this.zoomFactor / 2;\n this.viewEnd = viewCenter + this.zoomBase * this.zoomFactor / 2;\n if (this.currentSeqMax > 0 && (this.viewEnd > this.currentSeqMax + 5)) {\n var len = this.viewEnd - this.viewStart + 1;\n this.viewEnd = this.currentSeqMax;\n this.viewStart = this.viewEnd - len + 1;\n }\n if (this.viewStart < 1) {\n var len = this.viewEnd - this.viewStart + 1;\n this.viewStart = 1;\n this.viewEnd = this.viewStart + len - 1;\n }\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart)\n var width = this.viewEnd - this.viewStart + 1;\n\n var scaleRat = (this.scale / this.scaleAtLastRedraw);\n\n this.notifyLocation();\n this.refresh();\n}\n\nBrowser.prototype.spaceCheck = function(dontRefresh) {\n if (!this.knownSpace || this.knownSpace.chr !== this.chr) {\n this.refresh();\n return;\n }\n\n var width = ((this.viewEnd - this.viewStart)|0) + 1;\n var minExtraW = (this.minExtraWidth / this.scale)|0;\n var maxExtraW = (this.maxExtraWidth / this.scale)|0;\n\n if ((this.drawnStart|0) > Math.max(1, ((this.viewStart|0) - minExtraW)|0) || (this.drawnEnd|0) < Math.min((this.viewEnd|0) + minExtraW, ((this.currentSeqMax|0) > 0 ? (this.currentSeqMax|0) : 1000000000))) {\n this.refresh();\n }\n}\n\nBrowser.prototype.resizeViewer = function(skipRefresh) {\n var width = this.tierHolder.getBoundingClientRect().width | 0;\n if (width == 0)\n return;\n\n var oldFPW = Math.max(this.featurePanelWidth, 300); // Can get silly values stored\n // when the browser is hidden.\n this.featurePanelWidth = width|0;\n\n if (oldFPW != this.featurePanelWidth) {\n this.zoomMax = this.zoomExpt * Math.log(this.maxViewWidth / this.zoomBase);\n this.zoomMin = this.zoomExpt * Math.log(this.featurePanelWidth / this.maxPixelsPerBase / this.zoomBase); // FIXME hard-coded minimum.\n this.zoomSliderValue = this.zoomExpt * Math.log((this.viewEnd - this.viewStart + 1) / this.zoomBase);\n\n var viewWidth = this.viewEnd - this.viewStart;\n var nve = this.viewStart + (viewWidth * this.featurePanelWidth) / oldFPW;\n\n this.viewEnd = nve;\n\n var wid = this.viewEnd - this.viewStart + 1;\n if (this.currentSeqMax > 0 && this.viewEnd > this.currentSeqMax) {\n this.viewEnd = this.currentSeqMax;\n this.viewStart = this.viewEnd - wid + 1;\n }\n if (this.viewStart < 1) {\n this.viewStart = 1;\n this.viewEnd = this.viewStart + wid - 1;\n }\n\n this.positionRuler();\n\n if (!skipRefresh) {\n this.spaceCheck();\n }\n this.notifyLocation();\n }\n\n if (this.fullScreen) {\n this.setFullScreenHeight();\n }\n}\n\nBrowser.prototype.setFullScreenHeight = function() {\n var rest = document.body.offsetHeight - this.browserHolder.offsetHeight;\n this.browserHolder.style.maxHeight = Math.max(300, window.innerHeight - rest - 20) + 'px'\n}\n\nBrowser.prototype.addTier = function(conf) {\n var thisB = this;\n conf = shallowCopy(conf);\n conf.disabled = false;\n\n return this.makeTier(conf).then(function (tier) {\n thisB.refreshTier(tier);\n thisB.markSelectedTiers();\n thisB.positionRuler();\n thisB.notifyTier(\"added\", tier);\n return tier;\n })\n};\n\n\nBrowser.prototype.removeTier = function(conf, force) {\n var target = -1;\n\n if (typeof conf.index !== 'undefined' && conf.index >=0 && conf.index < this.tiers.length) {\n target = conf.index;\n } else {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var ts = this.tiers[ti].dasSource;\n\n if (sourcesAreEqual(conf, ts)) {\n target = ti; break;\n }\n }\n }\n\n if (target < 0) {\n throw \"Couldn't find requested tier\";\n }\n\n var targetTier = this.tiers[target];\n this.tiers.splice(target, 1);\n\n var nst = [];\n for (var sti = 0; sti < this.selectedTiers.length; ++sti) {\n var st = this.selectedTiers[sti];\n if (st < target) {\n nst.push(st);\n } else if (st > target) {\n nst.push(st - 1);\n }\n }\n this.selectedTiers = nst;\n this.markSelectedTiers();\n\n targetTier.destroy();\n if (this.knownSpace) {\n this.knownSpace.featureCache[targetTier] = null;\n }\n\n this.reorderTiers();\n this.notifyTier(\"removed\", targetTier);\n}\n\nBrowser.prototype.removeAllTiers = function() {\n\tvar thisB = this;\n this.selectedTiers = [];\n this.markSelectedTiers();\n this.tiers.forEach(function (targetTier) {\n targetTier.destroy();\n if (thisB.knownSpace) {\n thisB.knownSpace.featureCache[targetTier] = null;\n }\n });\n this.tiers.length = 0;\n this.reorderTiers();\n this.notifyTier(\"removedAll\", null);\n}\n\nBrowser.prototype.getSequenceSource = function() {\n if (this._sequenceSource === undefined)\n this._sequenceSource = this._getSequenceSource();\n return this._sequenceSource;\n}\n\nBrowser.prototype._getSequenceSource = function() {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (this.tiers[ti].sequenceSource) {\n return this.tiers[ti].sequenceSource;\n }\n }\n\n for (var si = 0; si < this.defaultSources.length; ++si) {\n var s = this.defaultSources[si];\n if (s.provides_entrypoints || s.tier_type == 'sequence' || s.twoBitURI || s.twoBitBlob) {\n if (s.twoBitURI || s.twoBitBlob) {\n return new TwoBitSequenceSource(s);\n } else if (s.ensemblURI) {\n return new EnsemblSequenceSource(s);\n } else {\n return new DASSequenceSource(s);\n }\n }\n }\n}\n\nBrowser.prototype.setLocation = function(newChr, newMin, newMax, callback, soft) {\n if (typeof(newMin) !== 'number') {\n throw Error('minimum must be a number (got ' + JSON.stringify(newMin) + ')');\n }\n if (typeof(newMax) !== 'number') {\n throw Error('maximum must be a number (got ' + JSON.stringify(newMax) + ')');\n }\n\n if (newMin > newMax) {\n var oldNewMin = newMin;\n newMin = newMax;\n newMax = oldNewMin;\n } else if (newMin === newMax) {\n newMax += 1;\n }\n\n if (!callback) {\n callback = function(err) {\n if (err) {\n throw err;\n }\n }\n }\n var thisB = this;\n\n if ((!newChr || newChr == this.chr) && this.currentSeqMax > 0) {\n return this._setLocation(null, newMin, newMax, null, callback, soft);\n } else {\n var ss = this.getSequenceSource();\n if (!ss) {\n return callback('Need a sequence source');\n }\n\n var findChr = newChr || this.chr;\n ss.getSeqInfo(findChr, function(si) {\n if (!si) {\n var altChr;\n if (findChr.indexOf('chr') == 0) {\n altChr = findChr.substr(3);\n } else {\n altChr = 'chr' + findChr;\n }\n ss.getSeqInfo(altChr, function(si2) {\n if (!si2 && newChr) {\n return callback(\"Couldn't find sequence '\" + newChr + \"'\");\n } else if (!si2) {\n return thisB._setLocation(null, newMin, newMax, null, callback, soft);\n } else {\n return thisB._setLocation(altChr, newMin, newMax, si2, callback, soft);\n }\n });\n } else {\n return thisB._setLocation(newChr, newMin, newMax, si, callback, soft);\n }\n });\n }\n}\n\nBrowser.prototype._setLocation = function(newChr, newMin, newMax, newChrInfo, callback, soft) {\n var chrChanged = false;\n if (newChr) {\n if (newChr.indexOf('chr') == 0)\n newChr = newChr.substring(3);\n\n if (this.chr != newChr)\n chrChanged = true;\n this.chr = newChr;\n this.currentSeqMax = newChrInfo.length;\n }\n\n newMin = parseFloat(newMin); newMax=parseFloat(newMax);\n\n var newWidth = Math.max(10, newMax-newMin+1);\n\n if (!soft) {\n var csm = this.currentSeqMax;\n if (csm <= 0)\n csm = 1000000000000;\n if (newMin < 1) {\n newMin = 1; newMax = newMin + newWidth - 1;\n }\n if (newMax > csm) {\n newMax = csm;\n newMin = Math.max(1, newMax - newWidth + 1);\n }\n }\n\n this.viewStart = newMin;\n this.viewEnd = newMax;\n var newScale = Math.max(this.featurePanelWidth || this.offscreenInitWidth, 50) / (this.viewEnd - this.viewStart);\n var oldScale = this.scale;\n var scaleChanged = (Math.abs(newScale - oldScale)) > 0.000001;\n this.scale = newScale;\n\n var newZS, oldZS;\n oldZS = this.zoomSliderValue;\n this.zoomSliderValue = newZS = this.zoomExpt * Math.log((this.viewEnd - this.viewStart + 1) / this.zoomBase);\n\n if (scaleChanged || chrChanged) {\n for (var i = 0; i < this.tiers.length; ++i) {\n this.tiers[i].viewportHolder.style.left = '5000px';\n this.tiers[i].overlay.style.left = '5000px';\n }\n\n this.refresh();\n // var self = this;\n // this.tiers.forEach(function(tier) {self.refreshTier(tier);});\n // this.refreshTier\n\n if (this.savedZoom) {\n newZS -= this.zoomMin;\n oldZS -= this.zoomMin;\n var difToActive = newZS - oldZS;\n var difToSaved = newZS - this.savedZoom;\n if (Math.abs(difToActive) > Math.abs(difToSaved)) {\n this.isSnapZooming = !this.isSnapZooming;\n this.savedZoom = oldZS;\n }\n } else {\n this.isSnapZooming = false;\n this.savedZoom = null;\n }\n } else {\n var viewCenter = (this.viewStart + this.viewEnd)/2;\n\n for (var i = 0; i < this.tiers.length; ++i) {\n var offset = (this.viewStart - this.tiers[i].norigin)*this.scale;\n this.tiers[i].viewportHolder.style.left = '' + ((-offset|0) - 1000) + 'px';\n this.tiers[i].drawOverlay();\n }\n }\n\n this.notifyLocation();\n\n this.spaceCheck();\n if (this.instrumentActivity)\n this.activityStartTime = Date.now()|0;\n return callback();\n}\n\nBrowser.prototype.setCenterLocation = function(newChr, newCenterLoc) {\n var halfWidth = (this.viewEnd - this.viewStart)/2,\n newMin = newCenterLoc - halfWidth,\n newMax = newCenterLoc + halfWidth;\n this.setLocation(newChr, newMin, newMax);\n}\n\nBrowser.prototype.pingActivity = function() {\n if (!this.instrumentActivity || !this.activityStartTime)\n return;\n\n var activity = 0;\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (this.tiers[ti].loaderButton.style.display !== 'none')\n ++activity;\n }\n\n if (activity == 0) {\n var now = Date.now()|0;\n console.log('Loading took ' + (now-this.activityStartTime) + 'ms');\n this.activityStartTime = null;\n }\n}\n\nBrowser.prototype.addInitListener = function(handler) {\n this.initListeners.push(handler);\n}\n\nBrowser.prototype.addFeatureListener = function(handler, opts) {\n opts = opts || {};\n this.featureListeners.push(handler);\n}\n\nBrowser.prototype.removeFeatureListener = function(handler, opts) {\n var idx = arrayIndexOf(this.featureListeners, handler);\n if (idx >= 0) {\n this.featureListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyFeature = function(ev, feature, hit, tier) {\n for (var fli = 0; fli < this.featureListeners.length; ++fli) {\n try {\n if (this.featureListeners[fli](ev, feature, hit, tier))\n return;\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n}\n\nBrowser.prototype.addFeatureHoverListener = function(handler, opts) {\n opts = opts || {};\n this.featureHoverListeners.push(handler);\n}\n\nBrowser.prototype.removeFeatureHoverListener = function(handler, opts) {\n var idx = arrayIndexOf(this.featureHoverListeners, handler);\n if (idx >= 0) {\n this.featureHoverListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyFeatureHover = function(ev, feature, hit, tier) {\n for (var fli = 0; fli < this.featureHoverListeners.length; ++fli) {\n try {\n this.featureHoverListeners[fli](ev, feature, hit, tier);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n}\n\nBrowser.prototype.addViewListener = function(handler, opts) {\n opts = opts || {};\n this.viewListeners.push(handler);\n}\n\nBrowser.prototype.removeViewListener = function(handler, opts) {\n var idx = arrayIndexOf(this.viewListeners, handler);\n if (idx >= 0) {\n this.viewListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyLocation = function() {\n var nvs = Math.max(1, this.viewStart|0);\n var nve = this.viewEnd|0;\n if (this.currentSeqMax > 0 && nve > this.currentSeqMax)\n nve = this.currentSeqMax;\n\n for (var lli = 0; lli < this.viewListeners.length; ++lli) {\n try {\n this.viewListeners[lli](\n this.chr,\n nvs,\n nve,\n this.zoomSliderValue,\n {current: this.zoomSliderValue,\n alternate: (this.savedZoom+this.zoomMin) || this.zoomMin,\n isSnapZooming: this.isSnapZooming,\n min: this.zoomMin,\n max: this.zoomMax},\n this.viewStart,\n this.viewEnd);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n}\n\nBrowser.prototype.addTierListener = function(handler) {\n this.tierListeners.push(handler);\n}\n\nBrowser.prototype.removeTierListener = function(handler) {\n var idx = arrayIndexOf(this.tierListeners, handler);\n if (idx >= 0) {\n this.tierListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyTier = function(status, tier) {\n for (var tli = 0; tli < this.tierListeners.length; ++tli) {\n try {\n this.tierListeners[tli](status, tier);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n}\n\nBrowser.prototype.addRegionSelectListener = function(handler) {\n this.regionSelectListeners.push(handler);\n}\n\nBrowser.prototype.removeRegionSelectListener = function(handler) {\n var idx = arrayIndexOf(this.regionSelectListeners, handler);\n if (idx >= 0) {\n this.regionSelectListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyRegionSelect = function(chr, min, max) {\n for (var rli = 0; rli < this.regionSelectListeners.length; ++rli) {\n try {\n this.regionSelectListeners[rli](chr, min, max);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n}\n\n\nBrowser.prototype.highlightRegion = function(chr, min, max) {\n var thisB = this;\n\n if (chr == this.chr) {\n return this._highlightRegion(chr, min, max);\n }\n\n var ss = this.getSequenceSource();\n if (!ss) {\n throw 'Need a sequence source';\n }\n\n ss.getSeqInfo(chr, function(si) {\n if (!si) {\n var altChr;\n if (chr.indexOf('chr') == 0) {\n altChr = chr.substr(3);\n } else {\n altChr = 'chr' + chr;\n }\n ss.getSeqInfo(altChr, function(si2) {\n if (!si2) {\n // Fail silently.\n } else {\n return thisB._highlightRegion(altChr, min, max);\n }\n });\n } else {\n return thisB._highlightRegion(chr, min, max);\n }\n });\n}\n\nBrowser.prototype._highlightRegion = function(chr, min, max) {\n for (var hi = 0; hi < this.highlights.length; ++hi) {\n var h = this.highlights[hi];\n if (h.chr == chr && h.min == min && h.max == max)\n return;\n }\n\n this.highlights.push(new Region(chr, min, max));\n var visStart = this.viewStart - (1000/this.scale);\n var visEnd = this.viewEnd + (1000/this.scale);\n if ((chr == this.chr || chr == ('chr'+this.chr)) && min < visEnd && max > visStart) {\n this.drawOverlays();\n }\n\n this.notifyLocation();\n}\n\nBrowser.prototype.clearHighlights = function() {\n this.highlights = [];\n this.drawOverlays();\n this.notifyLocation();\n}\n\nBrowser.prototype.drawOverlays = function() {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n this.tiers[ti].drawOverlay();\n }\n}\n\nBrowser.prototype.featuresInRegion = function(chr, min, max) {\n var features = [];\n if (chr !== this.chr) {\n return [];\n }\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var fl = this.tiers[ti].currentFeatures || [];\n for (var fi = 0; fi < fl.length; ++fi) {\n var f = fl[fi];\n if (f.min <= max && f.max >= min) {\n features.push(f);\n }\n }\n }\n return features;\n}\n\n\nBrowser.prototype.getSelectedTier = function() {\n if (this.selectedTiers.length > 0)\n return this.selectedTiers[0];\n else\n return -1;\n}\n\nBrowser.prototype.setSelectedTier = function(t) {\n if (t == null) {\n this.selectedTiers = [];\n } else {\n this.selectedTiers = [t];\n }\n this.markSelectedTiers();\n this.notifyTierSelection();\n}\n\nBrowser.prototype.markSelectedTiers = function() {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var button = this.tiers[ti].nameButton;\n\n if (this.selectedTiers.indexOf(ti) >= 0) {\n button.classList.add('active');\n } else {\n button.classList.remove('active');\n }\n }\n if (this.selectedTiers.length > 0) {\n var browserMid = this.browserHolder.offsetTop + this.browserHolder.offsetHeight/2;\n if (browserMid > document.body.scrollTop && (browserMid + 100) < document.body.scrollTop + window.innerHeight)\n this.browserHolder.focus();\n }\n}\n\nBrowser.prototype.addTierSelectionListener = function(handler) {\n this.tierSelectionListeners.push(handler);\n}\n\nBrowser.prototype.removeTierSelectionListener = function(handler) {\n var idx = arrayIndexOf(this.tierSelectionListeners, handler);\n if (idx >= 0) {\n this.tierSelectionListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyTierSelection = function() {\n for (var fli = 0; fli < this.tierSelectionListeners.length; ++fli) {\n try {\n this.tierSelectionListeners[fli](this.selectedTiers);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n\n}\n\nBrowser.prototype.addTierSelectionWrapListener = function(f) {\n this.tierSelectionWrapListeners.push(f);\n}\n\nBrowser.prototype.removeTierSelectionWrapListener = function(handler) {\n var idx = arrayIndexOf(this.tierSelectionWrapListeners, handler);\n if (idx >= 0) {\n this.tierSelectionWrapListeners.splice(idx, 1);\n }\n}\n\nBrowser.prototype.notifyTierSelectionWrap = function(i) {\n for (var fli = 0; fli < this.tierSelectionWrapListeners.length; ++fli) {\n try {\n this.tierSelectionWrapListeners[fli](i);\n } catch (ex) {\n console.log(ex.stack);\n }\n }\n}\n\n\nBrowser.prototype.positionRuler = function() {\n var display = 'none';\n var left = '';\n var right = '';\n\n if (this.rulerLocation == 'center') {\n display = 'block';\n left = '' + ((this.featurePanelWidth/2)|0) + 'px';\n } else if (this.rulerLocation == 'left') {\n display = 'block';\n left = '0px';\n } else if (this.rulerLocation == 'right') {\n display = 'block';\n right = '0px'\n } else {\n display = 'none';\n }\n\n this.ruler.style.display = display;\n this.ruler.style.left = left;\n this.ruler.style.right = right;\n\n if(this.singleBaseHighlight) {\n this.ruler2.style.display = 'block';\n this.ruler2.style.borderWidth = '1px';\n if (this.scale < 1) {\n this.ruler2.style.width = '0px';\n this.ruler2.style.borderRightWidth = '0px'\n } else {\n this.ruler2.style.width = this.scale + 'px';\n this.ruler2.style.borderRightWidth = '1px'\n }\n // Position accompanying single base location text\n this.locSingleBase.style.visibility = 'visible';\n var centreOffset = this.featurePanelWidth/2 - this.locSingleBase.offsetWidth/2 + this.ruler2.offsetWidth/2;\n this.locSingleBase.style.left = '' + (centreOffset|0) + 'px';\n } else {\n this.locSingleBase.style.visibility = 'hidden';\n this.ruler2.style.width = '1px';\n this.ruler2.style.borderWidth = '0px';\n this.ruler2.style.display = this.rulerLocation == 'center' ? 'none' : 'block';\n }\n\n this.ruler2.style.left = '' + ((this.featurePanelWidth/2)|0) + 'px';\n\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var tier = this.tiers[ti];\n var q = tier.quantOverlay;\n\n var quant;\n if (tier.subtiers && tier.subtiers.length > 0)\n quant = tier.subtiers[0].quant;\n\n if (q) {\n q.style.display = quant ? display : 'none';\n q.style.left = left;\n q.style.right = right;\n }\n }\n}\n\nBrowser.prototype.featureDoubleClick = function(hit, rx, ry) {\n if (!hit || hit.length == 0)\n return;\n\n var f = hit[hit.length - 1];\n\n if (!f.min || !f.max) {\n return;\n }\n\n var fstart = (((f.min|0) - (this.viewStart|0)) * this.scale);\n var fwidth = (((f.max - f.min) + 1) * this.scale);\n\n var newMid = (((f.min|0) + (f.max|0)))/2;\n if (fwidth > 10) {\n var frac = (1.0 * (rx - fstart)) / fwidth;\n if (frac < 0.3) {\n newMid = (f.min|0);\n } else if (frac > 0.7) {\n newMid = (f.max|0) + 1;\n }\n }\n\n var width = this.viewEnd - this.viewStart;\n this.setLocation(null, newMid - (width/2), newMid + (width/2));\n}\n\nBrowser.prototype.zoomForScale = function(scale) {\n var ssScale;\n if (scale > this.highZoomThreshold) {\n ssScale = 'high';\n } else if (scale > this.mediumZoomThreshold) {\n ssScale = 'medium';\n } else {\n ssScale = 'low';\n }\n return ssScale;\n}\n\nBrowser.prototype.zoomForCurrentScale = function() {\n return this.zoomForScale(this.scale);\n}\n\nBrowser.prototype.updateHeight = function() {\n var tierTotal = 0;\n for (var ti = 0; ti < this.tiers.length; ++ti)\n tierTotal += (this.tiers[ti].currentHeight || 30);\n this.ruler.style.height = '' + tierTotal + 'px';\n this.ruler2.style.height = '' + tierTotal + 'px';\n this.browserHolder.style.display = 'block';\n this.browserHolder.style.display = '-webkit-flex';\n this.browserHolder.style.display = 'flex';\n // this.svgHolder.style.maxHeight = '' + Math.max(tierTotal, 500) + 'px';\n}\n\nBrowser.prototype.scrollArrowKey = function(ev, dir) {\n if (this.reverseKeyScrolling)\n dir = -dir;\n\n if (ev.ctrlKey || ev.metaKey) {\n var fedge = false;\n if(ev.shiftKey){\n fedge = true;\n }\n\n this.leap(dir, fedge);\n } else if (this.scale > 1) {\n // per-base scrolling mode, tries to perfectly center.\n var mid = (this.viewStart + this.viewEnd)/2\n var err = mid - Math.round(mid);\n var n = 1;\n if (ev.shiftKey)\n n *= 10;\n if (dir > 0) {\n n = -n;\n n -= err;\n if (err > 0)\n n += 1;\n } else {\n n -= err;\n if (err < 0)\n n -= 1;\n }\n this.setLocation(null, this.viewStart + n, this.viewEnd + n);\n } else {\n this.move(ev.shiftKey ? 100*dir : 25*dir);\n }\n}\n\nBrowser.prototype.leap = function(dir, fedge) {\n var thisB = this;\n var pos=((thisB.viewStart + thisB.viewEnd + 1)/2)|0;\n if (dir > 0 && thisB.viewStart <= 1) {\n pos -= 100000000;\n } else if (dir < 0 && thisB.viewEnd >= thisB.currentSeqMax) {\n pos += 100000000;\n }\n\n var st = thisB.getSelectedTier();\n if (st < 0) return;\n var tier = thisB.tiers[st];\n\n if (tier && ((tier.featureSource && this.sourceAdapterIsCapable(tier.featureSource, 'quantLeap') && typeof(tier.quantLeapThreshold) == 'number')\n || (tier.featureSource && this.sourceAdapterIsCapable(tier.featureSource, 'leap')))) {\n tier.findNextFeature(\n thisB.chr,\n pos,\n -dir,\n fedge,\n function(nxt) {\n if (nxt) {\n var nmin = nxt.min;\n var nmax = nxt.max;\n if (fedge) {\n if (dir > 0) {\n if (nmin>pos+1) {\n nmax=nmin;\n } else {\n nmax++;\n nmin=nmax\n }\n } else {\n if (nmax= 0; --gi) {\n var g = glyphs[gi];\n if (!g.notSelectable && g.min() <= rx && g.max() >= rx) {\n if (g.minY) {\n if (ry < g.minY() || ry > g.maxY())\n continue;\n }\n\n if (g.feature) {\n matches.push(g.feature);\n } else if (g.group) {\n matches.push(g.group);\n }\n\n if (g.glyphs) {\n return glyphLookup(g.glyphs, rx, ry, matches);\n } else if (g.glyph) {\n return glyphLookup([g.glyph], rx, ry, matches);\n } else {\n return matches;\n }\n }\n }\n return matches;\n}\n\nBrowser.prototype.nameForCoordSystem = function(cs) {\n var primary = null, ucsc = null;\n if (this.assemblyNamePrimary) {\n primary = '' + cs.auth;\n if (typeof(cs.version) !== 'undefined')\n primary += cs.version;\n }\n if (this.assemblyNameUcsc) {\n ucsc = cs.ucscName;\n }\n if (primary != null && ucsc != null)\n return primary + '/' + ucsc;\n else\n return primary || ucsc || 'unknown';\n}\n\nBrowser.prototype.makeLoader = function(size) {\n size = size || 16;\n var retina = window.devicePixelRatio > 1;\n if (size < 20) {\n return makeElement('img', null, {src: this.resolveURL('$$img/spinner_' + (retina ? 16 : 32) + '.gif'), width: '16', height: '16'});\n } else {\n return makeElement('img', null, {src: this.resolveURL('$$img/spinner_' + (retina ? 24 : 48) + '.gif'), width: '24', height: '24'});\n }\n}\n\nBrowser.prototype.canFetchPlainHTTP = function() {\n var self = this;\n if (!this._plainHTTPPromise) {\n var worker = this.getWorker();\n if (worker) {\n this._plainHTTPPromise = new Promise(function(resolve, reject) {\n worker.postCommand(\n {command: 'textxhr',\n uri: self.httpCanaryURL},\n function(result, err) {\n if (result) {\n resolve(true);\n } else {\n resolve(false);\n }\n });\n });\n } else {\n this._plainHTTPPromise = new Promise(function(resolve, reject) {\n textXHR(\n self.httpCanaryURL,\n function(result, err) {\n if (result) {\n resolve(true);\n } else {\n resolve(false);\n }\n },\n {timeout: 2000}\n );\n });\n }\n }\n return this._plainHTTPPromise;\n}\n\nBrowser.prototype.getWorker = function() {\n if (!this.useFetchWorkers || !this.fetchWorkers || this.fetchWorkers.length==0)\n return null;\n\n if (this.nextWorker >= this.fetchWorkers.length)\n this.nextWorker = 0;\n return this.fetchWorkers[this.nextWorker++];\n}\n\nBrowser.prototype.registerResolver = function(resolver) {\n var id = 'res' + (++this.resolverSeed);\n this.resolvers[id] = resolver;\n return id;\n}\n\nfunction FetchWorker(browser, worker) {\n var thisB = this;\n this.tagSeed = 0;\n this.callbacks = {};\n this.browser = browser;\n this.worker = worker;\n\n this.worker.onmessage = function(ev) {\n var data = ev.data;\n\n if (!data.cmd) {\n var cb = thisB.callbacks[data.tag];\n if (cb) {\n cb(data.result, data.error);\n delete thisB.callbacks[data.tag];\n }\n } else if (data.cmd == 'resolve') {\n var resolver = thisB.browser.resolvers[data.resolver];\n if (resolver) {\n resolver(data.url).then(function(url) {\n thisB.worker.postMessage({\n tag: data.tag,\n url: url\n });\n }).catch(function(err){\n console.log(err);\n thisB.worker.postMessage({\n tag: data.tag,\n err: err.toString()\n });\n });\n } else {\n console.log('No resolver ' + data.resolver);\n }\n } else {\n console.log('Bad worker callback ' + data.cmd);\n }\n };\n}\n\nfunction makeFetchWorker(browser) {\n var wurl = browser.resolveURL(browser.workerPath);\n if (wurl.indexOf('//') == 0) {\n var proto = window.location.protocol;\n if (proto == 'https:')\n wurl = 'https:' + wurl;\n else\n wurl = 'http:' + wurl;\n }\n\n var wscript = 'importScripts(\"' + wurl + '?version=' + VERSION + '\");';\n var wblob = new Blob([wscript], {type: 'application/javascript'});\n\n\n return new Promise(function(resolve, reject) {\n var worker = new Worker(URL.createObjectURL(wblob));\n\n worker.onmessage = function(ev) {\n if (ev.data.tag === 'init') {\n console.log('Worker initialized');\n resolve(new FetchWorker(browser, worker))\n }\n\n }\n\n worker.onerror = function(ev) {\n reject(ev.message);\n }\n });\n}\n\nFetchWorker.prototype.postCommand = function(cmd, callback, transfer) {\n var tag = 'x' + (++this.tagSeed);\n cmd.tag = tag;\n this.callbacks[tag] = callback;\n this.worker.postMessage(cmd, transfer);\n}\n\nFetchWorker.prototype.terminate = function() {\n this.worker.terminate();\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n Browser: Browser\n };\n\n // Required because they add stuff to Browser.prototype\n require('./browser-ui');\n require('./track-adder');\n require('./feature-popup');\n require('./tier-actions');\n require('./domui');\n require('./search');\n\n var sa = require('./sourceadapters');\n var TwoBitSequenceSource = sa.TwoBitSequenceSource;\n var EnsemblSequenceSource = sa.EnsemblSequenceSource;\n var DASSequenceSource = sa.DASSequenceSource;\n\n var KnownSpace = require('./kspace').KnownSpace;\n\n var DASRegistry = require('./das').DASRegistry;\n}\n\nfunction SourceCache() {\n this.sourcesByURI = {}\n}\n\nSourceCache.prototype.get = function(conf) {\n var scb = this.sourcesByURI[sourceDataURI(conf)];\n if (scb) {\n for (var si = 0; si < scb.configs.length; ++si) {\n if (sourcesAreEqualModuloStyle(scb.configs[si], conf)) {\n return scb.sources[si];\n }\n }\n }\n}\n\nSourceCache.prototype.put = function(conf, source) {\n var uri = sourceDataURI(conf);\n var scb = this.sourcesByURI[uri];\n if (!scb) {\n scb = {configs: [], sources: []};\n this.sourcesByURI[uri] = scb;\n }\n scb.configs.push(conf);\n scb.sources.push(source);\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// chainset.js: liftover support\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var das = require('./das');\n var DASSource = das.DASSource;\n var DASSegment = das.DASSegment;\n\n var utils = require('./utils');\n var pusho = utils.pusho;\n var shallowCopy = utils.shallowCopy;\n\n var parseCigar = require('./cigar').parseCigar;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n\n var bbi = require('./bigwig');\n var makeBwg = bbi.makeBwg;\n\n var Promise = require('es6-promise').Promise;\n}\n\nfunction Chainset(conf, srcTag, destTag, coords) {\n if (typeof(conf) == 'string') {\n this.uri = conf;\n this.srcTag = srcTag;\n this.destTag = destTag;\n this.coords = coords;\n } else {\n this.uri = conf.uri;\n this.srcTag = conf.srcTag;\n this.destTag = conf.destTag;\n this.coords = shallowCopy(conf.coords);\n this.type = conf.type;\n this.credentials = conf.credentials;\n }\n\n this.chainsBySrc = {};\n this.chainsByDest = {};\n this.postFetchQueues = {};\n this.fetchedTiles = {};\n this.granularity = 1000000; // size in bases of tile to fetch\n\n if (this.type == 'bigbed') {\n this.chainFetcher = new BBIChainFetcher(this.uri, this.credentials);\n } else if (this.type == 'alias') {\n this.chainFetcher = new AliasChainFetcher(conf);\n } else {\n this.chainFetcher = new DASChainFetcher(this.uri, this.srcTag, this.destTag);\n }\n};\n\nChainset.prototype.exportConfig = function() {\n return {\n uri: this.uri,\n srcTag: this.srcTag,\n destTag: this.destTag,\n coords: this.coords,\n type: this.type,\n credentials: this.credentials\n };\n}\n\nChainset.prototype.mapPoint = function(chr, pos) {\n var chains = this.chainsBySrc[chr] || [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (pos >= c.srcMin && pos <= c.srcMax) {\n var cpos;\n if (c.srcOri == '-') {\n cpos = c.srcMax - pos;\n } else {\n cpos = pos - c.srcMin;\n }\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n if (cpos >= bSrc && cpos <= (bSrc + bSize)) {\n var apos = cpos - bSrc;\n\n var dpos;\n if (c.destOri == '-') {\n dpos = c.destMax - bDest - apos;\n } else {\n dpos = apos + bDest + c.destMin;\n }\n return {seq: c.destChr, pos: dpos, flipped: (c.srcOri != c.destOri)}\n }\n }\n }\n }\n return null;\n}\n\nChainset.prototype.mapSegment = function(chr, min, max) {\n var chains = this.chainsBySrc[chr] || [];\n var mappings = [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (max >= c.srcMin && min <= c.srcMax) {\n var cmin, cmax;\n if (c.srcOri == '-') {\n cmin = c.srcMax - max;\n cmax = c.srcMax - min;\n } else {\n cmin = min - c.srcMin;\n cmax = max - c.srcMin;\n }\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n if (cmax >= bSrc && cmin <= (bSrc + bSize)) {\n var m = {\n segment: c.destChr,\n flipped: (c.srcOri == '-') ^ (c.destOri == '-')};\n\n if (c.destOri == '-') {\n if (cmin >= bSrc) {\n m.max = c.destMax - bDest - cmin + bSrc;\n } else {\n m.max = c.destMax - bDest;\n m.partialMax = bSrc - cmin;\n }\n if (cmax <= (bSrc + bSize)) {\n m.min = c.destMax - bDest - cmax + bSrc;\n } else {\n m.min = c.destMax - bDest - bSize;\n m.partialMin = cmax - bSrc - bSize;\n }\n } else {\n if (cmin >= bSrc) {\n m.min = c.destMin + bDest + cmin - bSrc;\n } else {\n m.min = c.destMin + bDest;\n m.partialMin = bSrc - cmin;\n }\n if (cmax <= (bSrc + bSize)) {\n m.max = c.destMin + bDest + cmax - bSrc;\n } else {\n m.max = c.destMin + bDest + bSize;\n m.partialMax = cmax - bSrc - bSize;\n }\n }\n mappings.push(m);\n }\n }\n }\n }\n return mappings;\n}\n\nChainset.prototype.unmapPoint = function(chr, pos) {\n var chains = this.chainsByDest[chr] || [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (pos >= c.destMin && pos <= c.destMax) {\n var cpos;\n if (c.srcOri == '-') {\n cpos = c.destMax - pos;\n } else {\n cpos = pos - c.destMin;\n } \n \n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n\n if (cpos >= bDest && cpos <= (bDest + bSize)) {\n var apos = cpos - bDest;\n\n var dpos = apos + bSrc + c.srcMin;\n var dpos;\n if (c.destOri == '-') {\n dpos = c.srcMax - bSrc - apos;\n } else {\n dpos = apos + bSrc + c.srcMin;\n }\n return {seq: c.srcChr, pos: dpos, flipped: (c.srcOri != c.destOri)}\n }\n }\n // return null;\n }\n }\n return null;\n}\n\nChainset.prototype.sourceBlocksForRange = function(chr, min, max, callback) {\n var STATE_PENDING = 1;\n var STATE_FETCHED = 2;\n\n var thisCS = this;\n var minTile = (min/this.granularity)|0;\n var maxTile = (max/this.granularity)|0;\n\n var needsNewOrPending = false;\n var needsNewFetch = false;\n for (var t = minTile; t <= maxTile; ++t) {\n var tn = chr + '_' + t;\n if (this.fetchedTiles[tn] != STATE_FETCHED) {\n needsNewOrPending = true;\n if (this.fetchedTiles[tn] != STATE_PENDING) {\n this.fetchedTiles[tn] = STATE_PENDING;\n needsNewFetch = true;\n }\n }\n }\n\n if (needsNewOrPending) {\n if (!this.postFetchQueues[chr]) {\n this.chainFetcher.fetchChains(\n chr, \n minTile * this.granularity, \n (maxTile+1) * this.granularity - 1)\n .then(function(chains) {\n if (!thisCS.chainsByDest)\n thisCS.chainsByDest[chr] = [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var chain = chains[ci];\n\n {\n var cbs = thisCS.chainsBySrc[chain.srcChr];\n if (!cbs) {\n thisCS.chainsBySrc[chain.srcChr] = [chain];\n } else {\n var present = false;\n for (var oci = 0; oci < cbs.length; ++oci) {\n var oc = cbs[oci];\n if (oc.srcMin == chain.srcMin && oc.srcMax == chain.srcMax) {\n present = true;\n break;\n }\n }\n if (!present)\n cbs.push(chain);\n }\n }\n\n {\n var cbd = thisCS.chainsByDest[chain.destChr];\n if (!cbd) {\n thisCS.chainsByDest[chain.destChr] = [chain];\n } else {\n var present = false;\n for (var oci = 0; oci < cbd.length; ++oci) {\n var oc = cbd[oci];\n if (oc.destMin == chain.destMin && oc.destMax == chain.destMax) {\n present = true;\n break;\n }\n }\n if (!present)\n cbd.push(chain);\n }\n }\n }\n for (var t = minTile; t <= maxTile; ++t) {\n var tn = chr + '_' + t;\n thisCS.fetchedTiles[tn] = STATE_FETCHED;\n }\n if (thisCS.postFetchQueues[chr]) {\n var pfq = thisCS.postFetchQueues[chr];\n for (var i = 0; i < pfq.length; ++i) {\n pfq[i]();\n }\n thisCS.postFetchQueues[chr] = null;\n }\n }).catch(function (err) {\n console.log(err);\n }); \n }\n\n pusho(this.postFetchQueues, chr, function() {\n // Will either succeed if the tiles that are needed have already been fetched,\n // or queue up a new fetch.\n\n thisCS.sourceBlocksForRange(chr, min, max, callback);\n });\n } else {\n var srcBlocks = [];\n var chains = this.chainsByDest[chr] || [];\n for (var ci = 0; ci < chains.length; ++ci) {\n var c = chains[ci];\n if (min <= c.destMax && max >= c.destMin) {\n var cmin, cmax;\n if (c.srcOri == '-') {\n cmin = c.destMax - max;\n cmax = c.destMax - min;\n } else {\n cmin = min - c.destMin;\n cmax = max - c.destMin;\n }\n\n var blocks = c.blocks;\n for (var bi = 0; bi < blocks.length; ++bi) {\n var b = blocks[bi];\n var bSrc = b[0];\n var bDest = b[1];\n var bSize = b[2];\n\n if (cmax >= bDest && cmin <= (bDest + bSize)) {\n var amin = Math.max(cmin, bDest) - bDest;\n var amax = Math.min(cmax, bDest + bSize) - bDest;\n\n if (c.destOri == '-') {\n srcBlocks.push(new DASSegment(c.srcChr, c.srcMax - bSrc - amax, c.srcMax - bSrc - amin));\n } else {\n srcBlocks.push(new DASSegment(c.srcChr, c.srcMin + amin + bSrc, c.srcMin + amax + bSrc));\n }\n }\n }\n }\n }\n callback(srcBlocks);\n }\n}\n\nfunction DASChainFetcher(uri, srcTag, destTag) {\n this.source = new DASSource(uri);\n this.srcTag = srcTag;\n this.destTag =destTag;\n}\n\nDASChainFetcher.prototype.fetchChains = function(chr, _min, _max) {\n var thisCS = this;\n\n return new Promise(function(resolve, reject) {\n thisCS.source.alignments(chr, {}, function(aligns) {\n var chains = [];\n\n for (var ai = 0; ai < aligns.length; ++ai) {\n var aln = aligns[ai];\n for (var bi = 0; bi < aln.blocks.length; ++bi) {\n var block = aln.blocks[bi];\n var srcSeg, destSeg;\n for (var si = 0; si < block.segments.length; ++si) {\n var seg = block.segments[si];\n var obj = aln.objects[seg.object];\n if (obj.dbSource === thisCS.srcTag) {\n srcSeg = seg;\n } else if (obj.dbSource === thisCS.destTag) {\n destSeg = seg;\n }\n }\n if (srcSeg && destSeg) {\n var chain = {\n srcChr: aln.objects[srcSeg.object].accession,\n srcMin: srcSeg.min|0,\n srcMax: srcSeg.max|0,\n srcOri: srcSeg.strand,\n destChr: aln.objects[destSeg.object].accession,\n destMin: destSeg.min|0,\n destMax: destSeg.max|0,\n destOri: destSeg.strand,\n blocks: []\n }\n\n var srcops = parseCigar(srcSeg.cigar), destops = parseCigar(destSeg.cigar);\n\n var srcOffset = 0, destOffset = 0;\n var srci = 0, desti = 0;\n while (srci < srcops.length && desti < destops.length) {\n if (srcops[srci].op == 'M' && destops[desti].op == 'M') {\n var blockLen = Math.min(srcops[srci].cnt, destops[desti].cnt);\n chain.blocks.push([srcOffset, destOffset, blockLen]);\n if (srcops[srci].cnt == blockLen) {\n ++srci;\n } else {\n srcops[srci].cnt -= blockLen;\n }\n if (destops[desti].cnt == blockLen) {\n ++desti;\n } else {\n destops[desti] -= blockLen;\n }\n srcOffset += blockLen;\n destOffset += blockLen;\n } else if (srcops[srci].op == 'I') {\n destOffset += srcops[srci++].cnt;\n } else if (destops[desti].op == 'I') {\n srcOffset += destops[desti++].cnt;\n }\n }\n\n chains.push(chain);\n }\n }\n }\n resolve(chains);\n });\n });\n}\n\nfunction BBIChainFetcher(uri, credentials) {\n var self = this;\n this.uri = uri;\n this.credentials = credentials;\n\n this.bwg = new Promise(function(resolve, reject) {\n makeBwg(new URLFetchable(self.uri, {credentials: self.credentials, \n resolver: self.resolver}), \n function(bwg, err) {\n if (bwg) {\n resolve(bwg);\n } else {\n reject(err);\n }\n });\n });\n\n this.bwg.then(function(bwg, err) {\n if (err)\n console.log(err);\n });\n}\n\nfunction pi(x) {\n return parseInt(x);\n}\n\nfunction cleanChr(c) {\n if (c.indexOf('chr') == 0)\n return c.substr(3);\n else\n return c;\n}\n\nfunction bbiFeatureToChain(feature) {\n var chain = {\n srcChr: cleanChr(feature.srcChrom),\n srcMin: parseInt(feature.srcStart),\n srcMax: parseInt(feature.srcEnd),\n srcOri: feature.srcOri,\n destChr: cleanChr(feature.segment),\n destMin: feature.min - 1, // Convert back from bigbed parser\n destMax: feature.max,\n destOri: feature.ori,\n blocks: []\n };\n var srcStarts = feature.srcStarts.split(',').map(pi);\n var destStarts = feature.destStarts.split(',').map(pi);\n var blockLengths = feature.blockLens.split(',').map(pi);\n for (var bi = 0; bi < srcStarts.length; ++bi) {\n chain.blocks.push([srcStarts[bi], destStarts[bi], blockLengths[bi]]);\n }\n\n return chain;\n}\n\nBBIChainFetcher.prototype.fetchChains = function(chr, min, max) {\n return this.bwg.then(function(bwg, err) {\n if (!bwg)\n throw Error(\"No BWG\");\n\n return new Promise(function(resolve, reject) {\n bwg.getUnzoomedView().readWigData(chr, min, max, function(feats) {\n resolve(feats.map(bbiFeatureToChain));\n });\n });\n });\n};\n\nfunction AliasChainFetcher(conf) {\n this.conf = conf;\n this.forwardAliases = {};\n var sa = conf.sequenceAliases || [];\n for (var ai = 0; ai < sa.length; ++ai) {\n var al = sa[ai];\n if (al.length < 2)\n continue;\n\n var fa = [];\n for (var i = 0; i < al.length - 1; ++i)\n fa.push(al[i]);\n this.forwardAliases[al[al.length - 1]] = fa;\n }\n}\n\nAliasChainFetcher.prototype.fetchChains = function(chr, min, max) {\n var resp = [];\n var fa = this.forwardAliases[chr] || [];\n for (var i = 0; i < fa.length; ++i) {\n resp.push(\n {\n srcChr: fa[i],\n srcMin: 1,\n srcMax: 1000000000,\n srcOri: '+',\n destChr: chr,\n destMin: 1,\n destMax: 1000000000,\n destOri: '+',\n blocks: [[1, 1, 1000000000]]\n });\n }\n\n return Promise.resolve(resp);\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n Chainset: Chainset\n };\n}\n","\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// chainset.js: liftover support\n//\n\nvar CIGAR_REGEXP = new RegExp('([0-9]*)([MIDS])', 'g');\n\nfunction parseCigar(cigar)\n{\n var cigops = [];\n var match;\n while ((match = CIGAR_REGEXP.exec(cigar)) != null) {\n var count = match[1];\n if (count.length == 0) {\n count = 1;\n }\n cigops.push({cnt: count|0, op: match[2]});\n }\n return cigops;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n parseCigar: parseCigar\n };\n}","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// color.js\n//\n\n\"use strict\";\n\nfunction DColour(red, green, blue, name) {\n this.red = red|0;\n this.green = green|0;\n this.blue = blue|0;\n if (name) {\n this.name = name;\n }\n}\n\nDColour.prototype.toSvgString = function() {\n if (!this.name) {\n this.name = \"rgb(\" + this.red + \",\" + this.green + \",\" + this.blue + \")\";\n }\n\n return this.name;\n}\n\nfunction hex2(x) {\n var y = '00' + x.toString(16);\n return y.substring(y.length - 2);\n}\n\nDColour.prototype.toHexString = function() {\n return '#' + hex2(this.red) + hex2(this.green) + hex2(this.blue);\n}\n\nvar palette = {\n red: new DColour(255, 0, 0, 'red'),\n green: new DColour(0, 255, 0, 'green'),\n blue: new DColour(0, 0, 255, 'blue'),\n yellow: new DColour(255, 255, 0, 'yellow'),\n white: new DColour(255, 255, 255, 'white'),\n black: new DColour(0, 0, 0, 'black'),\n gray: new DColour(180, 180, 180, 'gray'),\n grey: new DColour(180, 180, 180, 'grey'),\n lightskyblue: new DColour(135, 206, 250, 'lightskyblue'),\n lightsalmon: new DColour(255, 160, 122, 'lightsalmon'),\n hotpink: new DColour(255, 105, 180, 'hotpink')\n};\n\nvar COLOR_RE = new RegExp('^#([0-9A-Fa-f]{2})([0-9A-Fa-f]{2})([0-9A-Fa-f]{2})$');\nvar CSS_COLOR_RE = /rgb\\(([0-9]+),([0-9]+),([0-9]+)\\)/\n\nfunction dasColourForName(name) {\n var c = palette[name];\n if (!c) {\n var match = COLOR_RE.exec(name);\n if (match) {\n c = new DColour(('0x' + match[1])|0, ('0x' + match[2])|0, ('0x' + match[3])|0, name);\n palette[name] = c;\n } else {\n \t match = CSS_COLOR_RE.exec(name);\n \t if (match) {\n \t\tc = new DColour(match[1]|0, match[2]|0, match[3]|0, name);\n \t\tpalette[name] = c;\n\t } else {\n\t\t console.log(\"couldn't handle color: \" + name);\n\t\t c = palette.black;\n\t\t palette[name] = c;\n\t }\n }\n }\n return c;\n}\n\nfunction makeColourSteps(steps, stops, colours) {\n var dcolours = [];\n for (var ci = 0; ci < colours.length; ++ci) {\n dcolours.push(dasColourForName(colours[ci]));\n }\n\n var grad = [];\n STEP_LOOP:\n for (var si = 0; si < steps; ++si) {\n var rs = (1.0 * si) / (steps-1);\n var score = stops[0] + (stops[stops.length -1] - stops[0]) * rs;\n for (var i = 0; i < stops.length - 1; ++i) {\n if (score >= stops[i] && score <= stops[i+1]) {\n var frac = (score - stops[i]) / (stops[i+1] - stops[i]);\n var ca = dcolours[i];\n var cb = dcolours[i+1];\n\n var fill = new DColour(\n ((ca.red * (1.0 - frac)) + (cb.red * frac))|0,\n ((ca.green * (1.0 - frac)) + (cb.green * frac))|0,\n ((ca.blue * (1.0 - frac)) + (cb.blue * frac))|0\n ).toSvgString();\n grad.push(fill);\n\n continue STEP_LOOP;\n }\n }\n throw 'Bad step';\n }\n\n return grad;\n}\n\nfunction makeGradient(steps, color1, color2, color3) {\n if (color3) {\n return makeColourSteps(steps, [0, 0.5, 1], [color1, color2, color3]);\n } else {\n return makeColourSteps(steps, [0, 1], [color1, color2]);\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n makeColourSteps: makeColourSteps,\n makeGradient: makeGradient,\n dasColourForName: dasColourForName\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// das.js: queries and low-level data model.\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n var pusho = utils.pusho;\n\n var color = require('./color');\n var makeColourSteps = color.makeColourSteps;\n}\n\nvar dasLibErrorHandler = function(errMsg) {\n alert(errMsg);\n}\nvar dasLibRequestQueue = new Array();\n\nfunction DASSegment(name, start, end, description) {\n this.name = name;\n this.start = start;\n this.end = end;\n this.description = description;\n}\nDASSegment.prototype.toString = function() {\n return this.name + ':' + this.start + '..' + this.end;\n};\nDASSegment.prototype.isBounded = function() {\n return this.start && this.end;\n}\nDASSegment.prototype.toDASQuery = function() {\n var q = 'segment=' + this.name;\n if (this.start && this.end) {\n q += (':' + this.start + ',' + this.end);\n }\n return q;\n}\n\n\nfunction DASSource(a1, a2) {\n var options;\n if (typeof a1 == 'string') {\n this.uri = a1;\n options = a2 || {};\n } else {\n options = a1 || {};\n }\n for (var k in options) {\n this[k] = options[k];\n }\n\n if (!this.coords) {\n this.coords = [];\n }\n if (!this.props) {\n this.props = {};\n }\n\n this.dasBaseURI = this.uri;\n if (this.dasBaseURI && this.dasBaseURI.substr(this.uri.length - 1) != '/') {\n this.dasBaseURI = this.dasBaseURI + '/';\n }\n}\n\nDASSource.prototype.getURI = function(uri) {\n if (this.resolver) {\n return this.resolver(uri).then(function (urlOrObj) {\n if (typeof urlOrObj === 'string') {\n return urlOrObj;\n } else {\n return urlOrObj.url;\n }\n });\n } else {\n return Promise.resolve(uri);\n }\n}\n\nfunction DASCoords() {\n}\n\nfunction coordsMatch(c1, c2) {\n return c1.taxon == c2.taxon && c1.auth == c2.auth && c1.version == c2.version;\n}\n\n//\n// DAS 1.6 entry_points command\n//\n\nDASSource.prototype.entryPoints = function(callback) {\n var dasURI = this.dasBaseURI + 'entry_points';\n this.doCrossDomainRequest(dasURI, function(responseXML) {\n if (!responseXML) {\n return callback([]);\n }\n\n var entryPoints = new Array();\n \n var segs = responseXML.getElementsByTagName('SEGMENT');\n for (var i = 0; i < segs.length; ++i) {\n var seg = segs[i];\n var segId = seg.getAttribute('id');\n \n var segSize = seg.getAttribute('size');\n var segMin, segMax;\n if (segSize) {\n segMin = 1; segMax = segSize|0;\n } else {\n segMin = seg.getAttribute('start');\n if (segMin) {\n segMin |= 0;\n }\n segMax = seg.getAttribute('stop');\n if (segMax) {\n segMax |= 0;\n }\n }\n var segDesc = null;\n if (seg.firstChild) {\n segDesc = seg.firstChild.nodeValue;\n }\n entryPoints.push(new DASSegment(segId, segMin, segMax, segDesc));\n } \n callback(entryPoints);\n }); \n}\n\n//\n// DAS 1.6 sequence command\n// Do we need an option to fall back to the dna command?\n//\n\nfunction DASSequence(name, start, end, alpha, seq) {\n this.name = name;\n this.start = start;\n this.end = end;\n this.alphabet = alpha;\n this.seq = seq;\n}\n\nDASSource.prototype.sequence = function(segment, callback) {\n var dasURI = this.dasBaseURI + 'sequence?' + segment.toDASQuery();\n this.doCrossDomainRequest(dasURI, function(responseXML) {\n if (!responseXML) {\n callback([]);\n return;\n } else {\n var seqs = new Array();\n \n var segs = responseXML.getElementsByTagName('SEQUENCE');\n for (var i = 0; i < segs.length; ++i) {\n var seg = segs[i];\n var segId = seg.getAttribute('id');\n var segMin = seg.getAttribute('start');\n var segMax = seg.getAttribute('stop');\n var segAlpha = 'DNA';\n var segSeq = null;\n if (seg.firstChild) {\n var rawSeq = seg.firstChild.nodeValue;\n segSeq = '';\n var idx = 0;\n while (true) {\n var space = rawSeq.indexOf('\\n', idx);\n if (space >= 0) {\n segSeq += rawSeq.substring(idx, space).toUpperCase();\n idx = space + 1;\n } else {\n segSeq += rawSeq.substring(idx).toUpperCase();\n break;\n }\n }\n }\n seqs.push(new DASSequence(segId, segMin, segMax, segAlpha, segSeq));\n }\n \n callback(seqs);\n }\n });\n}\n\n//\n// DAS 1.6 features command\n//\n\nfunction DASFeature() {\n}\n\nfunction DASGroup(id) {\n if (id)\n this.id = id;\n}\n\nfunction DASLink(desc, uri) {\n this.desc = desc;\n this.uri = uri;\n}\n\nDASSource.prototype.features = function(segment, options, callback) {\n options = options || {};\n var thisB = this;\n\n var dasURI;\n if (this.features_uri) {\n dasURI = this.features_uri;\n } else {\n var filters = [];\n\n if (segment) {\n filters.push(segment.toDASQuery());\n } else if (options.group) {\n var g = options.group;\n if (typeof g == 'string') {\n filters.push('group_id=' + g);\n } else {\n for (var gi = 0; gi < g.length; ++gi) {\n filters.push('group_id=' + g[gi]);\n }\n }\n }\n\n if (options.adjacent) {\n var adj = options.adjacent;\n if (typeof adj == 'string') {\n adj = [adj];\n }\n for (var ai = 0; ai < adj.length; ++ai) {\n filters.push('adjacent=' + adj[ai]);\n }\n }\n\n if (options.type) {\n if (typeof options.type == 'string') {\n filters.push('type=' + options.type);\n } else {\n for (var ti = 0; ti < options.type.length; ++ti) {\n filters.push('type=' + options.type[ti]);\n }\n }\n }\n \n if (options.maxbins) {\n filters.push('maxbins=' + options.maxbins);\n }\n \n if (filters.length > 0) {\n dasURI = this.dasBaseURI + 'features?' + filters.join(';');\n } else {\n callback([], 'No filters specified');\n }\n } \n \n\n this.doCrossDomainRequest(dasURI, function(responseXML, req) {\n if (!responseXML) {\n var msg;\n if (req.status == 0) {\n msg = 'server may not support CORS';\n } else {\n msg = 'status=' + req.status;\n }\n callback([], 'Failed request: ' + msg);\n return;\n }\n/* if (req) {\n var caps = req.getResponseHeader('X-DAS-Capabilties');\n if (caps) {\n alert(caps);\n }\n } */\n\n var features = new Array();\n var segmentMap = {};\n\n var segs = responseXML.getElementsByTagName('SEGMENT');\n for (var si = 0; si < segs.length; ++si) {\n var segmentXML = segs[si];\n var segmentID = segmentXML.getAttribute('id');\n segmentMap[segmentID] = {\n min: segmentXML.getAttribute('start'),\n max: segmentXML.getAttribute('stop')\n };\n \n var featureXMLs = segmentXML.getElementsByTagName('FEATURE');\n for (var i = 0; i < featureXMLs.length; ++i) {\n var feature = featureXMLs[i];\n var dasFeature = new DASFeature();\n \n dasFeature.segment = segmentID;\n dasFeature.id = feature.getAttribute('id');\n dasFeature.label = feature.getAttribute('label');\n\n\n/*\n var childNodes = feature.childNodes;\n for (var c = 0; c < childNodes.length; ++c) {\n var cn = childNodes[c];\n if (cn.nodeType == Node.ELEMENT_NODE) {\n var key = cn.tagName;\n //var val = null;\n //if (cn.firstChild) {\n // val = cn.firstChild.nodeValue;\n //}\n dasFeature[key] = 'x';\n }\n } */\n\n\n var spos = elementValue(feature, \"START\");\n var epos = elementValue(feature, \"END\");\n if ((spos|0) > (epos|0)) {\n dasFeature.min = epos|0;\n dasFeature.max = spos|0;\n } else {\n dasFeature.min = spos|0;\n dasFeature.max = epos|0;\n }\n {\n var tec = feature.getElementsByTagName('TYPE');\n if (tec.length > 0) {\n var te = tec[0];\n if (te.firstChild) {\n dasFeature.type = te.firstChild.nodeValue;\n }\n dasFeature.typeId = te.getAttribute('id');\n dasFeature.typeCv = te.getAttribute('cvId');\n }\n }\n dasFeature.type = elementValue(feature, \"TYPE\");\n if (!dasFeature.type && dasFeature.typeId) {\n dasFeature.type = dasFeature.typeId; // FIXME?\n }\n \n dasFeature.method = elementValue(feature, \"METHOD\");\n {\n var ori = elementValue(feature, \"ORIENTATION\");\n if (!ori) {\n ori = '0';\n }\n dasFeature.orientation = ori;\n }\n dasFeature.score = elementValue(feature, \"SCORE\");\n dasFeature.links = dasLinksOf(feature);\n dasFeature.notes = dasNotesOf(feature);\n \n var groups = feature.getElementsByTagName(\"GROUP\");\n for (var gi = 0; gi < groups.length; ++gi) {\n var groupXML = groups[gi];\n var dasGroup = new DASGroup();\n dasGroup.type = groupXML.getAttribute('type');\n dasGroup.id = groupXML.getAttribute('id');\n dasGroup.links = dasLinksOf(groupXML);\n dasGroup.notes = dasNotesOf(groupXML);\n if (!dasFeature.groups) {\n dasFeature.groups = new Array(dasGroup);\n } else {\n dasFeature.groups.push(dasGroup);\n }\n }\n\n // Magic notes. Check with TAD before changing this.\n if (dasFeature.notes) {\n for (var ni = 0; ni < dasFeature.notes.length; ++ni) {\n var n = dasFeature.notes[ni];\n if (n.indexOf('Genename=') == 0) {\n var gg = new DASGroup();\n gg.type='gene';\n gg.id = n.substring(9);\n if (!dasFeature.groups) {\n dasFeature.groups = new Array(gg);\n } else {\n dasFeature.groups.push(gg);\n }\n }\n }\n }\n \n {\n var pec = feature.getElementsByTagName('PART');\n if (pec.length > 0) {\n var parts = [];\n for (var pi = 0; pi < pec.length; ++pi) {\n parts.push(pec[pi].getAttribute('id'));\n }\n dasFeature.parts = parts;\n }\n }\n {\n var pec = feature.getElementsByTagName('PARENT');\n if (pec.length > 0) {\n var parents = [];\n for (var pi = 0; pi < pec.length; ++pi) {\n parents.push(pec[pi].getAttribute('id'));\n }\n dasFeature.parents = parents;\n }\n }\n \n features.push(dasFeature);\n }\n }\n \n callback(features, undefined, segmentMap);\n },\n function (err) {\n callback([], err);\n });\n}\n\nfunction DASAlignment(type) {\n this.type = type;\n this.objects = {};\n this.blocks = [];\n}\n\nDASSource.prototype.alignments = function(segment, options, callback) {\n var dasURI = this.dasBaseURI + 'alignment?query=' + segment;\n this.doCrossDomainRequest(dasURI, function(responseXML) {\n if (!responseXML) {\n callback([], 'Failed request ' + dasURI);\n return;\n }\n\n var alignments = [];\n var aliXMLs = responseXML.getElementsByTagName('alignment');\n for (var ai = 0; ai < aliXMLs.length; ++ai) {\n var aliXML = aliXMLs[ai];\n var ali = new DASAlignment(aliXML.getAttribute('alignType'));\n var objXMLs = aliXML.getElementsByTagName('alignObject');\n for (var oi = 0; oi < objXMLs.length; ++oi) {\n var objXML = objXMLs[oi];\n var obj = {\n id: objXML.getAttribute('intObjectId'),\n accession: objXML.getAttribute('dbAccessionId'),\n version: objXML.getAttribute('objectVersion'),\n dbSource: objXML.getAttribute('dbSource'),\n dbVersion: objXML.getAttribute('dbVersion')\n };\n ali.objects[obj.id] = obj;\n }\n \n var blockXMLs = aliXML.getElementsByTagName('block');\n for (var bi = 0; bi < blockXMLs.length; ++bi) {\n var blockXML = blockXMLs[bi];\n var block = {\n order: blockXML.getAttribute('blockOrder'),\n segments: []\n };\n var segXMLs = blockXML.getElementsByTagName('segment');\n for (var si = 0; si < segXMLs.length; ++si) {\n var segXML = segXMLs[si];\n var seg = {\n object: segXML.getAttribute('intObjectId'),\n min: segXML.getAttribute('start'),\n max: segXML.getAttribute('end'),\n strand: segXML.getAttribute('strand'),\n cigar: elementValue(segXML, 'cigar')\n };\n block.segments.push(seg);\n }\n ali.blocks.push(block);\n } \n \n alignments.push(ali);\n }\n callback(alignments);\n });\n}\n\n\nfunction DASStylesheet() {\n this.styles = [];\n}\n\nDASStylesheet.prototype.pushStyle = function(filters, zoom, style) {\n if (!filters) {\n filters = {type: 'default'};\n }\n var styleHolder = shallowCopy(filters);\n if (zoom) {\n styleHolder.zoom = zoom;\n }\n styleHolder.style = style;\n this.styles.push(styleHolder);\n}\n\nfunction DASStyle() {\n}\n\nfunction parseGradient(grad) {\n var steps = grad.getAttribute('steps');\n if (steps) {\n steps = steps|0;\n } else {\n steps = 50;\n }\n\n var stops = [];\n var colors = [];\n var se = grad.getElementsByTagName('STOP');\n for (var si = 0; si < se.length; ++si) {\n var stop = se[si];\n stops.push(1.0 * stop.getAttribute('score'));\n colors.push(stop.firstChild.nodeValue);\n }\n\n return makeColourSteps(steps, stops, colors);\n}\n\nDASSource.prototype.stylesheet = function(successCB, failureCB) {\n var dasURI, creds = this.credentials;\n if (this.stylesheet_uri) {\n dasURI = this.stylesheet_uri;\n creds = false;\n } else {\n dasURI = this.dasBaseURI + 'stylesheet';\n }\n\n this.getURI(dasURI).then(function(dasURI) {\n doCrossDomainRequest(dasURI, function(responseXML) {\n if (!responseXML) {\n if (failureCB) {\n failureCB();\n } \n return;\n }\n var stylesheet = new DASStylesheet();\n var typeXMLs = responseXML.getElementsByTagName('TYPE');\n for (var i = 0; i < typeXMLs.length; ++i) {\n var typeStyle = typeXMLs[i];\n \n var filter = {};\n filter.type = typeStyle.getAttribute('id'); // Am I right in thinking that this makes DASSTYLE XML invalid? Ugh.\n filter.label = typeStyle.getAttribute('label');\n filter.method = typeStyle.getAttribute('method');\n var glyphXMLs = typeStyle.getElementsByTagName('GLYPH');\n for (var gi = 0; gi < glyphXMLs.length; ++gi) {\n var glyphXML = glyphXMLs[gi];\n var zoom = glyphXML.getAttribute('zoom');\n var glyph = childElementOf(glyphXML);\n var style = new DASStyle();\n style.glyph = glyph.localName;\n var child = glyph.firstChild;\n \n while (child) {\n if (child.nodeType == Node.ELEMENT_NODE) {\n if (child.localName == 'BGGRAD') {\n style[child.localName] = parseGradient(child);\n } else { \n style[child.localName] = child.firstChild.nodeValue;\n }\n }\n child = child.nextSibling;\n }\n stylesheet.pushStyle(filter, zoom, style);\n }\n }\n successCB(stylesheet);\n }, creds);\n }).catch(function(err) {\n console.log(err);\n failureCB();\n });\n}\n\n//\n// sources command\n// \n\nfunction DASRegistry(uri, opts)\n{\n opts = opts || {};\n this.uri = uri;\n this.opts = opts; \n}\n\nDASRegistry.prototype.sources = function(callback, failure, opts)\n{\n if (!opts) {\n opts = {};\n }\n\n var filters = [];\n if (opts.taxon) {\n filters.push('organism=' + opts.taxon);\n }\n if (opts.auth) {\n filters.push('authority=' + opts.auth);\n }\n if (opts.version) {\n filters.push('version=' + opts.version);\n }\n var quri = this.uri;\n if (filters.length > 0) {\n quri = quri + '?' + filters.join('&'); // '&' as a separator to hack around dasregistry.org bug.\n }\n\n doCrossDomainRequest(quri, function(responseXML) {\n if (!responseXML && failure) {\n failure();\n return;\n }\n\n var sources = []; \n var sourceXMLs = responseXML.getElementsByTagName('SOURCE');\n for (var si = 0; si < sourceXMLs.length; ++si) {\n var sourceXML = sourceXMLs[si];\n var versionXMLs = sourceXML.getElementsByTagName('VERSION');\n if (versionXMLs.length < 1) {\n continue;\n }\n var versionXML = versionXMLs[0];\n\n var coordXMLs = versionXML.getElementsByTagName('COORDINATES');\n var coords = [];\n for (var ci = 0; ci < coordXMLs.length; ++ci) {\n var coordXML = coordXMLs[ci];\n var coord = new DASCoords();\n coord.auth = coordXML.getAttribute('authority');\n coord.taxon = coordXML.getAttribute('taxid');\n coord.version = coordXML.getAttribute('version');\n coords.push(coord);\n }\n \n var caps = [];\n var capXMLs = versionXML.getElementsByTagName('CAPABILITY');\n var uri;\n for (var ci = 0; ci < capXMLs.length; ++ci) {\n var capXML = capXMLs[ci];\n \n caps.push(capXML.getAttribute('type'));\n\n if (capXML.getAttribute('type') == 'das1:features') {\n var fep = capXML.getAttribute('query_uri');\n uri = fep.substring(0, fep.length - ('features'.length));\n }\n }\n\n var props = {};\n var propXMLs = versionXML.getElementsByTagName('PROP');\n for (var pi = 0; pi < propXMLs.length; ++pi) {\n pusho(props, propXMLs[pi].getAttribute('name'), propXMLs[pi].getAttribute('value'));\n }\n \n if (uri) {\n var source = new DASSource(uri, {\n source_uri: sourceXML.getAttribute('uri'),\n name: sourceXML.getAttribute('title'),\n desc: sourceXML.getAttribute('description'),\n coords: coords,\n props: props,\n capabilities: caps\n });\n sources.push(source);\n }\n }\n \n callback(sources);\n });\n}\n\n\n//\n// Utility functions\n//\n\nfunction elementValue(element, tag)\n{\n var children = element.getElementsByTagName(tag);\n if (children.length > 0 && children[0].firstChild) {\n var c = children[0];\n if (c.childNodes.length == 1) {\n return c.firstChild.nodeValue;\n } else {\n var s = '';\n for (var ni = 0; ni < c.childNodes.length; ++ni) {\n s += c.childNodes[ni].nodeValue;\n }\n return s;\n }\n\n } else {\n return null;\n }\n}\n\nfunction childElementOf(element)\n{\n if (element.hasChildNodes()) {\n var child = element.firstChild;\n do {\n if (child.nodeType == Node.ELEMENT_NODE) {\n return child;\n } \n child = child.nextSibling;\n } while (child != null);\n }\n return null;\n}\n\n\nfunction dasLinksOf(element)\n{\n var links = new Array();\n var maybeLinkChilden = element.getElementsByTagName('LINK');\n for (var ci = 0; ci < maybeLinkChilden.length; ++ci) {\n var linkXML = maybeLinkChilden[ci];\n if (linkXML.parentNode == element) {\n links.push(new DASLink(linkXML.firstChild ? linkXML.firstChild.nodeValue : 'Unknown', linkXML.getAttribute('href')));\n }\n }\n \n return links;\n}\n\nfunction dasNotesOf(element)\n{\n var notes = [];\n var maybeNotes = element.getElementsByTagName('NOTE');\n for (var ni = 0; ni < maybeNotes.length; ++ni) {\n if (maybeNotes[ni].firstChild) {\n notes.push(maybeNotes[ni].firstChild.nodeValue);\n }\n }\n return notes;\n}\n\nfunction doCrossDomainRequest(url, handler, credentials, custAuth) {\n // TODO: explicit error handlers?\n\n if (window.XDomainRequest) {\n var req = new XDomainRequest();\n req.onload = function() {\n var dom = new ActiveXObject(\"Microsoft.XMLDOM\");\n dom.async = false;\n dom.loadXML(req.responseText);\n handler(dom);\n }\n req.open(\"get\", url);\n req.send();\n } else {\n try {\n var req = new XMLHttpRequest();\n var timeout = setTimeout(\n function() {\n console.log('timing out ' + url);\n req.abort();\n handler(null, req);\n },\n 5000\n );\n\n req.ontimeout = function() {\n console.log('timeout on ' + url);\n };\n\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n clearTimeout(timeout);\n if (req.status >= 200 || req.status == 0) {\n handler(req.responseXML, req);\n }\n }\n };\n req.open(\"get\", url, true);\n // IE10/11 fix: The timeout property may be set only in the time interval between a call to the open method\n // and the first call to the send method.\n req.timeout = 5000;\n if (credentials) {\n req.withCredentials = true;\n }\n if (custAuth) {\n req.setRequestHeader('X-DAS-Authorisation', custAuth);\n }\n req.overrideMimeType('text/xml');\n req.setRequestHeader('Accept', 'application/xml,*/*');\n req.send();\n } catch (e) {\n handler(null, req, e);\n }\n }\n}\n\nDASSource.prototype.doCrossDomainRequest = function(url, handler, errHandler) {\n var custAuth;\n if (this.xUser) {\n custAuth = 'Basic ' + btoa(this.xUser + ':' + this.xPass);\n }\n\n try {\n return doCrossDomainRequest(url, handler, this.credentials, custAuth);\n } catch (err) {\n if (errHandler) {\n errHandler(err);\n } else {\n throw err;\n }\n }\n}\n\nfunction isDasBooleanTrue(s) {\n s = ('' + s).toLowerCase();\n return s==='yes' || s==='true';\n}\n\nfunction isDasBooleanNotFalse(s) {\n if (!s)\n return false;\n\n s = ('' + s).toLowerCase();\n return s!=='no' || s!=='false';\n}\n\nfunction copyStylesheet(ss) {\n var nss = shallowCopy(ss);\n nss.styles = [];\n for (var si = 0; si < ss.styles.length; ++si) {\n var sh = nss.styles[si] = shallowCopy(ss.styles[si]);\n sh._methodRE = sh._labelRE = sh._typeRE = undefined;\n sh.style = shallowCopy(sh.style);\n sh.style.id = undefined;\n sh.style._gradient = undefined;\n }\n return nss;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n DASGroup: DASGroup,\n DASFeature: DASFeature,\n DASStylesheet: DASStylesheet,\n DASStyle: DASStyle,\n DASSource: DASSource,\n DASSegment: DASSegment,\n DASRegistry: DASRegistry,\n DASSequence: DASSequence,\n DASLink: DASLink,\n\n isDasBooleanTrue: isDasBooleanTrue,\n isDasBooleanNotFalse: isDasBooleanNotFalse,\n copyStylesheet: copyStylesheet,\n coordsMatch: coordsMatch\n };\n}\n","/* jshint esversion: 6 */\n\"use strict\";\n\nimport { SubTier } from \"./feature-draw.js\";\n\nimport { drawSeqTier } from \"./sequence-draw.js\";\n\n\nimport { Range, union } from \"./spans.js\";\n\nimport { shallowCopy, pusho } from \"./utils.js\";\n\n\nimport * as Glyphs from \"./glyphs.js\";\n\nimport { isDasBooleanTrue,\n isDasBooleanNotFalse,\n DASFeature } from \"./das.js\";\n\nimport { makeGradient } from \"./color.js\";\n\nimport { parseCigar } from \"./cigar.js\";\n\nimport { formatQuantLabel } from \"./numformats\";\n\nimport * as R from \"ramda\";\n\n// The only functions that must be exported by a renderer are renderTier\n// and drawTier, the rest are exported for use in other renderers.\nexport { renderTier,\n drawTier,\n prepareSubtiers,\n prepareViewport,\n paint,\n drawUnmapped,\n clearViewport,\n createQuantOverlay,\n paintQuant\n };\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\nfunction drawTier(tier) {\n let canvas = tier.viewport.getContext(\"2d\");\n let retina = tier.browser.retina && window.devicePixelRatio > 1;\n\n if (tier.sequenceSource) {\n let sequence = tier.currentSequence;\n drawSeqTier(tier, sequence);\n } else if (tier.currentFeatures) {\n prepareSubtiers(tier, canvas);\n } else {\n console.log(\"No sequence or features in tier!\");\n }\n\n if (tier.subtiers) {\n let vOffset = R.defaultTo(0, tier.dasSource.vOffset);\n\n prepareViewport(tier, canvas, retina, true, vOffset); // NB calls canvas.save\n paint(tier, canvas, vOffset);\n canvas.restore();\n }\n\n tier.drawOverlay();\n tier.paintQuant();\n\n if (typeof(tier.dasSource.drawCallback) === \"function\") {\n tier.dasSource.drawCallback(canvas, tier);\n }\n\n tier.originHaxx = 0;\n tier.browser.arrangeTiers();\n}\n\nfunction glyphsForGroup(canvas, features, y, groupElement, tier) {\n let gstyle = tier.styleForFeature(groupElement);\n let label;\n let labelWanted = false;\n\n let glyphs = [];\n let strand = null;\n\n features.forEach(f => {\n if (f.orientation && strand === null) {\n strand = f.orientation;\n }\n\n if (!label && f.label) {\n label = f.label;\n }\n\n let style = tier.styleForFeature(f);\n if (style && !f.parts) {\n if (isDasBooleanTrue(style.LABEL))\n labelWanted = true;\n\n let glyph = glyphForFeature(canvas, f, y, style, tier, null, true);\n if (glyph)\n glyphs.push(glyph);\n }\n });\n\n if (glyphs.length === 0)\n return null;\n\n let connector = 'flat';\n if (gstyle && gstyle.glyph === 'LINE') {\n // Stick with flat...\n } else {\n if (tier.dasSource.collapseSuperGroups && !tier.bumped) {\n if (strand === '+' || strand === '-') {\n connector = 'collapsed' + strand;\n }\n } else {\n if (strand === '+' || strand === '-') {\n connector = 'hat' + strand;\n }\n }\n }\n\n let labelText = null;\n if ((label && labelWanted) ||\n (gstyle && (isDasBooleanTrue(gstyle.LABEL) ||\n isDasBooleanTrue(gstyle.LABELS)))) { // HACK, LABELS should work.\n labelText = groupElement.label || label;\n }\n\n glyphs.sort((g1, g2) => (g1.zindex || 0) - (g2.zindex || 0));\n\n let groupGlyph = new Glyphs.GroupGlyph(glyphs, connector);\n if (labelText) {\n if (strand === '+') {\n labelText = '>' + labelText;\n } else if (strand === '-') {\n labelText = '<' + labelText;\n }\n groupGlyph = new Glyphs.LabelledGlyph(canvas, groupGlyph, labelText, false);\n }\n groupGlyph.bump = true;\n return groupGlyph;\n}\n\nfunction glyphForFeature(canvas, feature, y, style, tier, forceHeight, noLabel) {\n let scale = tier.browser.scale;\n let origin = tier.browser.viewStart;\n let glyphType = style.glyph || 'BOX';\n\n let min = feature.min;\n let max = feature.max;\n let strand = feature.orientation;\n let score = feature.score;\n let label = feature.label || feature.id;\n\n // Hide glyphs that are smaller than a pixel in width.\n if (tier.dasSource.hideSubpixelGlyphs && (max - min) * scale < 1) return null;\n\n let minPos = (min - origin) * scale;\n let rawMaxPos = ((max - origin + 1) * scale);\n let maxPos = Math.max(rawMaxPos, minPos + 1);\n\n forceHeight = forceHeight * 1.0;\n let height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n height = height * 1.0;\n let bump = style.BUMP && isDasBooleanTrue(style.BUMP);\n\n let glyph;\n let quant;\n\n // Create the glyph\n if (glyphType === 'CROSS' ||\n glyphType === 'EX' ||\n glyphType === 'TRIANGLE' ||\n glyphType === 'DOT' ||\n glyphType === 'SQUARE' ||\n glyphType === 'STAR' ||\n glyphType === 'PLIMSOLL') {\n const glyphHolder = featureToCrossLikeGlyph(canvas, tier, feature, y,\n glyphType, style, forceHeight, noLabel);\n if (glyphHolder) { \n [glyph, quant] = glyphHolder;\n }\n } else if (glyphType === 'HISTOGRAM' || glyphType === 'GRADIENT' && score !== 'undefined') {\n [glyph, quant] = featureToGradientLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight);\n\n } else if (glyphType === 'HIDDEN') {\n glyph = new Glyphs.PaddedGlyph(null, minPos, maxPos);\n noLabel = true;\n\n } else if (glyphType === 'ARROW') {\n let color = style.FGCOLOR || 'purple';\n let parallel = isDasBooleanTrue(style.PARALLEL);\n let sw = isDasBooleanTrue(style.SOUTHWEST);\n let ne = isDasBooleanTrue(style.NORTHEAST);\n glyph = new Glyphs.ArrowGlyph(minPos, maxPos, height, color, parallel, sw, ne);\n\n } else if (glyphType === 'ANCHORED_ARROW') {\n let stroke = style.FGCOLOR || 'none';\n let fill = style.BGCOLOR || 'green';\n glyph = new Glyphs.AArrowGlyph(minPos, maxPos, height, fill, stroke, strand);\n glyph.bump = true;\n\n } else if (glyphType === 'SPAN') {\n let stroke = style.FGCOLOR || 'black';\n glyph = new Glyphs.SpanGlyph(minPos, maxPos, height, stroke);\n\n } else if (glyphType === 'LINE') {\n let stroke = style.FGCOLOR || 'black';\n let lineStyle = style.STYLE || 'solid';\n glyph = new Glyphs.LineGlyph(minPos, maxPos, height, lineStyle, strand, stroke);\n\n } else if (glyphType === 'PRIMERS') {\n let stroke = style.FGCOLOR || 'black';\n let fill = style.BGCOLOR || 'red';\n glyph = new Glyphs.PrimersGlyph(minPos, maxPos, height, fill, stroke);\n\n } else if (glyphType === 'TEXT') {\n let string = style.STRING || 'text';\n let fill = style.FGCOLOR || 'black';\n glyph = new Glyphs.TextGlyph(canvas, minPos, maxPos, height, fill, string);\n\n } else if (glyphType === 'TOOMANY') {\n let stroke = style.FGCOLOR || 'gray';\n let fill = style.BGCOLOR || 'orange';\n glyph = new Glyphs.TooManyGlyph(minPos, maxPos, height, fill, stroke);\n\n } else if (glyphType === 'POINT') {\n [glyph, quant] = featureToPointGlyph(tier, feature, style);\n\n } else if (glyphType === '__SEQUENCE') {\n glyph = sequenceGlyph(canvas, tier, feature, style, forceHeight);\n\n } else if (glyphType === '__INSERTION') {\n let insertionLabels = true;\n if (style.__INSERTIONS !== undefined)\n insertionLabels = isDasBooleanNotFalse(style.__INSERTIONS)\n glyph = new Glyphs.TriangleGlyph(minPos, 5, 'S', 5, tier.browser.baseColors['I']);\n if (insertionLabels)\n glyph = new Glyphs.LabelledGlyph(canvas, glyph, feature.insertion || feature.altAlleles[0], false, 'center', 'above', '7px sans-serif');\n\n if ((maxPos - minPos) > 1) {\n let stroke = style.FGCOLOR || 'red';\n let fill = style.BGCOLOR || style.COLOR1 || 'green';\n let bg = new Glyphs.BoxGlyph(minPos, 5, (maxPos - minPos), height, fill, stroke);\n glyph = new Glyphs.GroupGlyph([bg, glyph]);\n }\n\n } else if (glyphType === '__NONE') {\n return null;\n\n } else if (glyphType === 'BOX') {\n let stroke = style.FGCOLOR || null;\n let fill = style.BGCOLOR || style.COLOR1 || 'green';\n if (style.BGITEM && feature.itemRgb)\n fill = feature.itemRgb;\n let scale = (maxPos - minPos) / (max - min);\n if (feature.type == 'translation' &&\n (feature.method == 'protein_coding' || feature.readframeExplicit) &&\n (!feature.tags || feature.tags.indexOf('cds_start_NF') < 0 || feature.readframeExplicit) &&\n (!tier.dasSource.collapseSuperGroups || tier.bumped) &&\n scale >= 0.5) {\n let refSeq = getRefSeq(tier, min, max);\n glyph = new Glyphs.AminoAcidGlyph(minPos,\n maxPos,\n height,\n fill,\n refSeq,\n feature.orientation,\n feature.readframe);\n } else {\n glyph = new Glyphs.BoxGlyph(minPos, 0, (maxPos - minPos),\n height, fill, stroke);\n }\n }\n\n if (!glyph)\n return;\n \n if ((isDasBooleanTrue(style.LABEL) || feature.forceLabel) &&\n label && !noLabel) {\n glyph = new Glyphs.LabelledGlyph(canvas, glyph, label, false);\n }\n\n if (bump) {\n glyph.bump = true;\n }\n\n glyph.feature = feature;\n\n if (isDasBooleanTrue(style[\"HIDEAXISLABEL\"]))\n quant = null;\n\n if (quant) {\n glyph.quant = quant;\n }\n\n if (style.ZINDEX) {\n glyph.zindex = style.ZINDEX | 0;\n }\n\n return glyph;\n}\n\n\nfunction groupFeatures(tier, canvas, y) {\n let glyphs = [];\n let gbsFeatures = {};\n let gbsStyles = {};\n let stackedFeatures = [];\n\n R.map(features => {\n features.forEach(feature => {\n let style = tier.styleForFeature(feature);\n\n if (feature.parts || !style)\n return;\n\n if (style.glyph === 'LINEPLOT') {\n pusho(gbsFeatures, style.id, feature);\n gbsStyles[style.id] = style;\n } else if (style.glyph === 'STACKED') {\n stackedFeatures.push(feature);\n } else {\n let glyph = glyphForFeature(canvas, feature, y, style, tier);\n if (glyph)\n glyphs.push(glyph);\n }\n });\n }, tier.ungroupedFeatures);\n\n if (stackedFeatures.length > 0) {\n glyphs = glyphs.concat(makeStackedBars(stackedFeatures, tier));\n }\n \n for (let gbs in gbsFeatures) {\n let gf = gbsFeatures[gbs];\n let style = gbsStyles[gbs];\n if (style.glyph === 'LINEPLOT') {\n let lineGraphGlyphs = makeLinePlot(gf, style, tier, y);\n lineGraphGlyphs.forEach(g => glyphs.push(g));\n }\n }\n\n return glyphs;\n}\n\nfunction glyphifyGroups(tier, canvas, glyphs, y) {\n let groupIds = Object.keys(tier.groupedFeatures);\n let groupGlyphs = {};\n\n groupIds.sort((g1, g2) =>\n tier.groupedFeatures[g2][0].score - tier.groupedFeatures[g1][0].score);\n\n\n groupIds.forEach(gId => {\n let glyphs = glyphsForGroup(canvas, tier.groupedFeatures[gId], y, tier.groups[gId], tier,\n (tier.dasSource.collapseSuperGroups && !tier.bumped) ?\n 'collapsed_gene' : 'tent');\n\n if (glyphs) {\n glyphs.group = tier.groups[gId];\n groupGlyphs[gId] = glyphs;\n }\n });\n\n return groupGlyphs;\n}\n\nfunction bumpSubtiers(tier, glyphs, grid, gridOffset, gridSpacing) {\n let subtierMax =\n tier.subtierMax ||\n tier.dasSource.subtierMax ||\n tier.browser.defaultSubtierMax;\n\n let subtiersExceeded = false;\n\n let unbumpedST = new SubTier();\n let bumpedSTs = [];\n\n // We want to add each glyph to either the subtier\n // containing unbumped subtiers, or to the first bumped subtier.\n glyphs.forEach(glyph => {\n // if the glyph is to be bumped...\n if (glyph.bump &&\n (tier.bumped ||\n tier.dasSource.collapseSuperGroups)) {\n\n let glyphTier = bumpedSTs.find(st => st.hasSpaceFor(glyph));\n\n if (glyphTier) {\n glyphTier.add(glyph);\n } else if (bumpedSTs.length >= subtierMax) {\n subtiersExceeded = true;\n } else {\n let subtier = new SubTier();\n subtier.add(glyph);\n bumpedSTs.push(subtier);\n }\n } else {\n unbumpedST.add(glyph);\n }\n });\n\n if (unbumpedST.glyphs.length > 0) {\n bumpedSTs = [unbumpedST].concat(bumpedSTs);\n }\n\n // Simple hack to make the horizontal grid in bumped subtiers (e.g. lineplots)\n // optional and configurable.\n if (grid) {\n bumpedSTs.forEach(subtier => {\n if (subtier.quant) {\n subtier.glyphs.unshift(new Glyphs.GridGlyph(subtier.height, gridOffset, gridSpacing));\n }\n });\n }\n\n bumpedSTs.forEach(subtier => {\n subtier.glyphs.sort((g1, g2) => (g1.zindex || 0) - (g2.zindex || 0));\n });\n\n return [bumpedSTs, subtiersExceeded];\n}\n\n// The whole tier is translated downward on its canvas by y pixels\nfunction prepareSubtiers(tier, canvas, y=0, grid=true) {\n\n let MIN_PADDING = 3;\n tier.padding = typeof(tier.dasSource.padding) === 'number' ?\n tier.dasSource.padding : MIN_PADDING;\n\n tier.scaleVertical = typeof(tier.dasSource.scaleVertical) === 'boolean' ?\n tier.dasSource.scaleVertical : false;\n\n let glyphs = groupFeatures(tier, canvas, y);\n\n // Merge supergroups\n if (tier.dasSource.collapseSuperGroups && !tier.bumped) {\n for (let sgId in tier.superGroups) {\n let sgGroup = tier.superGroups[sgId];\n tier.groups[sgId] = shallowCopy(tier.groups[sgId]);\n let group = tier.groups[sgId];\n group.isSuperGroup = true;\n let featuresByType = {};\n\n let sgMin = 10000000000, sgMax = -10000000000;\n let sgSeg = null;\n\n sgGroup.forEach((g, i) => {\n let groupedFeature = tier.groupedFeatures[sgGroup[i]];\n if (!groupedFeature)\n return;\n\n groupedFeature.forEach(feature => {\n pusho(featuresByType, feature.type, feature);\n sgMin = Math.min(feature.min, sgMin);\n sgMax = Math.max(feature.max, sgMax);\n if (feature.segment && !sgSeg)\n sgSeg = feature.segment;\n });\n\n if (group && !group.links || group.links.length === 0) {\n group.links = tier.groups[sgGroup[0]].links;\n }\n\n delete tier.groupedFeatures[sgGroup[i]];\n\n });\n\n tier.groups[sgId].max = sgMax;\n tier.groups[sgId].min = sgMin;\n tier.groups[sgId].segment = sgSeg;\n\n R.map(features => {\n\n let template = features[0];\n let loc = null;\n\n features.forEach(feature => {\n let fl = new Range(feature.min, feature.max);\n loc = loc ? union(loc, fl) : fl;\n });\n\n let mergedRanges = loc.ranges();\n\n mergedRanges.forEach(range => {\n let posCoverage = ((range.max() | 0) - (range.min() | 0) + 1) * sgGroup.length;\n let actCoverage = 0;\n\n features.forEach(feature => {\n let fmin = feature.min || 0;\n let fmax = feature.max || 0;\n if (fmin <= range.max() && fmax >= range.min()) {\n\n actCoverage += (Math.min(fmax, range.max()) -\n Math.max(fmin, range.min()) + 1);\n }\n });\n\n let newFeature = new DASFeature();\n for (let key in template) {\n newFeature[key] = template[key];\n }\n\n newFeature.min = range.min();\n newFeature.max = range.max();\n if (newFeature.label && sgGroup.length > 1) {\n newFeature.label += ' (' + sgGroup.length + ' vars)';\n }\n\n newFeature.visualWeight = ((1.0 * actCoverage) / posCoverage);\n\n pusho(tier.groupedFeatures, sgId, newFeature);\n });\n }, featuresByType);\n\n delete tier.superGroups[sgId]; // Do we want this?\n }\n }\n\n // Glyphify groups.\n let groupGlyphs = glyphifyGroups(tier, canvas, glyphs, y);\n\n R.map(superGroup => {\n let sgGlyphs = [];\n let sgMin = 10000000000;\n let sgMax = -10000000000;\n\n superGroup.forEach(glyphs => {\n let gGlyphs = groupGlyphs[glyphs];\n if (gGlyphs) {\n sgGlyphs.push(gGlyphs);\n sgMin = Math.min(sgMin, gGlyphs.min());\n sgMax = Math.max(sgMax, gGlyphs.max());\n }\n });\n\n sgGlyphs.forEach(glyph => {\n glyphs.push(new Glyphs.PaddedGlyph(glyph, sgMin, sgMax));\n });\n }, tier.superGroups);\n\n R.map(glyph => glyphs.push(glyph), groupGlyphs);\n\n let [subtiers, subtiersExceeded] = bumpSubtiers(tier, glyphs, grid, y);\n\n tier.glyphCacheOrigin = tier.browser.viewStart;\n\n if (subtiersExceeded)\n tier.updateStatus('Bumping limit exceeded, use the track editor to see more features');\n else\n tier.updateStatus();\n\n tier.subtiers = subtiers;\n}\n\n// Fills out areas that haven't been fetched as gray blocks\nfunction drawUnmapped(tier, canvas, padding) {\n let drawStart = tier.browser.viewStart - 1000.0/tier.browser.scale;\n let drawEnd = tier.browser.viewEnd + 1000.0/tier.browser.scale;\n let unmappedBlocks = [];\n if (tier.knownCoverage) {\n let knownRanges = tier.knownCoverage.ranges();\n knownRanges.forEach((range, index) => {\n if (index === 0) {\n if (range.min() > drawStart)\n unmappedBlocks.push({min: drawStart, max: range.min() - 1});\n } else {\n unmappedBlocks.push({min: knownRanges[index-1].max() + 1, max: range.min() - 1});\n }\n\n if (index == knownRanges.length - 1 && range.max() < drawEnd) {\n unmappedBlocks.push({min: range.max() + 1, max: drawEnd});\n }\n });\n }\n if (unmappedBlocks.length > 0) {\n canvas.fillStyle = 'gray';\n unmappedBlocks.forEach(block => {\n let min = (block.min - tier.browser.viewStart) * tier.browser.scale + 1000;\n let max = (block.max - tier.browser.viewStart) * tier.browser.scale + 1000;\n canvas.fillRect(min, 0, max - min, padding);\n });\n }\n}\n\nfunction clearViewport(canvas, width, height) {\n canvas.clearRect(0, 0, width, height);\n}\n\n// Make the viewport & canvas the correct size for the tier\nfunction prepareViewport(tier, canvas, retina, clear=true, vOffset=0) {\n let desiredWidth = tier.browser.featurePanelWidth + 2000;\n if (retina) {\n desiredWidth *= 2;\n }\n\n let fpw = tier.viewport.width|0;\n if (fpw < desiredWidth - 50) {\n tier.viewport.width = fpw = desiredWidth;\n }\n\n let lh = tier.padding + vOffset;\n\n tier.subtiers.forEach(s => lh += s.height + tier.padding);\n\n lh += 6;\n lh = Math.max(lh, tier.browser.minTierHeight);\n\n let canvasHeight = lh;\n if (retina) {\n canvasHeight *= 2;\n }\n\n if (canvasHeight != tier.viewport.height) {\n tier.viewport.height = canvasHeight;\n }\n\n tier.viewportHolder.style.left = '-1000px';\n tier.viewport.style.width = retina ? ('' + (fpw/2) + 'px') : ('' + fpw + 'px');\n tier.viewport.style.height = '' + lh + 'px';\n tier.layoutHeight = Math.max(lh, tier.browser.minTierHeight);\n\n tier.updateHeight();\n tier.norigin = tier.browser.viewStart;\n\n canvas.save();\n if (retina) {\n canvas.scale(2, 2);\n }\n\n if (clear) {\n clearViewport(canvas, fpw, canvasHeight);\n }\n\n drawUnmapped(tier, canvas, lh);\n\n}\n\nfunction paint(tier, canvas, vOffset=0) {\n let overlayLabelCanvas = new Glyphs.OverlayLabelCanvas();\n let offset = ((tier.glyphCacheOrigin - tier.browser.viewStart)*tier.browser.scale)+1000;\n canvas.translate(offset, vOffset + tier.padding);\n overlayLabelCanvas.translate(0, tier.padding);\n\n tier.paintToContext(canvas, overlayLabelCanvas, offset);\n\n if (overlayLabelCanvas.glyphs.length > 0)\n tier.overlayLabelCanvas = overlayLabelCanvas;\n else\n tier.overlayLabelCanvas = null;\n\n canvas.restore();\n}\n\nfunction getScoreMinMax(tier, style) {\n let smin = tier.quantMin(style);\n let smax = tier.quantMax(style);\n\n if (!smax) {\n if (smin < 0) {\n smax = 0;\n } else {\n smax = 10;\n }\n }\n if (!smin) {\n smin = 0;\n }\n return [smin, smax];\n}\n\nfunction relScoreOrigin(score, smin, smax) {\n let relScore = ((1.0 * score) - smin) / (smax-smin);\n let relOrigin = (-1.0 * smin) / (smax - smin);\n\n return [relScore, relOrigin];\n}\n\nfunction getRefSeq(tier, min, max) {\n let refSeq = null;\n if (tier.currentSequence) {\n let csStart = tier.currentSequence.start|0;\n let csEnd = tier.currentSequence.end|0;\n if (csStart <= max && csEnd >= min) {\n let sfMin = Math.max(min, csStart);\n let sfMax = Math.min(max, csEnd);\n\n refSeq = tier.currentSequence.seq.substr(sfMin - csStart, sfMax - sfMin + 1);\n while (min < sfMin) {\n refSeq = 'N' + refSeq;\n sfMin--;\n }\n while (max > sfMax) {\n refSeq = refSeq + 'N';\n sfMax++;\n }\n }\n }\n return refSeq;\n}\n\nfunction featureToCrossLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight, noLabel) {\n let scale = tier.browser.scale;\n let origin = tier.browser.viewStart;\n\n let score = feature.score;\n let label = feature.label || feature.id;\n\n let minPos = (feature.min - origin) * scale;\n let maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n let height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n let requiredHeight = height;\n\n let glyph = null;\n let quant = null;\n\n let stroke = style.FGCOLOR || 'black';\n let fill = style.BGCOLOR || 'none';\n let outline = style.STROKECOLOR;\n\n if (style.BGITEM && feature.itemRgb) {\n stroke = feature.itemRgb;\n\n } else if (isDasBooleanTrue(style.COLOR_BY_SCORE2)) {\n let grad = style.BGGRAD || style._gradient;\n if (!grad) {\n grad = makeGradient(50, style.COLOR1, style.COLOR2, style.COLOR3);\n style._gradient = grad;\n }\n\n let score2 = feature.score2;\n if (score2 !== undefined || !stroke) {\n score2 = score2 || 0;\n\n let smin2 = style.MIN2 ? (1.0 * style.MIN2) : 0.0;\n let smax2 = style.MAX2 ? (1.0 * style.MAX2) : 1.0;\n let relScore2 = ((1.0 * score2) - smin2) / (smax2-smin2);\n\n let step = (relScore2*grad.length) | 0;\n R.clamp(0, step, grad.length - 1);\n stroke = grad[step];\n }\n }\n\n let size = style.SIZE || height;\n if (style.RSIZE) {\n size = (1.0 * style.RSIZE) * height;\n }\n\n if (style.STROKETHRESHOLD) {\n if (size < (1.0 * style.STROKETHRESHOLD))\n outline = null;\n }\n\n let mid = (minPos + maxPos)/2;\n\n if (glyphType === 'EX') {\n glyph = new Glyphs.ExGlyph(mid, size, stroke);\n\n } else if (glyphType === 'TRIANGLE') {\n let dir = style.DIRECTION || 'N';\n let width = style.LINEWIDTH || size;\n glyph = new Glyphs.TriangleGlyph(mid, size, dir, width, stroke, outline);\n\n } else if (glyphType === 'DOT') {\n glyph = new Glyphs.DotGlyph(mid, size, stroke, outline);\n\n } else if (glyphType === 'PLIMSOLL') {\n glyph = new Glyphs.PlimsollGlyph(mid, size, 0.2 * size, stroke, outline);\n\n } else if (glyphType === 'SQUARE') {\n glyph = new Glyphs.BoxGlyph(mid - size/2, 0, size, size, stroke, outline);\n\n } else if (glyphType === 'STAR') {\n let points = style.POINTS || 5;\n glyph = new Glyphs.StarGlyph(mid, size/2, points, stroke, outline);\n\n } else {\n glyph = new Glyphs.CrossGlyph(mid, size, stroke);\n\n }\n\n if (fill && fill !== 'none' && (maxPos - minPos) > 5) {\n let boxGlyph = new Glyphs.BoxGlyph(minPos, 0, (maxPos - minPos), size, fill);\n glyph = new Glyphs.GroupGlyph([boxGlyph, glyph]);\n }\n\n if (isDasBooleanTrue(style.SCATTER)) {\n let [smin, smax] = getScoreMinMax(tier, style);\n\n let [relScore, relOrigin] = relScoreOrigin(score, smin, smax);\n\n if (relScore < 0.0 || relScore > 1.0) {\n // Glyph is out of bounds.\n // Should we allow for \"partially showing\" glyphs?\n\n return null;\n } else {\n let originShift = x => (x - relOrigin) * requiredHeight;\n height = Math.max(1, originShift(relScore));\n y = y + originShift(1);\n\n if (relScore >= relOrigin)\n y = y - height;\n\n quant = {min: smin, max: smax};\n\n let heightFudge = 0;\n let featureLabel = R.defaultTo(style.LABEL, feature.forceLabel);\n\n if (isDasBooleanNotFalse(featureLabel) && label && !noLabel) {\n glyph = new Glyphs.LabelledGlyph(canvas, glyph, label, true, null,\n featureLabel == 'above' ? 'above' : 'below');\n if (featureLabel === 'above') {\n heightFudge = glyph.textHeight + 2;\n }\n noLabel = true;\n }\n glyph = new Glyphs.TranslatedGlyph(glyph, 0, y - (size / 2) - heightFudge, requiredHeight);\n }\n }\n\n return [glyph, quant];\n}\n\nfunction featureToGradientLikeGlyph(canvas, tier, feature, y, glyphType, style, forceHeight) {\n let scale = tier.browser.scale;\n let origin = tier.browser.viewStart;\n\n let score = feature.score;\n\n let minPos = (feature.min - origin) * scale;\n let maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n let height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n let requiredHeight = height * 1.0;\n\n let glyph = null;\n let quant = null;\n\n let centerOnAxis = isDasBooleanTrue(style[\"AXISCENTER\"]);\n\n\n let [smin, smax] = getScoreMinMax(tier, style);\n\n // AUTOMIN & AUTOMAX respectively set the lower and upper bounds\n if (isDasBooleanTrue(style.AUTOMIN)) {\n smin = tier.currentFeaturesMinScore*0.95;\n console.log(\"smin:\\t\" + smin);\n }\n if (isDasBooleanTrue(style.AUTOMAX)) {\n smax = tier.currentFeaturesMaxScore*1.05;\n console.log(\"smax:\\t\" + smax);\n }\n\n if ((1.0 * score) < (1.0 * smin)) {\n score = smin;\n }\n if ((1.0 * score) > (1.0 * smax)) {\n score = smax;\n }\n\n // Shift smin/smax in case we want to center the histogram\n // on the horizontal axis\n if (centerOnAxis) {\n let tmin = tier.quantMin(style);\n let tmax = tier.quantMax(style);\n\n if (isDasBooleanTrue(style.AUTOMIN)) {\n tmin = tier.currentFeaturesMinScore*0.95;\n }\n if (isDasBooleanTrue(style.AUTOMAX)) {\n tmax = tier.currentFeaturesMaxScore*1.05;\n }\n\n smin = tmin - ((tmax - tmin) / 2);\n smax = tmax - ((tmax - tmin) / 2);\n }\n\n let [relScore, relOrigin] = relScoreOrigin(score, smin, smax);\n\n if (glyphType === 'HISTOGRAM') {\n let originShift = x => x - Math.max(0, relOrigin);\n height = Math.abs(originShift(relScore)) * requiredHeight;\n y = y + originShift(1.0) * requiredHeight;\n\n if (relScore >= relOrigin)\n y -= height;\n\n if (centerOnAxis)\n y += height / 2;\n\n if (isDasBooleanTrue(style[\"HIDEAXISLABEL\"]))\n quant = null;\n else\n quant = {min: smin, max: smax};\n }\n\n let stroke = style.FGCOLOR || null;\n let fill = style.BGCOLOR || style.COLOR1 || 'green';\n if (style.BGITEM && feature.itemRgb)\n fill = feature.itemRgb;\n let alpha = style.ALPHA ? (1.0 * style.ALPHA) : null;\n\n if (style.BGGRAD) {\n let grad = style.BGGRAD;\n let step = (relScore*grad.length)|0;\n step = R.clamp(0, step, grad.length - 1);\n fill = grad[step];\n }\n\n if (style.COLOR2) {\n let grad = style._gradient;\n if (!grad) {\n grad = makeGradient(50, style.COLOR1, style.COLOR2, style.COLOR3);\n style._gradient = grad;\n }\n\n let step = (relScore*grad.length) | 0;\n step = R.clamp(0, step, grad.length - 1);\n fill = grad[step];\n }\n\n let tempGlyph = new Glyphs.BoxGlyph(minPos, y, (maxPos - minPos), height, fill, stroke, alpha);\n glyph = new Glyphs.TranslatedGlyph(tempGlyph, 0, 0, requiredHeight);\n\n return [glyph, quant];\n}\n\nfunction featureToPointGlyph(tier, feature, style) {\n let scale = tier.browser.scale;\n let origin = tier.browser.viewStart;\n\n let score = feature.score;\n\n let minPos = (feature.min - origin) * scale;\n let maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n let height = tier.forceHeight || style.HEIGHT || 30;\n\n let glyph = null;\n let quant = null;\n\n let [smin, smax] = getScoreMinMax(tier, style);\n let yscale = ((1.0 * height) / (smax - smin));\n let relScore = ((1.0 * score) - smin) / (smax-smin);\n let sc = ((score - (1.0*smin)) * yscale)|0;\n quant = {min: smin, max: smax};\n\n let fill = style.FGCOLOR || style.COLOR1 || 'black';\n if (style.COLOR2) {\n let grad = style._gradient;\n if (!grad) {\n grad = makeGradient(50, style.COLOR1, style.COLOR2, style.COLOR3);\n style._gradient = grad;\n }\n\n let step = (relScore*grad.length)|0;\n step = R.clamp(0, step, grad.length - 1);\n fill = grad[step];\n }\n\n glyph = new Glyphs.PointGlyph((minPos + maxPos)/2, height-sc, height, fill);\n\n return [glyph, quant];\n}\n\nfunction sequenceGlyph(canvas, tier, feature, style, forceHeight) {\n let scale = tier.browser.scale;\n let origin = tier.browser.viewStart;\n\n let min = feature.min;\n let max = feature.max;\n let minPos = (feature.min - origin) * scale;\n let maxPos = Math.max((feature.max - origin + 1) * scale, minPos + 1);\n\n let height = (tier.forceHeight || style.HEIGHT || forceHeight || 12) * 1.0;\n\n let glyph = null;\n\n let rawseq = feature.seq;\n let seq = rawseq;\n let rawquals = feature.quals;\n let quals = rawquals;\n let insertionLabels = isDasBooleanTrue(style.__INSERTIONS);\n\n let indels = [];\n if (feature.cigar) {\n let ops = parseCigar(feature.cigar);\n seq = '';\n quals = '';\n let cursor = 0;\n\n ops.forEach(co => {\n if (co.op === 'M') {\n seq += rawseq.substr(cursor, co.cnt);\n quals += rawquals.substr(cursor, co.cnt);\n cursor += co.cnt;\n } else if (co.op === 'D') {\n seq += \"-\".repeat(co.cnt);\n quals += \"Z\".repeat(co.cnt);\n } else if (co.op === 'I') {\n let inseq = rawseq.substr(cursor, co.cnt);\n let ig = new Glyphs.TranslatedGlyph(\n new Glyphs.TriangleGlyph(minPos + (seq.length*scale), 6, 'S', 5, tier.browser.baseColors['I']),\n 0, -2, 0\n );\n if (insertionLabels)\n ig = new Glyphs.LabelledGlyph(canvas, ig, inseq, false, 'center', 'above', '7px sans-serif');\n ig.feature = {label: 'Insertion: ' + inseq, type: 'insertion', method: 'insertion'};\n indels.push(ig);\n\n cursor += co.cnt;\n } else if (co.op === 'S') {\n cursor += co.cnt;\n } else {\n console.log('unknown cigop' + co.op);\n }\n });\n }\n\n let refSeq = getRefSeq(tier, min, max);\n if (seq && refSeq &&\n (style.__SEQCOLOR === 'mismatch' ||\n style.__SEQCOLOR === 'mismatch-all')) {\n let mismatchSeq = [];\n let match = feature.orientation === '-' ? ',' : '.';\n for (let i = 0; i < seq.length; ++i) {\n mismatchSeq.push(seq[i] == refSeq[i] ? match : seq[i]);\n }\n seq = mismatchSeq.join('');\n }\n\n let strandColor = feature.orientation === '-' ?\n style._minusColor || 'lightskyblue'\n : style._plusColor || 'lightsalmon';\n\n if (style.__disableQuals)\n quals = false;\n\n glyph = new Glyphs.SequenceGlyph(\n tier.browser.baseColors,\n strandColor,\n minPos,\n maxPos,\n height,\n seq,\n refSeq,\n style.__SEQCOLOR,\n quals,\n !isDasBooleanTrue(style.__CLEARBG),\n tier.scaleVertical\n );\n\n if (insertionLabels)\n glyph = new Glyphs.TranslatedGlyph(glyph, 0, 7);\n\n if (indels.length > 0) {\n indels.splice(0, 0, glyph);\n glyph = new Glyphs.GroupGlyph(indels);\n }\n\n return glyph;\n}\n\nfunction makeLinePlot(features, style, tier, yshift) {\n yshift = yshift || 0;\n\n let origin = tier.browser.viewStart, scale = tier.browser.scale;\n let height = tier.forceHeight || style.HEIGHT || 30;\n let min = tier.quantMin(style);\n let max = tier.quantMax(style);\n\n // AUTOMIN & AUTOMAX respectively set the lower and upper bounds\n if (isDasBooleanTrue(style.AUTOMIN)) {\n // add some basically arbitrary padding\n min = tier.currentFeaturesMinScore*0.95;\n }\n if (isDasBooleanTrue(style.AUTOMAX)) {\n max = tier.currentFeaturesMaxScore*1.05;\n }\n\n let yscale = ((1.0 * height) / (max - min));\n let color = style.FGCOLOR || style.COLOR1 || 'black';\n\n let prevSign = 1;\n let curSign = null;\n\n let curGlyphPoints = [];\n let glyphSequences = [];\n\n let prevPoint = null;\n\n features.forEach(f => {\n let px = ((((f.min|0) + (f.max|0)) / 2) - origin) * scale;\n let sc = ((f.score - (1.0*min)) * yscale)|0;\n\n // Additive tracks are always above the x-axis, and are colored\n // depending on whether the score is positive or negative.\n if (isDasBooleanTrue(style.ADDITIVE)) {\n curSign = f.score < 0 ? -1 : 1;\n\n if (curSign !== prevSign) {\n glyphSequences.push({\n points: curGlyphPoints,\n color: prevSign === 1 ?\n style.POSCOLOR\n : style.NEGCOLOR\n });\n curGlyphPoints = [];\n // Need to add the previous point to this sequence,\n // otherwise there is a gap in the resulting plot\n curGlyphPoints.push(prevPoint);\n }\n prevSign = curSign;\n } else {\n curSign = 1;\n }\n\n let py = (height - (sc * curSign)) + yshift;\n prevPoint = {x: px, y: py};\n curGlyphPoints.push(prevPoint);\n });\n\n\n // Need to add the final sequence of points as well.\n if (isDasBooleanTrue(style.ADDITIVE)) {\n color = curSign === 1 ? style.POSCOLOR : style.NEGCOLOR;\n }\n glyphSequences.push({\n points: curGlyphPoints,\n color: color\n });\n\n\n let lggs = glyphSequences.map(gs => {\n let lgg = new Glyphs.LineGraphGlyph(gs.points, gs.color, height);\n lgg.quant = {min, max};\n\n if (style.ZINDEX)\n lgg.zindex = style.ZINDEX|0;\n\n return lgg;\n });\n\n return lggs;\n}\n\nfunction makeStackedBars(features, tier) {\n let glyphs = [];\n\n let posStacks = [],\n negStacks = [];\n\n const scale = tier.browser.scale, origin = tier.browser.viewStart;\n for (var fi = 0; fi < features.length; ++fi) {\n const feature = features[fi];\n const style = tier.styleForFeature(feature);\n let score = feature.score * 1.0;\n\n let height = tier.forceHeight || style.HEIGHT || 12;\n const requiredHeight = height = 1.0 * height;\n\n const min = feature.min;\n const max = feature.max;\n\n const minPos = (min - origin) * scale;\n const rawMaxPos = ((max - origin + 1) * scale);\n const maxPos = Math.max(rawMaxPos, minPos + 1);\n\n // This should somewhat match the 'HISTOGRAM' path.\n\n var smin = tier.quantMin(style);\n var smax = tier.quantMax(style);\n\n if (!smax) {\n if (smin < 0) {\n smax = 0;\n } else {\n smax = 10;\n }\n } else {\n smax = smax * 1.0;\n }\n\n if (!smin) {\n smin = 0;\n } else {\n smin = smin * 1.0;\n }\n\n var stackOrigin;\n if (score >= 0) {\n stackOrigin = posStacks[min] || 0;\n posStacks[min] = stackOrigin + score;\n } else {\n stackOrigin = negStacks[min] || 0;\n negStacks[min] = stackOrigin + score;\n }\n\n if (stackOrigin > smax || stackOrigin < smin) {\n // Stack has extended outside of range.\n continue;\n }\n\n if (stackOrigin + score < smin) {\n score = smin - stackOrigin;\n }\n if (stackOrigin + score > smax) {\n score = smax - stackOrigin;\n }\n\n var relScoreEnd = (score + stackOrigin - smin) / (smax - smin);\n var relScoreStart = (stackOrigin - smin) / (smax - smin)\n var relScoreMax = Math.max(relScoreStart, relScoreEnd);\n var relScoreMin = Math.min(relScoreStart, relScoreEnd);\n\n height = (relScoreMax - relScoreMin) * requiredHeight;\n var y = (1.0 - relScoreMax) * requiredHeight;\n\n let stroke = style.FGCOLOR || null;\n let fill = style.BGCOLOR || style.COLOR1 || 'green';\n if (style.BGITEM && feature.itemRgb)\n fill = feature.itemRgb;\n const alpha = style.ALPHA ? (1.0 * style.ALPHA) : null;\n\n let gg = new Glyphs.BoxGlyph(minPos, y, (maxPos - minPos), height, fill, stroke, alpha);\n gg = new Glyphs.TranslatedGlyph(gg, 0, 0, requiredHeight);\n gg.feature = feature;\n gg.quant = {\n min: smin, max: smax\n };\n if (style.ZINDEX) {\n gg.zindex = style.ZINDEX | 0;\n }\n glyphs.push(gg);\n\n }\n return glyphs;\n}\n\n// height is subtier height\nfunction createQuantOverlay(tier, height, retina=false) {\n let width = 50;\n\n tier.quantOverlay.height = height;\n tier.quantOverlay.width = retina ? width*2 : width;\n tier.quantOverlay.style.height = '' + (retina ? height/2 : height) + 'px';\n tier.quantOverlay.style.width = '' + width + 'px';\n tier.quantOverlay.style.display = 'block';\n\n let canvas = tier.quantOverlay.getContext('2d');\n\n if (retina) {\n canvas.scale(2, 2);\n }\n\n return canvas;\n}\n\nfunction paintQuant(canvas, tier, quant, tics) {\n canvas.save();\n\n let h = tier.quantOverlay.height;\n let w = 100;\n\n let ticSpacing = (h + tier.padding*2) / tics;\n let ticInterval = (quant.max - quant.min) / tics;\n\n canvas.fillStyle = 'white';\n canvas.globalAlpha = 0.6;\n if (tier.browser.rulerLocation == 'right') {\n canvas.fillRect(w-30, 0, 30, h + tier.padding*2);\n } else {\n canvas.fillRect(0, 0, 30, h + tier.padding*2);\n }\n canvas.globalAlpha = 1.0;\n\n canvas.strokeStyle = 'black';\n canvas.lineWidth = 1;\n canvas.beginPath();\n if (tier.browser.rulerLocation == 'right') {\n canvas.moveTo(w - 8, tier.padding);\n canvas.lineTo(w, tier.padding);\n canvas.lineTo(w, h + tier.padding);\n canvas.lineTo(w - 8, h + tier.padding);\n\n for (let t = 1; t < tics-1; t++) {\n let ty = t*ticSpacing;\n canvas.moveTo(w, ty);\n canvas.lineTo(w - 5, ty);\n }\n } else {\n canvas.moveTo(8, tier.padding);\n canvas.lineTo(0, tier.padding);\n canvas.lineTo(0, h + tier.padding);\n canvas.lineTo(8, h + tier.padding);\n\n for (let t = 1; t < tics-1; t++) {\n let ty = t*ticSpacing;\n canvas.moveTo(0, ty);\n canvas.lineTo(5, ty);\n }\n }\n canvas.stroke();\n\n canvas.fillStyle = 'black';\n\n if (tier.browser.rulerLocation == 'right') {\n canvas.textAlign = 'right';\n canvas.fillText(formatQuantLabel(quant.max), w-9, 8);\n canvas.fillText(formatQuantLabel(quant.min), w-9, h + tier.padding);\n\n for (let t = 1; t < tics-1; t++) {\n let ty = t*ticSpacing;\n canvas.fillText(formatQuantLabel((1.0*quant.max) - (t*ticInterval)), w - 9, ty + 3);\n }\n } else {\n canvas.textAlign = 'left';\n canvas.fillText(formatQuantLabel(quant.max), 9, 8);\n canvas.fillText(formatQuantLabel(quant.min), 9, h + tier.padding);\n\n for (let t = 1; t < tics-1; t++) {\n let ty = t*ticSpacing;\n canvas.fillText(formatQuantLabel((1.0*quant.max) - (t*ticInterval)), 9, ty + 3);\n }\n }\n\n canvas.restore();\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// domui.js: SVG UI components\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n}\n\nBrowser.prototype.removeAllPopups = function() {\n removeChildren(this.hPopupHolder);\n removeChildren(this.popupHolder);\n}\n\nBrowser.prototype.makeTooltip = function(ele, text)\n{\n var isin = false;\n var thisB = this;\n var timer = null;\n var outlistener;\n outlistener = function(ev) {\n isin = false;\n if (timer) {\n clearTimeout(timer);\n timer = null;\n }\n ele.removeEventListener('mouseout', outlistener, false);\n };\n\n var setup = function(ev) {\n var mx = ev.clientX + window.scrollX, my = ev.clientY + window.scrollY;\n if (!timer) {\n timer = setTimeout(function() {\n var ttt;\n if (typeof(text) === 'function') {\n ttt = text();\n } else {\n ttt = text;\n }\n\n var popup = makeElement('div',\n [makeElement('div', null, {className: 'tooltip-arrow'}),\n makeElement('div', ttt, {className: 'tooltip-inner'})], \n {className: 'tooltip bottom in'}, {\n display: 'block',\n top: '' + (my + 20) + 'px',\n left: '' + Math.max(mx - 30, 20) + 'px'\n });\n thisB.hPopupHolder.appendChild(popup);\n var moveHandler;\n moveHandler = function(ev) {\n try {\n thisB.hPopupHolder.removeChild(popup);\n } catch (e) {\n // May have been removed by other code which clears the popup layer.\n }\n window.removeEventListener('mousemove', moveHandler, false);\n if (isin) {\n if (ele.offsetParent == null) {\n } else {\n setup(ev);\n }\n }\n }\n window.addEventListener('mousemove', moveHandler, false);\n timer = null;\n }, 1000);\n }\n };\n\n ele.addEventListener('mouseover', function(ev) {\n isin = true\n ele.addEventListener('mouseout', outlistener, false);\n setup(ev);\n }, false);\n ele.addEventListener('DOMNodeRemovedFromDocument', function(ev) {\n isin = false;\n if (timer) {\n clearTimeout(timer);\n timer = null;\n }\n }, false);\n}\n\nBrowser.prototype.popit = function(ev, name, ele, opts)\n{\n var thisB = this;\n if (!opts) \n opts = {};\n if (!ev) \n ev = {};\n\n var width = opts.width || 200;\n\n var mx, my;\n\n if (ev.clientX) {\n var mx = ev.clientX, my = ev.clientY;\n } else {\n mx = 500; my= 50;\n }\n mx += document.documentElement.scrollLeft || document.body.scrollLeft;\n my += document.documentElement.scrollTop || document.body.scrollTop;\n var winWidth = window.innerWidth;\n\n var top = my;\n var left = Math.min(mx - (width/2) - 4, (winWidth - width - 30));\n\n var popup = makeElement('div');\n popup.className = 'popover fade ' + (ev.clientX ? 'bottom ' : '') + 'in';\n popup.style.display = 'block';\n popup.style.position = 'absolute';\n popup.style.top = '' + top + 'px';\n popup.style.left = '' + left + 'px';\n popup.style.width = width + 'px';\n if (width > 276) {\n // HACK Bootstrappification...\n popup.style.maxWidth = width + 'px';\n }\n\n popup.appendChild(makeElement('div', null, {className: 'arrow'}));\n\n if (name) {\n var closeButton = makeElement('button', '', {className: 'close'});\n closeButton.innerHTML = '×'\n\n closeButton.addEventListener('mouseover', function(ev) {\n closeButton.style.color = 'red';\n }, false);\n closeButton.addEventListener('mouseout', function(ev) {\n closeButton.style.color = 'black';\n }, false);\n closeButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n thisB.removeAllPopups();\n }, false);\n var tbar = makeElement('h4', [makeElement('span', name, null, {maxWidth: '200px'}), closeButton], {/*className: 'popover-title' */}, {paddingLeft: '10px', paddingRight: '10px'});\n\n var dragOX, dragOY;\n var moveHandler, upHandler;\n moveHandler = function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n left = left + (ev.clientX - dragOX);\n if (left < 8) {\n left = 8;\n } if (left > (winWidth - width - 32)) {\n left = (winWidth - width - 26);\n }\n top = top + (ev.clientY - dragOY);\n top = Math.max(10, top);\n popup.style.top = '' + top + 'px';\n popup.style.left = '' + Math.min(left, (winWidth - width - 10)) + 'px';\n dragOX = ev.clientX; dragOY = ev.clientY;\n }\n upHandler = function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n window.removeEventListener('mousemove', moveHandler, false);\n window.removeEventListener('mouseup', upHandler, false);\n }\n tbar.addEventListener('mousedown', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n dragOX = ev.clientX; dragOY = ev.clientY;\n window.addEventListener('mousemove', moveHandler, false);\n window.addEventListener('mouseup', upHandler, false);\n }, false);\n \n\n popup.appendChild(tbar);\n }\n\n popup.appendChild(makeElement('div', ele, {className: 'popover-content'}, {\n padding: '0px'\n }));\n this.hPopupHolder.appendChild(popup);\n\n var popupHandle = {\n node: popup,\n displayed: true\n };\n popup.addEventListener('DOMNodeRemoved', function(ev) {\n if (ev.target == popup) {\n popupHandle.displayed = false;\n }\n }, false);\n return popupHandle;\n}\n\nfunction makeTreeTableSection(title, content, visible) {\n var ttButton = makeElement('i');\n function update() {\n if (visible) {\n ttButton.className = 'fa fa-caret-down';\n content.style.display = 'table';\n } else {\n ttButton.className = 'fa fa-caret-right';\n content.style.display = 'none';\n }\n }\n update();\n\n ttButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n visible = !visible;\n update();\n }, false);\n\n var heading = makeElement('h6', [ttButton, ' ', title], {}, {display: 'block', background: 'gray', color: 'white', width: '100%', padding: '5px 2px', margin: '0px'});\n return makeElement('div', [heading, content], {});\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n makeTreeTableSection: makeTreeTableSection\n };\n}\n","/* jshint esversion: 6 */\n\"use strict\";\n\nimport * as DefaultRenderer from \"./default-renderer\";\n\nexport { renderTier, drawTier };\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\nfunction drawTier(tier) {\n let canvas = tier.viewport.getContext(\"2d\");\n let retina = tier.browser.retina && window.devicePixelRatio > 1;\n if (retina) {\n canvas.scale(2, 2);\n }\n\n let features = tier.currentFeatures;\n let sequence = tier.currentSequence;\n if (tier.sequenceSource) {\n DefaultRenderer.drawSeqTier(tier, sequence);\n } else if (features) {\n DefaultRenderer.prepareSubtiers(tier, canvas);\n } else {\n console.log(\"No sequence or features in tier!\");\n }\n\n if (tier.subtiers) {\n DefaultRenderer.prepareViewport(tier, canvas, retina, true);\n }\n\n tier.drawOverlay();\n tier.paintQuant();\n\n if (typeof(tier.dasSource.drawCallback) === \"function\") {\n tier.dasSource.drawCallback(canvas, tier);\n }\n\n tier.originHaxx = 0;\n tier.browser.arrangeTiers();\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// encode.js: interface for ENCODE DCC services\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var Promise = require('es6-promise').Promise;\n}\n\nfunction lookupEncodeURI(uri, json) {\n if (uri.indexOf('?') < 0)\n uri = uri + '?soft=true';\n\n return new Promise(function(accept, reject) {\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status >= 300) {\n reject('Error code ' + req.status);\n } else {\n var resp = JSON.parse(req.response);\n accept(json ? resp : resp.location);\n }\n }\n };\n \n req.open('GET', uri, true);\n req.setRequestHeader('Accept', 'application/json');\n req.responseType = 'text';\n req.send();\n });\n}\n\nfunction EncodeURLHolder(url) {\n this.rawurl = url;\n}\n\nEncodeURLHolder.prototype.getURLPromise = function() {\n if (this.urlPromise && this.urlPromiseValidity > Date.now()) {\n return this.urlPromise;\n } else {\n this.urlPromise = lookupEncodeURI(this.rawurl, true).then(function(resp) {\n return resp.location;\n });\n this.urlPromiseValidity = Date.now() + (12 * 3600 * 1000);\n return this.urlPromise;\n }\n}\n\nfunction EncodeFetchable(url, start, end, opts) {\n if (!opts) {\n if (typeof start === 'object') {\n opts = start;\n start = undefined;\n } else {\n opts = {};\n }\n }\n\n this.url = (typeof url === 'string' ? new EncodeURLHolder(url) : url);\n this.start = start || 0;\n if (end) {\n this.end = end;\n }\n this.opts = opts;\n}\n\n\n\nEncodeFetchable.prototype.slice = function(s, l) {\n if (s < 0) {\n throw 'Bad slice ' + s;\n }\n\n var ns = this.start, ne = this.end;\n if (ns && s) {\n ns = ns + s;\n } else {\n ns = s || ns;\n }\n if (l && ns) {\n ne = ns + l - 1;\n } else {\n ne = ne || l - 1;\n }\n return new EncodeFetchable(this.url, ns, ne, this.opts);\n}\n\nEncodeFetchable.prototype.fetchAsText = function(callback) {\n var self = this;\n var req = new XMLHttpRequest();\n var length;\n self.url.getURLPromise().then(function(url) {\n req.open('GET', url, true);\n\n if (self.end) {\n if (self.end - self.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + self.start + '-' + self.end);\n length = self.end - self.start + 1;\n }\n\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status == 200 || req.status == 206) {\n return callback(req.responseText);\n } else {\n return callback(null);\n }\n }\n };\n if (self.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n }).catch(function(err) {\n console.log(err);\n return callback(null);\n });\n}\n\nEncodeFetchable.prototype.salted = function() {\n return this;\n}\n\nEncodeFetchable.prototype.fetch = function(callback, attempt, truncatedLength) {\n var self = this;\n\n attempt = attempt || 1;\n if (attempt > 3) {\n return callback(null);\n }\n\n self.url.getURLPromise().then(function (url) {\n var req = new XMLHttpRequest();\n var length;\n req.open('GET', url, true);\n req.overrideMimeType('text/plain; charset=x-user-defined');\n if (self.end) {\n if (self.end - self.start > 100000000) {\n throw 'Monster fetch!';\n }\n req.setRequestHeader('Range', 'bytes=' + self.start + '-' + self.end);\n length = self.end - self.start + 1;\n }\n req.responseType = 'arraybuffer';\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status == 200 || req.status == 206) {\n if (req.response) {\n var bl = req.response.byteLength;\n if (length && length != bl && (!truncatedLength || bl != truncatedLength)) {\n return self.fetch(callback, attempt + 1, bl);\n } else {\n return callback(req.response);\n }\n } else if (req.mozResponseArrayBuffer) {\n return callback(req.mozResponseArrayBuffer);\n } else {\n var r = req.responseText;\n if (length && length != r.length && (!truncatedLength || r.length != truncatedLength)) {\n return self.fetch(callback, attempt + 1, r.length);\n } else {\n return callback(bstringToBuffer(req.responseText));\n }\n }\n } else {\n return self.fetch(callback, attempt + 1);\n }\n }\n };\n if (self.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n }).catch(function(err) {\n console.log(err);\n });\n}\n\nfunction bstringToBuffer(result) {\n if (!result) {\n return null;\n }\n\n var ba = new Uint8Array(result.length);\n for (var i = 0; i < ba.length; ++i) {\n ba[i] = result.charCodeAt(i);\n }\n return ba.buffer;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n lookupEncodeURI: lookupEncodeURI,\n EncodeFetchable: EncodeFetchable\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// ensembljson.js -- query the Ensembl REST API.\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n}\n\nfunction EnsemblFeatureSource(source) {\n FeatureSourceBase.call(this);\n this.source = source;\n this.base = source.uri || '//rest.ensembl.org';\n if (this.base.indexOf('//') === 0) {\n var proto = window.location.protocol;\n if (proto == 'http:' || proto == 'https:') {\n // Protocol-relative URLs okay.\n } else {\n this.base = 'http:' + this.base;\n }\n }\n this.species = source.species || 'human';\n\n if (typeof source.type === 'string') {\n this.type = [source.type];\n } else {\n this.type = source.type || ['regulatory'];\n }\n}\n\nEnsemblFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\nEnsemblFeatureSource.prototype.constructor = EnsemblFeatureSource;\n\nEnsemblFeatureSource.prototype.getStyleSheet = function(callback) {\n var stylesheet = new DASStylesheet();\n\n var tsStyle = new DASStyle();\n tsStyle.glyph = '__NONE';\n if (this.type.indexOf('exon') >= 0)\n stylesheet.pushStyle({type: 'transcript'}, null, tsStyle);\n if (this.type.indexOf('exon') >= 0 || this.type.indexOf('transcript') >= 0)\n stylesheet.pushStyle({type: 'gene'}, null, tsStyle);\n\n var cdsStyle = new DASStyle();\n cdsStyle.glyph = 'BOX';\n cdsStyle.FGCOLOR = 'black';\n cdsStyle.BGCOLOR = 'red'\n cdsStyle.HEIGHT = 8;\n cdsStyle.BUMP = true;\n cdsStyle.LABEL = true;\n cdsStyle.ZINDEX = 10;\n stylesheet.pushStyle({type: 'cds'}, null, cdsStyle);\n\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'SQUARE';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({type: 'variation', method: '.+_UTR_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'S';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({type: 'variation', method: 'missense_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'N';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({type: 'variation', method: 'splice_.+_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'STAR';\n varStyle.POINTS = 6;\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({type: 'variation', method: 'regulatory_region_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n // varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'rgb(50,80,255)';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({type: 'variation'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'SQUARE';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({type: 'indel', method: '.+_UTR_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'S';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({type: 'indel', method: 'missense_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TRIANGLE';\n varStyle.DIRECTION = 'N';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({type: 'indel', method: 'splice_.+_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'STAR';\n varStyle.POINTS = 6;\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({type: 'indel', method: 'regulatory_region_variant'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.BGCOLOR = '#888888';\n varStyle.FGCOLOR = 'red';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({type: 'indel'}, null, varStyle);\n }\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'orange'\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n return callback(stylesheet);\n}\n\n\nEnsemblFeatureSource.prototype.getScales = function() {\n return [];\n}\n\nEnsemblFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n var url = this.base + '/overlap/region/' + this.species + '/' + chr + ':' + min + '-' + max;\n\n var filters = [];\n for (var ti = 0; ti < this.type.length; ++ti) {\n filters.push('feature=' + this.type[ti]);\n }\n filters.push('content-type=application/json');\n url = url + '?' + filters.join(';');\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n \tif (req.readyState == 4) {\n thisB.busy--;\n thisB.notifyActivity();\n\n \t if (req.status >= 300) {\n var err = 'Error code ' + req.status;\n try {\n var jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } catch (ex) {};\n\n \t\t callback(err, null);\n \t } else {\n \t\tvar jf = JSON.parse(req.response);\n \t\tvar features = [];\n \t\tfor (var fi = 0; fi < jf.length; ++fi) {\n \t\t var j = jf[fi];\n\n \t\t var notes = [];\n \t\t var f = new DASFeature();\n \t\t f.segment = chr;\n \t\t f.min = j['start'] | 0;\n \t\t f.max = j['end'] | 0;\n \t\t f.type = j.feature_type || 'unknown';\n \t\t f.id = j.ID;\n\n if (j.Parent) {\n var grp = new DASGroup();\n grp.id = j.Parent;\n f.groups = [grp];\n }\n\n if (j.strand) {\n if (j.strand < 0)\n f.orientation = '-';\n else if (j.strand > 0)\n f.orientation = '+';\n }\n\n if (j.consequence_type)\n f.method = j.consequence_type;\n\n if (j.alt_alleles) {\n notes.push('Alleles=' + j.alt_alleles.join('/'));\n if (j.alt_alleles.length > 1) {\n if (j.alt_alleles[1].length != j.alt_alleles[0].length || j.alt_alleles[1] == '-') {\n f.type = 'indel';\n }\n }\n }\n\n if (notes.length > 0) {\n f.notes = notes;\n }\n \t\t features.push(f);\n \t\t}\n \t\tcallback(null, features);\n \t }\n \t}\n\t\n };\n \n thisB.busy++;\n thisB.notifyActivity();\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n}\n\nEnsemblFeatureSource.prototype.capabilities = function() {\n const caps = {};\n if (this.type && this.type.indexOf('transcript') >= 0) {\n caps.search = ['gene'];\n }\n return caps;\n}\n\nEnsemblFeatureSource.prototype.search = function(query, callback) {\n const url = `${this.base}/lookup/symbol/${this.species}/${query}?content-type=application/json`;\n const req = new XMLHttpRequest();\n req.onreadystatechange = () => {\n if (req.readyState == 4)\n if (req.status >= 300 || req.status < 200) {\n let err = 'Error code ' + req.status;\n try {\n var jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } catch (ex) {};\n\n if (req.status == 400) // E! returns an error if the lookup fails. Who knows?\n return callback([]);\n else\n return callback(null, err);\n } else {\n const resp = JSON.parse(req.response);\n const result = [];\n\n if (resp && resp.seq_region_name) {\n result.push({\n segment: resp.seq_region_name,\n min: resp.start,\n max: resp.end\n });\n }\n \n return callback(result);\n }\n };\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n}\n\ndalliance_registerSourceAdapterFactory('ensembl', function(source) {\n return {features: new EnsemblFeatureSource(source)};\n});\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// export-config.js\n//\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var sha1 = require('./sha1');\n var hex_sha1 = sha1.hex_sha1;\n\n var das = require('./das');\n var copyStylesheet = das.copyStylesheet;\n}\n\nBrowser.prototype.exportFullConfig = function(opts) {\n opts = opts || {};\n\n var config = {\n chr: this.chr,\n viewStart: this.viewStart|0,\n viewEnd: this.viewEnd|0,\n cookieKey: 'dalliance_' + hex_sha1(Date.now()),\n\n coordSystem: this.coordSystem,\n\n sources: this.exportSourceConfig(),\n\n chains: this.exportChains()\n };\n\n if (this.prefix)\n config.prefix = this.prefix;\n\n return config;\n}\n\nBrowser.prototype.exportChains = function() {\n var cc = {};\n var cs = this.chains || {};\n for (var k in cs) {\n cc[k] = cs[k].exportConfig();\n }\n return cc;\n}\n\nBrowser.prototype.exportSourceConfig = function(opts) {\n opts = opts || {};\n\n var sourceConfig = [];\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var tier = this.tiers[ti];\n var source = shallowCopy(tier.dasSource);\n\n if (source.noPersist)\n continue;\n\n source.coords = undefined;\n source.props = undefined;\n if (!source.disabled)\n source.disabled = undefined;\n\n if (tier.config.stylesheet) {\n source.style = copyStylesheet(tier.config.stylesheet).styles;\n source.stylesheet_uri = undefined;\n } else if (source.style) {\n source.style = copyStylesheet({styles: source.style}).styles;\n }\n\n if (typeof(tier.config.name) === 'string') {\n source.name = tier.config.name;\n }\n\n if (tier.config.height !== undefined) {\n source.forceHeight = tier.config.height;\n }\n if (tier.config.forceMin !== undefined) {\n source.forceMin = tier.config.forceMin;\n }\n if (tier.config.forceMinDynamic)\n source.forceMinDynamic = tier.config.forceMinDynamic;\n if (tier.config.forceMax !== undefined) {\n source.forceMax = tier.config.forceMax;\n }\n if (tier.config.bumped !== undefined) {\n source.bumped = tier.config.bumped;\n }\n if (tier.config.forceMaxDynamic)\n source.forceMaxDynamic = tier.config.forceMaxDynamic;\n\n sourceConfig.push(source);\n }\n\n return sourceConfig;\n}\n\nBrowser.prototype.exportPageTemplate = function(opts) {\n opts = opts || {};\n var template = '\\n' +\n ' \\n' +\n ' \\n' +\n ' \\n' + \n ' \\n' +\n ' \\n' +\n ' Dalliance goes here
\\n' +\n ' \\n' +\n '\\n';\n\n return template;\n}","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// export-image.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var g = require('./glyphs');\n var OverlayLabelCanvas = g.OverlayLabelCanvas;\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n var formatLongInt = nf.formatLongInt;\n\n var VERSION = require('./version');\n\n var drawSeqTierGC = require('./sequence-draw').drawSeqTierGC;\n}\n\nfunction fillTextRightJustified(g, text, x, y) {\n g.fillText(text, x - g.measureText(text).width, y);\n}\n\nBrowser.prototype.exportImage = function(opts) {\n opts = opts || {};\n\n var fpw = opts.width || this.featurePanelWidth;\n var padding = 3;\n var ypos = 0;\n if (opts.banner || opts.region) {\n ypos = 40;\n }\n\n var backupFPW = this.featurePanelWidth;\n var backupScale = this.scale;\n this.featurePanelWidth = fpw;\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n \n var totHeight = ypos;\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (ti > 0)\n totHeight += padding;\n var tier = this.tiers[ti];\n\n tier.backupSubtiers = tier.subtiers;\n tier.backupOriginHaxx = tier.originHaxx;\n tier.backupLayoutHeight = tier.layoutHeight;\n\n if (tier.subtiers) {\n const renderer = this.getTierRenderer(tier);\n if (renderer && renderer.prepareSubtiers) {\n renderer.prepareSubtiers(tier, tier.viewport.getContext('2d'));\n }\n\n if (tier.subtiers) {\n var lh = tier.padding;\n for (var s = 0; s < tier.subtiers.length; ++s) {\n lh = lh + tier.subtiers[s].height + tier.padding;\n }\n lh += 6\n tier.layoutHeight = Math.max(lh, this.minTierHeight);\n }\n }\n\n if (tier.layoutHeight !== undefined)\n totHeight += tier.layoutHeight;\n }\n var mult = opts.resolutionMultiplier || 1.0;\n var margin = 200;\n\n var cw = ((fpw + margin) * mult)|0;\n var ch = (totHeight * mult)|0;\n var c = makeElement('canvas', null, {width: cw, height: ch});\n var g = c.getContext('2d');\n g.fillStyle = 'white';\n g.fillRect(0, 0, cw, ch);\n\n g.scale(mult, mult);\n\n if (opts.region) {\n g.save();\n g.fillStyle = 'black';\n g.font = '12pt sans-serif';\n g.fillText(\n this.chr + ':' + formatLongInt(this.viewStart) + '..' + formatLongInt(this.viewEnd),\n margin + 100,\n 28\n );\n g.restore();\n }\n\n if (opts.banner) {\n g.save();\n g.fillStyle = 'black';\n g.font = '12pt sans-serif';\n fillTextRightJustified(g, 'Graphics from Biodalliance ' + VERSION, margin + fpw - 100, 28);\n g.restore();\n }\n\n g.font = '10px sans-serif';\n \n for (var ti = 0; ti < this.tiers.length; ++ti) {\n var tier = this.tiers[ti];\n var offset = ((tier.glyphCacheOrigin - this.viewStart)*this.scale);\n\n var oc = new OverlayLabelCanvas();\n g.save(); // 1\n g.translate(0, ypos);\n\n g.save(); // 2\n g.beginPath();\n g.moveTo(margin, 0);\n g.lineTo(margin + fpw, 0);\n g.lineTo(margin + fpw, tier.layoutHeight);\n g.lineTo(margin, tier.layoutHeight);\n g.closePath();\n g.clip();\n g.translate(margin, 0);\n\n g.save(); // 3\n g.translate(offset, 0);\n if (tier.subtiers) {\n tier.paintToContext(g, oc, offset + 1000);\n \n } else {\n drawSeqTierGC(tier, tier.currentSequence, g);\n }\n g.restore(); // 2\n \n g.save() // 3\n g.translate(offset, 0);\n oc.draw(g, -offset, fpw - offset);\n g.restore(); // 2\n g.restore(); // 1\n\n var hasQuant = false;\n var pos = 0;\n var subtiers = tier.subtiers || [];\n for (var sti = 0; sti < subtiers.length; ++sti) {\n var subtier = subtiers[sti];\n \n if (subtier.quant) {\n hasQuant = true;\n var q = subtier.quant;\n var h = subtier.height;\n\n var numTics = 2;\n if (h > 40) {\n numTics = 1 + ((h/20) | 0);\n }\n var ticSpacing = h / (numTics - 1);\n var ticInterval = (q.max - q.min) / (numTics - 1);\n\n g.beginPath();\n g.moveTo(margin + 5, pos);\n g.lineTo(margin, pos);\n g.lineTo(margin, pos + subtier.height);\n g.lineTo(margin + 5, pos + subtier.height);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n g.moveTo(margin, pos + ty);\n g.lineTo(margin+3, pos + ty);\n }\n g.strokeStyle = 'black';\n g.strokeWidth = 2;\n g.stroke();\n\n g.fillStyle = 'black';\n fillTextRightJustified(g, formatQuantLabel(q.max), margin - 3, pos + 7);\n fillTextRightJustified(g, formatQuantLabel(q.min), margin - 3, pos + subtier.height);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n fillTextRightJustified(g, formatQuantLabel((1.0*q.max) - (t*ticInterval)), margin - 3, pos + ty + 3);\n }\n }\n\n pos += subtier.height + padding;\n }\n\n var labelName;\n if (typeof tier.config.name === 'string')\n labelName = tier.config.name;\n else\n labelName = tier.dasSource.name;\n var labelWidth = g.measureText(labelName).width;\n g.fillStyle = 'black';\n g.fillText(labelName, margin - (hasQuant ? 28 : 12) - labelWidth, (tier.layoutHeight + 3) / 2);\n\n g.restore(); // 0\n\n ypos += tier.layoutHeight + padding;\n\n tier.subtiers = tier.backupSubtiers;\n tier.originHaxx = tier.backupOriginHaxx;\n tier.layoutHeight = tier.backupLayoutHeight;\n }\n\n if (opts.highlights) {\n g.save();\n\n g.beginPath();\n g.moveTo(margin, 0);\n g.lineTo(margin + fpw, 0);\n g.lineTo(margin + fpw, ypos);\n g.lineTo(margin, ypos);\n g.closePath();\n g.clip();\n\n g.translate(margin + offset, 0);\n var origin = this.viewStart;\n var visStart = this.viewStart;\n var visEnd = this.viewEnd;\n\n for (var hi = 0; hi < this.highlights.length; ++hi) {\n var h = this.highlights[hi];\n if (((h.chr === this.chr) || (h.chr === ('chr' + this.chr))) && h.min < visEnd && h.max > visStart) {\n g.globalAlpha = this.defaultHighlightAlpha;\n g.fillStyle = this.defaultHighlightFill;\n g.fillRect((h.min - origin) * this.scale,\n 0,\n (h.max - h.min) * this.scale,\n ypos);\n }\n } \n g.restore();\n }\n\n var rulerPos = -1; \n if (opts.ruler == 'center') {\n rulerPos = margin + ((this.viewEnd - this.viewStart + 1)*this.scale) / 2;\n } else if (opts.ruler == 'left') {\n rulerPos = margin;\n } else if (opts.ruler == 'right') {\n rulerPos = margin + ((this.viewEnd - this.viewStart + 1)*this.scale);\n }\n if (rulerPos >= 0) {\n g.strokeStyle = 'blue';\n g.beginPath();\n g.moveTo(rulerPos, 0);\n g.lineTo(rulerPos, ypos);\n g.stroke();\n }\n\n this.featurePanelWidth = backupFPW;\n this.scale = backupScale;\n\n return c.toDataURL('image/png');\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// export-ui.js\n//\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n}\n\nBrowser.prototype.openExportPanel = function() {\n var b = this;\n if (this.uiMode === 'export') {\n this.hideToolPanel();\n this.setUiMode('none');\n } else {\n var exportForm = makeElement('div', null, {className: 'export-form'});\n var exportSelect = makeElement('select');\n exportSelect.appendChild(makeElement('option', 'SVG', {value: 'svg'}));\n exportSelect.appendChild(makeElement('option', 'Image', {value: 'png'}));\n exportSelect.appendChild(makeElement('option', 'Dalliance config', {value: 'config'}));\n exportSelect.appendChild(makeElement('option', 'Dalliance sources', {value: 'sources'}));\n exportSelect.appendChild(makeElement('option', 'Dalliance page', {value: 'page'}));\n exportSelect.value = 'svg';\n\n exportSelect.addEventListener('change', function(ev) {\n removeChildren(exportContent);\n setupEOT();\n }, false);\n exportForm.appendChild(makeElement('p', ['Export as: ', exportSelect]));\n\n var exportHighlightsToggle = makeElement('input', null, {type: 'checkbox', checked: this.exportHighlights});\n exportHighlightsToggle.addEventListener('change', function(ev) {\n b.exportHighlights = exportHighlightsToggle.checked;\n b.storeStatus();\n }, false);\n var exportRulerToggle = makeElement('input', null, {type: 'checkbox', checked: this.exportRuler});\n exportRulerToggle.addEventListener('change', function(ev) {\n b.exportRuler = exportRulerToggle.checked;\n b.storeStatus();\n }, false);\n var exportRegionToggle = makeElement('input', null, {type: 'checkbox', checked: this.exportRegion});\n exportRegionToggle.addEventListener('change', function(ev) {\n b.exportRegion = exportRegionToggle.checked;\n b.storeStatus();\n }, false);\n var exportBannerToggle = makeElement('input', null, {type: 'checkbox', checked: this.exportBanner});\n exportBannerToggle.addEventListener('change', function(ev) {\n b.exportBanner = exportBannerToggle.checked;\n b.storeStatus();\n }, false);\n var exportScale = makeElement('input', null, {type: 'text', value: '1.0'});\n var exportWidth = makeElement('input', null, {type: 'text', value: '800'});\n\n var exportButton = makeElement('button', 'Export', {className: 'btn btn-primary'});\n exportButton.addEventListener('click', function(ev) {\n removeChildren(exportContent);\n\n var blobURL;\n var note, type, name;\n if (exportSelect.value === 'svg') {\n blobURL = URL.createObjectURL(b.makeSVG({highlights: exportHighlightsToggle.checked,\n banner: b.exportBanner,\n region: b.exportRegion,\n ruler: exportRulerToggle.checked ? b.rulerLocation : 'none',\n width: parseInt(exportWidth.value) || 800}));\n note = 'SVG';\n type = 'image/svg';\n name = 'dalliance-view.svg';\n } else if (exportSelect.value === 'png') {\n var mult = parseFloat(exportScale.value);\n if (mult < 0.1 || mult > 10) {\n alert('bad scale ' + mult);\n return;\n }\n\n blobURL = b.exportImage({highlights: exportHighlightsToggle.checked,\n banner: b.exportBanner,\n region: b.exportRegion,\n ruler: exportRulerToggle.checked ? b.rulerLocation : 'none',\n resolutionMultiplier: mult,\n width: parseInt(exportWidth.value) || 800});\n note = 'Image';\n type = 'image/png';\n name = 'dalliance-view.png';\n } else if (exportSelect.value === 'config') {\n var config = JSON.stringify(b.exportFullConfig(), null, 2);\n var blob = new Blob([config], {type: 'text/plain'});\n blobURL = URL.createObjectURL(blob);\n note = 'Configuration';\n type = 'text/plain';\n name = 'dalliance-config.json';\n } else if (exportSelect.value === 'sources') {\n var config = JSON.stringify(b.exportSourceConfig(), null, 2);\n var blob = new Blob([config], {type: 'text/plain'});\n blobURL = URL.createObjectURL(blob);\n note = 'Source array';\n type = 'text/plain';\n name = 'dalliance-sources.json';\n } else if (exportSelect.value === 'page') {\n var page = b.exportPageTemplate();\n var type = 'text/html';\n var blob = new Blob([page], {type: type});\n blobURL = URL.createObjectURL(blob);\n note = 'Page template';\n name = 'dalliance-view.html';\n }\n\n if (blobURL) {\n var downloadLink = makeElement('a', '[Download]', {\n href: blobURL,\n download: name,\n type: type\n });\n\n var previewLink = makeElement('a', '[Preview in browser]', {\n href: blobURL,\n type: type,\n target: '_new'\n });\n\n exportContent.appendChild(makeElement('p', ['' + note + ' created: ', downloadLink, previewLink]));\n }\n }, false);\n\n b.addViewListener(function() {\n removeChildren(exportContent);\n });\n b.addTierListener(function() {\n removeChildren(exportContent);\n });\n\n var exportContent = makeElement('p', '');\n\n var eotHighlights = makeElement('tr',\n [makeElement('th', 'Include highlights', {}, {width: '400px', textAlign: 'right'}),\n makeElement('td', exportHighlightsToggle)]);\n var eotGuideline = makeElement('tr',\n [makeElement('th', 'Include vertical guideline', {}, {textAlign: 'right'}),\n makeElement('td', exportRulerToggle)]);\n var eotScale = makeElement('tr',\n [makeElement('th', 'Scale multiplier', {}, {textAlign: 'right'}),\n makeElement('td', exportScale)]);\n var eotWidth = makeElement('tr',\n [makeElement('th', 'Width (logical px)', {}, {textAlign: 'right'}),\n makeElement('td', exportWidth)]);\n var eotRegion = makeElement('tr',\n [makeElement('th', 'Label with genomic coordinates', {}, {textAlign: 'right'}),\n makeElement('td', exportRegionToggle)]);\n var eotBanner = makeElement('tr',\n [makeElement('th', 'Include banner', {}, {textAlign: 'right'}),\n makeElement('td', exportBannerToggle)]);\n\n var exportOptsTable = makeElement('table',\n [eotHighlights,\n eotGuideline,\n eotWidth,\n eotScale,\n eotRegion], null, {width: '500px'});\n var setupEOT = function() {\n var es = exportSelect.value;\n eotHighlights.style.display = (es == 'svg' || es == 'png') ? 'table-row' : 'none';\n eotGuideline.style.display = (es == 'svg' || es == 'png') ? 'table-row' : 'none';\n eotScale.style.display = (es == 'png') ? 'table-row' : 'none';\n eotWidth.style.display = (es == 'svg' || es == 'png') ? 'table-row' : 'none';\n eotRegion.style.display = (es == 'svg' || es == 'png') ? 'table-row' : 'none';\n eotBanner.style.display = (es == 'svg' || es == 'png') ? 'table-row' : 'none';\n }\n setupEOT();\n\n exportForm.appendChild(exportOptsTable);\n exportForm.appendChild(exportButton);\n exportForm.appendChild(exportContent);\n\n if (this.uiMode !== 'none')\n this.hideToolPanel();\n this.browserHolder.insertBefore(exportForm, this.svgHolder);\n this.activeToolPanel = exportForm;\n\n this.setUiMode('export');\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// exports.js: shim to export symbols into global namespace for ease of embedding\n//\n\nrequire('babel-polyfill');\nvar browser = require('./cbrowser');\nvar chainset = require('./chainset');\nvar sa = require('./sourceadapters');\nvar utils = require('./utils');\nvar das = require('./das');\nvar sc = require('./sourcecompare');\n\nwindow.Browser = browser.Browser;\nwindow.sourcesAreEqual = sc.sourcesAreEqual;\nwindow.Chainset = chainset.Chainset; // Pre-0.12 configurations need this.\n\n// Useful for info plugins. Should be reconsidered in the future.\nwindow.makeElement = utils.makeElement;\n\n// Allow source plugins to be loaded separately.\nwindow.dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\nwindow.dalliance_registerParserFactory = sa.registerParserFactory;\nwindow.dalliance_makeParser = sa.makeParser;\n\n// DAS* objects for some plugins -- remove when plugin API changes...\n\nwindow.DASSequence = das.DASSequence;\nwindow.DASFeature = das.DASFeature;\nwindow.DASGroup = das.DASGroup;\nwindow.DASStylesheet = das.DASStylesheet;\nwindow.DASStyle = das.DASStyle;\nwindow.DASSource = das.DASSource; // Pre-0.8 configurations used this. Still some around...\n\nvar ruler = require(\"./rulers\");\nwindow.Ruler = ruler.Ruler;\nwindow.rulerDrawCallback = ruler.rulerDrawCallback;\n","//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// feature-draw.js: new feature-tier renderer\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var tier = require('./tier');\n var DasTier = tier.DasTier;\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n}\n\nfunction SubTier() {\n this.glyphs = [];\n this.height = 0;\n this.quant = null;\n}\n\nSubTier.prototype.indexFor = function(glyph) {\n var gmin = glyph.min();\n var lb = 0, ub = this.glyphs.length;\n while (ub > lb) {\n var mid = ((lb + ub)/2)|0;\n if (mid >= this.glyphs.length)\n return this.glyphs.length;\n var mg = this.glyphs[mid];\n if (gmin < mg.min()) {\n ub = mid;\n } else {\n lb = mid + 1;\n }\n }\n return ub;\n}\n\nSubTier.prototype.add = function(glyph) {\n var ind = this.indexFor(glyph);\n this.glyphs.splice(ind, 0, glyph);\n this.height = Math.max(this.height, glyph.height());\n if (glyph.quant && this.quant == null) {\n this.quant = glyph.quant;\n }\n}\n\nSubTier.prototype.hasSpaceFor = function(glyph) {\n var ind = this.indexFor(glyph);\n if (ind > 0 && this.glyphs[ind-1].max() >= glyph.min())\n return false;\n if (ind < this.glyphs.length && this.glyphs[ind].min() <= glyph.max())\n return false;\n\n return true;\n}\n\nDasTier.prototype.paintToContext = function(gc, oc, offset) {\n var subtiers = this.subtiers;\n var fpw = this.viewport.width|0;\n\n gc.save();\n for (var s = 0; s < subtiers.length; ++s) {\n var quant = null;\n var glyphs = subtiers[s].glyphs;\n for (var i = 0; i < glyphs.length; ++i) {\n var glyph = glyphs[i];\n if (glyph.min() < fpw-offset && glyph.max() > -offset) {\n var glyph = glyphs[i];\n glyph.draw(gc, oc);\n if (glyph.quant) {\n quant = glyph.quant;\n }\n }\n }\n\n\tif (quant && quant.min < 0 && quant.max > 0 && this.dasSource.zeroLine) {\n\t var ry = subtiers[0].height * (quant.max / (quant.max - quant.min))\n\t gc.save();\n\t gc.strokeStyle = this.dasSource.zeroLine;\n\t gc.lineWidth = 0.5;\n\t gc.beginPath();\n\t gc.moveTo(-1000, ry);\n\t gc.lineTo(fpw + 1000, ry);\n\t gc.stroke();\n\t gc.restore();\n\t}\n\n if (this.scaleVertical) {\n var scale = this.browser.scale;\n gc.translate(0, scale + this.padding);\n oc.translate(0, scale + this.padding);\n } else {\n gc.translate(0, subtiers[s].height + this.padding);\n oc.translate(0, subtiers[s].height + this.padding);\n }\n }\n gc.restore();\n\n if (quant && this.quantLeapThreshold && this.featureSource && this.browser.sourceAdapterIsCapable(this.featureSource, 'quantLeap')) {\n var ry = subtiers[0].height * (1.0 - ((this.quantLeapThreshold - quant.min) / (quant.max - quant.min)));\n\n gc.save();\n gc.strokeStyle = 'red';\n gc.lineWidth = 0.3;\n gc.beginPath();\n gc.moveTo(-1000, ry);\n gc.lineTo(fpw + 1000, ry);\n gc.stroke();\n gc.restore();\n }\n}\n\nDasTier.prototype.paintQuant = function() {\n if (!this.quantOverlay)\n return;\n\n var retina = this.browser.retina && window.devicePixelRatio > 1;\n\n var quant;\n if (this.subtiers && this.subtiers.length > 0)\n quant = this.subtiers[0].quant;\n\n if (quant) {\n var h = this.subtiers[0].height;\n var w = 50;\n this.quantOverlay.height = this.viewport.height;\n this.quantOverlay.width = retina ? w*2 : w;\n this.quantOverlay.style.height = '' + (retina ? this.quantOverlay.height/2 : this.quantOverlay.height) + 'px';\n this.quantOverlay.style.width = '' + w + 'px';\n this.quantOverlay.style.display = 'block';\n var ctx = this.quantOverlay.getContext('2d');\n if (retina)\n ctx.scale(2, 2);\n\n var numTics = 2;\n if (h > 40) {\n numTics = 1 + ((h/20) | 0);\n }\n var ticSpacing = (h + this.padding*2) / (numTics - 1);\n var ticInterval = (quant.max - quant.min) / (numTics - 1);\n\n ctx.fillStyle = 'white'\n ctx.globalAlpha = 0.6;\n if (this.browser.rulerLocation == 'right') {\n ctx.fillRect(w-30, 0, 30, h + this.padding*2);\n } else {\n ctx.fillRect(0, 0, 30, h + this.padding*2);\n }\n ctx.globalAlpha = 1.0;\n\n ctx.strokeStyle = 'black';\n ctx.lineWidth = 1;\n ctx.beginPath();\n\n if (this.browser.rulerLocation == 'right') {\n ctx.moveTo(w - 8, this.padding);\n ctx.lineTo(w, this.padding);\n ctx.lineTo(w, h + this.padding);\n ctx.lineTo(w - 8, h + this.padding);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n ctx.moveTo(w, ty);\n ctx.lineTo(w - 5, ty);\n }\n } else {\n ctx.moveTo(8, this.padding);\n ctx.lineTo(0, this.padding);\n ctx.lineTo(0, h + this.padding);\n ctx.lineTo(8, h + this.padding);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n ctx.moveTo(0, ty);\n ctx.lineTo(5, ty);\n }\n }\n ctx.stroke();\n\n ctx.fillStyle = 'black';\n\n if (this.browser.rulerLocation == 'right') {\n ctx.textAlign = 'right';\n ctx.fillText(formatQuantLabel(quant.max), w-9, 8);\n ctx.fillText(formatQuantLabel(quant.min), w-9, h + this.padding);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n ctx.fillText(formatQuantLabel((1.0*quant.max) - (t*ticInterval)), w - 9, ty + 3);\n }\n } else {\n ctx.textAlign = 'left';\n ctx.fillText(formatQuantLabel(quant.max), 9, 8);\n ctx.fillText(formatQuantLabel(quant.min), 9, h + this.padding);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n ctx.fillText(formatQuantLabel((1.0*quant.max) - (t*ticInterval)), 9, ty + 3);\n }\n }\n } else {\n this.quantOverlay.style.display = 'none';\n }\n}\n\nDasTier.prototype.styleForFeature = function(f) {\n var ssScale = this.browser.zoomForCurrentScale();\n\n if (!this.stylesheet) {\n return null;\n }\n\n var maybe = null;\n var ss = this.stylesheet.styles;\n for (var si = 0; si < ss.length; ++si) {\n var sh = ss[si];\n if (sh.zoom && sh.zoom != ssScale) {\n continue;\n }\n\n if (sh.orientation) {\n if (sh.orientation != f.orientation) {\n continue;\n }\n }\n\n var labelRE = sh._labelRE;\n if (!labelRE || !labelRE.test) {\n labelRE = new RegExp('^' + sh.label + '$');\n sh._labelRE = labelRE;\n }\n if (sh.label && !(labelRE.test(f.label))) {\n continue;\n }\n var methodRE = sh._methodRE;\n if (!methodRE || !methodRE.test) {\n methodRE = new RegExp('^' + sh.method + '$');\n sh._methodRE = methodRE;\n }\n if (sh.method && !(methodRE.test(f.method))) {\n continue;\n }\n if (sh.type) {\n if (sh.type == 'default') {\n if (!maybe) {\n maybe = sh.style;\n }\n continue;\n } else {\n var typeRE = sh._typeRE;\n if (!typeRE || !typeRE.test) {\n typeRE = new RegExp('^' + sh.type + '$');\n sh._typeRE = typeRE;\n }\n if (!typeRE.test(f.type))\n continue;\n }\n }\n return sh.style;\n }\n return maybe;\n}\n\nDasTier.prototype.quantMin = function(style) {\n if (this.forceMinDynamic) {\n return this.currentFeaturesMinScore || 0;\n } else if (typeof(this.forceMin) === 'number') {\n return this.forceMin;\n } else {\n const softMin = typeof(style.SOFTMIN) !== 'undefined' ? style.SOFTMIN : Number.MAX_VALUE;\n return style.MIN || Math.min(softMin, this.currentFeaturesMinScore || 0);\n }\n}\n\nDasTier.prototype.quantMax = function(style) {\n if (this.forceMaxDynamic) {\n return this.currentFeaturesMaxScore || 0;\n } else if (typeof(this.forceMax) === 'number') {\n return this.forceMax;\n } else {\n const softMax = typeof(style.SOFTMAX) !== 'undefined' ? style.SOFTMAX : Number.MIN_VALUE;\n return style.MAX || Math.max(softMax, this.currentFeaturesMaxScore || 0);\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n SubTier: SubTier\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// feature-popup.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var pick = utils.pick;\n var pushnew = utils.pushnew;\n var makeElement = utils.makeElement;\n}\n\n\nvar TAGVAL_NOTE_RE = new RegExp('^([A-Za-z_-]+)=(.+)');\n\nBrowser.prototype.addFeatureInfoPlugin = function (handler) {\n if (!this.featureInfoPlugins) {\n this.featureInfoPlugins = [];\n }\n this.featureInfoPlugins.push(handler);\n}\n\nfunction FeatureInfo(hit, feature, group) {\n var name = pick(group.type, feature.type);\n var fid = pick(group.label, feature.label, group.id, feature.id);\n if (!hit[0].molgenis && fid && fid.indexOf('__dazzle') != 0) {\n name = name + ': ' + fid;\n }\n\n this.hit = hit;\n this.feature = feature;\n this.group = group;\n this.title = hit[0].molgenis ? feature.id : name;\n this.sections = [];\n}\n\nFeatureInfo.prototype.setTitle = function (t) {\n this.title = t;\n}\n\nFeatureInfo.prototype.add = function (label, info) {\n if (typeof info === 'string') {\n info = makeElement('span', info);\n }\n this.sections.push({label: label, info: info});\n}\n\nBrowser.prototype.featurePopup = function (ev, __ignored_feature, hit, tier) {\n var hi = hit.length;\n var feature = --hi >= 0 ? hit[hi] : {};\n var group = --hi >= 0 ? hit[hi] : {};\n\n var featureInfo = new FeatureInfo(hit, feature, group);\n featureInfo.tier = tier;\n var fips = this.featureInfoPlugins || [];\n for (var fipi = 0; fipi < fips.length; ++fipi) {\n try {\n fips[fipi](feature, featureInfo);\n } catch (e) {\n console.log(e.stack || e);\n }\n }\n fips = tier.featureInfoPlugins || [];\n for (fipi = 0; fipi < fips.length; ++fipi) {\n try {\n fips[fipi](feature, featureInfo);\n } catch (e) {\n console.log(e.stack || e);\n }\n }\n\n this.removeAllPopups();\n\n var table = makeElement('table', null, {className: 'table table-striped table-condensed'});\n table.style.width = '100%';\n table.style.margin = '0px';\n\n var idx = 0;\n if (feature.method && !tier.dasSource.suppressMethod) {\n var row = makeElement('tr', [\n makeElement('th', 'Method'),\n makeElement('td', feature.method)\n ]);\n table.appendChild(row);\n ++idx;\n }\n {\n var loc;\n if (group.segment) {\n loc = group;\n } else {\n loc = feature;\n }\n var row = makeElement('tr', [\n makeElement('th', 'Location'),\n makeElement('td', loc.segment + ':' + loc.min + '-' + loc.max, {}, {minWidth: '200px'})\n ]);\n table.appendChild(row);\n ++idx;\n }\n if (feature.score !== undefined && feature.score !== null && feature.score != '-'\n && !feature.suppressScore && !tier.dasSource.suppressScore\n ) {\n var row = makeElement('tr', [\n makeElement('th', 'Score'),\n makeElement('td', '' + feature.score)\n ]);\n table.appendChild(row);\n ++idx;\n }\n {\n var links = maybeConcat(group.links, feature.links);\n if (links && links.length > 0) {\n var row = makeElement('tr', [\n makeElement('th', 'Links'),\n makeElement('td', links.map(function (l) {\n return makeElement('div', makeElement('a', l.desc, {href: l.uri, target: '_new'}));\n }))\n ]);\n table.appendChild(row);\n ++idx;\n }\n }\n {\n var notes = maybeConcat(group.notes, feature.notes);\n for (var ni = 0; ni < notes.length; ++ni) {\n var k = 'Note';\n var v = notes[ni];\n //---START MOLGENIS CUSTOM CODE---\n //params: do not rename, because this will make merging with dalliance changes harder\n //v is note\n //m is splitted note into array [key,value]\n //k is key\n //v is value\n if (hit[0].molgenis) {\n var m = v.split(\"=\");\n if (m.length === 2) {\n k = m[0];\n v = m[1];\n }\n }\n //---END MOLGENIS CUSTOM CODE---\n\n var row = makeElement('tr', [\n makeElement('th', k),\n makeElement('td', v)\n ]);\n table.appendChild(row);\n ++idx;\n }\n }\n\n for (var fisi = 0; fisi < featureInfo.sections.length; ++fisi) {\n var section = featureInfo.sections[fisi];\n table.appendChild(makeElement('tr', [\n makeElement('th', section.label),\n makeElement('td', section.info)]));\n }\n //---START MOLGENIS CUSTOM CODE---\n if(hit[0].molgenis) {\n if (feature.actions) {\n for (var index = 0; index < feature.actions.length; ++index) {\n let action = feature.actions[index]\n let actionItem = makeElement('a', action.label);\n\n actionItem.addEventListener('click', function (ev) {\n eval(action.run);\n }, false);\n\n table.appendChild(makeElement('tr', [\n makeElement('th', \"\"),\n makeElement('td', actionItem)]));\n }\n }\n }\n //---END MOLGENIS CUSTOM CODE---\n this.popit(ev, featureInfo.title || 'Feature', table, {width: 450});\n}\n\nfunction maybeConcat(a, b) {\n var l = [];\n if (a) {\n for (var i = 0; i < a.length; ++i) {\n pushnew(l, a[i]);\n }\n }\n if (b) {\n for (var i = 0; i < b.length; ++i) {\n pushnew(l, b[i]);\n }\n }\n return l;\n}\n","\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var pusho = utils.pusho;\n var pushnewo = utils.pushnewo;\n}\n\nfunction sortFeatures(tier)\n{\n var dmin = tier.browser.drawnStart, dmax = tier.browser.drawnEnd;\n var ungroupedFeatures = {};\n var groupedFeatures = {};\n var drawnGroupedFeatures = {};\n var groupMins = {}, groupMaxes = {};\n var groups = {};\n var superGroups = {};\n var groupsToSupers = {};\n var nonPositional = [];\n var minScore, maxScore;\n var fbid;\n\n var init_fbid = function() {\n fbid = {};\n for (var fi = 0; fi < tier.currentFeatures.length; ++fi) {\n var f = tier.currentFeatures[fi];\n if (f.id) {\n fbid[f.id] = f;\n }\n }\n };\n \n var superParentsOf = function(f) {\n // FIXME: should recur.\n var spids = [];\n if (f.parents) {\n for (var pi = 0; pi < f.parents.length; ++pi) {\n var pid = f.parents[pi];\n var p = fbid[pid];\n if (!p) {\n continue;\n }\n // alert(p.type + ':' + p.typeCv);\n if (p.typeCv == 'SO:0000704') {\n pushnew(spids, pid);\n }\n }\n }\n return spids;\n }\n\n for (var fi = 0; fi < tier.currentFeatures.length; ++fi) {\n var f = tier.currentFeatures[fi];\n if (f.parts) {\n continue;\n }\n\n var drawn = f.min <= dmax && f.max >= dmin;\n\n if (!f.min || !f.max) {\n nonPositional.push(f);\n continue;\n }\n\n if (f.score && f.score != '.' && f.score != '-') {\n var sc = 1.0 * f.score;\n if (!minScore || sc < minScore) {\n minScore = sc;\n }\n if (!maxScore || sc > maxScore) {\n maxScore = sc;\n }\n }\n\n var fGroups = [];\n var fSuperGroup = null;\n if (f.groups) {\n for (var gi = 0; gi < f.groups.length; ++gi) {\n var g = f.groups[gi];\n var gid = g.id;\n if (g.type == 'gene') {\n // Like a super-grouper...\n fSuperGroup = gid; \n groups[gid] = g;\n } else if (g.type == 'translation') {\n // have to ignore this to get sensible results from bj-e :-(.\n } else {\n pusho(groupedFeatures, gid, f);\n groups[gid] = g;\n fGroups.push(gid);\n\n var ogm = groupMins[gid];\n if (!ogm || f.min < ogm)\n groupMins[gid] = f.min;\n\n ogm = groupMaxes[gid];\n if (!ogm || f.max > ogm)\n groupMaxes[gid] = f.max;\n }\n }\n }\n\n if (f.parents) {\n if (!fbid) {\n init_fbid();\n }\n for (var pi = 0; pi < f.parents.length; ++pi) {\n var pid = f.parents[pi];\n var p = fbid[pid];\n if (!p) {\n // alert(\"couldn't find \" + pid);\n continue;\n }\n if (!p.parts) {\n p.parts = [f];\n }\n pushnewo(groupedFeatures, pid, p);\n pusho(groupedFeatures, pid, f);\n \n if (!groups[pid]) {\n groups[pid] = {\n type: p.type,\n id: p.id,\n label: p.label || p.id\n };\n }\n fGroups.push(pid);\n\n var ogm = groupMins[pid];\n if (!ogm || f.min < ogm)\n groupMins[pid] = f.min;\n\n ogm = groupMaxes[pid];\n if (!ogm || f.max > ogm)\n groupMaxes[pid] = f.max;\n\n var sgs = superParentsOf(p);\n if (sgs.length > 0) {\n fSuperGroup = sgs[0];\n var sp = fbid[sgs[0]];\n groups[sgs[0]] = {\n type: sp.type,\n id: sp.id,\n label: sp.label || sp.id\n };\n if (!tier.dasSource.collapseSuperGroups) {\n tier.dasSource.collapseSuperGroups = true;\n }\n }\n } \n }\n\n if (fGroups.length == 0) {\n if (drawn)\n pusho(ungroupedFeatures, f.type, f);\n } else if (fSuperGroup) {\n for (var g = 0; g < fGroups.length; ++g) {\n var gid = fGroups[g];\n pushnewo(superGroups, fSuperGroup, gid);\n groupsToSupers[gid] = fSuperGroup;\n } \n } \n }\n\n for (var gid in groupedFeatures) {\n var group = groups[gid];\n if (typeof(group.min) !== 'number') \n group.min = groupMins[gid];\n if (typeof(group.max) !== 'number') \n group.max = groupMaxes[gid];\n\n if (groupMaxes[gid] >= dmin && groupMins[gid] <= dmax)\n drawnGroupedFeatures[gid] = groupedFeatures[gid];\n }\n\n tier.ungroupedFeatures = ungroupedFeatures;\n tier.groupedFeatures = drawnGroupedFeatures;\n tier.groups = groups;\n tier.superGroups = superGroups;\n tier.groupsToSupers = groupsToSupers;\n\n if (minScore) {\n if (minScore > 0) {\n minScore = 0;\n } else if (maxScore < 0) {\n maxScore = 0;\n }\n tier.currentFeaturesMinScore = minScore;\n tier.currentFeaturesMaxScore = maxScore;\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n sortFeatures: sortFeatures\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// glyphs.js: components which know how to draw themselves\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var spans = require('./spans');\n var union = spans.union;\n var Range = spans.Range;\n\n var utils = require('./utils');\n var makeElementNS = utils.makeElementNS;\n var AMINO_ACID_TRANSLATION = utils.AMINO_ACID_TRANSLATION;\n\n var svgu = require('./svg-utils');\n var NS_SVG = svgu.NS_SVG;\n var NS_XLINK = svgu.NS_XLINK;\n var SVGPath = svgu.SVGPath;\n}\n\nfunction PathGlyphBase(stroke, fill) {\n this._stroke = stroke;\n this._fill = fill;\n}\n\nPathGlyphBase.prototype.draw = function(g) {\n g.beginPath();\n this.drawPath(g);\n\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fill();\n }\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.stroke();\n }\n}\n\nPathGlyphBase.prototype.toSVG = function() {\n var g = new SVGPath();\n this.drawPath(g);\n \n return makeElementNS(\n NS_SVG, 'path',\n null,\n {d: g.toPathData(),\n fill: this._fill || 'none',\n stroke: this._stroke || 'none'});\n}\n\nPathGlyphBase.prototype.drawPath = function(g) {\n throw 'drawPath method on PathGlyphBase must be overridden';\n}\n\nfunction BoxGlyph(x, y, width, height, fill, stroke, alpha, radius) {\n this.x = x;\n this.y = y;\n this._width = width;\n this._height = height;\n this.fill = fill;\n this.stroke = stroke;\n this._alpha = alpha;\n this._radius = radius || 0;\n}\n\nBoxGlyph.prototype.draw = function(g) {\n var r = this._radius;\n\n if (r > 0) {\n g.beginPath();\n g.moveTo(this.x + r, this.y);\n g.lineTo(this.x + this._width - r, this.y);\n g.arcTo(this.x + this._width, this.y, this.x + this._width, this.y + r, r);\n g.lineTo(this.x + this._width, this.y + this._height - r);\n g.arcTo(this.x + this._width, this.y + this._height, this.x + this._width - r, this.y + this._height, r);\n g.lineTo(this.x + r, this.y + this._height);\n g.arcTo(this.x, this.y + this._height, this.x, this.y + this._height - r, r);\n g.lineTo(this.x, this.y + r);\n g.arcTo(this.x, this.y, this.x + r, this.y, r);\n g.closePath();\n\n if (this._alpha != null) {\n g.save();\n g.globalAlpha = this._alpha;\n }\n \n if (this.fill) {\n g.fillStyle = this.fill;\n g.fill();\n }\n if (this.stroke) {\n g.strokeStyle = this.stroke;\n g.lineWidth = 0.5;\n g.stroke();\n }\n\n if (this._alpha != null) {\n g.restore();\n }\n } else {\n if (this._alpha != null) {\n g.save();\n g.globalAlpha = this._alpha;\n }\n\n if (this.fill) {\n g.fillStyle = this.fill;\n g.fillRect(this.x, this.y, this._width, this._height);\n }\n\n if (this.stroke) {\n g.strokeStyle = this.stroke;\n g.lineWidth = 0.5;\n g.strokeRect(this.x, this.y, this._width, this._height)\n }\n\n if (this._alpha != null) {\n g.restore();\n }\n }\n}\n\nBoxGlyph.prototype.toSVG = function() {\n var s = makeElementNS(NS_SVG, 'rect', null,\n {x: this.x, \n y: this.y, \n width: this._width, \n height: this._height,\n stroke: this.stroke || 'none',\n strokeWidth: 0.5,\n fill: this.fill || 'none'});\n if (this._alpha != null) {\n s.setAttribute('opacity', this._alpha);\n }\n\n return s;\n}\n\nBoxGlyph.prototype.min = function() {\n return this.x;\n}\n\nBoxGlyph.prototype.max = function() {\n return this.x + this._width;\n}\n\nBoxGlyph.prototype.height = function() {\n return this.y + this._height;\n}\n\n\nfunction GroupGlyph(glyphs, connector) {\n this.glyphs = glyphs;\n this.connector = connector;\n this.h = glyphs[0].height();\n\n var covList = [];\n for (var g = 0; g < glyphs.length; ++g) {\n var gg = glyphs[g];\n covList.push(new Range(gg.min(), gg.max()));\n this.h = Math.max(this.h, gg.height());\n }\n this.coverage = union(covList);\n}\n\nGroupGlyph.prototype.drawConnectors = function(g) {\n var ranges = this.coverage.ranges();\n for (var r = 1; r < ranges.length; ++r) {\n var gl = ranges[r];\n var last = ranges[r - 1];\n if (last && gl.min() > last.max()) {\n var start = last.max();\n var end = gl.min();\n var mid = (start+end)/2\n \n if (this.connector === 'hat+') {\n g.moveTo(start, this.h/2);\n g.lineTo(mid, 0);\n g.lineTo(end, this.h/2);\n } else if (this.connector === 'hat-') {\n g.moveTo(start, this.h/2);\n g.lineTo(mid, this.h);\n g.lineTo(end, this.h/2);\n } else if (this.connector === 'collapsed+') {\n g.moveTo(start, this.h/2);\n g.lineTo(end, this.h/2);\n if (end - start > 4) {\n g.moveTo(mid - 2, (this.h/2) - 3);\n g.lineTo(mid + 2, this.h/2);\n g.lineTo(mid - 2, (this.h/2) + 3);\n }\n } else if (this.connector === 'collapsed-') {\n g.moveTo(start, this.h/2);\n g.lineTo(end, this.h/2);\n if (end - start > 4) {\n g.moveTo(mid + 2, (this.h/2) - 3);\n g.lineTo(mid - 2, this.h/2);\n g.lineTo(mid + 2, (this.h/2) + 3);\n }\n } else {\n g.moveTo(start, this.h/2);\n g.lineTo(end, this.h/2);\n }\n }\n last = gl;\n }\n}\n\nGroupGlyph.prototype.draw = function(g, oc) {\n for (var i = 0; i < this.glyphs.length; ++i) {\n var gl = this.glyphs[i];\n gl.draw(g, oc);\n }\n\n g.strokeStyle = 'black';\n g.beginPath();\n this.drawConnectors(g);\n g.stroke();\n}\n\nGroupGlyph.prototype.toSVG = function() {\n var g = makeElementNS(NS_SVG, 'g');\n for (var i = 0; i < this.glyphs.length; ++i) {\n g.appendChild(this.glyphs[i].toSVG());\n }\n\n var p = new SVGPath();\n this.drawConnectors(p);\n\n var pathData = p.toPathData();\n if (pathData.length > 0) {\n var path = makeElementNS(\n NS_SVG, 'path',\n null,\n {d: p.toPathData(),\n fill: 'none',\n stroke: 'black',\n strokeWidth: 0.5});\n g.appendChild(path);\n }\n\n return g;\n}\n\nGroupGlyph.prototype.min = function() {\n return this.coverage.min();\n}\n\nGroupGlyph.prototype.max = function() {\n return this.coverage.max();\n}\n\nGroupGlyph.prototype.height = function() {\n return this.h;\n}\n\n\nfunction LineGraphGlyph(points, color, height) {\n this.points = points;\n this.color = color;\n this._height = height || 50;\n}\n\nLineGraphGlyph.prototype.min = function() {\n return this.points[0].x;\n // return this.points[0];\n};\n\nLineGraphGlyph.prototype.max = function() {\n return this.points[this.points.length - 1].x;\n // return this.points[this.points.length - 2];\n};\n\nLineGraphGlyph.prototype.height = function() {\n return this._height;\n}\n\nLineGraphGlyph.prototype.draw = function(g) {\n g.save();\n g.strokeStyle = this.color;\n g.lineWidth = 2;\n g.beginPath();\n this.points.forEach(function(p, i) {\n if (i === 0)\n g.moveTo(p.x, p.y);\n else\n g.lineTo(p.x, p.y);\n });\n g.stroke();\n g.restore();\n}\n\nLineGraphGlyph.prototype.toSVG = function() {\n var p = new SVGPath();\n for (let i = 0; i < this.points.length; ++i) {\n var x = this.points[i].x;\n var y = this.points[i].y;\n if (i == 0) {\n p.moveTo(x, y);\n } else {\n p.lineTo(x, y);\n }\n }\n \n return makeElementNS(\n NS_SVG, 'path',\n null,\n {d: p.toPathData(),\n fill: 'none',\n stroke: this.color,\n strokeWidth: '2px'});\n}\n\nfunction LabelledGlyph(GLOBAL_GC, glyph, text, unmeasured, anchor, align, font) {\n this.glyph = glyph;\n this.text = text;\n this.anchor = anchor || 'left';\n this.align = align || 'below';\n if (font) {\n this.font = font;\n }\n if (this.font) {\n GLOBAL_GC.save();\n GLOBAL_GC.font = this.font;\n }\n var metrics = GLOBAL_GC.measureText(text);\n if (this.font) {\n GLOBAL_GC.restore();\n }\n this.textLen = metrics.width;\n this.textHeight = 5;\n this.bump = glyph.bump;\n this.measured = !unmeasured;\n}\n\nLabelledGlyph.prototype.toSVG = function() {\n var child = this.glyph.toSVG();\n var opts = {};\n \n if (this.align == 'above') {\n child = makeElementNS(NS_SVG, 'g', child, {transform: \"translate(0, \" + (this.textHeight|0 + 2) + \")\"});\n opts.y = this.textHeight;\n } else {\n opts.y = this.glyph.height() + 15;\n }\n\n if (this.font) {\n opts.fontSize = 7;\n }\n\n if ('center' == this.anchor) {\n opts.x = (this.glyph.min() + this.glyph.max() - this.textLen) / 2;\n } else {\n opts.x = this.glyph.min();\n }\n\n return makeElementNS(NS_SVG, 'g',\n [child,\n makeElementNS(NS_SVG, 'text', this.text, opts)]);\n}\n\nLabelledGlyph.prototype.min = function() {\n return this.glyph.min();\n}\n\nLabelledGlyph.prototype.max = function() {\n if (this.measured)\n return Math.max(this.glyph.max(), (1.0*this.glyph.min()) + this.textLen + 10);\n else\n return this.glyph.max();\n}\n\nLabelledGlyph.prototype.height = function() {\n var h = this.glyph.height();\n if (this.measured) {\n if (this.align == 'above') {\n h += this.textHeight + 2;\n } else {\n h += 20;\n }\n }\n return h;\n}\n\nLabelledGlyph.prototype.draw = function(g, oc) {\n if (this.align == 'above') {\n g.save();\n g.translate(0, this.textHeight + 2);\n }\n this.glyph.draw(g);\n if (this.align == 'above') {\n g.restore();\n }\n\n oc.registerGlyph(this);\n}\n\nLabelledGlyph.prototype.drawOverlay = function(g, minVisible, maxVisible) {\n g.fillStyle = 'black';\n if (this.font) {\n g.save();\n g.font = this.font;\n }\n var p;\n if ('center' == this.anchor) {\n p = (this.glyph.min() + this.glyph.max() - this.textLen) / 2;\n } else {\n p = this.glyph.min();\n if (p < minVisible) {\n p = Math.min(minVisible, this.glyph.max() - this.textLen);\n }\n }\n g.fillText(this.text, p, this.align == 'above' ? this.textHeight : this.glyph.height() + 15);\n if (this.font) {\n g.restore();\n }\n}\n\n\n\nfunction CrossGlyph(x, height, stroke) {\n this._x = x;\n this._height = height;\n this._stroke = stroke;\n}\n\nCrossGlyph.prototype.draw = function(g) {\n var hh = this._height/2;\n \n g.beginPath();\n g.moveTo(this._x, 0);\n g.lineTo(this._x, this._height);\n g.moveTo(this._x - hh, hh);\n g.lineTo(this._x + hh, hh);\n\n g.strokeStyle = this._stroke;\n g.lineWidth = 1;\n\n g.stroke();\n}\n\nCrossGlyph.prototype.toSVG = function() {\n var hh = this._height/2;\n\n var g = new SVGPath();\n g.moveTo(this._x, 0);\n g.lineTo(this._x, this._height);\n g.moveTo(this._x - hh, hh);\n g.lineTo(this._x + hh, hh);\n \n return makeElementNS(\n NS_SVG, 'path',\n null,\n {d: g.toPathData(),\n fill: 'none',\n stroke: this._stroke,\n strokeWidth: '1px'});\n}\n\nCrossGlyph.prototype.min = function() {\n return this._x - this._height/2;\n}\n\nCrossGlyph.prototype.max = function() {\n return this._x + this._height/2;\n}\n\nCrossGlyph.prototype.height = function() {\n return this._height;\n}\n\nfunction ExGlyph(x, height, stroke) {\n this._x = x;\n this._height = height;\n this._stroke = stroke;\n}\n\nExGlyph.prototype.draw = function(g) {\n var hh = this._height/2;\n \n g.beginPath();\n g.moveTo(this._x - hh, 0);\n g.lineTo(this._x + hh, this._height);\n g.moveTo(this._x - hh, this._height);\n g.lineTo(this._x + hh, 0);\n\n g.strokeStyle = this._stroke;\n g.lineWidth = 1;\n\n g.stroke();\n}\n\nExGlyph.prototype.toSVG = function() {\n var hh = this._height/2;\n\n var g = new SVGPath();\n g.moveTo(this._x - hh, 0);\n g.lineTo(this._x + hh, this._height);\n g.moveTo(this._x - hh, this._height);\n g.lineTo(this._x + hh, 0);\n \n return makeElementNS(\n NS_SVG, 'path',\n null,\n {d: g.toPathData(),\n fill: 'none',\n stroke: this._stroke,\n strokeWidth: '1px'});\n}\n\nExGlyph.prototype.min = function() {\n return this._x - this._height/2;\n}\n\nExGlyph.prototype.max = function() {\n return this._x + this._height/2;\n}\n\nExGlyph.prototype.height = function() {\n return this._height;\n}\n\n\n\nfunction TriangleGlyph(x, height, dir, width, fill, stroke) {\n PathGlyphBase.call(this, stroke, fill);\n\n this._x = x;\n this._height = height;\n this._dir = dir;\n this._width = width;\n}\n\nTriangleGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nTriangleGlyph.prototype.drawPath = function(g) {\n var hh = this._height/2;\n var hw = this._width/2;\n\n if (this._dir === 'S') {\n g.moveTo(this._x, this._height);\n g.lineTo(this._x - hw, 0);\n g.lineTo(this._x + hw, 0);\n } else if (this._dir === 'W') {\n g.moveTo(this._x + hw, hh);\n g.lineTo(this._x - hw, 0);\n g.lineTo(this._x - hw, this._height);\n } else if (this._dir === 'E') {\n g.moveTo(this._x - hw, hh);\n g.lineTo(this._x + hw, 0);\n g.lineTo(this._x + hw, this._height);\n } else {\n g.moveTo(this._x , 0);\n g.lineTo(this._x + hw, this._height);\n g.lineTo(this._x - hw, this._height);\n }\n\n g.closePath();\n}\n\nTriangleGlyph.prototype.min = function() {\n return this._x - this._height/2;\n}\n\nTriangleGlyph.prototype.max = function() {\n return this._x + this._height/2;\n}\n\nTriangleGlyph.prototype.height = function() {\n return this._height;\n}\n\n\n\n\nfunction DotGlyph(x, height, fill, stroke) {\n this._x = x;\n this._height = height;\n this._fill = fill;\n this._stroke = stroke;\n}\n\nDotGlyph.prototype.draw = function(g) {\n var hh = this._height/2;\n g.fillStyle = this._stroke;\n g.beginPath();\n g.arc(this._x, hh, hh, 0, 6.29);\n\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fill();\n }\n\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.stroke();\n }\n}\n\nDotGlyph.prototype.toSVG = function() {\n var hh = this._height/2;\n return makeElementNS(\n NS_SVG, 'circle',\n null,\n {cx: this._x, cy: hh, r: hh,\n fill: this._fill || 'none',\n stroke: this._stroke || 'none',\n strokeWidth: '1px'});\n}\n\nDotGlyph.prototype.min = function() {\n return this._x - this._height/2;\n}\n\nDotGlyph.prototype.max = function() {\n return this._x + this._height/2;\n}\n\nDotGlyph.prototype.height = function() {\n return this._height;\n}\n\n\nfunction PaddedGlyph(glyph, minp, maxp) {\n this.glyph = glyph;\n this._min = minp;\n this._max = maxp;\n if (glyph) {\n this.bump = glyph.bump;\n }\n}\n\nPaddedGlyph.prototype.draw = function(g, oc) {\n if (this.glyph) \n this.glyph.draw(g, oc);\n}\n\nPaddedGlyph.prototype.toSVG = function() {\n if (this.glyph) {\n return this.glyph.toSVG();\n } else {\n return makeElementNS(NS_SVG, 'g');\n }\n}\n\nPaddedGlyph.prototype.min = function() {\n return this._min;\n}\n\nPaddedGlyph.prototype.max = function() {\n return this._max;\n}\n\nPaddedGlyph.prototype.height = function() {\n if (this.glyph) {\n return this.glyph.height();\n } else {\n return 1;\n }\n}\n\n\nfunction AArrowGlyph(min, max, height, fill, stroke, ori) {\n PathGlyphBase.call(this, stroke, fill);\n this._min = min;\n this._max = max;\n this._height = height;\n this._ori = ori;\n}\n\nAArrowGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nAArrowGlyph.prototype.min = function() {\n return this._min;\n}\n\nAArrowGlyph.prototype.max = function() {\n return this._max;\n}\n\nAArrowGlyph.prototype.height = function() {\n return this._height;\n}\n\nAArrowGlyph.prototype.drawPath = function(g) {\n var maxPos = this._max;\n var minPos = this._min;\n var height = this._height;\n var lInset = 0;\n var rInset = 0;\n var minLength = this._height + 2;\n var instep = 0.333333 * this._height;\n var y = 0;\n\n if (this._ori) {\n if (this._ori === '+') {\n rInset = 0.5 * this._height;\n } else if (this._ori === '-') {\n lInset = 0.5 * this._height;\n }\n }\n\n if (maxPos - minPos < minLength) {\n minPos = (maxPos + minPos - minLength) / 2;\n maxPos = minPos + minLength;\n }\n\n g.moveTo(minPos + lInset, y+instep);\n g.lineTo(maxPos - rInset, y+instep);\n g.lineTo(maxPos - rInset, y);\n g.lineTo(maxPos, y + this._height/2);\n g.lineTo(maxPos - rInset, y+height);\n g.lineTo(maxPos - rInset, y+instep+instep);\n g.lineTo(minPos + lInset, y+instep+instep);\n g.lineTo(minPos + lInset, y+height);\n g.lineTo(minPos, y+height/2);\n g.lineTo(minPos + lInset, y);\n g.lineTo(minPos + lInset, y+instep);\n}\n\nfunction SpanGlyph(min, max, height, stroke) {\n PathGlyphBase.call(this, stroke, null);\n this._min = min;\n this._max = max;\n this._height = height;\n}\n\nSpanGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nSpanGlyph.prototype.min = function() {return this._min};\nSpanGlyph.prototype.max = function() {return this._max};\nSpanGlyph.prototype.height = function() {return this._height};\n\nSpanGlyph.prototype.drawPath = function(g) {\n var minPos = this._min, maxPos = this._max;\n var height = this._height, hh = height/2;\n g.moveTo(minPos, hh);\n g.lineTo(maxPos, hh);\n g.moveTo(minPos, 0);\n g.lineTo(minPos, height);\n g.moveTo(maxPos, 0);\n g.lineTo(maxPos, height);\n}\n\nfunction LineGlyph(min, max, height, style, strand, stroke) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._style = style;\n this._strand = strand;\n this._stroke = stroke;\n}\n\nLineGlyph.prototype.min = function() {return this._min};\nLineGlyph.prototype.max = function() {return this._max};\nLineGlyph.prototype.height = function() {return this._height};\n\nLineGlyph.prototype.drawPath = function(g) {\n var minPos = this._min, maxPos = this._max;\n var height = this._height, hh = height/2;\n\n if (this._style === 'hat') {\n g.moveTo(minPos, hh);\n g.lineTo((minPos + maxPos)/2, this._strand === '-' ? height : 0);\n g.lineTo(maxPos, hh);\n } else {\n g.moveTo(minPos, hh);\n g.lineTo(maxPos, hh);\n }\n}\n\n\nLineGlyph.prototype.draw = function(g) {\n g.beginPath();\n this.drawPath(g);\n g.strokeStyle = this._stroke;\n if (this._style === 'dashed' && g.setLineDash) {\n g.save();\n g.setLineDash([3]);\n g.stroke();\n g.restore();\n } else {\n g.stroke();\n }\n}\n\nLineGlyph.prototype.toSVG = function() {\n var g = new SVGPath();\n this.drawPath(g);\n \n var opts = {d: g.toPathData(),\n stroke: this._stroke || 'none'};\n if (this._style === 'dashed') {\n opts['strokeDasharray'] = '3';\n }\n\n return makeElementNS(\n NS_SVG, 'path',\n null, opts\n );\n}\n\n\n\n\n\nfunction PrimersGlyph(min, max, height, fill, stroke) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._stroke = stroke;\n}\n\nPrimersGlyph.prototype.min = function() {return this._min};\nPrimersGlyph.prototype.max = function() {return this._max};\nPrimersGlyph.prototype.height = function() {return this._height};\n\n\nPrimersGlyph.prototype.drawStemPath = function(g) {\n var minPos = this._min, maxPos = this._max;\n var height = this._height, hh = height/2;\n g.moveTo(minPos, hh);\n g.lineTo(maxPos, hh);\n}\n\nPrimersGlyph.prototype.drawTrigsPath = function(g) {\n var minPos = this._min, maxPos = this._max;\n var height = this._height, hh = height/2;\n g.moveTo(minPos, 0);\n g.lineTo(minPos + height, hh);\n g.lineTo(minPos, height);\n g.lineTo(minPos, 0);\n g.moveTo(maxPos, 0);\n g.lineTo(maxPos - height, hh);\n g.lineTo(maxPos, height);\n g.lineTo(maxPos, 0);\n}\n\n\nPrimersGlyph.prototype.draw = function(g) {\n g.beginPath();\n this.drawStemPath(g);\n g.strokeStyle = this._stroke;\n g.stroke();\n g.beginPath();\n this.drawTrigsPath(g);\n g.fillStyle = this._fill;\n g.fill();\n}\n\nPrimersGlyph.prototype.toSVG = function() {\n var s = new SVGPath();\n this.drawStemPath(s);\n var t = new SVGPath();\n this.drawTrigsPath(t);\n \n return makeElementNS(\n NS_SVG, 'g',\n [makeElementNS(\n NS_SVG, 'path',\n null,\n {d: s.toPathData(),\n stroke: this._stroke || 'none'}),\n makeElementNS(\n NS_SVG, 'path',\n null,\n {d: t.toPathData(),\n fill: this._fill || 'none'})]);\n}\n\nfunction ArrowGlyph(min, max, height, color, parallel, sw, ne) {\n PathGlyphBase.call(this, null, color);\n this._min = min;\n this._max = max;\n this._height = height;\n this._color = color;\n this._parallel = parallel;\n this._sw = sw;\n this._ne = ne;\n}\n\nArrowGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nArrowGlyph.prototype.min = function() {return this._min};\nArrowGlyph.prototype.max = function() {return this._max};\nArrowGlyph.prototype.height = function() {return this._height};\n\nArrowGlyph.prototype.drawPath = function(g) {\n var min = this._min, max = this._max, height = this._height;\n \n if (this._parallel) {\n var hh = height/2;\n var instep = 0.4 * height;\n if (this._sw) {\n g.moveTo(min + hh, height-instep);\n g.lineTo(min + hh, height);\n g.lineTo(min, hh);\n g.lineTo(min + hh, 0);\n g.lineTo(min + hh, instep);\n } else {\n g.moveTo(min, height-instep);\n g.lineTo(min, instep);\n }\n if (this._ne) {\n g.lineTo(max - hh, instep);\n g.lineTo(max - hh, 0);\n g.lineTo(max, hh);\n g.lineTo(max - hh, height);\n g.lineTo(max - hh, height - instep);\n } else {\n g.lineTo(max, instep);\n g.lineTo(max, height-instep);\n }\n g.closePath();\n } else {\n var mid = (min+max)/2;\n var instep = 0.4*(max-min);\n var th = height/3;\n\n if (this._ne) {\n g.moveTo(min + instep, th);\n g.lineTo(min, th);\n g.lineTo(mid, 0);\n g.lineTo(max, th);\n g.lineTo(max - instep, th);\n } else {\n g.moveTo(min+instep, 0);\n g.lineTo(max-instep, 0);\n }\n if (this._sw) {\n g.lineTo(max - instep, height-th);\n g.lineTo(max, height-th);\n g.lineTo(mid, height);\n g.lineTo(min, height-th)\n g.lineTo(min + instep, height-th);\n } else {\n g.lineTo(max - instep, height);\n g.lineTo(min + instep, height);\n }\n g.closePath();\n }\n}\n\n\nfunction TooManyGlyph(min, max, height, fill, stroke) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._stroke = stroke;\n}\n\nTooManyGlyph.prototype.min = function() {return this._min};\nTooManyGlyph.prototype.max = function() {return this._max};\nTooManyGlyph.prototype.height = function() {return this._height};\n\nTooManyGlyph.prototype.toSVG = function() {\n return makeElementNS(NS_SVG, 'rect', null,\n {x: this._min, \n y: 0, \n width: this._max - this._min, \n height: this._height,\n stroke: this._stroke || 'none',\n fill: this._fill || 'none'});\n}\n\nTooManyGlyph.prototype.draw = function(g) {\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fillRect(this._min, 0, this._max - this._min, this._height);\n }\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.strokeRect(this._min, 0, this._max - this._min, this._height);\n g.beginPath();\n for (var n = 2; n < this._height; n += 3) {\n g.moveTo(this._min, n);\n g.lineTo(this._max, n);\n }\n g.stroke();\n }\n}\n\nfunction TextGlyph(GLOBAL_GC, min, max, height, fill, string) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._string = string;\n this._textLen = GLOBAL_GC.measureText(string).width;\n}\n\nTextGlyph.prototype.min = function() {return this._min};\nTextGlyph.prototype.max = function() {return Math.max(this._max, this._min + this._textLen)};\nTextGlyph.prototype.height = function() {return this._height};\n\nTextGlyph.prototype.draw = function(g) {\n g.fillStyle = this._fill;\n g.fillText(this._string, this._min, this._height - 4);\n}\n\nTextGlyph.prototype.toSVG = function() {\n return makeElementNS(NS_SVG, 'text', this._string, {x: this._min, y: this._height - 4});\n};\n\nfunction aminoTileColor(aa, start, color) {\n var ALTERNATE_COLOR = {\n 'red': 'darkred',\n 'purple': 'mediumpurple',\n 'blue': 'darkblue',\n 'green': 'darkgreen'\n };\n var color2 = ALTERNATE_COLOR[color.toLowerCase()];\n var tileColors;\n if (!color2)\n tileColors = ['rgb(73, 68, 149)', 'rgb(9, 0, 103)'];\n // default to UCSC colors\n else\n tileColors = [color, color2];\n\n if (aa == '?')\n return 'black';\n else if (aa == 'M')\n return 'greenyellow';\n else if (aa == '*')\n return 'crimson';\n else\n return tileColors[start % 2];\n}\n\nfunction reverseComplement(sequence) {\n var seq_dict = {'A': 'T', 'T': 'A', 'G': 'C', 'C': 'G'};\n var rev_seq = sequence.split('').reverse().join('');\n var rev_compl_seq = [];\n for (var b = 0; b < rev_seq.length; ++b) {\n var base = rev_seq.substr(b, 1).toUpperCase();\n rev_compl_seq.push(base in seq_dict ? seq_dict[base] : 'N');\n }\n return rev_compl_seq.join('');\n}\n\nfunction AminoAcidGlyph(min, max, height, fill, seq, orientation, readframe) {\n this._min = min;\n this._max = max;\n this._height = height;\n this._fill = fill;\n this._seq = seq;\n this._orientation = orientation;\n this._readframe = readframe;\n}\n\nAminoAcidGlyph.prototype.min = function() {return this._min};\nAminoAcidGlyph.prototype.max = function() {return this._max};\nAminoAcidGlyph.prototype.height = function() {return this._height};\n\nAminoAcidGlyph.prototype.draw = function(gc) {\n var seq = this._seq;\n var color = this._fill;\n\n if (!seq) return;\n\n var scale = (this._max - this._min + 1) / seq.length;\n\n var prevOverhang = (3 - this._readframe) % 3;\n var nextOverhang = (seq.length - prevOverhang) % 3;\n var leftOverhang = this._orientation == '+' ? prevOverhang : nextOverhang;\n \n if (leftOverhang > 0) {\n gc.fillStyle = color;\n gc.fillRect(this._min, 0, scale * leftOverhang, this._height);\n }\n\n for (var p = leftOverhang; p < seq.length; p += 3) {\n var codon = seq.substr(p, 3).toUpperCase();\n if (this._orientation == '-')\n codon = reverseComplement(codon);\n var aa = codon in AMINO_ACID_TRANSLATION ? AMINO_ACID_TRANSLATION[codon] : '?';\n color = codon.length == 3 ? aminoTileColor(aa, p, this._fill) : this._fill;\n gc.fillStyle = color;\n gc.fillRect(this._min + p * scale, 0, scale * codon.length, this._height);\n\n if (scale >= 8 && codon.length == 3) {\n gc.fillStyle = 'white';\n gc.fillText(aa, this._min + (p+1) * scale, this._height);\n } \n }\n}\n\nAminoAcidGlyph.prototype.toSVG = function() {\n var g = makeElementNS(NS_SVG, 'g');\n var seq = this._seq;\n var color = this._fill;\n\n if (!seq)\n return g;\n\n var scale = (this._max - this._min + 1) / seq.length;\n\n var prevOverhang = (3 - this._readframe) % 3;\n var nextOverhang = (seq.length - prevOverhang) % 3;\n var leftOverhang = this._orientation == '+' ? prevOverhang : nextOverhang;\n\n if (leftOverhang > 0) {\n g.appendChild(\n makeElementNS(NS_SVG, 'rect', null, {\n x: this._min,\n y: 0,\n width: scale * leftOverhang,\n height: this._height,\n fill: color}));\n }\n for (var p = leftOverhang; p < seq.length; p += 3) {\n var codon = seq.substr(p, 3).toUpperCase();\n if (this._orientation == '-')\n codon = reverseComplement(codon);\n var aa = codon in AMINO_ACID_TRANSLATION ? AMINO_ACID_TRANSLATION[codon] : '?';\n color = codon.length == 3 ? aminoTileColor(aa, p, this._fill) : this._fill;\n g.appendChild(\n makeElementNS(NS_SVG, 'rect', null, {\n x: this._min + p * scale,\n y: 0,\n width: scale * codon.length,\n height: this._height,\n fill: color}));\n\n if (scale >= 8 && codon.length == 3) {\n g.appendChild(\n makeElementNS(NS_SVG, 'text', aa, {\n x: this._min + (p+1) * scale,\n y: this._height,\n fill: 'white'}));\n }\n }\n return g;\n};\n\nvar isRetina = typeof(window) !== 'undefined' && window.devicePixelRatio > 1;\nvar __dalliance_SequenceGlyphCache = {};\nvar altPattern = new RegExp('^[ACGT-]$');\nvar isCloseUp = function(scale) {\n return scale >= 8;\n}\n\nfunction SequenceGlyph(baseColors, strandColor, min, max, height, seq, ref, scheme, quals, fillbg, scaleVertical) {\n this.baseColors = baseColors;\n this._strandColor = strandColor;\n this._min = min;\n this._max = max;\n this._height = height;\n this._seq = seq;\n this._ref = ref;\n this._scheme = scheme;\n this._quals = quals;\n this._fillbg = fillbg;\n this._scaleVertical = scaleVertical;\n}\n\nSequenceGlyph.prototype.min = function() {return this._min};\nSequenceGlyph.prototype.max = function() {return this._max};\nSequenceGlyph.prototype.height = function() {return this._height};\n\n\nSequenceGlyph.prototype.alphaForQual = function(qual) {\n return 0.1 + 0.9*Math.max(0.0, Math.min((1.0 * qual) / 30.0, 1.0));\n}\n\nSequenceGlyph.prototype.draw = function(gc) {\n var seq = this._seq;\n var ref = this._ref;\n var mismatch = this._scheme === 'mismatch' || this._scheme === 'mismatch-all';\n var all = this._scheme === 'mismatch-all';\n \n var seqLength = seq ? seq.length : (this._max - this._min + 1);\n var scale = (this._max - this._min + 1) / seqLength;\n\n if (mismatch && !isCloseUp(scale)) {\n gc.fillStyle = this._strandColor;\n if (this._scaleVertical)\n gc.fillRect(this._min, scale, this._max - this._min, scale);\n else\n gc.fillRect(this._min, this._height/4, this._max - this._min, this._height/2);\n }\n\n \n for (var p = 0; p < seqLength; ++p) {\n var base = seq ? seq.substr(p, 1).toUpperCase() : 'N';\n \n if (!altPattern.test(base) && !isCloseUp(scale))\n continue;\n\n var color = this.baseColors[base];\n\n if (this._quals) {\n var qc = this._quals.charCodeAt(p) - 33;\n var oldAlpha = gc.globalAlpha; // NB hoisted!\n gc.globalAlpha = this.alphaForQual(qc);\n }\n\n if (!color) {\n var refBase = ref ? ref.substr(p, 1).toUpperCase() : 'N';\n if (base == 'N' || refBase == 'N')\n color = 'gray';\n else\n color = this._strandColor;\n\n if (all)\n base = refBase;\n }\n\n gc.fillStyle = color;\n\n var alt = altPattern.test(base);\n if (this._fillbg || !isCloseUp(scale) || !alt) {\n if (this._scaleVertical)\n gc.fillRect(this._min + p*scale, scale, scale, scale);\n else\n gc.fillRect(this._min + p*scale, 0, scale, this._height);\n }\n if (isCloseUp(scale) && alt) {\n var key = color + '_' + base\n var img = __dalliance_SequenceGlyphCache[key];\n if (!img) {\n img = document.createElement('canvas');\n if (isRetina) {\n img.width = 16;\n img.height = 20;\n } else {\n img.width = 8;\n img.height = 10;\n }\n var imgGc = img.getContext('2d');\n if (isRetina) {\n imgGc.scale(2, 2);\n }\n imgGc.fillStyle = this._fillbg ? 'black' : color;\n var w = imgGc.measureText(base).width;\n imgGc.fillText(base, 0.5 * (8.0 - w), 8);\n __dalliance_SequenceGlyphCache[key] = img;\n }\n var dy = this._scaleVertical ? scale : 0;\n if (isRetina)\n gc.drawImage(img, this._min + p*scale + 0.5*(scale-8), dy, 8, 10);\n else\n gc.drawImage(img, this._min + p*scale + 0.5*(scale-8), dy);\n } \n\n if (this._quals) {\n gc.globalAlpha = oldAlpha;\n }\n }\n}\n\nSequenceGlyph.prototype.toSVG = function() {\n var seq = this._seq;\n var ref = this._ref;\n var mismatch = this._scheme === 'mismatch' || this._scheme === 'mismatch-all';\n var all = this._scheme === 'mismatch-all';\n var scale = (this._max - this._min + 1) / this._seq.length;\n var g = makeElementNS(NS_SVG, 'g'); \n\n for (var p = 0; p < seq.length; ++p) {\n var base = seq ? seq.substr(p, 1).toUpperCase() : 'N';\n var color = this.baseColors[base];\n\n if (!color) {\n var refBase = ref ? ref.substr(p, 1).toUpperCase() : 'N';\n if (base == 'N' || refBase == 'N')\n color = 'gray';\n else\n color = this._strandColor;\n\n if (all)\n base = refBase;\n }\n\n var alpha = 1.0;\n if (this._quals) {\n var qc = this._quals.charCodeAt(p) - 33;\n alpha = this.alphaForQual(qc);\n }\n\n var alt = altPattern.test(base);\n if (this._fillbg || !isCloseUp(scale) || !alt) {\n g.appendChild(\n makeElementNS(NS_SVG, 'rect', null, {\n x:this._min + p*scale,\n y: 0,\n width: scale,\n height: this._height,\n fill: color,\n fillOpacity: alpha}));\n }\n\n if (isCloseUp(scale) && alt) {\n g.appendChild(\n makeElementNS(NS_SVG, 'text', base, {\n x: this._min + (0.5+p)*scale,\n y: 8,\n textAnchor: 'middle',\n fill: this._fillbg ? 'black' : color,\n fillOpacity: alpha}));\n }\n }\n\n return g;\n}\n\nfunction TranslatedGlyph(glyph, x, y, height) {\n this.glyph = glyph;\n this._height = height;\n this._x = x;\n this._y = y;\n}\n\nTranslatedGlyph.prototype.height = function() {\n if (this._height) {\n return this._height;\n } else {\n return this.glyph.height() + this._y;\n }\n}\n\nTranslatedGlyph.prototype.min = function() {\n return this.glyph.min() + this._x;\n}\n\nTranslatedGlyph.prototype.max = function() {\n return this.glyph.max() + this._x;\n}\n\nTranslatedGlyph.prototype.minY = function() {\n return this._y;\n}\n\nTranslatedGlyph.prototype.maxY = function() {\n return this._y + this.glyph.height();\n}\n\nTranslatedGlyph.prototype.draw = function(g, o) {\n g.save();\n g.translate(this._x, this._y);\n this.glyph.draw(g, o);\n g.restore();\n}\n\nTranslatedGlyph.prototype.toSVG = function() {\n var s = this.glyph.toSVG();\n s.setAttribute('transform', 'translate(' + this._x + ',' + this._y + ')');\n return s;\n}\n\nfunction PointGlyph(x, y, height, fill) {\n this._x = x;\n this._y = y;\n this._height = height;\n this._fill = fill;\n}\n\nPointGlyph.prototype.min = function() {\n return this._x - 2;\n}\n\nPointGlyph.prototype.max = function() {\n return this._x + 2;\n}\n\nPointGlyph.prototype.height = function() {\n return this._height;\n}\n\nPointGlyph.prototype.draw = function(g) {\n g.save();\n g.globalAlpha = 0.3;\n g.fillStyle = this._fill;\n g.beginPath();\n g.arc(this._x, this._y, 1.5, 0, 6.29);\n g.fill();\n g.restore();\n}\n\nPointGlyph.prototype.toSVG = function() {\n return makeElementNS(\n NS_SVG, 'circle',\n null,\n {cx: this._x, cy: this._y, r: 2,\n fill: this._fill,\n stroke: 'none'});\n}\n\n\nfunction GridGlyph(height, yOffset, spacing) {\n this._height = height || 50;\n this.yOffset = yOffset || 0;\n this.spacing = spacing || 10;\n}\n\nGridGlyph.prototype.notSelectable = true;\n\nGridGlyph.prototype.min = function() {\n return -100000;\n};\n\nGridGlyph.prototype.max = function() {\n return 100000;\n};\n\nGridGlyph.prototype.height = function() {\n return this._height;\n}\n\nGridGlyph.prototype.draw = function(g) {\n g.save();\n g.strokeStyle = 'black'\n g.lineWidth = 0.1;\n\n g.beginPath();\n for (var y = this.yOffset; y <= this._height+this.yOffset; y += this.spacing) {\n // for (var y = 0; y <= this._height; y += 10) {\n g.moveTo(-5000, y);\n g.lineTo(5000, y);\n }\n g.stroke();\n g.restore();\n}\n\nGridGlyph.prototype.toSVG = function() {\n var p = new SVGPath();\n for (var y = 0; y <= this._height; y += 10) {\n p.moveTo(-5000, y);\n p.lineTo(5000, y);\n }\n \n return makeElementNS(\n NS_SVG, 'path',\n null,\n {d: p.toPathData(),\n fill: 'none',\n stroke: 'black',\n strokeWidth: '0.1px'});\n}\n\nfunction StarGlyph(x, r, points, fill, stroke) {\n PathGlyphBase.call(this, stroke, fill);\n this._x = x;\n this._r = r;\n this._points = points;\n}\n\nStarGlyph.prototype = Object.create(PathGlyphBase.prototype);\n\nStarGlyph.prototype.min = function() {\n return this._x - this._r;\n}\n\nStarGlyph.prototype.max = function() {\n return this._x + this._r;\n}\n\nStarGlyph.prototype.height = function() {\n return 2 * this._r;\n}\n\nStarGlyph.prototype.drawPath = function(g) {\n var midX = this._x, midY = this._r, r = this._r;\n for (var p = 0; p < this._points; ++p) {\n var theta = (p * 6.28) / this._points;\n var px = midX + r*Math.sin(theta);\n var py = midY - r*Math.cos(theta);\n if (p == 0) {\n g.moveTo(px, py);\n } else {\n g.lineTo(px, py);\n }\n theta = ((p+0.5) * 6.28) / this._points;\n px = midX + 0.4*r*Math.sin(theta);\n py = midY - 0.4*r*Math.cos(theta);\n g.lineTo(px, py);\n }\n g.closePath();\n}\n\nfunction PlimsollGlyph(x, height, overhang, fill, stroke) {\n this._x = x;\n this._height = height;\n this._overhang = overhang;\n this._fill = fill;\n this._stroke = stroke;\n this._hh = height / 2;\n}\n\nPlimsollGlyph.prototype.draw = function(g) {\n var hh = this._height/2;\n g.fillStyle = this._stroke;\n g.beginPath();\n g.arc(this._x, hh, hh - this._overhang, 0, 6.29);\n g.moveTo(this._x, 0);\n g.lineTo(this._x, this._height);\n\n if (this._fill) {\n g.fillStyle = this._fill;\n g.fill();\n }\n\n if (this._stroke) {\n g.strokeStyle = this._stroke;\n g.stroke();\n }\n}\n\nPlimsollGlyph.prototype.toSVG = function() {\n var hh = this._hh;\n return makeElementNS(NS_SVG, 'g', \n [makeElementNS(NS_SVG, 'circle', null, {cx: this._x, cy: hh, r: hh - this._overhang}),\n makeElementNS(NS_SVG, 'line', null, {x1: this._x, y1: 0, x2: this._x, y2: this._height})],\n {fill: this._fill || 'none',\n stroke: this._stroke || 'none',\n strokeWidth: '1px'});\n}\n\nPlimsollGlyph.prototype.min = function() {\n return this._x - this._hh;\n}\n\nPlimsollGlyph.prototype.max = function() {\n return this._x + this._hh;\n}\n\nPlimsollGlyph.prototype.height = function() {\n return this._height;\n}\n\n\nfunction OverlayLabelCanvas() {\n this.ox = 0;\n this.oy = 0;\n this.glyphs = [];\n}\n\nOverlayLabelCanvas.prototype.translate = function(x, y) {\n this.ox += x;\n this.oy += y;\n}\n\nOverlayLabelCanvas.prototype.registerGlyph = function(g) {\n this.glyphs.push({\n x: this.ox,\n y: this.oy,\n glyph: g\n });\n}\n\n\nOverlayLabelCanvas.prototype.draw = function(g, minVisible, maxVisible) {\n for (var gi = 0; gi < this.glyphs.length; ++gi) {\n var gg = this.glyphs[gi];\n g.save();\n g.translate(gg.x, gg.y);\n gg.glyph.drawOverlay(g, minVisible, maxVisible);\n g.restore();\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n BoxGlyph: BoxGlyph,\n GroupGlyph: GroupGlyph,\n LineGraphGlyph: LineGraphGlyph,\n LabelledGlyph: LabelledGlyph,\n CrossGlyph: CrossGlyph,\n ExGlyph: ExGlyph,\n TriangleGlyph: TriangleGlyph,\n DotGlyph: DotGlyph,\n PaddedGlyph: PaddedGlyph,\n AArrowGlyph: AArrowGlyph,\n SpanGlyph: SpanGlyph,\n LineGlyph: LineGlyph,\n PrimersGlyph: PrimersGlyph,\n ArrowGlyph: ArrowGlyph,\n TooManyGlyph: TooManyGlyph,\n TextGlyph: TextGlyph,\n SequenceGlyph: SequenceGlyph,\n AminoAcidGlyph: AminoAcidGlyph,\n TranslatedGlyph: TranslatedGlyph,\n GridGlyph: GridGlyph,\n StarGlyph: StarGlyph,\n PointGlyph: PointGlyph,\n PlimsollGlyph: PlimsollGlyph,\n\n OverlayLabelCanvas: OverlayLabelCanvas\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// jbjson.js -- query JBrowse-style REST data stores\n//\n\nif (typeof(require) !== 'undefined') {\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n}\n\nfunction JBrowseStore(base, query) {\n this.base = base;\n this.query = query;\n}\n\nfunction jbori(strand) {\n if (strand > 0)\n return '+';\n else if (strand < 0)\n return '-';\n}\n\nJBrowseStore.prototype.features = function(segment, opts, callback) {\n opts = opts || {};\n\n url = this.base + '/features/' + segment.name;\n\n var filters = [];\n if (this.query) {\n\t filters.push(this.query);\n }\n if (segment.isBounded) {\n \tfilters.push('start=' + segment.start);\n \tfilters.push('end=' + segment.end);\n }\n if (filters.length > 0) {\n\t url = url + '?' + filters.join('&');\n }\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n\tif (req.readyState == 4) {\n\t if (req.status >= 300) {\n\t\t callback(null, 'Error code ' + req.status);\n\t } else {\n\t\tvar jf = JSON.parse(req.response)['features'];\n\t\tvar features = [];\n\t\tfor (fi = 0; fi < jf.length; ++fi) {\n\t\t var j = jf[fi];\n\t\t \n\t\t var f = new DASFeature();\n\t\t f.segment = segment.name;\n\t\t f.min = (j['start'] | 0) + 1;\n\t\t f.max = j['end'] | 0;\n\t\t if (j.name) {\n\t\t\tf.label = j.name;\n\t\t }\n if (j.strand)\n f.orientation = jbori(j.strand);\n\t\t f.type = j.type || 'unknown';\n\n if (j.subfeatures && j.subfeatures.length > 0) {\n f.id = j.uniqueID;\n\n var blocks = [];\n var cds = [];\n var all = [];\n\n for (var si = 0; si < j.subfeatures.length; ++si) {\n var sj = j.subfeatures[si];\n var sf = shallowCopy(f);\n sf.min = sj.start + 1;\n sf.max = sj.end;\n sf.groups = [f];\n\n all.push(sf);\n blocks.push(new Range(sf.min, sf.max));\n if (sj.type === 'CDS')\n cds.push(sf);\n }\n \n if (cds.length > 0) {\n spans = union(blocks);\n var txGroup = shallowCopy(f);\n txGroup.type = 'transcript';\n spans.ranges().forEach(function(exon) {\n features.push({\n segment: segment.name,\n min: exon.min(),\n max: exon.max(),\n orientation: f.orientation,\n groups: [txGroup],\n type: 'transcript'\n });\n });\n\n var tlGroup = shallowCopy(f);\n cds.forEach(function(cdsExon) {\n cdsExon.type = 'translation'\n cdsExon.groups = [tlGroup];\n features.push(cdsExon);\n });\n } else {\n all.forEach(function(f) {\n features.push(f);\n });\n }\n } else {\n\t\t features.push(f);\n }\n\t\t}\n\t\tcallback(features);\n\t }\n\t}\n\t\n };\n \n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n JBrowseStore: JBrowseStore\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n//\n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// kspace.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n var pusho = utils.pusho;\n\n var sa = require('./sourceadapters');\n var MappedFeatureSource = sa.MappedFeatureSource;\n var CachingFeatureSource = sa.CachingFeatureSource;\n var BWGFeatureSource = sa.BWGFeatureSource;\n var RemoteBWGFeatureSource = sa.RemoteBWGFeatureSource;\n var BAMFeatureSource = sa.BAMFeatureSource;\n var RemoteBAMFeatureSource = sa.RemoteBAMFeatureSource;\n var DummySequenceSource = sa.DummySequenceSource;\n var DummyFeatureSource = sa.DummyFeatureSource;\n\n var OverlayFeatureSource = require('./overlay').OverlayFeatureSource;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var sample = require('./sample');\n var downsample = sample.downsample;\n var getBaseCoverage = sample.getBaseCoverage;\n\n var das = require('./das');\n var DASSequence = das.DASSequence;\n\n var Promise = require('es6-promise').Promise;\n}\n\nfunction FetchPool() {\n var self = this;\n this.reqs = [];\n this.awaitedFeatures = {};\n this.requestsIssued = new Promise(function(resolve, reject) {\n self.notifyRequestsIssued = resolve;\n });\n}\n\nFetchPool.prototype.addRequest = function(xhr) {\n this.reqs.push(xhr);\n}\n\nFetchPool.prototype.abortAll = function() {\n for (var i = 0; i < this.reqs.length; ++i) {\n this.reqs[i].abort();\n }\n}\n\nfunction KSCacheBaton(chr, min, max, scale, features, status, coverage) {\n this.chr = chr;\n this.min = min;\n this.max = max;\n this.coverage = coverage;\n this.scale = scale;\n this.features = features || [];\n this.status = status;\n}\n\nKSCacheBaton.prototype.toString = function() {\n return this.chr + \":\" + this.min + \"..\" + this.max + \";scale=\" + this.scale;\n}\n\nfunction KnownSpace(tierMap, chr, min, max, scale, seqSource) {\n this.tierMap = tierMap;\n this.chr = chr;\n this.min = min;\n this.max = max;\n this.scale = scale;\n this.seqSource = seqSource || new DummySequenceSource();\n this.viewCount = 0;\n\n this.featureCache = {};\n this.latestViews = {};\n}\n\nKnownSpace.prototype.cancel = function() {\n this.cancelled = true;\n}\n\nKnownSpace.prototype.bestCacheOverlapping = function(chr, min, max) {\n var baton = this.featureCache[this.tierMap[0]];\n if (baton) {\n return baton;\n } else {\n return null;\n }\n}\n\nKnownSpace.prototype.retrieveFeatures = function(tiers, chr, min, max, scale) {\n if (scale != scale) {\n throw \"retrieveFeatures called with silly scale\";\n }\n\n if (chr != this.chr) {\n throw \"Can't extend Known Space to a new chromosome\";\n }\n if (min < 1) {\n min = 1;\n }\n\n this.min = min;\n this.max = max;\n this.scale = scale;\n\n if (this.pool) {\n this.pool.abortAll();\n }\n this.pool = new FetchPool();\n this.awaitedSeq = new Awaited();\n this.seqWasFetched = false;\n this.viewCount++;\n\n this.startFetchesForTiers(tiers);\n this.pool.notifyRequestsIssued();\n}\n\nfunction filterFeatures(features, min, max) {\n var ff = [];\n var featuresByGroup = {};\n\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (!f.min || !f.max) {\n ff.push(f);\n } else if (f.groups && f.groups.length > 0) {\n pusho(featuresByGroup, f.groups[0].id, f);\n } else if (f.min <= max && f.max >= min) {\n ff.push(f);\n }\n }\n\n for (var gid in featuresByGroup) {\n var gf = featuresByGroup[gid];\n var gmin = 100000000000, gmax = -100000000000;\n for (var fi = 0; fi < gf.length; ++fi) {\n var f = gf[fi];\n gmin = Math.min(gmin, f.min);\n gmax = Math.max(gmax, f.max);\n }\n if (gmin <= max || gmax >= min) {\n for (var fi = 0; fi < gf.length; ++fi) {\n ff.push(gf[fi]);\n }\n }\n }\n\n return ff;\n}\n\nKnownSpace.prototype.invalidate = function(tier) {\n if (!this.pool) {\n return;\n }\n\n this.featureCache[tier] = null;\n this.startFetchesForTiers([tier]);\n}\n\nKnownSpace.prototype.startFetchesForTiers = function(tiers) {\n var thisB = this;\n\n var awaitedSeq = this.awaitedSeq;\n var needSeq = false;\n\n var gex;\n\n for (var t = 0; t < tiers.length; ++t) {\n var tierRenderer = tiers[t].browser.getTierRenderer(tiers[t]);\n try {\n if (this.startFetchesFor(tiers[t], awaitedSeq)) {\n needSeq = true;\n }\n } catch (ex) {\n var tier = tiers[t];\n\n tier.currentFeatures = [];\n tier.currentSequence = null;\n console.log('Error fetching tier source');\n console.log(ex);\n gex = ex;\n console.log(ex.stack);\n tierRenderer.renderTier(ex, tier);\n tier.wasRendered();\n }\n }\n\n if (needSeq && !this.seqWasFetched) {\n this.seqWasFetched = true;\n var smin = this.min, smax = this.max;\n\n if (this.cs) {\n if (this.cs.start <= smin && this.cs.end >= smax) {\n var cachedSeq;\n if (this.cs.start == smin && this.cs.end == smax) {\n cachedSeq = this.cs;\n } else {\n cachedSeq = new DASSequence(this.cs.name, smin, smax, this.cs.alphabet,\n this.cs.seq.substring(smin - this.cs.start, smax + 1 - this.cs.start));\n }\n return awaitedSeq.provide(cachedSeq);\n }\n }\n\n this.seqSource.fetch(this.chr, smin, smax, this.pool, function(err, seq) {\n if (seq) {\n if (!thisB.cs || (smin <= thisB.cs.start && smax >= thisB.cs.end) ||\n (smin >= thisB.cs.end) || (smax <= thisB.cs.start) ||\n ((smax - smin) > (thisB.cs.end - thisB.cs.start)))\n {\n thisB.cs = seq;\n }\n awaitedSeq.provide(seq);\n } else {\n console.log('Sequence loading failed', err);\n awaitedSeq.provide(null);\n }\n });\n }\n\n if (gex)\n throw gex;\n}\n\nKnownSpace.prototype.startFetchesFor = function(tier, awaitedSeq) {\n var thisB = this;\n\n var viewID = this.viewCount;\n var source = tier.getSource() || new DummyFeatureSource();\n var needsSeq = tier.needsSequence(this.scale);\n var baton = thisB.featureCache[tier];\n var styleFilters = tier.getActiveStyleFilters(this.scale);\n var wantedTypes;\n if (styleFilters)\n wantedTypes = styleFilters.typeList();\n var chr = this.chr, min = this.min, max = this.max;\n\n\n if (wantedTypes === undefined) {\n return false;\n }\n if (baton && baton.chr === this.chr && baton.min <= min && baton.max >= max) {\n var cachedFeatures = baton.features;\n if (baton.min < min || baton.max > max) {\n cachedFeatures = filterFeatures(cachedFeatures, min, max);\n }\n\n thisB.provision(tier, baton.chr,\n intersection(baton.coverage, new Range(min, max)),\n baton.scale, wantedTypes,\n cachedFeatures, baton.status,\n needsSeq ? awaitedSeq : null);\n\n var availableScales = source.getScales();\n\n if (baton.scale <= this.scale || !availableScales) {\n return needsSeq;\n }\n }\n\n if (source.instrument)\n console.log('Starting fetch ' + viewID + ' (' + min + ', ' + max + ')');\n\n\n source.fetch(chr, min, max, this.scale, wantedTypes, this.pool, function(status, features, scale, coverage) {\n if (source.instrument)\n console.log('Finishing fetch ' + viewID);\n\n var latestViewID = thisB.latestViews[tier] || -1;\n if (thisB.cancelled || latestViewID > viewID) {\n return;\n }\n\n if (!coverage) {\n coverage = new Range(min, max);\n }\n\n if (!baton || (min < baton.min) || (max > baton.max)) { // FIXME should be merging in some cases?\n thisB.featureCache[tier] = new KSCacheBaton(chr, min, max, scale, features, status, coverage);\n }\n\n thisB.latestViews[tier] = viewID;\n thisB.provision(tier, chr, coverage, scale, wantedTypes, features, status, needsSeq ? awaitedSeq : null);\n }, styleFilters);\n return needsSeq;\n}\n\nKnownSpace.prototype.provision = function(tier, chr, coverage, actualScale, wantedTypes, features, status, awaitedSeq) {\n var tierRenderer = tier.browser.getTierRenderer(tier);\n if (status) {\n tier.setFeatures(chr, coverage, actualScale, [], null);\n if (!features) {\n var e = new Error(status);\n status = \"Error fetching data: \" + status + \"; see browser console\";\n console.log(\"Error fetching data for tier \" + tier.dasSource.name + \":\");\n console.log(tier.dasSource);\n console.log(\"Stack trace:\");\n console.log(e.stack)\n }\n tierRenderer.renderTier(status, tier);\n tier.wasRendered();\n } else {\n var mayDownsample = false;\n var needBaseComposition = false;\n var src = tier.getSource();\n while (MappedFeatureSource.prototype.isPrototypeOf(src) ||\n CachingFeatureSource.prototype.isPrototypeOf(src) ||\n OverlayFeatureSource.prototype.isPrototypeOf(src)) {\n\n if (OverlayFeatureSource.prototype.isPrototypeOf(src)) {\n src = src.sources[0];\n } else {\n src = src.source;\n }\n }\n if (BWGFeatureSource.prototype.isPrototypeOf(src) ||\n RemoteBWGFeatureSource.prototype.isPrototypeOf(src) ||\n BAMFeatureSource.prototype.isPrototypeOf(src) ||\n RemoteBAMFeatureSource.prototype.isPrototypeOf(src)) {\n\n mayDownsample = true;\n }\n\n if (!src.opts || (!src.opts.forceReduction && !src.opts.noDownsample)) {\n if (/* (actualScale < (this.scale/2) && features.length > 200) || */\n (mayDownsample && wantedTypes && wantedTypes.length == 1 && wantedTypes.indexOf('density') >= 0))\n {\n features = downsample(features, this.scale);\n }\n }\n\n if (wantedTypes && wantedTypes.length == 1 && wantedTypes.indexOf('base-coverage') >= 0)\n {\n // Base-composition coverage track\n needBaseComposition = true;\n }\n\n\n if (awaitedSeq) {\n awaitedSeq.await(function(seq) {\n if (needBaseComposition) {\n features = getBaseCoverage(features, seq, tier.browser.baseColors);\n }\n tier.setFeatures(chr, coverage, actualScale, features, seq);\n tierRenderer.renderTier(status, tier);\n tier.wasRendered()\n });\n } else {\n tier.setFeatures(chr, coverage, actualScale, features);\n tierRenderer.renderTier(status, tier);\n tier.wasRendered();\n }\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n KnownSpace: KnownSpace\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// lh3utils.js: common support for lh3's file formats\n//\n\nif (typeof(require) !== 'undefined') {\n var jszlib = require('jszlib');\n var jszlib_inflate_buffer = jszlib.inflateBuffer;\n var arrayCopy = jszlib.arrayCopy;\n}\n\nfunction Vob(b, o) {\n this.block = b;\n this.offset = o;\n}\n\nVob.prototype.toString = function() {\n return '' + this.block + ':' + this.offset;\n}\n\nfunction readVob(ba, offset, allowZero) {\n var block = ((ba[offset+6] & 0xff) * 0x100000000) + ((ba[offset+5] & 0xff) * 0x1000000) + ((ba[offset+4] & 0xff) * 0x10000) + ((ba[offset+3] & 0xff) * 0x100) + ((ba[offset+2] & 0xff));\n var bint = (ba[offset+1] << 8) | (ba[offset]);\n if (block == 0 && bint == 0 && !allowZero) {\n return null; // Should only happen in the linear index?\n } else {\n return new Vob(block, bint);\n }\n}\n\nfunction unbgzf(data, lim) {\n lim = Math.min(lim || 1, data.byteLength - 50);\n var oBlockList = [];\n var ptr = [0];\n var totalSize = 0;\n\n while (ptr[0] < lim) {\n var ba = new Uint8Array(data, ptr[0], 12); // FIXME is this enough for all credible BGZF block headers?\n var xlen = (ba[11] << 8) | (ba[10]);\n // dlog('xlen[' + (ptr[0]) +']=' + xlen);\n var unc = jszlib_inflate_buffer(data, 12 + xlen + ptr[0], Math.min(65536, data.byteLength - 12 - xlen - ptr[0]), ptr);\n ptr[0] += 8;\n totalSize += unc.byteLength;\n oBlockList.push(unc);\n }\n\n if (oBlockList.length == 1) {\n return oBlockList[0];\n } else {\n var out = new Uint8Array(totalSize);\n var cursor = 0;\n for (var i = 0; i < oBlockList.length; ++i) {\n var b = new Uint8Array(oBlockList[i]);\n arrayCopy(b, 0, out, cursor, b.length);\n cursor += b.length;\n }\n return out.buffer;\n }\n}\n\nfunction Chunk(minv, maxv) {\n this.minv = minv; this.maxv = maxv;\n}\n\n\n//\n// Binning (transliterated from SAM1.3 spec)\n//\n\n/* calculate bin given an alignment covering [beg,end) (zero-based, half-close-half-open) */\nfunction reg2bin(beg, end)\n{\n --end;\n if (beg>>14 == end>>14) return ((1<<15)-1)/7 + (beg>>14);\n if (beg>>17 == end>>17) return ((1<<12)-1)/7 + (beg>>17);\n if (beg>>20 == end>>20) return ((1<<9)-1)/7 + (beg>>20);\n if (beg>>23 == end>>23) return ((1<<6)-1)/7 + (beg>>23);\n if (beg>>26 == end>>26) return ((1<<3)-1)/7 + (beg>>26);\n return 0;\n}\n\n/* calculate the list of bins that may overlap with region [beg,end) (zero-based) */\nvar MAX_BIN = (((1<<18)-1)/7);\nfunction reg2bins(beg, end) \n{\n var i = 0, k, list = [];\n --end;\n list.push(0);\n for (k = 1 + (beg>>26); k <= 1 + (end>>26); ++k) list.push(k);\n for (k = 9 + (beg>>23); k <= 9 + (end>>23); ++k) list.push(k);\n for (k = 73 + (beg>>20); k <= 73 + (end>>20); ++k) list.push(k);\n for (k = 585 + (beg>>17); k <= 585 + (end>>17); ++k) list.push(k);\n for (k = 4681 + (beg>>14); k <= 4681 + (end>>14); ++k) list.push(k);\n return list;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n unbgzf: unbgzf,\n readVob: readVob,\n reg2bin: reg2bin,\n reg2bins: reg2bins,\n Chunk: Chunk\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// memstore.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var dalliance_makeParser = sa.makeParser;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n var textXHR = utils.textXHR;\n}\n\nfunction MemStore() {\n this.featuresByChr = {};\n this.maxLength = 1;\n this.chrRing = null;\n}\n\nMemStore.prototype.addFeatures = function(features) {\n var dirty = {};\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n var chr = f.segment || f.chr;\n var fa = this.featuresByChr[chr];\n if (!fa) {\n fa = [];\n this.featuresByChr[chr] = fa;\n }\n fa.push(f);\n dirty[chr] = true;\n\n var len = f.max - f.min + 1;\n if (len > this.maxLength)\n this.maxLength = len;\n }\n\n for (chr in dirty) {\n var fa = this.featuresByChr[chr];\n fa.sort(function(f1, f2) {\n var d = f1.min - f2.min;\n if (d != 0)\n return d;\n return f1.max - f2.max;\n });\n }\n this.chrRing = null;\n}\n\nMemStore.prototype._indexFor = function(fa, p) {\n var lb = 0, ub = fa.length;\n while (ub > lb) {\n var mid = ((lb + ub)/2)|0;\n if (mid >= fa.length)\n return fa.length;\n var mg = fa[mid];\n if (p < mg.min) {\n ub = mid;\n } else {\n lb = mid + 1;\n }\n }\n return ub;\n}\n\nMemStore.prototype.fetch = function(chr, min, max) {\n var fa = this.featuresByChr[chr];\n if (!fa) {\n if (chr.indexOf('chr') == 0)\n fa = this.featuresByChr[chr.substring(3)];\n else\n fa = this.featuresByChr['chr' + chr];\n }\n if (!fa)\n return [];\n\n var mini = Math.max(0, this._indexFor(fa, min - this.maxLength - 1));\n var maxi = Math.min(fa.length - 1, this._indexFor(fa, max));\n\n var res = [];\n for (var fi = mini; fi <= maxi; ++fi) {\n var f = fa[fi];\n if (f.min <= max && f.max >= min)\n res.push(f);\n }\n return res;\n}\n\nMemStore.prototype.findNextFeature = function(chr, pos, dir) {\n if (this.chrRing == null) {\n this.chrRing = [];\n for (var chr in this.featuresByChr) {\n this.chrRing.push(chr);\n }\n this.chrRing.sort();\n }\n\n var fa = this.featuresByChr[chr];\n if (!fa) {\n if (chr.indexOf('chr') == 0) {\n chr = chr.substring(3);\n fa = this.featuresByChr[chr];\n } else {\n chr = 'chr' + chr;\n fa = this.featuresByChr[chr];\n }\n }\n if (!fa)\n return null;\n\n var i = Math.max(0, Math.min(this._indexFor(fa, pos), fa.length - 1));\n if (dir > 0) {\n while (i < fa.length) {\n var f = fa[i++];\n if (f.min > pos)\n return f;\n }\n var chrInd = this.chrRing.indexOf(chr) + 1;\n if (chrInd >= this.chrRing.length)\n chrInd = 0;\n return this.findNextFeature(this.chrRing[chrInd], 0, dir);\n } else {\n while (i >= 0) {\n var f = fa[i--];\n if (f.max < pos)\n return f;\n }\n var chrInd = this.chrRing.indexOf(chr) - 1;\n if (chrInd < 0)\n chrInd = this.chrRing.length - 1;\n return this.findNextFeature(this.chrRing[chrInd], 10000000000, dir);\n }\n}\n\nfunction MemStoreFeatureSource(source) {\n this.source = source;\n FeatureSourceBase.call(this);\n this.storeHolder = new Awaited();\n this.parser = dalliance_makeParser(source.payload);\n if (!this.parser) {\n throw \"Unsupported memstore payload: \" + source.payload;\n }\n\n var thisB = this;\n this._load(function(resp, err) {\n if (err) {\n thisB.error = err;\n thisB.storeHolder.provide(null);\n } else {\n var store = new MemStore();\n var features = [];\n var lines = resp.split('\\n');\n\n var session = thisB.parser.createSession(function(f) {features.push(f)});\n for (var li = 0; li < lines.length; ++li) {\n var line = lines[li];\n if (line.length > 0) {\n session.parse(line);\n }\n }\n session.flush();\n\n store.addFeatures(features);\n\n thisB.storeHolder.provide(store);\n }\n });\n}\n\nMemStoreFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nMemStoreFeatureSource.prototype._load = function(callback) {\n if (this.source.blob) {\n var r = new FileReader();\n r.onloadend = function() {\n return callback(r.result, r.error);\n }\n r.readAsText(this.source.blob);\n } else {\n if (this.source.credentials)\n var opts = {credentials : this.source.credentials};\n textXHR(this.source.uri, callback, opts);\n }\n}\n\nMemStoreFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, cnt) {\n var thisB = this;\n this.storeHolder.await(function(store) {\n if (store) {\n var f = store.fetch(chr, min, max);\n return cnt(null, f, 100000000);\n } else {\n return cnt(thisB.error)\n }\n });\n}\n\nMemStoreFeatureSource.prototype.getStyleSheet = function(callback) {\n if (this.parser && this.parser.getStyleSheet)\n this.parser.getStyleSheet(callback)\n}\n\nMemStoreFeatureSource.prototype.getDefaultFIPs = function(callback) {\n if (this.parser && this.parser.getDefaultFIPs)\n this.parser.getDefaultFIPs(callback);\n}\n\nMemStoreFeatureSource.prototype.getScales = function() {\n return 100000000;\n}\n\nMemStoreFeatureSource.prototype.findNextFeature = function(chr, pos, dir, callback) {\n var thisB = this;\n this.storeHolder.await(function(store) {\n if (store) {\n return callback(store.findNextFeature(chr, pos, dir));\n } else {\n return callback(null, thisB.error);\n }\n });\n}\n\n\nMemStoreFeatureSource.prototype.capabilities = function() {\n var caps = {leap: true};\n return caps;\n}\n\ndalliance_registerSourceAdapterFactory('memstore', function(source) {\n return {features: new MemStoreFeatureSource(source)};\n});\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// Molgenisjson.js -- query the Molgenis REST API.\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n}\n\nfunction MolgenisFeatureSource(source) {\n FeatureSourceBase.call(this);\n this.source = source;\n if (source.uri) {\n this.base = source.uri;\n } else if (source.entity) {\n this.base = window.location.origin + '/api/v2/' + source.entity + '?' + Math.random();\n }else{\n throw new Error(\"Bad molgenis track configuration: please specify 'genome_attrs.chr' and 'genome_attrs.pos'\");\n }\n\n this.species = source.species || 'human';\n\n if (typeof source.type === 'string') {\n this.type = [source.type];\n } else {\n this.type = source.type || ['regulatory'];\n }\n}\n\nMolgenisFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\nMolgenisFeatureSource.prototype.constructor = MolgenisFeatureSource;\n\nMolgenisFeatureSource.prototype.getStyleSheet = function(callback) {\n var stylesheet = new DASStylesheet();\n\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'A';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'green';\n stylesheet.pushStyle({type: 'variant', method: 'A'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'C';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'blue';\n stylesheet.pushStyle({type: 'variant', method: 'C'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'G';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'orange';\n stylesheet.pushStyle({type: 'variant', method: 'G'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = 'T';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'red';\n stylesheet.pushStyle({type: 'variant', method: 'T'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'TEXT';\n varStyle.STRING = '?';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'darkgrey';\n stylesheet.pushStyle({type: 'variant', method: 'unknown'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'DOT';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'purple';\n stylesheet.pushStyle({type: 'indel'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'STAR';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'black';\n stylesheet.pushStyle({type: 'variant', method: 'multiple'}, null, varStyle);\n }\n {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'blue';\n wigStyle.BGCOLOR = 'blue'\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = false;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n }\n {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'red';\n wigStyle.BGCOLOR = 'red'\n wigStyle.HEIGHT = 8;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'exon', method: 'exon'}, null, wigStyle);\n }\n {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'white';\n wigStyle.BGCOLOR = 'white'\n wigStyle.HEIGHT = 8;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'exon', method: 'intron'}, null, wigStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'HISTOGRAM';\n varStyle.BGCOLOR = 'blue';\n varStyle.HEIGHT = 50;\n stylesheet.pushStyle({type: 'numeric'}, null, varStyle);\n }\n\n return callback(stylesheet);\n}\n\n\nMolgenisFeatureSource.prototype.getScales = function() {\n return [];\n}\n\nMolgenisFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n var source = this.source;\n\n if (!source.genome_attrs.chr || !source.genome_attrs.pos) {\n throw new Error(\"Bad molgenis track configuration: please specify 'genome_attrs.chr' and 'genome_attrs.pos'\");\n }\n\n var url = this.base;\n\n\n if (source.attrs) {\n var attributes = [];\n for (var index = 0; index < source.attrs.length; ++index) {\n var attr = source.attrs[index];\n var attrArray = attr.split(\":\");\n attributes.push(attrArray[0]);\n }\n if(attributes[source.genome_attrs.chr] === undefined) {\n attributes.push(source.genome_attrs.chr);\n }\n if(attributes[source.genome_attrs.pos] === undefined) {\n attributes.push(source.genome_attrs.pos);\n }\n if(attributes[source.genome_attrs.alt] === undefined) {\n if(source.genome_attrs.alt) {\n attributes.push(source.genome_attrs.alt);\n }\n }\n if(attributes[source.genome_attrs.ref] === undefined) {\n if(source.genome_attrs.ref) {\n attributes.push(source.genome_attrs.ref);\n }\n }\n if(attributes[source.genome_attrs.stop] === undefined) {\n if(source.genome_attrs.stop) {\n attributes.push(source.genome_attrs.stop);\n }\n }\n url += '&attrs=' + encodeURIComponent(attributes);\n }\n\n if (source.genome_attrs.stop) {\n url += '&q=' + encodeURIComponent(source.genome_attrs.chr) + '==' + chr + ';(' + source.genome_attrs.pos + '=ge=' + min + ';' + source.genome_attrs.pos + '=le=' + max + ',' + source.genome_attrs.stop + '=ge=' + min + ';' + source.genome_attrs.stop + '=le=' + max + ')';\n } else {\n url += '&q=' + encodeURIComponent(source.genome_attrs.chr) + '==' + chr + ';' + source.genome_attrs.pos + '=ge=' + min + ';' + source.genome_attrs.pos + '=le=' + max;\n }\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n \tif (req.readyState == 4) {\n thisB.busy--;\n thisB.notifyActivity();\n\n \t if (req.status >= 300) {\n var err = 'Error code ' + req.status;\n try {\n var jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } catch (ex) {};\n\n \t\t callback(err, null);\n \t } else {\n \t\tvar jf = JSON.parse(req.response);\n \t\tvar items = jf.items;\n \t\tvar features = [];\n \t\tfor (var fi = 0; fi < items.length; ++fi) {\n var entity = items[fi];\n var notes = [];\n var feature = new DASFeature();\n feature.segment = chr;\n feature.min = entity[source.genome_attrs.pos] | 0;\n if(source.genome_attrs.stop)\n {\n feature.max = entity[source.genome_attrs.stop] | 0;\n }\n else{\n feature.max = entity[source.genome_attrs.pos] | 0;\n }\n\n feature.type = entity.feature_type || 'unknown';\n var identifier;\n if (source.label_attr) {\n identifier = source.label_attr;\n } else {\n identifier = \"ID\";\n }\n feature.id = entity[identifier];\n\n //add attrs to notes for use in popup\n if (source.attrs) {\n for (var index = 0; index < source.attrs.length; ++index) {\n var attr = source.attrs[index];\n var attrArray = attr.split(\":\");\n\n var label = attrArray[1];\n var value = entity[attrArray[0]];\n\n notes.push(label + '=' + value);\n }\n }\n if (source.actions) {\n feature.actions = eval(source.actions);\n feature.entity = entity;\n }\n\n if (notes.length > 0) {\n feature.notes = notes;\n }\n\n if(source.track_type === \"NUMERIC\") {\n feature.score = entity[source.score_attr];\n }\n\n setStyleProperties(entity, feature, source);\n feature.molgenis = true;\n \t\t features.push(feature);\n \t\t}\n \t\tcallback(null, features);\n \t }\n \t}\n\t\n };\n \n thisB.busy++;\n thisB.notifyActivity();\n\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send('');\n}\n\nfunction setStyleProperties(entity, feature, source) {\n\n var type = source.track_type;\n var altAttr = source.genome_attrs.alt;\n var refAttr = source.genome_attrs.ref;\n if(type === \"NUMERIC\"){\n feature.type = \"numeric\";\n return;\n }\n if(type === \"EXON\") {\n var labelAttr = source.label_attr;\n if (entity[labelAttr].search(source.exon_key) != -1) {\n feature.type = \"exon\";\n feature.method = \"exon\";\n return;\n }\n else{\n feature.type = \"exon\";\n feature.method = \"intron\";\n return;\n }\n }\n else if(altAttr && entity[altAttr] && refAttr && entity[refAttr]) {\n if (entity[altAttr].length > 1 || entity[refAttr].length > 1) {\n feature.type = \"indel\";\n return;\n }\n else if (entity[altAttr] === 'A') {\n feature.type = \"variant\";\n feature.method = \"A\";\n return;\n }\n else if (entity[altAttr] === 'T') {\n feature.type = \"variant\";\n feature.method = \"T\";\n return;\n }\n else if (entity[altAttr] === 'G') {\n feature.type = \"variant\";\n feature.method = \"G\";\n return;\n }\n else if (entity[altAttr] === 'C') {\n feature.type = \"variant\";\n feature.method = \"C\";\n return;\n }\n else if (entity[altAttr].search(',') != -1) {\n feature.type = \"variant\";\n feature.method = \"multiple\";\n return;\n }\n else {\n feature.type = \"variant\";\n feature.method = \"unknown\";\n return;\n }\n }else{\n feature.type = \"default\";\n return;\n }\n}\n\ndalliance_registerSourceAdapterFactory('molgenis', function(source) {\n return {features: new MolgenisFeatureSource(source)};\n});\n","/* jshint esversion: 6 */\n\"use strict\";\n\nimport { drawSeqTier } from \"./sequence-draw.js\";\n\nimport { GridGlyph } from \"./glyphs.js\";\n\nimport * as DefaultRenderer from \"./default-renderer\";\n\nimport * as R from \"ramda\";\n\nexport { renderTier, drawTier };\n\n\n/* Renders multiple tiers in a single track.\n Works by simply drawing several tiers to a single canvas.\n Actual rendering is done using default-renderer.es6.\n A multi-tier renderer is configured by adding the following to a tier's\n configuration:\n renderer: 'multi',\n multi: {\n multi_id: \"multi_1\",\n }\n\n All subtiers with the \"multi_1\" multi_id will be drawn to this tier's canvas.\n */\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\nfunction drawTier(multiTier) {\n let multiConfig = multiTier.dasSource.multi;\n let getSubConfig = t => t.dasSource.sub;\n\n // Padding is used for finding the correct canvas size and must be set\n if (!multiTier.padding)\n multiTier.padding = 3;\n\n let canvas = multiTier.viewport.getContext(\"2d\");\n let retina = multiTier.browser.retina && window.devicePixelRatio > 1;\n if (retina) {\n canvas.scale(2, 2);\n }\n\n // Filter out only tiers that are to be drawn in this multitier,\n // and also have fetched data.\n let tiers = multiTier.browser.tiers.\n filter(tier => typeof(getSubConfig(tier)) === \"object\" &&\n getSubConfig(tier).multi_id === multiConfig.multi_id &&\n (tier.currentFeatures || tier.currentSequence));\n\n // The shortest distance from the top of the canvas to a subtier\n let minOffset = R.pipe(\n R.map(tier => tier.dasSource.sub.offset),\n R.reduce((acc, offset) => offset < acc ? offset : acc, 0)\n )(tiers);\n\n tiers.forEach(tier => {\n if (tier.sequenceSource) {\n drawSeqTier(tier, tier.currentSequence);\n } else {\n // Shift subtiers up by the minimum offset,\n // so that there's no empty space at the top\n DefaultRenderer.prepareSubtiers(tier, canvas,\n getSubConfig(tier).offset - minOffset,\n false);\n }\n\n // Must be set for painting to work\n if (!multiTier.glyphCacheOrigin)\n multiTier.glyphCacheOrigin = tier.glyphCacheOrigin;\n });\n\n // The canvas should fit all subtiers, including offsets, but no more\n let canvasHeight = R.pipe(\n R.map(tier =>\n R.map(subtier => subtier.height + getSubConfig(tier).offset,\n tier.subtiers)),\n R.flatten,\n R.reduce((acc, h) => h > acc ? h : acc, -Infinity),\n R.add(-minOffset)\n )(tiers);\n\n prepareViewport(multiTier, canvas, retina, canvasHeight, true);\n\n tiers.sort((t1, t2) => getSubConfig(t1).z > getSubConfig(t2).z);\n\n // TODO: make it add the glyph on to the first available tier;\n // crashes if last tier is empty...\n if (multiConfig.grid && tiers && tiers[tiers.length-1] && tiers[tiers.length-1].subtiers[0]) {\n let grid = new GridGlyph(canvasHeight,\n multiConfig.grid_offset,\n multiConfig.grid_spacing);\n // pretty hacky way of adding the grid, but it works (mostly)\n tiers[tiers.length-1].subtiers[0].glyphs.unshift(grid);\n }\n\n tiers.forEach(tier => {\n // Need to save and restore canvas to make sure that the subtiers are\n // drawn on top of one another, if not shifted...\n canvas.save();\n DefaultRenderer.paint(tier, canvas, retina, true);\n canvas.restore();\n });\n\n multiTier.drawOverlay();\n\n if (multiConfig.quant) {\n let quantCanvas = DefaultRenderer.createQuantOverlay(multiTier, canvasHeight+multiTier.padding*2, retina);\n DefaultRenderer.paintQuant(quantCanvas, multiTier, multiConfig.quant, 10);\n }\n\n if (typeof(multiTier.dasSource.drawCallback) === \"function\") {\n multiTier.dasSource.drawCallback(canvas, multiTier);\n }\n\n multiTier.originHaxx = 0;\n multiTier.browser.arrangeTiers();\n}\n\nfunction prepareViewport(tier, canvas, retina, canvasHeight, clear=true) {\n let desiredWidth = tier.browser.featurePanelWidth + 2000;\n if (retina) {\n desiredWidth *= 2;\n }\n\n let fpw = tier.viewport.width|0;\n if (fpw < desiredWidth - 50) {\n tier.viewport.width = fpw = desiredWidth;\n }\n\n canvasHeight += 2*tier.padding;\n canvasHeight = Math.max(canvasHeight, tier.browser.minTierHeight);\n\n if (canvasHeight != tier.viewport.height) {\n tier.viewport.height = canvasHeight;\n\n if (retina) {\n tier.viewport.height *= 2;\n }\n }\n\n tier.viewportHolder.style.left = '-1000px';\n tier.viewport.style.width = retina ? ('' + (fpw/2) + 'px') : ('' + fpw + 'px');\n tier.viewport.style.height = '' + canvasHeight + 'px';\n tier.layoutHeight = Math.max(canvasHeight, tier.browser.minTierHeight);\n\n tier.updateHeight();\n tier.norigin = tier.browser.viewStart;\n\n if (clear) {\n DefaultRenderer.clearViewport(canvas, fpw, canvasHeight);\n }\n\n DefaultRenderer.drawUnmapped(tier, canvas, canvasHeight);\n\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// memstore.js\n//\n\nfunction formatLongInt(n) {\n return (n|0).toString().replace(/\\B(?=(\\d{3})+(?!\\d))/g, ',')\n}\n\nfunction formatQuantLabel(v) {\n var t = '' + v;\n var dot = t.indexOf('.');\n if (dot < 0) {\n return t;\n } else {\n var dotThreshold = 2;\n if (t.substring(0, 1) == '-') {\n ++dotThreshold;\n }\n\n if (dot >= dotThreshold) {\n return t.substring(0, dot);\n } else {\n return t.substring(0, dot + 2);\n }\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n formatLongInt: formatLongInt,\n formatQuantLabel: formatQuantLabel\n };\n}","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// overlay.js: featuresources composed from multiple underlying sources\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n var arrayIndexOf = utils.arrayIndexOf;\n}\n\nfunction OverlayFeatureSource(sources, opts) {\n this.sources = sources;\n this.opts = opts || {};\n this.activityListeners = [];\n this.readinessListeners = [];\n this.changeListeners = [];\n this.business = [];\n this.readiness = [];\n\n for (var i = 0; i < this.sources.length; ++i) {\n this.initN(i);\n }\n\n if (typeof(opts.merge) === 'function') {\n this.merge = opts.merge;\n } else if (opts.merge == 'concat') {\n this.merge = OverlayFeatureSource_merge_concat;\n } else if (opts.merge == 'alternates') {\n this.merge = OverlayFeatureSource_merge_concat;\n this.filterDispatchOnMethod = true;\n } else {\n this.merge = OverlayFeatureSource_merge_byKey;\n }\n}\n\nOverlayFeatureSource.prototype.initN = function(n) {\n var s = this.sources[n];\n var thisB = this;\n this.business[n] = 0;\n\n if (s.addActivityListener) {\n s.addActivityListener(function(b) {\n thisB.business[n] = b;\n thisB.notifyActivity();\n });\n }\n if (s.addChangeListener) {\n s.addChangeListener(function() {\n thisB.notifyChange();\n });\n }\n if (s.addReadinessListener) {\n s.addReadinessListener(function(r) {\n thisB.readiness[n] = r;\n thisB.notifyReadiness();\n });\n }\n}\n\nOverlayFeatureSource.prototype.addReadinessListener = function(l) {\n this.readinessListeners.push(l);\n this.notifyReadinessListener(l);\n}\n\nOverlayFeatureSource.prototype.removeReadinessListener = function(l) {\n var idx = arrayIndexOf(this.readinessListeners, l);\n if (idx >= 0) {\n this.readinessListeners.splice(idx, 1);\n }\n}\n\nOverlayFeatureSource.prototype.notifyReadiness = function() {\n for (var i = 0; i < this.readinessListeners.length; ++i) {\n this.notifyReadinessListener(this.readinessListeners[i]);\n }\n}\n\nOverlayFeatureSource.prototype.notifyReadinessListener = function(l) {\n var r = null;\n for (var i = 0; i < this.readiness.length; ++i) {\n if (this.readiness[i] != null) {\n r = this.readiness[i]; break;\n }\n }\n try {\n l(r);\n } catch (e) {\n console.log(e);\n }\n}\n\nOverlayFeatureSource.prototype.addActivityListener = function(l) {\n this.activityListeners.push(l);\n}\n\nOverlayFeatureSource.prototype.removeActivityListener = function(l) {\n var idx = arrayIndexOf(this.activityListeners, l);\n if (idx >= 0) {\n this.activityListeners.splice(idx, 1);\n }\n}\n\nOverlayFeatureSource.prototype.notifyActivity = function() {\n var busy = 0;\n for (var i = 0; i < this.business.length; ++i) {\n busy += this.business[i];\n }\n\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](busy);\n } catch (e) {\n console.log(e);\n }\n }\n}\n\nOverlayFeatureSource.prototype.addChangeListener = function(listener) {\n this.changeListeners.push(listener);\n}\n\nOverlayFeatureSource.prototype.removeChangeListener = function(l) {\n var idx = arrayIndexOf(this.changeListeners, l);\n if (idx >= 0) {\n this.changeListeners.splice(idx, 1);\n }\n}\n\nOverlayFeatureSource.prototype.notifyChange = function() {\n for (var li = 0; li < this.changeListeners.length; ++li) {\n try {\n this.changeListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n}\n\nOverlayFeatureSource.prototype.getScales = function() {\n return this.sources[0].getScales();\n}\n\nOverlayFeatureSource.prototype.getStyleSheet = function(callback) {\n return this.sources[0].getStyleSheet(callback);\n}\n\nOverlayFeatureSource.prototype.capabilities = function() {\n var caps = {};\n var s0 = this.sources[0];\n if (s0.capabilities) \n caps = shallowCopy(s0.capabilities());\n\n for (var i = 1; i < this.sources.length; ++i) {\n var si = this.sources[i];\n if (si.capabilities) {\n var co = si.capabilities();\n if (co.search) {\n caps.search = co.search;\n }\n }\n }\n\n return caps;\n}\n\nOverlayFeatureSource.prototype.search = function(query, callback) {\n for (var i = 0; i < this.sources.length; ++i) {\n if (_sourceAdapterIsCapable(this.sources[i], 'search')) {\n return this.sources[i].search(query, callback);\n }\n }\n}\n\nOverlayFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback, styleFilters) {\n var sources;\n if (this.filterDispatchOnMethod) {\n sources = [];\n var sfl = styleFilters.list();\n for (var si = 0; si < this.sources.length; ++si) {\n var source = this.sources[si];\n for (var fi = 0; fi < sfl.length; ++fi) {\n var filter = sfl[fi];\n if (!filter.method || filter.method == source.name) {\n sources.push(source);\n break;\n }\n }\n }\n } else {\n sources = this.sources;\n }\n\n var baton = new OverlayBaton(this, callback, sources);\n for (var si = 0; si < sources.length; ++si) {\n\t this.fetchN(baton, si, sources[si], chr, min, max, scale, types, pool, styleFilters);\n }\n}\n\nOverlayFeatureSource.prototype.fetchN = function(baton, si, source, chr, min, max, scale, types, pool, styleFilters) {\n // FIXME should we try to prune styleFilters?\n source.fetch(chr, min, max, scale, types, pool, function(status, features, scale) {\n\t return baton.completed(si, status, features, scale);\n }, styleFilters);\n}\n\nOverlayFeatureSource.prototype.quantFindNextFeature = function(chr, pos, dir, threshold, callback) {\n return this.sources[0].quantFindNextFeature(chr, pos, dir, threshold, callback);\n}\n\nOverlayFeatureSource.prototype.findNextFeature = function(chr, pos, dir, callback) {\n return this.sources[0].findNextFeature(chr, pos, dir, callback);\n}\n\nfunction OverlayBaton(source, callback, sources) {\n this.source = source;\n this.callback = callback;\n this.sources = sources;\n this.count = sources.length;\n\n this.returnCount = 0;\n this.statusCount = 0;\n this.returns = [];\n this.features = []\n this.statuses = [];\n this.scale = null;\n}\n\nOverlayBaton.prototype.completed = function(index, status, features, scale) {\n if (this.scale == null || index == 0) \n\t this.scale = scale;\n\n if (this.returns[index])\n\t throw 'Multiple returns for source ' + index;\n\n this.returns[index] = true;\n this.returnCount++;\n\n this.features[index] = features;\n\n if (status) {\n \tthis.statuses[index] = status;\n \tthis.statusCount++;\n }\n\n\n if (this.returnCount == this.count) {\n \tif (this.statusCount > 0) {\n \t var message = '';\n \t for (var si = 0; si < this.count; ++si) {\n \t\tvar s = this.statuses[si];\n \t\tif (s) {\n \t\t if (message.length > 0) \n \t\t\tmessage += ', ';\n \t\t message += s;\n \t\t}\n \t }\n \t return this.callback(message, null, this.scale);\n \t} else {\n \t this.callback(null, this.source.merge(this.features, this.sources), this.scale);\n \t}\n }\n}\n\nOverlayFeatureSource.prototype.getDefaultFIPs = function(callback) {\n for (var si = 0; si < this.sources.length; ++si) {\n var s = this.sources[si];\n if (s.getDefaultFIPs)\n s.getDefaultFIPs(callback);\n }\n}\n\nOverlayFeatureSource.prototype.keyForFeature = function(feature) {\n return '' + feature.min + '..' + feature.max;\n}\n\nfunction OverlayFeatureSource_merge_byKey(featureSets) {\n var omaps = [];\n\n for (var fsi = 1; fsi < featureSets.length; ++fsi) {\n var om = {};\n var of = featureSets[fsi];\n for (var fi = 0; fi < of.length; ++fi) {\n \t om[this.keyForFeature(of[fi])] = of[fi];\n }\n omaps.push(om);\n }\n\n\n var mf = [];\n var fl = featureSets[0];\n for (var fi = 0; fi < fl.length; ++fi) {\n \tvar f = fl[fi];\n\n for (var oi = 0; oi < omaps.length; ++oi) {\n var om = omaps[oi];\n \tof = om[this.keyForFeature(f)]\n \tif (of) {\n for (var k in of) {\n if (k === 'score') {\n f.score2 = of.score;\n } else if (k === 'min' || k === 'max' || k === 'segment' || k === '_cachedStyle') {\n // do nothing\n } else {\n f[k] = of[k];\n }\n }\n \t}\n }\n \tmf.push(f);\n }\n return mf;\n}\n\nfunction OverlayFeatureSource_merge_concat(featureSets, sources) {\n var features = [];\n for (var fsi = 0; fsi < featureSets.length; ++fsi) {\n var fs = featureSets[fsi];\n var name = sources[fsi].name;\n for (var fi = 0; fi < fs.length; ++fi) {\n var f = fs[fi];\n f.method = name;\n features.push(f);\n }\n }\n return features;\n}\n\nfunction _sourceAdapterIsCapable(s, cap) {\n if (!s.capabilities)\n return false;\n else \n return s.capabilities()[cap];\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n OverlayFeatureSource: OverlayFeatureSource\n };\n}\n\n\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// bedwig.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n var readInt = bin.readInt;\n\n var bbi = require('./bigwig');\n var BIG_WIG_MAGIC = bbi.BIG_WIG_MAGIC;\n var BIG_BED_MAGIC = bbi.BIG_BED_MAGIC;\n\n var lh3utils = require('./lh3utils');\n var unbgzf = lh3utils.unbgzf;\n\n var bam = require('./bam');\n var BAM_MAGIC = bam.BAM_MAGIC;\n var BAI_MAGIC = bam.BAI_MAGIC;\n\n var tbi = require('./tabix');\n var TABIX_MAGIC = tbi.TABIX_MAGIC;\n\n var EncodeFetchable = require('./encode').EncodeFetchable;\n}\n\nfunction probeResource(source, listener, retry) {\n var BED_REGEXP = new RegExp('^\\\\w+\\\\s[0-9]+\\\\s[0-9]+.*$');\n var KV_REGEXP=/([^=]+)=\\\"?([^\\\"]+)\\\"?/;\n var VCFHEAD_RE = /^##\\s*fileformat=VCFv4\\..+/;\n\n var fetchable;\n if (source.blob)\n fetchable = new BlobFetchable(source.blob);\n else if (source.transport == 'encode')\n fetchable = new EncodeFetchable(source.uri);\n else\n fetchable = new URLFetchable(source.uri, {credentials: source.credentials});\n\n fetchable.slice(0, 1<<16).salted().fetch(function(result, error) {\n if (!result) {\n if (!retry) {\n source.credentials = true;\n probeResource(source, listener, true)\n }\n\n return listener(source, \"Couldn't fetch data\");\n }\n\n var ba = new Uint8Array(result);\n var la = new Uint32Array(result, 0, 1);\n var magic = la[0];\n if (magic == BIG_WIG_MAGIC || magic == BIG_BED_MAGIC) {\n source.tier_type = 'bwg';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.bw|.bb|.bigWig|.bigBed)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n source.name = match[1];\n }\n\n return listener(source, null);\n } else if (magic == BAI_MAGIC) {\n source.tier_type = 'bai';\n return listener(source, null);\n } else if (ba[0] == 31 || ba[1] == 139) {\n var unc = unbgzf(result);\n var uncba = new Uint8Array(unc);\n magic = readInt(uncba, 0);\n if (magic == BAM_MAGIC) {\n source.tier_type = 'bam';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.bam)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n source.name = match[1];\n }\n\n return listener(source, null);\n } else if (magic == TABIX_MAGIC) {\n source.tier_type = 'tabix-index';\n return listener(source, null);\n } else if (magic == 0x69662323) {\n source.tier_type = 'tabix';\n source.payload = 'vcf';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.vcf)?(.gz)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n source.name = match[1];\n }\n\n return listener(source, null);\n } else {\n console.log('magic = ' + magic.toString(16));\n return listener(source, \"Unsupported format\");\n }\n } else {\n var text = String.fromCharCode.apply(null, ba);\n var lines = text.split(\"\\n\");\n\n if (lines.length > 0 && VCFHEAD_RE.test(lines[0])) {\n source.tier_type = 'memstore';\n source.payload = 'vcf';\n var nameExtractPattern = new RegExp('/?([^/]+?)(\\.vcf)?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match && !source.name) {\n source.name = match[1];\n }\n return listener(source, null);\n }\n\n for (var li = 0; li < lines.length; ++li) {\n var line = lines[li].replace('\\r', '');\n if (line.length == 0) continue;\n\n if (line.indexOf('browser') == 0) continue;\n\n if (line.indexOf('track') == 0) {\n var maybeType = 'bed';\n var toks = line.split(/\\s/);\n for (var ti = 1; ti < toks.length; ++ti) {\n var m = KV_REGEXP.exec(toks[ti]);\n if (m) {\n if (m[1] == 'type' && m[2] == 'wiggle_0') {\n maybeType = 'wig'\n } else if (m[0] == 'name') {\n source.name = m[2];\n }\n }\n }\n\n finishProbeBedWig(source, maybeType);\n return listener(source, null);\n }\n\n if (line.indexOf('fixedStep') == 0) {\n finishProbeBedWig(source, 'wig');\n return listener(source, null);\n }\n\n if (line.indexOf('variableStep') == 0) {\n finishProbeBedWig(source, 'wig');\n return listener(source, null);\n }\n\n if (BED_REGEXP.test(line)) {\n finishProbeBedWig(source, null);\n return listener(source, null);\n }\n\n break;\n }\n\n return listener(source, \"Unsupported format\");\n }\n }, {timeout: 1500}); // Timeout to catch mixed-origin case on Chromium.\n}\n\nfunction finishProbeBedWig(source, maybeType) {\n source.tier_type = 'memstore';\n var nameExtractPattern = new RegExp('/?([^/]+?)(.(bed|wig))?$');\n var match = nameExtractPattern.exec(source.uri || source.blob.name);\n if (match) {\n if (!source.name)\n source.name = match[1];\n if (!maybeType && match[3]) {\n maybeType = match[3];\n }\n }\n source.payload = maybeType || 'bed';\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n probeResource: probeResource\n };\n}\n","/* jshint esversion: 6 */\n\n\"use strict\";\n\nexport { Ruler, rulerDrawCallback };\n\n\nfunction Ruler(options) {\n let self = this;\n\n self.value = options.value;\n self.min = options.min;\n self.max = options.max;\n self.width = options.width;\n self.color = options.color;\n\n Object.keys(self).map(key => {\n if (self[key] === undefined) {\n console.log(\"WARNING: Ruler option \" + key + \" not set\");\n }\n });\n}\n\nRuler.prototype.constructor = Ruler;\n\nfunction rulerDrawCallback(canvas, tier) {\n let rulers = tier.dasSource.rulers;\n\n if (!rulers) {\n console.log(\"Tier uses ruler callback but has no rulers!\");\n } else if (!(rulers instanceof Array)) {\n console.log(\"rulers.js: 'rulers' should be an Array\");\n }\n\n\n rulers.map(r => {\n let rulerY = ((r.max - r.value) * r.height);\n let viewWidth = tier.viewport.width;\n let oldLineWidth = canvas.lineWidth;\n\n canvas.strokeStyle = r.color;\n canvas.beginPath();\n canvas.moveTo(-viewWidth, rulerY + r.offset);\n // Other parts of the code rely on not having changed the lineWidth...\n // So we need to change it back when we're done.\n canvas.lineWidth = r.width;\n canvas.lineTo(2*viewWidth, rulerY + r.offset);\n canvas.stroke();\n canvas.lineWidth = oldLineWidth;\n });\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// sample.js: downsampling of quantitative features\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var das = require('./das');\n var DASFeature = das.DASFeature;\n\n var parseCigar = require('./cigar').parseCigar;\n\n var shallowCopy = require('./utils').shallowCopy;\n}\n\nvar __DS_SCALES = [1, 2, 5];\n\nfunction ds_scale(n) {\n return __DS_SCALES[n % __DS_SCALES.length] * Math.pow(10, (n / __DS_SCALES.length)|0);\n}\n\n\nfunction DSBin(scale, min, max) {\n this.scale = scale;\n this.tot = 0;\n this.cnt = 0;\n this.hasScore = false;\n this.min = min; this.max = max;\n this.features = [];\n}\n\nfunction _featureOrder(a, b) {\n if (a.min < b.min) {\n return -1;\n } else if (a.min > b.min) {\n return 1;\n } else if (a.max < b.max) {\n return -1;\n } else if (b.max > a.max) {\n return 1;\n } else {\n return 0;\n }\n}\n\nDSBin.prototype.score = function() {\n if (this.cnt == 0) {\n return 0;\n } else if (this.hasScore) {\n return this.tot / this.cnt;\n } else {\n var features = this.features;\n features.sort(_featureOrder);\n\n var maxSeen = -10000000000;\n var cov=0, lap=0;\n\n for (var fi = 1; fi < features.length; ++fi) {\n var f = features[fi];\n var lMin = Math.max(f.min, this.min);\n var lMax = Math.min(f.max, this.max);\n lap += (lMax - lMin + 1);\n\n if (lMin > maxSeen) {\n cov += lMax - lMin + 1;\n maxSeen = lMax;\n } else {\n if (lMax > maxSeen) {\n cov += (lMax - maxSeen);\n maxSeen = lMax;\n }\n }\n }\n\n if (cov > 0)\n return (1.0 * lap) / cov;\n else\n return 0;\n }\n}\n\nDSBin.prototype.feature = function(f) {\n if (f.score !== undefined) {\n this.tot += f.score;\n this.hasScore = true\n }\n\n ++this.cnt;\n this.features.push(f);\n}\n\nfunction downsample(features, targetRez) {\n var sn = 0;\n while (ds_scale(sn + 1) < targetRez) {\n ++sn;\n }\n var scale = ds_scale(sn);\n\n var binTots = [];\n var maxBin = -10000000000;\n var minBin = 10000000000;\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.groups && f.groups.length > 0) {\n // Don't downsample complex features (?)\n return features;\n }\n\n var minLap = (f.min / scale)|0;\n var maxLap = (f.max / scale)|0;\n maxBin = Math.max(maxBin, maxLap);\n minBin = Math.min(minBin, minLap);\n for (var b = minLap; b <= maxLap; ++b) {\n var bm = binTots[b];\n if (!bm) {\n bm = new DSBin(scale, b * scale, (b + 1) * scale - 1);\n binTots[b] = bm;\n }\n bm.feature(f);\n }\n }\n\n var sampledFeatures = [];\n for (var b = minBin; b <= maxBin; ++b) {\n var bm = binTots[b];\n if (bm) {\n var f = new DASFeature();\n f.segment = features[0].segment;\n f.min = (b * scale) + 1;\n f.max = (b + 1) * scale;\n f.score = bm.score();\n f.type = 'density';\n sampledFeatures.push(f);\n }\n }\n\n var afterDS = Date.now();\n return sampledFeatures;\n}\n\n/** Data structure to store information for\na base position:\n\npos: position of the base.\n*/\nfunction BaseBin(pos) {\n\n this._pos = pos;\n this._bases = {};\n this._totalCount = 0;\n}\n\n/** Keep record for incidence of a base,\nwith related qual score and strand for a position.\n\nParams\n base: base (e.g A, T, G, C, N) observed at position.\n qual: numeric quality score.\n strand: '+' or '-'.\n*/\nBaseBin.prototype.recordBase = function(base, qual, strand) {\n if (!this._bases[base]) {\n var strandComposition = {'+': 0, '-': 0};\n strandComposition[strand]++;\n this._bases[base] = {\n cnt: 1,\n totalQual: qual,\n strandCnt: strandComposition\n };\n } else {\n var baseComposition = this._bases[base];\n baseComposition.cnt++;\n baseComposition.totalQual += qual;\n baseComposition.strandCnt[strand]++;\n }\n this._totalCount++;\n};\n\n/** Returns count of total number of bases observed at position */\nBaseBin.prototype.totalCount = function() {return this._totalCount;};\n\n/** Returns the base position */\nBaseBin.prototype.pos = function() {return this._pos;};\n\n/** Creates a list of tag, info pairs in the form\n[tag]=[info] for each base, for use in feature-popup */\nBaseBin.prototype.infoList = function() {\n var info = [];\n var totalCount = this._totalCount;\n var totalCountStr = \"Depth=\" + totalCount.toString();\n info.push(totalCountStr);\n for (var base in this._bases) {\n var baseComposition = this._bases[base];\n var baseCnt = baseComposition.cnt;\n var basePercentage = (baseCnt * 100 / totalCount); \n var plusStrandCnt = baseComposition.strandCnt['+'];\n var minusStrandCnt = baseComposition.strandCnt['-'];\n var meanQual = baseComposition.totalQual/baseCnt;\n\n var baseInfoString = [base, '=', baseCnt, ' (', basePercentage.toFixed(0), '%, ',\n plusStrandCnt, ' +, ', minusStrandCnt, ' -, Qual: ', meanQual.toFixed(0), ')'];\n info.push(baseInfoString.join(''));\n }\n return info;\n};\n\n/** Return a list of objects for creating a\nhistogram showing composition of different bases at a\ngiven location.\n\nCurrent implementation is hacky: the logic involves\noverlaying BoxGlyphs on top of each other, thus the score\nis not meaningful, but only used to manipulate height.\n\nParams:\n ref: reference base at position\n threshold: value between 0 and 1 representing min allele frequency\n below which the allele will be ignored in histogram.\n (interpreted as noise)\n Similar to 'allele threshold' parameter in IGV\n\nReturns a list of objects containing 2 properties\n base: such as A, T, G, C, N, - (del)\n score: a numeric score for determining height of histogram\nThe list is ordered such that a preceeding object always have a\nscore >= the current object, and the ref base will be the last item.\n\nExample: There are 50 T's and 40 A's (total depth = 90)\nat a base where ref=A. The function will return\n[T: 90, A: 40]. When creating a histogram with overlap,\nthis will give an appearance of 40 A's (bottom) and 50 T's (top):\n#######\n# T #\n# T #\n# T #\n# T #\n# T #\n#######\n# A #\n# A #\n# A #\n# A #\n#######\n*/\nBaseBin.prototype.baseScoreList = function(ref, threshold) {\n var baseScoreList = [];\n var totalCount = this._totalCount;\n var minCount = threshold * totalCount;\n for (var base in this._bases) {\n var baseCount = this._bases[base].cnt;\n if (baseCount < minCount || base == ref)\n continue;\n var baseScorePair = {base: base, score: totalCount};\n baseScoreList.push(baseScorePair);\n totalCount -= baseCount;\n }\n baseScoreList.push({base: ref, score: totalCount});\n return baseScoreList;\n};\n\n/** Generates an aligned read from the raw sequence of a BAM record\nusing given cigar string.\n\nParams:\n rawseq: unaligned read sequence from Bam record\n rawquals: unaligned read quals from Bam record\n cigar: Bam cigar string from Bam record\n\nReturns an object with 2 properties:\n seq: string containing aligned read\n quals: string containing printable-character representation\n of sequencing quality score\n*/\nfunction alignSeqUsingCigar(rawseq, rawquals, cigar) {\n var ops = parseCigar(cigar);\n var seq = [];\n var quals = [];\n var cursor = 0;\n for (var ci = 0; ci < ops.length; ++ci) {\n var co = ops[ci];\n if (co.op == 'M') {\n seq.push(rawseq.substr(cursor, co.cnt));\n quals.push(rawquals.substr(cursor, co.cnt));\n cursor += co.cnt;\n } else if (co.op == 'D') {\n for (var oi = 0; oi < co.cnt; ++oi) {\n seq.push('-');\n quals.push('Z');\n }\n } else if (co.op == 'I') {\n cursor += co.cnt;\n } else if (co.op == 'S') {\n cursor += co.cnt;\n } else {\n console.log('unknown cigop' + co.op);\n }\n }\n var processedSeq = {seq: seq.join(''), quals: quals.join('')};\n return processedSeq;\n}\n\n/** Constructs the reference sequence for a given window.\n\nParams\n currentSequence: DasSequence object containing ref sequence\n in current browser view.\n min, max: min and max position for window.\n\nReturns a string containing the refseq, padded with 'N' where sequence is not\n available.\n*/\nfunction getRefSeq(currentSequence, min, max) {\n var refSeq = [];\n if (currentSequence) {\n var csStart = currentSequence.start|0;\n var csEnd = currentSequence.end|0;\n if (csStart <= max && csEnd >= min) {\n var sfMin = Math.max(min, csStart);\n var sfMax = Math.min(max, csEnd);\n\n for (var i = 0; i < sfMin - min; i++)\n refSeq.push('N');\n refSeq.push(currentSequence.seq.substr(sfMin - csStart, sfMax - sfMin + 1));\n for (var i = 0; i < max - sfMax; i++)\n refSeq.push('N');\n }\n }\n return refSeq.join('');\n}\n\n/** Constructs features necessary for a coverage track showing\nbase composition for BAM reads\n\nParams\n features: a list of features from BAM records.\n currentRefSeq: a DASSequence object containing reference sequence.\n baseColors: an object mapping base to desired colors.\n\nReturns a list of features of type base-coverage.\n*/\nfunction getBaseCoverage(features, currentRefSeq, baseColors) {\n var minBin = null;\n var maxBin = null;\n\n var allBins = [];\n\n // Populate BaseBins\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.groups && f.groups.length > 0) {\n // Don't downsample complex features\n return features;\n }\n var processedSeq = alignSeqUsingCigar(f.seq, f.quals, f.cigar);\n var seq = processedSeq.seq;\n var quals = processedSeq.quals;\n var strand = f.orientation;\n var minForFeature = f.min || 0;\n var maxForFeature = f.max || 0;\n var ind = 0;\n\n for (var b = minForFeature; b <= maxForFeature; ++b) {\n var bm = allBins[b];\n if (!bm) {\n bm = new BaseBin(b);\n allBins[b] = bm;\n }\n var base = seq.charAt(ind);\n var qual = quals.charCodeAt(ind) - 33; // Generate numeric qual score\n bm.recordBase(base, qual, strand);\n ind++;\n }\n\n if (!minBin)\n minBin = minForFeature;\n else\n minBin = Math.min(minBin, minForFeature);\n if (!maxBin)\n maxBin = maxForFeature;\n else\n maxBin = Math.max(maxBin, maxForFeature);\n }\n\n // Generate coverage features\n var refSeq = getRefSeq(currentRefSeq, minBin, maxBin);\n var baseFeatures = [];\n var ind = 0;\n for (var b = minBin; b <= maxBin; ++b) {\n var bm = allBins[b];\n if (bm) {\n var f = new DASFeature();\n f.segment = features[0].segment;\n f.min = bm.pos();\n f.max = f.min;\n f.notes = [];\n f.notes = f.notes.concat(bm.infoList());\n f.type = 'base-coverage';\n f.suppressScore = true;\n if (refSeq) {\n var refBase = refSeq.charAt(ind);\n var refString = 'Ref=' + refBase;\n f.notes.unshift(refString);\n var baseScoreList = bm.baseScoreList(refBase, 0.2);\n // TODO: shift 0.2 threshold to a config parameter\n for (var i = 0; i < baseScoreList.length; i++) {\n var base = baseScoreList[i].base;\n var score = baseScoreList[i].score;\n var fBase = shallowCopy(f);\n fBase.score = score;\n // Color by baseColor when mismatch occurs\n // otherwise, BoxGlyph to COLOR1 in style\n if (baseScoreList.length > 1 || base != refBase)\n fBase.itemRgb = baseColors[base];\n\n baseFeatures.push(fBase);\n }\n } else {\n // No refSeq, only show coverage height.\n baseFeatures.push(f);\n }\n }\n ind ++;\n }\n return baseFeatures;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n downsample: downsample,\n getBaseCoverage: getBaseCoverage\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// bin.js general binary data support\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n\n var connectTrix = require('./trix').connectTrix;\n}\n\nvar REGION_PATTERN = /^([\\d+,\\w,\\.,\\_,\\-]+)[\\s:]+([0-9,\\.]+?)([KkMmGg])?((-|\\.\\.|\\s)+([0-9,\\.]+)([KkMmGg])?)?$/;\n\nfunction parseLocCardinal(n, m) {\n var i = parseFloat(n.replace(/,/g, ''));\n if (m === 'k' || m === 'K') {\n return (i * 1000)|0;\n } else if (m == 'm' || m === 'M') {\n return (i * 1000000)|0;\n } else {\n return i|0;\n }\n}\n\nBrowser.prototype.search = function(g, statusCallback, opts) {\n var thisB = this;\n opts = opts || {};\n var srPadding = opts.padding || this.defaultSearchRegionPadding;\n \n var m = REGION_PATTERN.exec(g);\n\n if (m) {\n var chr = m[1], start, end;\n if (m[6]) {\n start = parseLocCardinal(m[2], m[3]);\n end = parseLocCardinal(m[6], m[7]);\n } else {\n var width = this.viewEnd - this.viewStart + 1;\n start = (parseLocCardinal(m[2], m[3]) - (width/2))|0;\n end = start + width - 1;\n }\n this.setLocation(chr, start, end, statusCallback);\n } else {\n if (!g || g.length == 0) {\n return false;\n }\n\n var searchCount = 0;\n var foundLatch = false;\n\n var searchCallback = function(found, err) {\n --searchCount;\n if (err) {\n return statusCallback(err);\n }\n\n if (!found) found = [];\n var min = 500000000, max = -100000000;\n var nchr = null;\n for (var fi = 0; fi < found.length; ++fi) {\n var f = found[fi];\n \n if (nchr == null) {\n nchr = f.segment;\n }\n min = Math.min(min, f.min);\n max = Math.max(max, f.max);\n }\n\n if (!nchr) {\n if (searchCount == 0 && !foundLatch)\n return statusCallback(\"no match for '\" + g + \"'\");\n } else {\n foundLatch = true;\n thisB.highlightRegion(nchr, min, max);\n\n var mid = ((max+min)/2)|0\n var padding = Math.max(srPadding, (0.3 * (max - min + 1))|0);\n thisB.setLocation(nchr, min - padding, max + padding, statusCallback);\n }\n }\n\n var doTrixSearch = function(tier, trix) {\n trix.lookup(g, function(result, status) {\n if (result == null || result.length < 2) {\n return tier.featureSource.search(g, searchCallback);\n } else {\n var hit = result[1].split(',')[0];\n return tier.featureSource.search(hit, searchCallback);\n }\n });\n }\n\n if (this.searchEndpoint) {\n searchCount = 1;\n return this.doDasSearch(thisB.searchEndpoint, g, searchCallback);\n }\n\n\n const searchSources = [\n ...(this.searchOnlySourceHolders || []),\n ...this.tiers\n ];\n\n for (var ti = 0; ti < searchSources.length; ++ti) {\n (function(tier) {\n if (thisB.sourceAdapterIsCapable(tier.featureSource, 'search')) {\n if (tier.dasSource.trixURI) {\n ++searchCount;\n if (tier.trix) {\n doTrixSearch(tier, tier.trix);\n } else {\n var ix = new URLFetchable(\n tier.dasSource.trixURI,\n {credentials: tier.dasSource.credentials,\n resolver: tier.dasSource.resolver}\n );\n\n var ixx = new URLFetchable(\n tier.dasSource.trixxURI || (tier.dasSource.trixURI + 'x'),\n {credentials: tier.dasSource.credentials,\n resolver: tier.dasSource.resolver}\n );\n\n connectTrix(ix, ixx, function(trix) {\n tier.trix = trix;\n doTrixSearch(tier, trix);\n });\n }\n } else {\n ++searchCount;\n tier.featureSource.search(g, searchCallback);\n }\n } else if (tier.dasSource.provides_search) {\n ++searchCount;\n thisB.doDasSearch(tier.dasSource, g, searchCallback);\n }\n })(searchSources[ti]);\n }\n }\n}\n\nBrowser.prototype.doDasSearch = function(source, g, searchCallback) {\n var thisB = this;\n source.features(null, {group: g, type: 'transcript'}, function(found) {\n if (!found) found = [];\n var min = 500000000, max = -100000000;\n var nchr = null;\n\n var found2 = [];\n for (var fi = 0; fi < found.length; ++fi) {\n var f = found[fi];\n \n if (f.label.toLowerCase() != g.toLowerCase()) {\n // ...because Dazzle can return spurious overlapping features.\n continue;\n }\n found2.push(f);\n }\n\n return searchCallback(found2);\n }, false);\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2012\n//\n// sequence-draw.js: renderers for sequence-related data\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var formatLongInt = utils.formatLongInt;\n var makeElementNS = utils.makeElementNS;\n\n var svgu = require('./svg-utils');\n var NS_SVG = svgu.NS_SVG;\n var NS_XLINK = svgu.NS_XLINK;\n var SVGPath = svgu.SVGPath;\n\n var nf = require('./numformats');\n var formatLongInt = nf.formatLongInt;\n}\n\nvar MIN_TILE = 100;\nvar rulerTileColors = ['black', 'white'];\n\nvar steps = [1,2,5];\n\n\nvar NS_SVG = 'http://www.w3.org/2000/svg';\n\n\nfunction tileSizeForScale(scale, min)\n{\n if (!min) {\n min = MIN_TILE;\n }\n\n function ts(p) {\n return steps[p % steps.length] * Math.pow(10, (p / steps.length)|0);\n }\n var pow = steps.length;\n while (scale * ts(pow) < min) {\n ++pow;\n }\n return ts(pow);\n}\n\nfunction drawSeqTier(tier, seq) {\n var gc = tier.viewport.getContext('2d');\n var retina = tier.browser.retina && window.devicePixelRatio > 1;\n var desiredWidth = tier.browser.featurePanelWidth + 2000;\n if (retina) {\n desiredWidth *= 2;\n }\n var fpw = tier.viewport.width|0; // this.browser.featurePanelWidth;\n if (fpw < desiredWidth - 50) {\n tier.viewport.width = fpw = desiredWidth;\n }\n\n var height = 50;\n if (seq && seq.seq) {\n height += 25;\n }\n\n var canvasHeight = height;\n if (retina) \n canvasHeight *= 2;\n\n tier.viewport.height = canvasHeight;\n tier.viewport.style.height = '' + height + 'px';\n tier.viewport.style.width = retina ? ('' + (fpw/2) + 'px') : ('' + fpw + 'px');\n tier.layoutHeight = height;\n tier.updateHeight();\n\n \n if (tier.background) {\n gc.fillStyle = tier.background;\n gc.fillRect(0, 0, fpw, tier.viewport.height);\n }\n if (retina) {\n gc.scale(2, 2);\n }\n\n gc.translate(1000,0);\n drawSeqTierGC(tier, seq, gc);\n tier.norigin = tier.browser.viewStart;\n tier.viewportHolder.style.left = '-1000px';\n}\n\nfunction drawSeqTierGC(tier, seq, gc)\n{\n var scale = tier.browser.scale, knownStart = tier.browser.viewStart - (1000/scale)|0, knownEnd = tier.browser.viewEnd + (2000/scale), currentSeqMax = tier.browser.currentSeqMax;\n\n var seqTierMax = knownEnd;\n if (currentSeqMax > 0 && currentSeqMax < knownEnd) {\n seqTierMax = currentSeqMax;\n }\n var tile = tileSizeForScale(scale);\n var pos = Math.max(0, ((knownStart / tile)|0) * tile);\n \n var origin = tier.browser.viewStart;\n\n while (pos <= seqTierMax) {\n\t\tgc.fillStyle = ((pos / tile) % 2 == 0) ? 'white' : 'black';\n\t\tgc.strokeStyle = 'black';\n\t\tgc.fillRect((pos - origin) * scale,\n\t\t\t 8,\n\t\t\t tile*scale,\n\t\t\t 3);\n\t\tgc.strokeRect((pos - origin) * scale,\n\t\t\t 8,\n\t\t\t tile*scale,\n\t\t\t 3);\n\n\t\tgc.fillStyle = 'black';\n\t\tgc.fillText(formatLongInt(pos), ((pos - origin) * scale), 22);\n\t\t\n\n\t\tpos += tile;\n }\n\n if (seq && seq.seq) {\n\t\tfor (var p = knownStart; p <= knownEnd; ++p) {\n\t\t if (p >= seq.start && p <= seq.end) {\n\t\t\t\tvar base = seq.seq.substr(p - seq.start, 1).toUpperCase();\n\t\t\t\tvar color = tier.browser.baseColors[base];\n\t\t\t\tif (!color) {\n\t\t color = 'gray';\n\t\t\t\t}\n\n\t\t\t\tgc.fillStyle = color;\n\n\t\t\t\tif (scale >= 8) {\n var w = gc.measureText(base).width;\n // console.log(scale-w);\n\t\t\t\t gc.fillText(base, (p - origin) * scale + ((scale-w)*0.5) , 52);\n\t\t\t\t} else {\n\t\t\t\t gc.fillRect((p - origin) * scale, 42, scale, 12); \n\t\t\t\t}\n\t\t }\n\t\t}\n }\n}\n\nfunction svgSeqTier(tier, seq) {\n var scale = tier.browser.scale, knownStart = tier.browser.viewStart - (1000/scale)|0, knownEnd = tier.browser.viewEnd + (2000/scale), currentSeqMax = tier.browser.currentSeqMax;\n\n var fpw = tier.viewport.width|0; \n\n var seqTierMax = knownEnd;\n if (currentSeqMax > 0 && currentSeqMax < knownEnd) {\n seqTierMax = currentSeqMax;\n }\n var tile = tileSizeForScale(scale);\n var pos = Math.max(0, ((knownStart / tile)|0) * tile);\n \n var origin = tier.browser.viewStart;\n\n var g = makeElementNS(NS_SVG, 'g', [], {fontSize: '8pt'}); \n while (pos <= seqTierMax) {\n \tg.appendChild(\n \t makeElementNS(\n \t\tNS_SVG, 'rect',\n \t\tnull,\n \t\t{x: (pos-origin)*scale,\n \t\t y: 8,\n \t\t width: tile*scale,\n \t\t height: 3,\n \t\t fill: ((pos / tile) % 2 == 0) ? 'white' : 'black',\n \t\t stroke: 'black'}));\n\n \tg.appendChild(\n \t makeElementNS(\n \t\tNS_SVG, 'text',\n \t\tformatLongInt(pos),\n \t\t{x: (pos-origin)*scale,\n \t\t y: 28,\n \t\t fill: 'black', stroke: 'none'}));\n \t\n \tpos += tile;\n }\n\n if (seq && seq.seq) {\n \tfor (var p = knownStart; p <= knownEnd; ++p) {\n \t if (p >= seq.start && p <= seq.end) {\n \t\tvar base = seq.seq.substr(p - seq.start, 1).toUpperCase();\n \t\tvar color = tier.browser.baseColors[base];\n \t\tif (!color) {\n color = 'gray';\n \t\t}\n\n \t\tif (scale >= 8) {\n \t\t g.appendChild(\n \t\t\tmakeElementNS(NS_SVG, 'text', base, {\n \t\t\t x: (0.5+p-origin)*scale,\n \t\t\t y: 52,\n textAnchor: 'middle',\n \t\t\t fill: color}));\n \t\t} else {\n \t\t g.appendChild(\n \t\t\tmakeElementNS(NS_SVG, 'rect', null, {\n \t\t\t x: (p - origin)*scale,\n \t\t\t y: 42,\n \t\t\t width: scale,\n \t\t\t height: 12,\n \t fill: color}));\n\n \t\t}\n \t }\n \t}\n } \n\n return g;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n drawSeqTier: drawSeqTier,\n drawSeqTierGC: drawSeqTierGC,\n svgSeqTier: svgSeqTier\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// session.js\n//\n\n\"use strict\";\n\nif (typeof(require) != 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var sc = require('./sourcecompare');\n var sourceDataURI = sc.sourceDataURI;\n var sourcesAreEqual = sc.sourcesAreEqual;\n\n var VERSION = require('./version');\n\n var utils = require('./utils');\n var miniJSONify = utils.miniJSONify;\n\n var sha1 = require('./sha1');\n var hex_sha1 = sha1.hex_sha1;\n}\n\nBrowser.prototype.nukeStatus = function() {\n delete localStorage['dalliance.' + this.cookieKey + '.view-chr'];\n delete localStorage['dalliance.' + this.cookieKey + '.view-start'];\n delete localStorage['dalliance.' + this.cookieKey + '.view-end'];\n delete localStorage['dalliance.' + this.cookieKey + '.current-seq-length'];\n delete localStorage['dalliance.' + this.cookieKey + '.showing-alt-zoom'];\n delete localStorage['dalliance.' + this.cookieKey + '.saved-zoom'];\n\n delete localStorage['dalliance.' + this.cookieKey + '.sources'];\n delete localStorage['dalliance.' + this.cookieKey + '.hubs'];\n delete localStorage['dalliance.' + this.cookieKey + '.version'];\n\n delete localStorage['dalliance.' + this.cookieKey + '.reverse-scrolling'];\n delete localStorage['dalliance.' + this.cookieKey + '.reverse-key-scrolling'];\n delete localStorage['dalliance.' + this.cookieKey + '.ruler-location'];\n}\n\nBrowser.prototype.storeStatus = function() {\n this.storeViewStatus();\n this.storeTierStatus();\n}\n\nBrowser.prototype.storeViewStatus = function() {\n if (!this.cookieKey || this.noPersist || this.noPersistView) {\n return;\n }\n\n localStorage['dalliance.' + this.cookieKey + '.view-chr'] = this.chr;\n localStorage['dalliance.' + this.cookieKey + '.view-start'] = this.viewStart|0;\n localStorage['dalliance.' + this.cookieKey + '.view-end'] = this.viewEnd|0\n localStorage['dalliance.' + this.cookieKey + '.showing-alt-zoom'] = '' + this.isSnapZooming;\n localStorage['dalliance.' + this.cookieKey + '.saved-zoom'] = this.savedZoom;\n if (this.currentSeqMax) {\n\t localStorage['dalliance.' + this.cookieKey + '.current-seq-length'] = this.currentSeqMax;\n }\n}\n\n\nBrowser.prototype.storeTierStatus = function() {\n if (!this.cookieKey || this.noPersist) {\n return;\n }\n\n var currentSourceList = [];\n for (var t = 0; t < this.tiers.length; ++t) {\n var tt = this.tiers[t];\n var ts = tt.dasSource;\n if (!ts.noPersist) {\n currentSourceList.push({source: tt.dasSource, config: tt.config || {}});\n }\n }\n localStorage['dalliance.' + this.cookieKey + '.sources'] = JSON.stringify(currentSourceList);\n\n\n var coveredHubURLs = {};\n var currentHubList = [];\n for (var hi = 0; hi < this.hubObjects.length; ++hi) {\n var tdb = this.hubObjects[hi];\n var hc = {url: tdb.hub.url, genome: tdb.genome};\n if (tdb.credentials)\n hc.credentials = tdb.credentials;\n if (tdb.mapping)\n hc.mapping = tdb.mapping;\n coveredHubURLs[hc.url] = true;\n currentHubList.push(hc);\n }\n\n // Needed to handle hubs that failed to connect, or hubs that haven't\n // connected yet when we're called soon after startup.\n for (var hi = 0; hi < this.hubs.length; ++hi) {\n var hc = this.hubs[hi];\n if (typeof hc === 'string')\n hc = {url: hc};\n if (!coveredHubURLs[hc.url])\n currentHubList.push(hc);\n }\n\n localStorage['dalliance.' + this.cookieKey + '.hubs'] = JSON.stringify(currentHubList);\n\n localStorage['dalliance.' + this.cookieKey + '.reverse-scrolling'] = this.reverseScrolling;\n localStorage['dalliance.' + this.cookieKey + '.reverse-key-scrolling'] = this.reverseKeyScrolling;\n localStorage['dalliance.' + this.cookieKey + '.single-base-highlight'] = this.singleBaseHighlight;\n localStorage['dalliance.' + this.cookieKey + '.ruler-location'] = this.rulerLocation;\n\n localStorage['dalliance.' + this.cookieKey + '.export-ruler'] = this.exportRuler;\n localStorage['dalliance.' + this.cookieKey + '.export-highlights'] = this.exportHighlights;\n \n localStorage['dalliance.' + this.cookieKey + '.version'] = VERSION.CONFIG;\n}\n\nBrowser.prototype.restoreStatus = function() {\n if (this.noPersist)\n return;\n \n var storedConfigVersion = localStorage['dalliance.' + this.cookieKey + '.version'];\n if (storedConfigVersion) {\n storedConfigVersion = storedConfigVersion|0;\n } else {\n storedConfigVersion = -100;\n }\n if (VERSION.CONFIG != storedConfigVersion) {\n return;\n }\n\n var storedConfigHash = localStorage['dalliance.' + this.cookieKey + '.configHash'] || '';\n var pageConfigHash = hex_sha1(miniJSONify({\n sources: this.sources,\n hubs: this.hubs,\n rulerLocation: this.rulerLocation\n }));\n if (pageConfigHash != storedConfigHash) {\n localStorage['dalliance.' + this.cookieKey + '.configHash'] = pageConfigHash;\n return;\n }\n\n var defaultSourcesByURI = {};\n for (var si = 0; si < this.sources.length; ++si) {\n var source = this.sources[si];\n if (!source)\n continue;\n\n var uri = sourceDataURI(source);\n var ul = defaultSourcesByURI[uri];\n if (!ul)\n defaultSourcesByURI[uri] = ul = [];\n ul.push(source);\n \n }\n\n if (!this.noPersistView) {\n var qChr = localStorage['dalliance.' + this.cookieKey + '.view-chr'];\n var qMin = localStorage['dalliance.' + this.cookieKey + '.view-start']|0;\n var qMax = localStorage['dalliance.' + this.cookieKey + '.view-end']|0;\n if (qChr && qMin && qMax) {\n \tthis.chr = qChr;\n \tthis.viewStart = qMin;\n \tthis.viewEnd = qMax;\n \t\n \tvar csm = localStorage['dalliance.' + this.cookieKey + '.current-seq-length'];\n \tif (csm) {\n \t this.currentSeqMax = csm|0;\n \t}\n\n this.isSnapZooming = (localStorage['dalliance.' + this.cookieKey + '.showing-alt-zoom']) == 'true';\n\n var sz = parseFloat(localStorage['dalliance.' + this.cookieKey + '.saved-zoom']);\n if (typeof sz === 'number' && !isNaN(sz)) {\n this.savedZoom = sz;\n }\n }\n }\n\n var rs = localStorage['dalliance.' + this.cookieKey + '.reverse-scrolling'];\n this.reverseScrolling = (rs && rs == 'true');\n var rks = localStorage['dalliance.' + this.cookieKey + '.reverse-key-scrolling'];\n this.reverseKeyScrolling = (rks && rks == 'true');\n var sbh = localStorage['dalliance.' + this.cookieKey + '.single-base-highlight'];\n this.singleBaseHighlight = (sbh && sbh == 'true');\n \n var rl = localStorage['dalliance.' + this.cookieKey + '.ruler-location'];\n if (rl)\n this.rulerLocation = rl;\n\n var x = localStorage['dalliance.' + this.cookieKey + '.export-ruler'];\n if (x)\n this.exportRuler = (x === 'true');\n var x = localStorage['dalliance.' + this.cookieKey + '.export-highlights'];\n if (x)\n this.exportHighlights = (x === 'true');\n\n var sourceStr = localStorage['dalliance.' + this.cookieKey + '.sources'];\n if (sourceStr) {\n\t var storedSources = JSON.parse(sourceStr);\n this.sources = [];\n this.restoredConfigs = [];\n for (var si = 0; si < storedSources.length; ++si) {\n var source = this.sources[si] = storedSources[si].source;\n this.restoredConfigs[si] = storedSources[si].config;\n var uri = sourceDataURI(source);\n var ul = defaultSourcesByURI[uri] || [];\n for (var osi = 0; osi < ul.length; ++osi) { \n var oldSource = ul[osi];\n if (sourcesAreEqual(source, oldSource)) {\n for (var k in oldSource) {\n if (oldSource.hasOwnProperty(k) && \n (typeof(oldSource[k]) === 'function' || oldSource[k] instanceof Blob))\n {\n source[k] = oldSource[k];\n }\n }\n }\n }\n }\n }\n\n var hubStr = localStorage['dalliance.' + this.cookieKey + '.hubs'];\n if (hubStr) {\n this.hubs = JSON.parse(hubStr);\n }\n\n return true;\n}\n\nBrowser.prototype.reset = function() {\n for (var i = this.tiers.length - 1; i >= 0; --i) {\n this.removeTier({index: i}, true);\n }\n for (var i = 0; i < this.defaultSources.length; ++i) {\n var s = this.defaultSources[i];\n if (!s.disabled) \n this.addTier(this.defaultSources[i]);\n }\n\n this.highlights.splice(0, this.highlights.length);\n\n this.setLocation(this.defaultChr, this.defaultStart, this.defaultEnd);\n}\n","/*\r\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\r\n * in FIPS 180-1\r\n * Version 2.2 Copyright Paul Johnston 2000 - 2009.\r\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\r\n * Distributed under the BSD License\r\n * See http://pajhome.org.uk/crypt/md5 for details.\r\n */\r\n\r\n \"use strict\";\r\n\r\n/*\r\n * Configurable variables. You may need to tweak these to be compatible with\r\n * the server-side, but the defaults work in most cases.\r\n */\r\nvar hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\r\nvar b64pad = \"\"; /* base-64 pad character. \"=\" for strict RFC compliance */\r\n\r\n/*\r\n * These are the functions you'll usually want to call\r\n * They take string arguments and return either hex or base-64 encoded strings\r\n */\r\nfunction hex_sha1(s) { return rstr2hex(rstr_sha1(str2rstr_utf8(s))); }\r\nfunction b64_sha1(s) { return rstr2b64(rstr_sha1(str2rstr_utf8(s))); }\r\nfunction any_sha1(s, e) { return rstr2any(rstr_sha1(str2rstr_utf8(s)), e); }\r\nfunction hex_hmac_sha1(k, d)\r\n { return rstr2hex(rstr_hmac_sha1(str2rstr_utf8(k), str2rstr_utf8(d))); }\r\nfunction b64_hmac_sha1(k, d)\r\n { return rstr2b64(rstr_hmac_sha1(str2rstr_utf8(k), str2rstr_utf8(d))); }\r\nfunction any_hmac_sha1(k, d, e)\r\n { return rstr2any(rstr_hmac_sha1(str2rstr_utf8(k), str2rstr_utf8(d)), e); }\r\n\r\n/*\r\n * Perform a simple self-test to see if the VM is working\r\n */\r\nfunction sha1_vm_test()\r\n{\r\n return hex_sha1(\"abc\").toLowerCase() == \"a9993e364706816aba3e25717850c26c9cd0d89d\";\r\n}\r\n\r\n/*\r\n * Calculate the SHA1 of a raw string\r\n */\r\nfunction rstr_sha1(s)\r\n{\r\n return binb2rstr(binb_sha1(rstr2binb(s), s.length * 8));\r\n}\r\n\r\n/*\r\n * Calculate the HMAC-SHA1 of a key and some data (raw strings)\r\n */\r\nfunction rstr_hmac_sha1(key, data)\r\n{\r\n var bkey = rstr2binb(key);\r\n if(bkey.length > 16) bkey = binb_sha1(bkey, key.length * 8);\r\n\r\n var ipad = Array(16), opad = Array(16);\r\n for(var i = 0; i < 16; i++)\r\n {\r\n ipad[i] = bkey[i] ^ 0x36363636;\r\n opad[i] = bkey[i] ^ 0x5C5C5C5C;\r\n }\r\n\r\n var hash = binb_sha1(ipad.concat(rstr2binb(data)), 512 + data.length * 8);\r\n return binb2rstr(binb_sha1(opad.concat(hash), 512 + 160));\r\n}\r\n\r\n/*\r\n * Convert a raw string to a hex string\r\n */\r\nfunction rstr2hex(input)\r\n{\r\n // try { hexcase } catch(e) { hexcase=0; }\r\n var hex_tab = hexcase ? \"0123456789ABCDEF\" : \"0123456789abcdef\";\r\n var output = \"\";\r\n var x;\r\n for(var i = 0; i < input.length; i++)\r\n {\r\n x = input.charCodeAt(i);\r\n output += hex_tab.charAt((x >>> 4) & 0x0F)\r\n + hex_tab.charAt( x & 0x0F);\r\n }\r\n return output;\r\n}\r\n\r\n/*\r\n * Convert a raw string to a base-64 string\r\n */\r\nfunction rstr2b64(input)\r\n{\r\n // try { b64pad } catch(e) { b64pad=''; }\r\n var tab = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\r\n var output = \"\";\r\n var len = input.length;\r\n for(var i = 0; i < len; i += 3)\r\n {\r\n var triplet = (input.charCodeAt(i) << 16)\r\n | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)\r\n | (i + 2 < len ? input.charCodeAt(i+2) : 0);\r\n for(var j = 0; j < 4; j++)\r\n {\r\n if(i * 8 + j * 6 > input.length * 8) output += b64pad;\r\n else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);\r\n }\r\n }\r\n return output;\r\n}\r\n\r\n/*\r\n * Convert a raw string to an arbitrary string encoding\r\n */\r\nfunction rstr2any(input, encoding)\r\n{\r\n var divisor = encoding.length;\r\n var remainders = Array();\r\n var i, q, x, quotient;\r\n\r\n /* Convert to an array of 16-bit big-endian values, forming the dividend */\r\n var dividend = Array(Math.ceil(input.length / 2));\r\n for(i = 0; i < dividend.length; i++)\r\n {\r\n dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);\r\n }\r\n\r\n /*\r\n * Repeatedly perform a long division. The binary array forms the dividend,\r\n * the length of the encoding is the divisor. Once computed, the quotient\r\n * forms the dividend for the next step. We stop when the dividend is zero.\r\n * All remainders are stored for later use.\r\n */\r\n while(dividend.length > 0)\r\n {\r\n quotient = Array();\r\n x = 0;\r\n for(i = 0; i < dividend.length; i++)\r\n {\r\n x = (x << 16) + dividend[i];\r\n q = Math.floor(x / divisor);\r\n x -= q * divisor;\r\n if(quotient.length > 0 || q > 0)\r\n quotient[quotient.length] = q;\r\n }\r\n remainders[remainders.length] = x;\r\n dividend = quotient;\r\n }\r\n\r\n /* Convert the remainders to the output string */\r\n var output = \"\";\r\n for(i = remainders.length - 1; i >= 0; i--)\r\n output += encoding.charAt(remainders[i]);\r\n\r\n /* Append leading zero equivalents */\r\n var full_length = Math.ceil(input.length * 8 /\r\n (Math.log(encoding.length) / Math.log(2)))\r\n for(i = output.length; i < full_length; i++)\r\n output = encoding[0] + output;\r\n\r\n return output;\r\n}\r\n\r\n/*\r\n * Encode a string as utf-8.\r\n * For efficiency, this assumes the input is valid utf-16.\r\n */\r\nfunction str2rstr_utf8(input)\r\n{\r\n var output = \"\";\r\n var i = -1;\r\n var x, y;\r\n\r\n while(++i < input.length)\r\n {\r\n /* Decode utf-16 surrogate pairs */\r\n x = input.charCodeAt(i);\r\n y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;\r\n if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)\r\n {\r\n x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);\r\n i++;\r\n }\r\n\r\n /* Encode output as utf-8 */\r\n if(x <= 0x7F)\r\n output += String.fromCharCode(x);\r\n else if(x <= 0x7FF)\r\n output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),\r\n 0x80 | ( x & 0x3F));\r\n else if(x <= 0xFFFF)\r\n output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),\r\n 0x80 | ((x >>> 6 ) & 0x3F),\r\n 0x80 | ( x & 0x3F));\r\n else if(x <= 0x1FFFFF)\r\n output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),\r\n 0x80 | ((x >>> 12) & 0x3F),\r\n 0x80 | ((x >>> 6 ) & 0x3F),\r\n 0x80 | ( x & 0x3F));\r\n }\r\n return output;\r\n}\r\n\r\n/*\r\n * Encode a string as utf-16\r\n */\r\nfunction str2rstr_utf16le(input)\r\n{\r\n var output = \"\";\r\n for(var i = 0; i < input.length; i++)\r\n output += String.fromCharCode( input.charCodeAt(i) & 0xFF,\r\n (input.charCodeAt(i) >>> 8) & 0xFF);\r\n return output;\r\n}\r\n\r\nfunction str2rstr_utf16be(input)\r\n{\r\n var output = \"\";\r\n for(var i = 0; i < input.length; i++)\r\n output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,\r\n input.charCodeAt(i) & 0xFF);\r\n return output;\r\n}\r\n\r\n/*\r\n * Convert a raw string to an array of big-endian words\r\n * Characters >255 have their high-byte silently ignored.\r\n */\r\nfunction rstr2binb(input)\r\n{\r\n var output = Array(input.length >> 2);\r\n for(var i = 0; i < output.length; i++)\r\n output[i] = 0;\r\n for(var i = 0; i < input.length * 8; i += 8)\r\n output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (24 - i % 32);\r\n return output;\r\n}\r\n\r\n/*\r\n * Convert an array of big-endian words to a string\r\n */\r\nfunction binb2rstr(input)\r\n{\r\n var output = \"\";\r\n for(var i = 0; i < input.length * 32; i += 8)\r\n output += String.fromCharCode((input[i>>5] >>> (24 - i % 32)) & 0xFF);\r\n return output;\r\n}\r\n\r\n/*\r\n * Calculate the SHA-1 of an array of big-endian words, and a bit length\r\n */\r\nfunction binb_sha1(x, len)\r\n{\r\n /* append padding */\r\n x[len >> 5] |= 0x80 << (24 - len % 32);\r\n x[((len + 64 >> 9) << 4) + 15] = len;\r\n\r\n var w = Array(80);\r\n var a = 1732584193;\r\n var b = -271733879;\r\n var c = -1732584194;\r\n var d = 271733878;\r\n var e = -1009589776;\r\n\r\n for(var i = 0; i < x.length; i += 16)\r\n {\r\n var olda = a;\r\n var oldb = b;\r\n var oldc = c;\r\n var oldd = d;\r\n var olde = e;\r\n\r\n for(var j = 0; j < 80; j++)\r\n {\r\n if(j < 16) w[j] = x[i + j];\r\n else w[j] = bit_rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);\r\n var t = safe_add(safe_add(bit_rol(a, 5), sha1_ft(j, b, c, d)),\r\n safe_add(safe_add(e, w[j]), sha1_kt(j)));\r\n e = d;\r\n d = c;\r\n c = bit_rol(b, 30);\r\n b = a;\r\n a = t;\r\n }\r\n\r\n a = safe_add(a, olda);\r\n b = safe_add(b, oldb);\r\n c = safe_add(c, oldc);\r\n d = safe_add(d, oldd);\r\n e = safe_add(e, olde);\r\n }\r\n return Array(a, b, c, d, e);\r\n\r\n}\r\n\r\n/*\r\n * Perform the appropriate triplet combination function for the current\r\n * iteration\r\n */\r\nfunction sha1_ft(t, b, c, d)\r\n{\r\n if(t < 20) return (b & c) | ((~b) & d);\r\n if(t < 40) return b ^ c ^ d;\r\n if(t < 60) return (b & c) | (b & d) | (c & d);\r\n return b ^ c ^ d;\r\n}\r\n\r\n/*\r\n * Determine the appropriate additive constant for the current iteration\r\n */\r\nfunction sha1_kt(t)\r\n{\r\n return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :\r\n (t < 60) ? -1894007588 : -899497514;\r\n}\r\n\r\n/*\r\n * Add integers, wrapping at 2^32. This uses 16-bit operations internally\r\n * to work around bugs in some JS interpreters.\r\n */\r\nfunction safe_add(x, y)\r\n{\r\n var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r\n var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r\n return (msw << 16) | (lsw & 0xFFFF);\r\n}\r\n\r\n/*\r\n * Bitwise rotate a 32-bit number to the left.\r\n */\r\nfunction bit_rol(num, cnt)\r\n{\r\n return (num << cnt) | (num >>> (32 - cnt));\r\n}\r\n\r\nif (typeof(module) !== 'undefined') {\r\n module.exports = {\r\n b64_sha1: b64_sha1,\r\n hex_sha1: hex_sha1\r\n }\r\n}\r\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// sourceadapters.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var tier = require('./tier');\n var DasTier = tier.DasTier;\n\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n var arrayIndexOf = utils.arrayIndexOf;\n var shallowCopy = utils.shallowCopy;\n var resolveUrlToPage = utils.resolveUrlToPage;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASSource = das.DASSource;\n var DASSegment = das.DASSegment;\n var DASFeature = das.DASFeature;\n var DASSequence = das.DASSequence;\n var DASLink = das.DASLink;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n\n var twoBit = require('./twoBit');\n var makeTwoBit = twoBit.makeTwoBit;\n\n var bbi = require('./bigwig');\n var makeBwg = bbi.makeBwg;\n\n var bam = require('./bam');\n var makeBam = bam.makeBam;\n var BamFlags = bam.BamFlags;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n\n var parseCigar = require('./cigar').parseCigar;\n\n var OverlayFeatureSource = require('./overlay').OverlayFeatureSource;\n\n var JBrowseStore = require('./jbjson').JBrowseStore;\n\n var Chainset = require('./chainset').Chainset;\n\n var style = require('./style');\n var StyleFilterSet = style.StyleFilterSet;\n\n var EncodeFetchable = require('./encode').EncodeFetchable;\n}\n\nvar __dalliance_sourceAdapterFactories = {};\n\nfunction dalliance_registerSourceAdapterFactory(type, factory) {\n __dalliance_sourceAdapterFactories[type] = factory;\n}\n\n\nvar __dalliance_parserFactories = {};\n\nfunction dalliance_registerParserFactory(type, factory) {\n __dalliance_parserFactories[type] = factory;\n}\n\nfunction dalliance_makeParser(type) {\n if (__dalliance_parserFactories[type]) {\n return __dalliance_parserFactories[type](type);\n }\n}\n\n\nDasTier.prototype.initSources = function() {\n var thisTier = this;\n\n var sources = this.browser.createSources(this.dasSource);\n this.featureSource = sources.features || new DummyFeatureSource();\n this.sequenceSource = sources.sequence;\n\n if (this.featureSource && this.featureSource.addChangeListener) {\n this.featureSource.addChangeListener(function() {\n thisTier.browser.refreshTier(thisTier);\n });\n }\n};\n\nBrowser.prototype.createSources = function(config) {\n var sources = this.sourceCache.get(config);\n if (sources)\n return sources;\n\n var fs, ss;\n\n if (config.tier_type == 'sequence' || config.twoBitURI || config.twoBitBlob) {\n if (config.twoBitURI || config.twoBitBlob) {\n ss = new TwoBitSequenceSource(config);\n } else if (config.ensemblURI) {\n ss = new EnsemblSequenceSource(config);\n } else {\n ss = new DASSequenceSource(config);\n }\n } else if (config.tier_type && __dalliance_sourceAdapterFactories[config.tier_type]) {\n var saf = __dalliance_sourceAdapterFactories[config.tier_type];\n var ns = saf(config);\n fs = ns.features;\n ss = ns.sequence;\n } else if (config.bwgURI || config.bwgBlob) {\n var worker = this.getWorker();\n if (worker)\n fs = new RemoteBWGFeatureSource(config, worker, this);\n else\n fs = new BWGFeatureSource(config);\n } else if (config.bamURI || config.bamBlob) {\n var worker = this.getWorker();\n if (worker)\n fs = new RemoteBAMFeatureSource(config, worker, this);\n else\n fs = new BAMFeatureSource(config);\n } else if (config.jbURI) {\n fs = new JBrowseFeatureSource(config);\n } else if (config.uri || config.features_uri) {\n fs = new DASFeatureSource(config);\n }\n\n if (config.overlay) {\n var sources = [];\n if (fs)\n sources.push(new CachingFeatureSource(fs));\n\n for (var oi = 0; oi < config.overlay.length; ++oi) {\n var cs = this.createSources(config.overlay[oi]);\n if (cs && cs.features)\n sources.push(cs.features);\n }\n fs = new OverlayFeatureSource(sources, config);\n }\n\n if (config.sequenceAliases) {\n fs = new MappedFeatureSource(fs, new Chainset({type: 'alias', sequenceAliases: config.sequenceAliases}));\n }\n\n if (config.mapping) {\n fs = new MappedFeatureSource(fs, this.chains[config.mapping]);\n }\n\n if (config.name && fs && !fs.name) {\n fs.name = config.name;\n }\n\n if (typeof fs !== 'undefined' && fs !== null) {\n fs = new CachingFeatureSource(fs);\n }\n\n if ( (typeof fs !== 'undefined' && fs !== null) || (typeof ss !== 'undefined' && ss != null) ) {\n sources = {\n features: fs,\n sequence: ss\n };\n this.sourceCache.put(config, sources);\n }\n\n return sources;\n};\n\nDasTier.prototype.fetchStylesheet = function(cb) {\n var ssSource;\n // Somewhat ugly workaround for the special case of DAS sources...\n if (this.dasSource.stylesheet_uri || (\n !this.dasSource.tier_type &&\n !this.dasSource.bwgURI &&\n !this.dasSource.bwgBlob &&\n !this.dasSource.bamURI &&\n !this.dasSource.bamBlob &&\n !this.dasSource.twoBitURI &&\n !this.dasSource.twoBitBlob &&\n !this.dasSource.jbURI &&\n !this.dasSource.overlay))\n {\n ssSource = new DASFeatureSource(this.dasSource);\n } else {\n ssSource = this.getSource();\n }\n ssSource.getStyleSheet(cb);\n};\n\nvar __cfs_id_seed = 0;\n\nfunction CachingFeatureSource(source) {\n var thisB = this;\n\n this.source = source;\n this.cfsid = 'cfs' + (++__cfs_id_seed);\n if (source.name) {\n this.name = source.name;\n }\n if (source.addChangeListener) {\n source.addChangeListener(function() {\n thisB.cfsid = 'cfs' + (++__cfs_id_seed);\n });\n }\n}\n\nCachingFeatureSource.prototype.addReadinessListener = function(listener) {\n if (this.source.addReadinessListener)\n return this.source.addReadinessListener(listener);\n else\n listener(null);\n};\n\nCachingFeatureSource.prototype.removeReadinessListener = function(listener) {\n if (this.source.removeReadinessListener)\n return this.source.removeReadinessListener(listener);\n};\n\nCachingFeatureSource.prototype.search = function(query, callback) {\n if (this.source.search)\n return this.source.search(query, callback);\n};\n\nCachingFeatureSource.prototype.getDefaultFIPs = function(callback) {\n if (this.source.getDefaultFIPs)\n return this.source.getDefaultFIPs(callback); \n};\n\nCachingFeatureSource.prototype.getStyleSheet = function(callback) {\n this.source.getStyleSheet(callback);\n};\n\nCachingFeatureSource.prototype.getScales = function() {\n return this.source.getScales();\n};\n\nCachingFeatureSource.prototype.addActivityListener = function(l) {\n if (this.source.addActivityListener) {\n this.source.addActivityListener(l);\n }\n};\n\nCachingFeatureSource.prototype.removeActivityListener = function(l) {\n if (this.source.removeActivityListener) {\n this.source.removeActivityListener(l);\n }\n};\n\nCachingFeatureSource.prototype.addChangeListener = function(l) {\n if (this.source.addChangeListener)\n this.source.addChangeListener(l);\n};\n\nCachingFeatureSource.prototype.removeChangeListener = function(l) {\n if (this.source.removeChangeListener)\n this.source.removeChangeListener(l);\n};\n\nCachingFeatureSource.prototype.findNextFeature = function(chr, pos, dir, callback) {\n this.source.findNextFeature(chr, pos, dir, callback);\n};\n\nCachingFeatureSource.prototype.quantFindNextFeature = function(chr, pos, dir, threshold, callback) {\n this.source.quantFindNextFeature(chr, pos, dir, threshold, callback);\n};\n\nCachingFeatureSource.prototype.capabilities = function() {\n if (this.source.capabilities) {\n return this.source.capabilities();\n } else {\n return {};\n }\n};\n\nCachingFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback, styleFilters) {\n if (!pool) {\n throw Error('Fetch pool is null');\n }\n\n var self = this;\n var cacheKey = this.cfsid;\n\n var awaitedFeatures = pool.awaitedFeatures[cacheKey];\n if (awaitedFeatures && awaitedFeatures.started) {\n if (awaitedFeatures.styleFilters.doesNotContain(styleFilters)) {\n // console.log('Fetch already started with wrong parameters, skipping cache.');\n self.source.fetch(chr, min, max, scale, types, pool, callback, styleFilters);\n return;\n }\n } else if (awaitedFeatures) {\n awaitedFeatures.styleFilters.addAll(styleFilters);\n } else {\n awaitedFeatures = new Awaited();\n awaitedFeatures.styleFilters = styleFilters;\n pool.awaitedFeatures[cacheKey] = awaitedFeatures;\n\n pool.requestsIssued.then(function() {\n awaitedFeatures.started = true;\n self.source.fetch(\n chr, \n min, \n max, \n scale, \n awaitedFeatures.styleFilters.typeList(), \n pool, \n function(status, features, scale, coverage) {\n if (!awaitedFeatures.res)\n awaitedFeatures.provide({status: status, features: features, scale: scale, coverage: coverage});\n }, \n awaitedFeatures.styleFilters);\n }).catch(function(err) {\n console.log(err);\n });\n } \n\n awaitedFeatures.await(function(af) {\n callback(af.status, af.features, af.scale, af.coverage);\n });\n};\n \nfunction FeatureSourceBase() {\n this.busy = 0;\n this.activityListeners = [];\n this.readinessListeners = [];\n this.readiness = null;\n}\n\nFeatureSourceBase.prototype.addReadinessListener = function(listener) {\n this.readinessListeners.push(listener);\n listener(this.readiness);\n};\n\nFeatureSourceBase.prototype.removeReadinessListener = function(listener) {\n var idx = arrayIndexOf(this.readinessListeners, listener);\n if (idx >= 0) {\n this.readinessListeners.splice(idx, 1);\n }\n};\n\nFeatureSourceBase.prototype.notifyReadiness = function() {\n for (var li = 0; li < this.readinessListeners.length; ++li) {\n try {\n this.readinessListeners[li](this.readiness);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nFeatureSourceBase.prototype.addActivityListener = function(listener) {\n this.activityListeners.push(listener);\n};\n\nFeatureSourceBase.prototype.removeActivityListener = function(listener) {\n var idx = arrayIndexOf(this.activityListeners, listener);\n if (idx >= 0) {\n this.activityListeners.splice(idx, 1);\n }\n};\n\nFeatureSourceBase.prototype.notifyActivity = function() {\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nFeatureSourceBase.prototype.getScales = function() {\n return null;\n};\n\nFeatureSourceBase.prototype.fetch = function(chr, min, max, scale, types, pool, cnt) {\n return cnt(null, [], 1000000000);\n};\n\nFeatureSourceBase.prototype.getStyleSheet = function(callback) {\n var stylesheet = new DASStylesheet();\n var defStyle = new DASStyle();\n defStyle.glyph = 'BOX';\n defStyle.BGCOLOR = 'blue';\n defStyle.FGCOLOR = 'black';\n stylesheet.pushStyle({type: 'default'}, null, defStyle);\n return callback(stylesheet);\n};\n\n\n\nfunction DASFeatureSource(dasSource) {\n this.dasSource = new DASSource(dasSource);\n this.busy = 0;\n this.activityListeners = [];\n}\n\nDASFeatureSource.prototype.addActivityListener = function(listener) {\n this.activityListeners.push(listener);\n};\n\nDASFeatureSource.prototype.removeActivityListener = function(listener) {\n var idx = arrayIndexOf(this.activityListeners, listener);\n if (idx >= 0)\n this.activityListeners.splice(idx, 1);\n};\n\n\nDASFeatureSource.prototype.notifyActivity = function() {\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nDASFeatureSource.prototype.getStyleSheet = function(callback) {\n this.dasSource.stylesheet(function(stylesheet) {\n callback(stylesheet);\n }, function() {\n callback(null, \"Couldn't fetch DAS stylesheet\");\n });\n};\n\nDASFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n if (types && types.length === 0) {\n callback(null, [], scale);\n return;\n }\n\n if (!this.dasSource.uri && !this.dasSource.features_uri) {\n // FIXME should this be making an error callback???\n return;\n }\n\n if (this.dasSource.dasStaticFeatures && this.cachedStaticFeatures) {\n return callback(null, this.cachedStaticFeatures, this.cachedStaticScale);\n }\n\n var tryMaxBins = (this.dasSource.maxbins !== false);\n var fops = {\n type: types\n };\n if (tryMaxBins) {\n fops.maxbins = 1 + (((max - min) / scale) | 0);\n }\n \n var thisB = this;\n thisB.busy++;\n thisB.notifyActivity();\n\n this.dasSource.features(\n new DASSegment(chr, min, max),\n fops,\n function(features, status) {\n \n thisB.busy--;\n thisB.notifyActivity();\n\n var retScale = scale;\n if (!tryMaxBins) {\n retScale = 0.1;\n }\n if (!status && thisB.dasSource.dasStaticFeatures) {\n thisB.cachedStaticFeatures = features;\n thisB.cachedStaticScale = retScale;\n }\n callback(status, features, retScale);\n }\n );\n};\n\nDASFeatureSource.prototype.findNextFeature = function(chr, pos, dir, callback) {\n if (this.dasSource.capabilities && arrayIndexOf(this.dasSource.capabilities, 'das1:adjacent-feature') >= 0) {\n var thisB = this;\n if (this.dasAdjLock) {\n return console.log('Already looking for a next feature, be patient!');\n }\n this.dasAdjLock = true;\n var fops = {\n adjacent: chr + ':' + (pos|0) + ':' + (dir > 0 ? 'F' : 'B')\n };\n var types = thisTier.getDesiredTypes(thisTier.browser.scale);\n if (types) {\n fops.types = types;\n }\n thisTier.dasSource.features(null, fops, function(res) {\n thisB.dasAdjLock = false;\n if (res.length > 0 && res[0] !== null) {\n callback(res[0]);\n }\n });\n }\n};\n\nfunction DASSequenceSource(dasSource) {\n this.dasSource = new DASSource(dasSource);\n this.awaitedEntryPoints = new Awaited();\n\n var thisB = this;\n this.dasSource.entryPoints(\n function(ep) {\n thisB.awaitedEntryPoints.provide(ep);\n });\n}\n\n\nDASSequenceSource.prototype.fetch = function(chr, min, max, pool, callback) {\n this.dasSource.sequence(\n new DASSegment(chr, min, max),\n function(seqs) {\n if (seqs.length == 1) {\n return callback(null, seqs[0]);\n } else {\n return callback(\"Didn't get sequence\");\n }\n }\n );\n};\n\nDASSequenceSource.prototype.getSeqInfo = function(chr, cnt) {\n this.awaitedEntryPoints.await(function(ep) {\n for (var epi = 0; epi < ep.length; ++epi) {\n if (ep[epi].name == chr) {\n return cnt({length: ep[epi].end});\n }\n }\n return cnt();\n });\n};\n \n\nfunction TwoBitSequenceSource(source) {\n var thisB = this;\n this.source = source;\n this.twoBit = new Awaited();\n var data;\n if (source.twoBitURI) {\n data = new URLFetchable(source.twoBitURI, {credentials: source.credentials, resolver: source.resolver});\n } else if (source.twoBitBlob) {\n data = new BlobFetchable(source.twoBitBlob);\n } else {\n throw Error(\"No twoBitURI or twoBitBlob parameter\");\n }\n\n makeTwoBit(data, function(tb, error) {\n if (error) {\n console.log(error);\n } else {\n thisB.twoBit.provide(tb);\n }\n });\n}\n\nTwoBitSequenceSource.prototype.fetch = function(chr, min, max, pool, callback) {\n this.twoBit.await(function(tb) {\n tb.fetch(chr, min, max,\n function(seq, err) {\n if (err) {\n return callback(err, null);\n } else {\n var sequence = new DASSequence(chr, min, max, 'DNA', seq);\n return callback(null, sequence);\n }\n });\n });\n};\n\nTwoBitSequenceSource.prototype.getSeqInfo = function(chr, cnt) {\n this.twoBit.await(function(tb) {\n var seq = tb.getSeq(chr);\n if (seq) {\n tb.getSeq(chr).length(function(l) {\n cnt({length: l});\n });\n } else {\n cnt();\n }\n });\n};\n\nfunction EnsemblSequenceSource(source) {\n this.source = source;\n // http://data.gramene.org/ensembl/info/assembly/triticum_aestivum/2B?content-type=application/json\n // http://data.gramene.org/ensembl/sequence/region/triticum_aestivum/2B:8001..18000:1?content-type=application/json\n}\n\nEnsemblSequenceSource.prototype.fetch = function(chr, min, max, pool, callback) {\n var url = this.source.ensemblURI + '/sequence/region/' + this.source.species + '/' +\n chr + ':' + min + '..' + max + ':1?content-type=application/json';\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n var jr;\n if (req.status >= 300) {\n var err = 'Error code ' + req.status;\n try {\n jr = JSON.parse(req.response);\n if (jr.error) {\n err = jr.error;\n }\n } finally {\n callback(err, null);\n }\n } else {\n jr = JSON.parse(req.response);\n var sequence = new DASSequence(chr, min, max, 'DNA', jr.seq);\n return callback(null, sequence);\n }\n }\n };\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\nEnsemblSequenceSource.prototype.getSeqInfo = function(chr, cnt) {\n var url = this.source.ensemblURI + '/info/assembly/' + this.source.species + '/' + chr + '?content-type=application/json';\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status >= 300) {\n cnt();\n } else {\n var jr = JSON.parse(req.response);\n cnt(jr);\n }\n }\n };\n req.open('GET', url, true);\n req.responseType = 'text';\n req.send();\n};\n\nDASFeatureSource.prototype.getScales = function() {\n return [];\n};\n\nvar bwg_preflights = {};\n\nfunction BWGFeatureSource(bwgSource) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.readiness = 'Connecting';\n this.bwgSource = this.opts = bwgSource; \n thisB.bwgHolder = new Awaited();\n\n if (this.opts.preflight) {\n var pfs = bwg_preflights[this.opts.preflight];\n if (!pfs) {\n pfs = new Awaited();\n bwg_preflights[this.opts.preflight] = pfs;\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status == 200) {\n pfs.provide('success');\n } else {\n pfs.provide('failure');\n }\n }\n };\n req.open('get', this.opts.preflight + '?' + hex_sha1('salt' + Date.now()), true); // Instead, ensure we always preflight a unique URI.\n if (this.opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n }\n pfs.await(function(status) {\n if (status === 'success') {\n thisB.init();\n }\n });\n } else {\n thisB.init();\n }\n}\n\nBWGFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nBWGFeatureSource.prototype.init = function() {\n var thisB = this;\n var arg;\n\n var uri = this.bwgSource.uri || this.bwgSource.bwgURI;\n if (uri) {\n if (this.bwgSource.transport === 'encode') {\n arg = new EncodeFetchable(uri, {credentials: this.opts.credentials});\n } else {\n arg = new URLFetchable(uri, {credentials: this.opts.credentials, resolver: this.opts.resolver});\n }\n } else {\n arg = new BlobFetchable(this.bwgSource.bwgBlob);\n }\n\n makeBwg(arg, function(bwg, err) {\n if (err) {\n thisB.error = err;\n thisB.readiness = null;\n thisB.notifyReadiness();\n thisB.bwgHolder.provide(null);\n } else {\n thisB.bwgHolder.provide(bwg);\n thisB.readiness = null;\n thisB.notifyReadiness();\n if (bwg.type == 'bigbed') {\n bwg.getExtraIndices(function(ei) {\n thisB.extraIndices = ei;\n });\n }\n }\n });\n};\n\nBWGFeatureSource.prototype.capabilities = function() {\n var caps = {leap: true};\n if (this.bwgHolder.res && this.bwgHolder.res.type == 'bigwig')\n caps.quantLeap = true;\n if (this.extraIndices && this.extraIndices.length > 0) {\n caps.search = [];\n for (var eii = 0; eii < this.extraIndices.length; ++eii) {\n caps.search.push(this.extraIndices[eii].field);\n }\n }\n return caps;\n};\n\nBWGFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n this.bwgHolder.await(function(bwg) {\n if (typeof bwg === 'undefined' || bwg === null) {\n return callback(thisB.error || \"Can't access binary file\", null, null);\n }\n\n var data;\n var wantDensity = !types || types.length === 0 || arrayIndexOf(types, 'density') >= 0;\n if (thisB.opts.clientBin) {\n wantDensity = false;\n }\n var scaleFactor = thisB.opts.scaleFactor || 1.0;\n if (bwg.type == 'bigwig' || wantDensity || (typeof thisB.opts.forceReduction !== 'undefined')) {\n var zoom = -1;\n for (var z = 0; z < bwg.zoomLevels.length; ++z) {\n if (bwg.zoomLevels[z].reduction <= (scale * scaleFactor)) {\n zoom = z;\n } else {\n break;\n }\n }\n if (typeof thisB.opts.forceReduction !== 'undefined') {\n zoom = thisB.opts.forceReduction;\n }\n\n if (zoom < 0) {\n data = bwg.getUnzoomedView();\n } else {\n data = bwg.getZoomedView(zoom);\n }\n } else {\n data = bwg.getUnzoomedView();\n }\n \n thisB.busy++;\n thisB.notifyActivity();\n data.readWigData(chr, min, max, function(features) {\n thisB.busy--;\n thisB.notifyActivity();\n\n var fs = 1000000000;\n if (bwg.type === 'bigwig') {\n var is = (max - min) / features.length / 2;\n if (is < fs) {\n fs = is;\n }\n }\n if (thisB.opts.link) {\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.label) {\n f.links = [new DASLink('Link', thisB.opts.link.replace(/\\$\\$/, f.label))];\n }\n }\n }\n callback(null, features, fs);\n });\n });\n};\n\nBWGFeatureSource.prototype.quantFindNextFeature = function(chr, pos, dir, threshold, callback) {\n // var beforeQFNF = Date.now()|0;\n var thisB = this;\n thisB.busy++;\n thisB.notifyActivity();\n this.bwgHolder.res.thresholdSearch(chr, pos, dir, threshold, function(a, b) {\n thisB.busy--;\n thisB.notifyActivity();\n // var afterQFNF = Date.now()|0;\n // console.log('QFNF took ' + (afterQFNF - beforeQFNF) + 'ms');\n return callback(a, b);\n });\n};\n\nBWGFeatureSource.prototype.findNextFeature = function(chr, pos, dir, callback) {\n var thisB = this;\n thisB.busy++;\n thisB.notifyActivity();\n this.bwgHolder.res.getUnzoomedView().getFirstAdjacent(chr, pos, dir, function(res) {\n thisB.busy--;\n thisB.notifyActivity();\n if (res.length > 0 && res[0] !== null) {\n callback(res[0]);\n }\n });\n};\n\nBWGFeatureSource.prototype.getScales = function() {\n var bwg = this.bwgHolder.res;\n if (bwg /* && bwg.type == 'bigwig' */) {\n var scales = [1]; // Can we be smarter about inferring baseline scale?\n for (var z = 0; z < bwg.zoomLevels.length; ++z) {\n scales.push(bwg.zoomLevels[z].reduction);\n }\n return scales;\n } else {\n return null;\n }\n};\n\nBWGFeatureSource.prototype.search = function(query, callback) {\n if (!this.extraIndices || this.extraIndices.length === 0) {\n return callback(null, 'No indices available');\n }\n\n var index = this.extraIndices[0];\n return index.lookup(query, callback);\n};\n\nBWGFeatureSource.prototype.getDefaultFIPs = function(callback) {\n if (this.opts.noExtraFeatureInfo)\n return true;\n\n this.bwgHolder.await(function(bwg) {\n if (!bwg) return;\n\n if (bwg.schema && bwg.definedFieldCount < bwg.schema.fields.length) {\n var fip = function(feature, featureInfo) {\n for (var hi = 0; hi < featureInfo.hit.length; ++hi) {\n if (featureInfo.hit[hi].isSuperGroup)\n return;\n }\n for (var fi = bwg.definedFieldCount; fi < bwg.schema.fields.length; ++fi) {\n var f = bwg.schema.fields[fi];\n featureInfo.add(f.comment, feature[f.name]);\n }\n };\n\n callback(fip);\n } else {\n // No need to do anything.\n }\n });\n};\n\nBWGFeatureSource.prototype.getStyleSheet = function(callback) {\n var thisB = this;\n\n this.bwgHolder.await(function(bwg) {\n if (!bwg) {\n return callback(null, 'bbi error');\n }\n\n var stylesheet = new DASStylesheet();\n if (bwg.type == 'bigbed') {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'bigbed'}, null, wigStyle);\n \n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'red';\n wigStyle.HEIGHT = 10;\n wigStyle.BUMP = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'translation'}, null, wigStyle);\n \n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({type: 'transcript'}, null, tsStyle);\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'white';\n densStyle.COLOR2 = 'black';\n densStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'density'}, null, densStyle);\n } else {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'HISTOGRAM';\n wigStyle.COLOR1 = 'white';\n wigStyle.COLOR2 = 'black';\n wigStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n }\n\n if (bwg.definedFieldCount == 12 && bwg.fieldCount >= 14) {\n stylesheet.geneHint = true;\n }\n\n return callback(stylesheet);\n });\n};\n\nfunction RemoteBWGFeatureSource(bwgSource, worker, browser) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.worker = worker;\n this.readiness = 'Connecting';\n this.bwgSource = this.opts = bwgSource;\n this.keyHolder = new Awaited();\n\n if (bwgSource.resolver) {\n this.resolverKey = browser.registerResolver(bwgSource.resolver);\n }\n\n this.init();\n}\n\nRemoteBWGFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nRemoteBWGFeatureSource.prototype.init = function() {\n var thisB = this;\n var uri = this.uri || this.bwgSource.uri || this.bwgSource.bwgURI;\n var blob = this.bwgSource.blob || this.bwgSource.bwgBlob;\n\n var cnt = function(key, err) {\n thisB.readiness = null;\n thisB.notifyReadiness();\n\n if (key) {\n thisB.worker.postCommand({command: 'meta', connection: key}, function(meta, err) {\n if (err) {\n thisB.error = err;\n thisB.keyHolder.provide(null);\n } else {\n thisB.meta = meta;\n thisB.keyHolder.provide(key);\n }\n });\n } else {\n thisB.error = err;\n thisB.keyHolder.provide(null);\n }\n };\n\n if (blob) {\n this.worker.postCommand({command: 'connectBBI', blob: blob}, cnt);\n } else {\n this.worker.postCommand({\n command: 'connectBBI', \n uri: resolveUrlToPage(uri), \n resolver: this.resolverKey,\n transport: this.bwgSource.transport,\n credentials: this.bwgSource.credentials}, \n cnt); \n }\n};\n\nRemoteBWGFeatureSource.prototype.capabilities = function() {\n var caps = {leap: true};\n\n if (this.meta && this.meta.type == 'bigwig')\n caps.quantLeap = true;\n if (this.meta && this.meta.extraIndices && this.meta.extraIndices.length > 0) {\n caps.search = [];\n for (var eii = 0; eii < this.meta.extraIndices.length; ++eii) {\n caps.search.push(this.meta.extraIndices[eii].field);\n }\n }\n return caps;\n};\n\nRemoteBWGFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.keyHolder.await(function(key) {\n if (!key) {\n thisB.busy--;\n thisB.notifyActivity();\n return callback(thisB.error || \"Can't access binary file\", null, null);\n }\n\n var zoom = -1;\n var wantDensity = !types || types.length === 0 || arrayIndexOf(types, 'density') >= 0;\n if (thisB.opts.clientBin) {\n wantDensity = false;\n }\n if (thisB.meta.type == 'bigwig' || wantDensity || (typeof thisB.opts.forceReduction !== 'undefined')) {\n for (var z = 1; z < thisB.meta.zoomLevels.length; ++z) {\n if (thisB.meta.zoomLevels[z] <= scale) {\n zoom = z - 1; // Scales returned in metadata start at 1, unlike \"real\" zoom levels.\n } else {\n break;\n }\n }\n if (typeof thisB.opts.forceReduction !== 'undefined') {\n zoom = thisB.opts.forceReduction;\n }\n }\n \n thisB.worker.postCommand({command: 'fetch', connection: key, chr: chr, min: min, max: max, zoom: zoom}, function(features, error) {\n thisB.busy--;\n thisB.notifyActivity();\n\n var fs = 1000000000;\n if (thisB.meta.type === 'bigwig') {\n var is = (max - min) / features.length / 2;\n if (is < fs) {\n fs = is;\n }\n } \n if (thisB.opts.link) {\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n if (f.label) {\n f.links = [new DASLink('Link', thisB.opts.link.replace(/\\$\\$/, f.label))];\n }\n }\n } \n callback(error, features, fs);\n });\n });\n};\n\n\nRemoteBWGFeatureSource.prototype.quantFindNextFeature = function(chr, pos, dir, threshold, callback) {\n var thisB = this;\n this.busy++;\n this.notifyActivity();\n this.worker.postCommand({command: 'quantLeap', connection: this.keyHolder.res, chr: chr, pos: pos, dir: dir, threshold: threshold, under: false}, function(result, err) {\n console.log(result, err);\n thisB.busy--;\n thisB.notifyActivity();\n return callback(result, err);\n });\n};\n\nRemoteBWGFeatureSource.prototype.findNextFeature = function(chr, pos, dir, callback) {\n var thisB = this;\n this.busy++;\n this.notifyActivity();\n this.worker.postCommand({command: 'leap', connection: this.keyHolder.res, chr: chr, pos: pos, dir: dir}, function(result, err) {\n thisB.busy--;\n thisB.notifyActivity();\n if (result.length > 0 && result[0] !== null) {\n callback(result[0]);\n }\n });\n};\n\nRemoteBWGFeatureSource.prototype.getScales = function() {\n var meta = this.meta;\n if (meta) {\n return meta.zoomLevels;\n } else {\n return null;\n }\n};\n\nRemoteBWGFeatureSource.prototype.search = function(query, callback) {\n if (!this.meta.extraIndices || this.meta.extraIndices.length === 0) {\n return callback(null, 'No indices available');\n }\n\n var thisB = this;\n this.busy++;\n this.notifyActivity();\n var index = this.meta.extraIndices[0];\n this.worker.postCommand({command: 'search', connection: this.keyHolder.res, query: query, index: index}, function(result, err) {\n thisB.busy--;\n thisB.notifyActivity();\n\n callback(result, err);\n });\n};\n\nRemoteBWGFeatureSource.prototype.getDefaultFIPs = function(callback) {\n if (this.opts.noExtraFeatureInfo)\n return true;\n\n var thisB = this;\n this.keyHolder.await(function(key) {\n var bwg = thisB.meta;\n if (!bwg) return;\n\n if (bwg.schema && bwg.definedFieldCount < bwg.schema.fields.length) {\n var fip = function(feature, featureInfo) {\n for (var hi = 0; hi < featureInfo.hit.length; ++hi) {\n if (featureInfo.hit[hi].isSuperGroup)\n return;\n }\n for (var fi = bwg.definedFieldCount; fi < bwg.schema.fields.length; ++fi) {\n var f = bwg.schema.fields[fi];\n featureInfo.add(f.comment, feature[f.name]);\n }\n };\n\n callback(fip);\n } else {\n // No need to do anything.\n }\n });\n};\n\nRemoteBWGFeatureSource.prototype.getStyleSheet = function(callback) {\n var thisB = this;\n\n this.keyHolder.await(function(key) {\n var bwg = thisB.meta;\n if (!bwg) {\n return callback(null, 'bbi error');\n } \n\n var stylesheet = new DASStylesheet();\n if (bwg.type == 'bigbed') {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'bigbed'}, null, wigStyle);\n \n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'red';\n wigStyle.HEIGHT = 10;\n wigStyle.BUMP = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'translation'}, null, wigStyle);\n \n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({type: 'transcript'}, null, tsStyle);\n\n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'white';\n densStyle.COLOR2 = 'black';\n densStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'density'}, null, densStyle);\n } else {\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'HISTOGRAM';\n wigStyle.COLOR1 = 'white';\n wigStyle.COLOR2 = 'black';\n wigStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n }\n\n\n if (bwg.definedFieldCount == 12 && bwg.fieldCount >= 14) {\n stylesheet.geneHint = true;\n } \n\n return callback(stylesheet);\n });\n};\n\nfunction bamRecordToFeature(r, group) {\n if (r.flag & BamFlags.SEGMENT_UNMAPPED)\n return; \n \n var len;\n if (r.seq)\n len = r.seq.length;\n else \n len = r.seqLength;\n \n if (r.cigar) {\n len = 0;\n var ops = parseCigar(r.cigar);\n for (var ci = 0; ci < ops.length; ++ci) {\n var co = ops[ci];\n if (co.op == 'M' || co.op == 'D')\n len += co.cnt;\n }\n }\n\n var f = new DASFeature();\n f.min = r.pos + 1;\n f.max = r.pos + len;\n f.segment = r.segment;\n f.type = 'bam';\n f.id = r.readName;\n f.notes = [/* 'Sequence=' + r.seq, 'CIGAR=' + r.cigar, */ 'MQ=' + r.mq];\n f.cigar = r.cigar;\n f.seq = r.seq;\n f.quals = r.quals;\n f.orientation = (r.flag & BamFlags.REVERSE_COMPLEMENT) ? '-' : '+';\n f.bamRecord = r;\n\n if (group && (r.flag & BamFlags.MULTIPLE_SEGMENTS)) {\n f.groups = [{id: r.readName, \n type: 'readpair'}];\n }\n\n return f;\n}\n\nfunction BAMFeatureSource(bamSource) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.bamSource = bamSource;\n this.opts = {credentials: bamSource.credentials, preflight: bamSource.preflight, bamGroup: bamSource.bamGroup};\n this.bamHolder = new Awaited();\n \n if (this.opts.preflight) {\n var pfs = bwg_preflights[this.opts.preflight];\n if (!pfs) {\n pfs = new Awaited();\n bwg_preflights[this.opts.preflight] = pfs;\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n if (req.readyState == 4) {\n if (req.status == 200) {\n pfs.provide('success');\n } else {\n pfs.provide('failure');\n }\n }\n };\n // req.setRequestHeader('cache-control', 'no-cache'); /* Doesn't work, not an allowed request header in CORS */\n req.open('get', this.opts.preflight + '?' + hex_sha1('salt' + Date.now()), true); // Instead, ensure we always preflight a unique URI.\n if (this.opts.credentials) {\n req.withCredentials = 'true';\n }\n req.send();\n }\n pfs.await(function(status) {\n if (status === 'success') {\n thisB.init();\n }\n });\n } else {\n thisB.init();\n }\n}\n\nBAMFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nBAMFeatureSource.prototype.init = function() {\n var thisB = this;\n var bamF, baiF;\n if (this.bamSource.bamBlob) {\n bamF = new BlobFetchable(this.bamSource.bamBlob);\n baiF = new BlobFetchable(this.bamSource.baiBlob);\n } else {\n bamF = new URLFetchable(this.bamSource.bamURI, {credentials: this.opts.credentials, resolver: this.opts.resolver});\n baiF = new URLFetchable(this.bamSource.baiURI || (this.bamSource.bamURI + '.bai'), \n {credentials: this.opts.credentials, resolver: this.opts.resolver});\n }\n makeBam(bamF, baiF, null, function(bam, err) {\n thisB.readiness = null;\n thisB.notifyReadiness();\n\n if (bam) {\n thisB.bamHolder.provide(bam);\n } else {\n thisB.error = err;\n thisB.bamHolder.provide(null);\n }\n });\n};\n\nBAMFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var light = types && (types.length == 1) && (types[0] == 'density');\n\n var thisB = this;\n \n thisB.busy++;\n thisB.notifyActivity();\n \n this.bamHolder.await(function(bam) {\n if (!bam) {\n thisB.busy--;\n thisB.notifyActivity();\n return callback(thisB.error || \"Couldn't fetch BAM\");\n }\n\n bam.fetch(chr, min, max, function(bamRecords, error) {\n thisB.busy--;\n thisB.notifyActivity();\n\n if (error) {\n callback(error, null, null);\n } else {\n var features = [];\n for (var ri = 0; ri < bamRecords.length; ++ri) {\n var r = bamRecords[ri];\n\n var f = bamRecordToFeature(r, thisB.opts.bamGroup);\n if (f)\n features.push(f);\n }\n callback(null, features, 1000000000);\n }\n }, {light: light});\n });\n};\n\nBAMFeatureSource.prototype.getScales = function() {\n return 1000000000;\n};\n\nBAMFeatureSource.prototype.getStyleSheet = function(callback) {\n this.bamHolder.await(function(bam) {\n var stylesheet = new DASStylesheet();\n \n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'black';\n densStyle.COLOR2 = 'red';\n densStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'density'}, 'low', densStyle);\n stylesheet.pushStyle({type: 'density'}, 'medium', densStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = '__SEQUENCE';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = false;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'bam'}, 'high', wigStyle);\n\n return callback(stylesheet);\n });\n};\n\n\nfunction RemoteBAMFeatureSource(bamSource, worker) {\n FeatureSourceBase.call(this);\n\n var thisB = this;\n this.bamSource = bamSource;\n this.worker = worker;\n this.opts = {credentials: bamSource.credentials, preflight: bamSource.preflight, bamGroup: bamSource.bamGroup};\n this.keyHolder = new Awaited();\n \n if (bamSource.resolver) {\n this.resolverKey = browser.registerResolver(bamSource.resolver);\n }\n\n this.init();\n}\n\nRemoteBAMFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nRemoteBAMFeatureSource.prototype.init = function() { var thisB = this;\n var uri = this.bamSource.uri || this.bamSource.bamURI;\n var indexUri = this.bamSource.indexUri || this.bamSource.baiURI || uri + '.bai';\n\n var blob = this.bamSource.bamBlob || this.bamSource.blob;\n var indexBlob = this.bamSource.baiBlob || this.bamSource.indexBlob;\n\n var cnt = function(result, err) {\n thisB.readiness = null;\n thisB.notifyReadiness();\n\n if (result) {\n thisB.keyHolder.provide(result);\n } else {\n thisB.error = err;\n thisB.keyHolder.provide(null);\n }\n };\n\n if (blob) {\n this.worker.postCommand({command: 'connectBAM', blob: blob, indexBlob: indexBlob}, cnt);\n } else {\n this.worker.postCommand({\n command: 'connectBAM', \n uri: resolveUrlToPage(uri), \n resolver: this.resolverKey,\n indexUri: resolveUrlToPage(indexUri),\n credentials: this.bamSource.credentials,\n indexChunks: this.bamSource.indexChunks},\n cnt); \n }\n};\n\nRemoteBAMFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var light = types && (types.length == 1) && (types[0] == 'density');\n var thisB = this;\n \n thisB.busy++;\n thisB.notifyActivity();\n \n this.keyHolder.await(function(key) {\n if (!key) {\n thisB.busy--;\n thisB.notifyActivity();\n return callback(thisB.error || \"Couldn't fetch BAM\");\n }\n\n thisB.worker.postCommand({command: 'fetch', connection: key, chr: chr, min: min, max: max, opts: {light: light}}, function(bamRecords, error) {\n // console.log('retrieved ' + bamRecords.length + ' via worker.');\n\n thisB.busy--;\n thisB.notifyActivity();\n\n if (error) {\n callback(error, null, null);\n } else {\n var features = [];\n for (var ri = 0; ri < bamRecords.length; ++ri) {\n var r = bamRecords[ri];\n var f = bamRecordToFeature(r, thisB.opts.bamGroup);\n if (f)\n features.push(f);\n }\n callback(null, features, 1000000000);\n }\n });\n });\n};\n\nRemoteBAMFeatureSource.prototype.getScales = function() {\n return 1000000000;\n};\n\nRemoteBAMFeatureSource.prototype.getStyleSheet = function(callback) {\n this.keyHolder.await(function(bam) {\n var stylesheet = new DASStylesheet();\n \n var densStyle = new DASStyle();\n densStyle.glyph = 'HISTOGRAM';\n densStyle.COLOR1 = 'black';\n densStyle.COLOR2 = 'red';\n densStyle.HEIGHT=30;\n stylesheet.pushStyle({type: 'density'}, 'low', densStyle);\n stylesheet.pushStyle({type: 'density'}, 'medium', densStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = '__SEQUENCE';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'blue';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = false;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'bam'}, 'high', wigStyle);\n return callback(stylesheet);\n });\n};\n\n\nfunction MappedFeatureSource(source, mapping) {\n this.source = source;\n this.mapping = mapping;\n \n this.activityListeners = [];\n this.busy = 0;\n}\n\nMappedFeatureSource.prototype.addActivityListener = function(listener) {\n this.activityListeners.push(listener);\n};\n\nMappedFeatureSource.prototype.removeActivityListener = function(listener) {\n var idx = arrayIndexOf(this.activityListeners, listener);\n if (idx >= 0)\n this.activityListeners.splice(idx, 0);\n};\n\nMappedFeatureSource.prototype.notifyActivity = function() {\n for (var li = 0; li < this.activityListeners.length; ++li) {\n try {\n this.activityListeners[li](this.busy);\n } catch (e) {\n console.log(e);\n }\n }\n};\n\nMappedFeatureSource.prototype.getStyleSheet = function(callback) {\n return this.source.getStyleSheet(callback);\n};\n\nMappedFeatureSource.prototype.getScales = function() {\n return this.source.getScales();\n};\n\nMappedFeatureSource.prototype.getDefaultFIPs = function(callback) {\n if (this.source.getDefaultFIPs)\n return this.source.getDefaultFIPs(callback);\n};\n\nMappedFeatureSource.prototype.simplifySegments = function(segs, minGap) {\n if (segs.length === 0) return segs;\n\n segs.sort(function(s1, s2) {\n var d = s1.name - s2.name;\n if (d)\n return d;\n d = s1.start - s2.start;\n if (d)\n return d;\n return s1.end - s2.end; // Should never come to this...?\n });\n\n var ssegs = [];\n var currentSeg = segs[0];\n for (var si = 0; si < segs.length; ++si) {\n var ns = segs[si];\n\n // console.log(ns.name + ' ' + ns.start + ' ' + ns.end);\n if (ns.name != currentSeg.name || ns.start > (currentSeg.end + minGap)) {\n ssegs.push(currentSeg);\n currentSeg = ns;\n } else {\n currentSeg = new DASSegment(currentSeg.name, Math.min(currentSeg.start, ns.start), Math.max(currentSeg.end, ns.end));\n }\n }\n ssegs.push(currentSeg);\n return ssegs;\n};\n\nMappedFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback, styleFilters) {\n var thisB = this;\n var fetchLength = max - min + 1;\n\n thisB.busy++;\n thisB.notifyActivity();\n\n this.mapping.sourceBlocksForRange(chr, min, max, function(mseg) {\n if (mseg.length === 0) {\n thisB.busy--;\n thisB.notifyActivity();\n\n callback(\"No mapping available for this regions\", [], scale);\n } else {\n mseg = thisB.simplifySegments(mseg, Math.max(100, 0.05 * fetchLength));\n\n var mappedFeatures = [];\n var mappedLoc = null;\n var count = mseg.length;\n var finalStatus;\n\n mseg.map(function(seg) {\n thisB.source.fetch(seg.name, seg.start, seg.end, scale, types, pool, function(status, features, fscale) {\n if (status && !finalStatus)\n finalStatus = status;\n\n if (features) {\n for (var fi = 0; fi < features.length; ++fi) {\n var f = features[fi];\n var sn = f.segment;\n if (sn.indexOf('chr') === 0) {\n sn = sn.substr(3);\n }\n\n var mappings = thisB.mapping.mapSegment(sn, f.min, f.max);\n\n if (mappings.length === 0) {\n if (f.parts && f.parts.length > 0) {\n mappedFeatures.push(f);\n }\n } else {\n for (var mi = 0; mi < mappings.length; ++mi) {\n var m = mappings[mi];\n var mf = shallowCopy(f);\n mf.segment = m.segment;\n mf.min = m.min;\n mf.max = m.max;\n if (m.partialMin)\n mf.partialMin = m.partialMin;\n if (m.partialMax)\n mf.partialMax = m.partialMax;\n\n if (m.flipped) {\n if (f.orientation == '-') {\n mf.orientation = '+';\n } else if (f.orientation == '+') {\n mf.orientation = '-';\n }\n }\n mappedFeatures.push(mf);\n }\n }\n }\n }\n\n var m1 = thisB.mapping.mapPoint(seg.name, seg.start);\n var m2 = thisB.mapping.mapPoint(seg.name, seg.end);\n\n if (m1 && m2) {\n var segDestCoverage = new Range(m1.pos, m2.pos);\n if (mappedLoc)\n mappedLoc = union(mappedLoc, segDestCoverage);\n else\n mappedLoc = segDestCoverage;\n }\n\n --count;\n if (count === 0) {\n thisB.busy--;\n thisB.notifyActivity();\n callback(finalStatus, mappedFeatures, fscale, mappedLoc);\n }\n }, styleFilters);\n });\n }\n });\n};\n\nfunction DummyFeatureSource() {\n}\n\nDummyFeatureSource.prototype.getScales = function() {\n return null;\n};\n\nDummyFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, cnt) {\n return cnt(null, [], 1000000000);\n};\n\nDummyFeatureSource.prototype.getStyleSheet = function(callback) {\n var stylesheet = new DASStylesheet();\n var defStyle = new DASStyle();\n defStyle.glyph = 'BOX';\n defStyle.BGCOLOR = 'blue';\n defStyle.FGCOLOR = 'black';\n stylesheet.pushStyle({type: 'default'}, null, defStyle);\n return callback(stylesheet);\n};\n\nfunction DummySequenceSource() {\n}\n\nDummySequenceSource.prototype.fetch = function(chr, min, max, pool, cnt) {\n return cnt(null, null);\n};\n\nfunction JBrowseFeatureSource(source) {\n this.store = new JBrowseStore(source.jbURI, source.jbQuery);\n}\n\nJBrowseFeatureSource.prototype.getScales = function() {\n return null;\n};\n\nJBrowseFeatureSource.prototype.getStyleSheet = function(callback) {\n var stylesheet = new DASStylesheet();\n \n var cdsStyle = new DASStyle();\n cdsStyle.glyph = 'BOX';\n cdsStyle.FGCOLOR = 'black';\n cdsStyle.BGCOLOR = 'red';\n cdsStyle.HEIGHT = 10;\n cdsStyle.BUMP = true;\n cdsStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'translation'}, null, cdsStyle);\n \n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({type: 'transcript'}, null, tsStyle);\n\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = 'green';\n wigStyle.HEIGHT = 8;\n wigStyle.BUMP = true;\n wigStyle.LABEL = true;\n wigStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n\n return callback(stylesheet);\n};\n\nJBrowseFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n if (types && types.length === 0) {\n callback(null, [], scale);\n return;\n }\n \n var fops = {};\n\n this.store.features(\n new DASSegment(chr, min, max),\n fops,\n function(features, status) {\n callback(status, features, 100000);\n }\n );\n};\n\nBrowser.prototype.sourceAdapterIsCapable = function(s, cap) {\n if (!s.capabilities)\n return false;\n else return s.capabilities()[cap];\n};\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n FeatureSourceBase: FeatureSourceBase,\n\n TwoBitSequenceSource: TwoBitSequenceSource,\n EnsemblSequenceSource: EnsemblSequenceSource,\n DASSequenceSource: DASSequenceSource,\n MappedFeatureSource: MappedFeatureSource,\n CachingFeatureSource: CachingFeatureSource,\n BWGFeatureSource: BWGFeatureSource,\n RemoteBWGFeatureSource: RemoteBWGFeatureSource,\n BAMFeatureSource: BAMFeatureSource,\n RemoteBAMFeatureSource: RemoteBAMFeatureSource,\n DummyFeatureSource: DummyFeatureSource,\n DummySequenceSource: DummySequenceSource,\n\n registerSourceAdapterFactory: dalliance_registerSourceAdapterFactory,\n registerParserFactory: dalliance_registerParserFactory,\n makeParser: dalliance_makeParser\n };\n\n // Standard set of plugins.\n require('./ensembljson');\n //---START MOLGENIS CUSTOM CODE---\n require('./molgenisjson');\n //---END MOLGENIS CUSTOM CODE---\n require('./tabix-source');\n require('./memstore');\n require('./bedwig');\n require('./vcf');\n require('./test-source');\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2015\n//\n// sourcecompare.js\n//\n\n\nfunction sourceDataURI(conf) {\n if (conf.uri) {\n return conf.uri;\n } else if (conf.blob) {\n return 'file:' + conf.blob.name;\n } else if (conf.bwgBlob) {\n return 'file:' + conf.bwgBlob.name;\n } else if (conf.bamBlob) {\n return 'file:' + conf.bamBlob.name;\n } else if (conf.twoBitBlob) {\n return 'file:' + conf.twoBitBlob.name;\n }\n\n return conf.bwgURI || conf.bamURI || conf.jbURI || conf.twoBitURI || 'https://www.biodalliance.org/magic/no_uri';\n}\n\nfunction sourceStyleURI(conf) {\n if (conf.stylesheet_uri)\n return conf.stylesheet_uri;\n else if (conf.tier_type == 'sequence' || conf.twoBitURI || conf.twoBitBlob)\n return 'https://www.biodalliance.org/magic/sequence'\n else\n return sourceDataURI(conf);\n}\n\nfunction sourcesAreEqualModuloStyle(a, b) {\n if (sourceDataURI(a) != sourceDataURI(b))\n return false;\n\n if (a.mapping != b.mapping)\n return false;\n\n if (a.tier_type != b.tier_type)\n return false;\n\n if (a.overlay) {\n if (!b.overlay || b.overlay.length != a.overlay.length)\n return false;\n for (var oi = 0; oi < a.overlay.length; ++oi) {\n if (!sourcesAreEqualModuloStyle(a.overlay[oi], b.overlay[oi]))\n return false;\n }\n } else {\n if (b.overlay)\n return false;\n }\n\n return true;\n}\n\nfunction sourcesAreEqual(a, b) {\n if (sourceDataURI(a) != sourceDataURI(b) ||\n sourceStyleURI(a) != sourceStyleURI(b))\n return false;\n\n if (a.mapping != b.mapping)\n return false;\n\n if (a.tier_type != b.tier_type)\n return false;\n\n if (a.overlay) {\n if (!b.overlay || b.overlay.length != a.overlay.length)\n return false;\n for (var oi = 0; oi < a.overlay.length; ++oi) {\n if (!sourcesAreEqual(a.overlay[oi], b.overlay[oi]))\n return false;\n }\n } else {\n if (b.overlay)\n return false;\n }\n\n return true;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n sourcesAreEqual: sourcesAreEqual,\n sourcesAreEqualModuloStyle: sourcesAreEqualModuloStyle,\n sourceDataURI: sourceDataURI,\n sourceStyleURI: sourceStyleURI\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// spans.js: JavaScript Intset/Location port.\n//\n\n\"use strict\";\n\n\nfunction Range(min, max)\n{\n if (typeof(min) != 'number' || typeof(max) != 'number')\n throw 'Bad range ' + min + ',' + max;\n this._min = min;\n this._max = max;\n}\n\nRange.prototype.min = function() {\n return this._min;\n}\n\nRange.prototype.max = function() {\n return this._max;\n}\n\nRange.prototype.contains = function(pos) {\n return pos >= this._min && pos <= this._max;\n}\n\nRange.prototype.isContiguous = function() {\n return true;\n}\n\nRange.prototype.ranges = function() {\n return [this];\n}\n\nRange.prototype._pushRanges = function(ranges) {\n ranges.push(this);\n}\n\nRange.prototype.toString = function() {\n return '[' + this._min + '-' + this._max + ']';\n}\n\nfunction _Compound(ranges) {\n // given: a set of unsorted possibly overlapping ranges\n // sort the input ranges\n var sorted = ranges.sort(_rangeOrder);\n // merge overlaps between adjacent ranges\n var merged = [];\n var current = sorted.shift();\n sorted.forEach(function(range) {\n if (range._min <= current._max) {\n if (range._max > current._max) {\n current._max = range._max;\n }\n }\n else {\n merged.push(current);\n current = range;\n }\n });\n merged.push(current);\n this._ranges = merged;\n}\n\n_Compound.prototype.min = function() {\n return this._ranges[0].min();\n}\n\n_Compound.prototype.max = function() {\n return this._ranges[this._ranges.length - 1].max();\n}\n\n// returns the index of the first range that is not less than pos\n_Compound.prototype.lower_bound = function(pos) {\n // first check if pos is out of range\n var r = this.ranges();\n if (pos > this.max()) return r.length;\n if (pos < this.min()) return 0;\n // do a binary search\n var a=0, b=r.length - 1;\n while (a <= b) {\n var m = Math.floor((a+b)/2);\n if (pos > r[m]._max) {\n a = m+1;\n }\n else if (pos < r[m]._min) {\n b = m-1;\n }\n else {\n return m;\n }\n }\n return a;\n}\n\n_Compound.prototype.contains = function(pos) {\n var lb = this.lower_bound(pos);\n if (lb < this._ranges.length && this._ranges[lb].contains(pos)) {\n return true;\n }\n return false;\n}\n\n_Compound.prototype.insertRange = function(range) {\n var lb = this.lower_bound(range._min);\n if (lb === this._ranges.length) { // range follows this\n this._ranges.push(range);\n return;\n }\n \n var r = this.ranges();\n if (range._max < r[lb]._min) { // range preceeds lb\n this._ranges.splice(lb,0,range);\n return;\n }\n\n // range overlaps lb (at least)\n if (r[lb]._min < range._min) range._min = r[lb]._min;\n var ub = lb+1;\n while (ub < r.length && r[ub]._min <= range._max) {\n ub++;\n }\n ub--;\n // ub is the upper bound of the new range\n if (r[ub]._max > range._max) range._max = r[ub]._max;\n \n // splice range into this._ranges\n this._ranges.splice(lb,ub-lb+1,range);\n return;\n}\n\n_Compound.prototype.isContiguous = function() {\n return this._ranges.length > 1;\n}\n\n_Compound.prototype.ranges = function() {\n return this._ranges;\n}\n\n_Compound.prototype._pushRanges = function(ranges) {\n for (var ri = 0; ri < this._ranges.length; ++ri)\n ranges.push(this._ranges[ri]);\n}\n\n_Compound.prototype.toString = function() {\n var s = '';\n for (var r = 0; r < this._ranges.length; ++r) {\n if (r>0) {\n s = s + ',';\n }\n s = s + this._ranges[r].toString();\n }\n return s;\n}\n\nfunction union(s0, s1) {\n if (! (s0 instanceof _Compound)) {\n if (! (s0 instanceof Array))\n s0 = [s0];\n s0 = new _Compound(s0);\n }\n \n if (s1)\n s0.insertRange(s1);\n\n return s0;\n}\n\nfunction intersection(s0, s1) {\n var r0 = s0.ranges();\n var r1 = s1.ranges();\n var l0 = r0.length, l1 = r1.length;\n var i0 = 0, i1 = 0;\n var or = [];\n\n while (i0 < l0 && i1 < l1) {\n var s0 = r0[i0], s1 = r1[i1];\n var lapMin = Math.max(s0.min(), s1.min());\n var lapMax = Math.min(s0.max(), s1.max());\n if (lapMax >= lapMin) {\n or.push(new Range(lapMin, lapMax));\n }\n if (s0.max() > s1.max()) {\n ++i1;\n } else {\n ++i0;\n }\n }\n \n if (or.length == 0) {\n return null; // FIXME\n } else if (or.length == 1) {\n return or[0];\n } else {\n return new _Compound(or);\n }\n}\n\nfunction coverage(s) {\n var tot = 0;\n var rl = s.ranges();\n for (var ri = 0; ri < rl.length; ++ri) {\n var r = rl[ri];\n tot += (r.max() - r.min() + 1);\n }\n return tot;\n}\n\n\n\nfunction rangeOrder(a, b)\n{\n if (a.min() < b.min()) {\n return -1;\n } else if (a.min() > b.min()) {\n return 1;\n } else if (a.max() < b.max()) {\n return -1;\n } else if (b.max() > a.max()) {\n return 1;\n } else {\n return 0;\n }\n}\n\nfunction _rangeOrder(a, b)\n{\n if (a._min < b._min) {\n return -1;\n } else if (a._min > b._min) {\n return 1;\n } else if (a._max < b._max) {\n return -1;\n } else if (b._max > a._max) {\n return 1;\n } else {\n return 0;\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n Range: Range,\n union: union,\n intersection: intersection,\n coverage: coverage,\n rangeOver: rangeOrder,\n _rangeOrder: _rangeOrder\n }\n}","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2014\n//\n// style.js\n//\n\n\"use strict\";\n\nfunction StyleFilter(type, method, label) {\n this.type = type;\n this.method = method;\n this.label = label;\n}\n\nStyleFilter.prototype.equals = function(o) {\n return this.type == o.type && this.method == o.method && this.label == o.label;\n}\n\nStyleFilter.prototype.toString = function() {\n var fs = [];\n if (this.type) \n fs.push('type=' + this.type);\n if (this.method)\n fs.push('method=' + this.method);\n if (this.label)\n fs.push('label=' + this.label);\n return 'StyleFilter<' + fs.join(';') + '>';\n}\n\nfunction StyleFilterSet(filters) {\n this._filters = {};\n if (filters) {\n for (var fi = 0; fi < filters.length; ++fi) {\n this.add(filters[fi]);\n }\n }\n}\n\nStyleFilterSet.prototype.add = function(filter) {\n var fs = filter.toString();\n if (!this._filters[fs]) {\n this._filters[fs] = filter;\n this._list = null;\n }\n}\n\nStyleFilterSet.prototype.addAll = function(filterSet) {\n var l = filterSet.list();\n for (var fi = 0; fi < l.length; ++fi) {\n this.add(l[fi]);\n }\n}\n\nStyleFilterSet.prototype.doesNotContain = function(filterSet) {\n var l = filterSet.list();\n for (var fi = 0; fi < l.length; ++fi) {\n if (!this._filters[fi.toString()])\n return true;\n }\n return false\n}\n\nStyleFilterSet.prototype.list = function() {\n if (!this._list) {\n this._list = [];\n for (var k in this._filters) {\n if (this._filters.hasOwnProperty(k)) {\n this._list.push(this._filters[k]);\n }\n }\n }\n return this._list;\n}\n\nStyleFilterSet.prototype.typeList = function() {\n var types = [];\n var list = this.list();\n for (var fi = 0; fi < list.length; ++fi) {\n var filter = list[fi];\n var type = filter.type;\n if (!type || type == 'default')\n return null;\n if (types.indexOf(type) < 0)\n types.push(type);\n }\n return types;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n StyleFilter: StyleFilter,\n StyleFilterSet: StyleFilterSet\n };\n}\n","/* jshint esversion: 6 */\n\"use strict\";\n\nexport { renderTier, drawTier };\n\n/* To be used by tiers which are to be drawn in a multitier\n using the multi-renderer.\n\n Subtiers are configured by adding the following to a tier's source configuration:\n renderer: 'sub',\n sub: {\n multi_id: \"multi_1\",\n offset: 130,\n z: 2,\n }\n This would define a subtier that's to be rendered in the multi-tier with\n id \"multi_1\", with the top of the subtier at 130 pixels and at z-index 2.\n */\n\nfunction renderTier(status, tier) {\n drawTier(tier);\n tier.updateStatus(status);\n}\n\n// drawTier is called when this tier's data has been fetched,\n// so by refreshing the multiTier from here, we can be sure that\n// there's something new worth drawing in it\nfunction drawTier(tier) {\n let browser = tier.browser;\n\n let multiTier = browser.tiers.\n filter(t => t.dasSource.renderer === 'multi' &&\n t.dasSource.multi.multi_id === tier.dasSource.sub.multi_id);\n\n multiTier.forEach(t => browser.refreshTier(t));\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// svg-export.js\n//\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var makeElementNS = utils.makeElementNS;\n\n var VERSION = require('./version');\n\n var svgSeqTier = require('./sequence-draw').svgSeqTier;\n\n var svgu = require('./svg-utils');\n var NS_SVG = svgu.NS_SVG;\n var NS_XLINK = svgu.NS_XLINK;\n var SVGPath = svgu.SVGPath;\n\n var nf = require('./numformats');\n var formatQuantLabel = nf.formatQuantLabel;\n var formatLongInt = nf.formatLongInt;\n}\n\n\nBrowser.prototype.makeSVG = function(opts) {\n opts = opts || {};\n var minTierHeight = opts.minTierHeight || 20;\n var padding = 3;\n var fpw = opts.width || this.featurePanelWidth;\n\n var backupFPW = this.featurePanelWidth;\n var backupScale = this.scale;\n this.featurePanelWidth = fpw;\n this.scale = this.featurePanelWidth / (this.viewEnd - this.viewStart);\n\n var b = this;\n var saveDoc = document.implementation.createDocument(NS_SVG, 'svg', null);\n\n var saveRoot = makeElementNS(NS_SVG, 'g', null, {\n fontFamily: 'helvetica',\n fontSize: '8pt'\n });\n saveDoc.documentElement.appendChild(saveRoot);\n\n var margin = 200;\n\n if (opts.banner) {\n var dallianceAnchor = makeElementNS(NS_SVG, 'a',\n makeElementNS(NS_SVG, 'text', 'Graphics from Biodalliance ' + VERSION, {\n x: (b.featurePanelWidth + margin) - 100,\n y: 35,\n strokeWidth: 0,\n fontSize: '12pt',\n\t textAnchor: 'end',\n\t fill: 'blue'\n }));\n dallianceAnchor.setAttribute('xmlns:xlink', NS_XLINK);\n dallianceAnchor.setAttribute('xlink:href', 'http://www.biodalliance.org/');\n\n saveRoot.appendChild(dallianceAnchor);\n }\n \n if (opts.region) {\n saveRoot.appendChild(\n makeElementNS(NS_SVG, 'text', this.chr + ':' + formatLongInt(this.viewStart) + '..' + formatLongInt(this.viewEnd), {\n x: margin + 100,\n y: 35,\n strokeWidth: 0,\n fontSize: '12pt',\n textAnchor: 'start'\n })\n );\n }\n \n var clipRect = makeElementNS(NS_SVG, 'rect', null, {\n \tx: margin,\n \ty: 50,\n \twidth: b.featurePanelWidth,\n \theight: 100000\n });\n var clip = makeElementNS(NS_SVG, 'clipPath', clipRect, {id: 'featureClip'});\n saveRoot.appendChild(clip);\n\n var pos = 70;\n var tierHolder = makeElementNS(NS_SVG, 'g', null, {});\n\n for (var ti = 0; ti < b.tiers.length; ++ti) {\n var tier = b.tiers[ti];\n tier.backupSubtiers = tier.subtiers;\n tier.backupOriginHaxx = tier.originHaxx;\n tier.backupLayoutHeight = tier.layoutHeight;\n\n const renderer = b.getTierRenderer(tier);\n if (renderer && renderer.prepareSubtiers) {\n renderer.prepareSubtiers(tier, tier.viewport.getContext('2d'));\n }\n\n var tierSVG = makeElementNS(NS_SVG, 'g', null, {clipPath: 'url(#featureClip)', clipRule: 'nonzero'});\n \tvar tierLabels = makeElementNS(NS_SVG, 'g');\n \tvar tierTopPos = pos;\n\n \tvar tierBackground = makeElementNS(NS_SVG, 'rect', null, {x: 0, y: tierTopPos, width: '10000', height: 50, fill: tier.background});\n \ttierSVG.appendChild(tierBackground);\n\n \tif (tier.sequenceSource) {\n \t var seqTrack = svgSeqTier(tier, tier.currentSequence);\n \t \n \t tierSVG.appendChild(makeElementNS(NS_SVG, 'g', seqTrack, {transform: 'translate(' + (margin) + ', ' + pos + ')'}));\n \t pos += 80;\n \t} else {\n if (!tier.subtiers) {\n \t\t continue;\n }\n \t\n \t var offset = ((tier.glyphCacheOrigin - b.viewStart) * b.scale);\n var hasQuant = false;\n for (var sti = 0; sti < tier.subtiers.length; ++sti) {\n pos += padding;\n \t\tvar subtier = tier.subtiers[sti];\n \n \t\tvar glyphElements = [];\n \t\tfor (var gi = 0; gi < subtier.glyphs.length; ++gi) {\n var glyph = subtier.glyphs[gi];\n glyphElements.push(glyph.toSVG());\n \t\t}\n\n \t\t tierSVG.appendChild(makeElementNS(NS_SVG, 'g', glyphElements, {transform: 'translate(' + (margin+offset) + ', ' + pos + ')'}));\n\n \t\tif (subtier.quant) {\n hasQuant = true;\n \t\t var q = subtier.quant;\n var h = subtier.height;\n\n var numTics = 2;\n if (h > 40) {\n numTics = 1 + ((h/20) | 0);\n }\n var ticSpacing = h / (numTics - 1);\n var ticInterval = (q.max - q.min) / (numTics - 1);\n\n \t\t var path = new SVGPath();\n \t\t path.moveTo(margin + 5, pos);\n \t\t path.lineTo(margin, pos);\n \t\t path.lineTo(margin, pos + subtier.height);\n \t\t path.lineTo(margin + 5, pos + subtier.height);\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n path.moveTo(margin, pos + ty);\n path.lineTo(margin+3, pos + ty);\n }\n\n \t\t tierLabels.appendChild(makeElementNS(NS_SVG, 'path', null, {d: path.toPathData(), fill: 'none', stroke: 'black', strokeWidth: '2px'}));\n \t\t tierLabels.appendChild(makeElementNS(NS_SVG, 'text', formatQuantLabel(q.max), {x: margin - 3, y: pos + 7, textAnchor: 'end'}));\n \t\t tierLabels.appendChild(makeElementNS(NS_SVG, 'text', formatQuantLabel(q.min), {x: margin - 3, y: pos + subtier.height, textAnchor: 'end'}));\n for (var t = 1; t < numTics-1; ++t) {\n var ty = t*ticSpacing;\n tierLabels.appendChild(makeElementNS(NS_SVG, 'text', formatQuantLabel((1.0*q.max) - (t*ticInterval)), \n {x: margin - 3, y: pos + ty + 3, textAnchor: 'end'}));\n }\n \t\t}\n\n \t\t pos += subtier.height + padding;\n }\n\n if (pos - tierTopPos < minTierHeight) {\n pos = tierTopPos + minTierHeight;\n }\n \t}\n\n var labelName;\n if (typeof tier.config.name === 'string')\n labelName = tier.config.name;\n else\n labelName = tier.dasSource.name;\n \ttierLabels.appendChild(\n \t makeElementNS(\n \t\tNS_SVG, 'text',\n \t\tlabelName,\n \t\t{x: margin - (hasQuant ? 20 : 12), y: (pos+tierTopPos+8)/2, fontSize: '10pt', textAnchor: 'end'}));\n\n \t\n \ttierBackground.setAttribute('height', pos - tierTopPos);\n \ttierHolder.appendChild(makeElementNS(NS_SVG, 'g', [tierSVG, tierLabels]));\n\n tier.subtiers = tier.backupSubtiers;\n tier.originHaxx = tier.backupOriginHaxx;\n tier.layoutHeight = tier.backupLayoutHeight;\n }\n\n if (opts.highlights) {\n var highlights = this.highlights || [];\n for (var hi = 0; hi < highlights.length; ++hi) {\n var h = highlights[hi];\n if ((h.chr == this.chr || h.chr == ('chr' + this.chr)) && h.min < this.viewEnd && h.max > this.viewStart) {\n var tmin = (Math.max(h.min, this.viewStart) - this.viewStart) * this.scale;\n var tmax = (Math.min(h.max, this.viewEnd) - this.viewStart) * this.scale;\n\n tierHolder.appendChild(makeElementNS(NS_SVG, 'rect', null, {x: margin + tmin, y: 70, width: (tmax-tmin), height: pos-70,\n stroke: 'none', fill: this.defaultHighlightFill, fillOpacity: this.defaultHighlightAlpha}));\n }\n }\n }\n\n var rulerPos = -1; \n if (opts.ruler == 'center') {\n rulerPos = margin + ((this.viewEnd - this.viewStart)*this.scale) / 2;\n } else if (opts.ruler == 'left') {\n rulerPos = margin;\n } else if (opts.ruler == 'right') {\n rulerPos = margin + ((this.viewEnd - this.viewStart)*this.scale);\n }\n if (rulerPos >= 0) {\n tierHolder.appendChild(makeElementNS(NS_SVG, 'line', null, {x1: rulerPos, y1: 70, x2: rulerPos, y2: pos,\n stroke: 'blue'}));\n }\n\n saveRoot.appendChild(tierHolder);\n saveDoc.documentElement.setAttribute('width', b.featurePanelWidth + 20 + margin);\n saveDoc.documentElement.setAttribute('height', pos + 50);\n\n \n this.featurePanelWidth = backupFPW;\n this.scale = backupScale;\n\n let svg;\n if (typeof(XMLSerializer) !== 'undefined') {\n svg = new XMLSerializer().serializeToString(saveDoc);\n } else {\n const root = saveDoc.documentElement;\n root.setAttribute('xmlns', 'http://www.w3.org/2000/svg');\n svg = root.outerHTML;\n }\n\n if (opts.output && opts.output === 'string') {\n return svg;\n } else {\n return new Blob([svg], {type: 'image/svg+xml'});\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// svg-utils.js\n//\n\nvar NS_SVG = 'http://www.w3.org/2000/svg';\nvar NS_XLINK = 'http://www.w3.org/1999/xlink';\n\nfunction SVGPath() {\n this.ops = [];\n}\n\nSVGPath.prototype.moveTo = function(x, y) {\n this.ops.push('M ' + x + ' ' + y);\n}\n\nSVGPath.prototype.lineTo = function(x, y) {\n this.ops.push('L ' + x + ' ' + y);\n}\n\nSVGPath.prototype.closePath = function() {\n this.ops.push('Z');\n}\n\nSVGPath.prototype.toPathData = function() {\n return this.ops.join(' ');\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n NS_SVG: NS_SVG,\n NS_XLINK: NS_XLINK,\n SVGPath: SVGPath\n }\n}","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// tabix-source.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerSourceAdapterFactory = sa.registerSourceAdapterFactory;\n var dalliance_makeParser = sa.makeParser;\n var FeatureSourceBase = sa.FeatureSourceBase;\n\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n\n var utils = require('./utils');\n var Awaited = utils.Awaited;\n\n var connectTabix = require('./tabix').connectTabix;\n}\n\nfunction TabixFeatureSource(source) {\n FeatureSourceBase.call(this);\n this.readiness = 'Connecting';\n this.source = source;\n\n this.tabixHolder = new Awaited();\n var thisB = this;\n\n\n var parser = dalliance_makeParser(source.payload);\n if (!parser) {\n throw 'Unsuported tabix payload ' + source.payload;\n } else {\n this.parser = parser;\n }\n\n var data, index;\n if (this.source.blob) {\n data = new BlobFetchable(this.source.blob);\n index = new BlobFetchable(this.source.indexBlob);\n } else {\n data = new URLFetchable(this.source.uri, {credentials: this.source.credentials, resolver: this.source.resolver});\n index = new URLFetchable(this.source.indexURI || (this.source.uri + '.tbi'), \n {credentials: this.source.credentials, resolver: this.source.resolver});\n }\n connectTabix(data, index, function(tabix, err) {\n thisB.tabixHolder.provide(tabix);\n tabix.fetchHeader(function(lines, err) {\n if (lines) {\n var session = parser.createSession(function() { /* Null sink because we shouldn't get records */ });\n for (var li = 0; li < lines.length; ++li) {\n session.parse(lines[li]);\n }\n session.flush();\n }\n });\n thisB.readiness = null\n thisB.notifyReadiness();\n });\n}\n\nTabixFeatureSource.prototype = Object.create(FeatureSourceBase.prototype);\n\nTabixFeatureSource.prototype.fetch = function(chr, min, max, scale, types, pool, callback) {\n var thisB = this;\n \n thisB.busy++;\n thisB.notifyActivity();\n \n this.tabixHolder.await(function(tabix) {\n tabix.fetch(chr, min, max, function(records, error) {\n thisB.busy--;\n thisB.notifyActivity();\n\n var features = [];\n var session = thisB.parser.createSession(function(f) {features.push(f)});\n for (var ri = 0; ri < records.length; ++ri) {\n var f = session.parse(records[ri]);\n }\n session.flush();\n callback(null, features, 1000000000);\n });\n });\n}\n\n\nTabixFeatureSource.prototype.getStyleSheet = function(callback) {\n if (this.parser && this.parser.getStyleSheet)\n this.parser.getStyleSheet(callback)\n}\n\nTabixFeatureSource.prototype.getDefaultFIPs = function(callback) {\n if (this.parser && this.parser.getDefaultFIPs)\n this.parser.getDefaultFIPs(callback);\n}\n\n\ndalliance_registerSourceAdapterFactory('tabix', function(source) {\n return {features: new TabixFeatureSource(source)};\n});\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2011\n//\n// tabix.js: basic support for tabix-indexed flatfiles\n//\n\n\"use strict\";\n\nvar TABIX_MAGIC = 0x01494254;\n\nif (typeof(require) !== 'undefined') {\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n\n var bin = require('./bin');\n var readInt = bin.readInt;\n var readShort = bin.readShort;\n var readByte = bin.readByte;\n var readInt64 = bin.readInt64;\n var readFloat = bin.readFloat;\n\n var lh3utils = require('./lh3utils');\n var readVob = lh3utils.readVob;\n var unbgzf = lh3utils.unbgzf;\n var reg2bins = lh3utils.reg2bins;\n var Chunk = lh3utils.Chunk;\n}\n\nfunction TabixFile() {\n}\n\nfunction connectTabix(data, tbi, callback) {\n var tabix = new TabixFile();\n tabix.data = data;\n tabix.tbi = tbi;\n\n tabix.tbi.fetch(function(header) { // Do we really need to fetch the whole thing? :-(\n if (!header) {\n return callback(null, \"Couldn't access Tabix\");\n }\n\n var unchead = unbgzf(header, header.byteLength);\n var uncba = new Uint8Array(unchead);\n var magic = readInt(uncba, 0);\n if (magic != TABIX_MAGIC) {\n return callback(null, 'Not a tabix index');\n }\n\n var nref = readInt(uncba, 4);\n tabix.format = readInt(uncba, 8);\n tabix.colSeq = readInt(uncba, 12);\n tabix.colStart = readInt(uncba, 16);\n tabix.colEnd = readInt(uncba, 20);\n tabix.meta = readInt(uncba, 24);\n tabix.skip = readInt(uncba, 28);\n var nameLength = readInt(uncba, 32);\n\n tabix.indices = [];\n\n var p = 36;\n tabix.chrToIndex = {};\n tabix.indexToChr = [];\n for (var i = 0; i < nref; ++i) {\n var name = ''\n\n while (true) {\n var ch = uncba[p++];\n if (ch == 0)\n break;\n\n name += String.fromCharCode(ch);\n }\n\n tabix.chrToIndex[name] = i;\n if (name.indexOf('chr') == 0) {\n tabix.chrToIndex[name.substring(3)] = i;\n } else {\n tabix.chrToIndex['chr' + name] = i;\n }\n tabix.indexToChr.push(name);\n }\n\n var minBlockIndex = 1000000000;\n for (var ref = 0; ref < nref; ++ref) {\n var blockStart = p;\n var nbin = readInt(uncba, p); p += 4;\n for (var b = 0; b < nbin; ++b) {\n var bin = readInt(uncba, p);\n var nchnk = readInt(uncba, p+4);\n p += 8 + (nchnk * 16);\n }\n var nintv = readInt(uncba, p); p += 4;\n \n var q = p;\n for (var i = 0; i < nintv; ++i) {\n var v = readVob(uncba, q); q += 8;\n if (v) {\n var bi = v.block;\n if (v.offset > 0)\n bi += 65536;\n\n if (bi < minBlockIndex)\n minBlockIndex = bi;\n break;\n }\n }\n p += (nintv * 8);\n\n\n var ub = uncba;\n if (nbin > 0) {\n tabix.indices[ref] = new Uint8Array(unchead, blockStart, p - blockStart);\n } \n }\n\n tabix.headerMax = minBlockIndex;\n\n callback(tabix);\n }, {timeout: 50000});\n}\n\n// Copy-paste from BamFile\n\nTabixFile.prototype.blocksForRange = function(refId, min, max) {\n var index = this.indices[refId];\n if (!index) {\n return [];\n }\n\n var intBinsL = reg2bins(min, max);\n var intBins = [];\n for (var i = 0; i < intBinsL.length; ++i) {\n intBins[intBinsL[i]] = true;\n }\n var leafChunks = [], otherChunks = [];\n\n var nbin = readInt(index, 0);\n var p = 4;\n for (var b = 0; b < nbin; ++b) {\n var bin = readInt(index, p);\n var nchnk = readInt(index, p+4);\n p += 8;\n if (intBins[bin]) {\n for (var c = 0; c < nchnk; ++c) {\n var cs = readVob(index, p, true);\n var ce = readVob(index, p + 8, true);\n (bin < 4681 ? otherChunks : leafChunks).push(new Chunk(cs, ce));\n p += 16;\n }\n } else {\n p += (nchnk * 16);\n }\n }\n\n var nintv = readInt(index, p);\n var lowest = null;\n var minLin = Math.min(min>>14, nintv - 1), maxLin = Math.min(max>>14, nintv - 1);\n for (var i = minLin; i <= maxLin; ++i) {\n var lb = readVob(index, p + 4 + (i * 8));\n if (!lb) {\n continue;\n }\n if (!lowest || lb.block < lowest.block || lb.offset < lowest.offset) {\n lowest = lb;\n }\n }\n \n var prunedOtherChunks = [];\n if (lowest != null) {\n for (var i = 0; i < otherChunks.length; ++i) {\n var chnk = otherChunks[i];\n if (chnk.maxv.block >= lowest.block && chnk.maxv.offset >= lowest.offset) {\n prunedOtherChunks.push(chnk);\n }\n }\n } \n otherChunks = prunedOtherChunks;\n\n var intChunks = [];\n for (var i = 0; i < otherChunks.length; ++i) {\n intChunks.push(otherChunks[i]);\n }\n for (var i = 0; i < leafChunks.length; ++i) {\n intChunks.push(leafChunks[i]);\n }\n\n intChunks.sort(function(c0, c1) {\n var dif = c0.minv.block - c1.minv.block;\n if (dif != 0) {\n return dif;\n } else {\n return c0.minv.offset - c1.minv.offset;\n }\n });\n var mergedChunks = [];\n if (intChunks.length > 0) {\n var cur = intChunks[0];\n for (var i = 1; i < intChunks.length; ++i) {\n var nc = intChunks[i];\n if (nc.minv.block == cur.maxv.block /* && nc.minv.offset == cur.maxv.offset */) { // no point splitting mid-block\n cur = new Chunk(cur.minv, nc.maxv);\n } else {\n mergedChunks.push(cur);\n cur = nc;\n }\n }\n mergedChunks.push(cur);\n }\n\n return mergedChunks;\n}\n\nTabixFile.prototype.fetch = function(chr, min, max, callback) {\n var thisB = this;\n\n var chrId = this.chrToIndex[chr];\n if (chrId == undefined)\n return callback([]);\n\n var canonicalChr = this.indexToChr[chrId];\n\n var chunks;\n if (chrId === undefined) {\n chunks = [];\n } else {\n chunks = this.blocksForRange(chrId, min, max);\n if (!chunks) {\n callback(null, 'Error in index fetch');\n }\n }\n\n var records = [];\n var index = 0;\n var data;\n\n function tramp() {\n if (index >= chunks.length) {\n return callback(records);\n } else if (!data) {\n var c = chunks[index];\n var fetchMin = c.minv.block;\n var fetchMax = c.maxv.block + (1<<16); // *sigh*\n thisB.data.slice(fetchMin, fetchMax - fetchMin).fetch(function(r) {\n data = unbgzf(r, c.maxv.block - c.minv.block + 1);\n return tramp();\n });\n } else {\n var ba = new Uint8Array(data);\n thisB.readRecords(ba, chunks[index].minv.offset, records, min, max, canonicalChr);\n data = null;\n ++index;\n return tramp();\n }\n }\n tramp();\n}\n\nTabixFile.prototype.readRecords = function(ba, offset, sink, min, max, chr) {\n LINE_LOOP:\n while (true) {\n var line = '';\n while (offset < ba.length) {\n var ch = ba[offset++];\n if (ch == 10) {\n var toks = line.split('\\t');\n\n if (toks[this.colSeq - 1] == chr) {\n var fmin = parseInt(toks[this.colStart - 1]);\n var fmax = fmin;\n if (this.colEnd > 0)\n fmax = parseInt(toks[this.colEnd - 1]);\n if (this.format & 0x10000) ++fmin;\n\n if (fmin <= max && fmax >= min)\n sink.push(line);\n }\n continue LINE_LOOP;\n } else {\n line += String.fromCharCode(ch);\n }\n }\n return;\n }\n}\n\nTabixFile.prototype.fetchHeader = function(callback) {\n var self = this;\n var fetchPtr = 0, ptr = 0, line='';\n var lines = [];\n\n self.data.slice(0, self.headerMax).fetch(function(chnk) {\n if (!chnk) {\n return callback(null, \"Fetch failed\");\n }\n var ba = new Uint8Array(unbgzf(chnk, chnk.byteLength));\n var ptr = 0, line = '', lines = [];\n while (ptr < ba.length) {\n var ch = ba[ptr++]\n if (ch == 10) {\n if (line.charCodeAt(0) == self.meta) {\n lines.push(line);\n line = '';\n } else {\n return callback(lines);\n }\n } else {\n line += String.fromCharCode(ch);\n }\n }\n callback(lines);\n });\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n connectTabix: connectTabix,\n TABIX_MAGIC: TABIX_MAGIC\n };\n}\n","/* jshint esversion: 6 */\n\n/*\n Source that can be configured to produce any type of feature,\n useful for testing renderers.\n */\n\nimport { registerSourceAdapterFactory,\n FeatureSourceBase\n } from \"./sourceadapters.js\";\n\nimport { DASFeature\n } from \"./das.js\";\n\nimport * as R from \"ramda\";\n\n\nclass TestSource extends FeatureSourceBase {\n constructor(source) {\n super();\n\n this.features = R.defaultTo([], source.features);\n }\n\n genFeature(conf) {\n let feature = new DASFeature();\n\n for (let key in conf) {\n feature[key] = conf[key];\n }\n }\n\n fetch(chr, min, max, scale, types, pool, callback) {\n let features = R.forEach(this.genFeature, this.features);\n return callback(null, features, 1);\n }\n}\n\n\nregisterSourceAdapterFactory('test-source', source => {\n return { features: new TestSource(source) };\n});\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// thub.js: support for track-hub style registries\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var textXHR = utils.textXHR;\n var relativeURL = utils.relativeURL;\n var shallowCopy = utils.shallowCopy;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n}\n\nvar THUB_STANZA_REGEXP = /\\n\\s*\\n/;\nvar THUB_PARSE_REGEXP = /(\\w+) +(.+)\\n?/;\nvar THUB_SUBGROUP_REGEXP = /subGroup[1-9]/;\n\nvar THUB_PENNANT_PREFIX = 'http://genome.ucsc.edu/images/';\n\nfunction TrackHub(url) {\n this.genomes = {};\n this.url = url;\n}\n\nfunction TrackHubTrack() {\n}\n\nTrackHubTrack.prototype.get = function(k) {\n if (this[k])\n return this[k];\n else if (this._parent) \n return this._parent.get(k);\n}\n\nfunction TrackHubDB(hub) {\n this.hub = hub;\n}\n\nTrackHubDB.prototype.getTracks = function(callback) {\n var thisB = this;\n if (this._tracks) {\n return callback(this._tracks);\n } \n \n textXHR(this.absURL, function(trackFile, err) {\n if (err) {\n return callback(null, err);\n }\n \n // trackFile = trackFile.replace(/\\#.*/g, '');\n trackFile = trackFile.replace('\\\\\\n', ' ');\n\n var tracks = [];\n var tracksById = {};\n var stanzas = trackFile.split(THUB_STANZA_REGEXP);\n for (var s = 0; s < stanzas.length; ++s) {\n var toks = stanzas[s].replace(/\\#.*/g, '').split(THUB_PARSE_REGEXP);\n var track = new TrackHubTrack();\n track._db = thisB;\n for (var l = 0; l < toks.length - 2; l += 3) {\n var k = toks[l+1], v = toks[l+2];\n if (k.match(THUB_SUBGROUP_REGEXP)) {\n if (!track.subgroups)\n track.subgroups = {};\n var sgtoks = v.split(/\\s/);\n var sgtag = sgtoks[0];\n var sgrecord = {name: sgtoks[1], tags: [], titles: []};\n for (var sgti = 2; sgti < sgtoks.length; ++sgti) {\n var grp = sgtoks[sgti].split(/=/);\n sgrecord.tags.push(grp[0]);\n sgrecord.titles.push(grp[1]);\n }\n track.subgroups[sgtag] = sgrecord;\n } else if (k === 'subGroups') {\n var sgtoks = v.split(/(\\w+)=(\\w+)/);\n track.sgm = {};\n for (var sgti = 0; sgti < sgtoks.length - 2; sgti += 3) {\n track.sgm[sgtoks[sgti+1]] = sgtoks[sgti + 2];\n }\n } else {\n track[toks[l+1]] = toks[l+2];\n }\n }\n\n if (track.track && (track.type || track.container || track.view || track.bigDataUrl)) {\n tracks.push(track);\n tracksById[track.track] = track;\n } else {\n // console.log('skipping ', track);\n }\n }\n \n var toplevels = [];\n var composites = [];\n for (var ti = 0; ti < tracks.length; ++ti) {\n var track = tracks[ti];\n var top = true;\n if (track.parent) {\n var ptoks = track.parent.split(/\\s+/);\n var parent = tracksById[ptoks[0]];\n if (parent) {\n track._parent = parent;\n\n if (!parent.children)\n parent.children = [];\n parent.children.push(track);\n\n if (parent)\n top = false;\n } else {\n console.log(\"Couldn't find parent \" + ptoks[0] + '(' + track.parent + ')');\n }\n \n }\n if (track.compositeTrack) {\n composites.push(track);\n } else if (top) {\n toplevels.push(track);\n }\n }\n\n for (var ci = 0; ci < composites.length; ++ci) {\n var comp = composites[ci];\n if (!comp.children)\n continue;\n\n var parentOfViews = false;\n for (var ki = 0; ki < comp.children.length; ++ki) {\n var k = comp.children[ki];\n if (k.view) {\n k.shortLabel = comp.shortLabel + \": \" + k.shortLabel;\n toplevels.push(k);\n parentOfViews = true;\n }\n }\n if (!parentOfViews)\n toplevels.push(comp);\n }\n \n thisB._tracks = toplevels;\n return callback(thisB._tracks, null);\n }, {credentials: this.credentials, salt: true});\n}\n\nfunction connectTrackHub(hubURL, callback, opts) {\n opts = opts || {};\n opts.salt = true;\n\n textXHR(hubURL, function(hubFile, err) {\n if (err) {\n return callback(null, err);\n }\n\n var toks = hubFile.split(THUB_PARSE_REGEXP);\n var hub = new TrackHub(hubURL);\n if (opts.credentials) {\n hub.credentials = opts.credentials;\n }\n for (var l = 0; l < toks.length - 2; l += 3) {\n hub[toks[l+1]] = toks[l+2];\n }\n \n \n if (hub.genomesFile) {\n var genURL = relativeURL(hubURL, hub.genomesFile);\n textXHR(genURL, function(genFile, err) {\n if (err) {\n return callback(null, err);\n }\n\n var stanzas = genFile.split(THUB_STANZA_REGEXP);\n for (var s = 0; s < stanzas.length; ++s) {\n var toks = stanzas[s].split(THUB_PARSE_REGEXP);\n var gprops = new TrackHubDB(hub);\n if (opts.credentials) {\n gprops.credentials = opts.credentials;\n }\n\n for (var l = 0; l < toks.length - 2; l += 3) {\n gprops[toks[l+1]] = toks[l+2];\n }\n\n if (gprops.twoBitPath) {\n gprops.twoBitPath = relativeURL(genURL, gprops.twoBitPath);\n }\n\n if (gprops.genome && gprops.trackDb) {\n gprops.absURL = relativeURL(genURL, gprops.trackDb);\n hub.genomes[gprops.genome] = gprops;\n }\n }\n\n callback(hub);\n \n }, opts);\n } else {\n callback(null, 'No genomesFile');\n }\n }, opts);\n}\n\n\nTrackHubTrack.prototype.toDallianceSource = function() {\n var source = {\n name: this.shortLabel,\n desc: this.longLabel\n };\n if (this._db.mapping) {\n source.mapping = this._db.mapping;\n }\n\n var pennantIcon = this.get('pennantIcon');\n if (pennantIcon) {\n var ptoks = pennantIcon.split(/\\s+/);\n source.pennant = THUB_PENNANT_PREFIX + ptoks[0];\n }\n\n var searchTrix = this.get('searchTrix');\n if (searchTrix) {\n source.trixURI = relativeURL(this._db.absURL, searchTrix);\n }\n\n if (this.container == 'multiWig') {\n source.merge = 'concat';\n source.overlay = [];\n var children = this.children || [];\n source.style = [];\n source.noDownsample = true;\n\n for (var ci = 0; ci < children.length; ++ci) {\n var ch = children[ci];\n var cs = ch.toDallianceSource()\n source.overlay.push(cs);\n\n if (cs.style) {\n for (var si = 0; si < cs.style.length; ++si) {\n var style = cs.style[si];\n style.method = ch.shortLabel; // FIXME\n if (this.aggregate == 'transparentOverlay')\n style.style.ALPHA = 0.5;\n source.style.push(style);\n }\n }\n }\n return source; \n } else {\n var type = this.type;\n if (!type) {\n var p = this;\n while (p._parent && !p.type) {\n p = p._parent;\n }\n type = p.type;\n }\n if (!type)\n return;\n var typeToks = type.split(/\\s+/);\n if (typeToks[0] == 'bigBed' && this.bigDataUrl) {\n var bedTokens = typeToks[1]|0\n var bedPlus = typeToks[2] == '+';\n\n source.bwgURI = relativeURL(this._db.absURL, this.bigDataUrl);\n source.style = this.bigbedStyles();\n if (this._db.credentials) {\n source.credentials = true;\n }\n if (bedTokens >= 12 && bedPlus)\n source.collapseSuperGroups = true;\n return source;\n } else if (typeToks[0] == 'bigWig' && this.bigDataUrl) {\n source.bwgURI = relativeURL(this._db.absURL, this.bigDataUrl);\n source.style = this.bigwigStyles();\n source.noDownsample = true; // FIXME seems like a blunt instrument...\n \n if (this.yLineOnOff && this.yLineOnOff == 'on') {\n source.quantLeapThreshold = this.yLineMark !== undefined ? (1.0 * this.yLineMark) : 0.0;\n }\n\n if (this._db.credentials) {\n source.credentials = true;\n }\n\n return source;\n } else if (typeToks[0] == 'bam' && this.bigDataUrl) {\n source.bamURI = relativeURL(this._db.absURL, this.bigDataUrl);\n if (this._db.credentials) {\n source.credentials = true;\n }\n return source;\n } else if (typeToks[0] == 'vcfTabix' && this.bigDataUrl) {\n source.uri = relativeURL(this._db.absURL, this.bigDataUrl);\n source.tier_type = 'tabix';\n source.payload = 'vcf';\n if (this._db.credentials) {\n source.credentials = true;\n }\n return source;\n } else {\n console.log('Unsupported ' + this.type);\n }\n }\n}\n\nTrackHubTrack.prototype.bigwigStyles = function() {\n var type = this.type;\n if (!type) {\n var p = this;\n while (p._parent && !p.type) {\n p = p._parent;\n }\n type = p.type;\n }\n if (!type)\n return;\n var typeToks = type.split(/\\s+/);\n\n var min, max;\n if (typeToks.length >= 3) {\n min = 1.0 * typeToks[1];\n max = 1.0 * typeToks[2];\n }\n\n var height;\n if (this.maxHeightPixels) {\n var mhpToks = this.maxHeightPixels.split(/:/);\n if (mhpToks.length == 3) {\n height = mhpToks[1] | 0;\n } else {\n console.log('maxHeightPixels should be of the form max:default:min');\n }\n }\n \n var gtype = 'bars';\n if (this.graphTypeDefault) {\n gtype = this.graphTypeDefault;\n }\n \n var color = 'black';\n var altColor = null;\n if (this.color) {\n color = 'rgb(' + this.color + ')';\n }\n if (this.altColor) {\n altColor = 'rgb(' + this.altColor + ')';\n }\n \n var stylesheet = new DASStylesheet();\n var wigStyle = new DASStyle();\n if (gtype == 'points') {\n wigStyle.glyph = 'POINT';\n } else {\n wigStyle.glyph = 'HISTOGRAM';\n }\n\n if (altColor) {\n wigStyle.COLOR1 = color;\n wigStyle.COLOR2 = altColor;\n } else {\n wigStyle.BGCOLOR = color;\n }\n wigStyle.HEIGHT = height || 30;\n if (min || max) {\n wigStyle.MIN = min;\n wigStyle.MAX = max;\n }\n stylesheet.pushStyle({type: 'default'}, null, wigStyle);\n return stylesheet.styles;\n}\n\nTrackHubTrack.prototype.bigbedStyles = function() {\n var itemRgb = (''+this.get('itemRgb')).toLowerCase() == 'on';\n var visibility = this.get('visibility') || 'full';\n var color = this.get('color');\n if (color)\n color = 'rgb(' + color + ')';\n else \n color = 'blue';\n \n var stylesheet = new DASStylesheet();\n var wigStyle = new DASStyle();\n wigStyle.glyph = 'BOX';\n wigStyle.FGCOLOR = 'black';\n wigStyle.BGCOLOR = color;\n wigStyle.HEIGHT = (visibility == 'full' || visibility == 'pack') ? 12 : 8;\n wigStyle.BUMP = (visibility == 'full' || visibility == 'pack');\n wigStyle.LABEL = (visibility == 'full' || visibility == 'pack');\n wigStyle.ZINDEX = 20;\n if (itemRgb)\n wigStyle.BGITEM = true;\n\n var cbs = this.get('colorByStrand');\n if (cbs) {\n var cbsToks = cbs.split(/\\s+/);\n \n var plus = shallowCopy(wigStyle);\n plus.BGCOLOR = 'rgb(' + cbsToks[0] + ')';\n stylesheet.pushStyle({type: 'bigbed', orientation: '+'}, null, plus);\n\n var minus = shallowCopy(wigStyle);\n minus.BGCOLOR = 'rgb(' + cbsToks[1] + ')';\n stylesheet.pushStyle({type: 'bigbed', orientation: '-'}, null, minus);\n } else {\n stylesheet.pushStyle({type: 'bigbed'}, null, wigStyle);\n } \n \n var tlStyle = new DASStyle();\n tlStyle.glyph = 'BOX';\n tlStyle.FGCOLOR = 'black';\n if (itemRgb)\n tlStyle.BGITEM = true;\n tlStyle.BGCOLOR = 'red'\n tlStyle.HEIGHT = 10;\n tlStyle.BUMP = true;\n tlStyle.ZINDEX = 20;\n stylesheet.pushStyle({type: 'translation'}, null, tlStyle);\n \n var tsStyle = new DASStyle();\n tsStyle.glyph = 'BOX';\n tsStyle.FGCOLOR = 'black';\n tsStyle.BGCOLOR = 'white';\n tsStyle.HEIGHT = 10;\n tsStyle.ZINDEX = 10;\n tsStyle.BUMP = true;\n tsStyle.LABEL = true;\n stylesheet.pushStyle({type: 'transcript'}, null, tsStyle);\n\n return stylesheet.styles;\n}\n\nfunction THUB_COMPARE(g, h) {\n if (g.priority && h.priority) {\n return (1.0 * g.priority) - (1.0 * h.priority)\n } else if (g.priority) {\n return 1;\n } else if (h.priority) {\n return -1;\n } else {\n return g.shortLabel.localeCompare(h.shortLabel);\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n connectTrackHub: connectTrackHub,\n THUB_COMPARE: THUB_COMPARE\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// tier-actions.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var shallowCopy = utils.shallowCopy;\n}\n\nBrowser.prototype.mergeSelectedTiers = function() {\n var sources = [];\n var styles = [];\n\n for (var sti = 0; sti < this.selectedTiers.length; ++sti) {\n var tier = this.tiers[this.selectedTiers[sti]];\n\t sources.push(shallowCopy(tier.dasSource));\n var ss = tier.stylesheet.styles;\n for (var si = 0; si < ss.length; ++si) {\n var sh = ss[si];\n var nsh = shallowCopy(sh);\n nsh.method = tier.dasSource.name.replace(/[()+*?]/g, '\\\\$&');\n nsh._methodRE = null;\n nsh.style = shallowCopy(sh.style);\n if (nsh.style.ZINDEX === undefined)\n nsh.style.ZINDEX = sti;\n\n if (tier.forceMin) {\n nsh.style.MIN = tier.forceMin;\n }\n if (tier.forceMax) {\n nsh.style.MAX = tier.forceMax;\n }\n\n styles.push(nsh);\n }\n }\n \n this.addTier(\n\t{name: 'Merged',\n\t merge: 'concat',\n\t overlay: sources,\n\t noDownsample: true,\n style: styles});\n\n this.setSelectedTier(this.tiers.length - 1);\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2013\n//\n// tier-edit.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n\n var das = require('./das');\n var isDasBooleanTrue = das.isDasBooleanTrue;\n var isDasBooleanNotFalse = das.isDasBooleanNotFalse;\n var copyStylesheet = das.copyStylesheet;\n\n var color = require('./color');\n var dasColourForName = color.dasColourForName;\n\n var sourceDataURI = require('./sourcecompare').sourceDataURI;\n}\n\nvar __dalliance_smallGlyphs = {\n DOT: true, \n EX: true, \n STAR: true, \n SQUARE: true, \n CROSS: true, \n TRIANGLE: true, \n PLIMSOLL: true\n};\n\nBrowser.prototype.openTierPanel = function(tier) {\n var b = this;\n\n if (this.uiMode === 'tier' && this.manipulatingTier === tier) {\n this.hideToolPanel();\n this.setUiMode('none');\n } else if (!tier) {\n return;\n } else {\n var setStyleColors = function(style) {\n if (style.BGGRAD)\n return;\n\n if (numColors == 1) {\n if (style.glyph == 'LINEPLOT' || __dalliance_smallGlyphs[style.glyph]) {\n style.FGCOLOR = tierColorField.value;\n } else {\n style.BGCOLOR = tierColorField.value;\n }\n style.COLOR1 = style.COLOR2 = style.COLOR3 = null;\n } else {\n style.COLOR1 = tierColorField.value;\n style.COLOR2 = tierColorField2.value;\n if (numColors > 2) {\n style.COLOR3 = tierColorField3.value;\n } else {\n style.COLOR3 = null;\n }\n }\n style._gradient = null;\n style._plusColor = tierPlusColorField.value;\n style._minusColor = tierMinusColorField.value;\n }\n\n var mutateStylesheet = function(visitor) {\n var nss = copyStylesheet(tier.stylesheet);\n var ssScale = tier.browser.zoomForCurrentScale();\n\n for (var i = 0; i < nss.styles.length; ++i) {\n var sh = nss.styles[i];\n if (sh.zoom && sh.zoom != ssScale) {\n continue;\n }\n\n visitor(sh.style);\n }\n\n return nss;\n }\n\n var changeColor = function(ev) {\n tier.mergeStylesheet(mutateStylesheet(setStyleColors));\n }\n \n this.manipulatingTier = tier;\n\n var tierForm = makeElement('div', null, {className: 'tier-edit'});\n\n var aboutBanner = makeElement('div', \"About '\" + (tier.config.Name || tier.dasSource.name) + \"'\", null,\n {background: 'gray', paddingBottom: '5px', marginBottom: '5px', textAlign: 'center'});\n tierForm.appendChild(aboutBanner);\n\n var about = makeElement('div', \n [makeElement('p', tier.dasSource.desc)]\n );\n var aboutNotes = [];\n var sduri = sourceDataURI(tier.dasSource);\n if (sduri &&\n (sduri.indexOf('http://') == 0 ||\n sduri.indexOf('https://') == 0 ||\n sduri.indexOf('//') == 0) &&\n sduri !== 'https://www.biodalliance.org/magic/no_uri')\n {\n aboutNotes.push(makeElement('li', makeElement('a', '(Download data)', {href: sduri})));\n }\n\n if (tier.dasSource.mapping) {\n var coords = this.chains[tier.dasSource.mapping].coords;\n aboutNotes.push(makeElement('li', 'Mapped from ' + coords.auth + coords.version));\n }\n\n if (aboutNotes.length > 0) {\n about.appendChild(makeElement('ul', aboutNotes));\n }\n \n tierForm.appendChild(about);\n\n var semanticBanner = makeElement('span', ' (styles for current zoom level)', null, {display: 'none'});\n var editBanner = makeElement('div', ['Edit', semanticBanner], null,\n {background: 'gray', paddingBottom: '5px', marginBottom: '5px', textAlign: 'center'});\n tierForm.appendChild(editBanner);\n\n var tierNameField = makeElement('input', null, {type: 'text'});\n var tierPinnedToggle = makeElement('input', null, {type: 'checkbox', disabled: this.disablePinning});\n\n var glyphField = makeElement('select');\n glyphField.appendChild(makeElement('option', 'Histogram', {value: 'HISTOGRAM'}));\n glyphField.appendChild(makeElement('option', 'Line Plot', {value: 'LINEPLOT'}));\n glyphField.appendChild(makeElement('option', 'Ribbon', {value: 'GRADIENT'}));\n glyphField.appendChild(makeElement('option', 'Scatter', {value: 'SCATTER'}));\n\n var tierColorField = makeElement('input', null, {type: 'text', value: '#dd00dd'});\n var tierColorField2 = makeElement('input', null, {type: 'text', value: '#dd00dd'});\n var tierColorField3 = makeElement('input', null, {type: 'text', value: '#dd00dd'});\n\n var tierPlusColorField = makeElement('input', null, {type: 'text', value: '#ffa07a'});\n var tierMinusColorField = makeElement('input', null, {type: 'text', value: '#87cefa'});\n\n try {\n tierColorField.type = tierColorField2.type = tierColorField3.type = 'color';\n tierPlusColorField.type = tierMinusColorField.type = 'color';\n } catch (e) {\n // IE throws if attempt to set type to 'color'.\n }\n\n var tierColorFields = [tierColorField, tierColorField2, tierColorField3];\n var colorListPlus = makeElement('i', null, {className: 'fa fa-plus-circle'});\n var colorListMinus = makeElement('i', null, {className: 'fa fa-minus-circle'});\n var numColors = 1;\n var colorListElement = makeElement('td', tierColorFields);\n var setNumColors = function(n) {\n numColors = n;\n for (var i = 0; i < n; ++i) \n tierColorFields[i].style.display = 'block';\n for (var i = n; i < tierColorFields.length; ++i)\n tierColorFields[i].style.display = 'none';\n }\n colorListPlus.addEventListener('click', function(ev) {\n if (numColors < 3) {\n setNumColors(numColors + 1);\n changeColor(null);\n }\n }, false);\n colorListMinus.addEventListener('click', function(ev) {\n if (numColors > 1) {\n setNumColors(numColors - 1);\n changeColor(null);\n }\n }, false);\n\n var tierMinField = makeElement('input', null, {type: 'text', value: '0.0'});\n var tierMaxField = makeElement('input', null, {type: 'text', value: '10.0'});\n var tierMinToggle = makeElement('input', null, {type: 'checkbox'});\n var tierMaxToggle = makeElement('input', null, {type: 'checkbox'});\n\n var quantLeapToggle = makeElement('input', null, {type: 'checkbox', checked: tier.quantLeapThreshold !== undefined});\n var quantLeapThreshField = makeElement('input', null, {type: 'text', value: tier.quantLeapThreshold, disabled: !quantLeapToggle.checked});\n\n var tierHeightField = makeElement('input', null, {type: 'text', value: '50'});\n\n var bumpToggle = makeElement('input', null, {type: 'checkbox'});\n var bumpLimit = makeElement('input', null, {type: 'text'});\n var labelToggle = makeElement('input', null, {type: 'checkbox'});\n\n var mainStyle = null;\n if (tier.stylesheet.styles.length > 0) {\n var s = mainStyle = tier.stylesheet.styles[0].style;\n }\n\n var refresh = function() {\n if (typeof tier.config.name === 'string')\n tierNameField.value = tier.config.name;\n else \n tierNameField.value = tier.dasSource.name;\n\n tierPinnedToggle.checked = tier.pinned;\n\n if (tier.forceHeight) {\n tierHeightField.value = '' + tier.forceHeight;\n } else if (mainStyle && mainStyle.HEIGHT) {\n tierHeightField.value = '' + mainStyle.HEIGHT;\n }\n\n if (typeof tier.quantLeapThreshold == 'number') {\n quantLeapToggle.checked = true;\n quantLeapThreshField.disabled = false;\n if (parseFloat(quantLeapThreshField.value) != tier.quantLeapThreshold)\n quantLeapThreshField.value = tier.quantLeapThreshold;\n } else {\n quantLeapToggle.checked = false;\n quantLeapThreshField.disabled = true;\n }\n\n if (typeof tier.subtierMax == 'number') {\n bumpLimit.value = '' + tier.subtierMax;\n } else {\n bumpLimit.value = '' + (tier.dasSource.subtierMax || tier.browser.defaultSubtierMax);\n }\n\n if (tier.stylesheet.styles.length > 0) {\n var s = null;\n var isQuantitative=false, isSimpleQuantitative = false;\n var ssScale = tier.browser.zoomForCurrentScale();\n var activeStyleCount = 0;\n\n for (var si = 0; si < tier.stylesheet.styles.length; ++si) {\n var sh = tier.stylesheet.styles[si]; \n if (sh.zoom && sh.zoom != ssScale) {\n continue;\n }\n ++activeStyleCount;\n var ss = tier.stylesheet.styles[si].style;\n\n if (!s) {\n s = mainStyle = ss;\n }\n \n if (ss.glyph == 'LINEPLOT' || ss.glyph == 'HISTOGRAM' || ss.glyph == 'GRADIENT' || isDasBooleanTrue(ss.SCATTER)) {\n if (!isQuantitative)\n s = mainStyle = ss;\n isQuantitative = true;\n }\n }\n if (!s) {\n return;\n }\n\n semanticBanner.style.display = (activeStyleCount == tier.stylesheet.styles.length) ? 'none' : 'inline';\n\n isSimpleQuantitative = isQuantitative && activeStyleCount == 1;\n var isGradient = s.COLOR2 || s.BGGRAD;\n\n if (isQuantitative) {\n minRow.style.display = 'table-row';\n maxRow.style.display = 'table-row';\n bumpRow.style.display = 'none';\n labelRow.style.display = 'none';\n } else {\n minRow.style.display = 'none';\n maxRow.style.display = 'none';\n bumpRow.style.display = 'table-row';\n bumpToggle.checked = isDasBooleanTrue(mainStyle.BUMP);\n bumpLimit.disabled = !isDasBooleanTrue(mainStyle.BUMP);\n labelRow.style.display = 'table-row';\n labelToggle.checked = isDasBooleanTrue(mainStyle.LABEL);\n }\n\n if (isSimpleQuantitative) {\n styleRow.style.display = 'table-row';\n colorRow.style.display = 'table-row';\n } else {\n styleRow.style.display = 'none';\n colorRow.style.display = 'none';\n\n }\n\n var numColors = 1;\n if (s.COLOR1) {\n tierColorField.value = dasColourForName(s.COLOR1).toHexString();\n if (s.COLOR2) {\n tierColorField2.value = dasColourForName(s.COLOR2).toHexString();\n if (s.COLOR3) {\n tierColorField3.value = dasColourForName(s.COLOR3).toHexString();\n numColors = 3;\n } else {\n numColors = 2;\n }\n }\n } else {\n if (s.glyph == 'LINEPLOT' || s.glyph == 'DOT' && s.FGCOLOR) {\n tierColorField.value = dasColourForName(s.FGCOLOR).toHexString();\n } else if (s.BGCOLOR) {\n tierColorField.value = dasColourForName(s.BGCOLOR).toHexString();\n }\n } \n setNumColors(numColors);\n\n if (s._plusColor)\n tierPlusColorField.value = dasColourForName(s._plusColor).toHexString() || s._plusColor;\n if (s._minusColor)\n tierMinusColorField.value = dasColourForName(s._minusColor).toHexString() || s._minusColor;\n if (isDasBooleanTrue(s.SCATTER)) {\n glyphField.value = 'SCATTER';\n } else {\n glyphField.value = s.glyph;\n } \n\n var setMinValue, setMaxValue;\n if (s.MIN !== undefined) {\n var x = parseFloat(s.MIN);\n if (!isNaN(x))\n setMinValue = x;\n }\n if (!tier.forceMinDynamic && (s.MIN !== undefined || tier.forceMin !== undefined)) {\n tierMinToggle.checked = true;\n tierMinField.disabled = false;\n } else {\n tierMinToggle.checked = false;\n tierMinField.disabled = true;\n }\n\n if (s.MAX !== undefined) {\n var x = parseFloat(s.MAX)\n if (!isNaN(x))\n setMaxValue = x;\n }\n if (!tier.forceMaxDynamic && (s.MAX !== undefined || tier.forceMax !== undefined)) {\n tierMaxToggle.checked = true;\n tierMaxField.disabled = false;\n } else {\n tierMaxToggle.checked = false;\n tierMaxField.disabled = true;\n }\n\n if (tier.forceMin != undefined) {\n setMinValue = tier.forceMin;\n }\n if (tier.forceMax != undefined) {\n setMaxValue = tier.forceMax;\n }\n if (typeof(setMinValue) == 'number' && setMinValue != parseFloat(tierMinField.value)) {\n tierMinField.value = setMinValue;\n }\n if (typeof(setMaxValue) == 'number' && setMaxValue != parseFloat(tierMaxField.value)) {\n tierMaxField.value = setMaxValue;\n }\n\n var seqStyle = getSeqStyle(tier.stylesheet);\n if (seqStyle) {\n seqMismatchRow.style.display = 'table-row';\n seqMismatchToggle.checked = (seqStyle.__SEQCOLOR === 'mismatch');\n seqInsertRow.style.display = 'table-row';\n seqInsertToggle.checked = isDasBooleanTrue(seqStyle.__INSERTIONS);\n seqIgnoreQualsRow.style.display = 'table-row';\n seqIgnoreQualsToggle.checked = (seqStyle.__disableQuals === undefined || seqStyle.__disableQuals === false);\n console.log(seqStyle.__disableQuals);\n } else {\n seqMismatchRow.style.display = 'none';\n seqInsertRow.style.display = 'none';\n seqIgnoreQualsRow.style.display = 'none';\n }\n\n if (seqStyle && seqMismatchToggle.checked && !isSimpleQuantitative) {\n plusStrandColorRow.style.display = 'table-row';\n minusStrandColorRow.style.display = 'table-row';\n } else {\n plusStrandColorRow.style.display = 'none';\n minusStrandColorRow.style.display = 'none';\n }\n }\n\n if (isQuantitative && tier.browser.sourceAdapterIsCapable(tier.featureSource, 'quantLeap'))\n quantLeapRow.style.display = 'table-row';\n else \n quantLeapRow.style.display = 'none';\n }\n\n var seqMismatchToggle = makeElement('input', null, {type: 'checkbox'});\n var seqMismatchRow = makeElement('tr',\n [makeElement('th', 'Highlight mismatches & strands'),\n makeElement('td', seqMismatchToggle)]);\n seqMismatchToggle.addEventListener('change', function(ev) {\n var nss = copyStylesheet(tier.stylesheet);\n var seqStyle = getSeqStyle(nss);\n seqStyle.__SEQCOLOR = seqMismatchToggle.checked ? 'mismatch' : 'base';\n tier.mergeStylesheet(nss);\n });\n\n var seqInsertToggle = makeElement('input', null, {type: 'checkbox'});\n var seqInsertRow = makeElement('tr',\n [makeElement('th', 'Show insertions'),\n makeElement('td', seqInsertToggle)]);\n seqInsertToggle.addEventListener('change', function(ev) {\n var nss = copyStylesheet(tier.stylesheet);\n var seqStyle = getSeqStyle(nss);\n seqStyle.__INSERTIONS = seqInsertToggle.checked ? 'yes' : 'no';\n tier.mergeStylesheet(nss);\n });\n\n var seqIgnoreQualsToggle = makeElement('input', null, {type: 'checkbox'});\n var seqIgnoreQualsRow = makeElement('tr',\n [makeElement('th', 'Reflect base quality as base color transparency'),\n makeElement('td', seqIgnoreQualsToggle)]);\n seqIgnoreQualsToggle.addEventListener('change', function(ev) {\n var nss = copyStylesheet(tier.stylesheet);\n var seqStyle = getSeqStyle(nss);\n seqStyle.__disableQuals = !seqIgnoreQualsToggle.checked;\n console.log(seqStyle.__disableQuals);\n tier.mergeStylesheet(nss);\n });\n\n var styleRow = makeElement('tr',\n [makeElement('th', 'Style'),\n makeElement('td', glyphField)]);\n var colorRow = makeElement('tr',\n [makeElement('th', ['Colour(s)', colorListPlus, colorListMinus]),\n colorListElement]);\n var plusStrandColorRow = makeElement('tr',\n [makeElement('th', 'Plus Strand Color'),\n makeElement('td', tierPlusColorField)]);\n var minusStrandColorRow = makeElement('tr',\n [makeElement('th', 'Minus Strand Color'),\n makeElement('td', tierMinusColorField)]);\n var minRow = makeElement('tr',\n [makeElement('th', 'Min value'),\n makeElement('td', [tierMinToggle, ' ', tierMinField])]);\n var maxRow = makeElement('tr',\n [makeElement('th', 'Max value'),\n makeElement('td', [tierMaxToggle, ' ', tierMaxField])]);\n var quantLeapRow = \n makeElement('tr',\n [makeElement('th', 'Threshold leap:'),\n makeElement('td', [quantLeapToggle, ' ', quantLeapThreshField])]);\n var bumpRow = makeElement('tr',\n [makeElement('th', 'Bump overlaps'),\n makeElement('td', [bumpToggle, ' limit: ', bumpLimit])]);\n var labelRow = makeElement('tr',\n [makeElement('th', 'Label features'),\n makeElement('td', labelToggle)]);\n\n\n var tierTable = makeElement('table',\n [makeElement('tr',\n [makeElement('th', 'Name', {}, {width: '150px', textAlign: 'right'}),\n tierNameField]),\n\n makeElement('tr',\n [makeElement('th', 'Pin to top'),\n tierPinnedToggle]),\n\n makeElement('tr',\n [makeElement('th', 'Height'),\n makeElement('td', tierHeightField)]),\n\n styleRow,\n colorRow,\n plusStrandColorRow,\n minusStrandColorRow,\n minRow,\n maxRow,\n quantLeapRow,\n bumpRow,\n labelRow,\n seqMismatchRow,\n seqInsertRow,\n seqIgnoreQualsRow\n ]);\n\n\n refresh();\n\n tierForm.appendChild(tierTable);\n\n var resetButton = makeElement('button', 'Reset track', {className: 'btn'}, {marginLeft: 'auto', marginRight: 'auto', display: 'block'});\n resetButton.addEventListener('click', function(ev) {\n tier.setConfig({});\n }, false);\n tierForm.appendChild(resetButton);\n\n tierNameField.addEventListener('input', function(ev) {\n tier.mergeConfig({name: tierNameField.value});\n }, false);\n\n tierPinnedToggle.addEventListener('change', function(ev) {\n tier.mergeConfig({pinned: tierPinnedToggle.checked});\n }, false);\n\n for (var ci = 0; ci < tierColorFields.length; ++ci) {\n tierColorFields[ci].addEventListener('change', changeColor, false);\n }\n\n tierPlusColorField.addEventListener('change', changeColor, false);\n tierMinusColorField.addEventListener('change', changeColor, false);\n\n glyphField.addEventListener('change', function(ev) {\n var nss = mutateStylesheet(function(ts) {\n if (glyphField.value === 'SCATTER') {\n ts.SCATTER = true;\n ts.glyph = 'DOT';\n ts.SIZE = '3';\n } else {\n ts.glyph = glyphField.value;\n ts.SCATTER = undefined;\n }\n setStyleColors(ts);\n });\n tier.mergeStylesheet(nss);\n }, false);\n\n tierMinToggle.addEventListener('change', function(ev) {\n var conf = {forceMinDynamic: !tierMinToggle.checked};\n tierMinField.disabled = !tierMinToggle.checked;\n var x = parseFloat(tierMinField.value);\n if (tierMinToggle.checked && typeof(x) == 'number' && !isNaN(x))\n conf.forceMin = parseFloat(x);\n tier.mergeConfig(conf);\n });\n tierMinField.addEventListener('input', function(ev) {\n var x = parseFloat(tierMinField.value);\n if (typeof(x) == 'number' && !isNaN(x))\n tier.mergeConfig({forceMin: x});\n }, false);\n\n tierMaxToggle.addEventListener('change', function(ev) {\n var conf = {forceMaxDynamic: !tierMaxToggle.checked};\n tierMaxField.disabled = !tierMaxToggle.checked;\n var x = parseFloat(tierMaxField.value);\n if (tierMaxToggle.checked && typeof(x) == 'number' && !isNaN(x))\n conf.forceMax = parseFloat(x);\n tier.mergeConfig(conf);\n });\n tierMaxField.addEventListener('input', function(ev) {\n var x = parseFloat(tierMaxField.value);\n if (typeof(x) == 'number' && !isNaN(x))\n tier.mergeConfig({forceMax: x});\n }, false);\n\n tierHeightField.addEventListener('input', function(ev) {\n var x = parseFloat(tierHeightField.value);\n if (typeof(x) == 'number' && !isNaN(x))\n tier.mergeConfig({height: Math.min(500, x|0)});\n }, false);\n\n var updateQuant = function() {\n quantLeapThreshField.disabled = !quantLeapToggle.checked;\n if (quantLeapToggle.checked) {\n var x = parseFloat(quantLeapThreshField.value);\n if (typeof(x) == 'number' && !isNaN(x)) {\n tier.mergeConfig({quantLeapThreshold: parseFloat(quantLeapThreshField.value)});\n }\n } else {\n tier.mergeConfig({quantLeapThreshold: null});\n }\n }\n quantLeapToggle.addEventListener('change', function(ev) {\n updateQuant();\n }, false);\n quantLeapThreshField.addEventListener('input', function(ev) {\n updateQuant();\n }, false);\n\n labelToggle.addEventListener('change', function(ev) {\n var nss = mutateStylesheet(function(style) {\n style.LABEL = labelToggle.checked ? 'yes' : 'no';\n });\n tier.mergeStylesheet(nss);\n }, false);\n bumpToggle.addEventListener('change', function(ev) {\n var nss = mutateStylesheet(function(style) {\n style.BUMP = bumpToggle.checked ? 'yes' : 'no';\n });\n tier.mergeStylesheet(nss);\n }, false);\n bumpLimit.addEventListener('input', function(ev) {\n var x = parseInt(bumpLimit.value);\n if (typeof(x) == 'number' && x > 0) {\n tier.mergeConfig({subtierMax: x});\n }\n }, false);\n\n\n this.showToolPanel(tierForm);\n this.setUiMode('tier');\n\n tier.addTierListener(refresh);\n\n var currentScale = tier.browser.scale;\n tier.browser.addViewListener(function() {\n if (tier.browser.scale != currentScale) {\n currentScale = tier.browser.scale;\n refresh();\n }\n });\n }\n}\n\nfunction getSeqStyle(stylesheet) {\n for (var si = 0; si < stylesheet.styles.length; ++si) {\n var ss = stylesheet.styles[si].style;\n if (ss.glyph === '__SEQUENCE') {\n return ss;\n }\n }\n}\n\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// tier.js: (try) to encapsulate the functionality of a browser tier.\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n var shallowCopy = utils.shallowCopy;\n var pushnew = utils.pushnew;\n var miniJSONify = utils.miniJSONify;\n var arrayIndexOf = utils.arrayIndexOf;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n\n var sha1 = require('./sha1');\n var b64_sha1 = sha1.b64_sha1;\n\n var style = require('./style');\n var StyleFilter = style.StyleFilter;\n var StyleFilterSet = style.StyleFilterSet;\n\n var sc = require('./sourcecompare');\n var sourceDataURI = sc.sourceDataURI;\n\n var Promise = require('es6-promise').Promise;\n\n var sortFeatures = require('./features').sortFeatures;\n}\n\nvar __tier_idSeed = 0;\n\nfunction DasTier(browser, source, config, background)\n{\n this.config = config || {};\n this.id = 'tier' + (++__tier_idSeed);\n this.browser = browser;\n this.dasSource = shallowCopy(source);\n this.background = background;\n\n this.viewport = makeElement('canvas', null, \n {width: '' + ((this.browser.featurePanelWidth|0) + 2000), \n height: \"30\",\n className: 'viewport_12_5'},\n {position: 'inline-block',\n margin: '0px', border: '0px'});\n this.viewportHolder = makeElement('div', this.viewport, {className: 'viewport-holder_12_5'}, \n {background: background,\n position: 'absolute',\n padding: '0px', margin: '0px',\n border: '0px',\n left: '-1000px',\n minHeight: '200px'});\n this.overlay = makeElement('canvas', null,\n {width: + ((this.browser.featurePanelWidth|0)), \n height: \"30\",\n className: 'viewport-overlay'});\n\n this.notifier = makeElement('div', '', {className: 'notifier'});\n this.notifierHolder = makeElement('div', this.notifier, {className: 'notifier-holder'});\n this.quantOverlay = makeElement(\n 'canvas', null, \n {width: '50', height: \"56\",\n className: 'quant-overlay'});\n\n this.removeButton = makeElement('i', null, {className: 'fa fa-times'});\n this.bumpButton = makeElement('i', null, {className: 'fa fa-plus-circle'});\n this.loaderButton = browser.makeLoader(16);\n this.loaderButton.style.display = 'none';\n this.infoElement = makeElement('div', this.dasSource.desc, {className: 'track-label-info'});\n this.nameButton = makeElement('div', [], {className: 'tier-tab'});\n this.nameButton.appendChild(this.removeButton);\n if (source.pennant) {\n this.nameButton.appendChild(makeElement('img', null, {src: source.pennant, width: '16', height: '16'}))\n } else if (source.mapping) {\n var version = null;\n if (this.browser.chains[source.mapping])\n version = this.browser.chains[source.mapping].coords.version;\n if (version)\n this.nameButton.appendChild(makeElement('span', '' + version, null, {fontSize: '8pt', background: 'black', color: 'white', paddingLeft: '3px', paddingRight: '3px', paddingTop: '1px', paddingBottom: '1px', marginLeft: '2px', borderRadius: '10px'}));\n }\n this.nameElement = makeElement('span', source.name);\n this.nameButton.appendChild(makeElement('span', [this.nameElement, this.infoElement], {className: 'track-name-holder'}));\n this.nameButton.appendChild(this.bumpButton);\n this.nameButton.appendChild(this.loaderButton);\n\n this.label = makeElement('span',\n [this.nameButton],\n {className: 'btn-group track-label'});\n\n var classes = 'tier' + (source.className ? ' ' + source.className : '');\n this.row = makeElement('div', [this.viewportHolder,\n this.overlay,\n this.quantOverlay],\n {className: classes});\n\n if (!background) {\n this.row.style.background = 'none';\n }\n\n if (!browser.noDefaultLabels)\n this.row.appendChild(this.label);\n this.row.appendChild(this.notifierHolder);\n \n this.layoutHeight = 25;\n this.bumped = true;\n this.styleIdSeed = 0;\n if (source.quantLeapThreshold) {\n this.quantLeapThreshold = source.quantLeapThreshold;\n }\n if (this.dasSource.collapseSuperGroups) {\n this.bumped = false;\n }\n this.layoutWasDone = false;\n\n if (source.featureInfoPlugin) {\n this.addFeatureInfoPlugin(source.featureInfoPlugin);\n }\n\n this.initSources();\n\n var thisB = this;\n if (this.featureSource && this.featureSource.getDefaultFIPs && !source.noSourceFeatureInfo) {\n this.featureSource.getDefaultFIPs(function(fip) {\n if (fip)\n thisB.addFeatureInfoPlugin(fip);\n });\n }\n\n if (this.featureSource && this.featureSource.addReadinessListener) {\n this.readinessListener = function(ready) {\n thisB.notify(ready, -1);\n };\n this.featureSource.addReadinessListener(this.readinessListener);\n }\n\n if (this.featureSource && this.featureSource.addActivityListener) {\n this.activityListener = function(busy) {\n if (busy > 0) {\n thisB.loaderButton.style.display = 'inline-block';\n } else {\n thisB.loaderButton.style.display = 'none';\n }\n thisB.browser.pingActivity();\n };\n this.featureSource.addActivityListener(this.activityListener);\n }\n\n this.listeners = [];\n this.featuresLoadedListeners = [];\n this.firstRenderPromise = new Promise((resolve, reject) => this._resolveFirstRenderPromise = resolve);\n}\n\nDasTier.prototype.destroy = function() {\n if (this.featureSource.removeReadinessListener) {\n this.featureSource.removeReadinessListener(this.readinessListener);\n }\n if (this.featureSource.removeActivityListener) {\n this.featureSource.removeActivityListener(this.activityListener);\n }\n}\n\nDasTier.prototype.setBackground = function(b) {\n this.background = b;\n this.viewportHolder.style.background = b;\n}\n\nDasTier.prototype.toString = function() {\n return this.id;\n}\n\nDasTier.prototype.addFeatureInfoPlugin = function(p) {\n if (!this.featureInfoPlugins) \n this.featureInfoPlugins = [];\n this.featureInfoPlugins.push(p);\n}\n\nDasTier.prototype.init = function() {\n var tier = this;\n return new Promise(function (resolve, reject) {\n \n if (tier.dasSource.style) {\n tier.setStylesheet({styles: tier.dasSource.style});\n resolve(tier);\n } else {\n tier.status = 'Fetching stylesheet';\n tier.fetchStylesheet(function(ss, err) {\n if (err || !ss) {\n tier.error = 'No stylesheet';\n var ss = new DASStylesheet();\n var defStyle = new DASStyle();\n defStyle.glyph = 'BOX';\n defStyle.BGCOLOR = 'blue';\n defStyle.FGCOLOR = 'black';\n ss.pushStyle({type: 'default'}, null, defStyle);\n tier.setStylesheet(ss);\n } else {\n tier.setStylesheet(ss);\n if (ss.geneHint) {\n tier.dasSource.collapseSuperGroups = true;\n tier.bumped = false;\n tier.updateLabel();\n }\n tier._updateFromConfig();\n }\n resolve(tier);\n });\n }\n });\n}\n\nDasTier.prototype.setStylesheet = function(ss) {\n this.baseStylesheet = shallowCopy(ss);\n for (var si = 0; si < this.baseStylesheet.styles.length; ++si) {\n var sh = this.baseStylesheet.styles[si] = shallowCopy(this.baseStylesheet.styles[si]);\n sh._methodRE = sh._labelRE = sh._typeRE = null;\n sh.style = shallowCopy(sh.style);\n sh.style.id = 'style' + (++this.styleIdSeed);\n }\n this.baseStylesheetValidity = b64_sha1(miniJSONify(this.baseStylesheet));\n this._updateFromConfig();\n}\n\nDasTier.prototype.getSource = function() {\n return this.featureSource;\n}\n\nDasTier.prototype.getDesiredTypes = function(scale) {\n var sfs = this.getActiveStyleFilters(scale);\n if (sfs)\n return sfs.typeList();\n}\n\nDasTier.prototype.getActiveStyleFilters = function(scale) {\n var ssScale = this.browser.zoomForCurrentScale();\n\n if (this.stylesheet) {\n var styles = new StyleFilterSet();\n var ss = this.stylesheet.styles;\n for (var si = 0; si < ss.length; ++si) {\n var sh = ss[si];\n if (!sh.zoom || sh.zoom == ssScale) {\n styles.add(new StyleFilter(sh.type, sh.method, sh.label));\n }\n }\n return styles;\n }\n}\n\nDasTier.prototype.needsSequence = function(scale) {\n var sourceConfigNeedsSeq = function(s) {\n if (s.bamURI || s.bamBlob || s.bwgURI || s.bwgBlob) {\n return true;\n } else if (s.overlay) {\n return s.overlay.some(sourceConfigNeedsSeq);\n } else {\n return false;\n }\n }\n\n if (this.sequenceSource && scale < 5) {\n return true;\n } else if (sourceConfigNeedsSeq(this.dasSource) && scale < 20) {\n return true\n }\n return false;\n}\n\nDasTier.prototype.setFeatures = function(chr, coverage, scale, features, sequence) {\n this.currentFeatures = features;\n this.currentSequence = sequence; \n this.knownChr = chr;\n this.knownCoverage = coverage;\n \n\n // only notify features loaded, if they are valid\n if (features) {\n sortFeatures(this);\n this.notifyFeaturesLoaded();\n }\n}\n\n\nDasTier.prototype.draw = function() {\n console.log(\"Use browser.getTierRenderer(tier).drawTier(tier)\");\n}\n\nDasTier.prototype.findNextFeature = function(chr, pos, dir, fedge, callback) {\n if (this.quantLeapThreshold) {\n var width = this.browser.viewEnd - this.browser.viewStart + 1;\n pos = (pos + ((width * dir) / 2))|0\n this.featureSource.quantFindNextFeature(chr, pos, dir, this.quantLeapThreshold, callback);\n } else {\n if (this.knownCoverage && pos >= this.knownCoverage.min() && pos <= this.knownCoverage.max()) {\n if (this.currentFeatures) {\n var bestFeature = null;\n for (var fi = 0; fi < this.currentFeatures.length; ++fi) {\n var f = this.currentFeatures[fi];\n if (!f.min || !f.max) {\n continue;\n }\n if (f.parents && f.parents.length > 0) {\n continue;\n }\n if (dir < 0) {\n if (fedge == 1 && f.max >= pos && f.min < pos) {\n if (!bestFeature || f.min > bestFeature.min ||\n (f.min == bestFeature.min && f.max < bestFeature.max)) {\n bestFeature = f;\n }\n } else if (f.max < pos) {\n if (!bestFeature || f.max > bestFeature.max || \n (f.max == bestFeature.max && f.min < bestFeature.min) ||\n (f.min == bestFeature.mmin && bestFeature.max >= pos)) {\n bestFeature = f;\n } \n }\n } else {\n if (fedge == 1 && f.min <= pos && f.max > pos) {\n if (!bestFeature || f.max < bestFeature.max ||\n (f.max == bestFeature.max && f.min > bestFeature.min)) {\n bestFeature = f;\n }\n } else if (f.min > pos) {\n if (!bestFeature || f.min < bestFeature.min ||\n (f.min == bestFeature.min && f.max > bestFeature.max) ||\n (f.max == bestFeature.max && bestFeature.min <= pos)) {\n bestFeature = f;\n }\n }\n }\n }\n if (bestFeature) {\n return callback(bestFeature);\n }\n if (dir < 0) {\n pos = this.browser.knownSpace.min;\n } else {\n pos = this.browser.knownSpace.max;\n }\n }\n }\n\n this.trySourceFNF(chr, pos, dir, callback);\n }\n}\n\nDasTier.prototype.trySourceFNF = function(chr, pos, dir, callback) {\n var self = this;\n this.featureSource.findNextFeature(chr, pos, dir, function(feature) {\n if (!feature)\n callback(feature);\n\n var ss = self.browser.getSequenceSource();\n if (!ss) // We're probably in trouble, but return anyway.\n callback(feature)\n\n ss.getSeqInfo(feature.segment, function(si) {\n if (si)\n callback(feature);\n else\n self.trySourceFNF(feature.segment, dir > 0 ? 10000000000 : 0, dir, callback);\n });\n });\n}\n\n\nDasTier.prototype.updateLabel = function() {\n this.bumpButton.className = this.bumped ? 'fa fa-minus-circle' : 'fa fa-plus-circle';\n if (this.dasSource.collapseSuperGroups) {\n this.bumpButton.style.display = 'inline-block';\n } else {\n this.bumpButton.style.display = 'none';\n }\n}\n\nDasTier.prototype.updateHeight = function() {\n this.currentHeight = Math.max(Math.max(this.layoutHeight, this.label.clientHeight + 2), this.browser.minTierHeight);\n this.row.style.height = '' + this.currentHeight + 'px';\n this.browser.updateHeight();\n }\n\n\nDasTier.prototype.drawOverlay = function() {\n var t = this;\n var b = this.browser;\n var retina = b.retina && window.devicePixelRatio > 1;\n \n t.overlay.height = t.viewport.height;\n t.overlay.width = retina ? b.featurePanelWidth * 2 : b.featurePanelWidth;\n\n var g = t.overlay.getContext('2d');\n if (retina) {\n g.scale(2, 2);\n }\n \n var origin = b.viewStart;\n var visStart = b.viewStart;\n var visEnd = b.viewEnd;\n\n if (this.overlayLabelCanvas) {\n var offset = ((this.glyphCacheOrigin - this.browser.viewStart)*this.browser.scale);\n g.save();\n g.translate(offset, 0);\n var drawStart = -offset + 2;\n if (this.dasSource.tierGroup)\n drawStart += 15;\n this.overlayLabelCanvas.draw(g, drawStart, b.featurePanelWidth-offset);\n g.restore();\n }\n\n for (var hi = 0; hi < b.highlights.length; ++hi) {\n var h = b.highlights[hi];\n if (((h.chr === b.chr) || (h.chr === ('chr' + b.chr))) && h.min < visEnd && h.max > visStart) {\n g.globalAlpha = b.defaultHighlightAlpha;\n g.fillStyle = b.defaultHighlightFill;\n g.fillRect((h.min - origin) * b.scale,\n 0,\n (h.max - h.min) * b.scale,\n t.overlay.height);\n }\n } \n\n // t.oorigin = b.viewStart;\n t.overlay.style.width = b.featurePanelWidth;\n t.overlay.style.height = t.viewport.style.height;\n t.overlay.style.left = '0px';\n}\n\n\nDasTier.prototype.updateStatus = function(status) {\n var self = this;\n if (status) {\n this.status = status;\n this._notifierToStatus();\n var sd = sourceDataURI(this.dasSource);\n if (window.location.protocol === 'https:' && sourceDataURI(this.dasSource).indexOf('http:') == 0 && !this.checkedHTTP) {\n this.checkedHTTP = true;\n this.browser.canFetchPlainHTTP().then(\n function(can) {\n if (!can) {\n self.warnHTTP = true;\n self._notifierToStatus();\n }\n }\n );\n }\n } else {\n if (this.status) {\n this.status = null\n this._notifierToStatus();\n }\n }\n}\n\nDasTier.prototype.notify = function(message, timeout) {\n if (typeof(timeout) !== 'number')\n timeout = 2000;\n\n if (this.notifierFadeTimeout) {\n clearTimeout(this.notifierFadeTimeout);\n this.notifierFadeTimeout = null;\n }\n\n if (message) {\n this._notifierOn(message);\n if (timeout > 0) {\n var thisB = this;\n this.notifierFadeTimeout = setTimeout(function() {\n thisB._notifierToStatus();\n }, timeout);\n }\n } else {\n this._notifierToStatus();\n }\n}\n\nDasTier.prototype._notifierOn = function(message, warnHTTP) {\n removeChildren(this.notifier);\n if (warnHTTP) {\n this.notifier.appendChild(\n makeElement(\n 'span',\n [makeElement('a', '[HTTP Warning] ', {href: this.browser.httpWarningURL, target: \"_blank\"}),\n message]\n )\n );\n } else {\n this.notifier.textContent = message;\n }\n this.notifier.style.opacity = 0.8;\n}\n\nDasTier.prototype._notifierOff = function() {\n this.notifier.style.opacity = 0;\n}\n\nDasTier.prototype._notifierToStatus = function() {\n if (this.status) {\n this._notifierOn(this.status, this.warnHTTP)\n } else {\n this._notifierOff();\n }\n}\n\nDasTier.prototype.setConfig = function(config) {\n this.config = config || {};\n this._updateFromConfig();\n this.notifyTierListeners();\n}\n\nDasTier.prototype.mergeStylesheet = function(newStyle) {\n this.mergeConfig({\n stylesheet: newStyle, \n stylesheetValidity: this.baseStylesheetValidity\n });\n}\n\nDasTier.prototype.mergeConfig = function(newConfig) {\n for (var k in newConfig) {\n this.config[k] = newConfig[k];\n }\n this._updateFromConfig();\n this.notifyTierListeners();\n}\n\nDasTier.prototype._updateFromConfig = function() {\n var needsRefresh = false;\n var needsReorder = false;\n\n if (typeof this.config.name === 'string')\n this.nameElement.textContent = this.config.name;\n else\n this.nameElement.textContent = this.dasSource.name;\n\n var wantedHeight = this.config.height || this.dasSource.forceHeight;\n if (wantedHeight != this.forceHeight) {\n this.forceHeight = wantedHeight;\n needsRefresh = true;\n }\n\n if (this.forceMinDynamic != this.config.forceMinDynamic) {\n this.forceMinDynamic = this.config.forceMinDynamic;\n needsRefresh = true;\n }\n\n var forceMin = this.config.forceMin != undefined ? this.config.forceMin : this.dasSource.forceMin;\n if (this.forceMin != forceMin) {\n this.forceMin = forceMin;\n needsRefresh = true;\n }\n\n if (this.forceMaxDynamic != this.config.forceMaxDynamic) {\n this.forceMaxDynamic = this.config.forceMaxDynamic;\n needsRefresh = true;\n }\n \n var forceMax = this.config.forceMax != undefined ? this.config.forceMax : this.dasSource.forceMax;\n if (this.forceMax != forceMax) {\n this.forceMax = forceMax;\n needsRefresh = true;\n }\n\n var quantLeapThreshold = null;\n if (this.config.quantLeapThreshold !== undefined)\n quantLeapThreshold = this.config.quantLeapThreshold;\n else if (this.dasSource.quantLeapThreshold !== undefined)\n quantLeapThreshold = this.dasSource.quantLeapThreshold;\n if (quantLeapThreshold != this.quantLeapThreshold) {\n this.quantLeapThreshold = quantLeapThreshold;\n needsRefresh = true;\n }\n \n // Possible FIXME -- are there cases where style IDs need to be reassigned?\n var stylesheet = null;\n if (this.config.stylesheetValidity == this.baseStylesheetValidity)\n stylesheet = this.config.stylesheet;\n stylesheet = stylesheet || this.baseStylesheet;\n if (this.stylesheet !== stylesheet) {\n this.stylesheet = stylesheet;\n needsRefresh = true;\n }\n\n var wantedPinned = this.config.pinned !== undefined ? this.config.pinned : this.dasSource.pinned;\n if (wantedPinned !== this.pinned) {\n this.pinned = wantedPinned;\n needsReorder = true;\n }\n\n var wantedSubtierMax = (typeof(this.config.subtierMax === 'number') ? \n this.config.subtierMax : this.dasSource.subtierMax || this.browser.defaultSubtierMax);\n if (wantedSubtierMax != this.subtierMax) {\n this.subtierMax = wantedSubtierMax;\n needsRefresh = true;\n }\n\n var wantedBumped;\n if (this.config.bumped !== undefined) {\n wantedBumped = this.config.bumped;\n } else if (this.dasSource.bumped !== undefined) {\n wantedBumped = this.dasSource.bumped;\n } else {\n wantedBumped = this.dasSource.collapseSuperGroups ? false : true;\n }\n if (wantedBumped !== this.bumped) {\n this.bumped = wantedBumped;\n needsRefresh = true;\n this.updateLabel();\n }\n\n if (needsRefresh)\n this.scheduleRedraw();\n\n if (needsReorder)\n this.browser.reorderTiers();\n}\n\nDasTier.prototype.scheduleRedraw = function() {\n if (!this.currentFeatures)\n return;\n \n var tier = this;\n\n if (!this.redrawTimeout) {\n this.redrawTimeout = setTimeout(function() {\n sortFeatures(tier); // Some render actions mutate the results of this,\n // => need to re-run before refreshing.\n var renderer = tier.browser.getTierRenderer(tier);\n renderer.drawTier(tier);\n tier.redrawTimeout = null;\n }, 10);\n }\n}\nDasTier.prototype.clearTierListeners = function() {\n\tthis.listeners = [];\n}\n\n\nDasTier.prototype.addTierListener = function(l) {\n this.listeners.push(l);\n}\n\nDasTier.prototype.removeTierListener = function(l) {\n var idx = arrayIndexOf(this.listeners, l);\n if (idx >= 0) {\n this.listeners.splice(idx, 1);\n }\n}\n\nDasTier.prototype.notifyTierListeners = function(change) {\n for (var li = 0; li < this.listeners.length; ++li) {\n try {\n this.listeners[li](change);\n } catch (e) {\n console.log(e);\n }\n }\n this.browser.notifyTier();\n}\n\nDasTier.prototype.clearFeaturesLoadedListeners = function() {\n this.featuresLoadedListeners = [];\n}\n\nDasTier.prototype.addFeaturesLoadedListener = function(handler) {\n this.featuresLoadedListeners.push(handler);\n}\n\nDasTier.prototype.removeFeaturesLoadedListener = function(handler) {\n var idx = arrayIndexOf(this.featuresLoadedListeners, handler);\n if (idx >= 0) {\n this.featuresLoadedListeners.splice(idx, 1);\n }\n}\n\nDasTier.prototype.notifyFeaturesLoaded = function() {\n for (var li = 0; li < this.featuresLoadedListeners.length; ++li) {\n try {\n this.featuresLoadedListeners[li].call(this);\n } catch (e) {\n console.log(e);\n }\n }\n}\n\nDasTier.prototype.wasRendered = function() {\n this._resolveFirstRenderPromise();\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n DasTier: DasTier\n };\n\n // Imported for side effects\n var fd = require('./feature-draw');\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// track-adder.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var browser = require('./cbrowser');\n var Browser = browser.Browser;\n\n var sc = require('./sourcecompare');\n var sourcesAreEqual = sc.sourcesAreEqual;\n\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n var removeChildren = utils.removeChildren;\n var Observed = utils.Observed;\n\n var thub = require('./thub');\n var THUB_COMPARE = thub.THUB_COMPARE;\n var connectTrackHub = thub.connectTrackHub;\n\n var domui = require('./domui');\n var makeTreeTableSection = domui.makeTreeTableSection;\n\n var probeResource = require('./probe').probeResource;\n\n\n // Most of this could disappear if we leave all probing to the probe module...\n var bin = require('./bin');\n var URLFetchable = bin.URLFetchable;\n var BlobFetchable = bin.BlobFetchable;\n var readInt = bin.readInt;\n\n var lh3utils = require('./lh3utils');\n var unbgzf = lh3utils.unbgzf;\n\n var bam = require('./bam');\n var BAM_MAGIC = bam.BAM_MAGIC;\n var BAI_MAGIC = bam.BAI_MAGIC;\n\n var tbi = require('./tabix');\n var TABIX_MAGIC = tbi.TABIX_MAGIC;\n\n var das = require('./das');\n var DASSource = das.DASSource;\n var DASSegment = das.DASSegment;\n var DASRegistry = das.DASRegistry;\n var coordsMatch = das.coordsMatch;\n\n var EncodeFetchable = require('./encode').EncodeFetchable;\n}\n\nBrowser.prototype.currentlyActive = function(source) {\n for (var ti = 0; ti < this.tiers.length; ++ti) {\n if (sourcesAreEqual(this.tiers[ti].dasSource, source))\n return this.tiers[ti];\n }\n return false;\n}\n\nBrowser.prototype.makeButton = function(name, tooltip) {\n var regButton = makeElement('a', name, {href: '#'});\n if (tooltip) {\n this.makeTooltip(regButton, tooltip);\n }\n return makeElement('li', regButton);\n}\n\nfunction activateButton(addModeButtons, which) {\n for (var i = 0; i < addModeButtons.length; ++i) {\n var b = addModeButtons[i];\n if (b === which) {\n b.classList.add('active');\n } else {\n b.classList.remove('active');\n }\n }\n}\n\nBrowser.prototype.showTrackAdder = function(ev) {\n if (this.uiMode === 'add') {\n this.hideToolPanel();\n this.setUiMode('none');\n return;\n }\n\n var thisB = this;\n\n var popup = makeElement('div', null, {className: 'dalliance'} , {width: '100%', display: 'inline-block', boxSizing: 'border-box', MozBoxSizing: 'border-box', verticalAlign: 'top', paddingRight: '15px'});\n\n var addModeButtons = [];\n var makeStab, makeStabObserver;\n\n\n if (!this.noRegistryTabs) {\n var regButton = this.makeButton('Registry', 'Browse compatible datasources from the DAS registry');\n addModeButtons.push(regButton);\n \n for (var m in this.mappableSources) {\n var mf = function(mm) {\n var mapButton = thisB.makeButton(thisB.chains[mm].srcTag, 'Browse datasources mapped from ' + thisB.chains[mm].srcTag);\n addModeButtons.push(mapButton);\n mapButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n activateButton(addModeButtons, mapButton);\n makeStab(thisB.mappableSources[mm], mm);\n }, false);\n }; mf(m);\n }\n }\n\n var groupedDefaults = {};\n for (var si = 0; si < this.defaultSources.length; ++si) {\n var s = this.defaultSources[si];\n var g = s.group || 'Defaults';\n if (groupedDefaults[g]) {\n groupedDefaults[g].push(s);\n } else {\n groupedDefaults[g] = [s];\n }\n }\n \n\n var makeHubButton = function(tdb) {\n var hub = tdb.hub;\n var hubMenuButton = makeElement('i', null, {className: 'fa fa-list-alt'}, {cursor: 'context-menu'});\n var label = hub.altLabel || hub.shortLabel || 'Unknown';\n if (tdb.mapping)\n label = label + ' (' + tdb.genome + ')';\n var hbContent = makeElement('span', [label, ' ', hubMenuButton]);\n var hubButton = thisB.makeButton(hbContent, hub.longLabel);\n hubButton.hub = tdb;\n addModeButtons.push(hubButton);\n \n hubButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n activateButton(addModeButtons, hubButton);\n removeChildren(stabHolder);\n var loader = thisB.makeLoader(24);\n loader.style.marginLeft = 'auto';\n loader.style.marginRight = 'auto';\n loader.style.marginTop = '100px';\n stabHolder.appendChild(makeElement('div', loader, null, {textAlign: 'center'}));\n\n refreshButton.style.display = 'none';\n addButton.style.display = 'none';\n canButton.style.display = 'none';\n\n tdb.getTracks(function(tracks, err) {\n if (err) {\n console.log(err);\n }\n \n makeHubStab(tracks);\n });\n }, false);\n\n hubMenuButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n \n var removeHubItem = makeElement('li', makeElement('a', 'Remove hub'));\n var allOnItem = makeElement('li', makeElement('a', 'Enable all'));\n var allOffItem = makeElement('li', makeElement('a', 'Disable all'));\n var hubMenu = makeElement('ul', [removeHubItem, allOnItem, allOffItem], {className: 'dropdown-menu'}, {display: 'block'});\n\n var mx = ev.clientX, my = ev.clientY;\n mx += document.documentElement.scrollLeft || document.body.scrollLeft;\n my += document.documentElement.scrollTop || document.body.scrollTop;\n\n hubMenu.style.position = 'absolute';\n hubMenu.style.top = '' + (my+10) + 'px';\n hubMenu.style.left = '' + (mx-30) + 'px';\n thisB.hPopupHolder.appendChild(hubMenu);\n\n var clickCatcher = function(ev) {\n console.log('cc');\n document.body.removeEventListener('click', clickCatcher, true);\n thisB.hPopupHolder.removeChild(hubMenu);\n };\n document.body.addEventListener('click', clickCatcher, true);\n\n removeHubItem.addEventListener('click', function(ev) {\n for (var hi = 0; hi < thisB.hubObjects.length; ++hi) {\n if (thisB.hubObjects[hi].absURL == tdb.absURL) {\n thisB.hubObjects.splice(hi, 1);\n break;\n }\n }\n for (var hi = 0; hi < thisB.hubs.length; ++hi) {\n var hc = thisB.hubs[hi];\n if (typeof hc === 'string')\n hc = {url: hc};\n if (hc.url == tdb.hub.url && !hc.genome || hc.genome == tdb.genome) {\n thisB.hubs.splice(hi, 1);\n break;\n }\n\n }\n\n thisB.notifyTier();\n\n modeButtonHolder.removeChild(hubButton);\n activateButton(addModeButtons, addHubButton);\n switchToHubConnectMode();\n }, false);\n\n\n allOnItem.addEventListener('click', function(ev) {\n tdb.getTracks(function(tracks, err) {\n if (err) {\n console.log(err);\n }\n \n for (var ti = 0; ti < tracks.length; ++ti) {\n var ds = tracks[ti].toDallianceSource();\n if (!thisB.currentlyActive(ds)) {\n thisB.addTier(ds);\n }\n }\n });\n }, false);\n\n allOffItem.addEventListener('click', function(ev) {\n tdb.getTracks(function(tracks, err) {\n if (err) {\n console.log(err);\n }\n \n for (var ti = 0; ti < tracks.length; ++ti) {\n var ds = tracks[ti].toDallianceSource();\n if (thisB.currentlyActive(ds)) {\n thisB.removeTier(ds);\n }\n }\n });\n }, false);\n }, false);\n\n return hubButton;\n }\n\n var firstDefButton = null;\n var firstDefSources = null;\n for (var g in groupedDefaults) {\n (function(g, ds) {\n var defButton = thisB.makeButton(g, 'Browse the default set of data for this browser');\n defButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n activateButton(addModeButtons, defButton);\n makeStab(new Observed(ds));\n }, false);\n addModeButtons.push(defButton);\n\n if (!firstDefButton || thisB.defaultTrackAdderTab && thisB.defaultTrackAdderTab == g) {\n firstDefButton = defButton;\n firstDefSources = ds;\n }\n })(g, groupedDefaults[g]);\n } \n var custButton = this.makeButton('DAS', 'Add data using the DAS protocol');\n addModeButtons.push(custButton);\n var binButton = this.makeButton('Files', 'Add data from files on disk or the web');\n addModeButtons.push(binButton);\n\n\n for (var hi = 0; hi < this.hubObjects.length; ++hi) {\n var hub = this.hubObjects[hi];\n makeHubButton(hub);\n }\n\n var addHubButton = this.makeButton('+', 'Connect to a new track-hub');\n addModeButtons.push(addHubButton);\n\n\n var modeButtonHolder = makeElement('ul', addModeButtons, {className: 'nav nav-tabs'}, {marginBottom: '0px'});\n popup.appendChild(modeButtonHolder);\n \n var custURL, custName, custCS, custQuant, custFile, custUser, custPass;\n var customMode = false;\n var dataToFinalize = null;\n\n var asform = makeElement('form', null, {}, {display: 'inline-block', width: '100%'});\n asform.addEventListener('submit', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n doAdd();\n return false;\n }, true); \n var stabHolder = makeElement('div');\n stabHolder.style.position = 'relative';\n stabHolder.style.overflow = 'scroll';\n // stabHolder.style.height = '500px';\n asform.appendChild(stabHolder);\n\n var __mapping;\n var __sourceHolder;\n\n\n makeStab = function(msources, mapping) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'none';\n canButton.style.display = 'none';\n if (__sourceHolder) {\n __sourceHolder.removeListener(makeStabObserver);\n }\n __mapping = mapping;\n __sourceHolder = msources;\n __sourceHolder.addListenerAndFire(makeStabObserver);\n }\n\n makeStabObserver = function(msources) {\n customMode = false;\n var buttons = [];\n removeChildren(stabHolder);\n if (!msources) {\n stabHolder.appendChild(makeElement('p', 'Dalliance was unable to retrieve data source information from the DAS registry, please try again later'));\n return;\n }\n \n var stabBody = makeElement('tbody', null, {className: 'table table-striped table-condensed'}, {width: '100%'});\n var stab = makeElement('table', stabBody, {className: 'table table-striped table-condensed'}, {width: '100%', tableLayout: 'fixed'}); \n var idx = 0;\n\n var sources = [];\n for (var i = 0; i < msources.length; ++i) {\n sources.push(msources[i]);\n }\n \n sources.sort(function(a, b) {\n return a.name.toLowerCase().trim().localeCompare(b.name.toLowerCase().trim());\n });\n\n for (var i = 0; i < sources.length; ++i) {\n var source = sources[i];\n var r = makeElement('tr');\n\n var bd = makeElement('td', null, {}, {width: '30px'});\n bd.style.textAlign = 'center';\n if (!source.props || source.props.cors) {\n var b = makeElement('input');\n b.type = 'checkbox';\n b.dalliance_source = source;\n b.id = 'sourcecb' + i;\n if (__mapping) {\n b.dalliance_mapping = __mapping;\n }\n // b.checked = thisB.currentlyActive(source);\n bd.appendChild(b);\n buttons.push(b);\n b.addEventListener('change', function(ev) {\n if (ev.target.checked) {\n thisB.addTier(ev.target.dalliance_source);\n } else {\n thisB.removeTier(ev.target.dalliance_source);\n }\n });\n } else {\n bd.appendChild(document.createTextNode('!'));\n thisB.makeTooltip(bd, makeElement('span', [\"This data source isn't accessible because it doesn't support \", makeElement('a', \"CORS\", {href: 'http://www.w3.org/TR/cors/'}), \".\"]));\n }\n r.appendChild(bd);\n var ld = makeElement('label', null, {htmlFor: 'sourcecb' + i});\n ld.appendChild(document.createTextNode(source.name));\n if (source.desc && source.desc.length > 0) {\n thisB.makeTooltip(ld, source.desc);\n }\n r.appendChild(makeElement('td', ld));\n stabBody.appendChild(r);\n ++idx;\n }\n\n var setChecks = function() {\n for (var bi = 0; bi < buttons.length; ++bi) {\n var b = buttons[bi];\n var t = thisB.currentlyActive(b.dalliance_source);\n if (t) {\n b.checked = true;\n } else {\n b.checked = false;\n }\n }\n }\n setChecks();\n thisB.addTierListener(function(l) {\n setChecks();\n });\n\n stabHolder.appendChild(stab);\n };\n\n function makeHubStab(tracks) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'none';\n canButton.style.display = 'none';\n\n customMode = false;\n removeChildren(stabHolder);\n \n let buttonIdSeed = 0;\n\n var ttab = makeElement('div', null, {}, {width: '100%'});\n var sources = [];\n for (var i = 0; i < tracks.length; ++i) {\n sources.push(tracks[i]);\n }\n \n sources.sort(function(a, b) {\n return a.shortLabel.toLowerCase().trim().localeCompare(b.shortLabel.toLowerCase().trim());\n });\n\n var groups = [];\n var tops = [];\n \n for (var ti = 0; ti < sources.length; ++ti) {\n var track = sources[ti];\n if (track.children && track.children.length > 0 && track.container != 'multiWig') {\n groups.push(track);\n } else {\n tops.push(track);\n }\n }\n if (tops.length > 0) {\n groups.push({\n shortLabel: 'Others',\n priority: -100000000,\n children: tops});\n }\n\n groups.sort(THUB_COMPARE);\n \n var buttons = [];\n for (var gi = 0; gi < groups.length; ++gi) {\n var group = groups[gi];\n var dg = group;\n if (!dg.dimensions && dg._parent && dg._parent.dimensions)\n dg = dg._parent;\n\n var dprops = {}\n if (dg.dimensions) {\n var dtoks = dg.dimensions.split(/(\\w+)=(\\w+)/);\n for (var dti = 0; dti < dtoks.length - 2; dti += 3) {\n dprops[dtoks[dti + 1]] = dtoks[dti + 2];\n }\n }\n\n if (dprops.dimX && dprops.dimY) {\n var dimX = dprops.dimX, dimY = dprops.dimY;\n var sgX = dg.subgroups[dimX];\n var sgY = dg.subgroups[dimY];\n \n var trks = {};\n for (var ci = 0; ci < group.children.length; ++ci) {\n var child = group.children[ci];\n var vX = child.sgm[dimX], vY = child.sgm[dimY];\n if (!trks[vX])\n trks[vX] = {};\n trks[vX][vY] = child;\n }\n\n var matrix = makeElement('table', null, {className: 'table table-striped table-condensed'}, {tableLayout: 'fixed'});\n {\n var header = makeElement('tr');\n header.appendChild(makeElement('th', null, {}, {width: '150px', height: '100px'})); // blank corner element\n for (var si = 0; si < sgX.titles.length; ++si) {\n var h = makeElement('th', makeElement('div', sgX.titles[si], {}, {transform: 'rotate(-60deg)', \n transformOrigin: '0% 100%', \n webkitTransform: 'rotate(-60deg) translate(20px,10px)', \n webkitTransformOrigin: '0% 100%',\n textAlign: 'left'}), {}, {width: '35px',\n height: '100px',\n verticalAlign: 'bottom'})\n header.appendChild(h);\n }\n matrix.appendChild(header);\n }\n\n var mbody = makeElement('tbody', null, {className: 'table table-striped table-condensed'})\n for (var yi = 0; yi < sgY.titles.length; ++yi) {\n var vY = sgY.tags[yi];\n var row = makeElement('tr');\n row.appendChild(makeElement('th', sgY.titles[yi]), {});\n \n for (var xi = 0; xi < sgX.titles.length; ++xi) {\n var vX = sgX.tags[xi];\n var cell = makeElement('td');\n if (trks[vX] && trks[vX][vY]) {\n var track = trks[vX][vY];\n var ds = track.toDallianceSource();\n if (!ds)\n continue;\n \n var r = makeElement('tr');\n var bd = makeElement('td');\n bd.style.textAlign = 'center';\n \n var b = makeElement('input');\n b.type = 'checkbox';\n b.dalliance_source = ds;\n if (__mapping) {\n b.dalliance_mapping = __mapping;\n }\n buttons.push(b);\n cell.appendChild(b);\n b.addEventListener('change', function(ev) {\n if (ev.target.checked) {\n thisB.addTier(ev.target.dalliance_source);\n } else {\n thisB.removeTier(ev.target.dalliance_source);\n }\n });\n\n }\n row.appendChild(cell);\n } \n mbody.appendChild(row);\n }\n matrix.appendChild(mbody);\n ttab.appendChild(makeTreeTableSection(group.shortLabel, matrix, gi==0)); \n } else {\n var stabBody = makeElement('tbody', null, {className: 'table table-striped table-condensed'});\n var stab = makeElement('table', stabBody, {className: 'table table-striped table-condensed'}, {width: '100%', tableLayout: 'fixed'}); \n var idx = 0;\n \n group.children.sort(THUB_COMPARE);\n for (var i = 0; i < group.children.length; ++i) {\n const buttonId = 'hb' + (++buttonIdSeed);\n\n var track = group.children[i];\n var ds = track.toDallianceSource();\n if (!ds)\n continue;\n\n var r = makeElement('tr');\n var bd = makeElement('td', null, {}, {width: '30px'});\n bd.style.textAlign = 'center';\n \n var b = makeElement('input');\n b.type = 'checkbox';\n b.dalliance_source = ds;\n b.id = buttonId;\n if (__mapping) {\n b.dalliance_mapping = __mapping;\n }\n buttons.push(b);\n bd.appendChild(b);\n b.addEventListener('change', function(ev) {\n if (ev.target.checked) {\n thisB.addTier(ev.target.dalliance_source);\n } else {\n thisB.removeTier(ev.target.dalliance_source);\n }\n });\n\n r.appendChild(bd);\n var ld = makeElement('label', null, {htmlFor: buttonId});\n ld.appendChild(document.createTextNode(track.shortLabel));\n if (track.longLabel && track.longLabel.length > 0) {\n thisB.makeTooltip(ld, track.longLabel);\n }\n r.appendChild(makeElement('td', ld));\n stabBody.appendChild(r);\n ++idx;\n }\n\n if (groups.length > 1 || group.shortLabel !== 'Others') {\n ttab.appendChild(makeTreeTableSection(group.shortLabel, stab, gi==0));\n } else {\n ttab.appendChild(stab);\n }\n \n }\n }\n\n var setChecks = function() {\n for (var bi = 0; bi < buttons.length; ++bi) {\n var b = buttons[bi];\n var t = thisB.currentlyActive(b.dalliance_source);\n if (t) {\n b.checked = true;\n b.disabled = t.sequenceSource != null;\n } else {\n b.checked = false;\n }\n }\n }\n setChecks();\n thisB.addTierListener(function(l) {\n setChecks();\n });\n \n stabHolder.appendChild(ttab);\n }\n\n if (regButton) {\n regButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n activateButton(addModeButtons, regButton);\n makeStab(thisB.availableSources);\n }, false);\n }\n \n binButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n switchToBinMode();\n }, false);\n addHubButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n switchToHubConnectMode();\n }, false);\n\n\n function switchToBinMode() {\n activateButton(addModeButtons, binButton);\n customMode = 'bin';\n\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'none';\n\n removeChildren(stabHolder);\n var pageHolder = makeElement('div', null, {}, {paddingLeft: '10px', paddingRight: '10px'});\n pageHolder.appendChild(makeElement('h3', 'Add custom URL-based data'));\n pageHolder.appendChild(makeElement('p', ['You can add indexed binary data hosted on an web server that supports CORS (', makeElement('a', 'full details', {href: 'http://www.biodalliance.org/bin.html'}), '). Currently supported formats are bigwig, bigbed, and indexed BAM.']));\n\n pageHolder.appendChild(makeElement('br'));\n pageHolder.appendChild(document.createTextNode('URL: '));\n custURL = makeElement('input', '', {size: 80, value: 'http://www.biodalliance.org/datasets/ensGene.bb'}, {width: '100%'});\n pageHolder.appendChild(custURL);\n \n pageHolder.appendChild(makeElement('br'));\n pageHolder.appendChild(makeElement('b', '- or -'));\n pageHolder.appendChild(makeElement('br'));\n pageHolder.appendChild(document.createTextNode('File: '));\n custFile = makeElement('input', null, {type: 'file', multiple: 'multiple'});\n pageHolder.appendChild(custFile);\n \n pageHolder.appendChild(makeElement('p', 'Clicking the \"Add\" button below will initiate a series of test queries.'));\n\n stabHolder.appendChild(pageHolder);\n custURL.focus();\n }\n\n function switchToHubConnectMode() {\n activateButton(addModeButtons, addHubButton);\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'none';\n\n customMode = 'hub-connect';\n refreshButton.style.visibility = 'hidden';\n\n removeChildren(stabHolder);\n\n var pageHolder = makeElement('div', null, {}, {paddingLeft: '10px', paddingRight: '10px'});\n pageHolder.appendChild(makeElement('h3', 'Connect to a track hub.'));\n pageHolder.appendChild(makeElement('p', ['Enter the top-level URL (usually points to a file called \"hub.txt\") of a UCSC-style track hub']));\n \n custURL = makeElement('input', '', {size: 120, value: 'http://www.biodalliance.org/datasets/testhub/hub.txt'}, {width: '100%'});\n pageHolder.appendChild(custURL);\n \n stabHolder.appendChild(pageHolder);\n \n custURL.focus();\n }\n\n custButton.addEventListener('click', function(ev) {\n ev.preventDefault(); ev.stopPropagation();\n switchToCustomMode();\n }, false);\n\n function switchToCustomMode() {\n activateButton(addModeButtons, custButton);\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'none';\n\n customMode = 'das';\n\n removeChildren(stabHolder);\n\n var customForm = makeElement('div', null, {}, {paddingLeft: '10px', paddingRight: '10px'});\n customForm.appendChild(makeElement('h3', 'Add custom DAS data'));\n customForm.appendChild(makeElement('p', 'This interface is intended for adding custom or lab-specific data. Public data can be added more easily via the registry interface.'));\n \n customForm.appendChild(document.createTextNode('URL: '));\n customForm.appendChild(makeElement('br'));\n custURL = makeElement('input', '', {size: 80, value: 'http://www.derkholm.net:8080/das/medipseq_reads/'}, {width: '100%'});\n customForm.appendChild(custURL);\n\n customForm.appendChild(makeElement('p', 'Clicking the \"Add\" button below will initiate a series of test queries. If the source is password-protected, you may be prompted to enter credentials.'));\n stabHolder.appendChild(customForm);\n\n custURL.focus();\n }\n\n\n\n var addButton = makeElement('button', 'Add', {className: 'btn btn-primary'});\n addButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n doAdd();\n }, false);\n\n function doAdd() {\n if (customMode) {\n if (customMode === 'das') {\n var curi = custURL.value.trim();\n if (!/^.+:\\/\\//.exec(curi)) {\n curi = 'http://' + curi;\n }\n var nds = new DASSource({name: 'temporary', uri: curi});\n tryAddDAS(nds);\n } else if (customMode === 'bin') {\n var fileList = custFile.files;\n\n if (fileList && fileList.length > 0) {\n tryAddMultiple(fileList);\n } else {\n var curi = custURL.value.trim();\n if (!/^.+:\\/\\//.exec(curi)) {\n curi = 'http://' + curi;\n }\n var source = {uri: curi};\n var lcuri = curi.toLowerCase();\n if (lcuri.indexOf(\"https://www.encodeproject.org/\") == 0 &&\n lcuri.indexOf(\"@@download\") >= 0) \n {\n source.transport = 'encode';\n }\n tryAddBin(source);\n }\n } else if (customMode === 'reset') {\n switchToCustomMode();\n } else if (customMode === 'reset-bin') {\n switchToBinMode(); \n } else if (customMode === 'reset-hub') {\n switchToHubConnectMode();\n } else if (customMode === 'prompt-bai') {\n var fileList = custFile.files;\n if (fileList && fileList.length > 0 && fileList[0]) {\n dataToFinalize.baiBlob = fileList[0];\n completeBAM(dataToFinalize);\n } else {\n promptForBAI(dataToFinalize);\n }\n } else if (customMode === 'prompt-tbi') {\n var fileList = custFile.files;\n if (fileList && fileList.length > 0 && fileList[0]) {\n dataToFinalize.indexBlob = fileList[0];\n completeTabixVCF(dataToFinalize);\n } else {\n promptForTabix(dataToFinalize);\n }\n } else if (customMode === 'finalize' || customMode === 'finalize-bin') {\n dataToFinalize.name = custName.value;\n var m = custCS.value;\n if (m != '__default__') {\n dataToFinalize.mapping = m;\n } else {\n dataToFinalize.mapping = undefined;\n }\n if (custQuant) {\n dataToFinalize.maxbins = custQuant.checked;\n }\n\n if (custUser.value.length > 1 && custPass.value.length > 1) {\n dataToFinalize.xUser = custUser.value;\n dataToFinalize.xPass = custPass.value;\n }\n\n thisB.addTier(dataToFinalize);\n\n if (customMode == 'finalize-bin')\n switchToBinMode();\n else\n switchToCustomMode();\n } else if (customMode === 'hub-connect') {\n var curi = custURL.value.trim();\n if (!/^.+:\\/\\//.exec(curi)) {\n curi = 'http://' + curi;\n }\n \n tryAddHub(curi);\n } else if (customMode === 'multiple') {\n for (var mi = 0; mi < multipleSet.length; ++mi) {\n var s = multipleSet[mi];\n if (s.hidden)\n continue;\n\n if (s.tier_type == 'bam' && !s.indexBlob && !s.indexUri)\n continue;\n if (s.tier_type == 'tabix' && !s.indexBlob && !s.indexUri)\n continue;\n\n var nds = makeSourceConfig(s);\n if (nds) {\n nds.noPersist = true;\n thisB.addTier(nds);\n }\n }\n\n switchToBinMode();\n }\n } else {\n thisB.removeAllPopups();\n }\n };\n\n function tryAddHub(curi, opts, retry) {\n opts = opts || {};\n for (var hi = 0; hi < thisB.hubObjects.length; ++hi) {\n var h = thisB.hubObjects[hi];\n if (h.hub.url == curi) {\n for (var bi = 0; bi < addModeButtons.length; ++bi) {\n if (addModeButtons[bi].hub == h) {\n activateButton(addModeButtons, addModeButtons[bi]);\n }\n }\n h.getTracks(function(tracks, err) {\n if (err) {\n console.log(err);\n }\n makeHubStab(tracks);\n });\n return;\n }\n\n }\n \n connectTrackHub(curi, function(hub, err) {\n if (err) {\n if (!retry) {\n return tryAddHub(curi, {credentials: true}, true);\n }\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'Error connecting to track hub'))\n stabHolder.appendChild(makeElement('p', err));\n customMode = 'reset-hub';\n return;\n } else {\n var bestHub = null;\n var bestHubButton = null;\n for (var genome in hub.genomes) {\n var mapping = null;\n var okay = false;\n\n if (genome == thisB.coordSystem.ucscName) {\n okay = true;\n } else {\n for (var mid in thisB.chains) {\n var m = thisB.chains[mid];\n if (genome == m.coords.ucscName) {\n mapping = mid;\n okay = true;\n }\n }\n }\n\n if (okay) {\n var hc = {url: curi, genome: genome};\n if (opts.credentials)\n hc.credentials = true;\n if (mapping) {\n hc.mapping = mapping;\n hub.genomes[genome].mapping = mapping;\n }\n thisB.hubs.push(hc);\n thisB.hubObjects.push(hub.genomes[genome]);\n \n var hubButton = makeHubButton(hub.genomes[genome]);\n modeButtonHolder.appendChild(hubButton);\n\n if (!mapping || !bestHub) {\n bestHub = hub.genomes[genome];\n bestHubButton = hubButton;\n }\n }\n }\n\n if (bestHub) {\n thisB.notifyTier();\n activateButton(addModeButtons, bestHubButton);\n bestHub.getTracks(function(tracks, err) {\n makeHubStab(tracks);\n });\n } else {\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'No data for this genome'))\n stabHolder.appendChild(makeElement('p', 'This URL appears to be a valid track-hub, but it doesn\\'t contain any data for the coordinate system of this browser'));\n stabHolder.appendChild(makeElement('p', 'coordSystem.ucscName = ' + thisB.coordSystem.ucscName));\n customMode = 'reset-hub';\n return;\n }\n }\n }, opts);\n }\n\n var tryAddDAS = function(nds, retry) {\n var knownSpace = thisB.knownSpace;\n if (!knownSpace) {\n alert(\"Can't confirm track-addition to an uninit browser.\");\n return;\n }\n var tsm = Math.max(knownSpace.min, (knownSpace.min + knownSpace.max - 100) / 2)|0;\n var testSegment = new DASSegment(knownSpace.chr, tsm, Math.min(tsm + 99, knownSpace.max));\n nds.features(testSegment, {}, function(features, status) {\n if (status) {\n if (!retry) {\n nds.credentials = true;\n tryAddDAS(nds, true);\n } else {\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'Custom data not found'));\n stabHolder.appendChild(makeElement('p', 'DAS uri: ' + nds.uri + ' is not answering features requests'));\n customMode = 'reset';\n return;\n }\n } else {\n var nameExtractPattern = new RegExp('/([^/]+)/?$');\n var match = nameExtractPattern.exec(nds.uri);\n if (match) {\n nds.name = match[1];\n }\n\n tryAddDASxSources(nds);\n return;\n }\n });\n }\n\n function tryAddDASxSources(nds, retry) {\n var uri = nds.uri;\n if (retry) {\n var match = /(.+)\\/[^\\/]+\\/?/.exec(uri);\n if (match) {\n uri = match[1] + '/sources';\n }\n }\n function sqfail() {\n if (!retry) {\n return tryAddDASxSources(nds, true);\n } else {\n return addDasCompletionPage(nds);\n }\n }\n new DASRegistry(uri, {credentials: nds.credentials}).sources(\n function(sources) {\n if (!sources || sources.length == 0) {\n return sqfail();\n } \n\n var fs = null;\n if (sources.length == 1) {\n fs = sources[0];\n } else {\n for (var i = 0; i < sources.length; ++i) {\n if (sources[i].uri === nds.uri) {\n fs = sources[i];\n break;\n }\n }\n }\n\n var coordsDetermined = false, quantDetermined = false;\n if (fs) {\n nds.name = fs.name;\n nds.desc = fs.desc;\n if (fs.maxbins) {\n nds.maxbins = true;\n } else {\n nds.maxbins = false;\n }\n if (fs.capabilities) {\n nds.capabilities = fs.capabilities;\n }\n quantDetermined = true\n \n if (fs.coords && fs.coords.length == 1) {\n var coords = fs.coords[0];\n if (coordsMatch(coords, thisB.coordSystem)) {\n coordsDetermined = true;\n } else if (thisB.chains) {\n for (var k in thisB.chains) {\n if (coordsMatch(coords, thisB.chains[k].coords)) {\n nds.mapping = k;\n coordsDetermined = true;\n }\n }\n }\n }\n \n }\n return addDasCompletionPage(nds, coordsDetermined, quantDetermined);\n },\n function() {\n return sqfail();\n }\n );\n }\n\n var makeSourceConfig = function(s) {\n var nds = {name: s.name};\n if (s.credentials)\n nds.credentials = s.credentials;\n \n if (s.mapping && s.mapping != '__default__')\n nds.mapping = s.mapping;\n\n if (s.transport)\n nds.transport = s.transport;\n\n if (s.tier_type == 'bwg') {\n if (s.blob)\n nds.bwgBlob = s.blob;\n else if (s.uri)\n nds.bwgURI = s.uri;\n return nds;\n } else if (s.tier_type == 'bam') {\n if (s.blob) {\n nds.bamBlob = s.blob;\n nds.baiBlob = s.indexBlob;\n } else {\n nds.bamURI = s.uri;\n nds.baiURI = s.indexUri;\n }\n return nds;\n } else if (s.tier_type == 'tabix') {\n nds.tier_type = 'tabix';\n nds.payload = s.payload;\n if (s.blob) {\n nds.blob = s.blob;\n nds.indexBlob = s.indexBlob;\n } else {\n nds.uri = s.uri;\n nds.indexUri = s.indexUri;\n }\n return nds;\n } else if (s.tier_type == 'memstore') {\n nds.tier_type = 'memstore';\n nds.payload = s.payload;\n if (s.blob)\n nds.blob = s.blob;\n else\n nds.uri = s.uri;\n return nds;\n }\n }\n\n var tryAddBin = function(source) {\n probeResource(source, function(source, err) {\n if (err) {\n removeChildren(stabHolder);\n var tabError = makeElement('div');\n tabError.appendChild(makeElement('h2', \"Couldn't access custom data\"));\n tabError.appendChild(makeElement('p', '' + err));\n stabHolder.appendChild(tabError);\n console.log(source);\n if (window.location.protocol === 'https:' && source.uri.indexOf('http:') == 0) {\n thisB.canFetchPlainHTTP().then(\n function(can) {\n if (!can) {\n tabError.appendChild(\n makeElement('p', [\n makeElement('strong', 'HTTP warning: '),\n 'you may not be able to access HTTP resources from an instance of Biodalliance which you are accessing via HTTPS.',\n makeElement('a', '[More info]', {href: thisB.httpWarningURL, target: \"_blank\"})\n ]\n )\n );\n }\n }\n );\n }\n customMode = 'reset-bin';\n } else {\n var nds = makeSourceConfig(source);\n if (source.tier_type == 'bam') {\n return completeBAM(nds);\n } else if (source.tier_type == 'tabix') {\n return completeTabixVCF(nds);\n } else {\n return addDasCompletionPage(nds, false, false, true);\n }\n }\n });\n }\n\n function promptForBAI(nds) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n customMode = 'prompt-bai'\n stabHolder.appendChild(makeElement('h2', 'Select an index file'));\n stabHolder.appendChild(makeElement('p', 'Dalliance requires a BAM index (.bai) file when displaying BAM data. These normally accompany BAM files. For security reasons, web applications like Dalliance can only access local files which you have explicity selected. Please use the file chooser below to select the appropriate BAI file'));\n\n stabHolder.appendChild(document.createTextNode('Index file: '));\n custFile = makeElement('input', null, {type: 'file'});\n stabHolder.appendChild(custFile);\n dataToFinalize = nds;\n }\n\n function promptForTabix(nds) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n customMode = 'prompt-tbi'\n stabHolder.appendChild(makeElement('h2', 'Select an index file'));\n stabHolder.appendChild(makeElement('p', 'Dalliance requires a Tabix index (.tbi) file when displaying VCF data. For security reasons, web applications like Dalliance can only access local files which you have explicity selected. Please use the file chooser below to select the appropriate BAI file'));\n\n stabHolder.appendChild(document.createTextNode('Index file: '));\n custFile = makeElement('input', null, {type: 'file'});\n stabHolder.appendChild(custFile);\n dataToFinalize = nds;\n }\n\n function completeBAM(nds) {\n var indexF;\n if (nds.baiBlob) \n indexF = new BlobFetchable(nds.baiBlob);\n else if (nds.transport == 'encode')\n indexF = new EncodeFetchable(nds.bamURI + '.bai');\n else\n indexF = new URLFetchable(nds.bamURI + '.bai', {credentials: nds.credentials});\n\n indexF.slice(0, 256).fetch(function(r) {\n var hasBAI = false;\n if (r) {\n var ba = new Uint8Array(r);\n var magic2 = readInt(ba, 0);\n hasBAI = (magic2 == BAI_MAGIC);\n }\n if (hasBAI) {\n return addDasCompletionPage(nds, false, false, true);\n } else {\n return binFormatErrorPage('You have selected a valid BAM file, but a corresponding index (.bai) file was not found. Please index your BAM (samtools index) and place the BAI file in the same directory');\n }\n });\n }\n\n function completeTabixVCF(nds) {\n var indexF;\n if (nds.indexBlob) {\n indexF = new BlobFetchable(nds.indexBlob);\n } else {\n indexF = new URLFetchable(nds.uri + '.tbi');\n }\n indexF.slice(0, 1<<16).fetch(function(r) {\n var hasTabix = false;\n if (r) {\n var ba = new Uint8Array(r);\n if (ba[0] == 31 || ba[1] == 139) {\n var unc = unbgzf(r);\n ba = new Uint8Array(unc);\n var m2 = readInt(ba, 0);\n hasTabix = (m2 == TABIX_MAGIC);\n }\n }\n if (hasTabix) {\n return addDasCompletionPage(nds, false, false, true);\n } else {\n return binFormatErrorPage('You have selected a valid VCF file, but a corresponding index (.tbi) file was not found. Please index your VCF (\"tabix -p vcf -f myfile.vcf.gz\") and place the .tbi file in the same directory');\n }\n });\n }\n\n function binFormatErrorPage(message) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n message = message || 'Custom data format not recognized';\n stabHolder.appendChild(makeElement('h2', 'Error adding custom data'));\n stabHolder.appendChild(makeElement('p', message));\n stabHolder.appendChild(makeElement('p', 'Currently supported formats are bigBed, bigWig, and BAM.'));\n customMode = 'reset-bin';\n return;\n }\n \n var addDasCompletionPage = function(nds, coordsDetermined, quantDetermined, quantIrrelevant) {\n refreshButton.style.display = 'none';\n addButton.style.display = 'inline';\n canButton.style.display = 'inline';\n\n removeChildren(stabHolder);\n stabHolder.appendChild(makeElement('h2', 'Add custom data: step 2'));\n stabHolder.appendChild(document.createTextNode('Label: '));\n custName = makeElement('input', '', {value: nds.name});\n stabHolder.appendChild(custName);\n\n\n // stabHolder.appendChild(document.createTextNode('User: '));\n custUser = makeElement('input', '');\n // stabHolder.appendChild(custUser);\n //stabHolder.appendChild(document.createTextNode('Pass: '));\n custPass = makeElement('input', '');\n // stabHolder.appendChild(custPass);\n \n\n stabHolder.appendChild(makeElement('br'));\n stabHolder.appendChild(makeElement('br'));\n stabHolder.appendChild(makeElement('h4', 'Coordinate system: '));\n custCS = makeElement('select', null);\n custCS.appendChild(makeElement('option', thisB.nameForCoordSystem(thisB.coordSystem), {value: '__default__'}));\n if (thisB.chains) {\n for (var csk in thisB.chains) {\n var cs = thisB.chains[csk].coords;\n custCS.appendChild(makeElement('option', thisB.nameForCoordSystem(cs), {value: csk}));\n }\n }\n custCS.value = nds.mapping || '__default__';\n stabHolder.appendChild(custCS);\n\n if (coordsDetermined) {\n stabHolder.appendChild(makeElement('p', \"(Based on server response, probably doesn't need changing.)\"));\n } else {\n stabHolder.appendChild(makeElement('p', [makeElement('b', 'Warning: '), \"unable to determine the correct value from server responses. Please check carefully.\"]));\n stabHolder.appendChild(makeElement('p', \"If you don't see the mapping you're looking for, please contact [email protected] \"));\n }\n\n if (!quantIrrelevant) {\n stabHolder.appendChild(document.createTextNode('Quantitative: '));\n custQuant = makeElement('input', null, {type: 'checkbox', checked: true});\n if (typeof nds.maxbins !== 'undefined') {\n custQuant.checked = nds.maxbins;\n }\n stabHolder.appendChild(custQuant);\n if (quantDetermined) {\n stabHolder.appendChild(makeElement('p', \"(Based on server response, probably doesn't need changing.)\"));\n } else {\n stabHolder.appendChild(makeElement('p', [makeElement('b', \"Warning: \"), \"unable to determine correct value. If in doubt, leave checked.\"]));\n }\n }\n\n if (nds.bwgBlob) {\n stabHolder.appendChild(makeElement('p', [makeElement('b', 'Warning: '), 'data added from local file. Due to the browser security model, the track will disappear if you reload Dalliance.']));\n }\n\n custName.focus();\n\n if (customMode === 'bin' || customMode === 'prompt-bai' || customMode === 'prompt-tbi')\n customMode = 'finalize-bin';\n else\n customMode = 'finalize';\n dataToFinalize = nds;\n }\n\n var multipleSet = null;\n var tryAddMultiple = function(fileList) {\n var newSources = multipleSet = [];\n customMode = 'multiple';\n for (var fi = 0; fi < fileList.length; ++fi) {\n var f = fileList[fi];\n if (f) {\n newSources.push({blob: f});\n }\n }\n\n for (var fi = 0; fi < newSources.length; ++fi) {\n probeMultiple(newSources[fi]);\n }\n updateMultipleStatus();\n }\n\n var probeMultiple = function(ns) {\n probeResource(ns, function(source, err) {\n if (err) {\n source.error = err;\n }\n\n var usedIndices = [];\n var bams = {}, tabixes = {};\n for (var si = 0; si < multipleSet.length; ++si) {\n var s = multipleSet[si];\n if (s.tier_type == 'bam' && !s.indexBlob) {\n bams[s.blob.name] = s;\n }\n if (s.tier_type == 'tabix' && !s.indexBlob) {\n tabixes[s.blob.name] = s;\n }\n }\n\n for (var si = 0; si < multipleSet.length; ++si) {\n var s = multipleSet[si];\n if (s.tier_type === 'bai') {\n var baiPattern = new RegExp('(.+)\\\\.bai$');\n var match = baiPattern.exec(s.blob.name);\n if (match && bams[match[1]]) {\n bams[match[1]].indexBlob = s.blob;\n usedIndices.push(si);\n }\n } else if (s.tier_type === 'tabix-index') {\n var tbiPattern = new RegExp('(.+)\\\\.tbi$');\n var match = tbiPattern.exec(s.blob.name);\n if (match && tabixes[match[1]]) {\n tabixes[match[1]].indexBlob = s.blob;\n usedIndices.push(si);\n }\n }\n }\n\n for (var bi = usedIndices.length - 1; bi >= 0; --bi) {\n multipleSet.splice(usedIndices[bi], 1);\n }\n\n updateMultipleStatus();\n });\n }\n\n var updateMultipleStatus = function() {\n removeChildren(stabHolder);\n var needsIndex = false;\n var multTable = makeElement('table', multipleSet\n .filter(function(s) {return !s.hidden})\n .map(function(s) {\n var row = makeElement('tr');\n row.appendChild(makeElement('td', s.name || s.blob.name));\n var typeContent;\n if (s.error) {\n typeContent = makeElement('span', 'Error', null, {color: 'red'});\n } else if (s.tier_type) {\n typeContent = s.payload || s.tier_type;\n } else {\n typeContent = thisB.makeLoader(16);\n }\n\n var ccs;\n var state = 'unknown';\n if (s.tier_type == 'bwg' || s.tier_type == 'memstore') {\n state = 'okay';\n } else if (s.tier_type == 'bam') {\n state = s.indexBlob ? 'okay' : 'needs-index';\n } else if (s.tier_type == 'tabix') {\n state = s.indexBlob ? 'okay' : 'needs-index';\n }\n\n if (state == 'okay') {\n ccs = makeElement('select', null, null, {width: '150px'});\n ccs.appendChild(makeElement('option', thisB.nameForCoordSystem(thisB.coordSystem), {value: '__default__'}));\n if (thisB.chains) {\n for (var csk in thisB.chains) {\n var cs = thisB.chains[csk].coords;\n ccs.appendChild(makeElement('option', thisB.nameForCoordSystem(cs), {value: csk}));\n }\n }\n ccs.value = s.mapping || '__default__';\n\n ccs.addEventListener('change', function(ev) {\n s.mapping = ccs.value;\n console.log(s);\n }, false);\n } else if (state == 'needs-index') {\n ccs = makeElement('span', 'Needs index', {}, {color: 'red'});\n needsIndex = true;\n }\n\n return makeElement('tr', [makeElement('td', s.name || s.blob.name),\n makeElement('td', typeContent),\n makeElement('td', ccs)]);\n\n }), {className: 'table table-striped table-condensed'});\n stabHolder.appendChild(multTable);\n\n if (needsIndex) {\n stabHolder.appendChild(makeElement('p', 'Some of these files are missing required index (.bai or .tbi) files. For security reasons, web applications like Dalliance can only access local files which you have explicity selected. Please use the file chooser below to select the appropriate index file'));\n stabHolder.appendChild(document.createTextNode('Index file(s): '));\n var indexFile = makeElement('input', null, {type: 'file', multiple: 'multiple'});\n stabHolder.appendChild(indexFile);\n indexFile.addEventListener('change', function(ev) {\n console.log('fileset changed');\n var fileList = indexFile.files || [];\n for (var fi = 0; fi < fileList.length; ++fi) {\n var f = fileList[fi];\n if (f) {\n var ns = {blob: f, hidden: true};\n multipleSet.push(ns);\n probeMultiple(ns);\n }\n }\n }, false);\n }\n }\n\n var canButton = makeElement('button', 'Cancel', {className: 'btn'});\n canButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n if (customMode === 'finalize-bin')\n switchToBinMode();\n else\n switchToCustomMode();\n }, false);\n\n var refreshButton = makeElement('button', 'Refresh', {className: 'btn'});\n refreshButton.addEventListener('click', function(ev) {\n ev.stopPropagation(); ev.preventDefault();\n thisB.queryRegistry(__mapping);\n }, false);\n this.makeTooltip(refreshButton, 'Click to re-fetch data from the DAS registry');\n\n var buttonHolder = makeElement('div', [addButton, ' ', canButton, ' ', refreshButton]);\n buttonHolder.style.margin = '10px';\n asform.appendChild(buttonHolder);\n\n popup.appendChild(asform);\n makeStab(thisB.availableSources);\n\n this.showToolPanel(popup);\n this.setUiMode('add');\n\n if (firstDefButton) {\n activateButton(addModeButtons, firstDefButton);\n makeStab(new Observed(firstDefSources));\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// trix.js: UCSC-style free text indices\n//\n\n\"use strict\";\n\nfunction connectTrix(ix, ixx, callback) {\n ixx.fetchAsText(function(ixxData) {\n if (!ixxData) \n return callback(null, \"Couldn't fetch index-index\");\n\n var toks = ixxData.split(/(.+)([0-9A-F]{10})\\n/);\n\n var keys = [];\n var offsets = [];\n for (var ti = 1; ti < toks.length; ti += 3) {\n keys.push(toks[ti]);\n offsets.push(parseInt(toks[ti+1], 16));\n }\n\n return callback(new TrixIndex(keys, offsets, ix));\n });\n}\n\nfunction TrixIndex(keys, offsets, ix) {\n this.keys = keys;\n this.offsets = offsets;\n this.ix = ix;\n}\n\nTrixIndex.prototype.lookup = function(query, callback) {\n var ixslice;\n\n var qtag = (query + ' ').substring(0,5).toLowerCase();\n for (var i = 0; i < this.keys.length; ++i) {\n if (qtag.localeCompare(this.keys[i]) < 0) {\n ixslice = this.ix.slice(this.offsets[i - 1], this.offsets[i] - this.offsets[i - 1]);\n break;\n }\n }\n\n if (!ixslice) {\n ixslice = this.ix.slice(this.offsets[this.offsets.length - 1]);\n }\n\n ixslice.fetchAsText(function(ist) {\n var lines = ist.split('\\n');\n for (var li = 0; li < lines.length; ++li) {\n if (lines[li].indexOf(query.toLowerCase() + ' ') == 0) {\n return callback(lines[li].split(' '));\n }\n }\n return callback(null);\n });\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n connectTrix: connectTrix\n };\n}","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// twoBit.js: packed-binary reference sequences\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var bin = require('./bin');\n var readInt = bin.readInt;\n var readIntBE = bin.readIntBE;\n\n var spans = require('./spans');\n var Range = spans.Range;\n var union = spans.union;\n var intersection = spans.intersection;\n}\n\nvar TWOBIT_MAGIC = 0x1a412743;\nvar TWOBIT_MAGIC_BE = 0x4327411a;\nvar HEADER_BLOCK_SIZE = 12500;\n\nfunction TwoBitFile() {\n}\n\nfunction makeTwoBit(fetchable, cnt) {\n var tb = new TwoBitFile();\n tb.data = fetchable;\n var headerBlockSize = HEADER_BLOCK_SIZE;\n var headerBlocksFetched=0;\n \n tb.data.slice(0, headerBlockSize).fetch(function(r) {\n if (!r) {\n return cnt(null, \"Couldn't access data\");\n }\n var ba = new Uint8Array(r);\n var magic = readInt(ba, 0);\n if (magic == TWOBIT_MAGIC) {\n tb.readInt = readInt;\n } else if (magic == TWOBIT_MAGIC_BE) {\n tb.readInt = readIntBE;\n } else {\n return cnt(null, \"Not a .2bit file, magic=0x\" + magic.toString(16));\n }\n\n var version = tb.readInt(ba, 4);\n if (version != 0) {\n return cnt(null, 'Unsupported version ' + version);\n }\n\n tb.seqCount = tb.readInt(ba, 8);\n tb.seqDict = {};\n\n var p = 16, i=0;\n var o = 0; // Offset of the current block if we need to fetch multiple header blocks.\n\n var parseSeqInfo = function() {\n while (i < tb.seqCount) {\n var ns = ba[p];\n if (p + ns + 6 >= ba.length) {\n headerBlocksFetched += headerBlockSize;\n headerBlockSize = Math.max(HEADER_BLOCK_SIZE,Math.floor(headerBlocksFetched*tb.seqCount/i));\n return tb.data.slice(o + p, headerBlockSize).fetch(function (r) {\n o += p;\n p = 0;\n ba = new Uint8Array(r);\n parseSeqInfo();\n });\n } else {\n ++p;\n var name = '';\n for (var j = 1; j <= ns; ++j) {\n name += String.fromCharCode(ba[p++]);\n }\n var offset = tb.readInt(ba, p);\n p += 4;\n tb.seqDict[name] = new TwoBitSeq(tb, offset);\n ++i;\n }\n }\n return cnt(tb);\n }\n\n parseSeqInfo();\n \n });\n}\n\nTwoBitFile.prototype.getSeq = function(chr) {\n var seq = this.seqDict[chr];\n if (!seq) {\n seq = this.seqDict['chr' + chr];\n }\n return seq;\n}\n\nTwoBitFile.prototype.fetch = function(chr, min, max, cnt) {\n var seq = this.getSeq(chr);\n if (!seq) {\n return cnt(null, \"Couldn't find \" + chr);\n } else if (max <= min) {\n return cnt('');\n } else {\n seq.fetch(min, max, cnt);\n }\n}\n\nfunction TwoBitSeq(tbf, offset) {\n this.tbf = tbf;\n this.offset = offset;\n}\n\nTwoBitSeq.prototype.init = function(cnt) {\n if (this.seqOffset) {\n return cnt();\n }\n\n var thisB = this;\n thisB.tbf.data.slice(thisB.offset, 8).fetch(function(r1) {\n if (!r1) {\n return cnt('Fetch failed');\n }\n var ba = new Uint8Array(r1);\n thisB._length = thisB.tbf.readInt(ba, 0);\n thisB.nBlockCnt = thisB.tbf.readInt(ba, 4);\n thisB.tbf.data.slice(thisB.offset + 8, thisB.nBlockCnt*8 + 4).fetch(function(r2) {\n if (!r2) {\n return cnt('Fetch failed');\n }\n var ba = new Uint8Array(r2);\n var nbs = null;\n for (var b = 0; b < thisB.nBlockCnt; ++b) {\n var nbMin = thisB.tbf.readInt(ba, b * 4);\n var nbLen = thisB.tbf.readInt(ba, (b + thisB.nBlockCnt) * 4);\n var nb = new Range(nbMin, nbMin + nbLen - 1);\n if (!nbs) {\n nbs = nb;\n } else {\n nbs = union(nbs, nb);\n }\n }\n thisB.nBlocks = nbs;\n thisB.mBlockCnt = thisB.tbf.readInt(ba, thisB.nBlockCnt*8);\n thisB.seqLength = ((thisB._length + 3)/4)|0;\n thisB.seqOffset = thisB.offset + 16 + ((thisB.nBlockCnt + thisB.mBlockCnt) * 8);\n return cnt();\n });\n });\n}\n\nvar TWOBIT_TABLE = ['T', 'C', 'A', 'G'];\n\nTwoBitSeq.prototype.fetch = function(min, max, cnt) {\n --min; --max; // Switch to zero-based.\n var thisB = this;\n this.init(function(error) {\n if (error) {\n return cnt(null, error);\n }\n\n var fetchMin = min >> 2;\n var fetchMax = max + 3 >> 2;\n if (fetchMin < 0 || fetchMax > thisB.seqLength) {\n return cnt('Coordinates out of bounds: ' + min + ':' + max);\n }\n\n thisB.tbf.data.slice(thisB.seqOffset + fetchMin, fetchMax - fetchMin).salted().fetch(function(r) {\n if (r == null) {\n return cnt('SeqFetch failed');\n }\n var seqData = new Uint8Array(r);\n\n var nSpans = [];\n if (thisB.nBlocks) {\n var intr = intersection(new Range(min, max), thisB.nBlocks);\n if (intr) {\n nSpans = intr.ranges();\n }\n }\n \n var seqstr = '';\n var ptr = min;\n function fillSeq(fsm) {\n while (ptr <= fsm) {\n var bb = (ptr >> 2) - fetchMin;\n var ni = ptr & 0x3;\n var bv = seqData[bb];\n var n;\n if (ni == 0) {\n n = (bv >> 6) & 0x3;\n } else if (ni == 1) {\n n = (bv >> 4) & 0x3;\n } else if (ni == 2) {\n n = (bv >> 2) & 0x3;\n } else {\n n = (bv) & 0x3;\n }\n seqstr += TWOBIT_TABLE[n];\n ++ptr;\n }\n }\n \n for (var b = 0; b < nSpans.length; ++b) {\n var nb = nSpans[b];\n if (ptr > nb.min()) {\n throw 'N mismatch...';\n }\n if (ptr < nb.min()) {\n fillSeq(nb.min() - 1);\n }\n while (ptr <= nb.max()) {\n seqstr += 'N';\n ++ptr;\n }\n }\n if (ptr <= max) {\n fillSeq(max);\n }\n return cnt(seqstr);\n });\n });\n}\n\nTwoBitSeq.prototype.length = function(cnt) {\n var thisB = this;\n this.init(function(error) {\n if (error) {\n return cnt(null, error);\n } else {\n return cnt(thisB._length);\n }\n });\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n makeTwoBit: makeTwoBit\n };\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// utils.js: odds, sods, and ends.\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var sha1 = require('./sha1');\n var b64_sha1 = sha1.b64_sha1;\n}\n\nvar NUM_REGEXP = new RegExp('[0-9]+');\n\nfunction stringToNumbersArray(str) {\n var nums = new Array();\n var m;\n while (m = NUM_REGEXP.exec(str)) {\n nums.push(m[0]);\n str=str.substring(m.index + (m[0].length));\n }\n return nums;\n}\n\nvar STRICT_NUM_REGEXP = new RegExp('^[0-9]+$');\n\nfunction stringToInt(str) {\n str = str.replace(new RegExp(',', 'g'), '');\n if (!STRICT_NUM_REGEXP.test(str)) {\n return null;\n }\n return str|0;\n}\n\nfunction pushnew(a, v) {\n for (var i = 0; i < a.length; ++i) {\n if (a[i] == v) {\n return;\n }\n }\n a.push(v);\n}\n\nfunction pusho(obj, k, v) {\n if (obj[k]) {\n obj[k].push(v);\n } else {\n obj[k] = [v];\n }\n}\n\nfunction pushnewo(obj, k, v) {\n var a = obj[k];\n if (a) {\n for (var i = 0; i < a.length; ++i) { // indexOf requires JS16 :-(.\n if (a[i] == v) {\n return;\n }\n }\n a.push(v);\n } else {\n obj[k] = [v];\n }\n}\n\n\nfunction pick(a, b, c, d)\n{\n if (a) {\n return a;\n } else if (b) {\n return b;\n } else if (c) {\n return c;\n } else if (d) {\n return d;\n }\n}\n\nfunction pushnew(l, o)\n{\n for (var i = 0; i < l.length; ++i) {\n if (l[i] == o) {\n return;\n }\n }\n l.push(o);\n}\n\n\n\nfunction arrayIndexOf(a, x) {\n if (!a) {\n return -1;\n }\n\n for (var i = 0; i < a.length; ++i) {\n if (a[i] === x) {\n return i;\n }\n }\n return -1;\n}\n\nfunction arrayRemove(a, x) {\n var i = arrayIndexOf(a, x);\n if (i >= 0) {\n a.splice(i, 1);\n return true;\n }\n return false;\n}\n\n//\n// DOM utilities\n//\n\n\nfunction makeElement(tag, children, attribs, styles)\n{\n var ele = document.createElement(tag);\n if (children) {\n if (! (children instanceof Array)) {\n children = [children];\n }\n for (var i = 0; i < children.length; ++i) {\n var c = children[i];\n if (c) {\n if (typeof c == 'string') {\n c = document.createTextNode(c);\n } else if (typeof c == 'number') {\n c = document.createTextNode('' + c);\n }\n ele.appendChild(c);\n }\n }\n }\n \n if (attribs) {\n for (var l in attribs) {\n try {\n ele[l] = attribs[l];\n } catch (e) {\n console.log('error setting ' + l);\n throw(e);\n }\n }\n }\n if (styles) {\n for (var l in styles) {\n ele.style[l] = styles[l];\n }\n }\n return ele;\n}\n\nfunction makeElementNS(namespace, tag, children, attribs)\n{\n var ele = document.createElementNS(namespace, tag);\n if (children) {\n if (! (children instanceof Array)) {\n children = [children];\n }\n for (var i = 0; i < children.length; ++i) {\n var c = children[i];\n if (typeof c == 'string') {\n c = document.createTextNode(c);\n }\n ele.appendChild(c);\n }\n }\n \n setAttrs(ele, attribs);\n return ele;\n}\n\nvar attr_name_cache = {};\n\nfunction setAttr(node, key, value)\n{\n var attr = attr_name_cache[key];\n if (!attr) {\n var _attr = '';\n for (var c = 0; c < key.length; ++c) {\n var cc = key.substring(c, c+1);\n var lcc = cc.toLowerCase();\n if (lcc != cc) {\n _attr = _attr + '-' + lcc;\n } else {\n _attr = _attr + cc;\n }\n }\n attr_name_cache[key] = _attr;\n attr = _attr;\n }\n node.setAttribute(attr, value);\n}\n\nfunction setAttrs(node, attribs)\n{\n if (attribs) {\n for (var l in attribs) {\n setAttr(node, l, attribs[l]);\n }\n }\n}\n\n\n\nfunction removeChildren(node)\n{\n if (!node || !node.childNodes) {\n return;\n }\n\n while (node.childNodes.length > 0) {\n node.removeChild(node.firstChild);\n }\n}\n\n\n\n//\n// WARNING: not for general use!\n//\n\nfunction miniJSONify(o, exc) {\n if (typeof o === 'undefined') {\n return 'undefined';\n } else if (o == null) {\n return 'null';\n } else if (typeof o == 'string') {\n return \"'\" + o + \"'\";\n } else if (typeof o == 'number') {\n return \"\" + o;\n } else if (typeof o == 'boolean') {\n return \"\" + o;\n } else if (typeof o == 'object') {\n if (o instanceof Array) {\n var s = null;\n for (var i = 0; i < o.length; ++i) {\n s = (s == null ? '' : (s + ', ')) + miniJSONify(o[i], exc);\n }\n return '[' + (s?s:'') + ']';\n } else {\n exc = exc || {};\n var s = null;\n for (var k in o) {\n if (exc[k])\n continue;\n if (k != undefined && typeof(o[k]) != 'function') {\n s = (s == null ? '' : (s + ', ')) + k + ': ' + miniJSONify(o[k], exc);\n }\n }\n return '{' + (s?s:'') + '}';\n }\n } else {\n return (typeof o);\n }\n}\n\nfunction shallowCopy(o) {\n var n = {};\n for (var k in o) {\n n[k] = o[k];\n }\n return n;\n}\n\nfunction Observed(x) {\n this.value = x;\n this.listeners = [];\n}\n\nObserved.prototype.addListener = function(f) {\n this.listeners.push(f);\n}\n\nObserved.prototype.addListenerAndFire = function(f) {\n this.listeners.push(f);\n f(this.value);\n}\n\nObserved.prototype.removeListener = function(f) {\n arrayRemove(this.listeners, f);\n}\n\nObserved.prototype.get = function() {\n return this.value;\n}\n\nObserved.prototype.set = function(x) {\n this.value = x;\n for (var i = 0; i < this.listeners.length; ++i) {\n this.listeners[i](x);\n }\n}\n\nfunction Awaited() {\n this.queue = [];\n}\n\nAwaited.prototype.provide = function(x) {\n if (this.res !== undefined) {\n throw \"Resource has already been provided.\";\n }\n\n this.res = x;\n for (var i = 0; i < this.queue.length; ++i) {\n this.queue[i](x);\n }\n this.queue = null; // avoid leaking closures.\n}\n\nAwaited.prototype.await = function(f) {\n if (this.res !== undefined) {\n f(this.res);\n return this.res;\n } else {\n this.queue.push(f);\n }\n}\n\nvar __dalliance_saltSeed = 0;\n\nfunction saltURL(url) {\n return url + '?salt=' + b64_sha1('' + Date.now() + ',' + (++__dalliance_saltSeed));\n}\n\nfunction textXHR(url, callback, opts) {\n if (opts && opts.salt) \n url = saltURL(url);\n\n try {\n var timeout;\n if (opts && opts.timeout) {\n timeout = setTimeout(\n function() {\n console.log('timing out ' + url);\n req.abort();\n return callback(null, 'Timeout');\n },\n opts.timeout\n );\n }\n\n var req = new XMLHttpRequest();\n req.onreadystatechange = function() {\n \t if (req.readyState == 4) {\n if (timeout)\n clearTimeout(timeout);\n \t if (req.status < 200 || req.status >= 300) {\n \t\t callback(null, 'Error code ' + req.status);\n \t } else {\n \t\t callback(req.responseText);\n \t }\n \t }\n };\n \n req.open('GET', url, true);\n req.responseType = 'text';\n\n if (opts && opts.credentials) {\n req.withCredentials = true;\n }\n req.send();\n } catch (e) {\n callback(null, 'Exception ' + e);\n }\n}\n\nfunction relativeURL(base, rel) {\n // FIXME quite naive -- good enough for trackhubs?\n\n if (rel.indexOf('http:') == 0 || rel.indexOf('https:') == 0) {\n return rel;\n }\n\n var li = base.lastIndexOf('/');\n if (li >= 0) {\n return base.substr(0, li + 1) + rel;\n } else {\n return rel;\n }\n}\n\nvar AMINO_ACID_TRANSLATION = {\n 'TTT': 'F',\n 'TTC': 'F',\n 'TTA': 'L',\n 'TTG': 'L',\n 'CTT': 'L',\n 'CTC': 'L',\n 'CTA': 'L',\n 'CTG': 'L',\n 'ATT': 'I',\n 'ATC': 'I',\n 'ATA': 'I',\n 'ATG': 'M',\n 'GTT': 'V',\n 'GTC': 'V',\n 'GTA': 'V',\n 'GTG': 'V',\n 'TCT': 'S',\n 'TCC': 'S',\n 'TCA': 'S',\n 'TCG': 'S',\n 'CCT': 'P',\n 'CCC': 'P',\n 'CCA': 'P',\n 'CCG': 'P',\n 'ACT': 'T',\n 'ACC': 'T',\n 'ACA': 'T',\n 'ACG': 'T',\n 'GCT': 'A',\n 'GCC': 'A',\n 'GCA': 'A',\n 'GCG': 'A',\n 'TAT': 'Y',\n 'TAC': 'Y',\n 'TAA': '*', // stop\n 'TAG': '*', // stop\n 'CAT': 'H',\n 'CAC': 'H',\n 'CAA': 'Q',\n 'CAG': 'Q',\n 'AAT': 'N',\n 'AAC': 'N',\n 'AAA': 'K',\n 'AAG': 'K',\n 'GAT': 'D',\n 'GAC': 'D',\n 'GAA': 'E',\n 'GAG': 'E',\n 'TGT': 'C',\n 'TGC': 'C',\n 'TGA': '*', // stop\n 'TGG': 'W',\n 'CGT': 'R',\n 'CGC': 'R',\n 'CGA': 'R',\n 'CGG': 'R',\n 'AGT': 'S',\n 'AGC': 'S',\n 'AGA': 'R',\n 'AGG': 'R',\n 'GGT': 'G',\n 'GGC': 'G',\n 'GGA': 'G',\n 'GGG': 'G'\n}\n\nfunction resolveUrlToPage(rel) {\n return makeElement('a', null, {href: rel}).href;\n}\n\n//\n// Missing APIs\n// \n\nif (!('trim' in String.prototype)) {\n String.prototype.trim = function() {\n return this.replace(/^\\s+/, '').replace(/\\s+$/, '');\n };\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n textXHR: textXHR,\n relativeURL: relativeURL,\n resolveUrlToPage: resolveUrlToPage,\n shallowCopy: shallowCopy,\n pusho: pusho,\n pushnew: pushnew,\n pushnewo: pushnewo,\n arrayIndexOf: arrayIndexOf,\n pick: pick,\n\n makeElement: makeElement,\n makeElementNS: makeElementNS,\n removeChildren: removeChildren,\n\n miniJSONify: miniJSONify,\n\n Observed: Observed,\n Awaited: Awaited,\n\n AMINO_ACID_TRANSLATION: AMINO_ACID_TRANSLATION\n }\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// vcf.js\n//\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var sa = require('./sourceadapters');\n var dalliance_registerParserFactory = sa.registerParserFactory;\n\n var das = require('./das');\n var DASStylesheet = das.DASStylesheet;\n var DASStyle = das.DASStyle;\n var DASFeature = das.DASFeature;\n var DASGroup = das.DASGroup;\n}\n\nfunction VCFParser() {\n this.info = [];\n}\n\nvar VCF_INFO_RE = /([^;=]+)(=([^;]+))?;?/;\nvar VCF_INFO_HEADER = /##INFO=<([^>]+)>/;\nvar VCF_INFO_HEADER_TOK = /([^,=]+)=([^,]+|\"[^\"]+\"),?/\n\nVCFParser.prototype.createSession = function(sink) {\n return new VCFParseSession(this, sink);\n}\n\nfunction VCFParseSession(parser, sink) {\n this.parser = parser;\n this.sink = sink;\n}\n\nVCFParseSession.prototype.parse = function(line) {\n if (line.length == 0)\n return;\n if (line[0] == '#') {\n if (line.length > 1 && line[1] == '#') {\n var m = VCF_INFO_HEADER.exec(line);\n if (m) {\n var toks = m[1].split(VCF_INFO_HEADER_TOK);\n var id = null, desc = null;\n for (var ti = 0; ti < toks.length - 1; ti += 3) {\n var key = toks[ti + 1];\n var value = toks[ti + 2].replace(/\"/g, '');\n if (key == 'ID') {\n id = value;\n } else if (key == 'Description') {\n desc = value;\n }\n }\n if (id && desc) {\n this.parser.info.push(\n {id: id,\n desc: desc}\n );\n }\n }\n return;\n } else {\n return;\n }\n }\n\n var toks = line.split('\\t');\n var f = new DASFeature();\n f.segment = toks[0];\n f.id = toks[2]\n f.refAllele = toks[3];\n f.altAlleles = toks[4].split(',');\n f.min = parseInt(toks[1]);\n f.max = f.min + f.refAllele.length - 1;\n\n var infoToks = toks[7].split(VCF_INFO_RE);\n f.info = {};\n for (var ti = 0; ti < infoToks.length; ti += 4) {\n f.info[infoToks[ti + 1]] = infoToks[ti + 3];\n }\n\n\n var alt = f.altAlleles[0];\n var ref = f.refAllele;\n if (alt.length > ref.length) {\n f.type = \"insertion\";\n if (alt.indexOf(ref) == 0) {\n f.insertion = alt.substr(ref.length);\n f.min += ref.length;\n f.max = f.min - 1; // Effectively \"between\" bases.\n } else {\n f.insertion = alt;\n }\n } else if (alt.length < ref.length) {\n f.type = \"deletion\";\n } else {\n f.type = 'substitution';\n }\n\n this.sink(f);\n}\n\nVCFParseSession.prototype.flush = function() {};\n\nVCFParser.prototype.getStyleSheet = function(callback) {\n var stylesheet = new DASStylesheet();\n\n {\n var varStyle = new DASStyle();\n varStyle.glyph = '__INSERTION';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'rgb(50,80,255)';\n varStyle.BGCOLOR = '#888888';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({type: 'insertion'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'rgb(255, 60, 60)';\n varStyle.BGCOLOR = '#888888';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({type: 'deletion'}, null, varStyle);\n }\n {\n var varStyle = new DASStyle();\n varStyle.glyph = 'PLIMSOLL';\n varStyle.BUMP = 'yes';\n varStyle.LABEL = 'no';\n varStyle.FGCOLOR = 'rgb(50,80,255)';\n varStyle.BGCOLOR = '#888888';\n varStyle.STROKECOLOR = 'black';\n stylesheet.pushStyle({type: 'default'}, null, varStyle);\n }\n\n return callback(stylesheet);\n}\n\nVCFParser.prototype.getDefaultFIPs = function(callback) {\n var self = this;\n var fip = function(feature, featureInfo) {\n featureInfo.add(\"Ref. allele\", feature.refAllele);\n featureInfo.add(\"Alt. alleles\", feature.altAlleles.join(','));\n\n if (feature.info) {\n for (var ii = 0; ii < self.info.length; ++ii) {\n var info = self.info[ii];\n var val = feature.info[info.id];\n if (val !== undefined) {\n featureInfo.add(info.desc, val);\n }\n }\n }\n };\n callback(fip);\n}\n\ndalliance_registerParserFactory('vcf', function() {return new VCFParser()});\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2010\n//\n// version.js\n//\n\n\"use strict\";\n\nvar VERSION = {\n CONFIG: 5,\n MAJOR: 0,\n MINOR: 13,\n MICRO: 7,\n BRANCH: 'MOLGENIS'\n};\n\nVERSION.toString = function() {\n var vs = '' + this.MAJOR + '.' + this.MINOR + '.' + this.MICRO;\n if (this.PATCH) {\n vs = vs + this.PATCH;\n }\n if (this.BRANCH && this.BRANCH != '') {\n vs = vs + '-' + this.BRANCH;\n }\n return vs;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = VERSION;\n}\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Dalliance Genome Explorer\n// (c) Thomas Down 2006-2014\n//\n// zoomslider.js: custom slider component\n//\n\n\n\"use strict\";\n\nif (typeof(require) !== 'undefined') {\n var utils = require('./utils');\n var makeElement = utils.makeElement;\n}\n\nfunction makeZoomSlider(opts) {\n opts = opts || {};\n \n var minPos = 0, maxPos = opts.width || 200;\n var min = 0, max = 200;\n var pos = 50, pos2 = 100;\n var labels = [];\n var track = makeElement('hr', null, {className: 'slider-track'}, {width: '' + (maxPos|0) + 'px'});\n var thumb = makeElement('hr', null, {className: 'slider-thumb active'});\n var thumb2 = makeElement('hr', null, {className: 'slider-thumb'});\n var slider = makeElement('div', [track, thumb, thumb2], {className: 'slider'}, {width: '' + ((maxPos|0) + 10) + 'px'});\n\n slider.removeLabels = function() {\n for (var li = 0; li < labels.length; ++li) {\n slider.removeChild(labels[li]);\n }\n labels = [];\n }\n\n slider.addLabel = function(val, txt) {\n var pos = (minPos + ((val - min) * (maxPos - minPos))/(max-min))|0;\n var label = makeElement('div', txt, {className: 'slider-label'}, {\n left: '' + ((minPos + ((val - min) * (maxPos - minPos))/(max-min))|0) + 'px'\n });\n slider.appendChild(label);\n labels.push(label);\n }\n\n var onChange = document.createEvent('HTMLEvents');\n onChange.initEvent('change', true, false);\n\n function setPos(np) {\n np = Math.min(np, maxPos);\n np = Math.max(np, minPos);\n pos = np;\n thumb.style.left = '' + pos + 'px';\n }\n\n function setPos2(np) {\n np = Math.min(np, maxPos);\n np = Math.max(np, minPos);\n pos2 = np;\n thumb2.style.left = '' + pos2 + 'px';\n }\n\n Object.defineProperty(slider, 'value', {\n get: function() {return min + (((pos-minPos) * (max-min)) / (maxPos - minPos));},\n set: function(v) {\n var np = minPos + ((v-min) * (maxPos-minPos))/(max-min);\n setPos(np);\n }\n });\n\n Object.defineProperty(slider, 'value2', {\n get: function() {return min + (((pos2-minPos) * (max-min)) / (maxPos - minPos));},\n set: function(v) {\n var np = minPos + ((v-min) * (maxPos-minPos))/(max-min);\n setPos2(np);\n }\n });\n\n Object.defineProperty(slider, 'active', {\n get: function() {return thumb.classList.contains('active') ? 1 : 2},\n set: function(x) {\n if (x == 1) {\n thumb.classList.add('active');\n thumb2.classList.remove('active');\n } else {\n thumb2.classList.add('active');\n thumb.classList.remove('active');\n }\n }\n });\n\n Object.defineProperty(slider, 'min', {\n get: function() {return min},\n set: function(v) {min = v}\n });\n\n Object.defineProperty(slider, 'max', {\n get: function() {return max},\n set: function(v) {max = v}\n });\n\n var offset;\n var which;\n\n var thumbMouseDown = function(ev) {\n which = this == thumb ? 1 : 2;\n if (which != slider.active) {\n slider.active = which;\n slider.dispatchEvent(onChange);\n }\n ev.stopPropagation(); ev.preventDefault();\n window.addEventListener('mousemove', thumbDragHandler, false);\n window.addEventListener('mouseup', thumbDragEndHandler, false);\n offset = ev.clientX - (which == 1 ? pos : pos2);\n };\n\n thumb.addEventListener('mousedown', thumbMouseDown, false);\n thumb2.addEventListener('mousedown', thumbMouseDown, false);\n\n var thumbDragHandler = function(ev) {\n if (which == 1)\n setPos(ev.clientX - offset);\n else\n setPos2(ev.clientX - offset);\n slider.dispatchEvent(onChange);\n };\n\n var thumbDragEndHandler = function(ev) {\n window.removeEventListener('mousemove', thumbDragHandler, false);\n window.removeEventListener('mouseup', thumbDragEndHandler, false);\n }\n\n return slider;\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = makeZoomSlider;\n}\n","\"use strict\";\n\nrequire(\"core-js/shim\");\n\nrequire(\"regenerator-runtime/runtime\");\n\nrequire(\"core-js/fn/regexp/escape\");\n\nif (global._babelPolyfill) {\n throw new Error(\"only one instance of babel-polyfill is allowed\");\n}\nglobal._babelPolyfill = true;\n\nvar DEFINE_PROPERTY = \"defineProperty\";\nfunction define(O, key, value) {\n O[key] || Object[DEFINE_PROPERTY](O, key, {\n writable: true,\n configurable: true,\n value: value\n });\n}\n\ndefine(String.prototype, \"padLeft\", \"\".padStart);\ndefine(String.prototype, \"padRight\", \"\".padEnd);\n\n\"pop,reverse,shift,keys,values,entries,indexOf,every,some,forEach,map,filter,find,findIndex,includes,join,slice,concat,push,splice,unshift,sort,lastIndexOf,reduce,reduceRight,copyWithin,fill\".split(\",\").forEach(function (key) {\n [][key] && define(Array, key, Function.call.bind([][key]));\n});","require('../../modules/core.regexp.escape');\nmodule.exports = require('../../modules/_core').RegExp.escape;\n","module.exports = function (it) {\n if (typeof it != 'function') throw TypeError(it + ' is not a function!');\n return it;\n};\n","var cof = require('./_cof');\nmodule.exports = function (it, msg) {\n if (typeof it != 'number' && cof(it) != 'Number') throw TypeError(msg);\n return +it;\n};\n","// 22.1.3.31 Array.prototype[@@unscopables]\nvar UNSCOPABLES = require('./_wks')('unscopables');\nvar ArrayProto = Array.prototype;\nif (ArrayProto[UNSCOPABLES] == undefined) require('./_hide')(ArrayProto, UNSCOPABLES, {});\nmodule.exports = function (key) {\n ArrayProto[UNSCOPABLES][key] = true;\n};\n","module.exports = function (it, Constructor, name, forbiddenField) {\n if (!(it instanceof Constructor) || (forbiddenField !== undefined && forbiddenField in it)) {\n throw TypeError(name + ': incorrect invocation!');\n } return it;\n};\n","var isObject = require('./_is-object');\nmodule.exports = function (it) {\n if (!isObject(it)) throw TypeError(it + ' is not an object!');\n return it;\n};\n","// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\n'use strict';\nvar toObject = require('./_to-object');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\n\nmodule.exports = [].copyWithin || function copyWithin(target /* = 0 */, start /* = 0, end = @length */) {\n var O = toObject(this);\n var len = toLength(O.length);\n var to = toAbsoluteIndex(target, len);\n var from = toAbsoluteIndex(start, len);\n var end = arguments.length > 2 ? arguments[2] : undefined;\n var count = Math.min((end === undefined ? len : toAbsoluteIndex(end, len)) - from, len - to);\n var inc = 1;\n if (from < to && to < from + count) {\n inc = -1;\n from += count - 1;\n to += count - 1;\n }\n while (count-- > 0) {\n if (from in O) O[to] = O[from];\n else delete O[to];\n to += inc;\n from += inc;\n } return O;\n};\n","// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\n'use strict';\nvar toObject = require('./_to-object');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\nmodule.exports = function fill(value /* , start = 0, end = @length */) {\n var O = toObject(this);\n var length = toLength(O.length);\n var aLen = arguments.length;\n var index = toAbsoluteIndex(aLen > 1 ? arguments[1] : undefined, length);\n var end = aLen > 2 ? arguments[2] : undefined;\n var endPos = end === undefined ? length : toAbsoluteIndex(end, length);\n while (endPos > index) O[index++] = value;\n return O;\n};\n","var forOf = require('./_for-of');\n\nmodule.exports = function (iter, ITERATOR) {\n var result = [];\n forOf(iter, false, result.push, result, ITERATOR);\n return result;\n};\n","// false -> Array#indexOf\n// true -> Array#includes\nvar toIObject = require('./_to-iobject');\nvar toLength = require('./_to-length');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nmodule.exports = function (IS_INCLUDES) {\n return function ($this, el, fromIndex) {\n var O = toIObject($this);\n var length = toLength(O.length);\n var index = toAbsoluteIndex(fromIndex, length);\n var value;\n // Array#includes uses SameValueZero equality algorithm\n // eslint-disable-next-line no-self-compare\n if (IS_INCLUDES && el != el) while (length > index) {\n value = O[index++];\n // eslint-disable-next-line no-self-compare\n if (value != value) return true;\n // Array#indexOf ignores holes, Array#includes - not\n } else for (;length > index; index++) if (IS_INCLUDES || index in O) {\n if (O[index] === el) return IS_INCLUDES || index || 0;\n } return !IS_INCLUDES && -1;\n };\n};\n","// 0 -> Array#forEach\n// 1 -> Array#map\n// 2 -> Array#filter\n// 3 -> Array#some\n// 4 -> Array#every\n// 5 -> Array#find\n// 6 -> Array#findIndex\nvar ctx = require('./_ctx');\nvar IObject = require('./_iobject');\nvar toObject = require('./_to-object');\nvar toLength = require('./_to-length');\nvar asc = require('./_array-species-create');\nmodule.exports = function (TYPE, $create) {\n var IS_MAP = TYPE == 1;\n var IS_FILTER = TYPE == 2;\n var IS_SOME = TYPE == 3;\n var IS_EVERY = TYPE == 4;\n var IS_FIND_INDEX = TYPE == 6;\n var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\n var create = $create || asc;\n return function ($this, callbackfn, that) {\n var O = toObject($this);\n var self = IObject(O);\n var f = ctx(callbackfn, that, 3);\n var length = toLength(self.length);\n var index = 0;\n var result = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined;\n var val, res;\n for (;length > index; index++) if (NO_HOLES || index in self) {\n val = self[index];\n res = f(val, index, O);\n if (TYPE) {\n if (IS_MAP) result[index] = res; // map\n else if (res) switch (TYPE) {\n case 3: return true; // some\n case 5: return val; // find\n case 6: return index; // findIndex\n case 2: result.push(val); // filter\n } else if (IS_EVERY) return false; // every\n }\n }\n return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : result;\n };\n};\n","var aFunction = require('./_a-function');\nvar toObject = require('./_to-object');\nvar IObject = require('./_iobject');\nvar toLength = require('./_to-length');\n\nmodule.exports = function (that, callbackfn, aLen, memo, isRight) {\n aFunction(callbackfn);\n var O = toObject(that);\n var self = IObject(O);\n var length = toLength(O.length);\n var index = isRight ? length - 1 : 0;\n var i = isRight ? -1 : 1;\n if (aLen < 2) for (;;) {\n if (index in self) {\n memo = self[index];\n index += i;\n break;\n }\n index += i;\n if (isRight ? index < 0 : length <= index) {\n throw TypeError('Reduce of empty array with no initial value');\n }\n }\n for (;isRight ? index >= 0 : length > index; index += i) if (index in self) {\n memo = callbackfn(memo, self[index], index, O);\n }\n return memo;\n};\n","var isObject = require('./_is-object');\nvar isArray = require('./_is-array');\nvar SPECIES = require('./_wks')('species');\n\nmodule.exports = function (original) {\n var C;\n if (isArray(original)) {\n C = original.constructor;\n // cross-realm fallback\n if (typeof C == 'function' && (C === Array || isArray(C.prototype))) C = undefined;\n if (isObject(C)) {\n C = C[SPECIES];\n if (C === null) C = undefined;\n }\n } return C === undefined ? Array : C;\n};\n","// 9.4.2.3 ArraySpeciesCreate(originalArray, length)\nvar speciesConstructor = require('./_array-species-constructor');\n\nmodule.exports = function (original, length) {\n return new (speciesConstructor(original))(length);\n};\n","'use strict';\nvar aFunction = require('./_a-function');\nvar isObject = require('./_is-object');\nvar invoke = require('./_invoke');\nvar arraySlice = [].slice;\nvar factories = {};\n\nvar construct = function (F, len, args) {\n if (!(len in factories)) {\n for (var n = [], i = 0; i < len; i++) n[i] = 'a[' + i + ']';\n // eslint-disable-next-line no-new-func\n factories[len] = Function('F,a', 'return new F(' + n.join(',') + ')');\n } return factories[len](F, args);\n};\n\nmodule.exports = Function.bind || function bind(that /* , ...args */) {\n var fn = aFunction(this);\n var partArgs = arraySlice.call(arguments, 1);\n var bound = function (/* args... */) {\n var args = partArgs.concat(arraySlice.call(arguments));\n return this instanceof bound ? construct(fn, args.length, args) : invoke(fn, args, that);\n };\n if (isObject(fn.prototype)) bound.prototype = fn.prototype;\n return bound;\n};\n","// getting tag from 19.1.3.6 Object.prototype.toString()\nvar cof = require('./_cof');\nvar TAG = require('./_wks')('toStringTag');\n// ES3 wrong here\nvar ARG = cof(function () { return arguments; }()) == 'Arguments';\n\n// fallback for IE11 Script Access Denied error\nvar tryGet = function (it, key) {\n try {\n return it[key];\n } catch (e) { /* empty */ }\n};\n\nmodule.exports = function (it) {\n var O, T, B;\n return it === undefined ? 'Undefined' : it === null ? 'Null'\n // @@toStringTag case\n : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T\n // builtinTag case\n : ARG ? cof(O)\n // ES3 arguments fallback\n : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;\n};\n","var toString = {}.toString;\n\nmodule.exports = function (it) {\n return toString.call(it).slice(8, -1);\n};\n","'use strict';\nvar dP = require('./_object-dp').f;\nvar create = require('./_object-create');\nvar redefineAll = require('./_redefine-all');\nvar ctx = require('./_ctx');\nvar anInstance = require('./_an-instance');\nvar forOf = require('./_for-of');\nvar $iterDefine = require('./_iter-define');\nvar step = require('./_iter-step');\nvar setSpecies = require('./_set-species');\nvar DESCRIPTORS = require('./_descriptors');\nvar fastKey = require('./_meta').fastKey;\nvar validate = require('./_validate-collection');\nvar SIZE = DESCRIPTORS ? '_s' : 'size';\n\nvar getEntry = function (that, key) {\n // fast case\n var index = fastKey(key);\n var entry;\n if (index !== 'F') return that._i[index];\n // frozen object case\n for (entry = that._f; entry; entry = entry.n) {\n if (entry.k == key) return entry;\n }\n};\n\nmodule.exports = {\n getConstructor: function (wrapper, NAME, IS_MAP, ADDER) {\n var C = wrapper(function (that, iterable) {\n anInstance(that, C, NAME, '_i');\n that._t = NAME; // collection type\n that._i = create(null); // index\n that._f = undefined; // first entry\n that._l = undefined; // last entry\n that[SIZE] = 0; // size\n if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\n });\n redefineAll(C.prototype, {\n // 23.1.3.1 Map.prototype.clear()\n // 23.2.3.2 Set.prototype.clear()\n clear: function clear() {\n for (var that = validate(this, NAME), data = that._i, entry = that._f; entry; entry = entry.n) {\n entry.r = true;\n if (entry.p) entry.p = entry.p.n = undefined;\n delete data[entry.i];\n }\n that._f = that._l = undefined;\n that[SIZE] = 0;\n },\n // 23.1.3.3 Map.prototype.delete(key)\n // 23.2.3.4 Set.prototype.delete(value)\n 'delete': function (key) {\n var that = validate(this, NAME);\n var entry = getEntry(that, key);\n if (entry) {\n var next = entry.n;\n var prev = entry.p;\n delete that._i[entry.i];\n entry.r = true;\n if (prev) prev.n = next;\n if (next) next.p = prev;\n if (that._f == entry) that._f = next;\n if (that._l == entry) that._l = prev;\n that[SIZE]--;\n } return !!entry;\n },\n // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)\n // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)\n forEach: function forEach(callbackfn /* , that = undefined */) {\n validate(this, NAME);\n var f = ctx(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3);\n var entry;\n while (entry = entry ? entry.n : this._f) {\n f(entry.v, entry.k, this);\n // revert to the last existing entry\n while (entry && entry.r) entry = entry.p;\n }\n },\n // 23.1.3.7 Map.prototype.has(key)\n // 23.2.3.7 Set.prototype.has(value)\n has: function has(key) {\n return !!getEntry(validate(this, NAME), key);\n }\n });\n if (DESCRIPTORS) dP(C.prototype, 'size', {\n get: function () {\n return validate(this, NAME)[SIZE];\n }\n });\n return C;\n },\n def: function (that, key, value) {\n var entry = getEntry(that, key);\n var prev, index;\n // change existing entry\n if (entry) {\n entry.v = value;\n // create new entry\n } else {\n that._l = entry = {\n i: index = fastKey(key, true), // <- index\n k: key, // <- key\n v: value, // <- value\n p: prev = that._l, // <- previous entry\n n: undefined, // <- next entry\n r: false // <- removed\n };\n if (!that._f) that._f = entry;\n if (prev) prev.n = entry;\n that[SIZE]++;\n // add to index\n if (index !== 'F') that._i[index] = entry;\n } return that;\n },\n getEntry: getEntry,\n setStrong: function (C, NAME, IS_MAP) {\n // add .keys, .values, .entries, [@@iterator]\n // 23.1.3.4, 23.1.3.8, 23.1.3.11, 23.1.3.12, 23.2.3.5, 23.2.3.8, 23.2.3.10, 23.2.3.11\n $iterDefine(C, NAME, function (iterated, kind) {\n this._t = validate(iterated, NAME); // target\n this._k = kind; // kind\n this._l = undefined; // previous\n }, function () {\n var that = this;\n var kind = that._k;\n var entry = that._l;\n // revert to the last existing entry\n while (entry && entry.r) entry = entry.p;\n // get next entry\n if (!that._t || !(that._l = entry = entry ? entry.n : that._t._f)) {\n // or finish the iteration\n that._t = undefined;\n return step(1);\n }\n // return step by kind\n if (kind == 'keys') return step(0, entry.k);\n if (kind == 'values') return step(0, entry.v);\n return step(0, [entry.k, entry.v]);\n }, IS_MAP ? 'entries' : 'values', !IS_MAP, true);\n\n // add [@@species], 23.1.2.2, 23.2.2.2\n setSpecies(NAME);\n }\n};\n","// https://github.com/DavidBruant/Map-Set.prototype.toJSON\nvar classof = require('./_classof');\nvar from = require('./_array-from-iterable');\nmodule.exports = function (NAME) {\n return function toJSON() {\n if (classof(this) != NAME) throw TypeError(NAME + \"#toJSON isn't generic\");\n return from(this);\n };\n};\n","'use strict';\nvar redefineAll = require('./_redefine-all');\nvar getWeak = require('./_meta').getWeak;\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar anInstance = require('./_an-instance');\nvar forOf = require('./_for-of');\nvar createArrayMethod = require('./_array-methods');\nvar $has = require('./_has');\nvar validate = require('./_validate-collection');\nvar arrayFind = createArrayMethod(5);\nvar arrayFindIndex = createArrayMethod(6);\nvar id = 0;\n\n// fallback for uncaught frozen keys\nvar uncaughtFrozenStore = function (that) {\n return that._l || (that._l = new UncaughtFrozenStore());\n};\nvar UncaughtFrozenStore = function () {\n this.a = [];\n};\nvar findUncaughtFrozen = function (store, key) {\n return arrayFind(store.a, function (it) {\n return it[0] === key;\n });\n};\nUncaughtFrozenStore.prototype = {\n get: function (key) {\n var entry = findUncaughtFrozen(this, key);\n if (entry) return entry[1];\n },\n has: function (key) {\n return !!findUncaughtFrozen(this, key);\n },\n set: function (key, value) {\n var entry = findUncaughtFrozen(this, key);\n if (entry) entry[1] = value;\n else this.a.push([key, value]);\n },\n 'delete': function (key) {\n var index = arrayFindIndex(this.a, function (it) {\n return it[0] === key;\n });\n if (~index) this.a.splice(index, 1);\n return !!~index;\n }\n};\n\nmodule.exports = {\n getConstructor: function (wrapper, NAME, IS_MAP, ADDER) {\n var C = wrapper(function (that, iterable) {\n anInstance(that, C, NAME, '_i');\n that._t = NAME; // collection type\n that._i = id++; // collection id\n that._l = undefined; // leak store for uncaught frozen objects\n if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\n });\n redefineAll(C.prototype, {\n // 23.3.3.2 WeakMap.prototype.delete(key)\n // 23.4.3.3 WeakSet.prototype.delete(value)\n 'delete': function (key) {\n if (!isObject(key)) return false;\n var data = getWeak(key);\n if (data === true) return uncaughtFrozenStore(validate(this, NAME))['delete'](key);\n return data && $has(data, this._i) && delete data[this._i];\n },\n // 23.3.3.4 WeakMap.prototype.has(key)\n // 23.4.3.4 WeakSet.prototype.has(value)\n has: function has(key) {\n if (!isObject(key)) return false;\n var data = getWeak(key);\n if (data === true) return uncaughtFrozenStore(validate(this, NAME)).has(key);\n return data && $has(data, this._i);\n }\n });\n return C;\n },\n def: function (that, key, value) {\n var data = getWeak(anObject(key), true);\n if (data === true) uncaughtFrozenStore(that).set(key, value);\n else data[that._i] = value;\n return that;\n },\n ufstore: uncaughtFrozenStore\n};\n","'use strict';\nvar global = require('./_global');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar redefineAll = require('./_redefine-all');\nvar meta = require('./_meta');\nvar forOf = require('./_for-of');\nvar anInstance = require('./_an-instance');\nvar isObject = require('./_is-object');\nvar fails = require('./_fails');\nvar $iterDetect = require('./_iter-detect');\nvar setToStringTag = require('./_set-to-string-tag');\nvar inheritIfRequired = require('./_inherit-if-required');\n\nmodule.exports = function (NAME, wrapper, methods, common, IS_MAP, IS_WEAK) {\n var Base = global[NAME];\n var C = Base;\n var ADDER = IS_MAP ? 'set' : 'add';\n var proto = C && C.prototype;\n var O = {};\n var fixMethod = function (KEY) {\n var fn = proto[KEY];\n redefine(proto, KEY,\n KEY == 'delete' ? function (a) {\n return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);\n } : KEY == 'has' ? function has(a) {\n return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);\n } : KEY == 'get' ? function get(a) {\n return IS_WEAK && !isObject(a) ? undefined : fn.call(this, a === 0 ? 0 : a);\n } : KEY == 'add' ? function add(a) { fn.call(this, a === 0 ? 0 : a); return this; }\n : function set(a, b) { fn.call(this, a === 0 ? 0 : a, b); return this; }\n );\n };\n if (typeof C != 'function' || !(IS_WEAK || proto.forEach && !fails(function () {\n new C().entries().next();\n }))) {\n // create collection constructor\n C = common.getConstructor(wrapper, NAME, IS_MAP, ADDER);\n redefineAll(C.prototype, methods);\n meta.NEED = true;\n } else {\n var instance = new C();\n // early implementations not supports chaining\n var HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance;\n // V8 ~ Chromium 40- weak-collections throws on primitives, but should return false\n var THROWS_ON_PRIMITIVES = fails(function () { instance.has(1); });\n // most early implementations doesn't supports iterables, most modern - not close it correctly\n var ACCEPT_ITERABLES = $iterDetect(function (iter) { new C(iter); }); // eslint-disable-line no-new\n // for early implementations -0 and +0 not the same\n var BUGGY_ZERO = !IS_WEAK && fails(function () {\n // V8 ~ Chromium 42- fails only with 5+ elements\n var $instance = new C();\n var index = 5;\n while (index--) $instance[ADDER](index, index);\n return !$instance.has(-0);\n });\n if (!ACCEPT_ITERABLES) {\n C = wrapper(function (target, iterable) {\n anInstance(target, C, NAME);\n var that = inheritIfRequired(new Base(), target, C);\n if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\n return that;\n });\n C.prototype = proto;\n proto.constructor = C;\n }\n if (THROWS_ON_PRIMITIVES || BUGGY_ZERO) {\n fixMethod('delete');\n fixMethod('has');\n IS_MAP && fixMethod('get');\n }\n if (BUGGY_ZERO || HASNT_CHAINING) fixMethod(ADDER);\n // weak collections should not contains .clear method\n if (IS_WEAK && proto.clear) delete proto.clear;\n }\n\n setToStringTag(C, NAME);\n\n O[NAME] = C;\n $export($export.G + $export.W + $export.F * (C != Base), O);\n\n if (!IS_WEAK) common.setStrong(C, NAME, IS_MAP);\n\n return C;\n};\n","var core = module.exports = { version: '2.5.1' };\nif (typeof __e == 'number') __e = core; // eslint-disable-line no-undef\n","'use strict';\nvar $defineProperty = require('./_object-dp');\nvar createDesc = require('./_property-desc');\n\nmodule.exports = function (object, index, value) {\n if (index in object) $defineProperty.f(object, index, createDesc(0, value));\n else object[index] = value;\n};\n","// optional / simple context binding\nvar aFunction = require('./_a-function');\nmodule.exports = function (fn, that, length) {\n aFunction(fn);\n if (that === undefined) return fn;\n switch (length) {\n case 1: return function (a) {\n return fn.call(that, a);\n };\n case 2: return function (a, b) {\n return fn.call(that, a, b);\n };\n case 3: return function (a, b, c) {\n return fn.call(that, a, b, c);\n };\n }\n return function (/* ...args */) {\n return fn.apply(that, arguments);\n };\n};\n","'use strict';\n// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()\nvar fails = require('./_fails');\nvar getTime = Date.prototype.getTime;\nvar $toISOString = Date.prototype.toISOString;\n\nvar lz = function (num) {\n return num > 9 ? num : '0' + num;\n};\n\n// PhantomJS / old WebKit has a broken implementations\nmodule.exports = (fails(function () {\n return $toISOString.call(new Date(-5e13 - 1)) != '0385-07-25T07:06:39.999Z';\n}) || !fails(function () {\n $toISOString.call(new Date(NaN));\n})) ? function toISOString() {\n if (!isFinite(getTime.call(this))) throw RangeError('Invalid time value');\n var d = this;\n var y = d.getUTCFullYear();\n var m = d.getUTCMilliseconds();\n var s = y < 0 ? '-' : y > 9999 ? '+' : '';\n return s + ('00000' + Math.abs(y)).slice(s ? -6 : -4) +\n '-' + lz(d.getUTCMonth() + 1) + '-' + lz(d.getUTCDate()) +\n 'T' + lz(d.getUTCHours()) + ':' + lz(d.getUTCMinutes()) +\n ':' + lz(d.getUTCSeconds()) + '.' + (m > 99 ? m : '0' + lz(m)) + 'Z';\n} : $toISOString;\n","'use strict';\nvar anObject = require('./_an-object');\nvar toPrimitive = require('./_to-primitive');\nvar NUMBER = 'number';\n\nmodule.exports = function (hint) {\n if (hint !== 'string' && hint !== NUMBER && hint !== 'default') throw TypeError('Incorrect hint');\n return toPrimitive(anObject(this), hint != NUMBER);\n};\n","// 7.2.1 RequireObjectCoercible(argument)\nmodule.exports = function (it) {\n if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n return it;\n};\n","// Thank's IE8 for his funny defineProperty\nmodule.exports = !require('./_fails')(function () {\n return Object.defineProperty({}, 'a', { get: function () { return 7; } }).a != 7;\n});\n","var isObject = require('./_is-object');\nvar document = require('./_global').document;\n// typeof document.createElement is 'object' in old IE\nvar is = isObject(document) && isObject(document.createElement);\nmodule.exports = function (it) {\n return is ? document.createElement(it) : {};\n};\n","// IE 8- don't enum bug keys\nmodule.exports = (\n 'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'\n).split(',');\n","// all enumerable object keys, includes symbols\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nmodule.exports = function (it) {\n var result = getKeys(it);\n var getSymbols = gOPS.f;\n if (getSymbols) {\n var symbols = getSymbols(it);\n var isEnum = pIE.f;\n var i = 0;\n var key;\n while (symbols.length > i) if (isEnum.call(it, key = symbols[i++])) result.push(key);\n } return result;\n};\n","var global = require('./_global');\nvar core = require('./_core');\nvar hide = require('./_hide');\nvar redefine = require('./_redefine');\nvar ctx = require('./_ctx');\nvar PROTOTYPE = 'prototype';\n\nvar $export = function (type, name, source) {\n var IS_FORCED = type & $export.F;\n var IS_GLOBAL = type & $export.G;\n var IS_STATIC = type & $export.S;\n var IS_PROTO = type & $export.P;\n var IS_BIND = type & $export.B;\n var target = IS_GLOBAL ? global : IS_STATIC ? global[name] || (global[name] = {}) : (global[name] || {})[PROTOTYPE];\n var exports = IS_GLOBAL ? core : core[name] || (core[name] = {});\n var expProto = exports[PROTOTYPE] || (exports[PROTOTYPE] = {});\n var key, own, out, exp;\n if (IS_GLOBAL) source = name;\n for (key in source) {\n // contains in native\n own = !IS_FORCED && target && target[key] !== undefined;\n // export native or passed\n out = (own ? target : source)[key];\n // bind timers to global for call from export context\n exp = IS_BIND && own ? ctx(out, global) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;\n // extend global\n if (target) redefine(target, key, out, type & $export.U);\n // export\n if (exports[key] != out) hide(exports, key, exp);\n if (IS_PROTO && expProto[key] != out) expProto[key] = out;\n }\n};\nglobal.core = core;\n// type bitmap\n$export.F = 1; // forced\n$export.G = 2; // global\n$export.S = 4; // static\n$export.P = 8; // proto\n$export.B = 16; // bind\n$export.W = 32; // wrap\n$export.U = 64; // safe\n$export.R = 128; // real proto method for `library`\nmodule.exports = $export;\n","var MATCH = require('./_wks')('match');\nmodule.exports = function (KEY) {\n var re = /./;\n try {\n '/./'[KEY](re);\n } catch (e) {\n try {\n re[MATCH] = false;\n return !'/./'[KEY](re);\n } catch (f) { /* empty */ }\n } return true;\n};\n","module.exports = function (exec) {\n try {\n return !!exec();\n } catch (e) {\n return true;\n }\n};\n","'use strict';\nvar hide = require('./_hide');\nvar redefine = require('./_redefine');\nvar fails = require('./_fails');\nvar defined = require('./_defined');\nvar wks = require('./_wks');\n\nmodule.exports = function (KEY, length, exec) {\n var SYMBOL = wks(KEY);\n var fns = exec(defined, SYMBOL, ''[KEY]);\n var strfn = fns[0];\n var rxfn = fns[1];\n if (fails(function () {\n var O = {};\n O[SYMBOL] = function () { return 7; };\n return ''[KEY](O) != 7;\n })) {\n redefine(String.prototype, KEY, strfn);\n hide(RegExp.prototype, SYMBOL, length == 2\n // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue)\n // 21.2.5.11 RegExp.prototype[@@split](string, limit)\n ? function (string, arg) { return rxfn.call(string, this, arg); }\n // 21.2.5.6 RegExp.prototype[@@match](string)\n // 21.2.5.9 RegExp.prototype[@@search](string)\n : function (string) { return rxfn.call(string, this); }\n );\n }\n};\n","'use strict';\n// 21.2.5.3 get RegExp.prototype.flags\nvar anObject = require('./_an-object');\nmodule.exports = function () {\n var that = anObject(this);\n var result = '';\n if (that.global) result += 'g';\n if (that.ignoreCase) result += 'i';\n if (that.multiline) result += 'm';\n if (that.unicode) result += 'u';\n if (that.sticky) result += 'y';\n return result;\n};\n","'use strict';\n// https://tc39.github.io/proposal-flatMap/#sec-FlattenIntoArray\nvar isArray = require('./_is-array');\nvar isObject = require('./_is-object');\nvar toLength = require('./_to-length');\nvar ctx = require('./_ctx');\nvar IS_CONCAT_SPREADABLE = require('./_wks')('isConcatSpreadable');\n\nfunction flattenIntoArray(target, original, source, sourceLen, start, depth, mapper, thisArg) {\n var targetIndex = start;\n var sourceIndex = 0;\n var mapFn = mapper ? ctx(mapper, thisArg, 3) : false;\n var element, spreadable;\n\n while (sourceIndex < sourceLen) {\n if (sourceIndex in source) {\n element = mapFn ? mapFn(source[sourceIndex], sourceIndex, original) : source[sourceIndex];\n\n spreadable = false;\n if (isObject(element)) {\n spreadable = element[IS_CONCAT_SPREADABLE];\n spreadable = spreadable !== undefined ? !!spreadable : isArray(element);\n }\n\n if (spreadable && depth > 0) {\n targetIndex = flattenIntoArray(target, original, element, toLength(element.length), targetIndex, depth - 1) - 1;\n } else {\n if (targetIndex >= 0x1fffffffffffff) throw TypeError();\n target[targetIndex] = element;\n }\n\n targetIndex++;\n }\n sourceIndex++;\n }\n return targetIndex;\n}\n\nmodule.exports = flattenIntoArray;\n","var ctx = require('./_ctx');\nvar call = require('./_iter-call');\nvar isArrayIter = require('./_is-array-iter');\nvar anObject = require('./_an-object');\nvar toLength = require('./_to-length');\nvar getIterFn = require('./core.get-iterator-method');\nvar BREAK = {};\nvar RETURN = {};\nvar exports = module.exports = function (iterable, entries, fn, that, ITERATOR) {\n var iterFn = ITERATOR ? function () { return iterable; } : getIterFn(iterable);\n var f = ctx(fn, that, entries ? 2 : 1);\n var index = 0;\n var length, step, iterator, result;\n if (typeof iterFn != 'function') throw TypeError(iterable + ' is not iterable!');\n // fast case for arrays with default iterator\n if (isArrayIter(iterFn)) for (length = toLength(iterable.length); length > index; index++) {\n result = entries ? f(anObject(step = iterable[index])[0], step[1]) : f(iterable[index]);\n if (result === BREAK || result === RETURN) return result;\n } else for (iterator = iterFn.call(iterable); !(step = iterator.next()).done;) {\n result = call(iterator, f, step.value, entries);\n if (result === BREAK || result === RETURN) return result;\n }\n};\nexports.BREAK = BREAK;\nexports.RETURN = RETURN;\n","// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nvar global = module.exports = typeof window != 'undefined' && window.Math == Math\n ? window : typeof self != 'undefined' && self.Math == Math ? self\n // eslint-disable-next-line no-new-func\n : Function('return this')();\nif (typeof __g == 'number') __g = global; // eslint-disable-line no-undef\n","var hasOwnProperty = {}.hasOwnProperty;\nmodule.exports = function (it, key) {\n return hasOwnProperty.call(it, key);\n};\n","var dP = require('./_object-dp');\nvar createDesc = require('./_property-desc');\nmodule.exports = require('./_descriptors') ? function (object, key, value) {\n return dP.f(object, key, createDesc(1, value));\n} : function (object, key, value) {\n object[key] = value;\n return object;\n};\n","var document = require('./_global').document;\nmodule.exports = document && document.documentElement;\n","module.exports = !require('./_descriptors') && !require('./_fails')(function () {\n return Object.defineProperty(require('./_dom-create')('div'), 'a', { get: function () { return 7; } }).a != 7;\n});\n","var isObject = require('./_is-object');\nvar setPrototypeOf = require('./_set-proto').set;\nmodule.exports = function (that, target, C) {\n var S = target.constructor;\n var P;\n if (S !== C && typeof S == 'function' && (P = S.prototype) !== C.prototype && isObject(P) && setPrototypeOf) {\n setPrototypeOf(that, P);\n } return that;\n};\n","// fast apply, http://jsperf.lnkit.com/fast-apply/5\nmodule.exports = function (fn, args, that) {\n var un = that === undefined;\n switch (args.length) {\n case 0: return un ? fn()\n : fn.call(that);\n case 1: return un ? fn(args[0])\n : fn.call(that, args[0]);\n case 2: return un ? fn(args[0], args[1])\n : fn.call(that, args[0], args[1]);\n case 3: return un ? fn(args[0], args[1], args[2])\n : fn.call(that, args[0], args[1], args[2]);\n case 4: return un ? fn(args[0], args[1], args[2], args[3])\n : fn.call(that, args[0], args[1], args[2], args[3]);\n } return fn.apply(that, args);\n};\n","// fallback for non-array-like ES3 and non-enumerable old V8 strings\nvar cof = require('./_cof');\n// eslint-disable-next-line no-prototype-builtins\nmodule.exports = Object('z').propertyIsEnumerable(0) ? Object : function (it) {\n return cof(it) == 'String' ? it.split('') : Object(it);\n};\n","// check on default Array iterator\nvar Iterators = require('./_iterators');\nvar ITERATOR = require('./_wks')('iterator');\nvar ArrayProto = Array.prototype;\n\nmodule.exports = function (it) {\n return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);\n};\n","// 7.2.2 IsArray(argument)\nvar cof = require('./_cof');\nmodule.exports = Array.isArray || function isArray(arg) {\n return cof(arg) == 'Array';\n};\n","// 20.1.2.3 Number.isInteger(number)\nvar isObject = require('./_is-object');\nvar floor = Math.floor;\nmodule.exports = function isInteger(it) {\n return !isObject(it) && isFinite(it) && floor(it) === it;\n};\n","module.exports = function (it) {\n return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n","// 7.2.8 IsRegExp(argument)\nvar isObject = require('./_is-object');\nvar cof = require('./_cof');\nvar MATCH = require('./_wks')('match');\nmodule.exports = function (it) {\n var isRegExp;\n return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : cof(it) == 'RegExp');\n};\n","// call something on iterator step with safe closing on error\nvar anObject = require('./_an-object');\nmodule.exports = function (iterator, fn, value, entries) {\n try {\n return entries ? fn(anObject(value)[0], value[1]) : fn(value);\n // 7.4.6 IteratorClose(iterator, completion)\n } catch (e) {\n var ret = iterator['return'];\n if (ret !== undefined) anObject(ret.call(iterator));\n throw e;\n }\n};\n","'use strict';\nvar create = require('./_object-create');\nvar descriptor = require('./_property-desc');\nvar setToStringTag = require('./_set-to-string-tag');\nvar IteratorPrototype = {};\n\n// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\nrequire('./_hide')(IteratorPrototype, require('./_wks')('iterator'), function () { return this; });\n\nmodule.exports = function (Constructor, NAME, next) {\n Constructor.prototype = create(IteratorPrototype, { next: descriptor(1, next) });\n setToStringTag(Constructor, NAME + ' Iterator');\n};\n","'use strict';\nvar LIBRARY = require('./_library');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar hide = require('./_hide');\nvar has = require('./_has');\nvar Iterators = require('./_iterators');\nvar $iterCreate = require('./_iter-create');\nvar setToStringTag = require('./_set-to-string-tag');\nvar getPrototypeOf = require('./_object-gpo');\nvar ITERATOR = require('./_wks')('iterator');\nvar BUGGY = !([].keys && 'next' in [].keys()); // Safari has buggy iterators w/o `next`\nvar FF_ITERATOR = '@@iterator';\nvar KEYS = 'keys';\nvar VALUES = 'values';\n\nvar returnThis = function () { return this; };\n\nmodule.exports = function (Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED) {\n $iterCreate(Constructor, NAME, next);\n var getMethod = function (kind) {\n if (!BUGGY && kind in proto) return proto[kind];\n switch (kind) {\n case KEYS: return function keys() { return new Constructor(this, kind); };\n case VALUES: return function values() { return new Constructor(this, kind); };\n } return function entries() { return new Constructor(this, kind); };\n };\n var TAG = NAME + ' Iterator';\n var DEF_VALUES = DEFAULT == VALUES;\n var VALUES_BUG = false;\n var proto = Base.prototype;\n var $native = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT];\n var $default = $native || getMethod(DEFAULT);\n var $entries = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined;\n var $anyNative = NAME == 'Array' ? proto.entries || $native : $native;\n var methods, key, IteratorPrototype;\n // Fix native\n if ($anyNative) {\n IteratorPrototype = getPrototypeOf($anyNative.call(new Base()));\n if (IteratorPrototype !== Object.prototype && IteratorPrototype.next) {\n // Set @@toStringTag to native iterators\n setToStringTag(IteratorPrototype, TAG, true);\n // fix for some old engines\n if (!LIBRARY && !has(IteratorPrototype, ITERATOR)) hide(IteratorPrototype, ITERATOR, returnThis);\n }\n }\n // fix Array#{values, @@iterator}.name in V8 / FF\n if (DEF_VALUES && $native && $native.name !== VALUES) {\n VALUES_BUG = true;\n $default = function values() { return $native.call(this); };\n }\n // Define iterator\n if ((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])) {\n hide(proto, ITERATOR, $default);\n }\n // Plug for library\n Iterators[NAME] = $default;\n Iterators[TAG] = returnThis;\n if (DEFAULT) {\n methods = {\n values: DEF_VALUES ? $default : getMethod(VALUES),\n keys: IS_SET ? $default : getMethod(KEYS),\n entries: $entries\n };\n if (FORCED) for (key in methods) {\n if (!(key in proto)) redefine(proto, key, methods[key]);\n } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);\n }\n return methods;\n};\n","var ITERATOR = require('./_wks')('iterator');\nvar SAFE_CLOSING = false;\n\ntry {\n var riter = [7][ITERATOR]();\n riter['return'] = function () { SAFE_CLOSING = true; };\n // eslint-disable-next-line no-throw-literal\n Array.from(riter, function () { throw 2; });\n} catch (e) { /* empty */ }\n\nmodule.exports = function (exec, skipClosing) {\n if (!skipClosing && !SAFE_CLOSING) return false;\n var safe = false;\n try {\n var arr = [7];\n var iter = arr[ITERATOR]();\n iter.next = function () { return { done: safe = true }; };\n arr[ITERATOR] = function () { return iter; };\n exec(arr);\n } catch (e) { /* empty */ }\n return safe;\n};\n","module.exports = function (done, value) {\n return { value: value, done: !!done };\n};\n","module.exports = {};\n","module.exports = false;\n","// 20.2.2.14 Math.expm1(x)\nvar $expm1 = Math.expm1;\nmodule.exports = (!$expm1\n // Old FF bug\n || $expm1(10) > 22025.465794806719 || $expm1(10) < 22025.4657948067165168\n // Tor Browser bug\n || $expm1(-2e-17) != -2e-17\n) ? function expm1(x) {\n return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : Math.exp(x) - 1;\n} : $expm1;\n","// 20.2.2.16 Math.fround(x)\nvar sign = require('./_math-sign');\nvar pow = Math.pow;\nvar EPSILON = pow(2, -52);\nvar EPSILON32 = pow(2, -23);\nvar MAX32 = pow(2, 127) * (2 - EPSILON32);\nvar MIN32 = pow(2, -126);\n\nvar roundTiesToEven = function (n) {\n return n + 1 / EPSILON - 1 / EPSILON;\n};\n\nmodule.exports = Math.fround || function fround(x) {\n var $abs = Math.abs(x);\n var $sign = sign(x);\n var a, result;\n if ($abs < MIN32) return $sign * roundTiesToEven($abs / MIN32 / EPSILON32) * MIN32 * EPSILON32;\n a = (1 + EPSILON32 / EPSILON) * $abs;\n result = a - (a - $abs);\n // eslint-disable-next-line no-self-compare\n if (result > MAX32 || result != result) return $sign * Infinity;\n return $sign * result;\n};\n","// 20.2.2.20 Math.log1p(x)\nmodule.exports = Math.log1p || function log1p(x) {\n return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : Math.log(1 + x);\n};\n","// https://rwaldron.github.io/proposal-math-extensions/\nmodule.exports = Math.scale || function scale(x, inLow, inHigh, outLow, outHigh) {\n if (\n arguments.length === 0\n // eslint-disable-next-line no-self-compare\n || x != x\n // eslint-disable-next-line no-self-compare\n || inLow != inLow\n // eslint-disable-next-line no-self-compare\n || inHigh != inHigh\n // eslint-disable-next-line no-self-compare\n || outLow != outLow\n // eslint-disable-next-line no-self-compare\n || outHigh != outHigh\n ) return NaN;\n if (x === Infinity || x === -Infinity) return x;\n return (x - inLow) * (outHigh - outLow) / (inHigh - inLow) + outLow;\n};\n","// 20.2.2.28 Math.sign(x)\nmodule.exports = Math.sign || function sign(x) {\n // eslint-disable-next-line no-self-compare\n return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1;\n};\n","var META = require('./_uid')('meta');\nvar isObject = require('./_is-object');\nvar has = require('./_has');\nvar setDesc = require('./_object-dp').f;\nvar id = 0;\nvar isExtensible = Object.isExtensible || function () {\n return true;\n};\nvar FREEZE = !require('./_fails')(function () {\n return isExtensible(Object.preventExtensions({}));\n});\nvar setMeta = function (it) {\n setDesc(it, META, { value: {\n i: 'O' + ++id, // object ID\n w: {} // weak collections IDs\n } });\n};\nvar fastKey = function (it, create) {\n // return primitive with prefix\n if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n if (!has(it, META)) {\n // can't set metadata to uncaught frozen object\n if (!isExtensible(it)) return 'F';\n // not necessary to add metadata\n if (!create) return 'E';\n // add missing metadata\n setMeta(it);\n // return object ID\n } return it[META].i;\n};\nvar getWeak = function (it, create) {\n if (!has(it, META)) {\n // can't set metadata to uncaught frozen object\n if (!isExtensible(it)) return true;\n // not necessary to add metadata\n if (!create) return false;\n // add missing metadata\n setMeta(it);\n // return hash weak collections IDs\n } return it[META].w;\n};\n// add metadata on freeze-family methods calling\nvar onFreeze = function (it) {\n if (FREEZE && meta.NEED && isExtensible(it) && !has(it, META)) setMeta(it);\n return it;\n};\nvar meta = module.exports = {\n KEY: META,\n NEED: false,\n fastKey: fastKey,\n getWeak: getWeak,\n onFreeze: onFreeze\n};\n","var Map = require('./es6.map');\nvar $export = require('./_export');\nvar shared = require('./_shared')('metadata');\nvar store = shared.store || (shared.store = new (require('./es6.weak-map'))());\n\nvar getOrCreateMetadataMap = function (target, targetKey, create) {\n var targetMetadata = store.get(target);\n if (!targetMetadata) {\n if (!create) return undefined;\n store.set(target, targetMetadata = new Map());\n }\n var keyMetadata = targetMetadata.get(targetKey);\n if (!keyMetadata) {\n if (!create) return undefined;\n targetMetadata.set(targetKey, keyMetadata = new Map());\n } return keyMetadata;\n};\nvar ordinaryHasOwnMetadata = function (MetadataKey, O, P) {\n var metadataMap = getOrCreateMetadataMap(O, P, false);\n return metadataMap === undefined ? false : metadataMap.has(MetadataKey);\n};\nvar ordinaryGetOwnMetadata = function (MetadataKey, O, P) {\n var metadataMap = getOrCreateMetadataMap(O, P, false);\n return metadataMap === undefined ? undefined : metadataMap.get(MetadataKey);\n};\nvar ordinaryDefineOwnMetadata = function (MetadataKey, MetadataValue, O, P) {\n getOrCreateMetadataMap(O, P, true).set(MetadataKey, MetadataValue);\n};\nvar ordinaryOwnMetadataKeys = function (target, targetKey) {\n var metadataMap = getOrCreateMetadataMap(target, targetKey, false);\n var keys = [];\n if (metadataMap) metadataMap.forEach(function (_, key) { keys.push(key); });\n return keys;\n};\nvar toMetaKey = function (it) {\n return it === undefined || typeof it == 'symbol' ? it : String(it);\n};\nvar exp = function (O) {\n $export($export.S, 'Reflect', O);\n};\n\nmodule.exports = {\n store: store,\n map: getOrCreateMetadataMap,\n has: ordinaryHasOwnMetadata,\n get: ordinaryGetOwnMetadata,\n set: ordinaryDefineOwnMetadata,\n keys: ordinaryOwnMetadataKeys,\n key: toMetaKey,\n exp: exp\n};\n","var global = require('./_global');\nvar macrotask = require('./_task').set;\nvar Observer = global.MutationObserver || global.WebKitMutationObserver;\nvar process = global.process;\nvar Promise = global.Promise;\nvar isNode = require('./_cof')(process) == 'process';\n\nmodule.exports = function () {\n var head, last, notify;\n\n var flush = function () {\n var parent, fn;\n if (isNode && (parent = process.domain)) parent.exit();\n while (head) {\n fn = head.fn;\n head = head.next;\n try {\n fn();\n } catch (e) {\n if (head) notify();\n else last = undefined;\n throw e;\n }\n } last = undefined;\n if (parent) parent.enter();\n };\n\n // Node.js\n if (isNode) {\n notify = function () {\n process.nextTick(flush);\n };\n // browsers with MutationObserver\n } else if (Observer) {\n var toggle = true;\n var node = document.createTextNode('');\n new Observer(flush).observe(node, { characterData: true }); // eslint-disable-line no-new\n notify = function () {\n node.data = toggle = !toggle;\n };\n // environments with maybe non-completely correct, but existent Promise\n } else if (Promise && Promise.resolve) {\n var promise = Promise.resolve();\n notify = function () {\n promise.then(flush);\n };\n // for other environments - macrotask based on:\n // - setImmediate\n // - MessageChannel\n // - window.postMessag\n // - onreadystatechange\n // - setTimeout\n } else {\n notify = function () {\n // strange IE + webpack dev server bug - use .call(global)\n macrotask.call(global, flush);\n };\n }\n\n return function (fn) {\n var task = { fn: fn, next: undefined };\n if (last) last.next = task;\n if (!head) {\n head = task;\n notify();\n } last = task;\n };\n};\n","'use strict';\n// 25.4.1.5 NewPromiseCapability(C)\nvar aFunction = require('./_a-function');\n\nfunction PromiseCapability(C) {\n var resolve, reject;\n this.promise = new C(function ($$resolve, $$reject) {\n if (resolve !== undefined || reject !== undefined) throw TypeError('Bad Promise constructor');\n resolve = $$resolve;\n reject = $$reject;\n });\n this.resolve = aFunction(resolve);\n this.reject = aFunction(reject);\n}\n\nmodule.exports.f = function (C) {\n return new PromiseCapability(C);\n};\n","'use strict';\n// 19.1.2.1 Object.assign(target, source, ...)\nvar getKeys = require('./_object-keys');\nvar gOPS = require('./_object-gops');\nvar pIE = require('./_object-pie');\nvar toObject = require('./_to-object');\nvar IObject = require('./_iobject');\nvar $assign = Object.assign;\n\n// should work with symbols and should have deterministic property order (V8 bug)\nmodule.exports = !$assign || require('./_fails')(function () {\n var A = {};\n var B = {};\n // eslint-disable-next-line no-undef\n var S = Symbol();\n var K = 'abcdefghijklmnopqrst';\n A[S] = 7;\n K.split('').forEach(function (k) { B[k] = k; });\n return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;\n}) ? function assign(target, source) { // eslint-disable-line no-unused-vars\n var T = toObject(target);\n var aLen = arguments.length;\n var index = 1;\n var getSymbols = gOPS.f;\n var isEnum = pIE.f;\n while (aLen > index) {\n var S = IObject(arguments[index++]);\n var keys = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S);\n var length = keys.length;\n var j = 0;\n var key;\n while (length > j) if (isEnum.call(S, key = keys[j++])) T[key] = S[key];\n } return T;\n} : $assign;\n","// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\nvar anObject = require('./_an-object');\nvar dPs = require('./_object-dps');\nvar enumBugKeys = require('./_enum-bug-keys');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar Empty = function () { /* empty */ };\nvar PROTOTYPE = 'prototype';\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar createDict = function () {\n // Thrash, waste and sodomy: IE GC bug\n var iframe = require('./_dom-create')('iframe');\n var i = enumBugKeys.length;\n var lt = '<';\n var gt = '>';\n var iframeDocument;\n iframe.style.display = 'none';\n require('./_html').appendChild(iframe);\n iframe.src = 'javascript:'; // eslint-disable-line no-script-url\n // createDict = iframe.contentWindow.Object;\n // html.removeChild(iframe);\n iframeDocument = iframe.contentWindow.document;\n iframeDocument.open();\n iframeDocument.write(lt + 'script' + gt + 'document.F=Object' + lt + '/script' + gt);\n iframeDocument.close();\n createDict = iframeDocument.F;\n while (i--) delete createDict[PROTOTYPE][enumBugKeys[i]];\n return createDict();\n};\n\nmodule.exports = Object.create || function create(O, Properties) {\n var result;\n if (O !== null) {\n Empty[PROTOTYPE] = anObject(O);\n result = new Empty();\n Empty[PROTOTYPE] = null;\n // add \"__proto__\" for Object.getPrototypeOf polyfill\n result[IE_PROTO] = O;\n } else result = createDict();\n return Properties === undefined ? result : dPs(result, Properties);\n};\n","var anObject = require('./_an-object');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar toPrimitive = require('./_to-primitive');\nvar dP = Object.defineProperty;\n\nexports.f = require('./_descriptors') ? Object.defineProperty : function defineProperty(O, P, Attributes) {\n anObject(O);\n P = toPrimitive(P, true);\n anObject(Attributes);\n if (IE8_DOM_DEFINE) try {\n return dP(O, P, Attributes);\n } catch (e) { /* empty */ }\n if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported!');\n if ('value' in Attributes) O[P] = Attributes.value;\n return O;\n};\n","var dP = require('./_object-dp');\nvar anObject = require('./_an-object');\nvar getKeys = require('./_object-keys');\n\nmodule.exports = require('./_descriptors') ? Object.defineProperties : function defineProperties(O, Properties) {\n anObject(O);\n var keys = getKeys(Properties);\n var length = keys.length;\n var i = 0;\n var P;\n while (length > i) dP.f(O, P = keys[i++], Properties[P]);\n return O;\n};\n","'use strict';\n// Forced replacement prototype accessors methods\nmodule.exports = require('./_library') || !require('./_fails')(function () {\n var K = Math.random();\n // In FF throws only define methods\n // eslint-disable-next-line no-undef, no-useless-call\n __defineSetter__.call(null, K, function () { /* empty */ });\n delete require('./_global')[K];\n});\n","var pIE = require('./_object-pie');\nvar createDesc = require('./_property-desc');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar has = require('./_has');\nvar IE8_DOM_DEFINE = require('./_ie8-dom-define');\nvar gOPD = Object.getOwnPropertyDescriptor;\n\nexports.f = require('./_descriptors') ? gOPD : function getOwnPropertyDescriptor(O, P) {\n O = toIObject(O);\n P = toPrimitive(P, true);\n if (IE8_DOM_DEFINE) try {\n return gOPD(O, P);\n } catch (e) { /* empty */ }\n if (has(O, P)) return createDesc(!pIE.f.call(O, P), O[P]);\n};\n","// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\nvar toIObject = require('./_to-iobject');\nvar gOPN = require('./_object-gopn').f;\nvar toString = {}.toString;\n\nvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\n ? Object.getOwnPropertyNames(window) : [];\n\nvar getWindowNames = function (it) {\n try {\n return gOPN(it);\n } catch (e) {\n return windowNames.slice();\n }\n};\n\nmodule.exports.f = function getOwnPropertyNames(it) {\n return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it));\n};\n","// 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)\nvar $keys = require('./_object-keys-internal');\nvar hiddenKeys = require('./_enum-bug-keys').concat('length', 'prototype');\n\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n return $keys(O, hiddenKeys);\n};\n","exports.f = Object.getOwnPropertySymbols;\n","// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\nvar has = require('./_has');\nvar toObject = require('./_to-object');\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\nvar ObjectProto = Object.prototype;\n\nmodule.exports = Object.getPrototypeOf || function (O) {\n O = toObject(O);\n if (has(O, IE_PROTO)) return O[IE_PROTO];\n if (typeof O.constructor == 'function' && O instanceof O.constructor) {\n return O.constructor.prototype;\n } return O instanceof Object ? ObjectProto : null;\n};\n","var has = require('./_has');\nvar toIObject = require('./_to-iobject');\nvar arrayIndexOf = require('./_array-includes')(false);\nvar IE_PROTO = require('./_shared-key')('IE_PROTO');\n\nmodule.exports = function (object, names) {\n var O = toIObject(object);\n var i = 0;\n var result = [];\n var key;\n for (key in O) if (key != IE_PROTO) has(O, key) && result.push(key);\n // Don't enum bug & hidden keys\n while (names.length > i) if (has(O, key = names[i++])) {\n ~arrayIndexOf(result, key) || result.push(key);\n }\n return result;\n};\n","// 19.1.2.14 / 15.2.3.14 Object.keys(O)\nvar $keys = require('./_object-keys-internal');\nvar enumBugKeys = require('./_enum-bug-keys');\n\nmodule.exports = Object.keys || function keys(O) {\n return $keys(O, enumBugKeys);\n};\n","exports.f = {}.propertyIsEnumerable;\n","// most Object methods by ES6 should accept primitives\nvar $export = require('./_export');\nvar core = require('./_core');\nvar fails = require('./_fails');\nmodule.exports = function (KEY, exec) {\n var fn = (core.Object || {})[KEY] || Object[KEY];\n var exp = {};\n exp[KEY] = exec(fn);\n $export($export.S + $export.F * fails(function () { fn(1); }), 'Object', exp);\n};\n","var getKeys = require('./_object-keys');\nvar toIObject = require('./_to-iobject');\nvar isEnum = require('./_object-pie').f;\nmodule.exports = function (isEntries) {\n return function (it) {\n var O = toIObject(it);\n var keys = getKeys(O);\n var length = keys.length;\n var i = 0;\n var result = [];\n var key;\n while (length > i) if (isEnum.call(O, key = keys[i++])) {\n result.push(isEntries ? [key, O[key]] : O[key]);\n } return result;\n };\n};\n","// all object keys, includes non-enumerable and symbols\nvar gOPN = require('./_object-gopn');\nvar gOPS = require('./_object-gops');\nvar anObject = require('./_an-object');\nvar Reflect = require('./_global').Reflect;\nmodule.exports = Reflect && Reflect.ownKeys || function ownKeys(it) {\n var keys = gOPN.f(anObject(it));\n var getSymbols = gOPS.f;\n return getSymbols ? keys.concat(getSymbols(it)) : keys;\n};\n","var $parseFloat = require('./_global').parseFloat;\nvar $trim = require('./_string-trim').trim;\n\nmodule.exports = 1 / $parseFloat(require('./_string-ws') + '-0') !== -Infinity ? function parseFloat(str) {\n var string = $trim(String(str), 3);\n var result = $parseFloat(string);\n return result === 0 && string.charAt(0) == '-' ? -0 : result;\n} : $parseFloat;\n","var $parseInt = require('./_global').parseInt;\nvar $trim = require('./_string-trim').trim;\nvar ws = require('./_string-ws');\nvar hex = /^[-+]?0[xX]/;\n\nmodule.exports = $parseInt(ws + '08') !== 8 || $parseInt(ws + '0x16') !== 22 ? function parseInt(str, radix) {\n var string = $trim(String(str), 3);\n return $parseInt(string, (radix >>> 0) || (hex.test(string) ? 16 : 10));\n} : $parseInt;\n","module.exports = function (exec) {\n try {\n return { e: false, v: exec() };\n } catch (e) {\n return { e: true, v: e };\n }\n};\n","var anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar newPromiseCapability = require('./_new-promise-capability');\n\nmodule.exports = function (C, x) {\n anObject(C);\n if (isObject(x) && x.constructor === C) return x;\n var promiseCapability = newPromiseCapability.f(C);\n var resolve = promiseCapability.resolve;\n resolve(x);\n return promiseCapability.promise;\n};\n","module.exports = function (bitmap, value) {\n return {\n enumerable: !(bitmap & 1),\n configurable: !(bitmap & 2),\n writable: !(bitmap & 4),\n value: value\n };\n};\n","var redefine = require('./_redefine');\nmodule.exports = function (target, src, safe) {\n for (var key in src) redefine(target, key, src[key], safe);\n return target;\n};\n","var global = require('./_global');\nvar hide = require('./_hide');\nvar has = require('./_has');\nvar SRC = require('./_uid')('src');\nvar TO_STRING = 'toString';\nvar $toString = Function[TO_STRING];\nvar TPL = ('' + $toString).split(TO_STRING);\n\nrequire('./_core').inspectSource = function (it) {\n return $toString.call(it);\n};\n\n(module.exports = function (O, key, val, safe) {\n var isFunction = typeof val == 'function';\n if (isFunction) has(val, 'name') || hide(val, 'name', key);\n if (O[key] === val) return;\n if (isFunction) has(val, SRC) || hide(val, SRC, O[key] ? '' + O[key] : TPL.join(String(key)));\n if (O === global) {\n O[key] = val;\n } else if (!safe) {\n delete O[key];\n hide(O, key, val);\n } else if (O[key]) {\n O[key] = val;\n } else {\n hide(O, key, val);\n }\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, TO_STRING, function toString() {\n return typeof this == 'function' && this[SRC] || $toString.call(this);\n});\n","module.exports = function (regExp, replace) {\n var replacer = replace === Object(replace) ? function (part) {\n return replace[part];\n } : replace;\n return function (it) {\n return String(it).replace(regExp, replacer);\n };\n};\n","// 7.2.9 SameValue(x, y)\nmodule.exports = Object.is || function is(x, y) {\n // eslint-disable-next-line no-self-compare\n return x === y ? x !== 0 || 1 / x === 1 / y : x != x && y != y;\n};\n","'use strict';\n// https://tc39.github.io/proposal-setmap-offrom/\nvar $export = require('./_export');\nvar aFunction = require('./_a-function');\nvar ctx = require('./_ctx');\nvar forOf = require('./_for-of');\n\nmodule.exports = function (COLLECTION) {\n $export($export.S, COLLECTION, { from: function from(source /* , mapFn, thisArg */) {\n var mapFn = arguments[1];\n var mapping, A, n, cb;\n aFunction(this);\n mapping = mapFn !== undefined;\n if (mapping) aFunction(mapFn);\n if (source == undefined) return new this();\n A = [];\n if (mapping) {\n n = 0;\n cb = ctx(mapFn, arguments[2], 2);\n forOf(source, false, function (nextItem) {\n A.push(cb(nextItem, n++));\n });\n } else {\n forOf(source, false, A.push, A);\n }\n return new this(A);\n } });\n};\n","'use strict';\n// https://tc39.github.io/proposal-setmap-offrom/\nvar $export = require('./_export');\n\nmodule.exports = function (COLLECTION) {\n $export($export.S, COLLECTION, { of: function of() {\n var length = arguments.length;\n var A = Array(length);\n while (length--) A[length] = arguments[length];\n return new this(A);\n } });\n};\n","// Works with __proto__ only. Old v8 can't work with null proto objects.\n/* eslint-disable no-proto */\nvar isObject = require('./_is-object');\nvar anObject = require('./_an-object');\nvar check = function (O, proto) {\n anObject(O);\n if (!isObject(proto) && proto !== null) throw TypeError(proto + \": can't set as prototype!\");\n};\nmodule.exports = {\n set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line\n function (test, buggy, set) {\n try {\n set = require('./_ctx')(Function.call, require('./_object-gopd').f(Object.prototype, '__proto__').set, 2);\n set(test, []);\n buggy = !(test instanceof Array);\n } catch (e) { buggy = true; }\n return function setPrototypeOf(O, proto) {\n check(O, proto);\n if (buggy) O.__proto__ = proto;\n else set(O, proto);\n return O;\n };\n }({}, false) : undefined),\n check: check\n};\n","'use strict';\nvar global = require('./_global');\nvar dP = require('./_object-dp');\nvar DESCRIPTORS = require('./_descriptors');\nvar SPECIES = require('./_wks')('species');\n\nmodule.exports = function (KEY) {\n var C = global[KEY];\n if (DESCRIPTORS && C && !C[SPECIES]) dP.f(C, SPECIES, {\n configurable: true,\n get: function () { return this; }\n });\n};\n","var def = require('./_object-dp').f;\nvar has = require('./_has');\nvar TAG = require('./_wks')('toStringTag');\n\nmodule.exports = function (it, tag, stat) {\n if (it && !has(it = stat ? it : it.prototype, TAG)) def(it, TAG, { configurable: true, value: tag });\n};\n","var shared = require('./_shared')('keys');\nvar uid = require('./_uid');\nmodule.exports = function (key) {\n return shared[key] || (shared[key] = uid(key));\n};\n","var global = require('./_global');\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || (global[SHARED] = {});\nmodule.exports = function (key) {\n return store[key] || (store[key] = {});\n};\n","// 7.3.20 SpeciesConstructor(O, defaultConstructor)\nvar anObject = require('./_an-object');\nvar aFunction = require('./_a-function');\nvar SPECIES = require('./_wks')('species');\nmodule.exports = function (O, D) {\n var C = anObject(O).constructor;\n var S;\n return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? D : aFunction(S);\n};\n","'use strict';\nvar fails = require('./_fails');\n\nmodule.exports = function (method, arg) {\n return !!method && fails(function () {\n // eslint-disable-next-line no-useless-call\n arg ? method.call(null, function () { /* empty */ }, 1) : method.call(null);\n });\n};\n","var toInteger = require('./_to-integer');\nvar defined = require('./_defined');\n// true -> String#at\n// false -> String#codePointAt\nmodule.exports = function (TO_STRING) {\n return function (that, pos) {\n var s = String(defined(that));\n var i = toInteger(pos);\n var l = s.length;\n var a, b;\n if (i < 0 || i >= l) return TO_STRING ? '' : undefined;\n a = s.charCodeAt(i);\n return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff\n ? TO_STRING ? s.charAt(i) : a\n : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;\n };\n};\n","// helper for String#{startsWith, endsWith, includes}\nvar isRegExp = require('./_is-regexp');\nvar defined = require('./_defined');\n\nmodule.exports = function (that, searchString, NAME) {\n if (isRegExp(searchString)) throw TypeError('String#' + NAME + \" doesn't accept regex!\");\n return String(defined(that));\n};\n","var $export = require('./_export');\nvar fails = require('./_fails');\nvar defined = require('./_defined');\nvar quot = /\"/g;\n// B.2.3.2.1 CreateHTML(string, tag, attribute, value)\nvar createHTML = function (string, tag, attribute, value) {\n var S = String(defined(string));\n var p1 = '<' + tag;\n if (attribute !== '') p1 += ' ' + attribute + '=\"' + String(value).replace(quot, '"') + '\"';\n return p1 + '>' + S + '';\n};\nmodule.exports = function (NAME, exec) {\n var O = {};\n O[NAME] = exec(createHTML);\n $export($export.P + $export.F * fails(function () {\n var test = ''[NAME]('\"');\n return test !== test.toLowerCase() || test.split('\"').length > 3;\n }), 'String', O);\n};\n","// https://github.com/tc39/proposal-string-pad-start-end\nvar toLength = require('./_to-length');\nvar repeat = require('./_string-repeat');\nvar defined = require('./_defined');\n\nmodule.exports = function (that, maxLength, fillString, left) {\n var S = String(defined(that));\n var stringLength = S.length;\n var fillStr = fillString === undefined ? ' ' : String(fillString);\n var intMaxLength = toLength(maxLength);\n if (intMaxLength <= stringLength || fillStr == '') return S;\n var fillLen = intMaxLength - stringLength;\n var stringFiller = repeat.call(fillStr, Math.ceil(fillLen / fillStr.length));\n if (stringFiller.length > fillLen) stringFiller = stringFiller.slice(0, fillLen);\n return left ? stringFiller + S : S + stringFiller;\n};\n","'use strict';\nvar toInteger = require('./_to-integer');\nvar defined = require('./_defined');\n\nmodule.exports = function repeat(count) {\n var str = String(defined(this));\n var res = '';\n var n = toInteger(count);\n if (n < 0 || n == Infinity) throw RangeError(\"Count can't be negative\");\n for (;n > 0; (n >>>= 1) && (str += str)) if (n & 1) res += str;\n return res;\n};\n","var $export = require('./_export');\nvar defined = require('./_defined');\nvar fails = require('./_fails');\nvar spaces = require('./_string-ws');\nvar space = '[' + spaces + ']';\nvar non = '\\u200b\\u0085';\nvar ltrim = RegExp('^' + space + space + '*');\nvar rtrim = RegExp(space + space + '*$');\n\nvar exporter = function (KEY, exec, ALIAS) {\n var exp = {};\n var FORCE = fails(function () {\n return !!spaces[KEY]() || non[KEY]() != non;\n });\n var fn = exp[KEY] = FORCE ? exec(trim) : spaces[KEY];\n if (ALIAS) exp[ALIAS] = fn;\n $export($export.P + $export.F * FORCE, 'String', exp);\n};\n\n// 1 -> String#trimLeft\n// 2 -> String#trimRight\n// 3 -> String#trim\nvar trim = exporter.trim = function (string, TYPE) {\n string = String(defined(string));\n if (TYPE & 1) string = string.replace(ltrim, '');\n if (TYPE & 2) string = string.replace(rtrim, '');\n return string;\n};\n\nmodule.exports = exporter;\n","module.exports = '\\x09\\x0A\\x0B\\x0C\\x0D\\x20\\xA0\\u1680\\u180E\\u2000\\u2001\\u2002\\u2003' +\n '\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028\\u2029\\uFEFF';\n","var ctx = require('./_ctx');\nvar invoke = require('./_invoke');\nvar html = require('./_html');\nvar cel = require('./_dom-create');\nvar global = require('./_global');\nvar process = global.process;\nvar setTask = global.setImmediate;\nvar clearTask = global.clearImmediate;\nvar MessageChannel = global.MessageChannel;\nvar Dispatch = global.Dispatch;\nvar counter = 0;\nvar queue = {};\nvar ONREADYSTATECHANGE = 'onreadystatechange';\nvar defer, channel, port;\nvar run = function () {\n var id = +this;\n // eslint-disable-next-line no-prototype-builtins\n if (queue.hasOwnProperty(id)) {\n var fn = queue[id];\n delete queue[id];\n fn();\n }\n};\nvar listener = function (event) {\n run.call(event.data);\n};\n// Node.js 0.9+ & IE10+ has setImmediate, otherwise:\nif (!setTask || !clearTask) {\n setTask = function setImmediate(fn) {\n var args = [];\n var i = 1;\n while (arguments.length > i) args.push(arguments[i++]);\n queue[++counter] = function () {\n // eslint-disable-next-line no-new-func\n invoke(typeof fn == 'function' ? fn : Function(fn), args);\n };\n defer(counter);\n return counter;\n };\n clearTask = function clearImmediate(id) {\n delete queue[id];\n };\n // Node.js 0.8-\n if (require('./_cof')(process) == 'process') {\n defer = function (id) {\n process.nextTick(ctx(run, id, 1));\n };\n // Sphere (JS game engine) Dispatch API\n } else if (Dispatch && Dispatch.now) {\n defer = function (id) {\n Dispatch.now(ctx(run, id, 1));\n };\n // Browsers with MessageChannel, includes WebWorkers\n } else if (MessageChannel) {\n channel = new MessageChannel();\n port = channel.port2;\n channel.port1.onmessage = listener;\n defer = ctx(port.postMessage, port, 1);\n // Browsers with postMessage, skip WebWorkers\n // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'\n } else if (global.addEventListener && typeof postMessage == 'function' && !global.importScripts) {\n defer = function (id) {\n global.postMessage(id + '', '*');\n };\n global.addEventListener('message', listener, false);\n // IE8-\n } else if (ONREADYSTATECHANGE in cel('script')) {\n defer = function (id) {\n html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function () {\n html.removeChild(this);\n run.call(id);\n };\n };\n // Rest old browsers\n } else {\n defer = function (id) {\n setTimeout(ctx(run, id, 1), 0);\n };\n }\n}\nmodule.exports = {\n set: setTask,\n clear: clearTask\n};\n","var toInteger = require('./_to-integer');\nvar max = Math.max;\nvar min = Math.min;\nmodule.exports = function (index, length) {\n index = toInteger(index);\n return index < 0 ? max(index + length, 0) : min(index, length);\n};\n","// https://tc39.github.io/ecma262/#sec-toindex\nvar toInteger = require('./_to-integer');\nvar toLength = require('./_to-length');\nmodule.exports = function (it) {\n if (it === undefined) return 0;\n var number = toInteger(it);\n var length = toLength(number);\n if (number !== length) throw RangeError('Wrong length!');\n return length;\n};\n","// 7.1.4 ToInteger\nvar ceil = Math.ceil;\nvar floor = Math.floor;\nmodule.exports = function (it) {\n return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);\n};\n","// to indexed object, toObject with fallback for non-array-like ES3 strings\nvar IObject = require('./_iobject');\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n return IObject(defined(it));\n};\n","// 7.1.15 ToLength\nvar toInteger = require('./_to-integer');\nvar min = Math.min;\nmodule.exports = function (it) {\n return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991\n};\n","// 7.1.13 ToObject(argument)\nvar defined = require('./_defined');\nmodule.exports = function (it) {\n return Object(defined(it));\n};\n","// 7.1.1 ToPrimitive(input [, PreferredType])\nvar isObject = require('./_is-object');\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (it, S) {\n if (!isObject(it)) return it;\n var fn, val;\n if (S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n if (typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it))) return val;\n if (!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\n throw TypeError(\"Can't convert object to primitive value\");\n};\n","'use strict';\nif (require('./_descriptors')) {\n var LIBRARY = require('./_library');\n var global = require('./_global');\n var fails = require('./_fails');\n var $export = require('./_export');\n var $typed = require('./_typed');\n var $buffer = require('./_typed-buffer');\n var ctx = require('./_ctx');\n var anInstance = require('./_an-instance');\n var propertyDesc = require('./_property-desc');\n var hide = require('./_hide');\n var redefineAll = require('./_redefine-all');\n var toInteger = require('./_to-integer');\n var toLength = require('./_to-length');\n var toIndex = require('./_to-index');\n var toAbsoluteIndex = require('./_to-absolute-index');\n var toPrimitive = require('./_to-primitive');\n var has = require('./_has');\n var classof = require('./_classof');\n var isObject = require('./_is-object');\n var toObject = require('./_to-object');\n var isArrayIter = require('./_is-array-iter');\n var create = require('./_object-create');\n var getPrototypeOf = require('./_object-gpo');\n var gOPN = require('./_object-gopn').f;\n var getIterFn = require('./core.get-iterator-method');\n var uid = require('./_uid');\n var wks = require('./_wks');\n var createArrayMethod = require('./_array-methods');\n var createArrayIncludes = require('./_array-includes');\n var speciesConstructor = require('./_species-constructor');\n var ArrayIterators = require('./es6.array.iterator');\n var Iterators = require('./_iterators');\n var $iterDetect = require('./_iter-detect');\n var setSpecies = require('./_set-species');\n var arrayFill = require('./_array-fill');\n var arrayCopyWithin = require('./_array-copy-within');\n var $DP = require('./_object-dp');\n var $GOPD = require('./_object-gopd');\n var dP = $DP.f;\n var gOPD = $GOPD.f;\n var RangeError = global.RangeError;\n var TypeError = global.TypeError;\n var Uint8Array = global.Uint8Array;\n var ARRAY_BUFFER = 'ArrayBuffer';\n var SHARED_BUFFER = 'Shared' + ARRAY_BUFFER;\n var BYTES_PER_ELEMENT = 'BYTES_PER_ELEMENT';\n var PROTOTYPE = 'prototype';\n var ArrayProto = Array[PROTOTYPE];\n var $ArrayBuffer = $buffer.ArrayBuffer;\n var $DataView = $buffer.DataView;\n var arrayForEach = createArrayMethod(0);\n var arrayFilter = createArrayMethod(2);\n var arraySome = createArrayMethod(3);\n var arrayEvery = createArrayMethod(4);\n var arrayFind = createArrayMethod(5);\n var arrayFindIndex = createArrayMethod(6);\n var arrayIncludes = createArrayIncludes(true);\n var arrayIndexOf = createArrayIncludes(false);\n var arrayValues = ArrayIterators.values;\n var arrayKeys = ArrayIterators.keys;\n var arrayEntries = ArrayIterators.entries;\n var arrayLastIndexOf = ArrayProto.lastIndexOf;\n var arrayReduce = ArrayProto.reduce;\n var arrayReduceRight = ArrayProto.reduceRight;\n var arrayJoin = ArrayProto.join;\n var arraySort = ArrayProto.sort;\n var arraySlice = ArrayProto.slice;\n var arrayToString = ArrayProto.toString;\n var arrayToLocaleString = ArrayProto.toLocaleString;\n var ITERATOR = wks('iterator');\n var TAG = wks('toStringTag');\n var TYPED_CONSTRUCTOR = uid('typed_constructor');\n var DEF_CONSTRUCTOR = uid('def_constructor');\n var ALL_CONSTRUCTORS = $typed.CONSTR;\n var TYPED_ARRAY = $typed.TYPED;\n var VIEW = $typed.VIEW;\n var WRONG_LENGTH = 'Wrong length!';\n\n var $map = createArrayMethod(1, function (O, length) {\n return allocate(speciesConstructor(O, O[DEF_CONSTRUCTOR]), length);\n });\n\n var LITTLE_ENDIAN = fails(function () {\n // eslint-disable-next-line no-undef\n return new Uint8Array(new Uint16Array([1]).buffer)[0] === 1;\n });\n\n var FORCED_SET = !!Uint8Array && !!Uint8Array[PROTOTYPE].set && fails(function () {\n new Uint8Array(1).set({});\n });\n\n var toOffset = function (it, BYTES) {\n var offset = toInteger(it);\n if (offset < 0 || offset % BYTES) throw RangeError('Wrong offset!');\n return offset;\n };\n\n var validate = function (it) {\n if (isObject(it) && TYPED_ARRAY in it) return it;\n throw TypeError(it + ' is not a typed array!');\n };\n\n var allocate = function (C, length) {\n if (!(isObject(C) && TYPED_CONSTRUCTOR in C)) {\n throw TypeError('It is not a typed array constructor!');\n } return new C(length);\n };\n\n var speciesFromList = function (O, list) {\n return fromList(speciesConstructor(O, O[DEF_CONSTRUCTOR]), list);\n };\n\n var fromList = function (C, list) {\n var index = 0;\n var length = list.length;\n var result = allocate(C, length);\n while (length > index) result[index] = list[index++];\n return result;\n };\n\n var addGetter = function (it, key, internal) {\n dP(it, key, { get: function () { return this._d[internal]; } });\n };\n\n var $from = function from(source /* , mapfn, thisArg */) {\n var O = toObject(source);\n var aLen = arguments.length;\n var mapfn = aLen > 1 ? arguments[1] : undefined;\n var mapping = mapfn !== undefined;\n var iterFn = getIterFn(O);\n var i, length, values, result, step, iterator;\n if (iterFn != undefined && !isArrayIter(iterFn)) {\n for (iterator = iterFn.call(O), values = [], i = 0; !(step = iterator.next()).done; i++) {\n values.push(step.value);\n } O = values;\n }\n if (mapping && aLen > 2) mapfn = ctx(mapfn, arguments[2], 2);\n for (i = 0, length = toLength(O.length), result = allocate(this, length); length > i; i++) {\n result[i] = mapping ? mapfn(O[i], i) : O[i];\n }\n return result;\n };\n\n var $of = function of(/* ...items */) {\n var index = 0;\n var length = arguments.length;\n var result = allocate(this, length);\n while (length > index) result[index] = arguments[index++];\n return result;\n };\n\n // iOS Safari 6.x fails here\n var TO_LOCALE_BUG = !!Uint8Array && fails(function () { arrayToLocaleString.call(new Uint8Array(1)); });\n\n var $toLocaleString = function toLocaleString() {\n return arrayToLocaleString.apply(TO_LOCALE_BUG ? arraySlice.call(validate(this)) : validate(this), arguments);\n };\n\n var proto = {\n copyWithin: function copyWithin(target, start /* , end */) {\n return arrayCopyWithin.call(validate(this), target, start, arguments.length > 2 ? arguments[2] : undefined);\n },\n every: function every(callbackfn /* , thisArg */) {\n return arrayEvery(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n fill: function fill(value /* , start, end */) { // eslint-disable-line no-unused-vars\n return arrayFill.apply(validate(this), arguments);\n },\n filter: function filter(callbackfn /* , thisArg */) {\n return speciesFromList(this, arrayFilter(validate(this), callbackfn,\n arguments.length > 1 ? arguments[1] : undefined));\n },\n find: function find(predicate /* , thisArg */) {\n return arrayFind(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n },\n findIndex: function findIndex(predicate /* , thisArg */) {\n return arrayFindIndex(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n },\n forEach: function forEach(callbackfn /* , thisArg */) {\n arrayForEach(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n indexOf: function indexOf(searchElement /* , fromIndex */) {\n return arrayIndexOf(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n },\n includes: function includes(searchElement /* , fromIndex */) {\n return arrayIncludes(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n },\n join: function join(separator) { // eslint-disable-line no-unused-vars\n return arrayJoin.apply(validate(this), arguments);\n },\n lastIndexOf: function lastIndexOf(searchElement /* , fromIndex */) { // eslint-disable-line no-unused-vars\n return arrayLastIndexOf.apply(validate(this), arguments);\n },\n map: function map(mapfn /* , thisArg */) {\n return $map(validate(this), mapfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n reduce: function reduce(callbackfn /* , initialValue */) { // eslint-disable-line no-unused-vars\n return arrayReduce.apply(validate(this), arguments);\n },\n reduceRight: function reduceRight(callbackfn /* , initialValue */) { // eslint-disable-line no-unused-vars\n return arrayReduceRight.apply(validate(this), arguments);\n },\n reverse: function reverse() {\n var that = this;\n var length = validate(that).length;\n var middle = Math.floor(length / 2);\n var index = 0;\n var value;\n while (index < middle) {\n value = that[index];\n that[index++] = that[--length];\n that[length] = value;\n } return that;\n },\n some: function some(callbackfn /* , thisArg */) {\n return arraySome(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n },\n sort: function sort(comparefn) {\n return arraySort.call(validate(this), comparefn);\n },\n subarray: function subarray(begin, end) {\n var O = validate(this);\n var length = O.length;\n var $begin = toAbsoluteIndex(begin, length);\n return new (speciesConstructor(O, O[DEF_CONSTRUCTOR]))(\n O.buffer,\n O.byteOffset + $begin * O.BYTES_PER_ELEMENT,\n toLength((end === undefined ? length : toAbsoluteIndex(end, length)) - $begin)\n );\n }\n };\n\n var $slice = function slice(start, end) {\n return speciesFromList(this, arraySlice.call(validate(this), start, end));\n };\n\n var $set = function set(arrayLike /* , offset */) {\n validate(this);\n var offset = toOffset(arguments[1], 1);\n var length = this.length;\n var src = toObject(arrayLike);\n var len = toLength(src.length);\n var index = 0;\n if (len + offset > length) throw RangeError(WRONG_LENGTH);\n while (index < len) this[offset + index] = src[index++];\n };\n\n var $iterators = {\n entries: function entries() {\n return arrayEntries.call(validate(this));\n },\n keys: function keys() {\n return arrayKeys.call(validate(this));\n },\n values: function values() {\n return arrayValues.call(validate(this));\n }\n };\n\n var isTAIndex = function (target, key) {\n return isObject(target)\n && target[TYPED_ARRAY]\n && typeof key != 'symbol'\n && key in target\n && String(+key) == String(key);\n };\n var $getDesc = function getOwnPropertyDescriptor(target, key) {\n return isTAIndex(target, key = toPrimitive(key, true))\n ? propertyDesc(2, target[key])\n : gOPD(target, key);\n };\n var $setDesc = function defineProperty(target, key, desc) {\n if (isTAIndex(target, key = toPrimitive(key, true))\n && isObject(desc)\n && has(desc, 'value')\n && !has(desc, 'get')\n && !has(desc, 'set')\n // TODO: add validation descriptor w/o calling accessors\n && !desc.configurable\n && (!has(desc, 'writable') || desc.writable)\n && (!has(desc, 'enumerable') || desc.enumerable)\n ) {\n target[key] = desc.value;\n return target;\n } return dP(target, key, desc);\n };\n\n if (!ALL_CONSTRUCTORS) {\n $GOPD.f = $getDesc;\n $DP.f = $setDesc;\n }\n\n $export($export.S + $export.F * !ALL_CONSTRUCTORS, 'Object', {\n getOwnPropertyDescriptor: $getDesc,\n defineProperty: $setDesc\n });\n\n if (fails(function () { arrayToString.call({}); })) {\n arrayToString = arrayToLocaleString = function toString() {\n return arrayJoin.call(this);\n };\n }\n\n var $TypedArrayPrototype$ = redefineAll({}, proto);\n redefineAll($TypedArrayPrototype$, $iterators);\n hide($TypedArrayPrototype$, ITERATOR, $iterators.values);\n redefineAll($TypedArrayPrototype$, {\n slice: $slice,\n set: $set,\n constructor: function () { /* noop */ },\n toString: arrayToString,\n toLocaleString: $toLocaleString\n });\n addGetter($TypedArrayPrototype$, 'buffer', 'b');\n addGetter($TypedArrayPrototype$, 'byteOffset', 'o');\n addGetter($TypedArrayPrototype$, 'byteLength', 'l');\n addGetter($TypedArrayPrototype$, 'length', 'e');\n dP($TypedArrayPrototype$, TAG, {\n get: function () { return this[TYPED_ARRAY]; }\n });\n\n // eslint-disable-next-line max-statements\n module.exports = function (KEY, BYTES, wrapper, CLAMPED) {\n CLAMPED = !!CLAMPED;\n var NAME = KEY + (CLAMPED ? 'Clamped' : '') + 'Array';\n var GETTER = 'get' + KEY;\n var SETTER = 'set' + KEY;\n var TypedArray = global[NAME];\n var Base = TypedArray || {};\n var TAC = TypedArray && getPrototypeOf(TypedArray);\n var FORCED = !TypedArray || !$typed.ABV;\n var O = {};\n var TypedArrayPrototype = TypedArray && TypedArray[PROTOTYPE];\n var getter = function (that, index) {\n var data = that._d;\n return data.v[GETTER](index * BYTES + data.o, LITTLE_ENDIAN);\n };\n var setter = function (that, index, value) {\n var data = that._d;\n if (CLAMPED) value = (value = Math.round(value)) < 0 ? 0 : value > 0xff ? 0xff : value & 0xff;\n data.v[SETTER](index * BYTES + data.o, value, LITTLE_ENDIAN);\n };\n var addElement = function (that, index) {\n dP(that, index, {\n get: function () {\n return getter(this, index);\n },\n set: function (value) {\n return setter(this, index, value);\n },\n enumerable: true\n });\n };\n if (FORCED) {\n TypedArray = wrapper(function (that, data, $offset, $length) {\n anInstance(that, TypedArray, NAME, '_d');\n var index = 0;\n var offset = 0;\n var buffer, byteLength, length, klass;\n if (!isObject(data)) {\n length = toIndex(data);\n byteLength = length * BYTES;\n buffer = new $ArrayBuffer(byteLength);\n } else if (data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER) {\n buffer = data;\n offset = toOffset($offset, BYTES);\n var $len = data.byteLength;\n if ($length === undefined) {\n if ($len % BYTES) throw RangeError(WRONG_LENGTH);\n byteLength = $len - offset;\n if (byteLength < 0) throw RangeError(WRONG_LENGTH);\n } else {\n byteLength = toLength($length) * BYTES;\n if (byteLength + offset > $len) throw RangeError(WRONG_LENGTH);\n }\n length = byteLength / BYTES;\n } else if (TYPED_ARRAY in data) {\n return fromList(TypedArray, data);\n } else {\n return $from.call(TypedArray, data);\n }\n hide(that, '_d', {\n b: buffer,\n o: offset,\n l: byteLength,\n e: length,\n v: new $DataView(buffer)\n });\n while (index < length) addElement(that, index++);\n });\n TypedArrayPrototype = TypedArray[PROTOTYPE] = create($TypedArrayPrototype$);\n hide(TypedArrayPrototype, 'constructor', TypedArray);\n } else if (!fails(function () {\n TypedArray(1);\n }) || !fails(function () {\n new TypedArray(-1); // eslint-disable-line no-new\n }) || !$iterDetect(function (iter) {\n new TypedArray(); // eslint-disable-line no-new\n new TypedArray(null); // eslint-disable-line no-new\n new TypedArray(1.5); // eslint-disable-line no-new\n new TypedArray(iter); // eslint-disable-line no-new\n }, true)) {\n TypedArray = wrapper(function (that, data, $offset, $length) {\n anInstance(that, TypedArray, NAME);\n var klass;\n // `ws` module bug, temporarily remove validation length for Uint8Array\n // https://github.com/websockets/ws/pull/645\n if (!isObject(data)) return new Base(toIndex(data));\n if (data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER) {\n return $length !== undefined\n ? new Base(data, toOffset($offset, BYTES), $length)\n : $offset !== undefined\n ? new Base(data, toOffset($offset, BYTES))\n : new Base(data);\n }\n if (TYPED_ARRAY in data) return fromList(TypedArray, data);\n return $from.call(TypedArray, data);\n });\n arrayForEach(TAC !== Function.prototype ? gOPN(Base).concat(gOPN(TAC)) : gOPN(Base), function (key) {\n if (!(key in TypedArray)) hide(TypedArray, key, Base[key]);\n });\n TypedArray[PROTOTYPE] = TypedArrayPrototype;\n if (!LIBRARY) TypedArrayPrototype.constructor = TypedArray;\n }\n var $nativeIterator = TypedArrayPrototype[ITERATOR];\n var CORRECT_ITER_NAME = !!$nativeIterator\n && ($nativeIterator.name == 'values' || $nativeIterator.name == undefined);\n var $iterator = $iterators.values;\n hide(TypedArray, TYPED_CONSTRUCTOR, true);\n hide(TypedArrayPrototype, TYPED_ARRAY, NAME);\n hide(TypedArrayPrototype, VIEW, true);\n hide(TypedArrayPrototype, DEF_CONSTRUCTOR, TypedArray);\n\n if (CLAMPED ? new TypedArray(1)[TAG] != NAME : !(TAG in TypedArrayPrototype)) {\n dP(TypedArrayPrototype, TAG, {\n get: function () { return NAME; }\n });\n }\n\n O[NAME] = TypedArray;\n\n $export($export.G + $export.W + $export.F * (TypedArray != Base), O);\n\n $export($export.S, NAME, {\n BYTES_PER_ELEMENT: BYTES\n });\n\n $export($export.S + $export.F * fails(function () { Base.of.call(TypedArray, 1); }), NAME, {\n from: $from,\n of: $of\n });\n\n if (!(BYTES_PER_ELEMENT in TypedArrayPrototype)) hide(TypedArrayPrototype, BYTES_PER_ELEMENT, BYTES);\n\n $export($export.P, NAME, proto);\n\n setSpecies(NAME);\n\n $export($export.P + $export.F * FORCED_SET, NAME, { set: $set });\n\n $export($export.P + $export.F * !CORRECT_ITER_NAME, NAME, $iterators);\n\n if (!LIBRARY && TypedArrayPrototype.toString != arrayToString) TypedArrayPrototype.toString = arrayToString;\n\n $export($export.P + $export.F * fails(function () {\n new TypedArray(1).slice();\n }), NAME, { slice: $slice });\n\n $export($export.P + $export.F * (fails(function () {\n return [1, 2].toLocaleString() != new TypedArray([1, 2]).toLocaleString();\n }) || !fails(function () {\n TypedArrayPrototype.toLocaleString.call([1, 2]);\n })), NAME, { toLocaleString: $toLocaleString });\n\n Iterators[NAME] = CORRECT_ITER_NAME ? $nativeIterator : $iterator;\n if (!LIBRARY && !CORRECT_ITER_NAME) hide(TypedArrayPrototype, ITERATOR, $iterator);\n };\n} else module.exports = function () { /* empty */ };\n","'use strict';\nvar global = require('./_global');\nvar DESCRIPTORS = require('./_descriptors');\nvar LIBRARY = require('./_library');\nvar $typed = require('./_typed');\nvar hide = require('./_hide');\nvar redefineAll = require('./_redefine-all');\nvar fails = require('./_fails');\nvar anInstance = require('./_an-instance');\nvar toInteger = require('./_to-integer');\nvar toLength = require('./_to-length');\nvar toIndex = require('./_to-index');\nvar gOPN = require('./_object-gopn').f;\nvar dP = require('./_object-dp').f;\nvar arrayFill = require('./_array-fill');\nvar setToStringTag = require('./_set-to-string-tag');\nvar ARRAY_BUFFER = 'ArrayBuffer';\nvar DATA_VIEW = 'DataView';\nvar PROTOTYPE = 'prototype';\nvar WRONG_LENGTH = 'Wrong length!';\nvar WRONG_INDEX = 'Wrong index!';\nvar $ArrayBuffer = global[ARRAY_BUFFER];\nvar $DataView = global[DATA_VIEW];\nvar Math = global.Math;\nvar RangeError = global.RangeError;\n// eslint-disable-next-line no-shadow-restricted-names\nvar Infinity = global.Infinity;\nvar BaseBuffer = $ArrayBuffer;\nvar abs = Math.abs;\nvar pow = Math.pow;\nvar floor = Math.floor;\nvar log = Math.log;\nvar LN2 = Math.LN2;\nvar BUFFER = 'buffer';\nvar BYTE_LENGTH = 'byteLength';\nvar BYTE_OFFSET = 'byteOffset';\nvar $BUFFER = DESCRIPTORS ? '_b' : BUFFER;\nvar $LENGTH = DESCRIPTORS ? '_l' : BYTE_LENGTH;\nvar $OFFSET = DESCRIPTORS ? '_o' : BYTE_OFFSET;\n\n// IEEE754 conversions based on https://github.com/feross/ieee754\nfunction packIEEE754(value, mLen, nBytes) {\n var buffer = Array(nBytes);\n var eLen = nBytes * 8 - mLen - 1;\n var eMax = (1 << eLen) - 1;\n var eBias = eMax >> 1;\n var rt = mLen === 23 ? pow(2, -24) - pow(2, -77) : 0;\n var i = 0;\n var s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;\n var e, m, c;\n value = abs(value);\n // eslint-disable-next-line no-self-compare\n if (value != value || value === Infinity) {\n // eslint-disable-next-line no-self-compare\n m = value != value ? 1 : 0;\n e = eMax;\n } else {\n e = floor(log(value) / LN2);\n if (value * (c = pow(2, -e)) < 1) {\n e--;\n c *= 2;\n }\n if (e + eBias >= 1) {\n value += rt / c;\n } else {\n value += rt * pow(2, 1 - eBias);\n }\n if (value * c >= 2) {\n e++;\n c /= 2;\n }\n if (e + eBias >= eMax) {\n m = 0;\n e = eMax;\n } else if (e + eBias >= 1) {\n m = (value * c - 1) * pow(2, mLen);\n e = e + eBias;\n } else {\n m = value * pow(2, eBias - 1) * pow(2, mLen);\n e = 0;\n }\n }\n for (; mLen >= 8; buffer[i++] = m & 255, m /= 256, mLen -= 8);\n e = e << mLen | m;\n eLen += mLen;\n for (; eLen > 0; buffer[i++] = e & 255, e /= 256, eLen -= 8);\n buffer[--i] |= s * 128;\n return buffer;\n}\nfunction unpackIEEE754(buffer, mLen, nBytes) {\n var eLen = nBytes * 8 - mLen - 1;\n var eMax = (1 << eLen) - 1;\n var eBias = eMax >> 1;\n var nBits = eLen - 7;\n var i = nBytes - 1;\n var s = buffer[i--];\n var e = s & 127;\n var m;\n s >>= 7;\n for (; nBits > 0; e = e * 256 + buffer[i], i--, nBits -= 8);\n m = e & (1 << -nBits) - 1;\n e >>= -nBits;\n nBits += mLen;\n for (; nBits > 0; m = m * 256 + buffer[i], i--, nBits -= 8);\n if (e === 0) {\n e = 1 - eBias;\n } else if (e === eMax) {\n return m ? NaN : s ? -Infinity : Infinity;\n } else {\n m = m + pow(2, mLen);\n e = e - eBias;\n } return (s ? -1 : 1) * m * pow(2, e - mLen);\n}\n\nfunction unpackI32(bytes) {\n return bytes[3] << 24 | bytes[2] << 16 | bytes[1] << 8 | bytes[0];\n}\nfunction packI8(it) {\n return [it & 0xff];\n}\nfunction packI16(it) {\n return [it & 0xff, it >> 8 & 0xff];\n}\nfunction packI32(it) {\n return [it & 0xff, it >> 8 & 0xff, it >> 16 & 0xff, it >> 24 & 0xff];\n}\nfunction packF64(it) {\n return packIEEE754(it, 52, 8);\n}\nfunction packF32(it) {\n return packIEEE754(it, 23, 4);\n}\n\nfunction addGetter(C, key, internal) {\n dP(C[PROTOTYPE], key, { get: function () { return this[internal]; } });\n}\n\nfunction get(view, bytes, index, isLittleEndian) {\n var numIndex = +index;\n var intIndex = toIndex(numIndex);\n if (intIndex + bytes > view[$LENGTH]) throw RangeError(WRONG_INDEX);\n var store = view[$BUFFER]._b;\n var start = intIndex + view[$OFFSET];\n var pack = store.slice(start, start + bytes);\n return isLittleEndian ? pack : pack.reverse();\n}\nfunction set(view, bytes, index, conversion, value, isLittleEndian) {\n var numIndex = +index;\n var intIndex = toIndex(numIndex);\n if (intIndex + bytes > view[$LENGTH]) throw RangeError(WRONG_INDEX);\n var store = view[$BUFFER]._b;\n var start = intIndex + view[$OFFSET];\n var pack = conversion(+value);\n for (var i = 0; i < bytes; i++) store[start + i] = pack[isLittleEndian ? i : bytes - i - 1];\n}\n\nif (!$typed.ABV) {\n $ArrayBuffer = function ArrayBuffer(length) {\n anInstance(this, $ArrayBuffer, ARRAY_BUFFER);\n var byteLength = toIndex(length);\n this._b = arrayFill.call(Array(byteLength), 0);\n this[$LENGTH] = byteLength;\n };\n\n $DataView = function DataView(buffer, byteOffset, byteLength) {\n anInstance(this, $DataView, DATA_VIEW);\n anInstance(buffer, $ArrayBuffer, DATA_VIEW);\n var bufferLength = buffer[$LENGTH];\n var offset = toInteger(byteOffset);\n if (offset < 0 || offset > bufferLength) throw RangeError('Wrong offset!');\n byteLength = byteLength === undefined ? bufferLength - offset : toLength(byteLength);\n if (offset + byteLength > bufferLength) throw RangeError(WRONG_LENGTH);\n this[$BUFFER] = buffer;\n this[$OFFSET] = offset;\n this[$LENGTH] = byteLength;\n };\n\n if (DESCRIPTORS) {\n addGetter($ArrayBuffer, BYTE_LENGTH, '_l');\n addGetter($DataView, BUFFER, '_b');\n addGetter($DataView, BYTE_LENGTH, '_l');\n addGetter($DataView, BYTE_OFFSET, '_o');\n }\n\n redefineAll($DataView[PROTOTYPE], {\n getInt8: function getInt8(byteOffset) {\n return get(this, 1, byteOffset)[0] << 24 >> 24;\n },\n getUint8: function getUint8(byteOffset) {\n return get(this, 1, byteOffset)[0];\n },\n getInt16: function getInt16(byteOffset /* , littleEndian */) {\n var bytes = get(this, 2, byteOffset, arguments[1]);\n return (bytes[1] << 8 | bytes[0]) << 16 >> 16;\n },\n getUint16: function getUint16(byteOffset /* , littleEndian */) {\n var bytes = get(this, 2, byteOffset, arguments[1]);\n return bytes[1] << 8 | bytes[0];\n },\n getInt32: function getInt32(byteOffset /* , littleEndian */) {\n return unpackI32(get(this, 4, byteOffset, arguments[1]));\n },\n getUint32: function getUint32(byteOffset /* , littleEndian */) {\n return unpackI32(get(this, 4, byteOffset, arguments[1])) >>> 0;\n },\n getFloat32: function getFloat32(byteOffset /* , littleEndian */) {\n return unpackIEEE754(get(this, 4, byteOffset, arguments[1]), 23, 4);\n },\n getFloat64: function getFloat64(byteOffset /* , littleEndian */) {\n return unpackIEEE754(get(this, 8, byteOffset, arguments[1]), 52, 8);\n },\n setInt8: function setInt8(byteOffset, value) {\n set(this, 1, byteOffset, packI8, value);\n },\n setUint8: function setUint8(byteOffset, value) {\n set(this, 1, byteOffset, packI8, value);\n },\n setInt16: function setInt16(byteOffset, value /* , littleEndian */) {\n set(this, 2, byteOffset, packI16, value, arguments[2]);\n },\n setUint16: function setUint16(byteOffset, value /* , littleEndian */) {\n set(this, 2, byteOffset, packI16, value, arguments[2]);\n },\n setInt32: function setInt32(byteOffset, value /* , littleEndian */) {\n set(this, 4, byteOffset, packI32, value, arguments[2]);\n },\n setUint32: function setUint32(byteOffset, value /* , littleEndian */) {\n set(this, 4, byteOffset, packI32, value, arguments[2]);\n },\n setFloat32: function setFloat32(byteOffset, value /* , littleEndian */) {\n set(this, 4, byteOffset, packF32, value, arguments[2]);\n },\n setFloat64: function setFloat64(byteOffset, value /* , littleEndian */) {\n set(this, 8, byteOffset, packF64, value, arguments[2]);\n }\n });\n} else {\n if (!fails(function () {\n $ArrayBuffer(1);\n }) || !fails(function () {\n new $ArrayBuffer(-1); // eslint-disable-line no-new\n }) || fails(function () {\n new $ArrayBuffer(); // eslint-disable-line no-new\n new $ArrayBuffer(1.5); // eslint-disable-line no-new\n new $ArrayBuffer(NaN); // eslint-disable-line no-new\n return $ArrayBuffer.name != ARRAY_BUFFER;\n })) {\n $ArrayBuffer = function ArrayBuffer(length) {\n anInstance(this, $ArrayBuffer);\n return new BaseBuffer(toIndex(length));\n };\n var ArrayBufferProto = $ArrayBuffer[PROTOTYPE] = BaseBuffer[PROTOTYPE];\n for (var keys = gOPN(BaseBuffer), j = 0, key; keys.length > j;) {\n if (!((key = keys[j++]) in $ArrayBuffer)) hide($ArrayBuffer, key, BaseBuffer[key]);\n }\n if (!LIBRARY) ArrayBufferProto.constructor = $ArrayBuffer;\n }\n // iOS Safari 7.x bug\n var view = new $DataView(new $ArrayBuffer(2));\n var $setInt8 = $DataView[PROTOTYPE].setInt8;\n view.setInt8(0, 2147483648);\n view.setInt8(1, 2147483649);\n if (view.getInt8(0) || !view.getInt8(1)) redefineAll($DataView[PROTOTYPE], {\n setInt8: function setInt8(byteOffset, value) {\n $setInt8.call(this, byteOffset, value << 24 >> 24);\n },\n setUint8: function setUint8(byteOffset, value) {\n $setInt8.call(this, byteOffset, value << 24 >> 24);\n }\n }, true);\n}\nsetToStringTag($ArrayBuffer, ARRAY_BUFFER);\nsetToStringTag($DataView, DATA_VIEW);\nhide($DataView[PROTOTYPE], $typed.VIEW, true);\nexports[ARRAY_BUFFER] = $ArrayBuffer;\nexports[DATA_VIEW] = $DataView;\n","var global = require('./_global');\nvar hide = require('./_hide');\nvar uid = require('./_uid');\nvar TYPED = uid('typed_array');\nvar VIEW = uid('view');\nvar ABV = !!(global.ArrayBuffer && global.DataView);\nvar CONSTR = ABV;\nvar i = 0;\nvar l = 9;\nvar Typed;\n\nvar TypedArrayConstructors = (\n 'Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array'\n).split(',');\n\nwhile (i < l) {\n if (Typed = global[TypedArrayConstructors[i++]]) {\n hide(Typed.prototype, TYPED, true);\n hide(Typed.prototype, VIEW, true);\n } else CONSTR = false;\n}\n\nmodule.exports = {\n ABV: ABV,\n CONSTR: CONSTR,\n TYPED: TYPED,\n VIEW: VIEW\n};\n","var id = 0;\nvar px = Math.random();\nmodule.exports = function (key) {\n return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));\n};\n","var isObject = require('./_is-object');\nmodule.exports = function (it, TYPE) {\n if (!isObject(it) || it._t !== TYPE) throw TypeError('Incompatible receiver, ' + TYPE + ' required!');\n return it;\n};\n","var global = require('./_global');\nvar core = require('./_core');\nvar LIBRARY = require('./_library');\nvar wksExt = require('./_wks-ext');\nvar defineProperty = require('./_object-dp').f;\nmodule.exports = function (name) {\n var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {});\n if (name.charAt(0) != '_' && !(name in $Symbol)) defineProperty($Symbol, name, { value: wksExt.f(name) });\n};\n","exports.f = require('./_wks');\n","var store = require('./_shared')('wks');\nvar uid = require('./_uid');\nvar Symbol = require('./_global').Symbol;\nvar USE_SYMBOL = typeof Symbol == 'function';\n\nvar $exports = module.exports = function (name) {\n return store[name] || (store[name] =\n USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));\n};\n\n$exports.store = store;\n","var classof = require('./_classof');\nvar ITERATOR = require('./_wks')('iterator');\nvar Iterators = require('./_iterators');\nmodule.exports = require('./_core').getIteratorMethod = function (it) {\n if (it != undefined) return it[ITERATOR]\n || it['@@iterator']\n || Iterators[classof(it)];\n};\n","// https://github.com/benjamingr/RexExp.escape\nvar $export = require('./_export');\nvar $re = require('./_replacer')(/[\\\\^$*+?.()|[\\]{}]/g, '\\\\$&');\n\n$export($export.S, 'RegExp', { escape: function escape(it) { return $re(it); } });\n","// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\nvar $export = require('./_export');\n\n$export($export.P, 'Array', { copyWithin: require('./_array-copy-within') });\n\nrequire('./_add-to-unscopables')('copyWithin');\n","'use strict';\nvar $export = require('./_export');\nvar $every = require('./_array-methods')(4);\n\n$export($export.P + $export.F * !require('./_strict-method')([].every, true), 'Array', {\n // 22.1.3.5 / 15.4.4.16 Array.prototype.every(callbackfn [, thisArg])\n every: function every(callbackfn /* , thisArg */) {\n return $every(this, callbackfn, arguments[1]);\n }\n});\n","// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\nvar $export = require('./_export');\n\n$export($export.P, 'Array', { fill: require('./_array-fill') });\n\nrequire('./_add-to-unscopables')('fill');\n","'use strict';\nvar $export = require('./_export');\nvar $filter = require('./_array-methods')(2);\n\n$export($export.P + $export.F * !require('./_strict-method')([].filter, true), 'Array', {\n // 22.1.3.7 / 15.4.4.20 Array.prototype.filter(callbackfn [, thisArg])\n filter: function filter(callbackfn /* , thisArg */) {\n return $filter(this, callbackfn, arguments[1]);\n }\n});\n","'use strict';\n// 22.1.3.9 Array.prototype.findIndex(predicate, thisArg = undefined)\nvar $export = require('./_export');\nvar $find = require('./_array-methods')(6);\nvar KEY = 'findIndex';\nvar forced = true;\n// Shouldn't skip holes\nif (KEY in []) Array(1)[KEY](function () { forced = false; });\n$export($export.P + $export.F * forced, 'Array', {\n findIndex: function findIndex(callbackfn /* , that = undefined */) {\n return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\nrequire('./_add-to-unscopables')(KEY);\n","'use strict';\n// 22.1.3.8 Array.prototype.find(predicate, thisArg = undefined)\nvar $export = require('./_export');\nvar $find = require('./_array-methods')(5);\nvar KEY = 'find';\nvar forced = true;\n// Shouldn't skip holes\nif (KEY in []) Array(1)[KEY](function () { forced = false; });\n$export($export.P + $export.F * forced, 'Array', {\n find: function find(callbackfn /* , that = undefined */) {\n return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\nrequire('./_add-to-unscopables')(KEY);\n","'use strict';\nvar $export = require('./_export');\nvar $forEach = require('./_array-methods')(0);\nvar STRICT = require('./_strict-method')([].forEach, true);\n\n$export($export.P + $export.F * !STRICT, 'Array', {\n // 22.1.3.10 / 15.4.4.18 Array.prototype.forEach(callbackfn [, thisArg])\n forEach: function forEach(callbackfn /* , thisArg */) {\n return $forEach(this, callbackfn, arguments[1]);\n }\n});\n","'use strict';\nvar ctx = require('./_ctx');\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar call = require('./_iter-call');\nvar isArrayIter = require('./_is-array-iter');\nvar toLength = require('./_to-length');\nvar createProperty = require('./_create-property');\nvar getIterFn = require('./core.get-iterator-method');\n\n$export($export.S + $export.F * !require('./_iter-detect')(function (iter) { Array.from(iter); }), 'Array', {\n // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)\n from: function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\n var O = toObject(arrayLike);\n var C = typeof this == 'function' ? this : Array;\n var aLen = arguments.length;\n var mapfn = aLen > 1 ? arguments[1] : undefined;\n var mapping = mapfn !== undefined;\n var index = 0;\n var iterFn = getIterFn(O);\n var length, result, step, iterator;\n if (mapping) mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2);\n // if object isn't iterable or it's array with default iterator - use simple case\n if (iterFn != undefined && !(C == Array && isArrayIter(iterFn))) {\n for (iterator = iterFn.call(O), result = new C(); !(step = iterator.next()).done; index++) {\n createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value);\n }\n } else {\n length = toLength(O.length);\n for (result = new C(length); length > index; index++) {\n createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]);\n }\n }\n result.length = index;\n return result;\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar $indexOf = require('./_array-includes')(false);\nvar $native = [].indexOf;\nvar NEGATIVE_ZERO = !!$native && 1 / [1].indexOf(1, -0) < 0;\n\n$export($export.P + $export.F * (NEGATIVE_ZERO || !require('./_strict-method')($native)), 'Array', {\n // 22.1.3.11 / 15.4.4.14 Array.prototype.indexOf(searchElement [, fromIndex])\n indexOf: function indexOf(searchElement /* , fromIndex = 0 */) {\n return NEGATIVE_ZERO\n // convert -0 to +0\n ? $native.apply(this, arguments) || 0\n : $indexOf(this, searchElement, arguments[1]);\n }\n});\n","// 22.1.2.2 / 15.4.3.2 Array.isArray(arg)\nvar $export = require('./_export');\n\n$export($export.S, 'Array', { isArray: require('./_is-array') });\n","'use strict';\nvar addToUnscopables = require('./_add-to-unscopables');\nvar step = require('./_iter-step');\nvar Iterators = require('./_iterators');\nvar toIObject = require('./_to-iobject');\n\n// 22.1.3.4 Array.prototype.entries()\n// 22.1.3.13 Array.prototype.keys()\n// 22.1.3.29 Array.prototype.values()\n// 22.1.3.30 Array.prototype[@@iterator]()\nmodule.exports = require('./_iter-define')(Array, 'Array', function (iterated, kind) {\n this._t = toIObject(iterated); // target\n this._i = 0; // next index\n this._k = kind; // kind\n// 22.1.5.2.1 %ArrayIteratorPrototype%.next()\n}, function () {\n var O = this._t;\n var kind = this._k;\n var index = this._i++;\n if (!O || index >= O.length) {\n this._t = undefined;\n return step(1);\n }\n if (kind == 'keys') return step(0, index);\n if (kind == 'values') return step(0, O[index]);\n return step(0, [index, O[index]]);\n}, 'values');\n\n// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)\nIterators.Arguments = Iterators.Array;\n\naddToUnscopables('keys');\naddToUnscopables('values');\naddToUnscopables('entries');\n","'use strict';\n// 22.1.3.13 Array.prototype.join(separator)\nvar $export = require('./_export');\nvar toIObject = require('./_to-iobject');\nvar arrayJoin = [].join;\n\n// fallback for not array-like strings\n$export($export.P + $export.F * (require('./_iobject') != Object || !require('./_strict-method')(arrayJoin)), 'Array', {\n join: function join(separator) {\n return arrayJoin.call(toIObject(this), separator === undefined ? ',' : separator);\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar toIObject = require('./_to-iobject');\nvar toInteger = require('./_to-integer');\nvar toLength = require('./_to-length');\nvar $native = [].lastIndexOf;\nvar NEGATIVE_ZERO = !!$native && 1 / [1].lastIndexOf(1, -0) < 0;\n\n$export($export.P + $export.F * (NEGATIVE_ZERO || !require('./_strict-method')($native)), 'Array', {\n // 22.1.3.14 / 15.4.4.15 Array.prototype.lastIndexOf(searchElement [, fromIndex])\n lastIndexOf: function lastIndexOf(searchElement /* , fromIndex = @[*-1] */) {\n // convert -0 to +0\n if (NEGATIVE_ZERO) return $native.apply(this, arguments) || 0;\n var O = toIObject(this);\n var length = toLength(O.length);\n var index = length - 1;\n if (arguments.length > 1) index = Math.min(index, toInteger(arguments[1]));\n if (index < 0) index = length + index;\n for (;index >= 0; index--) if (index in O) if (O[index] === searchElement) return index || 0;\n return -1;\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar $map = require('./_array-methods')(1);\n\n$export($export.P + $export.F * !require('./_strict-method')([].map, true), 'Array', {\n // 22.1.3.15 / 15.4.4.19 Array.prototype.map(callbackfn [, thisArg])\n map: function map(callbackfn /* , thisArg */) {\n return $map(this, callbackfn, arguments[1]);\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar createProperty = require('./_create-property');\n\n// WebKit Array.of isn't generic\n$export($export.S + $export.F * require('./_fails')(function () {\n function F() { /* empty */ }\n return !(Array.of.call(F) instanceof F);\n}), 'Array', {\n // 22.1.2.3 Array.of( ...items)\n of: function of(/* ...args */) {\n var index = 0;\n var aLen = arguments.length;\n var result = new (typeof this == 'function' ? this : Array)(aLen);\n while (aLen > index) createProperty(result, index, arguments[index++]);\n result.length = aLen;\n return result;\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar $reduce = require('./_array-reduce');\n\n$export($export.P + $export.F * !require('./_strict-method')([].reduceRight, true), 'Array', {\n // 22.1.3.19 / 15.4.4.22 Array.prototype.reduceRight(callbackfn [, initialValue])\n reduceRight: function reduceRight(callbackfn /* , initialValue */) {\n return $reduce(this, callbackfn, arguments.length, arguments[1], true);\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar $reduce = require('./_array-reduce');\n\n$export($export.P + $export.F * !require('./_strict-method')([].reduce, true), 'Array', {\n // 22.1.3.18 / 15.4.4.21 Array.prototype.reduce(callbackfn [, initialValue])\n reduce: function reduce(callbackfn /* , initialValue */) {\n return $reduce(this, callbackfn, arguments.length, arguments[1], false);\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar html = require('./_html');\nvar cof = require('./_cof');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\nvar arraySlice = [].slice;\n\n// fallback for not array-like ES3 strings and DOM objects\n$export($export.P + $export.F * require('./_fails')(function () {\n if (html) arraySlice.call(html);\n}), 'Array', {\n slice: function slice(begin, end) {\n var len = toLength(this.length);\n var klass = cof(this);\n end = end === undefined ? len : end;\n if (klass == 'Array') return arraySlice.call(this, begin, end);\n var start = toAbsoluteIndex(begin, len);\n var upTo = toAbsoluteIndex(end, len);\n var size = toLength(upTo - start);\n var cloned = Array(size);\n var i = 0;\n for (; i < size; i++) cloned[i] = klass == 'String'\n ? this.charAt(start + i)\n : this[start + i];\n return cloned;\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar $some = require('./_array-methods')(3);\n\n$export($export.P + $export.F * !require('./_strict-method')([].some, true), 'Array', {\n // 22.1.3.23 / 15.4.4.17 Array.prototype.some(callbackfn [, thisArg])\n some: function some(callbackfn /* , thisArg */) {\n return $some(this, callbackfn, arguments[1]);\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar aFunction = require('./_a-function');\nvar toObject = require('./_to-object');\nvar fails = require('./_fails');\nvar $sort = [].sort;\nvar test = [1, 2, 3];\n\n$export($export.P + $export.F * (fails(function () {\n // IE8-\n test.sort(undefined);\n}) || !fails(function () {\n // V8 bug\n test.sort(null);\n // Old WebKit\n}) || !require('./_strict-method')($sort)), 'Array', {\n // 22.1.3.25 Array.prototype.sort(comparefn)\n sort: function sort(comparefn) {\n return comparefn === undefined\n ? $sort.call(toObject(this))\n : $sort.call(toObject(this), aFunction(comparefn));\n }\n});\n","require('./_set-species')('Array');\n","// 20.3.3.1 / 15.9.4.4 Date.now()\nvar $export = require('./_export');\n\n$export($export.S, 'Date', { now: function () { return new Date().getTime(); } });\n","// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()\nvar $export = require('./_export');\nvar toISOString = require('./_date-to-iso-string');\n\n// PhantomJS / old WebKit has a broken implementations\n$export($export.P + $export.F * (Date.prototype.toISOString !== toISOString), 'Date', {\n toISOString: toISOString\n});\n","'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar toPrimitive = require('./_to-primitive');\n\n$export($export.P + $export.F * require('./_fails')(function () {\n return new Date(NaN).toJSON() !== null\n || Date.prototype.toJSON.call({ toISOString: function () { return 1; } }) !== 1;\n}), 'Date', {\n // eslint-disable-next-line no-unused-vars\n toJSON: function toJSON(key) {\n var O = toObject(this);\n var pv = toPrimitive(O);\n return typeof pv == 'number' && !isFinite(pv) ? null : O.toISOString();\n }\n});\n","var TO_PRIMITIVE = require('./_wks')('toPrimitive');\nvar proto = Date.prototype;\n\nif (!(TO_PRIMITIVE in proto)) require('./_hide')(proto, TO_PRIMITIVE, require('./_date-to-primitive'));\n","var DateProto = Date.prototype;\nvar INVALID_DATE = 'Invalid Date';\nvar TO_STRING = 'toString';\nvar $toString = DateProto[TO_STRING];\nvar getTime = DateProto.getTime;\nif (new Date(NaN) + '' != INVALID_DATE) {\n require('./_redefine')(DateProto, TO_STRING, function toString() {\n var value = getTime.call(this);\n // eslint-disable-next-line no-self-compare\n return value === value ? $toString.call(this) : INVALID_DATE;\n });\n}\n","// 19.2.3.2 / 15.3.4.5 Function.prototype.bind(thisArg, args...)\nvar $export = require('./_export');\n\n$export($export.P, 'Function', { bind: require('./_bind') });\n","'use strict';\nvar isObject = require('./_is-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar HAS_INSTANCE = require('./_wks')('hasInstance');\nvar FunctionProto = Function.prototype;\n// 19.2.3.6 Function.prototype[@@hasInstance](V)\nif (!(HAS_INSTANCE in FunctionProto)) require('./_object-dp').f(FunctionProto, HAS_INSTANCE, { value: function (O) {\n if (typeof this != 'function' || !isObject(O)) return false;\n if (!isObject(this.prototype)) return O instanceof this;\n // for environment w/o native `@@hasInstance` logic enough `instanceof`, but add this:\n while (O = getPrototypeOf(O)) if (this.prototype === O) return true;\n return false;\n} });\n","var dP = require('./_object-dp').f;\nvar FProto = Function.prototype;\nvar nameRE = /^\\s*function ([^ (]*)/;\nvar NAME = 'name';\n\n// 19.2.4.2 name\nNAME in FProto || require('./_descriptors') && dP(FProto, NAME, {\n configurable: true,\n get: function () {\n try {\n return ('' + this).match(nameRE)[1];\n } catch (e) {\n return '';\n }\n }\n});\n","'use strict';\nvar strong = require('./_collection-strong');\nvar validate = require('./_validate-collection');\nvar MAP = 'Map';\n\n// 23.1 Map Objects\nmodule.exports = require('./_collection')(MAP, function (get) {\n return function Map() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\n}, {\n // 23.1.3.6 Map.prototype.get(key)\n get: function get(key) {\n var entry = strong.getEntry(validate(this, MAP), key);\n return entry && entry.v;\n },\n // 23.1.3.9 Map.prototype.set(key, value)\n set: function set(key, value) {\n return strong.def(validate(this, MAP), key === 0 ? 0 : key, value);\n }\n}, strong, true);\n","// 20.2.2.3 Math.acosh(x)\nvar $export = require('./_export');\nvar log1p = require('./_math-log1p');\nvar sqrt = Math.sqrt;\nvar $acosh = Math.acosh;\n\n$export($export.S + $export.F * !($acosh\n // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509\n && Math.floor($acosh(Number.MAX_VALUE)) == 710\n // Tor Browser bug: Math.acosh(Infinity) -> NaN\n && $acosh(Infinity) == Infinity\n), 'Math', {\n acosh: function acosh(x) {\n return (x = +x) < 1 ? NaN : x > 94906265.62425156\n ? Math.log(x) + Math.LN2\n : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1));\n }\n});\n","// 20.2.2.5 Math.asinh(x)\nvar $export = require('./_export');\nvar $asinh = Math.asinh;\n\nfunction asinh(x) {\n return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : Math.log(x + Math.sqrt(x * x + 1));\n}\n\n// Tor Browser bug: Math.asinh(0) -> -0\n$export($export.S + $export.F * !($asinh && 1 / $asinh(0) > 0), 'Math', { asinh: asinh });\n","// 20.2.2.7 Math.atanh(x)\nvar $export = require('./_export');\nvar $atanh = Math.atanh;\n\n// Tor Browser bug: Math.atanh(-0) -> 0\n$export($export.S + $export.F * !($atanh && 1 / $atanh(-0) < 0), 'Math', {\n atanh: function atanh(x) {\n return (x = +x) == 0 ? x : Math.log((1 + x) / (1 - x)) / 2;\n }\n});\n","// 20.2.2.9 Math.cbrt(x)\nvar $export = require('./_export');\nvar sign = require('./_math-sign');\n\n$export($export.S, 'Math', {\n cbrt: function cbrt(x) {\n return sign(x = +x) * Math.pow(Math.abs(x), 1 / 3);\n }\n});\n","// 20.2.2.11 Math.clz32(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n clz32: function clz32(x) {\n return (x >>>= 0) ? 31 - Math.floor(Math.log(x + 0.5) * Math.LOG2E) : 32;\n }\n});\n","// 20.2.2.12 Math.cosh(x)\nvar $export = require('./_export');\nvar exp = Math.exp;\n\n$export($export.S, 'Math', {\n cosh: function cosh(x) {\n return (exp(x = +x) + exp(-x)) / 2;\n }\n});\n","// 20.2.2.14 Math.expm1(x)\nvar $export = require('./_export');\nvar $expm1 = require('./_math-expm1');\n\n$export($export.S + $export.F * ($expm1 != Math.expm1), 'Math', { expm1: $expm1 });\n","// 20.2.2.16 Math.fround(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { fround: require('./_math-fround') });\n","// 20.2.2.17 Math.hypot([value1[, value2[, … ]]])\nvar $export = require('./_export');\nvar abs = Math.abs;\n\n$export($export.S, 'Math', {\n hypot: function hypot(value1, value2) { // eslint-disable-line no-unused-vars\n var sum = 0;\n var i = 0;\n var aLen = arguments.length;\n var larg = 0;\n var arg, div;\n while (i < aLen) {\n arg = abs(arguments[i++]);\n if (larg < arg) {\n div = larg / arg;\n sum = sum * div * div + 1;\n larg = arg;\n } else if (arg > 0) {\n div = arg / larg;\n sum += div * div;\n } else sum += arg;\n }\n return larg === Infinity ? Infinity : larg * Math.sqrt(sum);\n }\n});\n","// 20.2.2.18 Math.imul(x, y)\nvar $export = require('./_export');\nvar $imul = Math.imul;\n\n// some WebKit versions fails with big numbers, some has wrong arity\n$export($export.S + $export.F * require('./_fails')(function () {\n return $imul(0xffffffff, 5) != -5 || $imul.length != 2;\n}), 'Math', {\n imul: function imul(x, y) {\n var UINT16 = 0xffff;\n var xn = +x;\n var yn = +y;\n var xl = UINT16 & xn;\n var yl = UINT16 & yn;\n return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0);\n }\n});\n","// 20.2.2.21 Math.log10(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n log10: function log10(x) {\n return Math.log(x) * Math.LOG10E;\n }\n});\n","// 20.2.2.20 Math.log1p(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { log1p: require('./_math-log1p') });\n","// 20.2.2.22 Math.log2(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n log2: function log2(x) {\n return Math.log(x) / Math.LN2;\n }\n});\n","// 20.2.2.28 Math.sign(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { sign: require('./_math-sign') });\n","// 20.2.2.30 Math.sinh(x)\nvar $export = require('./_export');\nvar expm1 = require('./_math-expm1');\nvar exp = Math.exp;\n\n// V8 near Chromium 38 has a problem with very small numbers\n$export($export.S + $export.F * require('./_fails')(function () {\n return !Math.sinh(-2e-17) != -2e-17;\n}), 'Math', {\n sinh: function sinh(x) {\n return Math.abs(x = +x) < 1\n ? (expm1(x) - expm1(-x)) / 2\n : (exp(x - 1) - exp(-x - 1)) * (Math.E / 2);\n }\n});\n","// 20.2.2.33 Math.tanh(x)\nvar $export = require('./_export');\nvar expm1 = require('./_math-expm1');\nvar exp = Math.exp;\n\n$export($export.S, 'Math', {\n tanh: function tanh(x) {\n var a = expm1(x = +x);\n var b = expm1(-x);\n return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x));\n }\n});\n","// 20.2.2.34 Math.trunc(x)\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n trunc: function trunc(it) {\n return (it > 0 ? Math.floor : Math.ceil)(it);\n }\n});\n","'use strict';\nvar global = require('./_global');\nvar has = require('./_has');\nvar cof = require('./_cof');\nvar inheritIfRequired = require('./_inherit-if-required');\nvar toPrimitive = require('./_to-primitive');\nvar fails = require('./_fails');\nvar gOPN = require('./_object-gopn').f;\nvar gOPD = require('./_object-gopd').f;\nvar dP = require('./_object-dp').f;\nvar $trim = require('./_string-trim').trim;\nvar NUMBER = 'Number';\nvar $Number = global[NUMBER];\nvar Base = $Number;\nvar proto = $Number.prototype;\n// Opera ~12 has broken Object#toString\nvar BROKEN_COF = cof(require('./_object-create')(proto)) == NUMBER;\nvar TRIM = 'trim' in String.prototype;\n\n// 7.1.3 ToNumber(argument)\nvar toNumber = function (argument) {\n var it = toPrimitive(argument, false);\n if (typeof it == 'string' && it.length > 2) {\n it = TRIM ? it.trim() : $trim(it, 3);\n var first = it.charCodeAt(0);\n var third, radix, maxCode;\n if (first === 43 || first === 45) {\n third = it.charCodeAt(2);\n if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\n } else if (first === 48) {\n switch (it.charCodeAt(1)) {\n case 66: case 98: radix = 2; maxCode = 49; break; // fast equal /^0b[01]+$/i\n case 79: case 111: radix = 8; maxCode = 55; break; // fast equal /^0o[0-7]+$/i\n default: return +it;\n }\n for (var digits = it.slice(2), i = 0, l = digits.length, code; i < l; i++) {\n code = digits.charCodeAt(i);\n // parseInt parses a string to a first unavailable symbol\n // but ToNumber should return NaN if a string contains unavailable symbols\n if (code < 48 || code > maxCode) return NaN;\n } return parseInt(digits, radix);\n }\n } return +it;\n};\n\nif (!$Number(' 0o1') || !$Number('0b1') || $Number('+0x1')) {\n $Number = function Number(value) {\n var it = arguments.length < 1 ? 0 : value;\n var that = this;\n return that instanceof $Number\n // check on 1..constructor(foo) case\n && (BROKEN_COF ? fails(function () { proto.valueOf.call(that); }) : cof(that) != NUMBER)\n ? inheritIfRequired(new Base(toNumber(it)), that, $Number) : toNumber(it);\n };\n for (var keys = require('./_descriptors') ? gOPN(Base) : (\n // ES3:\n 'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\n // ES6 (in case, if modules with ES6 Number statics required before):\n 'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' +\n 'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger'\n ).split(','), j = 0, key; keys.length > j; j++) {\n if (has(Base, key = keys[j]) && !has($Number, key)) {\n dP($Number, key, gOPD(Base, key));\n }\n }\n $Number.prototype = proto;\n proto.constructor = $Number;\n require('./_redefine')(global, NUMBER, $Number);\n}\n","// 20.1.2.1 Number.EPSILON\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { EPSILON: Math.pow(2, -52) });\n","// 20.1.2.2 Number.isFinite(number)\nvar $export = require('./_export');\nvar _isFinite = require('./_global').isFinite;\n\n$export($export.S, 'Number', {\n isFinite: function isFinite(it) {\n return typeof it == 'number' && _isFinite(it);\n }\n});\n","// 20.1.2.3 Number.isInteger(number)\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { isInteger: require('./_is-integer') });\n","// 20.1.2.4 Number.isNaN(number)\nvar $export = require('./_export');\n\n$export($export.S, 'Number', {\n isNaN: function isNaN(number) {\n // eslint-disable-next-line no-self-compare\n return number != number;\n }\n});\n","// 20.1.2.5 Number.isSafeInteger(number)\nvar $export = require('./_export');\nvar isInteger = require('./_is-integer');\nvar abs = Math.abs;\n\n$export($export.S, 'Number', {\n isSafeInteger: function isSafeInteger(number) {\n return isInteger(number) && abs(number) <= 0x1fffffffffffff;\n }\n});\n","// 20.1.2.6 Number.MAX_SAFE_INTEGER\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { MAX_SAFE_INTEGER: 0x1fffffffffffff });\n","// 20.1.2.10 Number.MIN_SAFE_INTEGER\nvar $export = require('./_export');\n\n$export($export.S, 'Number', { MIN_SAFE_INTEGER: -0x1fffffffffffff });\n","var $export = require('./_export');\nvar $parseFloat = require('./_parse-float');\n// 20.1.2.12 Number.parseFloat(string)\n$export($export.S + $export.F * (Number.parseFloat != $parseFloat), 'Number', { parseFloat: $parseFloat });\n","var $export = require('./_export');\nvar $parseInt = require('./_parse-int');\n// 20.1.2.13 Number.parseInt(string, radix)\n$export($export.S + $export.F * (Number.parseInt != $parseInt), 'Number', { parseInt: $parseInt });\n","'use strict';\nvar $export = require('./_export');\nvar toInteger = require('./_to-integer');\nvar aNumberValue = require('./_a-number-value');\nvar repeat = require('./_string-repeat');\nvar $toFixed = 1.0.toFixed;\nvar floor = Math.floor;\nvar data = [0, 0, 0, 0, 0, 0];\nvar ERROR = 'Number.toFixed: incorrect invocation!';\nvar ZERO = '0';\n\nvar multiply = function (n, c) {\n var i = -1;\n var c2 = c;\n while (++i < 6) {\n c2 += n * data[i];\n data[i] = c2 % 1e7;\n c2 = floor(c2 / 1e7);\n }\n};\nvar divide = function (n) {\n var i = 6;\n var c = 0;\n while (--i >= 0) {\n c += data[i];\n data[i] = floor(c / n);\n c = (c % n) * 1e7;\n }\n};\nvar numToString = function () {\n var i = 6;\n var s = '';\n while (--i >= 0) {\n if (s !== '' || i === 0 || data[i] !== 0) {\n var t = String(data[i]);\n s = s === '' ? t : s + repeat.call(ZERO, 7 - t.length) + t;\n }\n } return s;\n};\nvar pow = function (x, n, acc) {\n return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);\n};\nvar log = function (x) {\n var n = 0;\n var x2 = x;\n while (x2 >= 4096) {\n n += 12;\n x2 /= 4096;\n }\n while (x2 >= 2) {\n n += 1;\n x2 /= 2;\n } return n;\n};\n\n$export($export.P + $export.F * (!!$toFixed && (\n 0.00008.toFixed(3) !== '0.000' ||\n 0.9.toFixed(0) !== '1' ||\n 1.255.toFixed(2) !== '1.25' ||\n 1000000000000000128.0.toFixed(0) !== '1000000000000000128'\n) || !require('./_fails')(function () {\n // V8 ~ Android 4.3-\n $toFixed.call({});\n})), 'Number', {\n toFixed: function toFixed(fractionDigits) {\n var x = aNumberValue(this, ERROR);\n var f = toInteger(fractionDigits);\n var s = '';\n var m = ZERO;\n var e, z, j, k;\n if (f < 0 || f > 20) throw RangeError(ERROR);\n // eslint-disable-next-line no-self-compare\n if (x != x) return 'NaN';\n if (x <= -1e21 || x >= 1e21) return String(x);\n if (x < 0) {\n s = '-';\n x = -x;\n }\n if (x > 1e-21) {\n e = log(x * pow(2, 69, 1)) - 69;\n z = e < 0 ? x * pow(2, -e, 1) : x / pow(2, e, 1);\n z *= 0x10000000000000;\n e = 52 - e;\n if (e > 0) {\n multiply(0, z);\n j = f;\n while (j >= 7) {\n multiply(1e7, 0);\n j -= 7;\n }\n multiply(pow(10, j, 1), 0);\n j = e - 1;\n while (j >= 23) {\n divide(1 << 23);\n j -= 23;\n }\n divide(1 << j);\n multiply(1, 1);\n divide(2);\n m = numToString();\n } else {\n multiply(0, z);\n multiply(1 << -e, 0);\n m = numToString() + repeat.call(ZERO, f);\n }\n }\n if (f > 0) {\n k = m.length;\n m = s + (k <= f ? '0.' + repeat.call(ZERO, f - k) + m : m.slice(0, k - f) + '.' + m.slice(k - f));\n } else {\n m = s + m;\n } return m;\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar $fails = require('./_fails');\nvar aNumberValue = require('./_a-number-value');\nvar $toPrecision = 1.0.toPrecision;\n\n$export($export.P + $export.F * ($fails(function () {\n // IE7-\n return $toPrecision.call(1, undefined) !== '1';\n}) || !$fails(function () {\n // V8 ~ Android 4.3-\n $toPrecision.call({});\n})), 'Number', {\n toPrecision: function toPrecision(precision) {\n var that = aNumberValue(this, 'Number#toPrecision: incorrect invocation!');\n return precision === undefined ? $toPrecision.call(that) : $toPrecision.call(that, precision);\n }\n});\n","// 19.1.3.1 Object.assign(target, source)\nvar $export = require('./_export');\n\n$export($export.S + $export.F, 'Object', { assign: require('./_object-assign') });\n","var $export = require('./_export');\n// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\n$export($export.S, 'Object', { create: require('./_object-create') });\n","var $export = require('./_export');\n// 19.1.2.3 / 15.2.3.7 Object.defineProperties(O, Properties)\n$export($export.S + $export.F * !require('./_descriptors'), 'Object', { defineProperties: require('./_object-dps') });\n","var $export = require('./_export');\n// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)\n$export($export.S + $export.F * !require('./_descriptors'), 'Object', { defineProperty: require('./_object-dp').f });\n","// 19.1.2.5 Object.freeze(O)\nvar isObject = require('./_is-object');\nvar meta = require('./_meta').onFreeze;\n\nrequire('./_object-sap')('freeze', function ($freeze) {\n return function freeze(it) {\n return $freeze && isObject(it) ? $freeze(meta(it)) : it;\n };\n});\n","// 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\nvar toIObject = require('./_to-iobject');\nvar $getOwnPropertyDescriptor = require('./_object-gopd').f;\n\nrequire('./_object-sap')('getOwnPropertyDescriptor', function () {\n return function getOwnPropertyDescriptor(it, key) {\n return $getOwnPropertyDescriptor(toIObject(it), key);\n };\n});\n","// 19.1.2.7 Object.getOwnPropertyNames(O)\nrequire('./_object-sap')('getOwnPropertyNames', function () {\n return require('./_object-gopn-ext').f;\n});\n","// 19.1.2.9 Object.getPrototypeOf(O)\nvar toObject = require('./_to-object');\nvar $getPrototypeOf = require('./_object-gpo');\n\nrequire('./_object-sap')('getPrototypeOf', function () {\n return function getPrototypeOf(it) {\n return $getPrototypeOf(toObject(it));\n };\n});\n","// 19.1.2.11 Object.isExtensible(O)\nvar isObject = require('./_is-object');\n\nrequire('./_object-sap')('isExtensible', function ($isExtensible) {\n return function isExtensible(it) {\n return isObject(it) ? $isExtensible ? $isExtensible(it) : true : false;\n };\n});\n","// 19.1.2.12 Object.isFrozen(O)\nvar isObject = require('./_is-object');\n\nrequire('./_object-sap')('isFrozen', function ($isFrozen) {\n return function isFrozen(it) {\n return isObject(it) ? $isFrozen ? $isFrozen(it) : false : true;\n };\n});\n","// 19.1.2.13 Object.isSealed(O)\nvar isObject = require('./_is-object');\n\nrequire('./_object-sap')('isSealed', function ($isSealed) {\n return function isSealed(it) {\n return isObject(it) ? $isSealed ? $isSealed(it) : false : true;\n };\n});\n","// 19.1.3.10 Object.is(value1, value2)\nvar $export = require('./_export');\n$export($export.S, 'Object', { is: require('./_same-value') });\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","// 19.1.2.15 Object.preventExtensions(O)\nvar isObject = require('./_is-object');\nvar meta = require('./_meta').onFreeze;\n\nrequire('./_object-sap')('preventExtensions', function ($preventExtensions) {\n return function preventExtensions(it) {\n return $preventExtensions && isObject(it) ? $preventExtensions(meta(it)) : it;\n };\n});\n","// 19.1.2.17 Object.seal(O)\nvar isObject = require('./_is-object');\nvar meta = require('./_meta').onFreeze;\n\nrequire('./_object-sap')('seal', function ($seal) {\n return function seal(it) {\n return $seal && isObject(it) ? $seal(meta(it)) : it;\n };\n});\n","// 19.1.3.19 Object.setPrototypeOf(O, proto)\nvar $export = require('./_export');\n$export($export.S, 'Object', { setPrototypeOf: require('./_set-proto').set });\n","'use strict';\n// 19.1.3.6 Object.prototype.toString()\nvar classof = require('./_classof');\nvar test = {};\ntest[require('./_wks')('toStringTag')] = 'z';\nif (test + '' != '[object z]') {\n require('./_redefine')(Object.prototype, 'toString', function toString() {\n return '[object ' + classof(this) + ']';\n }, true);\n}\n","var $export = require('./_export');\nvar $parseFloat = require('./_parse-float');\n// 18.2.4 parseFloat(string)\n$export($export.G + $export.F * (parseFloat != $parseFloat), { parseFloat: $parseFloat });\n","var $export = require('./_export');\nvar $parseInt = require('./_parse-int');\n// 18.2.5 parseInt(string, radix)\n$export($export.G + $export.F * (parseInt != $parseInt), { parseInt: $parseInt });\n","'use strict';\nvar LIBRARY = require('./_library');\nvar global = require('./_global');\nvar ctx = require('./_ctx');\nvar classof = require('./_classof');\nvar $export = require('./_export');\nvar isObject = require('./_is-object');\nvar aFunction = require('./_a-function');\nvar anInstance = require('./_an-instance');\nvar forOf = require('./_for-of');\nvar speciesConstructor = require('./_species-constructor');\nvar task = require('./_task').set;\nvar microtask = require('./_microtask')();\nvar newPromiseCapabilityModule = require('./_new-promise-capability');\nvar perform = require('./_perform');\nvar promiseResolve = require('./_promise-resolve');\nvar PROMISE = 'Promise';\nvar TypeError = global.TypeError;\nvar process = global.process;\nvar $Promise = global[PROMISE];\nvar isNode = classof(process) == 'process';\nvar empty = function () { /* empty */ };\nvar Internal, newGenericPromiseCapability, OwnPromiseCapability, Wrapper;\nvar newPromiseCapability = newGenericPromiseCapability = newPromiseCapabilityModule.f;\n\nvar USE_NATIVE = !!function () {\n try {\n // correct subclassing with @@species support\n var promise = $Promise.resolve(1);\n var FakePromise = (promise.constructor = {})[require('./_wks')('species')] = function (exec) {\n exec(empty, empty);\n };\n // unhandled rejections tracking support, NodeJS Promise without it fails @@species test\n return (isNode || typeof PromiseRejectionEvent == 'function') && promise.then(empty) instanceof FakePromise;\n } catch (e) { /* empty */ }\n}();\n\n// helpers\nvar isThenable = function (it) {\n var then;\n return isObject(it) && typeof (then = it.then) == 'function' ? then : false;\n};\nvar notify = function (promise, isReject) {\n if (promise._n) return;\n promise._n = true;\n var chain = promise._c;\n microtask(function () {\n var value = promise._v;\n var ok = promise._s == 1;\n var i = 0;\n var run = function (reaction) {\n var handler = ok ? reaction.ok : reaction.fail;\n var resolve = reaction.resolve;\n var reject = reaction.reject;\n var domain = reaction.domain;\n var result, then;\n try {\n if (handler) {\n if (!ok) {\n if (promise._h == 2) onHandleUnhandled(promise);\n promise._h = 1;\n }\n if (handler === true) result = value;\n else {\n if (domain) domain.enter();\n result = handler(value);\n if (domain) domain.exit();\n }\n if (result === reaction.promise) {\n reject(TypeError('Promise-chain cycle'));\n } else if (then = isThenable(result)) {\n then.call(result, resolve, reject);\n } else resolve(result);\n } else reject(value);\n } catch (e) {\n reject(e);\n }\n };\n while (chain.length > i) run(chain[i++]); // variable length - can't use forEach\n promise._c = [];\n promise._n = false;\n if (isReject && !promise._h) onUnhandled(promise);\n });\n};\nvar onUnhandled = function (promise) {\n task.call(global, function () {\n var value = promise._v;\n var unhandled = isUnhandled(promise);\n var result, handler, console;\n if (unhandled) {\n result = perform(function () {\n if (isNode) {\n process.emit('unhandledRejection', value, promise);\n } else if (handler = global.onunhandledrejection) {\n handler({ promise: promise, reason: value });\n } else if ((console = global.console) && console.error) {\n console.error('Unhandled promise rejection', value);\n }\n });\n // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should\n promise._h = isNode || isUnhandled(promise) ? 2 : 1;\n } promise._a = undefined;\n if (unhandled && result.e) throw result.v;\n });\n};\nvar isUnhandled = function (promise) {\n if (promise._h == 1) return false;\n var chain = promise._a || promise._c;\n var i = 0;\n var reaction;\n while (chain.length > i) {\n reaction = chain[i++];\n if (reaction.fail || !isUnhandled(reaction.promise)) return false;\n } return true;\n};\nvar onHandleUnhandled = function (promise) {\n task.call(global, function () {\n var handler;\n if (isNode) {\n process.emit('rejectionHandled', promise);\n } else if (handler = global.onrejectionhandled) {\n handler({ promise: promise, reason: promise._v });\n }\n });\n};\nvar $reject = function (value) {\n var promise = this;\n if (promise._d) return;\n promise._d = true;\n promise = promise._w || promise; // unwrap\n promise._v = value;\n promise._s = 2;\n if (!promise._a) promise._a = promise._c.slice();\n notify(promise, true);\n};\nvar $resolve = function (value) {\n var promise = this;\n var then;\n if (promise._d) return;\n promise._d = true;\n promise = promise._w || promise; // unwrap\n try {\n if (promise === value) throw TypeError(\"Promise can't be resolved itself\");\n if (then = isThenable(value)) {\n microtask(function () {\n var wrapper = { _w: promise, _d: false }; // wrap\n try {\n then.call(value, ctx($resolve, wrapper, 1), ctx($reject, wrapper, 1));\n } catch (e) {\n $reject.call(wrapper, e);\n }\n });\n } else {\n promise._v = value;\n promise._s = 1;\n notify(promise, false);\n }\n } catch (e) {\n $reject.call({ _w: promise, _d: false }, e); // wrap\n }\n};\n\n// constructor polyfill\nif (!USE_NATIVE) {\n // 25.4.3.1 Promise(executor)\n $Promise = function Promise(executor) {\n anInstance(this, $Promise, PROMISE, '_h');\n aFunction(executor);\n Internal.call(this);\n try {\n executor(ctx($resolve, this, 1), ctx($reject, this, 1));\n } catch (err) {\n $reject.call(this, err);\n }\n };\n // eslint-disable-next-line no-unused-vars\n Internal = function Promise(executor) {\n this._c = []; // <- awaiting reactions\n this._a = undefined; // <- checked in isUnhandled reactions\n this._s = 0; // <- state\n this._d = false; // <- done\n this._v = undefined; // <- value\n this._h = 0; // <- rejection state, 0 - default, 1 - handled, 2 - unhandled\n this._n = false; // <- notify\n };\n Internal.prototype = require('./_redefine-all')($Promise.prototype, {\n // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected)\n then: function then(onFulfilled, onRejected) {\n var reaction = newPromiseCapability(speciesConstructor(this, $Promise));\n reaction.ok = typeof onFulfilled == 'function' ? onFulfilled : true;\n reaction.fail = typeof onRejected == 'function' && onRejected;\n reaction.domain = isNode ? process.domain : undefined;\n this._c.push(reaction);\n if (this._a) this._a.push(reaction);\n if (this._s) notify(this, false);\n return reaction.promise;\n },\n // 25.4.5.1 Promise.prototype.catch(onRejected)\n 'catch': function (onRejected) {\n return this.then(undefined, onRejected);\n }\n });\n OwnPromiseCapability = function () {\n var promise = new Internal();\n this.promise = promise;\n this.resolve = ctx($resolve, promise, 1);\n this.reject = ctx($reject, promise, 1);\n };\n newPromiseCapabilityModule.f = newPromiseCapability = function (C) {\n return C === $Promise || C === Wrapper\n ? new OwnPromiseCapability(C)\n : newGenericPromiseCapability(C);\n };\n}\n\n$export($export.G + $export.W + $export.F * !USE_NATIVE, { Promise: $Promise });\nrequire('./_set-to-string-tag')($Promise, PROMISE);\nrequire('./_set-species')(PROMISE);\nWrapper = require('./_core')[PROMISE];\n\n// statics\n$export($export.S + $export.F * !USE_NATIVE, PROMISE, {\n // 25.4.4.5 Promise.reject(r)\n reject: function reject(r) {\n var capability = newPromiseCapability(this);\n var $$reject = capability.reject;\n $$reject(r);\n return capability.promise;\n }\n});\n$export($export.S + $export.F * (LIBRARY || !USE_NATIVE), PROMISE, {\n // 25.4.4.6 Promise.resolve(x)\n resolve: function resolve(x) {\n return promiseResolve(LIBRARY && this === Wrapper ? $Promise : this, x);\n }\n});\n$export($export.S + $export.F * !(USE_NATIVE && require('./_iter-detect')(function (iter) {\n $Promise.all(iter)['catch'](empty);\n})), PROMISE, {\n // 25.4.4.1 Promise.all(iterable)\n all: function all(iterable) {\n var C = this;\n var capability = newPromiseCapability(C);\n var resolve = capability.resolve;\n var reject = capability.reject;\n var result = perform(function () {\n var values = [];\n var index = 0;\n var remaining = 1;\n forOf(iterable, false, function (promise) {\n var $index = index++;\n var alreadyCalled = false;\n values.push(undefined);\n remaining++;\n C.resolve(promise).then(function (value) {\n if (alreadyCalled) return;\n alreadyCalled = true;\n values[$index] = value;\n --remaining || resolve(values);\n }, reject);\n });\n --remaining || resolve(values);\n });\n if (result.e) reject(result.v);\n return capability.promise;\n },\n // 25.4.4.4 Promise.race(iterable)\n race: function race(iterable) {\n var C = this;\n var capability = newPromiseCapability(C);\n var reject = capability.reject;\n var result = perform(function () {\n forOf(iterable, false, function (promise) {\n C.resolve(promise).then(capability.resolve, reject);\n });\n });\n if (result.e) reject(result.v);\n return capability.promise;\n }\n});\n","// 26.1.1 Reflect.apply(target, thisArgument, argumentsList)\nvar $export = require('./_export');\nvar aFunction = require('./_a-function');\nvar anObject = require('./_an-object');\nvar rApply = (require('./_global').Reflect || {}).apply;\nvar fApply = Function.apply;\n// MS Edge argumentsList argument is optional\n$export($export.S + $export.F * !require('./_fails')(function () {\n rApply(function () { /* empty */ });\n}), 'Reflect', {\n apply: function apply(target, thisArgument, argumentsList) {\n var T = aFunction(target);\n var L = anObject(argumentsList);\n return rApply ? rApply(T, thisArgument, L) : fApply.call(T, thisArgument, L);\n }\n});\n","// 26.1.2 Reflect.construct(target, argumentsList [, newTarget])\nvar $export = require('./_export');\nvar create = require('./_object-create');\nvar aFunction = require('./_a-function');\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\nvar fails = require('./_fails');\nvar bind = require('./_bind');\nvar rConstruct = (require('./_global').Reflect || {}).construct;\n\n// MS Edge supports only 2 arguments and argumentsList argument is optional\n// FF Nightly sets third argument as `new.target`, but does not create `this` from it\nvar NEW_TARGET_BUG = fails(function () {\n function F() { /* empty */ }\n return !(rConstruct(function () { /* empty */ }, [], F) instanceof F);\n});\nvar ARGS_BUG = !fails(function () {\n rConstruct(function () { /* empty */ });\n});\n\n$export($export.S + $export.F * (NEW_TARGET_BUG || ARGS_BUG), 'Reflect', {\n construct: function construct(Target, args /* , newTarget */) {\n aFunction(Target);\n anObject(args);\n var newTarget = arguments.length < 3 ? Target : aFunction(arguments[2]);\n if (ARGS_BUG && !NEW_TARGET_BUG) return rConstruct(Target, args, newTarget);\n if (Target == newTarget) {\n // w/o altered newTarget, optimization for 0-4 arguments\n switch (args.length) {\n case 0: return new Target();\n case 1: return new Target(args[0]);\n case 2: return new Target(args[0], args[1]);\n case 3: return new Target(args[0], args[1], args[2]);\n case 4: return new Target(args[0], args[1], args[2], args[3]);\n }\n // w/o altered newTarget, lot of arguments case\n var $args = [null];\n $args.push.apply($args, args);\n return new (bind.apply(Target, $args))();\n }\n // with altered newTarget, not support built-in constructors\n var proto = newTarget.prototype;\n var instance = create(isObject(proto) ? proto : Object.prototype);\n var result = Function.apply.call(Target, instance, args);\n return isObject(result) ? result : instance;\n }\n});\n","// 26.1.3 Reflect.defineProperty(target, propertyKey, attributes)\nvar dP = require('./_object-dp');\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar toPrimitive = require('./_to-primitive');\n\n// MS Edge has broken Reflect.defineProperty - throwing instead of returning false\n$export($export.S + $export.F * require('./_fails')(function () {\n // eslint-disable-next-line no-undef\n Reflect.defineProperty(dP.f({}, 1, { value: 1 }), 1, { value: 2 });\n}), 'Reflect', {\n defineProperty: function defineProperty(target, propertyKey, attributes) {\n anObject(target);\n propertyKey = toPrimitive(propertyKey, true);\n anObject(attributes);\n try {\n dP.f(target, propertyKey, attributes);\n return true;\n } catch (e) {\n return false;\n }\n }\n});\n","// 26.1.4 Reflect.deleteProperty(target, propertyKey)\nvar $export = require('./_export');\nvar gOPD = require('./_object-gopd').f;\nvar anObject = require('./_an-object');\n\n$export($export.S, 'Reflect', {\n deleteProperty: function deleteProperty(target, propertyKey) {\n var desc = gOPD(anObject(target), propertyKey);\n return desc && !desc.configurable ? false : delete target[propertyKey];\n }\n});\n","'use strict';\n// 26.1.5 Reflect.enumerate(target)\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar Enumerate = function (iterated) {\n this._t = anObject(iterated); // target\n this._i = 0; // next index\n var keys = this._k = []; // keys\n var key;\n for (key in iterated) keys.push(key);\n};\nrequire('./_iter-create')(Enumerate, 'Object', function () {\n var that = this;\n var keys = that._k;\n var key;\n do {\n if (that._i >= keys.length) return { value: undefined, done: true };\n } while (!((key = keys[that._i++]) in that._t));\n return { value: key, done: false };\n});\n\n$export($export.S, 'Reflect', {\n enumerate: function enumerate(target) {\n return new Enumerate(target);\n }\n});\n","// 26.1.7 Reflect.getOwnPropertyDescriptor(target, propertyKey)\nvar gOPD = require('./_object-gopd');\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\n\n$export($export.S, 'Reflect', {\n getOwnPropertyDescriptor: function getOwnPropertyDescriptor(target, propertyKey) {\n return gOPD.f(anObject(target), propertyKey);\n }\n});\n","// 26.1.8 Reflect.getPrototypeOf(target)\nvar $export = require('./_export');\nvar getProto = require('./_object-gpo');\nvar anObject = require('./_an-object');\n\n$export($export.S, 'Reflect', {\n getPrototypeOf: function getPrototypeOf(target) {\n return getProto(anObject(target));\n }\n});\n","// 26.1.6 Reflect.get(target, propertyKey [, receiver])\nvar gOPD = require('./_object-gopd');\nvar getPrototypeOf = require('./_object-gpo');\nvar has = require('./_has');\nvar $export = require('./_export');\nvar isObject = require('./_is-object');\nvar anObject = require('./_an-object');\n\nfunction get(target, propertyKey /* , receiver */) {\n var receiver = arguments.length < 3 ? target : arguments[2];\n var desc, proto;\n if (anObject(target) === receiver) return target[propertyKey];\n if (desc = gOPD.f(target, propertyKey)) return has(desc, 'value')\n ? desc.value\n : desc.get !== undefined\n ? desc.get.call(receiver)\n : undefined;\n if (isObject(proto = getPrototypeOf(target))) return get(proto, propertyKey, receiver);\n}\n\n$export($export.S, 'Reflect', { get: get });\n","// 26.1.9 Reflect.has(target, propertyKey)\nvar $export = require('./_export');\n\n$export($export.S, 'Reflect', {\n has: function has(target, propertyKey) {\n return propertyKey in target;\n }\n});\n","// 26.1.10 Reflect.isExtensible(target)\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar $isExtensible = Object.isExtensible;\n\n$export($export.S, 'Reflect', {\n isExtensible: function isExtensible(target) {\n anObject(target);\n return $isExtensible ? $isExtensible(target) : true;\n }\n});\n","// 26.1.11 Reflect.ownKeys(target)\nvar $export = require('./_export');\n\n$export($export.S, 'Reflect', { ownKeys: require('./_own-keys') });\n","// 26.1.12 Reflect.preventExtensions(target)\nvar $export = require('./_export');\nvar anObject = require('./_an-object');\nvar $preventExtensions = Object.preventExtensions;\n\n$export($export.S, 'Reflect', {\n preventExtensions: function preventExtensions(target) {\n anObject(target);\n try {\n if ($preventExtensions) $preventExtensions(target);\n return true;\n } catch (e) {\n return false;\n }\n }\n});\n","// 26.1.14 Reflect.setPrototypeOf(target, proto)\nvar $export = require('./_export');\nvar setProto = require('./_set-proto');\n\nif (setProto) $export($export.S, 'Reflect', {\n setPrototypeOf: function setPrototypeOf(target, proto) {\n setProto.check(target, proto);\n try {\n setProto.set(target, proto);\n return true;\n } catch (e) {\n return false;\n }\n }\n});\n","// 26.1.13 Reflect.set(target, propertyKey, V [, receiver])\nvar dP = require('./_object-dp');\nvar gOPD = require('./_object-gopd');\nvar getPrototypeOf = require('./_object-gpo');\nvar has = require('./_has');\nvar $export = require('./_export');\nvar createDesc = require('./_property-desc');\nvar anObject = require('./_an-object');\nvar isObject = require('./_is-object');\n\nfunction set(target, propertyKey, V /* , receiver */) {\n var receiver = arguments.length < 4 ? target : arguments[3];\n var ownDesc = gOPD.f(anObject(target), propertyKey);\n var existingDescriptor, proto;\n if (!ownDesc) {\n if (isObject(proto = getPrototypeOf(target))) {\n return set(proto, propertyKey, V, receiver);\n }\n ownDesc = createDesc(0);\n }\n if (has(ownDesc, 'value')) {\n if (ownDesc.writable === false || !isObject(receiver)) return false;\n existingDescriptor = gOPD.f(receiver, propertyKey) || createDesc(0);\n existingDescriptor.value = V;\n dP.f(receiver, propertyKey, existingDescriptor);\n return true;\n }\n return ownDesc.set === undefined ? false : (ownDesc.set.call(receiver, V), true);\n}\n\n$export($export.S, 'Reflect', { set: set });\n","var global = require('./_global');\nvar inheritIfRequired = require('./_inherit-if-required');\nvar dP = require('./_object-dp').f;\nvar gOPN = require('./_object-gopn').f;\nvar isRegExp = require('./_is-regexp');\nvar $flags = require('./_flags');\nvar $RegExp = global.RegExp;\nvar Base = $RegExp;\nvar proto = $RegExp.prototype;\nvar re1 = /a/g;\nvar re2 = /a/g;\n// \"new\" creates a new object, old webkit buggy here\nvar CORRECT_NEW = new $RegExp(re1) !== re1;\n\nif (require('./_descriptors') && (!CORRECT_NEW || require('./_fails')(function () {\n re2[require('./_wks')('match')] = false;\n // RegExp constructor can alter flags and IsRegExp works correct with @@match\n return $RegExp(re1) != re1 || $RegExp(re2) == re2 || $RegExp(re1, 'i') != '/a/i';\n}))) {\n $RegExp = function RegExp(p, f) {\n var tiRE = this instanceof $RegExp;\n var piRE = isRegExp(p);\n var fiU = f === undefined;\n return !tiRE && piRE && p.constructor === $RegExp && fiU ? p\n : inheritIfRequired(CORRECT_NEW\n ? new Base(piRE && !fiU ? p.source : p, f)\n : Base((piRE = p instanceof $RegExp) ? p.source : p, piRE && fiU ? $flags.call(p) : f)\n , tiRE ? this : proto, $RegExp);\n };\n var proxy = function (key) {\n key in $RegExp || dP($RegExp, key, {\n configurable: true,\n get: function () { return Base[key]; },\n set: function (it) { Base[key] = it; }\n });\n };\n for (var keys = gOPN(Base), i = 0; keys.length > i;) proxy(keys[i++]);\n proto.constructor = $RegExp;\n $RegExp.prototype = proto;\n require('./_redefine')(global, 'RegExp', $RegExp);\n}\n\nrequire('./_set-species')('RegExp');\n","// 21.2.5.3 get RegExp.prototype.flags()\nif (require('./_descriptors') && /./g.flags != 'g') require('./_object-dp').f(RegExp.prototype, 'flags', {\n configurable: true,\n get: require('./_flags')\n});\n","// @@match logic\nrequire('./_fix-re-wks')('match', 1, function (defined, MATCH, $match) {\n // 21.1.3.11 String.prototype.match(regexp)\n return [function match(regexp) {\n 'use strict';\n var O = defined(this);\n var fn = regexp == undefined ? undefined : regexp[MATCH];\n return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[MATCH](String(O));\n }, $match];\n});\n","// @@replace logic\nrequire('./_fix-re-wks')('replace', 2, function (defined, REPLACE, $replace) {\n // 21.1.3.14 String.prototype.replace(searchValue, replaceValue)\n return [function replace(searchValue, replaceValue) {\n 'use strict';\n var O = defined(this);\n var fn = searchValue == undefined ? undefined : searchValue[REPLACE];\n return fn !== undefined\n ? fn.call(searchValue, O, replaceValue)\n : $replace.call(String(O), searchValue, replaceValue);\n }, $replace];\n});\n","// @@search logic\nrequire('./_fix-re-wks')('search', 1, function (defined, SEARCH, $search) {\n // 21.1.3.15 String.prototype.search(regexp)\n return [function search(regexp) {\n 'use strict';\n var O = defined(this);\n var fn = regexp == undefined ? undefined : regexp[SEARCH];\n return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[SEARCH](String(O));\n }, $search];\n});\n","// @@split logic\nrequire('./_fix-re-wks')('split', 2, function (defined, SPLIT, $split) {\n 'use strict';\n var isRegExp = require('./_is-regexp');\n var _split = $split;\n var $push = [].push;\n var $SPLIT = 'split';\n var LENGTH = 'length';\n var LAST_INDEX = 'lastIndex';\n if (\n 'abbc'[$SPLIT](/(b)*/)[1] == 'c' ||\n 'test'[$SPLIT](/(?:)/, -1)[LENGTH] != 4 ||\n 'ab'[$SPLIT](/(?:ab)*/)[LENGTH] != 2 ||\n '.'[$SPLIT](/(.?)(.?)/)[LENGTH] != 4 ||\n '.'[$SPLIT](/()()/)[LENGTH] > 1 ||\n ''[$SPLIT](/.?/)[LENGTH]\n ) {\n var NPCG = /()??/.exec('')[1] === undefined; // nonparticipating capturing group\n // based on es5-shim implementation, need to rework it\n $split = function (separator, limit) {\n var string = String(this);\n if (separator === undefined && limit === 0) return [];\n // If `separator` is not a regex, use native split\n if (!isRegExp(separator)) return _split.call(string, separator, limit);\n var output = [];\n var flags = (separator.ignoreCase ? 'i' : '') +\n (separator.multiline ? 'm' : '') +\n (separator.unicode ? 'u' : '') +\n (separator.sticky ? 'y' : '');\n var lastLastIndex = 0;\n var splitLimit = limit === undefined ? 4294967295 : limit >>> 0;\n // Make `global` and avoid `lastIndex` issues by working with a copy\n var separatorCopy = new RegExp(separator.source, flags + 'g');\n var separator2, match, lastIndex, lastLength, i;\n // Doesn't need flags gy, but they don't hurt\n if (!NPCG) separator2 = new RegExp('^' + separatorCopy.source + '$(?!\\\\s)', flags);\n while (match = separatorCopy.exec(string)) {\n // `separatorCopy.lastIndex` is not reliable cross-browser\n lastIndex = match.index + match[0][LENGTH];\n if (lastIndex > lastLastIndex) {\n output.push(string.slice(lastLastIndex, match.index));\n // Fix browsers whose `exec` methods don't consistently return `undefined` for NPCG\n // eslint-disable-next-line no-loop-func\n if (!NPCG && match[LENGTH] > 1) match[0].replace(separator2, function () {\n for (i = 1; i < arguments[LENGTH] - 2; i++) if (arguments[i] === undefined) match[i] = undefined;\n });\n if (match[LENGTH] > 1 && match.index < string[LENGTH]) $push.apply(output, match.slice(1));\n lastLength = match[0][LENGTH];\n lastLastIndex = lastIndex;\n if (output[LENGTH] >= splitLimit) break;\n }\n if (separatorCopy[LAST_INDEX] === match.index) separatorCopy[LAST_INDEX]++; // Avoid an infinite loop\n }\n if (lastLastIndex === string[LENGTH]) {\n if (lastLength || !separatorCopy.test('')) output.push('');\n } else output.push(string.slice(lastLastIndex));\n return output[LENGTH] > splitLimit ? output.slice(0, splitLimit) : output;\n };\n // Chakra, V8\n } else if ('0'[$SPLIT](undefined, 0)[LENGTH]) {\n $split = function (separator, limit) {\n return separator === undefined && limit === 0 ? [] : _split.call(this, separator, limit);\n };\n }\n // 21.1.3.17 String.prototype.split(separator, limit)\n return [function split(separator, limit) {\n var O = defined(this);\n var fn = separator == undefined ? undefined : separator[SPLIT];\n return fn !== undefined ? fn.call(separator, O, limit) : $split.call(String(O), separator, limit);\n }, $split];\n});\n","'use strict';\nrequire('./es6.regexp.flags');\nvar anObject = require('./_an-object');\nvar $flags = require('./_flags');\nvar DESCRIPTORS = require('./_descriptors');\nvar TO_STRING = 'toString';\nvar $toString = /./[TO_STRING];\n\nvar define = function (fn) {\n require('./_redefine')(RegExp.prototype, TO_STRING, fn, true);\n};\n\n// 21.2.5.14 RegExp.prototype.toString()\nif (require('./_fails')(function () { return $toString.call({ source: 'a', flags: 'b' }) != '/a/b'; })) {\n define(function toString() {\n var R = anObject(this);\n return '/'.concat(R.source, '/',\n 'flags' in R ? R.flags : !DESCRIPTORS && R instanceof RegExp ? $flags.call(R) : undefined);\n });\n// FF44- RegExp#toString has a wrong name\n} else if ($toString.name != TO_STRING) {\n define(function toString() {\n return $toString.call(this);\n });\n}\n","'use strict';\nvar strong = require('./_collection-strong');\nvar validate = require('./_validate-collection');\nvar SET = 'Set';\n\n// 23.2 Set Objects\nmodule.exports = require('./_collection')(SET, function (get) {\n return function Set() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\n}, {\n // 23.2.3.1 Set.prototype.add(value)\n add: function add(value) {\n return strong.def(validate(this, SET), value = value === 0 ? 0 : value, value);\n }\n}, strong);\n","'use strict';\n// B.2.3.2 String.prototype.anchor(name)\nrequire('./_string-html')('anchor', function (createHTML) {\n return function anchor(name) {\n return createHTML(this, 'a', 'name', name);\n };\n});\n","'use strict';\n// B.2.3.3 String.prototype.big()\nrequire('./_string-html')('big', function (createHTML) {\n return function big() {\n return createHTML(this, 'big', '', '');\n };\n});\n","'use strict';\n// B.2.3.4 String.prototype.blink()\nrequire('./_string-html')('blink', function (createHTML) {\n return function blink() {\n return createHTML(this, 'blink', '', '');\n };\n});\n","'use strict';\n// B.2.3.5 String.prototype.bold()\nrequire('./_string-html')('bold', function (createHTML) {\n return function bold() {\n return createHTML(this, 'b', '', '');\n };\n});\n","'use strict';\nvar $export = require('./_export');\nvar $at = require('./_string-at')(false);\n$export($export.P, 'String', {\n // 21.1.3.3 String.prototype.codePointAt(pos)\n codePointAt: function codePointAt(pos) {\n return $at(this, pos);\n }\n});\n","// 21.1.3.6 String.prototype.endsWith(searchString [, endPosition])\n'use strict';\nvar $export = require('./_export');\nvar toLength = require('./_to-length');\nvar context = require('./_string-context');\nvar ENDS_WITH = 'endsWith';\nvar $endsWith = ''[ENDS_WITH];\n\n$export($export.P + $export.F * require('./_fails-is-regexp')(ENDS_WITH), 'String', {\n endsWith: function endsWith(searchString /* , endPosition = @length */) {\n var that = context(this, searchString, ENDS_WITH);\n var endPosition = arguments.length > 1 ? arguments[1] : undefined;\n var len = toLength(that.length);\n var end = endPosition === undefined ? len : Math.min(toLength(endPosition), len);\n var search = String(searchString);\n return $endsWith\n ? $endsWith.call(that, search, end)\n : that.slice(end - search.length, end) === search;\n }\n});\n","'use strict';\n// B.2.3.6 String.prototype.fixed()\nrequire('./_string-html')('fixed', function (createHTML) {\n return function fixed() {\n return createHTML(this, 'tt', '', '');\n };\n});\n","'use strict';\n// B.2.3.7 String.prototype.fontcolor(color)\nrequire('./_string-html')('fontcolor', function (createHTML) {\n return function fontcolor(color) {\n return createHTML(this, 'font', 'color', color);\n };\n});\n","'use strict';\n// B.2.3.8 String.prototype.fontsize(size)\nrequire('./_string-html')('fontsize', function (createHTML) {\n return function fontsize(size) {\n return createHTML(this, 'font', 'size', size);\n };\n});\n","var $export = require('./_export');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar fromCharCode = String.fromCharCode;\nvar $fromCodePoint = String.fromCodePoint;\n\n// length should be 1, old FF problem\n$export($export.S + $export.F * (!!$fromCodePoint && $fromCodePoint.length != 1), 'String', {\n // 21.1.2.2 String.fromCodePoint(...codePoints)\n fromCodePoint: function fromCodePoint(x) { // eslint-disable-line no-unused-vars\n var res = [];\n var aLen = arguments.length;\n var i = 0;\n var code;\n while (aLen > i) {\n code = +arguments[i++];\n if (toAbsoluteIndex(code, 0x10ffff) !== code) throw RangeError(code + ' is not a valid code point');\n res.push(code < 0x10000\n ? fromCharCode(code)\n : fromCharCode(((code -= 0x10000) >> 10) + 0xd800, code % 0x400 + 0xdc00)\n );\n } return res.join('');\n }\n});\n","// 21.1.3.7 String.prototype.includes(searchString, position = 0)\n'use strict';\nvar $export = require('./_export');\nvar context = require('./_string-context');\nvar INCLUDES = 'includes';\n\n$export($export.P + $export.F * require('./_fails-is-regexp')(INCLUDES), 'String', {\n includes: function includes(searchString /* , position = 0 */) {\n return !!~context(this, searchString, INCLUDES)\n .indexOf(searchString, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\n","'use strict';\n// B.2.3.9 String.prototype.italics()\nrequire('./_string-html')('italics', function (createHTML) {\n return function italics() {\n return createHTML(this, 'i', '', '');\n };\n});\n","'use strict';\nvar $at = require('./_string-at')(true);\n\n// 21.1.3.27 String.prototype[@@iterator]()\nrequire('./_iter-define')(String, 'String', function (iterated) {\n this._t = String(iterated); // target\n this._i = 0; // next index\n// 21.1.5.2.1 %StringIteratorPrototype%.next()\n}, function () {\n var O = this._t;\n var index = this._i;\n var point;\n if (index >= O.length) return { value: undefined, done: true };\n point = $at(O, index);\n this._i += point.length;\n return { value: point, done: false };\n});\n","'use strict';\n// B.2.3.10 String.prototype.link(url)\nrequire('./_string-html')('link', function (createHTML) {\n return function link(url) {\n return createHTML(this, 'a', 'href', url);\n };\n});\n","var $export = require('./_export');\nvar toIObject = require('./_to-iobject');\nvar toLength = require('./_to-length');\n\n$export($export.S, 'String', {\n // 21.1.2.4 String.raw(callSite, ...substitutions)\n raw: function raw(callSite) {\n var tpl = toIObject(callSite.raw);\n var len = toLength(tpl.length);\n var aLen = arguments.length;\n var res = [];\n var i = 0;\n while (len > i) {\n res.push(String(tpl[i++]));\n if (i < aLen) res.push(String(arguments[i]));\n } return res.join('');\n }\n});\n","var $export = require('./_export');\n\n$export($export.P, 'String', {\n // 21.1.3.13 String.prototype.repeat(count)\n repeat: require('./_string-repeat')\n});\n","'use strict';\n// B.2.3.11 String.prototype.small()\nrequire('./_string-html')('small', function (createHTML) {\n return function small() {\n return createHTML(this, 'small', '', '');\n };\n});\n","// 21.1.3.18 String.prototype.startsWith(searchString [, position ])\n'use strict';\nvar $export = require('./_export');\nvar toLength = require('./_to-length');\nvar context = require('./_string-context');\nvar STARTS_WITH = 'startsWith';\nvar $startsWith = ''[STARTS_WITH];\n\n$export($export.P + $export.F * require('./_fails-is-regexp')(STARTS_WITH), 'String', {\n startsWith: function startsWith(searchString /* , position = 0 */) {\n var that = context(this, searchString, STARTS_WITH);\n var index = toLength(Math.min(arguments.length > 1 ? arguments[1] : undefined, that.length));\n var search = String(searchString);\n return $startsWith\n ? $startsWith.call(that, search, index)\n : that.slice(index, index + search.length) === search;\n }\n});\n","'use strict';\n// B.2.3.12 String.prototype.strike()\nrequire('./_string-html')('strike', function (createHTML) {\n return function strike() {\n return createHTML(this, 'strike', '', '');\n };\n});\n","'use strict';\n// B.2.3.13 String.prototype.sub()\nrequire('./_string-html')('sub', function (createHTML) {\n return function sub() {\n return createHTML(this, 'sub', '', '');\n };\n});\n","'use strict';\n// B.2.3.14 String.prototype.sup()\nrequire('./_string-html')('sup', function (createHTML) {\n return function sup() {\n return createHTML(this, 'sup', '', '');\n };\n});\n","'use strict';\n// 21.1.3.25 String.prototype.trim()\nrequire('./_string-trim')('trim', function ($trim) {\n return function trim() {\n return $trim(this, 3);\n };\n});\n","'use strict';\n// ECMAScript 6 symbols shim\nvar global = require('./_global');\nvar has = require('./_has');\nvar DESCRIPTORS = require('./_descriptors');\nvar $export = require('./_export');\nvar redefine = require('./_redefine');\nvar META = require('./_meta').KEY;\nvar $fails = require('./_fails');\nvar shared = require('./_shared');\nvar setToStringTag = require('./_set-to-string-tag');\nvar uid = require('./_uid');\nvar wks = require('./_wks');\nvar wksExt = require('./_wks-ext');\nvar wksDefine = require('./_wks-define');\nvar enumKeys = require('./_enum-keys');\nvar isArray = require('./_is-array');\nvar anObject = require('./_an-object');\nvar toIObject = require('./_to-iobject');\nvar toPrimitive = require('./_to-primitive');\nvar createDesc = require('./_property-desc');\nvar _create = require('./_object-create');\nvar gOPNExt = require('./_object-gopn-ext');\nvar $GOPD = require('./_object-gopd');\nvar $DP = require('./_object-dp');\nvar $keys = require('./_object-keys');\nvar gOPD = $GOPD.f;\nvar dP = $DP.f;\nvar gOPN = gOPNExt.f;\nvar $Symbol = global.Symbol;\nvar $JSON = global.JSON;\nvar _stringify = $JSON && $JSON.stringify;\nvar PROTOTYPE = 'prototype';\nvar HIDDEN = wks('_hidden');\nvar TO_PRIMITIVE = wks('toPrimitive');\nvar isEnum = {}.propertyIsEnumerable;\nvar SymbolRegistry = shared('symbol-registry');\nvar AllSymbols = shared('symbols');\nvar OPSymbols = shared('op-symbols');\nvar ObjectProto = Object[PROTOTYPE];\nvar USE_NATIVE = typeof $Symbol == 'function';\nvar QObject = global.QObject;\n// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\nvar setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\n\n// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\nvar setSymbolDesc = DESCRIPTORS && $fails(function () {\n return _create(dP({}, 'a', {\n get: function () { return dP(this, 'a', { value: 7 }).a; }\n })).a != 7;\n}) ? function (it, key, D) {\n var protoDesc = gOPD(ObjectProto, key);\n if (protoDesc) delete ObjectProto[key];\n dP(it, key, D);\n if (protoDesc && it !== ObjectProto) dP(ObjectProto, key, protoDesc);\n} : dP;\n\nvar wrap = function (tag) {\n var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]);\n sym._k = tag;\n return sym;\n};\n\nvar isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function (it) {\n return typeof it == 'symbol';\n} : function (it) {\n return it instanceof $Symbol;\n};\n\nvar $defineProperty = function defineProperty(it, key, D) {\n if (it === ObjectProto) $defineProperty(OPSymbols, key, D);\n anObject(it);\n key = toPrimitive(key, true);\n anObject(D);\n if (has(AllSymbols, key)) {\n if (!D.enumerable) {\n if (!has(it, HIDDEN)) dP(it, HIDDEN, createDesc(1, {}));\n it[HIDDEN][key] = true;\n } else {\n if (has(it, HIDDEN) && it[HIDDEN][key]) it[HIDDEN][key] = false;\n D = _create(D, { enumerable: createDesc(0, false) });\n } return setSymbolDesc(it, key, D);\n } return dP(it, key, D);\n};\nvar $defineProperties = function defineProperties(it, P) {\n anObject(it);\n var keys = enumKeys(P = toIObject(P));\n var i = 0;\n var l = keys.length;\n var key;\n while (l > i) $defineProperty(it, key = keys[i++], P[key]);\n return it;\n};\nvar $create = function create(it, P) {\n return P === undefined ? _create(it) : $defineProperties(_create(it), P);\n};\nvar $propertyIsEnumerable = function propertyIsEnumerable(key) {\n var E = isEnum.call(this, key = toPrimitive(key, true));\n if (this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return false;\n return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true;\n};\nvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key) {\n it = toIObject(it);\n key = toPrimitive(key, true);\n if (it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return;\n var D = gOPD(it, key);\n if (D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key])) D.enumerable = true;\n return D;\n};\nvar $getOwnPropertyNames = function getOwnPropertyNames(it) {\n var names = gOPN(toIObject(it));\n var result = [];\n var i = 0;\n var key;\n while (names.length > i) {\n if (!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META) result.push(key);\n } return result;\n};\nvar $getOwnPropertySymbols = function getOwnPropertySymbols(it) {\n var IS_OP = it === ObjectProto;\n var names = gOPN(IS_OP ? OPSymbols : toIObject(it));\n var result = [];\n var i = 0;\n var key;\n while (names.length > i) {\n if (has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true)) result.push(AllSymbols[key]);\n } return result;\n};\n\n// 19.4.1.1 Symbol([description])\nif (!USE_NATIVE) {\n $Symbol = function Symbol() {\n if (this instanceof $Symbol) throw TypeError('Symbol is not a constructor!');\n var tag = uid(arguments.length > 0 ? arguments[0] : undefined);\n var $set = function (value) {\n if (this === ObjectProto) $set.call(OPSymbols, value);\n if (has(this, HIDDEN) && has(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\n setSymbolDesc(this, tag, createDesc(1, value));\n };\n if (DESCRIPTORS && setter) setSymbolDesc(ObjectProto, tag, { configurable: true, set: $set });\n return wrap(tag);\n };\n redefine($Symbol[PROTOTYPE], 'toString', function toString() {\n return this._k;\n });\n\n $GOPD.f = $getOwnPropertyDescriptor;\n $DP.f = $defineProperty;\n require('./_object-gopn').f = gOPNExt.f = $getOwnPropertyNames;\n require('./_object-pie').f = $propertyIsEnumerable;\n require('./_object-gops').f = $getOwnPropertySymbols;\n\n if (DESCRIPTORS && !require('./_library')) {\n redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true);\n }\n\n wksExt.f = function (name) {\n return wrap(wks(name));\n };\n}\n\n$export($export.G + $export.W + $export.F * !USE_NATIVE, { Symbol: $Symbol });\n\nfor (var es6Symbols = (\n // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14\n 'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables'\n).split(','), j = 0; es6Symbols.length > j;)wks(es6Symbols[j++]);\n\nfor (var wellKnownSymbols = $keys(wks.store), k = 0; wellKnownSymbols.length > k;) wksDefine(wellKnownSymbols[k++]);\n\n$export($export.S + $export.F * !USE_NATIVE, 'Symbol', {\n // 19.4.2.1 Symbol.for(key)\n 'for': function (key) {\n return has(SymbolRegistry, key += '')\n ? SymbolRegistry[key]\n : SymbolRegistry[key] = $Symbol(key);\n },\n // 19.4.2.5 Symbol.keyFor(sym)\n keyFor: function keyFor(sym) {\n if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol!');\n for (var key in SymbolRegistry) if (SymbolRegistry[key] === sym) return key;\n },\n useSetter: function () { setter = true; },\n useSimple: function () { setter = false; }\n});\n\n$export($export.S + $export.F * !USE_NATIVE, 'Object', {\n // 19.1.2.2 Object.create(O [, Properties])\n create: $create,\n // 19.1.2.4 Object.defineProperty(O, P, Attributes)\n defineProperty: $defineProperty,\n // 19.1.2.3 Object.defineProperties(O, Properties)\n defineProperties: $defineProperties,\n // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\n getOwnPropertyDescriptor: $getOwnPropertyDescriptor,\n // 19.1.2.7 Object.getOwnPropertyNames(O)\n getOwnPropertyNames: $getOwnPropertyNames,\n // 19.1.2.8 Object.getOwnPropertySymbols(O)\n getOwnPropertySymbols: $getOwnPropertySymbols\n});\n\n// 24.3.2 JSON.stringify(value [, replacer [, space]])\n$JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function () {\n var S = $Symbol();\n // MS Edge converts symbol values to JSON as {}\n // WebKit converts symbol values to JSON as null\n // V8 throws on boxed symbols\n return _stringify([S]) != '[null]' || _stringify({ a: S }) != '{}' || _stringify(Object(S)) != '{}';\n})), 'JSON', {\n stringify: function stringify(it) {\n if (it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\n var args = [it];\n var i = 1;\n var replacer, $replacer;\n while (arguments.length > i) args.push(arguments[i++]);\n replacer = args[1];\n if (typeof replacer == 'function') $replacer = replacer;\n if ($replacer || !isArray(replacer)) replacer = function (key, value) {\n if ($replacer) value = $replacer.call(this, key, value);\n if (!isSymbol(value)) return value;\n };\n args[1] = replacer;\n return _stringify.apply($JSON, args);\n }\n});\n\n// 19.4.3.4 Symbol.prototype[@@toPrimitive](hint)\n$Symbol[PROTOTYPE][TO_PRIMITIVE] || require('./_hide')($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);\n// 19.4.3.5 Symbol.prototype[@@toStringTag]\nsetToStringTag($Symbol, 'Symbol');\n// 20.2.1.9 Math[@@toStringTag]\nsetToStringTag(Math, 'Math', true);\n// 24.3.3 JSON[@@toStringTag]\nsetToStringTag(global.JSON, 'JSON', true);\n","'use strict';\nvar $export = require('./_export');\nvar $typed = require('./_typed');\nvar buffer = require('./_typed-buffer');\nvar anObject = require('./_an-object');\nvar toAbsoluteIndex = require('./_to-absolute-index');\nvar toLength = require('./_to-length');\nvar isObject = require('./_is-object');\nvar ArrayBuffer = require('./_global').ArrayBuffer;\nvar speciesConstructor = require('./_species-constructor');\nvar $ArrayBuffer = buffer.ArrayBuffer;\nvar $DataView = buffer.DataView;\nvar $isView = $typed.ABV && ArrayBuffer.isView;\nvar $slice = $ArrayBuffer.prototype.slice;\nvar VIEW = $typed.VIEW;\nvar ARRAY_BUFFER = 'ArrayBuffer';\n\n$export($export.G + $export.W + $export.F * (ArrayBuffer !== $ArrayBuffer), { ArrayBuffer: $ArrayBuffer });\n\n$export($export.S + $export.F * !$typed.CONSTR, ARRAY_BUFFER, {\n // 24.1.3.1 ArrayBuffer.isView(arg)\n isView: function isView(it) {\n return $isView && $isView(it) || isObject(it) && VIEW in it;\n }\n});\n\n$export($export.P + $export.U + $export.F * require('./_fails')(function () {\n return !new $ArrayBuffer(2).slice(1, undefined).byteLength;\n}), ARRAY_BUFFER, {\n // 24.1.4.3 ArrayBuffer.prototype.slice(start, end)\n slice: function slice(start, end) {\n if ($slice !== undefined && end === undefined) return $slice.call(anObject(this), start); // FF fix\n var len = anObject(this).byteLength;\n var first = toAbsoluteIndex(start, len);\n var final = toAbsoluteIndex(end === undefined ? len : end, len);\n var result = new (speciesConstructor(this, $ArrayBuffer))(toLength(final - first));\n var viewS = new $DataView(this);\n var viewT = new $DataView(result);\n var index = 0;\n while (first < final) {\n viewT.setUint8(index++, viewS.getUint8(first++));\n } return result;\n }\n});\n\nrequire('./_set-species')(ARRAY_BUFFER);\n","var $export = require('./_export');\n$export($export.G + $export.W + $export.F * !require('./_typed').ABV, {\n DataView: require('./_typed-buffer').DataView\n});\n","require('./_typed-array')('Float32', 4, function (init) {\n return function Float32Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Float64', 8, function (init) {\n return function Float64Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Int16', 2, function (init) {\n return function Int16Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Int32', 4, function (init) {\n return function Int32Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Int8', 1, function (init) {\n return function Int8Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Uint16', 2, function (init) {\n return function Uint16Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Uint32', 4, function (init) {\n return function Uint32Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Uint8', 1, function (init) {\n return function Uint8Array(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n});\n","require('./_typed-array')('Uint8', 1, function (init) {\n return function Uint8ClampedArray(data, byteOffset, length) {\n return init(this, data, byteOffset, length);\n };\n}, true);\n","'use strict';\nvar each = require('./_array-methods')(0);\nvar redefine = require('./_redefine');\nvar meta = require('./_meta');\nvar assign = require('./_object-assign');\nvar weak = require('./_collection-weak');\nvar isObject = require('./_is-object');\nvar fails = require('./_fails');\nvar validate = require('./_validate-collection');\nvar WEAK_MAP = 'WeakMap';\nvar getWeak = meta.getWeak;\nvar isExtensible = Object.isExtensible;\nvar uncaughtFrozenStore = weak.ufstore;\nvar tmp = {};\nvar InternalMap;\n\nvar wrapper = function (get) {\n return function WeakMap() {\n return get(this, arguments.length > 0 ? arguments[0] : undefined);\n };\n};\n\nvar methods = {\n // 23.3.3.3 WeakMap.prototype.get(key)\n get: function get(key) {\n if (isObject(key)) {\n var data = getWeak(key);\n if (data === true) return uncaughtFrozenStore(validate(this, WEAK_MAP)).get(key);\n return data ? data[this._i] : undefined;\n }\n },\n // 23.3.3.5 WeakMap.prototype.set(key, value)\n set: function set(key, value) {\n return weak.def(validate(this, WEAK_MAP), key, value);\n }\n};\n\n// 23.3 WeakMap Objects\nvar $WeakMap = module.exports = require('./_collection')(WEAK_MAP, wrapper, methods, weak, true, true);\n\n// IE11 WeakMap frozen keys fix\nif (fails(function () { return new $WeakMap().set((Object.freeze || Object)(tmp), 7).get(tmp) != 7; })) {\n InternalMap = weak.getConstructor(wrapper, WEAK_MAP);\n assign(InternalMap.prototype, methods);\n meta.NEED = true;\n each(['delete', 'has', 'get', 'set'], function (key) {\n var proto = $WeakMap.prototype;\n var method = proto[key];\n redefine(proto, key, function (a, b) {\n // store frozen objects on internal weakmap shim\n if (isObject(a) && !isExtensible(a)) {\n if (!this._f) this._f = new InternalMap();\n var result = this._f[key](a, b);\n return key == 'set' ? this : result;\n // store all the rest on native weakmap\n } return method.call(this, a, b);\n });\n });\n}\n","'use strict';\nvar weak = require('./_collection-weak');\nvar validate = require('./_validate-collection');\nvar WEAK_SET = 'WeakSet';\n\n// 23.4 WeakSet Objects\nrequire('./_collection')(WEAK_SET, function (get) {\n return function WeakSet() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\n}, {\n // 23.4.3.1 WeakSet.prototype.add(value)\n add: function add(value) {\n return weak.def(validate(this, WEAK_SET), value, true);\n }\n}, weak, false, true);\n","'use strict';\n// https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatMap\nvar $export = require('./_export');\nvar flattenIntoArray = require('./_flatten-into-array');\nvar toObject = require('./_to-object');\nvar toLength = require('./_to-length');\nvar aFunction = require('./_a-function');\nvar arraySpeciesCreate = require('./_array-species-create');\n\n$export($export.P, 'Array', {\n flatMap: function flatMap(callbackfn /* , thisArg */) {\n var O = toObject(this);\n var sourceLen, A;\n aFunction(callbackfn);\n sourceLen = toLength(O.length);\n A = arraySpeciesCreate(O, 0);\n flattenIntoArray(A, O, O, sourceLen, 0, 1, callbackfn, arguments[1]);\n return A;\n }\n});\n\nrequire('./_add-to-unscopables')('flatMap');\n","'use strict';\n// https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatten\nvar $export = require('./_export');\nvar flattenIntoArray = require('./_flatten-into-array');\nvar toObject = require('./_to-object');\nvar toLength = require('./_to-length');\nvar toInteger = require('./_to-integer');\nvar arraySpeciesCreate = require('./_array-species-create');\n\n$export($export.P, 'Array', {\n flatten: function flatten(/* depthArg = 1 */) {\n var depthArg = arguments[0];\n var O = toObject(this);\n var sourceLen = toLength(O.length);\n var A = arraySpeciesCreate(O, 0);\n flattenIntoArray(A, O, O, sourceLen, 0, depthArg === undefined ? 1 : toInteger(depthArg));\n return A;\n }\n});\n\nrequire('./_add-to-unscopables')('flatten');\n","'use strict';\n// https://github.com/tc39/Array.prototype.includes\nvar $export = require('./_export');\nvar $includes = require('./_array-includes')(true);\n\n$export($export.P, 'Array', {\n includes: function includes(el /* , fromIndex = 0 */) {\n return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined);\n }\n});\n\nrequire('./_add-to-unscopables')('includes');\n","// https://github.com/rwaldron/tc39-notes/blob/master/es6/2014-09/sept-25.md#510-globalasap-for-enqueuing-a-microtask\nvar $export = require('./_export');\nvar microtask = require('./_microtask')();\nvar process = require('./_global').process;\nvar isNode = require('./_cof')(process) == 'process';\n\n$export($export.G, {\n asap: function asap(fn) {\n var domain = isNode && process.domain;\n microtask(domain ? domain.bind(fn) : fn);\n }\n});\n","// https://github.com/ljharb/proposal-is-error\nvar $export = require('./_export');\nvar cof = require('./_cof');\n\n$export($export.S, 'Error', {\n isError: function isError(it) {\n return cof(it) === 'Error';\n }\n});\n","// https://github.com/tc39/proposal-global\nvar $export = require('./_export');\n\n$export($export.G, { global: require('./_global') });\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-map.from\nrequire('./_set-collection-from')('Map');\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-map.of\nrequire('./_set-collection-of')('Map');\n","// https://github.com/DavidBruant/Map-Set.prototype.toJSON\nvar $export = require('./_export');\n\n$export($export.P + $export.R, 'Map', { toJSON: require('./_collection-to-json')('Map') });\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n clamp: function clamp(x, lower, upper) {\n return Math.min(upper, Math.max(lower, x));\n }\n});\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { DEG_PER_RAD: Math.PI / 180 });\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\nvar RAD_PER_DEG = 180 / Math.PI;\n\n$export($export.S, 'Math', {\n degrees: function degrees(radians) {\n return radians * RAD_PER_DEG;\n }\n});\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\nvar scale = require('./_math-scale');\nvar fround = require('./_math-fround');\n\n$export($export.S, 'Math', {\n fscale: function fscale(x, inLow, inHigh, outLow, outHigh) {\n return fround(scale(x, inLow, inHigh, outLow, outHigh));\n }\n});\n","// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n iaddh: function iaddh(x0, x1, y0, y1) {\n var $x0 = x0 >>> 0;\n var $x1 = x1 >>> 0;\n var $y0 = y0 >>> 0;\n return $x1 + (y1 >>> 0) + (($x0 & $y0 | ($x0 | $y0) & ~($x0 + $y0 >>> 0)) >>> 31) | 0;\n }\n});\n","// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n imulh: function imulh(u, v) {\n var UINT16 = 0xffff;\n var $u = +u;\n var $v = +v;\n var u0 = $u & UINT16;\n var v0 = $v & UINT16;\n var u1 = $u >> 16;\n var v1 = $v >> 16;\n var t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);\n return u1 * v1 + (t >> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >> 16);\n }\n});\n","// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n isubh: function isubh(x0, x1, y0, y1) {\n var $x0 = x0 >>> 0;\n var $x1 = x1 >>> 0;\n var $y0 = y0 >>> 0;\n return $x1 - (y1 >>> 0) - ((~$x0 & $y0 | ~($x0 ^ $y0) & $x0 - $y0 >>> 0) >>> 31) | 0;\n }\n});\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { RAD_PER_DEG: 180 / Math.PI });\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\nvar DEG_PER_RAD = Math.PI / 180;\n\n$export($export.S, 'Math', {\n radians: function radians(degrees) {\n return degrees * DEG_PER_RAD;\n }\n});\n","// https://rwaldron.github.io/proposal-math-extensions/\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { scale: require('./_math-scale') });\n","// http://jfbastien.github.io/papers/Math.signbit.html\nvar $export = require('./_export');\n\n$export($export.S, 'Math', { signbit: function signbit(x) {\n // eslint-disable-next-line no-self-compare\n return (x = +x) != x ? x : x == 0 ? 1 / x == Infinity : x > 0;\n} });\n","// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\nvar $export = require('./_export');\n\n$export($export.S, 'Math', {\n umulh: function umulh(u, v) {\n var UINT16 = 0xffff;\n var $u = +u;\n var $v = +v;\n var u0 = $u & UINT16;\n var v0 = $v & UINT16;\n var u1 = $u >>> 16;\n var v1 = $v >>> 16;\n var t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);\n return u1 * v1 + (t >>> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >>> 16);\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar aFunction = require('./_a-function');\nvar $defineProperty = require('./_object-dp');\n\n// B.2.2.2 Object.prototype.__defineGetter__(P, getter)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __defineGetter__: function __defineGetter__(P, getter) {\n $defineProperty.f(toObject(this), P, { get: aFunction(getter), enumerable: true, configurable: true });\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar aFunction = require('./_a-function');\nvar $defineProperty = require('./_object-dp');\n\n// B.2.2.3 Object.prototype.__defineSetter__(P, setter)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __defineSetter__: function __defineSetter__(P, setter) {\n $defineProperty.f(toObject(this), P, { set: aFunction(setter), enumerable: true, configurable: true });\n }\n});\n","// https://github.com/tc39/proposal-object-values-entries\nvar $export = require('./_export');\nvar $entries = require('./_object-to-array')(true);\n\n$export($export.S, 'Object', {\n entries: function entries(it) {\n return $entries(it);\n }\n});\n","// https://github.com/tc39/proposal-object-getownpropertydescriptors\nvar $export = require('./_export');\nvar ownKeys = require('./_own-keys');\nvar toIObject = require('./_to-iobject');\nvar gOPD = require('./_object-gopd');\nvar createProperty = require('./_create-property');\n\n$export($export.S, 'Object', {\n getOwnPropertyDescriptors: function getOwnPropertyDescriptors(object) {\n var O = toIObject(object);\n var getDesc = gOPD.f;\n var keys = ownKeys(O);\n var result = {};\n var i = 0;\n var key, desc;\n while (keys.length > i) {\n desc = getDesc(O, key = keys[i++]);\n if (desc !== undefined) createProperty(result, key, desc);\n }\n return result;\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar toPrimitive = require('./_to-primitive');\nvar getPrototypeOf = require('./_object-gpo');\nvar getOwnPropertyDescriptor = require('./_object-gopd').f;\n\n// B.2.2.4 Object.prototype.__lookupGetter__(P)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __lookupGetter__: function __lookupGetter__(P) {\n var O = toObject(this);\n var K = toPrimitive(P, true);\n var D;\n do {\n if (D = getOwnPropertyDescriptor(O, K)) return D.get;\n } while (O = getPrototypeOf(O));\n }\n});\n","'use strict';\nvar $export = require('./_export');\nvar toObject = require('./_to-object');\nvar toPrimitive = require('./_to-primitive');\nvar getPrototypeOf = require('./_object-gpo');\nvar getOwnPropertyDescriptor = require('./_object-gopd').f;\n\n// B.2.2.5 Object.prototype.__lookupSetter__(P)\nrequire('./_descriptors') && $export($export.P + require('./_object-forced-pam'), 'Object', {\n __lookupSetter__: function __lookupSetter__(P) {\n var O = toObject(this);\n var K = toPrimitive(P, true);\n var D;\n do {\n if (D = getOwnPropertyDescriptor(O, K)) return D.set;\n } while (O = getPrototypeOf(O));\n }\n});\n","// https://github.com/tc39/proposal-object-values-entries\nvar $export = require('./_export');\nvar $values = require('./_object-to-array')(false);\n\n$export($export.S, 'Object', {\n values: function values(it) {\n return $values(it);\n }\n});\n","'use strict';\n// https://github.com/zenparsing/es-observable\nvar $export = require('./_export');\nvar global = require('./_global');\nvar core = require('./_core');\nvar microtask = require('./_microtask')();\nvar OBSERVABLE = require('./_wks')('observable');\nvar aFunction = require('./_a-function');\nvar anObject = require('./_an-object');\nvar anInstance = require('./_an-instance');\nvar redefineAll = require('./_redefine-all');\nvar hide = require('./_hide');\nvar forOf = require('./_for-of');\nvar RETURN = forOf.RETURN;\n\nvar getMethod = function (fn) {\n return fn == null ? undefined : aFunction(fn);\n};\n\nvar cleanupSubscription = function (subscription) {\n var cleanup = subscription._c;\n if (cleanup) {\n subscription._c = undefined;\n cleanup();\n }\n};\n\nvar subscriptionClosed = function (subscription) {\n return subscription._o === undefined;\n};\n\nvar closeSubscription = function (subscription) {\n if (!subscriptionClosed(subscription)) {\n subscription._o = undefined;\n cleanupSubscription(subscription);\n }\n};\n\nvar Subscription = function (observer, subscriber) {\n anObject(observer);\n this._c = undefined;\n this._o = observer;\n observer = new SubscriptionObserver(this);\n try {\n var cleanup = subscriber(observer);\n var subscription = cleanup;\n if (cleanup != null) {\n if (typeof cleanup.unsubscribe === 'function') cleanup = function () { subscription.unsubscribe(); };\n else aFunction(cleanup);\n this._c = cleanup;\n }\n } catch (e) {\n observer.error(e);\n return;\n } if (subscriptionClosed(this)) cleanupSubscription(this);\n};\n\nSubscription.prototype = redefineAll({}, {\n unsubscribe: function unsubscribe() { closeSubscription(this); }\n});\n\nvar SubscriptionObserver = function (subscription) {\n this._s = subscription;\n};\n\nSubscriptionObserver.prototype = redefineAll({}, {\n next: function next(value) {\n var subscription = this._s;\n if (!subscriptionClosed(subscription)) {\n var observer = subscription._o;\n try {\n var m = getMethod(observer.next);\n if (m) return m.call(observer, value);\n } catch (e) {\n try {\n closeSubscription(subscription);\n } finally {\n throw e;\n }\n }\n }\n },\n error: function error(value) {\n var subscription = this._s;\n if (subscriptionClosed(subscription)) throw value;\n var observer = subscription._o;\n subscription._o = undefined;\n try {\n var m = getMethod(observer.error);\n if (!m) throw value;\n value = m.call(observer, value);\n } catch (e) {\n try {\n cleanupSubscription(subscription);\n } finally {\n throw e;\n }\n } cleanupSubscription(subscription);\n return value;\n },\n complete: function complete(value) {\n var subscription = this._s;\n if (!subscriptionClosed(subscription)) {\n var observer = subscription._o;\n subscription._o = undefined;\n try {\n var m = getMethod(observer.complete);\n value = m ? m.call(observer, value) : undefined;\n } catch (e) {\n try {\n cleanupSubscription(subscription);\n } finally {\n throw e;\n }\n } cleanupSubscription(subscription);\n return value;\n }\n }\n});\n\nvar $Observable = function Observable(subscriber) {\n anInstance(this, $Observable, 'Observable', '_f')._f = aFunction(subscriber);\n};\n\nredefineAll($Observable.prototype, {\n subscribe: function subscribe(observer) {\n return new Subscription(observer, this._f);\n },\n forEach: function forEach(fn) {\n var that = this;\n return new (core.Promise || global.Promise)(function (resolve, reject) {\n aFunction(fn);\n var subscription = that.subscribe({\n next: function (value) {\n try {\n return fn(value);\n } catch (e) {\n reject(e);\n subscription.unsubscribe();\n }\n },\n error: reject,\n complete: resolve\n });\n });\n }\n});\n\nredefineAll($Observable, {\n from: function from(x) {\n var C = typeof this === 'function' ? this : $Observable;\n var method = getMethod(anObject(x)[OBSERVABLE]);\n if (method) {\n var observable = anObject(method.call(x));\n return observable.constructor === C ? observable : new C(function (observer) {\n return observable.subscribe(observer);\n });\n }\n return new C(function (observer) {\n var done = false;\n microtask(function () {\n if (!done) {\n try {\n if (forOf(x, false, function (it) {\n observer.next(it);\n if (done) return RETURN;\n }) === RETURN) return;\n } catch (e) {\n if (done) throw e;\n observer.error(e);\n return;\n } observer.complete();\n }\n });\n return function () { done = true; };\n });\n },\n of: function of() {\n for (var i = 0, l = arguments.length, items = Array(l); i < l;) items[i] = arguments[i++];\n return new (typeof this === 'function' ? this : $Observable)(function (observer) {\n var done = false;\n microtask(function () {\n if (!done) {\n for (var j = 0; j < items.length; ++j) {\n observer.next(items[j]);\n if (done) return;\n } observer.complete();\n }\n });\n return function () { done = true; };\n });\n }\n});\n\nhide($Observable.prototype, OBSERVABLE, function () { return this; });\n\n$export($export.G, { Observable: $Observable });\n\nrequire('./_set-species')('Observable');\n","// https://github.com/tc39/proposal-promise-finally\n'use strict';\nvar $export = require('./_export');\nvar core = require('./_core');\nvar global = require('./_global');\nvar speciesConstructor = require('./_species-constructor');\nvar promiseResolve = require('./_promise-resolve');\n\n$export($export.P + $export.R, 'Promise', { 'finally': function (onFinally) {\n var C = speciesConstructor(this, core.Promise || global.Promise);\n var isFunction = typeof onFinally == 'function';\n return this.then(\n isFunction ? function (x) {\n return promiseResolve(C, onFinally()).then(function () { return x; });\n } : onFinally,\n isFunction ? function (e) {\n return promiseResolve(C, onFinally()).then(function () { throw e; });\n } : onFinally\n );\n} });\n","'use strict';\n// https://github.com/tc39/proposal-promise-try\nvar $export = require('./_export');\nvar newPromiseCapability = require('./_new-promise-capability');\nvar perform = require('./_perform');\n\n$export($export.S, 'Promise', { 'try': function (callbackfn) {\n var promiseCapability = newPromiseCapability.f(this);\n var result = perform(callbackfn);\n (result.e ? promiseCapability.reject : promiseCapability.resolve)(result.v);\n return promiseCapability.promise;\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar toMetaKey = metadata.key;\nvar ordinaryDefineOwnMetadata = metadata.set;\n\nmetadata.exp({ defineMetadata: function defineMetadata(metadataKey, metadataValue, target, targetKey) {\n ordinaryDefineOwnMetadata(metadataKey, metadataValue, anObject(target), toMetaKey(targetKey));\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar toMetaKey = metadata.key;\nvar getOrCreateMetadataMap = metadata.map;\nvar store = metadata.store;\n\nmetadata.exp({ deleteMetadata: function deleteMetadata(metadataKey, target /* , targetKey */) {\n var targetKey = arguments.length < 3 ? undefined : toMetaKey(arguments[2]);\n var metadataMap = getOrCreateMetadataMap(anObject(target), targetKey, false);\n if (metadataMap === undefined || !metadataMap['delete'](metadataKey)) return false;\n if (metadataMap.size) return true;\n var targetMetadata = store.get(target);\n targetMetadata['delete'](targetKey);\n return !!targetMetadata.size || store['delete'](target);\n} });\n","var Set = require('./es6.set');\nvar from = require('./_array-from-iterable');\nvar metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar ordinaryOwnMetadataKeys = metadata.keys;\nvar toMetaKey = metadata.key;\n\nvar ordinaryMetadataKeys = function (O, P) {\n var oKeys = ordinaryOwnMetadataKeys(O, P);\n var parent = getPrototypeOf(O);\n if (parent === null) return oKeys;\n var pKeys = ordinaryMetadataKeys(parent, P);\n return pKeys.length ? oKeys.length ? from(new Set(oKeys.concat(pKeys))) : pKeys : oKeys;\n};\n\nmetadata.exp({ getMetadataKeys: function getMetadataKeys(target /* , targetKey */) {\n return ordinaryMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar ordinaryHasOwnMetadata = metadata.has;\nvar ordinaryGetOwnMetadata = metadata.get;\nvar toMetaKey = metadata.key;\n\nvar ordinaryGetMetadata = function (MetadataKey, O, P) {\n var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn) return ordinaryGetOwnMetadata(MetadataKey, O, P);\n var parent = getPrototypeOf(O);\n return parent !== null ? ordinaryGetMetadata(MetadataKey, parent, P) : undefined;\n};\n\nmetadata.exp({ getMetadata: function getMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryGetMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar ordinaryOwnMetadataKeys = metadata.keys;\nvar toMetaKey = metadata.key;\n\nmetadata.exp({ getOwnMetadataKeys: function getOwnMetadataKeys(target /* , targetKey */) {\n return ordinaryOwnMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar ordinaryGetOwnMetadata = metadata.get;\nvar toMetaKey = metadata.key;\n\nmetadata.exp({ getOwnMetadata: function getOwnMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryGetOwnMetadata(metadataKey, anObject(target)\n , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar getPrototypeOf = require('./_object-gpo');\nvar ordinaryHasOwnMetadata = metadata.has;\nvar toMetaKey = metadata.key;\n\nvar ordinaryHasMetadata = function (MetadataKey, O, P) {\n var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn) return true;\n var parent = getPrototypeOf(O);\n return parent !== null ? ordinaryHasMetadata(MetadataKey, parent, P) : false;\n};\n\nmetadata.exp({ hasMetadata: function hasMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryHasMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n","var metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar ordinaryHasOwnMetadata = metadata.has;\nvar toMetaKey = metadata.key;\n\nmetadata.exp({ hasOwnMetadata: function hasOwnMetadata(metadataKey, target /* , targetKey */) {\n return ordinaryHasOwnMetadata(metadataKey, anObject(target)\n , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\n} });\n","var $metadata = require('./_metadata');\nvar anObject = require('./_an-object');\nvar aFunction = require('./_a-function');\nvar toMetaKey = $metadata.key;\nvar ordinaryDefineOwnMetadata = $metadata.set;\n\n$metadata.exp({ metadata: function metadata(metadataKey, metadataValue) {\n return function decorator(target, targetKey) {\n ordinaryDefineOwnMetadata(\n metadataKey, metadataValue,\n (targetKey !== undefined ? anObject : aFunction)(target),\n toMetaKey(targetKey)\n );\n };\n} });\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-set.from\nrequire('./_set-collection-from')('Set');\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-set.of\nrequire('./_set-collection-of')('Set');\n","// https://github.com/DavidBruant/Map-Set.prototype.toJSON\nvar $export = require('./_export');\n\n$export($export.P + $export.R, 'Set', { toJSON: require('./_collection-to-json')('Set') });\n","'use strict';\n// https://github.com/mathiasbynens/String.prototype.at\nvar $export = require('./_export');\nvar $at = require('./_string-at')(true);\n\n$export($export.P, 'String', {\n at: function at(pos) {\n return $at(this, pos);\n }\n});\n","'use strict';\n// https://tc39.github.io/String.prototype.matchAll/\nvar $export = require('./_export');\nvar defined = require('./_defined');\nvar toLength = require('./_to-length');\nvar isRegExp = require('./_is-regexp');\nvar getFlags = require('./_flags');\nvar RegExpProto = RegExp.prototype;\n\nvar $RegExpStringIterator = function (regexp, string) {\n this._r = regexp;\n this._s = string;\n};\n\nrequire('./_iter-create')($RegExpStringIterator, 'RegExp String', function next() {\n var match = this._r.exec(this._s);\n return { value: match, done: match === null };\n});\n\n$export($export.P, 'String', {\n matchAll: function matchAll(regexp) {\n defined(this);\n if (!isRegExp(regexp)) throw TypeError(regexp + ' is not a regexp!');\n var S = String(this);\n var flags = 'flags' in RegExpProto ? String(regexp.flags) : getFlags.call(regexp);\n var rx = new RegExp(regexp.source, ~flags.indexOf('g') ? flags : 'g' + flags);\n rx.lastIndex = toLength(regexp.lastIndex);\n return new $RegExpStringIterator(rx, S);\n }\n});\n","'use strict';\n// https://github.com/tc39/proposal-string-pad-start-end\nvar $export = require('./_export');\nvar $pad = require('./_string-pad');\n\n$export($export.P, 'String', {\n padEnd: function padEnd(maxLength /* , fillString = ' ' */) {\n return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, false);\n }\n});\n","'use strict';\n// https://github.com/tc39/proposal-string-pad-start-end\nvar $export = require('./_export');\nvar $pad = require('./_string-pad');\n\n$export($export.P, 'String', {\n padStart: function padStart(maxLength /* , fillString = ' ' */) {\n return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, true);\n }\n});\n","'use strict';\n// https://github.com/sebmarkbage/ecmascript-string-left-right-trim\nrequire('./_string-trim')('trimLeft', function ($trim) {\n return function trimLeft() {\n return $trim(this, 1);\n };\n}, 'trimStart');\n","'use strict';\n// https://github.com/sebmarkbage/ecmascript-string-left-right-trim\nrequire('./_string-trim')('trimRight', function ($trim) {\n return function trimRight() {\n return $trim(this, 2);\n };\n}, 'trimEnd');\n","require('./_wks-define')('asyncIterator');\n","require('./_wks-define')('observable');\n","// https://github.com/tc39/proposal-global\nvar $export = require('./_export');\n\n$export($export.S, 'System', { global: require('./_global') });\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-weakmap.from\nrequire('./_set-collection-from')('WeakMap');\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-weakmap.of\nrequire('./_set-collection-of')('WeakMap');\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-weakset.from\nrequire('./_set-collection-from')('WeakSet');\n","// https://tc39.github.io/proposal-setmap-offrom/#sec-weakset.of\nrequire('./_set-collection-of')('WeakSet');\n","var $iterators = require('./es6.array.iterator');\nvar getKeys = require('./_object-keys');\nvar redefine = require('./_redefine');\nvar global = require('./_global');\nvar hide = require('./_hide');\nvar Iterators = require('./_iterators');\nvar wks = require('./_wks');\nvar ITERATOR = wks('iterator');\nvar TO_STRING_TAG = wks('toStringTag');\nvar ArrayValues = Iterators.Array;\n\nvar DOMIterables = {\n CSSRuleList: true, // TODO: Not spec compliant, should be false.\n CSSStyleDeclaration: false,\n CSSValueList: false,\n ClientRectList: false,\n DOMRectList: false,\n DOMStringList: false,\n DOMTokenList: true,\n DataTransferItemList: false,\n FileList: false,\n HTMLAllCollection: false,\n HTMLCollection: false,\n HTMLFormElement: false,\n HTMLSelectElement: false,\n MediaList: true, // TODO: Not spec compliant, should be false.\n MimeTypeArray: false,\n NamedNodeMap: false,\n NodeList: true,\n PaintRequestList: false,\n Plugin: false,\n PluginArray: false,\n SVGLengthList: false,\n SVGNumberList: false,\n SVGPathSegList: false,\n SVGPointList: false,\n SVGStringList: false,\n SVGTransformList: false,\n SourceBufferList: false,\n StyleSheetList: true, // TODO: Not spec compliant, should be false.\n TextTrackCueList: false,\n TextTrackList: false,\n TouchList: false\n};\n\nfor (var collections = getKeys(DOMIterables), i = 0; i < collections.length; i++) {\n var NAME = collections[i];\n var explicit = DOMIterables[NAME];\n var Collection = global[NAME];\n var proto = Collection && Collection.prototype;\n var key;\n if (proto) {\n if (!proto[ITERATOR]) hide(proto, ITERATOR, ArrayValues);\n if (!proto[TO_STRING_TAG]) hide(proto, TO_STRING_TAG, NAME);\n Iterators[NAME] = ArrayValues;\n if (explicit) for (key in $iterators) if (!proto[key]) redefine(proto, key, $iterators[key], true);\n }\n}\n","var $export = require('./_export');\nvar $task = require('./_task');\n$export($export.G + $export.B, {\n setImmediate: $task.set,\n clearImmediate: $task.clear\n});\n","// ie9- setTimeout & setInterval additional parameters fix\nvar global = require('./_global');\nvar $export = require('./_export');\nvar navigator = global.navigator;\nvar slice = [].slice;\nvar MSIE = !!navigator && /MSIE .\\./.test(navigator.userAgent); // <- dirty ie9- check\nvar wrap = function (set) {\n return function (fn, time /* , ...args */) {\n var boundArgs = arguments.length > 2;\n var args = boundArgs ? slice.call(arguments, 2) : false;\n return set(boundArgs ? function () {\n // eslint-disable-next-line no-new-func\n (typeof fn == 'function' ? fn : Function(fn)).apply(this, args);\n } : fn, time);\n };\n};\n$export($export.G + $export.B + $export.F * MSIE, {\n setTimeout: wrap(global.setTimeout),\n setInterval: wrap(global.setInterval)\n});\n","require('./modules/es6.symbol');\nrequire('./modules/es6.object.create');\nrequire('./modules/es6.object.define-property');\nrequire('./modules/es6.object.define-properties');\nrequire('./modules/es6.object.get-own-property-descriptor');\nrequire('./modules/es6.object.get-prototype-of');\nrequire('./modules/es6.object.keys');\nrequire('./modules/es6.object.get-own-property-names');\nrequire('./modules/es6.object.freeze');\nrequire('./modules/es6.object.seal');\nrequire('./modules/es6.object.prevent-extensions');\nrequire('./modules/es6.object.is-frozen');\nrequire('./modules/es6.object.is-sealed');\nrequire('./modules/es6.object.is-extensible');\nrequire('./modules/es6.object.assign');\nrequire('./modules/es6.object.is');\nrequire('./modules/es6.object.set-prototype-of');\nrequire('./modules/es6.object.to-string');\nrequire('./modules/es6.function.bind');\nrequire('./modules/es6.function.name');\nrequire('./modules/es6.function.has-instance');\nrequire('./modules/es6.parse-int');\nrequire('./modules/es6.parse-float');\nrequire('./modules/es6.number.constructor');\nrequire('./modules/es6.number.to-fixed');\nrequire('./modules/es6.number.to-precision');\nrequire('./modules/es6.number.epsilon');\nrequire('./modules/es6.number.is-finite');\nrequire('./modules/es6.number.is-integer');\nrequire('./modules/es6.number.is-nan');\nrequire('./modules/es6.number.is-safe-integer');\nrequire('./modules/es6.number.max-safe-integer');\nrequire('./modules/es6.number.min-safe-integer');\nrequire('./modules/es6.number.parse-float');\nrequire('./modules/es6.number.parse-int');\nrequire('./modules/es6.math.acosh');\nrequire('./modules/es6.math.asinh');\nrequire('./modules/es6.math.atanh');\nrequire('./modules/es6.math.cbrt');\nrequire('./modules/es6.math.clz32');\nrequire('./modules/es6.math.cosh');\nrequire('./modules/es6.math.expm1');\nrequire('./modules/es6.math.fround');\nrequire('./modules/es6.math.hypot');\nrequire('./modules/es6.math.imul');\nrequire('./modules/es6.math.log10');\nrequire('./modules/es6.math.log1p');\nrequire('./modules/es6.math.log2');\nrequire('./modules/es6.math.sign');\nrequire('./modules/es6.math.sinh');\nrequire('./modules/es6.math.tanh');\nrequire('./modules/es6.math.trunc');\nrequire('./modules/es6.string.from-code-point');\nrequire('./modules/es6.string.raw');\nrequire('./modules/es6.string.trim');\nrequire('./modules/es6.string.iterator');\nrequire('./modules/es6.string.code-point-at');\nrequire('./modules/es6.string.ends-with');\nrequire('./modules/es6.string.includes');\nrequire('./modules/es6.string.repeat');\nrequire('./modules/es6.string.starts-with');\nrequire('./modules/es6.string.anchor');\nrequire('./modules/es6.string.big');\nrequire('./modules/es6.string.blink');\nrequire('./modules/es6.string.bold');\nrequire('./modules/es6.string.fixed');\nrequire('./modules/es6.string.fontcolor');\nrequire('./modules/es6.string.fontsize');\nrequire('./modules/es6.string.italics');\nrequire('./modules/es6.string.link');\nrequire('./modules/es6.string.small');\nrequire('./modules/es6.string.strike');\nrequire('./modules/es6.string.sub');\nrequire('./modules/es6.string.sup');\nrequire('./modules/es6.date.now');\nrequire('./modules/es6.date.to-json');\nrequire('./modules/es6.date.to-iso-string');\nrequire('./modules/es6.date.to-string');\nrequire('./modules/es6.date.to-primitive');\nrequire('./modules/es6.array.is-array');\nrequire('./modules/es6.array.from');\nrequire('./modules/es6.array.of');\nrequire('./modules/es6.array.join');\nrequire('./modules/es6.array.slice');\nrequire('./modules/es6.array.sort');\nrequire('./modules/es6.array.for-each');\nrequire('./modules/es6.array.map');\nrequire('./modules/es6.array.filter');\nrequire('./modules/es6.array.some');\nrequire('./modules/es6.array.every');\nrequire('./modules/es6.array.reduce');\nrequire('./modules/es6.array.reduce-right');\nrequire('./modules/es6.array.index-of');\nrequire('./modules/es6.array.last-index-of');\nrequire('./modules/es6.array.copy-within');\nrequire('./modules/es6.array.fill');\nrequire('./modules/es6.array.find');\nrequire('./modules/es6.array.find-index');\nrequire('./modules/es6.array.species');\nrequire('./modules/es6.array.iterator');\nrequire('./modules/es6.regexp.constructor');\nrequire('./modules/es6.regexp.to-string');\nrequire('./modules/es6.regexp.flags');\nrequire('./modules/es6.regexp.match');\nrequire('./modules/es6.regexp.replace');\nrequire('./modules/es6.regexp.search');\nrequire('./modules/es6.regexp.split');\nrequire('./modules/es6.promise');\nrequire('./modules/es6.map');\nrequire('./modules/es6.set');\nrequire('./modules/es6.weak-map');\nrequire('./modules/es6.weak-set');\nrequire('./modules/es6.typed.array-buffer');\nrequire('./modules/es6.typed.data-view');\nrequire('./modules/es6.typed.int8-array');\nrequire('./modules/es6.typed.uint8-array');\nrequire('./modules/es6.typed.uint8-clamped-array');\nrequire('./modules/es6.typed.int16-array');\nrequire('./modules/es6.typed.uint16-array');\nrequire('./modules/es6.typed.int32-array');\nrequire('./modules/es6.typed.uint32-array');\nrequire('./modules/es6.typed.float32-array');\nrequire('./modules/es6.typed.float64-array');\nrequire('./modules/es6.reflect.apply');\nrequire('./modules/es6.reflect.construct');\nrequire('./modules/es6.reflect.define-property');\nrequire('./modules/es6.reflect.delete-property');\nrequire('./modules/es6.reflect.enumerate');\nrequire('./modules/es6.reflect.get');\nrequire('./modules/es6.reflect.get-own-property-descriptor');\nrequire('./modules/es6.reflect.get-prototype-of');\nrequire('./modules/es6.reflect.has');\nrequire('./modules/es6.reflect.is-extensible');\nrequire('./modules/es6.reflect.own-keys');\nrequire('./modules/es6.reflect.prevent-extensions');\nrequire('./modules/es6.reflect.set');\nrequire('./modules/es6.reflect.set-prototype-of');\nrequire('./modules/es7.array.includes');\nrequire('./modules/es7.array.flat-map');\nrequire('./modules/es7.array.flatten');\nrequire('./modules/es7.string.at');\nrequire('./modules/es7.string.pad-start');\nrequire('./modules/es7.string.pad-end');\nrequire('./modules/es7.string.trim-left');\nrequire('./modules/es7.string.trim-right');\nrequire('./modules/es7.string.match-all');\nrequire('./modules/es7.symbol.async-iterator');\nrequire('./modules/es7.symbol.observable');\nrequire('./modules/es7.object.get-own-property-descriptors');\nrequire('./modules/es7.object.values');\nrequire('./modules/es7.object.entries');\nrequire('./modules/es7.object.define-getter');\nrequire('./modules/es7.object.define-setter');\nrequire('./modules/es7.object.lookup-getter');\nrequire('./modules/es7.object.lookup-setter');\nrequire('./modules/es7.map.to-json');\nrequire('./modules/es7.set.to-json');\nrequire('./modules/es7.map.of');\nrequire('./modules/es7.set.of');\nrequire('./modules/es7.weak-map.of');\nrequire('./modules/es7.weak-set.of');\nrequire('./modules/es7.map.from');\nrequire('./modules/es7.set.from');\nrequire('./modules/es7.weak-map.from');\nrequire('./modules/es7.weak-set.from');\nrequire('./modules/es7.global');\nrequire('./modules/es7.system.global');\nrequire('./modules/es7.error.is-error');\nrequire('./modules/es7.math.clamp');\nrequire('./modules/es7.math.deg-per-rad');\nrequire('./modules/es7.math.degrees');\nrequire('./modules/es7.math.fscale');\nrequire('./modules/es7.math.iaddh');\nrequire('./modules/es7.math.isubh');\nrequire('./modules/es7.math.imulh');\nrequire('./modules/es7.math.rad-per-deg');\nrequire('./modules/es7.math.radians');\nrequire('./modules/es7.math.scale');\nrequire('./modules/es7.math.umulh');\nrequire('./modules/es7.math.signbit');\nrequire('./modules/es7.promise.finally');\nrequire('./modules/es7.promise.try');\nrequire('./modules/es7.reflect.define-metadata');\nrequire('./modules/es7.reflect.delete-metadata');\nrequire('./modules/es7.reflect.get-metadata');\nrequire('./modules/es7.reflect.get-metadata-keys');\nrequire('./modules/es7.reflect.get-own-metadata');\nrequire('./modules/es7.reflect.get-own-metadata-keys');\nrequire('./modules/es7.reflect.has-metadata');\nrequire('./modules/es7.reflect.has-own-metadata');\nrequire('./modules/es7.reflect.metadata');\nrequire('./modules/es7.asap');\nrequire('./modules/es7.observable');\nrequire('./modules/web.timers');\nrequire('./modules/web.immediate');\nrequire('./modules/web.dom.iterable');\nmodule.exports = require('./modules/_core');\n","/*!\n * @overview es6-promise - a tiny implementation of Promises/A+.\n * @copyright Copyright (c) 2014 Yehuda Katz, Tom Dale, Stefan Penner and contributors (Conversion to ES6 API by Jake Archibald)\n * @license Licensed under MIT license\n * See https://raw.githubusercontent.com/jakearchibald/es6-promise/master/LICENSE\n * @version 3.0.2\n */\n\n(function() {\n \"use strict\";\n function lib$es6$promise$utils$$objectOrFunction(x) {\n return typeof x === 'function' || (typeof x === 'object' && x !== null);\n }\n\n function lib$es6$promise$utils$$isFunction(x) {\n return typeof x === 'function';\n }\n\n function lib$es6$promise$utils$$isMaybeThenable(x) {\n return typeof x === 'object' && x !== null;\n }\n\n var lib$es6$promise$utils$$_isArray;\n if (!Array.isArray) {\n lib$es6$promise$utils$$_isArray = function (x) {\n return Object.prototype.toString.call(x) === '[object Array]';\n };\n } else {\n lib$es6$promise$utils$$_isArray = Array.isArray;\n }\n\n var lib$es6$promise$utils$$isArray = lib$es6$promise$utils$$_isArray;\n var lib$es6$promise$asap$$len = 0;\n var lib$es6$promise$asap$$toString = {}.toString;\n var lib$es6$promise$asap$$vertxNext;\n var lib$es6$promise$asap$$customSchedulerFn;\n\n var lib$es6$promise$asap$$asap = function asap(callback, arg) {\n lib$es6$promise$asap$$queue[lib$es6$promise$asap$$len] = callback;\n lib$es6$promise$asap$$queue[lib$es6$promise$asap$$len + 1] = arg;\n lib$es6$promise$asap$$len += 2;\n if (lib$es6$promise$asap$$len === 2) {\n // If len is 2, that means that we need to schedule an async flush.\n // If additional callbacks are queued before the queue is flushed, they\n // will be processed by this flush that we are scheduling.\n if (lib$es6$promise$asap$$customSchedulerFn) {\n lib$es6$promise$asap$$customSchedulerFn(lib$es6$promise$asap$$flush);\n } else {\n lib$es6$promise$asap$$scheduleFlush();\n }\n }\n }\n\n function lib$es6$promise$asap$$setScheduler(scheduleFn) {\n lib$es6$promise$asap$$customSchedulerFn = scheduleFn;\n }\n\n function lib$es6$promise$asap$$setAsap(asapFn) {\n lib$es6$promise$asap$$asap = asapFn;\n }\n\n var lib$es6$promise$asap$$browserWindow = (typeof window !== 'undefined') ? window : undefined;\n var lib$es6$promise$asap$$browserGlobal = lib$es6$promise$asap$$browserWindow || {};\n var lib$es6$promise$asap$$BrowserMutationObserver = lib$es6$promise$asap$$browserGlobal.MutationObserver || lib$es6$promise$asap$$browserGlobal.WebKitMutationObserver;\n var lib$es6$promise$asap$$isNode = typeof process !== 'undefined' && {}.toString.call(process) === '[object process]';\n\n // test for web worker but not in IE10\n var lib$es6$promise$asap$$isWorker = typeof Uint8ClampedArray !== 'undefined' &&\n typeof importScripts !== 'undefined' &&\n typeof MessageChannel !== 'undefined';\n\n // node\n function lib$es6$promise$asap$$useNextTick() {\n // node version 0.10.x displays a deprecation warning when nextTick is used recursively\n // see https://github.com/cujojs/when/issues/410 for details\n return function() {\n process.nextTick(lib$es6$promise$asap$$flush);\n };\n }\n\n // vertx\n function lib$es6$promise$asap$$useVertxTimer() {\n return function() {\n lib$es6$promise$asap$$vertxNext(lib$es6$promise$asap$$flush);\n };\n }\n\n function lib$es6$promise$asap$$useMutationObserver() {\n var iterations = 0;\n var observer = new lib$es6$promise$asap$$BrowserMutationObserver(lib$es6$promise$asap$$flush);\n var node = document.createTextNode('');\n observer.observe(node, { characterData: true });\n\n return function() {\n node.data = (iterations = ++iterations % 2);\n };\n }\n\n // web worker\n function lib$es6$promise$asap$$useMessageChannel() {\n var channel = new MessageChannel();\n channel.port1.onmessage = lib$es6$promise$asap$$flush;\n return function () {\n channel.port2.postMessage(0);\n };\n }\n\n function lib$es6$promise$asap$$useSetTimeout() {\n return function() {\n setTimeout(lib$es6$promise$asap$$flush, 1);\n };\n }\n\n var lib$es6$promise$asap$$queue = new Array(1000);\n function lib$es6$promise$asap$$flush() {\n for (var i = 0; i < lib$es6$promise$asap$$len; i+=2) {\n var callback = lib$es6$promise$asap$$queue[i];\n var arg = lib$es6$promise$asap$$queue[i+1];\n\n callback(arg);\n\n lib$es6$promise$asap$$queue[i] = undefined;\n lib$es6$promise$asap$$queue[i+1] = undefined;\n }\n\n lib$es6$promise$asap$$len = 0;\n }\n\n function lib$es6$promise$asap$$attemptVertx() {\n try {\n var r = require;\n var vertx = r('vertx');\n lib$es6$promise$asap$$vertxNext = vertx.runOnLoop || vertx.runOnContext;\n return lib$es6$promise$asap$$useVertxTimer();\n } catch(e) {\n return lib$es6$promise$asap$$useSetTimeout();\n }\n }\n\n var lib$es6$promise$asap$$scheduleFlush;\n // Decide what async method to use to triggering processing of queued callbacks:\n if (lib$es6$promise$asap$$isNode) {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useNextTick();\n } else if (lib$es6$promise$asap$$BrowserMutationObserver) {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useMutationObserver();\n } else if (lib$es6$promise$asap$$isWorker) {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useMessageChannel();\n } else if (lib$es6$promise$asap$$browserWindow === undefined && typeof require === 'function') {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$attemptVertx();\n } else {\n lib$es6$promise$asap$$scheduleFlush = lib$es6$promise$asap$$useSetTimeout();\n }\n\n function lib$es6$promise$$internal$$noop() {}\n\n var lib$es6$promise$$internal$$PENDING = void 0;\n var lib$es6$promise$$internal$$FULFILLED = 1;\n var lib$es6$promise$$internal$$REJECTED = 2;\n\n var lib$es6$promise$$internal$$GET_THEN_ERROR = new lib$es6$promise$$internal$$ErrorObject();\n\n function lib$es6$promise$$internal$$selfFulfillment() {\n return new TypeError(\"You cannot resolve a promise with itself\");\n }\n\n function lib$es6$promise$$internal$$cannotReturnOwn() {\n return new TypeError('A promises callback cannot return that same promise.');\n }\n\n function lib$es6$promise$$internal$$getThen(promise) {\n try {\n return promise.then;\n } catch(error) {\n lib$es6$promise$$internal$$GET_THEN_ERROR.error = error;\n return lib$es6$promise$$internal$$GET_THEN_ERROR;\n }\n }\n\n function lib$es6$promise$$internal$$tryThen(then, value, fulfillmentHandler, rejectionHandler) {\n try {\n then.call(value, fulfillmentHandler, rejectionHandler);\n } catch(e) {\n return e;\n }\n }\n\n function lib$es6$promise$$internal$$handleForeignThenable(promise, thenable, then) {\n lib$es6$promise$asap$$asap(function(promise) {\n var sealed = false;\n var error = lib$es6$promise$$internal$$tryThen(then, thenable, function(value) {\n if (sealed) { return; }\n sealed = true;\n if (thenable !== value) {\n lib$es6$promise$$internal$$resolve(promise, value);\n } else {\n lib$es6$promise$$internal$$fulfill(promise, value);\n }\n }, function(reason) {\n if (sealed) { return; }\n sealed = true;\n\n lib$es6$promise$$internal$$reject(promise, reason);\n }, 'Settle: ' + (promise._label || ' unknown promise'));\n\n if (!sealed && error) {\n sealed = true;\n lib$es6$promise$$internal$$reject(promise, error);\n }\n }, promise);\n }\n\n function lib$es6$promise$$internal$$handleOwnThenable(promise, thenable) {\n if (thenable._state === lib$es6$promise$$internal$$FULFILLED) {\n lib$es6$promise$$internal$$fulfill(promise, thenable._result);\n } else if (thenable._state === lib$es6$promise$$internal$$REJECTED) {\n lib$es6$promise$$internal$$reject(promise, thenable._result);\n } else {\n lib$es6$promise$$internal$$subscribe(thenable, undefined, function(value) {\n lib$es6$promise$$internal$$resolve(promise, value);\n }, function(reason) {\n lib$es6$promise$$internal$$reject(promise, reason);\n });\n }\n }\n\n function lib$es6$promise$$internal$$handleMaybeThenable(promise, maybeThenable) {\n if (maybeThenable.constructor === promise.constructor) {\n lib$es6$promise$$internal$$handleOwnThenable(promise, maybeThenable);\n } else {\n var then = lib$es6$promise$$internal$$getThen(maybeThenable);\n\n if (then === lib$es6$promise$$internal$$GET_THEN_ERROR) {\n lib$es6$promise$$internal$$reject(promise, lib$es6$promise$$internal$$GET_THEN_ERROR.error);\n } else if (then === undefined) {\n lib$es6$promise$$internal$$fulfill(promise, maybeThenable);\n } else if (lib$es6$promise$utils$$isFunction(then)) {\n lib$es6$promise$$internal$$handleForeignThenable(promise, maybeThenable, then);\n } else {\n lib$es6$promise$$internal$$fulfill(promise, maybeThenable);\n }\n }\n }\n\n function lib$es6$promise$$internal$$resolve(promise, value) {\n if (promise === value) {\n lib$es6$promise$$internal$$reject(promise, lib$es6$promise$$internal$$selfFulfillment());\n } else if (lib$es6$promise$utils$$objectOrFunction(value)) {\n lib$es6$promise$$internal$$handleMaybeThenable(promise, value);\n } else {\n lib$es6$promise$$internal$$fulfill(promise, value);\n }\n }\n\n function lib$es6$promise$$internal$$publishRejection(promise) {\n if (promise._onerror) {\n promise._onerror(promise._result);\n }\n\n lib$es6$promise$$internal$$publish(promise);\n }\n\n function lib$es6$promise$$internal$$fulfill(promise, value) {\n if (promise._state !== lib$es6$promise$$internal$$PENDING) { return; }\n\n promise._result = value;\n promise._state = lib$es6$promise$$internal$$FULFILLED;\n\n if (promise._subscribers.length !== 0) {\n lib$es6$promise$asap$$asap(lib$es6$promise$$internal$$publish, promise);\n }\n }\n\n function lib$es6$promise$$internal$$reject(promise, reason) {\n if (promise._state !== lib$es6$promise$$internal$$PENDING) { return; }\n promise._state = lib$es6$promise$$internal$$REJECTED;\n promise._result = reason;\n\n lib$es6$promise$asap$$asap(lib$es6$promise$$internal$$publishRejection, promise);\n }\n\n function lib$es6$promise$$internal$$subscribe(parent, child, onFulfillment, onRejection) {\n var subscribers = parent._subscribers;\n var length = subscribers.length;\n\n parent._onerror = null;\n\n subscribers[length] = child;\n subscribers[length + lib$es6$promise$$internal$$FULFILLED] = onFulfillment;\n subscribers[length + lib$es6$promise$$internal$$REJECTED] = onRejection;\n\n if (length === 0 && parent._state) {\n lib$es6$promise$asap$$asap(lib$es6$promise$$internal$$publish, parent);\n }\n }\n\n function lib$es6$promise$$internal$$publish(promise) {\n var subscribers = promise._subscribers;\n var settled = promise._state;\n\n if (subscribers.length === 0) { return; }\n\n var child, callback, detail = promise._result;\n\n for (var i = 0; i < subscribers.length; i += 3) {\n child = subscribers[i];\n callback = subscribers[i + settled];\n\n if (child) {\n lib$es6$promise$$internal$$invokeCallback(settled, child, callback, detail);\n } else {\n callback(detail);\n }\n }\n\n promise._subscribers.length = 0;\n }\n\n function lib$es6$promise$$internal$$ErrorObject() {\n this.error = null;\n }\n\n var lib$es6$promise$$internal$$TRY_CATCH_ERROR = new lib$es6$promise$$internal$$ErrorObject();\n\n function lib$es6$promise$$internal$$tryCatch(callback, detail) {\n try {\n return callback(detail);\n } catch(e) {\n lib$es6$promise$$internal$$TRY_CATCH_ERROR.error = e;\n return lib$es6$promise$$internal$$TRY_CATCH_ERROR;\n }\n }\n\n function lib$es6$promise$$internal$$invokeCallback(settled, promise, callback, detail) {\n var hasCallback = lib$es6$promise$utils$$isFunction(callback),\n value, error, succeeded, failed;\n\n if (hasCallback) {\n value = lib$es6$promise$$internal$$tryCatch(callback, detail);\n\n if (value === lib$es6$promise$$internal$$TRY_CATCH_ERROR) {\n failed = true;\n error = value.error;\n value = null;\n } else {\n succeeded = true;\n }\n\n if (promise === value) {\n lib$es6$promise$$internal$$reject(promise, lib$es6$promise$$internal$$cannotReturnOwn());\n return;\n }\n\n } else {\n value = detail;\n succeeded = true;\n }\n\n if (promise._state !== lib$es6$promise$$internal$$PENDING) {\n // noop\n } else if (hasCallback && succeeded) {\n lib$es6$promise$$internal$$resolve(promise, value);\n } else if (failed) {\n lib$es6$promise$$internal$$reject(promise, error);\n } else if (settled === lib$es6$promise$$internal$$FULFILLED) {\n lib$es6$promise$$internal$$fulfill(promise, value);\n } else if (settled === lib$es6$promise$$internal$$REJECTED) {\n lib$es6$promise$$internal$$reject(promise, value);\n }\n }\n\n function lib$es6$promise$$internal$$initializePromise(promise, resolver) {\n try {\n resolver(function resolvePromise(value){\n lib$es6$promise$$internal$$resolve(promise, value);\n }, function rejectPromise(reason) {\n lib$es6$promise$$internal$$reject(promise, reason);\n });\n } catch(e) {\n lib$es6$promise$$internal$$reject(promise, e);\n }\n }\n\n function lib$es6$promise$enumerator$$Enumerator(Constructor, input) {\n var enumerator = this;\n\n enumerator._instanceConstructor = Constructor;\n enumerator.promise = new Constructor(lib$es6$promise$$internal$$noop);\n\n if (enumerator._validateInput(input)) {\n enumerator._input = input;\n enumerator.length = input.length;\n enumerator._remaining = input.length;\n\n enumerator._init();\n\n if (enumerator.length === 0) {\n lib$es6$promise$$internal$$fulfill(enumerator.promise, enumerator._result);\n } else {\n enumerator.length = enumerator.length || 0;\n enumerator._enumerate();\n if (enumerator._remaining === 0) {\n lib$es6$promise$$internal$$fulfill(enumerator.promise, enumerator._result);\n }\n }\n } else {\n lib$es6$promise$$internal$$reject(enumerator.promise, enumerator._validationError());\n }\n }\n\n lib$es6$promise$enumerator$$Enumerator.prototype._validateInput = function(input) {\n return lib$es6$promise$utils$$isArray(input);\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._validationError = function() {\n return new Error('Array Methods must be provided an Array');\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._init = function() {\n this._result = new Array(this.length);\n };\n\n var lib$es6$promise$enumerator$$default = lib$es6$promise$enumerator$$Enumerator;\n\n lib$es6$promise$enumerator$$Enumerator.prototype._enumerate = function() {\n var enumerator = this;\n\n var length = enumerator.length;\n var promise = enumerator.promise;\n var input = enumerator._input;\n\n for (var i = 0; promise._state === lib$es6$promise$$internal$$PENDING && i < length; i++) {\n enumerator._eachEntry(input[i], i);\n }\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._eachEntry = function(entry, i) {\n var enumerator = this;\n var c = enumerator._instanceConstructor;\n\n if (lib$es6$promise$utils$$isMaybeThenable(entry)) {\n if (entry.constructor === c && entry._state !== lib$es6$promise$$internal$$PENDING) {\n entry._onerror = null;\n enumerator._settledAt(entry._state, i, entry._result);\n } else {\n enumerator._willSettleAt(c.resolve(entry), i);\n }\n } else {\n enumerator._remaining--;\n enumerator._result[i] = entry;\n }\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._settledAt = function(state, i, value) {\n var enumerator = this;\n var promise = enumerator.promise;\n\n if (promise._state === lib$es6$promise$$internal$$PENDING) {\n enumerator._remaining--;\n\n if (state === lib$es6$promise$$internal$$REJECTED) {\n lib$es6$promise$$internal$$reject(promise, value);\n } else {\n enumerator._result[i] = value;\n }\n }\n\n if (enumerator._remaining === 0) {\n lib$es6$promise$$internal$$fulfill(promise, enumerator._result);\n }\n };\n\n lib$es6$promise$enumerator$$Enumerator.prototype._willSettleAt = function(promise, i) {\n var enumerator = this;\n\n lib$es6$promise$$internal$$subscribe(promise, undefined, function(value) {\n enumerator._settledAt(lib$es6$promise$$internal$$FULFILLED, i, value);\n }, function(reason) {\n enumerator._settledAt(lib$es6$promise$$internal$$REJECTED, i, reason);\n });\n };\n function lib$es6$promise$promise$all$$all(entries) {\n return new lib$es6$promise$enumerator$$default(this, entries).promise;\n }\n var lib$es6$promise$promise$all$$default = lib$es6$promise$promise$all$$all;\n function lib$es6$promise$promise$race$$race(entries) {\n /*jshint validthis:true */\n var Constructor = this;\n\n var promise = new Constructor(lib$es6$promise$$internal$$noop);\n\n if (!lib$es6$promise$utils$$isArray(entries)) {\n lib$es6$promise$$internal$$reject(promise, new TypeError('You must pass an array to race.'));\n return promise;\n }\n\n var length = entries.length;\n\n function onFulfillment(value) {\n lib$es6$promise$$internal$$resolve(promise, value);\n }\n\n function onRejection(reason) {\n lib$es6$promise$$internal$$reject(promise, reason);\n }\n\n for (var i = 0; promise._state === lib$es6$promise$$internal$$PENDING && i < length; i++) {\n lib$es6$promise$$internal$$subscribe(Constructor.resolve(entries[i]), undefined, onFulfillment, onRejection);\n }\n\n return promise;\n }\n var lib$es6$promise$promise$race$$default = lib$es6$promise$promise$race$$race;\n function lib$es6$promise$promise$resolve$$resolve(object) {\n /*jshint validthis:true */\n var Constructor = this;\n\n if (object && typeof object === 'object' && object.constructor === Constructor) {\n return object;\n }\n\n var promise = new Constructor(lib$es6$promise$$internal$$noop);\n lib$es6$promise$$internal$$resolve(promise, object);\n return promise;\n }\n var lib$es6$promise$promise$resolve$$default = lib$es6$promise$promise$resolve$$resolve;\n function lib$es6$promise$promise$reject$$reject(reason) {\n /*jshint validthis:true */\n var Constructor = this;\n var promise = new Constructor(lib$es6$promise$$internal$$noop);\n lib$es6$promise$$internal$$reject(promise, reason);\n return promise;\n }\n var lib$es6$promise$promise$reject$$default = lib$es6$promise$promise$reject$$reject;\n\n var lib$es6$promise$promise$$counter = 0;\n\n function lib$es6$promise$promise$$needsResolver() {\n throw new TypeError('You must pass a resolver function as the first argument to the promise constructor');\n }\n\n function lib$es6$promise$promise$$needsNew() {\n throw new TypeError(\"Failed to construct 'Promise': Please use the 'new' operator, this object constructor cannot be called as a function.\");\n }\n\n var lib$es6$promise$promise$$default = lib$es6$promise$promise$$Promise;\n /**\n Promise objects represent the eventual result of an asynchronous operation. The\n primary way of interacting with a promise is through its `then` method, which\n registers callbacks to receive either a promise's eventual value or the reason\n why the promise cannot be fulfilled.\n\n Terminology\n -----------\n\n - `promise` is an object or function with a `then` method whose behavior conforms to this specification.\n - `thenable` is an object or function that defines a `then` method.\n - `value` is any legal JavaScript value (including undefined, a thenable, or a promise).\n - `exception` is a value that is thrown using the throw statement.\n - `reason` is a value that indicates why a promise was rejected.\n - `settled` the final resting state of a promise, fulfilled or rejected.\n\n A promise can be in one of three states: pending, fulfilled, or rejected.\n\n Promises that are fulfilled have a fulfillment value and are in the fulfilled\n state. Promises that are rejected have a rejection reason and are in the\n rejected state. A fulfillment value is never a thenable.\n\n Promises can also be said to *resolve* a value. If this value is also a\n promise, then the original promise's settled state will match the value's\n settled state. So a promise that *resolves* a promise that rejects will\n itself reject, and a promise that *resolves* a promise that fulfills will\n itself fulfill.\n\n\n Basic Usage:\n ------------\n\n ```js\n var promise = new Promise(function(resolve, reject) {\n // on success\n resolve(value);\n\n // on failure\n reject(reason);\n });\n\n promise.then(function(value) {\n // on fulfillment\n }, function(reason) {\n // on rejection\n });\n ```\n\n Advanced Usage:\n ---------------\n\n Promises shine when abstracting away asynchronous interactions such as\n `XMLHttpRequest`s.\n\n ```js\n function getJSON(url) {\n return new Promise(function(resolve, reject){\n var xhr = new XMLHttpRequest();\n\n xhr.open('GET', url);\n xhr.onreadystatechange = handler;\n xhr.responseType = 'json';\n xhr.setRequestHeader('Accept', 'application/json');\n xhr.send();\n\n function handler() {\n if (this.readyState === this.DONE) {\n if (this.status === 200) {\n resolve(this.response);\n } else {\n reject(new Error('getJSON: `' + url + '` failed with status: [' + this.status + ']'));\n }\n }\n };\n });\n }\n\n getJSON('/posts.json').then(function(json) {\n // on fulfillment\n }, function(reason) {\n // on rejection\n });\n ```\n\n Unlike callbacks, promises are great composable primitives.\n\n ```js\n Promise.all([\n getJSON('/posts'),\n getJSON('/comments')\n ]).then(function(values){\n values[0] // => postsJSON\n values[1] // => commentsJSON\n\n return values;\n });\n ```\n\n @class Promise\n @param {function} resolver\n Useful for tooling.\n @constructor\n */\n function lib$es6$promise$promise$$Promise(resolver) {\n this._id = lib$es6$promise$promise$$counter++;\n this._state = undefined;\n this._result = undefined;\n this._subscribers = [];\n\n if (lib$es6$promise$$internal$$noop !== resolver) {\n if (!lib$es6$promise$utils$$isFunction(resolver)) {\n lib$es6$promise$promise$$needsResolver();\n }\n\n if (!(this instanceof lib$es6$promise$promise$$Promise)) {\n lib$es6$promise$promise$$needsNew();\n }\n\n lib$es6$promise$$internal$$initializePromise(this, resolver);\n }\n }\n\n lib$es6$promise$promise$$Promise.all = lib$es6$promise$promise$all$$default;\n lib$es6$promise$promise$$Promise.race = lib$es6$promise$promise$race$$default;\n lib$es6$promise$promise$$Promise.resolve = lib$es6$promise$promise$resolve$$default;\n lib$es6$promise$promise$$Promise.reject = lib$es6$promise$promise$reject$$default;\n lib$es6$promise$promise$$Promise._setScheduler = lib$es6$promise$asap$$setScheduler;\n lib$es6$promise$promise$$Promise._setAsap = lib$es6$promise$asap$$setAsap;\n lib$es6$promise$promise$$Promise._asap = lib$es6$promise$asap$$asap;\n\n lib$es6$promise$promise$$Promise.prototype = {\n constructor: lib$es6$promise$promise$$Promise,\n\n /**\n The primary way of interacting with a promise is through its `then` method,\n which registers callbacks to receive either a promise's eventual value or the\n reason why the promise cannot be fulfilled.\n\n ```js\n findUser().then(function(user){\n // user is available\n }, function(reason){\n // user is unavailable, and you are given the reason why\n });\n ```\n\n Chaining\n --------\n\n The return value of `then` is itself a promise. This second, 'downstream'\n promise is resolved with the return value of the first promise's fulfillment\n or rejection handler, or rejected if the handler throws an exception.\n\n ```js\n findUser().then(function (user) {\n return user.name;\n }, function (reason) {\n return 'default name';\n }).then(function (userName) {\n // If `findUser` fulfilled, `userName` will be the user's name, otherwise it\n // will be `'default name'`\n });\n\n findUser().then(function (user) {\n throw new Error('Found user, but still unhappy');\n }, function (reason) {\n throw new Error('`findUser` rejected and we're unhappy');\n }).then(function (value) {\n // never reached\n }, function (reason) {\n // if `findUser` fulfilled, `reason` will be 'Found user, but still unhappy'.\n // If `findUser` rejected, `reason` will be '`findUser` rejected and we're unhappy'.\n });\n ```\n If the downstream promise does not specify a rejection handler, rejection reasons will be propagated further downstream.\n\n ```js\n findUser().then(function (user) {\n throw new PedagogicalException('Upstream error');\n }).then(function (value) {\n // never reached\n }).then(function (value) {\n // never reached\n }, function (reason) {\n // The `PedgagocialException` is propagated all the way down to here\n });\n ```\n\n Assimilation\n ------------\n\n Sometimes the value you want to propagate to a downstream promise can only be\n retrieved asynchronously. This can be achieved by returning a promise in the\n fulfillment or rejection handler. The downstream promise will then be pending\n until the returned promise is settled. This is called *assimilation*.\n\n ```js\n findUser().then(function (user) {\n return findCommentsByAuthor(user);\n }).then(function (comments) {\n // The user's comments are now available\n });\n ```\n\n If the assimliated promise rejects, then the downstream promise will also reject.\n\n ```js\n findUser().then(function (user) {\n return findCommentsByAuthor(user);\n }).then(function (comments) {\n // If `findCommentsByAuthor` fulfills, we'll have the value here\n }, function (reason) {\n // If `findCommentsByAuthor` rejects, we'll have the reason here\n });\n ```\n\n Simple Example\n --------------\n\n Synchronous Example\n\n ```javascript\n var result;\n\n try {\n result = findResult();\n // success\n } catch(reason) {\n // failure\n }\n ```\n\n Errback Example\n\n ```js\n findResult(function(result, err){\n if (err) {\n // failure\n } else {\n // success\n }\n });\n ```\n\n Promise Example;\n\n ```javascript\n findResult().then(function(result){\n // success\n }, function(reason){\n // failure\n });\n ```\n\n Advanced Example\n --------------\n\n Synchronous Example\n\n ```javascript\n var author, books;\n\n try {\n author = findAuthor();\n books = findBooksByAuthor(author);\n // success\n } catch(reason) {\n // failure\n }\n ```\n\n Errback Example\n\n ```js\n\n function foundBooks(books) {\n\n }\n\n function failure(reason) {\n\n }\n\n findAuthor(function(author, err){\n if (err) {\n failure(err);\n // failure\n } else {\n try {\n findBoooksByAuthor(author, function(books, err) {\n if (err) {\n failure(err);\n } else {\n try {\n foundBooks(books);\n } catch(reason) {\n failure(reason);\n }\n }\n });\n } catch(error) {\n failure(err);\n }\n // success\n }\n });\n ```\n\n Promise Example;\n\n ```javascript\n findAuthor().\n then(findBooksByAuthor).\n then(function(books){\n // found books\n }).catch(function(reason){\n // something went wrong\n });\n ```\n\n @method then\n @param {Function} onFulfilled\n @param {Function} onRejected\n Useful for tooling.\n @return {Promise}\n */\n then: function(onFulfillment, onRejection) {\n var parent = this;\n var state = parent._state;\n\n if (state === lib$es6$promise$$internal$$FULFILLED && !onFulfillment || state === lib$es6$promise$$internal$$REJECTED && !onRejection) {\n return this;\n }\n\n var child = new this.constructor(lib$es6$promise$$internal$$noop);\n var result = parent._result;\n\n if (state) {\n var callback = arguments[state - 1];\n lib$es6$promise$asap$$asap(function(){\n lib$es6$promise$$internal$$invokeCallback(state, child, callback, result);\n });\n } else {\n lib$es6$promise$$internal$$subscribe(parent, child, onFulfillment, onRejection);\n }\n\n return child;\n },\n\n /**\n `catch` is simply sugar for `then(undefined, onRejection)` which makes it the same\n as the catch block of a try/catch statement.\n\n ```js\n function findAuthor(){\n throw new Error('couldn't find that author');\n }\n\n // synchronous\n try {\n findAuthor();\n } catch(reason) {\n // something went wrong\n }\n\n // async with promises\n findAuthor().catch(function(reason){\n // something went wrong\n });\n ```\n\n @method catch\n @param {Function} onRejection\n Useful for tooling.\n @return {Promise}\n */\n 'catch': function(onRejection) {\n return this.then(null, onRejection);\n }\n };\n function lib$es6$promise$polyfill$$polyfill() {\n var local;\n\n if (typeof global !== 'undefined') {\n local = global;\n } else if (typeof self !== 'undefined') {\n local = self;\n } else {\n try {\n local = Function('return this')();\n } catch (e) {\n throw new Error('polyfill failed because global object is unavailable in this environment');\n }\n }\n\n var P = local.Promise;\n\n if (P && Object.prototype.toString.call(P.resolve()) === '[object Promise]' && !P.cast) {\n return;\n }\n\n local.Promise = lib$es6$promise$promise$$default;\n }\n var lib$es6$promise$polyfill$$default = lib$es6$promise$polyfill$$polyfill;\n\n var lib$es6$promise$umd$$ES6Promise = {\n 'Promise': lib$es6$promise$promise$$default,\n 'polyfill': lib$es6$promise$polyfill$$default\n };\n\n /* global define:true module:true window: true */\n if (typeof define === 'function' && define['amd']) {\n define(function() { return lib$es6$promise$umd$$ES6Promise; });\n } else if (typeof module !== 'undefined' && module['exports']) {\n module['exports'] = lib$es6$promise$umd$$ES6Promise;\n } else if (typeof this !== 'undefined') {\n this['ES6Promise'] = lib$es6$promise$umd$$ES6Promise;\n }\n\n lib$es6$promise$polyfill$$default();\n}).call(this);\n\n","/* -*- mode: javascript; c-basic-offset: 4; indent-tabs-mode: nil -*- */\n\n// \n// Javascript ZLib\n// By Thomas Down 2010-2011\n//\n// Based very heavily on portions of jzlib (by [email protected] ), who in\n// turn credits Jean-loup Gailly and Mark Adler for the original zlib code.\n//\n// inflate.js: ZLib inflate code\n//\n\n//\n// Shared constants\n//\n\nvar MAX_WBITS=15; // 32K LZ77 window\nvar DEF_WBITS=MAX_WBITS;\nvar MAX_MEM_LEVEL=9;\nvar MANY=1440;\nvar BMAX = 15;\n\n// preset dictionary flag in zlib header\nvar PRESET_DICT=0x20;\n\nvar Z_NO_FLUSH=0;\nvar Z_PARTIAL_FLUSH=1;\nvar Z_SYNC_FLUSH=2;\nvar Z_FULL_FLUSH=3;\nvar Z_FINISH=4;\n\nvar Z_DEFLATED=8;\n\nvar Z_OK=0;\nvar Z_STREAM_END=1;\nvar Z_NEED_DICT=2;\nvar Z_ERRNO=-1;\nvar Z_STREAM_ERROR=-2;\nvar Z_DATA_ERROR=-3;\nvar Z_MEM_ERROR=-4;\nvar Z_BUF_ERROR=-5;\nvar Z_VERSION_ERROR=-6;\n\nvar METHOD=0; // waiting for method byte\nvar FLAG=1; // waiting for flag byte\nvar DICT4=2; // four dictionary check bytes to go\nvar DICT3=3; // three dictionary check bytes to go\nvar DICT2=4; // two dictionary check bytes to go\nvar DICT1=5; // one dictionary check byte to go\nvar DICT0=6; // waiting for inflateSetDictionary\nvar BLOCKS=7; // decompressing blocks\nvar CHECK4=8; // four check bytes to go\nvar CHECK3=9; // three check bytes to go\nvar CHECK2=10; // two check bytes to go\nvar CHECK1=11; // one check byte to go\nvar DONE=12; // finished check, done\nvar BAD=13; // got an error--stay here\n\nvar inflate_mask = [0x00000000, 0x00000001, 0x00000003, 0x00000007, 0x0000000f, 0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff, 0x000001ff, 0x000003ff, 0x000007ff, 0x00000fff, 0x00001fff, 0x00003fff, 0x00007fff, 0x0000ffff];\n\nvar IB_TYPE=0; // get type bits (3, including end bit)\nvar IB_LENS=1; // get lengths for stored\nvar IB_STORED=2;// processing stored block\nvar IB_TABLE=3; // get table lengths\nvar IB_BTREE=4; // get bit lengths tree for a dynamic block\nvar IB_DTREE=5; // get length, distance trees for a dynamic block\nvar IB_CODES=6; // processing fixed or dynamic block\nvar IB_DRY=7; // output remaining window bytes\nvar IB_DONE=8; // finished last block, done\nvar IB_BAD=9; // ot a data error--stuck here\n\nvar fixed_bl = 9;\nvar fixed_bd = 5;\n\nvar fixed_tl = [\n 96,7,256, 0,8,80, 0,8,16, 84,8,115,\n 82,7,31, 0,8,112, 0,8,48, 0,9,192,\n 80,7,10, 0,8,96, 0,8,32, 0,9,160,\n 0,8,0, 0,8,128, 0,8,64, 0,9,224,\n 80,7,6, 0,8,88, 0,8,24, 0,9,144,\n 83,7,59, 0,8,120, 0,8,56, 0,9,208,\n 81,7,17, 0,8,104, 0,8,40, 0,9,176,\n 0,8,8, 0,8,136, 0,8,72, 0,9,240,\n 80,7,4, 0,8,84, 0,8,20, 85,8,227,\n 83,7,43, 0,8,116, 0,8,52, 0,9,200,\n 81,7,13, 0,8,100, 0,8,36, 0,9,168,\n 0,8,4, 0,8,132, 0,8,68, 0,9,232,\n 80,7,8, 0,8,92, 0,8,28, 0,9,152,\n 84,7,83, 0,8,124, 0,8,60, 0,9,216,\n 82,7,23, 0,8,108, 0,8,44, 0,9,184,\n 0,8,12, 0,8,140, 0,8,76, 0,9,248,\n 80,7,3, 0,8,82, 0,8,18, 85,8,163,\n 83,7,35, 0,8,114, 0,8,50, 0,9,196,\n 81,7,11, 0,8,98, 0,8,34, 0,9,164,\n 0,8,2, 0,8,130, 0,8,66, 0,9,228,\n 80,7,7, 0,8,90, 0,8,26, 0,9,148,\n 84,7,67, 0,8,122, 0,8,58, 0,9,212,\n 82,7,19, 0,8,106, 0,8,42, 0,9,180,\n 0,8,10, 0,8,138, 0,8,74, 0,9,244,\n 80,7,5, 0,8,86, 0,8,22, 192,8,0,\n 83,7,51, 0,8,118, 0,8,54, 0,9,204,\n 81,7,15, 0,8,102, 0,8,38, 0,9,172,\n 0,8,6, 0,8,134, 0,8,70, 0,9,236,\n 80,7,9, 0,8,94, 0,8,30, 0,9,156,\n 84,7,99, 0,8,126, 0,8,62, 0,9,220,\n 82,7,27, 0,8,110, 0,8,46, 0,9,188,\n 0,8,14, 0,8,142, 0,8,78, 0,9,252,\n 96,7,256, 0,8,81, 0,8,17, 85,8,131,\n 82,7,31, 0,8,113, 0,8,49, 0,9,194,\n 80,7,10, 0,8,97, 0,8,33, 0,9,162,\n 0,8,1, 0,8,129, 0,8,65, 0,9,226,\n 80,7,6, 0,8,89, 0,8,25, 0,9,146,\n 83,7,59, 0,8,121, 0,8,57, 0,9,210,\n 81,7,17, 0,8,105, 0,8,41, 0,9,178,\n 0,8,9, 0,8,137, 0,8,73, 0,9,242,\n 80,7,4, 0,8,85, 0,8,21, 80,8,258,\n 83,7,43, 0,8,117, 0,8,53, 0,9,202,\n 81,7,13, 0,8,101, 0,8,37, 0,9,170,\n 0,8,5, 0,8,133, 0,8,69, 0,9,234,\n 80,7,8, 0,8,93, 0,8,29, 0,9,154,\n 84,7,83, 0,8,125, 0,8,61, 0,9,218,\n 82,7,23, 0,8,109, 0,8,45, 0,9,186,\n 0,8,13, 0,8,141, 0,8,77, 0,9,250,\n 80,7,3, 0,8,83, 0,8,19, 85,8,195,\n 83,7,35, 0,8,115, 0,8,51, 0,9,198,\n 81,7,11, 0,8,99, 0,8,35, 0,9,166,\n 0,8,3, 0,8,131, 0,8,67, 0,9,230,\n 80,7,7, 0,8,91, 0,8,27, 0,9,150,\n 84,7,67, 0,8,123, 0,8,59, 0,9,214,\n 82,7,19, 0,8,107, 0,8,43, 0,9,182,\n 0,8,11, 0,8,139, 0,8,75, 0,9,246,\n 80,7,5, 0,8,87, 0,8,23, 192,8,0,\n 83,7,51, 0,8,119, 0,8,55, 0,9,206,\n 81,7,15, 0,8,103, 0,8,39, 0,9,174,\n 0,8,7, 0,8,135, 0,8,71, 0,9,238,\n 80,7,9, 0,8,95, 0,8,31, 0,9,158,\n 84,7,99, 0,8,127, 0,8,63, 0,9,222,\n 82,7,27, 0,8,111, 0,8,47, 0,9,190,\n 0,8,15, 0,8,143, 0,8,79, 0,9,254,\n 96,7,256, 0,8,80, 0,8,16, 84,8,115,\n 82,7,31, 0,8,112, 0,8,48, 0,9,193,\n\n 80,7,10, 0,8,96, 0,8,32, 0,9,161,\n 0,8,0, 0,8,128, 0,8,64, 0,9,225,\n 80,7,6, 0,8,88, 0,8,24, 0,9,145,\n 83,7,59, 0,8,120, 0,8,56, 0,9,209,\n 81,7,17, 0,8,104, 0,8,40, 0,9,177,\n 0,8,8, 0,8,136, 0,8,72, 0,9,241,\n 80,7,4, 0,8,84, 0,8,20, 85,8,227,\n 83,7,43, 0,8,116, 0,8,52, 0,9,201,\n 81,7,13, 0,8,100, 0,8,36, 0,9,169,\n 0,8,4, 0,8,132, 0,8,68, 0,9,233,\n 80,7,8, 0,8,92, 0,8,28, 0,9,153,\n 84,7,83, 0,8,124, 0,8,60, 0,9,217,\n 82,7,23, 0,8,108, 0,8,44, 0,9,185,\n 0,8,12, 0,8,140, 0,8,76, 0,9,249,\n 80,7,3, 0,8,82, 0,8,18, 85,8,163,\n 83,7,35, 0,8,114, 0,8,50, 0,9,197,\n 81,7,11, 0,8,98, 0,8,34, 0,9,165,\n 0,8,2, 0,8,130, 0,8,66, 0,9,229,\n 80,7,7, 0,8,90, 0,8,26, 0,9,149,\n 84,7,67, 0,8,122, 0,8,58, 0,9,213,\n 82,7,19, 0,8,106, 0,8,42, 0,9,181,\n 0,8,10, 0,8,138, 0,8,74, 0,9,245,\n 80,7,5, 0,8,86, 0,8,22, 192,8,0,\n 83,7,51, 0,8,118, 0,8,54, 0,9,205,\n 81,7,15, 0,8,102, 0,8,38, 0,9,173,\n 0,8,6, 0,8,134, 0,8,70, 0,9,237,\n 80,7,9, 0,8,94, 0,8,30, 0,9,157,\n 84,7,99, 0,8,126, 0,8,62, 0,9,221,\n 82,7,27, 0,8,110, 0,8,46, 0,9,189,\n 0,8,14, 0,8,142, 0,8,78, 0,9,253,\n 96,7,256, 0,8,81, 0,8,17, 85,8,131,\n 82,7,31, 0,8,113, 0,8,49, 0,9,195,\n 80,7,10, 0,8,97, 0,8,33, 0,9,163,\n 0,8,1, 0,8,129, 0,8,65, 0,9,227,\n 80,7,6, 0,8,89, 0,8,25, 0,9,147,\n 83,7,59, 0,8,121, 0,8,57, 0,9,211,\n 81,7,17, 0,8,105, 0,8,41, 0,9,179,\n 0,8,9, 0,8,137, 0,8,73, 0,9,243,\n 80,7,4, 0,8,85, 0,8,21, 80,8,258,\n 83,7,43, 0,8,117, 0,8,53, 0,9,203,\n 81,7,13, 0,8,101, 0,8,37, 0,9,171,\n 0,8,5, 0,8,133, 0,8,69, 0,9,235,\n 80,7,8, 0,8,93, 0,8,29, 0,9,155,\n 84,7,83, 0,8,125, 0,8,61, 0,9,219,\n 82,7,23, 0,8,109, 0,8,45, 0,9,187,\n 0,8,13, 0,8,141, 0,8,77, 0,9,251,\n 80,7,3, 0,8,83, 0,8,19, 85,8,195,\n 83,7,35, 0,8,115, 0,8,51, 0,9,199,\n 81,7,11, 0,8,99, 0,8,35, 0,9,167,\n 0,8,3, 0,8,131, 0,8,67, 0,9,231,\n 80,7,7, 0,8,91, 0,8,27, 0,9,151,\n 84,7,67, 0,8,123, 0,8,59, 0,9,215,\n 82,7,19, 0,8,107, 0,8,43, 0,9,183,\n 0,8,11, 0,8,139, 0,8,75, 0,9,247,\n 80,7,5, 0,8,87, 0,8,23, 192,8,0,\n 83,7,51, 0,8,119, 0,8,55, 0,9,207,\n 81,7,15, 0,8,103, 0,8,39, 0,9,175,\n 0,8,7, 0,8,135, 0,8,71, 0,9,239,\n 80,7,9, 0,8,95, 0,8,31, 0,9,159,\n 84,7,99, 0,8,127, 0,8,63, 0,9,223,\n 82,7,27, 0,8,111, 0,8,47, 0,9,191,\n 0,8,15, 0,8,143, 0,8,79, 0,9,255\n];\nvar fixed_td = [\n 80,5,1, 87,5,257, 83,5,17, 91,5,4097,\n 81,5,5, 89,5,1025, 85,5,65, 93,5,16385,\n 80,5,3, 88,5,513, 84,5,33, 92,5,8193,\n 82,5,9, 90,5,2049, 86,5,129, 192,5,24577,\n 80,5,2, 87,5,385, 83,5,25, 91,5,6145,\n 81,5,7, 89,5,1537, 85,5,97, 93,5,24577,\n 80,5,4, 88,5,769, 84,5,49, 92,5,12289,\n 82,5,13, 90,5,3073, 86,5,193, 192,5,24577\n];\n\n // Tables for deflate from PKZIP's appnote.txt.\n var cplens = [ // Copy lengths for literal codes 257..285\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n ];\n\n // see note #13 above about 258\n var cplext = [ // Extra bits for literal codes 257..285\n 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,\n 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112 // 112==invalid\n ];\n\n var cpdist = [ // Copy offsets for distance codes 0..29\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577\n ];\n\n var cpdext = [ // Extra bits for distance codes\n 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,\n 7, 7, 8, 8, 9, 9, 10, 10, 11, 11,\n 12, 12, 13, 13];\n\n//\n// ZStream.java\n//\n\nfunction ZStream() {\n}\n\n\nZStream.prototype.inflateInit = function(w, nowrap) {\n if (!w) {\n\tw = DEF_WBITS;\n }\n if (nowrap) {\n\tnowrap = false;\n }\n this.istate = new Inflate();\n return this.istate.inflateInit(this, nowrap?-w:w);\n}\n\nZStream.prototype.inflate = function(f) {\n if(this.istate==null) return Z_STREAM_ERROR;\n return this.istate.inflate(this, f);\n}\n\nZStream.prototype.inflateEnd = function(){\n if(this.istate==null) return Z_STREAM_ERROR;\n var ret=istate.inflateEnd(this);\n this.istate = null;\n return ret;\n}\nZStream.prototype.inflateSync = function(){\n // if(istate == null) return Z_STREAM_ERROR;\n return istate.inflateSync(this);\n}\nZStream.prototype.inflateSetDictionary = function(dictionary, dictLength){\n // if(istate == null) return Z_STREAM_ERROR;\n return istate.inflateSetDictionary(this, dictionary, dictLength);\n}\n\n/*\n\n public int deflateInit(int level){\n return deflateInit(level, MAX_WBITS);\n }\n public int deflateInit(int level, boolean nowrap){\n return deflateInit(level, MAX_WBITS, nowrap);\n }\n public int deflateInit(int level, int bits){\n return deflateInit(level, bits, false);\n }\n public int deflateInit(int level, int bits, boolean nowrap){\n dstate=new Deflate();\n return dstate.deflateInit(this, level, nowrap?-bits:bits);\n }\n public int deflate(int flush){\n if(dstate==null){\n return Z_STREAM_ERROR;\n }\n return dstate.deflate(this, flush);\n }\n public int deflateEnd(){\n if(dstate==null) return Z_STREAM_ERROR;\n int ret=dstate.deflateEnd();\n dstate=null;\n return ret;\n }\n public int deflateParams(int level, int strategy){\n if(dstate==null) return Z_STREAM_ERROR;\n return dstate.deflateParams(this, level, strategy);\n }\n public int deflateSetDictionary (byte[] dictionary, int dictLength){\n if(dstate == null)\n return Z_STREAM_ERROR;\n return dstate.deflateSetDictionary(this, dictionary, dictLength);\n }\n\n*/\n\n/*\n // Flush as much pending output as possible. All deflate() output goes\n // through this function so some applications may wish to modify it\n // to avoid allocating a large strm->next_out buffer and copying into it.\n // (See also read_buf()).\n void flush_pending(){\n int len=dstate.pending;\n\n if(len>avail_out) len=avail_out;\n if(len==0) return;\n\n if(dstate.pending_buf.length<=dstate.pending_out ||\n next_out.length<=next_out_index ||\n dstate.pending_buf.length<(dstate.pending_out+len) ||\n next_out.length<(next_out_index+len)){\n System.out.println(dstate.pending_buf.length+\", \"+dstate.pending_out+\n\t\t\t \", \"+next_out.length+\", \"+next_out_index+\", \"+len);\n System.out.println(\"avail_out=\"+avail_out);\n }\n\n System.arraycopy(dstate.pending_buf, dstate.pending_out,\n\t\t next_out, next_out_index, len);\n\n next_out_index+=len;\n dstate.pending_out+=len;\n total_out+=len;\n avail_out-=len;\n dstate.pending-=len;\n if(dstate.pending==0){\n dstate.pending_out=0;\n }\n }\n\n // Read a new buffer from the current input stream, update the adler32\n // and total number of bytes read. All deflate() input goes through\n // this function so some applications may wish to modify it to avoid\n // allocating a large strm->next_in buffer and copying from it.\n // (See also flush_pending()).\n int read_buf(byte[] buf, int start, int size) {\n int len=avail_in;\n\n if(len>size) len=size;\n if(len==0) return 0;\n\n avail_in-=len;\n\n if(dstate.noheader==0) {\n adler=_adler.adler32(adler, next_in, next_in_index, len);\n }\n System.arraycopy(next_in, next_in_index, buf, start, len);\n next_in_index += len;\n total_in += len;\n return len;\n }\n\n public void free(){\n next_in=null;\n next_out=null;\n msg=null;\n _adler=null;\n }\n}\n*/\n\n\n//\n// Inflate.java\n//\n\nfunction Inflate() {\n this.was = [0];\n}\n\nInflate.prototype.inflateReset = function(z) {\n if(z == null || z.istate == null) return Z_STREAM_ERROR;\n \n z.total_in = z.total_out = 0;\n z.msg = null;\n z.istate.mode = z.istate.nowrap!=0 ? BLOCKS : METHOD;\n z.istate.blocks.reset(z, null);\n return Z_OK;\n}\n\nInflate.prototype.inflateEnd = function(z){\n if(this.blocks != null)\n this.blocks.free(z);\n this.blocks=null;\n return Z_OK;\n}\n\nInflate.prototype.inflateInit = function(z, w){\n z.msg = null;\n this.blocks = null;\n\n // handle undocumented nowrap option (no zlib header or check)\n nowrap = 0;\n if(w < 0){\n w = - w;\n nowrap = 1;\n }\n\n // set window size\n if(w<8 ||w>15){\n this.inflateEnd(z);\n return Z_STREAM_ERROR;\n }\n this.wbits=w;\n\n z.istate.blocks=new InfBlocks(z, \n\t\t\t\t z.istate.nowrap!=0 ? null : this,\n\t\t\t\t 1<>4)+8>z.istate.wbits){\n z.istate.mode = BAD;\n z.msg=\"invalid window size\";\n z.istate.marker = 5; // can't try inflateSync\n break;\n }\n z.istate.mode=FLAG;\n case FLAG:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n b = (z.next_in[z.next_in_index++])&0xff;\n\n if((((z.istate.method << 8)+b) % 31)!=0){\n z.istate.mode = BAD;\n z.msg = \"incorrect header check\";\n z.istate.marker = 5; // can't try inflateSync\n break;\n }\n\n if((b&PRESET_DICT)==0){\n z.istate.mode = BLOCKS;\n break;\n }\n z.istate.mode = DICT4;\n case DICT4:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need=((z.next_in[z.next_in_index++]&0xff)<<24)&0xff000000;\n z.istate.mode=DICT3;\n case DICT3:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<16)&0xff0000;\n z.istate.mode=DICT2;\n case DICT2:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<8)&0xff00;\n z.istate.mode=DICT1;\n case DICT1:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need += (z.next_in[z.next_in_index++]&0xff);\n z.adler = z.istate.need;\n z.istate.mode = DICT0;\n return Z_NEED_DICT;\n case DICT0:\n z.istate.mode = BAD;\n z.msg = \"need dictionary\";\n z.istate.marker = 0; // can try inflateSync\n return Z_STREAM_ERROR;\n case BLOCKS:\n\n r = z.istate.blocks.proc(z, r);\n if(r == Z_DATA_ERROR){\n z.istate.mode = BAD;\n z.istate.marker = 0; // can try inflateSync\n break;\n }\n if(r == Z_OK){\n r = f;\n }\n if(r != Z_STREAM_END){\n return r;\n }\n r = f;\n z.istate.blocks.reset(z, z.istate.was);\n if(z.istate.nowrap!=0){\n z.istate.mode=DONE;\n break;\n }\n z.istate.mode=CHECK4;\n case CHECK4:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need=((z.next_in[z.next_in_index++]&0xff)<<24)&0xff000000;\n z.istate.mode=CHECK3;\n case CHECK3:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<16)&0xff0000;\n z.istate.mode = CHECK2;\n case CHECK2:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=((z.next_in[z.next_in_index++]&0xff)<<8)&0xff00;\n z.istate.mode = CHECK1;\n case CHECK1:\n\n if(z.avail_in==0)return r;r=f;\n\n z.avail_in--; z.total_in++;\n z.istate.need+=(z.next_in[z.next_in_index++]&0xff);\n\n if(((z.istate.was[0])) != ((z.istate.need))){\n z.istate.mode = BAD;\n z.msg = \"incorrect data check\";\n z.istate.marker = 5; // can't try inflateSync\n break;\n }\n\n z.istate.mode = DONE;\n case DONE:\n return Z_STREAM_END;\n case BAD:\n return Z_DATA_ERROR;\n default:\n return Z_STREAM_ERROR;\n }\n }\n }\n\n\nInflate.prototype.inflateSetDictionary = function(z, dictionary, dictLength) {\n var index=0;\n var length = dictLength;\n if(z==null || z.istate == null|| z.istate.mode != DICT0)\n return Z_STREAM_ERROR;\n\n if(z._adler.adler32(1, dictionary, 0, dictLength)!=z.adler){\n return Z_DATA_ERROR;\n }\n\n z.adler = z._adler.adler32(0, null, 0, 0);\n\n if(length >= (1<>> 1){\n case 0: // stored \n {b>>>=(3);k-=(3);}\n t = k & 7; // go to byte boundary\n\n {b>>>=(t);k-=(t);}\n this.mode = IB_LENS; // get length of stored block\n break;\n case 1: // fixed\n {\n var bl=new Int32Array(1);\n\t var bd=new Int32Array(1);\n var tl=[];\n\t var td=[];\n\n\t inflate_trees_fixed(bl, bd, tl, td, z);\n this.codes.init(bl[0], bd[0], tl[0], 0, td[0], 0, z);\n }\n\n {b>>>=(3);k-=(3);}\n\n this.mode = IB_CODES;\n break;\n case 2: // dynamic\n\n {b>>>=(3);k-=(3);}\n\n this.mode = IB_TABLE;\n break;\n case 3: // illegal\n\n {b>>>=(3);k-=(3);}\n this.mode = BAD;\n z.msg = \"invalid block type\";\n r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\tbreak;\n case IB_LENS:\n\twhile(k<(32)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>> 16) & 0xffff) != (b & 0xffff)){\n\t this.mode = BAD;\n\t z.msg = \"invalid stored block lengths\";\n\t r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\tthis.left = (b & 0xffff);\n\tb = k = 0; // dump bits\n\tthis.mode = this.left!=0 ? IB_STORED : (this.last!=0 ? IB_DRY : IB_TYPE);\n\tbreak;\n case IB_STORED:\n\tif (n == 0){\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\n\tif(m==0){\n\t if(q==end&&read!=0){\n\t q=0; m=(qn) t = n;\n\tif(t>m) t = m;\n\tarrayCopy(z.next_in, p, this.window, q, t);\n\tp += t; n -= t;\n\tq += t; m -= t;\n\tif ((this.left -= t) != 0)\n\t break;\n\tthis.mode = (this.last != 0 ? IB_DRY : IB_TYPE);\n\tbreak;\n case IB_TABLE:\n\n\twhile(k<(14)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)< 29 || ((t >> 5) & 0x1f) > 29)\n\t {\n\t this.mode = IB_BAD;\n\t z.msg = \"too many length or distance symbols\";\n\t r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t }\n\tt = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);\n\tif(this.blens==null || this.blens.length>>=(14);k-=(14);}\n\n\tthis.index = 0;\n\tmode = IB_BTREE;\n case IB_BTREE:\n\twhile (this.index < 4 + (this.table >>> 10)){\n\t while(k<(3)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>>=(3);k-=(3);}\n\t}\n\n\twhile(this.index < 19){\n\t this.blens[INFBLOCKS_BORDER[this.index++]] = 0;\n\t}\n\n\tthis.bb[0] = 7;\n\tt = this.inftree.inflate_trees_bits(this.blens, this.bb, this.tb, this.hufts, z);\n\tif (t != Z_OK){\n\t r = t;\n\t if (r == Z_DATA_ERROR){\n\t this.blens=null;\n\t this.mode = IB_BAD;\n\t }\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t write=q;\n\t return this.inflate_flush(z,r);\n\t}\n\n\tthis.index = 0;\n\tthis.mode = IB_DTREE;\n case IB_DTREE:\n\twhile (true){\n\t t = this.table;\n\t if(!(this.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))){\n\t break;\n\t }\n\n\t var h; //int[]\n\t var i, j, c;\n\n\t t = this.bb[0];\n\n\t while(k<(t)){\n\t if(n!=0){\n\t r=Z_OK;\n\t }\n\t else{\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;\n\t z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>>=(t);k-=(t);\n\t this.blens[this.index++] = c;\n\t }\n\t else { // c == 16..18\n\t i = c == 18 ? 7 : c - 14;\n\t j = c == 18 ? 11 : 3;\n\n\t while(k<(t+i)){\n\t if(n!=0){\n\t\tr=Z_OK;\n\t }\n\t else{\n\t\tthis.bitb=b; this.bitk=k; \n\t\tz.avail_in=n;\n\t\tz.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t\tthis.write=q;\n\t\treturn this.inflate_flush(z,r);\n\t };\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>>=(t);k-=(t);\n\n\t j += (b & inflate_mask[i]);\n\n\t b>>>=(i);k-=(i);\n\n\t i = this.index;\n\t t = this.table;\n\t if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||\n\t\t(c == 16 && i < 1)){\n\t this.blens=null;\n\t this.mode = IB_BAD;\n\t z.msg = \"invalid bit length repeat\";\n\t r = Z_DATA_ERROR;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t }\n\n\t c = c == 16 ? this.blens[i-1] : 0;\n\t do{\n\t this.blens[i++] = c;\n\t }\n\t while (--j!=0);\n\t this.index = i;\n\t }\n\t}\n\n\tthis.tb[0]=-1;\n\t{\n\t var bl=new Int32Array(1);\n\t var bd=new Int32Array(1);\n\t var tl=new Int32Array(1);\n\t var td=new Int32Array(1);\n\t bl[0] = 9; // must be <= 9 for lookahead assumptions\n\t bd[0] = 6; // must be <= 9 for lookahead assumptions\n\n\t t = this.table;\n\t t = this.inftree.inflate_trees_dynamic(257 + (t & 0x1f), \n\t\t\t\t\t 1 + ((t >> 5) & 0x1f),\n\t\t\t\t\t this.blens, bl, bd, tl, td, this.hufts, z);\n\n\t if (t != Z_OK){\n\t if (t == Z_DATA_ERROR){\n\t this.blens=null;\n\t this.mode = BAD;\n\t }\n\t r = t;\n\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z,r);\n\t }\n\t this.codes.init(bl[0], bd[0], this.hufts, tl[0], this.hufts, td[0], z);\n\t}\n\tthis.mode = IB_CODES;\n case IB_CODES:\n\tthis.bitb=b; this.bitk=k;\n\tz.avail_in=n; z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\n\tif ((r = this.codes.proc(this, z, r)) != Z_STREAM_END){\n\t return this.inflate_flush(z, r);\n\t}\n\tr = Z_OK;\n\tthis.codes.free(z);\n\n\tp=z.next_in_index; n=z.avail_in;b=this.bitb;k=this.bitk;\n\tq=this.write;m = (q < this.read ? this.read-q-1 : this.end-q);\n\n\tif (this.last==0){\n\t this.mode = IB_TYPE;\n\t break;\n\t}\n\tthis.mode = IB_DRY;\n case IB_DRY:\n\tthis.write=q; \n\tr = this.inflate_flush(z, r); \n\tq=this.write; m = (q < this.read ? this.read-q-1 : this.end-q);\n\tif (this.read != this.write){\n\t this.bitb=b; this.bitk=k; \n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t this.write=q;\n\t return this.inflate_flush(z, r);\n\t}\n\tmode = DONE;\n case IB_DONE:\n\tr = Z_STREAM_END;\n\n\tthis.bitb=b; this.bitk=k; \n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\treturn this.inflate_flush(z, r);\n case IB_BAD:\n\tr = Z_DATA_ERROR;\n\n\tthis.bitb=b; this.bitk=k; \n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\treturn this.inflate_flush(z, r);\n\n default:\n\tr = Z_STREAM_ERROR;\n\n\tthis.bitb=b; this.bitk=k; \n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\tthis.write=q;\n\treturn this.inflate_flush(z, r);\n }\n }\n }\n\nInfBlocks.prototype.free = function(z){\n this.reset(z, null);\n this.window=null;\n this.hufts=null;\n}\n\nInfBlocks.prototype.set_dictionary = function(d, start, n){\n arrayCopy(d, start, window, 0, n);\n this.read = this.write = n;\n}\n\n // Returns true if inflate is currently at the end of a block generated\n // by Z_SYNC_FLUSH or Z_FULL_FLUSH. \nInfBlocks.prototype.sync_point = function(){\n return this.mode == IB_LENS;\n}\n\n // copy as much as possible from the sliding window to the output area\nInfBlocks.prototype.inflate_flush = function(z, r){\n var n;\n var p;\n var q;\n\n // local copies of source and destination pointers\n p = z.next_out_index;\n q = this.read;\n\n // compute number of bytes to copy as far as end of window\n n = ((q <= this.write ? this.write : this.end) - q);\n if (n > z.avail_out) n = z.avail_out;\n if (n!=0 && r == Z_BUF_ERROR) r = Z_OK;\n\n // update counters\n z.avail_out -= n;\n z.total_out += n;\n\n // update check information\n if(this.checkfn != null)\n z.adler=this.check=z._adler.adler32(this.check, this.window, q, n);\n\n // copy as far as end of window\n arrayCopy(this.window, q, z.next_out, p, n);\n p += n;\n q += n;\n\n // see if more to copy at beginning of window\n if (q == this.end){\n // wrap pointers\n q = 0;\n if (this.write == this.end)\n this.write = 0;\n\n // compute bytes to copy\n n = this.write - q;\n if (n > z.avail_out) n = z.avail_out;\n if (n!=0 && r == Z_BUF_ERROR) r = Z_OK;\n\n // update counters\n z.avail_out -= n;\n z.total_out += n;\n\n // update check information\n if(this.checkfn != null)\n\tz.adler=this.check=z._adler.adler32(this.check, this.window, q, n);\n\n // copy\n arrayCopy(this.window, q, z.next_out, p, n);\n p += n;\n q += n;\n }\n\n // update pointers\n z.next_out_index = p;\n this.read = q;\n\n // done\n return r;\n }\n\n//\n// InfCodes.java\n//\n\nvar IC_START=0; // x: set up for LEN\nvar IC_LEN=1; // i: get length/literal/eob next\nvar IC_LENEXT=2; // i: getting length extra (have base)\nvar IC_DIST=3; // i: get distance next\nvar IC_DISTEXT=4;// i: getting distance extra\nvar IC_COPY=5; // o: copying bytes in window, waiting for space\nvar IC_LIT=6; // o: got literal, waiting for output space\nvar IC_WASH=7; // o: got eob, possibly still output waiting\nvar IC_END=8; // x: got eob and all data flushed\nvar IC_BADCODE=9;// x: got error\n\nfunction InfCodes() {\n}\n\nInfCodes.prototype.init = function(bl, bd, tl, tl_index, td, td_index, z) {\n this.mode=IC_START;\n this.lbits=bl;\n this.dbits=bd;\n this.ltree=tl;\n this.ltree_index=tl_index;\n this.dtree = td;\n this.dtree_index=td_index;\n this.tree=null;\n}\n\nInfCodes.prototype.proc = function(s, z, r){ \n var j; // temporary storage\n var t; // temporary pointer (int[])\n var tindex; // temporary pointer\n var e; // extra bits or operation\n var b=0; // bit buffer\n var k=0; // bits in bit buffer\n var p=0; // input data pointer\n var n; // bytes available there\n var q; // output window write pointer\n var m; // bytes to end of window or read pointer\n var f; // pointer to copy strings from\n\n // copy input/output information to locals (UPDATE macro restores)\n p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;\n q=s.write;m=q= 258 && n >= 10){\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t r = this.inflate_fast(this.lbits, this.dbits, \n\t\t\t this.ltree, this.ltree_index, \n\t\t\t this.dtree, this.dtree_index,\n\t\t\t s, z);\n\n\t p=z.next_in_index;n=z.avail_in;b=s.bitb;k=s.bitk;\n\t q=s.write;m=q>>=(this.tree[tindex+1]);\n\tk-=(this.tree[tindex+1]);\n\n\te=this.tree[tindex];\n\n\tif(e == 0){ // literal\n\t this.lit = this.tree[tindex+2];\n\t this.mode = IC_LIT;\n\t break;\n\t}\n\tif((e & 16)!=0 ){ // length\n\t this.get = e & 15;\n\t this.len = this.tree[tindex+2];\n\t this.mode = IC_LENEXT;\n\t break;\n\t}\n\tif ((e & 64) == 0){ // next table\n\t this.need = e;\n\t this.tree_index = tindex/3 + this.tree[tindex+2];\n\t break;\n\t}\n\tif ((e & 32)!=0){ // end of block\n\t this.mode = IC_WASH;\n\t break;\n\t}\n\tthis.mode = IC_BADCODE; // invalid code\n\tz.msg = \"invalid literal/length code\";\n\tr = Z_DATA_ERROR;\n\n\ts.bitb=b;s.bitk=k;\n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\ts.write=q;\n\treturn s.inflate_flush(z,r);\n\n case IC_LENEXT: // i: getting length extra (have base)\n\tj = this.get;\n\n\twhile(k<(j)){\n\t if(n!=0)r=Z_OK;\n\t else{\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t return s.inflate_flush(z,r);\n\t }\n\t n--; b|=(z.next_in[p++]&0xff)<>=j;\n\tk-=j;\n\n\tthis.need = this.dbits;\n\tthis.tree = this.dtree;\n\tthis.tree_index = this.dtree_index;\n\tthis.mode = IC_DIST;\n case IC_DIST: // i: get distance next\n\tj = this.need;\n\n\twhile(k<(j)){\n\t if(n!=0)r=Z_OK;\n\t else{\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t return s.inflate_flush(z,r);\n\t }\n\t n--; b|=(z.next_in[p++]&0xff)<>=this.tree[tindex+1];\n\tk-=this.tree[tindex+1];\n\n\te = (this.tree[tindex]);\n\tif((e & 16)!=0){ // distance\n\t this.get = e & 15;\n\t this.dist = this.tree[tindex+2];\n\t this.mode = IC_DISTEXT;\n\t break;\n\t}\n\tif ((e & 64) == 0){ // next table\n\t this.need = e;\n\t this.tree_index = tindex/3 + this.tree[tindex+2];\n\t break;\n\t}\n\tthis.mode = IC_BADCODE; // invalid code\n\tz.msg = \"invalid distance code\";\n\tr = Z_DATA_ERROR;\n\n\ts.bitb=b;s.bitk=k;\n\tz.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\ts.write=q;\n\treturn s.inflate_flush(z,r);\n\n case IC_DISTEXT: // i: getting distance extra\n\tj = this.get;\n\n\twhile(k<(j)){\n\t if(n!=0)r=Z_OK;\n\t else{\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\t return s.inflate_flush(z,r);\n\t }\n\t n--; b|=(z.next_in[p++]&0xff)<>=j;\n\tk-=j;\n\n\tthis.mode = IC_COPY;\n case IC_COPY: // o: copying bytes in window, waiting for space\n f = q - this.dist;\n while(f < 0){ // modulo window size-\"while\" instead\n f += s.end; // of \"if\" handles invalid distances\n\t}\n\twhile (this.len!=0){\n\n\t if(m==0){\n\t if(q==s.end&&s.read!=0){q=0;m=q 7){ // return unused byte, if any\n\t k -= 8;\n\t n++;\n\t p--; // can always return one\n\t}\n\n\ts.write=q; r=s.inflate_flush(z,r);\n\tq=s.write;m=q= 258 && n >= 10\n // get literal/length code\n while(k<(20)){ // max bits for literal/length code\n\tn--;\n\tb|=(z.next_in[p++]&0xff)<>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\ts.window[q++] = tp[tp_index_t_3+2];\n\tm--;\n\tcontinue;\n }\n do {\n\n\tb>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\tif((e&16)!=0){\n\t e &= 15;\n\t c = tp[tp_index_t_3+2] + (b & inflate_mask[e]);\n\n\t b>>=e; k-=e;\n\n\t // decode distance base of block to copy\n\t while(k<(15)){ // max bits for distance code\n\t n--;\n\t b|=(z.next_in[p++]&0xff)<>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\t if((e&16)!=0){\n\t // get extra bits to add to distance base\n\t e &= 15;\n\t while(k<(e)){ // get extra bits (up to 13)\n\t\tn--;\n\t\tb|=(z.next_in[p++]&0xff)<>=(e); k-=(e);\n\n\t // do the copy\n\t m -= c;\n\t if (q >= d){ // offset before dest\n\t\t// just copy\n\t\tr=q-d;\n\t\tif(q-r>0 && 2>(q-r)){ \n\t\t s.window[q++]=s.window[r++]; // minimum count is three,\n\t\t s.window[q++]=s.window[r++]; // so unroll loop a little\n\t\t c-=2;\n\t\t}\n\t\telse{\n\t\t s.window[q++]=s.window[r++]; // minimum count is three,\n\t\t s.window[q++]=s.window[r++]; // so unroll loop a little\n\t\t c-=2;\n\t\t}\n\t }\n\t else{ // else offset after destination\n r=q-d;\n do{\n r+=s.end; // force pointer in window\n }while(r<0); // covers invalid distances\n\t\te=s.end-r;\n\t\tif(c>e){ // if source crosses,\n\t\t c-=e; // wrapped copy\n\t\t if(q-r>0 && e>(q-r)){ \n\t\t do{s.window[q++] = s.window[r++];}\n\t\t while(--e!=0);\n\t\t }\n\t\t else{\n\t\t arrayCopy(s.window, r, s.window, q, e);\n\t\t q+=e; r+=e; e=0;\n\t\t }\n\t\t r = 0; // copy rest from start of window\n\t\t}\n\n\t }\n\n\t // copy all or what's left\n do{s.window[q++] = s.window[r++];}\n\t\twhile(--c!=0);\n\t break;\n\t }\n\t else if((e&64)==0){\n\t t+=tp[tp_index_t_3+2];\n\t t+=(b&inflate_mask[e]);\n\t tp_index_t_3=(tp_index+t)*3;\n\t e=tp[tp_index_t_3];\n\t }\n\t else{\n\t z.msg = \"invalid distance code\";\n\n\t c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\n\t return Z_DATA_ERROR;\n\t }\n\t }\n\t while(true);\n\t break;\n\t}\n\n\tif((e&64)==0){\n\t t+=tp[tp_index_t_3+2];\n\t t+=(b&inflate_mask[e]);\n\t tp_index_t_3=(tp_index+t)*3;\n\t if((e=tp[tp_index_t_3])==0){\n\n\t b>>=(tp[tp_index_t_3+1]); k-=(tp[tp_index_t_3+1]);\n\n\t s.window[q++]=tp[tp_index_t_3+2];\n\t m--;\n\t break;\n\t }\n\t}\n\telse if((e&32)!=0){\n\n\t c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n \n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\n\t return Z_STREAM_END;\n\t}\n\telse{\n\t z.msg=\"invalid literal/length code\";\n\n\t c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n\n\t s.bitb=b;s.bitk=k;\n\t z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n\t s.write=q;\n\n\t return Z_DATA_ERROR;\n\t}\n } \n while(true);\n } \n while(m>=258 && n>= 10);\n\n // not enough input or output--restore pointers and return\n c=z.avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;\n\n s.bitb=b;s.bitk=k;\n z.avail_in=n;z.total_in+=p-z.next_in_index;z.next_in_index=p;\n s.write=q;\n\n return Z_OK;\n}\n\n//\n// InfTree.java\n//\n\nfunction InfTree() {\n}\n\nInfTree.prototype.huft_build = function(b, bindex, n, s, d, e, t, m, hp, hn, v) {\n\n // Given a list of code lengths and a maximum table size, make a set of\n // tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR\n // if the given code set is incomplete (the tables are still built in this\n // case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of\n // lengths), or Z_MEM_ERROR if not enough memory.\n\n var a; // counter for codes of length k\n var f; // i repeats in table every f entries\n var g; // maximum code length\n var h; // table level\n var i; // counter, current code\n var j; // counter\n var k; // number of bits in current code\n var l; // bits per table (returned in m)\n var mask; // (1 << w) - 1, to avoid cc -O bug on HP\n var p; // pointer into c[], b[], or v[]\n var q; // points to current table\n var w; // bits before this table == (l * h)\n var xp; // pointer into x\n var y; // number of dummy codes added\n var z; // number of entries in current table\n\n // Generate counts for each bit length\n\n p = 0; i = n;\n do {\n this.c[b[bindex+p]]++; p++; i--; // assume all entries <= BMAX\n }while(i!=0);\n\n if(this.c[0] == n){ // null input--all zero length codes\n t[0] = -1;\n m[0] = 0;\n return Z_OK;\n }\n\n // Find minimum and maximum length, bound *m by those\n l = m[0];\n for (j = 1; j <= BMAX; j++)\n if(this.c[j]!=0) break;\n k = j; // minimum code length\n if(l < j){\n l = j;\n }\n for (i = BMAX; i!=0; i--){\n if(this.c[i]!=0) break;\n }\n g = i; // maximum code length\n if(l > i){\n l = i;\n }\n m[0] = l;\n\n // Adjust last length count to fill out codes, if needed\n for (y = 1 << j; j < i; j++, y <<= 1){\n if ((y -= this.c[j]) < 0){\n return Z_DATA_ERROR;\n }\n }\n if ((y -= this.c[i]) < 0){\n return Z_DATA_ERROR;\n }\n this.c[i] += y;\n\n // Generate starting offsets into the value table for each length\n this.x[1] = j = 0;\n p = 1; xp = 2;\n while (--i!=0) { // note that i == g from above\n this.x[xp] = (j += this.c[p]);\n xp++;\n p++;\n }\n\n // Make a table of values in order of bit lengths\n i = 0; p = 0;\n do {\n if ((j = b[bindex+p]) != 0){\n this.v[this.x[j]++] = i;\n }\n p++;\n }\n while (++i < n);\n n = this.x[g]; // set n to length of v\n\n // Generate the Huffman codes and for each, make the table entries\n this.x[0] = i = 0; // first Huffman code is zero\n p = 0; // grab values in bit order\n h = -1; // no tables yet--level -1\n w = -l; // bits decoded == (l * h)\n this.u[0] = 0; // just to keep compilers happy\n q = 0; // ditto\n z = 0; // ditto\n\n // go through the bit lengths (k already is bits in shortest code)\n for (; k <= g; k++){\n a = this.c[k];\n while (a--!=0){\n\t// here i is the Huffman code of length k bits for value *p\n\t// make tables up to required level\n while (k > w + l){\n h++;\n w += l; // previous table always l bits\n\t // compute minimum size table less than or equal to l bits\n z = g - w;\n z = (z > l) ? l : z; // table size upper limit\n if((f=1<<(j=k-w))>a+1){ // try a k-w bit table\n // too few codes for k-w bit table\n f -= a + 1; // deduct codes from patterns left\n xp = k;\n if(j < z){\n while (++j < z){ // try smaller tables up to z bits\n if((f <<= 1) <= this.c[++xp])\n break; // enough codes to use up j bits\n f -= this.c[xp]; // else deduct codes from patterns\n }\n\t }\n }\n z = 1 << j; // table entries for j-bit table\n\n\t // allocate new table\n if (this.hn[0] + z > MANY){ // (note: doesn't matter for fixed)\n return Z_DATA_ERROR; // overflow of MANY\n }\n this.u[h] = q = /*hp+*/ this.hn[0]; // DEBUG\n this.hn[0] += z;\n \n\t // connect to last table, if there is one\n\t if(h!=0){\n this.x[h]=i; // save pattern for backing up\n this.r[0]=j; // bits in this table\n this.r[1]=l; // bits to dump before this table\n j=i>>>(w - l);\n this.r[2] = (q - this.u[h-1] - j); // offset to this table\n arrayCopy(this.r, 0, hp, (this.u[h-1]+j)*3, 3); // connect to last table\n }\n else{\n t[0] = q; // first table is returned result\n\t }\n }\n\n\t// set up table entry in r\n this.r[1] = (k - w);\n if (p >= n){\n this.r[0] = 128 + 64; // out of values--invalid code\n\t}\n else if (v[p] < s){\n this.r[0] = (this.v[p] < 256 ? 0 : 32 + 64); // 256 is end-of-block\n this.r[2] = this.v[p++]; // simple code is just the value\n }\n else{\n this.r[0]=(e[this.v[p]-s]+16+64); // non-simple--look up in lists\n this.r[2]=d[this.v[p++] - s];\n }\n\n // fill code-like entries with r\n f=1<<(k-w);\n for (j=i>>>w;j>>= 1){\n i ^= j;\n\t}\n i ^= j;\n\n\t// backup over finished tables\n mask = (1 << w) - 1; // needed on HP, cc -O bug\n while ((i & mask) != this.x[h]){\n h--; // don't need to update q\n w -= l;\n mask = (1 << w) - 1;\n }\n }\n }\n // Return Z_BUF_ERROR if we were given an incomplete table\n return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK;\n}\n\nInfTree.prototype.inflate_trees_bits = function(c, bb, tb, hp, z) {\n var result;\n this.initWorkArea(19);\n this.hn[0]=0;\n result = this.huft_build(c, 0, 19, 19, null, null, tb, bb, hp, this.hn, this.v);\n\n if(result == Z_DATA_ERROR){\n z.msg = \"oversubscribed dynamic bit lengths tree\";\n }\n else if(result == Z_BUF_ERROR || bb[0] == 0){\n z.msg = \"incomplete dynamic bit lengths tree\";\n result = Z_DATA_ERROR;\n }\n return result;\n}\n\nInfTree.prototype.inflate_trees_dynamic = function(nl, nd, c, bl, bd, tl, td, hp, z) {\n var result;\n\n // build literal/length tree\n this.initWorkArea(288);\n this.hn[0]=0;\n result = this.huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, this.hn, this.v);\n if (result != Z_OK || bl[0] == 0){\n if(result == Z_DATA_ERROR){\n z.msg = \"oversubscribed literal/length tree\";\n }\n else if (result != Z_MEM_ERROR){\n z.msg = \"incomplete literal/length tree\";\n result = Z_DATA_ERROR;\n }\n return result;\n }\n\n // build distance tree\n this.initWorkArea(288);\n result = this.huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, this.hn, this.v);\n\n if (result != Z_OK || (bd[0] == 0 && nl > 257)){\n if (result == Z_DATA_ERROR){\n z.msg = \"oversubscribed distance tree\";\n }\n else if (result == Z_BUF_ERROR) {\n z.msg = \"incomplete distance tree\";\n result = Z_DATA_ERROR;\n }\n else if (result != Z_MEM_ERROR){\n z.msg = \"empty distance tree with lengths\";\n result = Z_DATA_ERROR;\n }\n return result;\n }\n\n return Z_OK;\n}\n/*\n static int inflate_trees_fixed(int[] bl, //literal desired/actual bit depth\n int[] bd, //distance desired/actual bit depth\n int[][] tl,//literal/length tree result\n int[][] td,//distance tree result \n ZStream z //for memory allocation\n\t\t\t\t ){\n\n*/\n\nfunction inflate_trees_fixed(bl, bd, tl, td, z) {\n bl[0]=fixed_bl;\n bd[0]=fixed_bd;\n tl[0]=fixed_tl;\n td[0]=fixed_td;\n return Z_OK;\n}\n\nInfTree.prototype.initWorkArea = function(vsize){\n if(this.hn==null){\n this.hn=new Int32Array(1);\n this.v=new Int32Array(vsize);\n this.c=new Int32Array(BMAX+1);\n this.r=new Int32Array(3);\n this.u=new Int32Array(BMAX);\n this.x=new Int32Array(BMAX+1);\n }\n if(this.v.length 100) {\n arrayCopy_fast(new Uint8Array(src.buffer, src.byteOffset + srcOffset, count), dest, destOffset);\n } else { \n arrayCopy_slow(src, srcOffset, dest, destOffset, count);\n }\n\n}\n\nfunction arrayCopy_slow(src, srcOffset, dest, destOffset, count) {\n\n // dlog('_slow call: srcOffset=' + srcOffset + '; destOffset=' + destOffset + '; count=' + count);\n\n for (var i = 0; i < count; ++i) {\n dest[destOffset + i] = src[srcOffset + i];\n }\n}\n\nfunction arrayCopy_fast(src, dest, destOffset) {\n dest.set(src, destOffset);\n}\n\n\n // largest prime smaller than 65536\nvar ADLER_BASE=65521; \n // NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1\nvar ADLER_NMAX=5552;\n\nfunction adler32(adler, /* byte[] */ buf, index, len){\n if(buf == null){ return 1; }\n\n var s1=adler&0xffff;\n var s2=(adler>>16)&0xffff;\n var k;\n\n while(len > 0) {\n k=len=16){\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n s1+=buf[index++]&0xff; s2+=s1;\n k-=16;\n }\n if(k!=0){\n do{\n s1+=buf[index++]&0xff; s2+=s1;\n }\n while(--k!=0);\n }\n s1%=ADLER_BASE;\n s2%=ADLER_BASE;\n }\n return (s2<<16)|s1;\n}\n\n\n\nfunction jszlib_inflate_buffer(buffer, start, length, afterUncOffset) {\n if (!start) {\n buffer = new Uint8Array(buffer);\n } else if (!length) {\n buffer = new Uint8Array(buffer, start, buffer.byteLength - start);\n } else {\n buffer = new Uint8Array(buffer, start, length);\n }\n\n var z = new ZStream();\n z.inflateInit(DEF_WBITS, true);\n z.next_in = buffer;\n z.next_in_index = 0;\n z.avail_in = buffer.length;\n\n var oBlockList = [];\n var totalSize = 0;\n while (true) {\n var obuf = new Uint8Array(32000);\n z.next_out = obuf;\n z.next_out_index = 0;\n z.avail_out = obuf.length;\n var status = z.inflate(Z_NO_FLUSH);\n if (status != Z_OK && status != Z_STREAM_END && status != Z_BUF_ERROR) {\n throw z.msg;\n }\n if (z.avail_out != 0) {\n var newob = new Uint8Array(obuf.length - z.avail_out);\n arrayCopy(obuf, 0, newob, 0, (obuf.length - z.avail_out));\n obuf = newob;\n }\n oBlockList.push(obuf);\n totalSize += obuf.length;\n if (status == Z_STREAM_END || status == Z_BUF_ERROR) {\n break;\n }\n }\n\n if (afterUncOffset) {\n afterUncOffset[0] = (start || 0) + z.next_in_index;\n }\n\n if (oBlockList.length == 1) {\n return oBlockList[0].buffer;\n } else {\n var out = new Uint8Array(totalSize);\n var cursor = 0;\n for (var i = 0; i < oBlockList.length; ++i) {\n var b = oBlockList[i];\n arrayCopy(b, 0, out, cursor, b.length);\n cursor += b.length;\n }\n return out.buffer;\n }\n}\n\nif (typeof(module) !== 'undefined') {\n module.exports = {\n inflateBuffer: jszlib_inflate_buffer,\n arrayCopy: arrayCopy\n };\n}\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","// Ramda v0.21.0\n// https://github.com/ramda/ramda\n// (c) 2013-2016 Scott Sauyet, Michael Hurley, and David Chambers\n// Ramda may be freely distributed under the MIT license.\n\n;(function() {\n\n 'use strict';\n\n /**\n * A special placeholder value used to specify \"gaps\" within curried functions,\n * allowing partial application of any combination of arguments, regardless of\n * their positions.\n *\n * If `g` is a curried ternary function and `_` is `R.__`, the following are\n * equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2, _)(1, 3)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @constant\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @example\n *\n * var greet = R.replace('{name}', R.__, 'Hello, {name}!');\n * greet('Alice'); //=> 'Hello, Alice!'\n */\n var __ = { '@@functional/placeholder': true };\n\n /* eslint-disable no-unused-vars */\n var _arity = function _arity(n, fn) {\n /* eslint-disable no-unused-vars */\n switch (n) {\n case 0:\n return function () {\n return fn.apply(this, arguments);\n };\n case 1:\n return function (a0) {\n return fn.apply(this, arguments);\n };\n case 2:\n return function (a0, a1) {\n return fn.apply(this, arguments);\n };\n case 3:\n return function (a0, a1, a2) {\n return fn.apply(this, arguments);\n };\n case 4:\n return function (a0, a1, a2, a3) {\n return fn.apply(this, arguments);\n };\n case 5:\n return function (a0, a1, a2, a3, a4) {\n return fn.apply(this, arguments);\n };\n case 6:\n return function (a0, a1, a2, a3, a4, a5) {\n return fn.apply(this, arguments);\n };\n case 7:\n return function (a0, a1, a2, a3, a4, a5, a6) {\n return fn.apply(this, arguments);\n };\n case 8:\n return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n return fn.apply(this, arguments);\n };\n case 9:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n return fn.apply(this, arguments);\n };\n case 10:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n return fn.apply(this, arguments);\n };\n default:\n throw new Error('First argument to _arity must be a non-negative integer no greater than ten');\n }\n };\n\n var _arrayFromIterator = function _arrayFromIterator(iter) {\n var list = [];\n var next;\n while (!(next = iter.next()).done) {\n list.push(next.value);\n }\n return list;\n };\n\n var _arrayOf = function _arrayOf() {\n return Array.prototype.slice.call(arguments);\n };\n\n var _cloneRegExp = function _cloneRegExp(pattern) {\n return new RegExp(pattern.source, (pattern.global ? 'g' : '') + (pattern.ignoreCase ? 'i' : '') + (pattern.multiline ? 'm' : '') + (pattern.sticky ? 'y' : '') + (pattern.unicode ? 'u' : ''));\n };\n\n var _complement = function _complement(f) {\n return function () {\n return !f.apply(this, arguments);\n };\n };\n\n /**\n * Private `concat` function to merge two array-like objects.\n *\n * @private\n * @param {Array|Arguments} [set1=[]] An array-like object.\n * @param {Array|Arguments} [set2=[]] An array-like object.\n * @return {Array} A new, merged array.\n * @example\n *\n * _concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n */\n var _concat = function _concat(set1, set2) {\n set1 = set1 || [];\n set2 = set2 || [];\n var idx;\n var len1 = set1.length;\n var len2 = set2.length;\n var result = [];\n idx = 0;\n while (idx < len1) {\n result[result.length] = set1[idx];\n idx += 1;\n }\n idx = 0;\n while (idx < len2) {\n result[result.length] = set2[idx];\n idx += 1;\n }\n return result;\n };\n\n var _containsWith = function _containsWith(pred, x, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n if (pred(x, list[idx])) {\n return true;\n }\n idx += 1;\n }\n return false;\n };\n\n var _filter = function _filter(fn, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n while (idx < len) {\n if (fn(list[idx])) {\n result[result.length] = list[idx];\n }\n idx += 1;\n }\n return result;\n };\n\n var _forceReduced = function _forceReduced(x) {\n return {\n '@@transducer/value': x,\n '@@transducer/reduced': true\n };\n };\n\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var _functionName = function _functionName(f) {\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var match = String(f).match(/^function (\\w*)/);\n return match == null ? '' : match[1];\n };\n\n var _has = function _has(prop, obj) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n };\n\n var _identity = function _identity(x) {\n return x;\n };\n\n var _isArguments = function () {\n var toString = Object.prototype.toString;\n return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n return toString.call(x) === '[object Arguments]';\n } : function _isArguments(x) {\n return _has('callee', x);\n };\n }();\n\n /**\n * Tests whether or not an object is an array.\n *\n * @private\n * @param {*} val The object to test.\n * @return {Boolean} `true` if `val` is an array, `false` otherwise.\n * @example\n *\n * _isArray([]); //=> true\n * _isArray(null); //=> false\n * _isArray({}); //=> false\n */\n var _isArray = Array.isArray || function _isArray(val) {\n return val != null && val.length >= 0 && Object.prototype.toString.call(val) === '[object Array]';\n };\n\n var _isFunction = function _isNumber(x) {\n return Object.prototype.toString.call(x) === '[object Function]';\n };\n\n /**\n * Determine if the passed argument is an integer.\n *\n * @private\n * @param {*} n\n * @category Type\n * @return {Boolean}\n */\n var _isInteger = Number.isInteger || function _isInteger(n) {\n return n << 0 === n;\n };\n\n var _isNumber = function _isNumber(x) {\n return Object.prototype.toString.call(x) === '[object Number]';\n };\n\n var _isObject = function _isObject(x) {\n return Object.prototype.toString.call(x) === '[object Object]';\n };\n\n var _isPlaceholder = function _isPlaceholder(a) {\n return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n };\n\n var _isRegExp = function _isRegExp(x) {\n return Object.prototype.toString.call(x) === '[object RegExp]';\n };\n\n var _isString = function _isString(x) {\n return Object.prototype.toString.call(x) === '[object String]';\n };\n\n var _isTransformer = function _isTransformer(obj) {\n return typeof obj['@@transducer/step'] === 'function';\n };\n\n var _map = function _map(fn, functor) {\n var idx = 0;\n var len = functor.length;\n var result = Array(len);\n while (idx < len) {\n result[idx] = fn(functor[idx]);\n idx += 1;\n }\n return result;\n };\n\n // Based on https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\n var _objectAssign = function _objectAssign(target) {\n if (target == null) {\n throw new TypeError('Cannot convert undefined or null to object');\n }\n var output = Object(target);\n var idx = 1;\n var length = arguments.length;\n while (idx < length) {\n var source = arguments[idx];\n if (source != null) {\n for (var nextKey in source) {\n if (_has(nextKey, source)) {\n output[nextKey] = source[nextKey];\n }\n }\n }\n idx += 1;\n }\n return output;\n };\n\n var _of = function _of(x) {\n return [x];\n };\n\n var _pipe = function _pipe(f, g) {\n return function () {\n return g.call(this, f.apply(this, arguments));\n };\n };\n\n var _pipeP = function _pipeP(f, g) {\n return function () {\n var ctx = this;\n return f.apply(ctx, arguments).then(function (x) {\n return g.call(ctx, x);\n });\n };\n };\n\n // \\b matches word boundary; [\\b] matches backspace\n var _quote = function _quote(s) {\n var escaped = s.replace(/\\\\/g, '\\\\\\\\').replace(/[\\b]/g, '\\\\b') // \\b matches word boundary; [\\b] matches backspace\n .replace(/\\f/g, '\\\\f').replace(/\\n/g, '\\\\n').replace(/\\r/g, '\\\\r').replace(/\\t/g, '\\\\t').replace(/\\v/g, '\\\\v').replace(/\\0/g, '\\\\0');\n return '\"' + escaped.replace(/\"/g, '\\\\\"') + '\"';\n };\n\n var _reduced = function _reduced(x) {\n return x && x['@@transducer/reduced'] ? x : {\n '@@transducer/value': x,\n '@@transducer/reduced': true\n };\n };\n\n /**\n * An optimized, private array `slice` implementation.\n *\n * @private\n * @param {Arguments|Array} args The array or arguments object to consider.\n * @param {Number} [from=0] The array index to slice from, inclusive.\n * @param {Number} [to=args.length] The array index to slice to, exclusive.\n * @return {Array} A new, sliced array.\n * @example\n *\n * _slice([1, 2, 3, 4, 5], 1, 3); //=> [2, 3]\n *\n * var firstThreeArgs = function(a, b, c, d) {\n * return _slice(arguments, 0, 3);\n * };\n * firstThreeArgs(1, 2, 3, 4); //=> [1, 2, 3]\n */\n var _slice = function _slice(args, from, to) {\n switch (arguments.length) {\n case 1:\n return _slice(args, 0, args.length);\n case 2:\n return _slice(args, from, args.length);\n default:\n var list = [];\n var idx = 0;\n var len = Math.max(0, Math.min(args.length, to) - from);\n while (idx < len) {\n list[idx] = args[from + idx];\n idx += 1;\n }\n return list;\n }\n };\n\n /**\n * Polyfill from .\n */\n var _toISOString = function () {\n var pad = function pad(n) {\n return (n < 10 ? '0' : '') + n;\n };\n return typeof Date.prototype.toISOString === 'function' ? function _toISOString(d) {\n return d.toISOString();\n } : function _toISOString(d) {\n return d.getUTCFullYear() + '-' + pad(d.getUTCMonth() + 1) + '-' + pad(d.getUTCDate()) + 'T' + pad(d.getUTCHours()) + ':' + pad(d.getUTCMinutes()) + ':' + pad(d.getUTCSeconds()) + '.' + (d.getUTCMilliseconds() / 1000).toFixed(3).slice(2, 5) + 'Z';\n };\n }();\n\n var _xfBase = {\n init: function () {\n return this.xf['@@transducer/init']();\n },\n result: function (result) {\n return this.xf['@@transducer/result'](result);\n }\n };\n\n var _xwrap = function () {\n function XWrap(fn) {\n this.f = fn;\n }\n XWrap.prototype['@@transducer/init'] = function () {\n throw new Error('init not implemented on XWrap');\n };\n XWrap.prototype['@@transducer/result'] = function (acc) {\n return acc;\n };\n XWrap.prototype['@@transducer/step'] = function (acc, x) {\n return this.f(acc, x);\n };\n return function _xwrap(fn) {\n return new XWrap(fn);\n };\n }();\n\n var _aperture = function _aperture(n, list) {\n var idx = 0;\n var limit = list.length - (n - 1);\n var acc = new Array(limit >= 0 ? limit : 0);\n while (idx < limit) {\n acc[idx] = _slice(list, idx, idx + n);\n idx += 1;\n }\n return acc;\n };\n\n var _assign = typeof Object.assign === 'function' ? Object.assign : _objectAssign;\n\n /**\n * Similar to hasMethod, this checks whether a function has a [methodname]\n * function. If it isn't an array it will execute that function otherwise it\n * will default to the ramda implementation.\n *\n * @private\n * @param {Function} fn ramda implemtation\n * @param {String} methodname property to check for a custom implementation\n * @return {Object} Whatever the return value of the method is.\n */\n var _checkForMethod = function _checkForMethod(methodname, fn) {\n return function () {\n var length = arguments.length;\n if (length === 0) {\n return fn();\n }\n var obj = arguments[length - 1];\n return _isArray(obj) || typeof obj[methodname] !== 'function' ? fn.apply(this, arguments) : obj[methodname].apply(obj, _slice(arguments, 0, length - 1));\n };\n };\n\n /**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curry1 = function _curry1(fn) {\n return function f1(a) {\n if (arguments.length === 0 || _isPlaceholder(a)) {\n return f1;\n } else {\n return fn.apply(this, arguments);\n }\n };\n };\n\n /**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curry2 = function _curry2(fn) {\n return function f2(a, b) {\n switch (arguments.length) {\n case 0:\n return f2;\n case 1:\n return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n return fn(a, _b);\n });\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b);\n }) : fn(a, b);\n }\n };\n };\n\n /**\n * Optimized internal three-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curry3 = function _curry3(fn) {\n return function f3(a, b, c) {\n switch (arguments.length) {\n case 0:\n return f3;\n case 1:\n return _isPlaceholder(a) ? f3 : _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n });\n case 2:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f3 : _isPlaceholder(a) ? _curry2(function (_a, _c) {\n return fn(_a, b, _c);\n }) : _isPlaceholder(b) ? _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n }) : _curry1(function (_c) {\n return fn(a, b, _c);\n });\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) && _isPlaceholder(c) ? f3 : _isPlaceholder(a) && _isPlaceholder(b) ? _curry2(function (_a, _b) {\n return fn(_a, _b, c);\n }) : _isPlaceholder(a) && _isPlaceholder(c) ? _curry2(function (_a, _c) {\n return fn(_a, b, _c);\n }) : _isPlaceholder(b) && _isPlaceholder(c) ? _curry2(function (_b, _c) {\n return fn(a, _b, _c);\n }) : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b, c);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b, c);\n }) : _isPlaceholder(c) ? _curry1(function (_c) {\n return fn(a, b, _c);\n }) : fn(a, b, c);\n }\n };\n };\n\n /**\n * Internal curryN function.\n *\n * @private\n * @category Function\n * @param {Number} length The arity of the curried function.\n * @param {Array} received An array of arguments received thus far.\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\n var _curryN = function _curryN(length, received, fn) {\n return function () {\n var combined = [];\n var argsIdx = 0;\n var left = length;\n var combinedIdx = 0;\n while (combinedIdx < received.length || argsIdx < arguments.length) {\n var result;\n if (combinedIdx < received.length && (!_isPlaceholder(received[combinedIdx]) || argsIdx >= arguments.length)) {\n result = received[combinedIdx];\n } else {\n result = arguments[argsIdx];\n argsIdx += 1;\n }\n combined[combinedIdx] = result;\n if (!_isPlaceholder(result)) {\n left -= 1;\n }\n combinedIdx += 1;\n }\n return left <= 0 ? fn.apply(this, combined) : _arity(left, _curryN(length, combined, fn));\n };\n };\n\n /**\n * Returns a function that dispatches with different strategies based on the\n * object in list position (last argument). If it is an array, executes [fn].\n * Otherwise, if it has a function with [methodname], it will execute that\n * function (functor case). Otherwise, if it is a transformer, uses transducer\n * [xf] to return a new transformer (transducer case). Otherwise, it will\n * default to executing [fn].\n *\n * @private\n * @param {String} methodname property to check for a custom implementation\n * @param {Function} xf transducer to initialize if object is transformer\n * @param {Function} fn default ramda implementation\n * @return {Function} A function that dispatches on object in list position\n */\n var _dispatchable = function _dispatchable(methodname, xf, fn) {\n return function () {\n var length = arguments.length;\n if (length === 0) {\n return fn();\n }\n var obj = arguments[length - 1];\n if (!_isArray(obj)) {\n var args = _slice(arguments, 0, length - 1);\n if (typeof obj[methodname] === 'function') {\n return obj[methodname].apply(obj, args);\n }\n if (_isTransformer(obj)) {\n var transducer = xf.apply(null, args);\n return transducer(obj);\n }\n }\n return fn.apply(this, arguments);\n };\n };\n\n var _dropLastWhile = function dropLastWhile(pred, list) {\n var idx = list.length - 1;\n while (idx >= 0 && pred(list[idx])) {\n idx -= 1;\n }\n return _slice(list, 0, idx + 1);\n };\n\n var _xall = function () {\n function XAll(f, xf) {\n this.xf = xf;\n this.f = f;\n this.all = true;\n }\n XAll.prototype['@@transducer/init'] = _xfBase.init;\n XAll.prototype['@@transducer/result'] = function (result) {\n if (this.all) {\n result = this.xf['@@transducer/step'](result, true);\n }\n return this.xf['@@transducer/result'](result);\n };\n XAll.prototype['@@transducer/step'] = function (result, input) {\n if (!this.f(input)) {\n this.all = false;\n result = _reduced(this.xf['@@transducer/step'](result, false));\n }\n return result;\n };\n return _curry2(function _xall(f, xf) {\n return new XAll(f, xf);\n });\n }();\n\n var _xany = function () {\n function XAny(f, xf) {\n this.xf = xf;\n this.f = f;\n this.any = false;\n }\n XAny.prototype['@@transducer/init'] = _xfBase.init;\n XAny.prototype['@@transducer/result'] = function (result) {\n if (!this.any) {\n result = this.xf['@@transducer/step'](result, false);\n }\n return this.xf['@@transducer/result'](result);\n };\n XAny.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.any = true;\n result = _reduced(this.xf['@@transducer/step'](result, true));\n }\n return result;\n };\n return _curry2(function _xany(f, xf) {\n return new XAny(f, xf);\n });\n }();\n\n var _xaperture = function () {\n function XAperture(n, xf) {\n this.xf = xf;\n this.pos = 0;\n this.full = false;\n this.acc = new Array(n);\n }\n XAperture.prototype['@@transducer/init'] = _xfBase.init;\n XAperture.prototype['@@transducer/result'] = function (result) {\n this.acc = null;\n return this.xf['@@transducer/result'](result);\n };\n XAperture.prototype['@@transducer/step'] = function (result, input) {\n this.store(input);\n return this.full ? this.xf['@@transducer/step'](result, this.getCopy()) : result;\n };\n XAperture.prototype.store = function (input) {\n this.acc[this.pos] = input;\n this.pos += 1;\n if (this.pos === this.acc.length) {\n this.pos = 0;\n this.full = true;\n }\n };\n XAperture.prototype.getCopy = function () {\n return _concat(_slice(this.acc, this.pos), _slice(this.acc, 0, this.pos));\n };\n return _curry2(function _xaperture(n, xf) {\n return new XAperture(n, xf);\n });\n }();\n\n var _xdrop = function () {\n function XDrop(n, xf) {\n this.xf = xf;\n this.n = n;\n }\n XDrop.prototype['@@transducer/init'] = _xfBase.init;\n XDrop.prototype['@@transducer/result'] = _xfBase.result;\n XDrop.prototype['@@transducer/step'] = function (result, input) {\n if (this.n > 0) {\n this.n -= 1;\n return result;\n }\n return this.xf['@@transducer/step'](result, input);\n };\n return _curry2(function _xdrop(n, xf) {\n return new XDrop(n, xf);\n });\n }();\n\n var _xdropLast = function () {\n function XDropLast(n, xf) {\n this.xf = xf;\n this.pos = 0;\n this.full = false;\n this.acc = new Array(n);\n }\n XDropLast.prototype['@@transducer/init'] = _xfBase.init;\n XDropLast.prototype['@@transducer/result'] = function (result) {\n this.acc = null;\n return this.xf['@@transducer/result'](result);\n };\n XDropLast.prototype['@@transducer/step'] = function (result, input) {\n if (this.full) {\n result = this.xf['@@transducer/step'](result, this.acc[this.pos]);\n }\n this.store(input);\n return result;\n };\n XDropLast.prototype.store = function (input) {\n this.acc[this.pos] = input;\n this.pos += 1;\n if (this.pos === this.acc.length) {\n this.pos = 0;\n this.full = true;\n }\n };\n return _curry2(function _xdropLast(n, xf) {\n return new XDropLast(n, xf);\n });\n }();\n\n var _xdropRepeatsWith = function () {\n function XDropRepeatsWith(pred, xf) {\n this.xf = xf;\n this.pred = pred;\n this.lastValue = undefined;\n this.seenFirstValue = false;\n }\n XDropRepeatsWith.prototype['@@transducer/init'] = function () {\n return this.xf['@@transducer/init']();\n };\n XDropRepeatsWith.prototype['@@transducer/result'] = function (result) {\n return this.xf['@@transducer/result'](result);\n };\n XDropRepeatsWith.prototype['@@transducer/step'] = function (result, input) {\n var sameAsLast = false;\n if (!this.seenFirstValue) {\n this.seenFirstValue = true;\n } else if (this.pred(this.lastValue, input)) {\n sameAsLast = true;\n }\n this.lastValue = input;\n return sameAsLast ? result : this.xf['@@transducer/step'](result, input);\n };\n return _curry2(function _xdropRepeatsWith(pred, xf) {\n return new XDropRepeatsWith(pred, xf);\n });\n }();\n\n var _xdropWhile = function () {\n function XDropWhile(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XDropWhile.prototype['@@transducer/init'] = _xfBase.init;\n XDropWhile.prototype['@@transducer/result'] = _xfBase.result;\n XDropWhile.prototype['@@transducer/step'] = function (result, input) {\n if (this.f) {\n if (this.f(input)) {\n return result;\n }\n this.f = null;\n }\n return this.xf['@@transducer/step'](result, input);\n };\n return _curry2(function _xdropWhile(f, xf) {\n return new XDropWhile(f, xf);\n });\n }();\n\n var _xfilter = function () {\n function XFilter(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XFilter.prototype['@@transducer/init'] = _xfBase.init;\n XFilter.prototype['@@transducer/result'] = _xfBase.result;\n XFilter.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.xf['@@transducer/step'](result, input) : result;\n };\n return _curry2(function _xfilter(f, xf) {\n return new XFilter(f, xf);\n });\n }();\n\n var _xfind = function () {\n function XFind(f, xf) {\n this.xf = xf;\n this.f = f;\n this.found = false;\n }\n XFind.prototype['@@transducer/init'] = _xfBase.init;\n XFind.prototype['@@transducer/result'] = function (result) {\n if (!this.found) {\n result = this.xf['@@transducer/step'](result, void 0);\n }\n return this.xf['@@transducer/result'](result);\n };\n XFind.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.found = true;\n result = _reduced(this.xf['@@transducer/step'](result, input));\n }\n return result;\n };\n return _curry2(function _xfind(f, xf) {\n return new XFind(f, xf);\n });\n }();\n\n var _xfindIndex = function () {\n function XFindIndex(f, xf) {\n this.xf = xf;\n this.f = f;\n this.idx = -1;\n this.found = false;\n }\n XFindIndex.prototype['@@transducer/init'] = _xfBase.init;\n XFindIndex.prototype['@@transducer/result'] = function (result) {\n if (!this.found) {\n result = this.xf['@@transducer/step'](result, -1);\n }\n return this.xf['@@transducer/result'](result);\n };\n XFindIndex.prototype['@@transducer/step'] = function (result, input) {\n this.idx += 1;\n if (this.f(input)) {\n this.found = true;\n result = _reduced(this.xf['@@transducer/step'](result, this.idx));\n }\n return result;\n };\n return _curry2(function _xfindIndex(f, xf) {\n return new XFindIndex(f, xf);\n });\n }();\n\n var _xfindLast = function () {\n function XFindLast(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XFindLast.prototype['@@transducer/init'] = _xfBase.init;\n XFindLast.prototype['@@transducer/result'] = function (result) {\n return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.last));\n };\n XFindLast.prototype['@@transducer/step'] = function (result, input) {\n if (this.f(input)) {\n this.last = input;\n }\n return result;\n };\n return _curry2(function _xfindLast(f, xf) {\n return new XFindLast(f, xf);\n });\n }();\n\n var _xfindLastIndex = function () {\n function XFindLastIndex(f, xf) {\n this.xf = xf;\n this.f = f;\n this.idx = -1;\n this.lastIdx = -1;\n }\n XFindLastIndex.prototype['@@transducer/init'] = _xfBase.init;\n XFindLastIndex.prototype['@@transducer/result'] = function (result) {\n return this.xf['@@transducer/result'](this.xf['@@transducer/step'](result, this.lastIdx));\n };\n XFindLastIndex.prototype['@@transducer/step'] = function (result, input) {\n this.idx += 1;\n if (this.f(input)) {\n this.lastIdx = this.idx;\n }\n return result;\n };\n return _curry2(function _xfindLastIndex(f, xf) {\n return new XFindLastIndex(f, xf);\n });\n }();\n\n var _xmap = function () {\n function XMap(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XMap.prototype['@@transducer/init'] = _xfBase.init;\n XMap.prototype['@@transducer/result'] = _xfBase.result;\n XMap.prototype['@@transducer/step'] = function (result, input) {\n return this.xf['@@transducer/step'](result, this.f(input));\n };\n return _curry2(function _xmap(f, xf) {\n return new XMap(f, xf);\n });\n }();\n\n var _xtake = function () {\n function XTake(n, xf) {\n this.xf = xf;\n this.n = n;\n }\n XTake.prototype['@@transducer/init'] = _xfBase.init;\n XTake.prototype['@@transducer/result'] = _xfBase.result;\n XTake.prototype['@@transducer/step'] = function (result, input) {\n if (this.n === 0) {\n return _reduced(result);\n } else {\n this.n -= 1;\n return this.xf['@@transducer/step'](result, input);\n }\n };\n return _curry2(function _xtake(n, xf) {\n return new XTake(n, xf);\n });\n }();\n\n var _xtakeWhile = function () {\n function XTakeWhile(f, xf) {\n this.xf = xf;\n this.f = f;\n }\n XTakeWhile.prototype['@@transducer/init'] = _xfBase.init;\n XTakeWhile.prototype['@@transducer/result'] = _xfBase.result;\n XTakeWhile.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.xf['@@transducer/step'](result, input) : _reduced(result);\n };\n return _curry2(function _xtakeWhile(f, xf) {\n return new XTakeWhile(f, xf);\n });\n }();\n\n /**\n * Adds two values.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a\n * @param {Number} b\n * @return {Number}\n * @see R.subtract\n * @example\n *\n * R.add(2, 3); //=> 5\n * R.add(7)(10); //=> 17\n */\n var add = _curry2(function add(a, b) {\n return Number(a) + Number(b);\n });\n\n /**\n * Applies a function to the value at the given index of an array, returning a\n * new copy of the array with the element at the given index replaced with the\n * result of the function application.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig (a -> a) -> Number -> [a] -> [a]\n * @param {Function} fn The function to apply.\n * @param {Number} idx The index.\n * @param {Array|Arguments} list An array-like object whose value\n * at the supplied index will be replaced.\n * @return {Array} A copy of the supplied array-like object with\n * the element at index `idx` replaced with the value\n * returned by applying `fn` to the existing element.\n * @see R.update\n * @example\n *\n * R.adjust(R.add(10), 1, [0, 1, 2]); //=> [0, 11, 2]\n * R.adjust(R.add(10))(1)([0, 1, 2]); //=> [0, 11, 2]\n */\n var adjust = _curry3(function adjust(fn, idx, list) {\n if (idx >= list.length || idx < -list.length) {\n return list;\n }\n var start = idx < 0 ? list.length : 0;\n var _idx = start + idx;\n var _list = _concat(list);\n _list[_idx] = fn(list[_idx]);\n return _list;\n });\n\n /**\n * Returns `true` if all elements of the list match the predicate, `false` if\n * there are any that don't.\n *\n * Dispatches to the `all` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by every element, `false`\n * otherwise.\n * @see R.any, R.none, R.transduce\n * @example\n *\n * var lessThan2 = R.flip(R.lt)(2);\n * var lessThan3 = R.flip(R.lt)(3);\n * R.all(lessThan2)([1, 2]); //=> false\n * R.all(lessThan3)([1, 2]); //=> true\n */\n var all = _curry2(_dispatchable('all', _xall, function all(fn, list) {\n var idx = 0;\n while (idx < list.length) {\n if (!fn(list[idx])) {\n return false;\n }\n idx += 1;\n }\n return true;\n }));\n\n /**\n * Returns a function that always returns the given value. Note that for\n * non-primitives the value returned is a reference to the original value.\n *\n * This function is known as `const`, `constant`, or `K` (for K combinator) in\n * other languages and libraries.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> (* -> a)\n * @param {*} val The value to wrap in a function\n * @return {Function} A Function :: * -> val.\n * @example\n *\n * var t = R.always('Tee');\n * t(); //=> 'Tee'\n */\n var always = _curry1(function always(val) {\n return function () {\n return val;\n };\n });\n\n /**\n * Returns `true` if both arguments are `true`; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> * -> *\n * @param {Boolean} a A boolean value\n * @param {Boolean} b A boolean value\n * @return {Boolean} `true` if both arguments are `true`, `false` otherwise\n * @see R.both\n * @example\n *\n * R.and(true, true); //=> true\n * R.and(true, false); //=> false\n * R.and(false, true); //=> false\n * R.and(false, false); //=> false\n */\n var and = _curry2(function and(a, b) {\n return a && b;\n });\n\n /**\n * Returns `true` if at least one of elements of the list match the predicate,\n * `false` otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is satisfied by at least one element, `false`\n * otherwise.\n * @see R.all, R.none, R.transduce\n * @example\n *\n * var lessThan0 = R.flip(R.lt)(0);\n * var lessThan2 = R.flip(R.lt)(2);\n * R.any(lessThan0)([1, 2]); //=> false\n * R.any(lessThan2)([1, 2]); //=> true\n */\n var any = _curry2(_dispatchable('any', _xany, function any(fn, list) {\n var idx = 0;\n while (idx < list.length) {\n if (fn(list[idx])) {\n return true;\n }\n idx += 1;\n }\n return false;\n }));\n\n /**\n * Returns a new list, composed of n-tuples of consecutive elements If `n` is\n * greater than the length of the list, an empty list is returned.\n *\n * Dispatches to the `aperture` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @param {Number} n The size of the tuples to create\n * @param {Array} list The list to split into `n`-tuples\n * @return {Array} The new list.\n * @see R.transduce\n * @example\n *\n * R.aperture(2, [1, 2, 3, 4, 5]); //=> [[1, 2], [2, 3], [3, 4], [4, 5]]\n * R.aperture(3, [1, 2, 3, 4, 5]); //=> [[1, 2, 3], [2, 3, 4], [3, 4, 5]]\n * R.aperture(7, [1, 2, 3, 4, 5]); //=> []\n */\n var aperture = _curry2(_dispatchable('aperture', _xaperture, _aperture));\n\n /**\n * Returns a new list containing the contents of the given list, followed by\n * the given element.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The element to add to the end of the new list.\n * @param {Array} list The list whose contents will be added to the beginning of the output\n * list.\n * @return {Array} A new list containing the contents of the old list followed by `el`.\n * @see R.prepend\n * @example\n *\n * R.append('tests', ['write', 'more']); //=> ['write', 'more', 'tests']\n * R.append('tests', []); //=> ['tests']\n * R.append(['tests'], ['write', 'more']); //=> ['write', 'more', ['tests']]\n */\n var append = _curry2(function append(el, list) {\n return _concat(list, [el]);\n });\n\n /**\n * Applies function `fn` to the argument list `args`. This is useful for\n * creating a fixed-arity function from a variadic function. `fn` should be a\n * bound function if context is significant.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> a) -> [*] -> a\n * @param {Function} fn\n * @param {Array} args\n * @return {*}\n * @see R.call, R.unapply\n * @example\n *\n * var nums = [1, 2, 3, -99, 42, 6, 7];\n * R.apply(Math.max, nums); //=> 42\n */\n var apply = _curry2(function apply(fn, args) {\n return fn.apply(this, args);\n });\n\n /**\n * Makes a shallow clone of an object, setting or overriding the specified\n * property with the given value. Note that this copies and flattens prototype\n * properties onto the new object as well. All non-primitive properties are\n * copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig String -> a -> {k: v} -> {k: v}\n * @param {String} prop the property name to set\n * @param {*} val the new value\n * @param {Object} obj the object to clone\n * @return {Object} a new object similar to the original except for the specified property.\n * @see R.dissoc\n * @example\n *\n * R.assoc('c', 3, {a: 1, b: 2}); //=> {a: 1, b: 2, c: 3}\n */\n var assoc = _curry3(function assoc(prop, val, obj) {\n var result = {};\n for (var p in obj) {\n result[p] = obj[p];\n }\n result[prop] = val;\n return result;\n });\n\n /**\n * Makes a shallow clone of an object, setting or overriding the nodes required\n * to create the given path, and placing the specific value at the tail end of\n * that path. Note that this copies and flattens prototype properties onto the\n * new object as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig [String] -> a -> {k: v} -> {k: v}\n * @param {Array} path the path to set\n * @param {*} val the new value\n * @param {Object} obj the object to clone\n * @return {Object} a new object similar to the original except along the specified path.\n * @see R.dissocPath\n * @example\n *\n * R.assocPath(['a', 'b', 'c'], 42, {a: {b: {c: 0}}}); //=> {a: {b: {c: 42}}}\n */\n var assocPath = _curry3(function assocPath(path, val, obj) {\n switch (path.length) {\n case 0:\n return val;\n case 1:\n return assoc(path[0], val, obj);\n default:\n return assoc(path[0], assocPath(_slice(path, 1), val, Object(obj[path[0]])), obj);\n }\n });\n\n /**\n * Creates a function that is bound to a context.\n * Note: `R.bind` does not provide the additional argument-binding capabilities of\n * [Function.prototype.bind](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/bind).\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Function\n * @category Object\n * @sig (* -> *) -> {*} -> (* -> *)\n * @param {Function} fn The function to bind to context\n * @param {Object} thisObj The context to bind `fn` to\n * @return {Function} A function that will execute in the context of `thisObj`.\n * @see R.partial\n */\n var bind = _curry2(function bind(fn, thisObj) {\n return _arity(fn.length, function () {\n return fn.apply(thisObj, arguments);\n });\n });\n\n /**\n * Restricts a number to be within a range.\n *\n * Also works for other ordered types such as Strings and Dates.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Relation\n * @sig Ord a => a -> a -> a -> a\n * @param {Number} minimum number\n * @param {Number} maximum number\n * @param {Number} value to be clamped\n * @return {Number} Returns the clamped value\n * @example\n *\n * R.clamp(1, 10, -1) // => 1\n * R.clamp(1, 10, 11) // => 10\n * R.clamp(1, 10, 4) // => 4\n */\n var clamp = _curry3(function clamp(min, max, value) {\n if (min > max) {\n throw new Error('min must not be greater than max in clamp(min, max, value)');\n }\n return value < min ? min : value > max ? max : value;\n });\n\n /**\n * Makes a comparator function out of a function that reports whether the first\n * element is less than the second.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a, b -> Boolean) -> (a, b -> Number)\n * @param {Function} pred A predicate function of arity two.\n * @return {Function} A Function :: a -> b -> Int that returns `-1` if a < b, `1` if b < a, otherwise `0`.\n * @example\n *\n * var cmp = R.comparator((a, b) => a.age < b.age);\n * var people = [\n * // ...\n * ];\n * R.sort(cmp, people);\n */\n var comparator = _curry1(function comparator(pred) {\n return function (a, b) {\n return pred(a, b) ? -1 : pred(b, a) ? 1 : 0;\n };\n });\n\n /**\n * Returns a curried equivalent of the provided function, with the specified\n * arity. The curried function has two unusual capabilities. First, its\n * arguments needn't be provided one at a time. If `g` is `R.curryN(3, f)`, the\n * following are equivalent:\n *\n * - `g(1)(2)(3)`\n * - `g(1)(2, 3)`\n * - `g(1, 2)(3)`\n * - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value `R.__` may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is `R.__`, the\n * following are equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curry\n * @example\n *\n * var sumArgs = (...args) => R.sum(args);\n *\n * var curriedAddFourNumbers = R.curryN(4, sumArgs);\n * var f = curriedAddFourNumbers(1, 2);\n * var g = f(3);\n * g(4); //=> 10\n */\n var curryN = _curry2(function curryN(length, fn) {\n if (length === 1) {\n return _curry1(fn);\n }\n return _arity(length, _curryN(length, [], fn));\n });\n\n /**\n * Decrements its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @see R.inc\n * @example\n *\n * R.dec(42); //=> 41\n */\n var dec = add(-1);\n\n /**\n * Returns the second argument if it is not `null`, `undefined` or `NaN`\n * otherwise the first argument is returned.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Logic\n * @sig a -> b -> a | b\n * @param {a} val The default value.\n * @param {b} val The value to return if it is not null or undefined\n * @return {*} The the second value or the default value\n * @example\n *\n * var defaultTo42 = R.defaultTo(42);\n *\n * defaultTo42(null); //=> 42\n * defaultTo42(undefined); //=> 42\n * defaultTo42('Ramda'); //=> 'Ramda'\n * defaultTo42(parseInt('string')); //=> 42\n */\n var defaultTo = _curry2(function defaultTo(d, v) {\n return v == null || v !== v ? d : v;\n });\n\n /**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Duplication is determined according to the\n * value returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.difference\n * @example\n *\n * var cmp = (x, y) => x.a === y.a;\n * var l1 = [{a: 1}, {a: 2}, {a: 3}];\n * var l2 = [{a: 3}, {a: 4}];\n * R.differenceWith(cmp, l1, l2); //=> [{a: 1}, {a: 2}]\n */\n var differenceWith = _curry3(function differenceWith(pred, first, second) {\n var out = [];\n var idx = 0;\n var firstLen = first.length;\n while (idx < firstLen) {\n if (!_containsWith(pred, first[idx], second) && !_containsWith(pred, first[idx], out)) {\n out.push(first[idx]);\n }\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a new object that does not contain a `prop` property.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Object\n * @sig String -> {k: v} -> {k: v}\n * @param {String} prop the name of the property to dissociate\n * @param {Object} obj the object to clone\n * @return {Object} a new object similar to the original but without the specified property\n * @see R.assoc\n * @example\n *\n * R.dissoc('b', {a: 1, b: 2, c: 3}); //=> {a: 1, c: 3}\n */\n var dissoc = _curry2(function dissoc(prop, obj) {\n var result = {};\n for (var p in obj) {\n if (p !== prop) {\n result[p] = obj[p];\n }\n }\n return result;\n });\n\n /**\n * Makes a shallow clone of an object, omitting the property at the given path.\n * Note that this copies and flattens prototype properties onto the new object\n * as well. All non-primitive properties are copied by reference.\n *\n * @func\n * @memberOf R\n * @since v0.11.0\n * @category Object\n * @sig [String] -> {k: v} -> {k: v}\n * @param {Array} path the path to set\n * @param {Object} obj the object to clone\n * @return {Object} a new object without the property at path\n * @see R.assocPath\n * @example\n *\n * R.dissocPath(['a', 'b', 'c'], {a: {b: {c: 42}}}); //=> {a: {b: {}}}\n */\n var dissocPath = _curry2(function dissocPath(path, obj) {\n switch (path.length) {\n case 0:\n return obj;\n case 1:\n return dissoc(path[0], obj);\n default:\n var head = path[0];\n var tail = _slice(path, 1);\n return obj[head] == null ? obj : assoc(head, dissocPath(tail, obj[head]), obj);\n }\n });\n\n /**\n * Divides two numbers. Equivalent to `a / b`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a / b`.\n * @see R.multiply\n * @example\n *\n * R.divide(71, 100); //=> 0.71\n *\n * var half = R.divide(R.__, 2);\n * half(42); //=> 21\n *\n * var reciprocal = R.divide(1);\n * reciprocal(4); //=> 0.25\n */\n var divide = _curry2(function divide(a, b) {\n return a / b;\n });\n\n /**\n * Returns a new list containing the last `n` elements of a given list, passing\n * each value to the supplied predicate function, skipping elements while the\n * predicate function returns `true`. The predicate function is passed one\n * argument: *(value)*.\n *\n * Dispatches to the `dropWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.takeWhile, R.transduce, R.addIndex\n * @example\n *\n * var lteTwo = x => x <= 2;\n *\n * R.dropWhile(lteTwo, [1, 2, 3, 4, 3, 2, 1]); //=> [3, 4, 3, 2, 1]\n */\n var dropWhile = _curry2(_dispatchable('dropWhile', _xdropWhile, function dropWhile(pred, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len && pred(list[idx])) {\n idx += 1;\n }\n return _slice(list, idx);\n }));\n\n /**\n * Returns the empty value of its argument's type. Ramda defines the empty\n * value of Array (`[]`), Object (`{}`), String (`''`), and Arguments. Other\n * types are supported if they define `.empty` and/or\n * `.prototype.empty`.\n *\n * Dispatches to the `empty` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> a\n * @param {*} x\n * @return {*}\n * @example\n *\n * R.empty(Just(42)); //=> Nothing()\n * R.empty([1, 2, 3]); //=> []\n * R.empty('unicorns'); //=> ''\n * R.empty({x: 1, y: 2}); //=> {}\n */\n // else\n var empty = _curry1(function empty(x) {\n return x != null && typeof x.empty === 'function' ? x.empty() : x != null && x.constructor != null && typeof x.constructor.empty === 'function' ? x.constructor.empty() : _isArray(x) ? [] : _isString(x) ? '' : _isObject(x) ? {} : _isArguments(x) ? function () {\n return arguments;\n }() : // else\n void 0;\n });\n\n /**\n * Creates a new object by recursively evolving a shallow copy of `object`,\n * according to the `transformation` functions. All non-primitive properties\n * are copied by reference.\n *\n * A `transformation` function will not be invoked if its corresponding key\n * does not exist in the evolved object.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {k: (v -> v)} -> {k: v} -> {k: v}\n * @param {Object} transformations The object specifying transformation functions to apply\n * to the object.\n * @param {Object} object The object to be transformed.\n * @return {Object} The transformed object.\n * @example\n *\n * var tomato = {firstName: ' Tomato ', data: {elapsed: 100, remaining: 1400}, id:123};\n * var transformations = {\n * firstName: R.trim,\n * lastName: R.trim, // Will not get invoked.\n * data: {elapsed: R.add(1), remaining: R.add(-1)}\n * };\n * R.evolve(transformations, tomato); //=> {firstName: 'Tomato', data: {elapsed: 101, remaining: 1399}, id:123}\n */\n var evolve = _curry2(function evolve(transformations, object) {\n var result = {};\n var transformation, key, type;\n for (key in object) {\n transformation = transformations[key];\n type = typeof transformation;\n result[key] = type === 'function' ? transformation(object[key]) : type === 'object' ? evolve(transformations[key], object[key]) : object[key];\n }\n return result;\n });\n\n /**\n * Returns the first element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `find` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1}, {a: 2}, {a: 3}];\n * R.find(R.propEq('a', 2))(xs); //=> {a: 2}\n * R.find(R.propEq('a', 4))(xs); //=> undefined\n */\n var find = _curry2(_dispatchable('find', _xfind, function find(fn, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n if (fn(list[idx])) {\n return list[idx];\n }\n idx += 1;\n }\n }));\n\n /**\n * Returns the index of the first element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Dispatches to the `findIndex` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1}, {a: 2}, {a: 3}];\n * R.findIndex(R.propEq('a', 2))(xs); //=> 1\n * R.findIndex(R.propEq('a', 4))(xs); //=> -1\n */\n var findIndex = _curry2(_dispatchable('findIndex', _xfindIndex, function findIndex(fn, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n if (fn(list[idx])) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n }));\n\n /**\n * Returns the last element of the list which matches the predicate, or\n * `undefined` if no element matches.\n *\n * Dispatches to the `findLast` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> a | undefined\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Object} The element found, or `undefined`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n * R.findLast(R.propEq('a', 1))(xs); //=> {a: 1, b: 1}\n * R.findLast(R.propEq('a', 4))(xs); //=> undefined\n */\n var findLast = _curry2(_dispatchable('findLast', _xfindLast, function findLast(fn, list) {\n var idx = list.length - 1;\n while (idx >= 0) {\n if (fn(list[idx])) {\n return list[idx];\n }\n idx -= 1;\n }\n }));\n\n /**\n * Returns the index of the last element of the list which matches the\n * predicate, or `-1` if no element matches.\n *\n * Dispatches to the `findLastIndex` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> Boolean) -> [a] -> Number\n * @param {Function} fn The predicate function used to determine if the element is the\n * desired one.\n * @param {Array} list The array to consider.\n * @return {Number} The index of the element found, or `-1`.\n * @see R.transduce\n * @example\n *\n * var xs = [{a: 1, b: 0}, {a:1, b: 1}];\n * R.findLastIndex(R.propEq('a', 1))(xs); //=> 1\n * R.findLastIndex(R.propEq('a', 4))(xs); //=> -1\n */\n var findLastIndex = _curry2(_dispatchable('findLastIndex', _xfindLastIndex, function findLastIndex(fn, list) {\n var idx = list.length - 1;\n while (idx >= 0) {\n if (fn(list[idx])) {\n return idx;\n }\n idx -= 1;\n }\n return -1;\n }));\n\n /**\n * Iterate over an input `list`, calling a provided function `fn` for each\n * element in the list.\n *\n * `fn` receives one argument: *(value)*.\n *\n * Note: `R.forEach` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.forEach` method. For more\n * details on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach#Description\n *\n * Also note that, unlike `Array.prototype.forEach`, Ramda's `forEach` returns\n * the original array. In some libraries this function is named `each`.\n *\n * Dispatches to the `forEach` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig (a -> *) -> [a] -> [a]\n * @param {Function} fn The function to invoke. Receives one argument, `value`.\n * @param {Array} list The list to iterate over.\n * @return {Array} The original list.\n * @see R.addIndex\n * @example\n *\n * var printXPlusFive = x => console.log(x + 5);\n * R.forEach(printXPlusFive, [1, 2, 3]); //=> [1, 2, 3]\n * //-> 6\n * //-> 7\n * //-> 8\n */\n var forEach = _curry2(_checkForMethod('forEach', function forEach(fn, list) {\n var len = list.length;\n var idx = 0;\n while (idx < len) {\n fn(list[idx]);\n idx += 1;\n }\n return list;\n }));\n\n /**\n * Creates a new object out of a list key-value pairs.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [[k,v]] -> {k: v}\n * @param {Array} pairs An array of two-element arrays that will be the keys and values of the output object.\n * @return {Object} The object made by pairing up `keys` and `values`.\n * @see R.toPairs, R.pair\n * @example\n *\n * R.fromPairs([['a', 1], ['b', 2], ['c', 3]]); //=> {a: 1, b: 2, c: 3}\n */\n var fromPairs = _curry1(function fromPairs(pairs) {\n var idx = 0;\n var len = pairs.length;\n var out = {};\n while (idx < len) {\n if (_isArray(pairs[idx]) && pairs[idx].length) {\n out[pairs[idx][0]] = pairs[idx][1];\n }\n idx += 1;\n }\n return out;\n });\n\n /**\n * Takes a list and returns a list of lists where each sublist's elements are\n * all \"equal\" according to the provided equality function.\n *\n * @func\n * @memberOf R\n * @since v0.21.0\n * @category List\n * @sig (a, a -> Boolean) -> [a] -> [[a]]\n * @param {Function} fn Function for determining whether two given (adjacent)\n * elements should be in the same group\n * @param {Array} list The array to group. Also accepts a string, which will be\n * treated as a list of characters.\n * @return {List} A list that contains sublists of equal elements,\n * whose concatenations is equal to the original list.\n * @example\n *\n * groupWith(R.equals, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * // [[0], [1, 1], [2, 3, 5, 8, 13, 21]]\n *\n * groupWith((a, b) => a % 2 === b % 2, [0, 1, 1, 2, 3, 5, 8, 13, 21])\n * // [[0], [1, 1], [2], [3, 5], [8], [13, 21]]\n *\n * R.groupWith(R.eqBy(isVowel), 'aestiou')\n * // ['ae', 'st', 'iou']\n */\n var groupWith = _curry2(function (fn, list) {\n var res = [];\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n var nextidx = idx + 1;\n while (nextidx < len && fn(list[idx], list[nextidx])) {\n nextidx += 1;\n }\n res.push(list.slice(idx, nextidx));\n idx = nextidx;\n }\n return res;\n });\n\n /**\n * Returns `true` if the first argument is greater than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.lt\n * @example\n *\n * R.gt(2, 1); //=> true\n * R.gt(2, 2); //=> false\n * R.gt(2, 3); //=> false\n * R.gt('a', 'z'); //=> false\n * R.gt('z', 'a'); //=> true\n */\n var gt = _curry2(function gt(a, b) {\n return a > b;\n });\n\n /**\n * Returns `true` if the first argument is greater than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.lte\n * @example\n *\n * R.gte(2, 1); //=> true\n * R.gte(2, 2); //=> true\n * R.gte(2, 3); //=> false\n * R.gte('a', 'z'); //=> false\n * R.gte('z', 'a'); //=> true\n */\n var gte = _curry2(function gte(a, b) {\n return a >= b;\n });\n\n /**\n * Returns whether or not an object has an own property with the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n * var hasName = R.has('name');\n * hasName({name: 'alice'}); //=> true\n * hasName({name: 'bob'}); //=> true\n * hasName({}); //=> false\n *\n * var point = {x: 0, y: 0};\n * var pointHas = R.has(R.__, point);\n * pointHas('x'); //=> true\n * pointHas('y'); //=> true\n * pointHas('z'); //=> false\n */\n var has = _curry2(_has);\n\n /**\n * Returns whether or not an object or its prototype chain has a property with\n * the specified name\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Object\n * @sig s -> {s: x} -> Boolean\n * @param {String} prop The name of the property to check for.\n * @param {Object} obj The object to query.\n * @return {Boolean} Whether the property exists.\n * @example\n *\n * function Rectangle(width, height) {\n * this.width = width;\n * this.height = height;\n * }\n * Rectangle.prototype.area = function() {\n * return this.width * this.height;\n * };\n *\n * var square = new Rectangle(2, 2);\n * R.hasIn('width', square); //=> true\n * R.hasIn('area', square); //=> true\n */\n var hasIn = _curry2(function hasIn(prop, obj) {\n return prop in obj;\n });\n\n /**\n * Returns true if its arguments are identical, false otherwise. Values are\n * identical if they reference the same memory. `NaN` is identical to `NaN`;\n * `0` and `-0` are not identical.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * var o = {};\n * R.identical(o, o); //=> true\n * R.identical(1, 1); //=> true\n * R.identical(1, '1'); //=> false\n * R.identical([], []); //=> false\n * R.identical(0, -0); //=> false\n * R.identical(NaN, NaN); //=> true\n */\n // SameValue algorithm\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n // Step 6.a: NaN == NaN\n var identical = _curry2(function identical(a, b) {\n // SameValue algorithm\n if (a === b) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n return a !== 0 || 1 / a === 1 / b;\n } else {\n // Step 6.a: NaN == NaN\n return a !== a && b !== b;\n }\n });\n\n /**\n * A function that does nothing but return the parameter supplied to it. Good\n * as a default or placeholder function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> a\n * @param {*} x The value to return.\n * @return {*} The input value, `x`.\n * @example\n *\n * R.identity(1); //=> 1\n *\n * var obj = {};\n * R.identity(obj) === obj; //=> true\n */\n var identity = _curry1(_identity);\n\n /**\n * Creates a function that will process either the `onTrue` or the `onFalse`\n * function depending upon the result of the `condition` predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> *) -> (*... -> *) -> (*... -> *)\n * @param {Function} condition A predicate function\n * @param {Function} onTrue A function to invoke when the `condition` evaluates to a truthy value.\n * @param {Function} onFalse A function to invoke when the `condition` evaluates to a falsy value.\n * @return {Function} A new unary function that will process either the `onTrue` or the `onFalse`\n * function depending upon the result of the `condition` predicate.\n * @see R.unless, R.when\n * @example\n *\n * var incCount = R.ifElse(\n * R.has('count'),\n * R.over(R.lensProp('count'), R.inc),\n * R.assoc('count', 1)\n * );\n * incCount({}); //=> { count: 1 }\n * incCount({ count: 1 }); //=> { count: 2 }\n */\n var ifElse = _curry3(function ifElse(condition, onTrue, onFalse) {\n return curryN(Math.max(condition.length, onTrue.length, onFalse.length), function _ifElse() {\n return condition.apply(this, arguments) ? onTrue.apply(this, arguments) : onFalse.apply(this, arguments);\n });\n });\n\n /**\n * Increments its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @see R.dec\n * @example\n *\n * R.inc(42); //=> 43\n */\n var inc = add(1);\n\n /**\n * Inserts the supplied element into the list, at index `index`. _Note that\n * this is not destructive_: it returns a copy of the list with the changes.\n * No lists have been harmed in the application of this function. \n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} index The position to insert the element\n * @param {*} elt The element to insert into the Array\n * @param {Array} list The list to insert into\n * @return {Array} A new Array with `elt` inserted at `index`.\n * @example\n *\n * R.insert(2, 'x', [1,2,3,4]); //=> [1,2,'x',3,4]\n */\n var insert = _curry3(function insert(idx, elt, list) {\n idx = idx < list.length && idx >= 0 ? idx : list.length;\n var result = _slice(list);\n result.splice(idx, 0, elt);\n return result;\n });\n\n /**\n * Inserts the sub-list into the list, at index `index`. _Note that this is not\n * destructive_: it returns a copy of the list with the changes.\n * No lists have been harmed in the application of this function. \n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig Number -> [a] -> [a] -> [a]\n * @param {Number} index The position to insert the sub-list\n * @param {Array} elts The sub-list to insert into the Array\n * @param {Array} list The list to insert the sub-list into\n * @return {Array} A new Array with `elts` inserted starting at `index`.\n * @example\n *\n * R.insertAll(2, ['x','y','z'], [1,2,3,4]); //=> [1,2,'x','y','z',3,4]\n */\n var insertAll = _curry3(function insertAll(idx, elts, list) {\n idx = idx < list.length && idx >= 0 ? idx : list.length;\n return _concat(_concat(_slice(list, 0, idx), elts), _slice(list, idx));\n });\n\n /**\n * Creates a new list with the separator interposed between elements.\n *\n * Dispatches to the `intersperse` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} separator The element to add to the list.\n * @param {Array} list The list to be interposed.\n * @return {Array} The new list.\n * @example\n *\n * R.intersperse('n', ['ba', 'a', 'a']); //=> ['ba', 'n', 'a', 'n', 'a']\n */\n var intersperse = _curry2(_checkForMethod('intersperse', function intersperse(separator, list) {\n var out = [];\n var idx = 0;\n var length = list.length;\n while (idx < length) {\n if (idx === length - 1) {\n out.push(list[idx]);\n } else {\n out.push(list[idx], separator);\n }\n idx += 1;\n }\n return out;\n }));\n\n /**\n * See if an object (`val`) is an instance of the supplied constructor. This\n * function will check up the inheritance chain, if any.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Type\n * @sig (* -> {*}) -> a -> Boolean\n * @param {Object} ctor A constructor\n * @param {*} val The value to test\n * @return {Boolean}\n * @example\n *\n * R.is(Object, {}); //=> true\n * R.is(Number, 1); //=> true\n * R.is(Object, 1); //=> false\n * R.is(String, 's'); //=> true\n * R.is(String, new String('')); //=> true\n * R.is(Object, new String('')); //=> true\n * R.is(Object, 's'); //=> false\n * R.is(Number, {}); //=> false\n */\n var is = _curry2(function is(Ctor, val) {\n return val != null && val.constructor === Ctor || val instanceof Ctor;\n });\n\n /**\n * Tests whether or not an object is similar to an array.\n *\n * @func\n * @memberOf R\n * @since v0.5.0\n * @category Type\n * @category List\n * @sig * -> Boolean\n * @param {*} x The object to test.\n * @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.\n * @example\n *\n * R.isArrayLike([]); //=> true\n * R.isArrayLike(true); //=> false\n * R.isArrayLike({}); //=> false\n * R.isArrayLike({length: 10}); //=> false\n * R.isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true\n */\n var isArrayLike = _curry1(function isArrayLike(x) {\n if (_isArray(x)) {\n return true;\n }\n if (!x) {\n return false;\n }\n if (typeof x !== 'object') {\n return false;\n }\n if (x instanceof String) {\n return false;\n }\n if (x.nodeType === 1) {\n return !!x.length;\n }\n if (x.length === 0) {\n return true;\n }\n if (x.length > 0) {\n return x.hasOwnProperty(0) && x.hasOwnProperty(x.length - 1);\n }\n return false;\n });\n\n /**\n * Checks if the input value is `null` or `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Type\n * @sig * -> Boolean\n * @param {*} x The value to test.\n * @return {Boolean} `true` if `x` is `undefined` or `null`, otherwise `false`.\n * @example\n *\n * R.isNil(null); //=> true\n * R.isNil(undefined); //=> true\n * R.isNil(0); //=> false\n * R.isNil([]); //=> false\n */\n var isNil = _curry1(function isNil(x) {\n return x == null;\n });\n\n /**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @example\n *\n * R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\n // cover IE < 9 keys issues\n // Safari bug\n var keys = function () {\n // cover IE < 9 keys issues\n var hasEnumBug = !{ toString: null }.propertyIsEnumerable('toString');\n var nonEnumerableProps = [\n 'constructor',\n 'valueOf',\n 'isPrototypeOf',\n 'toString',\n 'propertyIsEnumerable',\n 'hasOwnProperty',\n 'toLocaleString'\n ];\n // Safari bug\n var hasArgsEnumBug = function () {\n 'use strict';\n return arguments.propertyIsEnumerable('length');\n }();\n var contains = function contains(list, item) {\n var idx = 0;\n while (idx < list.length) {\n if (list[idx] === item) {\n return true;\n }\n idx += 1;\n }\n return false;\n };\n return typeof Object.keys === 'function' && !hasArgsEnumBug ? _curry1(function keys(obj) {\n return Object(obj) !== obj ? [] : Object.keys(obj);\n }) : _curry1(function keys(obj) {\n if (Object(obj) !== obj) {\n return [];\n }\n var prop, nIdx;\n var ks = [];\n var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n for (prop in obj) {\n if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n ks[ks.length] = prop;\n }\n }\n if (hasEnumBug) {\n nIdx = nonEnumerableProps.length - 1;\n while (nIdx >= 0) {\n prop = nonEnumerableProps[nIdx];\n if (_has(prop, obj) && !contains(ks, prop)) {\n ks[ks.length] = prop;\n }\n nIdx -= 1;\n }\n }\n return ks;\n });\n }();\n\n /**\n * Returns a list containing the names of all the properties of the supplied\n * object, including prototype properties.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own and prototype properties.\n * @example\n *\n * var F = function() { this.x = 'X'; };\n * F.prototype.y = 'Y';\n * var f = new F();\n * R.keysIn(f); //=> ['x', 'y']\n */\n var keysIn = _curry1(function keysIn(obj) {\n var prop;\n var ks = [];\n for (prop in obj) {\n ks[ks.length] = prop;\n }\n return ks;\n });\n\n /**\n * Returns the number of elements in the array by returning `list.length`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [a] -> Number\n * @param {Array} list The array to inspect.\n * @return {Number} The length of the array.\n * @example\n *\n * R.length([]); //=> 0\n * R.length([1, 2, 3]); //=> 3\n */\n var length = _curry1(function length(list) {\n return list != null && is(Number, list.length) ? list.length : NaN;\n });\n\n /**\n * Returns `true` if the first argument is less than the second; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @see R.gt\n * @example\n *\n * R.lt(2, 1); //=> false\n * R.lt(2, 2); //=> false\n * R.lt(2, 3); //=> true\n * R.lt('a', 'z'); //=> true\n * R.lt('z', 'a'); //=> false\n */\n var lt = _curry2(function lt(a, b) {\n return a < b;\n });\n\n /**\n * Returns `true` if the first argument is less than or equal to the second;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> Boolean\n * @param {Number} a\n * @param {Number} b\n * @return {Boolean}\n * @see R.gte\n * @example\n *\n * R.lte(2, 1); //=> false\n * R.lte(2, 2); //=> true\n * R.lte(2, 3); //=> true\n * R.lte('a', 'z'); //=> true\n * R.lte('z', 'a'); //=> false\n */\n var lte = _curry2(function lte(a, b) {\n return a <= b;\n });\n\n /**\n * The mapAccum function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from left to right, and returning a final value of this\n * accumulator together with the new list.\n *\n * The iterator function receives two arguments, *acc* and *value*, and should\n * return a tuple *[acc, value]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex\n * @example\n *\n * var digits = ['1', '2', '3', '4'];\n * var appender = (a, b) => [a + b, a + b];\n *\n * R.mapAccum(appender, 0, digits); //=> ['01234', ['01', '012', '0123', '01234']]\n */\n var mapAccum = _curry3(function mapAccum(fn, acc, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n var tuple = [acc];\n while (idx < len) {\n tuple = fn(tuple[0], list[idx]);\n result[idx] = tuple[1];\n idx += 1;\n }\n return [\n tuple[0],\n result\n ];\n });\n\n /**\n * The mapAccumRight function behaves like a combination of map and reduce; it\n * applies a function to each element of a list, passing an accumulating\n * parameter from right to left, and returning a final value of this\n * accumulator together with the new list.\n *\n * Similar to `mapAccum`, except moves through the input list from the right to\n * the left.\n *\n * The iterator function receives two arguments, *acc* and *value*, and should\n * return a tuple *[acc, value]*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex\n * @example\n *\n * var digits = ['1', '2', '3', '4'];\n * var append = (a, b) => [a + b, a + b];\n *\n * R.mapAccumRight(append, 0, digits); //=> ['04321', ['04321', '0432', '043', '04']]\n */\n var mapAccumRight = _curry3(function mapAccumRight(fn, acc, list) {\n var idx = list.length - 1;\n var result = [];\n var tuple = [acc];\n while (idx >= 0) {\n tuple = fn(tuple[0], list[idx]);\n result[idx] = tuple[1];\n idx -= 1;\n }\n return [\n tuple[0],\n result\n ];\n });\n\n /**\n * Tests a regular expression against a String. Note that this function will\n * return an empty array when there are no matches. This differs from\n * [`String.prototype.match`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/match)\n * which returns `null` when there are no matches.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig RegExp -> String -> [String | Undefined]\n * @param {RegExp} rx A regular expression.\n * @param {String} str The string to match against\n * @return {Array} The list of matches or empty array.\n * @see R.test\n * @example\n *\n * R.match(/([a-z]a)/g, 'bananas'); //=> ['ba', 'na', 'na']\n * R.match(/a/, 'b'); //=> []\n * R.match(/a/, null); //=> TypeError: null does not have a method named \"match\"\n */\n var match = _curry2(function match(rx, str) {\n return str.match(rx) || [];\n });\n\n /**\n * mathMod behaves like the modulo operator should mathematically, unlike the\n * `%` operator (and by extension, R.modulo). So while \"-17 % 5\" is -2,\n * mathMod(-17, 5) is 3. mathMod requires Integer arguments, and returns NaN\n * when the modulus is zero or negative.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} m The dividend.\n * @param {Number} p the modulus.\n * @return {Number} The result of `b mod a`.\n * @example\n *\n * R.mathMod(-17, 5); //=> 3\n * R.mathMod(17, 5); //=> 2\n * R.mathMod(17, -5); //=> NaN\n * R.mathMod(17, 0); //=> NaN\n * R.mathMod(17.2, 5); //=> NaN\n * R.mathMod(17, 5.3); //=> NaN\n *\n * var clock = R.mathMod(R.__, 12);\n * clock(15); //=> 3\n * clock(24); //=> 0\n *\n * var seventeenMod = R.mathMod(17);\n * seventeenMod(3); //=> 2\n * seventeenMod(4); //=> 1\n * seventeenMod(10); //=> 7\n */\n var mathMod = _curry2(function mathMod(m, p) {\n if (!_isInteger(m)) {\n return NaN;\n }\n if (!_isInteger(p) || p < 1) {\n return NaN;\n }\n return (m % p + p) % p;\n });\n\n /**\n * Returns the larger of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.maxBy, R.min\n * @example\n *\n * R.max(789, 123); //=> 789\n * R.max('a', 'b'); //=> 'b'\n */\n var max = _curry2(function max(a, b) {\n return b > a ? b : a;\n });\n\n /**\n * Takes a function and two values, and returns whichever value produces the\n * larger result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.max, R.minBy\n * @example\n *\n * // square :: Number -> Number\n * var square = n => n * n;\n *\n * R.maxBy(square, -3, 2); //=> -3\n *\n * R.reduce(R.maxBy(square), 0, [3, -5, 4, 1, -2]); //=> -5\n * R.reduce(R.maxBy(square), 0, []); //=> 0\n */\n var maxBy = _curry3(function maxBy(f, a, b) {\n return f(b) > f(a) ? b : a;\n });\n\n /**\n * Create a new object with the own properties of the first object merged with\n * the own properties of the second object. If a key exists in both objects,\n * the value from the second object will be used.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> {k: v} -> {k: v}\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.mergeWith, R.mergeWithKey\n * @example\n *\n * R.merge({ 'name': 'fred', 'age': 10 }, { 'age': 40 });\n * //=> { 'name': 'fred', 'age': 40 }\n *\n * var resetToDefault = R.merge(R.__, {x: 0});\n * resetToDefault({x: 5, y: 2}); //=> {x: 0, y: 2}\n */\n var merge = _curry2(function merge(l, r) {\n return _assign({}, l, r);\n });\n\n /**\n * Merges a list of objects together into one object.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig [{k: v}] -> {k: v}\n * @param {Array} list An array of objects\n * @return {Object} A merged object.\n * @see R.reduce\n * @example\n *\n * R.mergeAll([{foo:1},{bar:2},{baz:3}]); //=> {foo:1,bar:2,baz:3}\n * R.mergeAll([{foo:1},{foo:2},{bar:2}]); //=> {foo:2,bar:2}\n */\n var mergeAll = _curry1(function mergeAll(list) {\n return _assign.apply(null, [{}].concat(list));\n });\n\n /**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the key\n * and the values associated with the key in each object, with the result being\n * used as the value associated with the key in the returned object. The key\n * will be excluded from the returned object if the resulting value is\n * `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig (String -> a -> a -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.merge, R.mergeWith\n * @example\n *\n * let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r\n * R.mergeWithKey(concatValues,\n * { a: true, thing: 'foo', values: [10, 20] },\n * { b: true, thing: 'bar', values: [15, 35] });\n * //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }\n */\n var mergeWithKey = _curry3(function mergeWithKey(fn, l, r) {\n var result = {};\n var k;\n for (k in l) {\n if (_has(k, l)) {\n result[k] = _has(k, r) ? fn(k, l[k], r[k]) : l[k];\n }\n }\n for (k in r) {\n if (_has(k, r) && !_has(k, result)) {\n result[k] = r[k];\n }\n }\n return result;\n });\n\n /**\n * Returns the smaller of its two arguments.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord a => a -> a -> a\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.minBy, R.max\n * @example\n *\n * R.min(789, 123); //=> 123\n * R.min('a', 'b'); //=> 'a'\n */\n var min = _curry2(function min(a, b) {\n return b < a ? b : a;\n });\n\n /**\n * Takes a function and two values, and returns whichever value produces the\n * smaller result when passed to the provided function.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Relation\n * @sig Ord b => (a -> b) -> a -> a -> a\n * @param {Function} f\n * @param {*} a\n * @param {*} b\n * @return {*}\n * @see R.min, R.maxBy\n * @example\n *\n * // square :: Number -> Number\n * var square = n => n * n;\n *\n * R.minBy(square, -3, 2); //=> 2\n *\n * R.reduce(R.minBy(square), Infinity, [3, -5, 4, 1, -2]); //=> 1\n * R.reduce(R.minBy(square), Infinity, []); //=> Infinity\n */\n var minBy = _curry3(function minBy(f, a, b) {\n return f(b) < f(a) ? b : a;\n });\n\n /**\n * Divides the second parameter by the first and returns the remainder. Note\n * that this function preserves the JavaScript-style behavior for modulo. For\n * mathematical modulo see `mathMod`.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The value to the divide.\n * @param {Number} b The pseudo-modulus\n * @return {Number} The result of `b % a`.\n * @see R.mathMod\n * @example\n *\n * R.modulo(17, 3); //=> 2\n * // JS behavior:\n * R.modulo(-17, 3); //=> -2\n * R.modulo(17, -3); //=> 2\n *\n * var isOdd = R.modulo(R.__, 2);\n * isOdd(42); //=> 0\n * isOdd(21); //=> 1\n */\n var modulo = _curry2(function modulo(a, b) {\n return a % b;\n });\n\n /**\n * Multiplies two numbers. Equivalent to `a * b` but curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a * b`.\n * @see R.divide\n * @example\n *\n * var double = R.multiply(2);\n * var triple = R.multiply(3);\n * double(3); //=> 6\n * triple(4); //=> 12\n * R.multiply(2, 5); //=> 10\n */\n var multiply = _curry2(function multiply(a, b) {\n return a * b;\n });\n\n /**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly `n` parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> (* -> a) -> (* -> a)\n * @param {Number} n The desired arity of the new function.\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n * arity `n`.\n * @example\n *\n * var takesTwoArgs = (a, b) => [a, b];\n *\n * takesTwoArgs.length; //=> 2\n * takesTwoArgs(1, 2); //=> [1, 2]\n *\n * var takesOneArg = R.nAry(1, takesTwoArgs);\n * takesOneArg.length; //=> 1\n * // Only `n` arguments are passed to the wrapped function\n * takesOneArg(1, 2); //=> [1, undefined]\n */\n var nAry = _curry2(function nAry(n, fn) {\n switch (n) {\n case 0:\n return function () {\n return fn.call(this);\n };\n case 1:\n return function (a0) {\n return fn.call(this, a0);\n };\n case 2:\n return function (a0, a1) {\n return fn.call(this, a0, a1);\n };\n case 3:\n return function (a0, a1, a2) {\n return fn.call(this, a0, a1, a2);\n };\n case 4:\n return function (a0, a1, a2, a3) {\n return fn.call(this, a0, a1, a2, a3);\n };\n case 5:\n return function (a0, a1, a2, a3, a4) {\n return fn.call(this, a0, a1, a2, a3, a4);\n };\n case 6:\n return function (a0, a1, a2, a3, a4, a5) {\n return fn.call(this, a0, a1, a2, a3, a4, a5);\n };\n case 7:\n return function (a0, a1, a2, a3, a4, a5, a6) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6);\n };\n case 8:\n return function (a0, a1, a2, a3, a4, a5, a6, a7) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7);\n };\n case 9:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8);\n };\n case 10:\n return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {\n return fn.call(this, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9);\n };\n default:\n throw new Error('First argument to nAry must be a non-negative integer no greater than ten');\n }\n });\n\n /**\n * Negates its argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Math\n * @sig Number -> Number\n * @param {Number} n\n * @return {Number}\n * @example\n *\n * R.negate(42); //=> -42\n */\n var negate = _curry1(function negate(n) {\n return -n;\n });\n\n /**\n * Returns `true` if no elements of the list match the predicate, `false`\n * otherwise.\n *\n * Dispatches to the `any` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> Boolean\n * @param {Function} fn The predicate function.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the predicate is not satisfied by every element, `false` otherwise.\n * @see R.all, R.any\n * @example\n *\n * var isEven = n => n % 2 === 0;\n *\n * R.none(isEven, [1, 3, 5, 7, 9, 11]); //=> true\n * R.none(isEven, [1, 3, 5, 7, 8, 11]); //=> false\n */\n var none = _curry2(_complement(_dispatchable('any', _xany, any)));\n\n /**\n * A function that returns the `!` of its argument. It will return `true` when\n * passed false-y value, and `false` when passed a truth-y one.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> Boolean\n * @param {*} a any value\n * @return {Boolean} the logical inverse of passed argument.\n * @see R.complement\n * @example\n *\n * R.not(true); //=> false\n * R.not(false); //=> true\n * R.not(0); => true\n * R.not(1); => false\n */\n var not = _curry1(function not(a) {\n return !a;\n });\n\n /**\n * Returns the nth element of the given list or string. If n is negative the\n * element at index length + n is returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> a | Undefined\n * @sig Number -> String -> String\n * @param {Number} offset\n * @param {*} list\n * @return {*}\n * @example\n *\n * var list = ['foo', 'bar', 'baz', 'quux'];\n * R.nth(1, list); //=> 'bar'\n * R.nth(-1, list); //=> 'quux'\n * R.nth(-99, list); //=> undefined\n *\n * R.nth(2, 'abc'); //=> 'c'\n * R.nth(3, 'abc'); //=> ''\n */\n var nth = _curry2(function nth(offset, list) {\n var idx = offset < 0 ? list.length + offset : offset;\n return _isString(list) ? list.charAt(idx) : list[idx];\n });\n\n /**\n * Returns a function which returns its nth argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig Number -> *... -> *\n * @param {Number} n\n * @return {Function}\n * @example\n *\n * R.nthArg(1)('a', 'b', 'c'); //=> 'b'\n * R.nthArg(-1)('a', 'b', 'c'); //=> 'c'\n */\n var nthArg = _curry1(function nthArg(n) {\n return function () {\n return nth(n, arguments);\n };\n });\n\n /**\n * Creates an object containing a single key:value pair.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @sig String -> a -> {String:a}\n * @param {String} key\n * @param {*} val\n * @return {Object}\n * @see R.pair\n * @example\n *\n * var matchPhrases = R.compose(\n * R.objOf('must'),\n * R.map(R.objOf('match_phrase'))\n * );\n * matchPhrases(['foo', 'bar', 'baz']); //=> {must: [{match_phrase: 'foo'}, {match_phrase: 'bar'}, {match_phrase: 'baz'}]}\n */\n var objOf = _curry2(function objOf(key, val) {\n var obj = {};\n obj[key] = val;\n return obj;\n });\n\n /**\n * Returns a singleton array containing the value provided.\n *\n * Note this `of` is different from the ES6 `of`; See\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/of\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig a -> [a]\n * @param {*} x any value\n * @return {Array} An array wrapping `x`.\n * @example\n *\n * R.of(null); //=> [null]\n * R.of([42]); //=> [[42]]\n */\n var of = _curry1(_of);\n\n /**\n * Accepts a function `fn` and returns a function that guards invocation of\n * `fn` such that `fn` can only ever be called once, no matter how many times\n * the returned function is invoked. The first value calculated is returned in\n * subsequent invocations.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a... -> b) -> (a... -> b)\n * @param {Function} fn The function to wrap in a call-only-once wrapper.\n * @return {Function} The wrapped function.\n * @example\n *\n * var addOneOnce = R.once(x => x + 1);\n * addOneOnce(10); //=> 11\n * addOneOnce(addOneOnce(50)); //=> 11\n */\n var once = _curry1(function once(fn) {\n var called = false;\n var result;\n return _arity(fn.length, function () {\n if (called) {\n return result;\n }\n called = true;\n result = fn.apply(this, arguments);\n return result;\n });\n });\n\n /**\n * Returns `true` if one or both of its arguments are `true`. Returns `false`\n * if both arguments are `false`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig * -> * -> *\n * @param {Boolean} a A boolean value\n * @param {Boolean} b A boolean value\n * @return {Boolean} `true` if one or both arguments are `true`, `false` otherwise\n * @see R.either\n * @example\n *\n * R.or(true, true); //=> true\n * R.or(true, false); //=> true\n * R.or(false, true); //=> true\n * R.or(false, false); //=> false\n */\n var or = _curry2(function or(a, b) {\n return a || b;\n });\n\n /**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the result of applying the given function to\n * the focused value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> (a -> a) -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n * var headLens = R.lensIndex(0);\n *\n * R.over(headLens, R.toUpper, ['foo', 'bar', 'baz']); //=> ['FOO', 'bar', 'baz']\n */\n // `Identity` is a functor that holds a single value, where `map` simply\n // transforms the held value with the provided function.\n // The value returned by the getter function is first transformed with `f`,\n // then set as the value of an `Identity`. This is then mapped over with the\n // setter function of the lens.\n var over = function () {\n // `Identity` is a functor that holds a single value, where `map` simply\n // transforms the held value with the provided function.\n var Identity = function (x) {\n return {\n value: x,\n map: function (f) {\n return Identity(f(x));\n }\n };\n };\n return _curry3(function over(lens, f, x) {\n // The value returned by the getter function is first transformed with `f`,\n // then set as the value of an `Identity`. This is then mapped over with the\n // setter function of the lens.\n return lens(function (y) {\n return Identity(f(y));\n })(x).value;\n });\n }();\n\n /**\n * Takes two arguments, `fst` and `snd`, and returns `[fst, snd]`.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category List\n * @sig a -> b -> (a,b)\n * @param {*} fst\n * @param {*} snd\n * @return {Array}\n * @see R.objOf, R.of\n * @example\n *\n * R.pair('foo', 'bar'); //=> ['foo', 'bar']\n */\n var pair = _curry2(function pair(fst, snd) {\n return [\n fst,\n snd\n ];\n });\n\n /**\n * Retrieve the value at a given path.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig [String] -> {k: v} -> v | Undefined\n * @param {Array} path The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path`.\n * @example\n *\n * R.path(['a', 'b'], {a: {b: 2}}); //=> 2\n * R.path(['a', 'b'], {c: {b: 2}}); //=> undefined\n */\n var path = _curry2(function path(paths, obj) {\n var val = obj;\n var idx = 0;\n while (idx < paths.length) {\n if (val == null) {\n return;\n }\n val = val[paths[idx]];\n idx += 1;\n }\n return val;\n });\n\n /**\n * If the given, non-null object has a value at the given path, returns the\n * value at that path. Otherwise returns the provided default value.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Object\n * @sig a -> [String] -> Object -> a\n * @param {*} d The default value.\n * @param {Array} p The path to use.\n * @param {Object} obj The object to retrieve the nested property from.\n * @return {*} The data at `path` of the supplied object or the default value.\n * @example\n *\n * R.pathOr('N/A', ['a', 'b'], {a: {b: 2}}); //=> 2\n * R.pathOr('N/A', ['a', 'b'], {c: {b: 2}}); //=> \"N/A\"\n */\n var pathOr = _curry3(function pathOr(d, p, obj) {\n return defaultTo(d, path(p, obj));\n });\n\n /**\n * Returns `true` if the specified object property at given path satisfies the\n * given predicate; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Logic\n * @sig (a -> Boolean) -> [String] -> Object -> Boolean\n * @param {Function} pred\n * @param {Array} propPath\n * @param {*} obj\n * @return {Boolean}\n * @see R.propSatisfies, R.path\n * @example\n *\n * R.pathSatisfies(y => y > 0, ['x', 'y'], {x: {y: 2}}); //=> true\n */\n var pathSatisfies = _curry3(function pathSatisfies(pred, propPath, obj) {\n return propPath.length > 0 && pred(path(propPath, obj));\n });\n\n /**\n * Returns a partial copy of an object containing only the keys specified. If\n * the key does not exist, the property is ignored.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.omit, R.props\n * @example\n *\n * R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n * R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}\n */\n var pick = _curry2(function pick(names, obj) {\n var result = {};\n var idx = 0;\n while (idx < names.length) {\n if (names[idx] in obj) {\n result[names[idx]] = obj[names[idx]];\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Similar to `pick` except that this one includes a `key: undefined` pair for\n * properties that don't exist.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> {k: v}\n * @param {Array} names an array of String property names to copy onto a new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties from `names` on it.\n * @see R.pick\n * @example\n *\n * R.pickAll(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}\n * R.pickAll(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, e: undefined, f: undefined}\n */\n var pickAll = _curry2(function pickAll(names, obj) {\n var result = {};\n var idx = 0;\n var len = names.length;\n while (idx < len) {\n var name = names[idx];\n result[name] = obj[name];\n idx += 1;\n }\n return result;\n });\n\n /**\n * Returns a partial copy of an object containing only the keys that satisfy\n * the supplied predicate.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @sig (v, k -> Boolean) -> {k: v} -> {k: v}\n * @param {Function} pred A predicate to determine whether or not a key\n * should be included on the output object.\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with only properties that satisfy `pred`\n * on it.\n * @see R.pick, R.filter\n * @example\n *\n * var isUpperCase = (val, key) => key.toUpperCase() === key;\n * R.pickBy(isUpperCase, {a: 1, b: 2, A: 3, B: 4}); //=> {A: 3, B: 4}\n */\n var pickBy = _curry2(function pickBy(test, obj) {\n var result = {};\n for (var prop in obj) {\n if (test(obj[prop], prop, obj)) {\n result[prop] = obj[prop];\n }\n }\n return result;\n });\n\n /**\n * Returns a new list with the given element at the front, followed by the\n * contents of the list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> [a]\n * @param {*} el The item to add to the head of the output list.\n * @param {Array} list The array to add to the tail of the output list.\n * @return {Array} A new array.\n * @see R.append\n * @example\n *\n * R.prepend('fee', ['fi', 'fo', 'fum']); //=> ['fee', 'fi', 'fo', 'fum']\n */\n var prepend = _curry2(function prepend(el, list) {\n return _concat([el], list);\n });\n\n /**\n * Returns a function that when supplied an object returns the indicated\n * property of that object, if it exists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig s -> {s: a} -> a | Undefined\n * @param {String} p The property name\n * @param {Object} obj The object to query\n * @return {*} The value at `obj.p`.\n * @example\n *\n * R.prop('x', {x: 100}); //=> 100\n * R.prop('x', {}); //=> undefined\n */\n var prop = _curry2(function prop(p, obj) {\n return obj[p];\n });\n\n /**\n * If the given, non-null object has an own property with the specified name,\n * returns the value of that property. Otherwise returns the provided default\n * value.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Object\n * @sig a -> String -> Object -> a\n * @param {*} val The default value.\n * @param {String} p The name of the property to return.\n * @param {Object} obj The object to query.\n * @return {*} The value of given property of the supplied object or the default value.\n * @example\n *\n * var alice = {\n * name: 'ALICE',\n * age: 101\n * };\n * var favorite = R.prop('favoriteLibrary');\n * var favoriteWithDefault = R.propOr('Ramda', 'favoriteLibrary');\n *\n * favorite(alice); //=> undefined\n * favoriteWithDefault(alice); //=> 'Ramda'\n */\n var propOr = _curry3(function propOr(val, p, obj) {\n return obj != null && _has(p, obj) ? obj[p] : val;\n });\n\n /**\n * Returns `true` if the specified object property satisfies the given\n * predicate; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Logic\n * @sig (a -> Boolean) -> String -> {String: a} -> Boolean\n * @param {Function} pred\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.propEq, R.propIs\n * @example\n *\n * R.propSatisfies(x => x > 0, 'x', {x: 1, y: 2}); //=> true\n */\n var propSatisfies = _curry3(function propSatisfies(pred, name, obj) {\n return pred(obj[name]);\n });\n\n /**\n * Acts as multiple `prop`: array of keys in, array of values out. Preserves\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [k] -> {k: v} -> [v]\n * @param {Array} ps The property names to fetch\n * @param {Object} obj The object to query\n * @return {Array} The corresponding values or partially applied function.\n * @example\n *\n * R.props(['x', 'y'], {x: 1, y: 2}); //=> [1, 2]\n * R.props(['c', 'a', 'b'], {b: 2, a: 1}); //=> [undefined, 1, 2]\n *\n * var fullName = R.compose(R.join(' '), R.props(['first', 'last']));\n * fullName({last: 'Bullet-Tooth', age: 33, first: 'Tony'}); //=> 'Tony Bullet-Tooth'\n */\n var props = _curry2(function props(ps, obj) {\n var len = ps.length;\n var out = [];\n var idx = 0;\n while (idx < len) {\n out[idx] = obj[ps[idx]];\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a list of numbers from `from` (inclusive) to `to` (exclusive).\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> Number -> [Number]\n * @param {Number} from The first number in the list.\n * @param {Number} to One more than the last number in the list.\n * @return {Array} The list of numbers in tthe set `[a, b)`.\n * @example\n *\n * R.range(1, 5); //=> [1, 2, 3, 4]\n * R.range(50, 53); //=> [50, 51, 52]\n */\n var range = _curry2(function range(from, to) {\n if (!(_isNumber(from) && _isNumber(to))) {\n throw new TypeError('Both arguments to range must be numbers');\n }\n var result = [];\n var n = from;\n while (n < to) {\n result.push(n);\n n += 1;\n }\n return result;\n });\n\n /**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * Similar to `reduce`, except moves through the input list from the right to\n * the left.\n *\n * The iterator function receives two values: *(acc, value)*\n *\n * Note: `R.reduceRight` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight#Description\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a,b -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.addIndex\n * @example\n *\n * var pairs = [ ['a', 1], ['b', 2], ['c', 3] ];\n * var flattenPairs = (acc, pair) => acc.concat(pair);\n *\n * R.reduceRight(flattenPairs, [], pairs); //=> [ 'c', 3, 'b', 2, 'a', 1 ]\n */\n var reduceRight = _curry3(function reduceRight(fn, acc, list) {\n var idx = list.length - 1;\n while (idx >= 0) {\n acc = fn(acc, list[idx]);\n idx -= 1;\n }\n return acc;\n });\n\n /**\n * Returns a value wrapped to indicate that it is the final value of the reduce\n * and transduce functions. The returned value should be considered a black\n * box: the internal structure is not guaranteed to be stable.\n *\n * Note: this optimization is unavailable to functions not explicitly listed\n * above. For instance, it is not currently supported by reduceRight.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category List\n * @sig a -> *\n * @param {*} x The final value of the reduce.\n * @return {*} The wrapped value.\n * @see R.reduce, R.transduce\n * @example\n *\n * R.reduce(\n * R.pipe(R.add, R.when(R.gte(R.__, 10), R.reduced)),\n * 0,\n * [1, 2, 3, 4, 5]) // 10\n */\n var reduced = _curry1(_reduced);\n\n /**\n * Removes the sub-list of `list` starting at index `start` and containing\n * `count` elements. _Note that this is not destructive_: it returns a copy of\n * the list with the changes.\n * No lists have been harmed in the application of this function. \n *\n * @func\n * @memberOf R\n * @since v0.2.2\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @param {Number} start The position to start removing elements\n * @param {Number} count The number of elements to remove\n * @param {Array} list The list to remove from\n * @return {Array} A new Array with `count` elements from `start` removed.\n * @example\n *\n * R.remove(2, 3, [1,2,3,4,5,6,7,8]); //=> [1,2,6,7,8]\n */\n var remove = _curry3(function remove(start, count, list) {\n return _concat(_slice(list, 0, Math.min(start, list.length)), _slice(list, Math.min(list.length, start + count)));\n });\n\n /**\n * Replace a substring or regex match in a string with a replacement.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category String\n * @sig RegExp|String -> String -> String -> String\n * @param {RegExp|String} pattern A regular expression or a substring to match.\n * @param {String} replacement The string to replace the matches with.\n * @param {String} str The String to do the search and replacement in.\n * @return {String} The result.\n * @example\n *\n * R.replace('foo', 'bar', 'foo foo foo'); //=> 'bar foo foo'\n * R.replace(/foo/, 'bar', 'foo foo foo'); //=> 'bar foo foo'\n *\n * // Use the \"g\" (global) flag to replace all occurrences:\n * R.replace(/foo/g, 'bar', 'foo foo foo'); //=> 'bar bar bar'\n */\n var replace = _curry3(function replace(regex, replacement, str) {\n return str.replace(regex, replacement);\n });\n\n /**\n * Returns a new list or string with the elements or characters in reverse\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {Array|String} list\n * @return {Array|String}\n * @example\n *\n * R.reverse([1, 2, 3]); //=> [3, 2, 1]\n * R.reverse([1, 2]); //=> [2, 1]\n * R.reverse([1]); //=> [1]\n * R.reverse([]); //=> []\n *\n * R.reverse('abc'); //=> 'cba'\n * R.reverse('ab'); //=> 'ba'\n * R.reverse('a'); //=> 'a'\n * R.reverse(''); //=> ''\n */\n var reverse = _curry1(function reverse(list) {\n return _isString(list) ? list.split('').reverse().join('') : _slice(list).reverse();\n });\n\n /**\n * Scan is similar to reduce, but returns a list of successively reduced values\n * from the left\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (a,b -> a) -> a -> [b] -> [a]\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {Array} A list of all intermediately reduced values.\n * @example\n *\n * var numbers = [1, 2, 3, 4];\n * var factorials = R.scan(R.multiply, 1, numbers); //=> [1, 1, 2, 6, 24]\n */\n var scan = _curry3(function scan(fn, acc, list) {\n var idx = 0;\n var len = list.length;\n var result = [acc];\n while (idx < len) {\n acc = fn(acc, list[idx]);\n result[idx + 1] = acc;\n idx += 1;\n }\n return result;\n });\n\n /**\n * Returns the result of \"setting\" the portion of the given data structure\n * focused by the given lens to the given value.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> a -> s -> s\n * @param {Lens} lens\n * @param {*} v\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n * var xLens = R.lensProp('x');\n *\n * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}\n * R.set(xLens, 8, {x: 1, y: 2}); //=> {x: 8, y: 2}\n */\n var set = _curry3(function set(lens, v, x) {\n return over(lens, always(v), x);\n });\n\n /**\n * Returns the elements of the given list or string (or object with a `slice`\n * method) from `fromIndex` (inclusive) to `toIndex` (exclusive).\n *\n * Dispatches to the `slice` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Number -> Number -> [a] -> [a]\n * @sig Number -> Number -> String -> String\n * @param {Number} fromIndex The start index (inclusive).\n * @param {Number} toIndex The end index (exclusive).\n * @param {*} list\n * @return {*}\n * @example\n *\n * R.slice(1, 3, ['a', 'b', 'c', 'd']); //=> ['b', 'c']\n * R.slice(1, Infinity, ['a', 'b', 'c', 'd']); //=> ['b', 'c', 'd']\n * R.slice(0, -1, ['a', 'b', 'c', 'd']); //=> ['a', 'b', 'c']\n * R.slice(-3, -1, ['a', 'b', 'c', 'd']); //=> ['b', 'c']\n * R.slice(0, 3, 'ramda'); //=> 'ram'\n */\n var slice = _curry3(_checkForMethod('slice', function slice(fromIndex, toIndex, list) {\n return Array.prototype.slice.call(list, fromIndex, toIndex);\n }));\n\n /**\n * Returns a copy of the list, sorted according to the comparator function,\n * which should accept two values at a time and return a negative number if the\n * first value is smaller, a positive number if it's larger, and zero if they\n * are equal. Please note that this is a **copy** of the list. It does not\n * modify the original.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a,a -> Number) -> [a] -> [a]\n * @param {Function} comparator A sorting function :: a -> b -> Int\n * @param {Array} list The list to sort\n * @return {Array} a new array with its elements sorted by the comparator function.\n * @example\n *\n * var diff = function(a, b) { return a - b; };\n * R.sort(diff, [4,2,7,5]); //=> [2, 4, 5, 7]\n */\n var sort = _curry2(function sort(comparator, list) {\n return _slice(list).sort(comparator);\n });\n\n /**\n * Sorts the list according to the supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig Ord b => (a -> b) -> [a] -> [a]\n * @param {Function} fn\n * @param {Array} list The list to sort.\n * @return {Array} A new list sorted by the keys generated by `fn`.\n * @example\n *\n * var sortByFirstItem = R.sortBy(R.prop(0));\n * var sortByNameCaseInsensitive = R.sortBy(R.compose(R.toLower, R.prop('name')));\n * var pairs = [[-1, 1], [-2, 2], [-3, 3]];\n * sortByFirstItem(pairs); //=> [[-3, 3], [-2, 2], [-1, 1]]\n * var alice = {\n * name: 'ALICE',\n * age: 101\n * };\n * var bob = {\n * name: 'Bob',\n * age: -10\n * };\n * var clara = {\n * name: 'clara',\n * age: 314.159\n * };\n * var people = [clara, bob, alice];\n * sortByNameCaseInsensitive(people); //=> [alice, bob, clara]\n */\n var sortBy = _curry2(function sortBy(fn, list) {\n return _slice(list).sort(function (a, b) {\n var aa = fn(a);\n var bb = fn(b);\n return aa < bb ? -1 : aa > bb ? 1 : 0;\n });\n });\n\n /**\n * Splits a given list or string at a given index.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig Number -> [a] -> [[a], [a]]\n * @sig Number -> String -> [String, String]\n * @param {Number} index The index where the array/string is split.\n * @param {Array|String} array The array/string to be split.\n * @return {Array}\n * @example\n *\n * R.splitAt(1, [1, 2, 3]); //=> [[1], [2, 3]]\n * R.splitAt(5, 'hello world'); //=> ['hello', ' world']\n * R.splitAt(-1, 'foobar'); //=> ['fooba', 'r']\n */\n var splitAt = _curry2(function splitAt(index, array) {\n return [\n slice(0, index, array),\n slice(index, length(array), array)\n ];\n });\n\n /**\n * Splits a collection into slices of the specified length.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [[a]]\n * @sig Number -> String -> [String]\n * @param {Number} n\n * @param {Array} list\n * @return {Array}\n * @example\n *\n * R.splitEvery(3, [1, 2, 3, 4, 5, 6, 7]); //=> [[1, 2, 3], [4, 5, 6], [7]]\n * R.splitEvery(3, 'foobarbaz'); //=> ['foo', 'bar', 'baz']\n */\n var splitEvery = _curry2(function splitEvery(n, list) {\n if (n <= 0) {\n throw new Error('First argument to splitEvery must be a positive integer');\n }\n var result = [];\n var idx = 0;\n while (idx < list.length) {\n result.push(slice(idx, idx += n, list));\n }\n return result;\n });\n\n /**\n * Takes a list and a predicate and returns a pair of lists with the following properties:\n *\n * - the result of concatenating the two output lists is equivalent to the input list;\n * - none of the elements of the first output list satisfies the predicate; and\n * - if the second output list is non-empty, its first element satisfies the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [[a], [a]]\n * @param {Function} pred The predicate that determines where the array is split.\n * @param {Array} list The array to be split.\n * @return {Array}\n * @example\n *\n * R.splitWhen(R.equals(2), [1, 2, 3, 1, 2, 3]); //=> [[1], [2, 3, 1, 2, 3]]\n */\n var splitWhen = _curry2(function splitWhen(pred, list) {\n var idx = 0;\n var len = list.length;\n var prefix = [];\n while (idx < len && !pred(list[idx])) {\n prefix.push(list[idx]);\n idx += 1;\n }\n return [\n prefix,\n _slice(list, idx)\n ];\n });\n\n /**\n * Subtracts its second argument from its first argument.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig Number -> Number -> Number\n * @param {Number} a The first value.\n * @param {Number} b The second value.\n * @return {Number} The result of `a - b`.\n * @see R.add\n * @example\n *\n * R.subtract(10, 8); //=> 2\n *\n * var minus5 = R.subtract(R.__, 5);\n * minus5(17); //=> 12\n *\n * var complementaryAngle = R.subtract(90);\n * complementaryAngle(30); //=> 60\n * complementaryAngle(72); //=> 18\n */\n var subtract = _curry2(function subtract(a, b) {\n return Number(a) - Number(b);\n });\n\n /**\n * Returns all but the first element of the given list or string (or object\n * with a `tail` method).\n *\n * Dispatches to the `slice` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.head, R.init, R.last\n * @example\n *\n * R.tail([1, 2, 3]); //=> [2, 3]\n * R.tail([1, 2]); //=> [2]\n * R.tail([1]); //=> []\n * R.tail([]); //=> []\n *\n * R.tail('abc'); //=> 'bc'\n * R.tail('ab'); //=> 'b'\n * R.tail('a'); //=> ''\n * R.tail(''); //=> ''\n */\n var tail = _checkForMethod('tail', slice(1, Infinity));\n\n /**\n * Returns the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `take` method).\n *\n * Dispatches to the `take` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*}\n * @see R.drop\n * @example\n *\n * R.take(1, ['foo', 'bar', 'baz']); //=> ['foo']\n * R.take(2, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n * R.take(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.take(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.take(3, 'ramda'); //=> 'ram'\n *\n * var personnel = [\n * 'Dave Brubeck',\n * 'Paul Desmond',\n * 'Eugene Wright',\n * 'Joe Morello',\n * 'Gerry Mulligan',\n * 'Bob Bates',\n * 'Joe Dodge',\n * 'Ron Crotty'\n * ];\n *\n * var takeFive = R.take(5);\n * takeFive(personnel);\n * //=> ['Dave Brubeck', 'Paul Desmond', 'Eugene Wright', 'Joe Morello', 'Gerry Mulligan']\n */\n var take = _curry2(_dispatchable('take', _xtake, function take(n, xs) {\n return slice(0, n < 0 ? Infinity : n, xs);\n }));\n\n /**\n * Returns a new list containing the last `n` elements of a given list, passing\n * each value to the supplied predicate function, and terminating when the\n * predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropLastWhile, R.addIndex\n * @example\n *\n * var isNotOne = x => x !== 1;\n *\n * R.takeLastWhile(isNotOne, [1, 2, 3, 4]); //=> [2, 3, 4]\n */\n var takeLastWhile = _curry2(function takeLastWhile(fn, list) {\n var idx = list.length - 1;\n while (idx >= 0 && fn(list[idx])) {\n idx -= 1;\n }\n return _slice(list, idx + 1, Infinity);\n });\n\n /**\n * Returns a new list containing the first `n` elements of a given list,\n * passing each value to the supplied predicate function, and terminating when\n * the predicate function returns `false`. Excludes the element that caused the\n * predicate function to fail. The predicate function is passed one argument:\n * *(value)*.\n *\n * Dispatches to the `takeWhile` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.dropWhile, R.transduce, R.addIndex\n * @example\n *\n * var isNotFour = x => x !== 4;\n *\n * R.takeWhile(isNotFour, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3]\n */\n var takeWhile = _curry2(_dispatchable('takeWhile', _xtakeWhile, function takeWhile(fn, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len && fn(list[idx])) {\n idx += 1;\n }\n return _slice(list, 0, idx);\n }));\n\n /**\n * Runs the given function with the supplied object, then returns the object.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a -> *) -> a -> a\n * @param {Function} fn The function to call with `x`. The return value of `fn` will be thrown away.\n * @param {*} x\n * @return {*} `x`.\n * @example\n *\n * var sayX = x => console.log('x is ' + x);\n * R.tap(sayX, 100); //=> 100\n * //-> 'x is 100'\n */\n var tap = _curry2(function tap(fn, x) {\n fn(x);\n return x;\n });\n\n /**\n * Calls an input function `n` times, returning an array containing the results\n * of those function calls.\n *\n * `fn` is passed one argument: The current value of `n`, which begins at `0`\n * and is gradually incremented to `n - 1`.\n *\n * @func\n * @memberOf R\n * @since v0.2.3\n * @category List\n * @sig (Number -> a) -> Number -> [a]\n * @param {Function} fn The function to invoke. Passed one argument, the current value of `n`.\n * @param {Number} n A value between `0` and `n - 1`. Increments after each function call.\n * @return {Array} An array containing the return values of all calls to `fn`.\n * @example\n *\n * R.times(R.identity, 5); //=> [0, 1, 2, 3, 4]\n */\n var times = _curry2(function times(fn, n) {\n var len = Number(n);\n var idx = 0;\n var list;\n if (len < 0 || isNaN(len)) {\n throw new RangeError('n must be a non-negative number');\n }\n list = new Array(len);\n while (idx < len) {\n list[idx] = fn(idx);\n idx += 1;\n }\n return list;\n });\n\n /**\n * Converts an object into an array of key, value arrays. Only the object's\n * own properties are used.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own properties.\n * @see R.fromPairs\n * @example\n *\n * R.toPairs({a: 1, b: 2, c: 3}); //=> [['a', 1], ['b', 2], ['c', 3]]\n */\n var toPairs = _curry1(function toPairs(obj) {\n var pairs = [];\n for (var prop in obj) {\n if (_has(prop, obj)) {\n pairs[pairs.length] = [\n prop,\n obj[prop]\n ];\n }\n }\n return pairs;\n });\n\n /**\n * Converts an object into an array of key, value arrays. The object's own\n * properties and prototype properties are used. Note that the order of the\n * output array is not guaranteed to be consistent across different JS\n * platforms.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Object\n * @sig {String: *} -> [[String,*]]\n * @param {Object} obj The object to extract from\n * @return {Array} An array of key, value arrays from the object's own\n * and prototype properties.\n * @example\n *\n * var F = function() { this.x = 'X'; };\n * F.prototype.y = 'Y';\n * var f = new F();\n * R.toPairsIn(f); //=> [['x','X'], ['y','Y']]\n */\n var toPairsIn = _curry1(function toPairsIn(obj) {\n var pairs = [];\n for (var prop in obj) {\n pairs[pairs.length] = [\n prop,\n obj[prop]\n ];\n }\n return pairs;\n });\n\n /**\n * Transposes the rows and columns of a 2D list.\n * When passed a list of `n` lists of length `x`,\n * returns a list of `x` lists of length `n`.\n *\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [[a]] -> [[a]]\n * @param {Array} list A 2D list\n * @return {Array} A 2D list\n * @example\n *\n * R.transpose([[1, 'a'], [2, 'b'], [3, 'c']]) //=> [[1, 2, 3], ['a', 'b', 'c']]\n * R.transpose([[1, 2, 3], ['a', 'b', 'c']]) //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n *\n * If some of the rows are shorter than the following rows, their elements are skipped:\n *\n * R.transpose([[10, 11], [20], [], [30, 31, 32]]) //=> [[10, 20, 30], [11, 31], [32]]\n */\n var transpose = _curry1(function transpose(outerlist) {\n var i = 0;\n var result = [];\n while (i < outerlist.length) {\n var innerlist = outerlist[i];\n var j = 0;\n while (j < innerlist.length) {\n if (typeof result[j] === 'undefined') {\n result[j] = [];\n }\n result[j].push(innerlist[j]);\n j += 1;\n }\n i += 1;\n }\n return result;\n });\n\n /**\n * Removes (strips) whitespace from both ends of the string.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to trim.\n * @return {String} Trimmed version of `str`.\n * @example\n *\n * R.trim(' xyz '); //=> 'xyz'\n * R.map(R.trim, R.split(',', 'x, y, z')); //=> ['x', 'y', 'z']\n */\n var trim = function () {\n var ws = '\\t\\n\\x0B\\f\\r \\xA0\\u1680\\u180E\\u2000\\u2001\\u2002\\u2003' + '\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028' + '\\u2029\\uFEFF';\n var zeroWidth = '\\u200B';\n var hasProtoTrim = typeof String.prototype.trim === 'function';\n if (!hasProtoTrim || (ws.trim() || !zeroWidth.trim())) {\n return _curry1(function trim(str) {\n var beginRx = new RegExp('^[' + ws + '][' + ws + ']*');\n var endRx = new RegExp('[' + ws + '][' + ws + ']*$');\n return str.replace(beginRx, '').replace(endRx, '');\n });\n } else {\n return _curry1(function trim(str) {\n return str.trim();\n });\n }\n }();\n\n /**\n * `tryCatch` takes two functions, a `tryer` and a `catcher`. The returned\n * function evaluates the `tryer`; if it does not throw, it simply returns the\n * result. If the `tryer` *does* throw, the returned function evaluates the\n * `catcher` function and returns its result. Note that for effective\n * composition with this function, both the `tryer` and `catcher` functions\n * must return the same type of results.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig (...x -> a) -> ((e, ...x) -> a) -> (...x -> a)\n * @param {Function} tryer The function that may throw.\n * @param {Function} catcher The function that will be evaluated if `tryer` throws.\n * @return {Function} A new function that will catch exceptions and send then to the catcher.\n * @example\n *\n * R.tryCatch(R.prop('x'), R.F, {x: true}); //=> true\n * R.tryCatch(R.prop('x'), R.F, null); //=> false\n */\n var tryCatch = _curry2(function _tryCatch(tryer, catcher) {\n return _arity(tryer.length, function () {\n try {\n return tryer.apply(this, arguments);\n } catch (e) {\n return catcher.apply(this, _concat([e], arguments));\n }\n });\n });\n\n /**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n * R.type({}); //=> \"Object\"\n * R.type(1); //=> \"Number\"\n * R.type(false); //=> \"Boolean\"\n * R.type('s'); //=> \"String\"\n * R.type(null); //=> \"Null\"\n * R.type([]); //=> \"Array\"\n * R.type(/[A-z]/); //=> \"RegExp\"\n */\n var type = _curry1(function type(val) {\n return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n });\n\n /**\n * Takes a function `fn`, which takes a single array argument, and returns a\n * function which:\n *\n * - takes any number of positional arguments;\n * - passes these arguments to `fn` as an array; and\n * - returns the result.\n *\n * In other words, R.unapply derives a variadic function from a function which\n * takes an array. R.unapply is the inverse of R.apply.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Function\n * @sig ([*...] -> a) -> (*... -> a)\n * @param {Function} fn\n * @return {Function}\n * @see R.apply\n * @example\n *\n * R.unapply(JSON.stringify)(1, 2, 3); //=> '[1,2,3]'\n */\n var unapply = _curry1(function unapply(fn) {\n return function () {\n return fn(_slice(arguments));\n };\n });\n\n /**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 1 parameter. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> b) -> (a -> b)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n * arity 1.\n * @example\n *\n * var takesTwoArgs = function(a, b) {\n * return [a, b];\n * };\n * takesTwoArgs.length; //=> 2\n * takesTwoArgs(1, 2); //=> [1, 2]\n *\n * var takesOneArg = R.unary(takesTwoArgs);\n * takesOneArg.length; //=> 1\n * // Only 1 argument is passed to the wrapped function\n * takesOneArg(1, 2); //=> [1, undefined]\n */\n var unary = _curry1(function unary(fn) {\n return nAry(1, fn);\n });\n\n /**\n * Returns a function of arity `n` from a (manually) curried function.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Function\n * @sig Number -> (a -> b) -> (a -> c)\n * @param {Number} length The arity for the returned function.\n * @param {Function} fn The function to uncurry.\n * @return {Function} A new function.\n * @see R.curry\n * @example\n *\n * var addFour = a => b => c => d => a + b + c + d;\n *\n * var uncurriedAddFour = R.uncurryN(4, addFour);\n * uncurriedAddFour(1, 2, 3, 4); //=> 10\n */\n var uncurryN = _curry2(function uncurryN(depth, fn) {\n return curryN(depth, function () {\n var currentDepth = 1;\n var value = fn;\n var idx = 0;\n var endIdx;\n while (currentDepth <= depth && typeof value === 'function') {\n endIdx = currentDepth === depth ? arguments.length : idx + value.length;\n value = value.apply(this, _slice(arguments, idx, endIdx));\n currentDepth += 1;\n idx = endIdx;\n }\n return value;\n });\n });\n\n /**\n * Builds a list from a seed value. Accepts an iterator function, which returns\n * either false to stop iteration or an array of length 2 containing the value\n * to add to the resulting list and the seed to be used in the next call to the\n * iterator function.\n *\n * The iterator function receives one argument: *(seed)*.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category List\n * @sig (a -> [b]) -> * -> [b]\n * @param {Function} fn The iterator function. receives one argument, `seed`, and returns\n * either false to quit iteration or an array of length two to proceed. The element\n * at index 0 of this array will be added to the resulting array, and the element\n * at index 1 will be passed to the next call to `fn`.\n * @param {*} seed The seed value.\n * @return {Array} The final list.\n * @example\n *\n * var f = n => n > 50 ? false : [-n, n + 10];\n * R.unfold(f, 10); //=> [-10, -20, -30, -40, -50]\n */\n var unfold = _curry2(function unfold(fn, seed) {\n var pair = fn(seed);\n var result = [];\n while (pair && pair.length) {\n result[result.length] = pair[0];\n pair = fn(pair[1]);\n }\n return result;\n });\n\n /**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied predicate to\n * two list elements. Prefers the first item if two items compare equal based\n * on the predicate.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category List\n * @sig (a, a -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n * var strEq = R.eqBy(String);\n * R.uniqWith(strEq)([1, '1', 2, 1]); //=> [1, 2]\n * R.uniqWith(strEq)([{}, {}]); //=> [{}]\n * R.uniqWith(strEq)([1, '1', 1]); //=> [1]\n * R.uniqWith(strEq)(['1', 1, 1]); //=> ['1']\n */\n var uniqWith = _curry2(function uniqWith(pred, list) {\n var idx = 0;\n var len = list.length;\n var result = [];\n var item;\n while (idx < len) {\n item = list[idx];\n if (!_containsWith(pred, item, result)) {\n result[result.length] = item;\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is not satisfied, the function will return the result of\n * calling the `whenFalseFn` function with the same argument. If the predicate\n * is satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} whenFalseFn A function to invoke when the `pred` evaluates\n * to a falsy value.\n * @param {*} x An object to test with the `pred` function and\n * pass to `whenFalseFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenFalseFn`.\n * @see R.ifElse, R.when\n * @example\n *\n * // coerceArray :: (a|[a]) -> [a]\n * var coerceArray = R.unless(R.isArrayLike, R.of);\n * coerceArray([1, 2, 3]); //=> [1, 2, 3]\n * coerceArray(1); //=> [1]\n */\n var unless = _curry3(function unless(pred, whenFalseFn, x) {\n return pred(x) ? x : whenFalseFn(x);\n });\n\n /**\n * Takes a predicate, a transformation function, and an initial value,\n * and returns a value of the same type as the initial value.\n * It does so by applying the transformation until the predicate is satisfied,\n * at which point it returns the satisfactory value.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} fn The iterator function\n * @param {*} init Initial value\n * @return {*} Final value that satisfies predicate\n * @example\n *\n * R.until(R.gt(R.__, 100), R.multiply(2))(1) // => 128\n */\n var until = _curry3(function until(pred, fn, init) {\n var val = init;\n while (!pred(val)) {\n val = fn(val);\n }\n return val;\n });\n\n /**\n * Returns a new copy of the array with the element at the provided index\n * replaced with the given value.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig Number -> a -> [a] -> [a]\n * @param {Number} idx The index to update.\n * @param {*} x The value to exist at the given index of the returned array.\n * @param {Array|Arguments} list The source array-like object to be updated.\n * @return {Array} A copy of `list` with the value at index `idx` replaced with `x`.\n * @see R.adjust\n * @example\n *\n * R.update(1, 11, [0, 1, 2]); //=> [0, 11, 2]\n * R.update(1)(11)([0, 1, 2]); //=> [0, 11, 2]\n */\n var update = _curry3(function update(idx, x, list) {\n return adjust(always(x), idx, list);\n });\n\n /**\n * Accepts a function `fn` and a list of transformer functions and returns a\n * new curried function. When the new function is invoked, it calls the\n * function `fn` with parameters consisting of the result of calling each\n * supplied handler on successive arguments to the new function.\n *\n * If more arguments are passed to the returned function than transformer\n * functions, those arguments are passed directly to `fn` as additional\n * parameters. If you expect additional arguments that don't need to be\n * transformed, although you can ignore them, it's best to pass an identity\n * function so that the new function reports the correct arity.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (x1 -> x2 -> ... -> z) -> [(a -> x1), (b -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} fn The function to wrap.\n * @param {Array} transformers A list of transformer functions\n * @return {Function} The wrapped function.\n * @example\n *\n * R.useWith(Math.pow, [R.identity, R.identity])(3, 4); //=> 81\n * R.useWith(Math.pow, [R.identity, R.identity])(3)(4); //=> 81\n * R.useWith(Math.pow, [R.dec, R.inc])(3, 4); //=> 32\n * R.useWith(Math.pow, [R.dec, R.inc])(3)(4); //=> 32\n */\n var useWith = _curry2(function useWith(fn, transformers) {\n return curryN(transformers.length, function () {\n var args = [];\n var idx = 0;\n while (idx < transformers.length) {\n args.push(transformers[idx].call(this, arguments[idx]));\n idx += 1;\n }\n return fn.apply(this, args.concat(_slice(arguments, transformers.length)));\n });\n });\n\n /**\n * Returns a list of all the enumerable own properties of the supplied object.\n * Note that the order of the output array is not guaranteed across different\n * JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own properties.\n * @example\n *\n * R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]\n */\n var values = _curry1(function values(obj) {\n var props = keys(obj);\n var len = props.length;\n var vals = [];\n var idx = 0;\n while (idx < len) {\n vals[idx] = obj[props[idx]];\n idx += 1;\n }\n return vals;\n });\n\n /**\n * Returns a list of all the properties, including prototype properties, of the\n * supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own and prototype properties.\n * @example\n *\n * var F = function() { this.x = 'X'; };\n * F.prototype.y = 'Y';\n * var f = new F();\n * R.valuesIn(f); //=> ['X', 'Y']\n */\n var valuesIn = _curry1(function valuesIn(obj) {\n var prop;\n var vs = [];\n for (prop in obj) {\n vs[vs.length] = obj[prop];\n }\n return vs;\n });\n\n /**\n * Returns a \"view\" of the given data structure, determined by the given lens.\n * The lens's focus determines which portion of the data structure is visible.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Lens s a -> s -> a\n * @param {Lens} lens\n * @param {*} x\n * @return {*}\n * @see R.prop, R.lensIndex, R.lensProp\n * @example\n *\n * var xLens = R.lensProp('x');\n *\n * R.view(xLens, {x: 1, y: 2}); //=> 1\n * R.view(xLens, {x: 4, y: 2}); //=> 4\n */\n // `Const` is a functor that effectively ignores the function given to `map`.\n // Using `Const` effectively ignores the setter function of the `lens`,\n // leaving the value returned by the getter function unmodified.\n var view = function () {\n // `Const` is a functor that effectively ignores the function given to `map`.\n var Const = function (x) {\n return {\n value: x,\n map: function () {\n return this;\n }\n };\n };\n return _curry2(function view(lens, x) {\n // Using `Const` effectively ignores the setter function of the `lens`,\n // leaving the value returned by the getter function unmodified.\n return lens(Const)(x).value;\n });\n }();\n\n /**\n * Tests the final argument by passing it to the given predicate function. If\n * the predicate is satisfied, the function will return the result of calling\n * the `whenTrueFn` function with the same argument. If the predicate is not\n * satisfied, the argument is returned as is.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Logic\n * @sig (a -> Boolean) -> (a -> a) -> a -> a\n * @param {Function} pred A predicate function\n * @param {Function} whenTrueFn A function to invoke when the `condition`\n * evaluates to a truthy value.\n * @param {*} x An object to test with the `pred` function and\n * pass to `whenTrueFn` if necessary.\n * @return {*} Either `x` or the result of applying `x` to `whenTrueFn`.\n * @see R.ifElse, R.unless\n * @example\n *\n * // truncate :: String -> String\n * var truncate = R.when(\n * R.propSatisfies(R.gt(R.__, 10), 'length'),\n * R.pipe(R.take(10), R.append('…'), R.join(''))\n * );\n * truncate('12345'); //=> '12345'\n * truncate('0123456789ABC'); //=> '0123456789…'\n */\n var when = _curry3(function when(pred, whenTrueFn, x) {\n return pred(x) ? whenTrueFn(x) : x;\n });\n\n /**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec. Each of the spec's own properties must be a predicate function.\n * Each predicate is applied to the value of the corresponding property of the\n * test object. `where` returns true if all the predicates return true, false\n * otherwise.\n *\n * `where` is well suited to declaratively expressing constraints for other\n * functions such as `filter` and `find`.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category Object\n * @sig {String: (* -> Boolean)} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @example\n *\n * // pred :: Object -> Boolean\n * var pred = R.where({\n * a: R.equals('foo'),\n * b: R.complement(R.equals('bar')),\n * x: R.gt(_, 10),\n * y: R.lt(_, 20)\n * });\n *\n * pred({a: 'foo', b: 'xxx', x: 11, y: 19}); //=> true\n * pred({a: 'xxx', b: 'xxx', x: 11, y: 19}); //=> false\n * pred({a: 'foo', b: 'bar', x: 11, y: 19}); //=> false\n * pred({a: 'foo', b: 'xxx', x: 10, y: 19}); //=> false\n * pred({a: 'foo', b: 'xxx', x: 11, y: 20}); //=> false\n */\n var where = _curry2(function where(spec, testObj) {\n for (var prop in spec) {\n if (_has(prop, spec) && !spec[prop](testObj[prop])) {\n return false;\n }\n }\n return true;\n });\n\n /**\n * Wrap a function inside another to allow you to make adjustments to the\n * parameters, or do other processing either before the internal function is\n * called or with its results.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a... -> b) -> ((a... -> b) -> a... -> c) -> (a... -> c)\n * @param {Function} fn The function to wrap.\n * @param {Function} wrapper The wrapper function.\n * @return {Function} The wrapped function.\n * @example\n *\n * var greet = name => 'Hello ' + name;\n *\n * var shoutedGreet = R.wrap(greet, (gr, name) => gr(name).toUpperCase());\n *\n * shoutedGreet(\"Kathy\"); //=> \"HELLO KATHY\"\n *\n * var shortenedGreet = R.wrap(greet, function(gr, name) {\n * return gr(name.substring(0, 3));\n * });\n * shortenedGreet(\"Robert\"); //=> \"Hello Rob\"\n */\n var wrap = _curry2(function wrap(fn, wrapper) {\n return curryN(fn.length, function () {\n return wrapper.apply(this, _concat([fn], arguments));\n });\n });\n\n /**\n * Creates a new list out of the two supplied by creating each possible pair\n * from the lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The list made by combining each possible pair from\n * `as` and `bs` into pairs (`[a, b]`).\n * @example\n *\n * R.xprod([1, 2], ['a', 'b']); //=> [[1, 'a'], [1, 'b'], [2, 'a'], [2, 'b']]\n */\n // = xprodWith(prepend); (takes about 3 times as long...)\n var xprod = _curry2(function xprod(a, b) {\n // = xprodWith(prepend); (takes about 3 times as long...)\n var idx = 0;\n var ilen = a.length;\n var j;\n var jlen = b.length;\n var result = [];\n while (idx < ilen) {\n j = 0;\n while (j < jlen) {\n result[result.length] = [\n a[idx],\n b[j]\n ];\n j += 1;\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Creates a new list out of the two supplied by pairing up equally-positioned\n * items from both lists. The returned list is truncated to the length of the\n * shorter of the two input lists.\n * Note: `zip` is equivalent to `zipWith(function(a, b) { return [a, b] })`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b] -> [[a,b]]\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by pairing up same-indexed elements of `list1` and `list2`.\n * @example\n *\n * R.zip([1, 2, 3], ['a', 'b', 'c']); //=> [[1, 'a'], [2, 'b'], [3, 'c']]\n */\n var zip = _curry2(function zip(a, b) {\n var rv = [];\n var idx = 0;\n var len = Math.min(a.length, b.length);\n while (idx < len) {\n rv[idx] = [\n a[idx],\n b[idx]\n ];\n idx += 1;\n }\n return rv;\n });\n\n /**\n * Creates a new object out of a list of keys and a list of values.\n * Key/value pairing is truncated to the length of the shorter of the two lists.\n * Note: `zipObj` is equivalent to `pipe(zipWith(pair), fromPairs)`.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig [String] -> [*] -> {String: *}\n * @param {Array} keys The array that will be properties on the output object.\n * @param {Array} values The list of values on the output object.\n * @return {Object} The object made by pairing up same-indexed elements of `keys` and `values`.\n * @example\n *\n * R.zipObj(['a', 'b', 'c'], [1, 2, 3]); //=> {a: 1, b: 2, c: 3}\n */\n var zipObj = _curry2(function zipObj(keys, values) {\n var idx = 0;\n var len = Math.min(keys.length, values.length);\n var out = {};\n while (idx < len) {\n out[keys[idx]] = values[idx];\n idx += 1;\n }\n return out;\n });\n\n /**\n * Creates a new list out of the two supplied by applying the function to each\n * equally-positioned pair in the lists. The returned list is truncated to the\n * length of the shorter of the two input lists.\n *\n * @function\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a,b -> c) -> [a] -> [b] -> [c]\n * @param {Function} fn The function used to combine the two elements into one value.\n * @param {Array} list1 The first array to consider.\n * @param {Array} list2 The second array to consider.\n * @return {Array} The list made by combining same-indexed elements of `list1` and `list2`\n * using `fn`.\n * @example\n *\n * var f = (x, y) => {\n * // ...\n * };\n * R.zipWith(f, [1, 2, 3], ['a', 'b', 'c']);\n * //=> [f(1, 'a'), f(2, 'b'), f(3, 'c')]\n */\n var zipWith = _curry3(function zipWith(fn, a, b) {\n var rv = [];\n var idx = 0;\n var len = Math.min(a.length, b.length);\n while (idx < len) {\n rv[idx] = fn(a[idx], b[idx]);\n idx += 1;\n }\n return rv;\n });\n\n /**\n * A function that always returns `false`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.T\n * @example\n *\n * R.F(); //=> false\n */\n var F = always(false);\n\n /**\n * A function that always returns `true`. Any passed in parameters are ignored.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig * -> Boolean\n * @param {*}\n * @return {Boolean}\n * @see R.always, R.F\n * @example\n *\n * R.T(); //=> true\n */\n var T = always(true);\n\n /**\n * Copies an object.\n *\n * @private\n * @param {*} value The value to be copied\n * @param {Array} refFrom Array containing the source references\n * @param {Array} refTo Array containing the copied source references\n * @param {Boolean} deep Whether or not to perform deep cloning.\n * @return {*} The copied value.\n */\n var _clone = function _clone(value, refFrom, refTo, deep) {\n var copy = function copy(copiedValue) {\n var len = refFrom.length;\n var idx = 0;\n while (idx < len) {\n if (value === refFrom[idx]) {\n return refTo[idx];\n }\n idx += 1;\n }\n refFrom[idx + 1] = value;\n refTo[idx + 1] = copiedValue;\n for (var key in value) {\n copiedValue[key] = deep ? _clone(value[key], refFrom, refTo, true) : value[key];\n }\n return copiedValue;\n };\n switch (type(value)) {\n case 'Object':\n return copy({});\n case 'Array':\n return copy([]);\n case 'Date':\n return new Date(value.valueOf());\n case 'RegExp':\n return _cloneRegExp(value);\n default:\n return value;\n }\n };\n\n var _createPartialApplicator = function _createPartialApplicator(concat) {\n return _curry2(function (fn, args) {\n return _arity(Math.max(0, fn.length - args.length), function () {\n return fn.apply(this, concat(args, arguments));\n });\n });\n };\n\n var _dropLast = function dropLast(n, xs) {\n return take(n < xs.length ? xs.length - n : 0, xs);\n };\n\n // Values of other types are only equal if identical.\n var _equals = function _equals(a, b, stackA, stackB) {\n if (identical(a, b)) {\n return true;\n }\n if (type(a) !== type(b)) {\n return false;\n }\n if (a == null || b == null) {\n return false;\n }\n if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n }\n switch (type(a)) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n return a === b;\n }\n break;\n case 'Boolean':\n case 'Number':\n case 'String':\n if (!(typeof a === typeof b && identical(a.valueOf(), b.valueOf()))) {\n return false;\n }\n break;\n case 'Date':\n if (!identical(a.valueOf(), b.valueOf())) {\n return false;\n }\n break;\n case 'Error':\n return a.name === b.name && a.message === b.message;\n case 'RegExp':\n if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n return false;\n }\n break;\n case 'Map':\n case 'Set':\n if (!_equals(_arrayFromIterator(a.entries()), _arrayFromIterator(b.entries()), stackA, stackB)) {\n return false;\n }\n break;\n case 'Int8Array':\n case 'Uint8Array':\n case 'Uint8ClampedArray':\n case 'Int16Array':\n case 'Uint16Array':\n case 'Int32Array':\n case 'Uint32Array':\n case 'Float32Array':\n case 'Float64Array':\n break;\n case 'ArrayBuffer':\n break;\n default:\n // Values of other types are only equal if identical.\n return false;\n }\n var keysA = keys(a);\n if (keysA.length !== keys(b).length) {\n return false;\n }\n var idx = stackA.length - 1;\n while (idx >= 0) {\n if (stackA[idx] === a) {\n return stackB[idx] === b;\n }\n idx -= 1;\n }\n stackA.push(a);\n stackB.push(b);\n idx = keysA.length - 1;\n while (idx >= 0) {\n var key = keysA[idx];\n if (!(_has(key, b) && _equals(b[key], a[key], stackA, stackB))) {\n return false;\n }\n idx -= 1;\n }\n stackA.pop();\n stackB.pop();\n return true;\n };\n\n /**\n * `_makeFlat` is a helper function that returns a one-level or fully recursive\n * function based on the flag passed in.\n *\n * @private\n */\n var _makeFlat = function _makeFlat(recursive) {\n return function flatt(list) {\n var value, jlen, j;\n var result = [];\n var idx = 0;\n var ilen = list.length;\n while (idx < ilen) {\n if (isArrayLike(list[idx])) {\n value = recursive ? flatt(list[idx]) : list[idx];\n j = 0;\n jlen = value.length;\n while (j < jlen) {\n result[result.length] = value[j];\n j += 1;\n }\n } else {\n result[result.length] = list[idx];\n }\n idx += 1;\n }\n return result;\n };\n };\n\n var _reduce = function () {\n function _arrayReduce(xf, acc, list) {\n var idx = 0;\n var len = list.length;\n while (idx < len) {\n acc = xf['@@transducer/step'](acc, list[idx]);\n if (acc && acc['@@transducer/reduced']) {\n acc = acc['@@transducer/value'];\n break;\n }\n idx += 1;\n }\n return xf['@@transducer/result'](acc);\n }\n function _iterableReduce(xf, acc, iter) {\n var step = iter.next();\n while (!step.done) {\n acc = xf['@@transducer/step'](acc, step.value);\n if (acc && acc['@@transducer/reduced']) {\n acc = acc['@@transducer/value'];\n break;\n }\n step = iter.next();\n }\n return xf['@@transducer/result'](acc);\n }\n function _methodReduce(xf, acc, obj) {\n return xf['@@transducer/result'](obj.reduce(bind(xf['@@transducer/step'], xf), acc));\n }\n var symIterator = typeof Symbol !== 'undefined' ? Symbol.iterator : '@@iterator';\n return function _reduce(fn, acc, list) {\n if (typeof fn === 'function') {\n fn = _xwrap(fn);\n }\n if (isArrayLike(list)) {\n return _arrayReduce(fn, acc, list);\n }\n if (typeof list.reduce === 'function') {\n return _methodReduce(fn, acc, list);\n }\n if (list[symIterator] != null) {\n return _iterableReduce(fn, acc, list[symIterator]());\n }\n if (typeof list.next === 'function') {\n return _iterableReduce(fn, acc, list);\n }\n throw new TypeError('reduce: list must be array or iterable');\n };\n }();\n\n var _stepCat = function () {\n var _stepCatArray = {\n '@@transducer/init': Array,\n '@@transducer/step': function (xs, x) {\n xs.push(x);\n return xs;\n },\n '@@transducer/result': _identity\n };\n var _stepCatString = {\n '@@transducer/init': String,\n '@@transducer/step': function (a, b) {\n return a + b;\n },\n '@@transducer/result': _identity\n };\n var _stepCatObject = {\n '@@transducer/init': Object,\n '@@transducer/step': function (result, input) {\n return _assign(result, isArrayLike(input) ? objOf(input[0], input[1]) : input);\n },\n '@@transducer/result': _identity\n };\n return function _stepCat(obj) {\n if (_isTransformer(obj)) {\n return obj;\n }\n if (isArrayLike(obj)) {\n return _stepCatArray;\n }\n if (typeof obj === 'string') {\n return _stepCatString;\n }\n if (typeof obj === 'object') {\n return _stepCatObject;\n }\n throw new Error('Cannot create transformer for ' + obj);\n };\n }();\n\n var _xdropLastWhile = function () {\n function XDropLastWhile(fn, xf) {\n this.f = fn;\n this.retained = [];\n this.xf = xf;\n }\n XDropLastWhile.prototype['@@transducer/init'] = _xfBase.init;\n XDropLastWhile.prototype['@@transducer/result'] = function (result) {\n this.retained = null;\n return this.xf['@@transducer/result'](result);\n };\n XDropLastWhile.prototype['@@transducer/step'] = function (result, input) {\n return this.f(input) ? this.retain(result, input) : this.flush(result, input);\n };\n XDropLastWhile.prototype.flush = function (result, input) {\n result = _reduce(this.xf['@@transducer/step'], result, this.retained);\n this.retained = [];\n return this.xf['@@transducer/step'](result, input);\n };\n XDropLastWhile.prototype.retain = function (result, input) {\n this.retained.push(input);\n return result;\n };\n return _curry2(function _xdropLastWhile(fn, xf) {\n return new XDropLastWhile(fn, xf);\n });\n }();\n\n var _xgroupBy = function () {\n function XGroupBy(f, xf) {\n this.xf = xf;\n this.f = f;\n this.inputs = {};\n }\n XGroupBy.prototype['@@transducer/init'] = _xfBase.init;\n XGroupBy.prototype['@@transducer/result'] = function (result) {\n var key;\n for (key in this.inputs) {\n if (_has(key, this.inputs)) {\n result = this.xf['@@transducer/step'](result, this.inputs[key]);\n if (result['@@transducer/reduced']) {\n result = result['@@transducer/value'];\n break;\n }\n }\n }\n this.inputs = null;\n return this.xf['@@transducer/result'](result);\n };\n XGroupBy.prototype['@@transducer/step'] = function (result, input) {\n var key = this.f(input);\n this.inputs[key] = this.inputs[key] || [\n key,\n []\n ];\n this.inputs[key][1] = append(input, this.inputs[key][1]);\n return result;\n };\n return _curry2(function _xgroupBy(f, xf) {\n return new XGroupBy(f, xf);\n });\n }();\n\n /**\n * Creates a new list iteration function from an existing one by adding two new\n * parameters to its callback function: the current index, and the entire list.\n *\n * This would turn, for instance, Ramda's simple `map` function into one that\n * more closely resembles `Array.prototype.map`. Note that this will only work\n * for functions in which the iteration callback function is the first\n * parameter, and where the list is the last parameter. (This latter might be\n * unimportant if the list parameter is not used.)\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Function\n * @category List\n * @sig ((a ... -> b) ... -> [a] -> *) -> (a ..., Int, [a] -> b) ... -> [a] -> *)\n * @param {Function} fn A list iteration function that does not pass index or list to its callback\n * @return {Function} An altered list iteration function that passes (item, index, list) to its callback\n * @example\n *\n * var mapIndexed = R.addIndex(R.map);\n * mapIndexed((val, idx) => idx + '-' + val, ['f', 'o', 'o', 'b', 'a', 'r']);\n * //=> ['0-f', '1-o', '2-o', '3-b', '4-a', '5-r']\n */\n var addIndex = _curry1(function addIndex(fn) {\n return curryN(fn.length, function () {\n var idx = 0;\n var origFn = arguments[0];\n var list = arguments[arguments.length - 1];\n var args = _slice(arguments);\n args[0] = function () {\n var result = origFn.apply(this, _concat(arguments, [\n idx,\n list\n ]));\n idx += 1;\n return result;\n };\n return fn.apply(this, args);\n });\n });\n\n /**\n * Wraps a function of any arity (including nullary) in a function that accepts\n * exactly 2 parameters. Any extraneous parameters will not be passed to the\n * supplied function.\n *\n * @func\n * @memberOf R\n * @since v0.2.0\n * @category Function\n * @sig (* -> c) -> (a, b -> c)\n * @param {Function} fn The function to wrap.\n * @return {Function} A new function wrapping `fn`. The new function is guaranteed to be of\n * arity 2.\n * @example\n *\n * var takesThreeArgs = function(a, b, c) {\n * return [a, b, c];\n * };\n * takesThreeArgs.length; //=> 3\n * takesThreeArgs(1, 2, 3); //=> [1, 2, 3]\n *\n * var takesTwoArgs = R.binary(takesThreeArgs);\n * takesTwoArgs.length; //=> 2\n * // Only 2 arguments are passed to the wrapped function\n * takesTwoArgs(1, 2, 3); //=> [1, 2, undefined]\n */\n var binary = _curry1(function binary(fn) {\n return nAry(2, fn);\n });\n\n /**\n * Creates a deep copy of the value which may contain (nested) `Array`s and\n * `Object`s, `Number`s, `String`s, `Boolean`s and `Date`s. `Function`s are not\n * copied, but assigned by their reference.\n *\n * Dispatches to a `clone` method if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {*} -> {*}\n * @param {*} value The object or array to clone\n * @return {*} A new object or array.\n * @example\n *\n * var objects = [{}, {}, {}];\n * var objectsClone = R.clone(objects);\n * objects[0] === objectsClone[0]; //=> false\n */\n var clone = _curry1(function clone(value) {\n return value != null && typeof value.clone === 'function' ? value.clone() : _clone(value, [], [], true);\n });\n\n /**\n * Returns a curried equivalent of the provided function. The curried function\n * has two unusual capabilities. First, its arguments needn't be provided one\n * at a time. If `f` is a ternary function and `g` is `R.curry(f)`, the\n * following are equivalent:\n *\n * - `g(1)(2)(3)`\n * - `g(1)(2, 3)`\n * - `g(1, 2)(3)`\n * - `g(1, 2, 3)`\n *\n * Secondly, the special placeholder value `R.__` may be used to specify\n * \"gaps\", allowing partial application of any combination of arguments,\n * regardless of their positions. If `g` is as above and `_` is `R.__`, the\n * following are equivalent:\n *\n * - `g(1, 2, 3)`\n * - `g(_, 2, 3)(1)`\n * - `g(_, _, 3)(1)(2)`\n * - `g(_, _, 3)(1, 2)`\n * - `g(_, 2)(1)(3)`\n * - `g(_, 2)(1, 3)`\n * - `g(_, 2)(_, 3)(1)`\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> a) -> (* -> a)\n * @param {Function} fn The function to curry.\n * @return {Function} A new, curried function.\n * @see R.curryN\n * @example\n *\n * var addFourNumbers = (a, b, c, d) => a + b + c + d;\n *\n * var curriedAddFourNumbers = R.curry(addFourNumbers);\n * var f = curriedAddFourNumbers(1, 2);\n * var g = f(3);\n * g(4); //=> 10\n */\n var curry = _curry1(function curry(fn) {\n return curryN(fn.length, fn);\n });\n\n /**\n * Returns all but the first `n` elements of the given list, string, or\n * transducer/transformer (or object with a `drop` method).\n *\n * Dispatches to the `drop` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n\n * @param {*} list\n * @return {*}\n * @see R.take, R.transduce\n * @example\n *\n * R.drop(1, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n * R.drop(2, ['foo', 'bar', 'baz']); //=> ['baz']\n * R.drop(3, ['foo', 'bar', 'baz']); //=> []\n * R.drop(4, ['foo', 'bar', 'baz']); //=> []\n * R.drop(3, 'ramda'); //=> 'da'\n */\n var drop = _curry2(_dispatchable('drop', _xdrop, function drop(n, xs) {\n return slice(Math.max(0, n), Infinity, xs);\n }));\n\n /**\n * Returns a list containing all but the last `n` elements of the given `list`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements of `xs` to skip.\n * @param {Array} xs The collection to consider.\n * @return {Array}\n * @see R.takeLast\n * @example\n *\n * R.dropLast(1, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']\n * R.dropLast(2, ['foo', 'bar', 'baz']); //=> ['foo']\n * R.dropLast(3, ['foo', 'bar', 'baz']); //=> []\n * R.dropLast(4, ['foo', 'bar', 'baz']); //=> []\n * R.dropLast(3, 'ramda'); //=> 'ra'\n */\n var dropLast = _curry2(_dispatchable('dropLast', _xdropLast, _dropLast));\n\n /**\n * Returns a new list containing all but last the`n` elements of a given list,\n * passing each value from the right to the supplied predicate function,\n * skipping elements while the predicate function returns `true`. The predicate\n * function is passed one argument: (value)*.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> Boolean) -> [a] -> [a]\n * @param {Function} fn The function called per iteration.\n * @param {Array} list The collection to iterate over.\n * @return {Array} A new array.\n * @see R.takeLastWhile, R.addIndex\n * @example\n *\n * var lteThree = x => x <= 3;\n *\n * R.dropLastWhile(lteThree, [1, 2, 3, 4, 3, 2, 1]); //=> [1, 2, 3, 4]\n */\n var dropLastWhile = _curry2(_dispatchable('dropLastWhile', _xdropLastWhile, _dropLastWhile));\n\n /**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * R.equals(1, 1); //=> true\n * R.equals(1, '1'); //=> false\n * R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n * var a = {}; a.v = a;\n * var b = {}; b.v = b;\n * R.equals(a, b); //=> true\n */\n var equals = _curry2(function equals(a, b) {\n return _equals(a, b, [], []);\n });\n\n /**\n * Takes a predicate and a \"filterable\", and returns a new filterable of the\n * same type containing the members of the given filterable which satisfy the\n * given predicate.\n *\n * Dispatches to the `filter` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.reject, R.transduce, R.addIndex\n * @example\n *\n * var isEven = n => n % 2 === 0;\n *\n * R.filter(isEven, [1, 2, 3, 4]); //=> [2, 4]\n *\n * R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\n // else\n var filter = _curry2(_dispatchable('filter', _xfilter, function (pred, filterable) {\n return _isObject(filterable) ? _reduce(function (acc, key) {\n if (pred(filterable[key])) {\n acc[key] = filterable[key];\n }\n return acc;\n }, {}, keys(filterable)) : // else\n _filter(pred, filterable);\n }));\n\n /**\n * Returns a new list by pulling every item out of it (and all its sub-arrays)\n * and putting them in a new array, depth-first.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [b]\n * @param {Array} list The array to consider.\n * @return {Array} The flattened list.\n * @see R.unnest\n * @example\n *\n * R.flatten([1, 2, [3, 4], 5, [6, [7, 8, [9, [10, 11], 12]]]]);\n * //=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]\n */\n var flatten = _curry1(_makeFlat(true));\n\n /**\n * Returns a new function much like the supplied one, except that the first two\n * arguments' order is reversed.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (a -> b -> c -> ... -> z) -> (b -> a -> c -> ... -> z)\n * @param {Function} fn The function to invoke with its first two parameters reversed.\n * @return {*} The result of invoking `fn` with its first two parameters' order reversed.\n * @example\n *\n * var mergeThree = (a, b, c) => [].concat(a, b, c);\n *\n * mergeThree(1, 2, 3); //=> [1, 2, 3]\n *\n * R.flip(mergeThree)(1, 2, 3); //=> [2, 1, 3]\n */\n var flip = _curry1(function flip(fn) {\n return curry(function (a, b) {\n var args = _slice(arguments);\n args[0] = b;\n args[1] = a;\n return fn.apply(this, args);\n });\n });\n\n /**\n * Returns the first element of the given list or string. In some libraries\n * this function is named `first`.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {Array|String} list\n * @return {*}\n * @see R.tail, R.init, R.last\n * @example\n *\n * R.head(['fi', 'fo', 'fum']); //=> 'fi'\n * R.head([]); //=> undefined\n *\n * R.head('abc'); //=> 'a'\n * R.head(''); //=> ''\n */\n var head = nth(0);\n\n /**\n * Returns all but the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.last, R.head, R.tail\n * @example\n *\n * R.init([1, 2, 3]); //=> [1, 2]\n * R.init([1, 2]); //=> [1]\n * R.init([1]); //=> []\n * R.init([]); //=> []\n *\n * R.init('abc'); //=> 'ab'\n * R.init('ab'); //=> 'a'\n * R.init('a'); //=> ''\n * R.init(''); //=> ''\n */\n var init = slice(0, -1);\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of those\n * elements common to both lists. Duplication is determined according to the\n * value returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate function that determines whether\n * the two supplied elements are equal.\n * @param {Array} list1 One list of items to compare\n * @param {Array} list2 A second list of items to compare\n * @return {Array} A new list containing those elements common to both lists.\n * @see R.intersection\n * @example\n *\n * var buffaloSpringfield = [\n * {id: 824, name: 'Richie Furay'},\n * {id: 956, name: 'Dewey Martin'},\n * {id: 313, name: 'Bruce Palmer'},\n * {id: 456, name: 'Stephen Stills'},\n * {id: 177, name: 'Neil Young'}\n * ];\n * var csny = [\n * {id: 204, name: 'David Crosby'},\n * {id: 456, name: 'Stephen Stills'},\n * {id: 539, name: 'Graham Nash'},\n * {id: 177, name: 'Neil Young'}\n * ];\n *\n * R.intersectionWith(R.eqBy(R.prop('id')), buffaloSpringfield, csny);\n * //=> [{id: 456, name: 'Stephen Stills'}, {id: 177, name: 'Neil Young'}]\n */\n var intersectionWith = _curry3(function intersectionWith(pred, list1, list2) {\n var lookupList, filteredList;\n if (list1.length > list2.length) {\n lookupList = list1;\n filteredList = list2;\n } else {\n lookupList = list2;\n filteredList = list1;\n }\n var results = [];\n var idx = 0;\n while (idx < filteredList.length) {\n if (_containsWith(pred, filteredList[idx], lookupList)) {\n results[results.length] = filteredList[idx];\n }\n idx += 1;\n }\n return uniqWith(pred, results);\n });\n\n /**\n * Transforms the items of the list with the transducer and appends the\n * transformed items to the accumulator using an appropriate iterator function\n * based on the accumulator type.\n *\n * The accumulator can be an array, string, object or a transformer. Iterated\n * items will be appended to arrays and concatenated to strings. Objects will\n * be merged directly or 2-item arrays will be merged as key, value pairs.\n *\n * The accumulator can also be a transformer object that provides a 2-arity\n * reducing iterator function, step, 0-arity initial value function, init, and\n * 1-arity result extraction function result. The step function is used as the\n * iterator function in reduce. The result function is used to convert the\n * final accumulator into the return type and in most cases is R.identity. The\n * init function is used to provide the initial accumulator.\n *\n * The iteration is performed with R.reduce after initializing the transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig a -> (b -> b) -> [c] -> a\n * @param {*} acc The initial accumulator value.\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @example\n *\n * var numbers = [1, 2, 3, 4];\n * var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *\n * R.into([], transducer, numbers); //=> [2, 3]\n *\n * var intoArray = R.into([]);\n * intoArray(transducer, numbers); //=> [2, 3]\n */\n var into = _curry3(function into(acc, xf, list) {\n return _isTransformer(acc) ? _reduce(xf(acc), acc['@@transducer/init'](), list) : _reduce(xf(_stepCat(acc)), _clone(acc, [], [], false), list);\n });\n\n /**\n * Same as R.invertObj, however this accounts for objects with duplicate values\n * by putting the values into an array.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: [ s, ... ]}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object with keys\n * in an array.\n * @example\n *\n * var raceResultsByFirstName = {\n * first: 'alice',\n * second: 'jake',\n * third: 'alice',\n * };\n * R.invert(raceResultsByFirstName);\n * //=> { 'alice': ['first', 'third'], 'jake':['second'] }\n */\n var invert = _curry1(function invert(obj) {\n var props = keys(obj);\n var len = props.length;\n var idx = 0;\n var out = {};\n while (idx < len) {\n var key = props[idx];\n var val = obj[key];\n var list = _has(val, out) ? out[val] : out[val] = [];\n list[list.length] = key;\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a new object with the keys of the given object as values, and the\n * values of the given object, which are coerced to strings, as keys. Note\n * that the last key found is preferred when handling the same value.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig {s: x} -> {x: s}\n * @param {Object} obj The object or array to invert\n * @return {Object} out A new object\n * @example\n *\n * var raceResults = {\n * first: 'alice',\n * second: 'jake'\n * };\n * R.invertObj(raceResults);\n * //=> { 'alice': 'first', 'jake':'second' }\n *\n * // Alternatively:\n * var raceResults = ['alice', 'jake'];\n * R.invertObj(raceResults);\n * //=> { 'alice': '0', 'jake':'1' }\n */\n var invertObj = _curry1(function invertObj(obj) {\n var props = keys(obj);\n var len = props.length;\n var idx = 0;\n var out = {};\n while (idx < len) {\n var key = props[idx];\n out[obj[key]] = key;\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns `true` if the given value is its type's empty value; `false`\n * otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Logic\n * @sig a -> Boolean\n * @param {*} x\n * @return {Boolean}\n * @see R.empty\n * @example\n *\n * R.isEmpty([1, 2, 3]); //=> false\n * R.isEmpty([]); //=> true\n * R.isEmpty(''); //=> true\n * R.isEmpty(null); //=> false\n * R.isEmpty({}); //=> true\n * R.isEmpty({length: 0}); //=> false\n */\n var isEmpty = _curry1(function isEmpty(x) {\n return x != null && equals(x, empty(x));\n });\n\n /**\n * Returns the last element of the given list or string.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig [a] -> a | Undefined\n * @sig String -> String\n * @param {*} list\n * @return {*}\n * @see R.init, R.head, R.tail\n * @example\n *\n * R.last(['fi', 'fo', 'fum']); //=> 'fum'\n * R.last([]); //=> undefined\n *\n * R.last('abc'); //=> 'c'\n * R.last(''); //=> ''\n */\n var last = nth(-1);\n\n /**\n * Returns the position of the last occurrence of an item in an array, or -1 if\n * the item is not included in the array. `R.equals` is used to determine\n * equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.indexOf\n * @example\n *\n * R.lastIndexOf(3, [-1,3,3,0,1,2,3,4]); //=> 6\n * R.lastIndexOf(10, [1,2,3,4]); //=> -1\n */\n var lastIndexOf = _curry2(function lastIndexOf(target, xs) {\n if (typeof xs.lastIndexOf === 'function' && !_isArray(xs)) {\n return xs.lastIndexOf(target);\n } else {\n var idx = xs.length - 1;\n while (idx >= 0) {\n if (equals(xs[idx], target)) {\n return idx;\n }\n idx -= 1;\n }\n return -1;\n }\n });\n\n /**\n * Takes a function and\n * a [functor](https://github.com/fantasyland/fantasy-land#functor),\n * applies the function to each of the functor's values, and returns\n * a functor of the same shape.\n *\n * Ramda provides suitable `map` implementations for `Array` and `Object`,\n * so this function may be applied to `[1, 2, 3]` or `{x: 1, y: 2, z: 3}`.\n *\n * Dispatches to the `map` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * Also treats functions as functors and will compose them together.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Functor f => (a -> b) -> f a -> f b\n * @param {Function} fn The function to be called on every element of the input `list`.\n * @param {Array} list The list to be iterated over.\n * @return {Array} The new list.\n * @see R.transduce, R.addIndex\n * @example\n *\n * var double = x => x * 2;\n *\n * R.map(double, [1, 2, 3]); //=> [2, 4, 6]\n *\n * R.map(double, {x: 1, y: 2, z: 3}); //=> {x: 2, y: 4, z: 6}\n */\n var map = _curry2(_dispatchable('map', _xmap, function map(fn, functor) {\n switch (Object.prototype.toString.call(functor)) {\n case '[object Function]':\n return curryN(functor.length, function () {\n return fn.call(this, functor.apply(this, arguments));\n });\n case '[object Object]':\n return _reduce(function (acc, key) {\n acc[key] = fn(functor[key]);\n return acc;\n }, {}, keys(functor));\n default:\n return _map(fn, functor);\n }\n }));\n\n /**\n * An Object-specific version of `map`. The function is applied to three\n * arguments: *(value, key, obj)*. If only the value is significant, use\n * `map` instead.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Object\n * @sig ((*, String, Object) -> *) -> Object -> Object\n * @param {Function} fn\n * @param {Object} obj\n * @return {Object}\n * @see R.map\n * @example\n *\n * var values = { x: 1, y: 2, z: 3 };\n * var prependKeyAndDouble = (num, key, obj) => key + (num * 2);\n *\n * R.mapObjIndexed(prependKeyAndDouble, values); //=> { x: 'x2', y: 'y4', z: 'z6' }\n */\n var mapObjIndexed = _curry2(function mapObjIndexed(fn, obj) {\n return _reduce(function (acc, key) {\n acc[key] = fn(obj[key], key, obj);\n return acc;\n }, {}, keys(obj));\n });\n\n /**\n * Creates a new object with the own properties of the two provided objects. If\n * a key exists in both objects, the provided function is applied to the values\n * associated with the key in each object, with the result being used as the\n * value associated with the key in the returned object. The key will be\n * excluded from the returned object if the resulting value is `undefined`.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @sig (a -> a -> a) -> {a} -> {a} -> {a}\n * @param {Function} fn\n * @param {Object} l\n * @param {Object} r\n * @return {Object}\n * @see R.merge, R.mergeWithKey\n * @example\n *\n * R.mergeWith(R.concat,\n * { a: true, values: [10, 20] },\n * { b: true, values: [15, 35] });\n * //=> { a: true, b: true, values: [10, 20, 15, 35] }\n */\n var mergeWith = _curry3(function mergeWith(fn, l, r) {\n return mergeWithKey(function (_, _l, _r) {\n return fn(_l, _r);\n }, l, r);\n });\n\n /**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided initially followed by the arguments provided to `g`.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [a, b, c, ...] -> ((d, e, f, ..., n) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partialRight\n * @example\n *\n * var multiply = (a, b) => a * b;\n * var double = R.partial(multiply, [2]);\n * double(2); //=> 4\n *\n * var greet = (salutation, title, firstName, lastName) =>\n * salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n * var sayHello = R.partial(greet, ['Hello']);\n * var sayHelloToMs = R.partial(sayHello, ['Ms.']);\n * sayHelloToMs('Jane', 'Jones'); //=> 'Hello, Ms. Jane Jones!'\n */\n var partial = _createPartialApplicator(_concat);\n\n /**\n * Takes a function `f` and a list of arguments, and returns a function `g`.\n * When applied, `g` returns the result of applying `f` to the arguments\n * provided to `g` followed by the arguments provided initially.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a, b, c, ..., n) -> x) -> [d, e, f, ..., n] -> ((a, b, c, ...) -> x)\n * @param {Function} f\n * @param {Array} args\n * @return {Function}\n * @see R.partial\n * @example\n *\n * var greet = (salutation, title, firstName, lastName) =>\n * salutation + ', ' + title + ' ' + firstName + ' ' + lastName + '!';\n *\n * var greetMsJaneJones = R.partialRight(greet, ['Ms.', 'Jane', 'Jones']);\n *\n * greetMsJaneJones('Hello'); //=> 'Hello, Ms. Jane Jones!'\n */\n var partialRight = _createPartialApplicator(flip(_concat));\n\n /**\n * Determines whether a nested path on an object has a specific value, in\n * `R.equals` terms. Most likely used to filter a list.\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Relation\n * @sig [String] -> * -> {String: *} -> Boolean\n * @param {Array} path The path of the nested property to use\n * @param {*} val The value to compare the nested property with\n * @param {Object} obj The object to check the nested property in\n * @return {Boolean} `true` if the value equals the nested object property,\n * `false` otherwise.\n * @example\n *\n * var user1 = { address: { zipCode: 90210 } };\n * var user2 = { address: { zipCode: 55555 } };\n * var user3 = { name: 'Bob' };\n * var users = [ user1, user2, user3 ];\n * var isFamous = R.pathEq(['address', 'zipCode'], 90210);\n * R.filter(isFamous, users); //=> [ user1 ]\n */\n var pathEq = _curry3(function pathEq(_path, val, obj) {\n return equals(path(_path, obj), val);\n });\n\n /**\n * Returns a new list by plucking the same named property off all objects in\n * the list supplied.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig k -> [{k: v}] -> [v]\n * @param {Number|String} key The key name to pluck off of each object.\n * @param {Array} list The array to consider.\n * @return {Array} The list of values for the given key.\n * @see R.props\n * @example\n *\n * R.pluck('a')([{a: 1}, {a: 2}]); //=> [1, 2]\n * R.pluck(0)([[1, 2], [3, 4]]); //=> [1, 3]\n */\n var pluck = _curry2(function pluck(p, list) {\n return map(prop(p), list);\n });\n\n /**\n * Reasonable analog to SQL `select` statement.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @category Relation\n * @sig [k] -> [{k: v}] -> [{k: v}]\n * @param {Array} props The property names to project\n * @param {Array} objs The objects to query\n * @return {Array} An array of objects with just the `props` properties.\n * @example\n *\n * var abby = {name: 'Abby', age: 7, hair: 'blond', grade: 2};\n * var fred = {name: 'Fred', age: 12, hair: 'brown', grade: 7};\n * var kids = [abby, fred];\n * R.project(['name', 'grade'], kids); //=> [{name: 'Abby', grade: 2}, {name: 'Fred', grade: 7}]\n */\n // passing `identity` gives correct arity\n var project = useWith(_map, [\n pickAll,\n identity\n ]);\n\n /**\n * Returns `true` if the specified object property is equal, in `R.equals`\n * terms, to the given value; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig String -> a -> Object -> Boolean\n * @param {String} name\n * @param {*} val\n * @param {*} obj\n * @return {Boolean}\n * @see R.equals, R.propSatisfies\n * @example\n *\n * var abby = {name: 'Abby', age: 7, hair: 'blond'};\n * var fred = {name: 'Fred', age: 12, hair: 'brown'};\n * var rusty = {name: 'Rusty', age: 10, hair: 'brown'};\n * var alois = {name: 'Alois', age: 15, disposition: 'surly'};\n * var kids = [abby, fred, rusty, alois];\n * var hasBrownHair = R.propEq('hair', 'brown');\n * R.filter(hasBrownHair, kids); //=> [fred, rusty]\n */\n var propEq = _curry3(function propEq(name, val, obj) {\n return propSatisfies(equals(val), name, obj);\n });\n\n /**\n * Returns `true` if the specified object property is of the given type;\n * `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Type\n * @sig Type -> String -> Object -> Boolean\n * @param {Function} type\n * @param {String} name\n * @param {*} obj\n * @return {Boolean}\n * @see R.is, R.propSatisfies\n * @example\n *\n * R.propIs(Number, 'x', {x: 1, y: 2}); //=> true\n * R.propIs(Number, 'x', {x: 'foo'}); //=> false\n * R.propIs(Number, 'x', {}); //=> false\n */\n var propIs = _curry3(function propIs(type, name, obj) {\n return propSatisfies(is(type), name, obj);\n });\n\n /**\n * Returns a single item by iterating through the list, successively calling\n * the iterator function and passing it an accumulator value and the current\n * value from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It may use\n * `R.reduced` to shortcut the iteration.\n *\n * Note: `R.reduce` does not skip deleted or unassigned indices (sparse\n * arrays), unlike the native `Array.prototype.reduce` method. For more details\n * on this behavior, see:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce#Description\n *\n * Dispatches to the `reduce` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig ((a, b) -> a) -> a -> [b] -> a\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array.\n * @param {*} acc The accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduced, R.addIndex\n * @example\n *\n * var numbers = [1, 2, 3];\n * var add = (a, b) => a + b;\n *\n * R.reduce(add, 10, numbers); //=> 16\n */\n var reduce = _curry3(_reduce);\n\n /**\n * Groups the elements of the list according to the result of calling\n * the String-returning function `keyFn` on each element and reduces the elements\n * of each group to a single value via the reducer function `valueFn`.\n *\n * This function is basically a more general `groupBy` function.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category List\n * @sig ((a, b) -> a) -> a -> (b -> String) -> [b] -> {String: a}\n * @param {Function} valueFn The function that reduces the elements of each group to a single\n * value. Receives two values, accumulator for a particular group and the current element.\n * @param {*} acc The (initial) accumulator value for each group.\n * @param {Function} keyFn The function that maps the list's element into a key.\n * @param {Array} list The array to group.\n * @return {Object} An object with the output of `keyFn` for keys, mapped to the output of\n * `valueFn` for elements which produced that key when passed to `keyFn`.\n * @see R.groupBy, R.reduce\n * @example\n *\n * var reduceToNamesBy = R.reduceBy((acc, student) => acc.concat(student.name), []);\n * var namesByGrade = reduceToNamesBy(function(student) {\n * var score = student.score;\n * return score < 65 ? 'F' :\n * score < 70 ? 'D' :\n * score < 80 ? 'C' :\n * score < 90 ? 'B' : 'A';\n * });\n * var students = [{name: 'Lucy', score: 92},\n * {name: 'Drew', score: 85},\n * // ...\n * {name: 'Bart', score: 62}];\n * namesByGrade(students);\n * // {\n * // 'A': ['Lucy'],\n * // 'B': ['Drew']\n * // // ...,\n * // 'F': ['Bart']\n * // }\n */\n var reduceBy = _curryN(4, [], function reduceBy(valueFn, valueAcc, keyFn, list) {\n return _reduce(function (acc, elt) {\n var key = keyFn(elt);\n acc[key] = valueFn(_has(key, acc) ? acc[key] : valueAcc, elt);\n return acc;\n }, {}, list);\n });\n\n /**\n * The complement of `filter`.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> f a\n * @param {Function} pred\n * @param {Array} filterable\n * @return {Array}\n * @see R.filter, R.transduce, R.addIndex\n * @example\n *\n * var isOdd = (n) => n % 2 === 1;\n *\n * R.reject(isOdd, [1, 2, 3, 4]); //=> [2, 4]\n *\n * R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}\n */\n var reject = _curry2(function reject(pred, filterable) {\n return filter(_complement(pred), filterable);\n });\n\n /**\n * Returns a fixed list of size `n` containing a specified identical value.\n *\n * @func\n * @memberOf R\n * @since v0.1.1\n * @category List\n * @sig a -> n -> [a]\n * @param {*} value The value to repeat.\n * @param {Number} n The desired size of the output list.\n * @return {Array} A new array containing `n` `value`s.\n * @example\n *\n * R.repeat('hi', 5); //=> ['hi', 'hi', 'hi', 'hi', 'hi']\n *\n * var obj = {};\n * var repeatedObjs = R.repeat(obj, 5); //=> [{}, {}, {}, {}, {}]\n * repeatedObjs[0] === repeatedObjs[1]; //=> true\n */\n var repeat = _curry2(function repeat(value, n) {\n return times(always(value), n);\n });\n\n /**\n * Adds together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The sum of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n * R.sum([2,4,6,8,100,1]); //=> 121\n */\n var sum = reduce(add, 0);\n\n /**\n * Returns a new list containing the last `n` elements of the given list.\n * If `n > list.length`, returns a list of `list.length` elements.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig Number -> [a] -> [a]\n * @sig Number -> String -> String\n * @param {Number} n The number of elements to return.\n * @param {Array} xs The collection to consider.\n * @return {Array}\n * @see R.dropLast\n * @example\n *\n * R.takeLast(1, ['foo', 'bar', 'baz']); //=> ['baz']\n * R.takeLast(2, ['foo', 'bar', 'baz']); //=> ['bar', 'baz']\n * R.takeLast(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.takeLast(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']\n * R.takeLast(3, 'ramda'); //=> 'mda'\n */\n var takeLast = _curry2(function takeLast(n, xs) {\n return drop(n >= 0 ? xs.length - n : 0, xs);\n });\n\n /**\n * Initializes a transducer using supplied iterator function. Returns a single\n * item by iterating through the list, successively calling the transformed\n * iterator function and passing it an accumulator value and the current value\n * from the array, and then passing the result to the next call.\n *\n * The iterator function receives two values: *(acc, value)*. It will be\n * wrapped as a transformer to initialize the transducer. A transformer can be\n * passed directly in place of an iterator function. In both cases, iteration\n * may be stopped early with the `R.reduced` function.\n *\n * A transducer is a function that accepts a transformer and returns a\n * transformer and can be composed directly.\n *\n * A transformer is an an object that provides a 2-arity reducing iterator\n * function, step, 0-arity initial value function, init, and 1-arity result\n * extraction function, result. The step function is used as the iterator\n * function in reduce. The result function is used to convert the final\n * accumulator into the return type and in most cases is R.identity. The init\n * function can be used to provide an initial accumulator, but is ignored by\n * transduce.\n *\n * The iteration is performed with R.reduce after initializing the transducer.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category List\n * @sig (c -> c) -> (a,b -> a) -> a -> [b] -> a\n * @param {Function} xf The transducer function. Receives a transformer and returns a transformer.\n * @param {Function} fn The iterator function. Receives two values, the accumulator and the\n * current element from the array. Wrapped as transformer, if necessary, and used to\n * initialize the transducer\n * @param {*} acc The initial accumulator value.\n * @param {Array} list The list to iterate over.\n * @return {*} The final, accumulated value.\n * @see R.reduce, R.reduced, R.into\n * @example\n *\n * var numbers = [1, 2, 3, 4];\n * var transducer = R.compose(R.map(R.add(1)), R.take(2));\n *\n * R.transduce(transducer, R.flip(R.append), [], numbers); //=> [2, 3]\n */\n var transduce = curryN(4, function transduce(xf, fn, acc, list) {\n return _reduce(xf(typeof fn === 'function' ? _xwrap(fn) : fn), acc, list);\n });\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list. Duplication is determined according to the value returned by\n * applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [*] -> [*] -> [*]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The first and second lists concatenated, with\n * duplicates removed.\n * @see R.union\n * @example\n *\n * var l1 = [{a: 1}, {a: 2}];\n * var l2 = [{a: 1}, {a: 4}];\n * R.unionWith(R.eqBy(R.prop('a')), l1, l2); //=> [{a: 1}, {a: 2}, {a: 4}]\n */\n var unionWith = _curry3(function unionWith(pred, list1, list2) {\n return uniqWith(pred, _concat(list1, list2));\n });\n\n /**\n * Takes a spec object and a test object; returns true if the test satisfies\n * the spec, false otherwise. An object satisfies the spec if, for each of the\n * spec's own properties, accessing that property of the object gives the same\n * value (in `R.equals` terms) as accessing that property of the spec.\n *\n * `whereEq` is a specialization of [`where`](#where).\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @sig {String: *} -> {String: *} -> Boolean\n * @param {Object} spec\n * @param {Object} testObj\n * @return {Boolean}\n * @see R.where\n * @example\n *\n * // pred :: Object -> Boolean\n * var pred = R.whereEq({a: 1, b: 2});\n *\n * pred({a: 1}); //=> false\n * pred({a: 1, b: 2}); //=> true\n * pred({a: 1, b: 2, c: 3}); //=> true\n * pred({a: 1, b: 1}); //=> false\n */\n var whereEq = _curry2(function whereEq(spec, testObj) {\n return where(map(equals, spec), testObj);\n });\n\n var _flatCat = function () {\n var preservingReduced = function (xf) {\n return {\n '@@transducer/init': _xfBase.init,\n '@@transducer/result': function (result) {\n return xf['@@transducer/result'](result);\n },\n '@@transducer/step': function (result, input) {\n var ret = xf['@@transducer/step'](result, input);\n return ret['@@transducer/reduced'] ? _forceReduced(ret) : ret;\n }\n };\n };\n return function _xcat(xf) {\n var rxf = preservingReduced(xf);\n return {\n '@@transducer/init': _xfBase.init,\n '@@transducer/result': function (result) {\n return rxf['@@transducer/result'](result);\n },\n '@@transducer/step': function (result, input) {\n return !isArrayLike(input) ? _reduce(rxf, result, [input]) : _reduce(rxf, result, input);\n }\n };\n };\n }();\n\n // Array.prototype.indexOf doesn't exist below IE9\n // manually crawl the list to distinguish between +0 and -0\n // NaN\n // non-zero numbers can utilise Set\n // all these types can utilise Set\n // null can utilise Set\n // anything else not covered above, defer to R.equals\n var _indexOf = function _indexOf(list, a, idx) {\n var inf, item;\n // Array.prototype.indexOf doesn't exist below IE9\n if (typeof list.indexOf === 'function') {\n switch (typeof a) {\n case 'number':\n if (a === 0) {\n // manually crawl the list to distinguish between +0 and -0\n inf = 1 / a;\n while (idx < list.length) {\n item = list[idx];\n if (item === 0 && 1 / item === inf) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n } else if (a !== a) {\n // NaN\n while (idx < list.length) {\n item = list[idx];\n if (typeof item === 'number' && item !== item) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n }\n // non-zero numbers can utilise Set\n return list.indexOf(a, idx);\n // all these types can utilise Set\n case 'string':\n case 'boolean':\n case 'function':\n case 'undefined':\n return list.indexOf(a, idx);\n case 'object':\n if (a === null) {\n // null can utilise Set\n return list.indexOf(a, idx);\n }\n }\n }\n // anything else not covered above, defer to R.equals\n while (idx < list.length) {\n if (equals(list[idx], a)) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n };\n\n var _xchain = _curry2(function _xchain(f, xf) {\n return map(f, _flatCat(xf));\n });\n\n /**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if every one of the provided predicates is satisfied\n * by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} preds\n * @return {Function}\n * @see R.anyPass\n * @example\n *\n * var isQueen = R.propEq('rank', 'Q');\n * var isSpade = R.propEq('suit', '♠︎');\n * var isQueenOfSpades = R.allPass([isQueen, isSpade]);\n *\n * isQueenOfSpades({rank: 'Q', suit: '♣︎'}); //=> false\n * isQueenOfSpades({rank: 'Q', suit: '♠︎'}); //=> true\n */\n var allPass = _curry1(function allPass(preds) {\n return curryN(reduce(max, 0, pluck('length', preds)), function () {\n var idx = 0;\n var len = preds.length;\n while (idx < len) {\n if (!preds[idx].apply(this, arguments)) {\n return false;\n }\n idx += 1;\n }\n return true;\n });\n });\n\n /**\n * Returns `true` if all elements are unique, in `R.equals` terms, otherwise\n * `false`.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category List\n * @sig [a] -> Boolean\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if all elements are unique, else `false`.\n * @deprecated since v0.20.0\n * @example\n *\n * R.allUniq(['1', 1]); //=> true\n * R.allUniq([1, 1]); //=> false\n * R.allUniq([[42], [42]]); //=> false\n */\n var allUniq = _curry1(function allUniq(list) {\n var len = list.length;\n var idx = 0;\n while (idx < len) {\n if (_indexOf(list, list[idx], idx + 1) >= 0) {\n return false;\n }\n idx += 1;\n }\n return true;\n });\n\n /**\n * Takes a list of predicates and returns a predicate that returns true for a\n * given list of arguments if at least one of the provided predicates is\n * satisfied by those arguments.\n *\n * The function returned is a curried function whose arity matches that of the\n * highest-arity predicate.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Logic\n * @sig [(*... -> Boolean)] -> (*... -> Boolean)\n * @param {Array} preds\n * @return {Function}\n * @see R.allPass\n * @example\n *\n * var gte = R.anyPass([R.gt, R.equals]);\n *\n * gte(3, 2); //=> true\n * gte(2, 2); //=> true\n * gte(2, 3); //=> false\n */\n var anyPass = _curry1(function anyPass(preds) {\n return curryN(reduce(max, 0, pluck('length', preds)), function () {\n var idx = 0;\n var len = preds.length;\n while (idx < len) {\n if (preds[idx].apply(this, arguments)) {\n return true;\n }\n idx += 1;\n }\n return false;\n });\n });\n\n /**\n * ap applies a list of functions to a list of values.\n *\n * Dispatches to the `ap` method of the second argument, if present. Also\n * treats functions as applicatives.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category Function\n * @sig [f] -> [a] -> [f a]\n * @param {Array} fns An array of functions\n * @param {Array} vs An array of values\n * @return {Array} An array of results of applying each of `fns` to all of `vs` in turn.\n * @example\n *\n * R.ap([R.multiply(2), R.add(3)], [1,2,3]); //=> [2, 4, 6, 4, 5, 6]\n */\n // else\n var ap = _curry2(function ap(applicative, fn) {\n return typeof applicative.ap === 'function' ? applicative.ap(fn) : typeof applicative === 'function' ? curryN(Math.max(applicative.length, fn.length), function () {\n return applicative.apply(this, arguments)(fn.apply(this, arguments));\n }) : // else\n _reduce(function (acc, f) {\n return _concat(acc, map(f, fn));\n }, [], applicative);\n });\n\n /**\n * Given a spec object recursively mapping properties to functions, creates a\n * function producing an object of the same structure, by mapping each property\n * to the result of calling its associated function with the supplied arguments.\n *\n * @func\n * @memberOf R\n * @since v0.20.0\n * @category Function\n * @sig {k: ((a, b, ..., m) -> v)} -> ((a, b, ..., m) -> {k: v})\n * @param {Object} spec an object recursively mapping properties to functions for\n * producing the values for these properties.\n * @return {Function} A function that returns an object of the same structure\n * as `spec', with each property set to the value returned by calling its\n * associated function with the supplied arguments.\n * @see R.juxt\n * @example\n *\n * var getMetrics = R.applySpec({\n * sum: R.add,\n * nested: { mul: R.multiply }\n * });\n * getMetrics(2, 4); // => { sum: 6, nested: { mul: 8 } }\n */\n var applySpec = _curry1(function applySpec(spec) {\n spec = map(function (v) {\n return typeof v == 'function' ? v : applySpec(v);\n }, spec);\n return curryN(reduce(max, 0, pluck('length', values(spec))), function () {\n var args = arguments;\n return map(function (f) {\n return apply(f, args);\n }, spec);\n });\n });\n\n /**\n * Returns the result of calling its first argument with the remaining\n * arguments. This is occasionally useful as a converging function for\n * `R.converge`: the left branch can produce a function while the right branch\n * produces a value to be passed to that function as an argument.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category Function\n * @sig (*... -> a),*... -> a\n * @param {Function} fn The function to apply to the remaining arguments.\n * @param {...*} args Any number of positional arguments.\n * @return {*}\n * @see R.apply\n * @example\n *\n * var indentN = R.pipe(R.times(R.always(' ')),\n * R.join(''),\n * R.replace(/^(?!$)/gm));\n *\n * var format = R.converge(R.call, [\n * R.pipe(R.prop('indent'), indentN),\n * R.prop('value')\n * ]);\n *\n * format({indent: 2, value: 'foo\\nbar\\nbaz\\n'}); //=> ' foo\\n bar\\n baz\\n'\n */\n var call = curry(function call(fn) {\n return fn.apply(this, _slice(arguments, 1));\n });\n\n /**\n * `chain` maps a function over a list and concatenates the results. `chain`\n * is also known as `flatMap` in some libraries\n *\n * Dispatches to the `chain` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig (a -> [b]) -> [a] -> [b]\n * @param {Function} fn\n * @param {Array} list\n * @return {Array}\n * @example\n *\n * var duplicate = n => [n, n];\n * R.chain(duplicate, [1, 2, 3]); //=> [1, 1, 2, 2, 3, 3]\n */\n var chain = _curry2(_dispatchable('chain', _xchain, function chain(fn, monad) {\n if (typeof monad === 'function') {\n return function () {\n return monad.call(this, fn.apply(this, arguments)).apply(this, arguments);\n };\n }\n return _makeFlat(false)(map(fn, monad));\n }));\n\n /**\n * Returns a function, `fn`, which encapsulates if/else-if/else logic.\n * `R.cond` takes a list of [predicate, transform] pairs. All of the arguments\n * to `fn` are applied to each of the predicates in turn until one returns a\n * \"truthy\" value, at which point `fn` returns the result of applying its\n * arguments to the corresponding transformer. If none of the predicates\n * matches, `fn` returns undefined.\n *\n * @func\n * @memberOf R\n * @since v0.6.0\n * @category Logic\n * @sig [[(*... -> Boolean),(*... -> *)]] -> (*... -> *)\n * @param {Array} pairs\n * @return {Function}\n * @example\n *\n * var fn = R.cond([\n * [R.equals(0), R.always('water freezes at 0°C')],\n * [R.equals(100), R.always('water boils at 100°C')],\n * [R.T, temp => 'nothing special happens at ' + temp + '°C']\n * ]);\n * fn(0); //=> 'water freezes at 0°C'\n * fn(50); //=> 'nothing special happens at 50°C'\n * fn(100); //=> 'water boils at 100°C'\n */\n var cond = _curry1(function cond(pairs) {\n var arity = reduce(max, 0, map(function (pair) {\n return pair[0].length;\n }, pairs));\n return _arity(arity, function () {\n var idx = 0;\n while (idx < pairs.length) {\n if (pairs[idx][0].apply(this, arguments)) {\n return pairs[idx][1].apply(this, arguments);\n }\n idx += 1;\n }\n });\n });\n\n /**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type. The arity of the function\n * returned is specified to allow using variadic constructor functions.\n *\n * @func\n * @memberOf R\n * @since v0.4.0\n * @category Function\n * @sig Number -> (* -> {*}) -> (* -> {*})\n * @param {Number} n The arity of the constructor function.\n * @param {Function} Fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @example\n *\n * // Variadic constructor function\n * var Widget = () => {\n * this.children = Array.prototype.slice.call(arguments);\n * // ...\n * };\n * Widget.prototype = {\n * // ...\n * };\n * var allConfigs = [\n * // ...\n * ];\n * R.map(R.constructN(1, Widget), allConfigs); // a list of Widgets\n */\n var constructN = _curry2(function constructN(n, Fn) {\n if (n > 10) {\n throw new Error('Constructor with greater than ten arguments');\n }\n if (n === 0) {\n return function () {\n return new Fn();\n };\n }\n return curry(nAry(n, function ($0, $1, $2, $3, $4, $5, $6, $7, $8, $9) {\n switch (arguments.length) {\n case 1:\n return new Fn($0);\n case 2:\n return new Fn($0, $1);\n case 3:\n return new Fn($0, $1, $2);\n case 4:\n return new Fn($0, $1, $2, $3);\n case 5:\n return new Fn($0, $1, $2, $3, $4);\n case 6:\n return new Fn($0, $1, $2, $3, $4, $5);\n case 7:\n return new Fn($0, $1, $2, $3, $4, $5, $6);\n case 8:\n return new Fn($0, $1, $2, $3, $4, $5, $6, $7);\n case 9:\n return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8);\n case 10:\n return new Fn($0, $1, $2, $3, $4, $5, $6, $7, $8, $9);\n }\n }));\n });\n\n /**\n * Accepts a converging function and a list of branching functions and returns\n * a new function. When invoked, this new function is applied to some\n * arguments, each branching function is applied to those same arguments. The\n * results of each branching function are passed as arguments to the converging\n * function to produce the return value.\n *\n * @func\n * @memberOf R\n * @since v0.4.2\n * @category Function\n * @sig (x1 -> x2 -> ... -> z) -> [(a -> b -> ... -> x1), (a -> b -> ... -> x2), ...] -> (a -> b -> ... -> z)\n * @param {Function} after A function. `after` will be invoked with the return values of\n * `fn1` and `fn2` as its arguments.\n * @param {Array} functions A list of functions.\n * @return {Function} A new function.\n * @example\n *\n * var add = (a, b) => a + b;\n * var multiply = (a, b) => a * b;\n * var subtract = (a, b) => a - b;\n *\n * //≅ multiply( add(1, 2), subtract(1, 2) );\n * R.converge(multiply, [add, subtract])(1, 2); //=> -3\n *\n * var add3 = (a, b, c) => a + b + c;\n * R.converge(add3, [multiply, add, subtract])(1, 2); //=> 4\n */\n var converge = _curry2(function converge(after, fns) {\n return curryN(reduce(max, 0, pluck('length', fns)), function () {\n var args = arguments;\n var context = this;\n return after.apply(context, _map(function (fn) {\n return fn.apply(context, args);\n }, fns));\n });\n });\n\n /**\n * Counts the elements of a list according to how many match each value of a\n * key generated by the supplied function. Returns an object mapping the keys\n * produced by `fn` to the number of occurrences in the list. Note that all\n * keys are coerced to strings because of how JavaScript objects work.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig (a -> String) -> [a] -> {*}\n * @param {Function} fn The function used to map values to keys.\n * @param {Array} list The list to count elements from.\n * @return {Object} An object mapping keys to number of occurrences in the list.\n * @example\n *\n * var numbers = [1.0, 1.1, 1.2, 2.0, 3.0, 2.2];\n * var letters = R.split('', 'abcABCaaaBBc');\n * R.countBy(Math.floor)(numbers); //=> {'1': 3, '2': 2, '3': 1}\n * R.countBy(R.toLower)(letters); //=> {'a': 5, 'b': 4, 'c': 3}\n */\n var countBy = reduceBy(function (acc, elem) {\n return acc + 1;\n }, 0);\n\n /**\n * Returns a new list without any consecutively repeating elements. Equality is\n * determined by applying the supplied predicate two consecutive elements. The\n * first element in a series of equal element is the one being preserved.\n *\n * Dispatches to the `dropRepeatsWith` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig (a, a -> Boolean) -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n * var l = [1, -1, 1, 3, 4, -4, -4, -5, 5, 3, 3];\n * R.dropRepeatsWith(R.eqBy(Math.abs), l); //=> [1, 3, 4, -5, 3]\n */\n var dropRepeatsWith = _curry2(_dispatchable('dropRepeatsWith', _xdropRepeatsWith, function dropRepeatsWith(pred, list) {\n var result = [];\n var idx = 1;\n var len = list.length;\n if (len !== 0) {\n result[0] = list[0];\n while (idx < len) {\n if (!pred(last(result), list[idx])) {\n result[result.length] = list[idx];\n }\n idx += 1;\n }\n }\n return result;\n }));\n\n /**\n * Takes a function and two values in its domain and returns `true` if the\n * values map to the same value in the codomain; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.18.0\n * @category Relation\n * @sig (a -> b) -> a -> a -> Boolean\n * @param {Function} f\n * @param {*} x\n * @param {*} y\n * @return {Boolean}\n * @example\n *\n * R.eqBy(Math.abs, 5, -5); //=> true\n */\n var eqBy = _curry3(function eqBy(f, x, y) {\n return equals(f(x), f(y));\n });\n\n /**\n * Reports whether two objects have the same value, in `R.equals` terms, for\n * the specified property. Useful as a curried predicate.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig k -> {k: v} -> {k: v} -> Boolean\n * @param {String} prop The name of the property to compare\n * @param {Object} obj1\n * @param {Object} obj2\n * @return {Boolean}\n *\n * @example\n *\n * var o1 = { a: 1, b: 2, c: 3, d: 4 };\n * var o2 = { a: 10, b: 20, c: 3, d: 40 };\n * R.eqProps('a', o1, o2); //=> false\n * R.eqProps('c', o1, o2); //=> true\n */\n var eqProps = _curry3(function eqProps(prop, obj1, obj2) {\n return equals(obj1[prop], obj2[prop]);\n });\n\n /**\n * Splits a list into sub-lists stored in an object, based on the result of\n * calling a String-returning function on each element, and grouping the\n * results according to values returned.\n *\n * Dispatches to the `groupBy` method of the second argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig (a -> String) -> [a] -> {String: [a]}\n * @param {Function} fn Function :: a -> String\n * @param {Array} list The array to group\n * @return {Object} An object with the output of `fn` for keys, mapped to arrays of elements\n * that produced that key when passed to `fn`.\n * @see R.transduce\n * @example\n *\n * var byGrade = R.groupBy(function(student) {\n * var score = student.score;\n * return score < 65 ? 'F' :\n * score < 70 ? 'D' :\n * score < 80 ? 'C' :\n * score < 90 ? 'B' : 'A';\n * });\n * var students = [{name: 'Abby', score: 84},\n * {name: 'Eddy', score: 58},\n * // ...\n * {name: 'Jack', score: 69}];\n * byGrade(students);\n * // {\n * // 'A': [{name: 'Dianne', score: 99}],\n * // 'B': [{name: 'Abby', score: 84}]\n * // // ...,\n * // 'F': [{name: 'Eddy', score: 58}]\n * // }\n */\n var groupBy = _curry2(_dispatchable('groupBy', _xgroupBy, reduceBy(function (acc, item) {\n if (acc == null) {\n acc = [];\n }\n acc.push(item);\n return acc;\n }, null)));\n\n /**\n * Given a function that generates a key, turns a list of objects into an\n * object indexing the objects by the given key. Note that if multiple\n * objects generate the same value for the indexing key only the last value\n * will be included in the generated object.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (a -> String) -> [{k: v}] -> {k: {k: v}}\n * @param {Function} fn Function :: a -> String\n * @param {Array} array The array of objects to index\n * @return {Object} An object indexing each array element by the given property.\n * @example\n *\n * var list = [{id: 'xyz', title: 'A'}, {id: 'abc', title: 'B'}];\n * R.indexBy(R.prop('id'), list);\n * //=> {abc: {id: 'abc', title: 'B'}, xyz: {id: 'xyz', title: 'A'}}\n */\n var indexBy = reduceBy(function (acc, elem) {\n return elem;\n }, null);\n\n /**\n * Returns the position of the first occurrence of an item in an array, or -1\n * if the item is not included in the array. `R.equals` is used to determine\n * equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Number\n * @param {*} target The item to find.\n * @param {Array} xs The array to search in.\n * @return {Number} the index of the target, or -1 if the target is not found.\n * @see R.lastIndexOf\n * @example\n *\n * R.indexOf(3, [1,2,3,4]); //=> 2\n * R.indexOf(10, [1,2,3,4]); //=> -1\n */\n var indexOf = _curry2(function indexOf(target, xs) {\n return typeof xs.indexOf === 'function' && !_isArray(xs) ? xs.indexOf(target) : _indexOf(xs, target, 0);\n });\n\n /**\n * juxt applies a list of functions to a list of values.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Function\n * @sig [(a, b, ..., m) -> n] -> ((a, b, ..., m) -> [n])\n * @param {Array} fns An array of functions\n * @return {Function} A function that returns a list of values after applying each of the original `fns` to its parameters.\n * @see R.applySpec\n * @example\n *\n * var range = R.juxt([Math.min, Math.max]);\n * range(3, 4, 9, -3); //=> [-3, 9]\n */\n var juxt = _curry1(function juxt(fns) {\n return converge(_arrayOf, fns);\n });\n\n /**\n * Returns a lens for the given getter and setter functions. The getter \"gets\"\n * the value of the focus; the setter \"sets\" the value of the focus. The setter\n * should not mutate the data structure.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig (s -> a) -> ((a, s) -> s) -> Lens s a\n * @param {Function} getter\n * @param {Function} setter\n * @return {Lens}\n * @see R.view, R.set, R.over, R.lensIndex, R.lensProp\n * @example\n *\n * var xLens = R.lens(R.prop('x'), R.assoc('x'));\n *\n * R.view(xLens, {x: 1, y: 2}); //=> 1\n * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}\n * R.over(xLens, R.negate, {x: 1, y: 2}); //=> {x: -1, y: 2}\n */\n var lens = _curry2(function lens(getter, setter) {\n return function (toFunctorFn) {\n return function (target) {\n return map(function (focus) {\n return setter(focus, target);\n }, toFunctorFn(getter(target)));\n };\n };\n });\n\n /**\n * Returns a lens whose focus is the specified index.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig Number -> Lens s a\n * @param {Number} n\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n * var headLens = R.lensIndex(0);\n *\n * R.view(headLens, ['a', 'b', 'c']); //=> 'a'\n * R.set(headLens, 'x', ['a', 'b', 'c']); //=> ['x', 'b', 'c']\n * R.over(headLens, R.toUpper, ['a', 'b', 'c']); //=> ['A', 'b', 'c']\n */\n var lensIndex = _curry1(function lensIndex(n) {\n return lens(nth(n), update(n));\n });\n\n /**\n * Returns a lens whose focus is the specified path.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig [String] -> Lens s a\n * @param {Array} path The path to use.\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n * var xyLens = R.lensPath(['x', 'y']);\n *\n * R.view(xyLens, {x: {y: 2, z: 3}}); //=> 2\n * R.set(xyLens, 4, {x: {y: 2, z: 3}}); //=> {x: {y: 4, z: 3}}\n * R.over(xyLens, R.negate, {x: {y: 2, z: 3}}); //=> {x: {y: -2, z: 3}}\n */\n var lensPath = _curry1(function lensPath(p) {\n return lens(path(p), assocPath(p));\n });\n\n /**\n * Returns a lens whose focus is the specified property.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Object\n * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s\n * @sig String -> Lens s a\n * @param {String} k\n * @return {Lens}\n * @see R.view, R.set, R.over\n * @example\n *\n * var xLens = R.lensProp('x');\n *\n * R.view(xLens, {x: 1, y: 2}); //=> 1\n * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}\n * R.over(xLens, R.negate, {x: 1, y: 2}); //=> {x: -1, y: 2}\n */\n var lensProp = _curry1(function lensProp(k) {\n return lens(prop(k), assoc(k));\n });\n\n /**\n * \"lifts\" a function to be the specified arity, so that it may \"map over\" that\n * many lists, Functions or other objects that satisfy the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig Number -> (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.lift, R.ap\n * @example\n *\n * var madd3 = R.liftN(3, R.curryN(3, (...args) => R.sum(args)));\n * madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n */\n var liftN = _curry2(function liftN(arity, fn) {\n var lifted = curryN(arity, fn);\n return curryN(arity, function () {\n return _reduce(ap, map(lifted, arguments[0]), _slice(arguments, 1));\n });\n });\n\n /**\n * Returns the mean of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @example\n *\n * R.mean([2, 7, 9]); //=> 6\n * R.mean([]); //=> NaN\n */\n var mean = _curry1(function mean(list) {\n return sum(list) / list.length;\n });\n\n /**\n * Returns the median of the given list of numbers.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list\n * @return {Number}\n * @example\n *\n * R.median([2, 9, 7]); //=> 7\n * R.median([7, 2, 10, 9]); //=> 8\n * R.median([]); //=> NaN\n */\n var median = _curry1(function median(list) {\n var len = list.length;\n if (len === 0) {\n return NaN;\n }\n var width = 2 - len % 2;\n var idx = (len - width) / 2;\n return mean(_slice(list).sort(function (a, b) {\n return a < b ? -1 : a > b ? 1 : 0;\n }).slice(idx, idx + width));\n });\n\n /**\n * Takes a predicate and a list or other \"filterable\" object and returns the\n * pair of filterable objects of the same type of elements which do and do not\n * satisfy, the predicate, respectively.\n *\n * @func\n * @memberOf R\n * @since v0.1.4\n * @category List\n * @sig Filterable f => (a -> Boolean) -> f a -> [f a, f a]\n * @param {Function} pred A predicate to determine which side the element belongs to.\n * @param {Array} filterable the list (or other filterable) to partition.\n * @return {Array} An array, containing first the subset of elements that satisfy the\n * predicate, and second the subset of elements that do not satisfy.\n * @see R.filter, R.reject\n * @example\n *\n * R.partition(R.contains('s'), ['sss', 'ttt', 'foo', 'bars']);\n * // => [ [ 'sss', 'bars' ], [ 'ttt', 'foo' ] ]\n *\n * R.partition(R.contains('s'), { a: 'sss', b: 'ttt', foo: 'bars' });\n * // => [ { a: 'sss', foo: 'bars' }, { b: 'ttt' } ]\n */\n var partition = juxt([\n filter,\n reject\n ]);\n\n /**\n * Performs left-to-right function composition. The leftmost function may have\n * any arity; the remaining functions must be unary.\n *\n * In some libraries this function is named `sequence`.\n *\n * **Note:** The result of pipe is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (((a, b, ..., n) -> o), (o -> p), ..., (x -> y), (y -> z)) -> ((a, b, ..., n) -> z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.compose\n * @example\n *\n * var f = R.pipe(Math.pow, R.negate, R.inc);\n *\n * f(3, 4); // -(3^4) + 1\n */\n var pipe = function pipe() {\n if (arguments.length === 0) {\n throw new Error('pipe requires at least one argument');\n }\n return _arity(arguments[0].length, reduce(_pipe, arguments[0], tail(arguments)));\n };\n\n /**\n * Performs left-to-right composition of one or more Promise-returning\n * functions. The leftmost function may have any arity; the remaining functions\n * must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((a -> Promise b), (b -> Promise c), ..., (y -> Promise z)) -> (a -> Promise z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.composeP\n * @example\n *\n * // followersForUser :: String -> Promise [User]\n * var followersForUser = R.pipeP(db.getUserById, db.getFollowers);\n */\n var pipeP = function pipeP() {\n if (arguments.length === 0) {\n throw new Error('pipeP requires at least one argument');\n }\n return _arity(arguments[0].length, reduce(_pipeP, arguments[0], tail(arguments)));\n };\n\n /**\n * Multiplies together all the elements of a list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Math\n * @sig [Number] -> Number\n * @param {Array} list An array of numbers\n * @return {Number} The product of all the numbers in the list.\n * @see R.reduce\n * @example\n *\n * R.product([2,4,6,8,100,1]); //=> 38400\n */\n var product = reduce(multiply, 1);\n\n /**\n * Transforms a [Traversable](https://github.com/fantasyland/fantasy-land#traversable)\n * of [Applicative](https://github.com/fantasyland/fantasy-land#applicative) into an\n * Applicative of Traversable.\n *\n * Dispatches to the `sequence` method of the second argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> t (f a) -> f (t a)\n * @param {Function} of\n * @param {*} traversable\n * @return {*}\n * @see R.traverse\n * @example\n *\n * R.sequence(Maybe.of, [Just(1), Just(2), Just(3)]); //=> Just([1, 2, 3])\n * R.sequence(Maybe.of, [Just(1), Just(2), Nothing()]); //=> Nothing()\n *\n * R.sequence(R.of, Just([1, 2, 3])); //=> [Just(1), Just(2), Just(3)]\n * R.sequence(R.of, Nothing()); //=> [Nothing()]\n */\n var sequence = _curry2(function sequence(of, traversable) {\n return typeof traversable.sequence === 'function' ? traversable.sequence(of) : reduceRight(function (acc, x) {\n return ap(map(prepend, x), acc);\n }, of([]), traversable);\n });\n\n /**\n * Maps an [Applicative](https://github.com/fantasyland/fantasy-land#applicative)-returning\n * function over a [Traversable](https://github.com/fantasyland/fantasy-land#traversable),\n * then uses [`sequence`](#sequence) to transform the resulting Traversable of Applicative\n * into an Applicative of Traversable.\n *\n * Dispatches to the `sequence` method of the third argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig (Applicative f, Traversable t) => (a -> f a) -> (a -> f b) -> t a -> f (t b)\n * @param {Function} of\n * @param {Function} f\n * @param {*} traversable\n * @return {*}\n * @see R.sequence\n * @example\n *\n * // Returns `Nothing` if the given divisor is `0`\n * safeDiv = n => d => d === 0 ? Nothing() : Just(n / d)\n *\n * R.traverse(Maybe.of, safeDiv(10), [2, 4, 5]); //=> Just([5, 2.5, 2])\n * R.traverse(Maybe.of, safeDiv(10), [2, 0, 5]); //=> Nothing\n */\n var traverse = _curry3(function traverse(of, f, traversable) {\n return sequence(of, map(f, traversable));\n });\n\n /**\n * Shorthand for `R.chain(R.identity)`, which removes one level of nesting from\n * any [Chain](https://github.com/fantasyland/fantasy-land#chain).\n *\n * @func\n * @memberOf R\n * @since v0.3.0\n * @category List\n * @sig Chain c => c (c a) -> c a\n * @param {*} list\n * @return {*}\n * @see R.flatten, R.chain\n * @example\n *\n * R.unnest([1, [2], [[3]]]); //=> [1, 2, [3]]\n * R.unnest([[1, 2], [3, 4], [5, 6]]); //=> [1, 2, 3, 4, 5, 6]\n */\n var unnest = chain(_identity);\n\n var _contains = function _contains(a, list) {\n return _indexOf(list, a, 0) >= 0;\n };\n\n // mapPairs :: (Object, [String]) -> [String]\n var _toString = function _toString(x, seen) {\n var recur = function recur(y) {\n var xs = seen.concat([x]);\n return _contains(y, xs) ? '' : _toString(y, xs);\n };\n // mapPairs :: (Object, [String]) -> [String]\n var mapPairs = function (obj, keys) {\n return _map(function (k) {\n return _quote(k) + ': ' + recur(obj[k]);\n }, keys.slice().sort());\n };\n switch (Object.prototype.toString.call(x)) {\n case '[object Arguments]':\n return '(function() { return arguments; }(' + _map(recur, x).join(', ') + '))';\n case '[object Array]':\n return '[' + _map(recur, x).concat(mapPairs(x, reject(function (k) {\n return /^\\d+$/.test(k);\n }, keys(x)))).join(', ') + ']';\n case '[object Boolean]':\n return typeof x === 'object' ? 'new Boolean(' + recur(x.valueOf()) + ')' : x.toString();\n case '[object Date]':\n return 'new Date(' + (isNaN(x.valueOf()) ? recur(NaN) : _quote(_toISOString(x))) + ')';\n case '[object Null]':\n return 'null';\n case '[object Number]':\n return typeof x === 'object' ? 'new Number(' + recur(x.valueOf()) + ')' : 1 / x === -Infinity ? '-0' : x.toString(10);\n case '[object String]':\n return typeof x === 'object' ? 'new String(' + recur(x.valueOf()) + ')' : _quote(x);\n case '[object Undefined]':\n return 'undefined';\n default:\n if (typeof x.toString === 'function') {\n var repr = x.toString();\n if (repr !== '[object Object]') {\n return repr;\n }\n }\n return '{' + mapPairs(x, keys(x)).join(', ') + '}';\n }\n };\n\n /**\n * Performs right-to-left function composition. The rightmost function may have\n * any arity; the remaining functions must be unary.\n *\n * **Note:** The result of compose is not automatically curried.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig ((y -> z), (x -> y), ..., (o -> p), ((a, b, ..., n) -> o)) -> ((a, b, ..., n) -> z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.pipe\n * @example\n *\n * var f = R.compose(R.inc, R.negate, Math.pow);\n *\n * f(3, 4); // -(3^4) + 1\n */\n var compose = function compose() {\n if (arguments.length === 0) {\n throw new Error('compose requires at least one argument');\n }\n return pipe.apply(this, reverse(arguments));\n };\n\n /**\n * Returns the right-to-left Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.composeK(h, g, f)` is equivalent to `R.compose(R.chain(h), R.chain(g), R.chain(f))`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((y -> m z), (x -> m y), ..., (a -> m b)) -> (m a -> m z)\n * @param {...Function}\n * @return {Function}\n * @see R.pipeK\n * @example\n *\n * // parseJson :: String -> Maybe *\n * // get :: String -> Object -> Maybe *\n *\n * // getStateCode :: Maybe String -> Maybe String\n * var getStateCode = R.composeK(\n * R.compose(Maybe.of, R.toUpper),\n * get('state'),\n * get('address'),\n * get('user'),\n * parseJson\n * );\n *\n * getStateCode(Maybe.of('{\"user\":{\"address\":{\"state\":\"ny\"}}}'));\n * //=> Just('NY')\n * getStateCode(Maybe.of('[Invalid JSON]'));\n * //=> Nothing()\n */\n var composeK = function composeK() {\n return compose.apply(this, prepend(identity, map(chain, arguments)));\n };\n\n /**\n * Performs right-to-left composition of one or more Promise-returning\n * functions. The rightmost function may have any arity; the remaining\n * functions must be unary.\n *\n * @func\n * @memberOf R\n * @since v0.10.0\n * @category Function\n * @sig ((y -> Promise z), (x -> Promise y), ..., (a -> Promise b)) -> (a -> Promise z)\n * @param {...Function} functions\n * @return {Function}\n * @see R.pipeP\n * @example\n *\n * // followersForUser :: String -> Promise [User]\n * var followersForUser = R.composeP(db.getFollowers, db.getUserById);\n */\n var composeP = function composeP() {\n if (arguments.length === 0) {\n throw new Error('composeP requires at least one argument');\n }\n return pipeP.apply(this, reverse(arguments));\n };\n\n /**\n * Wraps a constructor function inside a curried function that can be called\n * with the same arguments and returns the same type.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (* -> {*}) -> (* -> {*})\n * @param {Function} Fn The constructor function to wrap.\n * @return {Function} A wrapped, curried constructor function.\n * @example\n *\n * // Constructor function\n * var Widget = config => {\n * // ...\n * };\n * Widget.prototype = {\n * // ...\n * };\n * var allConfigs = [\n * // ...\n * ];\n * R.map(R.construct(Widget), allConfigs); // a list of Widgets\n */\n var construct = _curry1(function construct(Fn) {\n return constructN(Fn.length, Fn);\n });\n\n /**\n * Returns `true` if the specified value is equal, in `R.equals` terms, to at\n * least one element of the given list; `false` otherwise.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig a -> [a] -> Boolean\n * @param {Object} a The item to compare against.\n * @param {Array} list The array to consider.\n * @return {Boolean} `true` if the item is in the list, `false` otherwise.\n * @see R.any\n * @example\n *\n * R.contains(3, [1, 2, 3]); //=> true\n * R.contains(4, [1, 2, 3]); //=> false\n * R.contains([42], [[42]]); //=> true\n */\n var contains = _curry2(_contains);\n\n /**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.differenceWith\n * @example\n *\n * R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]\n * R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]\n */\n var difference = _curry2(function difference(first, second) {\n var out = [];\n var idx = 0;\n var firstLen = first.length;\n while (idx < firstLen) {\n if (!_contains(first[idx], second) && !_contains(first[idx], out)) {\n out[out.length] = first[idx];\n }\n idx += 1;\n }\n return out;\n });\n\n /**\n * Returns a new list without any consecutively repeating elements. `R.equals`\n * is used to determine equality.\n *\n * Dispatches to the `dropRepeats` method of the first argument, if present.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} `list` without repeating elements.\n * @see R.transduce\n * @example\n *\n * R.dropRepeats([1, 1, 1, 2, 3, 4, 4, 2, 2]); //=> [1, 2, 3, 4, 2]\n */\n var dropRepeats = _curry1(_dispatchable('dropRepeats', _xdropRepeatsWith(equals), dropRepeatsWith(equals)));\n\n /**\n * \"lifts\" a function of arity > 1 so that it may \"map over\" a list, Function or other\n * object that satisfies the [FantasyLand Apply spec](https://github.com/fantasyland/fantasy-land#apply).\n *\n * @func\n * @memberOf R\n * @since v0.7.0\n * @category Function\n * @sig (*... -> *) -> ([*]... -> [*])\n * @param {Function} fn The function to lift into higher context\n * @return {Function} The lifted function.\n * @see R.liftN\n * @example\n *\n * var madd3 = R.lift(R.curry((a, b, c) => a + b + c));\n *\n * madd3([1,2,3], [1,2,3], [1]); //=> [3, 4, 5, 4, 5, 6, 5, 6, 7]\n *\n * var madd5 = R.lift(R.curry((a, b, c, d, e) => a + b + c + d + e));\n *\n * madd5([1,2], [3], [4, 5], [6], [7, 8]); //=> [21, 22, 22, 23, 22, 23, 23, 24]\n */\n var lift = _curry1(function lift(fn) {\n return liftN(fn.length, fn);\n });\n\n /**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig [String] -> {String: *} -> {String: *}\n * @param {Array} names an array of String property names to omit from the new object\n * @param {Object} obj The object to copy from\n * @return {Object} A new object with properties from `names` not on it.\n * @see R.pick\n * @example\n *\n * R.omit(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, c: 3}\n */\n var omit = _curry2(function omit(names, obj) {\n var result = {};\n for (var prop in obj) {\n if (!_contains(prop, names)) {\n result[prop] = obj[prop];\n }\n }\n return result;\n });\n\n /**\n * Returns the left-to-right Kleisli composition of the provided functions,\n * each of which must return a value of a type supported by [`chain`](#chain).\n *\n * `R.pipeK(f, g, h)` is equivalent to `R.pipe(R.chain(f), R.chain(g), R.chain(h))`.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category Function\n * @sig Chain m => ((a -> m b), (b -> m c), ..., (y -> m z)) -> (m a -> m z)\n * @param {...Function}\n * @return {Function}\n * @see R.composeK\n * @example\n *\n * // parseJson :: String -> Maybe *\n * // get :: String -> Object -> Maybe *\n *\n * // getStateCode :: Maybe String -> Maybe String\n * var getStateCode = R.pipeK(\n * parseJson,\n * get('user'),\n * get('address'),\n * get('state'),\n * R.compose(Maybe.of, R.toUpper)\n * );\n *\n * getStateCode(Maybe.of('{\"user\":{\"address\":{\"state\":\"ny\"}}}'));\n * //=> Just('NY')\n * getStateCode(Maybe.of('[Invalid JSON]'));\n * //=> Nothing()\n */\n var pipeK = function pipeK() {\n return composeK.apply(this, reverse(arguments));\n };\n\n /**\n * Returns the string representation of the given value. `eval`'ing the output\n * should result in a value equivalent to the input value. Many of the built-in\n * `toString` methods do not satisfy this requirement.\n *\n * If the given value is an `[object Object]` with a `toString` method other\n * than `Object.prototype.toString`, this method is invoked with no arguments\n * to produce the return value. This means user-defined constructor functions\n * can provide a suitable `toString` method. For example:\n *\n * function Point(x, y) {\n * this.x = x;\n * this.y = y;\n * }\n *\n * Point.prototype.toString = function() {\n * return 'new Point(' + this.x + ', ' + this.y + ')';\n * };\n *\n * R.toString(new Point(1, 2)); //=> 'new Point(1, 2)'\n *\n * @func\n * @memberOf R\n * @since v0.14.0\n * @category String\n * @sig * -> String\n * @param {*} val\n * @return {String}\n * @example\n *\n * R.toString(42); //=> '42'\n * R.toString('abc'); //=> '\"abc\"'\n * R.toString([1, 2, 3]); //=> '[1, 2, 3]'\n * R.toString({foo: 1, bar: 2, baz: 3}); //=> '{\"bar\": 2, \"baz\": 3, \"foo\": 1}'\n * R.toString(new Date('2001-02-03T04:05:06Z')); //=> 'new Date(\"2001-02-03T04:05:06.000Z\")'\n */\n var toString = _curry1(function toString(val) {\n return _toString(val, []);\n });\n\n /**\n * Returns a new list without values in the first argument.\n * `R.equals` is used to determine equality.\n *\n * Acts as a transducer if a transformer is given in list position.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @param {Array} list1 The values to be removed from `list2`.\n * @param {Array} list2 The array to remove values from.\n * @return {Array} The new array without values in `list1`.\n * @see R.transduce\n * @example\n *\n * R.without([1, 2], [1, 2, 1, 3, 4]); //=> [3, 4]\n */\n var without = _curry2(function (xs, list) {\n return reject(flip(_contains)(xs), list);\n });\n\n // A simple Set type that honours R.equals semantics\n /* globals Set */\n /**\n * Combines the logic for checking whether an item is a member of the set and\n * for adding a new item to the set.\n *\n * @param item The item to check or add to the Set instance.\n * @param shouldAdd If true, the item will be added to the set if it doesn't\n * already exist.\n * @param set The set instance to check or add to.\n * @return {boolean} When shouldAdd is true, this will return true when a new\n * item was added otherwise false. When shouldAdd is false,\n * this will return true if the item already exists, otherwise\n * false.\n */\n // distinguish between +0 and -0\n // these types can all utilise Set\n // set._items['boolean'] holds a two element array\n // representing [ falseExists, trueExists ]\n // compare functions for reference equality\n /* falls through */\n // reduce the search size of heterogeneous sets by creating buckets\n // for each type.\n // scan through all previously applied items\n var _Set = function () {\n function _Set() {\n /* globals Set */\n this._nativeSet = typeof Set === 'function' ? new Set() : null;\n this._items = {};\n }\n _Set.prototype.add = function (item) {\n return hasOrAdd(item, true, this);\n };\n _Set.prototype.has = function (item) {\n return hasOrAdd(item, false, this);\n };\n /**\n * Combines the logic for checking whether an item is a member of the set and\n * for adding a new item to the set.\n *\n * @param item The item to check or add to the Set instance.\n * @param shouldAdd If true, the item will be added to the set if it doesn't\n * already exist.\n * @param set The set instance to check or add to.\n * @return {boolean} When shouldAdd is true, this will return true when a new\n * item was added otherwise false. When shouldAdd is false,\n * this will return true if the item already exists, otherwise\n * false.\n */\n function hasOrAdd(item, shouldAdd, set) {\n var type = typeof item;\n var prevSize, newSize;\n switch (type) {\n case 'string':\n case 'number':\n // distinguish between +0 and -0\n if (item === 0 && !set._items['-0'] && 1 / item === -Infinity) {\n if (shouldAdd) {\n set._items['-0'] = true;\n }\n return shouldAdd;\n }\n // these types can all utilise Set\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize > prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = {};\n set._items[type][item] = true;\n }\n return shouldAdd;\n } else if (item in set._items[type]) {\n return !shouldAdd;\n } else {\n if (shouldAdd) {\n set._items[type][item] = true;\n }\n return shouldAdd;\n }\n }\n case 'boolean':\n // set._items['boolean'] holds a two element array\n // representing [ falseExists, trueExists ]\n if (type in set._items) {\n var bIdx = item ? 1 : 0;\n if (set._items[type][bIdx]) {\n return !shouldAdd;\n } else {\n if (shouldAdd) {\n set._items[type][bIdx] = true;\n }\n return shouldAdd;\n }\n } else {\n if (shouldAdd) {\n set._items[type] = item ? [\n false,\n true\n ] : [\n true,\n false\n ];\n }\n return shouldAdd;\n }\n case 'function':\n // compare functions for reference equality\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize > prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return shouldAdd;\n }\n if (!_contains(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return shouldAdd;\n }\n }\n return !shouldAdd;\n case 'undefined':\n if (set._items[type]) {\n return !shouldAdd;\n } else {\n if (shouldAdd) {\n set._items[type] = true;\n }\n return shouldAdd;\n }\n case 'object':\n if (item === null) {\n if (!set._items['null']) {\n if (shouldAdd) {\n set._items['null'] = true;\n }\n return shouldAdd;\n }\n return !shouldAdd;\n }\n /* falls through */\n default:\n // reduce the search size of heterogeneous sets by creating buckets\n // for each type.\n type = Object.prototype.toString.call(item);\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return shouldAdd;\n }\n // scan through all previously applied items\n if (!_contains(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return shouldAdd;\n }\n return !shouldAdd;\n }\n }\n return _Set;\n }();\n\n /**\n * A function wrapping calls to the two functions in an `&&` operation,\n * returning the result of the first function if it is false-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * false-y value.\n *\n * In addition to functions, `R.both` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f a predicate\n * @param {Function} g another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `&&`s their outputs together.\n * @see R.and\n * @example\n *\n * var gt10 = x => x > 10;\n * var even = x => x % 2 === 0;\n * var f = R.both(gt10, even);\n * f(100); //=> true\n * f(101); //=> false\n */\n var both = _curry2(function both(f, g) {\n return _isFunction(f) ? function _both() {\n return f.apply(this, arguments) && g.apply(this, arguments);\n } : lift(and)(f, g);\n });\n\n /**\n * Takes a function `f` and returns a function `g` such that:\n *\n * - applying `g` to zero or more arguments will give __true__ if applying\n * the same arguments to `f` gives a logical __false__ value; and\n *\n * - applying `g` to zero or more arguments will give __false__ if applying\n * the same arguments to `f` gives a logical __true__ value.\n *\n * `R.complement` will work on all other functors as well.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> *) -> (*... -> Boolean)\n * @param {Function} f\n * @return {Function}\n * @see R.not\n * @example\n *\n * var isEven = n => n % 2 === 0;\n * var isOdd = R.complement(isEven);\n * isOdd(21); //=> true\n * isOdd(42); //=> false\n */\n var complement = lift(not);\n\n /**\n * A function wrapping calls to the two functions in an `||` operation,\n * returning the result of the first function if it is truth-y and the result\n * of the second function otherwise. Note that this is short-circuited,\n * meaning that the second function will not be invoked if the first returns a\n * truth-y value.\n *\n * In addition to functions, `R.either` also accepts any fantasy-land compatible\n * applicative functor.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category Logic\n * @sig (*... -> Boolean) -> (*... -> Boolean) -> (*... -> Boolean)\n * @param {Function} f a predicate\n * @param {Function} g another predicate\n * @return {Function} a function that applies its arguments to `f` and `g` and `||`s their outputs together.\n * @see R.or\n * @example\n *\n * var gt10 = x => x > 10;\n * var even = x => x % 2 === 0;\n * var f = R.either(gt10, even);\n * f(101); //=> true\n * f(8); //=> true\n */\n var either = _curry2(function either(f, g) {\n return _isFunction(f) ? function _either() {\n return f.apply(this, arguments) || g.apply(this, arguments);\n } : lift(or)(f, g);\n });\n\n /**\n * Turns a named method with a specified arity into a function that can be\n * called directly supplied with arguments and a target object.\n *\n * The returned function is curried and accepts `arity + 1` parameters where\n * the final parameter is the target object.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig Number -> String -> (a -> b -> ... -> n -> Object -> *)\n * @param {Number} arity Number of arguments the returned function should take\n * before the target object.\n * @param {String} method Name of the method to call.\n * @return {Function} A new curried function.\n * @example\n *\n * var sliceFrom = R.invoker(1, 'slice');\n * sliceFrom(6, 'abcdefghijklm'); //=> 'ghijklm'\n * var sliceFrom6 = R.invoker(2, 'slice')(6);\n * sliceFrom6(8, 'abcdefghijklm'); //=> 'gh'\n */\n var invoker = _curry2(function invoker(arity, method) {\n return curryN(arity + 1, function () {\n var target = arguments[arity];\n if (target != null && is(Function, target[method])) {\n return target[method].apply(target, _slice(arguments, 0, arity));\n }\n throw new TypeError(toString(target) + ' does not have a method named \"' + method + '\"');\n });\n });\n\n /**\n * Returns a string made by inserting the `separator` between each element and\n * concatenating all the elements into a single string.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig String -> [a] -> String\n * @param {Number|String} separator The string used to separate the elements.\n * @param {Array} xs The elements to join into a string.\n * @return {String} str The string made by concatenating `xs` with `separator`.\n * @see R.split\n * @example\n *\n * var spacer = R.join(' ');\n * spacer(['a', 2, 3.4]); //=> 'a 2 3.4'\n * R.join('|', [1, 2, 3]); //=> '1|2|3'\n */\n var join = invoker(1, 'join');\n\n /**\n * Creates a new function that, when invoked, caches the result of calling `fn`\n * for a given argument set and returns the result. Subsequent calls to the\n * memoized `fn` with the same argument set will not result in an additional\n * call to `fn`; instead, the cached result for that set of arguments will be\n * returned.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig (*... -> a) -> (*... -> a)\n * @param {Function} fn The function to memoize.\n * @return {Function} Memoized version of `fn`.\n * @example\n *\n * var count = 0;\n * var factorial = R.memoize(n => {\n * count += 1;\n * return R.product(R.range(1, n + 1));\n * });\n * factorial(5); //=> 120\n * factorial(5); //=> 120\n * factorial(5); //=> 120\n * count; //=> 1\n */\n var memoize = _curry1(function memoize(fn) {\n var cache = {};\n return _arity(fn.length, function () {\n var key = toString(arguments);\n if (!_has(key, cache)) {\n cache[key] = fn.apply(this, arguments);\n }\n return cache[key];\n });\n });\n\n /**\n * Splits a string into an array of strings based on the given\n * separator.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category String\n * @sig (String | RegExp) -> String -> [String]\n * @param {String|RegExp} sep The pattern.\n * @param {String} str The string to separate into an array.\n * @return {Array} The array of strings from `str` separated by `str`.\n * @see R.join\n * @example\n *\n * var pathComponents = R.split('/');\n * R.tail(pathComponents('/usr/local/bin/node')); //=> ['usr', 'local', 'bin', 'node']\n *\n * R.split('.', 'a.b.c.xyz.d'); //=> ['a', 'b', 'c', 'xyz', 'd']\n */\n var split = invoker(1, 'split');\n\n /**\n * Determines whether a given string matches a given regular expression.\n *\n * @func\n * @memberOf R\n * @since v0.12.0\n * @category String\n * @sig RegExp -> String -> Boolean\n * @param {RegExp} pattern\n * @param {String} str\n * @return {Boolean}\n * @see R.match\n * @example\n *\n * R.test(/^x/, 'xyz'); //=> true\n * R.test(/^y/, 'xyz'); //=> false\n */\n var test = _curry2(function test(pattern, str) {\n if (!_isRegExp(pattern)) {\n throw new TypeError('\\u2018test\\u2019 requires a value of type RegExp as its first argument; received ' + toString(pattern));\n }\n return _cloneRegExp(pattern).test(str);\n });\n\n /**\n * The lower case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to lower case.\n * @return {String} The lower case version of `str`.\n * @see R.toUpper\n * @example\n *\n * R.toLower('XYZ'); //=> 'xyz'\n */\n var toLower = invoker(0, 'toLowerCase');\n\n /**\n * The upper case version of a string.\n *\n * @func\n * @memberOf R\n * @since v0.9.0\n * @category String\n * @sig String -> String\n * @param {String} str The string to upper case.\n * @return {String} The upper case version of `str`.\n * @see R.toLower\n * @example\n *\n * R.toUpper('abc'); //=> 'ABC'\n */\n var toUpper = invoker(0, 'toUpperCase');\n\n /**\n * Returns a new list containing only one copy of each element in the original\n * list, based upon the value returned by applying the supplied function to\n * each list element. Prefers the first item if the supplied function produces\n * the same value on two items. `R.equals` is used for comparison.\n *\n * @func\n * @memberOf R\n * @since v0.16.0\n * @category List\n * @sig (a -> b) -> [a] -> [a]\n * @param {Function} fn A function used to produce a value to use during comparisons.\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n * R.uniqBy(Math.abs, [-1, -5, 2, 10, 1, 2]); //=> [-1, -5, 2, 10]\n */\n var uniqBy = _curry2(function uniqBy(fn, list) {\n var set = new _Set();\n var result = [];\n var idx = 0;\n var appliedItem, item;\n while (idx < list.length) {\n item = list[idx];\n appliedItem = fn(item);\n if (set.add(appliedItem)) {\n result.push(item);\n }\n idx += 1;\n }\n return result;\n });\n\n /**\n * Returns the result of concatenating the given lists or strings.\n *\n * Dispatches to the `concat` method of the first argument, if present.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a] -> [a]\n * @sig String -> String -> String\n * @param {Array|String} a\n * @param {Array|String} b\n * @return {Array|String}\n *\n * @example\n *\n * R.concat([], []); //=> []\n * R.concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]\n * R.concat('ABC', 'DEF'); // 'ABCDEF'\n */\n var concat = flip(invoker(1, 'concat'));\n\n /**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifferenceWith\n * @example\n *\n * R.symmetricDifference([1,2,3,4], [7,6,5,4,3]); //=> [1,2,7,6,5]\n * R.symmetricDifference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5,1,2]\n */\n var symmetricDifference = _curry2(function symmetricDifference(list1, list2) {\n return concat(difference(list1, list2), difference(list2, list1));\n });\n\n /**\n * Finds the set (i.e. no duplicates) of all elements contained in the first or\n * second list, but not both. Duplication is determined according to the value\n * returned by applying the supplied predicate to two list elements.\n *\n * @func\n * @memberOf R\n * @since v0.19.0\n * @category Relation\n * @sig (a -> a -> Boolean) -> [a] -> [a] -> [a]\n * @param {Function} pred A predicate used to test whether two items are equal.\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` or `list2`, but not both.\n * @see R.symmetricDifference\n * @example\n *\n * var eqA = R.eqBy(R.prop('a'));\n * var l1 = [{a: 1}, {a: 2}, {a: 3}, {a: 4}];\n * var l2 = [{a: 3}, {a: 4}, {a: 5}, {a: 6}];\n * R.symmetricDifferenceWith(eqA, l1, l2); //=> [{a: 1}, {a: 2}, {a: 5}, {a: 6}]\n */\n var symmetricDifferenceWith = _curry3(function symmetricDifferenceWith(pred, list1, list2) {\n return concat(differenceWith(pred, list1, list2), differenceWith(pred, list2, list1));\n });\n\n /**\n * Returns a new list containing only one copy of each element in the original\n * list. `R.equals` is used to determine equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @param {Array} list The array to consider.\n * @return {Array} The list of unique items.\n * @example\n *\n * R.uniq([1, 1, 2, 1]); //=> [1, 2]\n * R.uniq([1, '1']); //=> [1, '1']\n * R.uniq([[42], [42]]); //=> [[42]]\n */\n var uniq = uniqBy(identity);\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of those\n * elements common to both lists.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The list of elements found in both `list1` and `list2`.\n * @see R.intersectionWith\n * @example\n *\n * R.intersection([1,2,3,4], [7,6,5,4,3]); //=> [4, 3]\n */\n var intersection = _curry2(function intersection(list1, list2) {\n var lookupList, filteredList;\n if (list1.length > list2.length) {\n lookupList = list1;\n filteredList = list2;\n } else {\n lookupList = list2;\n filteredList = list1;\n }\n return uniq(_filter(flip(_contains)(lookupList), filteredList));\n });\n\n /**\n * Combines two lists into a set (i.e. no duplicates) composed of the elements\n * of each list.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} as The first list.\n * @param {Array} bs The second list.\n * @return {Array} The first and second lists concatenated, with\n * duplicates removed.\n * @example\n *\n * R.union([1, 2, 3], [2, 3, 4]); //=> [1, 2, 3, 4]\n */\n var union = _curry2(compose(uniq, _concat));\n\n var R = {\n F: F,\n T: T,\n __: __,\n add: add,\n addIndex: addIndex,\n adjust: adjust,\n all: all,\n allPass: allPass,\n allUniq: allUniq,\n always: always,\n and: and,\n any: any,\n anyPass: anyPass,\n ap: ap,\n aperture: aperture,\n append: append,\n apply: apply,\n applySpec: applySpec,\n assoc: assoc,\n assocPath: assocPath,\n binary: binary,\n bind: bind,\n both: both,\n call: call,\n chain: chain,\n clamp: clamp,\n clone: clone,\n comparator: comparator,\n complement: complement,\n compose: compose,\n composeK: composeK,\n composeP: composeP,\n concat: concat,\n cond: cond,\n construct: construct,\n constructN: constructN,\n contains: contains,\n converge: converge,\n countBy: countBy,\n curry: curry,\n curryN: curryN,\n dec: dec,\n defaultTo: defaultTo,\n difference: difference,\n differenceWith: differenceWith,\n dissoc: dissoc,\n dissocPath: dissocPath,\n divide: divide,\n drop: drop,\n dropLast: dropLast,\n dropLastWhile: dropLastWhile,\n dropRepeats: dropRepeats,\n dropRepeatsWith: dropRepeatsWith,\n dropWhile: dropWhile,\n either: either,\n empty: empty,\n eqBy: eqBy,\n eqProps: eqProps,\n equals: equals,\n evolve: evolve,\n filter: filter,\n find: find,\n findIndex: findIndex,\n findLast: findLast,\n findLastIndex: findLastIndex,\n flatten: flatten,\n flip: flip,\n forEach: forEach,\n fromPairs: fromPairs,\n groupBy: groupBy,\n groupWith: groupWith,\n gt: gt,\n gte: gte,\n has: has,\n hasIn: hasIn,\n head: head,\n identical: identical,\n identity: identity,\n ifElse: ifElse,\n inc: inc,\n indexBy: indexBy,\n indexOf: indexOf,\n init: init,\n insert: insert,\n insertAll: insertAll,\n intersection: intersection,\n intersectionWith: intersectionWith,\n intersperse: intersperse,\n into: into,\n invert: invert,\n invertObj: invertObj,\n invoker: invoker,\n is: is,\n isArrayLike: isArrayLike,\n isEmpty: isEmpty,\n isNil: isNil,\n join: join,\n juxt: juxt,\n keys: keys,\n keysIn: keysIn,\n last: last,\n lastIndexOf: lastIndexOf,\n length: length,\n lens: lens,\n lensIndex: lensIndex,\n lensPath: lensPath,\n lensProp: lensProp,\n lift: lift,\n liftN: liftN,\n lt: lt,\n lte: lte,\n map: map,\n mapAccum: mapAccum,\n mapAccumRight: mapAccumRight,\n mapObjIndexed: mapObjIndexed,\n match: match,\n mathMod: mathMod,\n max: max,\n maxBy: maxBy,\n mean: mean,\n median: median,\n memoize: memoize,\n merge: merge,\n mergeAll: mergeAll,\n mergeWith: mergeWith,\n mergeWithKey: mergeWithKey,\n min: min,\n minBy: minBy,\n modulo: modulo,\n multiply: multiply,\n nAry: nAry,\n negate: negate,\n none: none,\n not: not,\n nth: nth,\n nthArg: nthArg,\n objOf: objOf,\n of: of,\n omit: omit,\n once: once,\n or: or,\n over: over,\n pair: pair,\n partial: partial,\n partialRight: partialRight,\n partition: partition,\n path: path,\n pathEq: pathEq,\n pathOr: pathOr,\n pathSatisfies: pathSatisfies,\n pick: pick,\n pickAll: pickAll,\n pickBy: pickBy,\n pipe: pipe,\n pipeK: pipeK,\n pipeP: pipeP,\n pluck: pluck,\n prepend: prepend,\n product: product,\n project: project,\n prop: prop,\n propEq: propEq,\n propIs: propIs,\n propOr: propOr,\n propSatisfies: propSatisfies,\n props: props,\n range: range,\n reduce: reduce,\n reduceBy: reduceBy,\n reduceRight: reduceRight,\n reduced: reduced,\n reject: reject,\n remove: remove,\n repeat: repeat,\n replace: replace,\n reverse: reverse,\n scan: scan,\n sequence: sequence,\n set: set,\n slice: slice,\n sort: sort,\n sortBy: sortBy,\n split: split,\n splitAt: splitAt,\n splitEvery: splitEvery,\n splitWhen: splitWhen,\n subtract: subtract,\n sum: sum,\n symmetricDifference: symmetricDifference,\n symmetricDifferenceWith: symmetricDifferenceWith,\n tail: tail,\n take: take,\n takeLast: takeLast,\n takeLastWhile: takeLastWhile,\n takeWhile: takeWhile,\n tap: tap,\n test: test,\n times: times,\n toLower: toLower,\n toPairs: toPairs,\n toPairsIn: toPairsIn,\n toString: toString,\n toUpper: toUpper,\n transduce: transduce,\n transpose: transpose,\n traverse: traverse,\n trim: trim,\n tryCatch: tryCatch,\n type: type,\n unapply: unapply,\n unary: unary,\n uncurryN: uncurryN,\n unfold: unfold,\n union: union,\n unionWith: unionWith,\n uniq: uniq,\n uniqBy: uniqBy,\n uniqWith: uniqWith,\n unless: unless,\n unnest: unnest,\n until: until,\n update: update,\n useWith: useWith,\n values: values,\n valuesIn: valuesIn,\n view: view,\n when: when,\n where: where,\n whereEq: whereEq,\n without: without,\n wrap: wrap,\n xprod: xprod,\n zip: zip,\n zipObj: zipObj,\n zipWith: zipWith\n };\n /* eslint-env amd */\n\n /* TEST_ENTRY_POINT */\n\n if (typeof exports === 'object') {\n module.exports = R;\n } else if (typeof define === 'function' && define.amd) {\n define(function() { return R; });\n } else {\n this.R = R;\n }\n\n}.call(this));\n","/**\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\n * additional grant of patent rights can be found in the PATENTS file in\n * the same directory.\n */\n\n!(function(global) {\n \"use strict\";\n\n var Op = Object.prototype;\n var hasOwn = Op.hasOwnProperty;\n var undefined; // More compressible than void 0.\n var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n var inModule = typeof module === \"object\";\n var runtime = global.regeneratorRuntime;\n if (runtime) {\n if (inModule) {\n // If regeneratorRuntime is defined globally and we're in a module,\n // make the exports object identical to regeneratorRuntime.\n module.exports = runtime;\n }\n // Don't bother evaluating the rest of this file if the runtime was\n // already defined globally.\n return;\n }\n\n // Define the runtime globally (as expected by generated code) as either\n // module.exports (if we're in a module) or a new, empty object.\n runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n function wrap(innerFn, outerFn, self, tryLocsList) {\n // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n var generator = Object.create(protoGenerator.prototype);\n var context = new Context(tryLocsList || []);\n\n // The ._invoke method unifies the implementations of the .next,\n // .throw, and .return methods.\n generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n return generator;\n }\n runtime.wrap = wrap;\n\n // Try/catch helper to minimize deoptimizations. Returns a completion\n // record like context.tryEntries[i].completion. This interface could\n // have been (and was previously) designed to take a closure to be\n // invoked without arguments, but in all the cases we care about we\n // already have an existing method we want to call, so there's no need\n // to create a new function object. We can even get away with assuming\n // the method takes exactly one argument, since that happens to be true\n // in every case, so we don't have to touch the arguments object. The\n // only additional allocation required is the completion record, which\n // has a stable shape and so hopefully should be cheap to allocate.\n function tryCatch(fn, obj, arg) {\n try {\n return { type: \"normal\", arg: fn.call(obj, arg) };\n } catch (err) {\n return { type: \"throw\", arg: err };\n }\n }\n\n var GenStateSuspendedStart = \"suspendedStart\";\n var GenStateSuspendedYield = \"suspendedYield\";\n var GenStateExecuting = \"executing\";\n var GenStateCompleted = \"completed\";\n\n // Returning this object from the innerFn has the same effect as\n // breaking out of the dispatch switch statement.\n var ContinueSentinel = {};\n\n // Dummy constructor functions that we use as the .constructor and\n // .constructor.prototype properties for functions that return Generator\n // objects. For full spec compliance, you may wish to configure your\n // minifier not to mangle the names of these two functions.\n function Generator() {}\n function GeneratorFunction() {}\n function GeneratorFunctionPrototype() {}\n\n // This is a polyfill for %IteratorPrototype% for environments that\n // don't natively support it.\n var IteratorPrototype = {};\n IteratorPrototype[iteratorSymbol] = function () {\n return this;\n };\n\n var getProto = Object.getPrototypeOf;\n var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n if (NativeIteratorPrototype &&\n NativeIteratorPrototype !== Op &&\n hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n // This environment has a native %IteratorPrototype%; use it instead\n // of the polyfill.\n IteratorPrototype = NativeIteratorPrototype;\n }\n\n var Gp = GeneratorFunctionPrototype.prototype =\n Generator.prototype = Object.create(IteratorPrototype);\n GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n GeneratorFunctionPrototype.constructor = GeneratorFunction;\n GeneratorFunctionPrototype[toStringTagSymbol] =\n GeneratorFunction.displayName = \"GeneratorFunction\";\n\n // Helper for defining the .next, .throw, and .return methods of the\n // Iterator interface in terms of a single ._invoke method.\n function defineIteratorMethods(prototype) {\n [\"next\", \"throw\", \"return\"].forEach(function(method) {\n prototype[method] = function(arg) {\n return this._invoke(method, arg);\n };\n });\n }\n\n runtime.isGeneratorFunction = function(genFun) {\n var ctor = typeof genFun === \"function\" && genFun.constructor;\n return ctor\n ? ctor === GeneratorFunction ||\n // For the native GeneratorFunction constructor, the best we can\n // do is to check its .name property.\n (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n : false;\n };\n\n runtime.mark = function(genFun) {\n if (Object.setPrototypeOf) {\n Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n } else {\n genFun.__proto__ = GeneratorFunctionPrototype;\n if (!(toStringTagSymbol in genFun)) {\n genFun[toStringTagSymbol] = \"GeneratorFunction\";\n }\n }\n genFun.prototype = Object.create(Gp);\n return genFun;\n };\n\n // Within the body of any async function, `await x` is transformed to\n // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n // meant to be awaited.\n runtime.awrap = function(arg) {\n return { __await: arg };\n };\n\n function AsyncIterator(generator) {\n function invoke(method, arg, resolve, reject) {\n var record = tryCatch(generator[method], generator, arg);\n if (record.type === \"throw\") {\n reject(record.arg);\n } else {\n var result = record.arg;\n var value = result.value;\n if (value &&\n typeof value === \"object\" &&\n hasOwn.call(value, \"__await\")) {\n return Promise.resolve(value.__await).then(function(value) {\n invoke(\"next\", value, resolve, reject);\n }, function(err) {\n invoke(\"throw\", err, resolve, reject);\n });\n }\n\n return Promise.resolve(value).then(function(unwrapped) {\n // When a yielded Promise is resolved, its final value becomes\n // the .value of the Promise<{value,done}> result for the\n // current iteration. If the Promise is rejected, however, the\n // result for this iteration will be rejected with the same\n // reason. Note that rejections of yielded Promises are not\n // thrown back into the generator function, as is the case\n // when an awaited Promise is rejected. This difference in\n // behavior between yield and await is important, because it\n // allows the consumer to decide what to do with the yielded\n // rejection (swallow it and continue, manually .throw it back\n // into the generator, abandon iteration, whatever). With\n // await, by contrast, there is no opportunity to examine the\n // rejection reason outside the generator function, so the\n // only option is to throw it from the await expression, and\n // let the generator function handle the exception.\n result.value = unwrapped;\n resolve(result);\n }, reject);\n }\n }\n\n if (typeof global.process === \"object\" && global.process.domain) {\n invoke = global.process.domain.bind(invoke);\n }\n\n var previousPromise;\n\n function enqueue(method, arg) {\n function callInvokeWithMethodAndArg() {\n return new Promise(function(resolve, reject) {\n invoke(method, arg, resolve, reject);\n });\n }\n\n return previousPromise =\n // If enqueue has been called before, then we want to wait until\n // all previous Promises have been resolved before calling invoke,\n // so that results are always delivered in the correct order. If\n // enqueue has not been called before, then it is important to\n // call invoke immediately, without waiting on a callback to fire,\n // so that the async generator function has the opportunity to do\n // any necessary setup in a predictable way. This predictability\n // is why the Promise constructor synchronously invokes its\n // executor callback, and why async functions synchronously\n // execute code before the first await. Since we implement simple\n // async functions in terms of async generators, it is especially\n // important to get this right, even though it requires care.\n previousPromise ? previousPromise.then(\n callInvokeWithMethodAndArg,\n // Avoid propagating failures to Promises returned by later\n // invocations of the iterator.\n callInvokeWithMethodAndArg\n ) : callInvokeWithMethodAndArg();\n }\n\n // Define the unified helper method that is used to implement .next,\n // .throw, and .return (see defineIteratorMethods).\n this._invoke = enqueue;\n }\n\n defineIteratorMethods(AsyncIterator.prototype);\n AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n return this;\n };\n runtime.AsyncIterator = AsyncIterator;\n\n // Note that simple async functions are implemented on top of\n // AsyncIterator objects; they just return a Promise for the value of\n // the final result produced by the iterator.\n runtime.async = function(innerFn, outerFn, self, tryLocsList) {\n var iter = new AsyncIterator(\n wrap(innerFn, outerFn, self, tryLocsList)\n );\n\n return runtime.isGeneratorFunction(outerFn)\n ? iter // If outerFn is a generator, return the full iterator.\n : iter.next().then(function(result) {\n return result.done ? result.value : iter.next();\n });\n };\n\n function makeInvokeMethod(innerFn, self, context) {\n var state = GenStateSuspendedStart;\n\n return function invoke(method, arg) {\n if (state === GenStateExecuting) {\n throw new Error(\"Generator is already running\");\n }\n\n if (state === GenStateCompleted) {\n if (method === \"throw\") {\n throw arg;\n }\n\n // Be forgiving, per 25.3.3.3.3 of the spec:\n // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n return doneResult();\n }\n\n context.method = method;\n context.arg = arg;\n\n while (true) {\n var delegate = context.delegate;\n if (delegate) {\n var delegateResult = maybeInvokeDelegate(delegate, context);\n if (delegateResult) {\n if (delegateResult === ContinueSentinel) continue;\n return delegateResult;\n }\n }\n\n if (context.method === \"next\") {\n // Setting context._sent for legacy support of Babel's\n // function.sent implementation.\n context.sent = context._sent = context.arg;\n\n } else if (context.method === \"throw\") {\n if (state === GenStateSuspendedStart) {\n state = GenStateCompleted;\n throw context.arg;\n }\n\n context.dispatchException(context.arg);\n\n } else if (context.method === \"return\") {\n context.abrupt(\"return\", context.arg);\n }\n\n state = GenStateExecuting;\n\n var record = tryCatch(innerFn, self, context);\n if (record.type === \"normal\") {\n // If an exception is thrown from innerFn, we leave state ===\n // GenStateExecuting and loop back for another invocation.\n state = context.done\n ? GenStateCompleted\n : GenStateSuspendedYield;\n\n if (record.arg === ContinueSentinel) {\n continue;\n }\n\n return {\n value: record.arg,\n done: context.done\n };\n\n } else if (record.type === \"throw\") {\n state = GenStateCompleted;\n // Dispatch the exception by looping back around to the\n // context.dispatchException(context.arg) call above.\n context.method = \"throw\";\n context.arg = record.arg;\n }\n }\n };\n }\n\n // Call delegate.iterator[context.method](context.arg) and handle the\n // result, either by returning a { value, done } result from the\n // delegate iterator, or by modifying context.method and context.arg,\n // setting context.delegate to null, and returning the ContinueSentinel.\n function maybeInvokeDelegate(delegate, context) {\n var method = delegate.iterator[context.method];\n if (method === undefined) {\n // A .throw or .return when the delegate iterator has no .throw\n // method always terminates the yield* loop.\n context.delegate = null;\n\n if (context.method === \"throw\") {\n if (delegate.iterator.return) {\n // If the delegate iterator has a return method, give it a\n // chance to clean up.\n context.method = \"return\";\n context.arg = undefined;\n maybeInvokeDelegate(delegate, context);\n\n if (context.method === \"throw\") {\n // If maybeInvokeDelegate(context) changed context.method from\n // \"return\" to \"throw\", let that override the TypeError below.\n return ContinueSentinel;\n }\n }\n\n context.method = \"throw\";\n context.arg = new TypeError(\n \"The iterator does not provide a 'throw' method\");\n }\n\n return ContinueSentinel;\n }\n\n var record = tryCatch(method, delegate.iterator, context.arg);\n\n if (record.type === \"throw\") {\n context.method = \"throw\";\n context.arg = record.arg;\n context.delegate = null;\n return ContinueSentinel;\n }\n\n var info = record.arg;\n\n if (! info) {\n context.method = \"throw\";\n context.arg = new TypeError(\"iterator result is not an object\");\n context.delegate = null;\n return ContinueSentinel;\n }\n\n if (info.done) {\n // Assign the result of the finished delegate to the temporary\n // variable specified by delegate.resultName (see delegateYield).\n context[delegate.resultName] = info.value;\n\n // Resume execution at the desired location (see delegateYield).\n context.next = delegate.nextLoc;\n\n // If context.method was \"throw\" but the delegate handled the\n // exception, let the outer generator proceed normally. If\n // context.method was \"next\", forget context.arg since it has been\n // \"consumed\" by the delegate iterator. If context.method was\n // \"return\", allow the original .return call to continue in the\n // outer generator.\n if (context.method !== \"return\") {\n context.method = \"next\";\n context.arg = undefined;\n }\n\n } else {\n // Re-yield the result returned by the delegate method.\n return info;\n }\n\n // The delegate iterator is finished, so forget it and continue with\n // the outer generator.\n context.delegate = null;\n return ContinueSentinel;\n }\n\n // Define Generator.prototype.{next,throw,return} in terms of the\n // unified ._invoke helper method.\n defineIteratorMethods(Gp);\n\n Gp[toStringTagSymbol] = \"Generator\";\n\n // A Generator should always return itself as the iterator object when the\n // @@iterator function is called on it. Some browsers' implementations of the\n // iterator prototype chain incorrectly implement this, causing the Generator\n // object to not be returned from this call. This ensures that doesn't happen.\n // See https://github.com/facebook/regenerator/issues/274 for more details.\n Gp[iteratorSymbol] = function() {\n return this;\n };\n\n Gp.toString = function() {\n return \"[object Generator]\";\n };\n\n function pushTryEntry(locs) {\n var entry = { tryLoc: locs[0] };\n\n if (1 in locs) {\n entry.catchLoc = locs[1];\n }\n\n if (2 in locs) {\n entry.finallyLoc = locs[2];\n entry.afterLoc = locs[3];\n }\n\n this.tryEntries.push(entry);\n }\n\n function resetTryEntry(entry) {\n var record = entry.completion || {};\n record.type = \"normal\";\n delete record.arg;\n entry.completion = record;\n }\n\n function Context(tryLocsList) {\n // The root entry object (effectively a try statement without a catch\n // or a finally block) gives us a place to store values thrown from\n // locations where there is no enclosing try statement.\n this.tryEntries = [{ tryLoc: \"root\" }];\n tryLocsList.forEach(pushTryEntry, this);\n this.reset(true);\n }\n\n runtime.keys = function(object) {\n var keys = [];\n for (var key in object) {\n keys.push(key);\n }\n keys.reverse();\n\n // Rather than returning an object with a next method, we keep\n // things simple and return the next function itself.\n return function next() {\n while (keys.length) {\n var key = keys.pop();\n if (key in object) {\n next.value = key;\n next.done = false;\n return next;\n }\n }\n\n // To avoid creating an additional object, we just hang the .value\n // and .done properties off the next function object itself. This\n // also ensures that the minifier will not anonymize the function.\n next.done = true;\n return next;\n };\n };\n\n function values(iterable) {\n if (iterable) {\n var iteratorMethod = iterable[iteratorSymbol];\n if (iteratorMethod) {\n return iteratorMethod.call(iterable);\n }\n\n if (typeof iterable.next === \"function\") {\n return iterable;\n }\n\n if (!isNaN(iterable.length)) {\n var i = -1, next = function next() {\n while (++i < iterable.length) {\n if (hasOwn.call(iterable, i)) {\n next.value = iterable[i];\n next.done = false;\n return next;\n }\n }\n\n next.value = undefined;\n next.done = true;\n\n return next;\n };\n\n return next.next = next;\n }\n }\n\n // Return an iterator with no values.\n return { next: doneResult };\n }\n runtime.values = values;\n\n function doneResult() {\n return { value: undefined, done: true };\n }\n\n Context.prototype = {\n constructor: Context,\n\n reset: function(skipTempReset) {\n this.prev = 0;\n this.next = 0;\n // Resetting context._sent for legacy support of Babel's\n // function.sent implementation.\n this.sent = this._sent = undefined;\n this.done = false;\n this.delegate = null;\n\n this.method = \"next\";\n this.arg = undefined;\n\n this.tryEntries.forEach(resetTryEntry);\n\n if (!skipTempReset) {\n for (var name in this) {\n // Not sure about the optimal order of these conditions:\n if (name.charAt(0) === \"t\" &&\n hasOwn.call(this, name) &&\n !isNaN(+name.slice(1))) {\n this[name] = undefined;\n }\n }\n }\n },\n\n stop: function() {\n this.done = true;\n\n var rootEntry = this.tryEntries[0];\n var rootRecord = rootEntry.completion;\n if (rootRecord.type === \"throw\") {\n throw rootRecord.arg;\n }\n\n return this.rval;\n },\n\n dispatchException: function(exception) {\n if (this.done) {\n throw exception;\n }\n\n var context = this;\n function handle(loc, caught) {\n record.type = \"throw\";\n record.arg = exception;\n context.next = loc;\n\n if (caught) {\n // If the dispatched exception was caught by a catch block,\n // then let that catch block handle the exception normally.\n context.method = \"next\";\n context.arg = undefined;\n }\n\n return !! caught;\n }\n\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n var record = entry.completion;\n\n if (entry.tryLoc === \"root\") {\n // Exception thrown outside of any try block that could handle\n // it, so set the completion value of the entire function to\n // throw the exception.\n return handle(\"end\");\n }\n\n if (entry.tryLoc <= this.prev) {\n var hasCatch = hasOwn.call(entry, \"catchLoc\");\n var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n if (hasCatch && hasFinally) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n } else if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else if (hasCatch) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n }\n\n } else if (hasFinally) {\n if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else {\n throw new Error(\"try statement without catch or finally\");\n }\n }\n }\n },\n\n abrupt: function(type, arg) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc <= this.prev &&\n hasOwn.call(entry, \"finallyLoc\") &&\n this.prev < entry.finallyLoc) {\n var finallyEntry = entry;\n break;\n }\n }\n\n if (finallyEntry &&\n (type === \"break\" ||\n type === \"continue\") &&\n finallyEntry.tryLoc <= arg &&\n arg <= finallyEntry.finallyLoc) {\n // Ignore the finally entry if control is not jumping to a\n // location outside the try/catch block.\n finallyEntry = null;\n }\n\n var record = finallyEntry ? finallyEntry.completion : {};\n record.type = type;\n record.arg = arg;\n\n if (finallyEntry) {\n this.method = \"next\";\n this.next = finallyEntry.finallyLoc;\n return ContinueSentinel;\n }\n\n return this.complete(record);\n },\n\n complete: function(record, afterLoc) {\n if (record.type === \"throw\") {\n throw record.arg;\n }\n\n if (record.type === \"break\" ||\n record.type === \"continue\") {\n this.next = record.arg;\n } else if (record.type === \"return\") {\n this.rval = this.arg = record.arg;\n this.method = \"return\";\n this.next = \"end\";\n } else if (record.type === \"normal\" && afterLoc) {\n this.next = afterLoc;\n }\n\n return ContinueSentinel;\n },\n\n finish: function(finallyLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.finallyLoc === finallyLoc) {\n this.complete(entry.completion, entry.afterLoc);\n resetTryEntry(entry);\n return ContinueSentinel;\n }\n }\n },\n\n \"catch\": function(tryLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc === tryLoc) {\n var record = entry.completion;\n if (record.type === \"throw\") {\n var thrown = record.arg;\n resetTryEntry(entry);\n }\n return thrown;\n }\n }\n\n // The context.catch method must only be called with a location\n // argument that corresponds to a known catch block.\n throw new Error(\"illegal catch attempt\");\n },\n\n delegateYield: function(iterable, resultName, nextLoc) {\n this.delegate = {\n iterator: values(iterable),\n resultName: resultName,\n nextLoc: nextLoc\n };\n\n if (this.method === \"next\") {\n // Deliberately forget the last sent value so that we don't\n // accidentally pass it on to the delegate.\n this.arg = undefined;\n }\n\n return ContinueSentinel;\n }\n };\n})(\n // Among the various tricks for obtaining a reference to the global\n // object, this seems to be the most reliable technique that does not\n // use indirect eval (which violates Content Security Policy).\n typeof global === \"object\" ? global :\n typeof window === \"object\" ? window :\n typeof self === \"object\" ? self : this\n);\n"],"sourceRoot":"/source/"}
