@oasys/oecs 0.3.1 → 0.5.0

package/dist/core/ecs/query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/query.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA2CK;AAEL,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACpD,OAAO,KAAK,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAGzC,OAAO,KAAK,EACX,YAAY,EACZ,eAAe,EACf,WAAW,EACX,uBAAuB,EACvB,gBAAgB,EAChB,eAAe,EAEf,QAAQ,EACR,iBAAiB,EACjB,MAAM,aAAa,CAAC;AAErB,OAAO,KAAK,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAC5F,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,KAAK,EACX,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,WAAW,EACX,cAAc,EACd,kBAAkB,EAClB,mBAAmB,EACnB,oBAAoB,EACpB,qBAAqB,EACrB,oBAAoB,EACpB,qBAAqB,EACrB,UAAU,EACV,MAAM,UAAU,CAAC;AAClB,OAAO,EAAa,KAAK,YAAY,EAAE,KAAK,oBAAoB,EAAE,MAAM,OAAO,CAAC;AAChF,OAAO,KAAK,EAGX,QAAQ,EACR,WAAW,EACX,UAAU,EACV,SAAS,EACT,MAAM,SAAS,CAAC;AACjB,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAc,MAAM,uBAAuB,CAAC;AAO3D;;;;;yEAKyE;AACzE,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,MAAM,EAAE,cAAc,GAAG,IAAI,CAAC;IAC9B;+CAC2C;IAC3C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC;+CAC2C;IAC3C,QAAQ,CAAC,GAAG,EAAE,eAAe,EAAE,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC;IACpD;uCACmC;IACnC,sBAAsB,IAAI,MAAM,CAAC;IACjC,2EAA2E;IAC3E,mBAAmB,CAClB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,eAAe,EAAE,SAAS,SAAS,EAAE,EACrC,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,EAChC,eAAe,EAAE,OAAO,GACtB,IAAI,CAAC;IACR,4DAA4D;IAC5D,2BAA2B,CAC1B,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,eAAe,EAAE,OAAO,EACxB,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,GAC9B,IAAI,CAAC;IACR,gEAAgE;IAChE,sBAAsB,CACrB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,eAAe,EAAE,SAAS,SAAS,EAAE,EACrC,QAAQ,EAAE,WAAW,EACrB,QAAQ,EAAE,MAAM,EAChB,eAAe,EAAE,OAAO,EACxB,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,GAC9B,IAAI,CAAC;CACR;AAED,MAAM,WAAW,eAAe;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;CAClB;AAED;;;;;;;;;;;mEAWmE;AACnE,qBAAa,UAAU;IAItB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwC;IAK9D,SAAgB,SAAS,0BAAiC;IAC1D,SAAgB,SAAS,0BAAiC;IAC1D,SAAgB,WAAW,0BAAiC;IAC5D,SAAgB,aAAa,iCAAwC;IAGrE,SAAgB,cAAc,0BAAiC;IAI/D,SAAgB,gBAAgB,0BAAiC;IACjE,SAAgB,mBAAmB,0BAAiC;IAKpE,SAAgB,kBAAkB,0BAAiC;IACnE,SAAgB,qBAAqB,0BAAiC;IAGtE,SAAgB,qBAAqB,0BAAiC;IAMtE,SAAgB,eAAe,0BAAiC;IAEhE;iCAC6B;IACtB,SAAS,CACf,GAAG,EAAE,MAAM,EACX,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,GAClB,eAAe,GAAG,SAAS;IAqB9B,yDAAyD;IAClD,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,GAAG,IAAI;CAG1D;AAED,MAAM,WAAW,aAAa;IAC7B,aAAa,CACZ,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,IAAI,EAAE,SAAS,YAAY,EAAE,GAC3B,KAAK,CAAC,GAAG,CAAC,CAAC;IACd,eAAe,IAAI,MAAM,CAAC;IAC1B,wFAAwF;IACxF,eAAe,IAAI,MAAM,CAAC;IAC1B,mBAAmB,IAAI,MAAM,CAAC;IAC9B,YAAY,IAAI,MAAM,CAAC;IACvB;6DACyD;IACzD,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC;IAC7B;;;;;;;;0BAQsB;IACtB,mBAAmB,CAClB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,eAAe,EAAE,SAAS,SAAS,EAAE,EACrC,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,EAChC,eAAe,EAAE,OAAO,GACtB,IAAI,CAAC;IACR;;yBAEqB;IACrB,wBAAwB,CAAC,GAAG,EAAE,WAAW,GAAG,iBAAiB,CAAC;IAC9D;;;mCAG+B;IAC/B,2BAA2B,CAC1B,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,eAAe,EAAE,OAAO,EACxB,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,GAC9B,IAAI,CAAC;IACR;;;;;;qDAMiD;IACjD,sBAAsB,CACrB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,aAAa,EAAE,SAAS,iBAAiB,EAAE,EAC3C,eAAe,EAAE,SAAS,SAAS,EAAE,EACrC,QAAQ,EAAE,WAAW,EACrB,QAAQ,EAAE,MAAM,EAChB,eAAe,EAAE,OAAO,EACxB,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,GAC9B,IAAI,CAAC;CACR;AAgBD;kEACkE;AAClE,eAAO,MAAM,mBAAmB,QAA2B,CAAC;AAE5D;;;mCAGmC;AACnC,MAAM,WAAW,aAAa;IAC7B,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B;uFACmF;IACnF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAwDD;;;;;;;;;GASG;AACH,qBAAa,YAAY,CAAC,GAAG,CAAC,IAAI,SAAS,SAAS,YAAY,CAAC,GAAG,CAAC,EAAE,GAAG,SAAS,YAAY,CAAC,GAAG,CAAC,EAAE;IACrG,gBAAgB,CAAC,KAAK,EAAG,SAAS,CAAC;IACnC,gBAAgB,CAAC,KAAK,SAAK;IAE3B;wEACoE;IAC7D,GAAG,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EACrC,GAAG,EAAE,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,GACjC,uBAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAIvC;wEACoE;IAC7D,IAAI,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EACtC,GAAG,EAAE,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,GACjC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;CAGhC;AAED,qBAAa,KAAK,CAAC,IAAI,SAAS,SAAS,YAAY,EAAE;IACtD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAc;IAI1C,SAAgB,KAAK,EAAE,IAAI,CAAC;IAC5B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAgB;IAC1C,SAAgB,QAAQ,EAAE,MAAM,CAAC;IACjC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAgB;IACzC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgB;IACvC,OAAO,CAAC,mBAAmB,CAAmB;IAO9C,OAAO,CAAC,cAAc,CAAc;IAGpC,SAAgB,GAAG,EAAE,MAAM,CAAC;IAO5B,SAAgB,cAAc,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAC7D,SAAgB,cAAc,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAW7D,SAAgB,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IASlD,SAAgB,gBAAgB,EAAE,OAAO,CAAC;IAQ1C,SAAgB,iBAAiB,EAAE,SAAS,WAAW,EAAE,CAAC;IAC1D,SAAgB,iBAAiB,EAAE,SAAS,WAAW,EAAE,CAAC;IAU1D,SAAgB,UAAU,EAAE,aAAa,GAAG,IAAI,CAAC;gBAGhD,UAAU,EAAE,SAAS,EAAE,EACvB,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,aAAa,EACvB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,EAAE,EAAE,MAAM,EACV,aAAa,GAAE,SAAS,iBAAiB,EAAoB,EAC7D,aAAa,GAAE,SAAS,iBAAiB,EAAoB,EAC7D,QAAQ,GAAE,SAAS,WAAW,EAAsB,EACpD,eAAe,GAAE,OAAe,EAChC,gBAAgB,GAAE,SAAS,WAAW,EAAsB,EAC5D,gBAAgB,GAAE,SAAS,WAAW,EAAsB,EAC5D,SAAS,GAAE,aAAa,GAAG,IAAW;IAkBvC;;;;;;;iCAO6B;IAC7B,OAAO,CAAC,gBAAgB;IAexB;6EACyE;IACzE,OAAO,CAAC,YAAY;IAUpB;;;;;;0EAMsE;IAC/D,WAAW,IAAI,QAAQ,GAAG,SAAS;IAgB1C;;;4CAGwC;IACjC,YAAY,IAAI,QAAQ;IAc/B,+DAA+D;IAC/D,OAAO,CAAC,aAAa;IAQrB,4DAA4D;IAC5D,IAAW,cAAc,IAAI,MAAM,CAGlC;IAED;;;kBAGc;IACd,IAAW,WAAW,IAAI,MAAM,CAU/B;IACD,IAAW,UAAU,IAAI,SAAS,aAAa,CAAC,IAAI,CAAC,EAAE,CAEtD;IAED;;;;;;;;;;kFAU8E;IAC9E,OAAO,CAAC,cAAc;IA8BtB,mEAAmE;IAC5D,GAAG,CAAC,CAAC,SAAS,YAAY,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAmBzE;;;;;wCAKoC;IACpC,OAAO,CAAC,QAAQ;IAchB,4DAA4D;IACrD,OAAO,CAAC,GAAG,KAAK,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAerD,oFAAoF;IACpF,OAAO,CAAC,QAAQ;IAUhB;;;;gFAI4E;IACrE,UAAU,CAAC,GAAG,IAAI,EAAE,kBAAkB,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAc7D;;kFAE8E;IAC9E,OAAO,CAAC,cAAc;IAatB;yEACqE;IAC9D,aAAa,CAAC,GAAG,IAAI,EAAE,kBAAkB,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAUhE;2EACuE;IACvE,OAAO,CAAC,iBAAiB;IAazB;;;;;mBAKe;IACf,OAAO,CAAC,aAAa;IAsBrB;;;;;;;;;6EASyE;IAClE,YAAY,CAAC,GAAG,IAAI,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAOxD,OAAO,CAAC,gBAAgB;IAgBxB;;mDAE+C;IACxC,eAAe,CAAC,GAAG,IAAI,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAO3D,OAAO,CAAC,mBAAmB;IAgB3B;;;qFAGiF;IACjF,OAAO,CAAC,eAAe;IAwBvB;;;;;;;;;;;;;;;;;;;8EAmB0E;IACnE,SAAS,CACf,QAAQ,EAAE,WAAW,CAAC,WAAW,CAAC,EAClC,QAAQ,GAAE,MAA4B,GACpC,KAAK,CAAC,IAAI,CAAC;IAmCd;;uFAEmF;IACnF,OAAO,CAAC,gBAAgB;IAmBxB;;;;0DAIsD;IACtD,OAAO,CAAC,oBAAoB;IAS5B;;;;;;;;;;sEAUkE;IAC3D,gBAAgB,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,GAAG,IAAI;IAiBjF;;;;;;;;;;;;;+EAa2E;IACpE,QAAQ,CAAC,GAAG,IAAI,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAUrD;;0CAEsC;IACtC,OAAO,CAAC,YAAY;IAUpB;;sFAEkF;IAClF,OAAO,CAAC,eAAe;IAmBvB;;;;;;6EAMyE;IAClE,eAAe,IAAI,KAAK,CAAC,IAAI,CAAC;IAyB9B,OAAO,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI;IA2C7D;;;sFAGkF;IAClF,OAAO,CAAC,uBAAuB;IAS/B;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACI,SAAS,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAiB7E;;;;;;iCAM6B;IAC7B,OAAO,CAAC,eAAe;IA8BvB;;;;;;;;;OASG;IACI,YAAY,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,OAAO,GAAG,OAAO;IAYxE;;2BAEuB;IACvB,OAAO,CAAC,kBAAkB;IA2B1B;;;iFAG6E;IAC7E,OAAO,CAAC,aAAa;IA8BrB;;;;;;;;;;;;;;;;yEAgBqE;IAC9D,aAAa,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,GAAG,IAAI;IAoC5D;;;;;;;;;;;;;;;0DAesD;IAC/C,SAAS,IAAI,SAAS,EAAE;IAM/B;;;;;kDAK8C;IAC9C,OAAO,CAAC,gBAAgB;IAoBxB,gDAAgD;IACzC,KAAK,CAAC,GAAG,KAAK,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC;IAiBnD,sFAAsF;IACtF,OAAO,CAAC,UAAU;IAUlB;;;;;;;;;;;6DAWyD;IAClD,OAAO,CAAC,GAAG,IAAI,EAAE,YAAY,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC;IAa3D,wFAAwF;IACxF,OAAO,CAAC,YAAY;IAMpB,6DAA6D;IACtD,eAAe,IAAI,MAAM;CAGhC;AAED,qBAAa,YAAY;IACZ,OAAO,CAAC,QAAQ,CAAC,SAAS;gBAAT,SAAS,EAAE,aAAa;IAE9C,IAAI,CAAC,CAAC,SAAS,YAAY,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;CAK3D;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,MAAM,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,GACvD,CAAC,GAAG;IAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAA;CAAE,GACnF,KAAK,CAAC;AAET;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,QAAQ,CAAC,GAAG,CAAC,CAAC,SAAS,YAAY,GAAG,YAAY;IAClD,OAAO,CAAC,QAAQ,CAAC,KAAK;gBAAL,KAAK,EAAE,KAAK;IAEzC;;;;;sDAKkD;IAC3C,KAAK,CAAC,GAAG,KAAK,EAAE,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,QAAQ;IAcjE;yBACqB;IACd,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,KAAK,EAAE,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,IAAI;IAC/E;;;uCAGmC;IAC5B,GAAG,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EACrC,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,GAAG,MAAM,EAAE,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GACrC,IAAI;IA6BP,qCAAqC;IAC9B,MAAM,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI;IAOnG,oCAAoC;IAC7B,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;IAW7C;;;;;6CAKyC;IAClC,OAAO,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAMxC;6DACyD;IAClD,MAAM,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI;CAKvC;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,aAAa,CAAC,GAAG,CAAC,CAAC,SAAS,YAAY,GAAG,YAAY;IAkBvD,OAAO,CAAC,QAAQ,CAAC,KAAK;IAjB3B,WAAW,EAAE,MAAM,CAAK;IAE/B,0DAA0D;IAC1D,SAAgB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEtC,+DAA+D;IAC/D,IAAW,OAAO,IAAI,MAAM,CAE3B;IAED;;+EAE2E;IAC3E,IAAW,MAAM,IAAI,cAAc,GAAG,IAAI,CAEzC;gBAE4B,KAAK,EAAE,KAAK;IAIlC,OAAO,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IAIpC,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,GAAG,OAAO;IAI5D,QAAQ,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EAC1C,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3B,KAAK,EAAE,MAAM,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC,GAC/B,MAAM;IAUT;;;sFAGkF;IAC3E,WAAW,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EAC7C,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3B,KAAK,EAAE,MAAM,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC,GAC/B,MAAM,GAAG,SAAS;IAQd,QAAQ,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EAC1C,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjC,KAAK,EAAE,MAAM,GACX,IAAI;IAeP;;;;;wDAKoD;IAC7C,WAAW,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EAC7C,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC,EACjC,EAAE,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,GAC7B,MAAM;IAcT;;;;;;;;;OASG;IACI,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI;IAI/D;;;;OAIG;IACI,GAAG,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EACrC,GAAG,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC5B,QAAQ,EAAE,QAAQ,GAChB,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAkB5B;;;;;;;OAOG;IACI,OAAO,CAAC,CAAC,SAAS,YAAY,CAAC,GAAG,CAAC,EACzC,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3B,QAAQ,EAAE,QAAQ,GAChB,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAwBpC;2EACuE;IAChE,UAAU,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IAqB9C,2EAA2E;IACpE,SAAS,CAAC,CAAC,SAAS,kBAAkB,CAAC,GAAG,CAAC,EACjD,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,EAClC,GAAG,MAAM,EAAE,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAC3C,IAAI;IAMA,YAAY,CAAC,CAAC,SAAS,kBAAkB,CAAC,GAAG,CAAC,EACpD,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,GAChC,IAAI;IAMA,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,kBAAkB,GAAG,OAAO;IAI/D,cAAc,CAAC,CAAC,SAAS,kBAAkB,CAAC,GAAG,CAAC,EACtD,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EACjC,KAAK,EAAE,MAAM,GAAG,MAAM,cAAc,CAAC,CAAC,CAAC,GACrC,MAAM;IAKF,cAAc,CAAC,CAAC,SAAS,kBAAkB,CAAC,GAAG,CAAC,EACtD,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,EAClC,KAAK,EAAE,MAAM,GAAG,MAAM,cAAc,CAAC,CAAC,CAAC,EACvC,KAAK,EAAE,MAAM,GACX,IAAI;IAgBP,uEAAuE;IAChE,WAAW,CAAC,CAAC,SAAS,WAAW,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,GAAG,IAAI;IAMnH,kFAAkF;IAC3E,cAAc,CAAC,CAAC,SAAS,WAAW,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI;IAMvH,8EAA8E;IACvE,QAAQ,CAAC,CAAC,SAAS,WAAW,CAAC,WAAW,CAAC,EACjD,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,CAAC,GAAG,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GACjC,QAAQ,GAAG,SAAS;IAKvB,uDAAuD;IAChD,SAAS,CAAC,CAAC,SAAS,WAAW,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,EAAE;IAKvG;mEAC+D;IACxD,SAAS,CAAC,CAAC,SAAS,WAAW,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,EAAE;IAKvG,8CAA8C;IACvC,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO;IAI5D;;;;;;;;;;uEAUmE;IAC5D,KAAK,IAAI,IAAI;IAUpB;;;;;;;;;;;;OAYG;IACI,IAAI,CAAC,GAAG,EAAE,SAAS,GAAG,IAAI;IAC1B,IAAI,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAchF;;;;;;;;;;OAUG;IACI,IAAI,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAc/D,QAAQ,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,CAAC,EACzC,GAAG,EAAE,CAAC,GAAG,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GACjC,eAAe,CAAC,CAAC,CAAC;IAUd,WAAW,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,CAAC,EAC5C,GAAG,EAAE,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,EACpC,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAChC,IAAI;IAUP;;;kCAG8B;IACvB,cAAc,CAAC,CAAC,SAAS,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI;IAUtF,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO;CAGnD;AAED,qBAAa,YAAY,CAAC,IAAI,SAAS,SAAS,YAAY,EAAE;IAC7D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAc;IACrC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAW;gBAE3B,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE;IAwBpD,2DAA2D;IACpD,GAAG,CAAC,CAAC,SAAS,YAAY,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAIhF,yEAAyE;IAClE,OAAO,CAAC,GAAG,KAAK,EAAE,YAAY,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC;IAI5D,6DAA6D;IACtD,KAAK,CAAC,GAAG,KAAK,EAAE,YAAY,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC;IAI1D,oFAAoF;IAC7E,QAAQ,CAAC,GAAG,IAAI,EAAE,YAAY,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC;IAIrD,OAAO,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI;IAqD7D;8EAC0E;IAC1E,OAAO,CAAC,uBAAuB;IAS/B;;;mEAG+D;IAC/D,OAAO,CAAC,aAAa;CAyCrB"}

