Linux iad1-shared-b7-18 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
Apache
: 67.205.6.31 | : 216.73.216.47
Cant Read [ /etc/named.conf ]
8.2.29
fernandoquevedo
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
share /
javascript /
source-map /
[ HOME SHELL ]
Name
Size
Permission
Action
source-map.debug.js
269.9
KB
-rw-r--r--
source-map.js
110.31
KB
-rw-r--r--
source-map.min.js
27.52
KB
-rw-r--r--
source-map.min.js.map
141.15
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : source-map.min.js.map
{"version":3,"sources":["webpack://sourceMap/webpack/universalModuleDefinition","webpack://sourceMap/webpack/bootstrap","webpack://sourceMap/./lib/array-set.js","webpack://sourceMap/./lib/base64-vlq.js","webpack://sourceMap/./lib/base64.js","webpack://sourceMap/./lib/binary-search.js","webpack://sourceMap/./lib/mapping-list.js","webpack://sourceMap/./lib/quick-sort.js","webpack://sourceMap/./lib/source-map-consumer.js","webpack://sourceMap/./lib/source-map-generator.js","webpack://sourceMap/./lib/source-node.js","webpack://sourceMap/./lib/util.js","webpack://sourceMap/./source-map.js"],"names":["root","factory","exports","module","define","amd","this","installedModules","__webpack_require__","moduleId","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","util","has","hasNativeMap","Map","ArraySet","_array","_set","fromArray","aArray","aAllowDuplicates","set","len","length","add","size","getOwnPropertyNames","aStr","sStr","toSetString","isDuplicate","idx","push","indexOf","Error","at","aIdx","toArray","slice","base64","encode","aValue","digit","encoded","vlq","toVLQSigned","VLQ_BASE","decode","aIndex","aOutParam","continuation","shifted","strLen","result","shift","charCodeAt","charAt","rest","intToCharMap","split","number","TypeError","charCode","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","search","aNeedle","aHaystack","aCompare","aBias","index","recursiveSearch","aLow","aHigh","mid","Math","floor","cmp","MappingList","_sorted","_last","generatedLine","generatedColumn","unsortedForEach","aCallback","aThisArg","forEach","aMapping","mappingA","mappingB","lineA","lineB","columnA","columnB","compareByGeneratedPositionsInflated","sort","swap","ary","x","y","temp","doQuickSort","comparator","low","high","round","random","pivot","j","q","quickSort","binarySearch","base64VLQ","SourceMapConsumer","aSourceMap","aSourceMapURL","sourceMap","parseSourceMapInput","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","version","getArg","sources","names","sourceRoot","sourcesContent","mappings","file","_version","normalize","map","String","source","isAbsolute","relative","_names","_sources","_absoluteSources","computeSourceURL","_mappings","_sourceMapURL","Mapping","originalLine","originalColumn","lastOffset","line","column","_sections","url","offset","offsetLine","offsetColumn","generatedOffset","consumer","fromSourceMap","__generatedMappings","configurable","_parseMappings","__originalMappings","_charIsMappingSeparator","aSourceRoot","GENERATED_ORDER","ORIGINAL_ORDER","eachMapping","aContext","aOrder","context","_generatedMappings","_originalMappings","mapping","allGeneratedPositionsFor","aArgs","needle","_findSourceIndex","_findMapping","compareByOriginalPositions","undefined","lastColumn","aSource","relativeSource","smc","_sourceRoot","_generateSourcesContent","_file","generatedMappings","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","str","segment","end","previousGeneratedColumn","previousOriginalLine","previousOriginalColumn","previousSource","previousName","cachedSegments","originalMappings","compareByGeneratedPositionsDeflated","aMappings","aLineName","aColumnName","aComparator","computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","originalPositionFor","hasContentsOfAllSources","some","sc","sourceContentFor","nullOnMissing","urlParse","fileUriAbsPath","replace","scheme","path","generatedPositionFor","constructor","sectionIndex","section","bias","every","content","generatedPosition","sectionMappings","adjustedMapping","SourceMapGenerator","_skipValidation","_sourcesContents","aSourceMapConsumer","generator","newMapping","generated","original","addMapping","sourceFile","sourceRelative","setSourceContent","_validateMapping","aSourceFile","aSourceContent","keys","applySourceMap","aSourceMapPath","newSources","newNames","join","aGenerated","aOriginal","aName","JSON","stringify","_serializeMappings","next","nameIdx","sourceIdx","previousGeneratedLine","aSources","toJSON","toString","REGEX_NEWLINE","isSourceNode","SourceNode","aLine","aColumn","aChunks","children","sourceContents","fromStringWithSourceMap","aGeneratedCode","aRelativePath","node","remainingLines","remainingLinesIndex","shiftNextLine","getNextLine","lastGeneratedLine","lastMapping","code","nextLine","substr","addMappingWithCode","splice","aChunk","Array","isArray","chunk","prepend","unshift","walk","aFn","aSep","newChildren","replaceRight","aPattern","aReplacement","lastChild","walkSourceContents","fromSetString","toStringWithSourceMap","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","sourceContent","aDefaultValue","arguments","urlRegexp","dataUrlRegexp","aUrl","match","auth","host","port","urlGenerate","aParsedUrl","aPath","part","parts","up","aRoot","aPathUrl","aRootUrl","joined","test","level","lastIndexOf","supportsNullProto","identity","isProtoString","strcmp","aStr1","aStr2","onlyCompareOriginal","onlyCompareGenerated","parse","sourceURL","sourceMapURL","parsed","substring"],"mappings":"CAAA,SAAAA,EAAAC,GACA,iBAAAC,SAAA,iBAAAC,OACAA,OAAAD,QAAAD,IACA,mBAAAG,eAAAC,IACAD,OAAA,GAAAH,GACA,iBAAAC,QACAA,QAAA,UAAAD,IAEAD,EAAA,UAAAC,IARA,CASCK,KAAA,WACD,mBCTA,IAAAC,EAAA,GAGA,SAAAC,EAAAC,GAGA,GAAAF,EAAAE,GACA,OAAAF,EAAAE,GAAAP,QAGA,IAAAC,EAAAI,EAAAE,GAAA,CACAC,EAAAD,EACAE,GAAA,EACAT,QAAA,IAUA,OANAU,EAAAH,GAAAI,KAAAV,EAAAD,QAAAC,IAAAD,QAAAM,GAGAL,EAAAQ,GAAA,EAGAR,EAAAD,QA0DA,OArDAM,EAAAM,EAAAF,EAGAJ,EAAAO,EAAAR,EAGAC,EAAAQ,EAAA,SAAAd,EAAAe,EAAAC,GACAV,EAAAW,EAAAjB,EAAAe,IACAG,OAAAC,eAAAnB,EAAAe,EAAA,CAA0CK,YAAA,EAAAC,IAAAL,KAK1CV,EAAAgB,EAAA,SAAAtB,GACA,oBAAAuB,eAAAC,aACAN,OAAAC,eAAAnB,EAAAuB,OAAAC,YAAA,CAAwDC,MAAA,WAExDP,OAAAC,eAAAnB,EAAA,cAAiDyB,OAAA,KAQjDnB,EAAAoB,EAAA,SAAAD,EAAAE,GAEA,GADA,EAAAA,IAAAF,EAAAnB,EAAAmB,IACA,EAAAE,EAAA,OAAAF,EACA,KAAAE,GAAA,iBAAAF,QAAAG,WAAA,OAAAH,EACA,IAAAI,EAAAX,OAAAY,OAAA,MAGA,GAFAxB,EAAAgB,EAAAO,GACAX,OAAAC,eAAAU,EAAA,WAAyCT,YAAA,EAAAK,UACzC,EAAAE,GAAA,iBAAAF,EAAA,QAAAM,KAAAN,EAAAnB,EAAAQ,EAAAe,EAAAE,EAAA,SAAAA,GAAgH,OAAAN,EAAAM,IAAqBC,KAAA,KAAAD,IACrI,OAAAF,GAIAvB,EAAA2B,EAAA,SAAAhC,GACA,IAAAe,EAAAf,KAAA2B,WACA,WAA2B,OAAA3B,EAAA,SAC3B,WAAiC,OAAAA,GAEjC,OADAK,EAAAQ,EAAAE,EAAA,IAAAA,GACAA,GAIAV,EAAAW,EAAA,SAAAiB,EAAAC,GAAsD,OAAAjB,OAAAkB,UAAAC,eAAA1B,KAAAuB,EAAAC,IAGtD7B,EAAAgC,EAAA,GAIAhC,IAAAiC,EAAA,0DC3EA,IAAAC,EAAWlC,EAAQ,iBACnBmC,EAAAvB,OAAAkB,UAAAC,eACAK,EAAA,oBAAAC,IAQA,SAAAC,IACAxC,KAAAyC,OAAA,GACAzC,KAAA0C,KAAAJ,EAAA,IAAAC,IAAAzB,OAAAY,OAAA,MAMAc,EAAAG,UAAA,SAAAC,EAAAC,GAEA,IADA,IAAAC,EAAA,IAAAN,EACApC,EAAA,EAAA2C,EAAAH,EAAAI,OAAsC5C,EAAA2C,EAAS3C,IAC/C0C,EAAAG,IAAAL,EAAAxC,GAAAyC,GAEA,OAAAC,GASAN,EAAAR,UAAAkB,KAAA,WACA,OAAAZ,EAAAtC,KAAA0C,KAAAQ,KAAApC,OAAAqC,oBAAAnD,KAAA0C,MAAAM,QAQAR,EAAAR,UAAAiB,IAAA,SAAAG,EAAAP,GACA,IAAAQ,EAAAf,EAAAc,EAAAhB,EAAAkB,YAAAF,GACAG,EAAAjB,EAAAtC,KAAAqC,IAAAe,GAAAf,EAAA9B,KAAAP,KAAA0C,KAAAW,GACAG,EAAAxD,KAAAyC,OAAAO,OACAO,IAAAV,GACA7C,KAAAyC,OAAAgB,KAAAL,GAEAG,IACAjB,EACAtC,KAAA0C,KAAAI,IAAAM,EAAAI,GAEAxD,KAAA0C,KAAAW,GAAAG,IAUAhB,EAAAR,UAAAK,IAAA,SAAAe,GACA,GAAAd,EACA,OAAAtC,KAAA0C,KAAAL,IAAAe,GAEA,IAAAC,EAAAjB,EAAAkB,YAAAF,GACA,OAAAf,EAAA9B,KAAAP,KAAA0C,KAAAW,IASAb,EAAAR,UAAA0B,QAAA,SAAAN,GACA,GAAAd,EAAA,CACA,IAAAkB,EAAAxD,KAAA0C,KAAAzB,IAAAmC,GACA,GAAAI,GAAA,EACA,OAAAA,MAEG,CACH,IAAAH,EAAAjB,EAAAkB,YAAAF,GACA,GAAAf,EAAA9B,KAAAP,KAAA0C,KAAAW,GACA,OAAArD,KAAA0C,KAAAW,GAIA,UAAAM,MAAA,IAAAP,EAAA,yBAQAZ,EAAAR,UAAA4B,GAAA,SAAAC,GACA,GAAAA,GAAA,GAAAA,EAAA7D,KAAAyC,OAAAO,OACA,OAAAhD,KAAAyC,OAAAoB,GAEA,UAAAF,MAAA,yBAAAE,IAQArB,EAAAR,UAAA8B,QAAA,WACA,OAAA9D,KAAAyC,OAAAsB,SAGAnE,EAAA4C,kDCnFA,IAAAwB,EAAa9D,EAAQ,mBAsDrBN,EAAAqE,OAAA,SAAAC,GACA,IACAC,EADAC,EAAA,GAGAC,EA3BA,SAAAH,GACA,OAAAA,EAAA,EACA,IAAAA,GAAA,GACA,GAAAA,GAAA,GAwBAI,CAAAJ,GAEA,GACAC,EAzCAI,GAyCAF,GACAA,KAhDA,GAiDA,IAGAF,GAjDA,IAmDAC,GAAAJ,EAAAC,OAAAE,SACGE,EAAA,GAEH,OAAAD,GAOAxE,EAAA4E,OAAA,SAAApB,EAAAqB,EAAAC,GACA,IAGAC,EAAAR,EAvCAD,EAEAU,EAkCAC,EAAAzB,EAAAJ,OACA8B,EAAA,EACAC,EAAA,EAGA,GACA,GAAAN,GAAAI,EACA,UAAAlB,MAAA,8CAIA,SADAQ,EAAAH,EAAAQ,OAAApB,EAAA4B,WAAAP,OAEA,UAAAd,MAAA,yBAAAP,EAAA6B,OAAAR,EAAA,IAGAE,KA7EA,GA6EAR,GAEAW,IADAX,GA3EAI,KA4EAQ,EACAA,GAnFA,QAoFGJ,GAEHD,EAAArD,OAvDAuD,GAFAV,EAyDAY,IAvDA,EADA,MAAAZ,IAGAU,EACAA,GAqDAF,EAAAQ,KAAAT,oCCnIA,IAAAU,EAAA,mEAAAC,MAAA,IAKAxF,EAAAqE,OAAA,SAAAoB,GACA,MAAAA,KAAAF,EAAAnC,OACA,OAAAmC,EAAAE,GAEA,UAAAC,UAAA,6BAAAD,IAOAzF,EAAA4E,OAAA,SAAAe,GAiBA,OAhBA,IAgBAA,MAfA,GAgBAA,EAjBA,GAGA,IAkBAA,MAjBA,IAkBAA,EAnBA,GASA,GANA,IAoBAA,MAnBA,GAoBAA,EArBA,GAOA,GAJA,IAsBAA,EACA,GAtBA,IA0BAA,EACA,IAIA,2CC1DA3F,EAAA4F,qBAAA,EACA5F,EAAA6F,kBAAA,EAgFA7F,EAAA8F,OAAA,SAAAC,EAAAC,EAAAC,EAAAC,GACA,OAAAF,EAAA5C,OACA,SAGA,IAAA+C,EAtEA,SAAAC,EAAAC,EAAAC,EAAAP,EAAAC,EAAAC,EAAAC,GAUA,IAAAK,EAAAC,KAAAC,OAAAH,EAAAD,GAAA,GAAAA,EACAK,EAAAT,EAAAF,EAAAC,EAAAO,IAAA,GACA,WAAAG,EAEAH,EAEAG,EAAA,EAEAJ,EAAAC,EAAA,EAEAH,EAAAG,EAAAD,EAAAP,EAAAC,EAAAC,EAAAC,GAKAA,GAAAlG,EAAA6F,kBACAS,EAAAN,EAAA5C,OAAAkD,GAAA,EAEAC,EAKAA,EAAAF,EAAA,EAEAD,EAAAC,EAAAE,EAAAR,EAAAC,EAAAC,EAAAC,GAIAA,GAAAlG,EAAA6F,kBACAU,EAEAF,EAAA,KAAAA,EA4BAD,EAAA,EAAAJ,EAAA5C,OAAA2C,EAAAC,EACAC,EAAAC,GAAAlG,EAAA4F,sBACA,GAAAO,EAAA,EACA,SAMA,KAAAA,EAAA,MACA,IAAAF,EAAAD,EAAAG,GAAAH,EAAAG,EAAA,UAGAA,EAGA,OAAAA,4CCtGA,IAAA3D,EAAWlC,EAAQ,iBAqBnB,SAAAqG,IACAvG,KAAAyC,OAAA,GACAzC,KAAAwG,SAAA,EAEAxG,KAAAyG,MAAA,CAAgBC,eAAA,EAAAC,gBAAA,GAShBJ,EAAAvE,UAAA4E,gBACA,SAAAC,EAAAC,GACA9G,KAAAyC,OAAAsE,QAAAF,EAAAC,IAQAP,EAAAvE,UAAAiB,IAAA,SAAA+D,GAtCA,IAAAC,EAAAC,EAEAC,EACAC,EACAC,EACAC,EALAL,EAuCAjH,KAAAyG,MAvCAS,EAuCAF,EArCAG,EAAAF,EAAAP,cACAU,EAAAF,EAAAR,cACAW,EAAAJ,EAAAN,gBACAW,EAAAJ,EAAAP,gBACAS,EAAAD,GAAAC,GAAAD,GAAAG,GAAAD,GACAjF,EAAAmF,oCAAAN,EAAAC,IAAA,GAiCAlH,KAAAyG,MAAAO,EACAhH,KAAAyC,OAAAgB,KAAAuD,KAEAhH,KAAAwG,SAAA,EACAxG,KAAAyC,OAAAgB,KAAAuD,KAaAT,EAAAvE,UAAA8B,QAAA,WAKA,OAJA9D,KAAAwG,UACAxG,KAAAyC,OAAA+E,KAAApF,EAAAmF,qCACAvH,KAAAwG,SAAA,GAEAxG,KAAAyC,QAGA7C,EAAA2G,mDCnDA,SAAAkB,EAAAC,EAAAC,EAAAC,GACA,IAAAC,EAAAH,EAAAC,GACAD,EAAAC,GAAAD,EAAAE,GACAF,EAAAE,GAAAC,EA2BA,SAAAC,EAAAJ,EAAAK,EAAA7F,EAAAhB,GAKA,GAAAgB,EAAAhB,EAAA,CAYA,IACAd,EAAA8B,EAAA,EAEAuF,EAAAC,GApCAM,EAiCA9F,EAjCA+F,EAiCA/G,EAhCAkF,KAAA8B,MAAAF,EAAA5B,KAAA+B,UAAAF,EAAAD,KAmCA9G,GASA,IARA,IAAAkH,EAAAV,EAAAxG,GAQAmH,EAAAnG,EAAmBmG,EAAAnH,EAAOmH,IAC1BN,EAAAL,EAAAW,GAAAD,IAAA,GAEAX,EAAAC,EADAtH,GAAA,EACAiI,GAIAZ,EAAAC,EAAAtH,EAAA,EAAAiI,GACA,IAAAC,EAAAlI,EAAA,EAIA0H,EAAAJ,EAAAK,EAAA7F,EAAAoG,EAAA,GACAR,EAAAJ,EAAAK,EAAAO,EAAA,EAAApH,GA1DA,IAAA8G,EAAAC,EAsEArI,EAAA2I,UAAA,SAAAb,EAAAK,GACAD,EAAAJ,EAAAK,EAAA,EAAAL,EAAA1E,OAAA,oDCzGA,IAAAZ,EAAWlC,EAAQ,iBACnBsI,EAAmBtI,EAAQ,0BAC3BsC,EAAetC,EAAQ,sBAAasC,SACpCiG,EAAgBvI,EAAQ,uBACxBqI,EAAgBrI,EAAQ,uBAAcqI,UAEtC,SAAAG,EAAAC,EAAAC,GACA,IAAAC,EAAAF,EAKA,MAJA,iBAAAA,IACAE,EAAAzG,EAAA0G,oBAAAH,IAGA,MAAAE,EAAAE,SACA,IAAAC,EAAAH,EAAAD,GACA,IAAAK,EAAAJ,EAAAD,GA0QA,SAAAK,EAAAN,EAAAC,GACA,IAAAC,EAAAF,EACA,iBAAAA,IACAE,EAAAzG,EAAA0G,oBAAAH,IAGA,IAAAO,EAAA9G,EAAA+G,OAAAN,EAAA,WACAO,EAAAhH,EAAA+G,OAAAN,EAAA,WAGAQ,EAAAjH,EAAA+G,OAAAN,EAAA,YACAS,EAAAlH,EAAA+G,OAAAN,EAAA,mBACAU,EAAAnH,EAAA+G,OAAAN,EAAA,uBACAW,EAAApH,EAAA+G,OAAAN,EAAA,YACAY,EAAArH,EAAA+G,OAAAN,EAAA,aAIA,GAAAK,GAAAlJ,KAAA0J,SACA,UAAA/F,MAAA,wBAAAuF,GAGAI,IACAA,EAAAlH,EAAAuH,UAAAL,IAGAF,IACAQ,IAAAC,QAIAD,IAAAxH,EAAAuH,WAKAC,IAAA,SAAAE,GACA,OAAAR,GAAAlH,EAAA2H,WAAAT,IAAAlH,EAAA2H,WAAAD,GACA1H,EAAA4H,SAAAV,EAAAQ,GACAA,IAOA9J,KAAAiK,OAAAzH,EAAAG,UAAA0G,EAAAO,IAAAC,SAAA,GACA7J,KAAAkK,SAAA1H,EAAAG,UAAAyG,GAAA,GAEApJ,KAAAmK,iBAAAnK,KAAAkK,SAAApG,UAAA8F,IAAA,SAAAzH,GACA,OAAAC,EAAAgI,iBAAAd,EAAAnH,EAAAyG,KAGA5I,KAAAsJ,aACAtJ,KAAAuJ,iBACAvJ,KAAAqK,UAAAb,EACAxJ,KAAAsK,cAAA1B,EACA5I,KAAAyJ,OA4GA,SAAAc,IACAvK,KAAA0G,cAAA,EACA1G,KAAA2G,gBAAA,EACA3G,KAAA8J,OAAA,KACA9J,KAAAwK,aAAA,KACAxK,KAAAyK,eAAA,KACAzK,KAAAW,KAAA,KAkaA,SAAAqI,EAAAL,EAAAC,GACA,IAAAC,EAAAF,EACA,iBAAAA,IACAE,EAAAzG,EAAA0G,oBAAAH,IAGA,IAAAO,EAAA9G,EAAA+G,OAAAN,EAAA,WACAE,EAAA3G,EAAA+G,OAAAN,EAAA,YAEA,GAAAK,GAAAlJ,KAAA0J,SACA,UAAA/F,MAAA,wBAAAuF,GAGAlJ,KAAAkK,SAAA,IAAA1H,EACAxC,KAAAiK,OAAA,IAAAzH,EAEA,IAAAkI,EAAA,CACAC,MAAA,EACAC,OAAA,GAEA5K,KAAA6K,UAAA9B,EAAAa,IAAA,SAAAzH,GACA,GAAAA,EAAA2I,IAGA,UAAAnH,MAAA,sDAEA,IAAAoH,EAAA3I,EAAA+G,OAAAhH,EAAA,UACA6I,EAAA5I,EAAA+G,OAAA4B,EAAA,QACAE,EAAA7I,EAAA+G,OAAA4B,EAAA,UAEA,GAAAC,EAAAN,EAAAC,MACAK,IAAAN,EAAAC,MAAAM,EAAAP,EAAAE,OACA,UAAAjH,MAAA,wDAIA,OAFA+G,EAAAK,EAEA,CACAG,gBAAA,CAGAxE,cAAAsE,EAAA,EACArE,gBAAAsE,EAAA,GAEAE,SAAA,IAAAzC,EAAAtG,EAAA+G,OAAAhH,EAAA,OAAAyG,MA/3BAF,EAAA0C,cAAA,SAAAzC,EAAAC,GACA,OAAAK,EAAAmC,cAAAzC,EAAAC,IAMAF,EAAA1G,UAAA0H,SAAA,EAgCAhB,EAAA1G,UAAAqJ,oBAAA,KACAvK,OAAAC,eAAA2H,EAAA1G,UAAA,sBACAsJ,cAAA,EACAtK,YAAA,EACAC,IAAA,WAKA,OAJAjB,KAAAqL,qBACArL,KAAAuL,eAAAvL,KAAAqK,UAAArK,KAAAsJ,YAGAtJ,KAAAqL,uBAIA3C,EAAA1G,UAAAwJ,mBAAA,KACA1K,OAAAC,eAAA2H,EAAA1G,UAAA,qBACAsJ,cAAA,EACAtK,YAAA,EACAC,IAAA,WAKA,OAJAjB,KAAAwL,oBACAxL,KAAAuL,eAAAvL,KAAAqK,UAAArK,KAAAsJ,YAGAtJ,KAAAwL,sBAIA9C,EAAA1G,UAAAyJ,wBACA,SAAArI,EAAA2C,GACA,IAAAtF,EAAA2C,EAAA6B,OAAAc,GACA,YAAAtF,GAAmB,MAAAA,GAQnBiI,EAAA1G,UAAAuJ,eACA,SAAAnI,EAAAsI,GACA,UAAA/H,MAAA,6CAGA+E,EAAAiD,gBAAA,EACAjD,EAAAkD,eAAA,EAEAlD,EAAAlD,qBAAA,EACAkD,EAAAjD,kBAAA,EAkBAiD,EAAA1G,UAAA6J,YACA,SAAAhF,EAAAiF,EAAAC,GACA,IAGAvC,EAHAwC,EAAAF,GAAA,KAIA,OAHAC,GAAArD,EAAAiD,iBAIA,KAAAjD,EAAAiD,gBACAnC,EAAAxJ,KAAAiM,mBACA,MACA,KAAAvD,EAAAkD,eACApC,EAAAxJ,KAAAkM,kBACA,MACA,QACA,UAAAvI,MAAA,+BAGA,IAAA2F,EAAAtJ,KAAAsJ,WACAE,EAAAI,IAAA,SAAAuC,GACA,IAAArC,EAAA,OAAAqC,EAAArC,OAAA,KAAA9J,KAAAkK,SAAAtG,GAAAuI,EAAArC,QAEA,OACAA,OAFAA,EAAA1H,EAAAgI,iBAAAd,EAAAQ,EAAA9J,KAAAsK,eAGA5D,cAAAyF,EAAAzF,cACAC,gBAAAwF,EAAAxF,gBACA6D,aAAA2B,EAAA3B,aACAC,eAAA0B,EAAA1B,eACA9J,KAAA,OAAAwL,EAAAxL,KAAA,KAAAX,KAAAiK,OAAArG,GAAAuI,EAAAxL,QAEKX,MAAA+G,QAAAF,EAAAmF,IAyBLtD,EAAA1G,UAAAoK,yBACA,SAAAC,GACA,IAAA1B,EAAAvI,EAAA+G,OAAAkD,EAAA,QAMAC,EAAA,CACAxC,OAAA1H,EAAA+G,OAAAkD,EAAA,UACA7B,aAAAG,EACAF,eAAArI,EAAA+G,OAAAkD,EAAA,aAIA,GADAC,EAAAxC,OAAA9J,KAAAuM,iBAAAD,EAAAxC,QACAwC,EAAAxC,OAAA,EACA,SAGA,IAAAN,EAAA,GAEAzD,EAAA/F,KAAAwM,aAAAF,EACAtM,KAAAkM,kBACA,eACA,iBACA9J,EAAAqK,2BACAjE,EAAA/C,mBACA,GAAAM,GAAA,GACA,IAAAoG,EAAAnM,KAAAkM,kBAAAnG,GAEA,QAAA2G,IAAAL,EAAAzB,OAOA,IANA,IAAAJ,EAAA2B,EAAA3B,aAMA2B,KAAA3B,kBACAhB,EAAA/F,KAAA,CACAkH,KAAAvI,EAAA+G,OAAAgD,EAAA,sBACAvB,OAAAxI,EAAA+G,OAAAgD,EAAA,wBACAQ,WAAAvK,EAAA+G,OAAAgD,EAAA,8BAGAA,EAAAnM,KAAAkM,oBAAAnG,QASA,IANA,IAAA0E,EAAA0B,EAAA1B,eAMA0B,GACAA,EAAA3B,eAAAG,GACAwB,EAAA1B,mBACAjB,EAAA/F,KAAA,CACAkH,KAAAvI,EAAA+G,OAAAgD,EAAA,sBACAvB,OAAAxI,EAAA+G,OAAAgD,EAAA,wBACAQ,WAAAvK,EAAA+G,OAAAgD,EAAA,8BAGAA,EAAAnM,KAAAkM,oBAAAnG,GAKA,OAAAyD,GAGA5J,EAAA8I,oBAgGAO,EAAAjH,UAAAlB,OAAAY,OAAAgH,EAAA1G,WACAiH,EAAAjH,UAAAmJ,SAAAzC,EAMAO,EAAAjH,UAAAuK,iBAAA,SAAAK,GACA,IAWAxM,EAXAyM,EAAAD,EAKA,GAJA,MAAA5M,KAAAsJ,aACAuD,EAAAzK,EAAA4H,SAAAhK,KAAAsJ,WAAAuD,IAGA7M,KAAAkK,SAAA7H,IAAAwK,GACA,OAAA7M,KAAAkK,SAAAxG,QAAAmJ,GAMA,IAAAzM,EAAA,EAAaA,EAAAJ,KAAAmK,iBAAAnH,SAAkC5C,EAC/C,GAAAJ,KAAAmK,iBAAA/J,IAAAwM,EACA,OAAAxM,EAIA,UAYA6I,EAAAmC,cACA,SAAAzC,EAAAC,GACA,IAAAkE,EAAAhM,OAAAY,OAAAuH,EAAAjH,WAEAqH,EAAAyD,EAAA7C,OAAAzH,EAAAG,UAAAgG,EAAAsB,OAAAnG,WAAA,GACAsF,EAAA0D,EAAA5C,SAAA1H,EAAAG,UAAAgG,EAAAuB,SAAApG,WAAA,GACAgJ,EAAAxD,WAAAX,EAAAoE,YACAD,EAAAvD,eAAAZ,EAAAqE,wBAAAF,EAAA5C,SAAApG,UACAgJ,EAAAxD,YACAwD,EAAArD,KAAAd,EAAAsE,MACAH,EAAAxC,cAAA1B,EACAkE,EAAA3C,iBAAA2C,EAAA5C,SAAApG,UAAA8F,IAAA,SAAAzH,GACA,OAAAC,EAAAgI,iBAAA0C,EAAAxD,WAAAnH,EAAAyG,KAYA,IAJA,IAAAsE,EAAAvE,EAAA0B,UAAAvG,UAAAC,QACAoJ,EAAAL,EAAAzB,oBAAA,GACA+B,EAAAN,EAAAtB,mBAAA,GAEApL,EAAA,EAAA4C,EAAAkK,EAAAlK,OAAsD5C,EAAA4C,EAAY5C,IAAA,CAClE,IAAAiN,EAAAH,EAAA9M,GACAkN,EAAA,IAAA/C,EACA+C,EAAA5G,cAAA2G,EAAA3G,cACA4G,EAAA3G,gBAAA0G,EAAA1G,gBAEA0G,EAAAvD,SACAwD,EAAAxD,OAAAV,EAAA1F,QAAA2J,EAAAvD,QACAwD,EAAA9C,aAAA6C,EAAA7C,aACA8C,EAAA7C,eAAA4C,EAAA5C,eAEA4C,EAAA1M,OACA2M,EAAA3M,KAAA0I,EAAA3F,QAAA2J,EAAA1M,OAGAyM,EAAA3J,KAAA6J,IAGAH,EAAA1J,KAAA6J,GAKA,OAFA/E,EAAAuE,EAAAtB,mBAAApJ,EAAAqK,4BAEAK,GAMA7D,EAAAjH,UAAA0H,SAAA,EAKA5I,OAAAC,eAAAkI,EAAAjH,UAAA,WACAf,IAAA,WACA,OAAAjB,KAAAmK,iBAAApG,WAqBAkF,EAAAjH,UAAAuJ,eACA,SAAAnI,EAAAsI,GAeA,IAdA,IAYAS,EAAAoB,EAAAC,EAAAC,EAAApM,EAZAqF,EAAA,EACAgH,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACA9K,EAAAI,EAAAJ,OACA+C,EAAA,EACAgI,EAAA,GACAlG,EAAA,GACAmG,EAAA,GACAd,EAAA,GAGAnH,EAAA/C,GACA,SAAAI,EAAA6B,OAAAc,GACAW,IACAX,IACA2H,EAAA,OAEA,SAAAtK,EAAA6B,OAAAc,GACAA,QAEA,CASA,KARAoG,EAAA,IAAA5B,GACA7D,gBAOA+G,EAAA1H,EAAyB0H,EAAAzK,IACzBhD,KAAAyL,wBAAArI,EAAAqK,GADuCA,KAQvC,GADAD,EAAAO,EAFAR,EAAAnK,EAAAW,MAAAgC,EAAA0H,IAIA1H,GAAAwH,EAAAvK,WACS,CAET,IADAwK,EAAA,GACAzH,EAAA0H,GACAhF,EAAAjE,OAAApB,EAAA2C,EAAA8B,GACAxG,EAAAwG,EAAAxG,MACA0E,EAAA8B,EAAA3C,KACAsI,EAAA/J,KAAApC,GAGA,OAAAmM,EAAAxK,OACA,UAAAW,MAAA,0CAGA,OAAA6J,EAAAxK,OACA,UAAAW,MAAA,0CAGAoK,EAAAR,GAAAC,EAIArB,EAAAxF,gBAAA+G,EAAAF,EAAA,GACAE,EAAAvB,EAAAxF,gBAEA6G,EAAAxK,OAAA,IAEAmJ,EAAArC,OAAA+D,EAAAL,EAAA,GACAK,GAAAL,EAAA,GAGArB,EAAA3B,aAAAmD,EAAAH,EAAA,GACAG,EAAAxB,EAAA3B,aAEA2B,EAAA3B,cAAA,EAGA2B,EAAA1B,eAAAmD,EAAAJ,EAAA,GACAI,EAAAzB,EAAA1B,eAEA+C,EAAAxK,OAAA,IAEAmJ,EAAAxL,KAAAmN,EAAAN,EAAA,GACAM,GAAAN,EAAA,KAIAN,EAAAzJ,KAAA0I,GACA,iBAAAA,EAAA3B,cACAwD,EAAAvK,KAAA0I,GAKA5D,EAAA2E,EAAA9K,EAAA6L,qCACAjO,KAAAqL,oBAAA6B,EAEA3E,EAAAyF,EAAA5L,EAAAqK,4BACAzM,KAAAwL,mBAAAwC,GAOA/E,EAAAjH,UAAAwK,aACA,SAAA7G,EAAAuI,EAAAC,EACAC,EAAAC,EAAAvI,GAMA,GAAAH,EAAAwI,IAAA,EACA,UAAA7I,UAAA,gDACAK,EAAAwI,IAEA,GAAAxI,EAAAyI,GAAA,EACA,UAAA9I,UAAA,kDACAK,EAAAyI,IAGA,OAAA5F,EAAA9C,OAAAC,EAAAuI,EAAAG,EAAAvI,IAOAmD,EAAAjH,UAAAsM,mBACA,WACA,QAAAvI,EAAA,EAAuBA,EAAA/F,KAAAiM,mBAAAjJ,SAAwC+C,EAAA,CAC/D,IAAAoG,EAAAnM,KAAAiM,mBAAAlG,GAMA,GAAAA,EAAA,EAAA/F,KAAAiM,mBAAAjJ,OAAA,CACA,IAAAuL,EAAAvO,KAAAiM,mBAAAlG,EAAA,GAEA,GAAAoG,EAAAzF,gBAAA6H,EAAA7H,cAAA,CACAyF,EAAAqC,oBAAAD,EAAA5H,gBAAA,EACA,UAKAwF,EAAAqC,oBAAAC,MA4BAxF,EAAAjH,UAAA0M,oBACA,SAAArC,GACA,IAAAC,EAAA,CACA5F,cAAAtE,EAAA+G,OAAAkD,EAAA,QACA1F,gBAAAvE,EAAA+G,OAAAkD,EAAA,WAGAtG,EAAA/F,KAAAwM,aACAF,EACAtM,KAAAiM,mBACA,gBACA,kBACA7J,EAAA6L,oCACA7L,EAAA+G,OAAAkD,EAAA,OAAA3D,EAAAlD,uBAGA,GAAAO,GAAA,GACA,IAAAoG,EAAAnM,KAAAiM,mBAAAlG,GAEA,GAAAoG,EAAAzF,gBAAA4F,EAAA5F,cAAA,CACA,IAAAoD,EAAA1H,EAAA+G,OAAAgD,EAAA,eACA,OAAArC,IACAA,EAAA9J,KAAAkK,SAAAtG,GAAAkG,GACAA,EAAA1H,EAAAgI,iBAAApK,KAAAsJ,WAAAQ,EAAA9J,KAAAsK,gBAEA,IAAA3J,EAAAyB,EAAA+G,OAAAgD,EAAA,aAIA,OAHA,OAAAxL,IACAA,EAAAX,KAAAiK,OAAArG,GAAAjD,IAEA,CACAmJ,SACAa,KAAAvI,EAAA+G,OAAAgD,EAAA,qBACAvB,OAAAxI,EAAA+G,OAAAgD,EAAA,uBACAxL,SAKA,OACAmJ,OAAA,KACAa,KAAA,KACAC,OAAA,KACAjK,KAAA,OAQAsI,EAAAjH,UAAA2M,wBACA,WACA,QAAA3O,KAAAuJ,iBAGAvJ,KAAAuJ,eAAAvG,QAAAhD,KAAAkK,SAAAhH,SACAlD,KAAAuJ,eAAAqF,KAAA,SAAAC,GAA+C,aAAAA,MAQ/C5F,EAAAjH,UAAA8M,iBACA,SAAAlC,EAAAmC,GACA,IAAA/O,KAAAuJ,eACA,YAGA,IAAAxD,EAAA/F,KAAAuM,iBAAAK,GACA,GAAA7G,GAAA,EACA,OAAA/F,KAAAuJ,eAAAxD,GAGA,IAKA+E,EALA+B,EAAAD,EAMA,GALA,MAAA5M,KAAAsJ,aACAuD,EAAAzK,EAAA4H,SAAAhK,KAAAsJ,WAAAuD,IAIA,MAAA7M,KAAAsJ,aACAwB,EAAA1I,EAAA4M,SAAAhP,KAAAsJ,aAAA,CAKA,IAAA2F,EAAApC,EAAAqC,QAAA,iBACA,WAAApE,EAAAqE,QACAnP,KAAAkK,SAAA7H,IAAA4M,GACA,OAAAjP,KAAAuJ,eAAAvJ,KAAAkK,SAAAxG,QAAAuL,IAGA,KAAAnE,EAAAsE,MAAA,KAAAtE,EAAAsE,OACApP,KAAAkK,SAAA7H,IAAA,IAAAwK,GACA,OAAA7M,KAAAuJ,eAAAvJ,KAAAkK,SAAAxG,QAAA,IAAAmJ,IAQA,GAAAkC,EACA,YAGA,UAAApL,MAAA,IAAAkJ,EAAA,+BA2BA5D,EAAAjH,UAAAqN,qBACA,SAAAhD,GACA,IAAAvC,EAAA1H,EAAA+G,OAAAkD,EAAA,UAEA,IADAvC,EAAA9J,KAAAuM,iBAAAzC,IACA,EACA,OACAa,KAAA,KACAC,OAAA,KACA+B,WAAA,MAIA,IAAAL,EAAA,CACAxC,SACAU,aAAApI,EAAA+G,OAAAkD,EAAA,QACA5B,eAAArI,EAAA+G,OAAAkD,EAAA,WAGAtG,EAAA/F,KAAAwM,aACAF,EACAtM,KAAAkM,kBACA,eACA,iBACA9J,EAAAqK,2BACArK,EAAA+G,OAAAkD,EAAA,OAAA3D,EAAAlD,uBAGA,GAAAO,GAAA,GACA,IAAAoG,EAAAnM,KAAAkM,kBAAAnG,GAEA,GAAAoG,EAAArC,SAAAwC,EAAAxC,OACA,OACAa,KAAAvI,EAAA+G,OAAAgD,EAAA,sBACAvB,OAAAxI,EAAA+G,OAAAgD,EAAA,wBACAQ,WAAAvK,EAAA+G,OAAAgD,EAAA,6BAKA,OACAxB,KAAA,KACAC,OAAA,KACA+B,WAAA,OAIA/M,EAAAqJ,yBAmGAD,EAAAhH,UAAAlB,OAAAY,OAAAgH,EAAA1G,WACAgH,EAAAhH,UAAAsN,YAAA5G,EAKAM,EAAAhH,UAAA0H,SAAA,EAKA5I,OAAAC,eAAAiI,EAAAhH,UAAA,WACAf,IAAA,WAEA,IADA,IAAAmI,EAAA,GACAhJ,EAAA,EAAmBA,EAAAJ,KAAA6K,UAAA7H,OAA2B5C,IAC9C,QAAAiI,EAAA,EAAqBA,EAAArI,KAAA6K,UAAAzK,GAAA+K,SAAA/B,QAAApG,OAA+CqF,IACpEe,EAAA3F,KAAAzD,KAAA6K,UAAAzK,GAAA+K,SAAA/B,QAAAf,IAGA,OAAAe,KAuBAJ,EAAAhH,UAAA0M,oBACA,SAAArC,GACA,IAAAC,EAAA,CACA5F,cAAAtE,EAAA+G,OAAAkD,EAAA,QACA1F,gBAAAvE,EAAA+G,OAAAkD,EAAA,WAKAkD,EAAA/G,EAAA9C,OAAA4G,EAAAtM,KAAA6K,UACA,SAAAyB,EAAAkD,GACA,IAAAlJ,EAAAgG,EAAA5F,cAAA8I,EAAAtE,gBAAAxE,cACA,OAAAJ,GAIAgG,EAAA3F,gBACA6I,EAAAtE,gBAAAvE,kBAEA6I,EAAAxP,KAAA6K,UAAA0E,GAEA,OAAAC,EASAA,EAAArE,SAAAuD,oBAAA,CACA/D,KAAA2B,EAAA5F,eACA8I,EAAAtE,gBAAAxE,cAAA,GACAkE,OAAA0B,EAAA3F,iBACA6I,EAAAtE,gBAAAxE,gBAAA4F,EAAA5F,cACA8I,EAAAtE,gBAAAvE,gBAAA,EACA,GACA8I,KAAApD,EAAAoD,OAfA,CACA3F,OAAA,KACAa,KAAA,KACAC,OAAA,KACAjK,KAAA,OAmBAqI,EAAAhH,UAAA2M,wBACA,WACA,OAAA3O,KAAA6K,UAAA6E,MAAA,SAAAvN,GACA,OAAAA,EAAAgJ,SAAAwD,6BASA3F,EAAAhH,UAAA8M,iBACA,SAAAlC,EAAAmC,GACA,QAAA3O,EAAA,EAAmBA,EAAAJ,KAAA6K,UAAA7H,OAA2B5C,IAAA,CAC9C,IAEAuP,EAFA3P,KAAA6K,UAAAzK,GAEA+K,SAAA2D,iBAAAlC,GAAA,GACA,GAAA+C,EACA,OAAAA,EAGA,GAAAZ,EACA,YAGA,UAAApL,MAAA,IAAAiJ,EAAA,+BAsBA5D,EAAAhH,UAAAqN,qBACA,SAAAhD,GACA,QAAAjM,EAAA,EAAmBA,EAAAJ,KAAA6K,UAAA7H,OAA2B5C,IAAA,CAC9C,IAAAoP,EAAAxP,KAAA6K,UAAAzK,GAIA,QAAAoP,EAAArE,SAAAoB,iBAAAnK,EAAA+G,OAAAkD,EAAA,YAGA,IAAAuD,EAAAJ,EAAArE,SAAAkE,qBAAAhD,GACA,GAAAuD,EASA,MARA,CACAjF,KAAAiF,EAAAjF,MACA6E,EAAAtE,gBAAAxE,cAAA,GACAkE,OAAAgF,EAAAhF,QACA4E,EAAAtE,gBAAAxE,gBAAAkJ,EAAAjF,KACA6E,EAAAtE,gBAAAvE,gBAAA,EACA,KAMA,OACAgE,KAAA,KACAC,OAAA,OASA5B,EAAAhH,UAAAuJ,eACA,SAAAnI,EAAAsI,GACA1L,KAAAqL,oBAAA,GACArL,KAAAwL,mBAAA,GACA,QAAApL,EAAA,EAAmBA,EAAAJ,KAAA6K,UAAA7H,OAA2B5C,IAG9C,IAFA,IAAAoP,EAAAxP,KAAA6K,UAAAzK,GACAyP,EAAAL,EAAArE,SAAAc,mBACA5D,EAAA,EAAqBA,EAAAwH,EAAA7M,OAA4BqF,IAAA,CACjD,IAAA8D,EAAA0D,EAAAxH,GAEAyB,EAAA0F,EAAArE,SAAAjB,SAAAtG,GAAAuI,EAAArC,QACAA,EAAA1H,EAAAgI,iBAAAoF,EAAArE,SAAA7B,WAAAQ,EAAA9J,KAAAsK,eACAtK,KAAAkK,SAAAjH,IAAA6G,GACAA,EAAA9J,KAAAkK,SAAAxG,QAAAoG,GAEA,IAAAnJ,EAAA,KACAwL,EAAAxL,OACAA,EAAA6O,EAAArE,SAAAlB,OAAArG,GAAAuI,EAAAxL,MACAX,KAAAiK,OAAAhH,IAAAtC,GACAA,EAAAX,KAAAiK,OAAAvG,QAAA/C,IAOA,IAAAmP,EAAA,CACAhG,SACApD,cAAAyF,EAAAzF,eACA8I,EAAAtE,gBAAAxE,cAAA,GACAC,gBAAAwF,EAAAxF,iBACA6I,EAAAtE,gBAAAxE,gBAAAyF,EAAAzF,cACA8I,EAAAtE,gBAAAvE,gBAAA,EACA,GACA6D,aAAA2B,EAAA3B,aACAC,eAAA0B,EAAA1B,eACA9J,QAGAX,KAAAqL,oBAAA5H,KAAAqM,GACA,iBAAAA,EAAAtF,cACAxK,KAAAwL,mBAAA/H,KAAAqM,GAKAvH,EAAAvI,KAAAqL,oBAAAjJ,EAAA6L,qCACA1F,EAAAvI,KAAAwL,mBAAApJ,EAAAqK,6BAGA7M,EAAAoJ,4ECjnCA,IAAAP,EAAgBvI,EAAQ,uBACxBkC,EAAWlC,EAAQ,iBACnBsC,EAAetC,EAAQ,sBAAasC,SACpC+D,EAAkBrG,EAAQ,yBAAgBqG,YAU1C,SAAAwJ,EAAA1D,GACAA,IACAA,EAAA,IAEArM,KAAAiN,MAAA7K,EAAA+G,OAAAkD,EAAA,aACArM,KAAA+M,YAAA3K,EAAA+G,OAAAkD,EAAA,mBACArM,KAAAgQ,gBAAA5N,EAAA+G,OAAAkD,EAAA,qBACArM,KAAAkK,SAAA,IAAA1H,EACAxC,KAAAiK,OAAA,IAAAzH,EACAxC,KAAAqK,UAAA,IAAA9D,EACAvG,KAAAiQ,iBAAA,KAGAF,EAAA/N,UAAA0H,SAAA,EAOAqG,EAAA3E,cACA,SAAA8E,GACA,IAAA5G,EAAA4G,EAAA5G,WACA6G,EAAA,IAAAJ,EAAA,CACAtG,KAAAyG,EAAAzG,KACAH,eA2CA,OAzCA4G,EAAArE,YAAA,SAAAM,GACA,IAAAiE,EAAA,CACAC,UAAA,CACA1F,KAAAwB,EAAAzF,cACAkE,OAAAuB,EAAAxF,kBAIA,MAAAwF,EAAArC,SACAsG,EAAAtG,OAAAqC,EAAArC,OACA,MAAAR,IACA8G,EAAAtG,OAAA1H,EAAA4H,SAAAV,EAAA8G,EAAAtG,SAGAsG,EAAAE,SAAA,CACA3F,KAAAwB,EAAA3B,aACAI,OAAAuB,EAAA1B,gBAGA,MAAA0B,EAAAxL,OACAyP,EAAAzP,KAAAwL,EAAAxL,OAIAwP,EAAAI,WAAAH,KAEAF,EAAA9G,QAAArC,QAAA,SAAAyJ,GACA,IAAAC,EAAAD,EACA,OAAAlH,IACAmH,EAAArO,EAAA4H,SAAAV,EAAAkH,IAGAL,EAAAjG,SAAA7H,IAAAoO,IACAN,EAAAjG,SAAAjH,IAAAwN,GAGA,IAAAd,EAAAO,EAAApB,iBAAA0B,GACA,MAAAb,GACAQ,EAAAO,iBAAAF,EAAAb,KAGAQ,GAaAJ,EAAA/N,UAAAuO,WACA,SAAAlE,GACA,IAAAgE,EAAAjO,EAAA+G,OAAAkD,EAAA,aACAiE,EAAAlO,EAAA+G,OAAAkD,EAAA,iBACAvC,EAAA1H,EAAA+G,OAAAkD,EAAA,eACA1L,EAAAyB,EAAA+G,OAAAkD,EAAA,aAEArM,KAAAgQ,iBACAhQ,KAAA2Q,iBAAAN,EAAAC,EAAAxG,EAAAnJ,GAGA,MAAAmJ,IACAA,EAAAD,OAAAC,GACA9J,KAAAkK,SAAA7H,IAAAyH,IACA9J,KAAAkK,SAAAjH,IAAA6G,IAIA,MAAAnJ,IACAA,EAAAkJ,OAAAlJ,GACAX,KAAAiK,OAAA5H,IAAA1B,IACAX,KAAAiK,OAAAhH,IAAAtC,IAIAX,KAAAqK,UAAApH,IAAA,CACAyD,cAAA2J,EAAA1F,KACAhE,gBAAA0J,EAAAzF,OACAJ,aAAA,MAAA8F,KAAA3F,KACAF,eAAA,MAAA6F,KAAA1F,OACAd,SACAnJ,UAOAoP,EAAA/N,UAAA0O,iBACA,SAAAE,EAAAC,GACA,IAAA/G,EAAA8G,EACA,MAAA5Q,KAAA+M,cACAjD,EAAA1H,EAAA4H,SAAAhK,KAAA+M,YAAAjD,IAGA,MAAA+G,GAGA7Q,KAAAiQ,mBACAjQ,KAAAiQ,iBAAAnP,OAAAY,OAAA,OAEA1B,KAAAiQ,iBAAA7N,EAAAkB,YAAAwG,IAAA+G,GACK7Q,KAAAiQ,0BAGLjQ,KAAAiQ,iBAAA7N,EAAAkB,YAAAwG,IACA,IAAAhJ,OAAAgQ,KAAA9Q,KAAAiQ,kBAAAjN,SACAhD,KAAAiQ,iBAAA,QAqBAF,EAAA/N,UAAA+O,eACA,SAAAb,EAAAU,EAAAI,GACA,IAAAR,EAAAI,EAEA,SAAAA,EAAA,CACA,SAAAV,EAAAzG,KACA,UAAA9F,MACA,iJAIA6M,EAAAN,EAAAzG,KAEA,IAAAH,EAAAtJ,KAAA+M,YAEA,MAAAzD,IACAkH,EAAApO,EAAA4H,SAAAV,EAAAkH,IAIA,IAAAS,EAAA,IAAAzO,EACA0O,EAAA,IAAA1O,EAGAxC,KAAAqK,UAAAzD,gBAAA,SAAAuF,GACA,GAAAA,EAAArC,SAAA0G,GAAA,MAAArE,EAAA3B,aAAA,CAEA,IAAA8F,EAAAJ,EAAAxB,oBAAA,CACA/D,KAAAwB,EAAA3B,aACAI,OAAAuB,EAAA1B,iBAEA,MAAA6F,EAAAxG,SAEAqC,EAAArC,OAAAwG,EAAAxG,OACA,MAAAkH,IACA7E,EAAArC,OAAA1H,EAAA+O,KAAAH,EAAA7E,EAAArC,SAEA,MAAAR,IACA6C,EAAArC,OAAA1H,EAAA4H,SAAAV,EAAA6C,EAAArC,SAEAqC,EAAA3B,aAAA8F,EAAA3F,KACAwB,EAAA1B,eAAA6F,EAAA1F,OACA,MAAA0F,EAAA3P,OACAwL,EAAAxL,KAAA2P,EAAA3P,OAKA,IAAAmJ,EAAAqC,EAAArC,OACA,MAAAA,GAAAmH,EAAA5O,IAAAyH,IACAmH,EAAAhO,IAAA6G,GAGA,IAAAnJ,EAAAwL,EAAAxL,KACA,MAAAA,GAAAuQ,EAAA7O,IAAA1B,IACAuQ,EAAAjO,IAAAtC,IAGKX,MACLA,KAAAkK,SAAA+G,EACAjR,KAAAiK,OAAAiH,EAGAhB,EAAA9G,QAAArC,QAAA,SAAAyJ,GACA,IAAAb,EAAAO,EAAApB,iBAAA0B,GACA,MAAAb,IACA,MAAAqB,IACAR,EAAApO,EAAA+O,KAAAH,EAAAR,IAEA,MAAAlH,IACAkH,EAAApO,EAAA4H,SAAAV,EAAAkH,IAEAxQ,KAAA0Q,iBAAAF,EAAAb,KAEK3P,OAcL+P,EAAA/N,UAAA2O,iBACA,SAAAS,EAAAC,EAAAzE,EACA0E,GAKA,GAAAD,GAAA,iBAAAA,EAAA1G,MAAA,iBAAA0G,EAAAzG,OACA,UAAAjH,MACA,gPAMA,MAAAyN,GAAA,SAAAA,GAAA,WAAAA,GACAA,EAAAzG,KAAA,GAAAyG,EAAAxG,QAAA,IACAyG,GAAAzE,GAAA0E,MAIAF,GAAA,SAAAA,GAAA,WAAAA,GACAC,GAAA,SAAAA,GAAA,WAAAA,GACAD,EAAAzG,KAAA,GAAAyG,EAAAxG,QAAA,GACAyG,EAAA1G,KAAA,GAAA0G,EAAAzG,QAAA,GACAgC,GAKA,UAAAjJ,MAAA,oBAAA4N,KAAAC,UAAA,CACAnB,UAAAe,EACAtH,OAAA8C,EACA0D,SAAAe,EACA1Q,KAAA2Q,MASAvB,EAAA/N,UAAAyP,mBACA,WAcA,IAbA,IAOAC,EACAvF,EACAwF,EACAC,EAVAlE,EAAA,EACAmE,EAAA,EACAjE,EAAA,EACAD,EAAA,EACAG,EAAA,EACAD,EAAA,EACA/I,EAAA,GAMA0E,EAAAxJ,KAAAqK,UAAAvG,UACA1D,EAAA,EAAA2C,EAAAyG,EAAAxG,OAA0C5C,EAAA2C,EAAS3C,IAAA,CAInD,GAFAsR,EAAA,IADAvF,EAAA3C,EAAApJ,IAGAsG,gBAAAmL,EAEA,IADAnE,EAAA,EACAvB,EAAAzF,gBAAAmL,GACAH,GAAA,IACAG,SAIA,GAAAzR,EAAA,GACA,IAAAgC,EAAAmF,oCAAA4E,EAAA3C,EAAApJ,EAAA,IACA,SAEAsR,GAAA,IAIAA,GAAAjJ,EAAAxE,OAAAkI,EAAAxF,gBACA+G,GACAA,EAAAvB,EAAAxF,gBAEA,MAAAwF,EAAArC,SACA8H,EAAA5R,KAAAkK,SAAAxG,QAAAyI,EAAArC,QACA4H,GAAAjJ,EAAAxE,OAAA2N,EAAA/D,GACAA,EAAA+D,EAGAF,GAAAjJ,EAAAxE,OAAAkI,EAAA3B,aAAA,EACAmD,GACAA,EAAAxB,EAAA3B,aAAA,EAEAkH,GAAAjJ,EAAAxE,OAAAkI,EAAA1B,eACAmD,GACAA,EAAAzB,EAAA1B,eAEA,MAAA0B,EAAAxL,OACAgR,EAAA3R,KAAAiK,OAAAvG,QAAAyI,EAAAxL,MACA+Q,GAAAjJ,EAAAxE,OAAA0N,EAAA7D,GACAA,EAAA6D,IAIA7M,GAAA4M,EAGA,OAAA5M,GAGAiL,EAAA/N,UAAAgL,wBACA,SAAA8E,EAAApG,GACA,OAAAoG,EAAAlI,IAAA,SAAAE,GACA,IAAA9J,KAAAiQ,iBACA,YAEA,MAAAvE,IACA5B,EAAA1H,EAAA4H,SAAA0B,EAAA5B,IAEA,IAAAnI,EAAAS,EAAAkB,YAAAwG,GACA,OAAAhJ,OAAAkB,UAAAC,eAAA1B,KAAAP,KAAAiQ,iBAAAtO,GACA3B,KAAAiQ,iBAAAtO,GACA,MACK3B,OAML+P,EAAA/N,UAAA+P,OACA,WACA,IAAAnI,EAAA,CACAV,QAAAlJ,KAAA0J,SACAN,QAAApJ,KAAAkK,SAAApG,UACAuF,MAAArJ,KAAAiK,OAAAnG,UACA0F,SAAAxJ,KAAAyR,sBAYA,OAVA,MAAAzR,KAAAiN,QACArD,EAAAH,KAAAzJ,KAAAiN,OAEA,MAAAjN,KAAA+M,cACAnD,EAAAN,WAAAtJ,KAAA+M,aAEA/M,KAAAiQ,mBACArG,EAAAL,eAAAvJ,KAAAgN,wBAAApD,EAAAR,QAAAQ,EAAAN,aAGAM,GAMAmG,EAAA/N,UAAAgQ,SACA,WACA,OAAAT,KAAAC,UAAAxR,KAAA+R,WAGAnS,EAAAmQ,6DCjaA,IAAAA,EAAyB7P,EAAQ,iCAAwB6P,mBACzD3N,EAAWlC,EAAQ,iBAInB+R,EAAA,UAQAC,EAAA,qBAcA,SAAAC,EAAAC,EAAAC,EAAAzF,EAAA0F,EAAAhB,GACAtR,KAAAuS,SAAA,GACAvS,KAAAwS,eAAA,GACAxS,KAAA2K,KAAA,MAAAyH,EAAA,KAAAA,EACApS,KAAA4K,OAAA,MAAAyH,EAAA,KAAAA,EACArS,KAAA8J,OAAA,MAAA8C,EAAA,KAAAA,EACA5M,KAAAW,KAAA,MAAA2Q,EAAA,KAAAA,EACAtR,KAAAkS,IAAA,EACA,MAAAI,GAAAtS,KAAAiD,IAAAqP,GAWAH,EAAAM,wBACA,SAAAC,EAAAxC,EAAAyC,GAGA,IAAAC,EAAA,IAAAT,EAMAU,EAAAH,EAAAtN,MAAA6M,GACAa,EAAA,EACAC,EAAA,WAIA,OAHAC,KAEAA,KAAA,IAGA,SAAAA,IACA,OAAAF,EAAAD,EAAA7P,OACA6P,EAAAC,UAAApG,IAKAuG,EAAA,EAAAzE,EAAA,EAKA0E,EAAA,KAgEA,OA9DAhD,EAAArE,YAAA,SAAAM,GACA,UAAA+G,EAAA,CAGA,KAAAD,EAAA9G,EAAAzF,eAMS,CAIT,IACAyM,GADAC,EAAAP,EAAAC,IAAA,IACAO,OAAA,EAAAlH,EAAAxF,gBACA6H,GAOA,OANAqE,EAAAC,GAAAM,EAAAC,OAAAlH,EAAAxF,gBACA6H,GACAA,EAAArC,EAAAxF,gBACA2M,EAAAJ,EAAAC,QAEAD,EAAA/G,GAhBAmH,EAAAJ,EAAAH,KACAE,IACAzE,EAAA,EAqBA,KAAAyE,EAAA9G,EAAAzF,eACAkM,EAAA3P,IAAA8P,KACAE,IAEA,GAAAzE,EAAArC,EAAAxF,gBAAA,CACA,IAAAyM,EAAAP,EAAAC,IAAA,GACAF,EAAA3P,IAAAmQ,EAAAC,OAAA,EAAAlH,EAAAxF,kBACAkM,EAAAC,GAAAM,EAAAC,OAAAlH,EAAAxF,iBACA6H,EAAArC,EAAAxF,gBAEAuM,EAAA/G,GACKnM,MAEL8S,EAAAD,EAAA7P,SACAkQ,GAEAI,EAAAJ,EAAAH,KAGAH,EAAA3P,IAAA4P,EAAAU,OAAAT,GAAA3B,KAAA,MAIAjB,EAAA9G,QAAArC,QAAA,SAAAyJ,GACA,IAAAb,EAAAO,EAAApB,iBAAA0B,GACA,MAAAb,IACA,MAAAgD,IACAnC,EAAApO,EAAA+O,KAAAwB,EAAAnC,IAEAoC,EAAAlC,iBAAAF,EAAAb,MAIAiD,EAEA,SAAAU,EAAAnH,EAAAgH,GACA,UAAAhH,QAAAO,IAAAP,EAAArC,OACA8I,EAAA3P,IAAAkQ,OACO,CACP,IAAArJ,EAAA6I,EACAvQ,EAAA+O,KAAAwB,EAAAxG,EAAArC,QACAqC,EAAArC,OACA8I,EAAA3P,IAAA,IAAAkP,EAAAhG,EAAA3B,aACA2B,EAAA1B,eACAX,EACAqJ,EACAhH,EAAAxL,UAWAwR,EAAAnQ,UAAAiB,IAAA,SAAAuQ,GACA,GAAAC,MAAAC,QAAAF,GACAA,EAAAzM,QAAA,SAAA4M,GACA3T,KAAAiD,IAAA0Q,IACK3T,UAEL,KAAAwT,EAAAtB,IAAA,iBAAAsB,EAMA,UAAAlO,UACA,8EAAAkO,GANAA,GACAxT,KAAAuS,SAAA9O,KAAA+P,GAQA,OAAAxT,MASAmS,EAAAnQ,UAAA4R,QAAA,SAAAJ,GACA,GAAAC,MAAAC,QAAAF,GACA,QAAApT,EAAAoT,EAAAxQ,OAAA,EAAiC5C,GAAA,EAAQA,IACzCJ,KAAA4T,QAAAJ,EAAApT,QAGA,KAAAoT,EAAAtB,IAAA,iBAAAsB,EAIA,UAAAlO,UACA,8EAAAkO,GAJAxT,KAAAuS,SAAAsB,QAAAL,GAOA,OAAAxT,MAUAmS,EAAAnQ,UAAA8R,KAAA,SAAAC,GAEA,IADA,IAAAJ,EACAvT,EAAA,EAAA2C,EAAA/C,KAAAuS,SAAAvP,OAA6C5C,EAAA2C,EAAS3C,KACtDuT,EAAA3T,KAAAuS,SAAAnS,IACA8R,GACAyB,EAAAG,KAAAC,GAGA,KAAAJ,GACAI,EAAAJ,EAAA,CAAoB7J,OAAA9J,KAAA8J,OACpBa,KAAA3K,KAAA2K,KACAC,OAAA5K,KAAA4K,OACAjK,KAAAX,KAAAW,QAYAwR,EAAAnQ,UAAAmP,KAAA,SAAA6C,GACA,IAAAC,EACA7T,EACA2C,EAAA/C,KAAAuS,SAAAvP,OACA,GAAAD,EAAA,GAEA,IADAkR,EAAA,GACA7T,EAAA,EAAeA,EAAA2C,EAAA,EAAW3C,IAC1B6T,EAAAxQ,KAAAzD,KAAAuS,SAAAnS,IACA6T,EAAAxQ,KAAAuQ,GAEAC,EAAAxQ,KAAAzD,KAAAuS,SAAAnS,IACAJ,KAAAuS,SAAA0B,EAEA,OAAAjU,MAUAmS,EAAAnQ,UAAAkS,aAAA,SAAAC,EAAAC,GACA,IAAAC,EAAArU,KAAAuS,SAAAvS,KAAAuS,SAAAvP,OAAA,GAUA,OATAqR,EAAAnC,GACAmC,EAAAH,aAAAC,EAAAC,GAEA,iBAAAC,EACArU,KAAAuS,SAAAvS,KAAAuS,SAAAvP,OAAA,GAAAqR,EAAAnF,QAAAiF,EAAAC,GAGApU,KAAAuS,SAAA9O,KAAA,GAAAyL,QAAAiF,EAAAC,IAEApU,MAUAmS,EAAAnQ,UAAA0O,iBACA,SAAAE,EAAAC,GACA7Q,KAAAwS,eAAApQ,EAAAkB,YAAAsN,IAAAC,GASAsB,EAAAnQ,UAAAsS,mBACA,SAAAP,GACA,QAAA3T,EAAA,EAAA2C,EAAA/C,KAAAuS,SAAAvP,OAA+C5C,EAAA2C,EAAS3C,IACxDJ,KAAAuS,SAAAnS,GAAA8R,IACAlS,KAAAuS,SAAAnS,GAAAkU,mBAAAP,GAIA,IAAA3K,EAAAtI,OAAAgQ,KAAA9Q,KAAAwS,gBACA,IAAApS,EAAA,EAAA2C,EAAAqG,EAAApG,OAAyC5C,EAAA2C,EAAS3C,IAClD2T,EAAA3R,EAAAmS,cAAAnL,EAAAhJ,IAAAJ,KAAAwS,eAAApJ,EAAAhJ,MAQA+R,EAAAnQ,UAAAgQ,SAAA,WACA,IAAAzE,EAAA,GAIA,OAHAvN,KAAA8T,KAAA,SAAAH,GACApG,GAAAoG,IAEApG,GAOA4E,EAAAnQ,UAAAwS,sBAAA,SAAAnI,GACA,IAAAgE,EAAA,CACA8C,KAAA,GACAxI,KAAA,EACAC,OAAA,GAEAhB,EAAA,IAAAmG,EAAA1D,GACAoI,GAAA,EACAC,EAAA,KACAC,EAAA,KACAC,EAAA,KACAC,EAAA,KAqEA,OApEA7U,KAAA8T,KAAA,SAAAH,EAAArD,GACAD,EAAA8C,MAAAQ,EACA,OAAArD,EAAAxG,QACA,OAAAwG,EAAA3F,MACA,OAAA2F,EAAA1F,QACA8J,IAAApE,EAAAxG,QACA6K,IAAArE,EAAA3F,MACAiK,IAAAtE,EAAA1F,QACAiK,IAAAvE,EAAA3P,MACAiJ,EAAA2G,WAAA,CACAzG,OAAAwG,EAAAxG,OACAwG,SAAA,CACA3F,KAAA2F,EAAA3F,KACAC,OAAA0F,EAAA1F,QAEAyF,UAAA,CACA1F,KAAA0F,EAAA1F,KACAC,OAAAyF,EAAAzF,QAEAjK,KAAA2P,EAAA3P,OAGA+T,EAAApE,EAAAxG,OACA6K,EAAArE,EAAA3F,KACAiK,EAAAtE,EAAA1F,OACAiK,EAAAvE,EAAA3P,KACA8T,GAAA,GACKA,IACL7K,EAAA2G,WAAA,CACAF,UAAA,CACA1F,KAAA0F,EAAA1F,KACAC,OAAAyF,EAAAzF,UAGA8J,EAAA,KACAD,GAAA,GAEA,QAAAjR,EAAA,EAAAR,EAAA2Q,EAAA3Q,OAA4CQ,EAAAR,EAAcQ,IA3W1D,KA4WAmQ,EAAA3O,WAAAxB,IACA6M,EAAA1F,OACA0F,EAAAzF,OAAA,EAEApH,EAAA,IAAAR,GACA0R,EAAA,KACAD,GAAA,GACSA,GACT7K,EAAA2G,WAAA,CACAzG,OAAAwG,EAAAxG,OACAwG,SAAA,CACA3F,KAAA2F,EAAA3F,KACAC,OAAA0F,EAAA1F,QAEAyF,UAAA,CACA1F,KAAA0F,EAAA1F,KACAC,OAAAyF,EAAAzF,QAEAjK,KAAA2P,EAAA3P,QAIA0P,EAAAzF,WAIA5K,KAAAsU,mBAAA,SAAA9D,EAAAsE,GACAlL,EAAA8G,iBAAAF,EAAAsE,KAGA,CAAU3B,KAAA9C,EAAA8C,KAAAvJ,QAGVhK,EAAAuS,4CClYAvS,EAAAuJ,OATA,SAAAkD,EAAAiF,EAAAyD,GACA,GAAAzD,KAAAjF,EACA,OAAAA,EAAAiF,GACG,OAAA0D,UAAAhS,OACH,OAAA+R,EAEA,UAAApR,MAAA,IAAA2N,EAAA,8BAKA,IAAA2D,EAAA,iEACAC,EAAA,gBAEA,SAAAlG,EAAAmG,GACA,IAAAC,EAAAD,EAAAC,MAAAH,GACA,OAAAG,EAGA,CACAjG,OAAAiG,EAAA,GACAC,KAAAD,EAAA,GACAE,KAAAF,EAAA,GACAG,KAAAH,EAAA,GACAhG,KAAAgG,EAAA,IAPA,KAYA,SAAAI,EAAAC,GACA,IAAA3K,EAAA,GAiBA,OAhBA2K,EAAAtG,SACArE,GAAA2K,EAAAtG,OAAA,KAEArE,GAAA,KACA2K,EAAAJ,OACAvK,GAAA2K,EAAAJ,KAAA,KAEAI,EAAAH,OACAxK,GAAA2K,EAAAH,MAEAG,EAAAF,OACAzK,GAAA,IAAA2K,EAAAF,MAEAE,EAAArG,OACAtE,GAAA2K,EAAArG,MAEAtE,EAeA,SAAAnB,EAAA+L,GACA,IAAAtG,EAAAsG,EACA5K,EAAAkE,EAAA0G,GACA,GAAA5K,EAAA,CACA,IAAAA,EAAAsE,KACA,OAAAsG,EAEAtG,EAAAtE,EAAAsE,KAKA,IAHA,IAGAuG,EAHA5L,EAAAnK,EAAAmK,WAAAqF,GAEAwG,EAAAxG,EAAAhK,MAAA,OACAyQ,EAAA,EAAAzV,EAAAwV,EAAA5S,OAAA,EAA8C5C,GAAA,EAAQA,IAEtD,OADAuV,EAAAC,EAAAxV,IAEAwV,EAAArC,OAAAnT,EAAA,GACK,OAAAuV,EACLE,IACKA,EAAA,IACL,KAAAF,GAIAC,EAAArC,OAAAnT,EAAA,EAAAyV,GACAA,EAAA,IAEAD,EAAArC,OAAAnT,EAAA,GACAyV,MAUA,MAJA,MAFAzG,EAAAwG,EAAAzE,KAAA,QAGA/B,EAAArF,EAAA,SAGAe,GACAA,EAAAsE,OACAoG,EAAA1K,IAEAsE,EAoBA,SAAA+B,EAAA2E,EAAAJ,GACA,KAAAI,IACAA,EAAA,KAEA,KAAAJ,IACAA,EAAA,KAEA,IAAAK,EAAA/G,EAAA0G,GACAM,EAAAhH,EAAA8G,GAMA,GALAE,IACAF,EAAAE,EAAA5G,MAAA,KAIA2G,MAAA5G,OAIA,OAHA6G,IACAD,EAAA5G,OAAA6G,EAAA7G,QAEAqG,EAAAO,GAGA,GAAAA,GAAAL,EAAAN,MAAAF,GACA,OAAAQ,EAIA,GAAAM,MAAAV,OAAAU,EAAA5G,KAEA,OADA4G,EAAAV,KAAAI,EACAF,EAAAQ,GAGA,IAAAC,EAAA,MAAAP,EAAAzQ,OAAA,GACAyQ,EACA/L,EAAAmM,EAAA5G,QAAA,eAAAwG,GAEA,OAAAM,GACAA,EAAA5G,KAAA6G,EACAT,EAAAQ,IAEAC,EAvIArW,EAAAoP,WAsBApP,EAAA4V,cAwDA5V,EAAA+J,YA2DA/J,EAAAuR,OAEAvR,EAAAmK,WAAA,SAAA2L,GACA,YAAAA,EAAAzQ,OAAA,IAAAgQ,EAAAiB,KAAAR,IAyCA9V,EAAAoK,SAhCA,SAAA8L,EAAAJ,GACA,KAAAI,IACAA,EAAA,KAGAA,IAAA5G,QAAA,UAOA,IADA,IAAAiH,EAAA,EACA,IAAAT,EAAAhS,QAAAoS,EAAA,OACA,IAAA/P,EAAA+P,EAAAM,YAAA,KACA,GAAArQ,EAAA,EACA,OAAA2P,EAOA,IADAI,IAAA/R,MAAA,EAAAgC,IACAqP,MAAA,qBACA,OAAAM,IAGAS,EAIA,OAAA1C,MAAA0C,EAAA,GAAAhF,KAAA,OAAAuE,EAAArC,OAAAyC,EAAA9S,OAAA,IAIA,IAAAqT,IAEA,cADAvV,OAAAY,OAAA,OAIA,SAAA4U,EAAAnU,GACA,OAAAA,EA8BA,SAAAoU,EAAApU,GACA,IAAAA,EACA,SAGA,IAAAa,EAAAb,EAAAa,OAEA,GAAAA,EAAA,EACA,SAGA,QAAAb,EAAA6C,WAAAhC,EAAA,IACA,KAAAb,EAAA6C,WAAAhC,EAAA,IACA,MAAAb,EAAA6C,WAAAhC,EAAA,IACA,MAAAb,EAAA6C,WAAAhC,EAAA,IACA,MAAAb,EAAA6C,WAAAhC,EAAA,IACA,MAAAb,EAAA6C,WAAAhC,EAAA,IACA,MAAAb,EAAA6C,WAAAhC,EAAA,IACA,KAAAb,EAAA6C,WAAAhC,EAAA,IACA,KAAAb,EAAA6C,WAAAhC,EAAA,GACA,SAGA,QAAA5C,EAAA4C,EAAA,GAA2B5C,GAAA,EAAQA,IACnC,QAAA+B,EAAA6C,WAAA5E,GACA,SAIA,SAgFA,SAAAoW,EAAAC,EAAAC,GACA,OAAAD,IAAAC,EACA,EAGA,OAAAD,EACA,EAGA,OAAAC,GACA,EAGAD,EAAAC,EACA,GAGA,EAzIA9W,EAAA0D,YAAA+S,EAAAC,EAPA,SAAAlT,GACA,OAAAmT,EAAAnT,GACA,IAAAA,EAGAA,GAWAxD,EAAA2U,cAAA8B,EAAAC,EAPA,SAAAlT,GACA,OAAAmT,EAAAnT,GACAA,EAAAW,MAAA,GAGAX,GAwEAxD,EAAA6M,2BA5BA,SAAAxF,EAAAC,EAAAyP,GACA,IAAArQ,EAAAkQ,EAAAvP,EAAA6C,OAAA5C,EAAA4C,QACA,WAAAxD,EACAA,EAIA,IADAA,EAAAW,EAAAuD,aAAAtD,EAAAsD,cAEAlE,EAIA,IADAA,EAAAW,EAAAwD,eAAAvD,EAAAuD,iBACAkM,EACArQ,EAIA,IADAA,EAAAW,EAAAN,gBAAAO,EAAAP,iBAEAL,EAIA,IADAA,EAAAW,EAAAP,cAAAQ,EAAAR,eAEAJ,EAGAkQ,EAAAvP,EAAAtG,KAAAuG,EAAAvG,OAyCAf,EAAAqO,oCA5BA,SAAAhH,EAAAC,EAAA0P,GACA,IAAAtQ,EAAAW,EAAAP,cAAAQ,EAAAR,cACA,WAAAJ,EACAA,EAIA,IADAA,EAAAW,EAAAN,gBAAAO,EAAAP,kBACAiQ,EACAtQ,EAIA,KADAA,EAAAkQ,EAAAvP,EAAA6C,OAAA5C,EAAA4C,SAEAxD,EAIA,IADAA,EAAAW,EAAAuD,aAAAtD,EAAAsD,cAEAlE,EAIA,IADAA,EAAAW,EAAAwD,eAAAvD,EAAAuD,gBAEAnE,EAGAkQ,EAAAvP,EAAAtG,KAAAuG,EAAAvG,OAwDAf,EAAA2H,oCA5BA,SAAAN,EAAAC,GACA,IAAAZ,EAAAW,EAAAP,cAAAQ,EAAAR,cACA,WAAAJ,EACAA,EAIA,IADAA,EAAAW,EAAAN,gBAAAO,EAAAP,iBAEAL,EAIA,KADAA,EAAAkQ,EAAAvP,EAAA6C,OAAA5C,EAAA4C,SAEAxD,EAIA,IADAA,EAAAW,EAAAuD,aAAAtD,EAAAsD,cAEAlE,EAIA,IADAA,EAAAW,EAAAwD,eAAAvD,EAAAuD,gBAEAnE,EAGAkQ,EAAAvP,EAAAtG,KAAAuG,EAAAvG,OAYAf,EAAAkJ,oBAHA,SAAAyE,GACA,OAAAgE,KAAAsF,MAAAtJ,EAAA2B,QAAA,iBAAsC,MAuDtCtP,EAAAwK,iBA/CA,SAAAd,EAAAwN,EAAAC,GA8BA,GA7BAD,KAAA,GAEAxN,IAEA,MAAAA,IAAAtG,OAAA,UAAA8T,EAAA,KACAxN,GAAA,KAOAwN,EAAAxN,EAAAwN,GAiBAC,EAAA,CACA,IAAAC,EAAAhI,EAAA+H,GACA,IAAAC,EACA,UAAArT,MAAA,oCAEA,GAAAqT,EAAA5H,KAAA,CAEA,IAAArJ,EAAAiR,EAAA5H,KAAAgH,YAAA,KACArQ,GAAA,IACAiR,EAAA5H,KAAA4H,EAAA5H,KAAA6H,UAAA,EAAAlR,EAAA,IAGA+Q,EAAA3F,EAAAqE,EAAAwB,GAAAF,GAGA,OAAAnN,EAAAmN,uCCheAlX,EAAAmQ,mBAA6B7P,EAAQ,iCAA4B6P,mBACjEnQ,EAAA8I,kBAA4BxI,EAAQ,gCAA2BwI,kBAC/D9I,EAAAuS,WAAqBjS,EAAQ,wBAAmBiS","file":"source-map.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = \"./source-map.js\");\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n this._array = [];\n this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n var set = new ArraySet();\n for (var i = 0, len = aArray.length; i < len; i++) {\n set.add(aArray[i], aAllowDuplicates);\n }\n return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n var idx = this._array.length;\n if (!isDuplicate || aAllowDuplicates) {\n this._array.push(aStr);\n }\n if (!isDuplicate) {\n if (hasNativeMap) {\n this._set.set(aStr, idx);\n } else {\n this._set[sStr] = idx;\n }\n }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n if (hasNativeMap) {\n return this._set.has(aStr);\n } else {\n var sStr = util.toSetString(aStr);\n return has.call(this._set, sStr);\n }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n if (hasNativeMap) {\n var idx = this._set.get(aStr);\n if (idx >= 0) {\n return idx;\n }\n } else {\n var sStr = util.toSetString(aStr);\n if (has.call(this._set, sStr)) {\n return this._set[sStr];\n }\n }\n\n throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n if (aIdx >= 0 && aIdx < this._array.length) {\n return this._array[aIdx];\n }\n throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided\n * with the distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n// Continuation\n// | Sign\n// | |\n// V V\n// 101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n * 2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n return aValue < 0\n ? ((-aValue) << 1) + 1\n : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n * 4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n var isNegative = (aValue & 1) === 1;\n var shifted = aValue >> 1;\n return isNegative\n ? -shifted\n : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n var encoded = \"\";\n var digit;\n\n var vlq = toVLQSigned(aValue);\n\n do {\n digit = vlq & VLQ_BASE_MASK;\n vlq >>>= VLQ_BASE_SHIFT;\n if (vlq > 0) {\n // There are still more digits in this value, so we must make sure the\n // continuation bit is marked.\n digit |= VLQ_CONTINUATION_BIT;\n }\n encoded += base64.encode(digit);\n } while (vlq > 0);\n\n return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n var strLen = aStr.length;\n var result = 0;\n var shift = 0;\n var continuation, digit;\n\n do {\n if (aIndex >= strLen) {\n throw new Error(\"Expected more digits in base 64 VLQ value.\");\n }\n\n digit = base64.decode(aStr.charCodeAt(aIndex++));\n if (digit === -1) {\n throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n }\n\n continuation = !!(digit & VLQ_CONTINUATION_BIT);\n digit &= VLQ_BASE_MASK;\n result = result + (digit << shift);\n shift += VLQ_BASE_SHIFT;\n } while (continuation);\n\n aOutParam.value = fromVLQSigned(result);\n aOutParam.rest = aIndex;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n if (0 <= number && number < intToCharMap.length) {\n return intToCharMap[number];\n }\n throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n var bigA = 65; // 'A'\n var bigZ = 90; // 'Z'\n\n var littleA = 97; // 'a'\n var littleZ = 122; // 'z'\n\n var zero = 48; // '0'\n var nine = 57; // '9'\n\n var plus = 43; // '+'\n var slash = 47; // '/'\n\n var littleOffset = 26;\n var numberOffset = 52;\n\n // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n if (bigA <= charCode && charCode <= bigZ) {\n return (charCode - bigA);\n }\n\n // 26 - 51: abcdefghijklmnopqrstuvwxyz\n if (littleA <= charCode && charCode <= littleZ) {\n return (charCode - littleA + littleOffset);\n }\n\n // 52 - 61: 0123456789\n if (zero <= charCode && charCode <= nine) {\n return (charCode - zero + numberOffset);\n }\n\n // 62: +\n if (charCode == plus) {\n return 62;\n }\n\n // 63: /\n if (charCode == slash) {\n return 63;\n }\n\n // Invalid base64 digit.\n return -1;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n // This function terminates when one of the following is true:\n //\n // 1. We find the exact element we are looking for.\n //\n // 2. We did not find the exact element, but we can return the index of\n // the next-closest element.\n //\n // 3. We did not find the exact element, and there is no next-closest\n // element than the one we are searching for, so we return -1.\n var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n var cmp = aCompare(aNeedle, aHaystack[mid], true);\n if (cmp === 0) {\n // Found the element we are looking for.\n return mid;\n }\n else if (cmp > 0) {\n // Our needle is greater than aHaystack[mid].\n if (aHigh - mid > 1) {\n // The element is in the upper half.\n return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // The exact needle element was not found in this haystack. Determine if\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return aHigh < aHaystack.length ? aHigh : -1;\n } else {\n return mid;\n }\n }\n else {\n // Our needle is less than aHaystack[mid].\n if (mid - aLow > 1) {\n // The element is in the lower half.\n return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return mid;\n } else {\n return aLow < 0 ? -1 : aLow;\n }\n }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n * array and returns -1, 0, or 1 depending on whether the needle is less\n * than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n if (aHaystack.length === 0) {\n return -1;\n }\n\n var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n if (index < 0) {\n return -1;\n }\n\n // We have found either the exact element, or the next-closest element than\n // the one we are searching for. However, there may be more than one such\n // element. Make sure we always return the smallest of these.\n while (index - 1 >= 0) {\n if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n break;\n }\n --index;\n }\n\n return index;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n // Optimized for most common case\n var lineA = mappingA.generatedLine;\n var lineB = mappingB.generatedLine;\n var columnA = mappingA.generatedColumn;\n var columnB = mappingB.generatedColumn;\n return lineB > lineA || lineB == lineA && columnB >= columnA ||\n util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n this._array = [];\n this._sorted = true;\n // Serves as infimum\n this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n function MappingList_forEach(aCallback, aThisArg) {\n this._array.forEach(aCallback, aThisArg);\n };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n if (generatedPositionAfter(this._last, aMapping)) {\n this._last = aMapping;\n this._array.push(aMapping);\n } else {\n this._sorted = false;\n this._array.push(aMapping);\n }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n if (!this._sorted) {\n this._array.sort(util.compareByGeneratedPositionsInflated);\n this._sorted = true;\n }\n return this._array;\n};\n\nexports.MappingList = MappingList;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n * The array.\n * @param {Number} x\n * The index of the first item.\n * @param {Number} y\n * The index of the second item.\n */\nfunction swap(ary, x, y) {\n var temp = ary[x];\n ary[x] = ary[y];\n ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n * The lower bound on the range.\n * @param {Number} high\n * The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n * @param {Number} p\n * Start index of the array\n * @param {Number} r\n * End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n // If our lower bound is less than our upper bound, we (1) partition the\n // array into two pieces and (2) recurse on each half. If it is not, this is\n // the empty array and our base case.\n\n if (p < r) {\n // (1) Partitioning.\n //\n // The partitioning chooses a pivot between `p` and `r` and moves all\n // elements that are less than or equal to the pivot to the before it, and\n // all the elements that are greater than it after it. The effect is that\n // once partition is done, the pivot is in the exact place it will be when\n // the array is put in sorted order, and it will not need to be moved\n // again. This runs in O(n) time.\n\n // Always choose a random pivot so that an input array which is reverse\n // sorted does not cause O(n^2) running time.\n var pivotIndex = randomIntInRange(p, r);\n var i = p - 1;\n\n swap(ary, pivotIndex, r);\n var pivot = ary[r];\n\n // Immediately after `j` is incremented in this loop, the following hold\n // true:\n //\n // * Every element in `ary[p .. i]` is less than or equal to the pivot.\n //\n // * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n for (var j = p; j < r; j++) {\n if (comparator(ary[j], pivot) <= 0) {\n i += 1;\n swap(ary, i, j);\n }\n }\n\n swap(ary, i + 1, j);\n var q = i + 1;\n\n // (2) Recurse on each half.\n\n doQuickSort(ary, comparator, p, q - 1);\n doQuickSort(ary, comparator, q + 1, r);\n }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n return sourceMap.sections != null\n ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n// {\n// generatedLine: The line number in the generated code,\n// generatedColumn: The column number in the generated code,\n// source: The path to the original source file that generated this\n// chunk of code,\n// originalLine: The line number in the original source that\n// corresponds to this chunk of generated code,\n// originalColumn: The column number in the original source that\n// corresponds to this chunk of generated code,\n// name: The name of the original symbol which generated this chunk of\n// code.\n// }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n configurable: true,\n enumerable: true,\n get: function () {\n if (!this.__generatedMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__generatedMappings;\n }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n configurable: true,\n enumerable: true,\n get: function () {\n if (!this.__originalMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__originalMappings;\n }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n var c = aStr.charAt(index);\n return c === \";\" || c === \",\";\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n throw new Error(\"Subclasses must implement _parseMappings\");\n };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n * The function that is called with each mapping.\n * @param Object aContext\n * Optional. If specified, this object will be the value of `this` every\n * time that `aCallback` is called.\n * @param aOrder\n * Either `SourceMapConsumer.GENERATED_ORDER` or\n * `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n * iterate over the mappings sorted by the generated file's line/column\n * order or the original's source/line/column order, respectively. Defaults to\n * `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n var context = aContext || null;\n var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n var mappings;\n switch (order) {\n case SourceMapConsumer.GENERATED_ORDER:\n mappings = this._generatedMappings;\n break;\n case SourceMapConsumer.ORIGINAL_ORDER:\n mappings = this._originalMappings;\n break;\n default:\n throw new Error(\"Unknown order of iteration.\");\n }\n\n var sourceRoot = this.sourceRoot;\n mappings.map(function (mapping) {\n var source = mapping.source === null ? null : this._sources.at(mapping.source);\n source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n return {\n source: source,\n generatedLine: mapping.generatedLine,\n generatedColumn: mapping.generatedColumn,\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: mapping.name === null ? null : this._names.at(mapping.name)\n };\n }, this).forEach(aCallback, context);\n };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number is 1-based.\n * - column: Optional. the column number in the original source.\n * The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n var line = util.getArg(aArgs, 'line');\n\n // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n // returns the index of the closest mapping less than the needle. By\n // setting needle.originalColumn to 0, we thus find the last mapping for\n // the given line, provided such a mapping exists.\n var needle = {\n source: util.getArg(aArgs, 'source'),\n originalLine: line,\n originalColumn: util.getArg(aArgs, 'column', 0)\n };\n\n needle.source = this._findSourceIndex(needle.source);\n if (needle.source < 0) {\n return [];\n }\n\n var mappings = [];\n\n var index = this._findMapping(needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n binarySearch.LEAST_UPPER_BOUND);\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (aArgs.column === undefined) {\n var originalLine = mapping.originalLine;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we found. Since\n // mappings are sorted, this is guaranteed to find all mappings for\n // the line we found.\n while (mapping && mapping.originalLine === originalLine) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n } else {\n var originalColumn = mapping.originalColumn;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we were searching for.\n // Since mappings are sorted, this is guaranteed to find all mappings for\n // the line we are searching for.\n while (mapping &&\n mapping.originalLine === line &&\n mapping.originalColumn == originalColumn) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n }\n }\n\n return mappings;\n };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - sources: An array of URLs to the original source files.\n * - names: An array of identifiers which can be referrenced by individual mappings.\n * - sourceRoot: Optional. The URL root from which all sources are relative.\n * - sourcesContent: Optional. An array of contents of the original source files.\n * - mappings: A string of base64 VLQs which contain the actual mappings.\n * - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n * {\n * version : 3,\n * file: \"out.js\",\n * sourceRoot : \"\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AA,AB;;ABCDE;\"\n * }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found. This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sources = util.getArg(sourceMap, 'sources');\n // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n // requires the array) to play nice here.\n var names = util.getArg(sourceMap, 'names', []);\n var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n var mappings = util.getArg(sourceMap, 'mappings');\n var file = util.getArg(sourceMap, 'file', null);\n\n // Once again, Sass deviates from the spec and supplies the version as a\n // string rather than a number, so we use loose equality checking here.\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n if (sourceRoot) {\n sourceRoot = util.normalize(sourceRoot);\n }\n\n sources = sources\n .map(String)\n // Some source maps produce relative source paths like \"./foo.js\" instead of\n // \"foo.js\". Normalize these first so that future comparisons will succeed.\n // See bugzil.la/1090768.\n .map(util.normalize)\n // Always ensure that absolute sources are internally stored relative to\n // the source root, if the source root is absolute. Not doing this would\n // be particularly problematic when the source root is a prefix of the\n // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n .map(function (source) {\n return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n ? util.relative(sourceRoot, source)\n : source;\n });\n\n // Pass `true` below to allow duplicate names and sources. While source maps\n // are intended to be compressed and deduplicated, the TypeScript compiler\n // sometimes generates source maps with duplicates in them. See Github issue\n // #72 and bugzil.la/889492.\n this._names = ArraySet.fromArray(names.map(String), true);\n this._sources = ArraySet.fromArray(sources, true);\n\n this._absoluteSources = this._sources.toArray().map(function (s) {\n return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n });\n\n this.sourceRoot = sourceRoot;\n this.sourcesContent = sourcesContent;\n this._mappings = mappings;\n this._sourceMapURL = aSourceMapURL;\n this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source. Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n var relativeSource = aSource;\n if (this.sourceRoot != null) {\n relativeSource = util.relative(this.sourceRoot, relativeSource);\n }\n\n if (this._sources.has(relativeSource)) {\n return this._sources.indexOf(relativeSource);\n }\n\n // Maybe aSource is an absolute URL as returned by |sources|. In\n // this case we can't simply undo the transform.\n var i;\n for (i = 0; i < this._absoluteSources.length; ++i) {\n if (this._absoluteSources[i] == aSource) {\n return i;\n }\n }\n\n return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n * The source map that will be consumed.\n * @param String aSourceMapURL\n * The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n smc.sourceRoot = aSourceMap._sourceRoot;\n smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n smc.sourceRoot);\n smc.file = aSourceMap._file;\n smc._sourceMapURL = aSourceMapURL;\n smc._absoluteSources = smc._sources.toArray().map(function (s) {\n return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n });\n\n // Because we are modifying the entries (by converting string sources and\n // names to indices into the sources and names ArraySets), we have to make\n // a copy of the entry or else bad things happen. Shared mutable state\n // strikes again! See github issue #191.\n\n var generatedMappings = aSourceMap._mappings.toArray().slice();\n var destGeneratedMappings = smc.__generatedMappings = [];\n var destOriginalMappings = smc.__originalMappings = [];\n\n for (var i = 0, length = generatedMappings.length; i < length; i++) {\n var srcMapping = generatedMappings[i];\n var destMapping = new Mapping;\n destMapping.generatedLine = srcMapping.generatedLine;\n destMapping.generatedColumn = srcMapping.generatedColumn;\n\n if (srcMapping.source) {\n destMapping.source = sources.indexOf(srcMapping.source);\n destMapping.originalLine = srcMapping.originalLine;\n destMapping.originalColumn = srcMapping.originalColumn;\n\n if (srcMapping.name) {\n destMapping.name = names.indexOf(srcMapping.name);\n }\n\n destOriginalMappings.push(destMapping);\n }\n\n destGeneratedMappings.push(destMapping);\n }\n\n quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n return smc;\n };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n get: function () {\n return this._absoluteSources.slice();\n }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n this.generatedLine = 0;\n this.generatedColumn = 0;\n this.source = null;\n this.originalLine = null;\n this.originalColumn = null;\n this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n var generatedLine = 1;\n var previousGeneratedColumn = 0;\n var previousOriginalLine = 0;\n var previousOriginalColumn = 0;\n var previousSource = 0;\n var previousName = 0;\n var length = aStr.length;\n var index = 0;\n var cachedSegments = {};\n var temp = {};\n var originalMappings = [];\n var generatedMappings = [];\n var mapping, str, segment, end, value;\n\n while (index < length) {\n if (aStr.charAt(index) === ';') {\n generatedLine++;\n index++;\n previousGeneratedColumn = 0;\n }\n else if (aStr.charAt(index) === ',') {\n index++;\n }\n else {\n mapping = new Mapping();\n mapping.generatedLine = generatedLine;\n\n // Because each offset is encoded relative to the previous one,\n // many segments often have the same encoding. We can exploit this\n // fact by caching the parsed variable length fields of each segment,\n // allowing us to avoid a second parse if we encounter the same\n // segment again.\n for (end = index; end < length; end++) {\n if (this._charIsMappingSeparator(aStr, end)) {\n break;\n }\n }\n str = aStr.slice(index, end);\n\n segment = cachedSegments[str];\n if (segment) {\n index += str.length;\n } else {\n segment = [];\n while (index < end) {\n base64VLQ.decode(aStr, index, temp);\n value = temp.value;\n index = temp.rest;\n segment.push(value);\n }\n\n if (segment.length === 2) {\n throw new Error('Found a source, but no line and column');\n }\n\n if (segment.length === 3) {\n throw new Error('Found a source and line, but no column');\n }\n\n cachedSegments[str] = segment;\n }\n\n // Generated column.\n mapping.generatedColumn = previousGeneratedColumn + segment[0];\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (segment.length > 1) {\n // Original source.\n mapping.source = previousSource + segment[1];\n previousSource += segment[1];\n\n // Original line.\n mapping.originalLine = previousOriginalLine + segment[2];\n previousOriginalLine = mapping.originalLine;\n // Lines are stored 0-based\n mapping.originalLine += 1;\n\n // Original column.\n mapping.originalColumn = previousOriginalColumn + segment[3];\n previousOriginalColumn = mapping.originalColumn;\n\n if (segment.length > 4) {\n // Original name.\n mapping.name = previousName + segment[4];\n previousName += segment[4];\n }\n }\n\n generatedMappings.push(mapping);\n if (typeof mapping.originalLine === 'number') {\n originalMappings.push(mapping);\n }\n }\n }\n\n quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n this.__generatedMappings = generatedMappings;\n\n quickSort(originalMappings, util.compareByOriginalPositions);\n this.__originalMappings = originalMappings;\n };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n aColumnName, aComparator, aBias) {\n // To return the position we are searching for, we must first find the\n // mapping for the given position and then return the opposite position it\n // points to. Because the mappings are sorted, we can use binary search to\n // find the best mapping.\n\n if (aNeedle[aLineName] <= 0) {\n throw new TypeError('Line must be greater than or equal to 1, got '\n + aNeedle[aLineName]);\n }\n if (aNeedle[aColumnName] < 0) {\n throw new TypeError('Column must be greater than or equal to 0, got '\n + aNeedle[aColumnName]);\n }\n\n return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n function SourceMapConsumer_computeColumnSpans() {\n for (var index = 0; index < this._generatedMappings.length; ++index) {\n var mapping = this._generatedMappings[index];\n\n // Mappings do not contain a field for the last generated columnt. We\n // can come up with an optimistic estimate, however, by assuming that\n // mappings are contiguous (i.e. given two consecutive mappings, the\n // first mapping ends where the second one starts).\n if (index + 1 < this._generatedMappings.length) {\n var nextMapping = this._generatedMappings[index + 1];\n\n if (mapping.generatedLine === nextMapping.generatedLine) {\n mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n continue;\n }\n }\n\n // The last mapping for each line spans the entire line.\n mapping.lastGeneratedColumn = Infinity;\n }\n };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source. The line number\n * is 1-based.\n * - column: The column number in the generated source. The column\n * number is 0-based.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null. The\n * line number is 1-based.\n * - column: The column number in the original source, or null. The\n * column number is 0-based.\n * - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n function SourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._generatedMappings,\n \"generatedLine\",\n \"generatedColumn\",\n util.compareByGeneratedPositionsDeflated,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._generatedMappings[index];\n\n if (mapping.generatedLine === needle.generatedLine) {\n var source = util.getArg(mapping, 'source', null);\n if (source !== null) {\n source = this._sources.at(source);\n source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n }\n var name = util.getArg(mapping, 'name', null);\n if (name !== null) {\n name = this._names.at(name);\n }\n return {\n source: source,\n line: util.getArg(mapping, 'originalLine', null),\n column: util.getArg(mapping, 'originalColumn', null),\n name: name\n };\n }\n }\n\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n function BasicSourceMapConsumer_hasContentsOfAllSources() {\n if (!this.sourcesContent) {\n return false;\n }\n return this.sourcesContent.length >= this._sources.size() &&\n !this.sourcesContent.some(function (sc) { return sc == null; });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n if (!this.sourcesContent) {\n return null;\n }\n\n var index = this._findSourceIndex(aSource);\n if (index >= 0) {\n return this.sourcesContent[index];\n }\n\n var relativeSource = aSource;\n if (this.sourceRoot != null) {\n relativeSource = util.relative(this.sourceRoot, relativeSource);\n }\n\n var url;\n if (this.sourceRoot != null\n && (url = util.urlParse(this.sourceRoot))) {\n // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n // many users. We can help them out when they expect file:// URIs to\n // behave like it would if they were running a local HTTP server. See\n // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n if (url.scheme == \"file\"\n && this._sources.has(fileUriAbsPath)) {\n return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n }\n\n if ((!url.path || url.path == \"/\")\n && this._sources.has(\"/\" + relativeSource)) {\n return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n }\n }\n\n // This function is used recursively from\n // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n // don't want to throw if we can't find the source - we just want to\n // return null, so we provide a flag to exit gracefully.\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number\n * is 1-based.\n * - column: The column number in the original source. The column\n * number is 0-based.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n function SourceMapConsumer_generatedPositionFor(aArgs) {\n var source = util.getArg(aArgs, 'source');\n source = this._findSourceIndex(source);\n if (source < 0) {\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n }\n\n var needle = {\n source: source,\n originalLine: util.getArg(aArgs, 'line'),\n originalColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (mapping.source === needle.source) {\n return {\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n };\n }\n }\n\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - file: Optional. The generated file this source map is associated with.\n * - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n * - offset: The offset into the original specified at which this section\n * begins to apply, defined as an object with a \"line\" and \"column\"\n * field.\n * - map: A source map definition. This source map could also be indexed,\n * but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n * {\n * version : 3,\n * file: \"app.js\",\n * sections: [{\n * offset: {line:100, column:10},\n * map: {\n * version : 3,\n * file: \"section.js\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AAAA,E;;ABCDE;\"\n * }\n * }],\n * }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found. This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sections = util.getArg(sourceMap, 'sections');\n\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n this._sources = new ArraySet();\n this._names = new ArraySet();\n\n var lastOffset = {\n line: -1,\n column: 0\n };\n this._sections = sections.map(function (s) {\n if (s.url) {\n // The url field will require support for asynchronicity.\n // See https://github.com/mozilla/source-map/issues/16\n throw new Error('Support for url field in sections not implemented.');\n }\n var offset = util.getArg(s, 'offset');\n var offsetLine = util.getArg(offset, 'line');\n var offsetColumn = util.getArg(offset, 'column');\n\n if (offsetLine < lastOffset.line ||\n (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n throw new Error('Section offsets must be ordered and non-overlapping.');\n }\n lastOffset = offset;\n\n return {\n generatedOffset: {\n // The offset fields are 0-based, but we use 1-based indices when\n // encoding/decoding from VLQ.\n generatedLine: offsetLine + 1,\n generatedColumn: offsetColumn + 1\n },\n consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n }\n });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n get: function () {\n var sources = [];\n for (var i = 0; i < this._sections.length; i++) {\n for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n sources.push(this._sections[i].consumer.sources[j]);\n }\n }\n return sources;\n }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source. The line number\n * is 1-based.\n * - column: The column number in the generated source. The column\n * number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null. The\n * line number is 1-based.\n * - column: The column number in the original source, or null. The\n * column number is 0-based.\n * - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n // Find the section containing the generated position we're trying to map\n // to an original position.\n var sectionIndex = binarySearch.search(needle, this._sections,\n function(needle, section) {\n var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n if (cmp) {\n return cmp;\n }\n\n return (needle.generatedColumn -\n section.generatedOffset.generatedColumn);\n });\n var section = this._sections[sectionIndex];\n\n if (!section) {\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n }\n\n return section.consumer.originalPositionFor({\n line: needle.generatedLine -\n (section.generatedOffset.generatedLine - 1),\n column: needle.generatedColumn -\n (section.generatedOffset.generatedLine === needle.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n bias: aArgs.bias\n });\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n return this._sections.every(function (s) {\n return s.consumer.hasContentsOfAllSources();\n });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n var content = section.consumer.sourceContentFor(aSource, true);\n if (content) {\n return content;\n }\n }\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number\n * is 1-based.\n * - column: The column number in the original source. The column\n * number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based. \n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n // Only consider this section if the requested source is in the list of\n // sources of the consumer.\n if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n continue;\n }\n var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n if (generatedPosition) {\n var ret = {\n line: generatedPosition.line +\n (section.generatedOffset.generatedLine - 1),\n column: generatedPosition.column +\n (section.generatedOffset.generatedLine === generatedPosition.line\n ? section.generatedOffset.generatedColumn - 1\n : 0)\n };\n return ret;\n }\n }\n\n return {\n line: null,\n column: null\n };\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n this.__generatedMappings = [];\n this.__originalMappings = [];\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n var sectionMappings = section.consumer._generatedMappings;\n for (var j = 0; j < sectionMappings.length; j++) {\n var mapping = sectionMappings[j];\n\n var source = section.consumer._sources.at(mapping.source);\n source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n this._sources.add(source);\n source = this._sources.indexOf(source);\n\n var name = null;\n if (mapping.name) {\n name = section.consumer._names.at(mapping.name);\n this._names.add(name);\n name = this._names.indexOf(name);\n }\n\n // The mappings coming from the consumer for the section have\n // generated positions relative to the start of the section, so we\n // need to offset them to be relative to the start of the concatenated\n // generated file.\n var adjustedMapping = {\n source: source,\n generatedLine: mapping.generatedLine +\n (section.generatedOffset.generatedLine - 1),\n generatedColumn: mapping.generatedColumn +\n (section.generatedOffset.generatedLine === mapping.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: name\n };\n\n this.__generatedMappings.push(adjustedMapping);\n if (typeof adjustedMapping.originalLine === 'number') {\n this.__originalMappings.push(adjustedMapping);\n }\n }\n }\n\n quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n quickSort(this.__originalMappings, util.compareByOriginalPositions);\n };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n * - file: The filename of the generated source.\n * - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n if (!aArgs) {\n aArgs = {};\n }\n this._file = util.getArg(aArgs, 'file', null);\n this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n this._sources = new ArraySet();\n this._names = new ArraySet();\n this._mappings = new MappingList();\n this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n var sourceRoot = aSourceMapConsumer.sourceRoot;\n var generator = new SourceMapGenerator({\n file: aSourceMapConsumer.file,\n sourceRoot: sourceRoot\n });\n aSourceMapConsumer.eachMapping(function (mapping) {\n var newMapping = {\n generated: {\n line: mapping.generatedLine,\n column: mapping.generatedColumn\n }\n };\n\n if (mapping.source != null) {\n newMapping.source = mapping.source;\n if (sourceRoot != null) {\n newMapping.source = util.relative(sourceRoot, newMapping.source);\n }\n\n newMapping.original = {\n line: mapping.originalLine,\n column: mapping.originalColumn\n };\n\n if (mapping.name != null) {\n newMapping.name = mapping.name;\n }\n }\n\n generator.addMapping(newMapping);\n });\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var sourceRelative = sourceFile;\n if (sourceRoot !== null) {\n sourceRelative = util.relative(sourceRoot, sourceFile);\n }\n\n if (!generator._sources.has(sourceRelative)) {\n generator._sources.add(sourceRelative);\n }\n\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n generator.setSourceContent(sourceFile, content);\n }\n });\n return generator;\n };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n * - generated: An object with the generated line and column positions.\n * - original: An object with the original line and column positions.\n * - source: The original source file (relative to the sourceRoot).\n * - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n function SourceMapGenerator_addMapping(aArgs) {\n var generated = util.getArg(aArgs, 'generated');\n var original = util.getArg(aArgs, 'original', null);\n var source = util.getArg(aArgs, 'source', null);\n var name = util.getArg(aArgs, 'name', null);\n\n if (!this._skipValidation) {\n this._validateMapping(generated, original, source, name);\n }\n\n if (source != null) {\n source = String(source);\n if (!this._sources.has(source)) {\n this._sources.add(source);\n }\n }\n\n if (name != null) {\n name = String(name);\n if (!this._names.has(name)) {\n this._names.add(name);\n }\n }\n\n this._mappings.add({\n generatedLine: generated.line,\n generatedColumn: generated.column,\n originalLine: original != null && original.line,\n originalColumn: original != null && original.column,\n source: source,\n name: name\n });\n };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n var source = aSourceFile;\n if (this._sourceRoot != null) {\n source = util.relative(this._sourceRoot, source);\n }\n\n if (aSourceContent != null) {\n // Add the source content to the _sourcesContents map.\n // Create a new _sourcesContents map if the property is null.\n if (!this._sourcesContents) {\n this._sourcesContents = Object.create(null);\n }\n this._sourcesContents[util.toSetString(source)] = aSourceContent;\n } else if (this._sourcesContents) {\n // Remove the source file from the _sourcesContents map.\n // If the _sourcesContents map is empty, set the property to null.\n delete this._sourcesContents[util.toSetString(source)];\n if (Object.keys(this._sourcesContents).length === 0) {\n this._sourcesContents = null;\n }\n }\n };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n * If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n * to be applied. If relative, it is relative to the SourceMapConsumer.\n * This parameter is needed when the two source maps aren't in the same\n * directory, and the source map to be applied contains relative source\n * paths. If so, those relative source paths need to be rewritten\n * relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n var sourceFile = aSourceFile;\n // If aSourceFile is omitted, we will use the file property of the SourceMap\n if (aSourceFile == null) {\n if (aSourceMapConsumer.file == null) {\n throw new Error(\n 'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n 'or the source map\\'s \"file\" property. Both were omitted.'\n );\n }\n sourceFile = aSourceMapConsumer.file;\n }\n var sourceRoot = this._sourceRoot;\n // Make \"sourceFile\" relative if an absolute Url is passed.\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n // Applying the SourceMap can add and remove items from the sources and\n // the names array.\n var newSources = new ArraySet();\n var newNames = new ArraySet();\n\n // Find mappings for the \"sourceFile\"\n this._mappings.unsortedForEach(function (mapping) {\n if (mapping.source === sourceFile && mapping.originalLine != null) {\n // Check if it can be mapped by the source map, then update the mapping.\n var original = aSourceMapConsumer.originalPositionFor({\n line: mapping.originalLine,\n column: mapping.originalColumn\n });\n if (original.source != null) {\n // Copy mapping\n mapping.source = original.source;\n if (aSourceMapPath != null) {\n mapping.source = util.join(aSourceMapPath, mapping.source)\n }\n if (sourceRoot != null) {\n mapping.source = util.relative(sourceRoot, mapping.source);\n }\n mapping.originalLine = original.line;\n mapping.originalColumn = original.column;\n if (original.name != null) {\n mapping.name = original.name;\n }\n }\n }\n\n var source = mapping.source;\n if (source != null && !newSources.has(source)) {\n newSources.add(source);\n }\n\n var name = mapping.name;\n if (name != null && !newNames.has(name)) {\n newNames.add(name);\n }\n\n }, this);\n this._sources = newSources;\n this._names = newNames;\n\n // Copy sourcesContents of applied map.\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aSourceMapPath != null) {\n sourceFile = util.join(aSourceMapPath, sourceFile);\n }\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n this.setSourceContent(sourceFile, content);\n }\n }, this);\n };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n * 1. Just the generated position.\n * 2. The Generated position, original position, and original source.\n * 3. Generated and original position, original source, as well as a name\n * token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n aName) {\n // When aOriginal is truthy but has empty values for .line and .column,\n // it is most likely a programmer error. In this case we throw a very\n // specific error message to try to guide them the right way.\n // For example: https://github.com/Polymer/polymer-bundler/pull/519\n if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n throw new Error(\n 'original.line and original.column are not numbers -- you probably meant to omit ' +\n 'the original mapping entirely and only map the generated position. If so, pass ' +\n 'null for the original mapping instead of an object with empty or null values.'\n );\n }\n\n if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aGenerated.line > 0 && aGenerated.column >= 0\n && !aOriginal && !aSource && !aName) {\n // Case 1.\n return;\n }\n else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n && aGenerated.line > 0 && aGenerated.column >= 0\n && aOriginal.line > 0 && aOriginal.column >= 0\n && aSource) {\n // Cases 2 and 3.\n return;\n }\n else {\n throw new Error('Invalid mapping: ' + JSON.stringify({\n generated: aGenerated,\n source: aSource,\n original: aOriginal,\n name: aName\n }));\n }\n };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n function SourceMapGenerator_serializeMappings() {\n var previousGeneratedColumn = 0;\n var previousGeneratedLine = 1;\n var previousOriginalColumn = 0;\n var previousOriginalLine = 0;\n var previousName = 0;\n var previousSource = 0;\n var result = '';\n var next;\n var mapping;\n var nameIdx;\n var sourceIdx;\n\n var mappings = this._mappings.toArray();\n for (var i = 0, len = mappings.length; i < len; i++) {\n mapping = mappings[i];\n next = ''\n\n if (mapping.generatedLine !== previousGeneratedLine) {\n previousGeneratedColumn = 0;\n while (mapping.generatedLine !== previousGeneratedLine) {\n next += ';';\n previousGeneratedLine++;\n }\n }\n else {\n if (i > 0) {\n if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n continue;\n }\n next += ',';\n }\n }\n\n next += base64VLQ.encode(mapping.generatedColumn\n - previousGeneratedColumn);\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (mapping.source != null) {\n sourceIdx = this._sources.indexOf(mapping.source);\n next += base64VLQ.encode(sourceIdx - previousSource);\n previousSource = sourceIdx;\n\n // lines are stored 0-based in SourceMap spec version 3\n next += base64VLQ.encode(mapping.originalLine - 1\n - previousOriginalLine);\n previousOriginalLine = mapping.originalLine - 1;\n\n next += base64VLQ.encode(mapping.originalColumn\n - previousOriginalColumn);\n previousOriginalColumn = mapping.originalColumn;\n\n if (mapping.name != null) {\n nameIdx = this._names.indexOf(mapping.name);\n next += base64VLQ.encode(nameIdx - previousName);\n previousName = nameIdx;\n }\n }\n\n result += next;\n }\n\n return result;\n };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n return aSources.map(function (source) {\n if (!this._sourcesContents) {\n return null;\n }\n if (aSourceRoot != null) {\n source = util.relative(aSourceRoot, source);\n }\n var key = util.toSetString(source);\n return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n ? this._sourcesContents[key]\n : null;\n }, this);\n };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n function SourceMapGenerator_toJSON() {\n var map = {\n version: this._version,\n sources: this._sources.toArray(),\n names: this._names.toArray(),\n mappings: this._serializeMappings()\n };\n if (this._file != null) {\n map.file = this._file;\n }\n if (this._sourceRoot != null) {\n map.sourceRoot = this._sourceRoot;\n }\n if (this._sourcesContents) {\n map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n }\n\n return map;\n };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n function SourceMapGenerator_toString() {\n return JSON.stringify(this.toJSON());\n };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n * generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n this.children = [];\n this.sourceContents = {};\n this.line = aLine == null ? null : aLine;\n this.column = aColumn == null ? null : aColumn;\n this.source = aSource == null ? null : aSource;\n this.name = aName == null ? null : aName;\n this[isSourceNode] = true;\n if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n * SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n // The SourceNode we want to fill with the generated code\n // and the SourceMap\n var node = new SourceNode();\n\n // All even indices of this array are one line of the generated code,\n // while all odd indices are the newlines between two adjacent lines\n // (since `REGEX_NEWLINE` captures its match).\n // Processed fragments are accessed by calling `shiftNextLine`.\n var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n var remainingLinesIndex = 0;\n var shiftNextLine = function() {\n var lineContents = getNextLine();\n // The last line of a file might not have a newline.\n var newLine = getNextLine() || \"\";\n return lineContents + newLine;\n\n function getNextLine() {\n return remainingLinesIndex < remainingLines.length ?\n remainingLines[remainingLinesIndex++] : undefined;\n }\n };\n\n // We need to remember the position of \"remainingLines\"\n var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n // The generate SourceNodes we need a code range.\n // To extract it current and last mapping is used.\n // Here we store the last mapping.\n var lastMapping = null;\n\n aSourceMapConsumer.eachMapping(function (mapping) {\n if (lastMapping !== null) {\n // We add the code from \"lastMapping\" to \"mapping\":\n // First check if there is a new line in between.\n if (lastGeneratedLine < mapping.generatedLine) {\n // Associate first line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n lastGeneratedLine++;\n lastGeneratedColumn = 0;\n // The remaining code is added without mapping\n } else {\n // There is no new line in between.\n // Associate the code between \"lastGeneratedColumn\" and\n // \"mapping.generatedColumn\" with \"lastMapping\"\n var nextLine = remainingLines[remainingLinesIndex] || '';\n var code = nextLine.substr(0, mapping.generatedColumn -\n lastGeneratedColumn);\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n lastGeneratedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n addMappingWithCode(lastMapping, code);\n // No more remaining code, continue\n lastMapping = mapping;\n return;\n }\n }\n // We add the generated code until the first mapping\n // to the SourceNode without any mapping.\n // Each line is added as separate string.\n while (lastGeneratedLine < mapping.generatedLine) {\n node.add(shiftNextLine());\n lastGeneratedLine++;\n }\n if (lastGeneratedColumn < mapping.generatedColumn) {\n var nextLine = remainingLines[remainingLinesIndex] || '';\n node.add(nextLine.substr(0, mapping.generatedColumn));\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n }\n lastMapping = mapping;\n }, this);\n // We have processed all mappings.\n if (remainingLinesIndex < remainingLines.length) {\n if (lastMapping) {\n // Associate the remaining code in the current line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n }\n // and add the remaining lines without any mapping\n node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n }\n\n // Copy sourcesContent into SourceNode\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aRelativePath != null) {\n sourceFile = util.join(aRelativePath, sourceFile);\n }\n node.setSourceContent(sourceFile, content);\n }\n });\n\n return node;\n\n function addMappingWithCode(mapping, code) {\n if (mapping === null || mapping.source === undefined) {\n node.add(code);\n } else {\n var source = aRelativePath\n ? util.join(aRelativePath, mapping.source)\n : mapping.source;\n node.add(new SourceNode(mapping.originalLine,\n mapping.originalColumn,\n source,\n code,\n mapping.name));\n }\n }\n };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n if (Array.isArray(aChunk)) {\n aChunk.forEach(function (chunk) {\n this.add(chunk);\n }, this);\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n if (aChunk) {\n this.children.push(aChunk);\n }\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n if (Array.isArray(aChunk)) {\n for (var i = aChunk.length-1; i >= 0; i--) {\n this.prepend(aChunk[i]);\n }\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n this.children.unshift(aChunk);\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n var chunk;\n for (var i = 0, len = this.children.length; i < len; i++) {\n chunk = this.children[i];\n if (chunk[isSourceNode]) {\n chunk.walk(aFn);\n }\n else {\n if (chunk !== '') {\n aFn(chunk, { source: this.source,\n line: this.line,\n column: this.column,\n name: this.name });\n }\n }\n }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n var newChildren;\n var i;\n var len = this.children.length;\n if (len > 0) {\n newChildren = [];\n for (i = 0; i < len-1; i++) {\n newChildren.push(this.children[i]);\n newChildren.push(aSep);\n }\n newChildren.push(this.children[i]);\n this.children = newChildren;\n }\n return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n var lastChild = this.children[this.children.length - 1];\n if (lastChild[isSourceNode]) {\n lastChild.replaceRight(aPattern, aReplacement);\n }\n else if (typeof lastChild === 'string') {\n this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n }\n else {\n this.children.push(''.replace(aPattern, aReplacement));\n }\n return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n function SourceNode_walkSourceContents(aFn) {\n for (var i = 0, len = this.children.length; i < len; i++) {\n if (this.children[i][isSourceNode]) {\n this.children[i].walkSourceContents(aFn);\n }\n }\n\n var sources = Object.keys(this.sourceContents);\n for (var i = 0, len = sources.length; i < len; i++) {\n aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n }\n };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n var str = \"\";\n this.walk(function (chunk) {\n str += chunk;\n });\n return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n var generated = {\n code: \"\",\n line: 1,\n column: 0\n };\n var map = new SourceMapGenerator(aArgs);\n var sourceMappingActive = false;\n var lastOriginalSource = null;\n var lastOriginalLine = null;\n var lastOriginalColumn = null;\n var lastOriginalName = null;\n this.walk(function (chunk, original) {\n generated.code += chunk;\n if (original.source !== null\n && original.line !== null\n && original.column !== null) {\n if(lastOriginalSource !== original.source\n || lastOriginalLine !== original.line\n || lastOriginalColumn !== original.column\n || lastOriginalName !== original.name) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n lastOriginalSource = original.source;\n lastOriginalLine = original.line;\n lastOriginalColumn = original.column;\n lastOriginalName = original.name;\n sourceMappingActive = true;\n } else if (sourceMappingActive) {\n map.addMapping({\n generated: {\n line: generated.line,\n column: generated.column\n }\n });\n lastOriginalSource = null;\n sourceMappingActive = false;\n }\n for (var idx = 0, length = chunk.length; idx < length; idx++) {\n if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n generated.line++;\n generated.column = 0;\n // Mappings end at eol\n if (idx + 1 === length) {\n lastOriginalSource = null;\n sourceMappingActive = false;\n } else if (sourceMappingActive) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n } else {\n generated.column++;\n }\n }\n });\n this.walkSourceContents(function (sourceFile, sourceContent) {\n map.setSourceContent(sourceFile, sourceContent);\n });\n\n return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n if (aName in aArgs) {\n return aArgs[aName];\n } else if (arguments.length === 3) {\n return aDefaultValue;\n } else {\n throw new Error('\"' + aName + '\" is a required argument.');\n }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n var match = aUrl.match(urlRegexp);\n if (!match) {\n return null;\n }\n return {\n scheme: match[1],\n auth: match[2],\n host: match[3],\n port: match[4],\n path: match[5]\n };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n var url = '';\n if (aParsedUrl.scheme) {\n url += aParsedUrl.scheme + ':';\n }\n url += '//';\n if (aParsedUrl.auth) {\n url += aParsedUrl.auth + '@';\n }\n if (aParsedUrl.host) {\n url += aParsedUrl.host;\n }\n if (aParsedUrl.port) {\n url += \":\" + aParsedUrl.port\n }\n if (aParsedUrl.path) {\n url += aParsedUrl.path;\n }\n return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n var path = aPath;\n var url = urlParse(aPath);\n if (url) {\n if (!url.path) {\n return aPath;\n }\n path = url.path;\n }\n var isAbsolute = exports.isAbsolute(path);\n\n var parts = path.split(/\\/+/);\n for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n part = parts[i];\n if (part === '.') {\n parts.splice(i, 1);\n } else if (part === '..') {\n up++;\n } else if (up > 0) {\n if (part === '') {\n // The first part is blank if the path is absolute. Trying to go\n // above the root is a no-op. Therefore we can remove all '..' parts\n // directly after the root.\n parts.splice(i + 1, up);\n up = 0;\n } else {\n parts.splice(i, 2);\n up--;\n }\n }\n }\n path = parts.join('/');\n\n if (path === '') {\n path = isAbsolute ? '/' : '.';\n }\n\n if (url) {\n url.path = path;\n return urlGenerate(url);\n }\n return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n * scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n * first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n * is updated with the result and aRoot is returned. Otherwise the result\n * is returned.\n * - If aPath is absolute, the result is aPath.\n * - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n if (aPath === \"\") {\n aPath = \".\";\n }\n var aPathUrl = urlParse(aPath);\n var aRootUrl = urlParse(aRoot);\n if (aRootUrl) {\n aRoot = aRootUrl.path || '/';\n }\n\n // `join(foo, '//www.example.org')`\n if (aPathUrl && !aPathUrl.scheme) {\n if (aRootUrl) {\n aPathUrl.scheme = aRootUrl.scheme;\n }\n return urlGenerate(aPathUrl);\n }\n\n if (aPathUrl || aPath.match(dataUrlRegexp)) {\n return aPath;\n }\n\n // `join('http://', 'www.example.com')`\n if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n aRootUrl.host = aPath;\n return urlGenerate(aRootUrl);\n }\n\n var joined = aPath.charAt(0) === '/'\n ? aPath\n : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n if (aRootUrl) {\n aRootUrl.path = joined;\n return urlGenerate(aRootUrl);\n }\n return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n\n aRoot = aRoot.replace(/\\/$/, '');\n\n // It is possible for the path to be above the root. In this case, simply\n // checking whether the root is a prefix of the path won't work. Instead, we\n // need to remove components from the root one by one, until either we find\n // a prefix that fits, or we run out of components to remove.\n var level = 0;\n while (aPath.indexOf(aRoot + '/') !== 0) {\n var index = aRoot.lastIndexOf(\"/\");\n if (index < 0) {\n return aPath;\n }\n\n // If the only part of the root that is left is the scheme (i.e. http://,\n // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n // have exhausted all components, so the path is not relative to the root.\n aRoot = aRoot.slice(0, index);\n if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n return aPath;\n }\n\n ++level;\n }\n\n // Make sure we add a \"../\" for each component we removed from the root.\n return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n var obj = Object.create(null);\n return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n if (isProtoString(aStr)) {\n return '$' + aStr;\n }\n\n return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n if (isProtoString(aStr)) {\n return aStr.slice(1);\n }\n\n return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n if (!s) {\n return false;\n }\n\n var length = s.length;\n\n if (length < 9 /* \"__proto__\".length */) {\n return false;\n }\n\n if (s.charCodeAt(length - 1) !== 95 /* '_' */ ||\n s.charCodeAt(length - 2) !== 95 /* '_' */ ||\n s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n s.charCodeAt(length - 8) !== 95 /* '_' */ ||\n s.charCodeAt(length - 9) !== 95 /* '_' */) {\n return false;\n }\n\n for (var i = length - 10; i >= 0; i--) {\n if (s.charCodeAt(i) !== 36 /* '$' */) {\n return false;\n }\n }\n\n return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n var cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0 || onlyCompareOriginal) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0 || onlyCompareGenerated) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n if (aStr1 === aStr2) {\n return 0;\n }\n\n if (aStr1 === null) {\n return 1; // aStr2 !== null\n }\n\n if (aStr2 === null) {\n return -1; // aStr1 !== null\n }\n\n if (aStr1 > aStr2) {\n return 1;\n }\n\n return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n sourceURL = sourceURL || '';\n\n if (sourceRoot) {\n // This follows what Chrome does.\n if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n sourceRoot += '/';\n }\n // The spec says:\n // Line 4: An optional source root, useful for relocating source\n // files on a server or removing repeated values in the\n // “sources” entry. This value is prepended to the individual\n // entries in the “source” field.\n sourceURL = sourceRoot + sourceURL;\n }\n\n // Historically, SourceMapConsumer did not take the sourceMapURL as\n // a parameter. This mode is still somewhat supported, which is why\n // this code block is conditional. However, it's preferable to pass\n // the source map URL to SourceMapConsumer, so that this function\n // can implement the source URL resolution algorithm as outlined in\n // the spec. This block is basically the equivalent of:\n // new URL(sourceURL, sourceMapURL).toString()\n // ... except it avoids using URL, which wasn't available in the\n // older releases of node still supported by this library.\n //\n // The spec says:\n // If the sources are not absolute URLs after prepending of the\n // “sourceRoot”, the sources are resolved relative to the\n // SourceMap (like resolving script src in a html document).\n if (sourceMapURL) {\n var parsed = urlParse(sourceMapURL);\n if (!parsed) {\n throw new Error(\"sourceMapURL could not be parsed\");\n }\n if (parsed.path) {\n // Strip the last path component, but keep the \"/\".\n var index = parsed.path.lastIndexOf('/');\n if (index >= 0) {\n parsed.path = parsed.path.substring(0, index + 1);\n }\n }\n sourceURL = join(urlGenerate(parsed), sourceURL);\n }\n\n return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n","/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n"],"sourceRoot":""}
Close
