@pilates/core 1.0.0 → 1.1.0

package/dist/algorithm/spineless/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../src/algorithm/spineless/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC3D,OAAO,EAIL,mBAAmB,EACnB,gBAAgB,EAChB,mBAAmB,EACnB,oBAAoB,GACrB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD,wEAAwE;AACxE,MAAM,UAAU,GAAW,GAAG,EAAE;IAC9B,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;AAC7E,CAAC,CAAC;AAoCF,wEAAwE;AACxE,SAAS,aAAa,CAAC,OAAgB,EAAE,OAAyB;IAChE,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,mEAAmE;AACnE,SAAS,aAAa,CAAC,KAA8B,EAAE,GAA0B;IAC/E,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO;IAChC,KAAK,MAAM,CAAC,IAAI;QACd,OAAO;QACP,QAAQ;QACR,WAAW;QACX,UAAU;QACV,YAAY;QACZ,QAAQ;QACR,WAAW;QACX,UAAU;QACV,WAAW;QACX,UAAU;QACV,WAAW;KACH,EAAE,CAAC;QACX,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,SAAS;YAAE,GAAG,CAAC,IAAI,CAAC,CAAmB,CAAC,CAAC;IACrD,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAU,EAAE,CAAC;QAC/C,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QAChC,KAAK,MAAM,CAAC,IAAI,GAAG;YAAE,IAAI,CAAC,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAmB,CAAC,CAAC;IAC1E,CAAC;AACH,CAAC;AAaD,6DAA6D;AAC7D,SAAS,OAAO,CAAC,IAAU;IACzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACrB,OAAO;QACL,CAAC,CAAC,aAAa;QACf,CAAC,CAAC,QAAQ;QACV,CAAC,CAAC,cAAc;QAChB,CAAC,CAAC,UAAU;QACZ,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,OAAO;QACT,OAAO,CAAC,CAAC,KAAK;QACd,OAAO,CAAC,CAAC,MAAM;QACf,OAAO,CAAC,CAAC,SAAS;QAClB,wDAAwD;QACxD,yDAAyD;QACzD,+DAA+D;QAC/D,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;QAC1B,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;QAC5B,2DAA2D;QAC3D,gCAAgC;QAChC,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC;QACzD,6DAA6D;QAC7D,CAAC,CAAC,QAAQ;aACP,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;aAC/C,IAAI,CAAC,GAAG,CAAC;KACb,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,IAAU;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,SAAS,KAAK,CAAC,CAAO;QACpB,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;YAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QAC1E,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,cAAc,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0EAA0E;AAC1E,SAAS,iBAAiB,CAAC,IAAc,EAAE,IAAU;IACnD,IAAI,IAAI,CAAC,aAAa,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,IAAU,EAAE,GAAW;IAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,IAAI,KAAK;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,IAAI,KAAK,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;YAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,CAAC;IACtF,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,SAAS,gBAAgB,CAAC,IAAU;IAClC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,mBAAmB;QAAE,OAAO;IACzD,IAAI,CAAC,UAAU,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,cAAc,CAAC,IAAU;IAChC,IAAI,CAAC,UAAU,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;AACnF,CAAC;AAkBD,uEAAuE;AACvE,SAAS,WAAW,CAAC,MAAyB;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACnF,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAuB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAwB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAsB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAqB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,eAAe;IACT,IAAI,CAAO;IACpB,KAAK,GAAiB,IAAI,CAAC;IAEnC,6DAA6D;IACpD,KAAK,GAAG;QACf,UAAU,EAAE,CAAC;QACb,oBAAoB,EAAE,CAAC;QACvB,cAAc,EAAE,CAAC;QACjB,eAAe,EAAE,CAAC;QAClB,gBAAgB,EAAE,CAAC;KACpB,CAAC;IAEF,0DAA0D;IAClD,UAAU,GAAuB,IAAI,CAAC;IAE9C,YAAY,IAAU;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED;yCACqC;IACrC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,cAAuB,EAAE,eAAwB;QACtD,2DAA2D;QAC3D,2DAA2D;QAC3D,MAAM,YAAY,GAChB,IAAI,CAAC,KAAK,KAAK,IAAI;YACnB,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,CAAC,cAAc,KAAK,SAAS,CAAC;YAC7E,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC;QAElF,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;YAChD,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACxB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO;QACT,CAAC;QAED,8DAA8D;QAC9D,gEAAgE;QAChE,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC,KAAK,CAAC;QAChC,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,IACE,IAAI,KAAK,SAAS;gBAClB,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,cAAc,EAAE;gBACnC,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,EAC3B,CAAC;gBACD,UAAU,GAAG,IAAI,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;YAC1E,IAAI,CAAC,KAAK,CAAC,oBAAoB,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG;gBAChB,IAAI,EAAE,aAAa;gBACnB,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;gBACrC,aAAa,EAAE,EAAE,CAAC,gBAAgB;gBAClC,aAAa,EAAE,KAAK,CAAC,MAAM;aAC5B,CAAC;YACF,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAC9B,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,eAAe,CAAC,EAAE,CAAC;YACzD,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG;gBAChB,IAAI,EAAE,OAAO;gBACb,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;gBACrC,aAAa,EAAE,EAAE,CAAC,gBAAgB;gBAClC,aAAa,EAAE,CAAC;aACjB,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,eAAe,CAAC,EAAE,CAAC;YACjE,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG;gBAChB,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;gBACrC,aAAa,EAAE,EAAE,CAAC,gBAAgB;gBAClC,aAAa,EAAE,CAAC;aACjB,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,eAAe,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,KAAK,CAAC,gBAAgB,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG;gBAChB,IAAI,EAAE,SAAS;gBACf,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,gBAAgB,EAAE,EAAE,CAAC,gBAAgB;gBACrC,aAAa,EAAE,EAAE,CAAC,gBAAgB;gBAClC,aAAa,EAAE,CAAC;aACjB,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;YAChD,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;IAED,gEAAgE;IACxD,SAAS,CAAC,cAAuB,EAAE,eAAwB;QACjE,MAAM,SAAS,GAAkB,EAAE,CAAC;QACpC,IAAI,cAAc,KAAK,SAAS;YAAE,SAAS,CAAC,KAAK,GAAG,cAAc,CAAC;QACnE,IAAI,eAAe,KAAK,SAAS;YAAE,SAAS,CAAC,MAAM,GAAG,eAAe,CAAC;QAEtE,MAAM,MAAM,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACtD,MAAM,UAAU,GAAqB,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACjC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACjE,OAAO,CAAC,IAAI,EAAE,CAAC;QAEf,IAAI,CAAC,KAAK,GAAG;YACX,SAAS;YACT,MAAM;YACN,OAAO;YACP,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC;YAC9C,KAAK,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9B,GAAG,WAAW,CAAC,MAAM,CAAC;SACvB,CAAC;QAEF,8DAA8D;QAC9D,iEAAiE;QACjE,+CAA+C;QAC/C,IAAI,CAAC,UAAU,GAAG;YAChB,IAAI,EAAE,OAAO;YACb,UAAU,EAAE,CAAC;YACb,gBAAgB,EAAE,CAAC;YACnB,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC;SACjB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,cAAuB,EAAE,eAAwB;QACtE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC;QAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAE1B,+DAA+D;QAC/D,mEAAmE;QACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;QACjC,CAAC,SAAS,KAAK,CAAC,CAAO;YACrB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACrC,CAAC;QACD,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAErC,6DAA6D;QAC7D,mCAAmC;QACnC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,cAAc,EAAE;gBAAE,OAAO,KAAK,CAAC;QACnF,CAAC;QAED,kEAAkE;QAClE,sDAAsD;QACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,KAAK,GAAgB,IAAI,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC,CAAC,uBAAuB;gBACzD,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;QACH,CAAC;QACD,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QACjC,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAClC,iEAAiE;QACjE,+DAA+D;QAC/D,iEAAiE;QACjE,6DAA6D;QAC7D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAE5C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9F,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAEpC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC3D,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO;YAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpF,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC7B,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACnE,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QAC1B,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;QAExB,8DAA8D;QAC9D,+CAA+C;QAC/C,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3F,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,eAAe,CAAC,cAAuB,EAAE,eAAwB;QACvE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC;QAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAE1B,mEAAmE;QACnE,6DAA6D;QAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;QACjC,CAAC,SAAS,KAAK,CAAC,CAAO;YACrB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClC,CAAC;QACD,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAEvC,6DAA6D;QAC7D,qCAAqC;QACrC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC/B,IAAI,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,cAAc,EAAE;gBAAE,OAAO,KAAK,CAAC;QACnF,CAAC;QAED,kEAAkE;QAClE,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAc,CAAC;QACzC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;gBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,gEAAgE;QAChE,6DAA6D;QAC7D,qCAAqC;QACrC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,GAAgB,IAAI,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1C,IAAI,KAAK,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC,CAAC,wBAAwB;gBAC1D,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;QACH,CAAC;QACD,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QACjC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAChE,kEAAkE;QAClE,mEAAmE;QACnE,kDAAkD;QAClD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAE5C,uDAAuD;QACvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,CAAC,SAAS,KAAK,CAAC,CAAO;YACrB,YAAY,EAAE,CAAC;YACf,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,QAAQ;gBAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACV,IAAI,YAAY,KAAK,OAAO,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAElD,gEAAgE;QAChE,kEAAkE;QAClE,wDAAwD;QACxD,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,QAAQ,CAAC;QACjD,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,aAAa,EAAE,KAAK,YAAY,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,KAAK;gBAAE,SAAS;YACxC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzD,CAAC,EAAE,CAAC;QACN,CAAC;QAED,kEAAkE;QAClE,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9F,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAEpC,kEAAkE;QAClE,uDAAuD;QACvD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO;YAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpF,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC7B,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACnE,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;QACzB,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;QAEvB,iEAAiE;QACjE,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3F,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACK,UAAU,CAAC,cAAuB,EAAE,eAAwB;QAClE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC;QAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAE1B,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;QACjC,CAAC,SAAS,KAAK,CAAC,CAAO;YACrB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,IAAI,QAAQ,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClC,CAAC;QAED,kEAAkE;QAClE,4DAA4D;QAC5D,IAAI,SAAS,GAAgB,IAAI,CAAC;QAClC,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,cAAc,EAAE;gBAAE,OAAO,KAAK,CAAC;YACjF,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;gBAChC,IAAI,SAAS,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC,CAAC,wCAAwC;gBAC9E,SAAS,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAErC,8DAA8D;QAC9D,kEAAkE;QAClE,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,QAAQ,CAAC;QAC9C,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,aAAa,EAAE;YAAE,OAAO,KAAK,CAAC;QAC9D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC3D,CAAC;QAED,mEAAmE;QACnE,2DAA2D;QAC3D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC;QAE/C,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3F,+DAA+D;QAC/D,8DAA8D;QAC9D,yCAAyC;QACzC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC3D,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO;YAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpF,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACxE,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC7B,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACnE,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;QACzB,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;QAEvB,iEAAiE;QACjE,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3F,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,KAAa,EAAE,cAAuB,EAAE,eAAwB;QACrF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QAErD,MAAM,MAAM,GAA0B,EAAE,CAAC;QACzC,IAAI,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,KAAuB,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,MAAwB,CAAC,CAAC;QACrE,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAE9E,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,8DAA8D;YAC9D,8DAA8D;YAC9D,sDAAsD;YACtD,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC;gBAAE,SAAS;YACxC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC5D,IAAI,IAAI,KAAK,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACjE,CAAC;QAED,4DAA4D;QAC5D,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,SAAS;gBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QACD,gEAAgE;QAChE,8DAA8D;QAC9D,qBAAqB;QACrB,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC1D,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjB,OAAO,GAAG,KAAK,CAAC;oBAChB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IACnE,cAAc,CAAC,cAAuB,EAAE,eAAwB;QACtE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAM,CAAC,SAAS,CAAC;QAChC,IAAI,cAAc,KAAK,SAAS;YAAE,CAAC,CAAC,KAAK,GAAG,cAAc,CAAC;QAC3D,IAAI,eAAe,KAAK,SAAS;YAAE,CAAC,CAAC,MAAM,GAAG,eAAe,CAAC;IAChE,CAAC;IAED,0EAA0E;IAClE,WAAW;QACjB,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACjC,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC7F,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;OAKG;IACK,iBAAiB,CAAC,KAAa;QACrC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAM,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,6DAA6D;YAC7D,8CAA8C;YAC9C,MAAM,KAAK,GAAW,CAAC,IAAI,CAAC,CAAC;YAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACvB,uDAAuD;gBACvD,8DAA8D;gBAC9D,0DAA0D;gBAC1D,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;gBAC9B,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;YACzE,CAAC;YACD,MAAM,GAAG,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;YACpC,eAAe,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC1E,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QACD,6DAA6D;QAC7D,6DAA6D;QAC7D,sDAAsD;QACtD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAQ,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,IAAI;gBAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,aAAa;YAAE,eAAe,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;CACF;AAED,8DAA8D;AAC9D,SAAS,SAAS,CAAC,IAAU,EAAE,OAAyB,EAAE,CAAe;IACvE,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IACzB,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,GAAG,CAAC;IACvB,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/C,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACvB,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;AACvB,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,IAAU;IAMnC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC;QAC7D,MAAM,IAAI,CAAC,CAAC,UAAU,CAAC;QACvB,MAAM,IAAI,CAAC,CAAC,SAAS,CAAC;QACtB,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAC3B,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC;IAC5B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,IAAU;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE;QAAE,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC;IACpF,eAAe,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED,2EAA2E;AAC3E,SAAS,eAAe,CAAC,IAAU;IACjC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;QACrC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC1D,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACtE,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;AAC3E,CAAC"}

