@bastani/atomic 0.8.31-alpha.5 → 0.9.0-alpha.2

package/dist/modes/interactive/components/tree-selector-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selector-list.js","sourceRoot":"","sources":["../../../../src/modes/interactive/components/tree-selector-list.ts"],"names":[],"mappings":"AAAA,OAAO,EAAkB,cAAc,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEvG,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACvF,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAElH,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AAEvE,qEAAqE;AACrE,MAAM,OAAO,QAAQ;IAOpB,YACC,IAAuB,EACvB,aAA4B,EAC5B,eAAuB,EACvB,iBAA0B,EAC1B,iBAA8B;QAE9B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;QACpD,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG;YACZ,SAAS;YACT,aAAa,EAAE,EAAE;YACjB,aAAa,EAAE,CAAC;YAChB,aAAa;YACb,eAAe;YACf,UAAU,EAAE,iBAAiB,IAAI,SAAS;YAC1C,WAAW,EAAE,EAAE;YACf,WAAW;YACX,aAAa,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;YAC9B,mBAAmB,EAAE,KAAK;YAC1B,aAAa,EAAE,IAAI,GAAG,EAAE;YACxB,gBAAgB,EAAE,IAAI,GAAG,EAAE;YAC3B,kBAAkB,EAAE,IAAI,GAAG,EAAE;YAC7B,cAAc,EAAE,IAAI;YACpB,WAAW,EAAE,IAAI,GAAG,EAAE;SACtB,CAAC;QAEF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC1F,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE5B,mEAAmE;QACnE,MAAM,QAAQ,GAAG,iBAAiB,IAAI,aAAa,CAAC;QACpD,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;QAC7G,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC;IACvG,CAAC;IAED,UAAU,KAAU,CAAC;IAErB,cAAc;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;IAC/B,CAAC;IAED,eAAe;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC;IACjE,CAAC;IAED,eAAe,CAAC,OAAe,EAAE,KAAyB,EAAE,cAAuB;QAClF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;YAC7C,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;gBACxC,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAChG,MAAM;YACP,CAAC;QACF,CAAC;IACF,CAAC;IAEO,eAAe;QACtB,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,QAAQ,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YAC/B,KAAK,UAAU;gBACd,MAAM,IAAI,aAAa,CAAC;gBACxB,MAAM;YACP,KAAK,WAAW;gBACf,MAAM,IAAI,SAAS,CAAC;gBACpB,MAAM;YACP,KAAK,cAAc;gBAClB,MAAM,IAAI,YAAY,CAAC;gBACvB,MAAM;YACP,KAAK,KAAK;gBACT,MAAM,IAAI,QAAQ,CAAC;gBACnB,MAAM;QACR,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;YACpC,MAAM,IAAI,gBAAgB,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED,MAAM,CAAC,KAAa;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,oBAAoB,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5E,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,UAAU,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YAC1F,OAAO,KAAK,CAAC;QACd,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAC1B,CAAC,EACD,IAAI,CAAC,GAAG,CACP,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,EAC3D,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC,eAAe,CAClD,CACD,CAAC;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAE1F,MAAM,YAAY,GAA4B,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,MAAM,UAAU,GAAG,CAAC,KAAK,KAAK,CAAC,aAAa,CAAC;YAE7C,8DAA8D;YAC9D,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAE5D,uDAAuD;YACvD,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;YAE/F,uDAAuD;YACvD,2EAA2E;YAC3E,MAAM,SAAS,GACd,QAAQ,CAAC,aAAa,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjG,MAAM,iBAAiB,GAAG,SAAS,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAE7D,8EAA8E;YAC9E,MAAM,UAAU,GAAG,aAAa,GAAG,CAAC,CAAC;YACrC,MAAM,WAAW,GAAa,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;gBAEzB,0CAA0C;gBAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC;gBAClE,IAAI,MAAM,EAAE,CAAC;oBACZ,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;wBACtB,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC3C,CAAC;yBAAM,CAAC;wBACP,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;gBACF,CAAC;qBAAM,IAAI,SAAS,IAAI,KAAK,KAAK,iBAAiB,EAAE,CAAC;oBACrD,+CAA+C;oBAC/C,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;wBACtB,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC/C,CAAC;yBAAM,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;wBAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBAC3C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACzD,CAAC;yBAAM,CAAC;wBACP,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;YACF,CAAC;YACD,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEpC,mDAAmD;YACnD,MAAM,oBAAoB,GAAG,QAAQ,CAAC,aAAa,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC;YACpF,MAAM,UAAU,GAAG,QAAQ,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAErF,yDAAyD;YACzD,MAAM,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzD,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAElE,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1F,MAAM,cAAc,GACnB,KAAK,CAAC,mBAAmB,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,IAAI,CAAC,cAAc;gBAC/E,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,oBAAoB,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC;gBAC7E,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,OAAO,GAAG,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;YAClF,MAAM,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC;YACrE,MAAM,SAAS,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;YAC3C,IAAI,MAAM,GAAG,MAAM,CAAC;YACpB,IAAI,IAAI,GAAG,UAAU,GAAG,KAAK,GAAG,cAAc,GAAG,OAAO,CAAC;YACzD,IAAI,UAAU,EAAE,CAAC;gBAChB,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;gBACxC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;YACrC,CAAC;YACD,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;QAC3F,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,wBAAwB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;QAC7D,KAAK,CAAC,IAAI,CACT,eAAe,CACd,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,CAAC,aAAa,GAAG,CAAC,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC,EAC1G,KAAK,CACL,CACD,CAAC;QAEF,OAAO,KAAK,CAAC;IACd,CAAC;IAED,WAAW,CAAC,OAAe;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,EAAE,GAAG,cAAc,EAAE,CAAC;QAC5B,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,eAAe,CAAC,EAAE,CAAC;YAC1C,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;QAC5G,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC;YACnD,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;QAC5G,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACrD,MAAM,SAAS,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1E,IAAI,SAAS,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClF,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACjC,eAAe,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACP,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;YACzD,CAAC;QACF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,uBAAuB,CAAC,EAAE,CAAC;YACzD,MAAM,SAAS,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1E,IAAI,SAAS,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACnD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACpC,eAAe,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACP,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;YAC3D,CAAC;QACF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,uBAAuB,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACrG,UAAU;YACV,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC;QAChF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,wBAAwB,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,qBAAqB,CAAC,EAAE,CAAC;YACxG,YAAY;YACZ,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC;QAC7G,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,oBAAoB,CAAC,EAAE,CAAC;YACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1D,IAAI,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC/B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACvC,CAAC;QACF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACrD,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvB,KAAK,CAAC,WAAW,GAAG,EAAE,CAAC;gBACvB,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;gBAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACP,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;YACnB,CAAC;QACF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,yBAAyB,CAAC,EAAE,CAAC;YAC3D,yBAAyB;YACzB,KAAK,CAAC,UAAU,GAAG,SAAS,CAAC;YAC7B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,yBAAyB,CAAC,EAAE,CAAC;YAC3D,oCAAoC;YACpC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC;YAC5E,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,0BAA0B,CAAC,EAAE,CAAC;YAC5D,qCAAqC;YACrC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC;YAC9E,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,6BAA6B,CAAC,EAAE,CAAC;YAC/D,wCAAwC;YACxC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,KAAK,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC;YACpF,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,qBAAqB,CAAC,EAAE,CAAC;YACvD,+BAA+B;YAC/B,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;YAClE,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,+BAA+B,CAAC,EAAE,CAAC;YACjE,yBAAyB;YACzB,MAAM,KAAK,GAAiB,CAAC,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,KAAK,CAAC,CAAC;YACxF,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACrD,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3E,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,8BAA8B,CAAC,EAAE,CAAC;YAChE,uFAAuF;YACvF,MAAM,KAAK,GAAiB,CAAC,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,KAAK,CAAC,CAAC;YACxF,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACrD,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YAC5D,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,+BAA+B,CAAC,EAAE,CAAC;YACjE,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClC,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnD,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;gBAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,oBAAoB,CAAC,EAAE,CAAC;YACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1D,IAAI,QAAQ,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAClC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/D,CAAC;QACF,CAAC;aAAM,IAAI,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,+BAA+B,CAAC,EAAE,CAAC;YACjE,KAAK,CAAC,mBAAmB,GAAG,CAAC,KAAK,CAAC,mBAAmB,CAAC;QACxD,CAAC;aAAM,CAAC;YACP,MAAM,eAAe,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE;gBAChD,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC9B,OAAO,IAAI,GAAG,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC;YACrE,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,eAAe,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5C,KAAK,CAAC,WAAW,IAAI,OAAO,CAAC;gBAC7B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;gBAC1B,eAAe,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;OAIG;IACK,UAAU,CAAC,OAAe;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7D,OAAO,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;OAMG;IACK,sBAAsB,CAAC,SAAwB;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACrF,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC;QAEjD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnG,IAAI,SAAS,GAAW,UAAU,CAAC;QACnC,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC1B,OAAO,IAAI,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAa,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;gBAC9E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,cAAc,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;gBACjE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;gBACjE,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACF,CAAC;QAED,qBAAqB;QACrB,OAAO,IAAI,EAAE,CAAC;YACb,MAAM,QAAQ,GAAkB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;YACnF,IAAI,QAAQ,KAAK,IAAI;gBAAE,OAAO,cAAc,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;YAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACnE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;gBACpD,IAAI,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;oBAC7C,OAAO,YAAY,CAAC;gBACrB,CAAC;YACF,CAAC;YACD,SAAS,GAAG,QAAQ,CAAC;QACtB,CAAC;IACF,CAAC;CACD","sourcesContent":["import { type Component, getKeybindings, truncateToWidth, visibleWidth } from \"@earendil-works/pi-tui\";\nimport type { SessionTreeNode } from \"../../../core/session-manager.ts\";\nimport { theme } from \"../theme/theme.ts\";\nimport { formatLabelTimestamp, getEntryDisplayText } from \"./tree-selector-content.ts\";\nimport { applyTreeFilter, buildActivePath, findNearestVisibleIndex, flattenTree } from \"./tree-selector-model.ts\";\nimport type { FilterMode, HorizontalViewportRow, ToolCallInfo, TreeListState } from \"./tree-selector-types.ts\";\nimport { renderHorizontalViewport } from \"./tree-selector-viewport.ts\";\n\n/** Tree list component with selection and ASCII art visualization */\nexport class TreeList implements Component {\n\tprivate readonly state: TreeListState;\n\n\tpublic onSelect?: (entryId: string) => void;\n\tpublic onCancel?: () => void;\n\tpublic onLabelEdit?: (entryId: string, currentLabel: string | undefined) => void;\n\n\tconstructor(\n\t\ttree: SessionTreeNode[],\n\t\tcurrentLeafId: string | null,\n\t\tmaxVisibleLines: number,\n\t\tinitialSelectedId?: string,\n\t\tinitialFilterMode?: FilterMode,\n\t) {\n\t\tconst toolCallMap = new Map<string, ToolCallInfo>();\n\t\tconst flatNodes = flattenTree(tree, currentLeafId, toolCallMap);\n\t\tthis.state = {\n\t\t\tflatNodes,\n\t\t\tfilteredNodes: [],\n\t\t\tselectedIndex: 0,\n\t\t\tcurrentLeafId,\n\t\t\tmaxVisibleLines,\n\t\t\tfilterMode: initialFilterMode ?? \"default\",\n\t\t\tsearchQuery: \"\",\n\t\t\ttoolCallMap,\n\t\t\tmultipleRoots: tree.length > 1,\n\t\t\tshowLabelTimestamps: false,\n\t\t\tactivePathIds: new Set(),\n\t\t\tvisibleParentMap: new Map(),\n\t\t\tvisibleChildrenMap: new Map(),\n\t\t\tlastSelectedId: null,\n\t\t\tfoldedNodes: new Set(),\n\t\t};\n\n\t\tbuildActivePath(this.state.flatNodes, this.state.currentLeafId, this.state.activePathIds);\n\t\tapplyTreeFilter(this.state);\n\n\t\t// Start with initialSelectedId if provided, otherwise current leaf\n\t\tconst targetId = initialSelectedId ?? currentLeafId;\n\t\tthis.state.selectedIndex = findNearestVisibleIndex(this.state.flatNodes, this.state.filteredNodes, targetId);\n\t\tthis.state.lastSelectedId = this.state.filteredNodes[this.state.selectedIndex]?.node.entry.id ?? null;\n\t}\n\n\tinvalidate(): void {}\n\n\tgetSearchQuery(): string {\n\t\treturn this.state.searchQuery;\n\t}\n\n\tgetSelectedNode(): SessionTreeNode | undefined {\n\t\treturn this.state.filteredNodes[this.state.selectedIndex]?.node;\n\t}\n\n\tupdateNodeLabel(entryId: string, label: string | undefined, labelTimestamp?: string): void {\n\t\tfor (const flatNode of this.state.flatNodes) {\n\t\t\tif (flatNode.node.entry.id === entryId) {\n\t\t\t\tflatNode.node.label = label;\n\t\t\t\tflatNode.node.labelTimestamp = label ? (labelTimestamp ?? new Date().toISOString()) : undefined;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate getStatusLabels(): string {\n\t\tlet labels = \"\";\n\t\tswitch (this.state.filterMode) {\n\t\t\tcase \"no-tools\":\n\t\t\t\tlabels += \" [no-tools]\";\n\t\t\t\tbreak;\n\t\t\tcase \"user-only\":\n\t\t\t\tlabels += \" [user]\";\n\t\t\t\tbreak;\n\t\t\tcase \"labeled-only\":\n\t\t\t\tlabels += \" [labeled]\";\n\t\t\t\tbreak;\n\t\t\tcase \"all\":\n\t\t\t\tlabels += \" [all]\";\n\t\t\t\tbreak;\n\t\t}\n\t\tif (this.state.showLabelTimestamps) {\n\t\t\tlabels += \" [+label time]\";\n\t\t}\n\t\treturn labels;\n\t}\n\n\trender(width: number): string[] {\n\t\tconst state = this.state;\n\t\tconst lines: string[] = [];\n\n\t\tif (state.filteredNodes.length === 0) {\n\t\t\tlines.push(truncateToWidth(theme.fg(\"muted\", \"  No entries found\"), width));\n\t\t\tlines.push(truncateToWidth(theme.fg(\"muted\", `  (0/0)${this.getStatusLabels()}`), width));\n\t\t\treturn lines;\n\t\t}\n\n\t\tconst startIndex = Math.max(\n\t\t\t0,\n\t\t\tMath.min(\n\t\t\t\tstate.selectedIndex - Math.floor(state.maxVisibleLines / 2),\n\t\t\t\tstate.filteredNodes.length - state.maxVisibleLines,\n\t\t\t),\n\t\t);\n\t\tconst endIndex = Math.min(startIndex + state.maxVisibleLines, state.filteredNodes.length);\n\n\t\tconst renderedRows: HorizontalViewportRow[] = [];\n\t\tfor (let i = startIndex; i < endIndex; i++) {\n\t\t\tconst flatNode = state.filteredNodes[i];\n\t\t\tconst entry = flatNode.node.entry;\n\t\t\tconst isSelected = i === state.selectedIndex;\n\n\t\t\t// Build line: cursor + prefix + path marker + label + content\n\t\t\tconst cursor = isSelected ? theme.fg(\"accent\", \"› \") : \"  \";\n\n\t\t\t// If multiple roots, shift display (roots at 0, not 1)\n\t\t\tconst displayIndent = state.multipleRoots ? Math.max(0, flatNode.indent - 1) : flatNode.indent;\n\n\t\t\t// Build prefix with gutters at their correct positions\n\t\t\t// Each gutter has a position (displayIndent where its connector was shown)\n\t\t\tconst connector =\n\t\t\t\tflatNode.showConnector && !flatNode.isVirtualRootChild ? (flatNode.isLast ? \"└─ \" : \"├─ \") : \"\";\n\t\t\tconst connectorPosition = connector ? displayIndent - 1 : -1;\n\n\t\t\t// Build prefix char by char, placing gutters and connector at their positions\n\t\t\tconst totalChars = displayIndent * 3;\n\t\t\tconst prefixChars: string[] = [];\n\t\t\tconst isFolded = state.foldedNodes.has(entry.id);\n\t\t\tfor (let i = 0; i < totalChars; i++) {\n\t\t\t\tconst level = Math.floor(i / 3);\n\t\t\t\tconst posInLevel = i % 3;\n\n\t\t\t\t// Check if there's a gutter at this level\n\t\t\t\tconst gutter = flatNode.gutters.find((g) => g.position === level);\n\t\t\t\tif (gutter) {\n\t\t\t\t\tif (posInLevel === 0) {\n\t\t\t\t\t\tprefixChars.push(gutter.show ? \"│\" : \" \");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tprefixChars.push(\" \");\n\t\t\t\t\t}\n\t\t\t\t} else if (connector && level === connectorPosition) {\n\t\t\t\t\t// Connector at this level, with fold indicator\n\t\t\t\t\tif (posInLevel === 0) {\n\t\t\t\t\t\tprefixChars.push(flatNode.isLast ? \"└\" : \"├\");\n\t\t\t\t\t} else if (posInLevel === 1) {\n\t\t\t\t\t\tconst foldable = this.isFoldable(entry.id);\n\t\t\t\t\t\tprefixChars.push(isFolded ? \"⊞\" : foldable ? \"⊟\" : \"─\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tprefixChars.push(\" \");\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tprefixChars.push(\" \");\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst prefix = prefixChars.join(\"\");\n\n\t\t\t// Fold marker for nodes without connectors (roots)\n\t\t\tconst showsFoldInConnector = flatNode.showConnector && !flatNode.isVirtualRootChild;\n\t\t\tconst foldMarker = isFolded && !showsFoldInConnector ? theme.fg(\"accent\", \"⊞ \") : \"\";\n\n\t\t\t// Active path marker - shown right before the entry text\n\t\t\tconst isOnActivePath = state.activePathIds.has(entry.id);\n\t\t\tconst pathMarker = isOnActivePath ? theme.fg(\"accent\", \"• \") : \"\";\n\n\t\t\tconst label = flatNode.node.label ? theme.fg(\"warning\", `[${flatNode.node.label}] `) : \"\";\n\t\t\tconst labelTimestamp =\n\t\t\t\tstate.showLabelTimestamps && flatNode.node.label && flatNode.node.labelTimestamp\n\t\t\t\t\t? theme.fg(\"muted\", `${formatLabelTimestamp(flatNode.node.labelTimestamp)} `)\n\t\t\t\t\t: \"\";\n\t\t\tconst content = getEntryDisplayText(flatNode.node, isSelected, state.toolCallMap);\n\t\t\tconst prefixPart = theme.fg(\"dim\", prefix) + foldMarker + pathMarker;\n\t\t\tconst anchorCol = visibleWidth(prefixPart);\n\t\t\tlet gutter = cursor;\n\t\t\tlet body = prefixPart + label + labelTimestamp + content;\n\t\t\tif (isSelected) {\n\t\t\t\tgutter = theme.bg(\"selectedBg\", gutter);\n\t\t\t\tbody = theme.bg(\"selectedBg\", body);\n\t\t\t}\n\t\t\trenderedRows.push({ gutter, body, anchorCol, bodyWidth: visibleWidth(body), isSelected });\n\t\t}\n\n\t\tlines.push(...renderHorizontalViewport(renderedRows, width));\n\t\tlines.push(\n\t\t\ttruncateToWidth(\n\t\t\t\ttheme.fg(\"muted\", `  (${state.selectedIndex + 1}/${state.filteredNodes.length})${this.getStatusLabels()}`),\n\t\t\t\twidth,\n\t\t\t),\n\t\t);\n\n\t\treturn lines;\n\t}\n\n\thandleInput(keyData: string): void {\n\t\tconst state = this.state;\n\t\tconst kb = getKeybindings();\n\t\tif (kb.matches(keyData, \"tui.select.up\")) {\n\t\t\tstate.selectedIndex = state.selectedIndex === 0 ? state.filteredNodes.length - 1 : state.selectedIndex - 1;\n\t\t} else if (kb.matches(keyData, \"tui.select.down\")) {\n\t\t\tstate.selectedIndex = state.selectedIndex === state.filteredNodes.length - 1 ? 0 : state.selectedIndex + 1;\n\t\t} else if (kb.matches(keyData, \"app.tree.foldOrUp\")) {\n\t\t\tconst currentId = state.filteredNodes[state.selectedIndex]?.node.entry.id;\n\t\t\tif (currentId && this.isFoldable(currentId) && !state.foldedNodes.has(currentId)) {\n\t\t\t\tstate.foldedNodes.add(currentId);\n\t\t\t\tapplyTreeFilter(state);\n\t\t\t} else {\n\t\t\t\tstate.selectedIndex = this.findBranchSegmentStart(\"up\");\n\t\t\t}\n\t\t} else if (kb.matches(keyData, \"app.tree.unfoldOrDown\")) {\n\t\t\tconst currentId = state.filteredNodes[state.selectedIndex]?.node.entry.id;\n\t\t\tif (currentId && state.foldedNodes.has(currentId)) {\n\t\t\t\tstate.foldedNodes.delete(currentId);\n\t\t\t\tapplyTreeFilter(state);\n\t\t\t} else {\n\t\t\t\tstate.selectedIndex = this.findBranchSegmentStart(\"down\");\n\t\t\t}\n\t\t} else if (kb.matches(keyData, \"tui.editor.cursorLeft\") || kb.matches(keyData, \"tui.select.pageUp\")) {\n\t\t\t// Page up\n\t\t\tstate.selectedIndex = Math.max(0, state.selectedIndex - state.maxVisibleLines);\n\t\t} else if (kb.matches(keyData, \"tui.editor.cursorRight\") || kb.matches(keyData, \"tui.select.pageDown\")) {\n\t\t\t// Page down\n\t\t\tstate.selectedIndex = Math.min(state.filteredNodes.length - 1, state.selectedIndex + state.maxVisibleLines);\n\t\t} else if (kb.matches(keyData, \"tui.select.confirm\")) {\n\t\t\tconst selected = state.filteredNodes[state.selectedIndex];\n\t\t\tif (selected && this.onSelect) {\n\t\t\t\tthis.onSelect(selected.node.entry.id);\n\t\t\t}\n\t\t} else if (kb.matches(keyData, \"tui.select.cancel\")) {\n\t\t\tif (state.searchQuery) {\n\t\t\t\tstate.searchQuery = \"\";\n\t\t\t\tstate.foldedNodes.clear();\n\t\t\t\tapplyTreeFilter(state);\n\t\t\t} else {\n\t\t\t\tthis.onCancel?.();\n\t\t\t}\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.default\")) {\n\t\t\t// Direct filter: default\n\t\t\tstate.filterMode = \"default\";\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.noTools\")) {\n\t\t\t// Toggle filter: no-tools ↔ default\n\t\t\tstate.filterMode = state.filterMode === \"no-tools\" ? \"default\" : \"no-tools\";\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.userOnly\")) {\n\t\t\t// Toggle filter: user-only ↔ default\n\t\t\tstate.filterMode = state.filterMode === \"user-only\" ? \"default\" : \"user-only\";\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.labeledOnly\")) {\n\t\t\t// Toggle filter: labeled-only ↔ default\n\t\t\tstate.filterMode = state.filterMode === \"labeled-only\" ? \"default\" : \"labeled-only\";\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.all\")) {\n\t\t\t// Toggle filter: all ↔ default\n\t\t\tstate.filterMode = state.filterMode === \"all\" ? \"default\" : \"all\";\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.cycleBackward\")) {\n\t\t\t// Cycle filter backwards\n\t\t\tconst modes: FilterMode[] = [\"default\", \"no-tools\", \"user-only\", \"labeled-only\", \"all\"];\n\t\t\tconst currentIndex = modes.indexOf(state.filterMode);\n\t\t\tstate.filterMode = modes[(currentIndex - 1 + modes.length) % modes.length];\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"app.tree.filter.cycleForward\")) {\n\t\t\t// Cycle filter forwards: default → no-tools → user-only → labeled-only → all → default\n\t\t\tconst modes: FilterMode[] = [\"default\", \"no-tools\", \"user-only\", \"labeled-only\", \"all\"];\n\t\t\tconst currentIndex = modes.indexOf(state.filterMode);\n\t\t\tstate.filterMode = modes[(currentIndex + 1) % modes.length];\n\t\t\tstate.foldedNodes.clear();\n\t\t\tapplyTreeFilter(state);\n\t\t} else if (kb.matches(keyData, \"tui.editor.deleteCharBackward\")) {\n\t\t\tif (state.searchQuery.length > 0) {\n\t\t\t\tstate.searchQuery = state.searchQuery.slice(0, -1);\n\t\t\t\tstate.foldedNodes.clear();\n\t\t\t\tapplyTreeFilter(state);\n\t\t\t}\n\t\t} else if (kb.matches(keyData, \"app.tree.editLabel\")) {\n\t\t\tconst selected = state.filteredNodes[state.selectedIndex];\n\t\t\tif (selected && this.onLabelEdit) {\n\t\t\t\tthis.onLabelEdit(selected.node.entry.id, selected.node.label);\n\t\t\t}\n\t\t} else if (kb.matches(keyData, \"app.tree.toggleLabelTimestamp\")) {\n\t\t\tstate.showLabelTimestamps = !state.showLabelTimestamps;\n\t\t} else {\n\t\t\tconst hasControlChars = [...keyData].some((ch) => {\n\t\t\t\tconst code = ch.charCodeAt(0);\n\t\t\t\treturn code < 32 || code === 0x7f || (code >= 0x80 && code <= 0x9f);\n\t\t\t});\n\t\t\tif (!hasControlChars && keyData.length > 0) {\n\t\t\t\tstate.searchQuery += keyData;\n\t\t\t\tstate.foldedNodes.clear();\n\t\t\t\tapplyTreeFilter(state);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Whether a node can be folded. A node is foldable if it has visible children\n\t * and is either a root (no visible parent) or a segment start (visible parent\n\t * has multiple visible children).\n\t */\n\tprivate isFoldable(entryId: string): boolean {\n\t\tconst children = this.state.visibleChildrenMap.get(entryId);\n\t\tif (!children || children.length === 0) return false;\n\t\tconst parentId = this.state.visibleParentMap.get(entryId);\n\t\tif (parentId === null || parentId === undefined) return true;\n\t\tconst siblings = this.state.visibleChildrenMap.get(parentId);\n\t\treturn siblings !== undefined && siblings.length > 1;\n\t}\n\n\t/**\n\t * Find the index of the next branch segment start in the given direction.\n\t * A segment start is the first child of a branch point.\n\t *\n\t * \"up\" walks the visible parent chain; \"down\" walks visible children\n\t * (always following the first child).\n\t */\n\tprivate findBranchSegmentStart(direction: \"up\" | \"down\"): number {\n\t\tconst selectedId = this.state.filteredNodes[this.state.selectedIndex]?.node.entry.id;\n\t\tif (!selectedId) return this.state.selectedIndex;\n\n\t\tconst indexByEntryId = new Map(this.state.filteredNodes.map((node, i) => [node.node.entry.id, i]));\n\t\tlet currentId: string = selectedId;\n\t\tif (direction === \"down\") {\n\t\t\twhile (true) {\n\t\t\t\tconst children: string[] = this.state.visibleChildrenMap.get(currentId) ?? [];\n\t\t\t\tif (children.length === 0) return indexByEntryId.get(currentId)!;\n\t\t\t\tif (children.length > 1) return indexByEntryId.get(children[0])!;\n\t\t\t\tcurrentId = children[0];\n\t\t\t}\n\t\t}\n\n\t\t// direction === \"up\"\n\t\twhile (true) {\n\t\t\tconst parentId: string | null = this.state.visibleParentMap.get(currentId) ?? null;\n\t\t\tif (parentId === null) return indexByEntryId.get(currentId)!;\n\t\t\tconst children = this.state.visibleChildrenMap.get(parentId) ?? [];\n\t\t\tif (children.length > 1) {\n\t\t\t\tconst segmentStart = indexByEntryId.get(currentId)!;\n\t\t\t\tif (segmentStart < this.state.selectedIndex) {\n\t\t\t\t\treturn segmentStart;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcurrentId = parentId;\n\t\t}\n\t}\n}\n"]}