package/dist/core/ecs/ref.d.cts

@@ -0,0 +1,31 @@
+import { ComponentSchema } from './component.cjs';
+import { ArchetypeColumnLayout } from './archetype.cjs';
+import { AnyTypedArray, ColumnBacking } from '../../type_primitives/index.cjs';
+/** Maps component schema to scalar get/set properties: { x: number, y: number }. */
+export type ComponentRef<S extends ComponentSchema> = {
+    -readonly [K in keyof S]: number;
+};
+/**
+ * Read-only view of a component reference. This is an **advisory** barrier,
+ * not a runtime safety boundary: the `readonly` properties block field writes
+ * at the type layer, but `createRef` installs working get/set on the shared
+ * prototype for both `ref()` and `refRead()`, so a §10c-policed cast can
+ * still write through (and would skip the change-tick bump `ref()` performs).
+ * Treat it as "I promise I am only reading," enforced by the escape-hatch lint
+ * (`bun run lint:escape-hatches`), not by the runtime.
+ */
+export type ReadonlyComponentRef<S extends ComponentSchema> = {
+    readonly [K in keyof S]: number;
+};
+/** Minimal column group shape needed by createRef. */
+export interface RefColumnGroup {
+    readonly layout: ArchetypeColumnLayout;
+    readonly columns: ColumnBacking<AnyTypedArray>[];
+}
+/**
+ * Create a ComponentRef bound to a specific row in a column group.
+ * The prototype is built once per column group and cached; subsequent
+ * calls for the same group only allocate the lightweight ref object.
+ */
+export declare function createRef<S extends ComponentSchema>(group: RefColumnGroup, row: number): ComponentRef<S>;
+//# sourceMappingURL=ref.d.ts.map