package/dist/algorithm/spineless/order-maintenance.bench.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Microbenchmark for the Order Maintenance data structure.
+ *
+ * This is the **kill switch** for Phase 5 (Spineless Traversal): if OM
+ * operations cost more than a small constant per op at 1k-10k node scale,
+ * the algorithmic novelty of Spineless Traversal won't pay off in pure JS.
+ *
+ * Targets (Phase 5 viability criteria):
+ * - `compare`: < 200ns per op at 10k nodes (it's the hot path; the
+ *   Spineless priority queue calls it on every insert/extract).
+ * - `insertAfter`: < 5µs amortized at 10k nodes (rarer, called when
+ *   the dependency graph adds nodes — typically only during tree
+ *   construction or large mutations).
+ *
+ * The naive impl is O(N) per insert, so it will exceed the insertAfter
+ * target at scale. That's expected — the Bender et al. amortized O(1)
+ * impl is what hits the target. We measure naive here as a baseline so
+ * we can show the speedup when Bender lands.
+ *
+ * Run with: `tsx packages/core/src/algorithm/spineless/order-maintenance.bench.ts`
+ *
+ * @internal
+ */
+export {};
+//# sourceMappingURL=order-maintenance.bench.d.ts.map

package/dist/algorithm/spineless/order-maintenance.bench.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"order-maintenance.bench.d.ts","sourceRoot":"","sources":["../../../src/algorithm/spineless/order-maintenance.bench.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG"}

