11 lines
388 KiB
JavaScript
11 lines
388 KiB
JavaScript
|
/*
|
||
|
|
@license
|
||
|
|
Rollup.js v2.79.1
|
||
|
|
Thu, 22 Sep 2022 04:55:29 GMT - commit 69ff4181e701a0fe0026d0ba147f31bc86beffa8
|
||
|
|
|
||
|
|
https://github.com/rollup/rollup
|
||
|
|
|
||
|
|
Released under the MIT License.
|
||
|
|
*/
|
||
|
|
for(var e="2.79.1",t={},i="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",s=0;s<i.length;s++)t[i.charCodeAt(s)]=s;function n(e,t,i){4===i?e.push([t[0],t[1],t[2],t[3]]):5===i?e.push([t[0],t[1],t[2],t[3],t[4]]):1===i&&e.push([t[0]])}function r(e){var t="";e=e<0?-e<<1|1:e<<1;do{var s=31&e;(e>>>=5)>0&&(s|=32),t+=i[s]}while(e>0);return t}class a{constructor(e){this.bits=e instanceof a?e.bits.slice():[]}add(e){this.bits[e>>5]|=1<<(31&e)}has(e){return!!(this.bits[e>>5]&1<<(31&e))}}class o{constructor(e,t,i){this.start=e,this.end=t,this.original=i,this.intro="",this.outro="",this.content=i,this.storeName=!1,this.edited=!1,Object.defineProperties(this,{previous:{writable:!0,value:null},next:{writable:!0,value:null}})}appendLeft(e){this.outro+=e}appendRight(e){this.intro=this.intro+e}clone(){const e=new o(this.start,this.end,this.original);return e.intro=this.intro,e.outro=this.outro,e.content=this.content,e.storeName=this.storeName,e.edited=this.edited,e}contains(e){return this.start<e&&e<this.end}eachNext(e){let t=this;for(;t;)e(t),t=t.next}eachPrevious(e){let t=this;for(;t;)e(t),t=t.previous}edit(e,t,i){return this.content=e,i||(this.intro="",this.outro=""),this.storeName=t,this.edited=!0,this}prependLeft(e){this.outro=e+this.outro}prependRight(e){this.intro=e+this.intro}split(e){const t=e-this.start,i=this.original.slice(0,t),s=this.original.slice(t);this.original=i;const n=new o(e,this.end,s);return n.outro=this.outro,this.outro="",this.end=e,this.edited?(n.edit("",!1),this.content=""):this.content=i,n.next=this.next,n.next&&(n.next.previous=n),n.previous=this,this.next=n,n}toString(){return this.intro+this.content+this.outro}trimEnd(e){if(this.outro=this.outro.replace(e,""),this.outro.length)return!0;const t=this.content.replace(e,"");return t.length?(t!==this.content&&this.split(this.start+t.length).edit("",void 0,!0),!0):(this.edit("",void 0,!0),this.intro=this.intro.replace(e,""),!!this.intro.length||void 0)}trimStart(e){if(this.intro=this.intro.replace(e,""),this.intro.length)return!0;const t=this.content.replace(e,"");return t.length?(t!==this.content&&(this.split(this.end-t.length),this.edit("",void 0,!0)),!0):(this.edit("",void 0,!0),this.outro=this.outro.replace(e,""),!!this.outro.length||void 0)}}let l=()=>{throw new Error("Unsupported environment: `window.btoa` or `Buffer` should be supported.")};"undefined"!=typeof window&&"function"==typeof window.btoa?l=e=>window.btoa(unescape(encodeURIComponent(e))):"function"==typeof Buffer&&(l=e=>Buffer.from(e,"utf-8").toString("base64"));class h{constructor(e){this.version=3,this.file=e.file,this.sources=e.sources,this.sourcesContent=e.sourcesContent,this.names=e.names,this.mappings=function(e){for(var t=0,i=0,s=0,n=0,a="",o=0;o<e.length;o++){var l=e[o];if(o>0&&(a+=";"),0!==l.length){for(var h=0,c=[],u=0,d=l;u<d.length;u++){var p=d[u],f=r(p[0]-h);h=p[0],p.length>1&&(f+=r(p[1]-t)+r(p[2]-i)+r(p[3]-s),t=p[1],i=p[2],s=p[3]),5===p.length&&(f+=r(p[4]-n),n=p[4]),c.push(f)}a+=c.join(",")}}return a}(e.mappings)}toString(){return JSON.stringify(this)}toUrl(){return"data:application/json;charset=utf-8;base64,"+l(this.toString())}}function c(e){const t=e.split("\n"),i=t.filter((e=>/^\t+/.test(e))),s=t.filter((e=>/^ {2,}/.test(e)));if(0===i.length&&0===s.length)return null;if(i.length>=s.length)return"\t";const n=s.reduce(((e,t)=>{const i=/^ +/.exec(t)[0].length;return Math.min(i,e)}),1/0);return new Array(n+1).join(" ")}function u(e,t){const i=e.split(/[/\\]/),s=t.split(/[/\\]/);for(i.pop();i[0]===s[0];)i.shift(),s.shift();if(i.length){let e=i.length;for(;e--;)i[e]=".."}return i.concat(s).join("/")}const d=Object.prototype.toString;function p(e){return"[object Object]"===d.call(e)}function f(e){const t=e.split("\n"),i=[];for(let e=0,s=0;e<t.length;e++)i.push(s),s+=t[e].length+1;return function(e){let t=0,s=i.length;for(;t<s;){const n=t+s>>1;e<i[n]?s=n:t=n+1}const n=t-1;return{line:n,column:e-i[n]}}}class m{constructor(e){this.hires=e,this.generatedCodeLine=0,this.generatedCodeColumn=0,this.raw=[],this.rawSegments=this.raw[this.generatedCodeLine]=[],this.pending=null
|