@yorkie-js/schema 0.6.22 → 0.6.24

package/dist/yorkie-js-schema.es.js

@@ -5887,7 +5887,7 @@ function zi() {
       return (this.altAndOuterContextDepth & e) !== 0;
     }
     set isPrecedenceFilterSuppressed(x) {
-      x ? this.altAndOuterContextDepth |= e : this.altAndOuterContextDepth &= 2147483647;
+      x ? this.altAndOuterContextDepth |= e : this.altAndOuterContextDepth &= ~e;
     }
     /** An ATN configuration is equal to another if both have
      *  the same state, they predict the same alternative, and

package/dist/yorkie-js-schema.js

@@ -169,7 +169,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
  */var i=Br&&Br.__decorate||function(g,x,m,y){var _=arguments.length,v=_<3?x:y===null?y=Object.getOwnPropertyDescriptor(x,m):y,N;if(typeof Reflect=="object"&&typeof Reflect.decorate=="function")v=Reflect.decorate(g,x,m,y);else for(var T=g.length-1;T>=0;T--)(N=g[T])&&(v=(_<3?N(v):_>3?N(x,m,v):N(x,m))||v);return _>3&&v&&Object.defineProperty(x,m,v),v},c=Br&&Br.__param||function(g,x){return function(m,y){x(m,y,g)}};Object.defineProperty(u,"__esModule",{value:!0}),u.SingletonPredictionContext=u.PredictionContext=void 0;const h=jn(),p=xr(),a=Fs(),r=we(),n=Q(),t=qs(),s=Me(),e=1;let o=class je{constructor(x){this.cachedHashCode=x}static calculateEmptyHashCode(){let x=r.MurmurHash.initialize(e);return x=r.MurmurHash.finish(x,0),x}static calculateSingleHashCode(x,m){let y=r.MurmurHash.initialize(e);return y=r.MurmurHash.update(y,x),y=r.MurmurHash.update(y,m),y=r.MurmurHash.finish(y,2),y}static calculateHashCode(x,m){let y=r.MurmurHash.initialize(e);for(let _ of x)y=r.MurmurHash.update(y,_);for(let _ of m)y=r.MurmurHash.update(y,_);return y=r.MurmurHash.finish(y,2*x.length),y}static fromRuleContext(x,m,y=!0){if(m.isEmpty)return y?je.EMPTY_FULL:je.EMPTY_LOCAL;let _;m._parent?_=je.fromRuleContext(x,m._parent,y):_=y?je.EMPTY_FULL:je.EMPTY_LOCAL;let N=x.states[m.invokingState].transition(0);return _.getChild(N.followState.stateNumber)}static addEmptyContext(x){return x.addEmptyContext()}static removeEmptyContext(x){return x.removeEmptyContext()}static join(x,m,y=t.PredictionContextCache.UNCACHED){if(x===m)return x;if(x.isEmpty)return je.isEmptyLocal(x)?x:je.addEmptyContext(m);if(m.isEmpty)return je.isEmptyLocal(m)?m:je.addEmptyContext(x);let _=x.size,v=m.size;if(_===1&&v===1&&x.getReturnState(0)===m.getReturnState(0)){let U=y.join(x.getParent(0),m.getParent(0));return U===x.getParent(0)?x:U===m.getParent(0)?m:U.getChild(x.getReturnState(0))}let N=0,T=new Array(_+v),b=new Array(T.length),O=0,D=0,k=!0,z=!0;for(;O<_&&D<v;)x.getReturnState(O)===m.getReturnState(D)?(T[N]=y.join(x.getParent(O),m.getParent(D)),b[N]=x.getReturnState(O),k=k&&T[N]===x.getParent(O),z=z&&T[N]===m.getParent(D),O++,D++):x.getReturnState(O)<m.getReturnState(D)?(T[N]=x.getParent(O),b[N]=x.getReturnState(O),z=!1,O++):(s(m.getReturnState(D)<x.getReturnState(O)),T[N]=m.getParent(D),b[N]=m.getReturnState(D),k=!1,D++),N++;for(;O<_;)T[N]=x.getParent(O),b[N]=x.getReturnState(O),O++,z=!1,N++;for(;D<v;)T[N]=m.getParent(D),b[N]=m.getReturnState(D),D++,k=!1,N++;return k?x:z?m:(N<T.length&&(T=T.slice(0,N),b=b.slice(0,N)),T.length===0?je.EMPTY_FULL:T.length===1?new d(T[0],b[0]):new f(T,b))}static isEmptyLocal(x){return x===je.EMPTY_LOCAL}static getCachedContext(x,m,y){if(x.isEmpty)return x;let _=y.get(x);if(_)return _;if(_=m.get(x),_)return y.put(x,_),_;let v=!1,N=new Array(x.size);for(let b=0;b<N.length;b++){let O=je.getCachedContext(x.getParent(b),m,y);if(v||O!==x.getParent(b)){if(!v){N=new Array(x.size);for(let D=0;D<x.size;D++)N[D]=x.getParent(D);v=!0}N[b]=O}}if(!v)return _=m.putIfAbsent(x,x),y.put(x,_??x),x;let T;if(N.length===1)T=new d(N[0],x.getReturnState(0));else{let b=new Array(x.size);for(let O=0;O<x.size;O++)b[O]=x.getReturnState(O);T=new f(N,b,x.hashCode())}return _=m.putIfAbsent(T,T),y.put(T,_||T),y.put(x,_||T),T}appendSingleContext(x,m){return this.appendContext(je.EMPTY_FULL.getChild(x),m)}getChild(x){return new d(this,x)}hashCode(){return this.cachedHashCode}toStrings(x,m,y=je.EMPTY_FULL){let _=[];e:for(let v=0;;v++){let N=0,T=!0,b=this,O=m,D="";for(D+="[";!b.isEmpty&&b!==y;){let k=0;if(b.size>0){let z=1;for(;1<<z>>>0<b.size;)z++;let U=(1<<z>>>0)-1;if(k=v>>N&U,T=T&&k>=b.size-1,k>=b.size)continue e;N+=z}if(x){D.length>1&&(D+=" ");let U=x.atn.states[O],re=x.ruleNames[U.ruleIndex];D+=re}else b.getReturnState(k)!==je.EMPTY_FULL_STATE_KEY&&(b.isEmpty||(D.length>1&&(D+=" "),D+=b.getReturnState(k)));O=b.getReturnState(k),b=b.getParent(k)}if(D+="]",_.push(D),T)break}return _}};i([n.Override],o.prototype,"hashCode",null),i([c(0,n.NotNull),c(1,n.NotNull),c(2,n.NotNull)],o,"join",null),i([c(0,n.NotNull),c(1,n.NotNull),c(2,n.NotNull)],o,"getCachedContext",null),u.PredictionContext=o;class l extends o{constructor(x){super(o.calculateEmptyHashCode()),this.fullContext=x}get isFullContext(){return this.fullContext}addEmptyContext(){return this}removeEmptyContext(){throw new Error("Cannot remove the empty context from itself.")}getParent(x){throw new Error("index out of bounds")}getReturnState(x){throw new Error("index out of bounds")}findReturnState(x){return-1}get size(){return 0}appendSingleContext(x,m){return m.getChild(this,x)}appendContext(x,m){return x}get isEmpty(){return!0}get hasEmpty(){return!0}equals(x){return this===x}toStrings(x,m,y){return["[]"]}}i([n.Override],l.prototype,"addEmptyContext",null),i([n.Override],l.prototype,"removeEmptyContext",null),i([n.Override],l.prototype,"getParent",null),i([n.Override],l.prototype,"getReturnState",null),i([n.Override],l.prototype,"findReturnState",null),i([n.Override],l.prototype,"size",null),i([n.Override],l.prototype,"appendSingleContext",null),i([n.Override],l.prototype,"appendContext",null),i([n.Override],l.prototype,"isEmpty",null),i([n.Override],l.prototype,"hasEmpty",null),i([n.Override],l.prototype,"equals",null),i([n.Override],l.prototype,"toStrings",null);let f=class Dn extends o{constructor(x,m,y){super(y||o.calculateHashCode(x,m)),s(x.length===m.length),s(m.length>1||m[0]!==o.EMPTY_FULL_STATE_KEY,"Should be using PredictionContext.EMPTY instead."),this.parents=x,this.returnStates=m}getParent(x){return this.parents[x]}getReturnState(x){return this.returnStates[x]}findReturnState(x){return a.Arrays.binarySearch(this.returnStates,x)}get size(){return this.returnStates.length}get isEmpty(){return!1}get hasEmpty(){return this.returnStates[this.returnStates.length-1]===o.EMPTY_FULL_STATE_KEY}addEmptyContext(){if(this.hasEmpty)return this;let x=this.parents.slice(0),m=this.returnStates.slice(0);return x.push(o.EMPTY_FULL),m.push(o.EMPTY_FULL_STATE_KEY),new Dn(x,m)}removeEmptyContext(){if(!this.hasEmpty)return this;if(this.returnStates.length===2)return new d(this.parents[0],this.returnStates[0]);{let x=this.parents.slice(0,this.parents.length-1),m=this.returnStates.slice(0,this.returnStates.length-1);return new Dn(x,m)}}appendContext(x,m){return Dn.appendContextImpl(this,x,new o.IdentityHashMap)}static appendContextImpl(x,m,y){if(m.isEmpty){if(o.isEmptyLocal(m)){if(x.hasEmpty)return o.EMPTY_LOCAL;throw new Error("what to do here?")}return x}if(m.size!==1)throw new Error("Appending a tree suffix is not yet supported.");let _=y.get(x);if(!_){if(x.isEmpty)_=m;else{let v=x.size;x.hasEmpty&&v--;let N=new Array(v),T=new Array(v);for(let b=0;b<v;b++)T[b]=x.getReturnState(b);for(let b=0;b<v;b++)N[b]=Dn.appendContextImpl(x.getParent(b),m,y);N.length===1?_=new d(N[0],T[0]):(s(N.length>1),_=new Dn(N,T)),x.hasEmpty&&(_=o.join(_,m))}y.put(x,_)}return _}equals(x){if(this===x)return!0;if(!(x instanceof Dn)||this.hashCode()!==x.hashCode())return!1;let m=x;return this.equalsImpl(m,new p.Array2DHashSet)}equalsImpl(x,m){let y=[],_=[];for(y.push(this),_.push(x);;){let v=y.pop(),N=_.pop();if(!v||!N)break;let T=new t.PredictionContextCache.IdentityCommutativePredictionContextOperands(v,N);if(!m.add(T))continue;let b=T.x.size;if(b===0){if(!T.x.equals(T.y))return!1;continue}let O=T.y.size;if(b!==O)return!1;for(let D=0;D<b;D++){if(T.x.getReturnState(D)!==T.y.getReturnState(D))return!1;let k=T.x.getParent(D),z=T.y.getParent(D);if(k.hashCode()!==z.hashCode())return!1;k!==z&&(y.push(k),_.push(z))}}return!0}};i([n.NotNull],f.prototype,"parents",void 0),i([n.NotNull],f.prototype,"returnStates",void 0),i([n.Override],f.prototype,"getParent",null),i([n.Override],f.prototype,"getReturnState",null),i([n.Override],f.prototype,"findReturnState",null),i([n.Override],f.prototype,"size",null),i([n.Override],f.prototype,"isEmpty",null),i([n.Override],f.prototype,"hasEmpty",null),i([n.Override],f.prototype,"addEmptyContext",null),i([n.Override],f.prototype,"removeEmptyContext",null),i([n.Override],f.prototype,"appendContext",null),i([n.Override],f.prototype,"equals",null),f=i([c(0,n.NotNull)],f);let d=class op extends o{constructor(x,m){super(o.calculateSingleHashCode(x,m)),this.parent=x,this.returnState=m}getParent(x){return this.parent}getReturnState(x){return this.returnState}findReturnState(x){return this.returnState===x?0:-1}get size(){return 1}get isEmpty(){return!1}get hasEmpty(){return!1}appendContext(x,m){return m.getChild(this.parent.appendContext(x,m),this.returnState)}addEmptyContext(){let x=[this.parent,o.EMPTY_FULL],m=[this.returnState,o.EMPTY_FULL_STATE_KEY];return new f(x,m)}removeEmptyContext(){return this}equals(x){if(x===this)return!0;if(!(x instanceof op))return!1;let m=x;return this.hashCode()!==m.hashCode()?!1:this.returnState===m.returnState&&this.parent.equals(m.parent)}};i([n.NotNull],d.prototype,"parent",void 0),i([n.Override],d.prototype,"getParent",null),i([n.Override],d.prototype,"getReturnState",null),i([n.Override],d.prototype,"findReturnState",null),i([n.Override],d.prototype,"size",null),i([n.Override],d.prototype,"isEmpty",null),i([n.Override],d.prototype,"hasEmpty",null),i([n.Override],d.prototype,"appendContext",null),i([n.Override],d.prototype,"addEmptyContext",null),i([n.Override],d.prototype,"removeEmptyContext",null),i([n.Override],d.prototype,"equals",null),d=i([c(0,n.NotNull)],d),u.SingletonPredictionContext=d,function(g){g.EMPTY_LOCAL=new l(!1),g.EMPTY_FULL=new l(!0),g.EMPTY_LOCAL_STATE_KEY=-2147483648,g.EMPTY_FULL_STATE_KEY=(1<<31>>>0)-1;class x extends h.Array2DHashMap{constructor(){super(m.INSTANCE)}}g.IdentityHashMap=x;class m{IdentityEqualityComparator(){}hashCode(_){return _.hashCode()}equals(_,v){return _===v}}m.INSTANCE=new m,i([n.Override],m.prototype,"hashCode",null),i([n.Override],m.prototype,"equals",null),g.IdentityEqualityComparator=m}(o=u.PredictionContext||(u.PredictionContext={}))}(Br)),Br}var Xl;function Bi(){if(Xl)return _t;Xl=1;/*!
  * Copyright 2016 The ANTLR Project. All rights reserved.
  * Licensed under the BSD-3-Clause license. See LICENSE file in the project root for license information.
- */var u=_t&&_t.__decorate||function(g,x,m,y){var _=arguments.length,v=_<3?x:y===null?y=Object.getOwnPropertyDescriptor(x,m):y,N;if(typeof Reflect=="object"&&typeof Reflect.decorate=="function")v=Reflect.decorate(g,x,m,y);else for(var T=g.length-1;T>=0;T--)(N=g[T])&&(v=(_<3?N(v):_>3?N(x,m,v):N(x,m))||v);return _>3&&v&&Object.defineProperty(x,m,v),v},i=_t&&_t.__param||function(g,x){return function(m,y){x(m,y,g)}};Object.defineProperty(_t,"__esModule",{value:!0}),_t.ATNConfig=void 0;const c=jn(),h=Fr(),p=we(),a=Q(),r=nt(),n=Je(),t=Bn(),s=Me(),e=2147483648;let o=class Ti{constructor(x,m,y){typeof m=="number"?(s((m&16777215)===m),this._state=x,this.altAndOuterContextDepth=m,this._context=y):(this._state=x,this.altAndOuterContextDepth=m.altAndOuterContextDepth,this._context=y)}static create(x,m,y,_=t.SemanticContext.NONE,v){return _!==t.SemanticContext.NONE?v!=null?new d(v,_,x,m,y,!1):new l(_,x,m,y):v!=null?new f(v,x,m,y,!1):new Ti(x,m,y)}get state(){return this._state}get alt(){return this.altAndOuterContextDepth&16777215}get context(){return this._context}set context(x){this._context=x}get reachesIntoOuterContext(){return this.outerContextDepth!==0}get outerContextDepth(){return this.altAndOuterContextDepth>>>24&127}set outerContextDepth(x){s(x>=0),x=Math.min(x,127),this.altAndOuterContextDepth=x<<24|(this.altAndOuterContextDepth&-2130706433)>>>0}get lexerActionExecutor(){}get semanticContext(){return t.SemanticContext.NONE}get hasPassedThroughNonGreedyDecision(){return!1}clone(){return this.transform(this.state,!1)}transform(x,m,y){return y==null?this.transformImpl(x,this._context,this.semanticContext,m,this.lexerActionExecutor):y instanceof n.PredictionContext?this.transformImpl(x,y,this.semanticContext,m,this.lexerActionExecutor):y instanceof t.SemanticContext?this.transformImpl(x,this._context,y,m,this.lexerActionExecutor):this.transformImpl(x,this._context,this.semanticContext,m,y)}transformImpl(x,m,y,_,v){let N=_&&Ti.checkNonGreedyDecision(this,x);return y!==t.SemanticContext.NONE?v!=null||N?new d(v,y,x,this,m,N):new l(y,x,this,m):v!=null||N?new f(v,x,this,m,N):new Ti(x,this,m)}static checkNonGreedyDecision(x,m){return x.hasPassedThroughNonGreedyDecision||m instanceof h.DecisionState&&m.nonGreedy}appendContext(x,m){if(typeof x=="number"){let y=this.context.appendSingleContext(x,m);return this.transform(this.state,!1,y)}else{let y=this.context.appendContext(x,m);return this.transform(this.state,!1,y)}}contains(x){if(this.state.stateNumber!==x.state.stateNumber||this.alt!==x.alt||!this.semanticContext.equals(x.semanticContext))return!1;let m=[],y=[];for(m.push(this.context),y.push(x.context);;){let _=m.pop(),v=y.pop();if(!_||!v)break;if(_===v)return!0;if(_.size<v.size)return!1;if(v.isEmpty)return _.hasEmpty;for(let N=0;N<v.size;N++){let T=_.findReturnState(v.getReturnState(N));if(T<0)return!1;m.push(_.getParent(T)),y.push(v.getParent(N))}}return!1}get isPrecedenceFilterSuppressed(){return(this.altAndOuterContextDepth&e)!==0}set isPrecedenceFilterSuppressed(x){x?this.altAndOuterContextDepth|=e:this.altAndOuterContextDepth&=2147483647}equals(x){return this===x?!0:x instanceof Ti?this.state.stateNumber===x.state.stateNumber&&this.alt===x.alt&&this.reachesIntoOuterContext===x.reachesIntoOuterContext&&this.context.equals(x.context)&&this.semanticContext.equals(x.semanticContext)&&this.isPrecedenceFilterSuppressed===x.isPrecedenceFilterSuppressed&&this.hasPassedThroughNonGreedyDecision===x.hasPassedThroughNonGreedyDecision&&r.ObjectEqualityComparator.INSTANCE.equals(this.lexerActionExecutor,x.lexerActionExecutor):!1}hashCode(){let x=p.MurmurHash.initialize(7);return x=p.MurmurHash.update(x,this.state.stateNumber),x=p.MurmurHash.update(x,this.alt),x=p.MurmurHash.update(x,this.reachesIntoOuterContext?1:0),x=p.MurmurHash.update(x,this.context),x=p.MurmurHash.update(x,this.semanticContext),x=p.MurmurHash.update(x,this.hasPassedThroughNonGreedyDecision?1:0),x=p.MurmurHash.update(x,this.lexerActionExecutor),x=p.MurmurHash.finish(x,7),x}toDotString(){let x="";x+=`digraph G {
+ */var u=_t&&_t.__decorate||function(g,x,m,y){var _=arguments.length,v=_<3?x:y===null?y=Object.getOwnPropertyDescriptor(x,m):y,N;if(typeof Reflect=="object"&&typeof Reflect.decorate=="function")v=Reflect.decorate(g,x,m,y);else for(var T=g.length-1;T>=0;T--)(N=g[T])&&(v=(_<3?N(v):_>3?N(x,m,v):N(x,m))||v);return _>3&&v&&Object.defineProperty(x,m,v),v},i=_t&&_t.__param||function(g,x){return function(m,y){x(m,y,g)}};Object.defineProperty(_t,"__esModule",{value:!0}),_t.ATNConfig=void 0;const c=jn(),h=Fr(),p=we(),a=Q(),r=nt(),n=Je(),t=Bn(),s=Me(),e=2147483648;let o=class Ti{constructor(x,m,y){typeof m=="number"?(s((m&16777215)===m),this._state=x,this.altAndOuterContextDepth=m,this._context=y):(this._state=x,this.altAndOuterContextDepth=m.altAndOuterContextDepth,this._context=y)}static create(x,m,y,_=t.SemanticContext.NONE,v){return _!==t.SemanticContext.NONE?v!=null?new d(v,_,x,m,y,!1):new l(_,x,m,y):v!=null?new f(v,x,m,y,!1):new Ti(x,m,y)}get state(){return this._state}get alt(){return this.altAndOuterContextDepth&16777215}get context(){return this._context}set context(x){this._context=x}get reachesIntoOuterContext(){return this.outerContextDepth!==0}get outerContextDepth(){return this.altAndOuterContextDepth>>>24&127}set outerContextDepth(x){s(x>=0),x=Math.min(x,127),this.altAndOuterContextDepth=x<<24|(this.altAndOuterContextDepth&-2130706433)>>>0}get lexerActionExecutor(){}get semanticContext(){return t.SemanticContext.NONE}get hasPassedThroughNonGreedyDecision(){return!1}clone(){return this.transform(this.state,!1)}transform(x,m,y){return y==null?this.transformImpl(x,this._context,this.semanticContext,m,this.lexerActionExecutor):y instanceof n.PredictionContext?this.transformImpl(x,y,this.semanticContext,m,this.lexerActionExecutor):y instanceof t.SemanticContext?this.transformImpl(x,this._context,y,m,this.lexerActionExecutor):this.transformImpl(x,this._context,this.semanticContext,m,y)}transformImpl(x,m,y,_,v){let N=_&&Ti.checkNonGreedyDecision(this,x);return y!==t.SemanticContext.NONE?v!=null||N?new d(v,y,x,this,m,N):new l(y,x,this,m):v!=null||N?new f(v,x,this,m,N):new Ti(x,this,m)}static checkNonGreedyDecision(x,m){return x.hasPassedThroughNonGreedyDecision||m instanceof h.DecisionState&&m.nonGreedy}appendContext(x,m){if(typeof x=="number"){let y=this.context.appendSingleContext(x,m);return this.transform(this.state,!1,y)}else{let y=this.context.appendContext(x,m);return this.transform(this.state,!1,y)}}contains(x){if(this.state.stateNumber!==x.state.stateNumber||this.alt!==x.alt||!this.semanticContext.equals(x.semanticContext))return!1;let m=[],y=[];for(m.push(this.context),y.push(x.context);;){let _=m.pop(),v=y.pop();if(!_||!v)break;if(_===v)return!0;if(_.size<v.size)return!1;if(v.isEmpty)return _.hasEmpty;for(let N=0;N<v.size;N++){let T=_.findReturnState(v.getReturnState(N));if(T<0)return!1;m.push(_.getParent(T)),y.push(v.getParent(N))}}return!1}get isPrecedenceFilterSuppressed(){return(this.altAndOuterContextDepth&e)!==0}set isPrecedenceFilterSuppressed(x){x?this.altAndOuterContextDepth|=e:this.altAndOuterContextDepth&=~e}equals(x){return this===x?!0:x instanceof Ti?this.state.stateNumber===x.state.stateNumber&&this.alt===x.alt&&this.reachesIntoOuterContext===x.reachesIntoOuterContext&&this.context.equals(x.context)&&this.semanticContext.equals(x.semanticContext)&&this.isPrecedenceFilterSuppressed===x.isPrecedenceFilterSuppressed&&this.hasPassedThroughNonGreedyDecision===x.hasPassedThroughNonGreedyDecision&&r.ObjectEqualityComparator.INSTANCE.equals(this.lexerActionExecutor,x.lexerActionExecutor):!1}hashCode(){let x=p.MurmurHash.initialize(7);return x=p.MurmurHash.update(x,this.state.stateNumber),x=p.MurmurHash.update(x,this.alt),x=p.MurmurHash.update(x,this.reachesIntoOuterContext?1:0),x=p.MurmurHash.update(x,this.context),x=p.MurmurHash.update(x,this.semanticContext),x=p.MurmurHash.update(x,this.hasPassedThroughNonGreedyDecision?1:0),x=p.MurmurHash.update(x,this.lexerActionExecutor),x=p.MurmurHash.finish(x,7),x}toDotString(){let x="";x+=`digraph G {
 `,x+=`rankdir=LR;
 `;let m=new c.Array2DHashMap(n.PredictionContext.IdentityEqualityComparator.INSTANCE),y=[];function _(v){let N=m.size,T=m.putIfAbsent(v,N);return T??(y.push(v),N)}for(y.push(this.context),m.put(this.context,0);;){let v=y.pop();if(!v)break;for(let N=0;N<v.size;N++)x+="  s"+_(v),x+="->",x+="s"+_(v.getParent(N)),x+='[label="'+v.getReturnState(N)+`"];
 `}return x+=`}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@yorkie-js/schema",
-  "version": "0.6.22",
+  "version": "0.6.24",
   "description": "Yorkie Schema for Yorkie Document",
   "main": "./dist/yorkie-js-schema.js",
   "publishConfig": {
@@ -12,15 +12,15 @@
   ],
   "type": "module",
   "devDependencies": {
+    "@codemirror/lint": "^6.8.2",
     "antlr4ts": "^0.5.0-alpha.4",
     "antlr4ts-cli": "^0.5.0-alpha.4",
-    "@codemirror/lint": "^6.8.2",
     "codemirror": "^6.0.1",
     "typescript": "^5.3.3",
     "vite": "^6.2.0",
-    "vitest": "^3.0.9",
-    "vite-plugin-node-polyfills": "^0.23.0",
-    "vite-plugin-dts": "^4.5.3"
+    "vite-plugin-dts": "^4.5.3",
+    "vite-plugin-node-polyfills": "^0.24.0",
+    "vitest": "^3.0.9"
   },
   "scripts": {
     "dev": "vite",