package/dist/algorithm/spineless/order-maintenance.bench.js

@@ -0,0 +1,78 @@
+/**
+ * Microbenchmark for the Order Maintenance data structure.
+ *
+ * This is the **kill switch** for Phase 5 (Spineless Traversal): if OM
+ * operations cost more than a small constant per op at 1k-10k node scale,
+ * the algorithmic novelty of Spineless Traversal won't pay off in pure JS.
+ *
+ * Targets (Phase 5 viability criteria):
+ * - `compare`: < 200ns per op at 10k nodes (it's the hot path; the
+ *   Spineless priority queue calls it on every insert/extract).
+ * - `insertAfter`: < 5µs amortized at 10k nodes (rarer, called when
+ *   the dependency graph adds nodes — typically only during tree
+ *   construction or large mutations).
+ *
+ * The naive impl is O(N) per insert, so it will exceed the insertAfter
+ * target at scale. That's expected — the Bender et al. amortized O(1)
+ * impl is what hits the target. We measure naive here as a baseline so
+ * we can show the speedup when Bender lands.
+ *
+ * Run with: `tsx packages/core/src/algorithm/spineless/order-maintenance.bench.ts`
+ *
+ * @internal
+ */
+import { BenderOrderMaintenance, NaiveOrderMaintenance, } from './order-maintenance.js';
+function median(xs) {
+    const sorted = [...xs].sort((a, b) => a - b);
+    return sorted[Math.floor(sorted.length / 2)];
+}
+function bench(label, make, sizes, opsPerTrial, trials, op) {
+    console.log(`\n## ${label} — ${op}`);
+    for (const N of sizes) {
+        const trialMs = [];
+        for (let t = 0; t < trials; t++) {
+            const om = make();
+            const nodes = [om.init()];
+            // Pre-build N-1 more nodes
+            for (let i = 1; i < N; i++)
+                nodes.push(om.insertAfter(nodes[i - 1]));
+            const start = performance.now();
+            if (op === 'compare') {
+                // Fixed-pattern compares to avoid letting V8 optimize away
+                let acc = 0;
+                for (let k = 0; k < opsPerTrial; k++) {
+                    // Pick two pseudo-random nodes (deterministic, no Math.random cost)
+                    const i = (k * 2654435761) % N;
+                    const j = (k * 1597334677) % N;
+                    acc += om.compare(nodes[i], nodes[j]);
+                }
+                if (acc === 12345.6789)
+                    console.log('!!!');
+            }
+            else {
+                // Insert opsPerTrial new nodes; insert position cycles through
+                // existing nodes so we hit middle-of-list (worst case for naive
+                // renumber).
+                for (let k = 0; k < opsPerTrial; k++) {
+                    const after = nodes[(k * 2654435761) % nodes.length];
+                    nodes.push(om.insertAfter(after));
+                }
+            }
+            const end = performance.now();
+            trialMs.push(end - start);
+        }
+        const ms = median(trialMs);
+        const usPerOp = (ms * 1000) / opsPerTrial;
+        const opsPerSec = (opsPerTrial / ms) * 1000;
+        console.log(`  N=${N.toString().padStart(6)}  ${usPerOp.toFixed(3).padStart(8)} µs/op  ${(opsPerSec / 1000).toFixed(1).padStart(8)} kops/s`);
+    }
+}
+console.log('Order Maintenance microbench (single-threaded JS, Node.js)');
+console.log('Targets: compare < 0.2µs, insertAfter amortized < 5µs at N=10k');
+const naive = () => new NaiveOrderMaintenance();
+const bender = () => new BenderOrderMaintenance();
+bench('Naive compare', naive, [100, 1000, 10000], 100_000, 5, 'compare');
+bench('Bender compare', bender, [100, 1000, 10000], 100_000, 5, 'compare');
+bench('Naive insertAfter (O(N) renumber)', naive, [100, 1000, 10000], 1_000, 5, 'insertAfter');
+bench('Bender insertAfter (amortized O(log N))', bender, [100, 1000, 10000], 1_000, 5, 'insertAfter');
+//# sourceMappingURL=order-maintenance.bench.js.map