package/dist/modes/interactive/components/tree-selector-model.d.ts

@@ -0,0 +1,7 @@
+import type { SessionTreeNode } from "../../../core/session-manager.ts";
+import type { FlatNode, ToolCallInfo, TreeListState } from "./tree-selector-types.ts";
+export declare function flattenTree(roots: SessionTreeNode[], currentLeafId: string | null, toolCallMap: Map<string, ToolCallInfo>): FlatNode[];
+export declare function buildActivePath(flatNodes: FlatNode[], currentLeafId: string | null, activePathIds: Set<string>): void;
+export declare function findNearestVisibleIndex(flatNodes: FlatNode[], filteredNodes: FlatNode[], entryId: string | null): number;
+export declare function applyTreeFilter(state: TreeListState): void;
+//# sourceMappingURL=tree-selector-model.d.ts.map

package/dist/modes/interactive/components/tree-selector-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selector-model.d.ts","sourceRoot":"","sources":["../../../../src/modes/interactive/components/tree-selector-model.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAExE,OAAO,KAAK,EAAE,QAAQ,EAAc,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAElG,wBAAgB,WAAW,CAC1B,KAAK,EAAE,eAAe,EAAE,EACxB,aAAa,EAAE,MAAM,GAAG,IAAI,EAC5B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GACpC,QAAQ,EAAE,CAgIZ;AAED,wBAAgB,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,aAAa,EAAE,MAAM,GAAG,IAAI,EAAE,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAkBrH;AAED,wBAAgB,uBAAuB,CACtC,SAAS,EAAE,QAAQ,EAAE,EACrB,aAAa,EAAE,QAAQ,EAAE,EACzB,OAAO,EAAE,MAAM,GAAG,IAAI,GACpB,MAAM,CAwBR;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI,CAiG1D","sourcesContent":["import type { SessionTreeNode } from \"../../../core/session-manager.ts\";\nimport { getSearchableText, hasTextContent } from \"./tree-selector-content.ts\";\nimport type { FlatNode, GutterInfo, ToolCallInfo, TreeListState } from \"./tree-selector-types.ts\";\n\nexport function flattenTree(\n\troots: SessionTreeNode[],\n\tcurrentLeafId: string | null,\n\ttoolCallMap: Map<string, ToolCallInfo>,\n): FlatNode[] {\n\tconst result: FlatNode[] = [];\n\ttoolCallMap.clear();\n\n\t// Indentation rules:\n\t// - At indent 0: stay at 0 unless parent has >1 children (then +1)\n\t// - At indent 1: children always go to indent 2 (visual grouping of subtree)\n\t// - At indent 2+: stay flat for single-child chains, +1 only if parent branches\n\n\t// Stack items: [node, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild]\n\ttype StackItem = [SessionTreeNode, number, boolean, boolean, boolean, GutterInfo[], boolean];\n\tconst stack: StackItem[] = [];\n\n\t// Determine which subtrees contain the active leaf (to sort current branch first)\n\t// Use iterative post-order traversal to avoid stack overflow\n\tconst containsActive = new Map<SessionTreeNode, boolean>();\n\tconst leafId = currentLeafId;\n\t{\n\t\t// Build list in pre-order, then process in reverse for post-order effect\n\t\tconst allNodes: SessionTreeNode[] = [];\n\t\tconst preOrderStack: SessionTreeNode[] = [...roots];\n\t\twhile (preOrderStack.length > 0) {\n\t\t\tconst node = preOrderStack.pop()!;\n\t\t\tallNodes.push(node);\n\t\t\t// Push children in reverse so they're processed left-to-right\n\t\t\tfor (let i = node.children.length - 1; i >= 0; i--) {\n\t\t\t\tpreOrderStack.push(node.children[i]);\n\t\t\t}\n\t\t}\n\t\t// Process in reverse (post-order): children before parents\n\t\tfor (let i = allNodes.length - 1; i >= 0; i--) {\n\t\t\tconst node = allNodes[i];\n\t\t\tlet has = leafId !== null && node.entry.id === leafId;\n\t\t\tfor (const child of node.children) {\n\t\t\t\tif (containsActive.get(child)) {\n\t\t\t\t\thas = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontainsActive.set(node, has);\n\t\t}\n\t}\n\n\t// Add roots in reverse order, prioritizing the one containing the active leaf\n\t// If multiple roots, treat them as children of a virtual root that branches\n\tconst multipleRoots = roots.length > 1;\n\tconst orderedRoots = [...roots].sort((a, b) => Number(containsActive.get(b)) - Number(containsActive.get(a)));\n\tfor (let i = orderedRoots.length - 1; i >= 0; i--) {\n\t\tconst isLast = i === orderedRoots.length - 1;\n\t\tstack.push([orderedRoots[i], multipleRoots ? 1 : 0, multipleRoots, multipleRoots, isLast, [], multipleRoots]);\n\t}\n\n\twhile (stack.length > 0) {\n\t\tconst [node, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild] = stack.pop()!;\n\n\t\t// Extract tool calls from assistant messages for later lookup\n\t\tconst entry = node.entry;\n\t\tif (entry.type === \"message\" && entry.message.role === \"assistant\") {\n\t\t\tconst content = (entry.message as { content?: unknown }).content;\n\t\t\tif (Array.isArray(content)) {\n\t\t\t\tfor (const block of content) {\n\t\t\t\t\tif (typeof block === \"object\" && block !== null && \"type\" in block && block.type === \"toolCall\") {\n\t\t\t\t\t\tconst tc = block as { id: string; name: string; arguments: Record<string, unknown> };\n\t\t\t\t\t\ttoolCallMap.set(tc.id, { name: tc.name, arguments: tc.arguments });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tresult.push({ node, indent, showConnector, isLast, gutters, isVirtualRootChild });\n\n\t\tconst children = node.children;\n\t\tconst multipleChildren = children.length > 1;\n\n\t\t// Order children so the branch containing the active leaf comes first\n\t\tconst orderedChildren = (() => {\n\t\t\tconst prioritized: SessionTreeNode[] = [];\n\t\t\tconst rest: SessionTreeNode[] = [];\n\t\t\tfor (const child of children) {\n\t\t\t\tif (containsActive.get(child)) {\n\t\t\t\t\tprioritized.push(child);\n\t\t\t\t} else {\n\t\t\t\t\trest.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn [...prioritized, ...rest];\n\t\t})();\n\n\t\t// Calculate child indent\n\t\tlet childIndent: number;\n\t\tif (multipleChildren) {\n\t\t\t// Parent branches: children get +1\n\t\t\tchildIndent = indent + 1;\n\t\t} else if (justBranched && indent > 0) {\n\t\t\t// First generation after a branch: +1 for visual grouping\n\t\t\tchildIndent = indent + 1;\n\t\t} else {\n\t\t\t// Single-child chain: stay flat\n\t\t\tchildIndent = indent;\n\t\t}\n\n\t\t// Build gutters for children\n\t\t// If this node showed a connector, add a gutter entry for descendants\n\t\t// Only add gutter if connector is actually displayed (not suppressed for virtual root children)\n\t\tconst connectorDisplayed = showConnector && !isVirtualRootChild;\n\t\t// When connector is displayed, add a gutter entry at the connector's position\n\t\t// Connector is at position (displayIndent - 1), so gutter should be there too\n\t\tconst currentDisplayIndent = multipleRoots ? Math.max(0, indent - 1) : indent;\n\t\tconst connectorPosition = Math.max(0, currentDisplayIndent - 1);\n\t\tconst childGutters: GutterInfo[] = connectorDisplayed\n\t\t\t? [...gutters, { position: connectorPosition, show: !isLast }]\n\t\t\t: gutters;\n\n\t\t// Add children in reverse order\n\t\tfor (let i = orderedChildren.length - 1; i >= 0; i--) {\n\t\t\tconst childIsLast = i === orderedChildren.length - 1;\n\t\t\tstack.push([\n\t\t\t\torderedChildren[i],\n\t\t\t\tchildIndent,\n\t\t\t\tmultipleChildren,\n\t\t\t\tmultipleChildren,\n\t\t\t\tchildIsLast,\n\t\t\t\tchildGutters,\n\t\t\t\tfalse,\n\t\t\t]);\n\t\t}\n\t}\n\n\treturn result;\n}\n\nexport function buildActivePath(flatNodes: FlatNode[], currentLeafId: string | null, activePathIds: Set<string>): void {\n\tactivePathIds.clear();\n\tif (!currentLeafId) return;\n\n\t// Build a map of id -> entry for parent lookup\n\tconst entryMap = new Map<string, FlatNode>();\n\tfor (const flatNode of flatNodes) {\n\t\tentryMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// Walk from leaf to root\n\tlet currentId: string | null = currentLeafId;\n\twhile (currentId) {\n\t\tactivePathIds.add(currentId);\n\t\tconst node = entryMap.get(currentId);\n\t\tif (!node) break;\n\t\tcurrentId = node.node.entry.parentId ?? null;\n\t}\n}\n\nexport function findNearestVisibleIndex(\n\tflatNodes: FlatNode[],\n\tfilteredNodes: FlatNode[],\n\tentryId: string | null,\n): number {\n\tif (filteredNodes.length === 0) return 0;\n\n\t// Build a map for parent lookup\n\tconst entryMap = new Map<string, FlatNode>();\n\tfor (const flatNode of flatNodes) {\n\t\tentryMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// Build a map of visible entry IDs to their indices in filteredNodes\n\tconst visibleIdToIndex = new Map<string, number>(filteredNodes.map((node, i) => [node.node.entry.id, i]));\n\n\t// Walk from entryId up to root, looking for a visible entry\n\tlet currentId = entryId;\n\twhile (currentId !== null) {\n\t\tconst index = visibleIdToIndex.get(currentId);\n\t\tif (index !== undefined) return index;\n\t\tconst node = entryMap.get(currentId);\n\t\tif (!node) break;\n\t\tcurrentId = node.node.entry.parentId ?? null;\n\t}\n\n\t// Fallback: last visible entry\n\treturn filteredNodes.length - 1;\n}\n\nexport function applyTreeFilter(state: TreeListState): void {\n\t// Update lastSelectedId only when we have a valid selection (non-empty list)\n\t// This preserves the selection when switching through empty filter results\n\tif (state.filteredNodes.length > 0) {\n\t\tstate.lastSelectedId = state.filteredNodes[state.selectedIndex]?.node.entry.id ?? state.lastSelectedId;\n\t}\n\n\tconst searchTokens = state.searchQuery.toLowerCase().split(/\\s+/).filter(Boolean);\n\n\tstate.filteredNodes = state.flatNodes.filter((flatNode) => {\n\t\tconst entry = flatNode.node.entry;\n\t\tconst isCurrentLeaf = entry.id === state.currentLeafId;\n\n\t\t// Skip assistant messages with only tool calls (no text) unless error/aborted\n\t\t// Always show current leaf so active position is visible\n\t\tif (entry.type === \"message\" && entry.message.role === \"assistant\" && !isCurrentLeaf) {\n\t\t\tconst msg = entry.message as { stopReason?: string; content?: unknown };\n\t\t\tconst hasText = hasTextContent(msg.content);\n\t\t\tconst isErrorOrAborted = msg.stopReason && msg.stopReason !== \"stop\" && msg.stopReason !== \"toolUse\";\n\t\t\t// Only hide if no text AND not an error/aborted message\n\t\t\tif (!hasText && !isErrorOrAborted) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t// Apply filter mode\n\t\tlet passesFilter = true;\n\t\t// Entry types hidden in default view (settings/bookkeeping)\n\t\tconst isSettingsEntry =\n\t\t\tentry.type === \"label\" ||\n\t\t\tentry.type === \"custom\" ||\n\t\t\tentry.type === \"model_change\" ||\n\t\t\tentry.type === \"thinking_level_change\" ||\n\t\t\tentry.type === \"context_window_change\" ||\n\t\t\tentry.type === \"session_info\";\n\n\t\tswitch (state.filterMode) {\n\t\t\tcase \"user-only\":\n\t\t\t\t// Just user messages\n\t\t\t\tpassesFilter = entry.type === \"message\" && entry.message.role === \"user\";\n\t\t\t\tbreak;\n\t\t\tcase \"no-tools\":\n\t\t\t\t// Default minus tool results\n\t\t\t\tpassesFilter = !isSettingsEntry && !(entry.type === \"message\" && entry.message.role === \"toolResult\");\n\t\t\t\tbreak;\n\t\t\tcase \"labeled-only\":\n\t\t\t\t// Just labeled entries\n\t\t\t\tpassesFilter = flatNode.node.label !== undefined;\n\t\t\t\tbreak;\n\t\t\tcase \"all\":\n\t\t\t\t// Show everything\n\t\t\t\tpassesFilter = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t// Default mode: hide settings/bookkeeping entries\n\t\t\t\tpassesFilter = !isSettingsEntry;\n\t\t\t\tbreak;\n\t\t}\n\n\t\tif (!passesFilter) return false;\n\n\t\t// Apply search filter\n\t\tif (searchTokens.length > 0) {\n\t\t\tconst nodeText = getSearchableText(flatNode.node).toLowerCase();\n\t\t\treturn searchTokens.every((token) => nodeText.includes(token));\n\t\t}\n\n\t\treturn true;\n\t});\n\n\t// Filter out descendants of folded nodes.\n\tif (state.foldedNodes.size > 0) {\n\t\tconst skipSet = new Set<string>();\n\t\tfor (const flatNode of state.flatNodes) {\n\t\t\tconst { id, parentId } = flatNode.node.entry;\n\t\t\tif (parentId != null && (state.foldedNodes.has(parentId) || skipSet.has(parentId))) {\n\t\t\t\tskipSet.add(id);\n\t\t\t}\n\t\t}\n\t\tstate.filteredNodes = state.filteredNodes.filter((flatNode) => !skipSet.has(flatNode.node.entry.id));\n\t}\n\n\t// Recalculate visual structure (indent, connectors, gutters) based on visible tree\n\trecalculateVisualStructure(state);\n\n\t// Try to preserve cursor on the same node, or find nearest visible ancestor\n\tif (state.lastSelectedId) {\n\t\tstate.selectedIndex = findNearestVisibleIndex(state.flatNodes, state.filteredNodes, state.lastSelectedId);\n\t} else if (state.selectedIndex >= state.filteredNodes.length) {\n\t\t// Clamp index if out of bounds\n\t\tstate.selectedIndex = Math.max(0, state.filteredNodes.length - 1);\n\t}\n\n\t// Update lastSelectedId to the actual selection (may have changed due to parent walk)\n\tif (state.filteredNodes.length > 0) {\n\t\tstate.lastSelectedId = state.filteredNodes[state.selectedIndex]?.node.entry.id ?? state.lastSelectedId;\n\t}\n}\n\n/**\n * Recompute indentation/connectors for the filtered view\n *\n * Filtering can hide intermediate entries; descendants attach to the nearest visible ancestor.\n * Keep indentation semantics aligned with flattenTree() so single-child chains don't drift right.\n */\nfunction recalculateVisualStructure(state: TreeListState): void {\n\tif (state.filteredNodes.length === 0) return;\n\n\tconst visibleIds = new Set(state.filteredNodes.map((n) => n.node.entry.id));\n\n\t// Build entry map for efficient parent lookup (using full tree)\n\tconst entryMap = new Map<string, FlatNode>();\n\tfor (const flatNode of state.flatNodes) {\n\t\tentryMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// Find nearest visible ancestor for a node\n\tconst findVisibleAncestor = (nodeId: string): string | null => {\n\t\tlet currentId = entryMap.get(nodeId)?.node.entry.parentId ?? null;\n\t\twhile (currentId !== null) {\n\t\t\tif (visibleIds.has(currentId)) {\n\t\t\t\treturn currentId;\n\t\t\t}\n\t\t\tcurrentId = entryMap.get(currentId)?.node.entry.parentId ?? null;\n\t\t}\n\t\treturn null;\n\t};\n\n\t// Build visible tree structure:\n\t// - visibleParent: nodeId → nearest visible ancestor (or null for roots)\n\t// - visibleChildren: parentId → list of visible children (in filteredNodes order)\n\tconst visibleParent = new Map<string, string | null>();\n\tconst visibleChildren = new Map<string | null, string[]>();\n\tvisibleChildren.set(null, []); // root-level nodes\n\n\tfor (const flatNode of state.filteredNodes) {\n\t\tconst nodeId = flatNode.node.entry.id;\n\t\tconst ancestorId = findVisibleAncestor(nodeId);\n\t\tvisibleParent.set(nodeId, ancestorId);\n\n\t\tif (!visibleChildren.has(ancestorId)) {\n\t\t\tvisibleChildren.set(ancestorId, []);\n\t\t}\n\t\tvisibleChildren.get(ancestorId)!.push(nodeId);\n\t}\n\n\t// Update multipleRoots based on visible roots\n\tconst visibleRootIds = visibleChildren.get(null)!;\n\tstate.multipleRoots = visibleRootIds.length > 1;\n\n\t// Build a map for quick lookup: nodeId → FlatNode\n\tconst filteredNodeMap = new Map<string, FlatNode>();\n\tfor (const flatNode of state.filteredNodes) {\n\t\tfilteredNodeMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// DFS over the visible tree using flattenTree() indentation semantics\n\t// Stack items: [nodeId, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild]\n\ttype StackItem = [string, number, boolean, boolean, boolean, GutterInfo[], boolean];\n\tconst stack: StackItem[] = [];\n\n\t// Add visible roots in reverse order (to process in forward order via stack)\n\tfor (let i = visibleRootIds.length - 1; i >= 0; i--) {\n\t\tconst isLast = i === visibleRootIds.length - 1;\n\t\tstack.push([\n\t\t\tvisibleRootIds[i],\n\t\t\tstate.multipleRoots ? 1 : 0,\n\t\t\tstate.multipleRoots,\n\t\t\tstate.multipleRoots,\n\t\t\tisLast,\n\t\t\t[],\n\t\t\tstate.multipleRoots,\n\t\t]);\n\t}\n\n\twhile (stack.length > 0) {\n\t\tconst [nodeId, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild] = stack.pop()!;\n\n\t\tconst flatNode = filteredNodeMap.get(nodeId);\n\t\tif (!flatNode) continue;\n\n\t\t// Update this node's visual properties\n\t\tflatNode.indent = indent;\n\t\tflatNode.showConnector = showConnector;\n\t\tflatNode.isLast = isLast;\n\t\tflatNode.gutters = gutters;\n\t\tflatNode.isVirtualRootChild = isVirtualRootChild;\n\n\t\t// Get visible children of this node\n\t\tconst children = visibleChildren.get(nodeId) || [];\n\t\tconst multipleChildren = children.length > 1;\n\n\t\t// Child indent follows flattenTree(): branch points (and first generation after a branch) shift +1\n\t\tlet childIndent: number;\n\t\tif (multipleChildren) {\n\t\t\tchildIndent = indent + 1;\n\t\t} else if (justBranched && indent > 0) {\n\t\t\tchildIndent = indent + 1;\n\t\t} else {\n\t\t\tchildIndent = indent;\n\t\t}\n\n\t\t// Child gutters follow flattenTree() connector/gutter rules\n\t\tconst connectorDisplayed = showConnector && !isVirtualRootChild;\n\t\tconst currentDisplayIndent = state.multipleRoots ? Math.max(0, indent - 1) : indent;\n\t\tconst connectorPosition = Math.max(0, currentDisplayIndent - 1);\n\t\tconst childGutters: GutterInfo[] = connectorDisplayed\n\t\t\t? [...gutters, { position: connectorPosition, show: !isLast }]\n\t\t\t: gutters;\n\n\t\t// Add children in reverse order (to process in forward order via stack)\n\t\tfor (let i = children.length - 1; i >= 0; i--) {\n\t\t\tconst childIsLast = i === children.length - 1;\n\t\t\tstack.push([\n\t\t\t\tchildren[i],\n\t\t\t\tchildIndent,\n\t\t\t\tmultipleChildren,\n\t\t\t\tmultipleChildren,\n\t\t\t\tchildIsLast,\n\t\t\t\tchildGutters,\n\t\t\t\tfalse,\n\t\t\t]);\n\t\t}\n\t}\n\n\t// Store visible tree maps for ancestor/descendant lookups in navigation\n\tstate.visibleParentMap = visibleParent;\n\tstate.visibleChildrenMap = visibleChildren;\n}\n"]}

