@fluidframework/matrix 2.0.0-dev.5.3.2.178189 → 2.0.0-dev.6.4.0.191258

package/dist/productSet.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"productSet.js","sourceRoot":"","sources":["../src/productSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;AAEH,qCAmBkB;AAmElB,MAAM,IAAI,GAAyC,EAAE,CAAC;AACtD,MAAM,GAAG,GAAG,CAAI,iBAAuC,EAAU,EAAE;IAClE,MAAM,IAAI,GAAqD,EAAE,CAAC;IAClE,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE;QACpD,MAAM,GAAG,GAAG,MAAiB,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,iBAAiB,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAC5C;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1C,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,IAAI,OAAO,KAAK,SAAS,EAAE;QAC1B,OAAO,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACnD,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;KACtB;IAED,OAAO,OAAO,CAAC;AAChB,CAAC,CAAC;AAEF,SAAS,QAAQ,CAAI,MAAyB;IAC7C,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;QACtC,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;YACtD,OAAO,GAAG,KAAK,CAAC;YAChB,MAAM;SACN;KACD;IACD,IAAI,OAAO,EAAE;QACZ,OAAO,cAAK,CAAC;KACb;IACD,OAAO,EAAE,UAAU,EAAE,IAAa,EAAE,MAAM,EAAE,CAAC;AAC9C,CAAC;AAED,SAAS,uBAAuB,CAAI,GAA4B;IAC/D,IAAI,GAAG,CAAC,UAAU,EAAE;QACnB,OAAO,CAAC,CAAC;KACT;IACD,OAAO,GAAG,CAAC,aAAa,CAAC;AAC1B,CAAC;AAED,MAAM,KAAK,GAAG,CACb,IAA6B,EAC7B,KAA8B,EAC9B,MAAyB,EACd,EAAE,CAAC,CAAC;IACf,UAAU,EAAE,KAAc;IAC1B,IAAI;IACJ,KAAK;IACL,MAAM;IACN,aAAa,EAAE,uBAAuB,CAAC,IAAI,CAAC,GAAG,uBAAuB,CAAC,KAAK,CAAC;CAC7E,CAAC,CAAC;AAEH,SAAS,aAAa,CACrB,iBAAuC,EACvC,IAAqC;IAErC,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,IAAI,CAAC,UAAU,EAAE;QACpB,IAAI,mBAAmB,GAAG,KAAK,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YAC3C,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;gBACjE,mBAAmB,GAAG,IAAI,CAAC;gBAC3B,MAAM;aACN;SACD;QACD,IAAI,CAAC,mBAAmB,EAAE;YACzB,OAAO,cAAK,CAAC;SACb;KACD;IACD,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;AACpC,CAAC;AAKD,SAAS,QAAQ,CAAI,GAAiC;IACrD,IAAI,GAAG,KAAK,SAAS,EAAE;QACtB,OAAO,cAAK,CAAC;KACb;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;kBAGkB;AAClB,MAAM,MAAM,GAAG;IACd,KAAK,CAAI,OAAmB;QAC3B,MAAM,iBAAiB,GAA2D,EAAE,CAAC;QACrF,MAAM,IAAI,GAAkD,EAAE,CAAC;QAC/D,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YAC1C,MAAM,GAAG,GAAG,MAAiB,CAAC;YAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACvD,MAAM,GAAG,GAA6B,OAAO,CAAC,GAAG,CAAC,CAAC;gBACnD,IAAI,GAAG,KAAK,cAAK,EAAE;oBAClB,OAAO,cAAK,CAAC;iBACb;gBACD,IAAI,GAAG,KAAK,cAAK,EAAE;oBAClB,SAAS;iBACT;gBAED,iBAAiB,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,aAAa,CAAC;gBAC3C,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;aACrB;SACD;QAED,OAAO,aAAa,CACnB,iBAAyC,EACzC,QAAQ,CAAC,IAAyB,CAAC,CACnC,CAAC;IACH,CAAC;IAED,cAAc,CACb,iBAAuC,EACvC,IAAuB,EACvB,KAAwB,EACxB,WAIuB;QAEvB,MAAM,GAAG,GAAkD,EAAE,CAAC;QAC9D,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE;YACpD,MAAM,GAAG,GAAG,MAAiB,CAAC;YAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;gBACjE,MAAM,QAAQ,GAAG,WAAW,CAC3B,iBAAiB,CAAC,GAAG,CAAC,EACtB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EACnB,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CACpB,CAAC;gBACF,IAAI,QAAQ,KAAK,cAAK,EAAE;oBACvB,OAAO,QAAQ,CAAC;iBAChB;gBACD,IAAI,QAAQ,KAAK,cAAK,EAAE;oBACvB,SAAS;iBACT;gBACD,GAAG,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;aACpB;SACD;QAED,OAAO,GAAwB,CAAC;IACjC,CAAC;IAED,wDAAwD;IACxD,QAAQ,CAA8C,MAAS,EAAE,GAAG,KAAY;QAC/E,MAAM,GAAG,GAAgC,EAAE,CAAC;QAC5C,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE;YACxB,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;gBACtD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;aAChB;SACD;QAED,OAAO,GAAyB,CAAC;IAClC,CAAC;IAED,kBAAkB,CACjB,iBAAwD,EACxD,MAA0C,EAC1C,IAAW;QAEX,MAAM,OAAO,GAA0D,EAAE,CAAC;QAC1E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACvB,MAAM,KAAK,GAAuC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC9D,OAAO,CAAC,GAAG,CAAC,GAAG,IAAA,oBAAW,EAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,cAAK,CAAC,CAAC;SACxF;QACD,OAAO,OAAsC,CAAC;IAC/C,CAAC;IAED,YAAY,CAA+B,IAAW;QACrD,MAAM,SAAS,GAAuC,EAAE,CAAC;QACzD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACvB,SAAS,CAAC,GAAG,CAAC,GAAG,cAAK,CAAC;SACvB;QACD,OAAO,SAAwC,CAAC;IACjD,CAAC;CACD,CAAC;AAEW,QAAA,iBAAiB,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAI3D,SAAS,UAAU,CAClB,iBAAuC,EACvC,IAAuB,EACvB,KAAwB;IAExB,MAAM,IAAI,GAAG,MAAM,CAAC,cAAc,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,EAAE,qBAAY,CAAC,CAAC;IACjF,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAC;KACzF;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CACvB,iBAAuC,EACvC,IAAuB,EACvB,KAAwB;IAExB,IAAI,GAAG,GAAkC,CAAC,CAAC;IAC3C,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE;QACpD,MAAM,GAAG,GAAG,MAAiB,CAAC;QAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;YACjE,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,aAAa,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YAE7C,GAAG,GAAG,IAAA,mBAAU,EAAC,GAAG,EAAE,IAAA,uBAAc,EAAmB,aAAa,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YAErF,IAAI,GAAG,KAAK,SAAS,EAAE;gBACtB,OAAO,SAAS,CAAC;aACjB;SACD;KACD;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,GAAG,EAAE;IAC/B,MAAM,KAAK,GAAuD,EAAE,CAAC;IACrE,OAAO,CACN,iBAAuC,EACvC,IAAiB,EACjB,KAAkB,EACwB,EAAE;QAC5C,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,KAAK,EAAE;YACjD,OAAO,KAAK,CAAC,GAA2C,CAAC;SACzD;QACD,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QAEpB,MAAM,GAAG,GAAG,eAAe,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1E,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;SAC7C;QACD,IAAI,kBAAuC,CAAC;QAE5C,iEAAiE;QACjE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAgB,CAAC;QAC9D,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;YAC1B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;gBACjE,MAAM,SAAS,GAAG,IAAA,uBAAc,EAC/B,iBAAiB,CAAC,GAAG,CAAC,EACtB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAC1B,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAC3B,CAAC;gBACF,IAAI,SAAS,KAAK,CAAC,EAAE;oBACpB,IAAI,kBAAkB,KAAK,SAAS,EAAE;wBACrC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;qBAC/B;oBAED,kBAAkB,GAAG,GAAG,CAAC;iBACzB;aACD;SACD;QAED,IAAI,kBAAkB,KAAK,SAAS,EAAE;YACrC,MAAM,MAAM,GAAG,IAAA,qBAAY,EAC1B,iBAAiB,CAAC,kBAAkB,CAAC,EACrC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,EACzC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAC1C,CAAC;YACF,IAAI,MAAM,KAAK,cAAK,EAAE;gBACrB,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,cAAK,CAAC,CAAC;aAC3B;YACD,IAAI,MAAM,KAAK,cAAK,EAAE;gBACrB,qEAAqE;gBACrE,0DAA0D;gBAC1D,MACC,KAAA,IAAI,CAAC,MAAM,EADJ,KAAC,kBAAmB,EAAE,OAAO,SAAA,EAAK,mCAAmC,cAAvE,uCAAyE,CACnE,CAAC;gBACb,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAU,mCAAmC,CAAC,CAAC,CAAC;aAC5E;YAED,MAAM,SAAS,mCACX,IAAI,CAAC,MAAM,KACd,CAAC,kBAAkB,CAAC,EAAE,MAAM,GAC5B,CAAC;YACF,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;SACzC;QAED,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;IAChC,CAAC,CAAC;AACH,CAAC,CAAC,EAAE,CAAC;AAEL,SAAS,eAAe,CACvB,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B;IAE3B,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IAED,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE;QAC1C,OAAO,KAAK,CAAI,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;KACvF;IAED,MAAM,gBAAgB,GAAG,iBAAiB,CAAI,iBAAiB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAE9E,IAAI,gBAAgB,KAAK,SAAS,EAAE;QACnC,OAAO,gBAAgB,CAAC;KACxB;IACD,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,cAAc,CACtB,iBAAuC,EACvC,GAA4B,EAC5B,GAAG,IAAW;IAEd,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC;IACpD,IAAI,GAAG,CAAC,UAAU,EAAE;QACnB,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC;KACxB;IAED,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;IACpE,IAAI,MAAM,KAAK,cAAK,EAAE;QACrB,OAAO,cAAK,CAAC;KACb;IACD,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACrE,OAAO,eAAe,CAAC,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAC3D,CAAC;AAED,SAAgB,OAAO,CACtB,GAAkB,EAClB,GAAG,IAAW;IAEd,IAAI,GAAG,KAAK,cAAK,IAAI,GAAG,KAAK,cAAK,EAAE;QACnC,OAAO,GAAG,CAAC;KACX;IACD,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,iBAAiB,EAAE,GAAG,IAAI,CAAC,CAAC;IAC1E,MAAM,IAAI,GAAG,cAAc,CAAC,iBAAiB,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;IAClE,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,OAAO,aAAa,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;AAC/C,CAAC;AAbD,0BAaC;AAED,SAAS,QAAQ,CAAI,iBAAuC,EAAE,UAAkB;IAC/E,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,EAAE;QACtC,OAAO,UAAU,CAAC,QAAQ,CAAC;KAC3B;IACD,MAAM,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,UAAU,CAAC;IAC1C,IAAI,UAA+B,CAAC;IACpC,IAAI,aAAa,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,iEAAiE;IACjE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAgB,CAAC;IAC9D,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QAC1B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;YACjE,MAAM,IAAI,GAAuB,aAAa,CAAC,GAAG,CAAC,CAAC;YACpD,MAAM,mBAAmB,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE;gBACvB,UAAU,GAAG,GAAG,CAAC;gBACjB,aAAa,GAAG,mBAAmB,CAAC,GAAG,CAAC;gBACxC,MAAM;aACN;YAED,IAAI,IAAI,GAAG,WAAW,EAAE;gBACvB,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxC,IAAI,YAAY,KAAK,cAAK,EAAE;oBAC3B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;iBACxD;gBACD,IAAI,GAAG,GAAG,mBAAmB,CAAC,GAAG,CAAC;gBAClC,IAAI,YAAY,KAAK,cAAK,EAAE;oBAC3B,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE;wBAC1B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;qBAC7D;oBAED,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC;iBACvB;gBACD,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;oBACvC,SAAS;iBACT;gBACD,UAAU,GAAG,GAAG,CAAC;gBACjB,WAAW,GAAG,IAAI,CAAC;gBACnB,aAAa,GAAG,GAAG,CAAC;aACpB;SACD;KACD;IAED,IAAI,UAAU,KAAK,SAAS,IAAI,aAAa,KAAK,SAAS,EAAE;QAC5D,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;KAC1D;IAED,MAAM,aAAa,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAEpD,MAAM,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACxF,MAAM,GAAG,GAAgC;QACxC;YACC,GAAG,kCACC,GAAG,KACN,CAAC,UAAU,CAAC,EAAE,IAAA,aAAI,EAAmB,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,OAAO,CAAC,GAC/E;YACD,aAAa,kCAAO,aAAa,KAAE,CAAC,UAAU,CAAC,EAAE,QAAQ,GAAE;YAC3D,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;SAC3B;QACD;YACC,GAAG,kCACC,GAAG,KACN,CAAC,UAAU,CAAC,EAAE,IAAA,aAAI,EAAmB,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,QAAQ,CAAC,GAChF;YACD,aAAa,kCAAO,aAAa,KAAE,CAAC,UAAU,CAAC,EAAE,SAAS,GAAE;YAC5D,KAAK,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;SAC3B;KACD,CAAC;IACF,IAAI,UAAU,CAAC,KAAK,GAAG,EAAE,EAAE;QAC1B,UAAU,CAAC,QAAQ,GAAG,GAAG,CAAC;KAC1B;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,gBAAgB,CACxB,iBAAuC,EACvC,GAAyB,EACzB,UAA6B,EAC7B,WAA8B;IAE9B,IAAI,GAAG,KAAK,cAAK,EAAE;QAClB,OAAO,CAAC,cAAK,EAAE,cAAK,CAAC,CAAC;KACtB;IACD,IAAI,GAAG,KAAK,cAAK,EAAE;QAClB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC;KACrD;IACD,MAAM,GAAG,GAAG,eAAe,CAAC,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAEvE,sEAAsE;IACtE,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,IAAI,CAAC,EAAE;QAClC,OAAO,CAAC,GAAG,EAAE,cAAK,CAAC,CAAC;KACpB;IAED,MAAM,aAAa,GAAG,MAAM,CAAC,cAAc,CAC1C,iBAAiB,EACjB,GAAG,CAAC,MAAM,EACV,UAAU,EACV,yBAAgB,CAChB,CAAC;IAEF,gGAAgG;IAChG,IAAI,aAAa,KAAK,cAAK,EAAE;QAC5B,OAAO,CAAC,cAAK,EAAE,GAAG,CAAC,CAAC;KACpB;IAED,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,CAC3C,iBAAiB,EACjB,GAAG,CAAC,MAAM,EACV,WAAW,EACX,yBAAgB,CAChB,CAAC;IACF,IAAI,GAAG,CAAC,UAAU,EAAE;QACnB,OAAO;YACN,QAAQ,CAAC,aAAa,CAAC;YACvB,cAAc,KAAK,cAAK,CAAC,CAAC,CAAC,cAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC;SAC3D,CAAC;KACF;IAED,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,gBAAgB,CAAC,iBAAiB,EAAE,GAAG,CAAC,IAAI,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;IACxF,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,gBAAgB,CAAC,iBAAiB,EAAE,GAAG,CAAC,KAAK,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;IACzF,OAAO,CAAC,eAAe,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AACjG,CAAC;AAED,MAAM,UAAU,GAAG,CAClB,iBAAuC,EACvC,GAAyB,EACzB,EAAE,GAAG,EAAE,UAAU,EAAU,EAC3B,EAAE,GAAG,EAAE,WAAW,EAAU,EACuB,EAAE;IACrD,OAAO,gBAAgB,CAAC,iBAAiB,EAAE,GAAG,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;AAC1E,CAAC,CAAC;AAEF,SAAS,OAAO,CACf,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B,EAC3B,UAAkB,EAClB,SAKyB;IAEzB,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,iBAAiB,EAAE,UAAU,CAAC,CAAC;IACpE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,iBAAiB,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACxE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,iBAAiB,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEzE,MAAM,MAAM,GAAG,SAAS,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IAC7D,IAAI,MAAM,KAAK,cAAK,EAAE;QACrB,OAAO,cAAK,CAAC;KACb;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC9D,OAAO,eAAe,CAAC,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,mBAAmB,CAC3B,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B,EAC3B,UAAkB;IAElB,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,EAAE;QACxC,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3E,IAAI,gBAAgB,KAAK,SAAS,EAAE;YACnC,OAAO,gBAAgB,CAAC;SACxB;KACD;IAED,OAAO,OAAO,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,mBAAmB,CAAC,CAAC;AACjF,CAAC;AAED,SAAgB,YAAY,CAC3B,IAAmB,EACnB,KAAoB;IAEpB,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,MAAM,iBAAiB,mCAAQ,IAAI,CAAC,iBAAiB,GAAK,KAAK,CAAC,iBAAiB,CAAE,CAAC;IACpF,MAAM,GAAG,GAAG,mBAAmB,CAC9B,iBAAiB,EACjB,IAAI,CAAC,IAAI,EACT,KAAK,CAAC,IAAI,EACV,GAAG,CAAC,iBAAiB,CAAC,CACtB,CAAC;IACF,IAAI,GAAG,KAAK,cAAK,EAAE;QAClB,OAAO,GAAG,CAAC;KACX;IACD,OAAO,aAAa,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AA3BD,oCA2BC;AAED,SAAS,uBAAuB,CAC/B,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B,EAC3B,UAAkB;IAElB,IAAI,IAAI,KAAK,cAAK,IAAI,KAAK,KAAK,cAAK,EAAE;QACtC,OAAO,cAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,EAAE;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAChC,iBAAiB,EACjB,IAAI,CAAC,MAAM,EACX,KAAK,CAAC,MAAM,EACZ,yBAAgB,CAChB,CAAC;QACF,IAAI,GAAG,KAAK,cAAK,EAAE;YAClB,OAAO,cAAK,CAAC;SACb;QACD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC;KACrB;IAED,OAAO,OAAO,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,uBAAuB,CAAC,CAAC;AACrF,CAAC;AAED,SAAgB,gBAAgB,CAC/B,IAAmB,EACnB,KAAoB;IAEpB,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,iBAAiB,mCAAQ,IAAI,CAAC,iBAAiB,GAAK,KAAK,CAAC,iBAAiB,CAAE,CAAC;IACpF,MAAM,GAAG,GAAG,uBAAuB,CAClC,iBAAiB,EACjB,IAAI,CAAC,IAAI,EACT,KAAK,CAAC,IAAI,EACV,GAAG,CAAC,iBAAiB,CAAC,CACtB,CAAC;IACF,IAAI,GAAG,KAAK,cAAK,EAAE;QAClB,OAAO,GAAG,CAAC;KACX;IACD,OAAO,aAAa,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AA5BD,4CA4BC;AAED,SAAS,kBAAkB,CAC1B,iBAAuC,EACvC,IAAiB,EACjB,KAAkB;IAElB,MAAM,GAAG,GAAG,eAAe,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1E,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE;QAC5B,OAAO,cAAK,CAAC;KACb;IACD,IAAI,qBAA0C,CAAC;IAC/C,iEAAiE;IACjE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAgB,CAAC;IAC9D,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QAC1B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;YACjE,MAAM,SAAS,GAAG,IAAA,uBAAc,EAC/B,iBAAiB,CAAC,GAAG,CAAC,EACtB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAC1B,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAC3B,CAAC;YACF,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG,CAAC,EAAE;gBAC7C,IAAI,qBAAqB,KAAK,SAAS,EAAE;oBACxC,OAAO,SAAS,CAAC;iBACjB;gBAED,qBAAqB,GAAG,GAAG,CAAC;aAC5B;SACD;KACD;IAED,IAAI,qBAAqB,KAAK,SAAS,EAAE;QACxC,MAAM,MAAM,GAAG,IAAA,sBAAa,EAC3B,iBAAiB,CAAC,qBAAqB,CAAC,EACxC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,EAC5C,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAC7C,CAAC;QAEF,IAAI,MAAM,KAAK,cAAK,EAAE;YACrB,OAAO,cAAK,CAAC;SACb;QACD,IAAI,MAAM,KAAK,cAAK,EAAE;YACrB,qEAAqE;YACrE,0DAA0D;YAC1D,MACC,KAAA,IAAI,CAAC,MAAM,EADJ,KAAC,qBAAsB,EAAE,OAAO,SAAA,EAAK,mCAAmC,cAA1E,uCAA4E,CACtE,CAAC;YACb,OAAO,QAAQ,CAAU,mCAAmC,CAAC,CAAC;SAC9D;QACD,MAAM,SAAS,mCACX,IAAI,CAAC,MAAM,KACd,CAAC,qBAAqB,CAAC,EAAE,MAAM,GAC/B,CAAC;QACF,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC;KAC3B;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAC5B,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B,EAC3B,UAAkB;IAElB,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,cAAK,CAAC;KACb;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IAED,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,OAAO,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,oBAAoB,CAAC,CAAC;KACjF;IAED,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,EAAE;QACxC,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5E,IAAI,gBAAgB,KAAK,SAAS,EAAE;YACnC,OAAO,gBAAgB,CAAC;SACxB;KACD;IAED,OAAO,OAAO,CAAC,iBAAiB,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,oBAAoB,CAAC,CAAC;AAClF,CAAC;AAED,SAAgB,aAAa,CAC5B,IAAmB,EACnB,KAAoB;IAEpB,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,cAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,MAAM,SAAS,GAAG,oBAAoB,CACrC,KAAK,CAAC,iBAAiB,EACvB,cAAK,EACL,KAAK,CAAC,IAAI,EACV,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAC5B,CAAC;QACF,IAAI,SAAS,KAAK,cAAK,EAAE;YACxB,OAAO,SAAS,CAAC;SACjB;QACD,OAAO,aAAa,CAAC,KAAK,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;KACzD;IAED,MAAM,iBAAiB,mCAAQ,IAAI,CAAC,iBAAiB,GAAK,KAAK,CAAC,iBAAiB,CAAE,CAAC;IACpF,MAAM,GAAG,GAAG,oBAAoB,CAC/B,iBAAiB,EACjB,IAAI,CAAC,IAAI,EACT,KAAK,CAAC,IAAI,EACV,GAAG,CAAC,iBAAiB,CAAC,CACtB,CAAC;IACF,IAAI,GAAG,KAAK,cAAK,EAAE;QAClB,OAAO,GAAG,CAAC;KACX;IACD,OAAO,aAAa,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AArCD,sCAqCC;AAED,SAAS,qBAAqB,CAC7B,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B,EAC3B,WAAmB;IAEnB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,IAAI,KAAK,KAAK,cAAK,EAAE;YACpB,OAAO,CAAC,CAAC;SACT;QAED,OAAO,CAAC,CAAC;KACT;IAED,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,IAAI,IAAI,CAAC,UAAU,EAAE;QACpB,IAAI,KAAK,CAAC,UAAU,EAAE;YACrB,OAAO,eAAe,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;SACrE;KACD;IAED,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAC;IACrE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,iBAAiB,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACxE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,iBAAiB,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEzE,MAAM,OAAO,GAAG,qBAAqB,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IAC1E,IAAI,OAAO,KAAK,SAAS,EAAE;QAC1B,OAAO,SAAS,CAAC;KACjB;IACD,OAAO,IAAA,mBAAU,EAAC,OAAO,EAAE,qBAAqB,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;AACxF,CAAC;AAED,SAAgB,cAAc,CAC7B,IAAmB,EACnB,KAAoB;IAEpB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,cAAK,EAAE;QACnB,IAAI,KAAK,KAAK,cAAK,EAAE;YACpB,OAAO,CAAC,CAAC;SACT;QAED,OAAO,CAAC,CAAC;KACT;IAED,IAAI,KAAK,KAAK,cAAK,EAAE;QACpB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,MAAM,iBAAiB,mCAAQ,IAAI,CAAC,iBAAiB,GAAK,KAAK,CAAC,iBAAiB,CAAE,CAAC;IACpF,OAAO,qBAAqB,CAAC,iBAAiB,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC;AAChG,CAAC;AA9BD,wCA8BC;AAED,SAAS,aAAa,CACrB,iBAAuC,EACvC,IAAuB,EACvB,KAAwB;IAExB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE;QACpD,MAAM,GAAG,GAAG,MAAiB,CAAC;QAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,GAAG,CAAC,EAAE;YACjE,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,aAAa,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAA,qBAAY,EAAmB,aAAa,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE;gBACjE,OAAO,KAAK,CAAC;aACb;SACD;KACD;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAC3B,iBAAuC,EACvC,IAA0B,EAC1B,KAA2B,EAC3B,WAAmB;IAEnB,IAAI,IAAI,KAAK,cAAK,IAAI,KAAK,KAAK,cAAK,EAAE;QACtC,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,IAAI,KAAK,KAAK,cAAK,EAAE;QACtC,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,CAAC,aAAa,CAAC,iBAAiB,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE;QACjE,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,EAAE;QACxC,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAC;IACrE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,iBAAiB,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACxE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,iBAAiB,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEzE,OAAO,CACN,mBAAmB,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC;QACvD,mBAAmB,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CACxD,CAAC;AACH,CAAC;AAED,SAAgB,YAAY,CAC3B,IAAmB,EACnB,KAAoB;IAEpB,IAAI,IAAI,KAAK,cAAK,IAAI,KAAK,KAAK,cAAK,EAAE;QACtC,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,cAAK,IAAI,KAAK,KAAK,cAAK,EAAE;QACtC,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,iBAAiB,mCAAQ,IAAI,CAAC,iBAAiB,GAAK,KAAK,CAAC,iBAAiB,CAAE,CAAC;IACpF,OAAO,mBAAmB,CAAC,iBAAiB,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC;AAC9F,CAAC;AAbD,oCAaC;AAEM,MAAM,iBAAiB,GAAG,CAAI,GAAkB,EAAE,EAAE,CAAC,aAAa,CAAC,cAAK,EAAE,GAAG,CAAC,CAAC;AAAzE,QAAA,iBAAiB,qBAAwD;AAE/E,MAAM,oBAAoB,GAAG,CAAI,IAAmB,EAAE,KAAoB,EAAE,EAAE,CACpF,YAAY,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AADzD,QAAA,oBAAoB,wBACqC;AAEtE,SAAgB,YAAY,CAAI,GAAkB;IACjD,IAAI,GAAG,KAAK,cAAK,IAAI,GAAG,KAAK,cAAK,EAAE;QACnC,OAAO,EAAE,CAAC;KACV;IACD,MAAM,GAAG,GAAwB,EAAE,CAAC;IACpC,SAAS,IAAI,CAAC,IAA6B;QAC1C,IAAI,IAAI,CAAC,UAAU,EAAE;YACpB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtB,OAAO;SACP;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,GAAG,CAAC;AACZ,CAAC;AAjBD,oCAiBC;AAED,SAAgB,cAAc,CAC7B,GAAkB,EAClB,CAAoD,EACpD,GAAG,IAAW;IAEd,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;IACrC,IAAI,MAAM,KAAK,cAAK,EAAE;QACrB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,MAAM,KAAK,cAAK,EAAE;QACrB,OAAO,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;KACpC;IAED,MAAM,EAAE,iBAAiB,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC;IAE3C,SAAS,IAAI,CAAC,UAAmC;QAChD,IAAI,UAAU,CAAC,UAAU,EAAE;YAC1B,OAAO,CAAC,CAAC,MAAM,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;SAChF;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;AACnB,CAAC;AAvBD,wCAuBC;AAED,SAAgB,gBAAgB,CAAI,GAAkB;IACrD,IAAI,GAAG,KAAK,cAAK,IAAI,GAAG,KAAK,cAAK,EAAE;QACnC,OAAO,CAAC,CAAC;KACT;IACD,OAAO,uBAAuB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC1C,CAAC;AALD,4CAKC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tBspSet,\n\tempty,\n\tdense,\n\tEmpty,\n\tDense,\n\tcombineCmp,\n\tSetOperations,\n\tintersectUntyped,\n\tcompareUntyped,\n\tCachable,\n\tUntypedBspSet,\n\tunionUntyped,\n\texceptUntyped,\n\tlazy,\n\tUntypedSparse,\n\tfromUntyped,\n\tmeetsUntyped,\n\tPair,\n} from \"./bspSet\";\n\ntype Restrict<T, Props extends (keyof T)[]> = { [Prop in Props[number]]: T[Prop] };\n\nexport type Product<T> = {\n\treadonly [dim in keyof T]: T[dim] extends BspSet<infer _TKey, infer _TId> ? T[dim] : never;\n};\n\ntype UntypedProduct<T> = {\n\treadonly [dim in keyof T]?: T[dim] extends BspSet<infer TKey, infer _TId>\n\t\t? UntypedSparse<TKey>\n\t\t: never;\n};\n\ntype Probabilities<T> = { readonly [dim in keyof T]?: number };\n\ntype ProductOperations<T> = {\n\treadonly [dim in keyof T]: T[dim] extends BspSet<infer TKey, infer TId>\n\t\t? SetOperations<TKey, TId>\n\t\t: never;\n};\n\n/** Given a cartesian product, a subspace is a subset of said space, such that it is also a cartesian product\n * and all the dimensions form subsets of the original cartesian product.\n *\n * This is a generalized notion of something like hyper-rectangles. Examples include:\n * - Rectangles\n * - Individual cells in a grid\n * - Rectangular ranges with missing rows and/or columns\n *\n * For the actual definition and properties, please read the document about *Operations on Cartesian Products*.\n */\ninterface Subspace<T> {\n\treadonly isSubspace: true;\n\t// isCoSubspace: boolean;\n\treadonly bounds: UntypedProduct<T>;\n}\n\n// type CoSubspace<T> = {\n//   isSubspace: boolean;\n//   isCoSubspace: true;\n//   subspace: Product<T>;\n// };\n\ninterface Union<T> {\n\treadonly isSubspace: false;\n\t// readonly isCoSubspace: false;\n\treadonly left: UntypedSparseProduct<T>;\n\treadonly right: UntypedSparseProduct<T>;\n\treadonly bounds: UntypedProduct<T>;\n\treadonly subspaceCount: number;\n}\n\ntype UntypedSparseProduct<T> = Subspace<T> | Union<T>; // | CoSubspace<T>;\n\ninterface SparseProduct<T> {\n\treadonly productOperations: ProductOperations<T>;\n\treadonly root: UntypedSparseProduct<T>;\n}\n\ninterface Box<T> {\n\tbox: UntypedProduct<T>;\n\tprobabilities: Probabilities<T>;\n\tchildren?: Pair<Box<T>>;\n\tdepth: number;\n}\n\nconst tops: { [poKey in string]?: Box<unknown> } = {};\nconst top = <T>(productOperations: ProductOperations<T>): Box<T> => {\n\tconst dims: [keyof T, ProductOperations<T>[keyof T][\"id\"]][] = [];\n\tfor (const dimStr of Object.keys(productOperations)) {\n\t\tconst dim = dimStr as keyof T;\n\t\tdims.push([dim, productOperations[dim].id]);\n\t}\n\n\tconst poKey = JSON.stringify(dims.sort());\n\tlet currTop = tops[poKey];\n\tif (currTop === undefined) {\n\t\tcurrTop = { box: {}, probabilities: {}, depth: 1 };\n\t\ttops[poKey] = currTop;\n\t}\n\n\treturn currTop;\n};\n\nfunction subspace<T>(bounds: UntypedProduct<T>): Subspace<T> | Dense {\n\tlet isDense = true;\n\tfor (const dim of Object.keys(bounds)) {\n\t\tif (Object.prototype.hasOwnProperty.call(bounds, dim)) {\n\t\t\tisDense = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (isDense) {\n\t\treturn dense;\n\t}\n\treturn { isSubspace: true as const, bounds };\n}\n\nfunction getUntypedSubspaceCount<T>(set: UntypedSparseProduct<T>) {\n\tif (set.isSubspace) {\n\t\treturn 1;\n\t}\n\treturn set.subspaceCount;\n}\n\nconst union = <T>(\n\tleft: UntypedSparseProduct<T>,\n\tright: UntypedSparseProduct<T>,\n\tbounds: UntypedProduct<T>,\n): Union<T> => ({\n\tisSubspace: false as const,\n\tleft,\n\tright,\n\tbounds,\n\tsubspaceCount: getUntypedSubspaceCount(left) + getUntypedSubspaceCount(right),\n});\n\nfunction sparseProduct<T>(\n\tproductOperations: ProductOperations<T>,\n\troot: UntypedSparseProduct<T> | Dense,\n): SparseProduct<T> | Dense {\n\tif (root === dense) {\n\t\treturn root;\n\t}\n\tif (root.isSubspace) {\n\t\tlet hasSparseDimensions = false;\n\t\tfor (const dim of Object.keys(root.bounds)) {\n\t\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\t\thasSparseDimensions = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!hasSparseDimensions) {\n\t\t\treturn dense;\n\t\t}\n\t}\n\treturn { productOperations, root };\n}\n\ntype UntypedProductSet<T> = Empty | Dense | UntypedSparseProduct<T>;\nexport type ProductSet<T> = Empty | Dense | SparseProduct<T>;\n\nfunction toBspSet<T>(set: UntypedBspSet<T> | undefined) {\n\tif (set === undefined) {\n\t\treturn dense;\n\t}\n\treturn set;\n}\n\n/** An object that contains all downcasts. The operations in here are generally of the kind that need dynamic\n * features, i.e. iterate over the object properties somehow. Their *usage* can be considered safe, but they warrant\n * more careful review whenever a change occurs, because we get less support from the type system and we are\n * downcasting. */\nconst unsafe = {\n\tunzip<T>(product: Product<T>): ProductSet<T> {\n\t\tconst productOperations: { [dim in keyof T]?: SetOperations<unknown, unknown> } = {};\n\t\tconst root: { [dim in keyof T]?: UntypedSparse<unknown> } = {};\n\t\tfor (const dimStr of Object.keys(product)) {\n\t\t\tconst dim = dimStr as keyof T;\n\t\t\tif (Object.prototype.hasOwnProperty.call(product, dim)) {\n\t\t\t\tconst set: BspSet<unknown, unknown> = product[dim];\n\t\t\t\tif (set === empty) {\n\t\t\t\t\treturn empty;\n\t\t\t\t}\n\t\t\t\tif (set === dense) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tproductOperations[dim] = set.setOperations;\n\t\t\t\troot[dim] = set.root;\n\t\t\t}\n\t\t}\n\n\t\treturn sparseProduct(\n\t\t\tproductOperations as ProductOperations<T>,\n\t\t\tsubspace(root as UntypedProduct<T>),\n\t\t);\n\t},\n\n\tcombineProduct<T>(\n\t\tproductOperations: ProductOperations<T>,\n\t\tleft: UntypedProduct<T>,\n\t\tright: UntypedProduct<T>,\n\t\tcombineFunc: <Key extends Cachable<Key>, Id>(\n\t\t\tsetOperations: SetOperations<Key, Id>,\n\t\t\tleft: UntypedBspSet<Key>,\n\t\t\tright: UntypedBspSet<Key>,\n\t\t) => UntypedBspSet<Key>,\n\t) {\n\t\tconst res: { [dim in keyof T]?: UntypedSparse<unknown> } = {};\n\t\tfor (const dimStr of Object.keys(productOperations)) {\n\t\t\tconst dim = dimStr as keyof T;\n\t\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\t\tconst combined = combineFunc<unknown, unknown>(\n\t\t\t\t\tproductOperations[dim],\n\t\t\t\t\ttoBspSet(left[dim]),\n\t\t\t\t\ttoBspSet(right[dim]),\n\t\t\t\t);\n\t\t\t\tif (combined === empty) {\n\t\t\t\t\treturn combined;\n\t\t\t\t}\n\t\t\t\tif (combined === dense) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tres[dim] = combined;\n\t\t\t}\n\t\t}\n\n\t\treturn res as UntypedProduct<T>;\n\t},\n\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\trestrict<T extends object, Props extends (keyof T)[]>(object: T, ...props: Props) {\n\t\tconst res: Partial<Restrict<T, Props>> = {};\n\t\tfor (const key of props) {\n\t\t\tif (Object.prototype.hasOwnProperty.call(object, key)) {\n\t\t\t\tconst prop = object[key];\n\t\t\t\tres[key] = prop;\n\t\t\t}\n\t\t}\n\n\t\treturn res as Restrict<T, Props>;\n\t},\n\n\tfromUntypedProduct<T, Props extends (keyof T)[]>(\n\t\tproductOperations: ProductOperations<Restrict<T, Props>>,\n\t\tbounds: UntypedProduct<Restrict<T, Props>>,\n\t\tdims: Props,\n\t) {\n\t\tconst product: { [dim in Props[number]]?: BspSet<unknown, unknown> } = {};\n\t\tfor (const dim of dims) {\n\t\t\tconst bound: UntypedSparse<unknown> | undefined = bounds[dim];\n\t\t\tproduct[dim] = fromUntyped(productOperations[dim], bound !== undefined ? bound : dense);\n\t\t}\n\t\treturn product as Product<Restrict<T, Props>>;\n\t},\n\n\tdenseProduct<T, Props extends (keyof T)[]>(dims: Props): Product<Restrict<T, Props>> {\n\t\tconst top_inner: { [dim in Props[number]]?: Dense } = {};\n\t\tfor (const dim of dims) {\n\t\t\ttop_inner[dim] = dense;\n\t\t}\n\t\treturn top_inner as Product<Restrict<T, Props>>;\n\t},\n};\n\nexport const createFromProduct = unsafe.unzip.bind(unsafe);\n\ntype Compatible<T, U> = { [dim in keyof T & keyof U]: T[dim] };\n\nfunction joinBounds<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProduct<T>,\n\tright: UntypedProduct<T>,\n) {\n\tconst join = unsafe.combineProduct(productOperations, left, right, unionUntyped);\n\tif (join === empty) {\n\t\tthrow new Error(\"broken invariant: the union of two non-empty products cannot be empty\");\n\t}\n\n\treturn join;\n}\n\nfunction compareSubspace<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProduct<T>,\n\tright: UntypedProduct<T>,\n) {\n\tlet cmp: ReturnType<typeof combineCmp> = 0;\n\tfor (const dimStr of Object.keys(productOperations)) {\n\t\tconst dim = dimStr as keyof T;\n\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\tconst lProj = toBspSet(left[dim]);\n\t\t\tconst rProj = toBspSet(right[dim]);\n\t\t\tconst setOperations = productOperations[dim];\n\n\t\t\tcmp = combineCmp(cmp, compareUntyped<unknown, unknown>(setOperations, lProj, rProj));\n\n\t\t\tif (cmp === undefined) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn cmp;\n}\n\nconst tryUnionSubspaces = (() => {\n\tconst cache: { left?: unknown; right?: unknown; res?: unknown } = {};\n\treturn <T>(\n\t\tproductOperations: ProductOperations<T>,\n\t\tleft: Subspace<T>,\n\t\tright: Subspace<T>,\n\t): Subspace<T> | Dense | Empty | undefined => {\n\t\tif (left === cache.left && right === cache.right) {\n\t\t\treturn cache.res as ReturnType<typeof tryUnionSubspaces>;\n\t\t}\n\t\tcache.left = left;\n\t\tcache.right = right;\n\n\t\tconst cmp = compareSubspace(productOperations, left.bounds, right.bounds);\n\t\tif (cmp !== undefined) {\n\t\t\treturn (cache.res = cmp <= 0 ? right : left);\n\t\t}\n\t\tlet differentDimension: keyof T | undefined;\n\n\t\t// because Object.keys only returns string[], we need to downcast\n\t\tconst po_keys = Object.keys(productOperations) as (keyof T)[];\n\t\tfor (const dim of po_keys) {\n\t\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\t\tconst cmp_inner = compareUntyped<unknown, unknown>(\n\t\t\t\t\tproductOperations[dim],\n\t\t\t\t\ttoBspSet(left.bounds[dim]),\n\t\t\t\t\ttoBspSet(right.bounds[dim]),\n\t\t\t\t);\n\t\t\t\tif (cmp_inner !== 0) {\n\t\t\t\t\tif (differentDimension !== undefined) {\n\t\t\t\t\t\treturn (cache.res = undefined);\n\t\t\t\t\t}\n\n\t\t\t\t\tdifferentDimension = dim;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (differentDimension !== undefined) {\n\t\t\tconst newDim = unionUntyped<unknown, unknown>(\n\t\t\t\tproductOperations[differentDimension],\n\t\t\t\ttoBspSet(left.bounds[differentDimension]),\n\t\t\t\ttoBspSet(right.bounds[differentDimension]),\n\t\t\t);\n\t\t\tif (newDim === empty) {\n\t\t\t\treturn (cache.res = empty);\n\t\t\t}\n\t\t\tif (newDim === dense) {\n\t\t\t\t// we are actually deleting the `differentDimension`, so the variable\n\t\t\t\t// `deleted` must be there. Hence disabling the rule here.\n\t\t\t\tconst { [differentDimension]: deleted, ...leftBoundsWithoutDifferentDimension } =\n\t\t\t\t\tleft.bounds;\n\t\t\t\treturn (cache.res = subspace<unknown>(leftBoundsWithoutDifferentDimension));\n\t\t\t}\n\n\t\t\tconst newBounds: UntypedProduct<T> = {\n\t\t\t\t...left.bounds,\n\t\t\t\t[differentDimension]: newDim,\n\t\t\t};\n\t\t\treturn (cache.res = subspace(newBounds));\n\t\t}\n\n\t\treturn (cache.res = undefined);\n\t};\n})();\n\nfunction combineChildren<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n): UntypedProductSet<T> {\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn right;\n\t}\n\tif (left === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn left;\n\t}\n\n\tif (!left.isSubspace || !right.isSubspace) {\n\t\treturn union<T>(left, right, joinBounds(productOperations, left.bounds, right.bounds));\n\t}\n\n\tconst combinedSubspace = tryUnionSubspaces<T>(productOperations, left, right);\n\n\tif (combinedSubspace !== undefined) {\n\t\treturn combinedSubspace;\n\t}\n\treturn union(left, right, joinBounds(productOperations, left.bounds, right.bounds));\n}\n\nfunction projectUntyped<T, Props extends (keyof T)[]>(\n\tproductOperations: ProductOperations<T>,\n\tset: UntypedSparseProduct<T>,\n\t...dims: Props\n): UntypedProductSet<Restrict<T, Props>> {\n\tconst bounds = unsafe.restrict(set.bounds, ...dims);\n\tif (set.isSubspace) {\n\t\treturn subspace(bounds);\n\t}\n\n\tconst lChild = projectUntyped(productOperations, set.left, ...dims);\n\tif (lChild === dense) {\n\t\treturn dense;\n\t}\n\tconst rChild = projectUntyped(productOperations, set.right, ...dims);\n\treturn combineChildren(productOperations, lChild, rChild);\n}\n\nexport function project<T, Props extends (keyof T)[]>(\n\tset: ProductSet<T>,\n\t...dims: Props\n): ProductSet<Restrict<T, Props>> {\n\tif (set === dense || set === empty) {\n\t\treturn set;\n\t}\n\tconst productOperations = unsafe.restrict(set.productOperations, ...dims);\n\tconst root = projectUntyped(productOperations, set.root, ...dims);\n\tif (root === empty) {\n\t\treturn root;\n\t}\n\treturn sparseProduct(productOperations, root);\n}\n\nfunction splitBox<T>(productOperations: ProductOperations<T>, currentBox: Box<T>): Pair<Box<T>> {\n\tif (currentBox.children !== undefined) {\n\t\treturn currentBox.children;\n\t}\n\tconst { box, probabilities } = currentBox;\n\tlet biggestDim: keyof T | undefined;\n\tlet biggestDimKey;\n\tlet currentProb = 0;\n\t// because Object.keys only returns string[], we need to downcast\n\tconst po_keys = Object.keys(productOperations) as (keyof T)[];\n\tfor (const dim of po_keys) {\n\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\tconst prob: number | undefined = probabilities[dim];\n\t\t\tconst setOperations_inner = productOperations[dim];\n\t\t\tif (prob === undefined) {\n\t\t\t\tbiggestDim = dim;\n\t\t\t\tbiggestDimKey = setOperations_inner.top;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (prob > currentProb) {\n\t\t\t\tconst dimensionSet = toBspSet(box[dim]);\n\t\t\t\tif (dimensionSet === empty) {\n\t\t\t\t\tthrow new Error(\"the key split can never return empty\");\n\t\t\t\t}\n\t\t\t\tlet key = setOperations_inner.top;\n\t\t\t\tif (dimensionSet !== dense) {\n\t\t\t\t\tif (!dimensionSet.isExact) {\n\t\t\t\t\t\tthrow new Error(\"the key can always be represented exactly\");\n\t\t\t\t\t}\n\n\t\t\t\t\tkey = dimensionSet.key;\n\t\t\t\t}\n\t\t\t\tif (!setOperations_inner.canSplit(key)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tbiggestDim = dim;\n\t\t\t\tcurrentProb = prob;\n\t\t\t\tbiggestDimKey = key;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (biggestDim === undefined || biggestDimKey === undefined) {\n\t\tthrow new Error(\"there has to be at least one dimension\");\n\t}\n\n\tconst setOperations = productOperations[biggestDim];\n\n\tconst [[leftDim, leftProb], [rightDim, rightProb]] = setOperations.split(biggestDimKey);\n\tconst res: ReturnType<typeof splitBox> = [\n\t\t{\n\t\t\tbox: {\n\t\t\t\t...box,\n\t\t\t\t[biggestDim]: lazy<unknown, unknown>(setOperations, setOperations.top, leftDim),\n\t\t\t},\n\t\t\tprobabilities: { ...probabilities, [biggestDim]: leftProb },\n\t\t\tdepth: currentBox.depth + 1,\n\t\t},\n\t\t{\n\t\t\tbox: {\n\t\t\t\t...box,\n\t\t\t\t[biggestDim]: lazy<unknown, unknown>(setOperations, setOperations.top, rightDim),\n\t\t\t},\n\t\t\tprobabilities: { ...probabilities, [biggestDim]: rightProb },\n\t\t\tdepth: currentBox.depth + 1,\n\t\t},\n\t];\n\tif (currentBox.depth < 10) {\n\t\tcurrentBox.children = res;\n\t}\n\treturn res;\n}\n\nfunction restrictByBounds<T>(\n\tproductOperations: ProductOperations<T>,\n\tset: UntypedProductSet<T>,\n\tleftBounds: UntypedProduct<T>,\n\trightBounds: UntypedProduct<T>,\n): Pair<UntypedProductSet<T>> {\n\tif (set === empty) {\n\t\treturn [empty, empty];\n\t}\n\tif (set === dense) {\n\t\treturn [subspace(leftBounds), subspace(rightBounds)];\n\t}\n\tconst cmp = compareSubspace(productOperations, set.bounds, leftBounds);\n\n\t// the set is fully contained in the left half, i.e. we know the pair.\n\tif (cmp !== undefined && cmp <= 0) {\n\t\treturn [set, empty];\n\t}\n\n\tconst newLeftBounds = unsafe.combineProduct(\n\t\tproductOperations,\n\t\tset.bounds,\n\t\tleftBounds,\n\t\tintersectUntyped,\n\t);\n\n\t// if we know, that the left set is completely empty, then the whole set is in the right bounds.\n\tif (newLeftBounds === empty) {\n\t\treturn [empty, set];\n\t}\n\n\tconst newRightBounds = unsafe.combineProduct(\n\t\tproductOperations,\n\t\tset.bounds,\n\t\trightBounds,\n\t\tintersectUntyped,\n\t);\n\tif (set.isSubspace) {\n\t\treturn [\n\t\t\tsubspace(newLeftBounds),\n\t\t\tnewRightBounds === empty ? empty : subspace(newRightBounds),\n\t\t];\n\t}\n\n\tconst [ll, lr] = restrictByBounds(productOperations, set.left, leftBounds, rightBounds);\n\tconst [rl, rr] = restrictByBounds(productOperations, set.right, leftBounds, rightBounds);\n\treturn [combineChildren(productOperations, ll, rl), combineChildren(productOperations, lr, rr)];\n}\n\nconst splitByBox = <T>(\n\tproductOperations: ProductOperations<T>,\n\tset: UntypedProductSet<T>,\n\t{ box: leftBounds }: Box<T>,\n\t{ box: rightBounds }: Box<T>,\n): Pair<UntypedProductSet<T>, UntypedProductSet<T>> => {\n\treturn restrictByBounds(productOperations, set, leftBounds, rightBounds);\n};\n\nfunction recurse<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n\tcurrentBox: Box<T>,\n\tvisitFunc: (\n\t\tproductOperations: ProductOperations<T>,\n\t\tleft: UntypedProductSet<T>,\n\t\tright: UntypedProductSet<T>,\n\t\tbox: Box<T>,\n\t) => UntypedProductSet<T>,\n) {\n\tconst [leftBox, rightBox] = splitBox(productOperations, currentBox);\n\tconst [ll, lr] = splitByBox(productOperations, left, leftBox, rightBox);\n\tconst [rl, rr] = splitByBox(productOperations, right, leftBox, rightBox);\n\n\tconst lChild = visitFunc(productOperations, ll, rl, leftBox);\n\tif (lChild === dense) {\n\t\treturn dense;\n\t}\n\tconst rChild = visitFunc(productOperations, lr, rr, rightBox);\n\treturn combineChildren(productOperations, lChild, rChild);\n}\n\nfunction unionUntypedProduct<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n\tcurrentBox: Box<T>,\n): UntypedProductSet<T> {\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (left === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn right;\n\t}\n\tif (left.isSubspace && right.isSubspace) {\n\t\tconst combinedSubspace = tryUnionSubspaces(productOperations, left, right);\n\t\tif (combinedSubspace !== undefined) {\n\t\t\treturn combinedSubspace;\n\t\t}\n\t}\n\n\treturn recurse(productOperations, left, right, currentBox, unionUntypedProduct);\n}\n\nexport function unionProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(\n\tleft: ProductSet<T>,\n\tright: ProductSet<U>,\n): ProductSet<T & U> {\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn right;\n\t}\n\tif (left === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn left;\n\t}\n\tconst productOperations = { ...left.productOperations, ...right.productOperations };\n\tconst res = unionUntypedProduct(\n\t\tproductOperations,\n\t\tleft.root,\n\t\tright.root,\n\t\ttop(productOperations),\n\t);\n\tif (res === empty) {\n\t\treturn res;\n\t}\n\treturn sparseProduct(productOperations, res);\n}\n\nfunction intersectUntypedProduct<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n\tcurrentBox: Box<T>,\n): UntypedProductSet<T> {\n\tif (left === empty || right === empty) {\n\t\treturn empty;\n\t}\n\tif (left === dense) {\n\t\treturn right;\n\t}\n\tif (right === dense) {\n\t\treturn left;\n\t}\n\tif (left.isSubspace && right.isSubspace) {\n\t\tconst res = unsafe.combineProduct(\n\t\t\tproductOperations,\n\t\t\tleft.bounds,\n\t\t\tright.bounds,\n\t\t\tintersectUntyped,\n\t\t);\n\t\tif (res === empty) {\n\t\t\treturn empty;\n\t\t}\n\t\treturn subspace(res);\n\t}\n\n\treturn recurse(productOperations, left, right, currentBox, intersectUntypedProduct);\n}\n\nexport function intersectProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(\n\tleft: ProductSet<T>,\n\tright: ProductSet<U>,\n): ProductSet<T & U> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn right;\n\t}\n\tif (right === dense) {\n\t\treturn left;\n\t}\n\n\tconst productOperations = { ...left.productOperations, ...right.productOperations };\n\tconst res = intersectUntypedProduct(\n\t\tproductOperations,\n\t\tleft.root,\n\t\tright.root,\n\t\ttop(productOperations),\n\t);\n\tif (res === empty) {\n\t\treturn res;\n\t}\n\treturn sparseProduct(productOperations, res);\n}\n\nfunction tryExceptSubspaces<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: Subspace<T>,\n\tright: Subspace<T>,\n): Subspace<T> | Dense | Empty | undefined {\n\tconst cmp = compareSubspace(productOperations, left.bounds, right.bounds);\n\tif (cmp === 0 || cmp === -1) {\n\t\treturn empty;\n\t}\n\tlet notContainedDimension: keyof T | undefined;\n\t// because Object.keys only returns string[], we need to downcast\n\tconst po_keys = Object.keys(productOperations) as (keyof T)[];\n\tfor (const dim of po_keys) {\n\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\tconst cmp_inner = compareUntyped<unknown, unknown>(\n\t\t\t\tproductOperations[dim],\n\t\t\t\ttoBspSet(left.bounds[dim]),\n\t\t\t\ttoBspSet(right.bounds[dim]),\n\t\t\t);\n\t\t\tif (cmp_inner === undefined || cmp_inner > 0) {\n\t\t\t\tif (notContainedDimension !== undefined) {\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\n\t\t\t\tnotContainedDimension = dim;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (notContainedDimension !== undefined) {\n\t\tconst newDim = exceptUntyped<unknown, unknown>(\n\t\t\tproductOperations[notContainedDimension],\n\t\t\ttoBspSet(left.bounds[notContainedDimension]),\n\t\t\ttoBspSet(right.bounds[notContainedDimension]),\n\t\t);\n\n\t\tif (newDim === empty) {\n\t\t\treturn empty;\n\t\t}\n\t\tif (newDim === dense) {\n\t\t\t// we are actually deleting the `differentDimension`, so the variable\n\t\t\t// `deleted` must be there. Hence disabling the rule here.\n\t\t\tconst { [notContainedDimension]: deleted, ...leftBoundsWithoutDifferentDimension } =\n\t\t\t\tleft.bounds;\n\t\t\treturn subspace<unknown>(leftBoundsWithoutDifferentDimension);\n\t\t}\n\t\tconst newBounds: UntypedProduct<T> = {\n\t\t\t...left.bounds,\n\t\t\t[notContainedDimension]: newDim,\n\t\t};\n\t\treturn subspace(newBounds);\n\t}\n\n\treturn undefined;\n}\n\nfunction exceptUntypedProduct<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n\tcurrentBox: Box<T>,\n): UntypedProductSet<T> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn empty;\n\t}\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\n\tif (left === dense) {\n\t\treturn recurse(productOperations, left, right, currentBox, exceptUntypedProduct);\n\t}\n\n\tif (left.isSubspace && right.isSubspace) {\n\t\tconst combinedSubspace = tryExceptSubspaces(productOperations, left, right);\n\t\tif (combinedSubspace !== undefined) {\n\t\t\treturn combinedSubspace;\n\t\t}\n\t}\n\n\treturn recurse(productOperations, left, right, currentBox, exceptUntypedProduct);\n}\n\nexport function exceptProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(\n\tleft: ProductSet<T>,\n\tright: ProductSet<U>,\n): ProductSet<T & U> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn empty;\n\t}\n\tif (left === dense) {\n\t\tconst res_inner = exceptUntypedProduct(\n\t\t\tright.productOperations,\n\t\t\tdense,\n\t\t\tright.root,\n\t\t\ttop(right.productOperations),\n\t\t);\n\t\tif (res_inner === empty) {\n\t\t\treturn res_inner;\n\t\t}\n\t\treturn sparseProduct(right.productOperations, res_inner);\n\t}\n\n\tconst productOperations = { ...left.productOperations, ...right.productOperations };\n\tconst res = exceptUntypedProduct(\n\t\tproductOperations,\n\t\tleft.root,\n\t\tright.root,\n\t\ttop(productOperations),\n\t);\n\tif (res === empty) {\n\t\treturn res;\n\t}\n\treturn sparseProduct(productOperations, res);\n}\n\nfunction compareUntypedProduct<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n\tboundingBox: Box<T>,\n): -1 | 0 | 1 | undefined {\n\tif (left === right) {\n\t\treturn 0;\n\t}\n\n\tif (left === empty) {\n\t\treturn -1;\n\t}\n\n\tif (right === empty) {\n\t\treturn 1;\n\t}\n\n\tif (left === dense) {\n\t\tif (right === dense) {\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif (right === dense) {\n\t\treturn -1;\n\t}\n\n\tif (left.isSubspace) {\n\t\tif (right.isSubspace) {\n\t\t\treturn compareSubspace(productOperations, left.bounds, right.bounds);\n\t\t}\n\t}\n\n\tconst [leftBox, rightBox] = splitBox(productOperations, boundingBox);\n\tconst [ll, lr] = splitByBox(productOperations, left, leftBox, rightBox);\n\tconst [rl, rr] = splitByBox(productOperations, right, leftBox, rightBox);\n\n\tconst leftCmp = compareUntypedProduct(productOperations, ll, rl, leftBox);\n\tif (leftCmp === undefined) {\n\t\treturn undefined;\n\t}\n\treturn combineCmp(leftCmp, compareUntypedProduct(productOperations, lr, rr, rightBox));\n}\n\nexport function compareProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(\n\tleft: ProductSet<T>,\n\tright: ProductSet<U>,\n) {\n\tif (left === right) {\n\t\treturn 0;\n\t}\n\n\tif (left === empty) {\n\t\treturn -1;\n\t}\n\n\tif (right === empty) {\n\t\treturn 1;\n\t}\n\n\tif (left === dense) {\n\t\tif (right === dense) {\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif (right === dense) {\n\t\treturn -1;\n\t}\n\n\tconst productOperations = { ...left.productOperations, ...right.productOperations };\n\treturn compareUntypedProduct(productOperations, left.root, right.root, top(productOperations));\n}\n\nfunction meetsSubspace<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProduct<T>,\n\tright: UntypedProduct<T>,\n) {\n\tfor (const dimStr of Object.keys(productOperations)) {\n\t\tconst dim = dimStr as keyof T;\n\t\tif (Object.prototype.hasOwnProperty.call(productOperations, dim)) {\n\t\t\tconst lProj = toBspSet(left[dim]);\n\t\t\tconst rProj = toBspSet(right[dim]);\n\t\t\tconst setOperations = productOperations[dim];\n\t\t\tif (!meetsUntyped<unknown, unknown>(setOperations, lProj, rProj)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nfunction meetsUntypedProduct<T>(\n\tproductOperations: ProductOperations<T>,\n\tleft: UntypedProductSet<T>,\n\tright: UntypedProductSet<T>,\n\tboundingBox: Box<T>,\n): boolean {\n\tif (left === empty || right === empty) {\n\t\treturn false;\n\t}\n\tif (left === dense || right === dense) {\n\t\treturn true;\n\t}\n\tif (!meetsSubspace(productOperations, left.bounds, right.bounds)) {\n\t\treturn false;\n\t}\n\tif (left.isSubspace && right.isSubspace) {\n\t\treturn true;\n\t}\n\n\tconst [leftBox, rightBox] = splitBox(productOperations, boundingBox);\n\tconst [ll, lr] = splitByBox(productOperations, left, leftBox, rightBox);\n\tconst [rl, rr] = splitByBox(productOperations, right, leftBox, rightBox);\n\n\treturn (\n\t\tmeetsUntypedProduct(productOperations, ll, rl, leftBox) ||\n\t\tmeetsUntypedProduct(productOperations, lr, rr, rightBox)\n\t);\n}\n\nexport function meetsProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(\n\tleft: ProductSet<T>,\n\tright: ProductSet<U>,\n) {\n\tif (left === empty || right === empty) {\n\t\treturn false;\n\t}\n\tif (left === dense || right === dense) {\n\t\treturn true;\n\t}\n\n\tconst productOperations = { ...left.productOperations, ...right.productOperations };\n\treturn meetsUntypedProduct(productOperations, left.root, right.root, top(productOperations));\n}\n\nexport const complementProduct = <T>(set: ProductSet<T>) => exceptProduct(dense, set);\n\nexport const symmetricDiffProduct = <T>(left: ProductSet<T>, right: ProductSet<T>) =>\n\tunionProduct(exceptProduct(left, right), exceptProduct(right, left));\n\nexport function getSubspaces<T>(set: ProductSet<T>) {\n\tif (set === empty || set === dense) {\n\t\treturn [];\n\t}\n\tconst res: UntypedProduct<T>[] = [];\n\tfunction loop(root: UntypedSparseProduct<T>) {\n\t\tif (root.isSubspace) {\n\t\t\tres.push(root.bounds);\n\t\t\treturn;\n\t\t}\n\n\t\tloop(root.left);\n\t\tloop(root.right);\n\t}\n\n\tloop(set.root);\n\treturn res;\n}\n\nexport function forEachProduct<T, Props extends (keyof T)[]>(\n\tset: ProductSet<T>,\n\tf: (product: Product<Restrict<T, Props>>) => boolean,\n\t...dims: Props\n): boolean {\n\tconst newSet = project(set, ...dims);\n\tif (newSet === empty) {\n\t\treturn true;\n\t}\n\tif (newSet === dense) {\n\t\treturn f(unsafe.denseProduct(dims));\n\t}\n\n\tconst { productOperations, root } = newSet;\n\n\tfunction loop(root_inner: UntypedSparseProduct<T>): boolean {\n\t\tif (root_inner.isSubspace) {\n\t\t\treturn f(unsafe.fromUntypedProduct(productOperations, root_inner.bounds, dims));\n\t\t}\n\t\treturn loop(root_inner.left) && loop(root_inner.right);\n\t}\n\n\treturn loop(root);\n}\n\nexport function getSubspaceCount<T>(set: ProductSet<T>) {\n\tif (set === empty || set === dense) {\n\t\treturn 0;\n\t}\n\treturn getUntypedSubspaceCount(set.root);\n}\n"]}