package/dist/algorithm/spineless/order-maintenance.bench.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"order-maintenance.bench.js","sourceRoot":"","sources":["../../../src/algorithm/spineless/order-maintenance.bench.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EACL,sBAAsB,EACtB,qBAAqB,GAGtB,MAAM,wBAAwB,CAAC;AAEhC,SAAS,MAAM,CAAC,EAAY;IAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAE,CAAC;AAChD,CAAC;AAED,SAAS,KAAK,CACZ,KAAa,EACb,IAA4B,EAC5B,KAAe,EACf,WAAmB,EACnB,MAAc,EACd,EAA6B;IAE7B,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC;YAClB,MAAM,KAAK,GAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YACpC,2BAA2B;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC;YAEtE,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAChC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,2DAA2D;gBAC3D,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,oEAAoE;oBACpE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;oBAC/B,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC1C,CAAC;gBACD,IAAI,GAAG,KAAK,UAAU;oBAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC7C,CAAC;iBAAM,CAAC;gBACN,+DAA+D;gBAC/D,gEAAgE;gBAChE,aAAa;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,MAAM,CAAE,CAAC;oBACtD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;YACD,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC3B,MAAM,OAAO,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,WAAW,CAAC;QAC1C,MAAM,SAAS,GAAG,CAAC,WAAW,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;QAC5C,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAChI,CAAC;IACJ,CAAC;AACH,CAAC;AAED,OAAO,CAAC,GAAG,CAAC,4DAA4D,CAAC,CAAC;AAC1E,OAAO,CAAC,GAAG,CAAC,gEAAgE,CAAC,CAAC;AAE9E,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,IAAI,qBAAqB,EAAE,CAAC;AAChD,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,sBAAsB,EAAE,CAAC;AAElD,KAAK,CAAC,eAAe,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;AACzE,KAAK,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;AAC3E,KAAK,CAAC,mCAAmC,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AAC/F,KAAK,CACH,yCAAyC,EACzC,MAAM,EACN,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,EAClB,KAAK,EACL,CAAC,EACD,aAAa,CACd,CAAC"}