package/dist/modes/interactive/components/tree-selector-model.js

@@ -0,0 +1,358 @@
+import { getSearchableText, hasTextContent } from "./tree-selector-content.js";
+export function flattenTree(roots, currentLeafId, toolCallMap) {
+    const result = [];
+    toolCallMap.clear();
+    const stack = [];
+    // Determine which subtrees contain the active leaf (to sort current branch first)
+    // Use iterative post-order traversal to avoid stack overflow
+    const containsActive = new Map();
+    const leafId = currentLeafId;
+    {
+        // Build list in pre-order, then process in reverse for post-order effect
+        const allNodes = [];
+        const preOrderStack = [...roots];
+        while (preOrderStack.length > 0) {
+            const node = preOrderStack.pop();
+            allNodes.push(node);
+            // Push children in reverse so they're processed left-to-right
+            for (let i = node.children.length - 1; i >= 0; i--) {
+                preOrderStack.push(node.children[i]);
+            }
+        }
+        // Process in reverse (post-order): children before parents
+        for (let i = allNodes.length - 1; i >= 0; i--) {
+            const node = allNodes[i];
+            let has = leafId !== null && node.entry.id === leafId;
+            for (const child of node.children) {
+                if (containsActive.get(child)) {
+                    has = true;
+                }
+            }
+            containsActive.set(node, has);
+        }
+    }
+    // Add roots in reverse order, prioritizing the one containing the active leaf
+    // If multiple roots, treat them as children of a virtual root that branches
+    const multipleRoots = roots.length > 1;
+    const orderedRoots = [...roots].sort((a, b) => Number(containsActive.get(b)) - Number(containsActive.get(a)));
+    for (let i = orderedRoots.length - 1; i >= 0; i--) {
+        const isLast = i === orderedRoots.length - 1;
+        stack.push([orderedRoots[i], multipleRoots ? 1 : 0, multipleRoots, multipleRoots, isLast, [], multipleRoots]);
+    }
+    while (stack.length > 0) {
+        const [node, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild] = stack.pop();
+        // Extract tool calls from assistant messages for later lookup
+        const entry = node.entry;
+        if (entry.type === "message" && entry.message.role === "assistant") {
+            const content = entry.message.content;
+            if (Array.isArray(content)) {
+                for (const block of content) {
+                    if (typeof block === "object" && block !== null && "type" in block && block.type === "toolCall") {
+                        const tc = block;
+                        toolCallMap.set(tc.id, { name: tc.name, arguments: tc.arguments });
+                    }
+                }
+            }
+        }
+        result.push({ node, indent, showConnector, isLast, gutters, isVirtualRootChild });
+        const children = node.children;
+        const multipleChildren = children.length > 1;
+        // Order children so the branch containing the active leaf comes first
+        const orderedChildren = (() => {
+            const prioritized = [];
+            const rest = [];
+            for (const child of children) {
+                if (containsActive.get(child)) {
+                    prioritized.push(child);
+                }
+                else {
+                    rest.push(child);
+                }
+            }
+            return [...prioritized, ...rest];
+        })();
+        // Calculate child indent
+        let childIndent;
+        if (multipleChildren) {
+            // Parent branches: children get +1
+            childIndent = indent + 1;
+        }
+        else if (justBranched && indent > 0) {
+            // First generation after a branch: +1 for visual grouping
+            childIndent = indent + 1;
+        }
+        else {
+            // Single-child chain: stay flat
+            childIndent = indent;
+        }
+        // Build gutters for children
+        // If this node showed a connector, add a gutter entry for descendants
+        // Only add gutter if connector is actually displayed (not suppressed for virtual root children)
+        const connectorDisplayed = showConnector && !isVirtualRootChild;
+        // When connector is displayed, add a gutter entry at the connector's position
+        // Connector is at position (displayIndent - 1), so gutter should be there too
+        const currentDisplayIndent = multipleRoots ? Math.max(0, indent - 1) : indent;
+        const connectorPosition = Math.max(0, currentDisplayIndent - 1);
+        const childGutters = connectorDisplayed
+            ? [...gutters, { position: connectorPosition, show: !isLast }]
+            : gutters;
+        // Add children in reverse order
+        for (let i = orderedChildren.length - 1; i >= 0; i--) {
+            const childIsLast = i === orderedChildren.length - 1;
+            stack.push([
+                orderedChildren[i],
+                childIndent,
+                multipleChildren,
+                multipleChildren,
+                childIsLast,
+                childGutters,
+                false,
+            ]);
+        }
+    }
+    return result;
+}
+export function buildActivePath(flatNodes, currentLeafId, activePathIds) {
+    activePathIds.clear();
+    if (!currentLeafId)
+        return;
+    // Build a map of id -> entry for parent lookup
+    const entryMap = new Map();
+    for (const flatNode of flatNodes) {
+        entryMap.set(flatNode.node.entry.id, flatNode);
+    }
+    // Walk from leaf to root
+    let currentId = currentLeafId;
+    while (currentId) {
+        activePathIds.add(currentId);
+        const node = entryMap.get(currentId);
+        if (!node)
+            break;
+        currentId = node.node.entry.parentId ?? null;
+    }
+}
+export function findNearestVisibleIndex(flatNodes, filteredNodes, entryId) {
+    if (filteredNodes.length === 0)
+        return 0;
+    // Build a map for parent lookup
+    const entryMap = new Map();
+    for (const flatNode of flatNodes) {
+        entryMap.set(flatNode.node.entry.id, flatNode);
+    }
+    // Build a map of visible entry IDs to their indices in filteredNodes
+    const visibleIdToIndex = new Map(filteredNodes.map((node, i) => [node.node.entry.id, i]));
+    // Walk from entryId up to root, looking for a visible entry
+    let currentId = entryId;
+    while (currentId !== null) {
+        const index = visibleIdToIndex.get(currentId);
+        if (index !== undefined)
+            return index;
+        const node = entryMap.get(currentId);
+        if (!node)
+            break;
+        currentId = node.node.entry.parentId ?? null;
+    }
+    // Fallback: last visible entry
+    return filteredNodes.length - 1;
+}
+export function applyTreeFilter(state) {
+    // Update lastSelectedId only when we have a valid selection (non-empty list)
+    // This preserves the selection when switching through empty filter results
+    if (state.filteredNodes.length > 0) {
+        state.lastSelectedId = state.filteredNodes[state.selectedIndex]?.node.entry.id ?? state.lastSelectedId;
+    }
+    const searchTokens = state.searchQuery.toLowerCase().split(/\s+/).filter(Boolean);
+    state.filteredNodes = state.flatNodes.filter((flatNode) => {
+        const entry = flatNode.node.entry;
+        const isCurrentLeaf = entry.id === state.currentLeafId;
+        // Skip assistant messages with only tool calls (no text) unless error/aborted
+        // Always show current leaf so active position is visible
+        if (entry.type === "message" && entry.message.role === "assistant" && !isCurrentLeaf) {
+            const msg = entry.message;
+            const hasText = hasTextContent(msg.content);
+            const isErrorOrAborted = msg.stopReason && msg.stopReason !== "stop" && msg.stopReason !== "toolUse";
+            // Only hide if no text AND not an error/aborted message
+            if (!hasText && !isErrorOrAborted) {
+                return false;
+            }
+        }
+        // Apply filter mode
+        let passesFilter = true;
+        // Entry types hidden in default view (settings/bookkeeping)
+        const isSettingsEntry = entry.type === "label" ||
+            entry.type === "custom" ||
+            entry.type === "model_change" ||
+            entry.type === "thinking_level_change" ||
+            entry.type === "context_window_change" ||
+            entry.type === "session_info";
+        switch (state.filterMode) {
+            case "user-only":
+                // Just user messages
+                passesFilter = entry.type === "message" && entry.message.role === "user";
+                break;
+            case "no-tools":
+                // Default minus tool results
+                passesFilter = !isSettingsEntry && !(entry.type === "message" && entry.message.role === "toolResult");
+                break;
+            case "labeled-only":
+                // Just labeled entries
+                passesFilter = flatNode.node.label !== undefined;
+                break;
+            case "all":
+                // Show everything
+                passesFilter = true;
+                break;
+            default:
+                // Default mode: hide settings/bookkeeping entries
+                passesFilter = !isSettingsEntry;
+                break;
+        }
+        if (!passesFilter)
+            return false;
+        // Apply search filter
+        if (searchTokens.length > 0) {
+            const nodeText = getSearchableText(flatNode.node).toLowerCase();
+            return searchTokens.every((token) => nodeText.includes(token));
+        }
+        return true;
+    });
+    // Filter out descendants of folded nodes.
+    if (state.foldedNodes.size > 0) {
+        const skipSet = new Set();
+        for (const flatNode of state.flatNodes) {
+            const { id, parentId } = flatNode.node.entry;
+            if (parentId != null && (state.foldedNodes.has(parentId) || skipSet.has(parentId))) {
+                skipSet.add(id);
+            }
+        }
+        state.filteredNodes = state.filteredNodes.filter((flatNode) => !skipSet.has(flatNode.node.entry.id));
+    }
+    // Recalculate visual structure (indent, connectors, gutters) based on visible tree
+    recalculateVisualStructure(state);
+    // Try to preserve cursor on the same node, or find nearest visible ancestor
+    if (state.lastSelectedId) {
+        state.selectedIndex = findNearestVisibleIndex(state.flatNodes, state.filteredNodes, state.lastSelectedId);
+    }
+    else if (state.selectedIndex >= state.filteredNodes.length) {
+        // Clamp index if out of bounds
+        state.selectedIndex = Math.max(0, state.filteredNodes.length - 1);
+    }
+    // Update lastSelectedId to the actual selection (may have changed due to parent walk)
+    if (state.filteredNodes.length > 0) {
+        state.lastSelectedId = state.filteredNodes[state.selectedIndex]?.node.entry.id ?? state.lastSelectedId;
+    }
+}
+/**
+ * Recompute indentation/connectors for the filtered view
+ *
+ * Filtering can hide intermediate entries; descendants attach to the nearest visible ancestor.
+ * Keep indentation semantics aligned with flattenTree() so single-child chains don't drift right.
+ */
+function recalculateVisualStructure(state) {
+    if (state.filteredNodes.length === 0)
+        return;
+    const visibleIds = new Set(state.filteredNodes.map((n) => n.node.entry.id));
+    // Build entry map for efficient parent lookup (using full tree)
+    const entryMap = new Map();
+    for (const flatNode of state.flatNodes) {
+        entryMap.set(flatNode.node.entry.id, flatNode);
+    }
+    // Find nearest visible ancestor for a node
+    const findVisibleAncestor = (nodeId) => {
+        let currentId = entryMap.get(nodeId)?.node.entry.parentId ?? null;
+        while (currentId !== null) {
+            if (visibleIds.has(currentId)) {
+                return currentId;
+            }
+            currentId = entryMap.get(currentId)?.node.entry.parentId ?? null;
+        }
+        return null;
+    };
+    // Build visible tree structure:
+    // - visibleParent: nodeId → nearest visible ancestor (or null for roots)
+    // - visibleChildren: parentId → list of visible children (in filteredNodes order)
+    const visibleParent = new Map();
+    const visibleChildren = new Map();
+    visibleChildren.set(null, []); // root-level nodes
+    for (const flatNode of state.filteredNodes) {
+        const nodeId = flatNode.node.entry.id;
+        const ancestorId = findVisibleAncestor(nodeId);
+        visibleParent.set(nodeId, ancestorId);
+        if (!visibleChildren.has(ancestorId)) {
+            visibleChildren.set(ancestorId, []);
+        }
+        visibleChildren.get(ancestorId).push(nodeId);
+    }
+    // Update multipleRoots based on visible roots
+    const visibleRootIds = visibleChildren.get(null);
+    state.multipleRoots = visibleRootIds.length > 1;
+    // Build a map for quick lookup: nodeId → FlatNode
+    const filteredNodeMap = new Map();
+    for (const flatNode of state.filteredNodes) {
+        filteredNodeMap.set(flatNode.node.entry.id, flatNode);
+    }
+    const stack = [];
+    // Add visible roots in reverse order (to process in forward order via stack)
+    for (let i = visibleRootIds.length - 1; i >= 0; i--) {
+        const isLast = i === visibleRootIds.length - 1;
+        stack.push([
+            visibleRootIds[i],
+            state.multipleRoots ? 1 : 0,
+            state.multipleRoots,
+            state.multipleRoots,
+            isLast,
+            [],
+            state.multipleRoots,
+        ]);
+    }
+    while (stack.length > 0) {
+        const [nodeId, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild] = stack.pop();
+        const flatNode = filteredNodeMap.get(nodeId);
+        if (!flatNode)
+            continue;
+        // Update this node's visual properties
+        flatNode.indent = indent;
+        flatNode.showConnector = showConnector;
+        flatNode.isLast = isLast;
+        flatNode.gutters = gutters;
+        flatNode.isVirtualRootChild = isVirtualRootChild;
+        // Get visible children of this node
+        const children = visibleChildren.get(nodeId) || [];
+        const multipleChildren = children.length > 1;
+        // Child indent follows flattenTree(): branch points (and first generation after a branch) shift +1
+        let childIndent;
+        if (multipleChildren) {
+            childIndent = indent + 1;
+        }
+        else if (justBranched && indent > 0) {
+            childIndent = indent + 1;
+        }
+        else {
+            childIndent = indent;
+        }
+        // Child gutters follow flattenTree() connector/gutter rules
+        const connectorDisplayed = showConnector && !isVirtualRootChild;
+        const currentDisplayIndent = state.multipleRoots ? Math.max(0, indent - 1) : indent;
+        const connectorPosition = Math.max(0, currentDisplayIndent - 1);
+        const childGutters = connectorDisplayed
+            ? [...gutters, { position: connectorPosition, show: !isLast }]
+            : gutters;
+        // Add children in reverse order (to process in forward order via stack)
+        for (let i = children.length - 1; i >= 0; i--) {
+            const childIsLast = i === children.length - 1;
+            stack.push([
+                children[i],
+                childIndent,
+                multipleChildren,
+                multipleChildren,
+                childIsLast,
+                childGutters,
+                false,
+            ]);
+        }
+    }
+    // Store visible tree maps for ancestor/descendant lookups in navigation
+    state.visibleParentMap = visibleParent;
+    state.visibleChildrenMap = visibleChildren;
+}
+//# sourceMappingURL=tree-selector-model.js.map