package/dist/split.d.ts

@@ -1,41 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SetOperations, Pair } from "./bspSet";
-/** Represents a half-open interval [a, b) */
-export declare type Ivl<Index extends number = number> = Pair<Index>;
-export declare function ivlJoin<Index extends number>(ivl1: Ivl<Index>, ivl2: Ivl<Index>): Ivl<Index>;
-export declare function ivlMeets(ivl1: Ivl, ivl2: Ivl): boolean;
-export declare function ivlMeetsOrTouches(ivl1: Ivl, ivl2: Ivl): boolean;
-/** computes the set difference on intervals. Precondition: they meet */
-export declare function ivlExcept<Index extends number>(ivl1: Ivl<Index>, ivl2: Ivl<Index>): Ivl<Index> | undefined;
-export declare function ivlCompare<Index extends number>(ivl1: Ivl<Index>, ivl2: Ivl<Index>): -1 | 0 | 1 | undefined;
-export interface Distribution {
-    /** The cummulative distribution function. This is used to compute the probabilty mass of a given interval. */
-    readonly cdf: (x: number) => number;
-    /** The inverse cummulative distribution function. This is used to estimate a point given a quantile. */
-    readonly invCdf: (x: number) => number;
-}
-/** This is a bounded pareto distribution with a shape parameter `alpha`, a lower bound `L` and an upper bound `H`.
- * It has good properties for being used as a space splitting function in sofar, as it causes the indices to grow
- * exponentially. This behavior guarantees `O(log k)` as worst-case execution time when it's used as a space-splitting
- * function.
- *
- * On the other hand, we now can use it to approximate the access to grids better than just binary search, a
- * similar argument as for using exponential search. But we can use it to give exact probability masses for arbitrary
- * intervals. This allows us to search in both dimensions of a grid and use the probability mass to decide what axis
- * to cut next.
- */
-export declare function boundedPareto(alpha: number, L: number, H: number): Distribution;
-/** Creates a dimension splitter that operates on integer interval values and is based on a bounded Pareto
- * distribution. */
-export declare function boundedParetoSplitter<Index extends number>(alpha: number, L: number, H: number): DimensionSplitter<Pair<Index>>;
-export declare function boundedParetoSetOperations<Index extends number, Id>(alpha: number, L: number, H: number, top: Pair<Index>, id: Id): SetOperations<Pair<Index>, Id>;
-export interface DimensionSplitter<Key> {
-    /** For a given key, returns if the key can be further sub-divided. */
-    canSplit(key: Key): boolean;
-    /** Splits a key and returns the probability mass for either half. */
-    split(key: Key): Pair<Pair<Key, number>>;
-}
-//# sourceMappingURL=split.d.ts.map