package/dist/core/ecs/ref.d.ts

@@ -0,0 +1,31 @@
+import { ComponentSchema } from './component.js';
+import { ArchetypeColumnLayout } from './archetype.js';
+import { AnyTypedArray, ColumnBacking } from '../../type_primitives/index.js';
+/** Maps component schema to scalar get/set properties: { x: number, y: number }. */
+export type ComponentRef<S extends ComponentSchema> = {
+    -readonly [K in keyof S]: number;
+};
+/**
+ * Read-only view of a component reference. This is an **advisory** barrier,
+ * not a runtime safety boundary: the `readonly` properties block field writes
+ * at the type layer, but `createRef` installs working get/set on the shared
+ * prototype for both `ref()` and `refRead()`, so a §10c-policed cast can
+ * still write through (and would skip the change-tick bump `ref()` performs).
+ * Treat it as "I promise I am only reading," enforced by the escape-hatch lint
+ * (`bun run lint:escape-hatches`), not by the runtime.
+ */
+export type ReadonlyComponentRef<S extends ComponentSchema> = {
+    readonly [K in keyof S]: number;
+};
+/** Minimal column group shape needed by createRef. */
+export interface RefColumnGroup {
+    readonly layout: ArchetypeColumnLayout;
+    readonly columns: ColumnBacking<AnyTypedArray>[];
+}
+/**
+ * Create a ComponentRef bound to a specific row in a column group.
+ * The prototype is built once per column group and cached; subsequent
+ * calls for the same group only allocate the lightweight ref object.
+ */
+export declare function createRef<S extends ComponentSchema>(group: RefColumnGroup, row: number): ComponentRef<S>;
+//# sourceMappingURL=ref.d.ts.map