package/dist/modes/interactive/components/tree-selector-model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selector-model.js","sourceRoot":"","sources":["../../../../src/modes/interactive/components/tree-selector-model.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAG/E,MAAM,UAAU,WAAW,CAC1B,KAAwB,EACxB,aAA4B,EAC5B,WAAsC;IAEtC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,WAAW,CAAC,KAAK,EAAE,CAAC;IASpB,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,kFAAkF;IAClF,6DAA6D;IAC7D,MAAM,cAAc,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC3D,MAAM,MAAM,GAAG,aAAa,CAAC;IAC7B,CAAC;QACA,yEAAyE;QACzE,MAAM,QAAQ,GAAsB,EAAE,CAAC;QACvC,MAAM,aAAa,GAAsB,CAAC,GAAG,KAAK,CAAC,CAAC;QACpD,OAAO,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,EAAG,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,8DAA8D;YAC9D,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACF,CAAC;QACD,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,GAAG,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC;YACtD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACnC,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,GAAG,GAAG,IAAI,CAAC;gBACZ,CAAC;YACF,CAAC;YACD,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;IACF,CAAC;IAED,8EAA8E;IAC9E,4EAA4E;IAC5E,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvC,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9G,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,CAAC,KAAK,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC;IAC/G,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAEtG,8DAA8D;QAC9D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YACpE,MAAM,OAAO,GAAI,KAAK,CAAC,OAAiC,CAAC,OAAO,CAAC;YACjE,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;oBAC7B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;wBACjG,MAAM,EAAE,GAAG,KAAyE,CAAC;wBACrF,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC;oBACpE,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAElF,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,MAAM,gBAAgB,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAE7C,sEAAsE;QACtE,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE;YAC7B,MAAM,WAAW,GAAsB,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAsB,EAAE,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC9B,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACP,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,CAAC;YACF,CAAC;YACD,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,IAAI,CAAC,CAAC;QAClC,CAAC,CAAC,EAAE,CAAC;QAEL,yBAAyB;QACzB,IAAI,WAAmB,CAAC;QACxB,IAAI,gBAAgB,EAAE,CAAC;YACtB,mCAAmC;YACnC,WAAW,GAAG,MAAM,GAAG,CAAC,CAAC;QAC1B,CAAC;aAAM,IAAI,YAAY,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,0DAA0D;YAC1D,WAAW,GAAG,MAAM,GAAG,CAAC,CAAC;QAC1B,CAAC;aAAM,CAAC;YACP,gCAAgC;YAChC,WAAW,GAAG,MAAM,CAAC;QACtB,CAAC;QAED,6BAA6B;QAC7B,sEAAsE;QACtE,gGAAgG;QAChG,MAAM,kBAAkB,GAAG,aAAa,IAAI,CAAC,kBAAkB,CAAC;QAChE,8EAA8E;QAC9E,8EAA8E;QAC9E,MAAM,oBAAoB,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9E,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,oBAAoB,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,YAAY,GAAiB,kBAAkB;YACpD,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,EAAE,QAAQ,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YAC9D,CAAC,CAAC,OAAO,CAAC;QAEX,gCAAgC;QAChC,KAAK,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,MAAM,WAAW,GAAG,CAAC,KAAK,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;YACrD,KAAK,CAAC,IAAI,CAAC;gBACV,eAAe,CAAC,CAAC,CAAC;gBAClB,WAAW;gBACX,gBAAgB;gBAChB,gBAAgB;gBAChB,WAAW;gBACX,YAAY;gBACZ,KAAK;aACL,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,SAAqB,EAAE,aAA4B,EAAE,aAA0B;IAC9G,aAAa,CAAC,KAAK,EAAE,CAAC;IACtB,IAAI,CAAC,aAAa;QAAE,OAAO;IAE3B,+CAA+C;IAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAClC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED,yBAAyB;IACzB,IAAI,SAAS,GAAkB,aAAa,CAAC;IAC7C,OAAO,SAAS,EAAE,CAAC;QAClB,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC;IAC9C,CAAC;AACF,CAAC;AAED,MAAM,UAAU,uBAAuB,CACtC,SAAqB,EACrB,aAAyB,EACzB,OAAsB;IAEtB,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzC,gCAAgC;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAClC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED,qEAAqE;IACrE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAiB,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1G,4DAA4D;IAC5D,IAAI,SAAS,GAAG,OAAO,CAAC;IACxB,OAAO,SAAS,KAAK,IAAI,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC;IAC9C,CAAC;IAED,+BAA+B;IAC/B,OAAO,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAoB;IACnD,6EAA6E;IAC7E,2EAA2E;IAC3E,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,cAAc,CAAC;IACxG,CAAC;IAED,MAAM,YAAY,GAAG,KAAK,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAElF,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;QACzD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;QAClC,MAAM,aAAa,GAAG,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,aAAa,CAAC;QAEvD,8EAA8E;QAC9E,yDAAyD;QACzD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,aAAa,EAAE,CAAC;YACtF,MAAM,GAAG,GAAG,KAAK,CAAC,OAAqD,CAAC;YACxE,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,gBAAgB,GAAG,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC;YACrG,wDAAwD;YACxD,IAAI,CAAC,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACnC,OAAO,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QAED,oBAAoB;QACpB,IAAI,YAAY,GAAG,IAAI,CAAC;QACxB,4DAA4D;QAC5D,MAAM,eAAe,GACpB,KAAK,CAAC,IAAI,KAAK,OAAO;YACtB,KAAK,CAAC,IAAI,KAAK,QAAQ;YACvB,KAAK,CAAC,IAAI,KAAK,cAAc;YAC7B,KAAK,CAAC,IAAI,KAAK,uBAAuB;YACtC,KAAK,CAAC,IAAI,KAAK,uBAAuB;YACtC,KAAK,CAAC,IAAI,KAAK,cAAc,CAAC;QAE/B,QAAQ,KAAK,CAAC,UAAU,EAAE,CAAC;YAC1B,KAAK,WAAW;gBACf,qBAAqB;gBACrB,YAAY,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC;gBACzE,MAAM;YACP,KAAK,UAAU;gBACd,6BAA6B;gBAC7B,YAAY,GAAG,CAAC,eAAe,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;gBACtG,MAAM;YACP,KAAK,cAAc;gBAClB,uBAAuB;gBACvB,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;gBACjD,MAAM;YACP,KAAK,KAAK;gBACT,kBAAkB;gBAClB,YAAY,GAAG,IAAI,CAAC;gBACpB,MAAM;YACP;gBACC,kDAAkD;gBAClD,YAAY,GAAG,CAAC,eAAe,CAAC;gBAChC,MAAM;QACR,CAAC;QAED,IAAI,CAAC,YAAY;YAAE,OAAO,KAAK,CAAC;QAEhC,sBAAsB;QACtB,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAChE,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,OAAO,IAAI,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,0CAA0C;IAC1C,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;YAC7C,IAAI,QAAQ,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBACpF,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;QACF,CAAC;QACD,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtG,CAAC;IAED,mFAAmF;IACnF,0BAA0B,CAAC,KAAK,CAAC,CAAC;IAElC,4EAA4E;IAC5E,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QAC1B,KAAK,CAAC,aAAa,GAAG,uBAAuB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;IAC3G,CAAC;SAAM,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;QAC9D,+BAA+B;QAC/B,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,sFAAsF;IACtF,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,cAAc,CAAC;IACxG,CAAC;AACF,CAAC;AAED;;;;;GAKG;AACH,SAAS,0BAA0B,CAAC,KAAoB;IACvD,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAE7C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAE5E,gEAAgE;IAChE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACxC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED,2CAA2C;IAC3C,MAAM,mBAAmB,GAAG,CAAC,MAAc,EAAiB,EAAE;QAC7D,IAAI,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC;QAClE,OAAO,SAAS,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC/B,OAAO,SAAS,CAAC;YAClB,CAAC;YACD,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC;QAClE,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;IAEF,gCAAgC;IAChC,yEAAyE;IACzE,kFAAkF;IAClF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAyB,CAAC;IACvD,MAAM,eAAe,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC3D,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB;IAElD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAC/C,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAEtC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACtC,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED,8CAA8C;IAC9C,MAAM,cAAc,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;IAClD,KAAK,CAAC,aAAa,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IAEhD,kDAAkD;IAClD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QAC5C,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IAKD,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,6EAA6E;IAC7E,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,MAAM,MAAM,GAAG,CAAC,KAAK,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC;YACV,cAAc,CAAC,CAAC,CAAC;YACjB,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,aAAa;YACnB,KAAK,CAAC,aAAa;YACnB,MAAM;YACN,EAAE;YACF,KAAK,CAAC,aAAa;SACnB,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAExG,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,uCAAuC;QACvC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC;QACzB,QAAQ,CAAC,aAAa,GAAG,aAAa,CAAC;QACvC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC;QACzB,QAAQ,CAAC,OAAO,GAAG,OAAO,CAAC;QAC3B,QAAQ,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QAEjD,oCAAoC;QACpC,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnD,MAAM,gBAAgB,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAE7C,mGAAmG;QACnG,IAAI,WAAmB,CAAC;QACxB,IAAI,gBAAgB,EAAE,CAAC;YACtB,WAAW,GAAG,MAAM,GAAG,CAAC,CAAC;QAC1B,CAAC;aAAM,IAAI,YAAY,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,WAAW,GAAG,MAAM,GAAG,CAAC,CAAC;QAC1B,CAAC;aAAM,CAAC;YACP,WAAW,GAAG,MAAM,CAAC;QACtB,CAAC;QAED,4DAA4D;QAC5D,MAAM,kBAAkB,GAAG,aAAa,IAAI,CAAC,kBAAkB,CAAC;QAChE,MAAM,oBAAoB,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACpF,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,oBAAoB,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,YAAY,GAAiB,kBAAkB;YACpD,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,EAAE,QAAQ,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YAC9D,CAAC,CAAC,OAAO,CAAC;QAEX,wEAAwE;QACxE,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,WAAW,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC;gBACV,QAAQ,CAAC,CAAC,CAAC;gBACX,WAAW;gBACX,gBAAgB;gBAChB,gBAAgB;gBAChB,WAAW;gBACX,YAAY;gBACZ,KAAK;aACL,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAED,wEAAwE;IACxE,KAAK,CAAC,gBAAgB,GAAG,aAAa,CAAC;IACvC,KAAK,CAAC,kBAAkB,GAAG,eAAe,CAAC;AAC5C,CAAC","sourcesContent":["import type { SessionTreeNode } from \"../../../core/session-manager.ts\";\nimport { getSearchableText, hasTextContent } from \"./tree-selector-content.ts\";\nimport type { FlatNode, GutterInfo, ToolCallInfo, TreeListState } from \"./tree-selector-types.ts\";\n\nexport function flattenTree(\n\troots: SessionTreeNode[],\n\tcurrentLeafId: string | null,\n\ttoolCallMap: Map<string, ToolCallInfo>,\n): FlatNode[] {\n\tconst result: FlatNode[] = [];\n\ttoolCallMap.clear();\n\n\t// Indentation rules:\n\t// - At indent 0: stay at 0 unless parent has >1 children (then +1)\n\t// - At indent 1: children always go to indent 2 (visual grouping of subtree)\n\t// - At indent 2+: stay flat for single-child chains, +1 only if parent branches\n\n\t// Stack items: [node, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild]\n\ttype StackItem = [SessionTreeNode, number, boolean, boolean, boolean, GutterInfo[], boolean];\n\tconst stack: StackItem[] = [];\n\n\t// Determine which subtrees contain the active leaf (to sort current branch first)\n\t// Use iterative post-order traversal to avoid stack overflow\n\tconst containsActive = new Map<SessionTreeNode, boolean>();\n\tconst leafId = currentLeafId;\n\t{\n\t\t// Build list in pre-order, then process in reverse for post-order effect\n\t\tconst allNodes: SessionTreeNode[] = [];\n\t\tconst preOrderStack: SessionTreeNode[] = [...roots];\n\t\twhile (preOrderStack.length > 0) {\n\t\t\tconst node = preOrderStack.pop()!;\n\t\t\tallNodes.push(node);\n\t\t\t// Push children in reverse so they're processed left-to-right\n\t\t\tfor (let i = node.children.length - 1; i >= 0; i--) {\n\t\t\t\tpreOrderStack.push(node.children[i]);\n\t\t\t}\n\t\t}\n\t\t// Process in reverse (post-order): children before parents\n\t\tfor (let i = allNodes.length - 1; i >= 0; i--) {\n\t\t\tconst node = allNodes[i];\n\t\t\tlet has = leafId !== null && node.entry.id === leafId;\n\t\t\tfor (const child of node.children) {\n\t\t\t\tif (containsActive.get(child)) {\n\t\t\t\t\thas = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontainsActive.set(node, has);\n\t\t}\n\t}\n\n\t// Add roots in reverse order, prioritizing the one containing the active leaf\n\t// If multiple roots, treat them as children of a virtual root that branches\n\tconst multipleRoots = roots.length > 1;\n\tconst orderedRoots = [...roots].sort((a, b) => Number(containsActive.get(b)) - Number(containsActive.get(a)));\n\tfor (let i = orderedRoots.length - 1; i >= 0; i--) {\n\t\tconst isLast = i === orderedRoots.length - 1;\n\t\tstack.push([orderedRoots[i], multipleRoots ? 1 : 0, multipleRoots, multipleRoots, isLast, [], multipleRoots]);\n\t}\n\n\twhile (stack.length > 0) {\n\t\tconst [node, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild] = stack.pop()!;\n\n\t\t// Extract tool calls from assistant messages for later lookup\n\t\tconst entry = node.entry;\n\t\tif (entry.type === \"message\" && entry.message.role === \"assistant\") {\n\t\t\tconst content = (entry.message as { content?: unknown }).content;\n\t\t\tif (Array.isArray(content)) {\n\t\t\t\tfor (const block of content) {\n\t\t\t\t\tif (typeof block === \"object\" && block !== null && \"type\" in block && block.type === \"toolCall\") {\n\t\t\t\t\t\tconst tc = block as { id: string; name: string; arguments: Record<string, unknown> };\n\t\t\t\t\t\ttoolCallMap.set(tc.id, { name: tc.name, arguments: tc.arguments });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tresult.push({ node, indent, showConnector, isLast, gutters, isVirtualRootChild });\n\n\t\tconst children = node.children;\n\t\tconst multipleChildren = children.length > 1;\n\n\t\t// Order children so the branch containing the active leaf comes first\n\t\tconst orderedChildren = (() => {\n\t\t\tconst prioritized: SessionTreeNode[] = [];\n\t\t\tconst rest: SessionTreeNode[] = [];\n\t\t\tfor (const child of children) {\n\t\t\t\tif (containsActive.get(child)) {\n\t\t\t\t\tprioritized.push(child);\n\t\t\t\t} else {\n\t\t\t\t\trest.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn [...prioritized, ...rest];\n\t\t})();\n\n\t\t// Calculate child indent\n\t\tlet childIndent: number;\n\t\tif (multipleChildren) {\n\t\t\t// Parent branches: children get +1\n\t\t\tchildIndent = indent + 1;\n\t\t} else if (justBranched && indent > 0) {\n\t\t\t// First generation after a branch: +1 for visual grouping\n\t\t\tchildIndent = indent + 1;\n\t\t} else {\n\t\t\t// Single-child chain: stay flat\n\t\t\tchildIndent = indent;\n\t\t}\n\n\t\t// Build gutters for children\n\t\t// If this node showed a connector, add a gutter entry for descendants\n\t\t// Only add gutter if connector is actually displayed (not suppressed for virtual root children)\n\t\tconst connectorDisplayed = showConnector && !isVirtualRootChild;\n\t\t// When connector is displayed, add a gutter entry at the connector's position\n\t\t// Connector is at position (displayIndent - 1), so gutter should be there too\n\t\tconst currentDisplayIndent = multipleRoots ? Math.max(0, indent - 1) : indent;\n\t\tconst connectorPosition = Math.max(0, currentDisplayIndent - 1);\n\t\tconst childGutters: GutterInfo[] = connectorDisplayed\n\t\t\t? [...gutters, { position: connectorPosition, show: !isLast }]\n\t\t\t: gutters;\n\n\t\t// Add children in reverse order\n\t\tfor (let i = orderedChildren.length - 1; i >= 0; i--) {\n\t\t\tconst childIsLast = i === orderedChildren.length - 1;\n\t\t\tstack.push([\n\t\t\t\torderedChildren[i],\n\t\t\t\tchildIndent,\n\t\t\t\tmultipleChildren,\n\t\t\t\tmultipleChildren,\n\t\t\t\tchildIsLast,\n\t\t\t\tchildGutters,\n\t\t\t\tfalse,\n\t\t\t]);\n\t\t}\n\t}\n\n\treturn result;\n}\n\nexport function buildActivePath(flatNodes: FlatNode[], currentLeafId: string | null, activePathIds: Set<string>): void {\n\tactivePathIds.clear();\n\tif (!currentLeafId) return;\n\n\t// Build a map of id -> entry for parent lookup\n\tconst entryMap = new Map<string, FlatNode>();\n\tfor (const flatNode of flatNodes) {\n\t\tentryMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// Walk from leaf to root\n\tlet currentId: string | null = currentLeafId;\n\twhile (currentId) {\n\t\tactivePathIds.add(currentId);\n\t\tconst node = entryMap.get(currentId);\n\t\tif (!node) break;\n\t\tcurrentId = node.node.entry.parentId ?? null;\n\t}\n}\n\nexport function findNearestVisibleIndex(\n\tflatNodes: FlatNode[],\n\tfilteredNodes: FlatNode[],\n\tentryId: string | null,\n): number {\n\tif (filteredNodes.length === 0) return 0;\n\n\t// Build a map for parent lookup\n\tconst entryMap = new Map<string, FlatNode>();\n\tfor (const flatNode of flatNodes) {\n\t\tentryMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// Build a map of visible entry IDs to their indices in filteredNodes\n\tconst visibleIdToIndex = new Map<string, number>(filteredNodes.map((node, i) => [node.node.entry.id, i]));\n\n\t// Walk from entryId up to root, looking for a visible entry\n\tlet currentId = entryId;\n\twhile (currentId !== null) {\n\t\tconst index = visibleIdToIndex.get(currentId);\n\t\tif (index !== undefined) return index;\n\t\tconst node = entryMap.get(currentId);\n\t\tif (!node) break;\n\t\tcurrentId = node.node.entry.parentId ?? null;\n\t}\n\n\t// Fallback: last visible entry\n\treturn filteredNodes.length - 1;\n}\n\nexport function applyTreeFilter(state: TreeListState): void {\n\t// Update lastSelectedId only when we have a valid selection (non-empty list)\n\t// This preserves the selection when switching through empty filter results\n\tif (state.filteredNodes.length > 0) {\n\t\tstate.lastSelectedId = state.filteredNodes[state.selectedIndex]?.node.entry.id ?? state.lastSelectedId;\n\t}\n\n\tconst searchTokens = state.searchQuery.toLowerCase().split(/\\s+/).filter(Boolean);\n\n\tstate.filteredNodes = state.flatNodes.filter((flatNode) => {\n\t\tconst entry = flatNode.node.entry;\n\t\tconst isCurrentLeaf = entry.id === state.currentLeafId;\n\n\t\t// Skip assistant messages with only tool calls (no text) unless error/aborted\n\t\t// Always show current leaf so active position is visible\n\t\tif (entry.type === \"message\" && entry.message.role === \"assistant\" && !isCurrentLeaf) {\n\t\t\tconst msg = entry.message as { stopReason?: string; content?: unknown };\n\t\t\tconst hasText = hasTextContent(msg.content);\n\t\t\tconst isErrorOrAborted = msg.stopReason && msg.stopReason !== \"stop\" && msg.stopReason !== \"toolUse\";\n\t\t\t// Only hide if no text AND not an error/aborted message\n\t\t\tif (!hasText && !isErrorOrAborted) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t// Apply filter mode\n\t\tlet passesFilter = true;\n\t\t// Entry types hidden in default view (settings/bookkeeping)\n\t\tconst isSettingsEntry =\n\t\t\tentry.type === \"label\" ||\n\t\t\tentry.type === \"custom\" ||\n\t\t\tentry.type === \"model_change\" ||\n\t\t\tentry.type === \"thinking_level_change\" ||\n\t\t\tentry.type === \"context_window_change\" ||\n\t\t\tentry.type === \"session_info\";\n\n\t\tswitch (state.filterMode) {\n\t\t\tcase \"user-only\":\n\t\t\t\t// Just user messages\n\t\t\t\tpassesFilter = entry.type === \"message\" && entry.message.role === \"user\";\n\t\t\t\tbreak;\n\t\t\tcase \"no-tools\":\n\t\t\t\t// Default minus tool results\n\t\t\t\tpassesFilter = !isSettingsEntry && !(entry.type === \"message\" && entry.message.role === \"toolResult\");\n\t\t\t\tbreak;\n\t\t\tcase \"labeled-only\":\n\t\t\t\t// Just labeled entries\n\t\t\t\tpassesFilter = flatNode.node.label !== undefined;\n\t\t\t\tbreak;\n\t\t\tcase \"all\":\n\t\t\t\t// Show everything\n\t\t\t\tpassesFilter = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t// Default mode: hide settings/bookkeeping entries\n\t\t\t\tpassesFilter = !isSettingsEntry;\n\t\t\t\tbreak;\n\t\t}\n\n\t\tif (!passesFilter) return false;\n\n\t\t// Apply search filter\n\t\tif (searchTokens.length > 0) {\n\t\t\tconst nodeText = getSearchableText(flatNode.node).toLowerCase();\n\t\t\treturn searchTokens.every((token) => nodeText.includes(token));\n\t\t}\n\n\t\treturn true;\n\t});\n\n\t// Filter out descendants of folded nodes.\n\tif (state.foldedNodes.size > 0) {\n\t\tconst skipSet = new Set<string>();\n\t\tfor (const flatNode of state.flatNodes) {\n\t\t\tconst { id, parentId } = flatNode.node.entry;\n\t\t\tif (parentId != null && (state.foldedNodes.has(parentId) || skipSet.has(parentId))) {\n\t\t\t\tskipSet.add(id);\n\t\t\t}\n\t\t}\n\t\tstate.filteredNodes = state.filteredNodes.filter((flatNode) => !skipSet.has(flatNode.node.entry.id));\n\t}\n\n\t// Recalculate visual structure (indent, connectors, gutters) based on visible tree\n\trecalculateVisualStructure(state);\n\n\t// Try to preserve cursor on the same node, or find nearest visible ancestor\n\tif (state.lastSelectedId) {\n\t\tstate.selectedIndex = findNearestVisibleIndex(state.flatNodes, state.filteredNodes, state.lastSelectedId);\n\t} else if (state.selectedIndex >= state.filteredNodes.length) {\n\t\t// Clamp index if out of bounds\n\t\tstate.selectedIndex = Math.max(0, state.filteredNodes.length - 1);\n\t}\n\n\t// Update lastSelectedId to the actual selection (may have changed due to parent walk)\n\tif (state.filteredNodes.length > 0) {\n\t\tstate.lastSelectedId = state.filteredNodes[state.selectedIndex]?.node.entry.id ?? state.lastSelectedId;\n\t}\n}\n\n/**\n * Recompute indentation/connectors for the filtered view\n *\n * Filtering can hide intermediate entries; descendants attach to the nearest visible ancestor.\n * Keep indentation semantics aligned with flattenTree() so single-child chains don't drift right.\n */\nfunction recalculateVisualStructure(state: TreeListState): void {\n\tif (state.filteredNodes.length === 0) return;\n\n\tconst visibleIds = new Set(state.filteredNodes.map((n) => n.node.entry.id));\n\n\t// Build entry map for efficient parent lookup (using full tree)\n\tconst entryMap = new Map<string, FlatNode>();\n\tfor (const flatNode of state.flatNodes) {\n\t\tentryMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// Find nearest visible ancestor for a node\n\tconst findVisibleAncestor = (nodeId: string): string | null => {\n\t\tlet currentId = entryMap.get(nodeId)?.node.entry.parentId ?? null;\n\t\twhile (currentId !== null) {\n\t\t\tif (visibleIds.has(currentId)) {\n\t\t\t\treturn currentId;\n\t\t\t}\n\t\t\tcurrentId = entryMap.get(currentId)?.node.entry.parentId ?? null;\n\t\t}\n\t\treturn null;\n\t};\n\n\t// Build visible tree structure:\n\t// - visibleParent: nodeId → nearest visible ancestor (or null for roots)\n\t// - visibleChildren: parentId → list of visible children (in filteredNodes order)\n\tconst visibleParent = new Map<string, string | null>();\n\tconst visibleChildren = new Map<string | null, string[]>();\n\tvisibleChildren.set(null, []); // root-level nodes\n\n\tfor (const flatNode of state.filteredNodes) {\n\t\tconst nodeId = flatNode.node.entry.id;\n\t\tconst ancestorId = findVisibleAncestor(nodeId);\n\t\tvisibleParent.set(nodeId, ancestorId);\n\n\t\tif (!visibleChildren.has(ancestorId)) {\n\t\t\tvisibleChildren.set(ancestorId, []);\n\t\t}\n\t\tvisibleChildren.get(ancestorId)!.push(nodeId);\n\t}\n\n\t// Update multipleRoots based on visible roots\n\tconst visibleRootIds = visibleChildren.get(null)!;\n\tstate.multipleRoots = visibleRootIds.length > 1;\n\n\t// Build a map for quick lookup: nodeId → FlatNode\n\tconst filteredNodeMap = new Map<string, FlatNode>();\n\tfor (const flatNode of state.filteredNodes) {\n\t\tfilteredNodeMap.set(flatNode.node.entry.id, flatNode);\n\t}\n\n\t// DFS over the visible tree using flattenTree() indentation semantics\n\t// Stack items: [nodeId, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild]\n\ttype StackItem = [string, number, boolean, boolean, boolean, GutterInfo[], boolean];\n\tconst stack: StackItem[] = [];\n\n\t// Add visible roots in reverse order (to process in forward order via stack)\n\tfor (let i = visibleRootIds.length - 1; i >= 0; i--) {\n\t\tconst isLast = i === visibleRootIds.length - 1;\n\t\tstack.push([\n\t\t\tvisibleRootIds[i],\n\t\t\tstate.multipleRoots ? 1 : 0,\n\t\t\tstate.multipleRoots,\n\t\t\tstate.multipleRoots,\n\t\t\tisLast,\n\t\t\t[],\n\t\t\tstate.multipleRoots,\n\t\t]);\n\t}\n\n\twhile (stack.length > 0) {\n\t\tconst [nodeId, indent, justBranched, showConnector, isLast, gutters, isVirtualRootChild] = stack.pop()!;\n\n\t\tconst flatNode = filteredNodeMap.get(nodeId);\n\t\tif (!flatNode) continue;\n\n\t\t// Update this node's visual properties\n\t\tflatNode.indent = indent;\n\t\tflatNode.showConnector = showConnector;\n\t\tflatNode.isLast = isLast;\n\t\tflatNode.gutters = gutters;\n\t\tflatNode.isVirtualRootChild = isVirtualRootChild;\n\n\t\t// Get visible children of this node\n\t\tconst children = visibleChildren.get(nodeId) || [];\n\t\tconst multipleChildren = children.length > 1;\n\n\t\t// Child indent follows flattenTree(): branch points (and first generation after a branch) shift +1\n\t\tlet childIndent: number;\n\t\tif (multipleChildren) {\n\t\t\tchildIndent = indent + 1;\n\t\t} else if (justBranched && indent > 0) {\n\t\t\tchildIndent = indent + 1;\n\t\t} else {\n\t\t\tchildIndent = indent;\n\t\t}\n\n\t\t// Child gutters follow flattenTree() connector/gutter rules\n\t\tconst connectorDisplayed = showConnector && !isVirtualRootChild;\n\t\tconst currentDisplayIndent = state.multipleRoots ? Math.max(0, indent - 1) : indent;\n\t\tconst connectorPosition = Math.max(0, currentDisplayIndent - 1);\n\t\tconst childGutters: GutterInfo[] = connectorDisplayed\n\t\t\t? [...gutters, { position: connectorPosition, show: !isLast }]\n\t\t\t: gutters;\n\n\t\t// Add children in reverse order (to process in forward order via stack)\n\t\tfor (let i = children.length - 1; i >= 0; i--) {\n\t\t\tconst childIsLast = i === children.length - 1;\n\t\t\tstack.push([\n\t\t\t\tchildren[i],\n\t\t\t\tchildIndent,\n\t\t\t\tmultipleChildren,\n\t\t\t\tmultipleChildren,\n\t\t\t\tchildIsLast,\n\t\t\t\tchildGutters,\n\t\t\t\tfalse,\n\t\t\t]);\n\t\t}\n\t}\n\n\t// Store visible tree maps for ancestor/descendant lookups in navigation\n\tstate.visibleParentMap = visibleParent;\n\tstate.visibleChildrenMap = visibleChildren;\n}\n"]}

