apex-grid 3.5.0 → 4.0.0-beta.1

package/controllers/tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../src/controllers/tree.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAEpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAKzD,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAGtC,MAAM,WAAW,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC;AAkDnD,MAAM,OAAO,cAAc;IAIzB,KAAK,CAAiC;IACtC,cAAc,CAAkC;IAEhD,cAAc,CAAwB;IAEtC,gBAAgB,CAAS;IAEzB,SAAS,CAA4B;IAErC,YAAsB,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QAZhC,aAAQ,GAAW,IAAI,GAAG,EAAE,CAAC;QAC7B,iBAAY,GAAgB,IAAI,GAAG,EAAE,CAAC;QAE7C,UAAK,GAAG,IAAI,OAAO,EAAkB,CAAC;QACtC,mBAAc,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEhD,mBAAc,GAAG,IAAI,GAAG,EAAa,CAAC;QAEtC,qBAAgB,GAAG,KAAK,CAAC;QAEzB,cAAS,GAAuB,IAAI,CAAC;QAGnC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAEM,aAAa,KAAI,CAAC;IAGzB,IAAW,OAAO;QAChB,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACzE,CAAC;IAGD,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,IAAI,mBAAmB,CAAC;IAC5D,CAAC;IAMD,IAAW,cAAc;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC;QAClD,IAAI,UAAU;YAAE,OAAO,UAAU,CAAC;QAClC,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxF,OAAO,SAAS,EAAE,GAAG,CAAC;IACxB,CAAC;IAEM,aAAa,CAAC,GAAY;QAC/B,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,KAAK,GAAG,CAAC;IACrD,CAAC;IAMM,OAAO,CAAC,GAAM;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAEM,QAAQ,CAAC,GAAM;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IACzC,CAAC;IAEM,WAAW,CAAC,GAAM;QACvB,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;IACnD,CAAC;IAEM,aAAa,CAAC,GAAM;QACzB,OAAQ,GAAmC,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC;IACpE,CAAC;IAGM,QAAQ,CAAC,GAAM;QACpB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IAC5C,CAAC;IAEM,UAAU,CAAC,GAAM;QACtB,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;YACrC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAGM,KAAK,CAAC,SAAS,CAAC,GAAM;QAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,GAAM;QAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACtC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;gBACrC,IAAI,GAAG;oBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,KAAK,CAAC,WAAW,CAAC,GAAM;QAC7B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;gBACrC,IAAI,GAAG;oBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAGM,KAAK,CAAC,SAAS;QACpB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC5B,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,EAAE;gBAClC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9C,IAAI,IAAI,CAAC,IAAI;wBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;wBAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC9B,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;oBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAClD,CAAC,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAGM,KAAK,CAAC,WAAW;QACtB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1E,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACnB,CAAC,CAAC,CAAC;IACL,CAAC;IAQM,OAAO,CAAC,KAAuB;QACpC,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAY,CAAC;QAEvC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,WAAW,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACjD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAGtB,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IASM,gBAAgB,CAAC,QAAqB,EAAE,YAA8B;QAC3E,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAOM,kBAAkB;QACvB,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;IAIhC,CAAC;IAID,UAAU,CAAC,IAAsB,EAAE,WAA0C;QAC3E,MAAM,IAAI,GAAgB;YACxB,IAAI,EAAE,IAAI;YACV,IAAI,EAAE,EAAE;YACR,GAAG,EAAE,EAAE;YACP,KAAK,EAAE,CAAC,CAAC;YACT,MAAM,EAAE,IAAI;YACZ,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC7C,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEjD,IAAI,MAAM,GAAG,IAAI,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,GAAG;wBACL,IAAI,EAAE,IAAI;wBACV,IAAI,EAAE,GAAG;wBACT,GAAG;wBACH,KAAK,EAAE,CAAC;wBACR,MAAM;wBACN,QAAQ,EAAE,EAAE;qBACb,CAAC;oBACF,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBACrB,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7B,CAAC;gBACD,IAAI,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAI9B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;gBAClB,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,cAAc,CAAC,IAAiB;QAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC;QAChD,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK;YAAE,OAAO;QACvD,MAAM,aAAa,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;QACvF,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,EAAE;YAClC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,aAAa,EAAE,CAAC;gBAC7E,IAAI,IAAI,CAAC,IAAI;oBAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;oBACvC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvC,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IAED,YAAY,CAAC,IAAiB;QAK5B,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,EAAE;YAClC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,MAAM,IAAI,GAAgB;oBACxB,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBACrC,GAAG,EAAE,IAAI,CAAC,GAAG;oBACb,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE;iBAC7C,CAAC;gBACF,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAClC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,IAAiB;QACxB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,CAAC,IAAiB,EAAE,EAAE;YACjC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBAGN,IAAI,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACpD,IAAI,CAAC,WAAW,EAAE,CAAC;wBACjB,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAM,CAAC;wBACvC,MAAM,CAAC,cAAc,CAAC,WAAW,EAAE,WAAW,EAAE;4BAC9C,KAAK,EAAE,IAAI;4BACX,UAAU,EAAE,KAAK;yBAClB,CAAC,CAAC;wBACH,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;oBACjD,CAAC;oBACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAE,CAAC,CAAC;oBAChE,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;YACD,MAAM,QAAQ,GACZ,IAAI,KAAK,IAAI;gBACb,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;oBAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACjD,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,CAAC;QACX,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,MAAyD;QACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC5C,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE3B,MAAM,WAAW,GACf,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/F,MAAM,WAAW,GACf,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,IAAI;YACxC,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW;YAAE,OAAO,IAAI,CAAC;QAE9C,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,KAAK,MAAM,GAAG,IAAI,QAAQ;YAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzE,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE3E,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,EAAE;YACtD,MAAM,EAAE;gBACN,KAAK;gBACL,OAAO;gBACP,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAClC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;aAC3B;YACD,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAE7B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAElC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,EAAE;YACrC,MAAM,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;SAChE,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["import type { ReactiveController } from 'lit';\nimport { PIPELINE } from '../internal/constants.js';\nimport type { GridHost, Keys } from '../internal/types.js';\nimport { getDisplayColumns } from '../internal/utils.js';\n\n/**\n * Default pixel indentation per depth level for the tree group column.\n */\nexport const DEFAULT_TREE_INDENT = 20;\n\n/** Sentinel value used to mark synthesized parents (those that exist only as a path segment, with no backing row). */\nconst SYNTHESIZED = Symbol('synthesized-tree-row');\n\n/**\n * Internal tree node. Built from the flat data + `getDataPath` callback;\n * lives only for the duration of one pipeline pass.\n */\ninterface TreeNode<T extends object> {\n  /** The backing row when one exists at this path, else `null` (synthesized parent). */\n  data: T | null;\n  /** Path segments from root to this node. */\n  path: readonly string[];\n  /** `path.join('\u0000')` — used as stable string identity for synthesized nodes. */\n  key: string;\n  depth: number;\n  parent: TreeNode<T> | null;\n  children: TreeNode<T>[];\n}\n\n/**\n * Tree metadata exposed to renderers. One entry per row that ends up in the\n * flat output.\n */\nexport interface TreeRowMeta {\n  depth: number;\n  hasChildren: boolean;\n  /** Stable key for the row (path-joined string). Useful for keyed reconciliation. */\n  key: string;\n  /** Last path segment — used as the group-column label for synthesized parents. */\n  label: string;\n}\n\n/**\n * Reactive controller backing tree (nested-row) data.\n *\n * @remarks\n * Tree mode keeps the data array flat. Each row's hierarchy is derived from a\n * user-supplied `getDataPath` callback (AG Grid's \"tree data\" pattern). The\n * controller:\n *\n *  1. Builds an in-memory tree from the post-sort, post-filter rows.\n *  2. Synthesizes parent nodes for any path level that lacks a backing row.\n *  3. Walks the tree honouring the current expansion set and emits a flat\n *     list of rows in display order.\n *  4. Records per-row metadata (depth, hasChildren) that the cell renderer\n *     reads to draw the chevron + indentation.\n *\n * Expansion state is split into two sets — `expanded` for rows that have\n * backing data (keyed by reference, so it survives sort/filter), and\n * `expandedKeys` for synthesized parents (keyed by their path string).\n */\nexport class TreeController<T extends object> implements ReactiveController {\n  public expanded: Set<T> = new Set();\n  public expandedKeys: Set<string> = new Set();\n\n  #meta = new WeakMap<T, TreeRowMeta>();\n  #syntheticMeta = new Map<string, TreeRowMeta>();\n  /** Synthesized parent placeholder rows so consumers still get a `T`-shaped object. */\n  #syntheticRows = new Map<string, T>();\n  /** Whether `defaultExpanded` has been applied once for the current data set. */\n  #defaultsApplied = false;\n  /** Most recently built root node. Used to walk the full tree for expand-all. */\n  #lastRoot: TreeNode<T> | null = null;\n\n  constructor(protected host: GridHost<T>) {\n    this.host.addController(this);\n  }\n\n  public hostConnected() {}\n\n  /** Whether tree mode is enabled at the grid level. */\n  public get enabled(): boolean {\n    return Boolean(this.host.tree?.enabled && this.host.tree?.getDataPath);\n  }\n\n  /** The configured indentation, in pixels, per depth level. */\n  public get childIndent(): number {\n    return this.host.tree?.childIndent ?? DEFAULT_TREE_INDENT;\n  }\n\n  /**\n   * The column key that displays the chevron + indentation. Resolves to the\n   * configured `groupColumnKey`, falling back to the first visible data column.\n   */\n  public get groupColumnKey(): Keys<T> | undefined {\n    const configured = this.host.tree?.groupColumnKey;\n    if (configured) return configured;\n    const displayed = getDisplayColumns(this.host.columns).find((column) => !column.hidden);\n    return displayed?.key;\n  }\n\n  public isGroupColumn(key: Keys<T>): boolean {\n    return this.enabled && this.groupColumnKey === key;\n  }\n\n  /**\n   * Per-row metadata. Populated as a side effect of {@link process}; reading\n   * before the first pipeline pass returns `undefined`.\n   */\n  public getMeta(row: T): TreeRowMeta | undefined {\n    return this.#meta.get(row);\n  }\n\n  public getDepth(row: T): number {\n    return this.#meta.get(row)?.depth ?? 0;\n  }\n\n  public hasChildren(row: T): boolean {\n    return Boolean(this.#meta.get(row)?.hasChildren);\n  }\n\n  public isSynthesized(row: T): boolean {\n    return (row as { [SYNTHESIZED]?: boolean })[SYNTHESIZED] === true;\n  }\n\n  /** Group-column label override for synthesized parent rows. */\n  public getLabel(row: T): string | null {\n    if (!this.isSynthesized(row)) return null;\n    return this.#meta.get(row)?.label ?? null;\n  }\n\n  public isExpanded(row: T): boolean {\n    if (this.isSynthesized(row)) {\n      const key = this.#meta.get(row)?.key;\n      return key ? this.expandedKeys.has(key) : false;\n    }\n    return this.expanded.has(row);\n  }\n\n  /** Toggles the expansion state of a tree row. */\n  public async toggleRow(row: T): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (!this.hasChildren(row)) return false;\n    const wasExpanded = this.isExpanded(row);\n    return wasExpanded ? this.collapseRow(row) : this.expandRow(row);\n  }\n\n  public async expandRow(row: T): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (!this.hasChildren(row)) return false;\n    if (this.isExpanded(row)) return true;\n    return this.#commit((nextData, nextKeys) => {\n      if (this.isSynthesized(row)) {\n        const key = this.#meta.get(row)?.key;\n        if (key) nextKeys.add(key);\n      } else {\n        nextData.add(row);\n      }\n    });\n  }\n\n  public async collapseRow(row: T): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (!this.isExpanded(row)) return true;\n    return this.#commit((nextData, nextKeys) => {\n      if (this.isSynthesized(row)) {\n        const key = this.#meta.get(row)?.key;\n        if (key) nextKeys.delete(key);\n      } else {\n        nextData.delete(row);\n      }\n    });\n  }\n\n  /** Expands every parent in the current tree. */\n  public async expandAll(): Promise<boolean> {\n    if (!this.enabled) return false;\n    const root = this.#lastRoot;\n    if (!root) return false;\n    return this.#commit((nextData, nextKeys) => {\n      const visit = (node: TreeNode<T>) => {\n        if (node !== root && node.children.length > 0) {\n          if (node.data) nextData.add(node.data);\n          else nextKeys.add(node.key);\n        }\n        for (const child of node.children) visit(child);\n      };\n      visit(root);\n    });\n  }\n\n  /** Collapses every currently-expanded row. */\n  public async collapseAll(): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (this.expanded.size === 0 && this.expandedKeys.size === 0) return true;\n    return this.#commit((nextData, nextKeys) => {\n      nextData.clear();\n      nextKeys.clear();\n    });\n  }\n\n  /**\n   * Pipeline entry point. Called by {@link DataOperationsController.apply}\n   * after sort/filter/quickFilter. Builds the tree, applies the configured\n   * defaults the first time we see this data, and returns rows in\n   * display-order with any synthesized parents inserted.\n   */\n  public process(input: ReadonlyArray<T>): T[] {\n    if (!this.enabled) return input as T[];\n\n    const getDataPath = this.host.tree!.getDataPath;\n    const root = this.#buildTree(input, getDataPath);\n    this.#lastRoot = root;\n\n    // Apply defaultExpanded once per data set.\n    if (!this.#defaultsApplied) {\n      this.#applyDefaults(root);\n      this.#defaultsApplied = true;\n    }\n\n    this.#refreshMeta(root);\n    return this.#flatten(root);\n  }\n\n  /**\n   * Replaces the expansion state wholesale — used by `ApexGrid.setState` to\n   * restore a snapshot. Sets both the backing-row set and the synthesized-parent\n   * key set directly (no `treeRowExpanding`/`treeRowExpanded` events), marks\n   * `defaultExpanded` as already applied so the next pipeline pass treats the\n   * restored state as authoritative, and re-runs the pipeline.\n   */\n  public restoreExpansion(expanded: Iterable<T>, expandedKeys: Iterable<string>): void {\n    this.expanded = new Set(expanded);\n    this.expandedKeys = new Set(expandedKeys);\n    this.#defaultsApplied = true;\n    this.host.requestUpdate(PIPELINE);\n  }\n\n  /**\n   * Resets cached metadata + defaults flag so the next pipeline pass\n   * re-applies `defaultExpanded`. Called from the data watcher when the\n   * input array is replaced wholesale.\n   */\n  public resetForDataChange(): void {\n    this.#defaultsApplied = false;\n    // Don't clear `expanded`/`expandedKeys`; consumers may want them to\n    // survive across pipeline passes. If a wholesale data swap orphans\n    // references, those entries are simply ignored on the next pass.\n  }\n\n  // --- internals ---------------------------------------------------------\n\n  #buildTree(rows: ReadonlyArray<T>, getDataPath: (row: T) => readonly string[]): TreeNode<T> {\n    const root: TreeNode<T> = {\n      data: null,\n      path: [],\n      key: '',\n      depth: -1,\n      parent: null,\n      children: [],\n    };\n    const byKey = new Map<string, TreeNode<T>>();\n    byKey.set('', root);\n\n    for (const row of rows) {\n      const fullPath = getDataPath(row);\n      if (!fullPath || fullPath.length === 0) continue;\n\n      let parent = root;\n      for (let i = 0; i < fullPath.length; i++) {\n        const sub = fullPath.slice(0, i + 1);\n        const key = sub.join('\u0000');\n        let node = byKey.get(key);\n        if (!node) {\n          node = {\n            data: null,\n            path: sub,\n            key,\n            depth: i,\n            parent,\n            children: [],\n          };\n          byKey.set(key, node);\n          parent.children.push(node);\n        }\n        if (i === fullPath.length - 1) {\n          // The terminal segment is the actual record. If we previously\n          // saw a child path that synthesized this level, attach the data\n          // now.\n          node.data = row;\n        }\n        parent = node;\n      }\n    }\n\n    return root;\n  }\n\n  #applyDefaults(root: TreeNode<T>): void {\n    const setting = this.host.tree?.defaultExpanded;\n    if (setting === undefined || setting === false) return;\n    const expandToDepth = typeof setting === 'number' ? setting : Number.POSITIVE_INFINITY;\n    const visit = (node: TreeNode<T>) => {\n      if (node !== root && node.children.length > 0 && node.depth <= expandToDepth) {\n        if (node.data) this.expanded.add(node.data);\n        else this.expandedKeys.add(node.key);\n      }\n      for (const child of node.children) visit(child);\n    };\n    visit(root);\n  }\n\n  #refreshMeta(root: TreeNode<T>): void {\n    // Recompute meta for every node in the tree, both synthesized and\n    // backed. The metadata is fresh each pipeline pass since depth or\n    // hasChildren may have changed (rows reordered, filter dropped a\n    // descendant, etc.).\n    const visit = (node: TreeNode<T>) => {\n      if (node !== root) {\n        const meta: TreeRowMeta = {\n          depth: node.depth,\n          hasChildren: node.children.length > 0,\n          key: node.key,\n          label: node.path[node.path.length - 1] ?? '',\n        };\n        if (node.data) {\n          this.#meta.set(node.data, meta);\n        } else {\n          this.#syntheticMeta.set(node.key, meta);\n        }\n      }\n      for (const child of node.children) visit(child);\n    };\n    visit(root);\n  }\n\n  #flatten(root: TreeNode<T>): T[] {\n    const out: T[] = [];\n    const walk = (node: TreeNode<T>) => {\n      if (node !== root) {\n        if (node.data) {\n          out.push(node.data);\n        } else {\n          // Synthesize a `T`-shaped placeholder so callers don't trip on\n          // `null` rows. The placeholder carries the SYNTHESIZED marker.\n          let placeholder = this.#syntheticRows.get(node.key);\n          if (!placeholder) {\n            placeholder = Object.create(null) as T;\n            Object.defineProperty(placeholder, SYNTHESIZED, {\n              value: true,\n              enumerable: false,\n            });\n            this.#syntheticRows.set(node.key, placeholder);\n          }\n          this.#meta.set(placeholder, this.#syntheticMeta.get(node.key)!);\n          out.push(placeholder);\n        }\n      }\n      const expanded =\n        node === root ||\n        (node.data ? this.expanded.has(node.data) : this.expandedKeys.has(node.key));\n      if (expanded) {\n        for (const child of node.children) walk(child);\n      }\n    };\n    walk(root);\n    return out;\n  }\n\n  async #commit(mutate: (nextData: Set<T>, nextKeys: Set<string>) => void): Promise<boolean> {\n    const nextData = new Set(this.expanded);\n    const nextKeys = new Set(this.expandedKeys);\n    mutate(nextData, nextKeys);\n\n    const dataChanged =\n      nextData.size !== this.expanded.size || [...nextData].some((row) => !this.expanded.has(row));\n    const keysChanged =\n      nextKeys.size !== this.expandedKeys.size ||\n      [...nextKeys].some((key) => !this.expandedKeys.has(key));\n    if (!dataChanged && !keysChanged) return true;\n\n    const added: T[] = [];\n    const removed: T[] = [];\n    for (const row of nextData) if (!this.expanded.has(row)) added.push(row);\n    for (const row of this.expanded) if (!nextData.has(row)) removed.push(row);\n\n    const proceed = this.host.emitEvent('treeRowExpanding', {\n      detail: {\n        added,\n        removed,\n        current: Array.from(this.expanded),\n        next: Array.from(nextData),\n      },\n      cancelable: true,\n    });\n    if (!proceed) return false;\n\n    this.expanded = nextData;\n    this.expandedKeys = nextKeys;\n    // Re-run the pipeline so the flat output reflects the new expansion set.\n    this.host.requestUpdate(PIPELINE);\n\n    this.host.emitEvent('treeRowExpanded', {\n      detail: { added, removed, expanded: Array.from(this.expanded) },\n    });\n    return true;\n  }\n}\n"]}
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../src/controllers/tree.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAEpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAK/C,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAGtC,MAAM,WAAW,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC;AAGnD,MAAM,cAAc,GAAG,IAAI,CAAC;AA6D5B,MAAM,OAAO,cAAc;IAIzB,KAAK,CAAiC;IAEtC,cAAc,CAAwB;IAEtC,gBAAgB,CAAS;IAEzB,YAAY,CAAoB;IAChC,SAAS,CAAqB;IAE9B,iBAAiB,CAAS;IAE1B,SAAS,CAA4B;IAErC,QAAQ,CAA+B;IAEvC,YAAsB,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QAlBhC,aAAQ,GAAW,IAAI,GAAG,EAAE,CAAC;QAC7B,iBAAY,GAAgB,IAAI,GAAG,EAAE,CAAC;QAE7C,UAAK,GAAG,IAAI,OAAO,EAAkB,CAAC;QAEtC,mBAAc,GAAG,IAAI,GAAG,EAAa,CAAC;QAEtC,qBAAgB,GAAG,KAAK,CAAC;QAEzB,iBAAY,GAAG,IAAI,OAAO,EAAK,CAAC;QAChC,cAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAE9B,sBAAiB,GAAG,KAAK,CAAC;QAE1B,cAAS,GAAuB,IAAI,CAAC;QAErC,aAAQ,GAA0B,IAAI,CAAC;QAevC,iBAAY,GAAG,GAAG,EAAE;YAClB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACvB,CAAC,CAAC;QAdA,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAEM,aAAa;QAClB,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IACpE,CAAC;IAEM,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IACvE,CAAC;IAGD,YAAY,CAEV;IAGF,IAAW,OAAO;QAChB,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACzE,CAAC;IAGD,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,IAAI,mBAAmB,CAAC;IAC5D,CAAC;IAMD,IAAW,cAAc;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC;QAClD,IAAI,UAAU;YAAE,OAAO,UAAU,CAAC;QAClC,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxF,OAAO,SAAS,EAAE,GAAG,CAAC;IACxB,CAAC;IAEM,aAAa,CAAC,GAAY;QAC/B,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,KAAK,GAAG,CAAC;IACrD,CAAC;IAMM,OAAO,CAAC,GAAM;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAEM,QAAQ,CAAC,GAAM;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IACzC,CAAC;IAEM,WAAW,CAAC,GAAM;QACvB,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;IACnD,CAAC;IAEM,aAAa,CAAC,GAAM;QACzB,OAAQ,GAAmC,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC;IACpE,CAAC;IAGM,QAAQ,CAAC,GAAM;QACpB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IAC5C,CAAC;IAEM,UAAU,CAAC,GAAM;QACtB,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;YACrC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAGM,KAAK,CAAC,SAAS,CAAC,GAAM;QAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,GAAM;QAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACzC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACtC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;gBACrC,IAAI,GAAG;oBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,KAAK,CAAC,WAAW,CAAC,GAAM;QAC7B,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;gBACrC,IAAI,GAAG;oBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAGM,KAAK,CAAC,SAAS;QACpB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC5B,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,EAAE;gBAClC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9C,IAAI,IAAI,CAAC,IAAI;wBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;wBAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC9B,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;oBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAClD,CAAC,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAGM,KAAK,CAAC,WAAW;QACtB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1E,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACzC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACnB,CAAC,CAAC,CAAC;IACL,CAAC;IAQM,OAAO,CAAC,KAAuB;QACpC,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAY,CAAC;QAEvC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,WAAW,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACjD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAGtB,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC;QAC7C,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAE7B,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;QAC1F,IAAI,SAAS;YAAE,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC;QAE9C,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IASM,gBAAgB,CAAC,QAAqB,EAAE,YAA8B;QAC3E,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAQM,kBAAkB;QACvB,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IACrE,CAAC;IAID,UAAU,CAAC,IAAsB,EAAE,WAA0C;QAC3E,MAAM,IAAI,GAAgB;YACxB,IAAI,EAAE,IAAI;YACV,IAAI,EAAE,EAAE;YACR,GAAG,EAAE,EAAE;YACP,KAAK,EAAE,CAAC,CAAC;YACT,MAAM,EAAE,IAAI;YACZ,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC7C,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE7C,MAAM,YAAY,GAAkB,EAAE,CAAC;QAEvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEjD,IAAI,MAAM,GAAG,IAAI,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACrC,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,GAAG;wBACL,IAAI,EAAE,IAAI;wBACV,IAAI,EAAE,GAAG;wBACT,GAAG;wBACH,KAAK,EAAE,CAAC;wBACR,MAAM;wBACN,QAAQ,EAAE,EAAE;qBACb,CAAC;oBACF,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBACrB,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3B,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC;wBAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvD,CAAC;gBACD,IAAI,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAK9B,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;wBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;;wBAC5E,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;gBACvB,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IAQD,QAAQ,CACN,IAAiB,EACjB,GAAM,EACN,KAA+B,EAC/B,WAA0C;QAE1C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,IAAI,GAAgB;YACxB,GAAG,IAAI;YACP,IAAI,EAAE,GAAG;YACT,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,cAAc,GAAG,cAAc,GAAG,CAAC,EAAE;YACxD,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAO,CAAC,QAAQ,CAAC;QACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,KAAK,GAAG,EAAE,CAAC;YAGlD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;YAChB,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;YACxC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACvC,CAAC;IACH,CAAC;IAYD,uBAAuB,CACrB,IAAsB,EACtB,YAAwC,EACxC,WAA0C;QAE1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACzD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC;QAC5E,CAAC;IACH,CAAC;IAOD,SAAS,CAAC,GAAW,EAAE,WAA0C;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,KAAK,GAAG;YAAE,OAAO,MAAM,CAAC;QAChF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC;IAOD,aAAa,CAAC,WAA0C;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC7B,IACE,MAAM,EAAE,IAAI,KAAK,IAAI;YACrB,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YAC7B,MAAM,CAAC,WAAW,KAAK,WAAW,EAClC,CAAC;YACD,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAa,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,MAAM;gBAAE,SAAS;YAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;QAClE,OAAO,KAAK,CAAC;IACf,CAAC;IASD,YAAY,CAAC,IAAiB,EAAE,aAAsB,EAAE,SAAkB;QACxE,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5E,MAAM,aAAa,GACjB,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC,IAAI,CAAC;QACtD,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,EAAE;YAClC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,MAAM,IAAI,GAAgB;oBACxB,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBACrC,GAAG,EAAE,IAAI,CAAC,GAAG;oBACb,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE;iBAC7C,CAAC;gBACF,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChC,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC1D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACjC,IAAI,IAAI,CAAC,KAAK,IAAI,aAAa;4BAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChE,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;oBAClD,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACxB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;wBAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBAC7B,IAAI,IAAI,CAAC,KAAK,IAAI,aAAa;4BAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,CAAC;QAEZ,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY;gBAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC3F,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS;gBAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACrF,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAMD,YAAY,CAAC,GAAW;QACtB,IAAI,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/C,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAM,CAAC;YACvC,MAAM,CAAC,cAAc,CAAC,WAAW,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;YACpF,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,QAAQ,CAAC,IAAiB;QACxB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,CAAC,IAAiB,EAAE,EAAE;YACjC,IAAI,IAAI,KAAK,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,MAAM,QAAQ,GACZ,IAAI,KAAK,IAAI;gBACb,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;oBAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACjD,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,CAAC;QACX,OAAO,GAAG,CAAC;IACb,CAAC;IAGD,OAAO,CAAC,IAAiB,EAAE,IAAsB;QAC/C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,WAAW;gBAAE,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,MAAyD;QACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC5C,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE3B,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3E,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7E,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YACzF,OAAO,IAAI,CAAC;QACd,CAAC;QAID,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAEvD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,EAAE;YACtD,MAAM,EAAE;gBACN,KAAK;gBACL,OAAO;gBACP,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC;gBACvD,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC;aACvC;YACD,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAE7B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAElC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,EAAE;YACrC,MAAM,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,EAAE;SACrF,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["import type { ReactiveController } from 'lit';\nimport { PIPELINE } from '../internal/constants.js';\nimport type { GridHost, Keys } from '../internal/types.js';\nimport { getDisplayColumns } from '../internal/utils.js';\nimport { retainPresent } from './expansion.js';\n\n/**\n * Default pixel indentation per depth level for the tree group column.\n */\nexport const DEFAULT_TREE_INDENT = 20;\n\n/** Sentinel value used to mark synthesized parents (those that exist only as a path segment, with no backing row). */\nconst SYNTHESIZED = Symbol('synthesized-tree-row');\n\n/** Joins path segments into a node key; a character no segment is expected to hold. */\nconst PATH_SEPARATOR = '\\0';\n\n/**\n * Internal tree node. Built from the flat data + `getDataPath` callback;\n * lives only for the duration of one pipeline pass.\n */\ninterface TreeNode<T extends object> {\n  /** The backing row when one exists at this path, else `null` (synthesized parent). */\n  data: T | null;\n  /** Path segments from root to this node. */\n  path: readonly string[];\n  /** `path.join(PATH_SEPARATOR)`, the stable string identity for synthesized nodes. */\n  key: string;\n  depth: number;\n  parent: TreeNode<T> | null;\n  children: TreeNode<T>[];\n}\n\n/** Path key to record lookup over one data array, valid while that array is unchanged. */\ninterface RecordIndex<T extends object> {\n  data: ReadonlyArray<T>;\n  length: number;\n  getDataPath: (row: T) => readonly string[];\n  byKey: Map<string, T>;\n}\n\n/**\n * Tree metadata exposed to renderers. One entry per row that ends up in the\n * flat output.\n */\nexport interface TreeRowMeta {\n  depth: number;\n  hasChildren: boolean;\n  /** Stable key for the row (path-joined string). Useful for keyed reconciliation. */\n  key: string;\n  /** Last path segment, used as the group-column label for synthesized parents. */\n  label: string;\n}\n\n/**\n * Reactive controller backing tree (nested-row) data.\n *\n * @remarks\n * Tree mode keeps the data array flat. Each row's hierarchy is derived from a\n * user-supplied `getDataPath` callback that returns the row's path from the\n * root (the flat-array \"tree data\" pattern). The controller:\n *\n *  1. Builds an in-memory tree from the post-sort, post-filter rows.\n *  2. Synthesizes parent nodes for any path level that lacks a backing row\n *     in the data. A level whose own row was filtered out shows that row.\n *  3. Walks the tree honouring the current expansion set and emits a flat\n *     list of rows in display order.\n *  4. Records per-row metadata (depth, hasChildren) that the cell renderer\n *     reads to draw the chevron + indentation.\n *\n * Expansion state is split into two sets: `expanded` for rows that have\n * backing data (keyed by reference, so it survives sort/filter), and\n * `expandedKeys` for synthesized parents (keyed by their path string). Both\n * follow a data refresh: entries whose row or path left the data are dropped,\n * and `defaultExpanded` applies only to parents not seen before.\n */\nexport class TreeController<T extends object> implements ReactiveController {\n  public expanded: Set<T> = new Set();\n  public expandedKeys: Set<string> = new Set();\n\n  #meta = new WeakMap<T, TreeRowMeta>();\n  /** Synthesized parent placeholder rows so consumers still get a `T`-shaped object. */\n  #syntheticRows = new Map<string, T>();\n  /** Whether `defaultExpanded` has been applied once for the current data set. */\n  #defaultsApplied = false;\n  /** Parents `defaultExpanded` has already been weighed for, by row and by path. */\n  #seenParents = new WeakSet<T>();\n  #seenKeys = new Set<string>();\n  /** Set on a data change: the next build over the whole data prunes stale path keys. */\n  #reconcilePending = false;\n  /** Most recently built root node. Used to walk the full tree for expand-all. */\n  #lastRoot: TreeNode<T> | null = null;\n  /** The first record per path key in `host.data`, built once per data array when needed. */\n  #records: RecordIndex<T> | null = null;\n\n  constructor(protected host: GridHost<T>) {\n    this.host.addController(this);\n  }\n\n  public hostConnected() {\n    this.host.addEventListener('cellValueChanged', this.#dropRecords);\n  }\n\n  public hostDisconnected() {\n    this.host.removeEventListener('cellValueChanged', this.#dropRecords);\n  }\n\n  /** An edit writes through to the record in place and may change its path. */\n  #dropRecords = () => {\n    this.#records = null;\n  };\n\n  /** Whether tree mode is enabled at the grid level. */\n  public get enabled(): boolean {\n    return Boolean(this.host.tree?.enabled && this.host.tree?.getDataPath);\n  }\n\n  /** The configured indentation, in pixels, per depth level. */\n  public get childIndent(): number {\n    return this.host.tree?.childIndent ?? DEFAULT_TREE_INDENT;\n  }\n\n  /**\n   * The column key that displays the chevron + indentation. Resolves to the\n   * configured `groupColumnKey`, falling back to the first visible data column.\n   */\n  public get groupColumnKey(): Keys<T> | undefined {\n    const configured = this.host.tree?.groupColumnKey;\n    if (configured) return configured;\n    const displayed = getDisplayColumns(this.host.columns).find((column) => !column.hidden);\n    return displayed?.key;\n  }\n\n  public isGroupColumn(key: Keys<T>): boolean {\n    return this.enabled && this.groupColumnKey === key;\n  }\n\n  /**\n   * Per-row metadata. Populated as a side effect of {@link process}; reading\n   * before the first pipeline pass returns `undefined`.\n   */\n  public getMeta(row: T): TreeRowMeta | undefined {\n    return this.#meta.get(row);\n  }\n\n  public getDepth(row: T): number {\n    return this.#meta.get(row)?.depth ?? 0;\n  }\n\n  public hasChildren(row: T): boolean {\n    return Boolean(this.#meta.get(row)?.hasChildren);\n  }\n\n  public isSynthesized(row: T): boolean {\n    return (row as { [SYNTHESIZED]?: boolean })[SYNTHESIZED] === true;\n  }\n\n  /** Group-column label override for synthesized parent rows. */\n  public getLabel(row: T): string | null {\n    if (!this.isSynthesized(row)) return null;\n    return this.#meta.get(row)?.label ?? null;\n  }\n\n  public isExpanded(row: T): boolean {\n    if (this.isSynthesized(row)) {\n      const key = this.#meta.get(row)?.key;\n      return key ? this.expandedKeys.has(key) : false;\n    }\n    return this.expanded.has(row);\n  }\n\n  /** Toggles the expansion state of a tree row. */\n  public async toggleRow(row: T): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (!this.hasChildren(row)) return false;\n    const wasExpanded = this.isExpanded(row);\n    return wasExpanded ? this.collapseRow(row) : this.expandRow(row);\n  }\n\n  public async expandRow(row: T): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (!this.hasChildren(row)) return false;\n    if (this.isExpanded(row)) return true;\n    return this.#commit((nextData, nextKeys) => {\n      if (this.isSynthesized(row)) {\n        const key = this.#meta.get(row)?.key;\n        if (key) nextKeys.add(key);\n      } else {\n        nextData.add(row);\n      }\n    });\n  }\n\n  public async collapseRow(row: T): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (!this.isExpanded(row)) return true;\n    return this.#commit((nextData, nextKeys) => {\n      if (this.isSynthesized(row)) {\n        const key = this.#meta.get(row)?.key;\n        if (key) nextKeys.delete(key);\n      } else {\n        nextData.delete(row);\n      }\n    });\n  }\n\n  /** Expands every parent in the current tree. */\n  public async expandAll(): Promise<boolean> {\n    if (!this.enabled) return false;\n    const root = this.#lastRoot;\n    if (!root) return false;\n    return this.#commit((nextData, nextKeys) => {\n      const visit = (node: TreeNode<T>) => {\n        if (node !== root && node.children.length > 0) {\n          if (node.data) nextData.add(node.data);\n          else nextKeys.add(node.key);\n        }\n        for (const child of node.children) visit(child);\n      };\n      visit(root);\n    });\n  }\n\n  /** Collapses every currently-expanded row. */\n  public async collapseAll(): Promise<boolean> {\n    if (!this.enabled) return false;\n    if (this.expanded.size === 0 && this.expandedKeys.size === 0) return true;\n    return this.#commit((nextData, nextKeys) => {\n      nextData.clear();\n      nextKeys.clear();\n    });\n  }\n\n  /**\n   * Pipeline entry point. Called by {@link DataOperationsController.apply}\n   * after sort/filter/quickFilter. Builds the tree, applies the configured\n   * defaults the first time we see this data, and returns rows in\n   * display-order with any synthesized parents inserted.\n   */\n  public process(input: ReadonlyArray<T>): T[] {\n    if (!this.enabled) return input as T[];\n\n    const getDataPath = this.host.tree!.getDataPath;\n    const root = this.#buildTree(input, getDataPath);\n    this.#lastRoot = root;\n\n    // Apply defaultExpanded once per data set, to parents not seen before.\n    const applyDefaults = !this.#defaultsApplied;\n    this.#defaultsApplied = true;\n    // Only a build over the whole data knows which path keys are gone.\n    const reconcile = this.#reconcilePending && input.length >= (this.host.data?.length ?? 0);\n    if (reconcile) this.#reconcilePending = false;\n\n    this.#refreshMeta(root, applyDefaults, reconcile);\n    return this.#flatten(root);\n  }\n\n  /**\n   * Replaces the expansion state wholesale. Used by `ApexGrid.setState` to\n   * restore a snapshot. Sets both the backing-row set and the synthesized-parent\n   * key set directly (no `treeRowExpanding`/`treeRowExpanded` events), marks\n   * `defaultExpanded` as already applied so the next pipeline pass treats the\n   * restored state as authoritative, and re-runs the pipeline.\n   */\n  public restoreExpansion(expanded: Iterable<T>, expandedKeys: Iterable<string>): void {\n    this.expanded = new Set(expanded);\n    this.expandedKeys = new Set(expandedKeys);\n    this.#defaultsApplied = true;\n    this.host.requestUpdate(PIPELINE);\n  }\n\n  /**\n   * Reconciles the expansion state with replaced data. Called from the data\n   * watcher when the input array is replaced wholesale: expanded rows that\n   * left the data are dropped now, stale path keys on the next full build,\n   * and the next pass applies `defaultExpanded` to parents not seen before.\n   */\n  public resetForDataChange(): void {\n    this.#defaultsApplied = false;\n    this.#reconcilePending = true;\n    this.#records = null;\n    this.expanded = retainPresent(this.expanded, this.host.data ?? []);\n  }\n\n  // --- internals ---------------------------------------------------------\n\n  #buildTree(rows: ReadonlyArray<T>, getDataPath: (row: T) => readonly string[]): TreeNode<T> {\n    const root: TreeNode<T> = {\n      data: null,\n      path: [],\n      key: '',\n      depth: -1,\n      parent: null,\n      children: [],\n    };\n    const byKey = new Map<string, TreeNode<T>>();\n    byKey.set('', root);\n    /** Twins made so far per node; twins stay out of `byKey`, so no path resolves to one. */\n    const twins = new Map<TreeNode<T>, number>();\n    /** Levels first reached as an ancestor, which may still lack a record. */\n    const intermediate: TreeNode<T>[] = [];\n\n    for (const row of rows) {\n      const fullPath = getDataPath(row);\n      if (!fullPath || fullPath.length === 0) continue;\n\n      let parent = root;\n      for (let i = 0; i < fullPath.length; i++) {\n        const sub = fullPath.slice(0, i + 1);\n        const key = sub.join(PATH_SEPARATOR);\n        let node = byKey.get(key);\n        if (!node) {\n          node = {\n            data: null,\n            path: sub,\n            key,\n            depth: i,\n            parent,\n            children: [],\n          };\n          byKey.set(key, node);\n          parent.children.push(node);\n          if (i < fullPath.length - 1) intermediate.push(node);\n        }\n        if (i === fullPath.length - 1) {\n          // The terminal segment is the actual record. If we previously\n          // saw a child path that synthesized this level, attach the data\n          // now. A second row with the same path gets a sibling node, so\n          // no row is dropped.\n          if (node.data && node.data !== row) this.#addTwin(node, row, twins, getDataPath);\n          else node.data = row;\n        }\n        parent = node;\n      }\n    }\n\n    this.#adoptFilteredAncestors(rows, intermediate, getDataPath);\n    return root;\n  }\n\n  /**\n   * Adds a sibling of `node` for another row that returns the same path, so\n   * no row is dropped. The earliest of those rows in `host.data` keeps the\n   * path node and its descendants whatever the sort order, so sorting never\n   * moves children between them; the others sit next to it in sort order.\n   */\n  #addTwin(\n    node: TreeNode<T>,\n    row: T,\n    twins: Map<TreeNode<T>, number>,\n    getDataPath: (row: T) => readonly string[]\n  ): void {\n    const n = (twins.get(node) ?? 0) + 1;\n    twins.set(node, n);\n    const twin: TreeNode<T> = {\n      ...node,\n      data: row,\n      key: `${node.key}${PATH_SEPARATOR}${PATH_SEPARATOR}${n}`,\n      children: [],\n    };\n    const siblings = node.parent!.children;\n    siblings.push(twin);\n    if (this.#recordAt(node.key, getDataPath) === row) {\n      // The owner arrived after a later duplicate: it takes the path node,\n      // and the twin takes the slot the duplicate was sorted into.\n      twin.data = node.data;\n      node.data = row;\n      siblings[siblings.indexOf(node)] = twin;\n      siblings[siblings.length - 1] = node;\n    }\n  }\n\n  /**\n   * Gives an ancestor level its own record when a filter removed that record\n   * but kept a descendant. Otherwise the ancestor renders as a blank\n   * placeholder with an expansion state of its own, so the match sits under a\n   * collapsed level the user had opened. Runs only when the input is a\n   * filtered subset of the data and some ancestor level lacks a record; the\n   * lookup costs one pass over the data per data array (and after a cell\n   * edit), then a map hit per level, so filter keystrokes and expand clicks\n   * stay O(visible).\n   */\n  #adoptFilteredAncestors(\n    rows: ReadonlyArray<T>,\n    intermediate: ReadonlyArray<TreeNode<T>>,\n    getDataPath: (row: T) => readonly string[]\n  ): void {\n    if ((this.host.data?.length ?? 0) <= rows.length) return;\n    for (const node of intermediate) {\n      if (!node.data) node.data = this.#recordAt(node.key, getDataPath) ?? null;\n    }\n  }\n\n  /**\n   * The first record in `host.data` whose path joins to `key`. A hit is\n   * checked against the record's current path, since a path can change in\n   * place without a new data array; a stale hit rebuilds the index once.\n   */\n  #recordAt(key: string, getDataPath: (row: T) => readonly string[]): T | undefined {\n    const record = this.#recordsByKey(getDataPath).get(key);\n    if (!record || getDataPath(record)?.join(PATH_SEPARATOR) === key) return record;\n    this.#records = null;\n    return this.#recordsByKey(getDataPath).get(key);\n  }\n\n  /**\n   * The first record per path key in `host.data`. Built on first use and\n   * kept while the data array, its length and `getDataPath` are unchanged\n   * and no cell edit was applied.\n   */\n  #recordsByKey(getDataPath: (row: T) => readonly string[]): Map<string, T> {\n    const data = this.host.data ?? [];\n    const cached = this.#records;\n    if (\n      cached?.data === data &&\n      cached.length === data.length &&\n      cached.getDataPath === getDataPath\n    ) {\n      return cached.byKey;\n    }\n    const byKey = new Map<string, T>();\n    for (const row of data) {\n      const path = getDataPath(row);\n      if (!path?.length) continue;\n      const key = path.join(PATH_SEPARATOR);\n      if (!byKey.has(key)) byKey.set(key, row);\n    }\n    this.#records = { data, length: data.length, getDataPath, byKey };\n    return byKey;\n  }\n\n  /**\n   * Records fresh metadata for every node, both synthesized and backed, since\n   * depth or hasChildren may change between passes (rows reordered, a filter\n   * dropped a descendant). The same walk weighs `defaultExpanded` for parents\n   * seen for the first time and, on a reconciling pass, drops the path keys\n   * and placeholders of synthesized parents that left the data.\n   */\n  #refreshMeta(root: TreeNode<T>, applyDefaults: boolean, reconcile: boolean): void {\n    const setting = applyDefaults ? this.host.tree?.defaultExpanded : undefined;\n    const expandToDepth =\n      setting === true ? Number.POSITIVE_INFINITY : typeof setting === 'number' ? setting : -1;\n    const liveKeys = reconcile ? new Set<string>() : null;\n    const visit = (node: TreeNode<T>) => {\n      if (node !== root) {\n        const meta: TreeRowMeta = {\n          depth: node.depth,\n          hasChildren: node.children.length > 0,\n          key: node.key,\n          label: node.path[node.path.length - 1] ?? '',\n        };\n        if (node.data) {\n          this.#meta.set(node.data, meta);\n          if (meta.hasChildren && !this.#seenParents.has(node.data)) {\n            this.#seenParents.add(node.data);\n            if (node.depth <= expandToDepth) this.expanded.add(node.data);\n          }\n        } else {\n          this.#meta.set(this.#placeholder(node.key), meta);\n          liveKeys?.add(node.key);\n          if (!this.#seenKeys.has(node.key)) {\n            this.#seenKeys.add(node.key);\n            if (node.depth <= expandToDepth) this.expandedKeys.add(node.key);\n          }\n        }\n      }\n      for (const child of node.children) visit(child);\n    };\n    visit(root);\n\n    if (liveKeys) {\n      for (const key of this.expandedKeys) if (!liveKeys.has(key)) this.expandedKeys.delete(key);\n      for (const key of this.#seenKeys) if (!liveKeys.has(key)) this.#seenKeys.delete(key);\n      for (const key of this.#syntheticRows.keys()) {\n        if (!liveKeys.has(key)) this.#syntheticRows.delete(key);\n      }\n    }\n  }\n\n  /**\n   * The placeholder row of a synthesized parent, stable per path so callers\n   * can hold on to it. It carries the SYNTHESIZED marker.\n   */\n  #placeholder(key: string): T {\n    let placeholder = this.#syntheticRows.get(key);\n    if (!placeholder) {\n      placeholder = Object.create(null) as T;\n      Object.defineProperty(placeholder, SYNTHESIZED, { value: true, enumerable: false });\n      this.#syntheticRows.set(key, placeholder);\n    }\n    return placeholder;\n  }\n\n  #flatten(root: TreeNode<T>): T[] {\n    const out: T[] = [];\n    const walk = (node: TreeNode<T>) => {\n      if (node !== root) out.push(node.data ?? this.#placeholder(node.key));\n      const expanded =\n        node === root ||\n        (node.data ? this.expanded.has(node.data) : this.expandedKeys.has(node.key));\n      if (expanded) {\n        for (const child of node.children) walk(child);\n      }\n    };\n    walk(root);\n    return out;\n  }\n\n  /** Rows for an event payload: backed rows, then the placeholders of `keys`. */\n  #rowsOf(rows: Iterable<T>, keys: Iterable<string>): T[] {\n    const out = Array.from(rows);\n    for (const key of keys) {\n      const placeholder = this.#syntheticRows.get(key);\n      if (placeholder) out.push(placeholder);\n    }\n    return out;\n  }\n\n  async #commit(mutate: (nextData: Set<T>, nextKeys: Set<string>) => void): Promise<boolean> {\n    const nextData = new Set(this.expanded);\n    const nextKeys = new Set(this.expandedKeys);\n    mutate(nextData, nextKeys);\n\n    const addedRows = [...nextData].filter((row) => !this.expanded.has(row));\n    const removedRows = [...this.expanded].filter((row) => !nextData.has(row));\n    const addedKeys = [...nextKeys].filter((key) => !this.expandedKeys.has(key));\n    const removedKeys = [...this.expandedKeys].filter((key) => !nextKeys.has(key));\n    if (!addedRows.length && !removedRows.length && !addedKeys.length && !removedKeys.length) {\n      return true;\n    }\n\n    // Synthesized parents appear in the payload as their placeholder rows,\n    // the same objects pageItems holds, so listeners can tell them apart.\n    const added = this.#rowsOf(addedRows, addedKeys);\n    const removed = this.#rowsOf(removedRows, removedKeys);\n\n    const proceed = this.host.emitEvent('treeRowExpanding', {\n      detail: {\n        added,\n        removed,\n        current: this.#rowsOf(this.expanded, this.expandedKeys),\n        next: this.#rowsOf(nextData, nextKeys),\n      },\n      cancelable: true,\n    });\n    if (!proceed) return false;\n\n    this.expanded = nextData;\n    this.expandedKeys = nextKeys;\n    // Re-run the pipeline so the flat output reflects the new expansion set.\n    this.host.requestUpdate(PIPELINE);\n\n    this.host.emitEvent('treeRowExpanded', {\n      detail: { added, removed, expanded: this.#rowsOf(this.expanded, this.expandedKeys) },\n    });\n    return true;\n  }\n}\n"]}