package/dist/core/ecs/ref.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ref.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/ref.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;KA2BK;AAEL,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE1E,oFAAoF;AACpF,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,eAAe,IAAI;IACrD,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM;CAChC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,MAAM,oBAAoB,CAAC,CAAC,SAAS,eAAe,IAAI;IAC7D,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM;CAC/B,CAAC;AAMF,sDAAsD;AACtD,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,EAAE,CAAC;CACjD;AAWD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,eAAe,EAClD,KAAK,EAAE,cAAc,EACrB,GAAG,EAAE,MAAM,GACT,YAAY,CAAC,CAAC,CAAC,CAwBjB"}

package/dist/core/ecs/relation.d.cts

@@ -0,0 +1,243 @@
+import { Brand } from '../../type_primitives/index.cjs';
+import { EntityID } from './entity.cjs';
+import { SparseComponentDef, SparseComponentStore } from './sparse_store.cjs';
+/** Relation handle id. A separate id space from `ComponentID` and
+ * `SparseComponentID` — it indexes the `RelationService` registry. The numeric
+ * value is the registration order, stable for the lifetime of the ECS. */
+export type RelationID = Brand<number, "relation_id">;
+declare const __relationBrand: unique symbol;
+/** A relation's registration-time cardinality: `exclusive` = one target per
+ * source (re-add replaces), `multi` = a target set per source. */
+export type RelationCardinality = "exclusive" | "multi";
+declare const __relationCardinality: unique symbol;
+export type RelationDef<C extends RelationCardinality = RelationCardinality> = RelationID & {
+    readonly [__relationBrand]: "relation";
+    readonly [__relationCardinality]?: [C];
+};
+/** Access sentinel for the `(*, T)` wildcard query iteration
+ * (`Query.forEachRelatedTo`, #579). A `(*, T)` term reads **every** registered
+ * relation's reverse index to find sources of `T`, so it can't name a specific
+ * relation in `relationReads` the way `withRelation(R)` (`(R, *)`) can. A
+ * system that iterates a `(*, T)` wildcard lists `ANY_RELATION` in `relationReads`
+ * instead; `accessCheck.checkRelationReadAny` honors it. The numeric value is a
+ * reserved sentinel far past any real registration-order relation id (relations are
+ * minted from 0 upward), so it can never collide with a registered relation. */
+export declare const ANY_RELATION: RelationDef;
+/** Cleanup policy applied to a relation's **sources** when one of its
+ * **targets** is destroyed (#473). Chosen per-relation at registration, run at
+ * destroy-flush (and the immediate-destroy path) off the reverse index:
+ *
+ *   - **`delete`** — cascade: destroy every source of the dead target too,
+ *     recursively for chains/trees (the canonical ChildOf case).
+ *   - **`clear`** — remove the relation from every source; the sources survive.
+ *   - **`orphan`** — leave the link intact but dangling. Reads stay safe (the
+ *     reverse index is `EntityID`-keyed, so the dead handle never aliases a
+ *     recycled slot); `targetOf` returns a dead handle until the source
+ *     re-targets or is removed. This is the pre-#473 behaviour and the default.
+ */
+export type OnDeleteTarget = "delete" | "clear" | "orphan";
+/** Default on-target-delete policy: leave the link dangling (pre-#473
+ * behaviour, zero change for callers that don't opt in). */
+export declare const DEFAULT_ON_DELETE_TARGET: OnDeleteTarget;
+/** Registration options. `exclusive` (one target per source) is the default;
+ * pass `{ multi: true }` for a multi-target relation. The two are mutually
+ * exclusive — the union makes `{ exclusive: true, multi: true }` a compile
+ * error (it also throws at runtime, for JS callers). `onDeleteTarget` selects
+ * the cleanup policy applied to sources when a target is destroyed (default
+ * `orphan`). */
+export type RelationOptions = {
+    readonly exclusive?: true;
+    readonly multi?: false;
+    readonly onDeleteTarget?: OnDeleteTarget;
+} | {
+    readonly multi: true;
+    readonly exclusive?: false;
+    readonly onDeleteTarget?: OnDeleteTarget;
+};
+/** Field name carrying the target `EntityID` on an exclusive relation's backing
+ * sparse component. Field 0 of a single-field schema. */
+export declare const RELATION_TARGET_FIELD = "target";
+/** Receives one canonical `(source index, sorted targets)` set during a fold
+ * over a multi relation's forward sets. Targets are ascending by id; empty sets
+ * are never yielded (see `forEachCanonicalTargetSet`). */
+export type CanonicalTargetSetFn = (sourceIndex: number, targets: readonly EntityID[]) => void;
+/** Receives one canonical `(source, target)` pair during a fold over a
+ * relation's forward links. Sources ascend by entity index, each source's
+ * targets ascend by id — the #470 determinism order. */
+export type CanonicalPairFn = (source: EntityID, target: EntityID) => void;
+/** Maps a source entity **index** to its full `EntityID` (generation from the
+ * live slot). Supplied by `Store`, which owns entity generations. */
+export type MakeSourceID = (index: number) => EntityID;
+/** One relation's derived side state. **Abstract over cardinality (#498):** the
+ * base owns the cardinality-agnostic **reverse index** (target → sources, keyed
+ * by full `EntityID` so a recycled slot can't alias a dead target's sources) and
+ * a handle on the backing `SparseComponentStore`; the forward representation and
+ * its sparse interaction are owned by the concrete `ExclusiveRelationStore` /
+ * `MultiRelationStore` (built by `makeRelationStore`).
+ *
+ * The registry level (`Store` + `RelationService`) owns what is genuinely its
+ * own — entity liveness, registration, and destroy orchestration — and drives
+ * a relation through the virtual `link` /
+ * `unlink` / `purgeSource` / `forEachCanonicalPair` / … without ever
+ * branching on cardinality. Each cardinality keeps forward link + reverse index
+ * + sparse membership in lockstep inside one method on one class, so the
+ * lockstep can't be broken by missing a scattered `if (rs.exclusive)` site. */
+export declare abstract class RelationStore {
+    /** `true` → one target per source (target in the sparse field); `false` →
+     * a set of targets per source. The cardinality discriminant survives as a
+     * field because it is part of the snapshot header and the traversal/`targetOf`
+     * mode guards — but the forward *mechanics* are virtual, not branched on it. */
+    readonly exclusive: boolean;
+    /** Backing sparse component def: `{ target: f64 }` when exclusive, a tag when
+     * multi. Carries membership (and the target, when exclusive). */
+    readonly sparse: SparseComponentDef;
+    /** Cleanup policy applied to this relation's sources when a target is
+     * destroyed (#473). `orphan` (the default) is a no-op — the link dangles
+     * safely. `Store` reads this at destroy-flush off `sourcesOf`. */
+    readonly onDeleteTarget: OnDeleteTarget;
+    /** The backing sparse store instance. Owned for registration/liveness by
+     * `Store`, but the relation drives the forward/membership rows on it directly
+     * — that is the cardinality interaction this class now encapsulates (#498). */
+    protected readonly _store: SparseComponentStore;
+    /** target `EntityID` → set of source `EntityID`s. Keyed by the full id, not
+     * the index, so a recycled target slot can't alias a dead target's sources.
+     * An entry is dropped the moment its set empties (`unlinkReverse`). */
+    private readonly _reverse;
+    constructor(exclusive: boolean, sparse: SparseComponentDef, store: SparseComponentStore, onDeleteTarget: OnDeleteTarget);
+    /** Record that `src` points at `tgt` in the reverse index. */
+    protected linkReverse(tgt: EntityID, src: EntityID): void;
+    /** Drop the `src → tgt` edge from the reverse index, removing the target's
+     * entry entirely once its last source is gone (so a dead-target key doesn't
+     * linger with an empty set). */
+    protected unlinkReverse(tgt: EntityID, src: EntityID): void;
+    /** Drop every reverse-index entry whose **target** is no longer alive,
+     * returning the count dropped (#491). The `orphan` policy intentionally
+     * leaves a destroyed target's reverse entry intact (the link dangles
+     * safely), so a long-lived source that orphan-points at a stream of
+     * short-lived targets and never re-targets/dies accumulates dead-target keys
+     * without bound. This is the reclaim primitive behind `Store.compactRelations`
+     * — a cold path the host calls at scene/snapshot boundaries. It is
+     * cardinality-free (reverse-index only), so it lives on the base unchanged.
+     *
+     * Pure index reclaim: the **forward** links (the exclusive sparse target
+     * field, the multi forward set) are left untouched, so `targetOf` /
+     * `targetsOf` still return the dangling dead handle exactly as `orphan`
+     * promises. The reverse index is derived, so dropping a dead-target entry
+     * changes nothing observable except `sourcesOf` on that dead handle (which
+     * goes from the dangling sources to `[]` — meaningless either way, the target
+     * is gone) and is faithfully rebuilt by snapshot/restore from the surviving
+     * forward links. Only the **target** role can leak here: a destroyed *source*
+     * is already unlinked from every reverse set by `purgeSource`, so a live
+     * target's set never holds a dead source. `isAlive` is supplied by `Store`,
+     * which owns entity liveness. Deleting during `Map` key iteration is
+     * well-defined — already-visited and not-yet-reached keys are unaffected. */
+    pruneDeadReverse(isAlive: (id: EntityID) => boolean): number;
+    /** Sources that point at `tgt`, ascending by id (deterministic, cold-path
+     * sort) — empty when none. */
+    sourcesOf(tgt: EntityID): EntityID[];
+    /** Drop every derived side index — the reverse index and (for multi) the
+     * forward target sets. Restore path only (`restoreRelations`): the side
+     * indices are rebuilt from scratch, so they're cleared first to stay
+     * idempotent when restoring into a dirty world. The backing sparse store is
+     * cleared separately by `restoreSparseStores`. */
+    resetIndices(): void;
+    /** Clear this relation's forward representation (multi: the side map;
+     * exclusive: nothing — its forward links live in the sparse store, cleared by
+     * `restoreSparseStores`). */
+    protected abstract _resetForward(): void;
+    /** Add a `(R, tgt)` link from `src`, keeping forward link + membership +
+     * reverse index in lockstep. Exclusive: replaces any existing target
+     * (idempotent if `tgt` is already the target). Multi: adds to the set
+     * (idempotent on a duplicate), establishing the membership tag on the first
+     * target. `src` must be live — `Store` checks before delegating (#495). */
+    abstract link(src: EntityID, tgt: EntityID): void;
+    /** Remove `(R, tgt)` from `src` — or, when `tgt` is omitted, every target of
+     * `src` — keeping forward link + membership + reverse index in lockstep. A
+     * no-op when the link isn't present. */
+    abstract unlink(src: EntityID, tgt?: EntityID): void;
+    /** Purge a destroyed **source**: drop its forward link(s) and unlink it from
+     * every target's reverse set, but leave the sparse **membership** row alone —
+     * `Store._purgeSparse` drops that (for every store) right after, so this
+     * runs first and must not double-remove. */
+    abstract purgeSource(src: EntityID): void;
+    /** The single target of source `index`, or `undefined`. Exclusive reads the
+     * sparse field; multi has no single target and returns `undefined` (matching
+     * the production `targetOf`-on-multi read, which the `DEV` guard rejects). */
+    abstract singleTarget(index: number): EntityID | undefined;
+    /** All targets of source `index`, ascending by id — one or zero for
+     * exclusive, the full sorted set for multi. The symmetric counterpart to
+     * `sourcesOf` (#498 item 4). */
+    abstract targetsOf(index: number): EntityID[];
+    /** Whether source `index` holds any target under this relation (sparse
+     * membership). */
+    abstract has(index: number): boolean;
+    /** Fold `cb` over this relation's **multi** forward target sets in canonical
+     * order (sources ascending by index, each source's targets ascending by id),
+     * skipping empty sets. The single source of truth for the canonical multi
+     * traversal shared by `stateHash`, `snapshotRelations`, and `pairsOf`
+     * (#498 item 1). Exclusive relations contribute via the sparse store, so this
+     * is a no-op for them. */
+    abstract forEachCanonicalTargetSet(cb: CanonicalTargetSetFn): void;
+    /** Fold `cb` over every `(source, target)` pair of this relation in canonical
+     * order — the `(R, *)` wildcard drive order (#472). `makeId` maps a source
+     * index to its full `EntityID`. Exclusive rides the backing store's
+     * `canonicalIndices`; multi rides `forEachCanonicalTargetSet`. */
+    abstract forEachCanonicalPair(makeId: MakeSourceID, cb: CanonicalPairFn): void;
+    /** Rebuild the reverse index from the forward links after a restore.
+     * Exclusive reads it back from the just-restored sparse target field (the
+     * reverse index is never serialized); multi already rebuilt its reverse edges
+     * in `restoreAddTarget`, so this is a no-op for it. `makeId` maps a source
+     * index to its full `EntityID`. */
+    abstract rebuildReverseFromForward(makeId: MakeSourceID): void;
+    /** Restore one decoded multi forward edge `(source index → tgt)` plus its
+     * reverse edge (the source's full `EntityID` is `src`). Multi only — the
+     * snapshot header guards exclusive relations out before this is reached, so
+     * the exclusive override throws defensively. */
+    abstract restoreAddTarget(index: number, tgt: EntityID, src: EntityID): void;
+}
+/** Build the right `RelationStore` for a cardinality. The only construction
+ * site is `Store.registerRelation`, which resolves the backing sparse store and
+ * hands it in so the relation can drive forward/membership rows directly. */
+export declare function makeRelationStore(exclusive: boolean, sparse: SparseComponentDef, store: SparseComponentStore, onDeleteTarget: OnDeleteTarget): RelationStore;
+/** Serialize the relation side data that does **not** live in the sparse store
+ * — i.e. each **multi** relation's forward target sets (`Map<source index,
+ * Set<target>>`). Exclusive relations store their target in the backing sparse
+ * field, so they ride `snapshotSparseStores` and contribute only a header
+ * here. The reverse index is fully derivable (from the sparse store for
+ * exclusive, from these sets for multi), so it is never serialized — it is
+ * rebuilt by `restoreRelations` + the caller's exclusive-reverse pass.
+ *
+ * Members are emitted in canonical order (sources ascending by entity index,
+ * each source's targets ascending by id) so the bytes are independent of
+ * add/remove history — the same byte-level determinism invariant the sparse
+ * snapshot holds (#470). Layout (integers little-endian):
+ *
+ *   u32 relationCount
+ *   repeat relationCount times (registration / id order):
+ *     u32 isMulti
+ *     if multi:
+ *       u32 sourceCount
+ *       repeat sourceCount times (ascending source index):
+ *         u32 sourceIndex
+ *         u32 targetCount
+ *         f64 × targetCount   (target EntityIDs, ascending) */
+export declare function snapshotRelations(relations: readonly RelationStore[]): Uint8Array;
+/** Rebuild every relation's side indices from a `snapshotRelations` buffer and
+ * the already-restored sparse stores. Each relation's indices are reset first
+ * (idempotent into a dirty world), then:
+ *
+ *  - **multi** — forward target sets and their reverse edges are rebuilt from
+ *    `bytes` (the sets aren't in the sparse store, so the bytes are the only
+ *    source). `makeId` maps a source entity index to its full `EntityID`
+ *    (generation from the live slot) so reverse edges key correctly.
+ *  - **exclusive** — only the reset happens here; the reverse index is rebuilt
+ *    by the caller from the backing sparse store (which already round-tripped
+ *    through `restoreSparseStores`), since this function can't read it.
+ *
+ * Throws `SparseRestoreError` on any shape mismatch (relation count, an
+ * exclusive/multi flag that disagrees with the registered relation, a multi
+ * source index past `MAX_INDEX`, or a truncated / over-long buffer) rather than
+ * silently building a corrupt index. */
+export declare function restoreRelations(relations: readonly RelationStore[], bytes: Uint8Array, makeId: (index: number) => EntityID): void;
+export {};
+//# sourceMappingURL=relation.d.ts.map