package/dist/modes/interactive/components/tree-selector-types.d.ts

@@ -0,0 +1,57 @@
+import type { SessionTreeNode } from "../../../core/session-manager.ts";
+/** Gutter info: position (displayIndent where connector was) and whether to show │ */
+export interface GutterInfo {
+    position: number;
+    show: boolean;
+}
+/** Flattened tree node for navigation */
+export interface FlatNode {
+    node: SessionTreeNode;
+    /** Indentation level (each level = 3 chars) */
+    indent: number;
+    /** Whether to show connector (├─ or └─) - true if parent has multiple children */
+    showConnector: boolean;
+    /** If showConnector, true = last sibling (└─), false = not last (├─) */
+    isLast: boolean;
+    /** Gutter info for each ancestor branch point */
+    gutters: GutterInfo[];
+    /** True if this node is a root under a virtual branching root (multiple roots) */
+    isVirtualRootChild: boolean;
+}
+export interface HorizontalViewportRow {
+    gutter: string;
+    body: string;
+    anchorCol: number;
+    bodyWidth: number;
+    isSelected: boolean;
+}
+export declare const TREE_GUTTER_WIDTH = 2;
+export declare const MIN_VISIBLE_ANCHOR_CONTENT_WIDTH = 4;
+export declare const MAX_VISIBLE_ANCHOR_CONTENT_WIDTH = 20;
+export declare const MIN_ANCHOR_CONTEXT_WIDTH = 2;
+export declare const MAX_ANCHOR_CONTEXT_WIDTH = 12;
+/** Filter mode for tree display */
+export type FilterMode = "default" | "no-tools" | "user-only" | "labeled-only" | "all";
+/** Tool call info for lookup */
+export interface ToolCallInfo {
+    name: string;
+    arguments: Record<string, unknown>;
+}
+export interface TreeListState {
+    flatNodes: FlatNode[];
+    filteredNodes: FlatNode[];
+    selectedIndex: number;
+    currentLeafId: string | null;
+    maxVisibleLines: number;
+    filterMode: FilterMode;
+    searchQuery: string;
+    toolCallMap: Map<string, ToolCallInfo>;
+    multipleRoots: boolean;
+    showLabelTimestamps: boolean;
+    activePathIds: Set<string>;
+    visibleParentMap: Map<string, string | null>;
+    visibleChildrenMap: Map<string | null, string[]>;
+    lastSelectedId: string | null;
+    foldedNodes: Set<string>;
+}
+//# sourceMappingURL=tree-selector-types.d.ts.map