package/dist/split.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"split.d.ts","sourceRoot":"","sources":["../src/split.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAE/C,6CAA6C;AAC7C,oBAAY,GAAG,CAAC,KAAK,SAAS,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;AAQ7D,wBAAgB,OAAO,CAAC,KAAK,SAAS,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAI5F;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAItD;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAI/D;AAED,wEAAwE;AACxE,wBAAgB,SAAS,CAAC,KAAK,SAAS,MAAM,EAC7C,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,EAChB,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GACd,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,CAUxB;AAQD,wBAAgB,UAAU,CAAC,KAAK,SAAS,MAAM,EAC9C,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,EAChB,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GACd,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAaxB;AAED,MAAM,WAAW,YAAY;IAC5B,8GAA8G;IAC9G,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;IAEpC,wGAAwG;IACxG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;CACvC;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,YAAY,CAkB/E;AAED;mBACmB;AACnB,wBAAgB,qBAAqB,CAAC,KAAK,SAAS,MAAM,EACzD,KAAK,EAAE,MAAM,EACb,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACP,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAwBhC;AAED,wBAAgB,0BAA0B,CAAC,KAAK,SAAS,MAAM,EAAE,EAAE,EAClE,KAAK,EAAE,MAAM,EACb,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,EAChB,EAAE,EAAE,EAAE,GACJ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAahC;AAED,MAAM,WAAW,iBAAiB,CAAC,GAAG;IACrC,sEAAsE;IACtE,QAAQ,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAAC;IAC5B,qEAAqE;IACrE,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;CACzC"}