package/dist/algorithm/spineless/order-maintenance.d.ts

@@ -0,0 +1,192 @@
+/**
+ * Order Maintenance (OM) data structure.
+ *
+ * Maintains a totally-ordered set of items under insertions, deletions,
+ * and `compare(a, b)` queries that return the relative order in O(1) (or
+ * O(1) amortized). Foundational primitive for Spineless Traversal
+ * (Kirisame, Wang, Panchekha — PLDI 2025): the priority queue that
+ * drives incremental layout invalidation is keyed on OM timestamps,
+ * so a fast OM comparator dominates per-operation cost.
+ *
+ * Reference: Bender, Cole, Demaine, Farach-Colton, Zito. "Two
+ * simplified algorithms for maintaining order in a list." ESA 2002.
+ *
+ * ## What this file ships
+ *
+ * **The interface** — `OMNode`, `OrderMaintenance` — is the surface the
+ * Spineless runtime will consume. We design it so the implementation
+ * can be swapped (naive ↔ Bender amortized O(1)) without ripple.
+ *
+ * **The naive implementation** — `NaiveOrderMaintenance` — uses a single
+ * doubly-linked list with sequential integer tags assigned on insert.
+ * Inserts trigger O(N) renumbering of trailing nodes. Compare is O(1).
+ *
+ * This is the **scaffolding implementation**: correct, simple, lets us
+ * write all the consumer code (priority queue, runtime, attribute grammar
+ * interpreter) without waiting for the optimized impl. The Bender et al.
+ * amortized-O(1) implementation lands as a drop-in replacement once the
+ * Spineless runtime is wired and we can benchmark end-to-end. The naive
+ * impl stays in tree forever as a reference oracle: every Bender op is
+ * differentially compared against naive in the property-based test.
+ *
+ * ## Why JS and not WASM
+ *
+ * The paper's reference (Megatron) emits C++ and uses inline `cmov` for
+ * branchless compare. We can't use inline assembly in JS, but we don't
+ * have to: V8 already lowers `a < b` on 32-bit-integer hidden classes
+ * to a branchless `cmp` + `setb` sequence on x86-64. The TS-side cost is
+ * predominantly in the `lookup` (Map.get) and the unboxed compare itself.
+ *
+ * @internal
+ */
+/**
+ * A node in the order. The user holds these directly; comparisons happen
+ * via {@link OrderMaintenance.compare}. Implementations are free to use
+ * different node-internal representations; the interface only commits to
+ * identity (`===`) being the way to look a node up.
+ *
+ * @internal
+ */
+export interface OMNode {
+    /**
+     * Implementation-defined opaque tag. Consumers must NOT read this
+     * directly. Treated as an internal invariant that survives compares
+     * but may shift after inserts/deletes (renumbering, rebalance).
+     *
+     * @internal
+     */
+    readonly _omTag: number;
+}
+/**
+ * @internal
+ */
+export interface OrderMaintenance {
+    /**
+     * The current count of live nodes in the order. Exposed for tests
+     * and microbenchmarks; consumers should not depend on the value.
+     */
+    readonly size: number;
+    /**
+     * Create the very first node in an empty order, or assert that an
+     * order is non-empty by looking up an existing first/last anchor.
+     * Returns a node identity that can be used as the `after` argument
+     * to subsequent `insertAfter` calls.
+     *
+     * Calling `init` on an already-initialised order replaces all
+     * existing nodes; this is provided for `reset()` semantics.
+     */
+    init(): OMNode;
+    /**
+     * Insert a fresh node immediately after `after` in the order.
+     * Returns the new node identity. The returned node compares >
+     * `after` and < whatever was at `after.next` previously.
+     *
+     * Amortized O(1) in the Bender impl; O(N) worst case here in the
+     * naive impl due to trailing-node renumbering.
+     */
+    insertAfter(after: OMNode): OMNode;
+    /**
+     * Remove `node` from the order. Subsequent compares involving
+     * `node` are undefined behaviour. Other nodes' relative order is
+     * preserved.
+     */
+    delete(node: OMNode): void;
+    /**
+     * Compare the relative order of `a` and `b`. Returns:
+     * - a negative integer if `a` precedes `b` (was inserted earlier
+     *   or recipient-of-`insertAfter` chain),
+     * - zero if `a === b`,
+     * - a positive integer if `a` follows `b`.
+     *
+     * O(1) amortized in both naive and Bender impls. This is the
+     * hot path — the Spineless priority queue calls compare per
+     * insert/extract.
+     */
+    compare(a: OMNode, b: OMNode): number;
+}
+/**
+ * Naive O(N)-per-insert Order Maintenance. Correctness-only impl
+ * for scaffolding and as a fuzzer oracle for the future Bender impl.
+ *
+ * Invariants:
+ * - `_omTag` is strictly increasing along the `next` chain.
+ * - `_omTag` values are arbitrary integers but always orderable.
+ * - Insert renumbers all trailing nodes to maintain monotonicity.
+ *
+ * @internal
+ */
+export declare class NaiveOrderMaintenance implements OrderMaintenance {
+    private firstNode;
+    private nodeCount;
+    get size(): number;
+    /**
+     * Returns the first node in the order, or `null` if empty. Exposed
+     * for tests and for the priority queue's extract-min operation.
+     *
+     * @internal
+     */
+    first(): OMNode | null;
+    init(): OMNode;
+    insertAfter(after: OMNode): OMNode;
+    delete(node: OMNode): void;
+    compare(a: OMNode, b: OMNode): number;
+}
+/**
+ * Bender, Cole, Demaine, Farach-Colton, Zito (2002): "Two simplified
+ * algorithms for maintaining order in a list." Algorithm 1 — list-
+ * labeling with exponentially-growing window relabel.
+ *
+ * Operations:
+ * - `compare`: O(1) integer subtract.
+ * - `insertAfter`: amortized O(log N) per operation (looser than the
+ *   paper's O(1) amortized when using density bound (3/2)^d at depth d;
+ *   we trade a log factor for simpler integer arithmetic and avoid
+ *   BigInt).
+ * - `delete`: O(1).
+ *
+ * Cross-validated against `NaiveOrderMaintenance` via property fuzzer.
+ *
+ * @internal
+ */
+export declare class BenderOrderMaintenance implements OrderMaintenance {
+    private firstNode;
+    private nodeCount;
+    get size(): number;
+    first(): OMNode | null;
+    init(): OMNode;
+    insertAfter(after: OMNode): OMNode;
+    delete(node: OMNode): void;
+    compare(a: OMNode, b: OMNode): number;
+    /**
+     * Walk exponentially-growing windows around `pivot` until a window
+     * with low enough density to redistribute is found. Redistribute
+     * labels uniformly across that window.
+     *
+     * Density bound: `count * 2 ≤ span`. This guarantees:
+     *   - Every node gets a distinct integer label (count ≤ span).
+     *   - Each interval between consecutive labels has at least 2 units
+     *     of room, so subsequent midpoint inserts succeed without
+     *     triggering relabel again at the same depth.
+     *
+     * Window definition at depth d:
+     *   span    = 2^d
+     *   tagLow  = pivot._omTag aligned down to multiple of span
+     *   tagHigh = tagLow + span
+     *
+     * Amortized cost: O(log N) per insert. (Tighter than the paper's
+     * O(1) amortized with density bound (3/2)^d, but the bound here uses
+     * pure integer arithmetic for V8-friendly speed.)
+     *
+     * @internal
+     */
+    private relabel;
+    /**
+     * Fallback when the windowed relabel walks all the way up to the
+     * full label space without finding a sparse-enough window. Spreads
+     * every node uniformly across [0, LABEL_MAX).
+     *
+     * @internal
+     */
+    private globalRelabel;
+}
+//# sourceMappingURL=order-maintenance.d.ts.map