package/dist/modes/interactive/components/tree-selector-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selector-types.d.ts","sourceRoot":"","sources":["../../../../src/modes/interactive/components/tree-selector-types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAExE,sFAAsF;AACtF,MAAM,WAAW,UAAU;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,OAAO,CAAC;CACd;AAED,yCAAyC;AACzC,MAAM,WAAW,QAAQ;IACxB,IAAI,EAAE,eAAe,CAAC;IACtB,+CAA+C;IAC/C,MAAM,EAAE,MAAM,CAAC;IACf,kFAAkF;IAClF,aAAa,EAAE,OAAO,CAAC;IACvB,wEAAwE;IACxE,MAAM,EAAE,OAAO,CAAC;IAChB,iDAAiD;IACjD,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,kFAAkF;IAClF,kBAAkB,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,qBAAqB;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,OAAO,CAAC;CACpB;AAED,eAAO,MAAM,iBAAiB,IAAI,CAAC;AACnC,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAClD,eAAO,MAAM,gCAAgC,KAAK,CAAC;AACnD,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAC1C,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAE3C,mCAAmC;AACnC,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,WAAW,GAAG,cAAc,GAAG,KAAK,CAAC;AAEvF,gCAAgC;AAChC,MAAM,WAAW,YAAY;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,aAAa;IAC7B,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,aAAa,EAAE,QAAQ,EAAE,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,UAAU,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACvC,aAAa,EAAE,OAAO,CAAC;IACvB,mBAAmB,EAAE,OAAO,CAAC;IAC7B,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IAC7C,kBAAkB,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;IACjD,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACzB","sourcesContent":["import type { SessionTreeNode } from \"../../../core/session-manager.ts\";\n\n/** Gutter info: position (displayIndent where connector was) and whether to show │ */\nexport interface GutterInfo {\n\tposition: number; // displayIndent level where the connector was shown\n\tshow: boolean; // true = show │, false = show spaces\n}\n\n/** Flattened tree node for navigation */\nexport interface FlatNode {\n\tnode: SessionTreeNode;\n\t/** Indentation level (each level = 3 chars) */\n\tindent: number;\n\t/** Whether to show connector (├─ or └─) - true if parent has multiple children */\n\tshowConnector: boolean;\n\t/** If showConnector, true = last sibling (└─), false = not last (├─) */\n\tisLast: boolean;\n\t/** Gutter info for each ancestor branch point */\n\tgutters: GutterInfo[];\n\t/** True if this node is a root under a virtual branching root (multiple roots) */\n\tisVirtualRootChild: boolean;\n}\n\nexport interface HorizontalViewportRow {\n\tgutter: string;\n\tbody: string;\n\tanchorCol: number;\n\tbodyWidth: number;\n\tisSelected: boolean;\n}\n\nexport const TREE_GUTTER_WIDTH = 2;\nexport const MIN_VISIBLE_ANCHOR_CONTENT_WIDTH = 4;\nexport const MAX_VISIBLE_ANCHOR_CONTENT_WIDTH = 20;\nexport const MIN_ANCHOR_CONTEXT_WIDTH = 2;\nexport const MAX_ANCHOR_CONTEXT_WIDTH = 12;\n\n/** Filter mode for tree display */\nexport type FilterMode = \"default\" | \"no-tools\" | \"user-only\" | \"labeled-only\" | \"all\";\n\n/** Tool call info for lookup */\nexport interface ToolCallInfo {\n\tname: string;\n\targuments: Record<string, unknown>;\n}\n\nexport interface TreeListState {\n\tflatNodes: FlatNode[];\n\tfilteredNodes: FlatNode[];\n\tselectedIndex: number;\n\tcurrentLeafId: string | null;\n\tmaxVisibleLines: number;\n\tfilterMode: FilterMode;\n\tsearchQuery: string;\n\ttoolCallMap: Map<string, ToolCallInfo>;\n\tmultipleRoots: boolean;\n\tshowLabelTimestamps: boolean;\n\tactivePathIds: Set<string>;\n\tvisibleParentMap: Map<string, string | null>;\n\tvisibleChildrenMap: Map<string | null, string[]>;\n\tlastSelectedId: string | null;\n\tfoldedNodes: Set<string>;\n}\n"]}