package/dist/split.js

@@ -1,127 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.boundedParetoSetOperations = exports.boundedParetoSplitter = exports.boundedPareto = exports.ivlCompare = exports.ivlExcept = exports.ivlMeetsOrTouches = exports.ivlMeets = exports.ivlJoin = void 0;
-/** A much faster version of `Math.max` specialized to two numeric arguments. */
-const fastMax = (x1, x2) => (x1 < x2 ? x2 : x1);
-/** A much faster version of `Math.min` specialized to two numeric arguments. */
-const fastMin = (x1, x2) => (x1 < x2 ? x1 : x2);
-function ivlJoin(ivl1, ivl2) {
-    const [x1a, x1b] = ivl1;
-    const [x2a, x2b] = ivl2;
-    return [fastMin(x1a, x2a), fastMax(x1b, x2b)];
-}
-exports.ivlJoin = ivlJoin;
-function ivlMeets(ivl1, ivl2) {
-    const [x1a, x1b] = ivl1;
-    const [x2a, x2b] = ivl2;
-    return fastMax(x1a, x2a) < fastMin(x1b, x2b);
-}
-exports.ivlMeets = ivlMeets;
-function ivlMeetsOrTouches(ivl1, ivl2) {
-    const [x1a, x1b] = ivl1;
-    const [x2a, x2b] = ivl2;
-    return fastMax(x1a, x2a) <= fastMin(x1b, x2b);
-}
-exports.ivlMeetsOrTouches = ivlMeetsOrTouches;
-/** computes the set difference on intervals. Precondition: they meet */
-function ivlExcept(ivl1, ivl2) {
-    const [x1a, x1b] = ivl1;
-    const [x2a, x2b] = ivl2;
-    if (x1a < x2a && x2b >= x1b) {
-        return [x1a, x2a];
-    }
-    if (x1a >= x2a && x2b < x1b) {
-        return [x2b, x1b];
-    }
-    return undefined;
-}
-exports.ivlExcept = ivlExcept;
-function ivlMeet(ivl1, ivl2) {
-    const [x1a, x1b] = ivl1;
-    const [x2a, x2b] = ivl2;
-    return [fastMax(x1a, x2a), fastMin(x1b, x2b)];
-}
-function ivlCompare(ivl1, ivl2) {
-    const [x1a, x1b] = ivl1;
-    const [x2a, x2b] = ivl2;
-    if (x1a === x2a && x1b === x2b) {
-        return 0;
-    }
-    if (x1a >= x2a && x1b <= x2b) {
-        return -1;
-    }
-    if (x1a <= x2a && x1b >= x2b) {
-        return 1;
-    }
-    return undefined;
-}
-exports.ivlCompare = ivlCompare;
-/** This is a bounded pareto distribution with a shape parameter `alpha`, a lower bound `L` and an upper bound `H`.
- * It has good properties for being used as a space splitting function in sofar, as it causes the indices to grow
- * exponentially. This behavior guarantees `O(log k)` as worst-case execution time when it's used as a space-splitting
- * function.
- *
- * On the other hand, we now can use it to approximate the access to grids better than just binary search, a
- * similar argument as for using exponential search. But we can use it to give exact probability masses for arbitrary
- * intervals. This allows us to search in both dimensions of a grid and use the probability mass to decide what axis
- * to cut next.
- */
-function boundedPareto(alpha, L, H) {
-    const lAlpha = L ** alpha;
-    const cdfDenom = 1 - (L / H) ** alpha;
-    const hAlpha = H ** alpha;
-    const hlAlpha = hAlpha * lAlpha;
-    const hAlphaSubLAlpha = hAlpha - lAlpha;
-    const negAlphaInv = -1 / alpha;
-    const cdf = alpha === 1
-        ? (x) => (1 - lAlpha / x) / cdfDenom
-        : (x) => (1 - lAlpha * x ** -alpha) / cdfDenom;
-    const invCdf = alpha === 1
-        ? (y) => 1 / ((hAlpha - y * hAlphaSubLAlpha) / hlAlpha)
-        : (y) => ((hAlpha - y * hAlphaSubLAlpha) / hlAlpha) ** negAlphaInv;
-    return { cdf, invCdf };
-}
-exports.boundedPareto = boundedPareto;
-/** Creates a dimension splitter that operates on integer interval values and is based on a bounded Pareto
- * distribution. */
-function boundedParetoSplitter(alpha, L, H) {
-    const distribution = boundedPareto(alpha, L, H);
-    return {
-        canSplit: ([keyLb, keyUb]) => keyUb - keyLb > 1,
-        split([keyLb, keyUb]) {
-            const ubCdf = distribution.cdf(keyUb);
-            const lbCdf = distribution.cdf(keyLb + 1);
-            const cuttingPoint = distribution.invCdf((ubCdf + lbCdf) / 2);
-            // pick a cutting point, but making sure either side has at least one element in it.
-            const discreteCuttingPoint = Math.min(Math.max(Math.round(cuttingPoint), keyLb + 1), keyUb - 1);
-            const leftProb = distribution.cdf(discreteCuttingPoint) - distribution.cdf(keyLb + 1);
-            const rightProb = distribution.cdf(keyUb) - distribution.cdf(discreteCuttingPoint);
-            const result = [
-                [[keyLb, discreteCuttingPoint], leftProb],
-                [[discreteCuttingPoint, keyUb], rightProb],
-            ];
-            return result;
-        },
-    };
-}
-exports.boundedParetoSplitter = boundedParetoSplitter;
-function boundedParetoSetOperations(alpha, L, H, top, id) {
-    const splitter = boundedParetoSplitter(alpha, L, H);
-    return {
-        id,
-        split: (key) => splitter.split(key),
-        canSplit: (key) => splitter.canSplit(key),
-        meets: ivlMeets,
-        intersect: ivlMeet,
-        union: (x, y) => (ivlMeetsOrTouches(x, y) ? ivlJoin(x, y) : undefined),
-        except: ivlExcept,
-        compare: ivlCompare,
-        top,
-    };
-}
-exports.boundedParetoSetOperations = boundedParetoSetOperations;
-//# sourceMappingURL=split.js.map

