@demlik/tea 0.11.0 → 0.13.0

package/dist/{chunk-5KJKJOFC.js.map → chunk-NR7BU22N.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/chart/report/draw.ts","../src/chart/report/workflow.ts","../src/chart/report/fold.ts","../src/chart/report/report.ts"],"names":[],"mappings":";;;AA4CO,SAAS,QAAA,CAAS,KAAA,EAAsB,IAAA,GAAoB,EAAC,EAAW;AAC7E,EAAA,OAAO,aAAa,KAAA,EAAgB;AAAA,IAClC,QAAA,EAAU,IAAA;AAAA,IACV,GAAI,KAAK,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAW,IAAA,CAAK,OAAA,EAAQ;AAAA,IAChE,GAAI,KAAK,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA;AAAO,GAC5D,CAAA;AACH;AAUO,SAAS,YACd,KAAA,EACY;AACZ,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAA,CAAO,GAAA,CAAI,KAAK,IAAA,EAAA,CAAO,MAAA,CAAO,IAAI,IAAA,CAAK,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,MAAA;AACT;;;AC/BO,IAAM,SAAA,GAAY,CAAC,KAAA,KAA0B;AAClD,EAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA;AAC7B,EAAA,OAAO,QAAQ,EAAA,GAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACjD;AA+LO,IAAM,mBAAA,GAAN,cAAkC,KAAA,CAAM;AAAA,EAG7C,YAA4B,OAAA,EAA4B;AACtD,IAAA,KAAA;AAAA,MACE,CAAA;AAAA,CAAA,GACE,OAAA,CAAQ,IAAI,CAAC,CAAA,KAAM,YAAO,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI;AAAA,KAC5C;AAJ0B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAK5B;AAAA,EAL4B,OAAA;AAAA,EAFV,IAAA,GAAO,qBAAA;AAAA,EAChB,IAAA,GAAO,qBAAA;AAOlB;AAEA,IAAM,QAAA,GAAW,CAAC,CAAA,KAChB,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,KAAM,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA;AAEzD,IAAM,QAAA,GAAW,CAAC,IAAA,KAChB,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,IAAA,CAAK,IAAA,GAAO,MAAA;AASzD,IAAM,YAAA,GAAe;AAW5B,IAAM,aAAA,GAAgB,gBAAA;AAQtB,SAAS,YAAA,CAAa,QAAgB,MAAA,EAA+B;AACnE,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,IACE,CAAC,QAAA,CAAS,MAAM,CAAA,IAChB,CAAC,QAAA,CAAS,MAAA,CAAO,MAAM,CAAA,IACvB,OAAO,MAAA,CAAO,OAAA,KAAY,QAAA,EAC1B;AACA,IAAA,OAAO;AAAA,MACL,OAAA,EAAS;AAAA,QACP,SAAS,MAAM,CAAA,sDAAA;AAAA;AACjB,KACF;AAAA,EACF;AACA,EAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AACtB,EAAA,MAAM,eAAe,MAAA,CAAO,OAAA;AAC5B,EAAA,IAAI,MAAA,CAAO,YAAY,CAAA,KAAM,MAAA,EAAW;AACtC,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,MAAA,EAAS,MAAM,CAAA,kBAAA,EAAqB,YAAY,CAAA,sBAAA;AAAA,KAClD;AAAA,EACF;AAKA,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjD,IAAA,IAAI,SAAS,IAAI,CAAA,KAAM,OAAA,EAAS,MAAA,CAAO,IAAI,IAAI,CAAA;AAAA,EACjD;AACA,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AAGpC,EAAA,MAAM,KAAmD,EAAC;AAC1D,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAKtD,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,SAAA,EAAW;AAClC,IAAA,MAAM,QAAsC,EAAC;AAC7C,IAAA,EAAA,CAAG,SAAS,CAAA,GAAI,KAAA;AAChB,IAAA,IAAI,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AACnB,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,CAAA,kBAAA,CAAoB,CAAA;AACtE,MAAA;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,EAAA,IAAM,EAAC;AACxB,IAAA,IAAI,CAAC,QAAA,CAAS,GAAG,CAAA,EAAG;AAClB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,CAAA,6BAAA;AAAA,OACvC;AACA,MAAA;AAAA,IACF;AAKA,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,IAAA,KAAA,MAAW,CAAC,SAAA,EAAW,UAAU,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,EAAG;AACzD,MAAA,MAAM,KAAA,GAAQ,UAAU,SAAS,CAAA;AACjC,MAAA,IAAI,UAAU,EAAA,EAAI;AAChB,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,kBAAkB,SAAS,CAAA,sDAAA;AAAA,SAClE;AACA,QAAA;AAAA,MACF;AACA,MAAA,MAAM,OAAA,GAAU,SAAA,CAAU,GAAA,CAAI,KAAK,CAAA;AACnC,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,yCAAoC,OAAO,CAAA,OAAA,EAAU,SAAS,CAAA,aAAA,EAAgB,KAAK,CAAA,sCAAA;AAAA,SAC1H;AACA,QAAA;AAAA,MACF;AACA,MAAA,SAAA,CAAU,GAAA,CAAI,OAAO,SAAS,CAAA;AAG9B,MAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,UAAU,CAAA,EAAG;AAC7B,QAAA,MAAM,OAAO,UAAA,CAAW,GAAA;AAAA,UAAI,CAAC,GAAA,KAC3B,QAAA,CAAS,GAAG,CAAA,IAAK,OAAO,GAAA,CAAI,MAAA,KAAW,QAAA,GACnC,GAAA,CAAI,MAAA,GACJ;AAAA,SACN;AACA,QAAA,MAAM,CAAC,KAAA,EAAO,WAAW,CAAA,GAAI,IAAA;AAC7B,QAAA,IACE,WAAW,MAAA,KAAW,CAAA,IACtB,KAAA,KAAU,MAAA,IACV,gBAAgB,MAAA,EAChB;AACA,UAAA,OAAA,CAAQ,IAAA;AAAA,YACN,CAAA,MAAA,EAAS,MAAM,CAAA,YAAA,EAAe,SAAS,CAAA,+FAAA;AAAA,WACzC;AACA,UAAA;AAAA,QACF;AACA,QAAA,KAAA,MAAW,MAAA,IAAU,CAAC,KAAA,EAAO,WAAW,CAAA,EAAG;AACzC,UAAA,IAAI,MAAA,CAAO,MAAM,CAAA,KAAM,MAAA,EAAW;AAChC,YAAA,OAAA,CAAQ,IAAA;AAAA,cACN,CAAA,MAAA,EAAS,MAAM,CAAA,IAAA,EAAO,SAAS,4BAA4B,MAAM,CAAA,CAAA;AAAA,aACnE;AAAA,UACF;AAAA,QACF;AAGA,QAAA,IAAI,OAAO,GAAA,CAAI,WAAW,CAAA,EAAG,WAAA,CAAY,IAAI,WAAW,CAAA;AACxD,QAAA,MAAM,IAAA,GAAO,WAAW,CAAC,CAAA;AACzB,QAAA,MAAM,IAAA,GACJ,SAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,KAAA,KAAU,QAAA,GACpC,IAAA,CAAK,KAAA,GACL,aAAA;AACN,QAAA,KAAA,CAAM,KAAK,CAAA,GAAI,EAAE,QAAQ,KAAA,EAAO,IAAA,EAAM,WAAW,WAAA,EAAY;AAC7D,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,OAAO,eAAe,QAAA,EAAU;AAClC,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,IAAA,EAAO,SAAS,CAAA,yCAAA;AAAA,SACjC;AACA,QAAA;AAAA,MACF;AACA,MAAA,IAAI,MAAA,CAAO,UAAU,CAAA,KAAM,MAAA,EAAW;AACpC,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,IAAA,EAAO,SAAS,4BAA4B,UAAU,CAAA,CAAA;AAAA,SACvE;AACA,QAAA;AAAA,MACF;AAEA,MAAA,KAAA,CAAM,KAAK,CAAA,GACT,QAAA,CAAS,MAAA,CAAO,UAAU,CAAC,CAAA,KAAM,SAAA,GAC7B,EAAE,MAAA,EAAQ,EAAE,QAAA,EAAU,YAAA,IAAe,GACrC,EAAE,QAAQ,UAAA,EAAW;AAAA,IAC7B;AAAA,EACF;AAEA,EAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG,OAAO,EAAE,OAAA,EAAQ;AAEzC,EAAA,MAAM,MAAoC,EAAC;AAC3C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjD,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,SAAA,EAAW;AAClC,IAAA,MAAM,KAAA,GAAQ,EAAA,CAAG,IAAI,CAAA,IAAK,EAAC;AAC3B,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAC/B,IAAA,GAAA,CAAI,IAAI,CAAA,GAAI;AAAA,MACV,GAAI,IAAA,KAAS,YAAA,GAAe,EAAE,OAAA,EAAS,IAAA,KAAkB,EAAC;AAAA,MAC1D,GAAI,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,MAAA,GAAS,CAAA,GAAI,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,EAAC;AAAA,MACrD,GAAI,OAAA,GACA,EAAE,GAAA,EAAK,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,GAAK,OAAA,GAAqB,IAAA,EAAe,GACpE;AAAC,KACP;AAAA,EACF;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,OAAA,EAAS,EAAC,EAAE;AAClC;AAGA,SAAS,aAAA,CACP,WACA,MAAA,EAC0D;AAC1D,EAAA,MAAM,MAAA,GAAS,UAAU,SAAS,CAAA,wFAAA,CAAA;AAClC,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,IAAK,OAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,MAAA,EAAO;AACnE,EAAA,MAAM,CAAC,OAAA,EAAS,IAAI,CAAA,GAAI,MAAA,CAAO,GAAA;AAAA,IAAI,CAAC,GAAA,KAClC,QAAA,CAAS,GAAG,CAAA,IAAK,OAAO,GAAA,CAAI,MAAA,KAAW,QAAA,GAAW,GAAA,CAAI,MAAA,GAAS;AAAA,GACjE;AACA,EAAA,OAAO,OAAA,KAAY,MAAA,IAAa,IAAA,KAAS,MAAA,GACrC,EAAE,MAAA,EAAO,GACT,EAAE,OAAA,EAAS,CAAC,OAAA,EAAS,IAAI,CAAA,EAAW;AAC1C;AA6BO,SAAS,iBAAA,CACd,QAAA,EACA,OAAA,GAAiC,EAAC,EACpB;AACd,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,UAAA,GAAa,QAAA,CAAS,QAAQ,CAAA,GAAI,SAAS,OAAA,GAAU,MAAA;AAC3D,EAAA,IAAI,CAAC,SAAS,UAAU,CAAA,IAAK,CAAC,QAAA,CAAS,UAAA,CAAW,MAAM,CAAA,EAAG;AACzD,IAAA,MAAM,IAAI,mBAAA,CAAoB;AAAA,MAC5B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,MAAM,kBAAkB,QAAA,CAAS,UAAA,CAAW,OAAO,CAAA,GAC/C,UAAA,CAAW,UACX,EAAC;AACL,EAAA,MAAM,eAAA,GAAkB,QAAA,CAAS,QAAQ,CAAA,GAAI,SAAS,OAAA,GAAU,MAAA;AAChE,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,OAAO,eAAA,KAAoB,QAAA,EAAU;AACxE,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAgB,UAAA,CAAW,MAAA;AACjC,EAAA,MAAM,SAAwC,EAAC;AAC/C,EAAA,MAAM,UAMF,EAAC;AACL,EAAA,MAAM,SAA0B,EAAC;AACjC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,IAAI,SAAA;AAEJ,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,aAAa,CAAA,EAAG;AAC7D,IAAA,IAAI,SAAS,IAAI,CAAA,KAAM,cAAc,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AACtD,IAAA,MAAM,UAAU,IAAA,CAAK,MAAA;AACrB,IAAA,IAAI,CAAC,SAAS,OAAO,CAAA,IAAK,OAAO,IAAA,CAAK,OAAO,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG;AAC3D,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,UAAU,SAAS,CAAA,yDAAA;AAAA,OACrB;AACA,MAAA;AAAA,IACF;AACA,IAAA,MAAM,aAAuB,EAAC;AAC9B,IAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AACtD,MAAA,MAAM,QAAA,GAAW,YAAA,CAAa,MAAA,EAAQ,MAAM,CAAA;AAC5C,MAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,QAAA,CAAS,OAAO,CAAA;AAChC,MAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAW;AAC/B,QAAA,MAAM,SAGF,EAAC;AACL,QAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,QAAA,CAAS,IAAI,CAAA,EAAG;AAChD,UAAA,KAAA,MAAW,SAAS,MAAA,CAAO,IAAA,CAAK,MAAM,EAAA,IAAM,EAAE,CAAA,EAAG;AAG/C,YAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,IAAA,GAAO,KAAK,CAAA;AACnC,YAAA,MAAA,CAAO,KAAK,CAAA,GACV,MAAA,KAAW,MAAA,GACP,EAAE,KAAA,EAAO,OAAA,EAAQ,GACjB,EAAE,KAAA,EAAO,OAAA,EAAS,IAAA,EAAM,MAAA,EAAO;AAAA,UACvC;AAAA,QACF;AAQA,QAAA,MAAA,CAAO,MAAM,CAAA,GAAI,EAAE,MAAA,EAAQ,MAAA,EAAQ,EAAE,CAAC,SAAS,GAAG,QAAA,CAAS,IAAA,EAAK,EAAE;AAAA,MACpE;AACA,MAAA,MAAM,GAAA,GAAM,gBAAgB,MAAM,CAAA;AAClC,MAAA,MAAM,GAAA,GAAM,QAAA,CAAS,GAAG,CAAA,GAAI,MAAM,EAAC;AACnC,MAAA,MAAM,EAAE,UAAA,EAAY,MAAA,EAAQ,SAAS,QAAA,EAAU,GAAG,QAAO,GAAI,GAAA;AAC7D,MAAA,OAAA,CAAQ,MAAM,CAAA,GAAI;AAAA,QAChB,UAAA,EAAY,OAAO,MAAA,KAAW,QAAA,GAAW,MAAA,GAAS,YAAA;AAAA,QAClD;AAAA,OACF;AACA,MAAA,UAAA,CAAW,KAAK,MAAM,CAAA;AAAA,IACxB;AACA,IAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,YAAY,CAAA;AAElD,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,SAAA,EAAW,IAAA,CAAK,MAAM,CAAA;AACjD,IAAA,IAAI,KAAK,MAAA,KAAW,MAAA,EAAW,OAAA,CAAQ,IAAA,CAAK,KAAK,MAAM,CAAA;AACvD,IAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW;AAC9B,MAAA,KAAA,MAAW,MAAA,IAAU,KAAK,OAAA,EAAS;AACjC,QAAA,WAAA,CAAY,IAAI,MAAM,CAAA;AACtB,QAAA,IAAI,aAAA,CAAc,MAAM,CAAA,KAAM,MAAA,EAAW;AACvC,UAAA,OAAA,CAAQ,IAAA;AAAA,YACN,CAAA,OAAA,EAAU,SAAS,CAAA,mDAAA,EAAsD,MAAM,CAAA,CAAA;AAAA,WACjF;AAAA,QACF;AAAA,MACF;AAIA,MAAA,SAAA,GAAY,EAAE,QAAA,EAAU,IAAA,CAAK,OAAA,CAAQ,CAAC,GAAG,OAAA,EAAS,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAE;AAAA,IACpE;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,aAAa,CAAA,EAAG;AACxD,IAAA,IAAI,SAAS,IAAI,CAAA,KAAM,UAAA,IAAc,QAAA,CAAS,IAAI,CAAA,EAAG;AACrD,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,OAAA,EAAS;AAC9B,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,wBAAwB,IAAI,CAAA,0DAAA;AAAA,OAC9B;AAAA,IACF,CAAA,MAAA,IAAW,CAAC,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,EAAG;AACjC,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,wBAAwB,IAAI,CAAA,2CAAA;AAAA,OAC9B;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,OAAO,MAAA,KAAW,CAAA;AACpB,IAAA,OAAA,CAAQ,KAAK,yCAAyC,CAAA;AACxD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,oBAAoB,OAAO,CAAA;AAC7D,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAI,mBAAA,CAAoB;AAAA,MAC5B;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,EAAA,GACJ,SAAS,QAAQ,CAAA,IAAK,OAAO,QAAA,CAAS,EAAA,KAAO,QAAA,GACzC,QAAA,CAAS,EAAA,GACT,MAAA;AACN,EAAA,MAAM,IAAA,GAAqB;AAAA,IACzB,GAAI,EAAA,KAAO,MAAA,GAAY,EAAC,GAAI,EAAE,EAAA,EAAG;AAAA,IACjC,GAAI,OAAO,eAAA,KAAoB,QAAA,GAC3B,EAAE,OAAA,EAAS,eAAA,KACX,EAAC;AAAA,IACL,MAAA;AAAA,IACA,SAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF;AAMA,EAAA,IAAI,OAAA,CAAQ,eAAe,IAAA,EAAM;AAC/B,IAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,aAAA,CAAc,IAAI,CAAC,CAAA;AAC5C,IAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,QAAQ,IAAA,IAAQ,EAAE,CAAA,CAAE,MAAA;AAAA,MAC7C,CAAC,KAAA,KAAU,CAAC,QAAA,CAAS,IAAI,KAAK;AAAA,KAChC;AACA,IAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,MAAA,MAAM,IAAI,mBAAA;AAAA,QACR,MAAA,CAAO,GAAA;AAAA,UACL,CAAC,KAAA,KACC,CAAA,gBAAA,EAAmB,KAAK,CAAA,wFAAA;AAAA;AAC5B,OACF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,qBAAA,CACd,IAAA,EACA,OAAA,GAAiC,EAAC,EACpB;AACd,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,MAAM,IAAI,mBAAA,CAAoB,CAAC,0BAA0B,CAAC,CAAA;AAAA,EAC5D;AACA,EAAA,OAAO,iBAAA,CAAkB,QAAQ,OAAO,CAAA;AAC1C;AAKO,SAAS,SACd,KAAA,EACmC;AACnC,EAAA,MAAM,GAAA,uBAAU,GAAA,EAA0B;AAC1C,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,MAAM,CAAA,EAAG;AAC/C,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,IAAI,CAAA;AAAA,EACtE;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,UAAU,KAAA,EAA8B;AACtD,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AAC1C,IAAA,IAAI,IAAA,CAAK,OAAA,KAAY,IAAA,EAAM,OAAO,IAAA;AAAA,EACpC;AACA,EAAA,MAAM,IAAI,MAAM,oDAAoD,CAAA;AACtE;AAcO,SAAS,cAAc,IAAA,EAAuC;AACnE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9C,IAAA,KAAA,MAAW,KAAA,IAAS,OAAO,IAAA,CAAK,KAAA,CAAM,MAAM,CAAA,EAAG,GAAA,CAAI,IAAI,KAAK,CAAA;AAAA,EAC9D;AACA,EAAA,OAAO,CAAC,GAAG,GAAG,CAAA;AAChB;AASO,SAAS,QAAA,CACd,OACA,KAAA,EACyB;AACzB,EAAA,OAAO,KAAA,CAAM,MAAA,CAAO,KAAK,CAAA,EAAG,IAAA;AAC9B;AAGO,SAAS,cACd,IAAA,EACwB;AACxB,EAAA,IAAI,IAAA,EAAM,GAAA,KAAQ,MAAA,EAAW,OAAO,KAAA;AACpC,EAAA,OAAO,IAAA,CAAK,GAAA;AACd;;;AC9oBO,SAAS,aAAA,CACd,KAAA,EACA,IAAA,EACA,KAAA,EACA,EAAA,EACQ;AACR,EAAA,MAAM,QAAA,GAAW,SAAS,KAAK,CAAA,CAAE,IAAI,IAAI,CAAA,EAAG,KAAK,KAAK,CAAA;AACtD,EAAA,MAAM,QACJ,QAAA,KAAa,MAAA,IAAa,YAAY,QAAA,GAClC,QAAA,CAAS,OAAO,QAAA,GAChB,EAAA;AACN,EAAA,OAAO,OAAA,CAAQ,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AACnC;AA+BO,IAAM,oBAAA,GAAN,cAAmC,KAAA,CAAM;AAAA,EAG9C,YAA4B,OAAA,EAA4B;AACtD,IAAA,KAAA;AAAA,MACE,CAAA;AAAA,CAAA,GACE,OAAA,CAAQ,IAAI,CAAC,CAAA,KAAM,YAAO,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI;AAAA,KAC5C;AAJ0B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAK5B;AAAA,EAL4B,OAAA;AAAA,EAFV,IAAA,GAAO,sBAAA;AAAA,EAChB,IAAA,GAAO,sBAAA;AAOlB;AAOO,SAAS,iBAAiB,IAAA,EAAmC;AAClE,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,UAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,KAAK,KAAA,CAAM,IAAI,CAAA,CAAE,OAAA,EAAQ,EAAG;AACtD,IAAA,IAAI,IAAA,CAAK,IAAA,EAAK,KAAM,EAAA,EAAI;AACxB,IAAA,IAAI,MAAA;AACJ,IAAA,IAAI;AACF,MAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,IAC1B,CAAA,CAAA,MAAQ;AACN,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,KAAA,EAAQ,KAAA,GAAQ,CAAC,CAAA,YAAA,CAAc,CAAA;AAC5C,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM,CAAA;AAC/B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,KAAA,EAAQ,QAAQ,CAAC,CAAA,gDAAA;AAAA,OACnB;AACA,MAAA;AAAA,IACF;AACA,IAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,EACpB;AACA,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,qBAAqB,OAAO,CAAA;AAC9D,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,WAAW,KAAA,EAAsC;AACxD,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,MAAM,OAAO,MAAA;AACxD,EAAA,MAAM,MAAA,GAAS,KAAA;AACf,EAAA,IACE,OAAO,MAAA,CAAO,IAAA,KAAS,QAAA,IACvB,OAAO,MAAA,CAAO,KAAA,KAAU,QAAA,IACxB,OAAO,MAAA,CAAO,EAAA,KAAO,QAAA,EACrB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,MAAM,MAAA,CAAO,IAAA,EAAM,OAAO,MAAA,CAAO,KAAA,EAAO,EAAA,EAAI,MAAA,CAAO,EAAA,EAAG;AACjE;AAGO,SAAS,iBAAiB,IAAA,EAAmC;AAClE,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,MAAM,IAAI,oBAAA,CAAqB,CAAC,mCAAmC,CAAC,CAAA;AAAA,EACtE;AACA,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,MAAM,UAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,MAAA,CAAO,SAAQ,EAAG;AAC3C,IAAA,MAAM,KAAA,GAAQ,WAAW,GAAG,CAAA;AAC5B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,QAC7B,iBAAiB,KAAK,CAAA,gDAAA;AAAA,OACvB,CAAA;AAAA,IACH;AACA,IAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,EACpB;AACA,EAAA,OAAO,OAAA;AACT;AAYA,IAAM,kBAAA,GAAqB,CACzB,IAAA,EACA,OAAA,KACsB;AACtB,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,KAAM,UAAa,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AACnE,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,IAAI,CAAA;AACnB,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,gBAAA,EAAmB,MAAM,IAAI,CAAA,sCAAA;AAAA,KAC/B;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT,CAAA;AAEA,IAAM,OAAA,GAAU,CAAC,IAAA,EAAoB,MAAA,KAAkC;AACrE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B,mBAAmB,MAAM,CAAA,sCAAA;AAAA,KAC1B,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT,CAAA;AAGO,SAAS,cACd,IAAA,EACqC;AACrC,EAAA,MAAM,MAAiC,EAAC;AACxC,EAAA,KAAA,MAAW,CAAC,QAAQ,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA,EAAG;AACzD,IAAA,GAAA,CAAI,MAAM,CAAA,GAAI;AAAA,MACZ,IAAA,EAAM,UAAU,KAAK,CAAA;AAAA,MACrB,OAAA,EAAS,CAAA;AAAA,MACT,UAAA,EAAY,IAAA,CAAK,OAAA,CAAQ,MAAM,GAAG,UAAA,IAAc;AAAA,KAClD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAqBO,SAAS,QAAA,CACd,KAAA,EACA,KAAA,EACA,KAAA,EACA,MAAA,EACW;AACX,EAAA,MAAM,OAAO,QAAA,CAAS,KAAK,CAAA,CAAE,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,EAAA,MAAM,IAAA,GAAO,IAAA,EAAM,EAAA,GAAK,KAAK,CAAA;AAC7B,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,KAAA,CAAM,WAAW,KAAA,CAAM,IAAI,GAAG,QAAA,CAAS,KAAK,CAAA,KAAM,IAAA,EAAM,OAAO,KAAA;AACnE,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B,CAAA,EAAG,MAAA,KAAW,MAAA,GAAY,EAAA,GAAK,CAAA,MAAA,EAAS,MAAM,CAAA,GAAA,CAAK,CAAA,OAAA,EAAU,KAAA,CAAM,IAAI,CAAA,qBAAA,EAAwB,KAAK,CAAA,CAAA;AAAA,KACrG,CAAA;AAAA,EACH;AACA,EAAA,IAAI,YAAY,IAAA,EAAM;AAEpB,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,GAAA,IAAO,IAAA,CAAK,OAAO,QAAA,EAAS;AAAA,EAC7D;AACA,EAAA,IAAI,UAAU,IAAA,EAAM;AAGlB,IAAA,OAAO,KAAA,CAAM,OAAA,GAAU,KAAA,CAAM,UAAA,GACzB;AAAA,MACE,GAAG,KAAA;AAAA,MACH,MAAM,IAAA,CAAK,MAAA;AAAA,MACX,OAAA,EAAS,MAAM,OAAA,GAAU,CAAA;AAAA,MACzB,KAAK,KAAA,CAAM;AAAA,KACb,GACA,EAAE,GAAG,KAAA,EAAO,MAAM,IAAA,CAAK,SAAA,EAAW,GAAA,EAAK,KAAA,CAAM,IAAA,EAAK;AAAA,EACxD;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,KAAK,MAAA,EAAQ,GAAA,EAAK,MAAM,IAAA,EAAK;AACxD;AAUO,SAAS,QAAA,CACd,MACA,OAAA,EACqC;AACrC,EAAA,MAAM,OAAA,GAAU,kBAAA,CAAmB,IAAA,EAAM,OAAO,CAAA;AAChD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,qBAAqB,OAAO,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAoC,EAAE,GAAG,aAAA,CAAc,IAAI,CAAA,EAAE;AACnE,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AACtC,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA;AACjC,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,QAC7B,CAAA,gBAAA,EAAmB,MAAM,IAAI,CAAA,sCAAA;AAAA,OAC9B,CAAA;AAAA,IACH;AACA,IAAA,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,QAAA;AAAA,MACnB,KAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAA,CAAU,MAAM,KAAK,CAAA;AAAA,MACrB,KAAA,CAAM;AAAA,KACR;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAiCO,SAAS,QAAA,CACd,MACA,OAAA,EACyB;AACzB,EAAA,MAAM,OAAA,GAAU,kBAAA,CAAmB,IAAA,EAAM,OAAO,CAAA;AAChD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,qBAAqB,OAAO,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAoC,EAAE,GAAG,aAAA,CAAc,IAAI,CAAA,EAAE;AACnE,EAAA,MAAM,QAAwB,EAAC;AAC/B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,CAAA,IAAK,OAAA,CAAQ,SAAQ,EAAG;AAC9C,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA;AAChC,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,QAC7B,CAAA,gBAAA,EAAmB,MAAM,IAAI,CAAA,sCAAA;AAAA,OAC9B,CAAA;AAAA,IACH;AACA,IAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA;AACnC,IAAA,MAAM,QAAQ,QAAA,CAAS,KAAA,EAAO,MAAA,EAAQ,KAAA,EAAO,MAAM,IAAI,CAAA;AACvD,IAAA,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,KAAA;AACrB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,KAAA;AAAA,MACA,IAAI,KAAA,CAAM,EAAA;AAAA,MACV,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,MAAM,MAAA,CAAO,IAAA;AAAA,MACb,IAAI,KAAA,CAAM,IAAA;AAAA,MACV,MAAM,aAAA,CAAc,KAAA,EAAO,OAAO,IAAA,EAAM,KAAA,EAAO,MAAM,IAAI;AAAA,KAC1D,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT;AAmCO,SAAS,YAAA,CACd,MACA,MAAA,EACmB;AACnB,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA,CAAE,MAAA;AAAA,IACzB,CAAC,WAAW,aAAA,CAAc,MAAA,CAAO,MAAM,MAAA,EAAQ,MAAM,CAAC,CAAA,KAAM;AAAA,GAC9D;AACF;AAsBO,SAAS,cAAA,CACd,MACA,MAAA,EACuB;AACvB,EAAA,MAAM,OAAA,GAAU,CAAC,MAAA,KACf,aAAA,CAAc,OAAO,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAC,CAAA,KAAM,KAAA;AAClD,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,IAAA,EAAM,MAAM,CAAA;AACxC,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,OAAO,KAAA,KAAU;AACvC,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,MAAA,KAAW,MAAA,CAAO,QAAA,CAAS,MAAM,CAAC,CAAA;AACtE,IAAA,MAAM,IAAA,GAAO,EAAE,IAAA,EAAM,KAAA,CAAM,MAAM,KAAA,EAAO,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,OAAA,EAAQ;AACpE,IAAA,IAAI,SAAS,OAAO,EAAE,GAAG,IAAA,EAAM,UAAU,SAAA,EAAmB;AAC5D,IAAA,IAAI,CAAC,KAAA,CAAM,KAAA,CAAM,KAAA,CAAM,OAAO,CAAA,EAAG;AAC/B,MAAA,OAAA,GAAU,IAAA;AACV,MAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,QAAA,EAAkB;AAAA,IAChD;AACA,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,OAAA,GAAU,IAAA;AACV,MAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,SAAA,EAAmB;AAAA,IACjD;AACA,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,UAAA,EAAoB;AAAA,EAClD,CAAC,CAAA;AACH;AAkBO,SAAS,mBAAA,CACd,QACA,SAAA,EACoB;AACpB,EAAA,IAAI,OAAO,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,aAAa,SAAS,CAAA;AACrD,IAAA,OAAO,SAAA,CAAU,OAAA;AACnB,EAAA,IAAI,MAAA,CAAO,KAAK,CAAC,KAAA,KAAU,MAAM,QAAA,KAAa,QAAQ,GAAG,OAAO,MAAA;AAChE,EAAA,OAAO,SAAA,CAAU,QAAA;AACnB;AAYO,SAAS,gBAAA,CACd,MACA,MAAA,EACY;AACZ,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,IAAA,EAAM,MAAM,CAAA;AAExC,EAAA,MAAM,UAAmC,EAAC;AAC1C,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACpD,IAAA,OAAA,CAAQ,MAAM,CAAA,GAAI;AAAA,MAChB,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,YAAY,KAAA,CAAM,UAAA;AAAA,MAClB,GAAI,IAAA,CAAK,OAAA,CAAQ,MAAM,CAAA,EAAG,UAAU;AAAC,KACvC;AAAA,EACF;AACA,EAAA,OAAA,CAAQ,MAAA,GAAS,MAAA;AAEjB,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,IAAA,EAAM,MAAM,CAAA;AAC1C,EAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,MAAA,EAAQ,IAAA,CAAK,SAAS,CAAA;AAC3D,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,EAAE,UAAA,EAAY,QAAA,EAAU,MAAA,EAAQ,QAAQ,OAAA,EAAQ;AAAA,EACzD;AAGA,EAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,aAAa,QAAQ,CAAA;AACjE,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,UAAU,QAAA,EAAU,MAAA,EAAQ,QAAQ,OAAA,EAAQ;AAAA,EACxE;AAEA,EAAA,MAAM,UAAA,GAA8D;AAAA,IAClE,CAAC,MAAA,CAAO,IAAI,GAAG,MAAA,CAAO,WAAA;AAAA,MACpB,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,MAAA,EAAQ,MAAA,CAAO,MAAM,CAAA,EAAG,IAAA,IAAQ,GAAG,CAAC;AAAA;AACpE,GACF;AACA,EAAA,KAAA,MAAW,SAAS,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,KAAA,GAAQ,CAAC,CAAA,EAAG;AAClD,IAAA,UAAA,CAAW,KAAA,CAAM,IAAI,CAAA,GAAI,SAAA;AAAA,EAC3B;AACA,EAAA,OAAO,EAAE,UAAA,EAAY,MAAA,EAAQ,QAAA,EAAU,OAAA,EAAQ;AACjD;AAEA,SAAS,MAAA,CAAO,IAAA,EAAoB,MAAA,EAAgB,MAAA,EAAoB;AACtE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,EAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW,OAAO,MAAA;AACvD,EAAA,OAAO,QAAA,CAAS,KAAK,CAAA,CAAE,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC;AAGO,SAAS,gBAAgB,IAAA,EAA0B;AACxD,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,MAAM,IAAI,oBAAA,CAAqB,CAAC,kCAAkC,CAAC,CAAA;AAAA,EACrE;AACA,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,KAAW,IAAA,EAAM;AACjD,IAAA,MAAM,IAAI,oBAAA,CAAqB,CAAC,uCAAuC,CAAC,CAAA;AAAA,EAC1E;AACA,EAAA,MAAM,MAAA,GAAS,MAAA;AAKf,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,QAAA,IAAY,MAAA,CAAO,WAAW,MAAA,EAAQ;AAC1D,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,IAAI,MAAA,CAAO,eAAe,MAAA,EAAW;AACnC,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,OAAO;AAAA,IACL,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,QAAQ,MAAA,CAAO,MAAA;AAAA,IACf,OAAA,EACE,OAAO,MAAA,CAAO,OAAA,KAAY,QAAA,IAAY,OAAO,OAAA,KAAY,IAAA,GACpD,MAAA,CAAO,OAAA,GACR;AAAC,GACT;AACF;;;ACxeA,IAAM,cAAA,GAAiB,CAAC,CAAA,KACtB,OAAO,MAAM,QAAA,IACb,CAAA,KAAM,IAAA,IACN,KAAA,CAAM,QAAS,CAAA,CAAmB,MAAM,CAAA,IACxC,OAAQ,EAAmB,MAAA,KAAW,QAAA;AAGxC,SAAS,gBAAgB,MAAA,EAAwC;AAC/D,EAAA,IAAI,OAAO,MAAA,CAAO,UAAA,KAAe,QAAA,EAAU,OAAO,MAAA;AAClD,EAAA,KAAA,MAAW,CAAC,MAAM,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,EAAG;AAC7D,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,IAAA;AAAA,EACxC;AACA,EAAA,OAAO,MAAA;AACT;AAGA,IAAM,MAAA,GAAS,CAAC,MAAA,KACd,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,EAAA,CAAI,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA;AAazC,SAAS,MAAA,CACP,MAAA,EACA,KAAA,EACA,MAAA,EACQ;AACR,EAAA,IAAI,WAAW,KAAA,EAAO;AACpB,IAAA,OAAO,CAAA,WAAA,EAAc,KAAK,CAAA,qBAAA,EAAmB,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAAA,EAC7D;AACA,EAAA,IAAI,WAAW,KAAA,EAAO;AACpB,IAAA,OAAO,CAAA,aAAA,EAAgB,KAAK,CAAA,2BAAA,EAAyB,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAAA,EACrE;AACA,EAAA,OAAO,GAAG,MAAA,CAAO,KAAK,CAAA,GAAA,EAAM,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAC5C;AAGA,IAAM,SAAA,GAAY,CAAC,MAAA,KACjB,OAAO,WAAW,QAAA,GAAW,MAAA,GAAS,CAAA,MAAA,EAAS,MAAA,CAAO,KAAK,CAAA,CAAA;AAgBtD,SAAS,SAAA,CAAU,OAAsB,KAAA,EAA8B;AAC5E,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAK,CAAA,CAAE,IAAI,KAAK,CAAA;AACtC,EAAA,IAAI,IAAA,EAAM,GAAA,KAAQ,MAAA,EAAW,OAAO,IAAA;AACpC,EAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,IAAA,EAAM,EAAA,IAAM,EAAE,CAAA;AACzC,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAGvB,IAAA,OAAO,KAAK,KAAK,CAAA,2CAAA,CAAA;AAAA,EACnB;AAGA,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAuD;AAC1E,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,KAAA,EAAO,KAAK,CAAA;AACpC,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,UAAA,CAAW,KAAK,KAAK,CAAA;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,UAAU,MAAM,CAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,EAAE,MAAA,EAAQ,MAAA,EAAQ,CAAC,KAAK,CAAA,EAAG,CAAA;AAAA,SAC/D,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA;AAAA,EAC9B;AAIA,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG,OAAO,KAAK,KAAK,CAAA,WAAA,EAAc,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAEpE,EAAA,MAAM,QAAQ,CAAC,GAAG,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,CAAA,KACtC,MAAA,CAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,EAAE,MAAM;AAAA,GAClC;AAGA,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAG,MAAA,CAAO,UAAU,CAAC,CAAA,uCAAA,CAAyC,CAAA;AAAA,EAC3E;AACA,EAAA,OAAO,KAAA,CAAM,KAAK,QAAK,CAAA;AACzB;AAGA,SAAS,SAAA,CAAU,OAAsB,KAAA,EAAiC;AACxE,EAAA,IAAI,KAAA,CAAM,OAAA,IAAW,CAAA,EAAG,OAAO,IAAA;AAC/B,EAAA,MAAM,SAAS,CAAA,EAAG,KAAA,CAAM,OAAO,CAAA,CAAA,EAAI,MAAM,UAAU,CAAA,CAAA;AACnD,EAAA,IAAI,MAAM,OAAA,GAAU,KAAA,CAAM,UAAA,EAAY,OAAO,gBAAgB,MAAM,CAAA,CAAA;AAGnE,EAAA,MAAM,OAAO,QAAA,CAAS,KAAK,CAAA,CAAE,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,MAAA,CAAO,QAAQ,IAAA,EAAM,EAAA,IAAM,EAAE,CAAA,EAAG;AAC1D,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,OAAO,gBAAgB,MAAM,CAAA,qBAAA,EAAmB,KAAK,CAAA,UAAA,EAAa,KAAK,SAAS,CAAA,EAAA,CAAA;AAAA,IAClF;AAAA,EACF;AACA,EAAA,OAAO,gBAAgB,MAAM,CAAA,aAAA,CAAA;AAC/B;AAYA,SAAS,SAAA,CACP,OACA,MAAA,EACQ;AACR,EAAA,MAAM,KAAA,GAAQ,CAAA,EAAG,KAAA,CAAM,KAAA,CAAM,MAAM,CAAA,KAAA,EAAQ,KAAA,CAAM,KAAA,CAAM,MAAA,KAAW,CAAA,GAAI,EAAA,GAAK,GAAG,CAAA,CAAA;AAC9E,EAAA,IAAI,KAAA,CAAM,aAAa,SAAA,EAAW;AAChC,IAAA,OAAO,CAAA,EAAA,EAAK,KAAA,CAAM,IAAI,CAAA,mBAAA,EAAiB,KAAK,CAAA,cAAA,CAAA;AAAA,EAC9C;AACA,EAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAClB,GAAA;AAAA,IACC,CAAC,MAAA,KACC,CAAA,EAAA,EAAK,MAAM,CAAA,OAAA,EAAU,OAAO,MAAM,CAAA,EAAG,IAAA,IAAQ,GAAG,KAC9C,KAAA,CAAM,OAAA,CAAQ,SAAS,MAAM,CAAA,GAAI,mBAAmB,EACtD,CAAA;AAAA,GACJ,CACC,KAAK,IAAI,CAAA;AACZ,EAAA,OAAO,CAAA,EAAA,EAAK,MAAM,IAAI,CAAA,IAAA,EAAO,MAAM,QAAQ,CAAA,QAAA,EAAM,KAAK,CAAA,EAAA,EAAK,MAAM,CAAA,CAAA;AACnE;AAEA,SAAS,cAAc,KAAA,EAAwC;AAC7D,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA;AACnB,IAAA,OAAO,0DAAA;AACT,EAAA,MAAM,OAAO,KAAA,CAAM,GAAA;AAAA,IACjB,CAAC,MACC,CAAA,EAAA,EAAK,CAAA,CAAE,QAAQ,CAAC,CAAA,GAAA,EAAM,EAAE,EAAE,CAAA,KAAA,EAAQ,EAAE,IAAI,CAAA,OAAA,EAAU,EAAE,KAAK,CAAA,OAAA,EAAU,EAAE,IAAI,CAAA,YAAA,EAAU,EAAE,EAAE,CAAA,IAAA;AAAA,GAC3F;AACA,EAAA,OAAO;AAAA,IACL,4CAAA;AAAA,IACA,uBAAA;AAAA,IACA,GAAG;AAAA,GACL,CAAE,KAAK,IAAI,CAAA;AACb;AAQO,SAAS,WAAW,KAAA,EAAoC;AAC7D,EAAA,MAAM,IAAA,GAAO,eAAe,KAAA,CAAM,QAAQ,IACtC,KAAA,CAAM,QAAA,GACN,iBAAA,CAAkB,KAAA,CAAM,QAAQ,CAAA;AACpC,EAAA,MAAM,UAAU,KAAA,CAAM,OAAA;AACtB,EAAA,MAAM,MAAA,GAAS,QAAA,CAAS,IAAA,EAAM,OAAO,CAAA;AACrC,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,MAAA,IAAU,gBAAA,CAAiB,MAAM,MAAM,CAAA;AAC5D,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,IAAA,EAAM,OAAO,CAAA;AAEpC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,IAAS,IAAA,CAAK,EAAA,IAAM,MAAA;AACxC,EAAA,MAAM,GAAA,GAAgB,CAAC,CAAA,GAAA,EAAM,KAAK,WAAM,MAAA,CAAO,MAAM,IAAI,EAAE,CAAA;AAG3D,EAAA,GAAA,CAAI,KAAK,CAAA,iBAAA,EAAoB,kBAAA,CAAmB,MAAA,CAAO,UAAU,CAAC,CAAA,CAAE,CAAA;AACpE,EAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW,GAAA,CAAI,KAAK,CAAA,gBAAA,EAAmB,IAAA,CAAK,OAAO,CAAA,EAAA,CAAI,CAAA;AAC5E,EAAA,MAAM,MAAA,GAAS,OAAO,OAAA,CAAQ,MAAA;AAC9B,EAAA,IAAI,MAAM,OAAA,CAAQ,MAAM,CAAA,IAAK,MAAA,CAAO,SAAS,CAAA,EAAG;AAC9C,IAAA,GAAA,CAAI,IAAA;AAAA,MACF,gBAAgB,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,KAAK,MAAA,CAAO,CAAC,CAAC,CAAA,EAAA,CAAI,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,4BAAA,EAA0B,IAAA,CAAK,UAAU,OAAO,CAAA,EAAA;AAAA,KAClH;AAAA,EACF;AACA,EAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAYX,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,IAAA,EAAM,MAAM,CAAA;AAC1C,EAAA,MAAM,KAAA,GAAQ,gBAAgB,MAAM,CAAA;AACpC,EAAA,MAAM,MAAA,GACJ,MAAA,CAAO,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,KAAK,CAAA,IACnC,OAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,aAAa,QAAQ,CAAA;AAE5C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,UAAU,MAAA,EAAQ;AAUpB,MAAA,MAAM,YAAsB,EAAC;AAC7B,MAAA,KAAA,MAAW,MAAA,IAAU,MAAM,KAAA,EAAO;AAChC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,QAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,QAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW;AAChD,QAAA,IAAI,MAAM,IAAA,KAAS,SAAA,CAAU,KAAK,CAAA,EAAG,SAAA,CAAU,KAAK,MAAM,CAAA;AAAA,MAC5D;AAKA,MAAA,IAAI,UAAU,MAAA,KAAW,KAAA,CAAM,KAAA,CAAM,MAAA,YAAkB,KAAA,EAAM;AAC7D,MAAA,KAAA,MAAW,MAAA,IAAU,MAAM,KAAA,EAAO;AAChC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,QAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,QAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW;AAChD,QAAA,IAAI,SAAA,CAAU,QAAA,CAAS,MAAM,CAAA,EAAG;AAChC,QAAA,MAAM,QAAA,GAAW,cAAc,QAAA,CAAS,KAAK,EAAE,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA;AAC9D,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,CAAA,IAAA,EAAO,MAAM,CAAA,UAAA,EAAQ,KAAA,CAAM,IAAI,CAAA,EAAA,EAAK,QAAA,KAAa,OAAA,GAAU,iBAAA,GAAe,EAAE,CAAA;AAAA,SAC9E;AACA,QAAA,MAAM,OAAA,GAAU,SAAA,CAAU,KAAA,EAAO,KAAA,CAAM,IAAI,CAAA;AAC3C,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,OAAA,KAAY,IAAA,GACR,CAAA,gBAAA,EAAmB,OAAO,KAC1B,QAAA,KAAa,OAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAKX,CAAA,qEAAA,EAAmE,KAAA,CAAM,IAAI,CAAA,UAAA,EAAa,MAAM,IAAI,CAAA,+CAAA;AAAA,cACpG;AAAA,SACR;AACA,QAAA,MAAM,OAAA,GAAU,SAAA,CAAU,KAAA,EAAO,KAAK,CAAA;AACtC,QAAA,IAAI,OAAA,KAAY,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AACtC,QAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,QAAA,GAAA,CAAI,KAAK,YAAY,CAAA;AACrB,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,SAAS,KAAA,EAAO;AAAA,YACd,SAAS,KAAA,CAAM,IAAA;AAAA,YACf,MAAA,EAAQ,YAAY,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC;AAAA,WAC3D;AAAA,SACH;AACA,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,QAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,MACb;AACA,MAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AAGxB,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,CAAC,CAAW,CAAA;AAChD,QAAA,MAAM,KACJ,KAAA,KAAU,MAAA,GAAY,sBAAsB,CAAA,EAAA,EAAK,SAAA,CAAU,KAAK,CAAC,CAAA,EAAA,CAAA;AACnE,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,CAAA,qBAAA,EAAwB,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,EAAA,CAAI,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,oBAAe,EAAE,CAAA,CAAA;AAAA,SACtF;AACA,QAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,MACb;AACA,MAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,MAAM,CAAC,CAAA;AACjC,IAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,EACb;AAGA,EAAA,GAAA,CAAI,KAAK,cAAc,CAAA;AACvB,EAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,EAAA,GAAA,CAAI,IAAA,CAAK,aAAA,CAAc,KAAK,CAAC,CAAA;AAC7B,EAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,CAAA,EAAG,GAAA,CACV,IAAA,CAAK,IAAI,CAAA,CACT,OAAA,CAAQ,SAAA,EAAW,MAAM,CAAA,CACzB,OAAA,EAAS;AAAA;AAAA,GACd;AACF;AAEA,SAAS,mBAAmB,KAAA,EAAyC;AACnE,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAK,KAAK,CAAA,+BAAA,CAAA;AAChD,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AACjD,IAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,KAAK,CAAA,IAAA,EAAO,IAAI,CAAA,CAAE,CAAA;AAClC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,QAAQ,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,CAC9B,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,KAAK,CAAA,KAAM,KAAK,IAAI,CAAA,OAAA,EAAU,KAAK,CAAA,EAAA,CAAI,CAAA,CACnD,KAAK,IAAI,CAAA;AACZ,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,KAAK,CAAA,UAAA,EAAQ,KAAK,CAAA,CAAE,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,KAAA,CAAM,KAAK,QAAK,CAAA;AACzB","file":"chunk-5KJKJOFC.js","sourcesContent":["// ═══════════════════════════════════════════════════════════════════════════\n// THE DIAGRAM SEAM — now a translation, not a drawing.\n//\n// This file used to hold a SECOND mermaid renderer, standing in until\n// `chartMermaid` grew an options bag. It grew one, so the swap this banner\n// promised has happened: `drawTask` is the report's door onto the one renderer\n// in `../compile`, and the two facts a report needs on top of the chart —\n// WHERE THE TASK IS NOW and WHICH EDGES IT WALKED — are options on that\n// drawing rather than a drawing of their own.\n//\n// The seam itself is unchanged and is why the swap was one function wide: the\n// report's markdown layout, its vocabulary and its timeline do not know how a\n// diagram is made.\n//\n// WHY THIS FILE STILL EXISTS rather than the report calling `chartMermaid`\n// directly. `chartMermaid` is typed `<const C extends Chart<C>>` — the\n// F-bounded literal chart, whose state and event names are literal types the\n// compiler recovered from a source literal. A report draws an `ImportedChart`,\n// whose every name is a runtime `string` read out of somebody's\n// `workflow.json`. That widening is real and it is not the report's to make at\n// eight call sites: it is made here, once, with the reason written next to it.\n// ═══════════════════════════════════════════════════════════════════════════\nimport { chartMermaid, type WalkCounts } from \"../compile\";\nimport type { ImportedChart } from \"./workflow\";\n\nexport { edgeKey, type WalkCounts } from \"../compile\";\n\nexport interface DrawOptions {\n  /** The state the task is in right now — lit. */\n  readonly current?: string;\n  /** Edges the log actually walked, keyed `${from}|${event}|${to}`. */\n  readonly walked?: WalkCounts;\n}\n\n/**\n * One task's region as a mermaid `stateDiagram-v2` block, with the current node\n * lit, the walked edges marked and the two endings drawn apart.\n *\n * `polarity` is always on: a lane's whole point is that `shipped` and `frozen`\n * are not the same ending, and a report that painted them alike would be lying\n * in the place a reader looks first. It is an OPTION on the renderer rather\n * than a default because a chart drawing is something a reviewer approves —\n * see `ChartMermaidOptions.polarity`.\n */\nexport function drawTask(chart: ImportedChart, opts: DrawOptions = {}): string {\n  return chartMermaid(chart as never, {\n    polarity: true,\n    ...(opts.current === undefined ? {} : { highlight: opts.current }),\n    ...(opts.walked === undefined ? {} : { walked: opts.walked }),\n  });\n}\n\n/**\n * The edges a log walked, counted — the input `drawTask` marks from.\n *\n * Reads each step's DECLARED `edge` rather than recomputing one from\n * `from`/`event`/`to`: a resume edge is drawn to its fallback and walked to\n * wherever `was` pointed, so the observed target names an edge the drawing does\n * not have. `TimelineStep.edge` is the edge that actually fired.\n */\nexport function walkedEdges(\n  steps: readonly { readonly edge: string }[],\n): WalkCounts {\n  const counts = new Map<string, number>();\n  for (const step of steps) {\n    counts.set(step.edge, (counts.get(step.edge) ?? 0) + 1);\n  }\n  return counts;\n}\n","// ═══════════════════════════════════════════════════════════════════════════\n// THE IMPORTER — one `workflow.json` in, one chart per task out.\n//\n// This is the mirror of `kamp-us/phoenix` `packages/fabrika-cli/src/lane/\n// machine.ts`, and it is deliberately STRUCTURAL in exactly the same three\n// places, because that is what makes the two agree:\n//\n//   an `on` string           → `{ target }`\n//   an `on` two-arm array    → `{ target, when, otherwise }`   (guarded)\n//   a target of `type: \"history\"` → `{ resume: { fallback: <region initial> } }`\n//   `type: \"final\"`          → `end: true`\n//   …reached as an array's fallthrough → `end: \"error\"`\n//   machine-level `type: \"parallel\"` → a phase; its `onDone` pair → the terminals\n//\n// GRAMMAR, NEVER VOCABULARY. Every rule above is about what makes a document\n// WELL-FORMED — a state routes events to targets, a guarded edge is a two-arm\n// array, a `history` target means resume, a `final` is terminal. None of them\n// is about WHICH NAMES a consumer chose. So the event alphabet is read OFF the\n// document: a name a state declares is, by definition, an event of that\n// document, and there is no list here for it to be absent from.\n//\n// That is not a relaxation for its own sake. This file used to carry a consumer's\n// six event names as a closed set, which meant one upstream commit adding a\n// seventh took the importer offline for every document, not just the new one —\n// the same failure mode the report had when it matched STATE names, and the same\n// fix: enforce the shape, read the names.\n//\n// No guard name and no action name is ever dereferenced here, for the same\n// reason fabrika does not dereference them: the ARRAY is the guard. The name\n// travels into the chart's `when` because the chart draws it, and the fold\n// applies the one inline predicate (`retries < maxRetries`) the compiler\n// applies, whatever the name says. An event name is the same kind of thing.\n// ═══════════════════════════════════════════════════════════════════════════\n\nimport type { EventOrigin } from \"../graph\";\n\n/** `TASK_1.DONE` and `DONE` are the same event; the namespace is presentation. */\nexport const bareEvent = (event: string): string => {\n  const dot = event.indexOf(\".\");\n  return dot === -1 ? event : event.slice(dot + 1);\n};\n\n// ── the imported chart's shape ─────────────────────────────────────────────\n//\n// RUNTIME-TYPED, and the doc comment on `chartFromWorkflow` says why. These\n// interfaces are the chart's VALUE shape narrowed to the three edge forms a\n// fabrika region can produce — not `Chart<C>`, whose whole content is literal\n// types recovered from a literal the compiler can see.\n\n/** A declarative edge, in the only three forms a lane region can produce. */\n/**\n * `cmd` / `otherwiseCmd` are carried but never AUTHORED here: a `workflow.json`\n * declares no effects, so an imported edge simply has neither. They exist\n * because the TYPED door has them and lowering used to drop them, which left a\n * lane page able to say where a click LANDS and never what it FIRES — a fact\n * the author wrote down, lost in translation.\n */\ntype ImportedCmds = {\n  readonly cmd?: string | readonly string[];\n  readonly otherwiseCmd?: string | readonly string[];\n};\n\nexport type ImportedEdge =\n  | ({ readonly target: string } & ImportedCmds)\n  | ({\n      readonly target: string;\n      readonly when: string;\n      readonly otherwise: string;\n    } & ImportedCmds)\n  | ({ readonly resume: { readonly fallback: string } } & ImportedCmds);\n\nexport interface ImportedNode {\n  readonly initial?: true;\n  readonly on?: Readonly<Record<string, ImportedEdge>>;\n  /** `true` success final, `\"error\"` the fallthrough final that trips the lane. */\n  readonly end?: true | \"error\";\n}\n\n/** One task's region, as a chart value. One phase group, named by the phase. */\nexport interface ImportedChart {\n  readonly events: Readonly<\n    Record<\n      string,\n      {\n        readonly scope: \"edges\";\n        /**\n         * Where this event comes from — the chart's `from`, at runtime.\n         *\n         * OPTIONAL, and its absence is the document's honest answer:\n         * `workflow.json` records the topology and nothing about who sends\n         * what, so this is present exactly when the caller supplied it at\n         * {@link chartFromWorkflow}.\n         */\n        readonly from?: EventOrigin;\n      }\n    >\n  >;\n  readonly states: Readonly<\n    Record<string, Readonly<Record<string, ImportedNode>>>\n  >;\n  /**\n   * State name → the events that state ACCEPTS AND DROPS, leaving itself alone.\n   *\n   * THE THIRD ANSWER. A lane state either routes an event, or refuses it, or\n   * cannot replay it — tea's runtime has always had all three (`compile`'s\n   * `refused` self-loops a pair the state's `ignore` names or the event's\n   * `scope` does not address, and only a LIVE-but-undecided pair throws), and\n   * the lowered chart could carry only two. So `stepTask` threw\n   * `UnreplayableLogError` on a log `runLane` had accepted without blinking: a\n   * run and a report of that run disagreeing, which is the one thing this\n   * module promises they cannot do.\n   *\n   * IT IS ON THE CHART, NOT ON THE NODE, and that is deliberate.\n   * {@link ImportedNode} is a MIRROR of the node fabrika's own compiler emits —\n   * `golden.test.ts` compares the two — so a field fabrika never produces does\n   * not belong inside it. This is our layer's annotation about someone else's\n   * shape, and it sits one level out where it reads as one.\n   *\n   * ABSENT AT THE IMPORTED DOOR, always. A refusal is a fact about a state's\n   * `ignore` and an event's `scope`, and `workflow.json` records neither — so\n   * `chartFromWorkflow` writes none, an imported chart is the same value it\n   * always was, and an imported log naming an unrouted event is still refused\n   * loudly. Only `defineLane`'s lowering, which can SEE the two, fills it in.\n   */\n  readonly refusals?: Readonly<Record<string, readonly string[]>>;\n}\n\nexport interface ImportedPhase {\n  readonly name: string;\n  readonly tasks: readonly string[];\n}\n\nexport interface ImportedLane {\n  /** The document's own `id`, when it carries one. */\n  readonly id?: string;\n  /** What fires this lane — a chore workflow's own field, carried not invented. */\n  readonly trigger?: string;\n  readonly phases: readonly ImportedPhase[];\n  /** The workflow's two terminals, read off the last phase's `onDone` pair. */\n  readonly terminals: { readonly complete: string; readonly tripped: string };\n  /** One chart per task id — the ask's `charts`. */\n  readonly charts: Readonly<Record<string, ImportedChart>>;\n  /**\n   * The document's `context` per task, minus the retry bookkeeping the fold\n   * owns. `maxRetries` is split out because it is a transition input, not a\n   * passenger — the guarded arm reads it.\n   */\n  readonly context: Readonly<\n    Record<\n      string,\n      {\n        readonly maxRetries: number;\n        readonly extras: Readonly<Record<string, unknown>>;\n      }\n    >\n  >;\n}\n\n/**\n * THE ONE PLACE PROVENANCE ENTERS.\n *\n * `workflow.json` carries topology and nothing else: it says `queued --WIP-->\n * build` and it does not say, and has never said, who sends a `WIP`. That fact\n * lives in fabrika's CODE, not in fabrika's document — so it cannot be read\n * here and it must not be guessed here.\n *\n * So the caller states it, ONCE, at the seam where their world meets ours, and\n * everything downstream derives from that: the charts carry it, the report\n * groups by it, the inspector reports it. One map, at the boundary the\n * information actually crosses — not a default sprinkled through the readers,\n * and not a table of fabrika's own event names baked in as a fallback, which\n * would put us right back to owning a copy of someone else's vocabulary.\n *\n * ```ts\n * chartFromWorkflow(document, {\n *   from: {\n *     WIP: { world: \"the operator\" },\n *     BLOCKED: { world: \"the operator\" },\n *     UNBLOCKED: { world: \"a human\" },\n *     DONE: \"cmd\",\n *     PASS: \"cmd\",\n *     FAIL: \"cmd\",\n *   },\n * });\n * ```\n *\n * Omit it and every reader degrades honestly — it says which events a state\n * accepts and refuses to say who they come from.\n */\nexport interface WorkflowImportOptions {\n  /**\n   * Event name → where its Msg comes from. Keyed by the BARE name, so one\n   * entry covers every task's namespaced spelling of it (`ISSUE.WIP`,\n   * `PARK_SWEEP.WIP`) — the namespace is presentation, the event is the event.\n   *\n   * A name with no entry is left undeclared rather than defaulted. \"I do not\n   * know\" and \"the outside world\" are different answers and only one of them\n   * is safe to invent.\n   */\n  readonly from?: Readonly<Record<string, EventOrigin>>;\n  /**\n   * Refuse a `from` key that names no event THIS document routes.\n   *\n   * The silent drop it closes is real: `UNBLOKED: { world: \"a human\" }` imports\n   * clean, and every reader downstream then answers \"the chart does not say\"\n   * for the one event the caller had just taken the trouble to declare. The\n   * cross-check needs no list of ours — {@link eventAlphabet} derives the\n   * document's own alphabet, which is precisely what that function exists for\n   * and what nothing was calling.\n   *\n   * OPT-IN, because the map is legitimately WIDER than one document. A\n   * consumer's cast is a property of their world, not of one template, so one\n   * `from` covers every workflow they run — `src/chart/report/__fixtures__/\n   * origins.ts` states fabrika's six once and imports two templates with it,\n   * and the chore template routes neither `PASS` nor `FAIL`. Defaulting to\n   * strict would make sharing a cast an error, which is the wrong half of the\n   * trade. So the caller says which of the two they meant: pass this when the\n   * map was written FOR this document, and a typo in it stops compiling.\n   */\n  readonly strictFrom?: true;\n}\n\n/**\n * The document does not fit — with EVERY defect named, never a half-import.\n *\n * Same contract as fabrika's `Malformed`: a `workflow.json` that cannot be\n * compiled comes back as a list of reasons rather than as a machine that works\n * for some states. Thrown rather than returned because the chart module's other\n * doors throw too (`initialStateOf`, `CellTargetError`) and an importer that\n * returned a union would be the only one a caller could forget to check.\n */\nexport class WorkflowImportError extends Error {\n  override readonly name = \"WorkflowImportError\";\n  readonly _tag = \"WorkflowImportError\" as const;\n  constructor(public readonly defects: readonly string[]) {\n    super(\n      `@demlik/tea: this workflow.json does not compile to charts —\\n` +\n        defects.map((d) => `  • ${d}`).join(\"\\n\"),\n    );\n  }\n}\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === \"object\" && v !== null && !Array.isArray(v);\n\nconst nodeType = (node: unknown): string | undefined =>\n  isRecord(node) && typeof node.type === \"string\" ? node.type : undefined;\n\n/**\n * The retry budget a document inherits when its `context` names none.\n *\n * Exported because the fold needs the same number when it boots a task the\n * document's `context` never mentioned, and a default spelled in two files is\n * a default that drifts in one of them.\n */\nexport const RETRY_BUDGET = 2;\n\n/**\n * The `when` a guarded arm carries when the document names no guard.\n *\n * A DESCRIPTION OF THE GRAMMAR, not a borrowed name. A two-arm array means\n * \"retry while the budget holds, else fall through\" in every document, because\n * that is what the array IS — so when the author wrote no label, the label says\n * the thing the array already said. Defaulting to some consumer's guard name\n * (`retriesRemaining`) would print their word over another consumer's document.\n */\nconst DEFAULT_GUARD = \"retries remain\";\n\ninterface RegionImport {\n  readonly node?: Readonly<Record<string, ImportedNode>>;\n  readonly defects: readonly string[];\n}\n\n/** One task region → the phase group's state bag. `hist` is DROPPED, not kept. */\nfunction importRegion(taskId: string, region: unknown): RegionImport {\n  const defects: string[] = [];\n  if (\n    !isRecord(region) ||\n    !isRecord(region.states) ||\n    typeof region.initial !== \"string\"\n  ) {\n    return {\n      defects: [\n        `task \"${taskId}\": region must carry string \\`initial\\` and \\`states\\``,\n      ],\n    };\n  }\n  const states = region.states;\n  const initialState = region.initial;\n  if (states[initialState] === undefined) {\n    defects.push(\n      `task \"${taskId}\": initial state \"${initialState}\" is not in \\`states\\``,\n    );\n  }\n\n  // Pass 1: which names are finals at all. The polarity needs the whole set\n  // before any edge is read, because an error final is recognised by the edge\n  // that REACHES it and the edge may be declared before the state.\n  const finals = new Set<string>();\n  for (const [name, node] of Object.entries(states)) {\n    if (nodeType(node) === \"final\") finals.add(name);\n  }\n  const errorFinals = new Set<string>();\n\n  // Pass 2: the edges.\n  const on: Record<string, Record<string, ImportedEdge>> = {};\n  for (const [stateName, node] of Object.entries(states)) {\n    // `hist` IS a state node in the document and is NOT a chart state: the\n    // chart carries history as a property of the EDGE (`resume`), which is why\n    // it needs no pseudo-state to point at. Dropping it here is the same drop\n    // fabrika's compiler makes, one line above its own table build.\n    if (nodeType(node) === \"history\") continue;\n    const edges: Record<string, ImportedEdge> = {};\n    on[stateName] = edges;\n    if (!isRecord(node)) {\n      defects.push(`task \"${taskId}\": state \"${stateName}\" is not an object`);\n      continue;\n    }\n    const raw = node.on ?? {};\n    if (!isRecord(raw)) {\n      defects.push(\n        `task \"${taskId}\": state \"${stateName}\" carries a non-object \\`on\\``,\n      );\n      continue;\n    }\n    // Which bare name each spelling in THIS state collapsed to, so the one\n    // event-name rule that IS grammatical can be checked: a state holds one\n    // cell per event, so two spellings of one event in one state is a document\n    // that means two things by the same edge. Nothing here cares WHICH names.\n    const spelledAs = new Map<string, string>();\n    for (const [eventName, transition] of Object.entries(raw)) {\n      const event = bareEvent(eventName);\n      if (event === \"\") {\n        defects.push(\n          `task \"${taskId}\": state \"${stateName}\" listens for \"${eventName}\", which names no event once its namespace is stripped`,\n        );\n        continue;\n      }\n      const already = spelledAs.get(event);\n      if (already !== undefined) {\n        defects.push(\n          `task \"${taskId}\": state \"${stateName}\" spells the same event twice — \"${already}\" and \"${eventName}\" are both \\`${event}\\`, and a state routes each event once`,\n        );\n        continue;\n      }\n      spelledAs.set(event, eventName);\n\n      // ── the guarded array ────────────────────────────────────────────────\n      if (Array.isArray(transition)) {\n        const arms = transition.map((arm) =>\n          isRecord(arm) && typeof arm.target === \"string\"\n            ? arm.target\n            : undefined,\n        );\n        const [retry, fallthrough] = arms;\n        if (\n          transition.length !== 2 ||\n          retry === undefined ||\n          fallthrough === undefined\n        ) {\n          defects.push(\n            `task \"${taskId}\": guarded \"${eventName}\" must be a two-arm array of \\`{target}\\` — [retry-while-retries-remain, else-fallthrough]`,\n          );\n          continue;\n        }\n        for (const target of [retry, fallthrough]) {\n          if (states[target] === undefined) {\n            defects.push(\n              `task \"${taskId}\": \"${eventName}\" targets unknown state \"${target}\"`,\n            );\n          }\n        }\n        // THE POLARITY, recognised exactly where fabrika recognises it: a final\n        // reached as the fallthrough is the task's error terminal.\n        if (finals.has(fallthrough)) errorFinals.add(fallthrough);\n        const head = transition[0];\n        const when =\n          isRecord(head) && typeof head.guard === \"string\"\n            ? head.guard\n            : DEFAULT_GUARD;\n        edges[event] = { target: retry, when, otherwise: fallthrough };\n        continue;\n      }\n\n      if (typeof transition !== \"string\") {\n        defects.push(\n          `task \"${taskId}\": \"${eventName}\" is neither a target nor a guarded array`,\n        );\n        continue;\n      }\n      if (states[transition] === undefined) {\n        defects.push(\n          `task \"${taskId}\": \"${eventName}\" targets unknown state \"${transition}\"`,\n        );\n        continue;\n      }\n      // ── the history target ───────────────────────────────────────────────\n      edges[event] =\n        nodeType(states[transition]) === \"history\"\n          ? { resume: { fallback: initialState } }\n          : { target: transition };\n    }\n  }\n\n  if (defects.length > 0) return { defects };\n\n  const out: Record<string, ImportedNode> = {};\n  for (const [name, node] of Object.entries(states)) {\n    if (nodeType(node) === \"history\") continue;\n    const edges = on[name] ?? {};\n    const isFinal = finals.has(name);\n    out[name] = {\n      ...(name === initialState ? { initial: true as const } : {}),\n      ...(Object.keys(edges).length > 0 ? { on: edges } : {}),\n      ...(isFinal\n        ? { end: errorFinals.has(name) ? (\"error\" as const) : (true as const) }\n        : {}),\n    };\n  }\n  return { node: out, defects: [] };\n}\n\n/** The two targets of a phase's `onDone` pair: `[guarded success, fallthrough]`. */\nfunction onDoneTargets(\n  phaseName: string,\n  onDone: unknown,\n): { targets?: readonly [string, string]; defect?: string } {\n  const defect = `phase \"${phaseName}\": \\`onDone\\` must be a two-arm array of \\`{target}\\` — [{target, guard}, {target}]`;\n  if (!Array.isArray(onDone) || onDone.length !== 2) return { defect };\n  const [success, trip] = onDone.map((arm) =>\n    isRecord(arm) && typeof arm.target === \"string\" ? arm.target : undefined,\n  );\n  return success === undefined || trip === undefined\n    ? { defect }\n    : { targets: [success, trip] as const };\n}\n\n/**\n * `workflow.json` → one chart per task, plus the phase topology around them.\n *\n * WHICH HALF GUARANTEES WHAT — this matters, and it is the whole reason the\n * authored fixture (`src/chart/__fixtures__/lane.ts`) still exists beside this\n * function rather than being deleted in its favour:\n *\n *   THIS FUNCTION gives you FIDELITY. It reads bytes that only exist at\n *   runtime, so its result is `ImportedChart` — states, events and targets are\n *   `string`, and nothing about them is checked before the process starts. What\n *   it buys is that the drawing is of THE document the driver is actually\n *   folding, including a `workflow.json` this repo has never seen.\n *\n *   THE AUTHORED FIXTURE gives you TYPES. `lane.ts` is the same machine written\n *   as a literal, so `StateName`, `ResumeTargets`, `Assigns` and the totality\n *   obligation are all real there, and `assert.test-d.ts` pins them. What it\n *   cannot do is follow a document it was not written against.\n *\n * Neither replaces the other. The golden test is the seam: it asserts this\n * importer's edge set against what fabrika's own compiler produces for the same\n * file, so the runtime-typed half stays honest about the literal-typed one.\n *\n * @param document the PARSED `workflow.json` — `JSON.parse`'s output, not text.\n * @param options  {@link WorkflowImportOptions} — the facts the document does\n *                 not carry, stated once at the boundary they enter through.\n * @throws {WorkflowImportError} with every defect named, never a half-import.\n */\nexport function chartFromWorkflow(\n  document: unknown,\n  options: WorkflowImportOptions = {},\n): ImportedLane {\n  const defects: string[] = [];\n  const machineDef = isRecord(document) ? document.machine : undefined;\n  if (!isRecord(machineDef) || !isRecord(machineDef.states)) {\n    throw new WorkflowImportError([\n      \"document must carry a `machine.states` object\",\n    ]);\n  }\n  const documentContext = isRecord(machineDef.context)\n    ? machineDef.context\n    : {};\n  const declaredTrigger = isRecord(document) ? document.trigger : undefined;\n  if (declaredTrigger !== undefined && typeof declaredTrigger !== \"string\") {\n    defects.push(\n      \"document `trigger` must be a string naming what fires this lane\",\n    );\n  }\n\n  const machineStates = machineDef.states;\n  const charts: Record<string, ImportedChart> = {};\n  const context: Record<\n    string,\n    {\n      readonly maxRetries: number;\n      readonly extras: Readonly<Record<string, unknown>>;\n    }\n  > = {};\n  const phases: ImportedPhase[] = [];\n  const gateTargets = new Set<string>();\n  let terminals: { complete: string; tripped: string } | undefined;\n\n  for (const [phaseName, node] of Object.entries(machineStates)) {\n    if (nodeType(node) !== \"parallel\" || !isRecord(node)) continue;\n    const regions = node.states;\n    if (!isRecord(regions) || Object.keys(regions).length === 0) {\n      defects.push(\n        `phase \"${phaseName}\": a parallel phase must carry task regions in \\`states\\``,\n      );\n      continue;\n    }\n    const phaseTasks: string[] = [];\n    for (const [taskId, region] of Object.entries(regions)) {\n      const imported = importRegion(taskId, region);\n      defects.push(...imported.defects);\n      if (imported.node !== undefined) {\n        const events: Record<\n          string,\n          { readonly scope: \"edges\"; readonly from?: EventOrigin }\n        > = {};\n        for (const edges of Object.values(imported.node)) {\n          for (const event of Object.keys(edges.on ?? {})) {\n            // The caller's map is the ONLY source of `from` — read once, here,\n            // and written onto the event. Absent stays absent.\n            const origin = options.from?.[event];\n            events[event] =\n              origin === undefined\n                ? { scope: \"edges\" }\n                : { scope: \"edges\", from: origin };\n          }\n        }\n        // ONE group, named by the phase. The authored twin splits the same\n        // states into working/parked/done, and that split is an AUTHORING\n        // choice the document does not record — inventing it here would be\n        // manufacturing knowledge the source does not have. It costs nothing:\n        // every event is `scope: \"edges\"` (a lane state either routes an event\n        // or refuses it), and with no broadcast scope the grouping carries no\n        // obligation to carry.\n        charts[taskId] = { events, states: { [phaseName]: imported.node } };\n      }\n      const ctx = documentContext[taskId];\n      const bag = isRecord(ctx) ? ctx : {};\n      const { maxRetries: rawMax, retries: _retries, ...extras } = bag;\n      context[taskId] = {\n        maxRetries: typeof rawMax === \"number\" ? rawMax : RETRY_BUDGET,\n        extras,\n      };\n      phaseTasks.push(taskId);\n    }\n    phases.push({ name: phaseName, tasks: phaseTasks });\n\n    const gate = onDoneTargets(phaseName, node.onDone);\n    if (gate.defect !== undefined) defects.push(gate.defect);\n    if (gate.targets !== undefined) {\n      for (const target of gate.targets) {\n        gateTargets.add(target);\n        if (machineStates[target] === undefined) {\n          defects.push(\n            `phase \"${phaseName}\": \\`onDone\\` targets unknown machine-level state \"${target}\"`,\n          );\n        }\n      }\n      // Every phase names the same trip terminal; the LAST phase's success\n      // target is the workflow's complete terminal, because earlier ones target\n      // the next phase.\n      terminals = { complete: gate.targets[0], tripped: gate.targets[1] };\n    }\n  }\n\n  // A machine-level state the loop above did not import is a terminal or a\n  // defect — never dropped silently.\n  for (const [name, node] of Object.entries(machineStates)) {\n    if (nodeType(node) === \"parallel\" && isRecord(node)) continue;\n    if (nodeType(node) !== \"final\") {\n      defects.push(\n        `machine-level state \"${name}\" is neither a \\`parallel\\` phase nor a \\`final\\` terminal`,\n      );\n    } else if (!gateTargets.has(name)) {\n      defects.push(\n        `machine-level final \"${name}\" is targeted by no phase's \\`onDone\\` pair`,\n      );\n    }\n  }\n  if (phases.length === 0)\n    defects.push(\"machine holds no `parallel` phase state\");\n  if (defects.length > 0) throw new WorkflowImportError(defects);\n  if (terminals === undefined) {\n    throw new WorkflowImportError([\n      \"no phase carried a readable `onDone` pair\",\n    ]);\n  }\n\n  const id =\n    isRecord(document) && typeof document.id === \"string\"\n      ? document.id\n      : undefined;\n  const lane: ImportedLane = {\n    ...(id === undefined ? {} : { id }),\n    ...(typeof declaredTrigger === \"string\"\n      ? { trigger: declaredTrigger }\n      : {}),\n    phases,\n    terminals,\n    charts,\n    context,\n  };\n\n  // THE `from` MAP, CROSS-CHECKED — `eventAlphabet` exists for exactly this\n  // and nothing was calling it. The alphabet is DERIVED from the document, so\n  // this compares the caller's claim against the document itself rather than\n  // against a list of ours. See `strictFrom` for why it is the caller's call.\n  if (options.strictFrom === true) {\n    const declared = new Set(eventAlphabet(lane));\n    const strays = Object.keys(options.from ?? {}).filter(\n      (event) => !declared.has(event),\n    );\n    if (strays.length > 0) {\n      throw new WorkflowImportError(\n        strays.map(\n          (event) =>\n            `\\`from\\` names \"${event}\", which no state in this document routes — the map is keyed by the BARE event name`,\n        ),\n      );\n    }\n  }\n  return lane;\n}\n\n/** Parse and import in one step — for a caller holding the document's bytes. */\nexport function chartFromWorkflowText(\n  text: string,\n  options: WorkflowImportOptions = {},\n): ImportedLane {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(text);\n  } catch {\n    throw new WorkflowImportError([\"the document is not JSON\"]);\n  }\n  return chartFromWorkflow(parsed, options);\n}\n\n// ── reading a chart back ───────────────────────────────────────────────────\n\n/** Every state in an imported chart, flattened out of its one phase group. */\nexport function statesOf(\n  chart: ImportedChart,\n): ReadonlyMap<string, ImportedNode> {\n  const out = new Map<string, ImportedNode>();\n  for (const group of Object.values(chart.states)) {\n    for (const [name, node] of Object.entries(group)) out.set(name, node);\n  }\n  return out;\n}\n\n/** The state marked `initial: true`. */\nexport function initialOf(chart: ImportedChart): string {\n  for (const [name, node] of statesOf(chart)) {\n    if (node.initial === true) return name;\n  }\n  throw new Error(\"@demlik/tea: imported chart marks no initial state\");\n}\n\n/**\n * Every event name this lane declares, in first-declaration order.\n *\n * THE ALPHABET, DERIVED — the answer a caller used to get from a constant in\n * this file listing one consumer's six. It is a fact about the document, so it\n * is read from the document: the bare names its states route, deduplicated\n * across tasks and phases. A consumer that adds an event gets it here the\n * commit it lands, without a release of ours.\n *\n * Use it to build the `from` map at the import boundary and know you covered\n * every name, or to diff two revisions of a workflow for a vocabulary change.\n */\nexport function eventAlphabet(lane: ImportedLane): readonly string[] {\n  const out = new Set<string>();\n  for (const chart of Object.values(lane.charts)) {\n    for (const event of Object.keys(chart.events)) out.add(event);\n  }\n  return [...out];\n}\n\n/**\n * Where `event` comes from, or `undefined` when the chart does not say.\n *\n * The ONE read of provenance, so a reader that wants to group by origin and a\n * reader that wants to label one event cannot disagree about what \"undeclared\"\n * looks like.\n */\nexport function originOf(\n  chart: ImportedChart,\n  event: string,\n): EventOrigin | undefined {\n  return chart.events[event]?.from;\n}\n\n/** `true` success, `\"error\"` tripped, `false` not a final — the ONE polarity read. */\nexport function endPolarityOf(\n  node: ImportedNode | undefined,\n): true | \"error\" | false {\n  if (node?.end === undefined) return false;\n  return node.end;\n}\n","// ═══════════════════════════════════════════════════════════════════════════\n// THE FOLD — `events.jsonl` in, per-task leaf states out, from scratch.\n//\n// The mirror of `packages/fabrika-cli/src/lane/fold.ts`. It is here for two\n// reasons and neither is \"because we might as well\":\n//\n//   1. THE TIMELINE. `lane history` returns the log verbatim and deliberately\n//      does NOT store `from → to` — those are reconstructible by folding, so\n//      storing them would be a second copy of a derived fact. Reconstructing\n//      them is therefore the reader's job, and the reader needs a fold to do\n//      it. Because the fold is a LEFT fold that is pure over a prefix, the\n//      state before step k is exactly `foldLog(entries.slice(0, k))` — time\n//      travel that is exact rather than approximated.\n//\n//   2. THE FILE PATH. A caller holding only `workflow.json` + `events.jsonl`\n//      has no `lane status` output to be handed. It derives one.\n//\n// The transition semantics below are fabrika's, verbatim in behaviour: the\n// guard is the one inline `retries < maxRetries` (the guard NAME in the\n// document is inert data, never dereferenced), a resume lands on `was ?? the\n// region's initial` and does NOT rewrite `was`, and every other edge records\n// `was = the state you left`.\n// ═══════════════════════════════════════════════════════════════════════════\nimport { edgeKey } from \"./draw\";\nimport {\n  bareEvent,\n  endPolarityOf,\n  type ImportedChart,\n  type ImportedLane,\n  initialOf,\n  RETRY_BUDGET,\n  statesOf,\n} from \"./workflow\";\n\n/**\n * The edge a step DREW, keyed as {@link edgeKey} spells it.\n *\n * ONE DECLARATION SITE for the resume rule, and that is the whole reason it is\n * a function rather than four lines inside {@link timeline}. A resume edge is\n * DRAWN once, to its fallback, and WALKED to wherever `was` pointed — so\n * recovering \"which edge lit up\" from the observed target lands on an edge the\n * drawing does not have. Any reader that knows `from`/`event`/`to` and wants\n * the drawn edge (a folded log's timeline; a live lane's recorded tape) asks\n * here, so the two cannot disagree about which edge to thicken.\n */\nexport function walkedEdgeKey(\n  chart: ImportedChart,\n  from: string,\n  event: string,\n  to: string,\n): string {\n  const declared = statesOf(chart).get(from)?.on?.[event];\n  const drawn =\n    declared !== undefined && \"resume\" in declared\n      ? declared.resume.fallback\n      : to;\n  return edgeKey(from, event, drawn);\n}\n\n/** One appended line of `events.jsonl`: which task, which event, when. */\nexport interface LogEntry {\n  readonly task: string;\n  readonly event: string;\n  readonly at: string;\n}\n\n/** One task's folded state: the leaf, the retry budget, and the state it left. */\nexport interface TaskState {\n  readonly type: string;\n  readonly retries: number;\n  readonly maxRetries: number;\n  readonly was?: string;\n}\n\n/**\n * The derived answer `lane status` prints — reproduced here field for field,\n * because a report that computed its own vocabulary would contradict the driver\n * the moment the two disagreed.\n */\nexport interface LaneStatus {\n  readonly stateValue:\n    | string\n    | Readonly<Record<string, Readonly<Record<string, string>> | string>>;\n  readonly status: \"active\" | \"done\";\n  readonly context: Readonly<Record<string, unknown>>;\n}\n\n/** The log does not replay against this workflow — with the reason named. */\nexport class UnreplayableLogError extends Error {\n  override readonly name = \"UnreplayableLogError\";\n  readonly _tag = \"UnreplayableLogError\" as const;\n  constructor(public readonly defects: readonly string[]) {\n    super(\n      `@demlik/tea: this events log does not replay against this workflow —\\n` +\n        defects.map((d) => `  • ${d}`).join(\"\\n\"),\n    );\n  }\n}\n\n/**\n * Parse `events.jsonl`. A line that does not parse is a DEFECT, never a\n * silently skipped event — a report built on a log it half-read is worse than\n * no report.\n */\nexport function parseEventsJsonl(text: string): readonly LogEntry[] {\n  const defects: string[] = [];\n  const entries: LogEntry[] = [];\n  for (const [index, line] of text.split(\"\\n\").entries()) {\n    if (line.trim() === \"\") continue;\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(line);\n    } catch {\n      defects.push(`line ${index + 1} is not JSON`);\n      continue;\n    }\n    const entry = asLogEntry(parsed);\n    if (entry === undefined) {\n      defects.push(\n        `line ${index + 1} does not carry string \\`task\\`/\\`event\\`/\\`at\\``,\n      );\n      continue;\n    }\n    entries.push(entry);\n  }\n  if (defects.length > 0) throw new UnreplayableLogError(defects);\n  return entries;\n}\n\nfunction asLogEntry(value: unknown): LogEntry | undefined {\n  if (typeof value !== \"object\" || value === null) return undefined;\n  const record = value as { task?: unknown; event?: unknown; at?: unknown };\n  if (\n    typeof record.task !== \"string\" ||\n    typeof record.event !== \"string\" ||\n    typeof record.at !== \"string\"\n  ) {\n    return undefined;\n  }\n  return { task: record.task, event: record.event, at: record.at };\n}\n\n/** `lane history`'s stdout — a JSON array of the same entries, verbatim. */\nexport function parseHistoryJson(text: string): readonly LogEntry[] {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(text);\n  } catch {\n    throw new UnreplayableLogError([\"`lane history` output is not JSON\"]);\n  }\n  if (!Array.isArray(parsed)) {\n    throw new UnreplayableLogError([\n      \"`lane history` output is not a JSON array of entries\",\n    ]);\n  }\n  const entries: LogEntry[] = [];\n  for (const [index, raw] of parsed.entries()) {\n    const entry = asLogEntry(raw);\n    if (entry === undefined) {\n      throw new UnreplayableLogError([\n        `history entry ${index} does not carry string \\`task\\`/\\`event\\`/\\`at\\``,\n      ]);\n    }\n    entries.push(entry);\n  }\n  return entries;\n}\n\n/**\n * EVERY task the log names that this lane does not have, never just the first.\n *\n * The same contract {@link parseEventsJsonl} keeps one function up, and the\n * same one fabrika keeps: a log that names four tasks from a workflow the\n * caller swapped underneath it is four facts, and reporting one of them per\n * run turns one fix into four rounds of paste-the-error-back. Deduplicated by\n * name, in first-mention order — a thousand-line log naming one stale task is\n * one defect, not a thousand.\n */\nconst unknownTaskDefects = (\n  lane: ImportedLane,\n  entries: readonly LogEntry[],\n): readonly string[] => {\n  const seen = new Set<string>();\n  const defects: string[] = [];\n  for (const entry of entries) {\n    if (lane.charts[entry.task] !== undefined || seen.has(entry.task)) continue;\n    seen.add(entry.task);\n    defects.push(\n      `log names task \"${entry.task}\", which is not in this lane's machine`,\n    );\n  }\n  return defects;\n};\n\nconst chartOf = (lane: ImportedLane, taskId: string): ImportedChart => {\n  const chart = lane.charts[taskId];\n  if (chart === undefined) {\n    throw new UnreplayableLogError([\n      `log names task \"${taskId}\", which is not in this lane's machine`,\n    ]);\n  }\n  return chart;\n};\n\n/** The initial state of every task — the fold's zero. */\nexport function initialStates(\n  lane: ImportedLane,\n): Readonly<Record<string, TaskState>> {\n  const out: Record<string, TaskState> = {};\n  for (const [taskId, chart] of Object.entries(lane.charts)) {\n    out[taskId] = {\n      type: initialOf(chart),\n      retries: 0,\n      maxRetries: lane.context[taskId]?.maxRetries ?? RETRY_BUDGET,\n    };\n  }\n  return out;\n}\n\n/**\n * ONE event applied to ONE task. The three edge forms, and the two ways there\n * can be no edge.\n *\n * THERE ARE THREE ANSWERS, NOT TWO, and this used to give two. tea's runtime\n * has always distinguished a REFUSAL — an event the state accepts and drops,\n * because its `ignore` names the event or the event is broadcast to some other\n * phase — from a pair it cannot replay, which is the only one that throws. The\n * lowered chart could not carry the first, so a log the runtime had happily\n * accepted came back `UnreplayableLogError` here: a run and a report of that\n * run disagreeing about what the machine did. The refusal set now rides on the\n * chart (`ImportedChart.refusals`, written by `lowerRegion` and by nothing\n * else), so both sides refuse the same pairs by construction.\n *\n * `taskId` is for the DIAGNOSTIC only. `stepTask` folds one region and has\n * never needed to know which; a reader staring at `state \"queued\" holds no cell\n * for \"DONE\"` on a twelve-task lane needs to know very much, and the callers\n * have it.\n */\nexport function stepTask(\n  chart: ImportedChart,\n  state: TaskState,\n  event: string,\n  taskId?: string,\n): TaskState {\n  const node = statesOf(chart).get(state.type);\n  const edge = node?.on?.[event];\n  if (edge === undefined) {\n    if (chart.refusals?.[state.type]?.includes(event) === true) return state;\n    throw new UnreplayableLogError([\n      `${taskId === undefined ? \"\" : `task \"${taskId}\": `}state \"${state.type}\" holds no cell for \"${event}\"`,\n    ]);\n  }\n  if (\"resume\" in edge) {\n    // `was` is NOT rewritten: you are LEAVING the park, not entering one.\n    return { ...state, type: state.was ?? edge.resume.fallback };\n  }\n  if (\"when\" in edge) {\n    // The guard NAME is inert. This one predicate is the guard, in fabrika and\n    // here — which is exactly why the two cannot drift apart on a rename.\n    return state.retries < state.maxRetries\n      ? {\n          ...state,\n          type: edge.target,\n          retries: state.retries + 1,\n          was: state.type,\n        }\n      : { ...state, type: edge.otherwise, was: state.type };\n  }\n  return { ...state, type: edge.target, was: state.type };\n}\n\n/**\n * Fold the whole log into per-task leaf states.\n *\n * PURE OVER A PREFIX: tasks are independent regions, so the global log\n * partitions cleanly and each task folds through its own chart. `foldLane(lane,\n * entries.slice(0, k))` is therefore the exact state after k events, for every\n * k — which is what {@link timeline} spends.\n */\nexport function foldLane(\n  lane: ImportedLane,\n  entries: readonly LogEntry[],\n): Readonly<Record<string, TaskState>> {\n  const unknown = unknownTaskDefects(lane, entries);\n  if (unknown.length > 0) throw new UnreplayableLogError(unknown);\n  const states: Record<string, TaskState> = { ...initialStates(lane) };\n  for (const entry of entries) {\n    const chart = chartOf(lane, entry.task);\n    const current = states[entry.task];\n    if (current === undefined) {\n      throw new UnreplayableLogError([\n        `log names task \"${entry.task}\", which is not in this lane's machine`,\n      ]);\n    }\n    states[entry.task] = stepTask(\n      chart,\n      current,\n      bareEvent(entry.event),\n      entry.task,\n    );\n  }\n  return states;\n}\n\n/** One row of the timeline: the entry, plus the `from → to` nobody stored. */\nexport interface TimelineStep {\n  readonly index: number;\n  readonly at: string;\n  readonly task: string;\n  /** The event VERBATIM, namespace and all — the log's own spelling. */\n  readonly event: string;\n  readonly from: string;\n  readonly to: string;\n  /**\n   * The DECLARED edge this step fired, as {@link edgeKey} spells it.\n   *\n   * Not derivable from `from`/`event`/`to`, and that is the whole reason it is\n   * carried: a resume edge is DRAWN once, to its fallback, and WALKED to\n   * wherever `was` pointed. Recovering \"which edge lit up\" from the observed\n   * target would land on an edge the drawing does not have — so the step\n   * records the edge it took while it still knows.\n   */\n  readonly edge: string;\n}\n\n/**\n * The log with `from → to` recomputed per step.\n *\n * A single left-to-right pass, which is EXACTLY the prefix fold and not an\n * approximation of it: `foldLane` is a left fold over the same entries in the\n * same order, so the state carried into step k here is the state\n * `foldLane(lane, entries.slice(0, k))` returns. `fold.test.ts` asserts that\n * equality rather than asking you to take it on trust — the cheap form and the\n * definitional form, pinned to each other.\n */\nexport function timeline(\n  lane: ImportedLane,\n  entries: readonly LogEntry[],\n): readonly TimelineStep[] {\n  const unknown = unknownTaskDefects(lane, entries);\n  if (unknown.length > 0) throw new UnreplayableLogError(unknown);\n  const states: Record<string, TaskState> = { ...initialStates(lane) };\n  const steps: TimelineStep[] = [];\n  for (const [index, entry] of entries.entries()) {\n    const chart = chartOf(lane, entry.task);\n    const before = states[entry.task];\n    if (before === undefined) {\n      throw new UnreplayableLogError([\n        `log names task \"${entry.task}\", which is not in this lane's machine`,\n      ]);\n    }\n    const event = bareEvent(entry.event);\n    const after = stepTask(chart, before, event, entry.task);\n    states[entry.task] = after;\n    steps.push({\n      index,\n      at: entry.at,\n      task: entry.task,\n      event: entry.event,\n      from: before.type,\n      to: after.type,\n      edge: walkedEdgeKey(chart, before.type, event, after.type),\n    });\n  }\n  return steps;\n}\n\n/**\n * Where one phase stands. The four are exhaustive over a phase in a lane whose\n * log has been folded, and they are POSITIONAL rather than local: a phase whose\n * tasks all happen to be final is `\"waiting\"` if an earlier phase stopped the\n * lane before it could have run.\n */\nexport type PhaseStanding = \"complete\" | \"tripped\" | \"active\" | \"waiting\";\n\n/** One phase, and where it stands after the fold. */\nexport interface PhaseStand {\n  readonly name: string;\n  /** Its position in the sequence — the phase order, as a number. */\n  readonly index: number;\n  readonly tasks: readonly string[];\n  readonly standing: PhaseStanding;\n  /** The tasks in this phase that landed on an ERROR final. */\n  readonly tripped: readonly string[];\n}\n\n/**\n * The ONE thing the phase walk reads off a task: which state it is standing in.\n *\n * {@link TaskState} satisfies it, and so does a RUNNING region's own\n * `StateOf<chart>` — which is the whole reason the parameter is spelled this\n * loosely. The fold and the runtime carry different per-task values (the fold's\n * carries `retries`, a region's carries its `ctx`), and the advancement rule\n * reads neither: it reads `type`, looks the node up in the chart, and asks its\n * `end` polarity. Widening the parameter to what the rule ACTUALLY reads is what\n * lets {@link phaseStandings} be called by both without a second copy of it.\n */\nexport type LeafStates = Readonly<Record<string, { readonly type: string }>>;\n\n/** Every task at an error final — the `errors` list, one declaration site. */\nexport function trippedTasks(\n  lane: ImportedLane,\n  states: LeafStates,\n): readonly string[] {\n  return Object.keys(states).filter(\n    (taskId) => endPolarityOf(nodeOf(lane, taskId, states)) === \"error\",\n  );\n}\n\n/**\n * THE PHASE WALK — the one loop that decides which phase is running, which are\n * behind it, and which never got to start.\n *\n * It is fabrika's `deriveStatus` loop, factored out rather than copied: walk\n * phases in order, the first whose tasks are not ALL final is the active one\n * and the walk stops; a phase that IS all final but holds an error final trips\n * the lane and the walk stops there instead; everything after a stop is\n * `\"waiting\"`, whatever its tasks happen to read.\n *\n * That last clause is the whole reason this is positional. `foldLane` boots\n * every task of every phase, so a later phase's region can sit in a final\n * before its phase ever ran — a child the board abandoned boots straight into\n * an error final, which is exactly the case fabrika's emitter produces. Read\n * locally, that phase looks \"tripped\". Read in sequence, it is a phase that\n * never started, and the lane tripped somewhere else.\n *\n * {@link deriveLaneStatus} and the report both read this, so the compound state\n * value and the phase headings cannot disagree about what is running.\n */\nexport function phaseStandings(\n  lane: ImportedLane,\n  states: LeafStates,\n): readonly PhaseStand[] {\n  const isFinal = (taskId: string): boolean =>\n    endPolarityOf(nodeOf(lane, taskId, states)) !== false;\n  const errors = trippedTasks(lane, states);\n  let stopped = false;\n  return lane.phases.map((phase, index) => {\n    const tripped = phase.tasks.filter((taskId) => errors.includes(taskId));\n    const base = { name: phase.name, index, tasks: phase.tasks, tripped };\n    if (stopped) return { ...base, standing: \"waiting\" as const };\n    if (!phase.tasks.every(isFinal)) {\n      stopped = true;\n      return { ...base, standing: \"active\" as const };\n    }\n    if (tripped.length > 0) {\n      stopped = true;\n      return { ...base, standing: \"tripped\" as const };\n    }\n    return { ...base, standing: \"complete\" as const };\n  });\n}\n\n/**\n * THE ADVANCEMENT RULE — has the lane left the phases, and by which door?\n *\n * `undefined` means \"still running\": some phase is active, so the lane is\n * sitting in it. A terminal name means the walk ran out of phases — every phase\n * completed (`onDone` chained all the way past the last one, which is what the\n * `complete` terminal IS), or one of them completed holding a region at an\n * `end: \"error\"` final, which trips the lane wherever it had got to.\n *\n * Three lines, and they are pulled out here rather than inlined below because\n * this is the rule the RUNTIME advances by (`runLane`, in `../lane/run`). The\n * runtime does not re-derive it and does not agree with it by inspection: it\n * calls {@link phaseStandings} over its own region states and then this, so\n * \"the machine advanced\" and \"the fold says it advanced\" are the same sentence\n * evaluated twice, not two sentences kept in sync.\n */\nexport function laneTerminalReached(\n  stands: readonly PhaseStand[],\n  terminals: ImportedLane[\"terminals\"],\n): string | undefined {\n  if (stands.some((stand) => stand.standing === \"tripped\"))\n    return terminals.tripped;\n  if (stands.some((stand) => stand.standing === \"active\")) return undefined;\n  return terminals.complete;\n}\n\n/**\n * The whole \"compound machine\", as a pure derivation.\n *\n * The active phase is the first whose tasks are not all final; a COMPLETED\n * phase holding a task in an error final trips the workflow. That is fabrika's\n * `noErrors` gate — never a machine event, and here it reads the chart's\n * `end: \"error\"` polarity, which is the same fact the document's guarded\n * fallthrough declared. The walk itself is {@link phaseStandings}, so the\n * status and the drawing are one derivation seen twice.\n */\nexport function deriveLaneStatus(\n  lane: ImportedLane,\n  states: Readonly<Record<string, TaskState>>,\n): LaneStatus {\n  const errors = trippedTasks(lane, states);\n\n  const context: Record<string, unknown> = {};\n  for (const [taskId, state] of Object.entries(states)) {\n    context[taskId] = {\n      retries: state.retries,\n      maxRetries: state.maxRetries,\n      ...(lane.context[taskId]?.extras ?? {}),\n    };\n  }\n  context.errors = errors;\n\n  const stands = phaseStandings(lane, states);\n  const terminal = laneTerminalReached(stands, lane.terminals);\n  if (terminal !== undefined) {\n    return { stateValue: terminal, status: \"done\", context };\n  }\n  // `laneTerminalReached` returned `undefined`, which is precisely \"some phase\n  // is active\" — so this find cannot miss.\n  const active = stands.find((stand) => stand.standing === \"active\");\n  if (active === undefined) {\n    return { stateValue: lane.terminals.complete, status: \"done\", context };\n  }\n\n  const stateValue: Record<string, Record<string, string> | string> = {\n    [active.name]: Object.fromEntries(\n      active.tasks.map((taskId) => [taskId, states[taskId]?.type ?? \"?\"]),\n    ),\n  };\n  for (const stand of stands.slice(active.index + 1)) {\n    stateValue[stand.name] = \"waiting\";\n  }\n  return { stateValue, status: \"active\", context };\n}\n\nfunction nodeOf(lane: ImportedLane, taskId: string, states: LeafStates) {\n  const chart = lane.charts[taskId];\n  const state = states[taskId];\n  if (chart === undefined || state === undefined) return undefined;\n  return statesOf(chart).get(state.type);\n}\n\n/** `lane status`'s stdout, parsed back into the shape it was printed from. */\nexport function parseStatusJson(text: string): LaneStatus {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(text);\n  } catch {\n    throw new UnreplayableLogError([\"`lane status` output is not JSON\"]);\n  }\n  if (typeof parsed !== \"object\" || parsed === null) {\n    throw new UnreplayableLogError([\"`lane status` output is not an object\"]);\n  }\n  const record = parsed as {\n    stateValue?: unknown;\n    status?: unknown;\n    context?: unknown;\n  };\n  if (record.status !== \"active\" && record.status !== \"done\") {\n    throw new UnreplayableLogError([\n      '`lane status` output carries no `status` of \"active\" | \"done\"',\n    ]);\n  }\n  if (record.stateValue === undefined) {\n    throw new UnreplayableLogError([\n      \"`lane status` output carries no `stateValue`\",\n    ]);\n  }\n  return {\n    stateValue: record.stateValue as LaneStatus[\"stateValue\"],\n    status: record.status,\n    context:\n      typeof record.context === \"object\" && record.context !== null\n        ? (record.context as Record<string, unknown>)\n        : {},\n  };\n}\n","// ═══════════════════════════════════════════════════════════════════════════\n// THE REPORT — one markdown string that reads the same in three places.\n//\n// A terminal, a PR comment and an issue comment are the three surfaces a lane's\n// state is actually looked at on, and they share exactly one format. So the\n// output is markdown with a mermaid fence: GitHub renders the fence, a terminal\n// shows it as the text it is, and neither needs a flag.\n//\n// THE EDITORIAL RULES, which are most of what this file is:\n//\n//   ONE DIAGRAM PER TASK THAT MOVED, ACTIVE PHASE ONLY. A comment with eight\n//   diagrams is a comment nobody reads. Future phases get one line each, and so\n//   do the tasks still sitting at their entry state — a real emitted epic put\n//   eight tasks in one phase, six of them untouched, and the rule as originally\n//   written (per TASK, not per MOVED task) produced exactly the wall of\n//   near-identical pictures it exists to prevent.\n//\n//   \"WAITING ON\" IS DERIVED, AND NAMES NOTHING. This file used to answer it by\n//   matching STATE NAMES — `queued`, `build`, `review`, `ship`, `blocked`,\n//   `human:*` — against a list copied out of fabrika's `wire/lane-brief.ts`.\n//   Those names are fabrika's, so a rename upstream turned this report into a\n//   confident liar with nothing failing anywhere. The fact it was really after\n//   is not \"which state is this\" but \"who has to act next\", which is a property\n//   of the EVENT: a Msg comes from a Cmd's result, a Sub firing, or the outside\n//   world, and the chart now says which (`graph.ts` §3a, `from`). So the answer\n//   is the events legal HERE, grouped by THEIR origin — no state name, no event\n//   name, no job title in this file.\n//\n//   AND IT STILL REFUSES TO GUESS. A chart that declares no provenance gets no\n//   invented one: the line says which events the state accepts and stops, which\n//   is what the machine does say — the same refusal `shellState()` makes by\n//   answering null rather than inventing a shell.\n//\n//   THE RETRY LINE, WHEN AND ONLY WHEN IT MATTERS. `2/2` is the difference\n//   between \"in review\" and \"one FAIL from frozen\", and `0/2` is noise.\n// ═══════════════════════════════════════════════════════════════════════════\nimport type { EventOrigin } from \"../graph\";\nimport { drawTask, walkedEdges } from \"./draw\";\nimport {\n  deriveLaneStatus,\n  foldLane,\n  type LaneStatus,\n  type LogEntry,\n  type PhaseStand,\n  phaseStandings,\n  type TaskState,\n  type TimelineStep,\n  timeline,\n} from \"./fold\";\nimport {\n  chartFromWorkflow,\n  endPolarityOf,\n  type ImportedChart,\n  type ImportedLane,\n  initialOf,\n  originOf,\n  statesOf,\n} from \"./workflow\";\n\n/** The lane the report is about. `workflow` is the PARSED document, or an import. */\nexport interface LaneReportInput {\n  /** `workflow.json`, parsed — or an already-imported lane, reused as is. */\n  readonly workflow: unknown;\n  readonly entries: readonly LogEntry[];\n  /**\n   * `lane status`'s answer.\n   *\n   * OPTIONAL, and that is the whole shape of the two input paths: a caller\n   * shelling out to `fabrika` hands over the CLI's own derivation and the\n   * report never second-guesses it; a caller holding only the two files omits\n   * it and the same derivation runs here.\n   */\n  readonly status?: LaneStatus;\n  /** Heading for the block. Defaults to the document's `id`. */\n  readonly title?: string;\n}\n\nexport interface LaneReport {\n  readonly markdown: string;\n}\n\nconst isImportedLane = (v: unknown): v is ImportedLane =>\n  typeof v === \"object\" &&\n  v !== null &&\n  Array.isArray((v as ImportedLane).phases) &&\n  typeof (v as ImportedLane).charts === \"object\";\n\n/** `{ pipeline: { issue: \"review\" } }` → the phase that is actually running. */\nfunction activePhaseName(status: LaneStatus): string | undefined {\n  if (typeof status.stateValue === \"string\") return undefined;\n  for (const [name, value] of Object.entries(status.stateValue)) {\n    if (typeof value === \"object\") return name;\n  }\n  return undefined;\n}\n\n/** Event names, as the report writes a list of them. */\nconst listed = (events: readonly string[]): string =>\n  events.map((e) => `\\`${e}\\``).join(\", \");\n\n/**\n * One origin's worth of the answer, said the way that origin is said.\n *\n * The three phrasings are the three origins, and each says the thing that\n * origin makes true. A world role is a WHO, so the events are what that who\n * owes; a cmd is work already in flight, so the sentence is about the work and\n * the events are how it comes back; a sub is a source, so the sentence is about\n * the source. The role text (`the operator`, `a human`) is the consumer's own,\n * carried from the chart verbatim — including its article, because only the\n * consumer knows whether there is one of them or any of them.\n */\nfunction phrase(\n  origin: EventOrigin,\n  state: string,\n  events: readonly string[],\n): string {\n  if (origin === \"cmd\") {\n    return `the work \\`${state}\\` dispatched — ${listed(events)}`;\n  }\n  if (origin === \"sub\") {\n    return `the source \\`${state}\\` is subscribed to — ${listed(events)}`;\n  }\n  return `${origin.world}'s ${listed(events)}`;\n}\n\n/** The grouping key for an origin — the two words, or the role, distinctly. */\nconst originKey = (origin: EventOrigin): string =>\n  typeof origin === \"string\" ? origin : `world:${origin.world}`;\n\n/**\n * What this task is waiting on — or `null` at a final.\n *\n * DERIVED, entirely: the events this state routes, grouped by the origin each\n * one DECLARES, in declaration order. Nothing here knows a state name, an event\n * name or a job title, so a consumer that renames half its states changes this\n * output correctly and a consumer with a completely different cast is served by\n * the same function.\n *\n * The degradation is the point of the second half. Provenance is not in\n * `workflow.json` — it is stated at the import boundary or not at all — so a\n * chart imported without it must say what it actually knows, which is WHICH\n * EVENTS the state accepts. It never says who sends them.\n */\nexport function waitingOn(chart: ImportedChart, state: string): string | null {\n  const node = statesOf(chart).get(state);\n  if (node?.end !== undefined) return null;\n  const events = Object.keys(node?.on ?? {});\n  if (events.length === 0) {\n    // A live state that routes nothing. `inspectLane` calls this a dead end;\n    // there is no one to wait for and saying so is the whole answer.\n    return `\\`${state}\\` accepts no events, and it is not a final`;\n  }\n\n  // Group by origin, keeping the events in the order the chart declares them.\n  const groups = new Map<string, { origin: EventOrigin; events: string[] }>();\n  const undeclared: string[] = [];\n  for (const event of events) {\n    const origin = originOf(chart, event);\n    if (origin === undefined) {\n      undeclared.push(event);\n      continue;\n    }\n    const key = originKey(origin);\n    const group = groups.get(key);\n    if (group === undefined) groups.set(key, { origin, events: [event] });\n    else group.events.push(event);\n  }\n\n  // NO PROVENANCE AT ALL — the honest floor. Same voice as the refusal this\n  // replaces: name what the machine says, and stop.\n  if (groups.size === 0) return `\\`${state}\\` accepts ${listed(events)}`;\n\n  const parts = [...groups.values()].map((g) =>\n    phrase(g.origin, state, g.events),\n  );\n  // A PARTIAL map is not rounded up to a whole one. The events whose origin was\n  // never stated are listed as exactly that, beside the ones that were.\n  if (undeclared.length > 0) {\n    parts.push(`${listed(undeclared)}, from somewhere the chart does not say`);\n  }\n  return parts.join(\" · \");\n}\n\n/** `2/2 — one \\`FAIL\\` from \\`frozen\\``, or `null` when no retry has been spent. */\nfunction retryLine(chart: ImportedChart, state: TaskState): string | null {\n  if (state.retries <= 0) return null;\n  const budget = `${state.retries}/${state.maxRetries}`;\n  if (state.retries < state.maxRetries) return `**retries:** ${budget}`;\n  // Spent. Name the edge that is now a one-way door, off the chart rather than\n  // off a constant — a document whose fallthrough is `tripped` says `tripped`.\n  const node = statesOf(chart).get(state.type);\n  for (const [event, edge] of Object.entries(node?.on ?? {})) {\n    if (\"when\" in edge) {\n      return `**retries:** ${budget} — spent; one \\`${event}\\` from \\`${edge.otherwise}\\``;\n    }\n  }\n  return `**retries:** ${budget} — spent`;\n}\n\n/**\n * One phase that is NOT the active one, in one line.\n *\n * The editorial rule the module opened with, applied to the phase dimension: a\n * comment with eight diagrams is a comment nobody reads, so a phase already\n * finished and a phase not yet started each get a line. A finished phase still\n * gets its leaves, because \"complete\" alone does not say WHICH ending each of\n * its tasks reached — and a phase that never started has no leaves worth\n * printing, because every one of them would be an initial state nothing walked.\n */\nfunction phaseLine(\n  stand: PhaseStand,\n  states: Readonly<Record<string, TaskState>>,\n): string {\n  const count = `${stand.tasks.length} task${stand.tasks.length === 1 ? \"\" : \"s\"}`;\n  if (stand.standing === \"waiting\") {\n    return `**${stand.name}:** waiting — ${count}, not started.`;\n  }\n  const leaves = stand.tasks\n    .map(\n      (taskId) =>\n        `\\`${taskId}\\` = \\`${states[taskId]?.type ?? \"?\"}\\`${\n          stand.tripped.includes(taskId) ? \" **(tripped)**\" : \"\"\n        }`,\n    )\n    .join(\", \");\n  return `**${stand.name}:** ${stand.standing} — ${count}: ${leaves}`;\n}\n\nfunction timelineTable(steps: readonly TimelineStep[]): string {\n  if (steps.length === 0)\n    return \"_no events yet — the lane is at its initial state._\";\n  const rows = steps.map(\n    (s) =>\n      `| ${s.index + 1} | ${s.at} | \\`${s.task}\\` | \\`${s.event}\\` | \\`${s.from}\\` → \\`${s.to}\\` |`,\n  );\n  return [\n    \"| # | at | task | event | from → to |\",\n    \"|---|---|---|---|---|\",\n    ...rows,\n  ].join(\"\\n\");\n}\n\n/**\n * A lane, as one markdown block.\n *\n * The diagram half is behind {@link drawTask}, which is a translation onto\n * `chartMermaid` — the package's one chart renderer.\n */\nexport function laneReport(input: LaneReportInput): LaneReport {\n  const lane = isImportedLane(input.workflow)\n    ? input.workflow\n    : chartFromWorkflow(input.workflow);\n  const entries = input.entries;\n  const states = foldLane(lane, entries);\n  const status = input.status ?? deriveLaneStatus(lane, states);\n  const steps = timeline(lane, entries);\n\n  const title = input.title ?? lane.id ?? \"lane\";\n  const out: string[] = [`## ${title} — ${status.status}`, \"\"];\n\n  // ── where it is ─────────────────────────────────────────────────────────\n  out.push(`**where it is:** ${describeStateValue(status.stateValue)}`);\n  if (lane.trigger !== undefined) out.push(`**fired by:** \\`${lane.trigger}\\``);\n  const errors = status.context.errors;\n  if (Array.isArray(errors) && errors.length > 0) {\n    out.push(\n      `**tripped:** ${errors.map((t) => `\\`${String(t)}\\``).join(\", \")} — the lane lands on \\`${lane.terminals.tripped}\\``,\n    );\n  }\n  out.push(\"\");\n\n  // ── the phases, in order: one in full, the rest in one line each ────────\n  //\n  // The standings are DERIVED from the fold — the same walk `deriveLaneStatus`\n  // makes — rather than read off `stateValue`, because `stateValue` is silent\n  // about a lane that already stopped: it collapses to the terminal's NAME, and\n  // a reader of a tripped epic then cannot tell which phase tripped it, or\n  // which phases below never got to start. The one thing still taken from\n  // `status` is WHICH phase is active, so a report handed the CLI's own answer\n  // shows the CLI's answer. (`fold.test.ts` asserts the two agree at every\n  // prefix of every run, so this is a precedence rule, not a disagreement.)\n  const stands = phaseStandings(lane, states);\n  const named = activePhaseName(status);\n  const active =\n    stands.find((s) => s.name === named) ??\n    stands.find((s) => s.standing === \"active\");\n\n  for (const stand of stands) {\n    if (stand === active) {\n      // ONE DIAGRAM PER TASK THAT HAS MOVED — not per task.\n      //\n      // The rule at the top of this file says a comment with eight diagrams is\n      // a comment nobody reads, and until this was run against a real emitted\n      // epic the rule was only enforced on the phase dimension. A real phase\n      // holds eight tasks; six of them sat untouched at `queued`, and the\n      // report spent ~200 of its ~265 lines drawing the same picture six times\n      // with a different node lit. A task still at its entry state has a story\n      // one line long, so it gets one line.\n      const untouched: string[] = [];\n      for (const taskId of stand.tasks) {\n        const chart = lane.charts[taskId];\n        const state = states[taskId];\n        if (chart === undefined || state === undefined) continue;\n        if (state.type === initialOf(chart)) untouched.push(taskId);\n      }\n      // If NOTHING in the phase has moved, the phase just started — and\n      // collapsing every task would leave the reader with no picture at all.\n      // Draw the first as the representative (they are all at the same entry\n      // state, so any of them is the same picture) and list the rest.\n      if (untouched.length === stand.tasks.length) untouched.shift();\n      for (const taskId of stand.tasks) {\n        const chart = lane.charts[taskId];\n        const state = states[taskId];\n        if (chart === undefined || state === undefined) continue;\n        if (untouched.includes(taskId)) continue;\n        const polarity = endPolarityOf(statesOf(chart).get(state.type));\n        out.push(\n          `### ${taskId} — \\`${state.type}\\`${polarity === \"error\" ? \" — TRIPPED\" : \"\"}`,\n        );\n        const waiting = waitingOn(chart, state.type);\n        out.push(\n          waiting !== null\n            ? `**waiting on:** ${waiting}`\n            : polarity === \"error\"\n              ? // The distinction `end: \"error\"` bought, spent where it is worth\n                // something: this task is as finished as a shipped one, and the\n                // phase it is in is going to trip the lane when its siblings\n                // finish. A report that said \"final\" for both would bury that.\n                `**waiting on:** nothing — this task landed on the error final \\`${state.type}\\`, and \\`${stand.name}\\` will trip the lane when its siblings finish.`\n              : \"**waiting on:** nothing — this task is final.\",\n        );\n        const retries = retryLine(chart, state);\n        if (retries !== null) out.push(retries);\n        out.push(\"\");\n        out.push(\"```mermaid\");\n        out.push(\n          drawTask(chart, {\n            current: state.type,\n            walked: walkedEdges(steps.filter((s) => s.task === taskId)),\n          }),\n        );\n        out.push(\"```\");\n        out.push(\"\");\n      }\n      if (untouched.length > 0) {\n        // Named, not counted: \"6 tasks not started\" tells a reader nothing they\n        // can act on, and the names are what they came for.\n        const chart = lane.charts[untouched[0] as string];\n        const at =\n          chart === undefined ? \"their entry state\" : `\\`${initialOf(chart)}\\``;\n        out.push(\n          `**not started yet:** ${untouched.map((t) => `\\`${t}\\``).join(\", \")} — still at ${at}.`,\n        );\n        out.push(\"\");\n      }\n      continue;\n    }\n    out.push(phaseLine(stand, states));\n    out.push(\"\");\n  }\n\n  // ── the timeline ────────────────────────────────────────────────────────\n  out.push(\"### timeline\");\n  out.push(\"\");\n  out.push(timelineTable(steps));\n  out.push(\"\");\n  return {\n    markdown: `${out\n      .join(\"\\n\")\n      .replace(/\\n{3,}/g, \"\\n\\n\")\n      .trimEnd()}\\n`,\n  };\n}\n\nfunction describeStateValue(value: LaneStatus[\"stateValue\"]): string {\n  if (typeof value === \"string\") return `\\`${value}\\` — the workflow is done.`;\n  const parts: string[] = [];\n  for (const [phase, leaf] of Object.entries(value)) {\n    if (typeof leaf === \"string\") {\n      parts.push(`\\`${phase}\\`: ${leaf}`);\n      continue;\n    }\n    const inner = Object.entries(leaf)\n      .map(([task, state]) => `\\`${task}\\` = \\`${state}\\``)\n      .join(\", \");\n    parts.push(`\\`${phase}\\` → ${inner}`);\n  }\n  return parts.join(\" · \");\n}\n"]}
+{"version":3,"sources":["../src/chart/report/draw.ts","../src/chart/report/workflow.ts","../src/chart/report/fold.ts","../src/chart/report/report.ts"],"names":[],"mappings":";;;AA4CO,SAAS,QAAA,CAAS,KAAA,EAAsB,IAAA,GAAoB,EAAC,EAAW;AAC7E,EAAA,OAAO,aAAa,KAAA,EAAgB;AAAA,IAClC,QAAA,EAAU,IAAA;AAAA,IACV,GAAI,KAAK,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAW,IAAA,CAAK,OAAA,EAAQ;AAAA,IAChE,GAAI,KAAK,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA;AAAO,GAC5D,CAAA;AACH;AAUO,SAAS,YACd,KAAA,EACY;AACZ,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAA,CAAO,GAAA,CAAI,KAAK,IAAA,EAAA,CAAO,MAAA,CAAO,IAAI,IAAA,CAAK,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,MAAA;AACT;;;AC/BO,IAAM,SAAA,GAAY,CAAC,KAAA,KAA0B;AAClD,EAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA;AAC7B,EAAA,OAAO,QAAQ,EAAA,GAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACjD;AA+LO,IAAM,mBAAA,GAAN,cAAkC,KAAA,CAAM;AAAA,EAG7C,YAA4B,OAAA,EAA4B;AACtD,IAAA,KAAA;AAAA,MACE,CAAA;AAAA,CAAA,GACE,OAAA,CAAQ,IAAI,CAAC,CAAA,KAAM,YAAO,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI;AAAA,KAC5C;AAJ0B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAK5B;AAAA,EAL4B,OAAA;AAAA,EAFV,IAAA,GAAO,qBAAA;AAAA,EAChB,IAAA,GAAO,qBAAA;AAOlB;AAEA,IAAM,QAAA,GAAW,CAAC,CAAA,KAChB,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,KAAM,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA;AAEzD,IAAM,QAAA,GAAW,CAAC,IAAA,KAChB,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,IAAA,CAAK,IAAA,GAAO,MAAA;AASzD,IAAM,YAAA,GAAe;AAW5B,IAAM,aAAA,GAAgB,gBAAA;AAQtB,SAAS,YAAA,CAAa,QAAgB,MAAA,EAA+B;AACnE,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,IACE,CAAC,QAAA,CAAS,MAAM,CAAA,IAChB,CAAC,QAAA,CAAS,MAAA,CAAO,MAAM,CAAA,IACvB,OAAO,MAAA,CAAO,OAAA,KAAY,QAAA,EAC1B;AACA,IAAA,OAAO;AAAA,MACL,OAAA,EAAS;AAAA,QACP,SAAS,MAAM,CAAA,sDAAA;AAAA;AACjB,KACF;AAAA,EACF;AACA,EAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AACtB,EAAA,MAAM,eAAe,MAAA,CAAO,OAAA;AAC5B,EAAA,IAAI,MAAA,CAAO,YAAY,CAAA,KAAM,MAAA,EAAW;AACtC,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,MAAA,EAAS,MAAM,CAAA,kBAAA,EAAqB,YAAY,CAAA,sBAAA;AAAA,KAClD;AAAA,EACF;AAKA,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjD,IAAA,IAAI,SAAS,IAAI,CAAA,KAAM,OAAA,EAAS,MAAA,CAAO,IAAI,IAAI,CAAA;AAAA,EACjD;AACA,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AAGpC,EAAA,MAAM,KAAmD,EAAC;AAC1D,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAKtD,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,SAAA,EAAW;AAClC,IAAA,MAAM,QAAsC,EAAC;AAC7C,IAAA,EAAA,CAAG,SAAS,CAAA,GAAI,KAAA;AAChB,IAAA,IAAI,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AACnB,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,CAAA,kBAAA,CAAoB,CAAA;AACtE,MAAA;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,EAAA,IAAM,EAAC;AACxB,IAAA,IAAI,CAAC,QAAA,CAAS,GAAG,CAAA,EAAG;AAClB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,CAAA,6BAAA;AAAA,OACvC;AACA,MAAA;AAAA,IACF;AAKA,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,IAAA,KAAA,MAAW,CAAC,SAAA,EAAW,UAAU,KAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,EAAG;AACzD,MAAA,MAAM,KAAA,GAAQ,UAAU,SAAS,CAAA;AACjC,MAAA,IAAI,UAAU,EAAA,EAAI;AAChB,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,kBAAkB,SAAS,CAAA,sDAAA;AAAA,SAClE;AACA,QAAA;AAAA,MACF;AACA,MAAA,MAAM,OAAA,GAAU,SAAA,CAAU,GAAA,CAAI,KAAK,CAAA;AACnC,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,UAAA,EAAa,SAAS,yCAAoC,OAAO,CAAA,OAAA,EAAU,SAAS,CAAA,aAAA,EAAgB,KAAK,CAAA,sCAAA;AAAA,SAC1H;AACA,QAAA;AAAA,MACF;AACA,MAAA,SAAA,CAAU,GAAA,CAAI,OAAO,SAAS,CAAA;AAG9B,MAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,UAAU,CAAA,EAAG;AAC7B,QAAA,MAAM,OAAO,UAAA,CAAW,GAAA;AAAA,UAAI,CAAC,GAAA,KAC3B,QAAA,CAAS,GAAG,CAAA,IAAK,OAAO,GAAA,CAAI,MAAA,KAAW,QAAA,GACnC,GAAA,CAAI,MAAA,GACJ;AAAA,SACN;AACA,QAAA,MAAM,CAAC,KAAA,EAAO,WAAW,CAAA,GAAI,IAAA;AAC7B,QAAA,IACE,WAAW,MAAA,KAAW,CAAA,IACtB,KAAA,KAAU,MAAA,IACV,gBAAgB,MAAA,EAChB;AACA,UAAA,OAAA,CAAQ,IAAA;AAAA,YACN,CAAA,MAAA,EAAS,MAAM,CAAA,YAAA,EAAe,SAAS,CAAA,+FAAA;AAAA,WACzC;AACA,UAAA;AAAA,QACF;AACA,QAAA,KAAA,MAAW,MAAA,IAAU,CAAC,KAAA,EAAO,WAAW,CAAA,EAAG;AACzC,UAAA,IAAI,MAAA,CAAO,MAAM,CAAA,KAAM,MAAA,EAAW;AAChC,YAAA,OAAA,CAAQ,IAAA;AAAA,cACN,CAAA,MAAA,EAAS,MAAM,CAAA,IAAA,EAAO,SAAS,4BAA4B,MAAM,CAAA,CAAA;AAAA,aACnE;AAAA,UACF;AAAA,QACF;AAGA,QAAA,IAAI,OAAO,GAAA,CAAI,WAAW,CAAA,EAAG,WAAA,CAAY,IAAI,WAAW,CAAA;AACxD,QAAA,MAAM,IAAA,GAAO,WAAW,CAAC,CAAA;AACzB,QAAA,MAAM,IAAA,GACJ,SAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,KAAA,KAAU,QAAA,GACpC,IAAA,CAAK,KAAA,GACL,aAAA;AACN,QAAA,KAAA,CAAM,KAAK,CAAA,GAAI,EAAE,QAAQ,KAAA,EAAO,IAAA,EAAM,WAAW,WAAA,EAAY;AAC7D,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,OAAO,eAAe,QAAA,EAAU;AAClC,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,IAAA,EAAO,SAAS,CAAA,yCAAA;AAAA,SACjC;AACA,QAAA;AAAA,MACF;AACA,MAAA,IAAI,MAAA,CAAO,UAAU,CAAA,KAAM,MAAA,EAAW;AACpC,QAAA,OAAA,CAAQ,IAAA;AAAA,UACN,CAAA,MAAA,EAAS,MAAM,CAAA,IAAA,EAAO,SAAS,4BAA4B,UAAU,CAAA,CAAA;AAAA,SACvE;AACA,QAAA;AAAA,MACF;AAEA,MAAA,KAAA,CAAM,KAAK,CAAA,GACT,QAAA,CAAS,MAAA,CAAO,UAAU,CAAC,CAAA,KAAM,SAAA,GAC7B,EAAE,MAAA,EAAQ,EAAE,QAAA,EAAU,YAAA,IAAe,GACrC,EAAE,QAAQ,UAAA,EAAW;AAAA,IAC7B;AAAA,EACF;AAEA,EAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG,OAAO,EAAE,OAAA,EAAQ;AAEzC,EAAA,MAAM,MAAoC,EAAC;AAC3C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjD,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,SAAA,EAAW;AAClC,IAAA,MAAM,KAAA,GAAQ,EAAA,CAAG,IAAI,CAAA,IAAK,EAAC;AAC3B,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAC/B,IAAA,GAAA,CAAI,IAAI,CAAA,GAAI;AAAA,MACV,GAAI,IAAA,KAAS,YAAA,GAAe,EAAE,OAAA,EAAS,IAAA,KAAkB,EAAC;AAAA,MAC1D,GAAI,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,MAAA,GAAS,CAAA,GAAI,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,EAAC;AAAA,MACrD,GAAI,OAAA,GACA,EAAE,GAAA,EAAK,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,GAAK,OAAA,GAAqB,IAAA,EAAe,GACpE;AAAC,KACP;AAAA,EACF;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,OAAA,EAAS,EAAC,EAAE;AAClC;AAGA,SAAS,aAAA,CACP,WACA,MAAA,EAC0D;AAC1D,EAAA,MAAM,MAAA,GAAS,UAAU,SAAS,CAAA,wFAAA,CAAA;AAClC,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,IAAK,OAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,MAAA,EAAO;AACnE,EAAA,MAAM,CAAC,OAAA,EAAS,IAAI,CAAA,GAAI,MAAA,CAAO,GAAA;AAAA,IAAI,CAAC,GAAA,KAClC,QAAA,CAAS,GAAG,CAAA,IAAK,OAAO,GAAA,CAAI,MAAA,KAAW,QAAA,GAAW,GAAA,CAAI,MAAA,GAAS;AAAA,GACjE;AACA,EAAA,OAAO,OAAA,KAAY,MAAA,IAAa,IAAA,KAAS,MAAA,GACrC,EAAE,MAAA,EAAO,GACT,EAAE,OAAA,EAAS,CAAC,OAAA,EAAS,IAAI,CAAA,EAAW;AAC1C;AA6BO,SAAS,iBAAA,CACd,QAAA,EACA,OAAA,GAAiC,EAAC,EACpB;AACd,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,UAAA,GAAa,QAAA,CAAS,QAAQ,CAAA,GAAI,SAAS,OAAA,GAAU,MAAA;AAC3D,EAAA,IAAI,CAAC,SAAS,UAAU,CAAA,IAAK,CAAC,QAAA,CAAS,UAAA,CAAW,MAAM,CAAA,EAAG;AACzD,IAAA,MAAM,IAAI,mBAAA,CAAoB;AAAA,MAC5B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,MAAM,kBAAkB,QAAA,CAAS,UAAA,CAAW,OAAO,CAAA,GAC/C,UAAA,CAAW,UACX,EAAC;AACL,EAAA,MAAM,eAAA,GAAkB,QAAA,CAAS,QAAQ,CAAA,GAAI,SAAS,OAAA,GAAU,MAAA;AAChE,EAAA,IAAI,eAAA,KAAoB,MAAA,IAAa,OAAO,eAAA,KAAoB,QAAA,EAAU;AACxE,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN;AAAA,KACF;AAAA,EACF;AAEA,EAAA,MAAM,gBAAgB,UAAA,CAAW,MAAA;AACjC,EAAA,MAAM,SAAwC,EAAC;AAC/C,EAAA,MAAM,UAMF,EAAC;AACL,EAAA,MAAM,SAA0B,EAAC;AACjC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,IAAI,SAAA;AAEJ,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,aAAa,CAAA,EAAG;AAC7D,IAAA,IAAI,SAAS,IAAI,CAAA,KAAM,cAAc,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AACtD,IAAA,MAAM,UAAU,IAAA,CAAK,MAAA;AACrB,IAAA,IAAI,CAAC,SAAS,OAAO,CAAA,IAAK,OAAO,IAAA,CAAK,OAAO,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG;AAC3D,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,UAAU,SAAS,CAAA,yDAAA;AAAA,OACrB;AACA,MAAA;AAAA,IACF;AACA,IAAA,MAAM,aAAuB,EAAC;AAC9B,IAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AACtD,MAAA,MAAM,QAAA,GAAW,YAAA,CAAa,MAAA,EAAQ,MAAM,CAAA;AAC5C,MAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,QAAA,CAAS,OAAO,CAAA;AAChC,MAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAW;AAC/B,QAAA,MAAM,SAGF,EAAC;AACL,QAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,QAAA,CAAS,IAAI,CAAA,EAAG;AAChD,UAAA,KAAA,MAAW,SAAS,MAAA,CAAO,IAAA,CAAK,MAAM,EAAA,IAAM,EAAE,CAAA,EAAG;AAG/C,YAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,IAAA,GAAO,KAAK,CAAA;AACnC,YAAA,MAAA,CAAO,KAAK,CAAA,GACV,MAAA,KAAW,MAAA,GACP,EAAE,KAAA,EAAO,OAAA,EAAQ,GACjB,EAAE,KAAA,EAAO,OAAA,EAAS,IAAA,EAAM,MAAA,EAAO;AAAA,UACvC;AAAA,QACF;AAQA,QAAA,MAAA,CAAO,MAAM,CAAA,GAAI,EAAE,MAAA,EAAQ,MAAA,EAAQ,EAAE,CAAC,SAAS,GAAG,QAAA,CAAS,IAAA,EAAK,EAAE;AAAA,MACpE;AACA,MAAA,MAAM,GAAA,GAAM,gBAAgB,MAAM,CAAA;AAClC,MAAA,MAAM,GAAA,GAAM,QAAA,CAAS,GAAG,CAAA,GAAI,MAAM,EAAC;AACnC,MAAA,MAAM,EAAE,UAAA,EAAY,MAAA,EAAQ,SAAS,QAAA,EAAU,GAAG,QAAO,GAAI,GAAA;AAC7D,MAAA,OAAA,CAAQ,MAAM,CAAA,GAAI;AAAA,QAChB,UAAA,EAAY,OAAO,MAAA,KAAW,QAAA,GAAW,MAAA,GAAS,YAAA;AAAA,QAClD;AAAA,OACF;AACA,MAAA,UAAA,CAAW,KAAK,MAAM,CAAA;AAAA,IACxB;AACA,IAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,YAAY,CAAA;AAElD,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,SAAA,EAAW,IAAA,CAAK,MAAM,CAAA;AACjD,IAAA,IAAI,KAAK,MAAA,KAAW,MAAA,EAAW,OAAA,CAAQ,IAAA,CAAK,KAAK,MAAM,CAAA;AACvD,IAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW;AAC9B,MAAA,KAAA,MAAW,MAAA,IAAU,KAAK,OAAA,EAAS;AACjC,QAAA,WAAA,CAAY,IAAI,MAAM,CAAA;AACtB,QAAA,IAAI,aAAA,CAAc,MAAM,CAAA,KAAM,MAAA,EAAW;AACvC,UAAA,OAAA,CAAQ,IAAA;AAAA,YACN,CAAA,OAAA,EAAU,SAAS,CAAA,mDAAA,EAAsD,MAAM,CAAA,CAAA;AAAA,WACjF;AAAA,QACF;AAAA,MACF;AAIA,MAAA,SAAA,GAAY,EAAE,QAAA,EAAU,IAAA,CAAK,OAAA,CAAQ,CAAC,GAAG,OAAA,EAAS,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAE;AAAA,IACpE;AAAA,EACF;AAIA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,aAAa,CAAA,EAAG;AACxD,IAAA,IAAI,SAAS,IAAI,CAAA,KAAM,UAAA,IAAc,QAAA,CAAS,IAAI,CAAA,EAAG;AACrD,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,KAAM,OAAA,EAAS;AAC9B,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,wBAAwB,IAAI,CAAA,0DAAA;AAAA,OAC9B;AAAA,IACF,CAAA,MAAA,IAAW,CAAC,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,EAAG;AACjC,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,wBAAwB,IAAI,CAAA,2CAAA;AAAA,OAC9B;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,OAAO,MAAA,KAAW,CAAA;AACpB,IAAA,OAAA,CAAQ,KAAK,yCAAyC,CAAA;AACxD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,oBAAoB,OAAO,CAAA;AAC7D,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAI,mBAAA,CAAoB;AAAA,MAC5B;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,EAAA,GACJ,SAAS,QAAQ,CAAA,IAAK,OAAO,QAAA,CAAS,EAAA,KAAO,QAAA,GACzC,QAAA,CAAS,EAAA,GACT,MAAA;AACN,EAAA,MAAM,IAAA,GAAqB;AAAA,IACzB,GAAI,EAAA,KAAO,MAAA,GAAY,EAAC,GAAI,EAAE,EAAA,EAAG;AAAA,IACjC,GAAI,OAAO,eAAA,KAAoB,QAAA,GAC3B,EAAE,OAAA,EAAS,eAAA,KACX,EAAC;AAAA,IACL,MAAA;AAAA,IACA,SAAA;AAAA,IACA,MAAA;AAAA,IACA;AAAA,GACF;AAMA,EAAA,IAAI,OAAA,CAAQ,eAAe,IAAA,EAAM;AAC/B,IAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,aAAA,CAAc,IAAI,CAAC,CAAA;AAC5C,IAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,QAAQ,IAAA,IAAQ,EAAE,CAAA,CAAE,MAAA;AAAA,MAC7C,CAAC,KAAA,KAAU,CAAC,QAAA,CAAS,IAAI,KAAK;AAAA,KAChC;AACA,IAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,MAAA,MAAM,IAAI,mBAAA;AAAA,QACR,MAAA,CAAO,GAAA;AAAA,UACL,CAAC,KAAA,KACC,CAAA,gBAAA,EAAmB,KAAK,CAAA,wFAAA;AAAA;AAC5B,OACF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,qBAAA,CACd,IAAA,EACA,OAAA,GAAiC,EAAC,EACpB;AACd,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,MAAM,IAAI,mBAAA,CAAoB,CAAC,0BAA0B,CAAC,CAAA;AAAA,EAC5D;AACA,EAAA,OAAO,iBAAA,CAAkB,QAAQ,OAAO,CAAA;AAC1C;AAKO,SAAS,SACd,KAAA,EACmC;AACnC,EAAA,MAAM,GAAA,uBAAU,GAAA,EAA0B;AAC1C,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,MAAM,CAAA,EAAG;AAC/C,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,IAAI,CAAA;AAAA,EACtE;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,UAAU,KAAA,EAA8B;AACtD,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AAC1C,IAAA,IAAI,IAAA,CAAK,OAAA,KAAY,IAAA,EAAM,OAAO,IAAA;AAAA,EACpC;AACA,EAAA,MAAM,IAAI,MAAM,oDAAoD,CAAA;AACtE;AAcO,SAAS,cAAc,IAAA,EAAuC;AACnE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9C,IAAA,KAAA,MAAW,KAAA,IAAS,OAAO,IAAA,CAAK,KAAA,CAAM,MAAM,CAAA,EAAG,GAAA,CAAI,IAAI,KAAK,CAAA;AAAA,EAC9D;AACA,EAAA,OAAO,CAAC,GAAG,GAAG,CAAA;AAChB;AASO,SAAS,QAAA,CACd,OACA,KAAA,EACyB;AACzB,EAAA,OAAO,KAAA,CAAM,MAAA,CAAO,KAAK,CAAA,EAAG,IAAA;AAC9B;AAGO,SAAS,cACd,IAAA,EACwB;AACxB,EAAA,IAAI,IAAA,EAAM,GAAA,KAAQ,MAAA,EAAW,OAAO,KAAA;AACpC,EAAA,OAAO,IAAA,CAAK,GAAA;AACd;;;AC9oBO,SAAS,aAAA,CACd,KAAA,EACA,IAAA,EACA,KAAA,EACA,EAAA,EACQ;AACR,EAAA,MAAM,QAAA,GAAW,SAAS,KAAK,CAAA,CAAE,IAAI,IAAI,CAAA,EAAG,KAAK,KAAK,CAAA;AACtD,EAAA,MAAM,QACJ,QAAA,KAAa,MAAA,IAAa,YAAY,QAAA,GAClC,QAAA,CAAS,OAAO,QAAA,GAChB,EAAA;AACN,EAAA,OAAO,OAAA,CAAQ,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AACnC;AA+BO,IAAM,oBAAA,GAAN,cAAmC,KAAA,CAAM;AAAA,EAG9C,YAA4B,OAAA,EAA4B;AACtD,IAAA,KAAA;AAAA,MACE,CAAA;AAAA,CAAA,GACE,OAAA,CAAQ,IAAI,CAAC,CAAA,KAAM,YAAO,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI;AAAA,KAC5C;AAJ0B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAK5B;AAAA,EAL4B,OAAA;AAAA,EAFV,IAAA,GAAO,sBAAA;AAAA,EAChB,IAAA,GAAO,sBAAA;AAOlB;AAOO,SAAS,iBAAiB,IAAA,EAAmC;AAClE,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,UAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,KAAK,KAAA,CAAM,IAAI,CAAA,CAAE,OAAA,EAAQ,EAAG;AACtD,IAAA,IAAI,IAAA,CAAK,IAAA,EAAK,KAAM,EAAA,EAAI;AACxB,IAAA,IAAI,MAAA;AACJ,IAAA,IAAI;AACF,MAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,IAC1B,CAAA,CAAA,MAAQ;AACN,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAA,KAAA,EAAQ,KAAA,GAAQ,CAAC,CAAA,YAAA,CAAc,CAAA;AAC5C,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM,CAAA;AAC/B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,KAAA,EAAQ,QAAQ,CAAC,CAAA,gDAAA;AAAA,OACnB;AACA,MAAA;AAAA,IACF;AACA,IAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,EACpB;AACA,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,qBAAqB,OAAO,CAAA;AAC9D,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,WAAW,KAAA,EAAsC;AACxD,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,MAAM,OAAO,MAAA;AACxD,EAAA,MAAM,MAAA,GAAS,KAAA;AACf,EAAA,IACE,OAAO,MAAA,CAAO,IAAA,KAAS,QAAA,IACvB,OAAO,MAAA,CAAO,KAAA,KAAU,QAAA,IACxB,OAAO,MAAA,CAAO,EAAA,KAAO,QAAA,EACrB;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,MAAM,MAAA,CAAO,IAAA,EAAM,OAAO,MAAA,CAAO,KAAA,EAAO,EAAA,EAAI,MAAA,CAAO,EAAA,EAAG;AACjE;AAGO,SAAS,iBAAiB,IAAA,EAAmC;AAClE,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,MAAM,IAAI,oBAAA,CAAqB,CAAC,mCAAmC,CAAC,CAAA;AAAA,EACtE;AACA,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,MAAM,UAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,MAAA,CAAO,SAAQ,EAAG;AAC3C,IAAA,MAAM,KAAA,GAAQ,WAAW,GAAG,CAAA;AAC5B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,QAC7B,iBAAiB,KAAK,CAAA,gDAAA;AAAA,OACvB,CAAA;AAAA,IACH;AACA,IAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAAA,EACpB;AACA,EAAA,OAAO,OAAA;AACT;AAYA,IAAM,kBAAA,GAAqB,CACzB,IAAA,EACA,OAAA,KACsB;AACtB,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,KAAM,UAAa,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AACnE,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,IAAI,CAAA;AACnB,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,gBAAA,EAAmB,MAAM,IAAI,CAAA,sCAAA;AAAA,KAC/B;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT,CAAA;AAEA,IAAM,OAAA,GAAU,CAAC,IAAA,EAAoB,MAAA,KAAkC;AACrE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B,mBAAmB,MAAM,CAAA,sCAAA;AAAA,KAC1B,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT,CAAA;AAGO,SAAS,cACd,IAAA,EACqC;AACrC,EAAA,MAAM,MAAiC,EAAC;AACxC,EAAA,KAAA,MAAW,CAAC,QAAQ,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA,EAAG;AACzD,IAAA,GAAA,CAAI,MAAM,CAAA,GAAI;AAAA,MACZ,IAAA,EAAM,UAAU,KAAK,CAAA;AAAA,MACrB,OAAA,EAAS,CAAA;AAAA,MACT,UAAA,EAAY,IAAA,CAAK,OAAA,CAAQ,MAAM,GAAG,UAAA,IAAc;AAAA,KAClD;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAqBO,SAAS,QAAA,CACd,KAAA,EACA,KAAA,EACA,KAAA,EACA,MAAA,EACW;AACX,EAAA,MAAM,OAAO,QAAA,CAAS,KAAK,CAAA,CAAE,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,EAAA,MAAM,IAAA,GAAO,IAAA,EAAM,EAAA,GAAK,KAAK,CAAA;AAC7B,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,IAAI,KAAA,CAAM,WAAW,KAAA,CAAM,IAAI,GAAG,QAAA,CAAS,KAAK,CAAA,KAAM,IAAA,EAAM,OAAO,KAAA;AACnE,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B,CAAA,EAAG,MAAA,KAAW,MAAA,GAAY,EAAA,GAAK,CAAA,MAAA,EAAS,MAAM,CAAA,GAAA,CAAK,CAAA,OAAA,EAAU,KAAA,CAAM,IAAI,CAAA,qBAAA,EAAwB,KAAK,CAAA,CAAA;AAAA,KACrG,CAAA;AAAA,EACH;AACA,EAAA,IAAI,YAAY,IAAA,EAAM;AAEpB,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,GAAA,IAAO,IAAA,CAAK,OAAO,QAAA,EAAS;AAAA,EAC7D;AACA,EAAA,IAAI,UAAU,IAAA,EAAM;AAGlB,IAAA,OAAO,KAAA,CAAM,OAAA,GAAU,KAAA,CAAM,UAAA,GACzB;AAAA,MACE,GAAG,KAAA;AAAA,MACH,MAAM,IAAA,CAAK,MAAA;AAAA,MACX,OAAA,EAAS,MAAM,OAAA,GAAU,CAAA;AAAA,MACzB,KAAK,KAAA,CAAM;AAAA,KACb,GACA,EAAE,GAAG,KAAA,EAAO,MAAM,IAAA,CAAK,SAAA,EAAW,GAAA,EAAK,KAAA,CAAM,IAAA,EAAK;AAAA,EACxD;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,KAAK,MAAA,EAAQ,GAAA,EAAK,MAAM,IAAA,EAAK;AACxD;AAUO,SAAS,QAAA,CACd,MACA,OAAA,EACqC;AACrC,EAAA,MAAM,OAAA,GAAU,kBAAA,CAAmB,IAAA,EAAM,OAAO,CAAA;AAChD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,qBAAqB,OAAO,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAoC,EAAE,GAAG,aAAA,CAAc,IAAI,CAAA,EAAE;AACnE,EAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AACtC,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA;AACjC,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,QAC7B,CAAA,gBAAA,EAAmB,MAAM,IAAI,CAAA,sCAAA;AAAA,OAC9B,CAAA;AAAA,IACH;AACA,IAAA,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,QAAA;AAAA,MACnB,KAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAA,CAAU,MAAM,KAAK,CAAA;AAAA,MACrB,KAAA,CAAM;AAAA,KACR;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAiCO,SAAS,QAAA,CACd,MACA,OAAA,EACyB;AACzB,EAAA,MAAM,OAAA,GAAU,kBAAA,CAAmB,IAAA,EAAM,OAAO,CAAA;AAChD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,qBAAqB,OAAO,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAoC,EAAE,GAAG,aAAA,CAAc,IAAI,CAAA,EAAE;AACnE,EAAA,MAAM,QAAwB,EAAC;AAC/B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,CAAA,IAAK,OAAA,CAAQ,SAAQ,EAAG;AAC9C,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA;AAChC,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,QAC7B,CAAA,gBAAA,EAAmB,MAAM,IAAI,CAAA,sCAAA;AAAA,OAC9B,CAAA;AAAA,IACH;AACA,IAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,KAAK,CAAA;AACnC,IAAA,MAAM,QAAQ,QAAA,CAAS,KAAA,EAAO,MAAA,EAAQ,KAAA,EAAO,MAAM,IAAI,CAAA;AACvD,IAAA,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,KAAA;AACrB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,KAAA;AAAA,MACA,IAAI,KAAA,CAAM,EAAA;AAAA,MACV,MAAM,KAAA,CAAM,IAAA;AAAA,MACZ,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,MAAM,MAAA,CAAO,IAAA;AAAA,MACb,IAAI,KAAA,CAAM,IAAA;AAAA,MACV,MAAM,aAAA,CAAc,KAAA,EAAO,OAAO,IAAA,EAAM,KAAA,EAAO,MAAM,IAAI;AAAA,KAC1D,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT;AAmCO,SAAS,YAAA,CACd,MACA,MAAA,EACmB;AACnB,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA,CAAE,MAAA;AAAA,IACzB,CAAC,WAAW,aAAA,CAAc,MAAA,CAAO,MAAM,MAAA,EAAQ,MAAM,CAAC,CAAA,KAAM;AAAA,GAC9D;AACF;AAsBO,SAAS,cAAA,CACd,MACA,MAAA,EACuB;AACvB,EAAA,MAAM,OAAA,GAAU,CAAC,MAAA,KACf,aAAA,CAAc,OAAO,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAC,CAAA,KAAM,KAAA;AAClD,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,IAAA,EAAM,MAAM,CAAA;AACxC,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,OAAO,KAAA,KAAU;AACvC,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,MAAA,KAAW,MAAA,CAAO,QAAA,CAAS,MAAM,CAAC,CAAA;AACtE,IAAA,MAAM,IAAA,GAAO,EAAE,IAAA,EAAM,KAAA,CAAM,MAAM,KAAA,EAAO,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,OAAA,EAAQ;AACpE,IAAA,IAAI,SAAS,OAAO,EAAE,GAAG,IAAA,EAAM,UAAU,SAAA,EAAmB;AAC5D,IAAA,IAAI,CAAC,KAAA,CAAM,KAAA,CAAM,KAAA,CAAM,OAAO,CAAA,EAAG;AAC/B,MAAA,OAAA,GAAU,IAAA;AACV,MAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,QAAA,EAAkB;AAAA,IAChD;AACA,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,OAAA,GAAU,IAAA;AACV,MAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,SAAA,EAAmB;AAAA,IACjD;AACA,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,UAAA,EAAoB;AAAA,EAClD,CAAC,CAAA;AACH;AAkBO,SAAS,mBAAA,CACd,QACA,SAAA,EACoB;AACpB,EAAA,IAAI,OAAO,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,aAAa,SAAS,CAAA;AACrD,IAAA,OAAO,SAAA,CAAU,OAAA;AACnB,EAAA,IAAI,MAAA,CAAO,KAAK,CAAC,KAAA,KAAU,MAAM,QAAA,KAAa,QAAQ,GAAG,OAAO,MAAA;AAChE,EAAA,OAAO,SAAA,CAAU,QAAA;AACnB;AAYO,SAAS,gBAAA,CACd,MACA,MAAA,EACY;AACZ,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,IAAA,EAAM,MAAM,CAAA;AAExC,EAAA,MAAM,UAAmC,EAAC;AAC1C,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACpD,IAAA,OAAA,CAAQ,MAAM,CAAA,GAAI;AAAA,MAChB,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,YAAY,KAAA,CAAM,UAAA;AAAA,MAClB,GAAI,IAAA,CAAK,OAAA,CAAQ,MAAM,CAAA,EAAG,UAAU;AAAC,KACvC;AAAA,EACF;AACA,EAAA,OAAA,CAAQ,MAAA,GAAS,MAAA;AAEjB,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,IAAA,EAAM,MAAM,CAAA;AAC1C,EAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,MAAA,EAAQ,IAAA,CAAK,SAAS,CAAA;AAC3D,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,EAAE,UAAA,EAAY,QAAA,EAAU,MAAA,EAAQ,QAAQ,OAAA,EAAQ;AAAA,EACzD;AAGA,EAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,aAAa,QAAQ,CAAA;AACjE,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,OAAO,EAAE,UAAA,EAAY,IAAA,CAAK,UAAU,QAAA,EAAU,MAAA,EAAQ,QAAQ,OAAA,EAAQ;AAAA,EACxE;AAEA,EAAA,MAAM,UAAA,GAA8D;AAAA,IAClE,CAAC,MAAA,CAAO,IAAI,GAAG,MAAA,CAAO,WAAA;AAAA,MACpB,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,MAAA,EAAQ,MAAA,CAAO,MAAM,CAAA,EAAG,IAAA,IAAQ,GAAG,CAAC;AAAA;AACpE,GACF;AACA,EAAA,KAAA,MAAW,SAAS,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,KAAA,GAAQ,CAAC,CAAA,EAAG;AAClD,IAAA,UAAA,CAAW,KAAA,CAAM,IAAI,CAAA,GAAI,SAAA;AAAA,EAC3B;AACA,EAAA,OAAO,EAAE,UAAA,EAAY,MAAA,EAAQ,QAAA,EAAU,OAAA,EAAQ;AACjD;AAEA,SAAS,MAAA,CAAO,IAAA,EAAoB,MAAA,EAAgB,MAAA,EAAoB;AACtE,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,EAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW,OAAO,MAAA;AACvD,EAAA,OAAO,QAAA,CAAS,KAAK,CAAA,CAAE,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC;AAGO,SAAS,gBAAgB,IAAA,EAA0B;AACxD,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,EAC1B,CAAA,CAAA,MAAQ;AACN,IAAA,MAAM,IAAI,oBAAA,CAAqB,CAAC,kCAAkC,CAAC,CAAA;AAAA,EACrE;AACA,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,MAAA,KAAW,IAAA,EAAM;AACjD,IAAA,MAAM,IAAI,oBAAA,CAAqB,CAAC,uCAAuC,CAAC,CAAA;AAAA,EAC1E;AACA,EAAA,MAAM,MAAA,GAAS,MAAA;AAKf,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,QAAA,IAAY,MAAA,CAAO,WAAW,MAAA,EAAQ;AAC1D,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,IAAI,MAAA,CAAO,eAAe,MAAA,EAAW;AACnC,IAAA,MAAM,IAAI,oBAAA,CAAqB;AAAA,MAC7B;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,OAAO;AAAA,IACL,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,QAAQ,MAAA,CAAO,MAAA;AAAA,IACf,OAAA,EACE,OAAO,MAAA,CAAO,OAAA,KAAY,QAAA,IAAY,OAAO,OAAA,KAAY,IAAA,GACpD,MAAA,CAAO,OAAA,GACR;AAAC,GACT;AACF;;;ACxeA,IAAM,cAAA,GAAiB,CAAC,CAAA,KACtB,OAAO,MAAM,QAAA,IACb,CAAA,KAAM,IAAA,IACN,KAAA,CAAM,QAAS,CAAA,CAAmB,MAAM,CAAA,IACxC,OAAQ,EAAmB,MAAA,KAAW,QAAA;AAGxC,SAAS,gBAAgB,MAAA,EAAwC;AAC/D,EAAA,IAAI,OAAO,MAAA,CAAO,UAAA,KAAe,QAAA,EAAU,OAAO,MAAA;AAClD,EAAA,KAAA,MAAW,CAAC,MAAM,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,EAAG;AAC7D,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,IAAA;AAAA,EACxC;AACA,EAAA,OAAO,MAAA;AACT;AAGA,IAAM,MAAA,GAAS,CAAC,MAAA,KACd,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,EAAA,CAAI,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA;AAazC,SAAS,MAAA,CACP,MAAA,EACA,KAAA,EACA,MAAA,EACQ;AACR,EAAA,IAAI,WAAW,KAAA,EAAO;AACpB,IAAA,OAAO,CAAA,WAAA,EAAc,KAAK,CAAA,qBAAA,EAAmB,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAAA,EAC7D;AACA,EAAA,IAAI,WAAW,KAAA,EAAO;AACpB,IAAA,OAAO,CAAA,aAAA,EAAgB,KAAK,CAAA,2BAAA,EAAyB,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAAA,EACrE;AACA,EAAA,OAAO,GAAG,MAAA,CAAO,KAAK,CAAA,GAAA,EAAM,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAC5C;AAGA,IAAM,SAAA,GAAY,CAAC,MAAA,KACjB,OAAO,WAAW,QAAA,GAAW,MAAA,GAAS,CAAA,MAAA,EAAS,MAAA,CAAO,KAAK,CAAA,CAAA;AAgBtD,SAAS,SAAA,CAAU,OAAsB,KAAA,EAA8B;AAC5E,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAK,CAAA,CAAE,IAAI,KAAK,CAAA;AACtC,EAAA,IAAI,IAAA,EAAM,GAAA,KAAQ,MAAA,EAAW,OAAO,IAAA;AACpC,EAAA,MAAM,SAAS,MAAA,CAAO,IAAA,CAAK,IAAA,EAAM,EAAA,IAAM,EAAE,CAAA;AACzC,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAGvB,IAAA,OAAO,KAAK,KAAK,CAAA,2CAAA,CAAA;AAAA,EACnB;AAGA,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAuD;AAC1E,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,KAAA,EAAO,KAAK,CAAA;AACpC,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,UAAA,CAAW,KAAK,KAAK,CAAA;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,UAAU,MAAM,CAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,KAAA,KAAU,MAAA,EAAW,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,EAAE,MAAA,EAAQ,MAAA,EAAQ,CAAC,KAAK,CAAA,EAAG,CAAA;AAAA,SAC/D,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA;AAAA,EAC9B;AAIA,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG,OAAO,KAAK,KAAK,CAAA,WAAA,EAAc,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAEpE,EAAA,MAAM,QAAQ,CAAC,GAAG,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,CAAA,KACtC,MAAA,CAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,EAAE,MAAM;AAAA,GAClC;AAGA,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAG,MAAA,CAAO,UAAU,CAAC,CAAA,uCAAA,CAAyC,CAAA;AAAA,EAC3E;AACA,EAAA,OAAO,KAAA,CAAM,KAAK,QAAK,CAAA;AACzB;AAGA,SAAS,SAAA,CAAU,OAAsB,KAAA,EAAiC;AACxE,EAAA,IAAI,KAAA,CAAM,OAAA,IAAW,CAAA,EAAG,OAAO,IAAA;AAC/B,EAAA,MAAM,SAAS,CAAA,EAAG,KAAA,CAAM,OAAO,CAAA,CAAA,EAAI,MAAM,UAAU,CAAA,CAAA;AACnD,EAAA,IAAI,MAAM,OAAA,GAAU,KAAA,CAAM,UAAA,EAAY,OAAO,gBAAgB,MAAM,CAAA,CAAA;AAGnE,EAAA,MAAM,OAAO,QAAA,CAAS,KAAK,CAAA,CAAE,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,MAAA,CAAO,QAAQ,IAAA,EAAM,EAAA,IAAM,EAAE,CAAA,EAAG;AAC1D,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,OAAO,gBAAgB,MAAM,CAAA,qBAAA,EAAmB,KAAK,CAAA,UAAA,EAAa,KAAK,SAAS,CAAA,EAAA,CAAA;AAAA,IAClF;AAAA,EACF;AACA,EAAA,OAAO,gBAAgB,MAAM,CAAA,aAAA,CAAA;AAC/B;AAYA,SAAS,SAAA,CACP,OACA,MAAA,EACQ;AACR,EAAA,MAAM,KAAA,GAAQ,CAAA,EAAG,KAAA,CAAM,KAAA,CAAM,MAAM,CAAA,KAAA,EAAQ,KAAA,CAAM,KAAA,CAAM,MAAA,KAAW,CAAA,GAAI,EAAA,GAAK,GAAG,CAAA,CAAA;AAC9E,EAAA,IAAI,KAAA,CAAM,aAAa,SAAA,EAAW;AAChC,IAAA,OAAO,CAAA,EAAA,EAAK,KAAA,CAAM,IAAI,CAAA,mBAAA,EAAiB,KAAK,CAAA,cAAA,CAAA;AAAA,EAC9C;AACA,EAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAClB,GAAA;AAAA,IACC,CAAC,MAAA,KACC,CAAA,EAAA,EAAK,MAAM,CAAA,OAAA,EAAU,OAAO,MAAM,CAAA,EAAG,IAAA,IAAQ,GAAG,KAC9C,KAAA,CAAM,OAAA,CAAQ,SAAS,MAAM,CAAA,GAAI,mBAAmB,EACtD,CAAA;AAAA,GACJ,CACC,KAAK,IAAI,CAAA;AACZ,EAAA,OAAO,CAAA,EAAA,EAAK,MAAM,IAAI,CAAA,IAAA,EAAO,MAAM,QAAQ,CAAA,QAAA,EAAM,KAAK,CAAA,EAAA,EAAK,MAAM,CAAA,CAAA;AACnE;AAEA,SAAS,cAAc,KAAA,EAAwC;AAC7D,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA;AACnB,IAAA,OAAO,0DAAA;AACT,EAAA,MAAM,OAAO,KAAA,CAAM,GAAA;AAAA,IACjB,CAAC,MACC,CAAA,EAAA,EAAK,CAAA,CAAE,QAAQ,CAAC,CAAA,GAAA,EAAM,EAAE,EAAE,CAAA,KAAA,EAAQ,EAAE,IAAI,CAAA,OAAA,EAAU,EAAE,KAAK,CAAA,OAAA,EAAU,EAAE,IAAI,CAAA,YAAA,EAAU,EAAE,EAAE,CAAA,IAAA;AAAA,GAC3F;AACA,EAAA,OAAO;AAAA,IACL,4CAAA;AAAA,IACA,uBAAA;AAAA,IACA,GAAG;AAAA,GACL,CAAE,KAAK,IAAI,CAAA;AACb;AAQO,SAAS,WAAW,KAAA,EAAoC;AAC7D,EAAA,MAAM,IAAA,GAAO,eAAe,KAAA,CAAM,QAAQ,IACtC,KAAA,CAAM,QAAA,GACN,iBAAA,CAAkB,KAAA,CAAM,QAAQ,CAAA;AACpC,EAAA,MAAM,UAAU,KAAA,CAAM,OAAA;AACtB,EAAA,MAAM,MAAA,GAAS,QAAA,CAAS,IAAA,EAAM,OAAO,CAAA;AACrC,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,MAAA,IAAU,gBAAA,CAAiB,MAAM,MAAM,CAAA;AAC5D,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,IAAA,EAAM,OAAO,CAAA;AAEpC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,IAAS,IAAA,CAAK,EAAA,IAAM,MAAA;AACxC,EAAA,MAAM,GAAA,GAAgB,CAAC,CAAA,GAAA,EAAM,KAAK,WAAM,MAAA,CAAO,MAAM,IAAI,EAAE,CAAA;AAG3D,EAAA,GAAA,CAAI,KAAK,CAAA,iBAAA,EAAoB,kBAAA,CAAmB,MAAA,CAAO,UAAU,CAAC,CAAA,CAAE,CAAA;AACpE,EAAA,IAAI,IAAA,CAAK,YAAY,MAAA,EAAW,GAAA,CAAI,KAAK,CAAA,gBAAA,EAAmB,IAAA,CAAK,OAAO,CAAA,EAAA,CAAI,CAAA;AAC5E,EAAA,MAAM,MAAA,GAAS,OAAO,OAAA,CAAQ,MAAA;AAC9B,EAAA,IAAI,MAAM,OAAA,CAAQ,MAAM,CAAA,IAAK,MAAA,CAAO,SAAS,CAAA,EAAG;AAC9C,IAAA,GAAA,CAAI,IAAA;AAAA,MACF,gBAAgB,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,KAAK,MAAA,CAAO,CAAC,CAAC,CAAA,EAAA,CAAI,EAAE,IAAA,CAAK,IAAI,CAAC,CAAA,4BAAA,EAA0B,IAAA,CAAK,UAAU,OAAO,CAAA,EAAA;AAAA,KAClH;AAAA,EACF;AACA,EAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAYX,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,IAAA,EAAM,MAAM,CAAA;AAC1C,EAAA,MAAM,KAAA,GAAQ,gBAAgB,MAAM,CAAA;AACpC,EAAA,MAAM,MAAA,GACJ,MAAA,CAAO,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,KAAK,CAAA,IACnC,OAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,aAAa,QAAQ,CAAA;AAE5C,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,UAAU,MAAA,EAAQ;AAUpB,MAAA,MAAM,YAAsB,EAAC;AAC7B,MAAA,KAAA,MAAW,MAAA,IAAU,MAAM,KAAA,EAAO;AAChC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,QAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,QAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW;AAChD,QAAA,IAAI,MAAM,IAAA,KAAS,SAAA,CAAU,KAAK,CAAA,EAAG,SAAA,CAAU,KAAK,MAAM,CAAA;AAAA,MAC5D;AAKA,MAAA,IAAI,UAAU,MAAA,KAAW,KAAA,CAAM,KAAA,CAAM,MAAA,YAAkB,KAAA,EAAM;AAC7D,MAAA,KAAA,MAAW,MAAA,IAAU,MAAM,KAAA,EAAO;AAChC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAChC,QAAA,MAAM,KAAA,GAAQ,OAAO,MAAM,CAAA;AAC3B,QAAA,IAAI,KAAA,KAAU,MAAA,IAAa,KAAA,KAAU,MAAA,EAAW;AAChD,QAAA,IAAI,SAAA,CAAU,QAAA,CAAS,MAAM,CAAA,EAAG;AAChC,QAAA,MAAM,QAAA,GAAW,cAAc,QAAA,CAAS,KAAK,EAAE,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA;AAC9D,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,CAAA,IAAA,EAAO,MAAM,CAAA,UAAA,EAAQ,KAAA,CAAM,IAAI,CAAA,EAAA,EAAK,QAAA,KAAa,OAAA,GAAU,iBAAA,GAAe,EAAE,CAAA;AAAA,SAC9E;AACA,QAAA,MAAM,OAAA,GAAU,SAAA,CAAU,KAAA,EAAO,KAAA,CAAM,IAAI,CAAA;AAC3C,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,OAAA,KAAY,IAAA,GACR,CAAA,gBAAA,EAAmB,OAAO,KAC1B,QAAA,KAAa,OAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAKX,CAAA,qEAAA,EAAmE,KAAA,CAAM,IAAI,CAAA,UAAA,EAAa,MAAM,IAAI,CAAA,+CAAA;AAAA,cACpG;AAAA,SACR;AACA,QAAA,MAAM,OAAA,GAAU,SAAA,CAAU,KAAA,EAAO,KAAK,CAAA;AACtC,QAAA,IAAI,OAAA,KAAY,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AACtC,QAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,QAAA,GAAA,CAAI,KAAK,YAAY,CAAA;AACrB,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,SAAS,KAAA,EAAO;AAAA,YACd,SAAS,KAAA,CAAM,IAAA;AAAA,YACf,MAAA,EAAQ,YAAY,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC;AAAA,WAC3D;AAAA,SACH;AACA,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,QAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,MACb;AACA,MAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AAGxB,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,CAAC,CAAW,CAAA;AAChD,QAAA,MAAM,KACJ,KAAA,KAAU,MAAA,GAAY,sBAAsB,CAAA,EAAA,EAAK,SAAA,CAAU,KAAK,CAAC,CAAA,EAAA,CAAA;AACnE,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,CAAA,qBAAA,EAAwB,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,EAAA,CAAI,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,oBAAe,EAAE,CAAA,CAAA;AAAA,SACtF;AACA,QAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,MACb;AACA,MAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,MAAM,CAAC,CAAA;AACjC,IAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AAAA,EACb;AAGA,EAAA,GAAA,CAAI,KAAK,cAAc,CAAA;AACvB,EAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,EAAA,GAAA,CAAI,IAAA,CAAK,aAAA,CAAc,KAAK,CAAC,CAAA;AAC7B,EAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,CAAA,EAAG,GAAA,CACV,IAAA,CAAK,IAAI,CAAA,CACT,OAAA,CAAQ,SAAA,EAAW,MAAM,CAAA,CACzB,OAAA,EAAS;AAAA;AAAA,GACd;AACF;AAEA,SAAS,mBAAmB,KAAA,EAAyC;AACnE,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,KAAK,KAAK,CAAA,+BAAA,CAAA;AAChD,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AACjD,IAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,KAAK,CAAA,IAAA,EAAO,IAAI,CAAA,CAAE,CAAA;AAClC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,QAAQ,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,CAC9B,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,KAAK,CAAA,KAAM,KAAK,IAAI,CAAA,OAAA,EAAU,KAAK,CAAA,EAAA,CAAI,CAAA,CACnD,KAAK,IAAI,CAAA;AACZ,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,KAAK,CAAA,UAAA,EAAQ,KAAK,CAAA,CAAE,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,KAAA,CAAM,KAAK,QAAK,CAAA;AACzB","file":"chunk-NR7BU22N.js","sourcesContent":["// ═══════════════════════════════════════════════════════════════════════════\n// THE DIAGRAM SEAM — now a translation, not a drawing.\n//\n// This file used to hold a SECOND mermaid renderer, standing in until\n// `chartMermaid` grew an options bag. It grew one, so the swap this banner\n// promised has happened: `drawTask` is the report's door onto the one renderer\n// in `../compile`, and the two facts a report needs on top of the chart —\n// WHERE THE TASK IS NOW and WHICH EDGES IT WALKED — are options on that\n// drawing rather than a drawing of their own.\n//\n// The seam itself is unchanged and is why the swap was one function wide: the\n// report's markdown layout, its vocabulary and its timeline do not know how a\n// diagram is made.\n//\n// WHY THIS FILE STILL EXISTS rather than the report calling `chartMermaid`\n// directly. `chartMermaid` is typed `<const C extends Chart<C>>` — the\n// F-bounded literal chart, whose state and event names are literal types the\n// compiler recovered from a source literal. A report draws an `ImportedChart`,\n// whose every name is a runtime `string` read out of somebody's\n// `workflow.json`. That widening is real and it is not the report's to make at\n// eight call sites: it is made here, once, with the reason written next to it.\n// ═══════════════════════════════════════════════════════════════════════════\nimport { chartMermaid, type WalkCounts } from \"../compile\";\nimport type { ImportedChart } from \"./workflow\";\n\nexport { edgeKey, type WalkCounts } from \"../compile\";\n\nexport interface DrawOptions {\n  /** The state the task is in right now — lit. */\n  readonly current?: string;\n  /** Edges the log actually walked, keyed `${from}|${event}|${to}`. */\n  readonly walked?: WalkCounts;\n}\n\n/**\n * One task's region as a mermaid `stateDiagram-v2` block, with the current node\n * lit, the walked edges marked and the two endings drawn apart.\n *\n * `polarity` is always on: a lane's whole point is that `shipped` and `frozen`\n * are not the same ending, and a report that painted them alike would be lying\n * in the place a reader looks first. It is an OPTION on the renderer rather\n * than a default because a chart drawing is something a reviewer approves —\n * see `ChartMermaidOptions.polarity`.\n */\nexport function drawTask(chart: ImportedChart, opts: DrawOptions = {}): string {\n  return chartMermaid(chart as never, {\n    polarity: true,\n    ...(opts.current === undefined ? {} : { highlight: opts.current }),\n    ...(opts.walked === undefined ? {} : { walked: opts.walked }),\n  });\n}\n\n/**\n * The edges a log walked, counted — the input `drawTask` marks from.\n *\n * Reads each step's DECLARED `edge` rather than recomputing one from\n * `from`/`event`/`to`: a resume edge is drawn to its fallback and walked to\n * wherever `was` pointed, so the observed target names an edge the drawing does\n * not have. `TimelineStep.edge` is the edge that actually fired.\n */\nexport function walkedEdges(\n  steps: readonly { readonly edge: string }[],\n): WalkCounts {\n  const counts = new Map<string, number>();\n  for (const step of steps) {\n    counts.set(step.edge, (counts.get(step.edge) ?? 0) + 1);\n  }\n  return counts;\n}\n","// ═══════════════════════════════════════════════════════════════════════════\n// THE IMPORTER — one `workflow.json` in, one chart per task out.\n//\n// This is the mirror of `kamp-us/phoenix` `packages/fabrika-cli/src/lane/\n// machine.ts`, and it is deliberately STRUCTURAL in exactly the same three\n// places, because that is what makes the two agree:\n//\n//   an `on` string           → `{ target }`\n//   an `on` two-arm array    → `{ target, when, otherwise }`   (guarded)\n//   a target of `type: \"history\"` → `{ resume: { fallback: <region initial> } }`\n//   `type: \"final\"`          → `end: true`\n//   …reached as an array's fallthrough → `end: \"error\"`\n//   machine-level `type: \"parallel\"` → a phase; its `onDone` pair → the terminals\n//\n// GRAMMAR, NEVER VOCABULARY. Every rule above is about what makes a document\n// WELL-FORMED — a state routes events to targets, a guarded edge is a two-arm\n// array, a `history` target means resume, a `final` is terminal. None of them\n// is about WHICH NAMES a consumer chose. So the event alphabet is read OFF the\n// document: a name a state declares is, by definition, an event of that\n// document, and there is no list here for it to be absent from.\n//\n// That is not a relaxation for its own sake. This file used to carry a consumer's\n// six event names as a closed set, which meant one upstream commit adding a\n// seventh took the importer offline for every document, not just the new one —\n// the same failure mode the report had when it matched STATE names, and the same\n// fix: enforce the shape, read the names.\n//\n// No guard name and no action name is ever dereferenced here, for the same\n// reason fabrika does not dereference them: the ARRAY is the guard. The name\n// travels into the chart's `when` because the chart draws it, and the fold\n// applies the one inline predicate (`retries < maxRetries`) the compiler\n// applies, whatever the name says. An event name is the same kind of thing.\n// ═══════════════════════════════════════════════════════════════════════════\n\nimport type { EventOrigin } from \"../graph\";\n\n/** `TASK_1.DONE` and `DONE` are the same event; the namespace is presentation. */\nexport const bareEvent = (event: string): string => {\n  const dot = event.indexOf(\".\");\n  return dot === -1 ? event : event.slice(dot + 1);\n};\n\n// ── the imported chart's shape ─────────────────────────────────────────────\n//\n// RUNTIME-TYPED, and the doc comment on `chartFromWorkflow` says why. These\n// interfaces are the chart's VALUE shape narrowed to the three edge forms a\n// fabrika region can produce — not `Chart<C>`, whose whole content is literal\n// types recovered from a literal the compiler can see.\n\n/** A declarative edge, in the only three forms a lane region can produce. */\n/**\n * `cmd` / `otherwiseCmd` are carried but never AUTHORED here: a `workflow.json`\n * declares no effects, so an imported edge simply has neither. They exist\n * because the TYPED door has them and lowering used to drop them, which left a\n * lane page able to say where a click LANDS and never what it FIRES — a fact\n * the author wrote down, lost in translation.\n */\ntype ImportedCmds = {\n  readonly cmd?: string | readonly string[];\n  readonly otherwiseCmd?: string | readonly string[];\n};\n\nexport type ImportedEdge =\n  | ({ readonly target: string } & ImportedCmds)\n  | ({\n      readonly target: string;\n      readonly when: string;\n      readonly otherwise: string;\n    } & ImportedCmds)\n  | ({ readonly resume: { readonly fallback: string } } & ImportedCmds);\n\nexport interface ImportedNode {\n  readonly initial?: true;\n  readonly on?: Readonly<Record<string, ImportedEdge>>;\n  /** `true` success final, `\"error\"` the fallthrough final that trips the lane. */\n  readonly end?: true | \"error\";\n}\n\n/** One task's region, as a chart value. One phase group, named by the phase. */\nexport interface ImportedChart {\n  readonly events: Readonly<\n    Record<\n      string,\n      {\n        readonly scope: \"edges\";\n        /**\n         * Where this event comes from — the chart's `from`, at runtime.\n         *\n         * OPTIONAL, and its absence is the document's honest answer:\n         * `workflow.json` records the topology and nothing about who sends\n         * what, so this is present exactly when the caller supplied it at\n         * {@link chartFromWorkflow}.\n         */\n        readonly from?: EventOrigin;\n      }\n    >\n  >;\n  readonly states: Readonly<\n    Record<string, Readonly<Record<string, ImportedNode>>>\n  >;\n  /**\n   * State name → the events that state ACCEPTS AND DROPS, leaving itself alone.\n   *\n   * THE THIRD ANSWER. A lane state either routes an event, or refuses it, or\n   * cannot replay it — tea's runtime has always had all three (`compile`'s\n   * `refused` self-loops a pair the state's `ignore` names or the event's\n   * `scope` does not address, and only a LIVE-but-undecided pair throws), and\n   * the lowered chart could carry only two. So `stepTask` threw\n   * `UnreplayableLogError` on a log `runLane` had accepted without blinking: a\n   * run and a report of that run disagreeing, which is the one thing this\n   * module promises they cannot do.\n   *\n   * IT IS ON THE CHART, NOT ON THE NODE, and that is deliberate.\n   * {@link ImportedNode} is a MIRROR of the node fabrika's own compiler emits —\n   * `golden.test.ts` compares the two — so a field fabrika never produces does\n   * not belong inside it. This is our layer's annotation about someone else's\n   * shape, and it sits one level out where it reads as one.\n   *\n   * ABSENT AT THE IMPORTED DOOR, always. A refusal is a fact about a state's\n   * `ignore` and an event's `scope`, and `workflow.json` records neither — so\n   * `chartFromWorkflow` writes none, an imported chart is the same value it\n   * always was, and an imported log naming an unrouted event is still refused\n   * loudly. Only `defineLane`'s lowering, which can SEE the two, fills it in.\n   */\n  readonly refusals?: Readonly<Record<string, readonly string[]>>;\n}\n\nexport interface ImportedPhase {\n  readonly name: string;\n  readonly tasks: readonly string[];\n}\n\nexport interface ImportedLane {\n  /** The document's own `id`, when it carries one. */\n  readonly id?: string;\n  /** What fires this lane — a chore workflow's own field, carried not invented. */\n  readonly trigger?: string;\n  readonly phases: readonly ImportedPhase[];\n  /** The workflow's two terminals, read off the last phase's `onDone` pair. */\n  readonly terminals: { readonly complete: string; readonly tripped: string };\n  /** One chart per task id — the ask's `charts`. */\n  readonly charts: Readonly<Record<string, ImportedChart>>;\n  /**\n   * The document's `context` per task, minus the retry bookkeeping the fold\n   * owns. `maxRetries` is split out because it is a transition input, not a\n   * passenger — the guarded arm reads it.\n   */\n  readonly context: Readonly<\n    Record<\n      string,\n      {\n        readonly maxRetries: number;\n        readonly extras: Readonly<Record<string, unknown>>;\n      }\n    >\n  >;\n}\n\n/**\n * THE ONE PLACE PROVENANCE ENTERS.\n *\n * `workflow.json` carries topology and nothing else: it says `queued --WIP-->\n * build` and it does not say, and has never said, who sends a `WIP`. That fact\n * lives in fabrika's CODE, not in fabrika's document — so it cannot be read\n * here and it must not be guessed here.\n *\n * So the caller states it, ONCE, at the seam where their world meets ours, and\n * everything downstream derives from that: the charts carry it, the report\n * groups by it, the inspector reports it. One map, at the boundary the\n * information actually crosses — not a default sprinkled through the readers,\n * and not a table of fabrika's own event names baked in as a fallback, which\n * would put us right back to owning a copy of someone else's vocabulary.\n *\n * ```ts\n * chartFromWorkflow(document, {\n *   from: {\n *     WIP: { world: \"the operator\" },\n *     BLOCKED: { world: \"the operator\" },\n *     UNBLOCKED: { world: \"a human\" },\n *     DONE: \"cmd\",\n *     PASS: \"cmd\",\n *     FAIL: \"cmd\",\n *   },\n * });\n * ```\n *\n * Omit it and every reader degrades honestly — it says which events a state\n * accepts and refuses to say who they come from.\n */\nexport interface WorkflowImportOptions {\n  /**\n   * Event name → where its Msg comes from. Keyed by the BARE name, so one\n   * entry covers every task's namespaced spelling of it (`ISSUE.WIP`,\n   * `PARK_SWEEP.WIP`) — the namespace is presentation, the event is the event.\n   *\n   * A name with no entry is left undeclared rather than defaulted. \"I do not\n   * know\" and \"the outside world\" are different answers and only one of them\n   * is safe to invent.\n   */\n  readonly from?: Readonly<Record<string, EventOrigin>>;\n  /**\n   * Refuse a `from` key that names no event THIS document routes.\n   *\n   * The silent drop it closes is real: `UNBLOKED: { world: \"a human\" }` imports\n   * clean, and every reader downstream then answers \"the chart does not say\"\n   * for the one event the caller had just taken the trouble to declare. The\n   * cross-check needs no list of ours — {@link eventAlphabet} derives the\n   * document's own alphabet, which is precisely what that function exists for\n   * and what nothing was calling.\n   *\n   * OPT-IN, because the map is legitimately WIDER than one document. A\n   * consumer's cast is a property of their world, not of one template, so one\n   * `from` covers every workflow they run — `src/chart/report/__fixtures__/\n   * origins.ts` states fabrika's six once and imports two templates with it,\n   * and the chore template routes neither `PASS` nor `FAIL`. Defaulting to\n   * strict would make sharing a cast an error, which is the wrong half of the\n   * trade. So the caller says which of the two they meant: pass this when the\n   * map was written FOR this document, and a typo in it stops compiling.\n   */\n  readonly strictFrom?: true;\n}\n\n/**\n * The document does not fit — with EVERY defect named, never a half-import.\n *\n * Same contract as fabrika's `Malformed`: a `workflow.json` that cannot be\n * compiled comes back as a list of reasons rather than as a machine that works\n * for some states. Thrown rather than returned because the chart module's other\n * doors throw too (`initialStateOf`, `CellTargetError`) and an importer that\n * returned a union would be the only one a caller could forget to check.\n */\nexport class WorkflowImportError extends Error {\n  override readonly name = \"WorkflowImportError\";\n  readonly _tag = \"WorkflowImportError\" as const;\n  constructor(public readonly defects: readonly string[]) {\n    super(\n      `@demlik/tea: this workflow.json does not compile to charts —\\n` +\n        defects.map((d) => `  • ${d}`).join(\"\\n\"),\n    );\n  }\n}\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === \"object\" && v !== null && !Array.isArray(v);\n\nconst nodeType = (node: unknown): string | undefined =>\n  isRecord(node) && typeof node.type === \"string\" ? node.type : undefined;\n\n/**\n * The retry budget a document inherits when its `context` names none.\n *\n * Exported because the fold needs the same number when it boots a task the\n * document's `context` never mentioned, and a default spelled in two files is\n * a default that drifts in one of them.\n */\nexport const RETRY_BUDGET = 2;\n\n/**\n * The `when` a guarded arm carries when the document names no guard.\n *\n * A DESCRIPTION OF THE GRAMMAR, not a borrowed name. A two-arm array means\n * \"retry while the budget holds, else fall through\" in every document, because\n * that is what the array IS — so when the author wrote no label, the label says\n * the thing the array already said. Defaulting to some consumer's guard name\n * (`retriesRemaining`) would print their word over another consumer's document.\n */\nconst DEFAULT_GUARD = \"retries remain\";\n\ninterface RegionImport {\n  readonly node?: Readonly<Record<string, ImportedNode>>;\n  readonly defects: readonly string[];\n}\n\n/** One task region → the phase group's state bag. `hist` is DROPPED, not kept. */\nfunction importRegion(taskId: string, region: unknown): RegionImport {\n  const defects: string[] = [];\n  if (\n    !isRecord(region) ||\n    !isRecord(region.states) ||\n    typeof region.initial !== \"string\"\n  ) {\n    return {\n      defects: [\n        `task \"${taskId}\": region must carry string \\`initial\\` and \\`states\\``,\n      ],\n    };\n  }\n  const states = region.states;\n  const initialState = region.initial;\n  if (states[initialState] === undefined) {\n    defects.push(\n      `task \"${taskId}\": initial state \"${initialState}\" is not in \\`states\\``,\n    );\n  }\n\n  // Pass 1: which names are finals at all. The polarity needs the whole set\n  // before any edge is read, because an error final is recognised by the edge\n  // that REACHES it and the edge may be declared before the state.\n  const finals = new Set<string>();\n  for (const [name, node] of Object.entries(states)) {\n    if (nodeType(node) === \"final\") finals.add(name);\n  }\n  const errorFinals = new Set<string>();\n\n  // Pass 2: the edges.\n  const on: Record<string, Record<string, ImportedEdge>> = {};\n  for (const [stateName, node] of Object.entries(states)) {\n    // `hist` IS a state node in the document and is NOT a chart state: the\n    // chart carries history as a property of the EDGE (`resume`), which is why\n    // it needs no pseudo-state to point at. Dropping it here is the same drop\n    // fabrika's compiler makes, one line above its own table build.\n    if (nodeType(node) === \"history\") continue;\n    const edges: Record<string, ImportedEdge> = {};\n    on[stateName] = edges;\n    if (!isRecord(node)) {\n      defects.push(`task \"${taskId}\": state \"${stateName}\" is not an object`);\n      continue;\n    }\n    const raw = node.on ?? {};\n    if (!isRecord(raw)) {\n      defects.push(\n        `task \"${taskId}\": state \"${stateName}\" carries a non-object \\`on\\``,\n      );\n      continue;\n    }\n    // Which bare name each spelling in THIS state collapsed to, so the one\n    // event-name rule that IS grammatical can be checked: a state holds one\n    // cell per event, so two spellings of one event in one state is a document\n    // that means two things by the same edge. Nothing here cares WHICH names.\n    const spelledAs = new Map<string, string>();\n    for (const [eventName, transition] of Object.entries(raw)) {\n      const event = bareEvent(eventName);\n      if (event === \"\") {\n        defects.push(\n          `task \"${taskId}\": state \"${stateName}\" listens for \"${eventName}\", which names no event once its namespace is stripped`,\n        );\n        continue;\n      }\n      const already = spelledAs.get(event);\n      if (already !== undefined) {\n        defects.push(\n          `task \"${taskId}\": state \"${stateName}\" spells the same event twice — \"${already}\" and \"${eventName}\" are both \\`${event}\\`, and a state routes each event once`,\n        );\n        continue;\n      }\n      spelledAs.set(event, eventName);\n\n      // ── the guarded array ────────────────────────────────────────────────\n      if (Array.isArray(transition)) {\n        const arms = transition.map((arm) =>\n          isRecord(arm) && typeof arm.target === \"string\"\n            ? arm.target\n            : undefined,\n        );\n        const [retry, fallthrough] = arms;\n        if (\n          transition.length !== 2 ||\n          retry === undefined ||\n          fallthrough === undefined\n        ) {\n          defects.push(\n            `task \"${taskId}\": guarded \"${eventName}\" must be a two-arm array of \\`{target}\\` — [retry-while-retries-remain, else-fallthrough]`,\n          );\n          continue;\n        }\n        for (const target of [retry, fallthrough]) {\n          if (states[target] === undefined) {\n            defects.push(\n              `task \"${taskId}\": \"${eventName}\" targets unknown state \"${target}\"`,\n            );\n          }\n        }\n        // THE POLARITY, recognised exactly where fabrika recognises it: a final\n        // reached as the fallthrough is the task's error terminal.\n        if (finals.has(fallthrough)) errorFinals.add(fallthrough);\n        const head = transition[0];\n        const when =\n          isRecord(head) && typeof head.guard === \"string\"\n            ? head.guard\n            : DEFAULT_GUARD;\n        edges[event] = { target: retry, when, otherwise: fallthrough };\n        continue;\n      }\n\n      if (typeof transition !== \"string\") {\n        defects.push(\n          `task \"${taskId}\": \"${eventName}\" is neither a target nor a guarded array`,\n        );\n        continue;\n      }\n      if (states[transition] === undefined) {\n        defects.push(\n          `task \"${taskId}\": \"${eventName}\" targets unknown state \"${transition}\"`,\n        );\n        continue;\n      }\n      // ── the history target ───────────────────────────────────────────────\n      edges[event] =\n        nodeType(states[transition]) === \"history\"\n          ? { resume: { fallback: initialState } }\n          : { target: transition };\n    }\n  }\n\n  if (defects.length > 0) return { defects };\n\n  const out: Record<string, ImportedNode> = {};\n  for (const [name, node] of Object.entries(states)) {\n    if (nodeType(node) === \"history\") continue;\n    const edges = on[name] ?? {};\n    const isFinal = finals.has(name);\n    out[name] = {\n      ...(name === initialState ? { initial: true as const } : {}),\n      ...(Object.keys(edges).length > 0 ? { on: edges } : {}),\n      ...(isFinal\n        ? { end: errorFinals.has(name) ? (\"error\" as const) : (true as const) }\n        : {}),\n    };\n  }\n  return { node: out, defects: [] };\n}\n\n/** The two targets of a phase's `onDone` pair: `[guarded success, fallthrough]`. */\nfunction onDoneTargets(\n  phaseName: string,\n  onDone: unknown,\n): { targets?: readonly [string, string]; defect?: string } {\n  const defect = `phase \"${phaseName}\": \\`onDone\\` must be a two-arm array of \\`{target}\\` — [{target, guard}, {target}]`;\n  if (!Array.isArray(onDone) || onDone.length !== 2) return { defect };\n  const [success, trip] = onDone.map((arm) =>\n    isRecord(arm) && typeof arm.target === \"string\" ? arm.target : undefined,\n  );\n  return success === undefined || trip === undefined\n    ? { defect }\n    : { targets: [success, trip] as const };\n}\n\n/**\n * `workflow.json` → one chart per task, plus the phase topology around them.\n *\n * WHICH HALF GUARANTEES WHAT — this matters, and it is the whole reason the\n * authored fixture (`src/chart/__fixtures__/lane.ts`) still exists beside this\n * function rather than being deleted in its favour:\n *\n *   THIS FUNCTION gives you FIDELITY. It reads bytes that only exist at\n *   runtime, so its result is `ImportedChart` — states, events and targets are\n *   `string`, and nothing about them is checked before the process starts. What\n *   it buys is that the drawing is of THE document the driver is actually\n *   folding, including a `workflow.json` this repo has never seen.\n *\n *   THE AUTHORED FIXTURE gives you TYPES. `lane.ts` is the same machine written\n *   as a literal, so `StateName`, `ResumeTargets`, `Assigns` and the totality\n *   obligation are all real there, and `assert.test-d.ts` pins them. What it\n *   cannot do is follow a document it was not written against.\n *\n * Neither replaces the other. The golden test is the seam: it asserts this\n * importer's edge set against what fabrika's own compiler produces for the same\n * file, so the runtime-typed half stays honest about the literal-typed one.\n *\n * @param document the PARSED `workflow.json` — `JSON.parse`'s output, not text.\n * @param options  {@link WorkflowImportOptions} — the facts the document does\n *                 not carry, stated once at the boundary they enter through.\n * @throws {WorkflowImportError} with every defect named, never a half-import.\n */\nexport function chartFromWorkflow(\n  document: unknown,\n  options: WorkflowImportOptions = {},\n): ImportedLane {\n  const defects: string[] = [];\n  const machineDef = isRecord(document) ? document.machine : undefined;\n  if (!isRecord(machineDef) || !isRecord(machineDef.states)) {\n    throw new WorkflowImportError([\n      \"document must carry a `machine.states` object\",\n    ]);\n  }\n  const documentContext = isRecord(machineDef.context)\n    ? machineDef.context\n    : {};\n  const declaredTrigger = isRecord(document) ? document.trigger : undefined;\n  if (declaredTrigger !== undefined && typeof declaredTrigger !== \"string\") {\n    defects.push(\n      \"document `trigger` must be a string naming what fires this lane\",\n    );\n  }\n\n  const machineStates = machineDef.states;\n  const charts: Record<string, ImportedChart> = {};\n  const context: Record<\n    string,\n    {\n      readonly maxRetries: number;\n      readonly extras: Readonly<Record<string, unknown>>;\n    }\n  > = {};\n  const phases: ImportedPhase[] = [];\n  const gateTargets = new Set<string>();\n  let terminals: { complete: string; tripped: string } | undefined;\n\n  for (const [phaseName, node] of Object.entries(machineStates)) {\n    if (nodeType(node) !== \"parallel\" || !isRecord(node)) continue;\n    const regions = node.states;\n    if (!isRecord(regions) || Object.keys(regions).length === 0) {\n      defects.push(\n        `phase \"${phaseName}\": a parallel phase must carry task regions in \\`states\\``,\n      );\n      continue;\n    }\n    const phaseTasks: string[] = [];\n    for (const [taskId, region] of Object.entries(regions)) {\n      const imported = importRegion(taskId, region);\n      defects.push(...imported.defects);\n      if (imported.node !== undefined) {\n        const events: Record<\n          string,\n          { readonly scope: \"edges\"; readonly from?: EventOrigin }\n        > = {};\n        for (const edges of Object.values(imported.node)) {\n          for (const event of Object.keys(edges.on ?? {})) {\n            // The caller's map is the ONLY source of `from` — read once, here,\n            // and written onto the event. Absent stays absent.\n            const origin = options.from?.[event];\n            events[event] =\n              origin === undefined\n                ? { scope: \"edges\" }\n                : { scope: \"edges\", from: origin };\n          }\n        }\n        // ONE group, named by the phase. The authored twin splits the same\n        // states into working/parked/done, and that split is an AUTHORING\n        // choice the document does not record — inventing it here would be\n        // manufacturing knowledge the source does not have. It costs nothing:\n        // every event is `scope: \"edges\"` (a lane state either routes an event\n        // or refuses it), and with no broadcast scope the grouping carries no\n        // obligation to carry.\n        charts[taskId] = { events, states: { [phaseName]: imported.node } };\n      }\n      const ctx = documentContext[taskId];\n      const bag = isRecord(ctx) ? ctx : {};\n      const { maxRetries: rawMax, retries: _retries, ...extras } = bag;\n      context[taskId] = {\n        maxRetries: typeof rawMax === \"number\" ? rawMax : RETRY_BUDGET,\n        extras,\n      };\n      phaseTasks.push(taskId);\n    }\n    phases.push({ name: phaseName, tasks: phaseTasks });\n\n    const gate = onDoneTargets(phaseName, node.onDone);\n    if (gate.defect !== undefined) defects.push(gate.defect);\n    if (gate.targets !== undefined) {\n      for (const target of gate.targets) {\n        gateTargets.add(target);\n        if (machineStates[target] === undefined) {\n          defects.push(\n            `phase \"${phaseName}\": \\`onDone\\` targets unknown machine-level state \"${target}\"`,\n          );\n        }\n      }\n      // Every phase names the same trip terminal; the LAST phase's success\n      // target is the workflow's complete terminal, because earlier ones target\n      // the next phase.\n      terminals = { complete: gate.targets[0], tripped: gate.targets[1] };\n    }\n  }\n\n  // A machine-level state the loop above did not import is a terminal or a\n  // defect — never dropped silently.\n  for (const [name, node] of Object.entries(machineStates)) {\n    if (nodeType(node) === \"parallel\" && isRecord(node)) continue;\n    if (nodeType(node) !== \"final\") {\n      defects.push(\n        `machine-level state \"${name}\" is neither a \\`parallel\\` phase nor a \\`final\\` terminal`,\n      );\n    } else if (!gateTargets.has(name)) {\n      defects.push(\n        `machine-level final \"${name}\" is targeted by no phase's \\`onDone\\` pair`,\n      );\n    }\n  }\n  if (phases.length === 0)\n    defects.push(\"machine holds no `parallel` phase state\");\n  if (defects.length > 0) throw new WorkflowImportError(defects);\n  if (terminals === undefined) {\n    throw new WorkflowImportError([\n      \"no phase carried a readable `onDone` pair\",\n    ]);\n  }\n\n  const id =\n    isRecord(document) && typeof document.id === \"string\"\n      ? document.id\n      : undefined;\n  const lane: ImportedLane = {\n    ...(id === undefined ? {} : { id }),\n    ...(typeof declaredTrigger === \"string\"\n      ? { trigger: declaredTrigger }\n      : {}),\n    phases,\n    terminals,\n    charts,\n    context,\n  };\n\n  // THE `from` MAP, CROSS-CHECKED — `eventAlphabet` exists for exactly this\n  // and nothing was calling it. The alphabet is DERIVED from the document, so\n  // this compares the caller's claim against the document itself rather than\n  // against a list of ours. See `strictFrom` for why it is the caller's call.\n  if (options.strictFrom === true) {\n    const declared = new Set(eventAlphabet(lane));\n    const strays = Object.keys(options.from ?? {}).filter(\n      (event) => !declared.has(event),\n    );\n    if (strays.length > 0) {\n      throw new WorkflowImportError(\n        strays.map(\n          (event) =>\n            `\\`from\\` names \"${event}\", which no state in this document routes — the map is keyed by the BARE event name`,\n        ),\n      );\n    }\n  }\n  return lane;\n}\n\n/** Parse and import in one step — for a caller holding the document's bytes. */\nexport function chartFromWorkflowText(\n  text: string,\n  options: WorkflowImportOptions = {},\n): ImportedLane {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(text);\n  } catch {\n    throw new WorkflowImportError([\"the document is not JSON\"]);\n  }\n  return chartFromWorkflow(parsed, options);\n}\n\n// ── reading a chart back ───────────────────────────────────────────────────\n\n/** Every state in an imported chart, flattened out of its one phase group. */\nexport function statesOf(\n  chart: ImportedChart,\n): ReadonlyMap<string, ImportedNode> {\n  const out = new Map<string, ImportedNode>();\n  for (const group of Object.values(chart.states)) {\n    for (const [name, node] of Object.entries(group)) out.set(name, node);\n  }\n  return out;\n}\n\n/** The state marked `initial: true`. */\nexport function initialOf(chart: ImportedChart): string {\n  for (const [name, node] of statesOf(chart)) {\n    if (node.initial === true) return name;\n  }\n  throw new Error(\"@demlik/tea: imported chart marks no initial state\");\n}\n\n/**\n * Every event name this lane declares, in first-declaration order.\n *\n * THE ALPHABET, DERIVED — the answer a caller used to get from a constant in\n * this file listing one consumer's six. It is a fact about the document, so it\n * is read from the document: the bare names its states route, deduplicated\n * across tasks and phases. A consumer that adds an event gets it here the\n * commit it lands, without a release of ours.\n *\n * Use it to build the `from` map at the import boundary and know you covered\n * every name, or to diff two revisions of a workflow for a vocabulary change.\n */\nexport function eventAlphabet(lane: ImportedLane): readonly string[] {\n  const out = new Set<string>();\n  for (const chart of Object.values(lane.charts)) {\n    for (const event of Object.keys(chart.events)) out.add(event);\n  }\n  return [...out];\n}\n\n/**\n * Where `event` comes from, or `undefined` when the chart does not say.\n *\n * The ONE read of provenance, so a reader that wants to group by origin and a\n * reader that wants to label one event cannot disagree about what \"undeclared\"\n * looks like.\n */\nexport function originOf(\n  chart: ImportedChart,\n  event: string,\n): EventOrigin | undefined {\n  return chart.events[event]?.from;\n}\n\n/** `true` success, `\"error\"` tripped, `false` not a final — the ONE polarity read. */\nexport function endPolarityOf(\n  node: ImportedNode | undefined,\n): true | \"error\" | false {\n  if (node?.end === undefined) return false;\n  return node.end;\n}\n","// ═══════════════════════════════════════════════════════════════════════════\n// THE FOLD — `events.jsonl` in, per-task leaf states out, from scratch.\n//\n// The mirror of `packages/fabrika-cli/src/lane/fold.ts`. It is here for two\n// reasons and neither is \"because we might as well\":\n//\n//   1. THE TIMELINE. `lane history` returns the log verbatim and deliberately\n//      does NOT store `from → to` — those are reconstructible by folding, so\n//      storing them would be a second copy of a derived fact. Reconstructing\n//      them is therefore the reader's job, and the reader needs a fold to do\n//      it. Because the fold is a LEFT fold that is pure over a prefix, the\n//      state before step k is exactly `foldLog(entries.slice(0, k))` — time\n//      travel that is exact rather than approximated.\n//\n//   2. THE FILE PATH. A caller holding only `workflow.json` + `events.jsonl`\n//      has no `lane status` output to be handed. It derives one.\n//\n// The transition semantics below are fabrika's, verbatim in behaviour: the\n// guard is the one inline `retries < maxRetries` (the guard NAME in the\n// document is inert data, never dereferenced), a resume lands on `was ?? the\n// region's initial` and does NOT rewrite `was`, and every other edge records\n// `was = the state you left`.\n// ═══════════════════════════════════════════════════════════════════════════\nimport { edgeKey } from \"./draw\";\nimport {\n  bareEvent,\n  endPolarityOf,\n  type ImportedChart,\n  type ImportedLane,\n  initialOf,\n  RETRY_BUDGET,\n  statesOf,\n} from \"./workflow\";\n\n/**\n * The edge a step DREW, keyed as {@link edgeKey} spells it.\n *\n * ONE DECLARATION SITE for the resume rule, and that is the whole reason it is\n * a function rather than four lines inside {@link timeline}. A resume edge is\n * DRAWN once, to its fallback, and WALKED to wherever `was` pointed — so\n * recovering \"which edge lit up\" from the observed target lands on an edge the\n * drawing does not have. Any reader that knows `from`/`event`/`to` and wants\n * the drawn edge (a folded log's timeline; a live lane's recorded tape) asks\n * here, so the two cannot disagree about which edge to thicken.\n */\nexport function walkedEdgeKey(\n  chart: ImportedChart,\n  from: string,\n  event: string,\n  to: string,\n): string {\n  const declared = statesOf(chart).get(from)?.on?.[event];\n  const drawn =\n    declared !== undefined && \"resume\" in declared\n      ? declared.resume.fallback\n      : to;\n  return edgeKey(from, event, drawn);\n}\n\n/** One appended line of `events.jsonl`: which task, which event, when. */\nexport interface LogEntry {\n  readonly task: string;\n  readonly event: string;\n  readonly at: string;\n}\n\n/** One task's folded state: the leaf, the retry budget, and the state it left. */\nexport interface TaskState {\n  readonly type: string;\n  readonly retries: number;\n  readonly maxRetries: number;\n  readonly was?: string;\n}\n\n/**\n * The derived answer `lane status` prints — reproduced here field for field,\n * because a report that computed its own vocabulary would contradict the driver\n * the moment the two disagreed.\n */\nexport interface LaneStatus {\n  readonly stateValue:\n    | string\n    | Readonly<Record<string, Readonly<Record<string, string>> | string>>;\n  readonly status: \"active\" | \"done\";\n  readonly context: Readonly<Record<string, unknown>>;\n}\n\n/** The log does not replay against this workflow — with the reason named. */\nexport class UnreplayableLogError extends Error {\n  override readonly name = \"UnreplayableLogError\";\n  readonly _tag = \"UnreplayableLogError\" as const;\n  constructor(public readonly defects: readonly string[]) {\n    super(\n      `@demlik/tea: this events log does not replay against this workflow —\\n` +\n        defects.map((d) => `  • ${d}`).join(\"\\n\"),\n    );\n  }\n}\n\n/**\n * Parse `events.jsonl`. A line that does not parse is a DEFECT, never a\n * silently skipped event — a report built on a log it half-read is worse than\n * no report.\n */\nexport function parseEventsJsonl(text: string): readonly LogEntry[] {\n  const defects: string[] = [];\n  const entries: LogEntry[] = [];\n  for (const [index, line] of text.split(\"\\n\").entries()) {\n    if (line.trim() === \"\") continue;\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(line);\n    } catch {\n      defects.push(`line ${index + 1} is not JSON`);\n      continue;\n    }\n    const entry = asLogEntry(parsed);\n    if (entry === undefined) {\n      defects.push(\n        `line ${index + 1} does not carry string \\`task\\`/\\`event\\`/\\`at\\``,\n      );\n      continue;\n    }\n    entries.push(entry);\n  }\n  if (defects.length > 0) throw new UnreplayableLogError(defects);\n  return entries;\n}\n\nfunction asLogEntry(value: unknown): LogEntry | undefined {\n  if (typeof value !== \"object\" || value === null) return undefined;\n  const record = value as { task?: unknown; event?: unknown; at?: unknown };\n  if (\n    typeof record.task !== \"string\" ||\n    typeof record.event !== \"string\" ||\n    typeof record.at !== \"string\"\n  ) {\n    return undefined;\n  }\n  return { task: record.task, event: record.event, at: record.at };\n}\n\n/** `lane history`'s stdout — a JSON array of the same entries, verbatim. */\nexport function parseHistoryJson(text: string): readonly LogEntry[] {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(text);\n  } catch {\n    throw new UnreplayableLogError([\"`lane history` output is not JSON\"]);\n  }\n  if (!Array.isArray(parsed)) {\n    throw new UnreplayableLogError([\n      \"`lane history` output is not a JSON array of entries\",\n    ]);\n  }\n  const entries: LogEntry[] = [];\n  for (const [index, raw] of parsed.entries()) {\n    const entry = asLogEntry(raw);\n    if (entry === undefined) {\n      throw new UnreplayableLogError([\n        `history entry ${index} does not carry string \\`task\\`/\\`event\\`/\\`at\\``,\n      ]);\n    }\n    entries.push(entry);\n  }\n  return entries;\n}\n\n/**\n * EVERY task the log names that this lane does not have, never just the first.\n *\n * The same contract {@link parseEventsJsonl} keeps one function up, and the\n * same one fabrika keeps: a log that names four tasks from a workflow the\n * caller swapped underneath it is four facts, and reporting one of them per\n * run turns one fix into four rounds of paste-the-error-back. Deduplicated by\n * name, in first-mention order — a thousand-line log naming one stale task is\n * one defect, not a thousand.\n */\nconst unknownTaskDefects = (\n  lane: ImportedLane,\n  entries: readonly LogEntry[],\n): readonly string[] => {\n  const seen = new Set<string>();\n  const defects: string[] = [];\n  for (const entry of entries) {\n    if (lane.charts[entry.task] !== undefined || seen.has(entry.task)) continue;\n    seen.add(entry.task);\n    defects.push(\n      `log names task \"${entry.task}\", which is not in this lane's machine`,\n    );\n  }\n  return defects;\n};\n\nconst chartOf = (lane: ImportedLane, taskId: string): ImportedChart => {\n  const chart = lane.charts[taskId];\n  if (chart === undefined) {\n    throw new UnreplayableLogError([\n      `log names task \"${taskId}\", which is not in this lane's machine`,\n    ]);\n  }\n  return chart;\n};\n\n/** The initial state of every task — the fold's zero. */\nexport function initialStates(\n  lane: ImportedLane,\n): Readonly<Record<string, TaskState>> {\n  const out: Record<string, TaskState> = {};\n  for (const [taskId, chart] of Object.entries(lane.charts)) {\n    out[taskId] = {\n      type: initialOf(chart),\n      retries: 0,\n      maxRetries: lane.context[taskId]?.maxRetries ?? RETRY_BUDGET,\n    };\n  }\n  return out;\n}\n\n/**\n * ONE event applied to ONE task. The three edge forms, and the two ways there\n * can be no edge.\n *\n * THERE ARE THREE ANSWERS, NOT TWO, and this used to give two. tea's runtime\n * has always distinguished a REFUSAL — an event the state accepts and drops,\n * because its `ignore` names the event or the event is broadcast to some other\n * phase — from a pair it cannot replay, which is the only one that throws. The\n * lowered chart could not carry the first, so a log the runtime had happily\n * accepted came back `UnreplayableLogError` here: a run and a report of that\n * run disagreeing about what the machine did. The refusal set now rides on the\n * chart (`ImportedChart.refusals`, written by `lowerRegion` and by nothing\n * else), so both sides refuse the same pairs by construction.\n *\n * `taskId` is for the DIAGNOSTIC only. `stepTask` folds one region and has\n * never needed to know which; a reader staring at `state \"queued\" holds no cell\n * for \"DONE\"` on a twelve-task lane needs to know very much, and the callers\n * have it.\n */\nexport function stepTask(\n  chart: ImportedChart,\n  state: TaskState,\n  event: string,\n  taskId?: string,\n): TaskState {\n  const node = statesOf(chart).get(state.type);\n  const edge = node?.on?.[event];\n  if (edge === undefined) {\n    if (chart.refusals?.[state.type]?.includes(event) === true) return state;\n    throw new UnreplayableLogError([\n      `${taskId === undefined ? \"\" : `task \"${taskId}\": `}state \"${state.type}\" holds no cell for \"${event}\"`,\n    ]);\n  }\n  if (\"resume\" in edge) {\n    // `was` is NOT rewritten: you are LEAVING the park, not entering one.\n    return { ...state, type: state.was ?? edge.resume.fallback };\n  }\n  if (\"when\" in edge) {\n    // The guard NAME is inert. This one predicate is the guard, in fabrika and\n    // here — which is exactly why the two cannot drift apart on a rename.\n    return state.retries < state.maxRetries\n      ? {\n          ...state,\n          type: edge.target,\n          retries: state.retries + 1,\n          was: state.type,\n        }\n      : { ...state, type: edge.otherwise, was: state.type };\n  }\n  return { ...state, type: edge.target, was: state.type };\n}\n\n/**\n * Fold the whole log into per-task leaf states.\n *\n * PURE OVER A PREFIX: tasks are independent regions, so the global log\n * partitions cleanly and each task folds through its own chart. `foldLane(lane,\n * entries.slice(0, k))` is therefore the exact state after k events, for every\n * k — which is what {@link timeline} spends.\n */\nexport function foldLane(\n  lane: ImportedLane,\n  entries: readonly LogEntry[],\n): Readonly<Record<string, TaskState>> {\n  const unknown = unknownTaskDefects(lane, entries);\n  if (unknown.length > 0) throw new UnreplayableLogError(unknown);\n  const states: Record<string, TaskState> = { ...initialStates(lane) };\n  for (const entry of entries) {\n    const chart = chartOf(lane, entry.task);\n    const current = states[entry.task];\n    if (current === undefined) {\n      throw new UnreplayableLogError([\n        `log names task \"${entry.task}\", which is not in this lane's machine`,\n      ]);\n    }\n    states[entry.task] = stepTask(\n      chart,\n      current,\n      bareEvent(entry.event),\n      entry.task,\n    );\n  }\n  return states;\n}\n\n/** One row of the timeline: the entry, plus the `from → to` nobody stored. */\nexport interface TimelineStep {\n  readonly index: number;\n  readonly at: string;\n  readonly task: string;\n  /** The event VERBATIM, namespace and all — the log's own spelling. */\n  readonly event: string;\n  readonly from: string;\n  readonly to: string;\n  /**\n   * The DECLARED edge this step fired, as {@link edgeKey} spells it.\n   *\n   * Not derivable from `from`/`event`/`to`, and that is the whole reason it is\n   * carried: a resume edge is DRAWN once, to its fallback, and WALKED to\n   * wherever `was` pointed. Recovering \"which edge lit up\" from the observed\n   * target would land on an edge the drawing does not have — so the step\n   * records the edge it took while it still knows.\n   */\n  readonly edge: string;\n}\n\n/**\n * The log with `from → to` recomputed per step.\n *\n * A single left-to-right pass, which is EXACTLY the prefix fold and not an\n * approximation of it: `foldLane` is a left fold over the same entries in the\n * same order, so the state carried into step k here is the state\n * `foldLane(lane, entries.slice(0, k))` returns. `fold.test.ts` asserts that\n * equality rather than asking you to take it on trust — the cheap form and the\n * definitional form, pinned to each other.\n */\nexport function timeline(\n  lane: ImportedLane,\n  entries: readonly LogEntry[],\n): readonly TimelineStep[] {\n  const unknown = unknownTaskDefects(lane, entries);\n  if (unknown.length > 0) throw new UnreplayableLogError(unknown);\n  const states: Record<string, TaskState> = { ...initialStates(lane) };\n  const steps: TimelineStep[] = [];\n  for (const [index, entry] of entries.entries()) {\n    const chart = chartOf(lane, entry.task);\n    const before = states[entry.task];\n    if (before === undefined) {\n      throw new UnreplayableLogError([\n        `log names task \"${entry.task}\", which is not in this lane's machine`,\n      ]);\n    }\n    const event = bareEvent(entry.event);\n    const after = stepTask(chart, before, event, entry.task);\n    states[entry.task] = after;\n    steps.push({\n      index,\n      at: entry.at,\n      task: entry.task,\n      event: entry.event,\n      from: before.type,\n      to: after.type,\n      edge: walkedEdgeKey(chart, before.type, event, after.type),\n    });\n  }\n  return steps;\n}\n\n/**\n * Where one phase stands. The four are exhaustive over a phase in a lane whose\n * log has been folded, and they are POSITIONAL rather than local: a phase whose\n * tasks all happen to be final is `\"waiting\"` if an earlier phase stopped the\n * lane before it could have run.\n */\nexport type PhaseStanding = \"complete\" | \"tripped\" | \"active\" | \"waiting\";\n\n/** One phase, and where it stands after the fold. */\nexport interface PhaseStand {\n  readonly name: string;\n  /** Its position in the sequence — the phase order, as a number. */\n  readonly index: number;\n  readonly tasks: readonly string[];\n  readonly standing: PhaseStanding;\n  /** The tasks in this phase that landed on an ERROR final. */\n  readonly tripped: readonly string[];\n}\n\n/**\n * The ONE thing the phase walk reads off a task: which state it is standing in.\n *\n * {@link TaskState} satisfies it, and so does a RUNNING region's own\n * `StateOf<chart>` — which is the whole reason the parameter is spelled this\n * loosely. The fold and the runtime carry different per-task values (the fold's\n * carries `retries`, a region's carries its `ctx`), and the advancement rule\n * reads neither: it reads `type`, looks the node up in the chart, and asks its\n * `end` polarity. Widening the parameter to what the rule ACTUALLY reads is what\n * lets {@link phaseStandings} be called by both without a second copy of it.\n */\nexport type LeafStates = Readonly<Record<string, { readonly type: string }>>;\n\n/** Every task at an error final — the `errors` list, one declaration site. */\nexport function trippedTasks(\n  lane: ImportedLane,\n  states: LeafStates,\n): readonly string[] {\n  return Object.keys(states).filter(\n    (taskId) => endPolarityOf(nodeOf(lane, taskId, states)) === \"error\",\n  );\n}\n\n/**\n * THE PHASE WALK — the one loop that decides which phase is running, which are\n * behind it, and which never got to start.\n *\n * It is fabrika's `deriveStatus` loop, factored out rather than copied: walk\n * phases in order, the first whose tasks are not ALL final is the active one\n * and the walk stops; a phase that IS all final but holds an error final trips\n * the lane and the walk stops there instead; everything after a stop is\n * `\"waiting\"`, whatever its tasks happen to read.\n *\n * That last clause is the whole reason this is positional. `foldLane` boots\n * every task of every phase, so a later phase's region can sit in a final\n * before its phase ever ran — a child the board abandoned boots straight into\n * an error final, which is exactly the case fabrika's emitter produces. Read\n * locally, that phase looks \"tripped\". Read in sequence, it is a phase that\n * never started, and the lane tripped somewhere else.\n *\n * {@link deriveLaneStatus} and the report both read this, so the compound state\n * value and the phase headings cannot disagree about what is running.\n */\nexport function phaseStandings(\n  lane: ImportedLane,\n  states: LeafStates,\n): readonly PhaseStand[] {\n  const isFinal = (taskId: string): boolean =>\n    endPolarityOf(nodeOf(lane, taskId, states)) !== false;\n  const errors = trippedTasks(lane, states);\n  let stopped = false;\n  return lane.phases.map((phase, index) => {\n    const tripped = phase.tasks.filter((taskId) => errors.includes(taskId));\n    const base = { name: phase.name, index, tasks: phase.tasks, tripped };\n    if (stopped) return { ...base, standing: \"waiting\" as const };\n    if (!phase.tasks.every(isFinal)) {\n      stopped = true;\n      return { ...base, standing: \"active\" as const };\n    }\n    if (tripped.length > 0) {\n      stopped = true;\n      return { ...base, standing: \"tripped\" as const };\n    }\n    return { ...base, standing: \"complete\" as const };\n  });\n}\n\n/**\n * THE ADVANCEMENT RULE — has the lane left the phases, and by which door?\n *\n * `undefined` means \"still running\": some phase is active, so the lane is\n * sitting in it. A terminal name means the walk ran out of phases — every phase\n * completed (`onDone` chained all the way past the last one, which is what the\n * `complete` terminal IS), or one of them completed holding a region at an\n * `end: \"error\"` final, which trips the lane wherever it had got to.\n *\n * Three lines, and they are pulled out here rather than inlined below because\n * this is the rule the RUNTIME advances by (`runLane`, in `../lane/run`). The\n * runtime does not re-derive it and does not agree with it by inspection: it\n * calls {@link phaseStandings} over its own region states and then this, so\n * \"the machine advanced\" and \"the fold says it advanced\" are the same sentence\n * evaluated twice, not two sentences kept in sync.\n */\nexport function laneTerminalReached(\n  stands: readonly PhaseStand[],\n  terminals: ImportedLane[\"terminals\"],\n): string | undefined {\n  if (stands.some((stand) => stand.standing === \"tripped\"))\n    return terminals.tripped;\n  if (stands.some((stand) => stand.standing === \"active\")) return undefined;\n  return terminals.complete;\n}\n\n/**\n * The whole \"compound machine\", as a pure derivation.\n *\n * The active phase is the first whose tasks are not all final; a COMPLETED\n * phase holding a task in an error final trips the workflow. That is fabrika's\n * `noErrors` gate — never a machine event, and here it reads the chart's\n * `end: \"error\"` polarity, which is the same fact the document's guarded\n * fallthrough declared. The walk itself is {@link phaseStandings}, so the\n * status and the drawing are one derivation seen twice.\n */\nexport function deriveLaneStatus(\n  lane: ImportedLane,\n  states: Readonly<Record<string, TaskState>>,\n): LaneStatus {\n  const errors = trippedTasks(lane, states);\n\n  const context: Record<string, unknown> = {};\n  for (const [taskId, state] of Object.entries(states)) {\n    context[taskId] = {\n      retries: state.retries,\n      maxRetries: state.maxRetries,\n      ...(lane.context[taskId]?.extras ?? {}),\n    };\n  }\n  context.errors = errors;\n\n  const stands = phaseStandings(lane, states);\n  const terminal = laneTerminalReached(stands, lane.terminals);\n  if (terminal !== undefined) {\n    return { stateValue: terminal, status: \"done\", context };\n  }\n  // `laneTerminalReached` returned `undefined`, which is precisely \"some phase\n  // is active\" — so this find cannot miss.\n  const active = stands.find((stand) => stand.standing === \"active\");\n  if (active === undefined) {\n    return { stateValue: lane.terminals.complete, status: \"done\", context };\n  }\n\n  const stateValue: Record<string, Record<string, string> | string> = {\n    [active.name]: Object.fromEntries(\n      active.tasks.map((taskId) => [taskId, states[taskId]?.type ?? \"?\"]),\n    ),\n  };\n  for (const stand of stands.slice(active.index + 1)) {\n    stateValue[stand.name] = \"waiting\";\n  }\n  return { stateValue, status: \"active\", context };\n}\n\nfunction nodeOf(lane: ImportedLane, taskId: string, states: LeafStates) {\n  const chart = lane.charts[taskId];\n  const state = states[taskId];\n  if (chart === undefined || state === undefined) return undefined;\n  return statesOf(chart).get(state.type);\n}\n\n/** `lane status`'s stdout, parsed back into the shape it was printed from. */\nexport function parseStatusJson(text: string): LaneStatus {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(text);\n  } catch {\n    throw new UnreplayableLogError([\"`lane status` output is not JSON\"]);\n  }\n  if (typeof parsed !== \"object\" || parsed === null) {\n    throw new UnreplayableLogError([\"`lane status` output is not an object\"]);\n  }\n  const record = parsed as {\n    stateValue?: unknown;\n    status?: unknown;\n    context?: unknown;\n  };\n  if (record.status !== \"active\" && record.status !== \"done\") {\n    throw new UnreplayableLogError([\n      '`lane status` output carries no `status` of \"active\" | \"done\"',\n    ]);\n  }\n  if (record.stateValue === undefined) {\n    throw new UnreplayableLogError([\n      \"`lane status` output carries no `stateValue`\",\n    ]);\n  }\n  return {\n    stateValue: record.stateValue as LaneStatus[\"stateValue\"],\n    status: record.status,\n    context:\n      typeof record.context === \"object\" && record.context !== null\n        ? (record.context as Record<string, unknown>)\n        : {},\n  };\n}\n","// ═══════════════════════════════════════════════════════════════════════════\n// THE REPORT — one markdown string that reads the same in three places.\n//\n// A terminal, a PR comment and an issue comment are the three surfaces a lane's\n// state is actually looked at on, and they share exactly one format. So the\n// output is markdown with a mermaid fence: GitHub renders the fence, a terminal\n// shows it as the text it is, and neither needs a flag.\n//\n// THE EDITORIAL RULES, which are most of what this file is:\n//\n//   ONE DIAGRAM PER TASK THAT MOVED, ACTIVE PHASE ONLY. A comment with eight\n//   diagrams is a comment nobody reads. Future phases get one line each, and so\n//   do the tasks still sitting at their entry state — a real emitted epic put\n//   eight tasks in one phase, six of them untouched, and the rule as originally\n//   written (per TASK, not per MOVED task) produced exactly the wall of\n//   near-identical pictures it exists to prevent.\n//\n//   \"WAITING ON\" IS DERIVED, AND NAMES NOTHING. This file used to answer it by\n//   matching STATE NAMES — `queued`, `build`, `review`, `ship`, `blocked`,\n//   `human:*` — against a list copied out of fabrika's `wire/lane-brief.ts`.\n//   Those names are fabrika's, so a rename upstream turned this report into a\n//   confident liar with nothing failing anywhere. The fact it was really after\n//   is not \"which state is this\" but \"who has to act next\", which is a property\n//   of the EVENT: a Msg comes from a Cmd's result, a Sub firing, or the outside\n//   world, and the chart now says which (`graph.ts` §3a, `from`). So the answer\n//   is the events legal HERE, grouped by THEIR origin — no state name, no event\n//   name, no job title in this file.\n//\n//   AND IT STILL REFUSES TO GUESS. A chart that declares no provenance gets no\n//   invented one: the line says which events the state accepts and stops, which\n//   is what the machine does say — the same refusal `shellState()` makes by\n//   answering null rather than inventing a shell.\n//\n//   THE RETRY LINE, WHEN AND ONLY WHEN IT MATTERS. `2/2` is the difference\n//   between \"in review\" and \"one FAIL from frozen\", and `0/2` is noise.\n// ═══════════════════════════════════════════════════════════════════════════\nimport type { EventOrigin } from \"../graph\";\nimport { drawTask, walkedEdges } from \"./draw\";\nimport {\n  deriveLaneStatus,\n  foldLane,\n  type LaneStatus,\n  type LogEntry,\n  type PhaseStand,\n  phaseStandings,\n  type TaskState,\n  type TimelineStep,\n  timeline,\n} from \"./fold\";\nimport {\n  chartFromWorkflow,\n  endPolarityOf,\n  type ImportedChart,\n  type ImportedLane,\n  initialOf,\n  originOf,\n  statesOf,\n} from \"./workflow\";\n\n/** The lane the report is about. `workflow` is the PARSED document, or an import. */\nexport interface LaneReportInput {\n  /** `workflow.json`, parsed — or an already-imported lane, reused as is. */\n  readonly workflow: unknown;\n  readonly entries: readonly LogEntry[];\n  /**\n   * `lane status`'s answer.\n   *\n   * OPTIONAL, and that is the whole shape of the two input paths: a caller\n   * shelling out to `fabrika` hands over the CLI's own derivation and the\n   * report never second-guesses it; a caller holding only the two files omits\n   * it and the same derivation runs here.\n   */\n  readonly status?: LaneStatus;\n  /** Heading for the block. Defaults to the document's `id`. */\n  readonly title?: string;\n}\n\nexport interface LaneReport {\n  readonly markdown: string;\n}\n\nconst isImportedLane = (v: unknown): v is ImportedLane =>\n  typeof v === \"object\" &&\n  v !== null &&\n  Array.isArray((v as ImportedLane).phases) &&\n  typeof (v as ImportedLane).charts === \"object\";\n\n/** `{ pipeline: { issue: \"review\" } }` → the phase that is actually running. */\nfunction activePhaseName(status: LaneStatus): string | undefined {\n  if (typeof status.stateValue === \"string\") return undefined;\n  for (const [name, value] of Object.entries(status.stateValue)) {\n    if (typeof value === \"object\") return name;\n  }\n  return undefined;\n}\n\n/** Event names, as the report writes a list of them. */\nconst listed = (events: readonly string[]): string =>\n  events.map((e) => `\\`${e}\\``).join(\", \");\n\n/**\n * One origin's worth of the answer, said the way that origin is said.\n *\n * The three phrasings are the three origins, and each says the thing that\n * origin makes true. A world role is a WHO, so the events are what that who\n * owes; a cmd is work already in flight, so the sentence is about the work and\n * the events are how it comes back; a sub is a source, so the sentence is about\n * the source. The role text (`the operator`, `a human`) is the consumer's own,\n * carried from the chart verbatim — including its article, because only the\n * consumer knows whether there is one of them or any of them.\n */\nfunction phrase(\n  origin: EventOrigin,\n  state: string,\n  events: readonly string[],\n): string {\n  if (origin === \"cmd\") {\n    return `the work \\`${state}\\` dispatched — ${listed(events)}`;\n  }\n  if (origin === \"sub\") {\n    return `the source \\`${state}\\` is subscribed to — ${listed(events)}`;\n  }\n  return `${origin.world}'s ${listed(events)}`;\n}\n\n/** The grouping key for an origin — the two words, or the role, distinctly. */\nconst originKey = (origin: EventOrigin): string =>\n  typeof origin === \"string\" ? origin : `world:${origin.world}`;\n\n/**\n * What this task is waiting on — or `null` at a final.\n *\n * DERIVED, entirely: the events this state routes, grouped by the origin each\n * one DECLARES, in declaration order. Nothing here knows a state name, an event\n * name or a job title, so a consumer that renames half its states changes this\n * output correctly and a consumer with a completely different cast is served by\n * the same function.\n *\n * The degradation is the point of the second half. Provenance is not in\n * `workflow.json` — it is stated at the import boundary or not at all — so a\n * chart imported without it must say what it actually knows, which is WHICH\n * EVENTS the state accepts. It never says who sends them.\n */\nexport function waitingOn(chart: ImportedChart, state: string): string | null {\n  const node = statesOf(chart).get(state);\n  if (node?.end !== undefined) return null;\n  const events = Object.keys(node?.on ?? {});\n  if (events.length === 0) {\n    // A live state that routes nothing. `inspectLane` calls this a dead end;\n    // there is no one to wait for and saying so is the whole answer.\n    return `\\`${state}\\` accepts no events, and it is not a final`;\n  }\n\n  // Group by origin, keeping the events in the order the chart declares them.\n  const groups = new Map<string, { origin: EventOrigin; events: string[] }>();\n  const undeclared: string[] = [];\n  for (const event of events) {\n    const origin = originOf(chart, event);\n    if (origin === undefined) {\n      undeclared.push(event);\n      continue;\n    }\n    const key = originKey(origin);\n    const group = groups.get(key);\n    if (group === undefined) groups.set(key, { origin, events: [event] });\n    else group.events.push(event);\n  }\n\n  // NO PROVENANCE AT ALL — the honest floor. Same voice as the refusal this\n  // replaces: name what the machine says, and stop.\n  if (groups.size === 0) return `\\`${state}\\` accepts ${listed(events)}`;\n\n  const parts = [...groups.values()].map((g) =>\n    phrase(g.origin, state, g.events),\n  );\n  // A PARTIAL map is not rounded up to a whole one. The events whose origin was\n  // never stated are listed as exactly that, beside the ones that were.\n  if (undeclared.length > 0) {\n    parts.push(`${listed(undeclared)}, from somewhere the chart does not say`);\n  }\n  return parts.join(\" · \");\n}\n\n/** `2/2 — one \\`FAIL\\` from \\`frozen\\``, or `null` when no retry has been spent. */\nfunction retryLine(chart: ImportedChart, state: TaskState): string | null {\n  if (state.retries <= 0) return null;\n  const budget = `${state.retries}/${state.maxRetries}`;\n  if (state.retries < state.maxRetries) return `**retries:** ${budget}`;\n  // Spent. Name the edge that is now a one-way door, off the chart rather than\n  // off a constant — a document whose fallthrough is `tripped` says `tripped`.\n  const node = statesOf(chart).get(state.type);\n  for (const [event, edge] of Object.entries(node?.on ?? {})) {\n    if (\"when\" in edge) {\n      return `**retries:** ${budget} — spent; one \\`${event}\\` from \\`${edge.otherwise}\\``;\n    }\n  }\n  return `**retries:** ${budget} — spent`;\n}\n\n/**\n * One phase that is NOT the active one, in one line.\n *\n * The editorial rule the module opened with, applied to the phase dimension: a\n * comment with eight diagrams is a comment nobody reads, so a phase already\n * finished and a phase not yet started each get a line. A finished phase still\n * gets its leaves, because \"complete\" alone does not say WHICH ending each of\n * its tasks reached — and a phase that never started has no leaves worth\n * printing, because every one of them would be an initial state nothing walked.\n */\nfunction phaseLine(\n  stand: PhaseStand,\n  states: Readonly<Record<string, TaskState>>,\n): string {\n  const count = `${stand.tasks.length} task${stand.tasks.length === 1 ? \"\" : \"s\"}`;\n  if (stand.standing === \"waiting\") {\n    return `**${stand.name}:** waiting — ${count}, not started.`;\n  }\n  const leaves = stand.tasks\n    .map(\n      (taskId) =>\n        `\\`${taskId}\\` = \\`${states[taskId]?.type ?? \"?\"}\\`${\n          stand.tripped.includes(taskId) ? \" **(tripped)**\" : \"\"\n        }`,\n    )\n    .join(\", \");\n  return `**${stand.name}:** ${stand.standing} — ${count}: ${leaves}`;\n}\n\nfunction timelineTable(steps: readonly TimelineStep[]): string {\n  if (steps.length === 0)\n    return \"_no events yet — the lane is at its initial state._\";\n  const rows = steps.map(\n    (s) =>\n      `| ${s.index + 1} | ${s.at} | \\`${s.task}\\` | \\`${s.event}\\` | \\`${s.from}\\` → \\`${s.to}\\` |`,\n  );\n  return [\n    \"| # | at | task | event | from → to |\",\n    \"|---|---|---|---|---|\",\n    ...rows,\n  ].join(\"\\n\");\n}\n\n/**\n * A lane, as one markdown block.\n *\n * The diagram half is behind {@link drawTask}, which is a translation onto\n * `chartMermaid` — the package's one chart renderer.\n */\nexport function laneReport(input: LaneReportInput): LaneReport {\n  const lane = isImportedLane(input.workflow)\n    ? input.workflow\n    : chartFromWorkflow(input.workflow);\n  const entries = input.entries;\n  const states = foldLane(lane, entries);\n  const status = input.status ?? deriveLaneStatus(lane, states);\n  const steps = timeline(lane, entries);\n\n  const title = input.title ?? lane.id ?? \"lane\";\n  const out: string[] = [`## ${title} — ${status.status}`, \"\"];\n\n  // ── where it is ─────────────────────────────────────────────────────────\n  out.push(`**where it is:** ${describeStateValue(status.stateValue)}`);\n  if (lane.trigger !== undefined) out.push(`**fired by:** \\`${lane.trigger}\\``);\n  const errors = status.context.errors;\n  if (Array.isArray(errors) && errors.length > 0) {\n    out.push(\n      `**tripped:** ${errors.map((t) => `\\`${String(t)}\\``).join(\", \")} — the lane lands on \\`${lane.terminals.tripped}\\``,\n    );\n  }\n  out.push(\"\");\n\n  // ── the phases, in order: one in full, the rest in one line each ────────\n  //\n  // The standings are DERIVED from the fold — the same walk `deriveLaneStatus`\n  // makes — rather than read off `stateValue`, because `stateValue` is silent\n  // about a lane that already stopped: it collapses to the terminal's NAME, and\n  // a reader of a tripped epic then cannot tell which phase tripped it, or\n  // which phases below never got to start. The one thing still taken from\n  // `status` is WHICH phase is active, so a report handed the CLI's own answer\n  // shows the CLI's answer. (`fold.test.ts` asserts the two agree at every\n  // prefix of every run, so this is a precedence rule, not a disagreement.)\n  const stands = phaseStandings(lane, states);\n  const named = activePhaseName(status);\n  const active =\n    stands.find((s) => s.name === named) ??\n    stands.find((s) => s.standing === \"active\");\n\n  for (const stand of stands) {\n    if (stand === active) {\n      // ONE DIAGRAM PER TASK THAT HAS MOVED — not per task.\n      //\n      // The rule at the top of this file says a comment with eight diagrams is\n      // a comment nobody reads, and until this was run against a real emitted\n      // epic the rule was only enforced on the phase dimension. A real phase\n      // holds eight tasks; six of them sat untouched at `queued`, and the\n      // report spent ~200 of its ~265 lines drawing the same picture six times\n      // with a different node lit. A task still at its entry state has a story\n      // one line long, so it gets one line.\n      const untouched: string[] = [];\n      for (const taskId of stand.tasks) {\n        const chart = lane.charts[taskId];\n        const state = states[taskId];\n        if (chart === undefined || state === undefined) continue;\n        if (state.type === initialOf(chart)) untouched.push(taskId);\n      }\n      // If NOTHING in the phase has moved, the phase just started — and\n      // collapsing every task would leave the reader with no picture at all.\n      // Draw the first as the representative (they are all at the same entry\n      // state, so any of them is the same picture) and list the rest.\n      if (untouched.length === stand.tasks.length) untouched.shift();\n      for (const taskId of stand.tasks) {\n        const chart = lane.charts[taskId];\n        const state = states[taskId];\n        if (chart === undefined || state === undefined) continue;\n        if (untouched.includes(taskId)) continue;\n        const polarity = endPolarityOf(statesOf(chart).get(state.type));\n        out.push(\n          `### ${taskId} — \\`${state.type}\\`${polarity === \"error\" ? \" — TRIPPED\" : \"\"}`,\n        );\n        const waiting = waitingOn(chart, state.type);\n        out.push(\n          waiting !== null\n            ? `**waiting on:** ${waiting}`\n            : polarity === \"error\"\n              ? // The distinction `end: \"error\"` bought, spent where it is worth\n                // something: this task is as finished as a shipped one, and the\n                // phase it is in is going to trip the lane when its siblings\n                // finish. A report that said \"final\" for both would bury that.\n                `**waiting on:** nothing — this task landed on the error final \\`${state.type}\\`, and \\`${stand.name}\\` will trip the lane when its siblings finish.`\n              : \"**waiting on:** nothing — this task is final.\",\n        );\n        const retries = retryLine(chart, state);\n        if (retries !== null) out.push(retries);\n        out.push(\"\");\n        out.push(\"```mermaid\");\n        out.push(\n          drawTask(chart, {\n            current: state.type,\n            walked: walkedEdges(steps.filter((s) => s.task === taskId)),\n          }),\n        );\n        out.push(\"```\");\n        out.push(\"\");\n      }\n      if (untouched.length > 0) {\n        // Named, not counted: \"6 tasks not started\" tells a reader nothing they\n        // can act on, and the names are what they came for.\n        const chart = lane.charts[untouched[0] as string];\n        const at =\n          chart === undefined ? \"their entry state\" : `\\`${initialOf(chart)}\\``;\n        out.push(\n          `**not started yet:** ${untouched.map((t) => `\\`${t}\\``).join(\", \")} — still at ${at}.`,\n        );\n        out.push(\"\");\n      }\n      continue;\n    }\n    out.push(phaseLine(stand, states));\n    out.push(\"\");\n  }\n\n  // ── the timeline ────────────────────────────────────────────────────────\n  out.push(\"### timeline\");\n  out.push(\"\");\n  out.push(timelineTable(steps));\n  out.push(\"\");\n  return {\n    markdown: `${out\n      .join(\"\\n\")\n      .replace(/\\n{3,}/g, \"\\n\\n\")\n      .trimEnd()}\\n`,\n  };\n}\n\nfunction describeStateValue(value: LaneStatus[\"stateValue\"]): string {\n  if (typeof value === \"string\") return `\\`${value}\\` — the workflow is done.`;\n  const parts: string[] = [];\n  for (const [phase, leaf] of Object.entries(value)) {\n    if (typeof leaf === \"string\") {\n      parts.push(`\\`${phase}\\`: ${leaf}`);\n      continue;\n    }\n    const inner = Object.entries(leaf)\n      .map(([task, state]) => `\\`${task}\\` = \\`${state}\\``)\n      .join(\", \");\n    parts.push(`\\`${phase}\\` → ${inner}`);\n  }\n  return parts.join(\" · \");\n}\n"]}

package/dist/{chunk-7V4EVLZA.js → chunk-O4MVQTEJ.js}

@@ -1,5 +1,5 @@
-import { tryInterpret } from './chunk-5EHLEUTL.js';
-import { Cmd } from './chunk-B5VXOFMZ.js';
+import { tryInterpret } from './chunk-ZSUUOEPL.js';
+import { Cmd } from './chunk-OOYD44JI.js';
 
 // src/snapshot/index.ts
 var DEFAULT_SNAPSHOT_KEY = "@@snapshot";
@@ -89,5 +89,5 @@ function createSnapshot(config) {
 }
 
 export { createSnapshot, snapshotFailed, snapshotLoadFailed, snapshotLoaded, snapshotSaved };
-//# sourceMappingURL=chunk-7V4EVLZA.js.map
-//# sourceMappingURL=chunk-7V4EVLZA.js.map
+//# sourceMappingURL=chunk-O4MVQTEJ.js.map
+//# sourceMappingURL=chunk-O4MVQTEJ.js.map