package/dist/core/ecs/relation.d.ts

@@ -0,0 +1,243 @@
+import { Brand } from '../../type_primitives/index.js';
+import { EntityID } from './entity.js';
+import { SparseComponentDef, SparseComponentStore } from './sparse_store.js';
+/** Relation handle id. A separate id space from `ComponentID` and
+ * `SparseComponentID` — it indexes the `RelationService` registry. The numeric
+ * value is the registration order, stable for the lifetime of the ECS. */
+export type RelationID = Brand<number, "relation_id">;
+declare const __relationBrand: unique symbol;
+/** A relation's registration-time cardinality: `exclusive` = one target per
+ * source (re-add replaces), `multi` = a target set per source. */
+export type RelationCardinality = "exclusive" | "multi";
+declare const __relationCardinality: unique symbol;
+export type RelationDef<C extends RelationCardinality = RelationCardinality> = RelationID & {
+    readonly [__relationBrand]: "relation";
+    readonly [__relationCardinality]?: [C];
+};
+/** Access sentinel for the `(*, T)` wildcard query iteration
+ * (`Query.forEachRelatedTo`, #579). A `(*, T)` term reads **every** registered
+ * relation's reverse index to find sources of `T`, so it can't name a specific
+ * relation in `relationReads` the way `withRelation(R)` (`(R, *)`) can. A
+ * system that iterates a `(*, T)` wildcard lists `ANY_RELATION` in `relationReads`
+ * instead; `accessCheck.checkRelationReadAny` honors it. The numeric value is a
+ * reserved sentinel far past any real registration-order relation id (relations are
+ * minted from 0 upward), so it can never collide with a registered relation. */
+export declare const ANY_RELATION: RelationDef;
+/** Cleanup policy applied to a relation's **sources** when one of its
+ * **targets** is destroyed (#473). Chosen per-relation at registration, run at
+ * destroy-flush (and the immediate-destroy path) off the reverse index:
+ *
+ *   - **`delete`** — cascade: destroy every source of the dead target too,
+ *     recursively for chains/trees (the canonical ChildOf case).
+ *   - **`clear`** — remove the relation from every source; the sources survive.
+ *   - **`orphan`** — leave the link intact but dangling. Reads stay safe (the
+ *     reverse index is `EntityID`-keyed, so the dead handle never aliases a
+ *     recycled slot); `targetOf` returns a dead handle until the source
+ *     re-targets or is removed. This is the pre-#473 behaviour and the default.
+ */
+export type OnDeleteTarget = "delete" | "clear" | "orphan";
+/** Default on-target-delete policy: leave the link dangling (pre-#473
+ * behaviour, zero change for callers that don't opt in). */
+export declare const DEFAULT_ON_DELETE_TARGET: OnDeleteTarget;
+/** Registration options. `exclusive` (one target per source) is the default;
+ * pass `{ multi: true }` for a multi-target relation. The two are mutually
+ * exclusive — the union makes `{ exclusive: true, multi: true }` a compile
+ * error (it also throws at runtime, for JS callers). `onDeleteTarget` selects
+ * the cleanup policy applied to sources when a target is destroyed (default
+ * `orphan`). */
+export type RelationOptions = {
+    readonly exclusive?: true;
+    readonly multi?: false;
+    readonly onDeleteTarget?: OnDeleteTarget;
+} | {
+    readonly multi: true;
+    readonly exclusive?: false;
+    readonly onDeleteTarget?: OnDeleteTarget;
+};
+/** Field name carrying the target `EntityID` on an exclusive relation's backing
+ * sparse component. Field 0 of a single-field schema. */
+export declare const RELATION_TARGET_FIELD = "target";
+/** Receives one canonical `(source index, sorted targets)` set during a fold
+ * over a multi relation's forward sets. Targets are ascending by id; empty sets
+ * are never yielded (see `forEachCanonicalTargetSet`). */
+export type CanonicalTargetSetFn = (sourceIndex: number, targets: readonly EntityID[]) => void;
+/** Receives one canonical `(source, target)` pair during a fold over a
+ * relation's forward links. Sources ascend by entity index, each source's
+ * targets ascend by id — the #470 determinism order. */
+export type CanonicalPairFn = (source: EntityID, target: EntityID) => void;
+/** Maps a source entity **index** to its full `EntityID` (generation from the
+ * live slot). Supplied by `Store`, which owns entity generations. */
+export type MakeSourceID = (index: number) => EntityID;
+/** One relation's derived side state. **Abstract over cardinality (#498):** the
+ * base owns the cardinality-agnostic **reverse index** (target → sources, keyed
+ * by full `EntityID` so a recycled slot can't alias a dead target's sources) and
+ * a handle on the backing `SparseComponentStore`; the forward representation and
+ * its sparse interaction are owned by the concrete `ExclusiveRelationStore` /
+ * `MultiRelationStore` (built by `makeRelationStore`).
+ *
+ * The registry level (`Store` + `RelationService`) owns what is genuinely its
+ * own — entity liveness, registration, and destroy orchestration — and drives
+ * a relation through the virtual `link` /
+ * `unlink` / `purgeSource` / `forEachCanonicalPair` / … without ever
+ * branching on cardinality. Each cardinality keeps forward link + reverse index
+ * + sparse membership in lockstep inside one method on one class, so the
+ * lockstep can't be broken by missing a scattered `if (rs.exclusive)` site. */
+export declare abstract class RelationStore {
+    /** `true` → one target per source (target in the sparse field); `false` →
+     * a set of targets per source. The cardinality discriminant survives as a
+     * field because it is part of the snapshot header and the traversal/`targetOf`
+     * mode guards — but the forward *mechanics* are virtual, not branched on it. */
+    readonly exclusive: boolean;
+    /** Backing sparse component def: `{ target: f64 }` when exclusive, a tag when
+     * multi. Carries membership (and the target, when exclusive). */
+    readonly sparse: SparseComponentDef;
+    /** Cleanup policy applied to this relation's sources when a target is
+     * destroyed (#473). `orphan` (the default) is a no-op — the link dangles
+     * safely. `Store` reads this at destroy-flush off `sourcesOf`. */
+    readonly onDeleteTarget: OnDeleteTarget;
+    /** The backing sparse store instance. Owned for registration/liveness by
+     * `Store`, but the relation drives the forward/membership rows on it directly
+     * — that is the cardinality interaction this class now encapsulates (#498). */
+    protected readonly _store: SparseComponentStore;
+    /** target `EntityID` → set of source `EntityID`s. Keyed by the full id, not
+     * the index, so a recycled target slot can't alias a dead target's sources.
+     * An entry is dropped the moment its set empties (`unlinkReverse`). */
+    private readonly _reverse;
+    constructor(exclusive: boolean, sparse: SparseComponentDef, store: SparseComponentStore, onDeleteTarget: OnDeleteTarget);
+    /** Record that `src` points at `tgt` in the reverse index. */
+    protected linkReverse(tgt: EntityID, src: EntityID): void;
+    /** Drop the `src → tgt` edge from the reverse index, removing the target's
+     * entry entirely once its last source is gone (so a dead-target key doesn't
+     * linger with an empty set). */
+    protected unlinkReverse(tgt: EntityID, src: EntityID): void;
+    /** Drop every reverse-index entry whose **target** is no longer alive,
+     * returning the count dropped (#491). The `orphan` policy intentionally
+     * leaves a destroyed target's reverse entry intact (the link dangles
+     * safely), so a long-lived source that orphan-points at a stream of
+     * short-lived targets and never re-targets/dies accumulates dead-target keys
+     * without bound. This is the reclaim primitive behind `Store.compactRelations`
+     * — a cold path the host calls at scene/snapshot boundaries. It is
+     * cardinality-free (reverse-index only), so it lives on the base unchanged.
+     *
+     * Pure index reclaim: the **forward** links (the exclusive sparse target
+     * field, the multi forward set) are left untouched, so `targetOf` /
+     * `targetsOf` still return the dangling dead handle exactly as `orphan`
+     * promises. The reverse index is derived, so dropping a dead-target entry
+     * changes nothing observable except `sourcesOf` on that dead handle (which
+     * goes from the dangling sources to `[]` — meaningless either way, the target
+     * is gone) and is faithfully rebuilt by snapshot/restore from the surviving
+     * forward links. Only the **target** role can leak here: a destroyed *source*
+     * is already unlinked from every reverse set by `purgeSource`, so a live
+     * target's set never holds a dead source. `isAlive` is supplied by `Store`,
+     * which owns entity liveness. Deleting during `Map` key iteration is
+     * well-defined — already-visited and not-yet-reached keys are unaffected. */
+    pruneDeadReverse(isAlive: (id: EntityID) => boolean): number;
+    /** Sources that point at `tgt`, ascending by id (deterministic, cold-path
+     * sort) — empty when none. */
+    sourcesOf(tgt: EntityID): EntityID[];
+    /** Drop every derived side index — the reverse index and (for multi) the
+     * forward target sets. Restore path only (`restoreRelations`): the side
+     * indices are rebuilt from scratch, so they're cleared first to stay
+     * idempotent when restoring into a dirty world. The backing sparse store is
+     * cleared separately by `restoreSparseStores`. */
+    resetIndices(): void;
+    /** Clear this relation's forward representation (multi: the side map;
+     * exclusive: nothing — its forward links live in the sparse store, cleared by
+     * `restoreSparseStores`). */
+    protected abstract _resetForward(): void;
+    /** Add a `(R, tgt)` link from `src`, keeping forward link + membership +
+     * reverse index in lockstep. Exclusive: replaces any existing target
+     * (idempotent if `tgt` is already the target). Multi: adds to the set
+     * (idempotent on a duplicate), establishing the membership tag on the first
+     * target. `src` must be live — `Store` checks before delegating (#495). */
+    abstract link(src: EntityID, tgt: EntityID): void;
+    /** Remove `(R, tgt)` from `src` — or, when `tgt` is omitted, every target of
+     * `src` — keeping forward link + membership + reverse index in lockstep. A
+     * no-op when the link isn't present. */
+    abstract unlink(src: EntityID, tgt?: EntityID): void;
+    /** Purge a destroyed **source**: drop its forward link(s) and unlink it from
+     * every target's reverse set, but leave the sparse **membership** row alone —
+     * `Store._purgeSparse` drops that (for every store) right after, so this
+     * runs first and must not double-remove. */
+    abstract purgeSource(src: EntityID): void;
+    /** The single target of source `index`, or `undefined`. Exclusive reads the
+     * sparse field; multi has no single target and returns `undefined` (matching
+     * the production `targetOf`-on-multi read, which the `DEV` guard rejects). */
+    abstract singleTarget(index: number): EntityID | undefined;
+    /** All targets of source `index`, ascending by id — one or zero for
+     * exclusive, the full sorted set for multi. The symmetric counterpart to
+     * `sourcesOf` (#498 item 4). */
+    abstract targetsOf(index: number): EntityID[];
+    /** Whether source `index` holds any target under this relation (sparse
+     * membership). */
+    abstract has(index: number): boolean;
+    /** Fold `cb` over this relation's **multi** forward target sets in canonical
+     * order (sources ascending by index, each source's targets ascending by id),
+     * skipping empty sets. The single source of truth for the canonical multi
+     * traversal shared by `stateHash`, `snapshotRelations`, and `pairsOf`
+     * (#498 item 1). Exclusive relations contribute via the sparse store, so this
+     * is a no-op for them. */
+    abstract forEachCanonicalTargetSet(cb: CanonicalTargetSetFn): void;
+    /** Fold `cb` over every `(source, target)` pair of this relation in canonical
+     * order — the `(R, *)` wildcard drive order (#472). `makeId` maps a source
+     * index to its full `EntityID`. Exclusive rides the backing store's
+     * `canonicalIndices`; multi rides `forEachCanonicalTargetSet`. */
+    abstract forEachCanonicalPair(makeId: MakeSourceID, cb: CanonicalPairFn): void;
+    /** Rebuild the reverse index from the forward links after a restore.
+     * Exclusive reads it back from the just-restored sparse target field (the
+     * reverse index is never serialized); multi already rebuilt its reverse edges
+     * in `restoreAddTarget`, so this is a no-op for it. `makeId` maps a source
+     * index to its full `EntityID`. */
+    abstract rebuildReverseFromForward(makeId: MakeSourceID): void;
+    /** Restore one decoded multi forward edge `(source index → tgt)` plus its
+     * reverse edge (the source's full `EntityID` is `src`). Multi only — the
+     * snapshot header guards exclusive relations out before this is reached, so
+     * the exclusive override throws defensively. */
+    abstract restoreAddTarget(index: number, tgt: EntityID, src: EntityID): void;
+}
+/** Build the right `RelationStore` for a cardinality. The only construction
+ * site is `Store.registerRelation`, which resolves the backing sparse store and
+ * hands it in so the relation can drive forward/membership rows directly. */
+export declare function makeRelationStore(exclusive: boolean, sparse: SparseComponentDef, store: SparseComponentStore, onDeleteTarget: OnDeleteTarget): RelationStore;
+/** Serialize the relation side data that does **not** live in the sparse store
+ * — i.e. each **multi** relation's forward target sets (`Map<source index,
+ * Set<target>>`). Exclusive relations store their target in the backing sparse
+ * field, so they ride `snapshotSparseStores` and contribute only a header
+ * here. The reverse index is fully derivable (from the sparse store for
+ * exclusive, from these sets for multi), so it is never serialized — it is
+ * rebuilt by `restoreRelations` + the caller's exclusive-reverse pass.
+ *
+ * Members are emitted in canonical order (sources ascending by entity index,
+ * each source's targets ascending by id) so the bytes are independent of
+ * add/remove history — the same byte-level determinism invariant the sparse
+ * snapshot holds (#470). Layout (integers little-endian):
+ *
+ *   u32 relationCount
+ *   repeat relationCount times (registration / id order):
+ *     u32 isMulti
+ *     if multi:
+ *       u32 sourceCount
+ *       repeat sourceCount times (ascending source index):
+ *         u32 sourceIndex
+ *         u32 targetCount
+ *         f64 × targetCount   (target EntityIDs, ascending) */
+export declare function snapshotRelations(relations: readonly RelationStore[]): Uint8Array;
+/** Rebuild every relation's side indices from a `snapshotRelations` buffer and
+ * the already-restored sparse stores. Each relation's indices are reset first
+ * (idempotent into a dirty world), then:
+ *
+ *  - **multi** — forward target sets and their reverse edges are rebuilt from
+ *    `bytes` (the sets aren't in the sparse store, so the bytes are the only
+ *    source). `makeId` maps a source entity index to its full `EntityID`
+ *    (generation from the live slot) so reverse edges key correctly.
+ *  - **exclusive** — only the reset happens here; the reverse index is rebuilt
+ *    by the caller from the backing sparse store (which already round-tripped
+ *    through `restoreSparseStores`), since this function can't read it.
+ *
+ * Throws `SparseRestoreError` on any shape mismatch (relation count, an
+ * exclusive/multi flag that disagrees with the registered relation, a multi
+ * source index past `MAX_INDEX`, or a truncated / over-long buffer) rather than
+ * silently building a corrupt index. */
+export declare function restoreRelations(relations: readonly RelationStore[], bytes: Uint8Array, makeId: (index: number) => EntityID): void;
+export {};
+//# sourceMappingURL=relation.d.ts.map

