@fincity/kirun-js 1.0.4 → 1.0.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (7) hide show
  1. package/dist/index.js +1 -1
  2. package/dist/index.js.map +1 -1
  3. package/dist/module.js +2 -0
  4. package/dist/module.js.map +1 -0
  5. package/dist/types.d.ts.map +1 -1
  6. package/package.json +8 -5
  7. package/src/index.ts +1 -0
package/dist/index.js CHANGED
@@ -1,2 +1,2 @@
1
- function e(e,t,r,s){Object.defineProperty(e,t,{get:r,set:s,enumerable:!0,configurable:!0})}function t(e,t){return Object.keys(t).forEach((function(r){"default"===r||"__esModule"===r||e.hasOwnProperty(r)||Object.defineProperty(e,r,{enumerable:!0,get:function(){return t[r]}})})),e}var r={};e(r,"Tuple2",(()=>s)),e(r,"Tuple3",(()=>n)),e(r,"Tuple4",(()=>a));class s{constructor(e,t){this.f=e,this.s=t}getT1(){return this.f}getT2(){return this.s}}class n extends s{constructor(e,t,r){super(e,t),this.t=r}getT3(){return this.t}}class a extends n{constructor(e,t,r,s){super(e,t,r),this.fr=s}getT4(){return this.fr}}e({},"HybridRepository",(()=>i));class i{constructor(...e){this.repos=e}find(e,t){for(let r of this.repos){let s=r.find(e,t);if(s)return s}}}e({},"Schema",(()=>T));e({},"Namespaces",(()=>o));class o{static SYSTEM="System";static SYSTEM_CTX="System.Context";static SYSTEM_LOOP="System.Loop";static SYSTEM_ARRAY="System.Array";static MATH="System.Math";static STRING="System.String";constructor(){}}function h(e){return null==e}e({},"isNullValue",(()=>h));class u{setSingleSchema(e){return this.singleSchema=e,this}setTupleSchema(e){return this.tupleSchema=e,this}getSingleSchema(){return this.singleSchema}getTupleSchema(){return this.tupleSchema}isSingleType(){return!h(this.singleSchema)}static of(...e){return 1==e.length?(new u).setSingleSchema(e[0]):(new u).setTupleSchema(e)}static from(e){if(!e)return;Array.isArray(e)&&u.of(...T.fromListOfSchemas(e));let t=T.from(e);return t?u.of(t):void 0}}class l{getBooleanValue(){return this.booleanValue}getSchemaValue(){return this.schemaValue}setBooleanValue(e){return this.booleanValue=e,this}setSchemaValue(e){return this.schemaValue=e,this}static from(e){if(!e)return;const t=new l;return t.booleanValue=e.booleanValue,t.schemaValue=e.schemaValue,t}}let p;var c;e({},"SchemaType",(()=>p)),(c=p||(p={})).INTEGER="Integer",c.LONG="Long",c.FLOAT="Float",c.DOUBLE="Double",c.STRING="String",c.OBJECT="Object",c.ARRAY="Array",c.BOOLEAN="Boolean",c.NULL="Null";class m{}class g extends m{constructor(e){super(),this.type=e}getType(){return this.type}setType(e){return this.type=e,this}getAllowedSchemaTypes(){return this.type}contains(e){return this.type?.has(e)}}class f extends m{constructor(e){super(),this.type=e}getType(){return this.type}getAllowedSchemaTypes(){return new Set([this.type])}contains(e){return this.type==e}}class E{static of(...e){return 1==e.length?new f(e[0]):new g(new Set(e))}static from(e){return"string"==typeof e?E.of(e):Array.isArray(e)?E.of(...Array.of(e).map((e=>e)).map((e=>e))):void 0}}class T{static NULL=(new T).setNamespace(o.SYSTEM).setName("Null").setType(E.of(p.NULL)).setConstant(void 0);static TYPE_SCHEMA=(new T).setType(E.of(p.STRING)).setEnums(["INTEGER","LONG","FLOAT","DOUBLE","STRING","OBJECT","ARRAY","BOOLEAN","NULL"]);static SCHEMA=(new T).setNamespace(o.SYSTEM).setName("Schema").setType(E.of(p.OBJECT)).setProperties(new Map([["namespace",T.of("namespace",p.STRING).setDefaultValue("_")],["name",T.ofString("name")],["version",T.of("version",p.INTEGER).setDefaultValue(1)],["ref",T.ofString("ref")],["type",(new T).setAnyOf([T.TYPE_SCHEMA,T.ofArray("type",T.TYPE_SCHEMA)])],["anyOf",T.ofArray("anyOf",T.ofRef("#/"))],["allOf",T.ofArray("allOf",T.ofRef("#/"))],["oneOf",T.ofArray("oneOf",T.ofRef("#/"))],["not",T.ofRef("#/")],["title",T.ofString("title")],["description",T.ofString("description")],["id",T.ofString("id")],["examples",T.ofAny("examples")],["defaultValue",T.ofAny("defaultValue")],["comment",T.ofString("comment")],["enums",T.ofArray("enums",T.ofString("enums"))],["constant",T.ofAny("constant")],["pattern",T.ofString("pattern")],["format",T.of("format",p.STRING).setEnums(["DATETIME","TIME","DATE","EMAIL","REGEX"])],["minLength",T.ofInteger("minLength")],["maxLength",T.ofInteger("maxLength")],["multipleOf",T.ofLong("multipleOf")],["minimum",T.ofNumber("minimum")],["maximum",T.ofNumber("maximum")],["exclusiveMinimum",T.ofNumber("exclusiveMinimum")],["exclusiveMaximum",T.ofNumber("exclusiveMaximum")],["properties",T.of("properties",p.OBJECT).setAdditionalProperties((new l).setSchemaValue(T.ofRef("#/")))],["additionalProperties",(new T).setName("additionalProperty").setNamespace(o.SYSTEM).setAnyOf([T.ofBoolean("additionalProperty"),T.ofObject("additionalProperty").setRef("#/")]).setDefaultValue(!0)],["required",T.ofArray("required",T.ofString("required")).setDefaultValue([])],["propertyNames",T.ofRef("#/")],["minProperties",T.ofInteger("minProperties")],["maxProperties",T.ofInteger("maxProperties")],["patternProperties",T.of("patternProperties",p.OBJECT).setAdditionalProperties((new l).setSchemaValue(T.ofRef("#/")))],["items",(new T).setName("items").setAnyOf([T.ofRef("#/").setName("item"),T.ofArray("tuple",T.ofRef("#/"))])],["contains",T.ofRef("#/")],["minItems",T.ofInteger("minItems")],["maxItems",T.ofInteger("maxItems")],["uniqueItems",T.ofBoolean("uniqueItems")],["$defs",T.of("$defs",p.OBJECT).setAdditionalProperties((new l).setSchemaValue(T.ofRef("#/")))],["permission",T.ofString("permission")]])).setRequired([]);static ofString(e){return(new T).setType(E.of(p.STRING)).setName(e)}static ofInteger(e){return(new T).setType(E.of(p.INTEGER)).setName(e)}static ofFloat(e){return(new T).setType(E.of(p.FLOAT)).setName(e)}static ofLong(e){return(new T).setType(E.of(p.LONG)).setName(e)}static ofDouble(e){return(new T).setType(E.of(p.DOUBLE)).setName(e)}static ofAny(e){return(new T).setType(E.of(p.INTEGER,p.LONG,p.FLOAT,p.DOUBLE,p.STRING,p.BOOLEAN,p.ARRAY,p.NULL,p.OBJECT)).setName(e)}static ofAnyNotNull(e){return(new T).setType(E.of(p.INTEGER,p.LONG,p.FLOAT,p.DOUBLE,p.STRING,p.BOOLEAN,p.ARRAY,p.OBJECT)).setName(e)}static ofNumber(e){return(new T).setType(E.of(p.INTEGER,p.LONG,p.FLOAT,p.DOUBLE)).setName(e)}static ofBoolean(e){return(new T).setType(E.of(p.BOOLEAN)).setName(e)}static of(e,...t){return(new T).setType(E.of(...t)).setName(e)}static ofObject(e){return(new T).setType(E.of(p.OBJECT)).setName(e)}static ofRef(e){return(new T).setRef(e)}static ofArray(e,...t){return(new T).setType(E.of(p.ARRAY)).setName(e).setItems(u.of(...t))}static fromListOfSchemas(e){if(h(e)&&!Array.isArray(e))return[];let t=[];for(let r of Array.from(e)){let e=T.from(r);e&&t.push(e)}return t}static fromMapOfSchemas(e){if(h(e))return;const t=new Map;return Object.entries(e).forEach((([e,r])=>{let s=T.from(r);s&&t.set(e,s)})),t}static from(e,t=!1){if(h(e))return;let r=new T;return r.namespace=e.namespace,r.name=e.name,r.version=e.version,r.ref=e.ref,r.type=t?new f(p.STRING):E.from(r.type),r.anyOf=T.fromListOfSchemas(e.anyOf),r.allOf=T.fromListOfSchemas(e.allOf),r.oneOf=T.fromListOfSchemas(e.oneOf),r.not=T.from(e.not),r.description=e.description,r.examples=e.examples?[...e.examples]:void 0,r.defaultValue=e.defaultValue,r.comment=e.comment,r.enums=e.enums?[...e.enums]:void 0,r.constant=e.constant,r.pattern=e.pattern,r.format=e.format,r.minLength=e.minLength,r.maxLength=e.maxLength,r.multipleOf=e.multipleOf,r.minimum=e.minimum,r.maximum=e.maximum,r.exclusiveMinimum=e.exclusiveMinimum,r.exclusiveMaximum=e.exclusiveMaximum,r.properties=T.fromMapOfSchemas(e.properties),r.additionalProperties=l.from(e.additionalProperties),r.required=e.required,r.propertyNames=T.from(e.propertyNames,!0),r.minProperties=e.minProperties,r.maxProperties=e.maxProperties,r.patternProperties=T.fromMapOfSchemas(e.patternProperties),r.items=u.from(e.items),r.contains=T.from(e.contains),r.minItems=e.minItems,r.maxItems=e.maxItems,r.uniqueItems=e.uniqueItems,r.$defs=T.fromMapOfSchemas(e.$defs),r.permission=e.permission,r}namespace="_";version=1;getTitle(){return this.getFullName()}getFullName(){return this.namespace&&"_"!=this.namespace?this.namespace+"."+this.name:this.name}get$defs(){return this.$defs}set$defs(e){return this.$defs=e,this}getNamespace(){return this.namespace}setNamespace(e){return this.namespace=e,this}getName(){return this.name}setName(e){return this.name=e,this}getVersion(){return this.version}setVersion(e){return this.version=e,this}getRef(){return this.ref}setRef(e){return this.ref=e,this}getType(){return this.type}setType(e){return this.type=e,this}getAnyOf(){return this.anyOf}setAnyOf(e){return this.anyOf=e,this}getAllOf(){return this.allOf}setAllOf(e){return this.allOf=e,this}getOneOf(){return this.oneOf}setOneOf(e){return this.oneOf=e,this}getNot(){return this.not}setNot(e){return this.not=e,this}getDescription(){return this.description}setDescription(e){return this.description=e,this}getExamples(){return this.examples}setExamples(e){return this.examples=e,this}getDefaultValue(){return this.defaultValue}setDefaultValue(e){return this.defaultValue=e,this}getComment(){return this.comment}setComment(e){return this.comment=e,this}getEnums(){return this.enums}setEnums(e){return this.enums=e,this}getConstant(){return this.constant}setConstant(e){return this.constant=e,this}getPattern(){return this.pattern}setPattern(e){return this.pattern=e,this}getFormat(){return this.format}setFormat(e){return this.format=e,this}getMinLength(){return this.minLength}setMinLength(e){return this.minLength=e,this}getMaxLength(){return this.maxLength}setMaxLength(e){return this.maxLength=e,this}getMultipleOf(){return this.multipleOf}setMultipleOf(e){return this.multipleOf=e,this}getMinimum(){return this.minimum}setMinimum(e){return this.minimum=e,this}getMaximum(){return this.maximum}setMaximum(e){return this.maximum=e,this}getExclusiveMinimum(){return this.exclusiveMinimum}setExclusiveMinimum(e){return this.exclusiveMinimum=e,this}getExclusiveMaximum(){return this.exclusiveMaximum}setExclusiveMaximum(e){return this.exclusiveMaximum=e,this}getProperties(){return this.properties}setProperties(e){return this.properties=e,this}getAdditionalProperties(){return this.additionalProperties}setAdditionalProperties(e){return this.additionalProperties=e,this}getRequired(){return this.required}setRequired(e){return this.required=e,this}getPropertyNames(){return this.propertyNames}setPropertyNames(e){return this.propertyNames=e,this.propertyNames.type=new f(p.STRING),this}getMinProperties(){return this.minProperties}setMinProperties(e){return this.minProperties=e,this}getMaxProperties(){return this.maxProperties}setMaxProperties(e){return this.maxProperties=e,this}getPatternProperties(){return this.patternProperties}setPatternProperties(e){return this.patternProperties=e,this}getItems(){return this.items}setItems(e){return this.items=e,this}getContains(){return this.contains}setContains(e){return this.contains=e,this}getMinItems(){return this.minItems}setMinItems(e){return this.minItems=e,this}getMaxItems(){return this.maxItems}setMaxItems(e){return this.maxItems=e,this}getUniqueItems(){return this.uniqueItems}setUniqueItems(e){return this.uniqueItems=e,this}getPermission(){return this.permission}setPermission(e){return this.permission=e,this}}e({},"SchemaValidator",(()=>L));e({},"StringUtil",(()=>d));e({},"KIRuntimeException",(()=>A));class A extends Error{constructor(e,t){super(e),this.cause=t}getCause(){return this.cause}}e({},"StringFormatter",(()=>O));class O{static format(e,...t){if(!t||0==t.length)return e;let r="",s=0,n="",a=n,i=e.length;for(let o=0;o<i;o++)n=e.charAt(o),"$"==n&&"\\"==a?r=r.substring(0,o-1)+n:"$"==n&&s<t.length?r+=t[s++]:r+=n,a=n;return r.toString()}constructor(){}}class d{constructor(){}static nthIndex(e,t,r=0,s){if(!e)throw new A("String cannot be null");if(r<0||r>=e.length)throw new A(O.format("Cannot search from index : $",r));if(s<=0||s>e.length)throw new A(O.format("Cannot search for occurance : $",s));for(;r<e.length;){if(e.charAt(r)==t&&0==--s)return r;++r}return-1}static splitAtFirstOccurance(e,t){if(!e)return[void 0,void 0];let r=e.indexOf(t);return-1==r?[e,void 0]:[e.substring(0,r),e.substring(r+1)]}static isNullOrBlank(e){return!e||""==e.trim()}}class S extends Error{constructor(e,t,r){super(e.trim()?e+"-"+t:t),this.schemaPath=e,this.cause=r}getSchemaPath(){return this.schemaPath}getCause(){return this.cause}}class N extends Error{constructor(e,t,r=[],s){super(t+(r?r.map((e=>e.message)).reduce(((e,t)=>e+"\n"+t),""):"")),this.schemaPath=e,this.cause=s}getSchemaPath(){return this.schemaPath}getCause(){return this.cause}}class I{static UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH="Unable to retrive schema from referenced path";static CYCLIC_REFERENCE_LIMIT_COUNTER=20;static getDefaultValue(e,t){if(e)return e.getConstant()?e.getConstant():e.getDefaultValue()?e.getDefaultValue():I.getDefaultValue(I.getSchemaFromRef(e,t,e.getRef()),t)}static getSchemaFromRef(e,t,r,s=0){if(++s==I.CYCLIC_REFERENCE_LIMIT_COUNTER)throw new N(r??"","Schema has a cyclic reference");if(!e||!r||d.isNullOrBlank(r))return;if(!r.startsWith("#")){var n=I.resolveExternalSchema(e,t,r);n&&(e=n.getT1(),r=n.getT2())}let a=r.split("/");return e=I.resolveInternalSchema(e,t,r,s,a,1)}static resolveInternalSchema(e,t,r,s,n,a){let i=e;for(;a<n.length;){if("$defs"===n[a]){if(++a>=n.length||!i.get$defs())throw new S(r,I.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH);i=i.get$defs()?.get(n[a])}else{if(i&&(!i.getType()?.contains(p.OBJECT)||!i.getProperties()))throw new S(r,"Cannot retrievie schema from non Object type schemas");i=i.getProperties()?.get(n[a])}if(a++,!i)throw new S(r,I.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH);if(!d.isNullOrBlank(i.getRef())&&(i=I.getSchemaFromRef(i,t,i.getRef(),s),!i))throw new S(r,I.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH)}return i}static resolveExternalSchema(e,t,r){if(!t)return;let n=d.splitAtFirstOccurance(e?.getRef()??"","/");if(!n[0])return;let a=d.splitAtFirstOccurance(n[0],".");if(!a[0]||!a[1])return;let i=t.find(a[0],a[1]);if(i){if(!n[1]||""===n[1])return new s(i,r);if(r="#/"+n[1],!i)throw new S(r,I.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH);return new s(i,r)}}constructor(){}}class R{static validate(e,t,r,s){let n=[];return t.getOneOf()&&!t.getOneOf()?R.oneOf(e,t,r,s,n):t.getAllOf()&&!t.getAllOf()?R.allOf(e,t,r,s,n):t.getAnyOf()&&!t.getAnyOf()&&R.anyOf(e,t,r,s,n),s}static anyOf(e,t,r,s,n){let a=!1;for(let i of t.getAnyOf()??[])try{R.validate(e,i,r,s),a=!0;break}catch(e){a=!1,n.push(e)}if(!a)throw new N(L.path(e),"The value don't satisfy any of the schemas.",n)}static allOf(e,t,r,s,n){let a=0;for(let i of t.getAllOf()??[])try{R.validate(e,i,r,s),a++}catch(e){n.push(e)}if(a!==t.getAllOf()?.length)throw new N(L.path(e),"The value doesn't satisfy some of the schemas.",n)}static oneOf(e,t,r,s,n){let a=0;for(let i of t.getOneOf()??[])try{R.validate(e,i,r,s),a++}catch(e){n.push(e)}if(1!=a)throw new N(L.path(e),0==a?"The value does not satisfy any schema":"The value satisfy more than one schema",n)}constructor(){}}class w{static validate(e,t,r,s){if(h(s))throw new N(L.path(e),"Expected an array but found null");if(!Array.isArray(s))throw new N(L.path(e),s.toString()+" is not an Array");let n=s;return w.checkMinMaxItems(e,t,n),w.checkItems(e,t,r,n),w.checkUniqueItems(e,t,n),w.checkContains(e,t,r,n),s}static checkContains(e,t,r,s){if(!t.getContains())return;let n=!1;for(let a=0;a<s.length;a++){let i=e?[...e]:[];try{L.validate(i,t.getContains(),r,s[a]),n=!0;break}catch(e){n=!1}}if(!n)throw new N(L.path(e),"None of the items are of type contains schema")}static checkUniqueItems(e,t,r){if(t.getUniqueItems()&&t.getUniqueItems()){if(new Set(r).size!==r.length)throw new N(L.path(e),"Items on the array are not unique")}}static checkMinMaxItems(e,t,r){if(t.getMinItems()&&t.getMinItems()>r.length)throw new N(L.path(e),"Array should have minimum of "+t.getMinItems()+" elements");if(t.getMaxItems()&&t.getMaxItems()<r.length)throw new N(L.path(e),"Array can have maximum of "+t.getMaxItems()+" elements")}static checkItems(e,t,r,s){if(!t.getItems())return;let n=t.getItems();if(n.getSingleSchema())for(let t=0;t<s.length;t++){let a=e?[...e]:[],i=L.validate(a,n.getSingleSchema(),r,s[t]);s[t]=i}if(n.getTupleSchema()){if(n.getTupleSchema().length!==s.length)throw new N(L.path(e),"Expected an array with only "+n.getTupleSchema().length+" but found "+s.length);for(let t=0;t<s.length;t++){let a=e?[...e]:[],i=L.validate(a,n.getTupleSchema()[t],r,s[t]);s[t]=i}}}constructor(){}}class y{static validate(e,t,r,s){if(h(s))throw new N(L.path(t),"Expected a number but found null");if("number"!=typeof s)throw new N(L.path(t),s.toString()+" is not a "+e);let n=y.extractNumber(e,t,r,s);return y.checkRange(t,r,s,n),y.checkMultipleOf(t,r,s,n),s}static extractNumber(e,t,r,s){let n=s;try{e!=p.LONG&&e!=p.INTEGER||(n=Math.round(n))}catch(r){throw new N(L.path(t),s+" is not a number of type "+e,r)}if(h(n)||(e==p.LONG||e==p.INTEGER)&&n!=s)throw new N(L.path(t),s.toString()+" is not a number of type "+e);return n}static checkMultipleOf(e,t,r,s){if(t.getMultipleOf()){if(s%t.getMultipleOf()!=0)throw new N(L.path(e),r.toString()+" is not multiple of "+t.getMultipleOf())}}static checkRange(e,t,r,s){if(t.getMinimum()&&y.numberCompare(s,t.getMinimum())<0)throw new N(L.path(e),r.toString()+" should be greater than or equal to "+t.getMinimum());if(t.getMaximum()&&y.numberCompare(s,t.getMaximum())>0)throw new N(L.path(e),r.toString()+" should be less than or equal to "+t.getMaximum());if(t.getExclusiveMinimum()&&y.numberCompare(s,t.getExclusiveMinimum())<=0)throw new N(L.path(e),r.toString()+" should be greater than "+t.getExclusiveMinimum());if(t.getExclusiveMaximum()&&y.numberCompare(s,t.getExclusiveMaximum())>0)throw new N(L.path(e),r.toString()+" should be less than "+t.getExclusiveMaximum())}static numberCompare(e,t){return e-t}constructor(){}}class x{static validate(e,t,r,s){if(h(s))throw new N(L.path(e),"Expected an object but found null");if("object"!=typeof s||Array.isArray(s))throw new N(L.path(e),s.toString()+" is not an Object");let n=s,a=new Set(Object.keys(n));x.checkMinMaxProperties(e,t,a),t.getPropertyNames()&&x.checkPropertyNameSchema(e,t,r,a),t.getRequired()&&x.checkRequired(e,t,n),t.getProperties()&&x.checkProperties(e,t,r,n,a),t.getPatternProperties()&&x.checkPatternProperties(e,t,r,n,a),t.getAdditionalProperties()&&x.checkAddtionalProperties(e,t,r,n,a)}static checkPropertyNameSchema(e,t,r,s){for(let n of Array.from(s.values()))try{L.validate(e,t.getPropertyNames(),r,n)}catch(t){throw new N(L.path(e),"Property name '"+n+"' does not fit the property schema")}}static checkRequired(e,t,r){for(const s of t.getRequired()??[])if(h(r[s]))throw new N(L.path(e),s+" is mandatory")}static checkAddtionalProperties(e,t,r,s,n){let a=t.getAdditionalProperties();if(a.getSchemaValue())for(let t of Array.from(n.values())){let n=e?[...e]:[],i=L.validate(n,a.getSchemaValue(),r,s.get(t));s[t]=i}else if(!1===a.getBooleanValue()&&n.size)throw new N(L.path(e),n.toString()+" are additional properties which are not allowed.")}static checkPatternProperties(e,t,r,s,n){const a=new Map;for(const e of Array.from(t.getPatternProperties().keys()))a.set(e,new RegExp(e));for(const i of Array.from(n.values())){const o=e?[...e]:[];for(const e of Array.from(a.entries()))if(e[1].test(i)){const a=L.validate(o,t.getPatternProperties().get(e[0]),r,s[i]);s[i]=a,n.delete(i);break}}}static checkProperties(e,t,r,s,n){for(const a of Array.from(t.getProperties())){let t=s[a[0]];if(h(t))continue;let i=e?[...e]:[],o=L.validate(i,a[1],r,t);s[a[0]]=o,n.delete(a[0])}}static checkMinMaxProperties(e,t,r){if(t.getMinProperties()&&r.size<t.getMinProperties())throw new N(L.path(e),"Object should have minimum of "+t.getMinProperties()+" properties");if(t.getMaxProperties()&&r.size>t.getMaxProperties())throw new N(L.path(e),"Object can have maximum of "+t.getMaxProperties()+" properties")}constructor(){}}let _;var v;(v=_||(_={})).DATETIME="DATETIME",v.TIME="TIME",v.DATE="DATE",v.EMAIL="EMAIL",v.REGEX="REGEX";class P{static TIME=/^([01]?[0-9]|2[0-3]):[0-5][0-9](:[0-5][0-9])?([+-][01][0-9]:[0-5][0-9])?$/;static DATE=/^[0-9]{4,4}-([0][0-9]|[1][0-2])-(0[1-9]|[1-2][1-9]|3[01])$/;static DATETIME=/^[0-9]{4,4}-([0][0-9]|[1][0-2])-(0[1-9]|[1-2][1-9]|3[01])T([01]?[0-9]|2[0-3]):[0-5][0-9](:[0-5][0-9])?([+-][01][0-9]:[0-5][0-9])?$/;static validate(e,t,r){if(h(r))throw new N(L.path(e),"Expected a string but found "+r);if("string"!=typeof r)throw new N(L.path(e),r.toString()+" is not String");t.getFormat()==_.TIME?P.patternMatcher(e,t,r,P.TIME,"time pattern"):t.getFormat()==_.DATE?P.patternMatcher(e,t,r,P.DATE,"date pattern"):t.getFormat()==_.DATETIME?P.patternMatcher(e,t,r,P.DATETIME,"date time pattern"):t.getPattern()&&P.patternMatcher(e,t,r,new RegExp(t.getPattern()),"pattern "+t.getPattern());let s=r.length;if(t.getMinLength()&&s<t.getMinLength())throw new N(L.path(e),"Expected a minimum of "+t.getMinLength()+" characters");if(t.getMaxLength()&&s>t.getMinLength())throw new N(L.path(e),"Expected a maximum of "+t.getMaxLength()+" characters");return r}static patternMatcher(e,t,r,s,n){if(!s.test(r))throw new N(L.path(e),r.toString()+" is not matched with the "+n)}constructor(){}}class M{static validate(e,t,r,s,n){if(t==p.STRING)P.validate(e,r,n);else if(t==p.LONG||t==p.INTEGER||t==p.DOUBLE||t==p.FLOAT)y.validate(t,e,r,n);else if(t==p.BOOLEAN)(class{static validate(e,t,r){if(h(r))throw new N(L.path(e),"Expected a boolean but found null");if("boolean"!=typeof r)throw new N(L.path(e),r.toString()+" is not a boolean");return r}constructor(){}}).validate(e,r,n);else if(t==p.OBJECT)x.validate(e,r,s,n);else if(t==p.ARRAY)w.validate(e,r,s,n);else{if(t!=p.NULL)throw new N(L.path(e),t+" is not a valid type.");(class{static validate(e,t,r){if(r)throw new N(L.path(e),"Expected a null but found "+r);return r}constructor(){}}).validate(e,r,n)}return n}constructor(){}}class L{static path(e){return e?e.map((e=>e.getTitle()??"")).filter((e=>!!e)).reduce(((e,t,r)=>e+(0===r?"":".")+t),""):""}static validate(e,t,r,s){if(!t)return s;if(e||(e=new Array),e.push(t),h(s)&&!h(t.getDefaultValue()))return JSON.parse(JSON.stringify(t.getDefaultValue()));if(t.getConstant())return L.constantValidation(e,t,s);if(t.getEnums()&&!t.getEnums()?.length)return L.enumCheck(e,t,s);if(t.getType()&&L.typeValidation(e,t,r,s),!d.isNullOrBlank(t.getRef()))return L.validate(e,I.getSchemaFromRef(e[0],r,t.getRef()),r,s);if((t.getOneOf()||t.getAllOf()||t.getAnyOf())&&R.validate(e,t,r,s),t.getNot()){let n=!1;try{L.validate(e,t.getNot(),r,s),n=!0}catch(e){n=!1}if(n)throw new N(L.path(e),"Schema validated value in not condition.")}return s}static constantValidation(e,t,r){if(!t.getConstant().equals(r))throw new N(L.path(e),"Expecting a constant value : "+r);return r}static enumCheck(e,t,r){let s=!1;for(let e of t.getEnums()??[])if(e===r){s=!0;break}if(s)return r;throw new N(L.path(e),"Value is not one of "+t.getEnums())}static typeValidation(e,t,r,s){let n=!1,a=[];for(const i of Array.from(t.getType()?.getAllowedSchemaTypes()?.values()??[]))try{M.validate(e,i,t,r,s),n=!0;break}catch(e){n=!1,a.push(e)}if(!n)throw new N(L.path(e),"Value "+JSON.stringify(s)+" is not of valid type(s)",a)}constructor(){}}e({},"KIRunConstants",(()=>U));class U{static NAMESPACE="namespace";static NAME="name";static ID="id";constructor(){}}e({},"ExecutionException",(()=>B));class B extends Error{constructor(e,t){super(e),this.cause=t}getCause(){return this.cause}}e({},"AbstractFunction",(()=>C));class C{validateArguments(e){return Array.from(this.getSignature().getParameters().entries()).map((t=>{let r,n=t[0],a=t[1],i=e.get(t[0]);if(h(i))return new s(n,L.validate(void 0,a.getSchema(),void 0,void 0));if(!a?.isVariableArgument())return new s(n,L.validate(void 0,a.getSchema(),void 0,i));Array.isArray(i)?r=i:(r=[],r.push(i));for(const e of r)L.validate(void 0,a.getSchema(),void 0,e);return new s(n,i)})).reduce(((e,t)=>(e.set(t.getT1(),t.getT2()),e)),new Map)}execute(e){return e.setArguments(this.validateArguments(e.getArguments()??new Map)),this.internalExecute(e)}getProbableEventSignature(e){return this.getSignature().getEvents()}}e({},"KIRuntime",(()=>Et));class b{constructor(e){this.expression=e}getExpression(){return this.expression}}class V{static OUTPUT="output";static ERROR="error";static ITERATION="iteration";static TRUE="true";static FALSE="false";static SCHEMA_NAME="Event";static SCHEMA=(new T).setNamespace(o.SYSTEM).setName(V.SCHEMA_NAME).setType(E.of(p.OBJECT)).setProperties(new Map([["name",T.ofString("name")],["parameters",T.ofObject("parameter").setAdditionalProperties((new l).setSchemaValue(T.SCHEMA))]]));constructor(e,t){this.name=e,this.parameters=t}getName(){return this.name}setName(e){return this.name=e,this}getParameters(){return this.parameters}setParameters(e){return this.parameters=e,this}static outputEventMapEntry(e){return V.eventMapEntry(V.OUTPUT,e)}static eventMapEntry(e,t){return[e,new V(e,t)]}}class D{constructor(e,t){this.name=e,this.result=t}getName(){return this.name}setName(e){return this.name=e,this}getResult(){return this.result}setResult(e){return this.result=e,this}static outputOf(e){return D.of(V.OUTPUT,e)}static of(e,t){return new D(e,t)}}class k{index=0;constructor(e){if(h(e))throw new A("Function output is generating null");Array.isArray(e)&&e.length&&e[0]instanceof D?this.fo=e:(this.fo=[],this.generator=e)}next(){if(!this.generator)return this.index<this.fo.length?this.fo[this.index++]:void 0;const e=this.generator.next();return e&&this.fo.push(e),e}allResults(){return this.fo}}let G;var F;(F=G||(G={})).CONSTANT="CONSTANT",F.EXPRESSION="EXPRESSION";class ${static SCHEMA_NAME="Parameter";static SCHEMA=(new T).setNamespace(o.SYSTEM).setName($.SCHEMA_NAME).setProperties(new Map([["schema",T.SCHEMA],["parameterName",T.ofString("parameterName")],["variableArgument",T.of("variableArgument",p.BOOLEAN).setDefaultValue(!1)]]));static EXPRESSION=(new T).setNamespace(o.SYSTEM).setName("ParameterExpression").setType(E.of(p.OBJECT)).setProperties(new Map([["isExpression",T.ofBoolean("isExpression").setDefaultValue(!0)],["value",T.ofAny("value")]]));variableArgument=!1;type=G.EXPRESSION;constructor(e,t){this.schema=t,this.parameterName=e}getSchema(){return this.schema}setSchema(e){return this.schema=e,this}getParameterName(){return this.parameterName}setParameterName(e){return this.parameterName=e,this}isVariableArgument(){return this.variableArgument}setVariableArgument(e){return this.variableArgument=e,this}getType(){return this.type}setType(e){return this.type=e,this}static ofEntry(e,t,r=!1,s=G.EXPRESSION){return[e,new $(e,t).setType(s).setVariableArgument(r)]}static of(e,t,r=!1,s=G.EXPRESSION){return new $(e,t).setType(s).setVariableArgument(r)}}let Y;var H;(H=Y||(Y={})).VALUE="VALUE",H.EXPRESSION="EXPRESSION";e({},"LinkedList",(()=>W));class W{head=void 0;tail=void 0;length=0;constructor(e){if(e?.length){for(const t of e)if(this.head){const e=new q(t,this.tail);this.tail.next=e,this.tail=e}else this.tail=this.head=new q(t);this.length=e.length}}push(e){const t=new q(e,void 0,this.head);this.head?(this.head.previous=t,this.head=t):this.tail=this.head=t,this.length++}pop(){if(!this.head)throw Error("List is empty and cannot pop further.");const e=this.head.value;if(this.length--,this.head==this.tail)return this.head=this.tail=void 0,e;const t=this.head;return this.head=t.next,t.next=void 0,t.previous=void 0,this.head.previous=void 0,e}isEmpty(){return!this.length}size(){return this.length}get(e){if(e<0||e>=this.length)throw new Error(`${e} is out of bounds [0,${this.length}]`);let t=this.head;for(;e>0;)t=this.head.next,--e;return t.value}set(e,t){if(e<0||e>=this.length)throw new A(O.format("Index $ out of bound to set the value in linked list.",e));let r=this.head;for(;e>0;)r=this.head.next,--e;return r.value=t,this}toString(){let e=this.head,t="";for(;e;)t+=e.value,e=e.next,e&&(t+=", ");return`[${t}]`}toArray(){let e=[],t=this.head;for(;t;)e.push(t.value),t=t.next;return e}peek(){if(!this.head)throw new Error("List is empty so cannot peak");return this.head.value}peekLast(){if(!this.tail)throw new Error("List is empty so cannot peak");return this.tail.value}getFirst(){if(!this.head)throw new Error("List is empty so cannot get first");return this.head.value}removeFirst(){return this.pop()}removeLast(){if(!this.tail)throw new Error("List is empty so cannot remove");--this.length;const e=this.tail.value;if(0==this.length)this.head=this.tail=void 0;else{const e=this.tail.previous;e.next=void 0,this.tail.previous=void 0,this.tail=e}return e}addAll(e){return e&&e.length?(e.forEach(this.add.bind(this)),this):this}add(e){return++this.length,this.tail||this.head?this.head===this.tail?(this.tail=new q(e,this.head),this.head.next=this.tail):(this.tail=new q(e,this.tail),this.tail.previous.next=this.tail):this.head=this.tail=new q(e),this}map(e,t){let r=new W,s=this.head,n=0;for(;s;)r.add(e(s.value,n)),s=s.next,++n;return r}forEach(e,t){let r=this.head,s=0;for(;r;)e(r.value,s),r=r.next,++s}}class q{constructor(e,t,r){this.value=e,this.next=r,this.previous=t}toString(){return""+this.value}}e({},"ExpressionEvaluator",(()=>at));class j{constructor(e){this.str=e??""}append(e){return this.str+=e,this}toString(){return""+this.str}trim(){return this.str=this.str.trim(),this}setLength(e){return this.str=this.str.substring(0,e),this}length(){return this.str.length}charAt(e){return this.str.charAt(e)}deleteCharAt(e){return this.checkIndex(e),this.str=this.str.substring(0,e)+this.str.substring(e+1),this}insert(e,t){return this.str=this.str.substring(0,e)+t+this.str.substring(e),this}checkIndex(e){if(e>=this.str.length)throw new A(`Index ${e} is greater than or equal to ${this.str.length}`)}substring(e,t){return this.str.substring(e,t)}}e({},"ExpressionEvaluationException",(()=>X));class X extends Error{constructor(e,t,r){super(O.format("$ : $",e,t)),this.cause=r}getCause(){return this.cause}}e({},"Expression",(()=>K));e({},"ExpressionToken",(()=>Q));class Q{constructor(e){this.expression=e}getExpression(){return this.expression}toString(){return this.expression}}e({},"Operation",(()=>J));class J{static MULTIPLICATION=new J("*");static DIVISION=new J("/");static INTEGER_DIVISION=new J("//");static MOD=new J("%");static ADDITION=new J("+");static SUBTRACTION=new J("-");static NOT=new J("not",void 0,!0);static AND=new J("and",void 0,!0);static OR=new J("or",void 0,!0);static LESS_THAN=new J("<");static LESS_THAN_EQUAL=new J("<=");static GREATER_THAN=new J(">");static GREATER_THAN_EQUAL=new J(">=");static EQUAL=new J("=");static NOT_EQUAL=new J("!=");static BITWISE_AND=new J("&");static BITWISE_OR=new J("|");static BITWISE_XOR=new J("^");static BITWISE_COMPLEMENT=new J("~");static BITWISE_LEFT_SHIFT=new J("<<");static BITWISE_RIGHT_SHIFT=new J(">>");static BITWISE_UNSIGNED_RIGHT_SHIFT=new J(">>>");static UNARY_PLUS=new J("UN: +","+");static UNARY_MINUS=new J("UN: -","-");static UNARY_LOGICAL_NOT=new J("UN: not","not");static UNARY_BITWISE_COMPLEMENT=new J("UN: ~","~");static ARRAY_OPERATOR=new J("[");static OBJECT_OPERATOR=new J(".");static VALUE_OF=new Map([["MULTIPLICATION",J.MULTIPLICATION],["DIVISION",J.DIVISION],["INTEGER_DIVISON",J.INTEGER_DIVISION],["MOD",J.MOD],["ADDITION",J.ADDITION],["SUBTRACTION",J.SUBTRACTION],["NOT",J.NOT],["AND",J.AND],["OR",J.OR],["LESS_THAN",J.LESS_THAN],["LESS_THAN_EQUAL",J.LESS_THAN_EQUAL],["GREATER_THAN",J.GREATER_THAN],["GREATER_THAN_EQUAL",J.GREATER_THAN_EQUAL],["EQUAL",J.EQUAL],["NOT_EQUAL",J.NOT_EQUAL],["BITWISE_AND",J.BITWISE_AND],["BITWISE_OR",J.BITWISE_OR],["BITWISE_XOR",J.BITWISE_XOR],["BITWISE_COMPLEMENT",J.BITWISE_COMPLEMENT],["BITWISE_LEFT_SHIFT",J.BITWISE_LEFT_SHIFT],["BITWISE_RIGHT_SHIFT",J.BITWISE_RIGHT_SHIFT],["BITWISE_UNSIGNED_RIGHT_SHIFT",J.BITWISE_UNSIGNED_RIGHT_SHIFT],["UNARY_PLUS",J.UNARY_PLUS],["UNARY_MINUS",J.UNARY_MINUS],["UNARY_LOGICAL_NOT",J.UNARY_LOGICAL_NOT],["UNARY_BITWISE_COMPLEMENT",J.UNARY_BITWISE_COMPLEMENT],["ARRAY_OPERATOR",J.ARRAY_OPERATOR],["OBJECT_OPERATOR",J.OBJECT_OPERATOR]]);static UNARY_OPERATORS=new Set([J.ADDITION,J.SUBTRACTION,J.NOT,J.BITWISE_COMPLEMENT,J.UNARY_PLUS,J.UNARY_MINUS,J.UNARY_LOGICAL_NOT,J.UNARY_BITWISE_COMPLEMENT]);static ARITHMETIC_OPERATORS=new Set([J.MULTIPLICATION,J.DIVISION,J.INTEGER_DIVISION,J.MOD,J.ADDITION,J.SUBTRACTION]);static LOGICAL_OPERATORS=new Set([J.NOT,J.AND,J.OR,J.LESS_THAN,J.LESS_THAN_EQUAL,J.GREATER_THAN,J.GREATER_THAN_EQUAL,J.EQUAL,J.NOT_EQUAL]);static BITWISE_OPERATORS=new Set([J.BITWISE_AND,J.BITWISE_COMPLEMENT,J.BITWISE_LEFT_SHIFT,J.BITWISE_OR,J.BITWISE_RIGHT_SHIFT,J.BITWISE_UNSIGNED_RIGHT_SHIFT,J.BITWISE_XOR]);static OPERATOR_PRIORITY=new Map([[J.UNARY_PLUS,1],[J.UNARY_MINUS,1],[J.UNARY_LOGICAL_NOT,1],[J.UNARY_BITWISE_COMPLEMENT,1],[J.ARRAY_OPERATOR,1],[J.OBJECT_OPERATOR,1],[J.MULTIPLICATION,2],[J.DIVISION,2],[J.INTEGER_DIVISION,2],[J.MOD,2],[J.ADDITION,3],[J.SUBTRACTION,3],[J.BITWISE_LEFT_SHIFT,4],[J.BITWISE_RIGHT_SHIFT,4],[J.BITWISE_UNSIGNED_RIGHT_SHIFT,4],[J.LESS_THAN,5],[J.LESS_THAN_EQUAL,5],[J.GREATER_THAN,5],[J.GREATER_THAN_EQUAL,5],[J.EQUAL,6],[J.NOT_EQUAL,6],[J.BITWISE_AND,7],[J.BITWISE_XOR,8],[J.BITWISE_OR,9],[J.AND,10],[J.OR,11]]);static OPERATORS=new Set([...Array.from(J.ARITHMETIC_OPERATORS),...Array.from(J.LOGICAL_OPERATORS),...Array.from(J.BITWISE_OPERATORS),J.ARRAY_OPERATOR,J.OBJECT_OPERATOR].map((e=>e.getOperator())));static OPERATORS_WITHOUT_SPACE_WRAP=new Set([...Array.from(J.ARITHMETIC_OPERATORS),...Array.from(J.LOGICAL_OPERATORS),...Array.from(J.BITWISE_OPERATORS),J.ARRAY_OPERATOR,J.OBJECT_OPERATOR].filter((e=>!e.shouldBeWrappedInSpace())).map((e=>e.getOperator())));static OPERATION_VALUE_OF=new Map(Array.from(J.VALUE_OF.entries()).map((([e,t])=>[t.getOperator(),t])));static UNARY_MAP=new Map([[J.ADDITION,J.UNARY_PLUS],[J.SUBTRACTION,J.UNARY_MINUS],[J.NOT,J.UNARY_LOGICAL_NOT],[J.BITWISE_COMPLEMENT,J.UNARY_BITWISE_COMPLEMENT],[J.UNARY_PLUS,J.UNARY_PLUS],[J.UNARY_MINUS,J.UNARY_MINUS],[J.UNARY_LOGICAL_NOT,J.UNARY_LOGICAL_NOT],[J.UNARY_BITWISE_COMPLEMENT,J.UNARY_BITWISE_COMPLEMENT]]);static BIGGEST_OPERATOR_SIZE=Array.from(J.VALUE_OF.values()).map((e=>e.getOperator())).filter((e=>!e.startsWith("UN: "))).map((e=>e.length)).reduce(((e,t)=>e>t?e:t),0);constructor(e,t,r=!1){this.operator=e,this.operatorName=t??e,this._shouldBeWrappedInSpace=r}getOperator(){return this.operator}getOperatorName(){return this.operatorName}shouldBeWrappedInSpace(){return this._shouldBeWrappedInSpace}valueOf(e){return J.VALUE_OF.get(e)}toString(){return this.operator}}class K extends Q{tokens=new W;ops=new W;constructor(e,t,r,s){super(e||""),t&&this.tokens.push(t),r&&this.tokens.push(r),s&&this.ops.push(s),this.evaluate()}getTokens(){return this.tokens}getOperations(){return this.ops}evaluate(){const e=this.expression.length;let t,r="",s=new j(""),n=0,a=!1;for(;n<e;){switch(r=this.expression[n],t=s.toString(),r){case" ":a=this.processTokenSepearator(s,t,a);break;case"(":n=this.processSubExpression(e,s,t,n,a),a=!1;break;case")":throw new X(this.expression,"Extra closing parenthesis found");case"]":throw new X(this.expression,"Extra closing square bracket found");default:let i=this.processOthers(r,e,s,t,n,a);n=i.getT1(),a=i.getT2(),a&&this.ops.peek()==J.ARRAY_OPERATOR&&(i=this.process(e,s,n),n=i.getT1(),a=i.getT2())}++n}if(t=s.toString(),!d.isNullOrBlank(t)){if(J.OPERATORS.has(t))throw new X(this.expression,"Expression is ending with an operator");this.tokens.push(new Q(t))}}process(e,t,r){let n=1;for(++r;r<e&&0!=n;){let e=this.expression.charAt(r);"]"==e?--n:"["==e&&++n,0!=n&&(t.append(e),r++)}return this.tokens.push(new K(t.toString())),t.setLength(0),new s(r,!1)}processOthers(e,t,r,n,a,i){let o=t-a;o=o<J.BIGGEST_OPERATOR_SIZE?o:J.BIGGEST_OPERATOR_SIZE;for(let e=o;e>0;e--){let t=this.expression.substring(a,a+e);if(J.OPERATORS_WITHOUT_SPACE_WRAP.has(t))return d.isNullOrBlank(n)||(this.tokens.push(new Q(n)),i=!1),this.checkUnaryOperator(this.tokens,this.ops,J.OPERATION_VALUE_OF.get(t),i),i=!0,r.setLength(0),new s(a+e-1,i)}return r.append(e),new s(a,!1)}processSubExpression(e,t,r,s,n){if(J.OPERATORS.has(r))this.checkUnaryOperator(this.tokens,this.ops,J.OPERATION_VALUE_OF.get(r),n),t.setLength(0);else if(!d.isNullOrBlank(r))throw new X(this.expression,O.format("Unkown token : $ found.",r));let a=1;const i=new j;let o=this.expression.charAt(s);for(s++;s<e&&a>0;)o=this.expression.charAt(s),"("==o?a++:")"==o&&a--,0!=a&&(i.append(o),s++);if(")"!=o)throw new X(this.expression,"Missing a closed parenthesis");for(;i.length()>2&&"("==i.charAt(0)&&")"==i.charAt(i.length()-1);)i.deleteCharAt(0),i.setLength(i.length()-1);return this.tokens.push(new K(i.toString().trim())),s}processTokenSepearator(e,t,r){return d.isNullOrBlank(t)||(J.OPERATORS.has(t)?(this.checkUnaryOperator(this.tokens,this.ops,J.OPERATION_VALUE_OF.get(t),r),r=!0):(this.tokens.push(new Q(t)),r=!1)),e.setLength(0),r}checkUnaryOperator(e,t,r,s){if(r)if(s||e.isEmpty()){if(!J.UNARY_OPERATORS.has(r))throw new X(this.expression,O.format("Extra operator $ found.",r));{const e=J.UNARY_MAP.get(r);e&&t.push(e)}}else{for(;!t.isEmpty()&&this.hasPrecedence(r,t.peek());){let r=t.pop();if(J.UNARY_OPERATORS.has(r)){let t=e.pop();e.push(new K("",t,void 0,r))}else{let t=e.pop(),s=e.pop();e.push(new K("",s,t,r))}}t.push(r)}}hasPrecedence(e,t){let r=J.OPERATOR_PRIORITY.get(e),s=J.OPERATOR_PRIORITY.get(t);if(!r||!s)throw new Error("Unknown operators provided");return s<r}toString(){if(this.ops.isEmpty())return 1==this.tokens.size()?this.tokens.get(0).toString():"Error: No tokens";let e=new j,t=0;const r=this.ops.toArray(),s=this.tokens.toArray();for(let n=0;n<r.length;n++)if(r[n].getOperator().startsWith("UN: "))e.append("(").append(r[n].getOperator().substring(4)).append(s[t]instanceof K?s[t].toString():s[t]).append(")"),t++;else{if(0==t){const r=s[t++];e.insert(0,r.toString())}const a=s[t++];e.insert(0,r[n].getOperator()).insert(0,a.toString()).insert(0,"(").append(")")}return e.toString()}equals(e){return this.expression==e.expression}}e({},"ExpressionTokenValue",(()=>z));class z extends Q{constructor(e,t){super(e),this.element=t}getTokenValue(){return this.element}getElement(){return this.element}toString(){return O.format("$: $",this.expression,this.element)}}var Z={};e(Z,"ArithmeticAdditionOperator",(()=>re));var ee={};e(ee,"BinaryOperator",(()=>te));class te{nullCheck(e,t,r){if(h(e)||h(t))throw new B(O.format("$ cannot be applied to a null value",r.getOperatorName()))}}class re extends te{apply(e,t){return this.nullCheck(e,t,J.ADDITION),e+t}}var se={};e(se,"ArithmeticDivisionOperator",(()=>ne));class ne extends te{apply(e,t){return this.nullCheck(e,t,J.DIVISION),e/t}}var ae={};e(ae,"ArithmeticIntegerDivisionOperator",(()=>ie));class ie extends te{apply(e,t){return this.nullCheck(e,t,J.DIVISION),Math.floor(e/t)}}var oe={};e(oe,"ArithmeticModulusOperator",(()=>he));class he extends te{apply(e,t){return this.nullCheck(e,t,J.MOD),e%t}}var ue={};e(ue,"ArithmeticMultiplicationOperator",(()=>le));class le extends te{apply(e,t){return this.nullCheck(e,t,J.MULTIPLICATION),e*t}}var pe={};e(pe,"ArithmeticSubtractionOperator",(()=>ce));class ce extends te{apply(e,t){return this.nullCheck(e,t,J.SUBTRACTION),e-t}}var me={};e(me,"ArrayOperator",(()=>ge));class ge extends te{apply(e,t){if(!e)throw new B("Cannot apply array operator on a null value");if(!t)throw new B("Cannot retrive null index value");if(!Array.isArray(e)&&"string"!=typeof e)throw new B(O.format("Cannot retrieve value from a primitive value $",e));if(t>=e.length)throw new B(O.format("Cannot retrieve index $ from the array of length $",t,e.length));return e[t]}}var fe={};e(fe,"BitwiseAndOperator",(()=>Ee));class Ee extends te{apply(e,t){return this.nullCheck(e,t,J.BITWISE_AND),e&t}}var Te={};e(Te,"BitwiseLeftShiftOperator",(()=>Ae));class Ae extends te{apply(e,t){return this.nullCheck(e,t,J.BITWISE_LEFT_SHIFT),e<<t}}var Oe={};e(Oe,"BitwiseOrOperator",(()=>de));class de extends te{apply(e,t){return this.nullCheck(e,t,J.BITWISE_OR),e|t}}var Se={};e(Se,"BitwiseRightShiftOperator",(()=>Ne));class Ne extends te{apply(e,t){return this.nullCheck(e,t,J.BITWISE_RIGHT_SHIFT),e>>t}}var Ie={};e(Ie,"BitwiseUnsignedRightShiftOperator",(()=>Re));class Re extends te{apply(e,t){return this.nullCheck(e,t,J.BITWISE_UNSIGNED_RIGHT_SHIFT),e>>>t}}var we={};e(we,"BitwiseXorOperator",(()=>ye));class ye extends te{apply(e,t){return this.nullCheck(e,t,J.BITWISE_XOR),e^t}}var xe={};e(xe,"LogicalAndOperator",(()=>ve));class _e{static findPrimitiveNullAsBoolean(e){if(!e)return new s(p.BOOLEAN,!1);let t=typeof e;if("object"===t)throw new B(O.format("$ is not a primitive type",e));let r=e;return"boolean"===t?new s(p.BOOLEAN,r):"string"===t?new s(p.STRING,r):_e.findPrimitiveNumberType(r)}static findPrimitive(e){if(h(e))return new s(p.NULL,void 0);let t=typeof e;if("object"===t)throw new B(O.format("$ is not a primitive type",e));let r=e;return"boolean"===t?new s(p.BOOLEAN,r):"string"===t?new s(p.STRING,r):_e.findPrimitiveNumberType(r)}static findPrimitiveNumberType(e){if(h(e)||Array.isArray(e)||"object"==typeof e)throw new B(O.format("Unable to convert $ to a number.",e));let t=e;try{let e=t;return Number.isInteger(e)?new s(p.LONG,e):new s(p.DOUBLE,e)}catch(e){throw new B(O.format("Unable to convert $ to a number.",t),e)}}static compare(e,t){if(e==t)return 0;if(h(e)||h(t))return h(e)?-1:1;if(Array.isArray(e)||Array.isArray(t)){if(Array.isArray(e)&&Array.isArray(t)){if(e.length!=t.length)return e.length-t.length;for(let r=0;r<e.length;r++){let s=this.compare(e[r],t[r]);if(0!=s)return s}return 0}return Array.isArray(e)?-1:1}const r=typeof e,s=typeof t;return"object"===r||"object"===s?("object"===r&&"object"===s&&Object.keys(e).forEach((r=>{let s=this.compare(e[r],t[r]);if(0!=s)return s})),"object"===r?-1:1):this.comparePrimitive(e,t)}static comparePrimitive(e,t){return h(e)||h(t)?h(e)&&h(t)?0:h(e)?-1:1:e==t?0:"boolean"==typeof e||"boolean"==typeof t?e?-1:1:"string"==typeof e||"string"==typeof t?e+""<t+""?-1:1:"number"==typeof e||"number"==typeof t?e-t:0}static baseNumberType(e){return Number.isInteger(e)?p.LONG:p.DOUBLE}static toPrimitiveType(e){return e}constructor(){}}class ve extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);if(r.getT1()!=p.BOOLEAN)throw new B(O.format("Boolean value expected but found $",r.getT2()));if(s.getT1()!=p.BOOLEAN)throw new B(O.format("Boolean value expected but found $",s.getT2()));return r.getT2()&&s.getT2()}}var Pe={};e(Pe,"LogicalEqualOperator",(()=>Me));class Me extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);return r.getT2()==s.getT2()}}var Le={};e(Le,"LogicalGreaterThanEqualOperator",(()=>Ue));class Ue extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);if(r.getT1()==p.BOOLEAN||s.getT1()==p.BOOLEAN)throw new B(O.format("Cannot compare >= with the values $ and $",r.getT2(),s.getT2()));return r.getT2()>=s.getT2()}}var Be={};e(Be,"LogicalGreaterThanOperator",(()=>Ce));class Ce extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);if(r.getT1()==p.BOOLEAN||s.getT1()==p.BOOLEAN)throw new B(O.format("Cannot compare > with the values $ and $",r.getT2(),s.getT2()));return r.getT2()>s.getT2()}}var be={};e(be,"LogicalLessThanEqualOperator",(()=>Ve));class Ve extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);if(r.getT1()==p.BOOLEAN||s.getT1()==p.BOOLEAN)throw new B(O.format("Cannot compare <= with the values $ and $",r.getT2(),s.getT2()));return r.getT2()<=s.getT2()}}var De={};e(De,"LogicalLessThanOperator",(()=>ke));class ke extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);if(r.getT1()==p.BOOLEAN||s.getT1()==p.BOOLEAN)throw new B(O.format("Cannot compare < with the values $ and $",r.getT2(),s.getT2()));return r.getT2()<s.getT2()}}var Ge={};e(Ge,"LogicalNotEqualOperator",(()=>Fe));class Fe extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);return r.getT2()!=s.getT2()}}var $e={};e($e,"LogicalOrOperator",(()=>Ye));class Ye extends te{apply(e,t){const r=_e.findPrimitiveNullAsBoolean(e),s=_e.findPrimitiveNullAsBoolean(t);if(r.getT1()!=p.BOOLEAN)throw new B(O.format("Boolean value expected but found $",r.getT2()));if(s.getT1()!=p.BOOLEAN)throw new B(O.format("Boolean value expected but found $",s.getT2()));return r.getT2()||s.getT2()}}var He={};e(He,"ObjectOperator",(()=>We));class We extends te{apply(e,t){if(!e)throw new B("Cannot apply array operator on a null value");if(!t)throw new B("Cannot retrive null property value");const r=typeof e;if(!Array.isArray(e)&&"string"!=r&&"object"!=r)throw new B(O.format("Cannot retrieve value from a primitive value $",e));return e[t]}}var qe={};e(qe,"ArithmeticUnaryMinusOperator",(()=>Qe));var je={};e(je,"UnaryOperator",(()=>Xe));class Xe{nullCheck(e,t){if(h(e))throw new B(O.format("$ cannot be applied to a null value",t.getOperatorName()))}}class Qe extends Xe{apply(e){return this.nullCheck(e,J.UNARY_MINUS),_e.findPrimitiveNumberType(e),-e}}var Je={};e(Je,"ArithmeticUnaryPlusOperator",(()=>Ke));class Ke extends Xe{apply(e){return this.nullCheck(e,J.UNARY_PLUS),_e.findPrimitiveNumberType(e),e}}var ze={};e(ze,"BitwiseComplementOperator",(()=>Ze));class Ze extends Xe{apply(e){this.nullCheck(e,J.UNARY_BITWISE_COMPLEMENT);let t=_e.findPrimitiveNumberType(e);if(t.getT1()!=p.INTEGER&&t.getT1()!=p.LONG)throw new B(O.format("Unable to apply bitwise operator on $",e));return~e}}var et={};e(et,"LogicalNotOperator",(()=>tt));class tt extends Xe{apply(e){if(this.nullCheck(e,J.UNARY_LOGICAL_NOT),_e.findPrimitiveNumberType(e).getT1()!=p.BOOLEAN)throw new B(O.format("Unable to apply bitwise operator on $",e));return!e}}e({},"TokenValueExtractor",(()=>rt));class rt{static REGEX_SQUARE_BRACKETS=/[\[\]]/;static REGEX_DOT=/\./;getValue(e){let t=this.getPrefix();if(!e.startsWith(t))throw new A(O.format("Token $ doesn't start with $",e,t));return this.getValueInternal(e)}retrieveElementFrom(e,t,r,s){if(h(s))return;if(t.length==r)return s;let n=t[r].split(rt.REGEX_SQUARE_BRACKETS).map((e=>e.trim())).filter((e=>!d.isNullOrBlank(e))).reduce(((s,n,a)=>this.resolveForEachPartOfTokenWithBrackets(e,t,r,n,s,a)),s);return this.retrieveElementFrom(e,t,r+1,n)}resolveForEachPartOfTokenWithBrackets(e,t,r,s,n,a){if(!h(n)){if(0===a){if(Array.isArray(n)){if("length"===s)return n.length;try{let e=parseInt(s);if(isNaN(e))throw new Error(O.format("$ is not a number",e));if(e>=n.length)return;return n[e]}catch(t){throw new X(e,O.format("$ couldn't be parsed into integer in $",s,e),t)}}return this.checkIfObject(e,t,r,n),n[s]}if(s?.startsWith('"')){if(!s.endsWith('"')||1==s.length||2==s.length)throw new X(e,O.format("$ is missing a double quote or empty key found",e));return this.checkIfObject(e,t,r,n),n[s.substring(1,s.length-1)]}try{let t=parseInt(s);if(isNaN(t))throw new Error(O.format("$ is not a number",t));if(!Array.isArray(n))throw new X(e,O.format("Expecting an array with index $ while processing the expression",t,e));if(t>=n.length)return;return n[t]}catch(t){throw new X(e,O.format("$ couldn't be parsed into integer in $",s,e),t)}}}checkIfObject(e,t,r,s){if("object"!=typeof s||Array.isArray(s))throw new X(e,O.format("Unable to retrive $ from $ in the path $",t[r],s.toString(),e))}}const st=new Map([["true",!0],["false",!1],["null",void 0]]);class nt extends rt{static INSTANCE=new nt;getValueInternal(e){if(!d.isNullOrBlank(e))return e=e.trim(),st.has(e)?st.get(e):e.startsWith('"')?this.processString(e):this.processNumbers(e)}processNumbers(e){try{let t;if(t=-1==e.indexOf(".")?parseInt(e):parseFloat(e),isNaN(t))throw new Error("Parse number error");return t}catch(t){throw new X(e,O.format("Unable to parse the literal or expression $",e),t)}}processString(e){if(!e.endsWith('"'))throw new X(e,O.format("String literal $ is not closed properly",e));return e.substring(1,e.length-1)}getPrefix(){return""}}class at{static UNARY_OPERATORS_MAP=new Map([[J.UNARY_BITWISE_COMPLEMENT,new Ze],[J.UNARY_LOGICAL_NOT,new tt],[J.UNARY_MINUS,new Qe],[J.UNARY_PLUS,new Ke]]);static BINARY_OPERATORS_MAP=new Map([[J.ADDITION,new re],[J.DIVISION,new ne],[J.INTEGER_DIVISION,new ie],[J.MOD,new he],[J.MULTIPLICATION,new le],[J.SUBTRACTION,new ce],[J.BITWISE_AND,new Ee],[J.BITWISE_LEFT_SHIFT,new Ae],[J.BITWISE_OR,new de],[J.BITWISE_RIGHT_SHIFT,new Ne],[J.BITWISE_UNSIGNED_RIGHT_SHIFT,new Re],[J.BITWISE_XOR,new ye],[J.AND,new ve],[J.EQUAL,new Me],[J.GREATER_THAN,new Ce],[J.GREATER_THAN_EQUAL,new Ue],[J.LESS_THAN,new ke],[J.LESS_THAN_EQUAL,new Ve],[J.OR,new Ye],[J.NOT_EQUAL,new Fe],[J.ARRAY_OPERATOR,new ge],[J.OBJECT_OPERATOR,new We]]);static UNARY_OPERATORS_MAP_KEY_SET=new Set(at.UNARY_OPERATORS_MAP.keys());constructor(e){e instanceof K?(this.exp=e,this.expression=this.exp.getExpression()):this.expression=e}evaluate(e){return this.exp||(this.exp=new K(this.expression)),this.evaluateExpression(this.exp,e)}getExpression(){return this.exp||(this.exp=new K(this.expression)),this.exp}getExpressionString(){return this.expression}evaluateExpression(e,t){let r=e.getOperations(),s=e.getTokens();for(;!r.isEmpty();){let e=r.pop(),i=s.pop();if(at.UNARY_OPERATORS_MAP_KEY_SET.has(e))s.push(this.applyUnaryOperation(e,this.getValueFromToken(t,i)));else if(e==J.OBJECT_OPERATOR||e==J.ARRAY_OPERATOR)this.processObjectOrArrayOperator(t,r,s,e,i);else{const r=s.pop();var n=this.getValueFromToken(t,r),a=this.getValueFromToken(t,i);s.push(this.applyBinaryOperation(e,n,a))}}if(s.isEmpty())throw new B(O.format("Expression : $ evaluated to null",e));if(1!=s.size())throw new B(O.format("Expression : $ evaluated multiple values $",e,s));const i=s.get(0);if(i instanceof z)return i.getElement();if(!(i instanceof K))return this.getValueFromToken(t,i);throw new B(O.format("Expression : $ evaluated to $",e,s.get(0)))}processObjectOrArrayOperator(e,t,r,s,n){const a=new W,i=new W;if(!s||!n)return;do{i.push(s),n instanceof K?a.push(new z(n.toString(),this.evaluateExpression(n,e))):n&&a.push(n),n=r.isEmpty()?void 0:r.pop(),s=t.isEmpty()?void 0:t.pop()}while(s==J.OBJECT_OPERATOR||s==J.ARRAY_OPERATOR);n&&(n instanceof K?a.push(new z(n.toString(),this.evaluateExpression(n,e))):a.push(n)),s&&t.push(s);let o=a.pop(),h=new j(o instanceof z?o.getTokenValue():o.toString());for(;!a.isEmpty();)o=a.pop(),s=i.pop(),h.append(s.getOperator()).append(o instanceof z?o.getTokenValue():o.toString()),s==J.ARRAY_OPERATOR&&h.append("]");let u=h.toString(),l=u.substring(0,u.indexOf(".")+1);if(l.length>2&&e.has(l))r.push(new z(u,this.getValue(u,e)));else{let e;try{e=nt.INSTANCE.getValue(u)}catch(t){e=u}r.push(new z(u,e))}}applyBinaryOperation(e,t,r){if("object"===typeof t||"object"===typeof r||Array.isArray(t)||Array.isArray(r))throw new X(this.expression,O.format("Cannot evaluate expression $ $ $",t,e.getOperator(),r));let s=at.BINARY_OPERATORS_MAP.get(e);if(!s)throw new X(this.expression,O.format("No operator found to evaluate $ $ $",t,e.getOperator(),r));return new z(e.toString(),s.apply(t,r))}applyUnaryOperation(e,t){if("object"===typeof t||Array.isArray(t))throw new X(this.expression,O.format("The operator $ cannot be applied to $",e.getOperator(),t));let r=at.UNARY_OPERATORS_MAP.get(e);if(!r)throw new X(this.expression,O.format("No Unary operator $ is found to apply on $",e.getOperator(),t));return new z(e.toString(),r.apply(t))}getValueFromToken(e,t){return t instanceof K?this.evaluateExpression(t,e):t instanceof z?t.getElement():this.getValue(t.getExpression(),e)}getValue(e,t){if(e.length<=5)return nt.INSTANCE.getValue(e);const r=e.substring(0,e.indexOf(".")+1);return(t.get(r)??nt.INSTANCE).getValue(e)}}class it extends rt{static PREFIX="Arguments.";constructor(e){super(),this.args=e}getValueInternal(e){let t=e.split(rt.REGEX_DOT);return this.retrieveElementFrom(e,t,2,this.args.get(t[1]))}getPrefix(){return it.PREFIX}}class ot extends rt{static PREFIX="Context.";constructor(e){super(),this.context=e}getValueInternal(e){let t=e.split(rt.REGEX_DOT),r=t[1],s=r.indexOf("["),n=2;return-1!=s&&(r=t[1].substring(0,s),t[1]=t[1].substring(s),n=1),this.retrieveElementFrom(e,t,n,this.context.get(r)?.getElement())}getPrefix(){return ot.PREFIX}}class ht extends rt{static PREFIX="Steps.";constructor(e){super(),this.output=e}getValueInternal(e){let t=e.split(rt.REGEX_DOT),r=1,s=this.output.get(t[r++]);if(!s||r>=t.length)return;let n=s.get(t[r++]);if(!n||r>=t.length)return;let a=n.get(t[r++]);return this.retrieveElementFrom(e,t,r,a)}getPrefix(){return ht.PREFIX}}class ut{count=0;valueExtractors=new Map;getContext(){return this.context}setContext(e){this.context=e;let t=new ot(e);return this.valueExtractors.set(t.getPrefix(),t),this}getArguments(){return this.args}setArguments(e){this.args=e;let t=new it(e);return this.valueExtractors.set(t.getPrefix(),t),this}getEvents(){return this.events}setEvents(e){return this.events=e,this}getStatementExecution(){return this.statementExecution}setStatementExecution(e){return this.statementExecution=e,this}getSteps(){return this.steps}setSteps(e){this.steps=e;let t=new ht(e);return this.valueExtractors.set(t.getPrefix(),t),this}getCount(){return this.count}setCount(e){return this.count=e,this}getValuesMap(){return this.valueExtractors}}class lt{outVertices=new Map;inVertices=new Set;constructor(e,t){this.data=t,this.graph=e}getData(){return this.data}setData(e){return this.data=e,this}getOutVertices(){return this.outVertices}setOutVertices(e){return this.outVertices=e,this}getInVertices(){return this.inVertices}setInVertices(e){return this.inVertices=e,this}getGraph(){return this.graph}setGraph(e){return this.graph=e,this}getKey(){return this.data.getUniqueKey()}addOutEdgeTo(e,t){return this.outVertices.has(e)||this.outVertices.set(e,new Set),this.outVertices.get(e).add(t),t.inVertices.add(new s(this,e)),t}addInEdgeTo(e,t){return this.inVertices.add(new s(e,t)),e.outVertices.has(t)||e.outVertices.set(t,new Set),e.outVertices.get(t).add(this),e}hasIncomingEdges(){return!!this.inVertices.size}hasOutgoingEdges(){return!!this.outVertices.size}getSubGraphOfType(e){let t=new pt(!0);var r=new W(Array.from(this.outVertices.get(e)??[]));for(r.map((e=>e.getData())).forEach((e=>t.addVertex(e)));!r.isEmpty();){var s=r.pop();Array.from(s.outVertices.values()).flatMap((e=>Array.from(e))).forEach((e=>{t.addVertex(e.getData()),r.add(e)}))}return t}toString(){var e=Array.from(this.getInVertices()).map((e=>e.getT1().getKey()+"("+e.getT2()+")")).join(", "),t=Array.from(this.outVertices.entries()).map((([e,t])=>e+": "+Array.from(t).map((e=>e.getKey())).join(","))).join("\n\t\t");return this.getKey()+":\n\tIn: "+e+"\n\tOut: \n\t\t"+t}}class pt{nodeMap=new Map;constructor(e=!1){this.isSubGrph=e}getVerticesData(){return Array.from(this.nodeMap.values()).map((e=>e.getData()))}addVertex(e){if(!this.nodeMap.has(e.getUniqueKey())){let t=new lt(this,e);this.nodeMap.set(e.getUniqueKey(),t)}return this.nodeMap.get(e.getUniqueKey())}getVertex(e){return this.nodeMap.get(e)}getVertexData(e){if(this.nodeMap.has(e))return this.nodeMap.get(e).getData()}getVerticesWithNoIncomingEdges(){return Array.from(this.nodeMap.values()).filter((e=>!e.hasIncomingEdges()))}isCyclic(){let e,t=new W(this.getVerticesWithNoIncomingEdges()),r=new Set;for(;!t.isEmpty();){if(r.has(t.getFirst().getKey()))return!0;e=t.removeFirst(),r.add(e.getKey()),e.hasOutgoingEdges()&&t.addAll(Array.from(e.getOutVertices().values()).flatMap((e=>Array.from(e))))}return!1}addVertices(e){for(const t of e)this.addVertex(t)}getNodeMap(){return this.nodeMap}isSubGraph(){return this.isSubGrph}toString(){return"Execution Graph : \n"+Array.from(this.nodeMap.values()).map((e=>e.toString())).join("\n")}}class ct{constructor(e,t){this.message=t,this.messageType=e}getMessageType(){return this.messageType}setMessageType(e){return this.messageType=e,this}getMessage(){return this.message}setMessage(e){return this.message=e,this}toString(){return`${this.messageType} : ${this.message}`}}class mt{messages=new Array;dependencies=new Set;constructor(e){this.statement=e}getStatement(){return this.statement}setStatement(e){return this.statement=e,this}getMessages(){return this.messages}setMessages(e){return this.messages=e,this}getDependencies(){return this.dependencies}setDependencies(e){return this.dependencies=e,this}getUniqueKey(){return this.statement.getStatementName()}addMessage(e,t){this.messages.push(new ct(e,t))}addDependency(e){this.dependencies.add(e)}getDepenedencies(){return this.dependencies}equals(e){if(!(e instanceof mt))return!1;return e.statement.equals(this.statement)}}let gt;var ft;(ft=gt||(gt={})).ERROR="ERROR",ft.WARNING="WARNING",ft.MESSAGE="MESSAGE";class Et extends C{static PARAMETER_NEEDS_A_VALUE='Parameter "$" needs a value';static STEP_REGEX_PATTERN=new RegExp("Steps\\.([a-zA-Z0-9\\\\-]{1,})\\.([a-zA-Z0-9\\\\-]{1,})","g");static VERSION=1;static MAX_EXECUTION_ITERATIONS=1e7;constructor(e,t,r){if(super(),this.fd=e,this.fd.getVersion()>Et.VERSION)throw new A("Runtime is at a lower version "+Et.VERSION+" and trying to run code from version "+this.fd.getVersion()+".");this.fRepo=t,this.sRepo=r}getSignature(){return this.fd}getExecutionPlan(e){let t=new pt;for(let r of Array.from(this.fd.getSteps().values()))t.addVertex(this.prepareStatementExecution(e,r));let r=this.makeEdges(t);if(r.length)throw new A(O.format("Found these unresolved dependencies : $ ",r.map((e=>O.format("Steps.$.$",e.getT1(),e.getT2())))));return t}internalExecute(e){e.getContext()||e.setContext(new Map),e.getEvents()||e.setEvents(new Map),e.getSteps()||e.setSteps(new Map);let t=this.getExecutionPlan(e.getContext()),r=t.getVerticesData().filter((e=>e.getMessages().length)).map((e=>e.getStatement().getStatementName()+": \n"+e.getMessages().join(",")));if(r?.length)throw new A("Please fix the errors in the function definition before execution : \n"+r.join(",\n"));return this.executeGraph(t,e)}executeGraph(e,t){let r=new W;r.addAll(e.getVerticesWithNoIncomingEdges());let s=new W;for(;!(r.isEmpty()&&s.isEmpty()||t.getEvents()?.has(V.OUTPUT));)if(this.processBranchQue(t,r,s),this.processExecutionQue(t,r,s),t.setCount(t.getCount()+1),t.getCount()==Et.MAX_EXECUTION_ITERATIONS)throw new A("Execution locked in an infinite loop");if(!e.isSubGraph()&&!t.getEvents()?.size)throw new A("No events raised");return new k(Array.from(t.getEvents()?.entries()??[]).flatMap((e=>e[1].map((t=>D.of(e[0],t))))))}processExecutionQue(e,t,r){if(!t.isEmpty()){let s=t.pop();this.allDependenciesResolvedVertex(s,e.getSteps())?this.executeVertex(s,e,r,t):t.add(s)}}processBranchQue(e,t,r){if(r.length){let s=r.pop();this.allDependenciesResolvedTuples(s.getT2(),e.getSteps())?this.executeBranch(e,t,s):r.add(s)}}executeBranch(e,t,r){let s,n=r.getT4();do{this.executeGraph(r.getT1(),e),s=r.getT3().next(),s&&(e.getSteps()?.has(n.getData().getStatement().getStatementName())||e.getSteps()?.set(n.getData().getStatement().getStatementName(),new Map),e.getSteps()?.get(n.getData().getStatement().getStatementName())?.set(s.getName(),this.resolveInternalExpressions(s.getResult(),e)))}while(s&&s.getName()!=V.OUTPUT);s?.getName()==V.OUTPUT&&n.getOutVertices().has(V.OUTPUT)&&(n?.getOutVertices()?.get(V.OUTPUT)??[]).forEach((e=>t.add(e)))}executeVertex(e,t,r,s){let n=e.getData().getStatement(),i=this.fRepo.find(n.getNamespace(),n.getName());if(!i)throw new A(O.format("$.$ function is not found.",n.getNamespace(),n.getName()));let o=i?.getSignature().getParameters(),h=this.getArgumentsFromParametersMap(t,n,o??new Map),u=t.getContext(),l=i.execute((new ut).setContext(u).setArguments(h).setEvents(t.getEvents()).setSteps(t.getSteps()).setStatementExecution(e.getData()).setCount(t.getCount())),p=l.next();if(!p)throw new A(O.format("Executing $ returned no events",n.getStatementName()));let c=p.getName()==V.OUTPUT;if(t.getSteps()?.has(n.getStatementName())||t.getSteps().set(n.getStatementName(),new Map),t.getSteps().get(n.getStatementName()).set(p.getName(),this.resolveInternalExpressions(p.getResult(),t)),c){let t=e.getOutVertices().get(V.OUTPUT);t&&t.forEach((e=>s.add(e)))}else{let t=e.getSubGraphOfType(p.getName()),s=this.makeEdges(t);r.push(new a(t,s,l,e))}}resolveInternalExpressions(e,t){return e?Array.from(e.entries()).map((e=>new s(e[0],this.resolveInternalExpression(e[1],t)))).reduce(((e,t)=>(e.set(t.getT1(),t.getT2()),e)),new Map):e}resolveInternalExpression(e,t){if(h(e)||"object"!=typeof e)return e;if(e instanceof b){return new at(e.getExpression()).evaluate(t.getValuesMap())}if(Array.isArray(e)){let r=[];for(let s of e)r.push(this.resolveInternalExpression(s,t));return r}if("object"==typeof e){let r={};for(let s of Object.entries(e))r[s[0]]=this.resolveInternalExpression(s[1],t);return r}}allDependenciesResolvedTuples(e,t){for(let r of e){if(!t.has(r.getT1()))return!1;if(!t.get(r.getT1())?.get(r.getT2()))return!1}return!0}allDependenciesResolvedVertex(e,t){return!e.getInVertices().size||0==Array.from(e.getInVertices()).filter((e=>{let r=e.getT1().getData().getStatement().getStatementName(),s=e.getT2();return!(t.has(r)&&t.get(r)?.has(s))})).length}getArgumentsFromParametersMap(e,t,r){return Array.from(t.getParameterMap().entries()).map((t=>{let n,a=t[1];if(!a?.length)return new s(t[0],n);let i=r.get(t[0]);return i?(n=i.isVariableArgument()?a.map((t=>this.parameterReferenceEvaluation(e,t))).flatMap((e=>Array.isArray(e)?e:[e])):this.parameterReferenceEvaluation(e,a[0]),new s(t[0],n)):new s(t[0],void 0)})).filter((e=>!h(e.getT2()))).reduce(((e,t)=>(e.set(t.getT1(),t.getT2()),e)),new Map)}parameterReferenceEvaluation(e,t){let r;if(t.getType()==Y.VALUE)r=this.resolveInternalExpression(t.getValue(),e);else if(t.getType()==Y.EXPRESSION&&!d.isNullOrBlank(t.getExpression())){r=new at(t.getExpression()??"").evaluate(e.getValuesMap())}return r}prepareStatementExecution(e,t){let r=new mt(t),s=this.fRepo.find(t.getNamespace(),t.getName());if(!s)throw new A(O.format("$.$ was not available",t.getNamespace(),t.getName()));let n=new Map(s.getSignature().getParameters());for(let s of Array.from(t.getParameterMap().entries())){let t=n.get(s[0]);if(!t)continue;let a=s[1];if(a.length){if(t.isVariableArgument())for(let s of a)this.parameterReferenceValidation(e,r,t,s);else{let s=a[0];this.parameterReferenceValidation(e,r,t,s)}n.delete(t.getParameterName())}else h(I.getDefaultValue(t.getSchema(),this.sRepo))&&r.addMessage(gt.ERROR,O.format(Et.PARAMETER_NEEDS_A_VALUE,t.getParameterName()))}if(!h(r.getStatement().getDependentStatements()))for(let e of r.getStatement().getDependentStatements())r.addDependency(e);if(n.size)for(let e of Array.from(n.values()))h(I.getDefaultValue(e.getSchema(),this.sRepo))&&r.addMessage(gt.ERROR,O.format(Et.PARAMETER_NEEDS_A_VALUE,e.getParameterName()));return r}parameterReferenceValidation(e,t,r,n){if(n){if(n.getType()==Y.VALUE){h(n.getValue())&&h(I.getDefaultValue(r.getSchema(),this.sRepo))&&t.addMessage(gt.ERROR,O.format(Et.PARAMETER_NEEDS_A_VALUE,r.getParameterName()));let e=new W;for(e.push(new s(r.getSchema(),n.getValue()));!e.isEmpty();){let r=e.pop();if(r.getT2()instanceof b)this.addDependencies(t,r.getT2().getExpression());else{if(h(r.getT1())||h(r.getT1().getType()))continue;if(r.getT1().getType()?.contains(p.ARRAY)&&Array.isArray(r.getT2())){let t=r.getT1().getItems();if(!t)continue;if(t.isSingleType())for(let n of r.getT2())e.push(new s(t.getSingleSchema(),n));else{let n=r.getT2();for(let r=0;r<n.length;r++)e.push(new s(t.getTupleSchema()[r],n[r]))}}else if(r.getT1().getType()?.contains(p.OBJECT)&&"object"==typeof r.getT2()){let n=r.getT1();if(n.getName()===$.EXPRESSION.getName()&&n.getNamespace()===$.EXPRESSION.getNamespace()){let e=r.getT2();e.isExpression&&this.addDependencies(t,e.value)}else if(n.getProperties())for(let t of Object.entries(r.getT2()))n.getProperties().has(t[0])&&e.push(new s(n.getProperties().get(t[0]),t[1]))}}}}else if(n.getType()==Y.EXPRESSION)if(d.isNullOrBlank(n.getExpression()))h(I.getDefaultValue(r.getSchema(),this.sRepo))&&t.addMessage(gt.ERROR,O.format(Et.PARAMETER_NEEDS_A_VALUE,r.getParameterName()));else try{this.addDependencies(t,n.getExpression())}catch(e){t.addMessage(gt.ERROR,O.format("Error evaluating $ : $",n.getExpression(),e))}}else h(I.getDefaultValue(r.getSchema(),this.sRepo))&&t.addMessage(gt.ERROR,O.format(Et.PARAMETER_NEEDS_A_VALUE,r.getParameterName()))}addDependencies(e,t){t&&Array.from(t.match(Et.STEP_REGEX_PATTERN)??[]).forEach((t=>e.addDependency(t)))}makeEdges(e){let t=e.getNodeMap().values(),r=[];for(let n of Array.from(t))for(let t of n.getData().getDependencies()){let a=t.indexOf(".",6),i=t.substring(6,a),o=t.indexOf(".",a+1),h=-1==o?t.substring(a+1):t.substring(a+1,o);e.getNodeMap().has(i)||r.push(new s(i,h));let u=e.getNodeMap().get(i);u&&n.addInEdgeTo(u,h)}return r}}var Tt={};t(Tt,Z),t(Tt,se),t(Tt,ae),t(Tt,oe),t(Tt,ue),t(Tt,pe),t(Tt,me),t(Tt,ee),t(Tt,fe),t(Tt,Te),t(Tt,Oe),t(Tt,Se),t(Tt,Ie),t(Tt,we),t(Tt,xe),t(Tt,Pe),t(Tt,Le),t(Tt,Be),t(Tt,be),t(Tt,Ge),t(Tt,De),t(Tt,$e),t(Tt,He);var At={};t(At,qe),t(At,Je),t(At,ze),t(At,et),t(At,je);export{s as Tuple2,n as Tuple3,a as Tuple4,i as HybridRepository,T as Schema,p as SchemaType,L as SchemaValidator,U as KIRunConstants,B as ExecutionException,A as KIRuntimeException,C as AbstractFunction,o as Namespaces,Et as KIRuntime,K as Expression,at as ExpressionEvaluator,rt as TokenValueExtractor,X as ExpressionEvaluationException,Q as ExpressionToken,z as ExpressionTokenValue,J as Operation,W as LinkedList,h as isNullValue,O as StringFormatter,d as StringUtil,re as ArithmeticAdditionOperator,ne as ArithmeticDivisionOperator,ie as ArithmeticIntegerDivisionOperator,he as ArithmeticModulusOperator,le as ArithmeticMultiplicationOperator,ce as ArithmeticSubtractionOperator,ge as ArrayOperator,te as BinaryOperator,Ee as BitwiseAndOperator,Ae as BitwiseLeftShiftOperator,de as BitwiseOrOperator,Ne as BitwiseRightShiftOperator,Re as BitwiseUnsignedRightShiftOperator,ye as BitwiseXorOperator,ve as LogicalAndOperator,Me as LogicalEqualOperator,Ue as LogicalGreaterThanEqualOperator,Ce as LogicalGreaterThanOperator,Ve as LogicalLessThanEqualOperator,Fe as LogicalNotEqualOperator,ke as LogicalLessThanOperator,Ye as LogicalOrOperator,We as ObjectOperator,Qe as ArithmeticUnaryMinusOperator,Ke as ArithmeticUnaryPlusOperator,Ze as BitwiseComplementOperator,tt as LogicalNotOperator,Xe as UnaryOperator};
1
+ function e(e,t){return Object.keys(t).forEach((function(r){"default"===r||"__esModule"===r||e.hasOwnProperty(r)||Object.defineProperty(e,r,{enumerable:!0,get:function(){return t[r]}})})),e}function t(e,t,r,s){Object.defineProperty(e,t,{get:r,set:s,enumerable:!0,configurable:!0})}var r={};t(r,"Tuple2",(()=>s)),t(r,"Tuple3",(()=>n)),t(r,"Tuple4",(()=>i));class s{constructor(e,t){this.f=e,this.s=t}getT1(){return this.f}getT2(){return this.s}}class n extends s{constructor(e,t,r){super(e,t),this.t=r}getT3(){return this.t}}class i extends n{constructor(e,t,r,s){super(e,t,r),this.fr=s}getT4(){return this.fr}}var a={};t(a,"HybridRepository",(()=>o));class o{constructor(...e){this.repos=e}find(e,t){for(let r of this.repos){let s=r.find(e,t);if(s)return s}}}var h={};t(h,"Schema",(()=>N));var u={};t(u,"Namespaces",(()=>l));class l{static SYSTEM="System";static SYSTEM_CTX="System.Context";static SYSTEM_LOOP="System.Loop";static SYSTEM_ARRAY="System.Array";static MATH="System.Math";static STRING="System.String";constructor(){}}var p={};function c(e){return null==e}t(p,"isNullValue",(()=>c));class m{setSingleSchema(e){return this.singleSchema=e,this}setTupleSchema(e){return this.tupleSchema=e,this}getSingleSchema(){return this.singleSchema}getTupleSchema(){return this.tupleSchema}isSingleType(){return!c(this.singleSchema)}static of(...e){return 1==e.length?(new m).setSingleSchema(e[0]):(new m).setTupleSchema(e)}static from(e){if(!e)return;Array.isArray(e)&&m.of(...N.fromListOfSchemas(e));let t=N.from(e);return t?m.of(t):void 0}}class g{getBooleanValue(){return this.booleanValue}getSchemaValue(){return this.schemaValue}setBooleanValue(e){return this.booleanValue=e,this}setSchemaValue(e){return this.schemaValue=e,this}static from(e){if(!e)return;const t=new g;return t.booleanValue=e.booleanValue,t.schemaValue=e.schemaValue,t}}var f={};let E;var T;t(f,"SchemaType",(()=>E)),(T=E||(E={})).INTEGER="Integer",T.LONG="Long",T.FLOAT="Float",T.DOUBLE="Double",T.STRING="String",T.OBJECT="Object",T.ARRAY="Array",T.BOOLEAN="Boolean",T.NULL="Null";class A{}class d extends A{constructor(e){super(),this.type=e}getType(){return this.type}setType(e){return this.type=e,this}getAllowedSchemaTypes(){return this.type}contains(e){return this.type?.has(e)}}class O extends A{constructor(e){super(),this.type=e}getType(){return this.type}getAllowedSchemaTypes(){return new Set([this.type])}contains(e){return this.type==e}}class S{static of(...e){return 1==e.length?new O(e[0]):new d(new Set(e))}static from(e){return"string"==typeof e?S.of(e):Array.isArray(e)?S.of(...Array.of(e).map((e=>e)).map((e=>e))):void 0}}class N{static NULL=(new N).setNamespace(l.SYSTEM).setName("Null").setType(S.of(E.NULL)).setConstant(void 0);static TYPE_SCHEMA=(new N).setType(S.of(E.STRING)).setEnums(["INTEGER","LONG","FLOAT","DOUBLE","STRING","OBJECT","ARRAY","BOOLEAN","NULL"]);static SCHEMA=(new N).setNamespace(l.SYSTEM).setName("Schema").setType(S.of(E.OBJECT)).setProperties(new Map([["namespace",N.of("namespace",E.STRING).setDefaultValue("_")],["name",N.ofString("name")],["version",N.of("version",E.INTEGER).setDefaultValue(1)],["ref",N.ofString("ref")],["type",(new N).setAnyOf([N.TYPE_SCHEMA,N.ofArray("type",N.TYPE_SCHEMA)])],["anyOf",N.ofArray("anyOf",N.ofRef("#/"))],["allOf",N.ofArray("allOf",N.ofRef("#/"))],["oneOf",N.ofArray("oneOf",N.ofRef("#/"))],["not",N.ofRef("#/")],["title",N.ofString("title")],["description",N.ofString("description")],["id",N.ofString("id")],["examples",N.ofAny("examples")],["defaultValue",N.ofAny("defaultValue")],["comment",N.ofString("comment")],["enums",N.ofArray("enums",N.ofString("enums"))],["constant",N.ofAny("constant")],["pattern",N.ofString("pattern")],["format",N.of("format",E.STRING).setEnums(["DATETIME","TIME","DATE","EMAIL","REGEX"])],["minLength",N.ofInteger("minLength")],["maxLength",N.ofInteger("maxLength")],["multipleOf",N.ofLong("multipleOf")],["minimum",N.ofNumber("minimum")],["maximum",N.ofNumber("maximum")],["exclusiveMinimum",N.ofNumber("exclusiveMinimum")],["exclusiveMaximum",N.ofNumber("exclusiveMaximum")],["properties",N.of("properties",E.OBJECT).setAdditionalProperties((new g).setSchemaValue(N.ofRef("#/")))],["additionalProperties",(new N).setName("additionalProperty").setNamespace(l.SYSTEM).setAnyOf([N.ofBoolean("additionalProperty"),N.ofObject("additionalProperty").setRef("#/")]).setDefaultValue(!0)],["required",N.ofArray("required",N.ofString("required")).setDefaultValue([])],["propertyNames",N.ofRef("#/")],["minProperties",N.ofInteger("minProperties")],["maxProperties",N.ofInteger("maxProperties")],["patternProperties",N.of("patternProperties",E.OBJECT).setAdditionalProperties((new g).setSchemaValue(N.ofRef("#/")))],["items",(new N).setName("items").setAnyOf([N.ofRef("#/").setName("item"),N.ofArray("tuple",N.ofRef("#/"))])],["contains",N.ofRef("#/")],["minItems",N.ofInteger("minItems")],["maxItems",N.ofInteger("maxItems")],["uniqueItems",N.ofBoolean("uniqueItems")],["$defs",N.of("$defs",E.OBJECT).setAdditionalProperties((new g).setSchemaValue(N.ofRef("#/")))],["permission",N.ofString("permission")]])).setRequired([]);static ofString(e){return(new N).setType(S.of(E.STRING)).setName(e)}static ofInteger(e){return(new N).setType(S.of(E.INTEGER)).setName(e)}static ofFloat(e){return(new N).setType(S.of(E.FLOAT)).setName(e)}static ofLong(e){return(new N).setType(S.of(E.LONG)).setName(e)}static ofDouble(e){return(new N).setType(S.of(E.DOUBLE)).setName(e)}static ofAny(e){return(new N).setType(S.of(E.INTEGER,E.LONG,E.FLOAT,E.DOUBLE,E.STRING,E.BOOLEAN,E.ARRAY,E.NULL,E.OBJECT)).setName(e)}static ofAnyNotNull(e){return(new N).setType(S.of(E.INTEGER,E.LONG,E.FLOAT,E.DOUBLE,E.STRING,E.BOOLEAN,E.ARRAY,E.OBJECT)).setName(e)}static ofNumber(e){return(new N).setType(S.of(E.INTEGER,E.LONG,E.FLOAT,E.DOUBLE)).setName(e)}static ofBoolean(e){return(new N).setType(S.of(E.BOOLEAN)).setName(e)}static of(e,...t){return(new N).setType(S.of(...t)).setName(e)}static ofObject(e){return(new N).setType(S.of(E.OBJECT)).setName(e)}static ofRef(e){return(new N).setRef(e)}static ofArray(e,...t){return(new N).setType(S.of(E.ARRAY)).setName(e).setItems(m.of(...t))}static fromListOfSchemas(e){if(c(e)&&!Array.isArray(e))return[];let t=[];for(let r of Array.from(e)){let e=N.from(r);e&&t.push(e)}return t}static fromMapOfSchemas(e){if(c(e))return;const t=new Map;return Object.entries(e).forEach((([e,r])=>{let s=N.from(r);s&&t.set(e,s)})),t}static from(e,t=!1){if(c(e))return;let r=new N;return r.namespace=e.namespace,r.name=e.name,r.version=e.version,r.ref=e.ref,r.type=t?new O(E.STRING):S.from(r.type),r.anyOf=N.fromListOfSchemas(e.anyOf),r.allOf=N.fromListOfSchemas(e.allOf),r.oneOf=N.fromListOfSchemas(e.oneOf),r.not=N.from(e.not),r.description=e.description,r.examples=e.examples?[...e.examples]:void 0,r.defaultValue=e.defaultValue,r.comment=e.comment,r.enums=e.enums?[...e.enums]:void 0,r.constant=e.constant,r.pattern=e.pattern,r.format=e.format,r.minLength=e.minLength,r.maxLength=e.maxLength,r.multipleOf=e.multipleOf,r.minimum=e.minimum,r.maximum=e.maximum,r.exclusiveMinimum=e.exclusiveMinimum,r.exclusiveMaximum=e.exclusiveMaximum,r.properties=N.fromMapOfSchemas(e.properties),r.additionalProperties=g.from(e.additionalProperties),r.required=e.required,r.propertyNames=N.from(e.propertyNames,!0),r.minProperties=e.minProperties,r.maxProperties=e.maxProperties,r.patternProperties=N.fromMapOfSchemas(e.patternProperties),r.items=m.from(e.items),r.contains=N.from(e.contains),r.minItems=e.minItems,r.maxItems=e.maxItems,r.uniqueItems=e.uniqueItems,r.$defs=N.fromMapOfSchemas(e.$defs),r.permission=e.permission,r}namespace="_";version=1;getTitle(){return this.getFullName()}getFullName(){return this.namespace&&"_"!=this.namespace?this.namespace+"."+this.name:this.name}get$defs(){return this.$defs}set$defs(e){return this.$defs=e,this}getNamespace(){return this.namespace}setNamespace(e){return this.namespace=e,this}getName(){return this.name}setName(e){return this.name=e,this}getVersion(){return this.version}setVersion(e){return this.version=e,this}getRef(){return this.ref}setRef(e){return this.ref=e,this}getType(){return this.type}setType(e){return this.type=e,this}getAnyOf(){return this.anyOf}setAnyOf(e){return this.anyOf=e,this}getAllOf(){return this.allOf}setAllOf(e){return this.allOf=e,this}getOneOf(){return this.oneOf}setOneOf(e){return this.oneOf=e,this}getNot(){return this.not}setNot(e){return this.not=e,this}getDescription(){return this.description}setDescription(e){return this.description=e,this}getExamples(){return this.examples}setExamples(e){return this.examples=e,this}getDefaultValue(){return this.defaultValue}setDefaultValue(e){return this.defaultValue=e,this}getComment(){return this.comment}setComment(e){return this.comment=e,this}getEnums(){return this.enums}setEnums(e){return this.enums=e,this}getConstant(){return this.constant}setConstant(e){return this.constant=e,this}getPattern(){return this.pattern}setPattern(e){return this.pattern=e,this}getFormat(){return this.format}setFormat(e){return this.format=e,this}getMinLength(){return this.minLength}setMinLength(e){return this.minLength=e,this}getMaxLength(){return this.maxLength}setMaxLength(e){return this.maxLength=e,this}getMultipleOf(){return this.multipleOf}setMultipleOf(e){return this.multipleOf=e,this}getMinimum(){return this.minimum}setMinimum(e){return this.minimum=e,this}getMaximum(){return this.maximum}setMaximum(e){return this.maximum=e,this}getExclusiveMinimum(){return this.exclusiveMinimum}setExclusiveMinimum(e){return this.exclusiveMinimum=e,this}getExclusiveMaximum(){return this.exclusiveMaximum}setExclusiveMaximum(e){return this.exclusiveMaximum=e,this}getProperties(){return this.properties}setProperties(e){return this.properties=e,this}getAdditionalProperties(){return this.additionalProperties}setAdditionalProperties(e){return this.additionalProperties=e,this}getRequired(){return this.required}setRequired(e){return this.required=e,this}getPropertyNames(){return this.propertyNames}setPropertyNames(e){return this.propertyNames=e,this.propertyNames.type=new O(E.STRING),this}getMinProperties(){return this.minProperties}setMinProperties(e){return this.minProperties=e,this}getMaxProperties(){return this.maxProperties}setMaxProperties(e){return this.maxProperties=e,this}getPatternProperties(){return this.patternProperties}setPatternProperties(e){return this.patternProperties=e,this}getItems(){return this.items}setItems(e){return this.items=e,this}getContains(){return this.contains}setContains(e){return this.contains=e,this}getMinItems(){return this.minItems}setMinItems(e){return this.minItems=e,this}getMaxItems(){return this.maxItems}setMaxItems(e){return this.maxItems=e,this}getUniqueItems(){return this.uniqueItems}setUniqueItems(e){return this.uniqueItems=e,this}getPermission(){return this.permission}setPermission(e){return this.permission=e,this}}var I={};t(I,"SchemaValidator",(()=>F));var R={};t(R,"StringUtil",(()=>_));var w={};t(w,"KIRuntimeException",(()=>y));class y extends Error{constructor(e,t){super(e),this.cause=t}getCause(){return this.cause}}var x={};t(x,"StringFormatter",(()=>v));class v{static format(e,...t){if(!t||0==t.length)return e;let r="",s=0,n="",i=n,a=e.length;for(let o=0;o<a;o++)n=e.charAt(o),"$"==n&&"\\"==i?r=r.substring(0,o-1)+n:"$"==n&&s<t.length?r+=t[s++]:r+=n,i=n;return r.toString()}constructor(){}}class _{constructor(){}static nthIndex(e,t,r=0,s){if(!e)throw new y("String cannot be null");if(r<0||r>=e.length)throw new y(v.format("Cannot search from index : $",r));if(s<=0||s>e.length)throw new y(v.format("Cannot search for occurance : $",s));for(;r<e.length;){if(e.charAt(r)==t&&0==--s)return r;++r}return-1}static splitAtFirstOccurance(e,t){if(!e)return[void 0,void 0];let r=e.indexOf(t);return-1==r?[e,void 0]:[e.substring(0,r),e.substring(r+1)]}static isNullOrBlank(e){return!e||""==e.trim()}}class P extends Error{constructor(e,t,r){super(e.trim()?e+"-"+t:t),this.schemaPath=e,this.cause=r}getSchemaPath(){return this.schemaPath}getCause(){return this.cause}}class M extends Error{constructor(e,t,r=[],s){super(t+(r?r.map((e=>e.message)).reduce(((e,t)=>e+"\n"+t),""):"")),this.schemaPath=e,this.cause=s}getSchemaPath(){return this.schemaPath}getCause(){return this.cause}}class L{static UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH="Unable to retrive schema from referenced path";static CYCLIC_REFERENCE_LIMIT_COUNTER=20;static getDefaultValue(e,t){if(e)return e.getConstant()?e.getConstant():e.getDefaultValue()?e.getDefaultValue():L.getDefaultValue(L.getSchemaFromRef(e,t,e.getRef()),t)}static getSchemaFromRef(e,t,r,s=0){if(++s==L.CYCLIC_REFERENCE_LIMIT_COUNTER)throw new M(r??"","Schema has a cyclic reference");if(!e||!r||_.isNullOrBlank(r))return;if(!r.startsWith("#")){var n=L.resolveExternalSchema(e,t,r);n&&(e=n.getT1(),r=n.getT2())}let i=r.split("/");return e=L.resolveInternalSchema(e,t,r,s,i,1)}static resolveInternalSchema(e,t,r,s,n,i){let a=e;for(;i<n.length;){if("$defs"===n[i]){if(++i>=n.length||!a.get$defs())throw new P(r,L.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH);a=a.get$defs()?.get(n[i])}else{if(a&&(!a.getType()?.contains(E.OBJECT)||!a.getProperties()))throw new P(r,"Cannot retrievie schema from non Object type schemas");a=a.getProperties()?.get(n[i])}if(i++,!a)throw new P(r,L.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH);if(!_.isNullOrBlank(a.getRef())&&(a=L.getSchemaFromRef(a,t,a.getRef(),s),!a))throw new P(r,L.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH)}return a}static resolveExternalSchema(e,t,r){if(!t)return;let n=_.splitAtFirstOccurance(e?.getRef()??"","/");if(!n[0])return;let i=_.splitAtFirstOccurance(n[0],".");if(!i[0]||!i[1])return;let a=t.find(i[0],i[1]);if(a){if(!n[1]||""===n[1])return new s(a,r);if(r="#/"+n[1],!a)throw new P(r,L.UNABLE_TO_RETRIVE_SCHEMA_FROM_REFERENCED_PATH);return new s(a,r)}}constructor(){}}class U{static validate(e,t,r,s){let n=[];return t.getOneOf()&&!t.getOneOf()?U.oneOf(e,t,r,s,n):t.getAllOf()&&!t.getAllOf()?U.allOf(e,t,r,s,n):t.getAnyOf()&&!t.getAnyOf()&&U.anyOf(e,t,r,s,n),s}static anyOf(e,t,r,s,n){let i=!1;for(let a of t.getAnyOf()??[])try{U.validate(e,a,r,s),i=!0;break}catch(e){i=!1,n.push(e)}if(!i)throw new M(F.path(e),"The value don't satisfy any of the schemas.",n)}static allOf(e,t,r,s,n){let i=0;for(let a of t.getAllOf()??[])try{U.validate(e,a,r,s),i++}catch(e){n.push(e)}if(i!==t.getAllOf()?.length)throw new M(F.path(e),"The value doesn't satisfy some of the schemas.",n)}static oneOf(e,t,r,s,n){let i=0;for(let a of t.getOneOf()??[])try{U.validate(e,a,r,s),i++}catch(e){n.push(e)}if(1!=i)throw new M(F.path(e),0==i?"The value does not satisfy any schema":"The value satisfy more than one schema",n)}constructor(){}}class B{static validate(e,t,r,s){if(c(s))throw new M(F.path(e),"Expected an array but found null");if(!Array.isArray(s))throw new M(F.path(e),s.toString()+" is not an Array");let n=s;return B.checkMinMaxItems(e,t,n),B.checkItems(e,t,r,n),B.checkUniqueItems(e,t,n),B.checkContains(e,t,r,n),s}static checkContains(e,t,r,s){if(!t.getContains())return;let n=!1;for(let i=0;i<s.length;i++){let a=e?[...e]:[];try{F.validate(a,t.getContains(),r,s[i]),n=!0;break}catch(e){n=!1}}if(!n)throw new M(F.path(e),"None of the items are of type contains schema")}static checkUniqueItems(e,t,r){if(t.getUniqueItems()&&t.getUniqueItems()){if(new Set(r).size!==r.length)throw new M(F.path(e),"Items on the array are not unique")}}static checkMinMaxItems(e,t,r){if(t.getMinItems()&&t.getMinItems()>r.length)throw new M(F.path(e),"Array should have minimum of "+t.getMinItems()+" elements");if(t.getMaxItems()&&t.getMaxItems()<r.length)throw new M(F.path(e),"Array can have maximum of "+t.getMaxItems()+" elements")}static checkItems(e,t,r,s){if(!t.getItems())return;let n=t.getItems();if(n.getSingleSchema())for(let t=0;t<s.length;t++){let i=e?[...e]:[],a=F.validate(i,n.getSingleSchema(),r,s[t]);s[t]=a}if(n.getTupleSchema()){if(n.getTupleSchema().length!==s.length)throw new M(F.path(e),"Expected an array with only "+n.getTupleSchema().length+" but found "+s.length);for(let t=0;t<s.length;t++){let i=e?[...e]:[],a=F.validate(i,n.getTupleSchema()[t],r,s[t]);s[t]=a}}}constructor(){}}class C{static validate(e,t,r,s){if(c(s))throw new M(F.path(t),"Expected a number but found null");if("number"!=typeof s)throw new M(F.path(t),s.toString()+" is not a "+e);let n=C.extractNumber(e,t,r,s);return C.checkRange(t,r,s,n),C.checkMultipleOf(t,r,s,n),s}static extractNumber(e,t,r,s){let n=s;try{e!=E.LONG&&e!=E.INTEGER||(n=Math.round(n))}catch(r){throw new M(F.path(t),s+" is not a number of type "+e,r)}if(c(n)||(e==E.LONG||e==E.INTEGER)&&n!=s)throw new M(F.path(t),s.toString()+" is not a number of type "+e);return n}static checkMultipleOf(e,t,r,s){if(t.getMultipleOf()){if(s%t.getMultipleOf()!=0)throw new M(F.path(e),r.toString()+" is not multiple of "+t.getMultipleOf())}}static checkRange(e,t,r,s){if(t.getMinimum()&&C.numberCompare(s,t.getMinimum())<0)throw new M(F.path(e),r.toString()+" should be greater than or equal to "+t.getMinimum());if(t.getMaximum()&&C.numberCompare(s,t.getMaximum())>0)throw new M(F.path(e),r.toString()+" should be less than or equal to "+t.getMaximum());if(t.getExclusiveMinimum()&&C.numberCompare(s,t.getExclusiveMinimum())<=0)throw new M(F.path(e),r.toString()+" should be greater than "+t.getExclusiveMinimum());if(t.getExclusiveMaximum()&&C.numberCompare(s,t.getExclusiveMaximum())>0)throw new M(F.path(e),r.toString()+" should be less than "+t.getExclusiveMaximum())}static numberCompare(e,t){return e-t}constructor(){}}class b{static validate(e,t,r,s){if(c(s))throw new M(F.path(e),"Expected an object but found null");if("object"!=typeof s||Array.isArray(s))throw new M(F.path(e),s.toString()+" is not an Object");let n=s,i=new Set(Object.keys(n));b.checkMinMaxProperties(e,t,i),t.getPropertyNames()&&b.checkPropertyNameSchema(e,t,r,i),t.getRequired()&&b.checkRequired(e,t,n),t.getProperties()&&b.checkProperties(e,t,r,n,i),t.getPatternProperties()&&b.checkPatternProperties(e,t,r,n,i),t.getAdditionalProperties()&&b.checkAddtionalProperties(e,t,r,n,i)}static checkPropertyNameSchema(e,t,r,s){for(let n of Array.from(s.values()))try{F.validate(e,t.getPropertyNames(),r,n)}catch(t){throw new M(F.path(e),"Property name '"+n+"' does not fit the property schema")}}static checkRequired(e,t,r){for(const s of t.getRequired()??[])if(c(r[s]))throw new M(F.path(e),s+" is mandatory")}static checkAddtionalProperties(e,t,r,s,n){let i=t.getAdditionalProperties();if(i.getSchemaValue())for(let t of Array.from(n.values())){let n=e?[...e]:[],a=F.validate(n,i.getSchemaValue(),r,s.get(t));s[t]=a}else if(!1===i.getBooleanValue()&&n.size)throw new M(F.path(e),n.toString()+" are additional properties which are not allowed.")}static checkPatternProperties(e,t,r,s,n){const i=new Map;for(const e of Array.from(t.getPatternProperties().keys()))i.set(e,new RegExp(e));for(const a of Array.from(n.values())){const o=e?[...e]:[];for(const e of Array.from(i.entries()))if(e[1].test(a)){const i=F.validate(o,t.getPatternProperties().get(e[0]),r,s[a]);s[a]=i,n.delete(a);break}}}static checkProperties(e,t,r,s,n){for(const i of Array.from(t.getProperties())){let t=s[i[0]];if(c(t))continue;let a=e?[...e]:[],o=F.validate(a,i[1],r,t);s[i[0]]=o,n.delete(i[0])}}static checkMinMaxProperties(e,t,r){if(t.getMinProperties()&&r.size<t.getMinProperties())throw new M(F.path(e),"Object should have minimum of "+t.getMinProperties()+" properties");if(t.getMaxProperties()&&r.size>t.getMaxProperties())throw new M(F.path(e),"Object can have maximum of "+t.getMaxProperties()+" properties")}constructor(){}}let V;var D;(D=V||(V={})).DATETIME="DATETIME",D.TIME="TIME",D.DATE="DATE",D.EMAIL="EMAIL",D.REGEX="REGEX";class k{static TIME=/^([01]?[0-9]|2[0-3]):[0-5][0-9](:[0-5][0-9])?([+-][01][0-9]:[0-5][0-9])?$/;static DATE=/^[0-9]{4,4}-([0][0-9]|[1][0-2])-(0[1-9]|[1-2][1-9]|3[01])$/;static DATETIME=/^[0-9]{4,4}-([0][0-9]|[1][0-2])-(0[1-9]|[1-2][1-9]|3[01])T([01]?[0-9]|2[0-3]):[0-5][0-9](:[0-5][0-9])?([+-][01][0-9]:[0-5][0-9])?$/;static validate(e,t,r){if(c(r))throw new M(F.path(e),"Expected a string but found "+r);if("string"!=typeof r)throw new M(F.path(e),r.toString()+" is not String");t.getFormat()==V.TIME?k.patternMatcher(e,t,r,k.TIME,"time pattern"):t.getFormat()==V.DATE?k.patternMatcher(e,t,r,k.DATE,"date pattern"):t.getFormat()==V.DATETIME?k.patternMatcher(e,t,r,k.DATETIME,"date time pattern"):t.getPattern()&&k.patternMatcher(e,t,r,new RegExp(t.getPattern()),"pattern "+t.getPattern());let s=r.length;if(t.getMinLength()&&s<t.getMinLength())throw new M(F.path(e),"Expected a minimum of "+t.getMinLength()+" characters");if(t.getMaxLength()&&s>t.getMinLength())throw new M(F.path(e),"Expected a maximum of "+t.getMaxLength()+" characters");return r}static patternMatcher(e,t,r,s,n){if(!s.test(r))throw new M(F.path(e),r.toString()+" is not matched with the "+n)}constructor(){}}class G{static validate(e,t,r,s,n){if(t==E.STRING)k.validate(e,r,n);else if(t==E.LONG||t==E.INTEGER||t==E.DOUBLE||t==E.FLOAT)C.validate(t,e,r,n);else if(t==E.BOOLEAN)(class{static validate(e,t,r){if(c(r))throw new M(F.path(e),"Expected a boolean but found null");if("boolean"!=typeof r)throw new M(F.path(e),r.toString()+" is not a boolean");return r}constructor(){}}).validate(e,r,n);else if(t==E.OBJECT)b.validate(e,r,s,n);else if(t==E.ARRAY)B.validate(e,r,s,n);else{if(t!=E.NULL)throw new M(F.path(e),t+" is not a valid type.");(class{static validate(e,t,r){if(r)throw new M(F.path(e),"Expected a null but found "+r);return r}constructor(){}}).validate(e,r,n)}return n}constructor(){}}class F{static path(e){return e?e.map((e=>e.getTitle()??"")).filter((e=>!!e)).reduce(((e,t,r)=>e+(0===r?"":".")+t),""):""}static validate(e,t,r,s){if(!t)return s;if(e||(e=new Array),e.push(t),c(s)&&!c(t.getDefaultValue()))return JSON.parse(JSON.stringify(t.getDefaultValue()));if(t.getConstant())return F.constantValidation(e,t,s);if(t.getEnums()&&!t.getEnums()?.length)return F.enumCheck(e,t,s);if(t.getType()&&F.typeValidation(e,t,r,s),!_.isNullOrBlank(t.getRef()))return F.validate(e,L.getSchemaFromRef(e[0],r,t.getRef()),r,s);if((t.getOneOf()||t.getAllOf()||t.getAnyOf())&&U.validate(e,t,r,s),t.getNot()){let n=!1;try{F.validate(e,t.getNot(),r,s),n=!0}catch(e){n=!1}if(n)throw new M(F.path(e),"Schema validated value in not condition.")}return s}static constantValidation(e,t,r){if(!t.getConstant().equals(r))throw new M(F.path(e),"Expecting a constant value : "+r);return r}static enumCheck(e,t,r){let s=!1;for(let e of t.getEnums()??[])if(e===r){s=!0;break}if(s)return r;throw new M(F.path(e),"Value is not one of "+t.getEnums())}static typeValidation(e,t,r,s){let n=!1,i=[];for(const a of Array.from(t.getType()?.getAllowedSchemaTypes()?.values()??[]))try{G.validate(e,a,t,r,s),n=!0;break}catch(e){n=!1,i.push(e)}if(!n)throw new M(F.path(e),"Value "+JSON.stringify(s)+" is not of valid type(s)",i)}constructor(){}}var $={};t($,"KIRunConstants",(()=>Y));class Y{static NAMESPACE="namespace";static NAME="name";static ID="id";constructor(){}}var H={};t(H,"ExecutionException",(()=>W));class W extends Error{constructor(e,t){super(e),this.cause=t}getCause(){return this.cause}}var j={};t(j,"AbstractFunction",(()=>q));class q{validateArguments(e){return Array.from(this.getSignature().getParameters().entries()).map((t=>{let r,n=t[0],i=t[1],a=e.get(t[0]);if(c(a))return new s(n,F.validate(void 0,i.getSchema(),void 0,void 0));if(!i?.isVariableArgument())return new s(n,F.validate(void 0,i.getSchema(),void 0,a));Array.isArray(a)?r=a:(r=[],r.push(a));for(const e of r)F.validate(void 0,i.getSchema(),void 0,e);return new s(n,a)})).reduce(((e,t)=>(e.set(t.getT1(),t.getT2()),e)),new Map)}execute(e){return e.setArguments(this.validateArguments(e.getArguments()??new Map)),this.internalExecute(e)}getProbableEventSignature(e){return this.getSignature().getEvents()}}var X={};t(X,"KIRuntime",(()=>Vt));class Q{constructor(e){this.expression=e}getExpression(){return this.expression}}class J{static OUTPUT="output";static ERROR="error";static ITERATION="iteration";static TRUE="true";static FALSE="false";static SCHEMA_NAME="Event";static SCHEMA=(new N).setNamespace(l.SYSTEM).setName(J.SCHEMA_NAME).setType(S.of(E.OBJECT)).setProperties(new Map([["name",N.ofString("name")],["parameters",N.ofObject("parameter").setAdditionalProperties((new g).setSchemaValue(N.SCHEMA))]]));constructor(e,t){this.name=e,this.parameters=t}getName(){return this.name}setName(e){return this.name=e,this}getParameters(){return this.parameters}setParameters(e){return this.parameters=e,this}static outputEventMapEntry(e){return J.eventMapEntry(J.OUTPUT,e)}static eventMapEntry(e,t){return[e,new J(e,t)]}}class K{constructor(e,t){this.name=e,this.result=t}getName(){return this.name}setName(e){return this.name=e,this}getResult(){return this.result}setResult(e){return this.result=e,this}static outputOf(e){return K.of(J.OUTPUT,e)}static of(e,t){return new K(e,t)}}class z{index=0;constructor(e){if(c(e))throw new y("Function output is generating null");Array.isArray(e)&&e.length&&e[0]instanceof K?this.fo=e:(this.fo=[],this.generator=e)}next(){if(!this.generator)return this.index<this.fo.length?this.fo[this.index++]:void 0;const e=this.generator.next();return e&&this.fo.push(e),e}allResults(){return this.fo}}let Z;var ee;(ee=Z||(Z={})).CONSTANT="CONSTANT",ee.EXPRESSION="EXPRESSION";class te{static SCHEMA_NAME="Parameter";static SCHEMA=(new N).setNamespace(l.SYSTEM).setName(te.SCHEMA_NAME).setProperties(new Map([["schema",N.SCHEMA],["parameterName",N.ofString("parameterName")],["variableArgument",N.of("variableArgument",E.BOOLEAN).setDefaultValue(!1)]]));static EXPRESSION=(new N).setNamespace(l.SYSTEM).setName("ParameterExpression").setType(S.of(E.OBJECT)).setProperties(new Map([["isExpression",N.ofBoolean("isExpression").setDefaultValue(!0)],["value",N.ofAny("value")]]));variableArgument=!1;type=Z.EXPRESSION;constructor(e,t){this.schema=t,this.parameterName=e}getSchema(){return this.schema}setSchema(e){return this.schema=e,this}getParameterName(){return this.parameterName}setParameterName(e){return this.parameterName=e,this}isVariableArgument(){return this.variableArgument}setVariableArgument(e){return this.variableArgument=e,this}getType(){return this.type}setType(e){return this.type=e,this}static ofEntry(e,t,r=!1,s=Z.EXPRESSION){return[e,new te(e,t).setType(s).setVariableArgument(r)]}static of(e,t,r=!1,s=Z.EXPRESSION){return new te(e,t).setType(s).setVariableArgument(r)}}let re;var se;(se=re||(re={})).VALUE="VALUE",se.EXPRESSION="EXPRESSION";var ne={};t(ne,"LinkedList",(()=>ie));class ie{head=void 0;tail=void 0;length=0;constructor(e){if(e?.length){for(const t of e)if(this.head){const e=new ae(t,this.tail);this.tail.next=e,this.tail=e}else this.tail=this.head=new ae(t);this.length=e.length}}push(e){const t=new ae(e,void 0,this.head);this.head?(this.head.previous=t,this.head=t):this.tail=this.head=t,this.length++}pop(){if(!this.head)throw Error("List is empty and cannot pop further.");const e=this.head.value;if(this.length--,this.head==this.tail)return this.head=this.tail=void 0,e;const t=this.head;return this.head=t.next,t.next=void 0,t.previous=void 0,this.head.previous=void 0,e}isEmpty(){return!this.length}size(){return this.length}get(e){if(e<0||e>=this.length)throw new Error(`${e} is out of bounds [0,${this.length}]`);let t=this.head;for(;e>0;)t=this.head.next,--e;return t.value}set(e,t){if(e<0||e>=this.length)throw new y(v.format("Index $ out of bound to set the value in linked list.",e));let r=this.head;for(;e>0;)r=this.head.next,--e;return r.value=t,this}toString(){let e=this.head,t="";for(;e;)t+=e.value,e=e.next,e&&(t+=", ");return`[${t}]`}toArray(){let e=[],t=this.head;for(;t;)e.push(t.value),t=t.next;return e}peek(){if(!this.head)throw new Error("List is empty so cannot peak");return this.head.value}peekLast(){if(!this.tail)throw new Error("List is empty so cannot peak");return this.tail.value}getFirst(){if(!this.head)throw new Error("List is empty so cannot get first");return this.head.value}removeFirst(){return this.pop()}removeLast(){if(!this.tail)throw new Error("List is empty so cannot remove");--this.length;const e=this.tail.value;if(0==this.length)this.head=this.tail=void 0;else{const e=this.tail.previous;e.next=void 0,this.tail.previous=void 0,this.tail=e}return e}addAll(e){return e&&e.length?(e.forEach(this.add.bind(this)),this):this}add(e){return++this.length,this.tail||this.head?this.head===this.tail?(this.tail=new ae(e,this.head),this.head.next=this.tail):(this.tail=new ae(e,this.tail),this.tail.previous.next=this.tail):this.head=this.tail=new ae(e),this}map(e,t){let r=new ie,s=this.head,n=0;for(;s;)r.add(e(s.value,n)),s=s.next,++n;return r}forEach(e,t){let r=this.head,s=0;for(;r;)e(r.value,s),r=r.next,++s}}class ae{constructor(e,t,r){this.value=e,this.next=r,this.previous=t}toString(){return""+this.value}}var oe={};t(oe,"ExpressionEvaluator",(()=>yt));class he{constructor(e){this.str=e??""}append(e){return this.str+=e,this}toString(){return""+this.str}trim(){return this.str=this.str.trim(),this}setLength(e){return this.str=this.str.substring(0,e),this}length(){return this.str.length}charAt(e){return this.str.charAt(e)}deleteCharAt(e){return this.checkIndex(e),this.str=this.str.substring(0,e)+this.str.substring(e+1),this}insert(e,t){return this.str=this.str.substring(0,e)+t+this.str.substring(e),this}checkIndex(e){if(e>=this.str.length)throw new y(`Index ${e} is greater than or equal to ${this.str.length}`)}substring(e,t){return this.str.substring(e,t)}}var ue={};t(ue,"ExpressionEvaluationException",(()=>le));class le extends Error{constructor(e,t,r){super(v.format("$ : $",e,t)),this.cause=r}getCause(){return this.cause}}var pe={};t(pe,"Expression",(()=>Ee));var ce={};t(ce,"ExpressionToken",(()=>me));class me{constructor(e){this.expression=e}getExpression(){return this.expression}toString(){return this.expression}}var ge={};t(ge,"Operation",(()=>fe));class fe{static MULTIPLICATION=new fe("*");static DIVISION=new fe("/");static INTEGER_DIVISION=new fe("//");static MOD=new fe("%");static ADDITION=new fe("+");static SUBTRACTION=new fe("-");static NOT=new fe("not",void 0,!0);static AND=new fe("and",void 0,!0);static OR=new fe("or",void 0,!0);static LESS_THAN=new fe("<");static LESS_THAN_EQUAL=new fe("<=");static GREATER_THAN=new fe(">");static GREATER_THAN_EQUAL=new fe(">=");static EQUAL=new fe("=");static NOT_EQUAL=new fe("!=");static BITWISE_AND=new fe("&");static BITWISE_OR=new fe("|");static BITWISE_XOR=new fe("^");static BITWISE_COMPLEMENT=new fe("~");static BITWISE_LEFT_SHIFT=new fe("<<");static BITWISE_RIGHT_SHIFT=new fe(">>");static BITWISE_UNSIGNED_RIGHT_SHIFT=new fe(">>>");static UNARY_PLUS=new fe("UN: +","+");static UNARY_MINUS=new fe("UN: -","-");static UNARY_LOGICAL_NOT=new fe("UN: not","not");static UNARY_BITWISE_COMPLEMENT=new fe("UN: ~","~");static ARRAY_OPERATOR=new fe("[");static OBJECT_OPERATOR=new fe(".");static VALUE_OF=new Map([["MULTIPLICATION",fe.MULTIPLICATION],["DIVISION",fe.DIVISION],["INTEGER_DIVISON",fe.INTEGER_DIVISION],["MOD",fe.MOD],["ADDITION",fe.ADDITION],["SUBTRACTION",fe.SUBTRACTION],["NOT",fe.NOT],["AND",fe.AND],["OR",fe.OR],["LESS_THAN",fe.LESS_THAN],["LESS_THAN_EQUAL",fe.LESS_THAN_EQUAL],["GREATER_THAN",fe.GREATER_THAN],["GREATER_THAN_EQUAL",fe.GREATER_THAN_EQUAL],["EQUAL",fe.EQUAL],["NOT_EQUAL",fe.NOT_EQUAL],["BITWISE_AND",fe.BITWISE_AND],["BITWISE_OR",fe.BITWISE_OR],["BITWISE_XOR",fe.BITWISE_XOR],["BITWISE_COMPLEMENT",fe.BITWISE_COMPLEMENT],["BITWISE_LEFT_SHIFT",fe.BITWISE_LEFT_SHIFT],["BITWISE_RIGHT_SHIFT",fe.BITWISE_RIGHT_SHIFT],["BITWISE_UNSIGNED_RIGHT_SHIFT",fe.BITWISE_UNSIGNED_RIGHT_SHIFT],["UNARY_PLUS",fe.UNARY_PLUS],["UNARY_MINUS",fe.UNARY_MINUS],["UNARY_LOGICAL_NOT",fe.UNARY_LOGICAL_NOT],["UNARY_BITWISE_COMPLEMENT",fe.UNARY_BITWISE_COMPLEMENT],["ARRAY_OPERATOR",fe.ARRAY_OPERATOR],["OBJECT_OPERATOR",fe.OBJECT_OPERATOR]]);static UNARY_OPERATORS=new Set([fe.ADDITION,fe.SUBTRACTION,fe.NOT,fe.BITWISE_COMPLEMENT,fe.UNARY_PLUS,fe.UNARY_MINUS,fe.UNARY_LOGICAL_NOT,fe.UNARY_BITWISE_COMPLEMENT]);static ARITHMETIC_OPERATORS=new Set([fe.MULTIPLICATION,fe.DIVISION,fe.INTEGER_DIVISION,fe.MOD,fe.ADDITION,fe.SUBTRACTION]);static LOGICAL_OPERATORS=new Set([fe.NOT,fe.AND,fe.OR,fe.LESS_THAN,fe.LESS_THAN_EQUAL,fe.GREATER_THAN,fe.GREATER_THAN_EQUAL,fe.EQUAL,fe.NOT_EQUAL]);static BITWISE_OPERATORS=new Set([fe.BITWISE_AND,fe.BITWISE_COMPLEMENT,fe.BITWISE_LEFT_SHIFT,fe.BITWISE_OR,fe.BITWISE_RIGHT_SHIFT,fe.BITWISE_UNSIGNED_RIGHT_SHIFT,fe.BITWISE_XOR]);static OPERATOR_PRIORITY=new Map([[fe.UNARY_PLUS,1],[fe.UNARY_MINUS,1],[fe.UNARY_LOGICAL_NOT,1],[fe.UNARY_BITWISE_COMPLEMENT,1],[fe.ARRAY_OPERATOR,1],[fe.OBJECT_OPERATOR,1],[fe.MULTIPLICATION,2],[fe.DIVISION,2],[fe.INTEGER_DIVISION,2],[fe.MOD,2],[fe.ADDITION,3],[fe.SUBTRACTION,3],[fe.BITWISE_LEFT_SHIFT,4],[fe.BITWISE_RIGHT_SHIFT,4],[fe.BITWISE_UNSIGNED_RIGHT_SHIFT,4],[fe.LESS_THAN,5],[fe.LESS_THAN_EQUAL,5],[fe.GREATER_THAN,5],[fe.GREATER_THAN_EQUAL,5],[fe.EQUAL,6],[fe.NOT_EQUAL,6],[fe.BITWISE_AND,7],[fe.BITWISE_XOR,8],[fe.BITWISE_OR,9],[fe.AND,10],[fe.OR,11]]);static OPERATORS=new Set([...Array.from(fe.ARITHMETIC_OPERATORS),...Array.from(fe.LOGICAL_OPERATORS),...Array.from(fe.BITWISE_OPERATORS),fe.ARRAY_OPERATOR,fe.OBJECT_OPERATOR].map((e=>e.getOperator())));static OPERATORS_WITHOUT_SPACE_WRAP=new Set([...Array.from(fe.ARITHMETIC_OPERATORS),...Array.from(fe.LOGICAL_OPERATORS),...Array.from(fe.BITWISE_OPERATORS),fe.ARRAY_OPERATOR,fe.OBJECT_OPERATOR].filter((e=>!e.shouldBeWrappedInSpace())).map((e=>e.getOperator())));static OPERATION_VALUE_OF=new Map(Array.from(fe.VALUE_OF.entries()).map((([e,t])=>[t.getOperator(),t])));static UNARY_MAP=new Map([[fe.ADDITION,fe.UNARY_PLUS],[fe.SUBTRACTION,fe.UNARY_MINUS],[fe.NOT,fe.UNARY_LOGICAL_NOT],[fe.BITWISE_COMPLEMENT,fe.UNARY_BITWISE_COMPLEMENT],[fe.UNARY_PLUS,fe.UNARY_PLUS],[fe.UNARY_MINUS,fe.UNARY_MINUS],[fe.UNARY_LOGICAL_NOT,fe.UNARY_LOGICAL_NOT],[fe.UNARY_BITWISE_COMPLEMENT,fe.UNARY_BITWISE_COMPLEMENT]]);static BIGGEST_OPERATOR_SIZE=Array.from(fe.VALUE_OF.values()).map((e=>e.getOperator())).filter((e=>!e.startsWith("UN: "))).map((e=>e.length)).reduce(((e,t)=>e>t?e:t),0);constructor(e,t,r=!1){this.operator=e,this.operatorName=t??e,this._shouldBeWrappedInSpace=r}getOperator(){return this.operator}getOperatorName(){return this.operatorName}shouldBeWrappedInSpace(){return this._shouldBeWrappedInSpace}valueOf(e){return fe.VALUE_OF.get(e)}toString(){return this.operator}}class Ee extends me{tokens=new ie;ops=new ie;constructor(e,t,r,s){super(e||""),t&&this.tokens.push(t),r&&this.tokens.push(r),s&&this.ops.push(s),this.evaluate()}getTokens(){return this.tokens}getOperations(){return this.ops}evaluate(){const e=this.expression.length;let t,r="",s=new he(""),n=0,i=!1;for(;n<e;){switch(r=this.expression[n],t=s.toString(),r){case" ":i=this.processTokenSepearator(s,t,i);break;case"(":n=this.processSubExpression(e,s,t,n,i),i=!1;break;case")":throw new le(this.expression,"Extra closing parenthesis found");case"]":throw new le(this.expression,"Extra closing square bracket found");default:let a=this.processOthers(r,e,s,t,n,i);n=a.getT1(),i=a.getT2(),i&&this.ops.peek()==fe.ARRAY_OPERATOR&&(a=this.process(e,s,n),n=a.getT1(),i=a.getT2())}++n}if(t=s.toString(),!_.isNullOrBlank(t)){if(fe.OPERATORS.has(t))throw new le(this.expression,"Expression is ending with an operator");this.tokens.push(new me(t))}}process(e,t,r){let n=1;for(++r;r<e&&0!=n;){let e=this.expression.charAt(r);"]"==e?--n:"["==e&&++n,0!=n&&(t.append(e),r++)}return this.tokens.push(new Ee(t.toString())),t.setLength(0),new s(r,!1)}processOthers(e,t,r,n,i,a){let o=t-i;o=o<fe.BIGGEST_OPERATOR_SIZE?o:fe.BIGGEST_OPERATOR_SIZE;for(let e=o;e>0;e--){let t=this.expression.substring(i,i+e);if(fe.OPERATORS_WITHOUT_SPACE_WRAP.has(t))return _.isNullOrBlank(n)||(this.tokens.push(new me(n)),a=!1),this.checkUnaryOperator(this.tokens,this.ops,fe.OPERATION_VALUE_OF.get(t),a),a=!0,r.setLength(0),new s(i+e-1,a)}return r.append(e),new s(i,!1)}processSubExpression(e,t,r,s,n){if(fe.OPERATORS.has(r))this.checkUnaryOperator(this.tokens,this.ops,fe.OPERATION_VALUE_OF.get(r),n),t.setLength(0);else if(!_.isNullOrBlank(r))throw new le(this.expression,v.format("Unkown token : $ found.",r));let i=1;const a=new he;let o=this.expression.charAt(s);for(s++;s<e&&i>0;)o=this.expression.charAt(s),"("==o?i++:")"==o&&i--,0!=i&&(a.append(o),s++);if(")"!=o)throw new le(this.expression,"Missing a closed parenthesis");for(;a.length()>2&&"("==a.charAt(0)&&")"==a.charAt(a.length()-1);)a.deleteCharAt(0),a.setLength(a.length()-1);return this.tokens.push(new Ee(a.toString().trim())),s}processTokenSepearator(e,t,r){return _.isNullOrBlank(t)||(fe.OPERATORS.has(t)?(this.checkUnaryOperator(this.tokens,this.ops,fe.OPERATION_VALUE_OF.get(t),r),r=!0):(this.tokens.push(new me(t)),r=!1)),e.setLength(0),r}checkUnaryOperator(e,t,r,s){if(r)if(s||e.isEmpty()){if(!fe.UNARY_OPERATORS.has(r))throw new le(this.expression,v.format("Extra operator $ found.",r));{const e=fe.UNARY_MAP.get(r);e&&t.push(e)}}else{for(;!t.isEmpty()&&this.hasPrecedence(r,t.peek());){let r=t.pop();if(fe.UNARY_OPERATORS.has(r)){let t=e.pop();e.push(new Ee("",t,void 0,r))}else{let t=e.pop(),s=e.pop();e.push(new Ee("",s,t,r))}}t.push(r)}}hasPrecedence(e,t){let r=fe.OPERATOR_PRIORITY.get(e),s=fe.OPERATOR_PRIORITY.get(t);if(!r||!s)throw new Error("Unknown operators provided");return s<r}toString(){if(this.ops.isEmpty())return 1==this.tokens.size()?this.tokens.get(0).toString():"Error: No tokens";let e=new he,t=0;const r=this.ops.toArray(),s=this.tokens.toArray();for(let n=0;n<r.length;n++)if(r[n].getOperator().startsWith("UN: "))e.append("(").append(r[n].getOperator().substring(4)).append(s[t]instanceof Ee?s[t].toString():s[t]).append(")"),t++;else{if(0==t){const r=s[t++];e.insert(0,r.toString())}const i=s[t++];e.insert(0,r[n].getOperator()).insert(0,i.toString()).insert(0,"(").append(")")}return e.toString()}equals(e){return this.expression==e.expression}}var Te={};t(Te,"ExpressionTokenValue",(()=>Ae));class Ae extends me{constructor(e,t){super(e),this.element=t}getTokenValue(){return this.element}getElement(){return this.element}toString(){return v.format("$: $",this.expression,this.element)}}var de={};t(de,"ArithmeticAdditionOperator",(()=>Ne));var Oe={};t(Oe,"BinaryOperator",(()=>Se));class Se{nullCheck(e,t,r){if(c(e)||c(t))throw new W(v.format("$ cannot be applied to a null value",r.getOperatorName()))}}class Ne extends Se{apply(e,t){return this.nullCheck(e,t,fe.ADDITION),e+t}}var Ie={};t(Ie,"ArithmeticDivisionOperator",(()=>Re));class Re extends Se{apply(e,t){return this.nullCheck(e,t,fe.DIVISION),e/t}}var we={};t(we,"ArithmeticIntegerDivisionOperator",(()=>ye));class ye extends Se{apply(e,t){return this.nullCheck(e,t,fe.DIVISION),Math.floor(e/t)}}var xe={};t(xe,"ArithmeticModulusOperator",(()=>ve));class ve extends Se{apply(e,t){return this.nullCheck(e,t,fe.MOD),e%t}}var _e={};t(_e,"ArithmeticMultiplicationOperator",(()=>Pe));class Pe extends Se{apply(e,t){return this.nullCheck(e,t,fe.MULTIPLICATION),e*t}}var Me={};t(Me,"ArithmeticSubtractionOperator",(()=>Le));class Le extends Se{apply(e,t){return this.nullCheck(e,t,fe.SUBTRACTION),e-t}}var Ue={};t(Ue,"ArrayOperator",(()=>Be));class Be extends Se{apply(e,t){if(!e)throw new W("Cannot apply array operator on a null value");if(!t)throw new W("Cannot retrive null index value");if(!Array.isArray(e)&&"string"!=typeof e)throw new W(v.format("Cannot retrieve value from a primitive value $",e));if(t>=e.length)throw new W(v.format("Cannot retrieve index $ from the array of length $",t,e.length));return e[t]}}var Ce={};t(Ce,"BitwiseAndOperator",(()=>be));class be extends Se{apply(e,t){return this.nullCheck(e,t,fe.BITWISE_AND),e&t}}var Ve={};t(Ve,"BitwiseLeftShiftOperator",(()=>De));class De extends Se{apply(e,t){return this.nullCheck(e,t,fe.BITWISE_LEFT_SHIFT),e<<t}}var ke={};t(ke,"BitwiseOrOperator",(()=>Ge));class Ge extends Se{apply(e,t){return this.nullCheck(e,t,fe.BITWISE_OR),e|t}}var Fe={};t(Fe,"BitwiseRightShiftOperator",(()=>$e));class $e extends Se{apply(e,t){return this.nullCheck(e,t,fe.BITWISE_RIGHT_SHIFT),e>>t}}var Ye={};t(Ye,"BitwiseUnsignedRightShiftOperator",(()=>He));class He extends Se{apply(e,t){return this.nullCheck(e,t,fe.BITWISE_UNSIGNED_RIGHT_SHIFT),e>>>t}}var We={};t(We,"BitwiseXorOperator",(()=>je));class je extends Se{apply(e,t){return this.nullCheck(e,t,fe.BITWISE_XOR),e^t}}var qe={};t(qe,"LogicalAndOperator",(()=>Qe));class Xe{static findPrimitiveNullAsBoolean(e){if(!e)return new s(E.BOOLEAN,!1);let t=typeof e;if("object"===t)throw new W(v.format("$ is not a primitive type",e));let r=e;return"boolean"===t?new s(E.BOOLEAN,r):"string"===t?new s(E.STRING,r):Xe.findPrimitiveNumberType(r)}static findPrimitive(e){if(c(e))return new s(E.NULL,void 0);let t=typeof e;if("object"===t)throw new W(v.format("$ is not a primitive type",e));let r=e;return"boolean"===t?new s(E.BOOLEAN,r):"string"===t?new s(E.STRING,r):Xe.findPrimitiveNumberType(r)}static findPrimitiveNumberType(e){if(c(e)||Array.isArray(e)||"object"==typeof e)throw new W(v.format("Unable to convert $ to a number.",e));let t=e;try{let e=t;return Number.isInteger(e)?new s(E.LONG,e):new s(E.DOUBLE,e)}catch(e){throw new W(v.format("Unable to convert $ to a number.",t),e)}}static compare(e,t){if(e==t)return 0;if(c(e)||c(t))return c(e)?-1:1;if(Array.isArray(e)||Array.isArray(t)){if(Array.isArray(e)&&Array.isArray(t)){if(e.length!=t.length)return e.length-t.length;for(let r=0;r<e.length;r++){let s=this.compare(e[r],t[r]);if(0!=s)return s}return 0}return Array.isArray(e)?-1:1}const r=typeof e,s=typeof t;return"object"===r||"object"===s?("object"===r&&"object"===s&&Object.keys(e).forEach((r=>{let s=this.compare(e[r],t[r]);if(0!=s)return s})),"object"===r?-1:1):this.comparePrimitive(e,t)}static comparePrimitive(e,t){return c(e)||c(t)?c(e)&&c(t)?0:c(e)?-1:1:e==t?0:"boolean"==typeof e||"boolean"==typeof t?e?-1:1:"string"==typeof e||"string"==typeof t?e+""<t+""?-1:1:"number"==typeof e||"number"==typeof t?e-t:0}static baseNumberType(e){return Number.isInteger(e)?E.LONG:E.DOUBLE}static toPrimitiveType(e){return e}constructor(){}}class Qe extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);if(r.getT1()!=E.BOOLEAN)throw new W(v.format("Boolean value expected but found $",r.getT2()));if(s.getT1()!=E.BOOLEAN)throw new W(v.format("Boolean value expected but found $",s.getT2()));return r.getT2()&&s.getT2()}}var Je={};t(Je,"LogicalEqualOperator",(()=>Ke));class Ke extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);return r.getT2()==s.getT2()}}var ze={};t(ze,"LogicalGreaterThanEqualOperator",(()=>Ze));class Ze extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);if(r.getT1()==E.BOOLEAN||s.getT1()==E.BOOLEAN)throw new W(v.format("Cannot compare >= with the values $ and $",r.getT2(),s.getT2()));return r.getT2()>=s.getT2()}}var et={};t(et,"LogicalGreaterThanOperator",(()=>tt));class tt extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);if(r.getT1()==E.BOOLEAN||s.getT1()==E.BOOLEAN)throw new W(v.format("Cannot compare > with the values $ and $",r.getT2(),s.getT2()));return r.getT2()>s.getT2()}}var rt={};t(rt,"LogicalLessThanEqualOperator",(()=>st));class st extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);if(r.getT1()==E.BOOLEAN||s.getT1()==E.BOOLEAN)throw new W(v.format("Cannot compare <= with the values $ and $",r.getT2(),s.getT2()));return r.getT2()<=s.getT2()}}var nt={};t(nt,"LogicalLessThanOperator",(()=>it));class it extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);if(r.getT1()==E.BOOLEAN||s.getT1()==E.BOOLEAN)throw new W(v.format("Cannot compare < with the values $ and $",r.getT2(),s.getT2()));return r.getT2()<s.getT2()}}var at={};t(at,"LogicalNotEqualOperator",(()=>ot));class ot extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);return r.getT2()!=s.getT2()}}var ht={};t(ht,"LogicalOrOperator",(()=>ut));class ut extends Se{apply(e,t){const r=Xe.findPrimitiveNullAsBoolean(e),s=Xe.findPrimitiveNullAsBoolean(t);if(r.getT1()!=E.BOOLEAN)throw new W(v.format("Boolean value expected but found $",r.getT2()));if(s.getT1()!=E.BOOLEAN)throw new W(v.format("Boolean value expected but found $",s.getT2()));return r.getT2()||s.getT2()}}var lt={};t(lt,"ObjectOperator",(()=>pt));class pt extends Se{apply(e,t){if(!e)throw new W("Cannot apply array operator on a null value");if(!t)throw new W("Cannot retrive null property value");const r=typeof e;if(!Array.isArray(e)&&"string"!=r&&"object"!=r)throw new W(v.format("Cannot retrieve value from a primitive value $",e));return e[t]}}var ct={};t(ct,"ArithmeticUnaryMinusOperator",(()=>ft));var mt={};t(mt,"UnaryOperator",(()=>gt));class gt{nullCheck(e,t){if(c(e))throw new W(v.format("$ cannot be applied to a null value",t.getOperatorName()))}}class ft extends gt{apply(e){return this.nullCheck(e,fe.UNARY_MINUS),Xe.findPrimitiveNumberType(e),-e}}var Et={};t(Et,"ArithmeticUnaryPlusOperator",(()=>Tt));class Tt extends gt{apply(e){return this.nullCheck(e,fe.UNARY_PLUS),Xe.findPrimitiveNumberType(e),e}}var At={};t(At,"BitwiseComplementOperator",(()=>dt));class dt extends gt{apply(e){this.nullCheck(e,fe.UNARY_BITWISE_COMPLEMENT);let t=Xe.findPrimitiveNumberType(e);if(t.getT1()!=E.INTEGER&&t.getT1()!=E.LONG)throw new W(v.format("Unable to apply bitwise operator on $",e));return~e}}var Ot={};t(Ot,"LogicalNotOperator",(()=>St));class St extends gt{apply(e){if(this.nullCheck(e,fe.UNARY_LOGICAL_NOT),Xe.findPrimitiveNumberType(e).getT1()!=E.BOOLEAN)throw new W(v.format("Unable to apply bitwise operator on $",e));return!e}}var Nt={};t(Nt,"TokenValueExtractor",(()=>It));class It{static REGEX_SQUARE_BRACKETS=/[\[\]]/;static REGEX_DOT=/\./;getValue(e){let t=this.getPrefix();if(!e.startsWith(t))throw new y(v.format("Token $ doesn't start with $",e,t));return this.getValueInternal(e)}retrieveElementFrom(e,t,r,s){if(c(s))return;if(t.length==r)return s;let n=t[r].split(It.REGEX_SQUARE_BRACKETS).map((e=>e.trim())).filter((e=>!_.isNullOrBlank(e))).reduce(((s,n,i)=>this.resolveForEachPartOfTokenWithBrackets(e,t,r,n,s,i)),s);return this.retrieveElementFrom(e,t,r+1,n)}resolveForEachPartOfTokenWithBrackets(e,t,r,s,n,i){if(!c(n)){if(0===i){if(Array.isArray(n)){if("length"===s)return n.length;try{let e=parseInt(s);if(isNaN(e))throw new Error(v.format("$ is not a number",e));if(e>=n.length)return;return n[e]}catch(t){throw new le(e,v.format("$ couldn't be parsed into integer in $",s,e),t)}}return this.checkIfObject(e,t,r,n),n[s]}if(s?.startsWith('"')){if(!s.endsWith('"')||1==s.length||2==s.length)throw new le(e,v.format("$ is missing a double quote or empty key found",e));return this.checkIfObject(e,t,r,n),n[s.substring(1,s.length-1)]}try{let t=parseInt(s);if(isNaN(t))throw new Error(v.format("$ is not a number",t));if(!Array.isArray(n))throw new le(e,v.format("Expecting an array with index $ while processing the expression",t,e));if(t>=n.length)return;return n[t]}catch(t){throw new le(e,v.format("$ couldn't be parsed into integer in $",s,e),t)}}}checkIfObject(e,t,r,s){if("object"!=typeof s||Array.isArray(s))throw new le(e,v.format("Unable to retrive $ from $ in the path $",t[r],s.toString(),e))}}const Rt=new Map([["true",!0],["false",!1],["null",void 0]]);class wt extends It{static INSTANCE=new wt;getValueInternal(e){if(!_.isNullOrBlank(e))return e=e.trim(),Rt.has(e)?Rt.get(e):e.startsWith('"')?this.processString(e):this.processNumbers(e)}processNumbers(e){try{let t;if(t=-1==e.indexOf(".")?parseInt(e):parseFloat(e),isNaN(t))throw new Error("Parse number error");return t}catch(t){throw new le(e,v.format("Unable to parse the literal or expression $",e),t)}}processString(e){if(!e.endsWith('"'))throw new le(e,v.format("String literal $ is not closed properly",e));return e.substring(1,e.length-1)}getPrefix(){return""}}class yt{static UNARY_OPERATORS_MAP=new Map([[fe.UNARY_BITWISE_COMPLEMENT,new dt],[fe.UNARY_LOGICAL_NOT,new St],[fe.UNARY_MINUS,new ft],[fe.UNARY_PLUS,new Tt]]);static BINARY_OPERATORS_MAP=new Map([[fe.ADDITION,new Ne],[fe.DIVISION,new Re],[fe.INTEGER_DIVISION,new ye],[fe.MOD,new ve],[fe.MULTIPLICATION,new Pe],[fe.SUBTRACTION,new Le],[fe.BITWISE_AND,new be],[fe.BITWISE_LEFT_SHIFT,new De],[fe.BITWISE_OR,new Ge],[fe.BITWISE_RIGHT_SHIFT,new $e],[fe.BITWISE_UNSIGNED_RIGHT_SHIFT,new He],[fe.BITWISE_XOR,new je],[fe.AND,new Qe],[fe.EQUAL,new Ke],[fe.GREATER_THAN,new tt],[fe.GREATER_THAN_EQUAL,new Ze],[fe.LESS_THAN,new it],[fe.LESS_THAN_EQUAL,new st],[fe.OR,new ut],[fe.NOT_EQUAL,new ot],[fe.ARRAY_OPERATOR,new Be],[fe.OBJECT_OPERATOR,new pt]]);static UNARY_OPERATORS_MAP_KEY_SET=new Set(yt.UNARY_OPERATORS_MAP.keys());constructor(e){e instanceof Ee?(this.exp=e,this.expression=this.exp.getExpression()):this.expression=e}evaluate(e){return this.exp||(this.exp=new Ee(this.expression)),this.evaluateExpression(this.exp,e)}getExpression(){return this.exp||(this.exp=new Ee(this.expression)),this.exp}getExpressionString(){return this.expression}evaluateExpression(e,t){let r=e.getOperations(),s=e.getTokens();for(;!r.isEmpty();){let e=r.pop(),a=s.pop();if(yt.UNARY_OPERATORS_MAP_KEY_SET.has(e))s.push(this.applyUnaryOperation(e,this.getValueFromToken(t,a)));else if(e==fe.OBJECT_OPERATOR||e==fe.ARRAY_OPERATOR)this.processObjectOrArrayOperator(t,r,s,e,a);else{const r=s.pop();var n=this.getValueFromToken(t,r),i=this.getValueFromToken(t,a);s.push(this.applyBinaryOperation(e,n,i))}}if(s.isEmpty())throw new W(v.format("Expression : $ evaluated to null",e));if(1!=s.size())throw new W(v.format("Expression : $ evaluated multiple values $",e,s));const a=s.get(0);if(a instanceof Ae)return a.getElement();if(!(a instanceof Ee))return this.getValueFromToken(t,a);throw new W(v.format("Expression : $ evaluated to $",e,s.get(0)))}processObjectOrArrayOperator(e,t,r,s,n){const i=new ie,a=new ie;if(!s||!n)return;do{a.push(s),n instanceof Ee?i.push(new Ae(n.toString(),this.evaluateExpression(n,e))):n&&i.push(n),n=r.isEmpty()?void 0:r.pop(),s=t.isEmpty()?void 0:t.pop()}while(s==fe.OBJECT_OPERATOR||s==fe.ARRAY_OPERATOR);n&&(n instanceof Ee?i.push(new Ae(n.toString(),this.evaluateExpression(n,e))):i.push(n)),s&&t.push(s);let o=i.pop(),h=new he(o instanceof Ae?o.getTokenValue():o.toString());for(;!i.isEmpty();)o=i.pop(),s=a.pop(),h.append(s.getOperator()).append(o instanceof Ae?o.getTokenValue():o.toString()),s==fe.ARRAY_OPERATOR&&h.append("]");let u=h.toString(),l=u.substring(0,u.indexOf(".")+1);if(l.length>2&&e.has(l))r.push(new Ae(u,this.getValue(u,e)));else{let e;try{e=wt.INSTANCE.getValue(u)}catch(t){e=u}r.push(new Ae(u,e))}}applyBinaryOperation(e,t,r){if("object"===typeof t||"object"===typeof r||Array.isArray(t)||Array.isArray(r))throw new le(this.expression,v.format("Cannot evaluate expression $ $ $",t,e.getOperator(),r));let s=yt.BINARY_OPERATORS_MAP.get(e);if(!s)throw new le(this.expression,v.format("No operator found to evaluate $ $ $",t,e.getOperator(),r));return new Ae(e.toString(),s.apply(t,r))}applyUnaryOperation(e,t){if("object"===typeof t||Array.isArray(t))throw new le(this.expression,v.format("The operator $ cannot be applied to $",e.getOperator(),t));let r=yt.UNARY_OPERATORS_MAP.get(e);if(!r)throw new le(this.expression,v.format("No Unary operator $ is found to apply on $",e.getOperator(),t));return new Ae(e.toString(),r.apply(t))}getValueFromToken(e,t){return t instanceof Ee?this.evaluateExpression(t,e):t instanceof Ae?t.getElement():this.getValue(t.getExpression(),e)}getValue(e,t){if(e.length<=5)return wt.INSTANCE.getValue(e);const r=e.substring(0,e.indexOf(".")+1);return(t.get(r)??wt.INSTANCE).getValue(e)}}class xt extends It{static PREFIX="Arguments.";constructor(e){super(),this.args=e}getValueInternal(e){let t=e.split(It.REGEX_DOT);return this.retrieveElementFrom(e,t,2,this.args.get(t[1]))}getPrefix(){return xt.PREFIX}}class vt extends It{static PREFIX="Context.";constructor(e){super(),this.context=e}getValueInternal(e){let t=e.split(It.REGEX_DOT),r=t[1],s=r.indexOf("["),n=2;return-1!=s&&(r=t[1].substring(0,s),t[1]=t[1].substring(s),n=1),this.retrieveElementFrom(e,t,n,this.context.get(r)?.getElement())}getPrefix(){return vt.PREFIX}}class _t extends It{static PREFIX="Steps.";constructor(e){super(),this.output=e}getValueInternal(e){let t=e.split(It.REGEX_DOT),r=1,s=this.output.get(t[r++]);if(!s||r>=t.length)return;let n=s.get(t[r++]);if(!n||r>=t.length)return;let i=n.get(t[r++]);return this.retrieveElementFrom(e,t,r,i)}getPrefix(){return _t.PREFIX}}class Pt{count=0;valueExtractors=new Map;getContext(){return this.context}setContext(e){this.context=e;let t=new vt(e);return this.valueExtractors.set(t.getPrefix(),t),this}getArguments(){return this.args}setArguments(e){this.args=e;let t=new xt(e);return this.valueExtractors.set(t.getPrefix(),t),this}getEvents(){return this.events}setEvents(e){return this.events=e,this}getStatementExecution(){return this.statementExecution}setStatementExecution(e){return this.statementExecution=e,this}getSteps(){return this.steps}setSteps(e){this.steps=e;let t=new _t(e);return this.valueExtractors.set(t.getPrefix(),t),this}getCount(){return this.count}setCount(e){return this.count=e,this}getValuesMap(){return this.valueExtractors}}class Mt{outVertices=new Map;inVertices=new Set;constructor(e,t){this.data=t,this.graph=e}getData(){return this.data}setData(e){return this.data=e,this}getOutVertices(){return this.outVertices}setOutVertices(e){return this.outVertices=e,this}getInVertices(){return this.inVertices}setInVertices(e){return this.inVertices=e,this}getGraph(){return this.graph}setGraph(e){return this.graph=e,this}getKey(){return this.data.getUniqueKey()}addOutEdgeTo(e,t){return this.outVertices.has(e)||this.outVertices.set(e,new Set),this.outVertices.get(e).add(t),t.inVertices.add(new s(this,e)),t}addInEdgeTo(e,t){return this.inVertices.add(new s(e,t)),e.outVertices.has(t)||e.outVertices.set(t,new Set),e.outVertices.get(t).add(this),e}hasIncomingEdges(){return!!this.inVertices.size}hasOutgoingEdges(){return!!this.outVertices.size}getSubGraphOfType(e){let t=new Lt(!0);var r=new ie(Array.from(this.outVertices.get(e)??[]));for(r.map((e=>e.getData())).forEach((e=>t.addVertex(e)));!r.isEmpty();){var s=r.pop();Array.from(s.outVertices.values()).flatMap((e=>Array.from(e))).forEach((e=>{t.addVertex(e.getData()),r.add(e)}))}return t}toString(){var e=Array.from(this.getInVertices()).map((e=>e.getT1().getKey()+"("+e.getT2()+")")).join(", "),t=Array.from(this.outVertices.entries()).map((([e,t])=>e+": "+Array.from(t).map((e=>e.getKey())).join(","))).join("\n\t\t");return this.getKey()+":\n\tIn: "+e+"\n\tOut: \n\t\t"+t}}class Lt{nodeMap=new Map;constructor(e=!1){this.isSubGrph=e}getVerticesData(){return Array.from(this.nodeMap.values()).map((e=>e.getData()))}addVertex(e){if(!this.nodeMap.has(e.getUniqueKey())){let t=new Mt(this,e);this.nodeMap.set(e.getUniqueKey(),t)}return this.nodeMap.get(e.getUniqueKey())}getVertex(e){return this.nodeMap.get(e)}getVertexData(e){if(this.nodeMap.has(e))return this.nodeMap.get(e).getData()}getVerticesWithNoIncomingEdges(){return Array.from(this.nodeMap.values()).filter((e=>!e.hasIncomingEdges()))}isCyclic(){let e,t=new ie(this.getVerticesWithNoIncomingEdges()),r=new Set;for(;!t.isEmpty();){if(r.has(t.getFirst().getKey()))return!0;e=t.removeFirst(),r.add(e.getKey()),e.hasOutgoingEdges()&&t.addAll(Array.from(e.getOutVertices().values()).flatMap((e=>Array.from(e))))}return!1}addVertices(e){for(const t of e)this.addVertex(t)}getNodeMap(){return this.nodeMap}isSubGraph(){return this.isSubGrph}toString(){return"Execution Graph : \n"+Array.from(this.nodeMap.values()).map((e=>e.toString())).join("\n")}}class Ut{constructor(e,t){this.message=t,this.messageType=e}getMessageType(){return this.messageType}setMessageType(e){return this.messageType=e,this}getMessage(){return this.message}setMessage(e){return this.message=e,this}toString(){return`${this.messageType} : ${this.message}`}}class Bt{messages=new Array;dependencies=new Set;constructor(e){this.statement=e}getStatement(){return this.statement}setStatement(e){return this.statement=e,this}getMessages(){return this.messages}setMessages(e){return this.messages=e,this}getDependencies(){return this.dependencies}setDependencies(e){return this.dependencies=e,this}getUniqueKey(){return this.statement.getStatementName()}addMessage(e,t){this.messages.push(new Ut(e,t))}addDependency(e){this.dependencies.add(e)}getDepenedencies(){return this.dependencies}equals(e){if(!(e instanceof Bt))return!1;return e.statement.equals(this.statement)}}let Ct;var bt;(bt=Ct||(Ct={})).ERROR="ERROR",bt.WARNING="WARNING",bt.MESSAGE="MESSAGE";class Vt extends q{static PARAMETER_NEEDS_A_VALUE='Parameter "$" needs a value';static STEP_REGEX_PATTERN=new RegExp("Steps\\.([a-zA-Z0-9\\\\-]{1,})\\.([a-zA-Z0-9\\\\-]{1,})","g");static VERSION=1;static MAX_EXECUTION_ITERATIONS=1e7;constructor(e,t,r){if(super(),this.fd=e,this.fd.getVersion()>Vt.VERSION)throw new y("Runtime is at a lower version "+Vt.VERSION+" and trying to run code from version "+this.fd.getVersion()+".");this.fRepo=t,this.sRepo=r}getSignature(){return this.fd}getExecutionPlan(e){let t=new Lt;for(let r of Array.from(this.fd.getSteps().values()))t.addVertex(this.prepareStatementExecution(e,r));let r=this.makeEdges(t);if(r.length)throw new y(v.format("Found these unresolved dependencies : $ ",r.map((e=>v.format("Steps.$.$",e.getT1(),e.getT2())))));return t}internalExecute(e){e.getContext()||e.setContext(new Map),e.getEvents()||e.setEvents(new Map),e.getSteps()||e.setSteps(new Map);let t=this.getExecutionPlan(e.getContext()),r=t.getVerticesData().filter((e=>e.getMessages().length)).map((e=>e.getStatement().getStatementName()+": \n"+e.getMessages().join(",")));if(r?.length)throw new y("Please fix the errors in the function definition before execution : \n"+r.join(",\n"));return this.executeGraph(t,e)}executeGraph(e,t){let r=new ie;r.addAll(e.getVerticesWithNoIncomingEdges());let s=new ie;for(;!(r.isEmpty()&&s.isEmpty()||t.getEvents()?.has(J.OUTPUT));)if(this.processBranchQue(t,r,s),this.processExecutionQue(t,r,s),t.setCount(t.getCount()+1),t.getCount()==Vt.MAX_EXECUTION_ITERATIONS)throw new y("Execution locked in an infinite loop");if(!e.isSubGraph()&&!t.getEvents()?.size)throw new y("No events raised");return new z(Array.from(t.getEvents()?.entries()??[]).flatMap((e=>e[1].map((t=>K.of(e[0],t))))))}processExecutionQue(e,t,r){if(!t.isEmpty()){let s=t.pop();this.allDependenciesResolvedVertex(s,e.getSteps())?this.executeVertex(s,e,r,t):t.add(s)}}processBranchQue(e,t,r){if(r.length){let s=r.pop();this.allDependenciesResolvedTuples(s.getT2(),e.getSteps())?this.executeBranch(e,t,s):r.add(s)}}executeBranch(e,t,r){let s,n=r.getT4();do{this.executeGraph(r.getT1(),e),s=r.getT3().next(),s&&(e.getSteps()?.has(n.getData().getStatement().getStatementName())||e.getSteps()?.set(n.getData().getStatement().getStatementName(),new Map),e.getSteps()?.get(n.getData().getStatement().getStatementName())?.set(s.getName(),this.resolveInternalExpressions(s.getResult(),e)))}while(s&&s.getName()!=J.OUTPUT);s?.getName()==J.OUTPUT&&n.getOutVertices().has(J.OUTPUT)&&(n?.getOutVertices()?.get(J.OUTPUT)??[]).forEach((e=>t.add(e)))}executeVertex(e,t,r,s){let n=e.getData().getStatement(),a=this.fRepo.find(n.getNamespace(),n.getName());if(!a)throw new y(v.format("$.$ function is not found.",n.getNamespace(),n.getName()));let o=a?.getSignature().getParameters(),h=this.getArgumentsFromParametersMap(t,n,o??new Map),u=t.getContext(),l=a.execute((new Pt).setContext(u).setArguments(h).setEvents(t.getEvents()).setSteps(t.getSteps()).setStatementExecution(e.getData()).setCount(t.getCount())),p=l.next();if(!p)throw new y(v.format("Executing $ returned no events",n.getStatementName()));let c=p.getName()==J.OUTPUT;if(t.getSteps()?.has(n.getStatementName())||t.getSteps().set(n.getStatementName(),new Map),t.getSteps().get(n.getStatementName()).set(p.getName(),this.resolveInternalExpressions(p.getResult(),t)),c){let t=e.getOutVertices().get(J.OUTPUT);t&&t.forEach((e=>s.add(e)))}else{let t=e.getSubGraphOfType(p.getName()),s=this.makeEdges(t);r.push(new i(t,s,l,e))}}resolveInternalExpressions(e,t){return e?Array.from(e.entries()).map((e=>new s(e[0],this.resolveInternalExpression(e[1],t)))).reduce(((e,t)=>(e.set(t.getT1(),t.getT2()),e)),new Map):e}resolveInternalExpression(e,t){if(c(e)||"object"!=typeof e)return e;if(e instanceof Q){return new yt(e.getExpression()).evaluate(t.getValuesMap())}if(Array.isArray(e)){let r=[];for(let s of e)r.push(this.resolveInternalExpression(s,t));return r}if("object"==typeof e){let r={};for(let s of Object.entries(e))r[s[0]]=this.resolveInternalExpression(s[1],t);return r}}allDependenciesResolvedTuples(e,t){for(let r of e){if(!t.has(r.getT1()))return!1;if(!t.get(r.getT1())?.get(r.getT2()))return!1}return!0}allDependenciesResolvedVertex(e,t){return!e.getInVertices().size||0==Array.from(e.getInVertices()).filter((e=>{let r=e.getT1().getData().getStatement().getStatementName(),s=e.getT2();return!(t.has(r)&&t.get(r)?.has(s))})).length}getArgumentsFromParametersMap(e,t,r){return Array.from(t.getParameterMap().entries()).map((t=>{let n,i=t[1];if(!i?.length)return new s(t[0],n);let a=r.get(t[0]);return a?(n=a.isVariableArgument()?i.map((t=>this.parameterReferenceEvaluation(e,t))).flatMap((e=>Array.isArray(e)?e:[e])):this.parameterReferenceEvaluation(e,i[0]),new s(t[0],n)):new s(t[0],void 0)})).filter((e=>!c(e.getT2()))).reduce(((e,t)=>(e.set(t.getT1(),t.getT2()),e)),new Map)}parameterReferenceEvaluation(e,t){let r;if(t.getType()==re.VALUE)r=this.resolveInternalExpression(t.getValue(),e);else if(t.getType()==re.EXPRESSION&&!_.isNullOrBlank(t.getExpression())){r=new yt(t.getExpression()??"").evaluate(e.getValuesMap())}return r}prepareStatementExecution(e,t){let r=new Bt(t),s=this.fRepo.find(t.getNamespace(),t.getName());if(!s)throw new y(v.format("$.$ was not available",t.getNamespace(),t.getName()));let n=new Map(s.getSignature().getParameters());for(let s of Array.from(t.getParameterMap().entries())){let t=n.get(s[0]);if(!t)continue;let i=s[1];if(i.length){if(t.isVariableArgument())for(let s of i)this.parameterReferenceValidation(e,r,t,s);else{let s=i[0];this.parameterReferenceValidation(e,r,t,s)}n.delete(t.getParameterName())}else c(L.getDefaultValue(t.getSchema(),this.sRepo))&&r.addMessage(Ct.ERROR,v.format(Vt.PARAMETER_NEEDS_A_VALUE,t.getParameterName()))}if(!c(r.getStatement().getDependentStatements()))for(let e of r.getStatement().getDependentStatements())r.addDependency(e);if(n.size)for(let e of Array.from(n.values()))c(L.getDefaultValue(e.getSchema(),this.sRepo))&&r.addMessage(Ct.ERROR,v.format(Vt.PARAMETER_NEEDS_A_VALUE,e.getParameterName()));return r}parameterReferenceValidation(e,t,r,n){if(n){if(n.getType()==re.VALUE){c(n.getValue())&&c(L.getDefaultValue(r.getSchema(),this.sRepo))&&t.addMessage(Ct.ERROR,v.format(Vt.PARAMETER_NEEDS_A_VALUE,r.getParameterName()));let e=new ie;for(e.push(new s(r.getSchema(),n.getValue()));!e.isEmpty();){let r=e.pop();if(r.getT2()instanceof Q)this.addDependencies(t,r.getT2().getExpression());else{if(c(r.getT1())||c(r.getT1().getType()))continue;if(r.getT1().getType()?.contains(E.ARRAY)&&Array.isArray(r.getT2())){let t=r.getT1().getItems();if(!t)continue;if(t.isSingleType())for(let n of r.getT2())e.push(new s(t.getSingleSchema(),n));else{let n=r.getT2();for(let r=0;r<n.length;r++)e.push(new s(t.getTupleSchema()[r],n[r]))}}else if(r.getT1().getType()?.contains(E.OBJECT)&&"object"==typeof r.getT2()){let n=r.getT1();if(n.getName()===te.EXPRESSION.getName()&&n.getNamespace()===te.EXPRESSION.getNamespace()){let e=r.getT2();e.isExpression&&this.addDependencies(t,e.value)}else if(n.getProperties())for(let t of Object.entries(r.getT2()))n.getProperties().has(t[0])&&e.push(new s(n.getProperties().get(t[0]),t[1]))}}}}else if(n.getType()==re.EXPRESSION)if(_.isNullOrBlank(n.getExpression()))c(L.getDefaultValue(r.getSchema(),this.sRepo))&&t.addMessage(Ct.ERROR,v.format(Vt.PARAMETER_NEEDS_A_VALUE,r.getParameterName()));else try{this.addDependencies(t,n.getExpression())}catch(e){t.addMessage(Ct.ERROR,v.format("Error evaluating $ : $",n.getExpression(),e))}}else c(L.getDefaultValue(r.getSchema(),this.sRepo))&&t.addMessage(Ct.ERROR,v.format(Vt.PARAMETER_NEEDS_A_VALUE,r.getParameterName()))}addDependencies(e,t){t&&Array.from(t.match(Vt.STEP_REGEX_PATTERN)??[]).forEach((t=>e.addDependency(t)))}makeEdges(e){let t=e.getNodeMap().values(),r=[];for(let n of Array.from(t))for(let t of n.getData().getDependencies()){let i=t.indexOf(".",6),a=t.substring(6,i),o=t.indexOf(".",i+1),h=-1==o?t.substring(i+1):t.substring(i+1,o);e.getNodeMap().has(a)||r.push(new s(a,h));let u=e.getNodeMap().get(a);u&&n.addInEdgeTo(u,h)}return r}}var Dt={};e(Dt,de),e(Dt,Ie),e(Dt,we),e(Dt,xe),e(Dt,_e),e(Dt,Me),e(Dt,Ue),e(Dt,Oe),e(Dt,Ce),e(Dt,Ve),e(Dt,ke),e(Dt,Fe),e(Dt,Ye),e(Dt,We),e(Dt,qe),e(Dt,Je),e(Dt,ze),e(Dt,et),e(Dt,rt),e(Dt,at),e(Dt,nt),e(Dt,ht),e(Dt,lt);var kt={};e(kt,ct),e(kt,Et),e(kt,At),e(kt,Ot),e(kt,mt),e(module.exports,r),e(module.exports,{}),e(module.exports,a),e(module.exports,h),e(module.exports,f),e(module.exports,I),e(module.exports,$),e(module.exports,H),e(module.exports,w),e(module.exports,{}),e(module.exports,j),e(module.exports,u),e(module.exports,X),e(module.exports,pe),e(module.exports,oe),e(module.exports,Nt),e(module.exports,ue),e(module.exports,ce),e(module.exports,Te),e(module.exports,ge),e(module.exports,ne),e(module.exports,p),e(module.exports,x),e(module.exports,R),e(module.exports,Dt),e(module.exports,kt);
2
2
  //# sourceMappingURL=index.js.map