package/dist/modes/interactive/components/tree-selector-types.js

@@ -0,0 +1,6 @@
+export const TREE_GUTTER_WIDTH = 2;
+export const MIN_VISIBLE_ANCHOR_CONTENT_WIDTH = 4;
+export const MAX_VISIBLE_ANCHOR_CONTENT_WIDTH = 20;
+export const MIN_ANCHOR_CONTEXT_WIDTH = 2;
+export const MAX_ANCHOR_CONTEXT_WIDTH = 12;
+//# sourceMappingURL=tree-selector-types.js.map

package/dist/modes/interactive/components/tree-selector-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-selector-types.js","sourceRoot":"","sources":["../../../../src/modes/interactive/components/tree-selector-types.ts"],"names":[],"mappings":"AA+BA,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC;AACnC,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAClD,MAAM,CAAC,MAAM,gCAAgC,GAAG,EAAE,CAAC;AACnD,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAC1C,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC","sourcesContent":["import type { SessionTreeNode } from \"../../../core/session-manager.ts\";\n\n/** Gutter info: position (displayIndent where connector was) and whether to show │ */\nexport interface GutterInfo {\n\tposition: number; // displayIndent level where the connector was shown\n\tshow: boolean; // true = show │, false = show spaces\n}\n\n/** Flattened tree node for navigation */\nexport interface FlatNode {\n\tnode: SessionTreeNode;\n\t/** Indentation level (each level = 3 chars) */\n\tindent: number;\n\t/** Whether to show connector (├─ or └─) - true if parent has multiple children */\n\tshowConnector: boolean;\n\t/** If showConnector, true = last sibling (└─), false = not last (├─) */\n\tisLast: boolean;\n\t/** Gutter info for each ancestor branch point */\n\tgutters: GutterInfo[];\n\t/** True if this node is a root under a virtual branching root (multiple roots) */\n\tisVirtualRootChild: boolean;\n}\n\nexport interface HorizontalViewportRow {\n\tgutter: string;\n\tbody: string;\n\tanchorCol: number;\n\tbodyWidth: number;\n\tisSelected: boolean;\n}\n\nexport const TREE_GUTTER_WIDTH = 2;\nexport const MIN_VISIBLE_ANCHOR_CONTENT_WIDTH = 4;\nexport const MAX_VISIBLE_ANCHOR_CONTENT_WIDTH = 20;\nexport const MIN_ANCHOR_CONTEXT_WIDTH = 2;\nexport const MAX_ANCHOR_CONTEXT_WIDTH = 12;\n\n/** Filter mode for tree display */\nexport type FilterMode = \"default\" | \"no-tools\" | \"user-only\" | \"labeled-only\" | \"all\";\n\n/** Tool call info for lookup */\nexport interface ToolCallInfo {\n\tname: string;\n\targuments: Record<string, unknown>;\n}\n\nexport interface TreeListState {\n\tflatNodes: FlatNode[];\n\tfilteredNodes: FlatNode[];\n\tselectedIndex: number;\n\tcurrentLeafId: string | null;\n\tmaxVisibleLines: number;\n\tfilterMode: FilterMode;\n\tsearchQuery: string;\n\ttoolCallMap: Map<string, ToolCallInfo>;\n\tmultipleRoots: boolean;\n\tshowLabelTimestamps: boolean;\n\tactivePathIds: Set<string>;\n\tvisibleParentMap: Map<string, string | null>;\n\tvisibleChildrenMap: Map<string | null, string[]>;\n\tlastSelectedId: string | null;\n\tfoldedNodes: Set<string>;\n}\n"]}