package/dist/split.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"split.js","sourceRoot":"","sources":["../src/split.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAOH,gFAAgF;AAChF,MAAM,OAAO,GAAG,CAAuB,EAAS,EAAE,EAAS,EAAS,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE3F,gFAAgF;AAChF,MAAM,OAAO,GAAG,CAAuB,EAAS,EAAE,EAAS,EAAS,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE3F,SAAgB,OAAO,CAAuB,IAAgB,EAAE,IAAgB;IAC/E,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC/C,CAAC;AAJD,0BAIC;AAED,SAAgB,QAAQ,CAAC,IAAS,EAAE,IAAS;IAC5C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,OAAO,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC9C,CAAC;AAJD,4BAIC;AAED,SAAgB,iBAAiB,CAAC,IAAS,EAAE,IAAS;IACrD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,OAAO,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/C,CAAC;AAJD,8CAIC;AAED,wEAAwE;AACxE,SAAgB,SAAS,CACxB,IAAgB,EAChB,IAAgB;IAEhB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE;QAC5B,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAClB;IACD,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE;QAC5B,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAClB;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAbD,8BAaC;AAED,SAAS,OAAO,CAAuB,IAAgB,EAAE,IAAgB;IACxE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,SAAgB,UAAU,CACzB,IAAgB,EAChB,IAAgB;IAEhB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;IACxB,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,EAAE;QAC/B,OAAO,CAAC,CAAC;KACT;IACD,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE;QAC7B,OAAO,CAAC,CAAC,CAAC;KACV;IACD,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE;QAC7B,OAAO,CAAC,CAAC;KACT;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAhBD,gCAgBC;AAUD;;;;;;;;;GASG;AACH,SAAgB,aAAa,CAAC,KAAa,EAAE,CAAS,EAAE,CAAS;IAChE,MAAM,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC;IAC1B,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;IACtC,MAAM,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC;IAC1B,MAAM,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;IAChC,MAAM,eAAe,GAAG,MAAM,GAAG,MAAM,CAAC;IACxC,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IAE/B,MAAM,GAAG,GACR,KAAK,KAAK,CAAC;QACV,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,QAAQ;QAC5C,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;IACzD,MAAM,MAAM,GACX,KAAK,KAAK,CAAC;QACV,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,OAAO,CAAC;QAC/D,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,OAAO,CAAC,IAAI,WAAW,CAAC;IAE7E,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AACxB,CAAC;AAlBD,sCAkBC;AAED;mBACmB;AACnB,SAAgB,qBAAqB,CACpC,KAAa,EACb,CAAS,EACT,CAAS;IAET,MAAM,YAAY,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,OAAO;QACN,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC;QAC/C,KAAK,CAAC,CAAC,KAAK,EAAE,KAAK,CAAc;YAChC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,oFAAoF;YACpF,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,EAC7C,KAAK,GAAG,CAAC,CACA,CAAC;YAEX,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,oBAAoB,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACtF,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;YAEnF,MAAM,MAAM,GAAoC;gBAC/C,CAAC,CAAC,KAAK,EAAE,oBAAoB,CAAC,EAAE,QAAQ,CAAC;gBACzC,CAAC,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE,SAAS,CAAC;aAC1C,CAAC;YACF,OAAO,MAAM,CAAC;QACf,CAAC;KACD,CAAC;AACH,CAAC;AA5BD,sDA4BC;AAED,SAAgB,0BAA0B,CACzC,KAAa,EACb,CAAS,EACT,CAAS,EACT,GAAgB,EAChB,EAAM;IAEN,MAAM,QAAQ,GAAG,qBAAqB,CAAQ,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,OAAO;QACN,EAAE;QACF,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC;QACnC,QAAQ,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;QACzC,KAAK,EAAE,QAAQ;QACf,SAAS,EAAE,OAAO;QAClB,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtE,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,UAAU;QACnB,GAAG;KACH,CAAC;AACH,CAAC;AAnBD,gEAmBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { SetOperations, Pair } from \"./bspSet\";\n\n/** Represents a half-open interval [a, b) */\nexport type Ivl<Index extends number = number> = Pair<Index>;\n\n/** A much faster version of `Math.max` specialized to two numeric arguments. */\nconst fastMax = <Index extends number>(x1: Index, x2: Index): Index => (x1 < x2 ? x2 : x1);\n\n/** A much faster version of `Math.min` specialized to two numeric arguments. */\nconst fastMin = <Index extends number>(x1: Index, x2: Index): Index => (x1 < x2 ? x1 : x2);\n\nexport function ivlJoin<Index extends number>(ivl1: Ivl<Index>, ivl2: Ivl<Index>): Ivl<Index> {\n\tconst [x1a, x1b] = ivl1;\n\tconst [x2a, x2b] = ivl2;\n\treturn [fastMin(x1a, x2a), fastMax(x1b, x2b)];\n}\n\nexport function ivlMeets(ivl1: Ivl, ivl2: Ivl): boolean {\n\tconst [x1a, x1b] = ivl1;\n\tconst [x2a, x2b] = ivl2;\n\treturn fastMax(x1a, x2a) < fastMin(x1b, x2b);\n}\n\nexport function ivlMeetsOrTouches(ivl1: Ivl, ivl2: Ivl): boolean {\n\tconst [x1a, x1b] = ivl1;\n\tconst [x2a, x2b] = ivl2;\n\treturn fastMax(x1a, x2a) <= fastMin(x1b, x2b);\n}\n\n/** computes the set difference on intervals. Precondition: they meet */\nexport function ivlExcept<Index extends number>(\n\tivl1: Ivl<Index>,\n\tivl2: Ivl<Index>,\n): Ivl<Index> | undefined {\n\tconst [x1a, x1b] = ivl1;\n\tconst [x2a, x2b] = ivl2;\n\tif (x1a < x2a && x2b >= x1b) {\n\t\treturn [x1a, x2a];\n\t}\n\tif (x1a >= x2a && x2b < x1b) {\n\t\treturn [x2b, x1b];\n\t}\n\treturn undefined;\n}\n\nfunction ivlMeet<Index extends number>(ivl1: Ivl<Index>, ivl2: Ivl<Index>): Ivl<Index> {\n\tconst [x1a, x1b] = ivl1;\n\tconst [x2a, x2b] = ivl2;\n\treturn [fastMax(x1a, x2a), fastMin(x1b, x2b)];\n}\n\nexport function ivlCompare<Index extends number>(\n\tivl1: Ivl<Index>,\n\tivl2: Ivl<Index>,\n): -1 | 0 | 1 | undefined {\n\tconst [x1a, x1b] = ivl1;\n\tconst [x2a, x2b] = ivl2;\n\tif (x1a === x2a && x1b === x2b) {\n\t\treturn 0;\n\t}\n\tif (x1a >= x2a && x1b <= x2b) {\n\t\treturn -1;\n\t}\n\tif (x1a <= x2a && x1b >= x2b) {\n\t\treturn 1;\n\t}\n\treturn undefined;\n}\n\nexport interface Distribution {\n\t/** The cummulative distribution function. This is used to compute the probabilty mass of a given interval. */\n\treadonly cdf: (x: number) => number;\n\n\t/** The inverse cummulative distribution function. This is used to estimate a point given a quantile. */\n\treadonly invCdf: (x: number) => number;\n}\n\n/** This is a bounded pareto distribution with a shape parameter `alpha`, a lower bound `L` and an upper bound `H`.\n * It has good properties for being used as a space splitting function in sofar, as it causes the indices to grow\n * exponentially. This behavior guarantees `O(log k)` as worst-case execution time when it's used as a space-splitting\n * function.\n *\n * On the other hand, we now can use it to approximate the access to grids better than just binary search, a\n * similar argument as for using exponential search. But we can use it to give exact probability masses for arbitrary\n * intervals. This allows us to search in both dimensions of a grid and use the probability mass to decide what axis\n * to cut next.\n */\nexport function boundedPareto(alpha: number, L: number, H: number): Distribution {\n\tconst lAlpha = L ** alpha;\n\tconst cdfDenom = 1 - (L / H) ** alpha;\n\tconst hAlpha = H ** alpha;\n\tconst hlAlpha = hAlpha * lAlpha;\n\tconst hAlphaSubLAlpha = hAlpha - lAlpha;\n\tconst negAlphaInv = -1 / alpha;\n\n\tconst cdf =\n\t\talpha === 1\n\t\t\t? (x: number) => (1 - lAlpha / x) / cdfDenom\n\t\t\t: (x: number) => (1 - lAlpha * x ** -alpha) / cdfDenom;\n\tconst invCdf =\n\t\talpha === 1\n\t\t\t? (y: number) => 1 / ((hAlpha - y * hAlphaSubLAlpha) / hlAlpha)\n\t\t\t: (y: number) => ((hAlpha - y * hAlphaSubLAlpha) / hlAlpha) ** negAlphaInv;\n\n\treturn { cdf, invCdf };\n}\n\n/** Creates a dimension splitter that operates on integer interval values and is based on a bounded Pareto\n * distribution. */\nexport function boundedParetoSplitter<Index extends number>(\n\talpha: number,\n\tL: number,\n\tH: number,\n): DimensionSplitter<Pair<Index>> {\n\tconst distribution = boundedPareto(alpha, L, H);\n\treturn {\n\t\tcanSplit: ([keyLb, keyUb]) => keyUb - keyLb > 1,\n\t\tsplit([keyLb, keyUb]: Pair<Index>) {\n\t\t\tconst ubCdf = distribution.cdf(keyUb);\n\t\t\tconst lbCdf = distribution.cdf(keyLb + 1);\n\t\t\tconst cuttingPoint = distribution.invCdf((ubCdf + lbCdf) / 2);\n\t\t\t// pick a cutting point, but making sure either side has at least one element in it.\n\t\t\tconst discreteCuttingPoint = Math.min(\n\t\t\t\tMath.max(Math.round(cuttingPoint), keyLb + 1),\n\t\t\t\tkeyUb - 1,\n\t\t\t) as Index;\n\n\t\t\tconst leftProb = distribution.cdf(discreteCuttingPoint) - distribution.cdf(keyLb + 1);\n\t\t\tconst rightProb = distribution.cdf(keyUb) - distribution.cdf(discreteCuttingPoint);\n\n\t\t\tconst result: Pair<Pair<Pair<Index>, number>> = [\n\t\t\t\t[[keyLb, discreteCuttingPoint], leftProb],\n\t\t\t\t[[discreteCuttingPoint, keyUb], rightProb],\n\t\t\t];\n\t\t\treturn result;\n\t\t},\n\t};\n}\n\nexport function boundedParetoSetOperations<Index extends number, Id>(\n\talpha: number,\n\tL: number,\n\tH: number,\n\ttop: Pair<Index>,\n\tid: Id,\n): SetOperations<Pair<Index>, Id> {\n\tconst splitter = boundedParetoSplitter<Index>(alpha, L, H);\n\treturn {\n\t\tid,\n\t\tsplit: (key) => splitter.split(key),\n\t\tcanSplit: (key) => splitter.canSplit(key),\n\t\tmeets: ivlMeets,\n\t\tintersect: ivlMeet,\n\t\tunion: (x, y) => (ivlMeetsOrTouches(x, y) ? ivlJoin(x, y) : undefined),\n\t\texcept: ivlExcept,\n\t\tcompare: ivlCompare,\n\t\ttop,\n\t};\n}\n\nexport interface DimensionSplitter<Key> {\n\t/** For a given key, returns if the key can be further sub-divided. */\n\tcanSplit(key: Key): boolean;\n\t/** Splits a key and returns the probability mass for either half. */\n\tsplit(key: Key): Pair<Pair<Key, number>>;\n}\n"]}