package/dist/algorithm/spineless/order-maintenance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"order-maintenance.d.ts","sourceRoot":"","sources":["../../../src/algorithm/spineless/order-maintenance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAEH;;;;;;;GAOG;AACH,MAAM,WAAW,MAAM;IACrB;;;;;;OAMG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;;;;;;;OAQG;IACH,IAAI,IAAI,MAAM,CAAC;IAEf;;;;;;;OAOG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;IAEnC;;;;OAIG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAE3B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACvC;AAkBD;;;;;;;;;;GAUG;AACH,qBAAa,qBAAsB,YAAW,gBAAgB;IAC5D,OAAO,CAAC,SAAS,CAA0B;IAC3C,OAAO,CAAC,SAAS,CAAK;IAEtB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;;;OAKG;IACH,KAAK,IAAI,MAAM,GAAG,IAAI;IAItB,IAAI,IAAI,MAAM;IAOd,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAyBlC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAkB1B,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;CAKtC;AA0BD;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,sBAAuB,YAAW,gBAAgB;IAC7D,OAAO,CAAC,SAAS,CAA2B;IAC5C,OAAO,CAAC,SAAS,CAAK;IAEtB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,KAAK,IAAI,MAAM,GAAG,IAAI;IAItB,IAAI,IAAI,MAAM;IASd,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAwBlC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAc1B,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIrC;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,OAAO,CAAC,OAAO;IAqDf;;;;;;OAMG;IACH,OAAO,CAAC,aAAa;CActB"}

package/dist/algorithm/spineless/order-maintenance.js

