haye/dist/haye.es.js

Haye is a super fast string based expression parser for Node.js

function n(n,e){e.add();for(var r=n.length,t=0,u="name";t<r;){var o=n[t++],a=o.charCodeAt(0);58===a||44===a?(u="arg",e.shiftValue()):124===a?(u="name",e.add()):"arg"===u?e.appendValue(o):e.appendKey(o,a)}return e.toJSON()}function e(n,e){e.add();for(var r=n.length,t=0,u="name",o=!1;t<r;){var a=n[t++],d=a.charCodeAt(0);91===d?o=!0:93===d?o=!1:61===d||44===d&&o?(u="arg",e.shiftValue()):44===d?(u="name",e.add()):"arg"===u?e.appendValue(a):e.appendKey(a,d)}return e.toJSON()}function r(){return{nodes:[],currentNode:null,add:function(){this.currentNode={name:"",args:[]},this.nodes.push(this.currentNode)},appendKey:function(n,e){32!==e&&(this.currentNode.name+=n)},appendValue:function(n){this.currentNode.args[this.currentNode.args.length-1]+=n},shiftValue:function(){this.currentNode.args.push("")},toJSON:function(){return this.nodes}}}function t(){return{nodes:[],currentNode:null,add:function(){this.currentNode={name:"",args:[]},this.nodes.push(this.currentNode)},appendKey:function(n,e){32!==e&&(this.currentNode.name+=n)},appendValue:function(n){this.currentNode.args[this.currentNode.args.length-1]+=n},shiftValue:function(){this.currentNode.args.push("")},toJSON:function(){return this.nodes.reduce((function(n,e){return n[e.name]=e.args,n}),{})}}}var u={fromPipe:function(e){return{toArray:function(){return n(e,new r)},toJSON:function(){return n(e,new t)}}},fromQS:function(n){return{toArray:function(){return e(n,new r)},toJSON:function(){return e(n,new t)}}}};export default u;