package/lib/bspSet.d.ts

@@ -1,125 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/** An interface for representing a readonly pair */
-export declare type Pair<S, T = S> = readonly [S, T];
-export declare const pair: <S, T = S>(left: S, right: T) => Pair<S, T>;
-export declare enum SetKind {
-    Dense = 0,
-    Empty = 1
-}
-interface TreeNode<Left, Right> {
-    readonly left: Left;
-    readonly right: Right;
-}
-interface KeyNode<Key, Exact> {
-    readonly key: Key;
-    readonly pathKey: Key;
-    readonly isExact: Exact;
-}
-export declare type Empty = SetKind.Empty;
-/** The term *Dense* means that a given subset contains all the elements of its particular
- * bounds. E.g. the whole set would be dense w.r.t. the bounds of the whole space. Or
- * if a set represents an interval [a, b), then it would be dense, if there are no holes in it,
- * i.e. the set is represented exactly using the current bounds.
- */
-export declare type Dense = SetKind.Dense;
-export declare const dense = SetKind.Dense;
-export declare const empty = SetKind.Empty;
-declare type KeyUnexact<Key> = KeyNode<Key, false>;
-/** In the BSP-set, each node carries with it implicit bounds just by the position in the tree.
- * Furthermore, it can carry around a key. The key can either be an approximation, i.e. an upper bound
- * or it can be *exact*. Exact means, that the whole set can be exactly represented in terms of just the key.
- *
- * One might wonder, why we don't prune the tree at this point. This has to do with the fact that we are
- * representing arbitrary sets and so even though one of two sets could be represented exactly the other
- * might not be able to yet. In this case we need to unfold the key by splitting further. In order to avoid
- * excessive splitting and pruning, we just carry around the key but allow the tree to also be materialized, on-demand.
- */
-declare type KeyExact<Key> = KeyNode<Key, true>;
-declare type KeyUndefined = KeyNode<undefined, false>;
-declare type KeyDefined<Key> = KeyUnexact<Key> | KeyExact<Key>;
-declare type BalancePropertyHelper<Key, Left, Right> = TreeNode<UntypedSparse<Key> | Left, UntypedSparse<Key> | Right>;
-declare type TreeDefined<Key> = BalancePropertyHelper<Key, Empty, Dense> | BalancePropertyHelper<Key, Dense, Empty>;
-declare type TreeUndefined = TreeNode<undefined, undefined>;
-declare type KeyDefinednessProperty<Key> = KeyDefined<Key> | KeyUndefined;
-export declare type UntypedSparse<Key> = (KeyDefinednessProperty<Key> & TreeDefined<Key>) | (KeyDefined<Key> & TreeUndefined);
-/** The term *untyped* refers to the tree representation of a BSP set. Because BSP set trees are only compared in terms
- * of their structure, we need to ensure that cuts occur at the same exact points across all possible sets. This is
- * enforced by the fact, that at construction time, we attach an `Id` to each BSP set and only allow operations to
- * occur on sets with the same `Id`.
- *
- * The BSP set becomes *untyped*, when we drop that `Id`; now it is possible to operate on sets that are incompatible.
- * Doing this, however, allows us to store the set operations only once per set as opposed to carrying them around with
- * every node.
- */
-export declare type UntypedBspSet<Key> = Empty | Dense | UntypedSparse<Key>;
-/** A set is considred *sparse*, if we know that w.r.t. to it's bounds it is neither empty, nor dense. */
-interface Sparse<Key extends Cachable<Key>, Id> {
-    setOperations: SetOperations<Key, Id>;
-    root: UntypedSparse<Key>;
-}
-export declare type BspSet<Key extends Cachable<Key>, Id> = Empty | Dense | Sparse<Key, Id>;
-export interface KeyCache<T> {
-    depth?: number;
-    split?: Pair<Pair<CachedKey<T>, number>>;
-}
-export declare type CachedKey<T> = T & KeyCache<T>;
-export declare type Cachable<T> = Disjoint<keyof T, keyof KeyCache<T>>;
-export declare type Disjoint<T, U> = [T, U] extends [Exclude<T, U>, Exclude<U, T>] ? any : never;
-export declare type RequireAtLeastOne<T> = {
-    [K in keyof T]-?: Required<Pick<T, K>> & Partial<Pick<T, Exclude<keyof T, K>>>;
-}[keyof T];
-/** This is a concrete set operations implementation, tagged with an arbitrary id. */
-export interface SetOperations<Key extends Cachable<Key>, Id> {
-    /** Id here is just a phantom type, so that we can associate the various set instances together */
-    readonly id: Id;
-    /** Split the key into two. This will only be called when the current key is incomparable with an element.
-     * E.g. this would never be called if the key is already a 1x1 rectangle. */
-    readonly split: (key: CachedKey<Key>) => Pair<Pair<CachedKey<Key>, number>>;
-    /** Tells, if a given key can be split further */
-    readonly canSplit: (key: CachedKey<Key>) => boolean;
-    /** Tells if two keys overlap at all. */
-    readonly meets: (key1: Key, key2: Key) => boolean;
-    /** Intersect the keys, if it is possible to exactly respresent their intersection.
-     * An implementation is never required to compute the intersection as this is just an optimization.
-     * Precondition: It is guaranteed that the keys meet and that they are incomparable.
-     */
-    readonly intersect: (key1: Key, key2: Key) => Key | undefined;
-    /** Unions the keys, if it is possible to exactly represent their union.
-     * An implementation is never required to compute the union as this is just an optimization.
-     * Precondition: It is guaranteed that the keys are incomparable.
-     */
-    readonly union: (key1: Key, key2: Key) => Key | undefined;
-    /** Computes the set difference between two keys, if it is possible to exactly represent their set difference.
-     * An implementation is never required to compute the difference as this is just an optimization.
-     * Precondition: It is guaranteed that the keys meet.
-     */
-    readonly except: (key1: Key, key2: Key) => Key | undefined;
-    /** Compare two keys */
-    readonly compare: (key1: Key, key2: Key) => -1 | 0 | 1 | undefined;
-    /** The top element of the set. */
-    readonly top: Key;
-}
-export declare const cacheKeySplitting: <Key>(splitFunction: (key: CachedKey<Key>) => Pair<Pair<CachedKey<Key>, number>, Pair<CachedKey<Key>, number>>, top: CachedKey<Key>, maxDepth?: number) => (key: CachedKey<Key>) => Pair<Pair<CachedKey<Key>, number>, Pair<CachedKey<Key>, number>>;
-export declare function fromUntyped<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, root: UntypedBspSet<Key>): BspSet<Key, Id>;
-export declare function lazy<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, pathKey: Key, key: Key): UntypedBspSet<Key>;
-export declare function createFromKey<Key extends Cachable<Key>, Id>(uncachedSetOperations: SetOperations<Key, Id>): (key: Key) => BspSet<Key, Id>;
-export declare function unionUntyped<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, left: UntypedBspSet<Key>, right: UntypedBspSet<Key>): UntypedBspSet<Key>;
-export declare function union<Key extends Cachable<Key>, Id>(left: BspSet<Key, Id>, right: BspSet<Key, Id>): BspSet<Key, Id>;
-export declare function intersectUntyped<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, left: UntypedBspSet<Key>, right: UntypedBspSet<Key>): UntypedBspSet<Key>;
-export declare function intersect<Key extends Cachable<Key>, Id>(left: BspSet<Key, Id>, right: BspSet<Key, Id>): BspSet<Key, Id>;
-export declare function meetsUntyped<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, left: UntypedBspSet<Key>, right: UntypedBspSet<Key>): boolean;
-export declare function meets<Key extends Cachable<Key>, Id>(left: BspSet<Key, Id>, right: BspSet<Key, Id>): boolean;
-export declare function exceptUntyped<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, left: UntypedBspSet<Key>, right: UntypedBspSet<Key>): UntypedBspSet<Key>;
-export declare function except<Key extends Cachable<Key>, Id>(left: BspSet<Key, Id>, right: BspSet<Key, Id>): BspSet<Key, Id>;
-export declare function combineCmp(left: -1 | 0 | 1 | undefined, right: -1 | 0 | 1 | undefined): 0 | 1 | -1 | undefined;
-export declare function compareUntyped<Key extends Cachable<Key>, Id>(setOperations: SetOperations<Key, Id>, left: UntypedBspSet<Key>, right: UntypedBspSet<Key>): -1 | 0 | 1 | undefined;
-export declare function compare<Key extends Cachable<Key>, Id>(left: BspSet<Key, Id>, right: BspSet<Key, Id>): 0 | 1 | -1 | undefined;
-export declare const symmetricDiff: <Key extends Disjoint<keyof Key, keyof KeyCache<T>>, Id>(left: BspSet<Key, Id>, right: BspSet<Key, Id>) => BspSet<Key, Id>;
-export declare const complement: <Key extends Disjoint<keyof Key, keyof KeyCache<T>>, Id>(set: BspSet<Key, Id>) => BspSet<Key, Id>;
-export declare function getNodeCount<Key extends Cachable<Key>, Id>(set: BspSet<Key, Id>): number;
-export declare function forEachKey<Key extends Cachable<Key>, Id>(set: Empty | Sparse<Key, Id>, f: (key: Key) => boolean): boolean;
-export {};
-//# sourceMappingURL=bspSet.d.ts.map

