@revisium/formula 0.8.0 → 0.10.0

package/dist/formula-spec.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/formula-spec.ts"],"names":[],"mappings":";AAuDO,IAAM,WAAA,GAA2B;AAAA,EACtC,OAAA,EAAS,KAAA;AAAA,EACT,WAAA,EACE,8GAAA;AAAA,EAEF,MAAA,EAAQ;AAAA,IACN,eAAA,EAAiB;AAAA,MACf,iDAAA;AAAA,MACA,mDAAA;AAAA,MACA,qDAAA;AAAA,MACA,qEAAA;AAAA,MACA,kDAAA;AAAA,MACA,kEAAA;AAAA,MACA,kEAAA;AAAA,MACA;AAAA,KACF;AAAA,IACA,mBAAA,EAAqB;AAAA,MACnB,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,kCAAA,EAAmC;AAAA,MACjE,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,aAAA,EAAc;AAAA,MAC5C,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,gBAAA,EAAiB;AAAA,MAC/C,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,UAAA,EAAW;AAAA,MACzC,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,oBAAA;AAAqB,KACrD;AAAA,IACA,mBAAA,EAAqB;AAAA,MACnB,EAAE,QAAA,EAAU,IAAA,EAAM,WAAA,EAAa,OAAA,EAAQ;AAAA,MACvC,EAAE,QAAA,EAAU,IAAA,EAAM,WAAA,EAAa,WAAA,EAAY;AAAA,MAC3C,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,cAAA,EAAe;AAAA,MAC7C,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,WAAA,EAAY;AAAA,MAC1C,EAAE,QAAA,EAAU,IAAA,EAAM,WAAA,EAAa,kBAAA,EAAmB;AAAA,MAClD,EAAE,QAAA,EAAU,IAAA,EAAM,WAAA,EAAa,eAAA;AAAgB,KACjD;AAAA,IACA,gBAAA,EAAkB;AAAA,MAChB,EAAE,QAAA,EAAU,IAAA,EAAM,WAAA,EAAa,aAAA,EAAc;AAAA,MAC7C,EAAE,QAAA,EAAU,IAAA,EAAM,WAAA,EAAa,YAAA,EAAa;AAAA,MAC5C,EAAE,QAAA,EAAU,GAAA,EAAK,WAAA,EAAa,aAAA;AAAc,KAC9C;AAAA,IACA,KAAA,EAAO,CAAC,0BAAA,EAA4B,6BAA6B;AAAA,GACnE;AAAA,EAEA,SAAA,EAAW;AAAA,IACT,MAAA,EAAQ;AAAA,MACN;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,WAAA,EAAa,kDAAA;AAAA,QACb,SAAA,EAAW,6BAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU;AAAA,UACR,gDAAA;AAAA,UACA;AAAA;AACF,OACF;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,6BAAA;AAAA,QACb,SAAA,EAAW,aAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,wBAAwB;AAAA,OACrC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,6BAAA;AAAA,QACb,SAAA,EAAW,aAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,wBAAwB;AAAA,OACrC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,8CAAA;AAAA,QACb,SAAA,EAAW,YAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,wCAAwC;AAAA,OACrD;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,mDAAA;AAAA,QACb,SAAA,EAAW,mBAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,qCAAqC;AAAA,OAClD;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,6CAAA;AAAA,QACb,SAAA,EAAW,oBAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,sCAAsC;AAAA,OACnD;AAAA,MACA;AAAA,QACE,IAAA,EAAM,SAAA;AAAA,QACN,WAAA,EAAa,yCAAA;AAAA,QACb,SAAA,EAAW,oCAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,iDAAiD;AAAA,OAC9D;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,mCAAA;AAAA,QACb,SAAA,EAAW,yBAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,uBAAA,EAAyB,kCAAkC;AAAA;AACxE,KACF;AAAA,IACA,OAAA,EAAS;AAAA,MACP;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,4CAAA;AAAA,QACb,SAAA,EAAW,0BAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,2BAAA,EAA6B,iBAAiB;AAAA,OAC3D;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,mCAAA;AAAA,QACb,SAAA,EAAW,eAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,iBAAiB;AAAA,OAC9B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,iCAAA;AAAA,QACb,SAAA,EAAW,cAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,gBAAgB;AAAA,OAC7B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,wBAAA;AAAA,QACb,SAAA,EAAW,aAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,cAAc;AAAA,OAC3B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,2BAAA;AAAA,QACb,SAAA,EAAW,cAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,eAAe;AAAA,OAC5B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,2BAAA;AAAA,QACb,SAAA,EAAW,qBAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,gBAAgB;AAAA,OAC7B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,oCAAA;AAAA,QACb,SAAA,EAAW,0BAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,gCAAgC;AAAA,OAC7C;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,oCAAA;AAAA,QACb,SAAA,EAAW,0BAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,+BAA+B;AAAA,OAC5C;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,iCAAA;AAAA,QACb,SAAA,EAAW,aAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,qBAAqB;AAAA,OAClC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,iCAAA;AAAA,QACb,SAAA,EAAW,eAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,iBAAiB;AAAA,OAC9B;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,+BAAA;AAAA,QACb,SAAA,EAAW,aAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,oBAAoB;AAAA,OACjC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,wCAAA;AAAA,QACb,SAAA,EAAW,cAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,gBAAA,EAAkB,cAAA,EAAgB,cAAc;AAAA,OAC7D;AAAA,MACA;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,WAAA,EAAa,qCAAA;AAAA,QACb,SAAA,EAAW,eAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,gCAAA,EAAkC,oBAAoB;AAAA;AACnE,KACF;AAAA,IACA,OAAA,EAAS;AAAA,MACP;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,2BAAA;AAAA,QACb,SAAA,EAAW,WAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,mDAAmD;AAAA,OAChE;AAAA,MACA;AAAA,QACE,IAAA,EAAM,IAAA;AAAA,QACN,WAAA,EAAa,0BAAA;AAAA,QACb,SAAA,EAAW,UAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,6CAA6C;AAAA,OAC1D;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,wBAAA;AAAA,QACb,SAAA,EAAW,YAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,iCAAiC;AAAA,OAC9C;AAAA,MACA;AAAA,QACE,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,wCAAA;AAAA,QACb,SAAA,EAAW,wBAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,2CAA2C;AAAA,OACxD;AAAA,MACA;AAAA,QACE,IAAA,EAAM,YAAA;AAAA,QACN,WAAA,EAAa,wCAAA;AAAA,QACb,SAAA,EAAW,0BAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,6CAA6C;AAAA,OAC1D;AAAA,MACA;AAAA,QACE,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,sCAAA;AAAA,QACb,SAAA,EAAW,wBAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,2CAA2C;AAAA,OACxD;AAAA,MACA;AAAA,QACE,IAAA,EAAM,QAAA;AAAA,QACN,WAAA,EAAa,uCAAA;AAAA,QACb,SAAA,EAAW,eAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,iDAAiD;AAAA,OAC9D;AAAA,MACA;AAAA,QACE,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,oCAAA;AAAA,QACb,SAAA,EAAW,wBAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU;AAAA,UACR;AAAA;AACF;AACF,KACF;AAAA,IACA,KAAA,EAAO;AAAA,MACL;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,qCAAA;AAAA,QACb,SAAA,EAAW,YAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,oCAAoC;AAAA,OACjD;AAAA,MACA;AAAA,QACE,IAAA,EAAM,KAAA;AAAA,QACN,WAAA,EAAa,yCAAA;AAAA,QACb,SAAA,EAAW,YAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,8BAA8B;AAAA,OAC3C;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,wCAAA;AAAA,QACb,SAAA,EAAW,cAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,iCAAiC;AAAA,OAC9C;AAAA,MACA;AAAA,QACE,IAAA,EAAM,OAAA;AAAA,QACN,WAAA,EAAa,mCAAA;AAAA,QACb,SAAA,EAAW,cAAA;AAAA,QACX,UAAA,EAAY,KAAA;AAAA,QACZ,QAAA,EAAU,CAAC,4BAA4B;AAAA,OACzC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,MAAA;AAAA,QACN,WAAA,EAAa,kCAAA;AAAA,QACb,SAAA,EAAW,aAAA;AAAA,QACX,UAAA,EAAY,KAAA;AAAA,QACZ,QAAA,EAAU,CAAC,0BAA0B;AAAA;AACvC,KACF;AAAA,IACA,UAAA,EAAY;AAAA,MACV;AAAA,QACE,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,2BAAA;AAAA,QACb,SAAA,EAAW,iBAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,sBAAsB;AAAA,OACnC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,2BAAA;AAAA,QACb,SAAA,EAAW,iBAAA;AAAA,QACX,UAAA,EAAY,QAAA;AAAA,QACZ,QAAA,EAAU,CAAC,sBAAsB;AAAA,OACnC;AAAA,MACA;AAAA,QACE,IAAA,EAAM,WAAA;AAAA,QACN,WAAA,EAAa,4BAAA;AAAA,QACb,SAAA,EAAW,kBAAA;AAAA,QACX,UAAA,EAAY,SAAA;AAAA,QACZ,QAAA,EAAU,CAAC,sBAAA,EAAwB,uBAAuB;AAAA;AAC5D,KACF;AAAA,IACA,WAAA,EAAa;AAAA,MACX;AAAA,QACE,IAAA,EAAM,IAAA;AAAA,QACN,WAAA,EAAa,+CAAA;AAAA,QACb,SAAA,EAAW,0CAAA;AAAA,QACX,UAAA,EAAY,KAAA;AAAA,QACZ,QAAA,EAAU;AAAA,UACR,4CAAA;AAAA,UACA;AAAA;AACF,OACF;AAAA,MACA;AAAA,QACE,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,iCAAA;AAAA,QACb,SAAA,EAAW,+BAAA;AAAA,QACX,UAAA,EAAY,KAAA;AAAA,QACZ,QAAA,EAAU,CAAC,uCAAuC;AAAA;AACpD;AACF,GACF;AAAA,EAEA,QAAA,EAAU;AAAA,IACR;AAAA,MACE,IAAA,EAAM,aAAA;AAAA,MACN,WAAA,EAAa,oCAAA;AAAA,MACb,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU,CAAC,OAAA,EAAS,UAAA,EAAY,YAAY,CAAA;AAAA,MAC5C,qBAAA,EAAuB,CAAC,WAAA,EAAa,cAAA,EAAgB,gBAAgB;AAAA,KACvE;AAAA,IACA;AAAA,MACE,IAAA,EAAM,YAAA;AAAA,MACN,WAAA,EAAa,oCAAA;AAAA,MACb,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU,CAAC,aAAA,EAAe,WAAA,EAAa,kBAAkB;AAAA,KAC3D;AAAA,IACA;AAAA,MACE,IAAA,EAAM,YAAA;AAAA,MACN,WAAA,EAAa,uCAAA;AAAA,MACb,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU,CAAC,aAAA,EAAe,SAAA,EAAW,eAAe;AAAA,KACtD;AAAA,IACA;AAAA,MACE,IAAA,EAAM,aAAA;AAAA,MACN,WAAA,EAAa,oDAAA;AAAA,MACb,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU,CAAC,cAAA,EAAgB,mBAAA,EAAqB,wBAAwB,CAAA;AAAA,MACxE,qBAAA,EAAuB,CAAC,kBAAkB;AAAA,KAC5C;AAAA,IACA;AAAA,MACE,IAAA,EAAM,aAAA;AAAA,MACN,WAAA,EACE,8EAAA;AAAA,MACF,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,QACR,gBAAA;AAAA,QACA,uBAAA;AAAA,QACA,iCAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,qBAAA,EAAuB,CAAC,oBAAA,EAAsB,oBAAoB;AAAA,KACpE;AAAA,IACA;AAAA,MACE,IAAA,EAAM,WAAA;AAAA,MACN,WAAA,EACE,0GAAA;AAAA,MACF,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,QACR,UAAA;AAAA,QACA,aAAA;AAAA,QACA,wBAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,qBAAA,EAAuB,CAAC,cAAA,EAAgB,iBAAiB;AAAA,KAC3D;AAAA,IACA;AAAA,MACE,IAAA,EAAM,eAAA;AAAA,MACN,WAAA,EACE,0OAAA;AAAA,MACF,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,QACR,aAAA;AAAA,QACA,gBAAA;AAAA,QACA,sBAAA;AAAA,QACA,2BAAA;AAAA,QACA,0BAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,qBAAA,EAAuB;AAAA,QACrB,iBAAA;AAAA,QACA,oBAAA;AAAA,QACA;AAAA;AACF,KACF;AAAA,IACA;AAAA,MACE,IAAA,EAAM,uBAAA;AAAA,MACN,WAAA,EACE,qJAAA;AAAA,MACF,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,QACR,aAAA;AAAA,QACA,eAAA;AAAA,QACA,yBAAA;AAAA,QACA;AAAA;AACF,KACF;AAAA,IACA;AAAA,MACE,IAAA,EAAM,kBAAA;AAAA,MACN,WAAA,EACE,qMAAA;AAAA,MACF,UAAA,EAAY,KAAA;AAAA,MACZ,QAAA,EAAU;AAAA,QACR,0EAAA;AAAA,QACA,oDAAA;AAAA,QACA,4BAAA;AAAA,QACA,yBAAA;AAAA,QACA,0BAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,qBAAA,EAAuB,CAAC,gBAAA,EAAkB,gBAAgB;AAAA;AAC5D,GACF;AAAA,EAEA,gBAAA,EAAkB;AAAA,IAChB,EAAE,OAAA,EAAS,sCAAA,EAAwC,UAAA,EAAY,KAAA,EAAM;AAAA,IACrE,EAAE,OAAA,EAAS,qCAAA,EAAuC,UAAA,EAAY,KAAA,EAAM;AAAA,IACpE,EAAE,OAAA,EAAS,oBAAA,EAAsB,UAAA,EAAY,KAAA,EAAM;AAAA,IACnD,EAAE,OAAA,EAAS,yBAAA,EAA2B,UAAA,EAAY,KAAA,EAAM;AAAA,IACxD,EAAE,OAAA,EAAS,yBAAA,EAA2B,UAAA,EAAY,KAAA,EAAM;AAAA,IACxD,EAAE,OAAA,EAAS,2BAAA,EAA6B,UAAA,EAAY,KAAA,EAAM;AAAA,IAC1D,EAAE,OAAA,EAAS,mCAAA,EAAqC,UAAA,EAAY,KAAA;AAAM,GACpE;AAAA,EAEA,WAAA,EAAa;AAAA,IACX,WAAA,EACE,+DAAA;AAAA,IACF,SAAA,EAAW,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAAA,GAMb;AAAA,EAEA,QAAA,EAAU;AAAA,IACR;AAAA,MACE,UAAA,EAAY,kBAAA;AAAA,MACZ,WAAA,EAAa,yCAAA;AAAA,MACb,MAAA,EAAQ;AAAA,KACV;AAAA,IACA;AAAA,MACE,UAAA,EAAY,4BAAA;AAAA,MACZ,WAAA,EAAa,gCAAA;AAAA,MACb,MAAA,EAAQ;AAAA,KACV;AAAA,IACA;AAAA,MACE,UAAA,EAAY,cAAA;AAAA,MACZ,WAAA,EAAa,mBAAA;AAAA,MACb,MAAA,EAAQ;AAAA,KACV;AAAA,IACA;AAAA,MACE,UAAA,EAAY,4CAAA;AAAA,MACZ,WAAA,EAAa,iCAAA;AAAA,MACb,MAAA,EAAQ;AAAA,KACV;AAAA,IACA;AAAA,MACE,UAAA,EAAY,uBAAA;AAAA,MACZ,WAAA,EAAa,gBAAA;AAAA,MACb,MAAA,EAAQ;AAAA,KACV;AAAA,IACA;AAAA,MACE,UAAA,EAAY,iCAAA;AAAA,MACZ,WAAA,EAAa,kCAAA;AAAA,MACb,MAAA,EAAQ;AAAA;AACV,GACF;AAAA,EAEA,WAAA,EAAa;AAAA,IACX;AAAA,MACE,IAAA,EAAM,0BAAA;AAAA,MACN,WAAA,EAAa,qCAAA;AAAA,MACb,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA;AAAA,KAMR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,oBAAA;AAAA,MACN,WAAA,EAAa,4CAAA;AAAA,MACb,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA;AAAA,KAMR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,qBAAA;AAAA,MACN,WAAA,EAAa,0CAAA;AAAA,MACb,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA;AAAA,KAMR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,sBAAA;AAAA,MACN,WAAA,EAAa,oCAAA;AAAA,MACb,IAAA,EAAM,CAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA,IAAA;AAAA,KAcR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,uBAAA;AAAA,MACN,WAAA,EAAa,qDAAA;AAAA,MACb,IAAA,EAAM,CAAA;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA,KAAA;AAAA,KAaR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,qCAAA;AAAA,MACN,WAAA,EACE,wEAAA;AAAA,MACF,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAAA;AAAA,KA+BR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,kCAAA;AAAA,MACN,WAAA,EACE,4IAAA;AAAA,MACF,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAAA;AAAA,KAsCR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,gCAAA;AAAA,MACN,WAAA,EACE,sEAAA;AAAA,MACF,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sBAAA;AAAA,KA0CR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,8CAAA;AAAA,MACN,WAAA,EACE,wEAAA;AAAA,MACF,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yBAAA;AAAA,KA2BR;AAAA,IACA;AAAA,MACE,IAAA,EAAM,kCAAA;AAAA,MACN,WAAA,EAAa,4DAAA;AAAA,MACb,IAAA,EAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAAA;AAAA;AAgDR,GACF;AAAA,EAEA,WAAA,EAAa;AAAA,IACX,SAAA,EACE,0EAAA;AAAA,IACF,UAAA,EAAY,CAAC,QAAA,EAAU,QAAA,EAAU,SAAS,CAAA;AAAA,IAC1C,KAAA,EAAO;AAAA,MACL,0DAAA;AAAA,MACA,sDAAA;AAAA,MACA,6DAAA;AAAA,MACA;AAAA;AACF;AAEJ","file":"formula-spec.js","sourcesContent":["export interface FunctionSpec {\n  name: string;\n  description: string;\n  signature: string;\n  returnType: 'string' | 'number' | 'boolean' | 'any';\n  examples: string[];\n}\n\nexport interface FormulaSpec {\n  version: string;\n  description: string;\n  syntax: {\n    fieldReferences: string[];\n    arithmeticOperators: { operator: string; description: string }[];\n    comparisonOperators: { operator: string; description: string }[];\n    logicalOperators: { operator: string; description: string }[];\n    other: string[];\n  };\n  functions: {\n    string: FunctionSpec[];\n    numeric: FunctionSpec[];\n    boolean: FunctionSpec[];\n    array: FunctionSpec[];\n    conversion: FunctionSpec[];\n    conditional: FunctionSpec[];\n  };\n  features: {\n    name: string;\n    description: string;\n    minVersion: string;\n    examples: string[];\n    dependenciesExtracted?: string[];\n  }[];\n  versionDetection: { feature: string; minVersion: string }[];\n  parseResult: {\n    description: string;\n    interface: string;\n  };\n  examples: {\n    expression: string;\n    description: string;\n    result?: string;\n  }[];\n  apiExamples: {\n    name: string;\n    description: string;\n    code: string;\n  }[];\n  schemaUsage: {\n    structure: string;\n    fieldTypes: string[];\n    rules: string[];\n  };\n}\n\nexport const formulaSpec: FormulaSpec = {\n  version: '1.1',\n  description:\n    'Formula expressions for computed fields. Formulas reference other fields and calculate values automatically.',\n\n  syntax: {\n    fieldReferences: [\n      'Simple field: fieldName (e.g., price, quantity)',\n      'Nested path: object.property (e.g., stats.damage)',\n      'Array index: array[0] or array[-1] for last element',\n      'Bracket notation: [\"field-name\"] for field names containing hyphens',\n      '  - Required when field name contains hyphen (-)',\n      '  - Without brackets: field-name is parsed as \"field minus name\"',\n      '  - With brackets: [\"field-name\"] references the field correctly',\n      'Combined: items[0].price, user.addresses[-1].city, obj[\"field-name\"].value',\n    ],\n    arithmeticOperators: [\n      { operator: '+', description: 'Addition or string concatenation' },\n      { operator: '-', description: 'Subtraction' },\n      { operator: '*', description: 'Multiplication' },\n      { operator: '/', description: 'Division' },\n      { operator: '%', description: 'Modulo (remainder)' },\n    ],\n    comparisonOperators: [\n      { operator: '==', description: 'Equal' },\n      { operator: '!=', description: 'Not equal' },\n      { operator: '>', description: 'Greater than' },\n      { operator: '<', description: 'Less than' },\n      { operator: '>=', description: 'Greater or equal' },\n      { operator: '<=', description: 'Less or equal' },\n    ],\n    logicalOperators: [\n      { operator: '&&', description: 'Logical AND' },\n      { operator: '||', description: 'Logical OR' },\n      { operator: '!', description: 'Logical NOT' },\n    ],\n    other: ['Parentheses: (a + b) * c', 'Unary minus: -value, a + -b'],\n  },\n\n  functions: {\n    string: [\n      {\n        name: 'concat',\n        description: 'Concatenate multiple values into a single string',\n        signature: 'concat(value1, value2, ...)',\n        returnType: 'string',\n        examples: [\n          'concat(firstName, \" \", lastName) // \"John Doe\"',\n          'concat(\"Price: \", price, \" USD\") // \"Price: 100 USD\"',\n        ],\n      },\n      {\n        name: 'upper',\n        description: 'Convert string to uppercase',\n        signature: 'upper(text)',\n        returnType: 'string',\n        examples: ['upper(name) // \"HELLO\"'],\n      },\n      {\n        name: 'lower',\n        description: 'Convert string to lowercase',\n        signature: 'lower(text)',\n        returnType: 'string',\n        examples: ['lower(name) // \"hello\"'],\n      },\n      {\n        name: 'trim',\n        description: 'Remove whitespace from both ends of a string',\n        signature: 'trim(text)',\n        returnType: 'string',\n        examples: ['trim(name) // \"hello\" from \"  hello  \"'],\n      },\n      {\n        name: 'left',\n        description: 'Extract characters from the beginning of a string',\n        signature: 'left(text, count)',\n        returnType: 'string',\n        examples: ['left(name, 3) // \"hel\" from \"hello\"'],\n      },\n      {\n        name: 'right',\n        description: 'Extract characters from the end of a string',\n        signature: 'right(text, count)',\n        returnType: 'string',\n        examples: ['right(name, 3) // \"llo\" from \"hello\"'],\n      },\n      {\n        name: 'replace',\n        description: 'Replace first occurrence of a substring',\n        signature: 'replace(text, search, replacement)',\n        returnType: 'string',\n        examples: ['replace(name, \"o\", \"0\") // \"hell0\" from \"hello\"'],\n      },\n      {\n        name: 'join',\n        description: 'Join array elements into a string',\n        signature: 'join(array, separator?)',\n        returnType: 'string',\n        examples: ['join(tags) // \"a,b,c\"', 'join(tags, \" | \") // \"a | b | c\"'],\n      },\n    ],\n    numeric: [\n      {\n        name: 'round',\n        description: 'Round a number to specified decimal places',\n        signature: 'round(number, decimals?)',\n        returnType: 'number',\n        examples: ['round(3.14159, 2) // 3.14', 'round(3.5) // 4'],\n      },\n      {\n        name: 'floor',\n        description: 'Round down to the nearest integer',\n        signature: 'floor(number)',\n        returnType: 'number',\n        examples: ['floor(3.7) // 3'],\n      },\n      {\n        name: 'ceil',\n        description: 'Round up to the nearest integer',\n        signature: 'ceil(number)',\n        returnType: 'number',\n        examples: ['ceil(3.2) // 4'],\n      },\n      {\n        name: 'abs',\n        description: 'Get the absolute value',\n        signature: 'abs(number)',\n        returnType: 'number',\n        examples: ['abs(-5) // 5'],\n      },\n      {\n        name: 'sqrt',\n        description: 'Calculate the square root',\n        signature: 'sqrt(number)',\n        returnType: 'number',\n        examples: ['sqrt(16) // 4'],\n      },\n      {\n        name: 'pow',\n        description: 'Raise a number to a power',\n        signature: 'pow(base, exponent)',\n        returnType: 'number',\n        examples: ['pow(2, 3) // 8'],\n      },\n      {\n        name: 'min',\n        description: 'Get the minimum of multiple values',\n        signature: 'min(value1, value2, ...)',\n        returnType: 'number',\n        examples: ['min(a, b, c) // smallest value'],\n      },\n      {\n        name: 'max',\n        description: 'Get the maximum of multiple values',\n        signature: 'max(value1, value2, ...)',\n        returnType: 'number',\n        examples: ['max(a, b, c) // largest value'],\n      },\n      {\n        name: 'log',\n        description: 'Calculate the natural logarithm',\n        signature: 'log(number)',\n        returnType: 'number',\n        examples: ['log(10) // 2.302...'],\n      },\n      {\n        name: 'log10',\n        description: 'Calculate the base-10 logarithm',\n        signature: 'log10(number)',\n        returnType: 'number',\n        examples: ['log10(100) // 2'],\n      },\n      {\n        name: 'exp',\n        description: 'Calculate e raised to a power',\n        signature: 'exp(number)',\n        returnType: 'number',\n        examples: ['exp(1) // 2.718...'],\n      },\n      {\n        name: 'sign',\n        description: 'Get the sign of a number (-1, 0, or 1)',\n        signature: 'sign(number)',\n        returnType: 'number',\n        examples: ['sign(-5) // -1', 'sign(0) // 0', 'sign(5) // 1'],\n      },\n      {\n        name: 'length',\n        description: 'Get the length of a string or array',\n        signature: 'length(value)',\n        returnType: 'number',\n        examples: ['length(name) // 5 from \"hello\"', 'length(items) // 3'],\n      },\n    ],\n    boolean: [\n      {\n        name: 'and',\n        description: 'Logical AND of two values',\n        signature: 'and(a, b)',\n        returnType: 'boolean',\n        examples: ['and(isActive, hasPermission) // true if both true'],\n      },\n      {\n        name: 'or',\n        description: 'Logical OR of two values',\n        signature: 'or(a, b)',\n        returnType: 'boolean',\n        examples: ['or(isAdmin, isOwner) // true if either true'],\n      },\n      {\n        name: 'not',\n        description: 'Logical NOT of a value',\n        signature: 'not(value)',\n        returnType: 'boolean',\n        examples: ['not(isDeleted) // true if false'],\n      },\n      {\n        name: 'contains',\n        description: 'Check if a string contains a substring',\n        signature: 'contains(text, search)',\n        returnType: 'boolean',\n        examples: ['contains(name, \"ell\") // true for \"hello\"'],\n      },\n      {\n        name: 'startswith',\n        description: 'Check if a string starts with a prefix',\n        signature: 'startswith(text, prefix)',\n        returnType: 'boolean',\n        examples: ['startswith(name, \"hel\") // true for \"hello\"'],\n      },\n      {\n        name: 'endswith',\n        description: 'Check if a string ends with a suffix',\n        signature: 'endswith(text, suffix)',\n        returnType: 'boolean',\n        examples: ['endswith(name, \"llo\") // true for \"hello\"'],\n      },\n      {\n        name: 'isnull',\n        description: 'Check if a value is null or undefined',\n        signature: 'isnull(value)',\n        returnType: 'boolean',\n        examples: ['isnull(optionalField) // true if null/undefined'],\n      },\n      {\n        name: 'includes',\n        description: 'Check if an array contains a value',\n        signature: 'includes(array, value)',\n        returnType: 'boolean',\n        examples: [\n          'includes(tags, \"featured\") // true if array contains value',\n        ],\n      },\n    ],\n    array: [\n      {\n        name: 'sum',\n        description: 'Calculate the sum of array elements',\n        signature: 'sum(array)',\n        returnType: 'number',\n        examples: ['sum(prices) // total of all prices'],\n      },\n      {\n        name: 'avg',\n        description: 'Calculate the average of array elements',\n        signature: 'avg(array)',\n        returnType: 'number',\n        examples: ['avg(scores) // average score'],\n      },\n      {\n        name: 'count',\n        description: 'Get the number of elements in an array',\n        signature: 'count(array)',\n        returnType: 'number',\n        examples: ['count(items) // number of items'],\n      },\n      {\n        name: 'first',\n        description: 'Get the first element of an array',\n        signature: 'first(array)',\n        returnType: 'any',\n        examples: ['first(items) // first item'],\n      },\n      {\n        name: 'last',\n        description: 'Get the last element of an array',\n        signature: 'last(array)',\n        returnType: 'any',\n        examples: ['last(items) // last item'],\n      },\n    ],\n    conversion: [\n      {\n        name: 'tostring',\n        description: 'Convert a value to string',\n        signature: 'tostring(value)',\n        returnType: 'string',\n        examples: ['tostring(42) // \"42\"'],\n      },\n      {\n        name: 'tonumber',\n        description: 'Convert a value to number',\n        signature: 'tonumber(value)',\n        returnType: 'number',\n        examples: ['tonumber(\"42\") // 42'],\n      },\n      {\n        name: 'toboolean',\n        description: 'Convert a value to boolean',\n        signature: 'toboolean(value)',\n        returnType: 'boolean',\n        examples: ['toboolean(1) // true', 'toboolean(0) // false'],\n      },\n    ],\n    conditional: [\n      {\n        name: 'if',\n        description: 'Return one of two values based on a condition',\n        signature: 'if(condition, valueIfTrue, valueIfFalse)',\n        returnType: 'any',\n        examples: [\n          'if(stock > 0, \"Available\", \"Out of Stock\")',\n          'if(price > 100, price * 0.9, price)',\n        ],\n      },\n      {\n        name: 'coalesce',\n        description: 'Return the first non-null value',\n        signature: 'coalesce(value1, value2, ...)',\n        returnType: 'any',\n        examples: ['coalesce(nickname, name, \"Anonymous\")'],\n      },\n    ],\n  },\n\n  features: [\n    {\n      name: 'simple_refs',\n      description: 'Reference top-level fields by name',\n      minVersion: '1.0',\n      examples: ['price', 'quantity', 'baseDamage'],\n      dependenciesExtracted: ['[\"price\"]', '[\"quantity\"]', '[\"baseDamage\"]'],\n    },\n    {\n      name: 'arithmetic',\n      description: 'Basic math operations (+, -, *, /)',\n      minVersion: '1.0',\n      examples: ['price * 1.1', 'a + b - c', 'quantity * price'],\n    },\n    {\n      name: 'comparison',\n      description: 'Compare values (>, <, >=, <=, ==, !=)',\n      minVersion: '1.0',\n      examples: ['price > 100', 'x == 10', 'quantity >= 5'],\n    },\n    {\n      name: 'nested_path',\n      description: 'Access nested object properties using dot notation',\n      minVersion: '1.1',\n      examples: ['stats.damage', 'user.profile.name', 'item.metadata.category'],\n      dependenciesExtracted: ['[\"stats.damage\"]'],\n    },\n    {\n      name: 'array_index',\n      description:\n        'Access array elements by numeric index. Negative indices access from the end',\n      minVersion: '1.1',\n      examples: [\n        'items[0].price',\n        'inventory[1].quantity',\n        'items[-1].name  // last element',\n        'items[-2].price // second to last',\n      ],\n      dependenciesExtracted: ['[\"items[0].price\"]', '[\"items[-1].name\"]'],\n    },\n    {\n      name: 'root_path',\n      description:\n        'Absolute path reference starting with /. Always resolves from root data, even inside array item formulas',\n      minVersion: '1.1',\n      examples: [\n        '/taxRate',\n        '/config.tax',\n        'price * (1 + /taxRate)',\n        'price * /config.multiplier',\n      ],\n      dependenciesExtracted: ['[\"/taxRate\"]', '[\"/config.tax\"]'],\n    },\n    {\n      name: 'relative_path',\n      description:\n        'Relative path reference starting with ../. Each ../ goes up one level in the path hierarchy. Works with nested objects, arrays, and combinations. Supports accessing nested properties after the relative prefix (e.g., ../config.value)',\n      minVersion: '1.1',\n      examples: [\n        '../discount',\n        '../../rootRate',\n        '../config.multiplier',\n        'price * (1 - ../discount)',\n        'price * ../../globalRate',\n        'price * ../settings.tax.rate',\n      ],\n      dependenciesExtracted: [\n        '[\"../discount\"]',\n        '[\"../../rootRate\"]',\n        '[\"../config.multiplier\"]',\n      ],\n    },\n    {\n      name: 'function_named_fields',\n      description:\n        'Fields can have the same name as built-in functions (max, min, sum, etc.). Built-in functions are always checked first when a function call is made',\n      minVersion: '1.0',\n      examples: [\n        'max(max, 0)',\n        'min(min, 100)',\n        'max(max - field.min, 0)',\n        'round(round * 2)',\n      ],\n    },\n    {\n      name: 'bracket_notation',\n      description:\n        'Access fields containing hyphens using bracket notation with quotes. Required because \"field-name\" would be parsed as \"field minus name\" (subtraction). Works like JavaScript object[\"key\"] syntax.',\n      minVersion: '1.1',\n      examples: [\n        '[\"field-name\"]          // Without brackets: field - name (subtraction!)',\n        \"['field-name']          // Single quotes also work\",\n        '[\"field-one\"][\"field-two\"]',\n        'obj[\"field-name\"].value',\n        '[\"items-list\"][0][\"val\"]',\n        '[\"price-new\"] * 2',\n      ],\n      dependenciesExtracted: ['[\"field-name\"]', \"['field-name']\"],\n    },\n  ],\n\n  versionDetection: [\n    { feature: 'Simple refs, arithmetic, comparisons', minVersion: '1.0' },\n    { feature: 'Function-named fields (max(max, 0))', minVersion: '1.0' },\n    { feature: 'Nested paths (a.b)', minVersion: '1.1' },\n    { feature: 'Array index ([0], [-1])', minVersion: '1.1' },\n    { feature: 'Absolute paths (/field)', minVersion: '1.1' },\n    { feature: 'Relative paths (../field)', minVersion: '1.1' },\n    { feature: 'Bracket notation ([\"field-name\"])', minVersion: '1.1' },\n  ],\n\n  parseResult: {\n    description:\n      'The parser automatically detects the minimum required version',\n    interface: `interface ParseResult {\n  ast: ASTNode;           // Abstract syntax tree\n  dependencies: string[]; // List of field dependencies\n  features: string[];     // List of detected features\n  minVersion: string;     // Minimum required version (\"1.0\" or \"1.1\")\n}`,\n  },\n\n  examples: [\n    {\n      expression: 'price * quantity',\n      description: 'Calculate total from price and quantity',\n      result: 'number',\n    },\n    {\n      expression: 'firstName + \" \" + lastName',\n      description: 'Concatenate strings with space',\n      result: 'string',\n    },\n    {\n      expression: 'quantity > 0',\n      description: 'Check if in stock',\n      result: 'boolean',\n    },\n    {\n      expression: 'if(stock > 0, \"Available\", \"Out of Stock\")',\n      description: 'Conditional text based on stock',\n      result: 'string',\n    },\n    {\n      expression: 'price * (1 + taxRate)',\n      description: 'Price with tax',\n      result: 'number',\n    },\n    {\n      expression: 'items[0].price + items[1].price',\n      description: 'Sum first two item prices (v1.1)',\n      result: 'number',\n    },\n  ],\n\n  apiExamples: [\n    {\n      name: 'Simple Expression (v1.0)',\n      description: 'Parse a basic arithmetic expression',\n      code: `parseExpression('price * 1.1')\n// {\n//   minVersion: \"1.0\",\n//   features: [],\n//   dependencies: [\"price\"]\n// }`,\n    },\n    {\n      name: 'Nested Path (v1.1)',\n      description: 'Parse expression with nested object access',\n      code: `parseExpression('stats.damage * multiplier')\n// {\n//   minVersion: \"1.1\",\n//   features: [\"nested_path\"],\n//   dependencies: [\"stats.damage\", \"multiplier\"]\n// }`,\n    },\n    {\n      name: 'Array Access (v1.1)',\n      description: 'Parse expression with array index access',\n      code: `parseExpression('items[0].price + items[1].price')\n// {\n//   minVersion: \"1.1\",\n//   features: [\"array_index\", \"nested_path\"],\n//   dependencies: [\"items[0].price\", \"items[1].price\"]\n// }`,\n    },\n    {\n      name: 'Evaluate expressions',\n      description: 'Execute formulas with context data',\n      code: `evaluate('price * 1.1', { price: 100 })\n// 110\n\nevaluate('stats.damage', { stats: { damage: 50 } })\n// 50\n\nevaluate('items[0].price', { items: [{ price: 10 }] })\n// 10\n\nevaluate('price > 100', { price: 150 })\n// true\n\nevaluate('a + b * c', { a: 1, b: 2, c: 3 })\n// 7`,\n    },\n    {\n      name: 'Function-named fields',\n      description: 'Fields can have the same name as built-in functions',\n      code: `// Built-in functions take precedence in function calls\nevaluate('max(max, 0)', { max: 10 })\n// 10 (max() function, then max field)\n\nevaluate('max(max - field.min, 0)', { max: 100, field: { min: 20 } })\n// 80\n\nevaluate('round(round * 2)', { round: 3.7 })\n// 7\n\n// Field named \"sum\" doesn't conflict with sum() function\nevaluate('sum(values) + sum', { values: [1, 2, 3], sum: 10 })\n// 16`,\n    },\n    {\n      name: 'Evaluate with context (array items)',\n      description:\n        'Use evaluateWithContext() for array item formulas with path resolution',\n      code: `// Absolute path: /field always resolves from root\nevaluateWithContext('price * (1 + /taxRate)', {\n  rootData: { taxRate: 0.1, items: [{ price: 100 }] },\n  itemData: { price: 100 },\n  currentPath: 'items[0]'\n})\n// 110\n\n// Nested absolute path\nevaluateWithContext('price * /config.multiplier', {\n  rootData: { config: { multiplier: 1.5 }, items: [] },\n  itemData: { price: 100 },\n  currentPath: 'items[0]'\n})\n// 150\n\n// Relative path: ../field resolves from parent (root)\nevaluateWithContext('price * (1 - ../discount)', {\n  rootData: { discount: 0.2, items: [] },\n  itemData: { price: 100 },\n  currentPath: 'items[0]'\n})\n// 80\n\n// itemData takes precedence over rootData for same field\nevaluateWithContext('value + 10', {\n  rootData: { value: 100 },\n  itemData: { value: 50 },\n  currentPath: 'items[0]'\n})\n// 60`,\n    },\n    {\n      name: 'Relative paths - path resolution',\n      description:\n        'Understanding how ../ resolves based on currentPath. Each ../ goes up one segment (object property or array element counts as one segment)',\n      code: `// Path structure explanation:\n// currentPath splits by \".\" (dots), keeping array indices attached to field names\n// \"items[0]\" = 1 segment\n// \"items[0].inner\" = 2 segments: [\"items[0]\", \"inner\"]\n// \"container.items[0]\" = 2 segments: [\"container\", \"items[0]\"]\n\n// Single ../ from array item -> goes to root\n// currentPath: \"items[0]\" (1 segment)\n// ../ goes up 1 level -> root\nevaluateWithContext('price * ../discount', {\n  rootData: { discount: 0.2, items: [{ price: 100 }] },\n  itemData: { price: 100 },\n  currentPath: 'items[0]'\n})\n// Resolves ../discount to root.discount = 0.2\n// Result: 100 * 0.2 = 20\n\n// Single ../ from nested object in array -> goes to array item\n// currentPath: \"items[0].inner\" (2 segments)\n// ../ goes up 1 level -> \"items[0]\"\nevaluateWithContext('price * ../itemMultiplier', {\n  rootData: { items: [{ itemMultiplier: 3, inner: { price: 10 } }] },\n  itemData: { price: 10 },\n  currentPath: 'items[0].inner'\n})\n// Resolves ../itemMultiplier to items[0].itemMultiplier = 3\n// Result: 10 * 3 = 30\n\n// Double ../../ from nested object in array -> goes to root\n// currentPath: \"items[0].inner\" (2 segments)\n// ../../ goes up 2 levels -> root\nevaluateWithContext('price * ../../rootRate', {\n  rootData: { rootRate: 2, items: [{ inner: { price: 5 } }] },\n  itemData: { price: 5 },\n  currentPath: 'items[0].inner'\n})\n// Resolves ../../rootRate to root.rootRate = 2\n// Result: 5 * 2 = 10`,\n    },\n    {\n      name: 'Relative paths - nested arrays',\n      description:\n        'How relative paths work with arrays inside objects and nested arrays',\n      code: `// Array inside nested object\n// currentPath: \"container.items[0]\" (2 segments: [\"container\", \"items[0]\"])\n// ../ goes up 1 level -> \"container\"\nevaluateWithContext('price * ../containerRate', {\n  rootData: {\n    container: {\n      containerRate: 4,\n      items: [{ price: 5 }]\n    }\n  },\n  itemData: { price: 5 },\n  currentPath: 'container.items[0]'\n})\n// Resolves ../containerRate to container.containerRate = 4\n// Result: 5 * 4 = 20\n\n// ../../ from array inside object -> goes to root\n// currentPath: \"container.items[0]\" (2 segments)\n// ../../ goes up 2 levels -> root\nevaluateWithContext('price * ../../rootVal', {\n  rootData: {\n    rootVal: 6,\n    container: { items: [{ price: 5 }] }\n  },\n  itemData: { price: 5 },\n  currentPath: 'container.items[0]'\n})\n// Resolves ../../rootVal to root.rootVal = 6\n// Result: 5 * 6 = 30\n\n// Nested arrays: items[].subItems[]\n// currentPath: \"items[0].subItems[0]\" (2 segments: [\"items[0]\", \"subItems[0]\"])\n// ../ goes up 1 level -> \"items[0]\"\nevaluateWithContext('qty * ../itemPrice', {\n  rootData: {\n    items: [{ itemPrice: 10, subItems: [{ qty: 3 }] }]\n  },\n  itemData: { qty: 3 },\n  currentPath: 'items[0].subItems[0]'\n})\n// Resolves ../itemPrice to items[0].itemPrice = 10\n// Result: 3 * 10 = 30`,\n    },\n    {\n      name: 'Relative paths - accessing nested properties',\n      description:\n        'Relative paths can include nested property access after the ../ prefix',\n      code: `// ../sibling.nested accesses a sibling with nested property\n// currentPath: \"items[0].products[0]\" (2 segments)\n// ../ goes to \"items[0]\", then accesses .config.discount\nevaluateWithContext('price * ../config.discount', {\n  rootData: {\n    items: [{\n      config: { discount: 0.9 },\n      products: [{ price: 100 }]\n    }]\n  },\n  itemData: { price: 100 },\n  currentPath: 'items[0].products[0]'\n})\n// Resolves ../config.discount to items[0].config.discount = 0.9\n// Result: 100 * 0.9 = 90\n\n// Deep nested: ../../settings.tax.rate\nevaluateWithContext('amount * ../../settings.tax.rate', {\n  rootData: {\n    settings: { tax: { rate: 0.1 } },\n    orders: [{ items: [{ amount: 200 }] }]\n  },\n  itemData: { amount: 200 },\n  currentPath: 'orders[0].items[0]'\n})\n// Resolves ../../settings.tax.rate to root.settings.tax.rate = 0.1\n// Result: 200 * 0.1 = 20`,\n    },\n    {\n      name: 'Relative paths - complex nesting',\n      description: 'Complex scenarios with arrays inside objects inside arrays',\n      code: `// Array inside object inside array\n// Structure: items[].container.subItems[]\n// currentPath: \"items[0].container.subItems[0]\" (3 segments)\nevaluateWithContext('val * ../containerMultiplier', {\n  rootData: {\n    items: [{\n      container: {\n        containerMultiplier: 4,\n        subItems: [{ val: 3 }]\n      }\n    }]\n  },\n  itemData: { val: 3 },\n  currentPath: 'items[0].container.subItems[0]'\n})\n// ../ goes to \"items[0].container\"\n// Resolves ../containerMultiplier to items[0].container.containerMultiplier = 4\n// Result: 3 * 4 = 12\n\n// ../../ from same structure -> goes to array item\nevaluateWithContext('val * ../../itemRate', {\n  rootData: {\n    items: [{\n      itemRate: 5,\n      container: { subItems: [{ val: 2 }] }\n    }]\n  },\n  itemData: { val: 2 },\n  currentPath: 'items[0].container.subItems[0]'\n})\n// ../../ goes to \"items[0]\"\n// Resolves ../../itemRate to items[0].itemRate = 5\n// Result: 2 * 5 = 10\n\n// ../../../ from same structure -> goes to root\nevaluateWithContext('val * ../../../rootFactor', {\n  rootData: {\n    rootFactor: 3,\n    items: [{\n      container: { subItems: [{ val: 7 }] }\n    }]\n  },\n  itemData: { val: 7 },\n  currentPath: 'items[0].container.subItems[0]'\n})\n// ../../../ goes to root\n// Resolves ../../../rootFactor to root.rootFactor = 3\n// Result: 7 * 3 = 21`,\n    },\n  ],\n\n  schemaUsage: {\n    structure:\n      '{ \"x-formula\": { \"version\": 1, \"expression\": \"...\" }, \"readOnly\": true }',\n    fieldTypes: ['string', 'number', 'boolean'],\n    rules: [\n      'Add x-formula to string, number, or boolean field schema',\n      'readOnly: true is REQUIRED for fields with x-formula',\n      'Expression must reference existing fields in the same table',\n      'Circular dependencies are not allowed (a references b, b references a)',\n    ],\n  },\n};\n"]}

package/dist/index-CPsOPCQ6.d.cts

@@ -1,166 +0,0 @@
-interface XFormula {
-    version: 1;
-    expression: string;
-}
-type FormulaMinorVersion = '1.0' | '1.1';
-type FormulaFeature = 'nested_path' | 'array_index' | 'array_wildcard' | 'relative_path' | 'root_path' | 'context_token' | 'array_function' | 'bracket_notation';
-interface FormulaAnalysis {
-    minVersion: FormulaMinorVersion;
-    features: FormulaFeature[];
-    dependencies: string[];
-}
-type PathSegment = {
-    type: 'property';
-    name: string;
-} | {
-    type: 'index';
-    value: number;
-} | {
-    type: 'wildcard';
-} | {
-    type: 'parent';
-} | {
-    type: 'root';
-} | {
-    type: 'token';
-    name: string;
-};
-interface ParsedPath {
-    original: string;
-    segments: PathSegment[];
-    isAbsolute: boolean;
-    isRelative: boolean;
-}
-interface PathValidationResult {
-    isValid: boolean;
-    error?: string;
-    segments?: PathSegment[];
-}
-interface FormulaContext {
-    [fieldName: string]: unknown;
-}
-type FormulaResult = number | string | boolean | null;
-
-type ASTNode = NumberLiteral | StringLiteral | BooleanLiteral | NullLiteral | Identifier | BracketedIdentifier | RootPath | RelativePath | ContextToken | BinaryOp | UnaryOp | TernaryOp | CallExpression | MemberExpression | BracketedMemberExpression | IndexExpression | WildcardExpression;
-interface NumberLiteral {
-    type: 'NumberLiteral';
-    value: number;
-}
-interface StringLiteral {
-    type: 'StringLiteral';
-    value: string;
-}
-interface BooleanLiteral {
-    type: 'BooleanLiteral';
-    value: boolean;
-}
-interface NullLiteral {
-    type: 'NullLiteral';
-}
-interface Identifier {
-    type: 'Identifier';
-    name: string;
-}
-interface BracketedIdentifier {
-    type: 'BracketedIdentifier';
-    name: string;
-}
-interface RootPath {
-    type: 'RootPath';
-    path: string;
-}
-interface RelativePath {
-    type: 'RelativePath';
-    path: string;
-}
-interface ContextToken {
-    type: 'ContextToken';
-    name: string;
-}
-interface BinaryOp {
-    type: 'BinaryOp';
-    op: string;
-    left: ASTNode;
-    right: ASTNode;
-}
-interface UnaryOp {
-    type: 'UnaryOp';
-    op: string;
-    argument: ASTNode;
-}
-interface TernaryOp {
-    type: 'TernaryOp';
-    condition: ASTNode;
-    consequent: ASTNode;
-    alternate: ASTNode;
-}
-interface CallExpression {
-    type: 'CallExpression';
-    callee: ASTNode;
-    arguments: ASTNode[];
-}
-interface MemberExpression {
-    type: 'MemberExpression';
-    object: ASTNode;
-    property: string;
-}
-interface BracketedMemberExpression {
-    type: 'BracketedMemberExpression';
-    object: ASTNode;
-    property: string;
-}
-interface IndexExpression {
-    type: 'IndexExpression';
-    object: ASTNode;
-    index: ASTNode;
-}
-interface WildcardExpression {
-    type: 'WildcardExpression';
-    object: ASTNode;
-}
-
-interface ParseResult {
-    ast: ASTNode;
-    dependencies: string[];
-    features: FormulaFeature[];
-    minVersion: FormulaMinorVersion;
-}
-declare function parseFormula(expression: string): ParseResult;
-declare function validateSyntax(expression: string): {
-    isValid: true;
-} | {
-    isValid: false;
-    error: string;
-    position?: number;
-};
-declare function evaluate(expression: string, context: Record<string, unknown>): unknown;
-interface EvaluateContextOptions {
-    rootData: Record<string, unknown>;
-    itemData?: Record<string, unknown>;
-    currentPath?: string;
-}
-declare function evaluateWithContext(expression: string, options: EvaluateContextOptions): unknown;
-type InferredType = 'number' | 'boolean' | 'string' | 'unknown';
-interface FieldTypes {
-    [fieldName: string]: 'number' | 'string' | 'boolean' | 'object' | 'array';
-}
-declare function inferFormulaType(expression: string, fieldTypes?: FieldTypes): InferredType;
-
-interface ParsedExpression {
-    expression: string;
-    dependencies: string[];
-    minVersion: FormulaMinorVersion;
-    features: FormulaFeature[];
-}
-declare function parseExpression(expression: string): ParsedExpression;
-
-type SyntaxValidationResult = {
-    isValid: true;
-} | {
-    isValid: false;
-    error: string;
-    position?: number;
-};
-declare function validateFormulaSyntax(expression: string): SyntaxValidationResult;
-
-export { type ASTNode as A, type EvaluateContextOptions as E, type FieldTypes as F, type InferredType as I, type ParseResult as P, type SyntaxValidationResult as S, type XFormula as X, evaluateWithContext as a, parseExpression as b, type ParsedExpression as c, validateFormulaSyntax as d, evaluate as e, type FormulaMinorVersion as f, type FormulaFeature as g, type FormulaAnalysis as h, inferFormulaType as i, type PathSegment as j, type ParsedPath as k, type PathValidationResult as l, type FormulaContext as m, type FormulaResult as n, parseFormula as p, validateSyntax as v };

package/dist/index-CPsOPCQ6.d.ts

@@ -1,166 +0,0 @@
-interface XFormula {
-    version: 1;
-    expression: string;
-}
-type FormulaMinorVersion = '1.0' | '1.1';
-type FormulaFeature = 'nested_path' | 'array_index' | 'array_wildcard' | 'relative_path' | 'root_path' | 'context_token' | 'array_function' | 'bracket_notation';
-interface FormulaAnalysis {
-    minVersion: FormulaMinorVersion;
-    features: FormulaFeature[];
-    dependencies: string[];
-}
-type PathSegment = {
-    type: 'property';
-    name: string;
-} | {
-    type: 'index';
-    value: number;
-} | {
-    type: 'wildcard';
-} | {
-    type: 'parent';
-} | {
-    type: 'root';
-} | {
-    type: 'token';
-    name: string;
-};
-interface ParsedPath {
-    original: string;
-    segments: PathSegment[];
-    isAbsolute: boolean;
-    isRelative: boolean;
-}
-interface PathValidationResult {
-    isValid: boolean;
-    error?: string;
-    segments?: PathSegment[];
-}
-interface FormulaContext {
-    [fieldName: string]: unknown;
-}
-type FormulaResult = number | string | boolean | null;
-
-type ASTNode = NumberLiteral | StringLiteral | BooleanLiteral | NullLiteral | Identifier | BracketedIdentifier | RootPath | RelativePath | ContextToken | BinaryOp | UnaryOp | TernaryOp | CallExpression | MemberExpression | BracketedMemberExpression | IndexExpression | WildcardExpression;
-interface NumberLiteral {
-    type: 'NumberLiteral';
-    value: number;
-}
-interface StringLiteral {
-    type: 'StringLiteral';
-    value: string;
-}
-interface BooleanLiteral {
-    type: 'BooleanLiteral';
-    value: boolean;
-}
-interface NullLiteral {
-    type: 'NullLiteral';
-}
-interface Identifier {
-    type: 'Identifier';
-    name: string;
-}
-interface BracketedIdentifier {
-    type: 'BracketedIdentifier';
-    name: string;
-}
-interface RootPath {
-    type: 'RootPath';
-    path: string;
-}
-interface RelativePath {
-    type: 'RelativePath';
-    path: string;
-}
-interface ContextToken {
-    type: 'ContextToken';
-    name: string;
-}
-interface BinaryOp {
-    type: 'BinaryOp';
-    op: string;
-    left: ASTNode;
-    right: ASTNode;
-}
-interface UnaryOp {
-    type: 'UnaryOp';
-    op: string;
-    argument: ASTNode;
-}
-interface TernaryOp {
-    type: 'TernaryOp';
-    condition: ASTNode;
-    consequent: ASTNode;
-    alternate: ASTNode;
-}
-interface CallExpression {
-    type: 'CallExpression';
-    callee: ASTNode;
-    arguments: ASTNode[];
-}
-interface MemberExpression {
-    type: 'MemberExpression';
-    object: ASTNode;
-    property: string;
-}
-interface BracketedMemberExpression {
-    type: 'BracketedMemberExpression';
-    object: ASTNode;
-    property: string;
-}
-interface IndexExpression {
-    type: 'IndexExpression';
-    object: ASTNode;
-    index: ASTNode;
-}
-interface WildcardExpression {
-    type: 'WildcardExpression';
-    object: ASTNode;
-}
-
-interface ParseResult {
-    ast: ASTNode;
-    dependencies: string[];
-    features: FormulaFeature[];
-    minVersion: FormulaMinorVersion;
-}
-declare function parseFormula(expression: string): ParseResult;
-declare function validateSyntax(expression: string): {
-    isValid: true;
-} | {
-    isValid: false;
-    error: string;
-    position?: number;
-};
-declare function evaluate(expression: string, context: Record<string, unknown>): unknown;
-interface EvaluateContextOptions {
-    rootData: Record<string, unknown>;
-    itemData?: Record<string, unknown>;
-    currentPath?: string;
-}
-declare function evaluateWithContext(expression: string, options: EvaluateContextOptions): unknown;
-type InferredType = 'number' | 'boolean' | 'string' | 'unknown';
-interface FieldTypes {
-    [fieldName: string]: 'number' | 'string' | 'boolean' | 'object' | 'array';
-}
-declare function inferFormulaType(expression: string, fieldTypes?: FieldTypes): InferredType;
-
-interface ParsedExpression {
-    expression: string;
-    dependencies: string[];
-    minVersion: FormulaMinorVersion;
-    features: FormulaFeature[];
-}
-declare function parseExpression(expression: string): ParsedExpression;
-
-type SyntaxValidationResult = {
-    isValid: true;
-} | {
-    isValid: false;
-    error: string;
-    position?: number;
-};
-declare function validateFormulaSyntax(expression: string): SyntaxValidationResult;
-
-export { type ASTNode as A, type EvaluateContextOptions as E, type FieldTypes as F, type InferredType as I, type ParseResult as P, type SyntaxValidationResult as S, type XFormula as X, evaluateWithContext as a, parseExpression as b, type ParsedExpression as c, validateFormulaSyntax as d, evaluate as e, type FormulaMinorVersion as f, type FormulaFeature as g, type FormulaAnalysis as h, inferFormulaType as i, type PathSegment as j, type ParsedPath as k, type PathValidationResult as l, type FormulaContext as m, type FormulaResult as n, parseFormula as p, validateSyntax as v };

package/dist/index.d.cts

@@ -1,25 +0,0 @@
-import { A as ASTNode } from './index-CPsOPCQ6.cjs';
-export { E as EvaluateContextOptions, F as FieldTypes, h as FormulaAnalysis, m as FormulaContext, g as FormulaFeature, f as FormulaMinorVersion, n as FormulaResult, I as InferredType, P as ParseResult, c as ParsedExpression, k as ParsedPath, j as PathSegment, l as PathValidationResult, S as SyntaxValidationResult, X as XFormula, e as evaluate, a as evaluateWithContext, i as inferFormulaType, b as parseExpression, p as parseFormula, d as validateFormulaSyntax, v as validateSyntax } from './index-CPsOPCQ6.cjs';
-
-declare function serializeAst(ast: ASTNode): string;
-
-declare function replaceDependencies(ast: ASTNode, replacements: Record<string, string>): ASTNode;
-
-interface DependencyGraph {
-    nodes: Set<string>;
-    edges: Map<string, Set<string>>;
-}
-interface CircularDependencyResult {
-    hasCircular: boolean;
-    cycle: string[] | null;
-}
-interface TopologicalOrderResult {
-    success: boolean;
-    order: string[];
-    error?: string;
-}
-declare function buildDependencyGraph(dependencies: Record<string, string[]>): DependencyGraph;
-declare function detectCircularDependencies(graph: DependencyGraph): CircularDependencyResult;
-declare function getTopologicalOrder(graph: DependencyGraph): TopologicalOrderResult;
-
-export { ASTNode, type CircularDependencyResult, type DependencyGraph, type TopologicalOrderResult, buildDependencyGraph, detectCircularDependencies, getTopologicalOrder, replaceDependencies, serializeAst };

package/dist/index.js

@@ -1,111 +0,0 @@
-export { evaluate, evaluateWithContext, inferFormulaType, parseExpression, parseFormula, replaceDependencies, serializeAst, validateFormulaSyntax, validateSyntax } from './chunk-RMAHNB4D.js';
-
-// src/dependency-graph.ts
-function buildDependencyGraph(dependencies) {
-  const nodes = /* @__PURE__ */ new Set();
-  const edges = /* @__PURE__ */ new Map();
-  for (const [node, deps] of Object.entries(dependencies)) {
-    nodes.add(node);
-    edges.set(node, new Set(deps));
-    for (const dep of deps) {
-      nodes.add(dep);
-    }
-  }
-  return { nodes, edges };
-}
-function detectCircularDependencies(graph) {
-  const visited = /* @__PURE__ */ new Set();
-  const recursionStack = /* @__PURE__ */ new Set();
-  const path = [];
-  for (const node of graph.nodes) {
-    if (!visited.has(node)) {
-      const cycle = dfsVisit(node, graph, visited, recursionStack, path);
-      if (cycle) {
-        return { hasCircular: true, cycle };
-      }
-    }
-  }
-  return { hasCircular: false, cycle: null };
-}
-function dfsVisit(node, graph, visited, recursionStack, path) {
-  visited.add(node);
-  recursionStack.add(node);
-  path.push(node);
-  const deps = graph.edges.get(node);
-  if (deps) {
-    for (const dep of deps) {
-      if (!visited.has(dep)) {
-        const cycle = dfsVisit(dep, graph, visited, recursionStack, path);
-        if (cycle) {
-          return cycle;
-        }
-      } else if (recursionStack.has(dep)) {
-        const cycleStart = path.indexOf(dep);
-        return [...path.slice(cycleStart), dep];
-      }
-    }
-  }
-  path.pop();
-  recursionStack.delete(node);
-  return null;
-}
-function getTopologicalOrder(graph) {
-  const circularCheck = detectCircularDependencies(graph);
-  if (circularCheck.hasCircular && circularCheck.cycle) {
-    return {
-      success: false,
-      order: [],
-      error: `Circular dependency detected: ${circularCheck.cycle.join(" -> ")}`
-    };
-  }
-  const inDegree = initializeInDegree(graph);
-  const queue = findZeroInDegreeNodes(inDegree);
-  const order = processQueue(queue, graph, inDegree);
-  order.reverse();
-  return { success: true, order };
-}
-function initializeInDegree(graph) {
-  const inDegree = /* @__PURE__ */ new Map();
-  for (const node of graph.nodes) {
-    inDegree.set(node, 0);
-  }
-  for (const deps of graph.edges.values()) {
-    for (const dep of deps) {
-      inDegree.set(dep, (inDegree.get(dep) ?? 0) + 1);
-    }
-  }
-  return inDegree;
-}
-function findZeroInDegreeNodes(inDegree) {
-  const result = [];
-  for (const [node, degree] of inDegree) {
-    if (degree === 0) {
-      result.push(node);
-    }
-  }
-  return result;
-}
-function processQueue(queue, graph, inDegree) {
-  const order = [];
-  let head = 0;
-  while (head < queue.length) {
-    const node = queue[head];
-    head++;
-    order.push(node);
-    const deps = graph.edges.get(node);
-    if (deps) {
-      for (const dep of deps) {
-        const newDegree = (inDegree.get(dep) ?? 0) - 1;
-        inDegree.set(dep, newDegree);
-        if (newDegree === 0) {
-          queue.push(dep);
-        }
-      }
-    }
-  }
-  return order;
-}
-
-export { buildDependencyGraph, detectCircularDependencies, getTopologicalOrder };
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/dependency-graph.ts"],"names":[],"mappings":";;;AA8BO,SAAS,qBACd,YAAA,EACiB;AACjB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAE3C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA,EAAG;AACvD,IAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AACd,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,IAAI,GAAA,CAAI,IAAI,CAAC,CAAA;AAE7B,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,KAAA,CAAM,IAAI,GAAG,CAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAO,KAAA,EAAM;AACxB;AAYO,SAAS,2BACd,KAAA,EAC0B;AAC1B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAY;AACvC,EAAA,MAAM,OAAiB,EAAC;AAExB,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AACtB,MAAA,MAAM,QAAQ,QAAA,CAAS,IAAA,EAAM,KAAA,EAAO,OAAA,EAAS,gBAAgB,IAAI,CAAA;AACjE,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,OAAO,EAAE,WAAA,EAAa,IAAA,EAAM,KAAA,EAAM;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,WAAA,EAAa,KAAA,EAAO,KAAA,EAAO,IAAA,EAAK;AAC3C;AAEA,SAAS,QAAA,CACP,IAAA,EACA,KAAA,EACA,OAAA,EACA,gBACA,IAAA,EACiB;AACjB,EAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,EAAA,cAAA,CAAe,IAAI,IAAI,CAAA;AACvB,EAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AAEd,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AACjC,EAAA,IAAI,IAAA,EAAM;AACR,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AACrB,QAAA,MAAM,QAAQ,QAAA,CAAS,GAAA,EAAK,KAAA,EAAO,OAAA,EAAS,gBAAgB,IAAI,CAAA;AAChE,QAAA,IAAI,KAAA,EAAO;AACT,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF,CAAA,MAAA,IAAW,cAAA,CAAe,GAAA,CAAI,GAAG,CAAA,EAAG;AAClC,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AACnC,QAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,UAAU,GAAG,GAAG,CAAA;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAA,CAAK,GAAA,EAAI;AACT,EAAA,cAAA,CAAe,OAAO,IAAI,CAAA;AAC1B,EAAA,OAAO,IAAA;AACT;AAYO,SAAS,oBACd,KAAA,EACwB;AACxB,EAAA,MAAM,aAAA,GAAgB,2BAA2B,KAAK,CAAA;AACtD,EAAA,IAAI,aAAA,CAAc,WAAA,IAAe,aAAA,CAAc,KAAA,EAAO;AACpD,IAAA,OAAO;AAAA,MACL,OAAA,EAAS,KAAA;AAAA,MACT,OAAO,EAAC;AAAA,MACR,OAAO,CAAA,8BAAA,EAAiC,aAAA,CAAc,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,KAC1E;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,mBAAmB,KAAK,CAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,sBAAsB,QAAQ,CAAA;AAC5C,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,KAAA,EAAO,KAAA,EAAO,QAAQ,CAAA;AAEjD,EAAA,KAAA,CAAM,OAAA,EAAQ;AACd,EAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,KAAA,EAAM;AAChC;AAEA,SAAS,mBAAmB,KAAA,EAA6C;AACvE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AAEzC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACtB;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,CAAM,MAAA,EAAO,EAAG;AACvC,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,QAAA,CAAS,IAAI,GAAA,EAAA,CAAM,QAAA,CAAS,IAAI,GAAG,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IAChD;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAEA,SAAS,sBAAsB,QAAA,EAAyC;AACtE,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,QAAA,EAAU;AACrC,IAAA,IAAI,WAAW,CAAA,EAAG;AAChB,MAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAAA,IAClB;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,YAAA,CACP,KAAA,EACA,KAAA,EACA,QAAA,EACU;AACV,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,IAAI,IAAA,GAAO,CAAA;AAEX,EAAA,OAAO,IAAA,GAAO,MAAM,MAAA,EAAQ;AAC1B,IAAA,MAAM,IAAA,GAAO,MAAM,IAAI,CAAA;AACvB,IAAA,IAAA,EAAA;AACA,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAEf,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AACjC,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,QAAA,MAAM,SAAA,GAAA,CAAa,QAAA,CAAS,GAAA,CAAI,GAAG,KAAK,CAAA,IAAK,CAAA;AAC7C,QAAA,QAAA,CAAS,GAAA,CAAI,KAAK,SAAS,CAAA;AAC3B,QAAA,IAAI,cAAc,CAAA,EAAG;AACnB,UAAA,KAAA,CAAM,KAAK,GAAG,CAAA;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT","file":"index.js","sourcesContent":["export interface DependencyGraph {\n  nodes: Set<string>;\n  edges: Map<string, Set<string>>;\n}\n\nexport interface CircularDependencyResult {\n  hasCircular: boolean;\n  cycle: string[] | null;\n}\n\nexport interface TopologicalOrderResult {\n  success: boolean;\n  order: string[];\n  error?: string;\n}\n\n/**\n * Build a dependency graph from a dependencies map\n *\n * @param dependencies - Map of node names to their dependencies\n * @returns Dependency graph with nodes and edges\n *\n * @example\n * const graph = buildDependencyGraph({\n *   tax: ['price'],\n *   total: ['price', 'tax']\n * });\n * // graph.edges.get('tax') = Set(['price'])\n * // graph.edges.get('total') = Set(['price', 'tax'])\n */\nexport function buildDependencyGraph(\n  dependencies: Record<string, string[]>,\n): DependencyGraph {\n  const nodes = new Set<string>();\n  const edges = new Map<string, Set<string>>();\n\n  for (const [node, deps] of Object.entries(dependencies)) {\n    nodes.add(node);\n    edges.set(node, new Set(deps));\n\n    for (const dep of deps) {\n      nodes.add(dep);\n    }\n  }\n\n  return { nodes, edges };\n}\n\n/**\n * Detect first circular dependency in a dependency graph\n *\n * @param graph - Dependency graph\n * @returns Result with detected cycle (null if no cycle)\n *\n * @example\n * detectCircularDependencies(graph)\n * // { hasCircular: true, cycle: ['a', 'b', 'c', 'a'] }\n */\nexport function detectCircularDependencies(\n  graph: DependencyGraph,\n): CircularDependencyResult {\n  const visited = new Set<string>();\n  const recursionStack = new Set<string>();\n  const path: string[] = [];\n\n  for (const node of graph.nodes) {\n    if (!visited.has(node)) {\n      const cycle = dfsVisit(node, graph, visited, recursionStack, path);\n      if (cycle) {\n        return { hasCircular: true, cycle };\n      }\n    }\n  }\n\n  return { hasCircular: false, cycle: null };\n}\n\nfunction dfsVisit(\n  node: string,\n  graph: DependencyGraph,\n  visited: Set<string>,\n  recursionStack: Set<string>,\n  path: string[],\n): string[] | null {\n  visited.add(node);\n  recursionStack.add(node);\n  path.push(node);\n\n  const deps = graph.edges.get(node);\n  if (deps) {\n    for (const dep of deps) {\n      if (!visited.has(dep)) {\n        const cycle = dfsVisit(dep, graph, visited, recursionStack, path);\n        if (cycle) {\n          return cycle;\n        }\n      } else if (recursionStack.has(dep)) {\n        const cycleStart = path.indexOf(dep);\n        return [...path.slice(cycleStart), dep];\n      }\n    }\n  }\n\n  path.pop();\n  recursionStack.delete(node);\n  return null;\n}\n\n/**\n * Get topological order for formula evaluation\n *\n * @param graph - Dependency graph\n * @returns Ordered list of field names for evaluation\n *\n * @example\n * getTopologicalOrder(graph)\n * // { success: true, order: ['price', 'tax', 'total'] }\n */\nexport function getTopologicalOrder(\n  graph: DependencyGraph,\n): TopologicalOrderResult {\n  const circularCheck = detectCircularDependencies(graph);\n  if (circularCheck.hasCircular && circularCheck.cycle) {\n    return {\n      success: false,\n      order: [],\n      error: `Circular dependency detected: ${circularCheck.cycle.join(' -> ')}`,\n    };\n  }\n\n  const inDegree = initializeInDegree(graph);\n  const queue = findZeroInDegreeNodes(inDegree);\n  const order = processQueue(queue, graph, inDegree);\n\n  order.reverse();\n  return { success: true, order };\n}\n\nfunction initializeInDegree(graph: DependencyGraph): Map<string, number> {\n  const inDegree = new Map<string, number>();\n\n  for (const node of graph.nodes) {\n    inDegree.set(node, 0);\n  }\n\n  for (const deps of graph.edges.values()) {\n    for (const dep of deps) {\n      inDegree.set(dep, (inDegree.get(dep) ?? 0) + 1);\n    }\n  }\n\n  return inDegree;\n}\n\nfunction findZeroInDegreeNodes(inDegree: Map<string, number>): string[] {\n  const result: string[] = [];\n  for (const [node, degree] of inDegree) {\n    if (degree === 0) {\n      result.push(node);\n    }\n  }\n  return result;\n}\n\nfunction processQueue(\n  queue: string[],\n  graph: DependencyGraph,\n  inDegree: Map<string, number>,\n): string[] {\n  const order: string[] = [];\n  let head = 0;\n\n  while (head < queue.length) {\n    const node = queue[head]!;\n    head++;\n    order.push(node);\n\n    const deps = graph.edges.get(node);\n    if (deps) {\n      for (const dep of deps) {\n        const newDegree = (inDegree.get(dep) ?? 0) - 1;\n        inDegree.set(dep, newDegree);\n        if (newDegree === 0) {\n          queue.push(dep);\n        }\n      }\n    }\n  }\n\n  return order;\n}\n"]}