package/dist/core/ecs/relation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/relation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA4DK;AAEL,OAAO,EAAE,KAAK,EAAc,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,KAAK,QAAQ,EAA4C,MAAM,UAAU,CAAC;AACnF,OAAO,EACN,KAAK,kBAAkB,EACvB,KAAK,oBAAoB,EAEzB,MAAM,gBAAgB,CAAC;AAExB;;0EAE0E;AAC1E,MAAM,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;AAItD,OAAO,CAAC,MAAM,eAAe,EAAE,OAAO,MAAM,CAAC;AAE7C;kEACkE;AAClE,MAAM,MAAM,mBAAmB,GAAG,WAAW,GAAG,OAAO,CAAC;AAYxD,OAAO,CAAC,MAAM,qBAAqB,EAAE,OAAO,MAAM,CAAC;AAEnD,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,mBAAmB,GAAG,mBAAmB,IAAI,UAAU,GAAG;IAC3F,QAAQ,CAAC,CAAC,eAAe,CAAC,EAAE,UAAU,CAAC;IACvC,QAAQ,CAAC,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CACvC,CAAC;AAEF;;;;;;;gFAOgF;AAChF,eAAO,MAAM,YAAY,EAAE,WAAkD,CAAC;AAE9E;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAC;AAE3D;4DAC4D;AAC5D,eAAO,MAAM,wBAAwB,EAAE,cAAyB,CAAC;AAEjE;;;;;gBAKgB;AAChB,MAAM,MAAM,eAAe,GACxB;IACA,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC;IAC1B,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;IACvB,QAAQ,CAAC,cAAc,CAAC,EAAE,cAAc,CAAC;CACxC,GACD;IACA,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC;IACrB,QAAQ,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC;IAC3B,QAAQ,CAAC,cAAc,CAAC,EAAE,cAAc,CAAC;CACxC,CAAC;AAEL;yDACyD;AACzD,eAAO,MAAM,qBAAqB,WAAW,CAAC;AAO9C;;0DAE0D;AAC1D,MAAM,MAAM,oBAAoB,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,QAAQ,EAAE,KAAK,IAAI,CAAC;AAE/F;;wDAEwD;AACxD,MAAM,MAAM,eAAe,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,KAAK,IAAI,CAAC;AAE3E;qEACqE;AACrE,MAAM,MAAM,YAAY,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,QAAQ,CAAC;AAEvD;;;;;;;;;;;;;+EAa+E;AAC/E,8BAAsB,aAAa;IAClC;;;oFAGgF;IAChF,SAAgB,SAAS,EAAE,OAAO,CAAC;IACnC;qEACiE;IACjE,SAAgB,MAAM,EAAE,kBAAkB,CAAC;IAC3C;;sEAEkE;IAClE,SAAgB,cAAc,EAAE,cAAc,CAAC;IAC/C;;mFAE+E;IAC/E,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IAChD;;2EAEuE;IACvE,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAkC;gBAG1D,SAAS,EAAE,OAAO,EAClB,MAAM,EAAE,kBAAkB,EAC1B,KAAK,EAAE,oBAAoB,EAC3B,cAAc,EAAE,cAAc;IAU/B,8DAA8D;IAC9D,SAAS,CAAC,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,IAAI;IASzD;;oCAEgC;IAChC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,IAAI;IAO3D;;;;;;;;;;;;;;;;;;;;iFAoB6E;IACtE,gBAAgB,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,OAAO,GAAG,MAAM;IAWnE;kCAC8B;IACvB,SAAS,CAAC,GAAG,EAAE,QAAQ,GAAG,QAAQ,EAAE;IAY3C;;;;sDAIkD;IAC3C,YAAY,IAAI,IAAI;IAO3B;;iCAE6B;IAC7B,SAAS,CAAC,QAAQ,CAAC,aAAa,IAAI,IAAI;IAExC;;;;+EAI2E;aAC3D,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,IAAI;IAExD;;4CAEwC;aACxB,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI;IAE3D;;;gDAG4C;aAC5B,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAEhD;;kFAE8E;aAC9D,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAEjE;;oCAEgC;aAChB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,EAAE;IAEpD;sBACkB;aACF,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAE3C;;;;;8BAK0B;aACV,yBAAyB,CAAC,EAAE,EAAE,oBAAoB,GAAG,IAAI;IAEzE;;;sEAGkE;aAClD,oBAAoB,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,GAAG,IAAI;IAErF;;;;uCAImC;aACnB,yBAAyB,CAAC,MAAM,EAAE,YAAY,GAAG,IAAI;IAErE;;;oDAGgD;aAChC,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,IAAI;CACnF;AAyMD;;6EAE6E;AAC7E,wBAAgB,iBAAiB,CAChC,SAAS,EAAE,OAAO,EAClB,MAAM,EAAE,kBAAkB,EAC1B,KAAK,EAAE,oBAAoB,EAC3B,cAAc,EAAE,cAAc,GAC5B,aAAa,CAIf;AAYD;;;;;;;;;;;;;;;;;;;;;+DAqB+D;AAC/D,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,aAAa,EAAE,GAAG,UAAU,CAqDjF;AAED;;;;;;;;;;;;;;;wCAewC;AACxC,wBAAgB,gBAAgB,CAC/B,SAAS,EAAE,SAAS,aAAa,EAAE,EACnC,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,QAAQ,GACjC,IAAI,CA8EN"}