package/lib/bspSet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bspSet.d.ts","sourceRoot":"","sources":["../src/bspSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,oDAAoD;AACpD,oBAAY,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAE7C,eAAO,MAAM,IAAI,6CAA6D,CAAC;AAK/E,oBAAY,OAAO;IAClB,KAAK,IAAA;IACL,KAAK,IAAA;CACL;AAED,UAAU,QAAQ,CAAC,IAAI,EAAE,KAAK;IAC7B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;CACtB;AAED,UAAU,OAAO,CAAC,GAAG,EAAE,KAAK;IAC3B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;IAClB,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC;CACxB;AAED,oBAAY,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;AAElC;;;;GAIG;AACH,oBAAY,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;AAElC,eAAO,MAAM,KAAK,gBAAgB,CAAC;AACnC,eAAO,MAAM,KAAK,gBAAgB,CAAC;AAEnC,aAAK,UAAU,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAE3C;;;;;;;;GAQG;AACH,aAAK,QAAQ,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAExC,aAAK,YAAY,GAAG,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AAC9C,aAAK,UAAU,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;AAEvD,aAAK,qBAAqB,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,IAAI,QAAQ,CACtD,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,EACzB,aAAa,CAAC,GAAG,CAAC,GAAG,KAAK,CAC1B,CAAC;AAEF,aAAK,WAAW,CAAC,GAAG,IACjB,qBAAqB,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,GACxC,qBAAqB,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAC5C,aAAK,aAAa,GAAG,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;AAEpD,aAAK,sBAAsB,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC;AAElE,oBAAY,aAAa,CAAC,GAAG,IAC1B,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,GAChD,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC;AACrC;;;;;;;;GAQG;AACH,oBAAY,aAAa,CAAC,GAAG,IAAI,KAAK,GAAG,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;AAEpE,yGAAyG;AACzG,UAAU,MAAM,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE;IAC7C,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACtC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC;CACzB;AACD,oBAAY,MAAM,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AAEpF,MAAM,WAAW,QAAQ,CAAC,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACzC;AACD,oBAAY,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC3C,oBAAY,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAE/D,oBAAY,QAAQ,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC;AACzF,oBAAY,iBAAiB,CAAC,CAAC,IAAI;KACjC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAC9E,CAAC,MAAM,CAAC,CAAC,CAAC;AAEX,qFAAqF;AACrF,MAAM,WAAW,aAAa,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE;IAC3D,kGAAkG;IAClG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC;IAEhB;gFAC4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAE5E,iDAAiD;IACjD,QAAQ,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC;IAEpD,wCAAwC;IACxC,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,KAAK,OAAO,CAAC;IAElD;;;OAGG;IACH,QAAQ,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,GAAG,SAAS,CAAC;IAE9D;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,GAAG,SAAS,CAAC;IAE1D;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,GAAG,SAAS,CAAC;IAE3D,uBAAuB;IACvB,QAAQ,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEnE,kCAAkC;IAClC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;CAClB;AAED,eAAO,MAAM,iBAAiB,kJAIlB,MAAM,8FAgBhB,CAAC;AAEH,wBAAgB,WAAW,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACxD,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,GACtB,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAKjB;AAkBD,wBAAgB,IAAI,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACjD,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,OAAO,EAAE,GAAG,EACZ,GAAG,EAAE,GAAG,GACN,aAAa,CAAC,GAAG,CAAC,CAwBpB;AAED,wBAAgB,aAAa,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAC1D,qBAAqB,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,SAMhC,GAAG,qBAChB;AAiFD,wBAAgB,YAAY,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACzD,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,aAAa,CAAC,GAAG,CAAC,CA4BpB;AAED,wBAAgB,KAAK,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAClD,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EACrB,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,GACpB,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAkBjB;AA2BD,wBAAgB,gBAAgB,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAC7D,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,aAAa,CAAC,GAAG,CAAC,CA4BpB;AAED,wBAAgB,SAAS,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACtD,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EACrB,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,GACpB,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAkBjB;AAED,wBAAgB,YAAY,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACzD,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,OAAO,CAkBT;AAED,wBAAgB,KAAK,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAClD,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EACrB,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,GACpB,OAAO,CAQT;AAsBD,wBAAgB,aAAa,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAC1D,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,aAAa,CAAC,GAAG,CAAC,CA6BpB;AAED,wBAAgB,MAAM,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACnD,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EACrB,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,GACpB,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAqBjB;AAQD,wBAAgB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,0BAWrF;AAED,wBAAgB,cAAc,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAC3D,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,EAAE,CAAC,EACrC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,EACxB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CA2CxB;AAED,wBAAgB,OAAO,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACpD,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EACrB,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,0BA2BtB;AAED,eAAO,MAAM,aAAa,4HAG0B,CAAC;AAErD,eAAO,MAAM,UAAU,mGACJ,CAAC;AAUpB,wBAAgB,YAAY,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,UAK/E;AA0BD,wBAAgB,UAAU,CAAC,GAAG,SAAS,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EACvD,GAAG,EAAE,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAC5B,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,GACtB,OAAO,CAKT"}