mirror of https://github.com/go-sonic/sonic.git
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1 line
24 KiB
JavaScript
1 line
24 KiB
JavaScript
2 years ago
|
"use strict";(self["webpackChunkhalo_admin"]=self["webpackChunkhalo_admin"]||[]).push([[192],{8192:function(t,e,s){s.d(e,{IK:function(){return T},Jq:function(){return p},WQ:function(){return N}});var i,h=s(17918);class r{constructor(t,e,s,i,h,r,n,o,a,l=0,c){this.p=t,this.stack=e,this.state=s,this.reducePos=i,this.pos=h,this.score=r,this.buffer=n,this.bufferBase=o,this.curContext=a,this.lookAhead=l,this.parent=c}toString(){return`[${this.stack.filter(((t,e)=>e%3==0)).concat(this.state)}]@${this.pos}${this.score?"!"+this.score:""}`}static start(t,e,s=0){let i=t.parser.context;return new r(t,[],e,s,s,0,[],0,i?new n(i,i.start):null,0,null)}get context(){return this.curContext?this.curContext.context:null}pushState(t,e){this.stack.push(this.state,e,this.bufferBase+this.buffer.length),this.state=t}reduce(t){let e=t>>19,s=65535&t,{parser:i}=this.p,h=i.dynamicPrecedence(s);if(h&&(this.score+=h),0==e)return s<i.minRepeatTerm&&this.storeNode(s,this.reducePos,this.reducePos,4,!0),this.pushState(i.getGoto(this.state,s,!0),this.reducePos),void this.reduceContext(s,this.reducePos);let r=this.stack.length-3*(e-1)-(262144&t?6:0),n=this.stack[r-2],o=this.stack[r-1],a=this.bufferBase+this.buffer.length-o;if(s<i.minRepeatTerm||131072&t){let t=i.stateFlag(this.state,1)?this.pos:this.reducePos;this.storeNode(s,n,t,a+4,!0)}if(262144&t)this.state=this.stack[r];else{let t=this.stack[r-3];this.state=i.getGoto(t,s,!0)}while(this.stack.length>r)this.stack.pop();this.reduceContext(s,n)}storeNode(t,e,s,i=4,h=!1){if(0==t){let t=this,i=this.buffer.length;if(0==i&&t.parent&&(i=t.bufferBase-t.parent.bufferBase,t=t.parent),i>0&&0==t.buffer[i-4]&&t.buffer[i-1]>-1){if(e==s)return;if(t.buffer[i-2]>=e)return void(t.buffer[i-2]=s)}}if(h&&this.pos!=s){let h=this.buffer.length;if(h>0&&0!=this.buffer[h-4])while(h>0&&this.buffer[h-2]>s)this.buffer[h]=this.buffer[h-4],this.buffer[h+1]=this.buffer[h-3],this.buffer[h+2]=this.buffer[h-2],this.buffer[h+3]=this.buffer[h-1],h-=4,i>4&&(i-=4);this.buffer[h]=t,this.buffer[h+1]=e,this.buffer[h+2]=s,this.buffer[h+3]=i}else this.buffer.push(t,e,s,i)}shift(t,e,s){let i=this.pos;if(131072&t)this.pushState(65535&t,this.pos);else if(0==(262144&t)){let h=t,{parser:r}=this.p;(s>this.pos||e<=r.maxNode)&&(this.pos=s,r.stateFlag(h,1)||(this.reducePos=s)),this.pushState(h,i),this.shiftContext(e,i),e<=r.maxNode&&this.buffer.push(e,i,s,4)}else this.pos=s,this.shiftContext(e,i),e<=this.p.parser.maxNode&&this.buffer.push(e,i,s,4)}apply(t,e,s){65536&t?this.reduce(t):this.shift(t,e,s)}useNode(t,e){let s=this.p.reused.length-1;(s<0||this.p.reused[s]!=t)&&(this.p.reused.push(t),s++);let i=this.pos;this.reducePos=this.pos=i+t.length,this.pushState(e,i),this.buffer.push(s,i,this.reducePos,-1),this.curContext&&this.updateContext(this.curContext.tracker.reuse(this.curContext.context,t,this,this.p.stream.reset(this.pos-t.length)))}split(){let t=this,e=t.buffer.length;while(e>0&&t.buffer[e-2]>t.reducePos)e-=4;let s=t.buffer.slice(e),i=t.bufferBase+e;while(t&&i==t.bufferBase)t=t.parent;return new r(this.p,this.stack.slice(),this.state,this.reducePos,this.pos,this.score,s,i,this.curContext,this.lookAhead,t)}recoverByDelete(t,e){let s=t<=this.p.parser.maxNode;s&&this.storeNode(t,this.pos,e,4),this.storeNode(0,this.pos,e,s?8:4),this.pos=this.reducePos=e,this.score-=190}canShift(t){for(let e=new o(this);;){let s=this.p.parser.stateSlot(e.state,4)||this.p.parser.hasAction(e.state,t);if(0==(65536&s))return!0;if(0==s)return!1;e.reduce(s)}}recoverByInsert(t){if(this.stack.length>=300)return[];let e=this.p.parser.nextStates(this.state);if(e.length>8||this.stack.length>=120){let s=[];for(let i,h=0;h<e.length;h+=2)(i=e[h+1])!=this.state&&this.p.parser.hasAction(i,t)&&s.push(e[h],i);if(this.stack.length<120)for(let t=0;s.length<8&&t<e.length;t+=2){let i=e[t+1];s.some(((t,e)=>1&e&&t==i))||s.push(e[t],i)}e=s}let s=[];for(let i=0;i<e.length&&s.length<4;i+=2){let t=e[i+1];if(t==this.state)continue;let h=this.split();h.storeNode(0,h.pos,h.pos,4,!0),h.pushState(t,this.pos),h.shiftContext(e[i],this.pos),h.score-=200,s.push(h)}return s}forceReduce(){let t=this.p.parser
|