@@ -0,0 +1,294 @@
+/**
+ * Order Maintenance (OM) data structure.
+ *
+ * Maintains a totally-ordered set of items under insertions, deletions,
+ * and `compare(a, b)` queries that return the relative order in O(1) (or
+ * O(1) amortized). Foundational primitive for Spineless Traversal
+ * (Kirisame, Wang, Panchekha — PLDI 2025): the priority queue that
+ * drives incremental layout invalidation is keyed on OM timestamps,
+ * so a fast OM comparator dominates per-operation cost.
+ *
+ * Reference: Bender, Cole, Demaine, Farach-Colton, Zito. "Two
+ * simplified algorithms for maintaining order in a list." ESA 2002.
+ *
+ * ## What this file ships
+ *
+ * **The interface** — `OMNode`, `OrderMaintenance` — is the surface the
+ * Spineless runtime will consume. We design it so the implementation
+ * can be swapped (naive ↔ Bender amortized O(1)) without ripple.
+ *
+ * **The naive implementation** — `NaiveOrderMaintenance` — uses a single
+ * doubly-linked list with sequential integer tags assigned on insert.
+ * Inserts trigger O(N) renumbering of trailing nodes. Compare is O(1).
+ *
+ * This is the **scaffolding implementation**: correct, simple, lets us
+ * write all the consumer code (priority queue, runtime, attribute grammar
+ * interpreter) without waiting for the optimized impl. The Bender et al.
+ * amortized-O(1) implementation lands as a drop-in replacement once the
+ * Spineless runtime is wired and we can benchmark end-to-end. The naive
+ * impl stays in tree forever as a reference oracle: every Bender op is
+ * differentially compared against naive in the property-based test.
+ *
+ * ## Why JS and not WASM
+ *
+ * The paper's reference (Megatron) emits C++ and uses inline `cmov` for
+ * branchless compare. We can't use inline assembly in JS, but we don't
+ * have to: V8 already lowers `a < b` on 32-bit-integer hidden classes
+ * to a branchless `cmp` + `setb` sequence on x86-64. The TS-side cost is
+ * predominantly in the `lookup` (Map.get) and the unboxed compare itself.
+ *
+ * @internal
+ */
+/**
+ * Naive O(N)-per-insert Order Maintenance. Correctness-only impl
+ * for scaffolding and as a fuzzer oracle for the future Bender impl.
+ *
+ * Invariants:
+ * - `_omTag` is strictly increasing along the `next` chain.
+ * - `_omTag` values are arbitrary integers but always orderable.
+ * - Insert renumbers all trailing nodes to maintain monotonicity.
+ *
+ * @internal
+ */
+export class NaiveOrderMaintenance {
+    firstNode = null;
+    nodeCount = 0;
+    get size() {
+        return this.nodeCount;
+    }
+    /**
+     * Returns the first node in the order, or `null` if empty. Exposed
+     * for tests and for the priority queue's extract-min operation.
+     *
+     * @internal
+     */
+    first() {
+        return this.firstNode;
+    }
+    init() {
+        const first = { _omTag: 0, prev: null, next: null };
+        this.firstNode = first;
+        this.nodeCount = 1;
+        return first;
+    }
+    insertAfter(after) {
+        const afterNode = after;
+        const newNode = {
+            _omTag: afterNode._omTag + 1,
+            prev: afterNode,
+            next: afterNode.next,
+        };
+        if (afterNode.next !== null) {
+            afterNode.next.prev = newNode;
+        }
+        afterNode.next = newNode;
+        // Renumber trailing nodes to maintain strict monotonicity.
+        // O(N) worst case; this is the scaffolding-only cost the Bender
+        // impl removes.
+        let cursor = newNode.next;
+        let nextTag = newNode._omTag + 1;
+        while (cursor !== null) {
+            cursor._omTag = nextTag;
+            nextTag++;
+            cursor = cursor.next;
+        }
+        this.nodeCount++;
+        return newNode;
+    }
+    delete(node) {
+        const n = node;
+        if (n.prev !== null) {
+            n.prev.next = n.next;
+        }
+        else {
+            this.firstNode = n.next;
+        }
+        if (n.next !== null) {
+            n.next.prev = n.prev;
+        }
+        // Renumbering is not strictly required after delete (gaps in tags
+        // are harmless), but consistency with insertAfter's invariant
+        // (consecutive tags) simplifies reasoning. Skipped for now to
+        // avoid an extra O(N) walk; tests should not rely on consecutive
+        // tags after deletes.
+        this.nodeCount--;
+    }
+    compare(a, b) {
+        const ta = a._omTag;
+        const tb = b._omTag;
+        return ta - tb;
+    }
+}
+// --- Bender et al. 2002 Algorithm 1 (list-labeling with windowed relabel) ---
+/**
+ * Label space. Labels live in `[0, LABEL_MAX)`. Using 2^30 keeps every
+ * arithmetic op (midpoint, double, mask) in V8's 31-bit SMI range, so
+ * the JIT lowers everything to native int instructions. At 2^30 we can
+ * host ~50M items before any global rebalance is forced — far above
+ * typical TUI scale.
+ *
+ * @internal
+ */
+const LABEL_MAX = 1 << 30;
+/**
+ * Bender, Cole, Demaine, Farach-Colton, Zito (2002): "Two simplified
+ * algorithms for maintaining order in a list." Algorithm 1 — list-
+ * labeling with exponentially-growing window relabel.
+ *
+ * Operations:
+ * - `compare`: O(1) integer subtract.
+ * - `insertAfter`: amortized O(log N) per operation (looser than the
+ *   paper's O(1) amortized when using density bound (3/2)^d at depth d;
+ *   we trade a log factor for simpler integer arithmetic and avoid
+ *   BigInt).
+ * - `delete`: O(1).
+ *
+ * Cross-validated against `NaiveOrderMaintenance` via property fuzzer.
+ *
+ * @internal
+ */
+export class BenderOrderMaintenance {
+    firstNode = null;
+    nodeCount = 0;
+    get size() {
+        return this.nodeCount;
+    }
+    first() {
+        return this.firstNode;
+    }
+    init() {
+        // Start label at the middle of the space so first inserts have room
+        // both before (via the global rebalance path) and after.
+        const first = { _omTag: LABEL_MAX >> 1, prev: null, next: null };
+        this.firstNode = first;
+        this.nodeCount = 1;
+        return first;
+    }
+    insertAfter(after) {
+        const pred = after;
+        const succ = pred.next;
+        const succLabel = succ === null ? LABEL_MAX : succ._omTag;
+        const predLabel = pred._omTag;
+        // Midpoint between predecessor and successor labels. Integer-only.
+        const newLabel = (predLabel + succLabel) >> 1;
+        const newNode = { _omTag: newLabel, prev: pred, next: succ };
+        pred.next = newNode;
+        if (succ !== null)
+            succ.prev = newNode;
+        this.nodeCount++;
+        if (newLabel === predLabel) {
+            // No room between pred and succ — trigger a windowed relabel.
+            // Relabel updates newNode._omTag (and others in the window) to
+            // spread out across available label space.
+            this.relabel(newNode);
+        }
+        return newNode;
+    }
+    delete(node) {
+        const n = node;
+        if (n.prev !== null) {
+            n.prev.next = n.next;
+        }
+        else {
+            this.firstNode = n.next;
+        }
+        if (n.next !== null) {
+            n.next.prev = n.prev;
+        }
+        this.nodeCount--;
+        // Delete only creates extra label room; no rebalance needed.
+    }
+    compare(a, b) {
+        return a._omTag - b._omTag;
+    }
+    /**
+     * Walk exponentially-growing windows around `pivot` until a window
+     * with low enough density to redistribute is found. Redistribute
+     * labels uniformly across that window.
+     *
+     * Density bound: `count * 2 ≤ span`. This guarantees:
+     *   - Every node gets a distinct integer label (count ≤ span).
+     *   - Each interval between consecutive labels has at least 2 units
+     *     of room, so subsequent midpoint inserts succeed without
+     *     triggering relabel again at the same depth.
+     *
+     * Window definition at depth d:
+     *   span    = 2^d
+     *   tagLow  = pivot._omTag aligned down to multiple of span
+     *   tagHigh = tagLow + span
+     *
+     * Amortized cost: O(log N) per insert. (Tighter than the paper's
+     * O(1) amortized with density bound (3/2)^d, but the bound here uses
+     * pure integer arithmetic for V8-friendly speed.)
+     *
+     * @internal
+     */
+    relabel(pivot) {
+        let depth = 1;
+        let span = 2;
+        while (true) {
+            // Find aligned window boundaries around the pivot's current label.
+            const mask = (LABEL_MAX - 1) ^ (span - 1);
+            const tagLow = pivot._omTag & mask;
+            const tagHigh = tagLow + span;
+            // Find leftmost node in the window by walking back from pivot.
+            let firstInWindow = pivot;
+            while (firstInWindow.prev !== null && firstInWindow.prev._omTag >= tagLow) {
+                firstInWindow = firstInWindow.prev;
+            }
+            // Count nodes in the window and collect them in-order.
+            const inWindow = [];
+            let cursor = firstInWindow;
+            while (cursor !== null && cursor._omTag < tagHigh) {
+                inWindow.push(cursor);
+                cursor = cursor.next;
+            }
+            const count = inWindow.length;
+            // Density bound: redistribute only when there's at least 2x
+            // headroom in the window. This guarantees distinct labels +
+            // future-insert room without immediate re-relabel.
+            if (count * 2 <= span) {
+                const step = Math.max(1, (span / count) | 0);
+                // Center the assigned range: leave equal padding at both ends.
+                const used = (count - 1) * step + 1;
+                const startPad = Math.max(0, (span - used) >> 1);
+                let label = tagLow + startPad;
+                for (const node of inWindow) {
+                    node._omTag = label;
+                    label += step;
+                }
+                return;
+            }
+            // Window overcrowded — expand. Doubling depth doubles span.
+            // If span exceeds the label space, fall back to a global relabel.
+            depth++;
+            span <<= 1;
+            if (span >= LABEL_MAX) {
+                this.globalRelabel();
+                return;
+            }
+        }
+    }
+    /**
+     * Fallback when the windowed relabel walks all the way up to the
+     * full label space without finding a sparse-enough window. Spreads
+     * every node uniformly across [0, LABEL_MAX).
+     *
+     * @internal
+     */
+    globalRelabel() {
+        const all = [];
+        let cursor = this.firstNode;
+        while (cursor !== null) {
+            all.push(cursor);
+            cursor = cursor.next;
+        }
+        const stride = Math.max(1, (LABEL_MAX / (all.length + 1)) | 0);
+        let label = stride;
+        for (const node of all) {
+            node._omTag = label;
+            label += stride;
+        }
+    }
+}
+//# sourceMappingURL=order-maintenance.js.map