@caoguo/maplibre-pipeline 0.0.4 → 0.0.6

package/dist/graph/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/graph/adjacency.ts","../../src/graph/bfs.ts","../../src/graph/dfs.ts","../../src/graph/connectivity.ts","../../src/graph/shortestPath.ts"],"names":["cur"],"mappings":";;;AAoCO,SAAS,eAAe,OAAA,EAAiD;AAC9E,EAAA,MAAM,GAAA,uBAAyB,GAAA,EAAI;AAGnC,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAQ,KAAA,EAAO;AAChC,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AAAA,EAC5C;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAQ,KAAA,EAAO;AAChC,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA,IAAU,uBAAuB,IAAA,EAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,CAAA;AAE1E,IAAA,MAAM,WAAW,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,QAAQ,KAAK,EAAC;AAC5C,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,IAAI,IAAA,CAAK,MAAA;AAAA,MACT,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,QAAQ,CAAA;AAE/B,IAAA,MAAM,SAAS,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,EAAC;AACxC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,IAAI,IAAA,CAAK,QAAA;AAAA,MACT,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC7B;AAEA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,sBAAA,CACd,MACA,KAAA,EACQ;AACR,EAAA,IAAI,KAAK,MAAA,IAAU,IAAA,CAAK,MAAA,GAAS,CAAA,SAAU,IAAA,CAAK,MAAA;AAChD,EAAA,IAAI,IAAA,CAAK,QAAA,IAAY,IAAA,CAAK,QAAA,CAAS,UAAU,CAAA,EAAG;AAC9C,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,KAAA,IAAS,SAAA;AAAA,QACP,IAAA,CAAK,QAAA,CAAS,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA;AAAA,QACtB,IAAA,CAAK,QAAA,CAAS,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA;AAAA,QACtB,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,CAAC,CAAA;AAAA,QAClB,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,CAAC;AAAA,OACpB;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,QAAQ,CAAA;AACrD,EAAA,MAAM,EAAA,GAAK,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,MAAM,CAAA;AACjD,EAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,EAAI,OAAO,CAAA;AACzB,EAAA,OAAO,SAAA,CAAU,KAAK,GAAA,EAAK,IAAA,CAAK,KAAK,EAAA,CAAG,GAAA,EAAK,GAAG,GAAG,CAAA;AACrD;AAGO,SAAS,SAAA,CACd,IAAA,EACA,IAAA,EACA,IAAA,EACA,IAAA,EACQ;AACR,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,MAAM,KAAA,GAAQ,CAAC,CAAA,KAAe,CAAA,GAAI,KAAK,EAAA,GAAM,GAAA;AAC7C,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,GAAO,IAAI,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,GAAO,IAAI,CAAA;AAC9B,EAAA,MAAM,CAAA,GACJ,KAAK,GAAA,CAAI,IAAA,GAAO,CAAC,CAAA,IAAK,CAAA,GACtB,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,GAClB,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,IACpB,IAAA,CAAK,GAAA,CAAI,IAAA,GAAO,CAAC,CAAA,IAAK,CAAA;AAC1B,EAAA,OAAO,IAAI,CAAA,GAAI,IAAA,CAAK,KAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACvC;AAGO,SAAS,WAAA,CAAY,KAAoB,MAAA,EAA0B;AACxE,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,MAAM,KAAK,EAAC;AACjC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACnB,MAAA,IAAA,CAAK,GAAA,CAAI,EAAE,EAAE,CAAA;AACb,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,EAAE,CAAA;AAAA,IACf;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,OAAA,CAAQ,KAAoB,MAAA,EAA2B;AACrE,EAAA,OAAO,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC;AAC7B;;;ACpFO,SAAS,GAAA,CACd,GAAA,EACA,KAAA,EACA,IAAA,GAAmB,EAAC,EACT;AACX,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA,EAAG;AACnB,IAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,KAAA,EAAM;AAAA,EACnC;AAEA,EAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,IAAA,OAAO,EAAE,OAAA,EAAS,EAAC,EAAG,SAAS,KAAA,EAAM;AAAA,EACvC;AAEA,EAAA,MAAM,QAA8C,CAAC,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AAC5E,EAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,EAAA,UAAA,CAAW,IAAI,KAAK,CAAA;AACpB,EAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAElB,EAAA,IAAI,QAAA;AACJ,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,KAAA,EAAM;AAElC,IAAA,IAAI,IAAA,CAAK,KAAA,IAAS,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,EAAG;AAChC,MAAA,QAAA,GAAW,EAAA;AACX,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AAE3D,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAC9B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AACjB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,KAAA,EAAO,KAAK,QAAA,EAAS;AAClD;AAOO,SAAS,cAAA,CACd,GAAA,EACA,MAAA,EACA,IAAA,GAAmB,EAAC,EAC4B;AAChD,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,MAAM,QAA8C,EAAC;AAErD,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,EAAG;AACjB,IAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,CAAC,CAAA,EAAG;AAC5C,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACtB,MAAA,UAAA,CAAW,IAAI,CAAC,CAAA;AAChB,MAAA,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,CAAA;AACnB,MAAA,SAAA,CAAU,GAAA,CAAI,GAAG,CAAC,CAAA;AAClB,MAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AACd,MAAA,KAAA,CAAM,KAAK,EAAE,EAAA,EAAI,CAAA,EAAG,KAAA,EAAO,GAAG,CAAA;AAAA,IAChC;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,KAAA,EAAM;AAElC,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AAE3D,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAC9B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,SAAA,CAAU,IAAI,CAAA,CAAE,EAAA,EAAI,SAAA,CAAU,GAAA,CAAI,EAAE,CAAE,CAAA;AACtC,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AACjB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,SAAS,OAAA,EAAS,KAAA,EAAO,OAAO,CAAC,CAAA,IAAK,IAAI,SAAA,EAAU;AAC/D;AAOO,SAAS,eAAA,CACd,SACA,GAAA,EACU;AACV,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,IAAI,GAAA,GAAqB,GAAA;AACzB,EAAA,OAAO,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACzB,IAAA,GAAA,GAAM,CAAA,IAAK,IAAA;AACX,IAAA,IAAI,GAAA,KAAQ,IAAA,IAAQ,CAAA,KAAM,IAAA,EAAM;AAE9B,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAM,IAAA,IAAQ,IAAA,CAAK,WAAW,CAAA,EAAG;AACpD,MAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,GAAA,EAAK;AAGrB,EAAA,OAAO,IAAA;AACT;;;AC5IO,SAAS,GAAA,CACd,GAAA,EACA,KAAA,EACA,IAAA,GAAmB,EAAC,EACT;AACX,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,IAAI,SAAA,GAAY,KAAA;AAEhB,EAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA,EAAG;AACnB,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,SAAA,EAAU;AAAA,EACvC;AACA,EAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,SAAA,EAAU;AAAA,EACvC;AAEA,EAAA,MAAM,QAA8C,CAAC,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AAC5E,EAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,EAAA,UAAA,CAAW,IAAI,KAAK,CAAA;AAEpB,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,GAAA,EAAI;AAChC,IAAA,OAAA,CAAQ,KAAK,EAAE,CAAA;AAEf,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AACzD,MAAA,SAAA,GAAY,IAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAE9B,IAAA,KAAA,IAAS,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AAC1C,MAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,SAAA,EAAU;AACvC;AAMO,SAAS,aAAa,GAAA,EAAgC;AAC3D,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,QAAwD,EAAC;AAE/D,EAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,CAAI,IAAA,EAAK,EAAG;AAC7B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAEvB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAA,CAAO,IAAI,GAAA,CAAI,IAAI,KAAK,EAAC,EAAG,MAAA,CAAO,QAAQ,CAAA;AAAE,KAC9C,CAAA;AACD,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAEhB,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AAClC,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,IAAA,CAAK,IAAA,EAAK;AAC3B,MAAA,IAAI,KAAK,IAAA,EAAM;AACb,QAAA,OAAA,CAAQ,MAAA,CAAO,IAAI,EAAE,CAAA;AACrB,QAAA,KAAA,CAAM,GAAA,EAAI;AACV,QAAA;AAAA,MACF;AACA,MAAA,MAAM,MAAA,GAAS,KAAK,KAAA,CAAM,EAAA;AAC1B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AAEvB,QAAA,MAAM,KAAA,GAAkB,CAAC,MAAM,CAAA;AAC/B,QAAA,KAAA,IAAS,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AAC1C,UAAA,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,EAAE,CAAA;AACtB,UAAA,IAAI,KAAA,CAAM,CAAC,CAAA,CAAE,EAAA,KAAO,MAAA,EAAQ;AAAA,QAC9B;AACA,QAAA,KAAA,CAAM,OAAA,EAAQ;AAGd,QAAA,IAAI,IAAI,IAAI,KAAK,CAAA,CAAE,QAAQ,CAAA,EAAG,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,MACjD,CAAA,MAAA,IAAW,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AAC/B,QAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,QAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,QAAA,KAAA,CAAM,IAAA,CAAK;AAAA,UACT,EAAA,EAAI,MAAA;AAAA,UACJ,IAAA,EAAA,CAAO,IAAI,GAAA,CAAI,MAAM,KAAK,EAAC,EAAG,MAAA,CAAO,QAAQ,CAAA;AAAE,SAChD,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;ACnGO,SAAS,uBAAA,CACd,KACA,KAAA,EACsB;AACtB,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,aAAmC,EAAC;AAE1C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO,QAAA,CAAS,IAAI,CAAA,CAAE,EAAA,EAAI,EAAE,IAAI,CAAA;AAEhD,EAAA,KAAA,MAAW,MAAA,IAAU,GAAA,CAAI,IAAA,EAAK,EAAG;AAC/B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AACzB,IAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,EAAK,MAAM,CAAA;AACzB,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,MAAW,EAAA,IAAM,EAAE,OAAA,EAAS;AAC1B,MAAA,OAAA,CAAQ,IAAI,EAAE,CAAA;AACd,MAAA,IAAI,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA,KAAM,UAAU,SAAA,GAAY,IAAA;AAAA,IACjD;AACA,IAAA,UAAA,CAAW,IAAA,CAAK;AAAA,MACd,OAAO,CAAA,CAAE,OAAA;AAAA,MACT,IAAA,EAAM,EAAE,OAAA,CAAQ,MAAA;AAAA,MAChB;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,UAAA;AACT;AAQO,SAAS,UACd,GAAA,EACA,KAAA,EACA,GAAA,EACA,IAAA,GAAiD,EAAC,EACtC;AACZ,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,CAAA;AAClC,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,EAAA;AAElC,EAAA,MAAM,MAAkB,EAAC;AACzB,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAE/B,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,KAAgB;AAChC,IAAA,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU;AAC5B,IAAA,IAAI,QAAQ,GAAA,EAAK;AACf,MAAA,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,IAAI,CAAC,CAAA;AAClB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAA,CAAO,IAAI,GAAG,CAAA;AACd,IAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AACb,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,GAAG,KAAK,EAAC;AAC/B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACtB,MAAA,QAAA,CAAS,EAAE,EAAE,CAAA;AACb,MAAA,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU;AAAA,IAC9B;AACA,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,EACnB,CAAA;AAEA,EAAA,QAAA,CAAS,KAAK,CAAA;AACd,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,gBAAA,CACd,GAAA,EACA,WAAA,EACA,OAAA,EACA,SAAA,EACqB;AACrB,EAAA,MAAM,IAAA,GAAO,QAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,WAAW,CAAA;AAC3D,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAElB,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAG5D,EAAA,MAAM,UAAU,IAAA,CAAK,QAAA;AACrB,EAAA,MAAM,SAAA,GAAY,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AACtC,EAAA,IAAI,CAAC,WAAW,OAAO,IAAA;AAGvB,EAAA,MAAM,SAAA,GAAY,CAAC,CAAA,EAAY,KAAA,EAAe,EAAA,KAAe;AAE3D,IAAA,MAAM,UAAA,GAAa,QAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,CAAA,CAAE,MAAM,CAAA;AAC9D,IAAA,IAAI,CAAC,YAAY,OAAO,KAAA;AAExB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAGA,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,EAAK,OAAA,EAAS;AAAA,IAC1B,SAAA;AAAA,IACA,KAAA,EAAO,CAAC,CAAA,KAAM;AACZ,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA;AAC3B,MAAA,OAAO,IAAA,GAAO,SAAA,CAAU,IAAI,CAAA,GAAI,KAAA;AAAA,IAClC,CAAA;AAAA,IACA,QAAA,EAAU;AAAA,GACX,CAAA;AAED,EAAA,IAAI,CAAC,CAAA,CAAE,GAAA,EAAK,OAAO,IAAA;AACnB,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,GAAG,CAAA,IAAK,IAAA;AAChC;AAOO,SAAS,qBAAA,CACd,KACA,KAAA,EACgD;AAChD,EAAA,MAAM,IAAI,GAAA,CAAI,GAAA,EAAK,OAAO,EAAE,QAAA,EAAU,IAAI,CAAA;AAC1C,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,CAAA,CAAE,OAAO,CAAA;AACjC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,KAAA,MAAW,CAAA,IAAK,EAAE,OAAA,EAAS;AACzB,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,CAAC,KAAK,EAAC;AAC7B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AAErB,MAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,CAAE,EAAE,GAAG,OAAA,CAAQ,GAAA,CAAI,EAAE,MAAM,CAAA;AAAA,IAC7C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ;AAC5B;;;ACxIO,SAAS,SACd,GAAA,EACA,KAAA,EACA,GAAA,EACA,IAAA,GAA4B,EAAC,EACT;AACpB,EAAA,IAAI,CAAC,IAAI,GAAA,CAAI,KAAK,KAAK,CAAC,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA,EAAG;AACpC,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,MAAM,EAAC,EAAG,OAAO,KAAA,EAAM;AAAA,EACtD;AAEA,EAAA,MAAM,SAAS,IAAA,CAAK,MAAA,KAAW,CAAC,CAAA,KAAe,EAAE,MAAA,IAAU,CAAA,CAAA;AAE3D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAuC,CAAC,EAAE,IAAI,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA;AAEjE,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,IAAA,EAAK,EAAG;AAC1B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAG,QAAQ,CAAA;AACpB,IAAA,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,CAAA;AAAA,EACrB;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,OAAO,CAAC,CAAA;AAEjB,EAAA,OAAO,EAAA,CAAG,SAAS,CAAA,EAAG;AAEpB,IAAA,EAAA,CAAG,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,CAAA,GAAI,EAAE,CAAC,CAAA;AAC3B,IAAA,MAAMA,IAAAA,GAAM,GAAG,KAAA,EAAM;AACrB,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAIA,IAAAA,CAAI,EAAE,CAAA,EAAG;AACzB,IAAA,OAAA,CAAQ,GAAA,CAAIA,KAAI,EAAE,CAAA;AAClB,IAAA,IAAIA,IAAAA,CAAI,OAAO,GAAA,EAAK;AAEpB,IAAA,MAAM,QAAQ,GAAA,CAAI,GAAA,CAAIA,IAAAA,CAAI,EAAE,KAAK,EAAC;AAClC,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACvB,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAIA,IAAAA,CAAI,EAAE,KAAK,QAAA,IAAY,CAAA;AAC7C,MAAA,IAAI,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,KAAK,QAAA,CAAA,EAAW;AACtC,QAAA,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,GAAG,CAAA;AAClB,QAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAIA,IAAAA,CAAI,EAAE,CAAA;AACxB,QAAA,EAAA,CAAG,KAAK,EAAE,EAAA,EAAI,EAAE,EAAA,EAAI,CAAA,EAAG,KAAK,CAAA;AAAA,MAC9B;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,IAAA,CAAK,KAAA,CAAMA,KAAI,EAAA,EAAIA,IAAAA,CAAI,CAAC,CAAA,EAAG;AAAA,EAC/C;AAEA,EAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,cAAc,QAAA,EAAU;AAC5C,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,MAAM,EAAC,EAAG,OAAO,KAAA,EAAM;AAAA,EACtD;AAGA,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,IAAI,GAAA,GAAqB,GAAA;AACzB,EAAA,OAAO,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACzB,IAAA,IAAI,MAAM,MAAA,EAAW;AACrB,IAAA,GAAA,GAAM,CAAA;AAAA,EACR;AAEA,EAAA,OAAO,EAAE,UAAU,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,IAAA,EAAK;AAC3D","file":"index.cjs","sourcesContent":["/**\n * 图邻接表构建（管线拓扑 → 双向邻接表）\n *\n * 输入：管网拓扑数据集（节点 + 管段）\n * 输出：邻接表 Map<nodeId, Edge[]>\n *\n * Phase 1 图遍历的入口：把物理拓扑转换为图论可用的数据结构。\n */\n\nimport type {\n  PipelineNode,\n  PipelinePipe,\n  PipelineTopologyDataset,\n} from '../types';\n\n/**\n * 邻接表中的\"边\"\n *  - 物理上一条 pipe 是两个 node 之间的连接\n *  - 邻接表中记录：pipeId、邻居节点 id、长度等\n */\nexport interface AdjEdge {\n  pipeId: string;\n  /** 邻居节点 id（沿此边走一步到达） */\n  to: string;\n  /** 长度（m），无则 0 */\n  length: number;\n  /** 阻力/权重（用于复杂路径优选，可选） */\n  weight?: number;\n}\n\n/** 邻接表：Map<nodeId, AdjEdge[]> */\nexport type AdjacencyList = Map<string, AdjEdge[]>;\n\n/**\n * 从 PipelineTopologyDataset 构建邻接表\n */\nexport function buildAdjacency(dataset: PipelineTopologyDataset): AdjacencyList {\n  const adj: AdjacencyList = new Map();\n\n  // 初始化所有节点（防止孤立点不出现）\n  for (const node of dataset.nodes) {\n    if (!adj.has(node.id)) adj.set(node.id, []);\n  }\n\n  for (const pipe of dataset.pipes) {\n    const len = pipe.length ?? pipeLengthFromGeometry(pipe, dataset.nodes) ?? 0;\n\n    const fromList = adj.get(pipe.fromNode) ?? [];\n    fromList.push({\n      pipeId: pipe.id,\n      to: pipe.toNode,\n      length: len,\n    });\n    adj.set(pipe.fromNode, fromList);\n\n    const toList = adj.get(pipe.toNode) ?? [];\n    toList.push({\n      pipeId: pipe.id,\n      to: pipe.fromNode,\n      length: len,\n    });\n    adj.set(pipe.toNode, toList);\n  }\n\n  return adj;\n}\n\n/**\n * 计算单条 pipe 长度（haversine）\n * 若 pipe 提供 geometry 则累计几何点距离，否则按 from-to 直线长度。\n */\nexport function pipeLengthFromGeometry(\n  pipe: PipelinePipe,\n  nodes: PipelineNode[]\n): number {\n  if (pipe.length && pipe.length > 0) return pipe.length;\n  if (pipe.geometry && pipe.geometry.length >= 2) {\n    let total = 0;\n    for (let i = 1; i < pipe.geometry.length; i++) {\n      total += haversine(\n        pipe.geometry[i - 1][0],\n        pipe.geometry[i - 1][1],\n        pipe.geometry[i][0],\n        pipe.geometry[i][1]\n      );\n    }\n    return total;\n  }\n  const from = nodes.find((n) => n.id === pipe.fromNode);\n  const to = nodes.find((n) => n.id === pipe.toNode);\n  if (!from || !to) return 0;\n  return haversine(from.lng, from.lat, to.lng, to.lat);\n}\n\n/** Haversine 距离（m） */\nexport function haversine(\n  lng1: number,\n  lat1: number,\n  lng2: number,\n  lat2: number\n): number {\n  const R = 6_371_000;\n  const toRad = (d: number) => (d * Math.PI) / 180;\n  const dLat = toRad(lat2 - lat1);\n  const dLng = toRad(lng2 - lng1);\n  const a =\n    Math.sin(dLat / 2) ** 2 +\n    Math.cos(toRad(lat1)) *\n      Math.cos(toRad(lat2)) *\n      Math.sin(dLng / 2) ** 2;\n  return 2 * R * Math.asin(Math.sqrt(a));\n}\n\n/** 从邻接表拿指定节点的邻居 id 列表（去重） */\nexport function neighborIds(adj: AdjacencyList, nodeId: string): string[] {\n  const list = adj.get(nodeId) ?? [];\n  const seen = new Set<string>();\n  const out: string[] = [];\n  for (const e of list) {\n    if (!seen.has(e.to)) {\n      seen.add(e.to);\n      out.push(e.to);\n    }\n  }\n  return out;\n}\n\n/** 取出指定节点的所有边 */\nexport function edgesOf(adj: AdjacencyList, nodeId: string): AdjEdge[] {\n  return adj.get(nodeId) ?? [];\n}\n","/**\n * BFS（广度优先遍历）\n *\n * 用途：\n * - 爆管推演：下游影响范围（沿拓扑扩散）\n * - 连通性查询：在指定层级内查找可达节点\n *\n * 实现要点：\n * - 支持 visited / parents 记录\n * - 支持 maxDepth 限制（避免极大连通分量过长）\n * - 支持 predicate 过滤可继续遍历的邻居\n * - 可返回\"沿途经过的管段\"列表（用于前端高亮）\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface BfsResult {\n  /** 访问过的节点（不重复） */\n  visited: string[];\n  /** 父节点表：node -> 上一步到达的 node（首节点为自身） */\n  parents: Map<string, string | null>;\n  /** 起点 节点 */\n  start: string;\n  /** 终点节点（搜到即停，返回时 visited 是到终点为止的节点） */\n  end?: string;\n}\n\nexport interface BfsOptions {\n  /** 最大深度（边数），默认无限制 */\n  maxDepth?: number;\n  /** 是否指定终点（BFS 找到则停止） */\n  until?: (node: string) => boolean;\n  /** 在扩展邻居前过滤：false 则该方向不继续遍历 */\n  allowEdge?: (edge: AdjEdge, from: string, to: string) => boolean;\n  /** 起点本身的过滤器（如只走下游/上游） */\n  allowStart?: (node: string) => boolean;\n}\n\n/**\n * 标准 BFS，可指定\"任意邻居是否可达\"\n *\n * 用法：\n *   const r = bfs(adj, 'node-A');\n *   bfs(adj, 'start', { until: (n) => n === 'target' }); // 找终点\n *   bfs(adj, 'start', { allowEdge: (_, __, to) => to !== 'forbidden' });\n */\nexport function bfs(\n  adj: AdjacencyList,\n  start: string,\n  opts: BfsOptions = {}\n): BfsResult {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const visitedSet = new Set<string>();\n\n  if (!adj.has(start)) {\n    parents.set(start, null);\n    return { visited, parents, start };\n  }\n\n  if (opts.allowStart && !opts.allowStart(start)) {\n    return { visited: [], parents, start };\n  }\n\n  const queue: Array<{ id: string; depth: number }> = [{ id: start, depth: 0 }];\n  parents.set(start, null);\n  visitedSet.add(start);\n  visited.push(start);\n\n  let foundEnd: string | undefined;\n  while (queue.length > 0) {\n    const { id, depth } = queue.shift()!;\n\n    if (opts.until && opts.until(id)) {\n      foundEnd = id;\n      break;\n    }\n\n    // maxDepth 语义：最多走 N 条边，到达节点的最短路径长度为 N\n    // 当前节点 depth=d = 经过 d 条边到达，扩展邻居须 depth+1 <= maxDepth\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) continue;\n\n    const edges = adj.get(id) ?? [];\n    for (const e of edges) {\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      visited.push(e.to);\n      queue.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, start, end: foundEnd };\n}\n\n/**\n * 多源 BFS（同时从多个起点扩散）\n *\n * 用法：爆管分析的下游影响可从多点同时推演（如多个隔离阀门的下游剩余服务区）\n */\nexport function multiSourceBfs(\n  adj: AdjacencyList,\n  starts: string[],\n  opts: BfsOptions = {}\n): BfsResult & { sourceMap: Map<string, string> } {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const sourceMap = new Map<string, string>();\n  const visitedSet = new Set<string>();\n\n  const queue: Array<{ id: string; depth: number }> = [];\n\n  for (const s of starts) {\n    if (!adj.has(s)) continue;\n    if (opts.allowStart && !opts.allowStart(s)) continue;\n    if (!visitedSet.has(s)) {\n      visitedSet.add(s);\n      parents.set(s, null);\n      sourceMap.set(s, s);\n      visited.push(s);\n      queue.push({ id: s, depth: 0 });\n    }\n  }\n\n  while (queue.length > 0) {\n    const { id, depth } = queue.shift()!;\n    // 同单源 BFS：depth=d 时扩展邻居；maxDepth=N 表示最多 N 条边\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) continue;\n\n    const edges = adj.get(id) ?? [];\n    for (const e of edges) {\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      sourceMap.set(e.to, sourceMap.get(id)!);\n      visited.push(e.to);\n      queue.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, start: starts[0] ?? '', sourceMap };\n}\n\n/**\n * 反向 BFS（沿父指针回溯）\n *\n * 给定终点 + parents Map，可还原 BFS 路径（用于\"找到的最短路径\"）。\n */\nexport function reconstructPath(\n  parents: Map<string, string | null>,\n  end: string\n): string[] {\n  const path: string[] = [];\n  let cur: string | null = end;\n  while (cur) {\n    path.unshift(cur);\n    const p = parents.get(cur);\n    cur = p ?? null;\n    if (cur === null && p === null) {\n      // 起点到达\n      if (parents.get(end) === null && path.length === 1) break;\n      break;\n    }\n  }\n  if (path[0] !== end) {\n    // already include end correctly\n  }\n  return path;\n}\n","/**\n * DFS（深度优先遍历）\n *\n * 用途：\n * - 管线编辑后构建新的连通分量\n * - 环检测（爆管推演风险评估）\n * - 上游路径追踪\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface DfsOptions {\n  /** 最大深度，默认无限制 */\n  maxDepth?: number;\n  /** 邻居过滤（在遍历孩子前判断） */\n  allowEdge?: (edge: AdjEdge, from: string, to: string) => boolean;\n  /** 起点过滤器 */\n  allowStart?: (node: string) => boolean;\n}\n\nexport interface DfsResult {\n  visited: string[];\n  parents: Map<string, string | null>;\n  /** 是否触发了 maxDepth 截断（true=未完全遍历） */\n  truncated: boolean;\n}\n\n/**\n * 深度优先遍历\n */\nexport function dfs(\n  adj: AdjacencyList,\n  start: string,\n  opts: DfsOptions = {}\n): DfsResult {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const visitedSet = new Set<string>();\n  let truncated = false;\n\n  if (!adj.has(start)) {\n    return { visited, parents, truncated };\n  }\n  if (opts.allowStart && !opts.allowStart(start)) {\n    return { visited, parents, truncated };\n  }\n\n  const stack: Array<{ id: string; depth: number }> = [{ id: start, depth: 0 }];\n  parents.set(start, null);\n  visitedSet.add(start);\n\n  while (stack.length > 0) {\n    const { id, depth } = stack.pop()!;\n    visited.push(id);\n\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) {\n      truncated = true;\n      continue;\n    }\n\n    const edges = adj.get(id) ?? [];\n    // 倒序遍历以保持\"原本右子树先访问\"的 DFS 直观\n    for (let i = edges.length - 1; i >= 0; i--) {\n      const e = edges[i];\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      stack.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, truncated };\n}\n\n/**\n * 检测有向图中的所有环（基于 Tarjan 算法的简化版本）。\n * 返回包含环的所有节点集合（连通分量内存在环时整分量被标记）。\n */\nexport function detectCycles(adj: AdjacencyList): string[][] {\n  const cycles: string[][] = [];\n  const visited = new Set<string>();\n  const onStack = new Set<string>();\n  const stack: Array<{ id: string; iter: Iterator<AdjEdge> }> = [];\n\n  for (const node of adj.keys()) {\n    if (visited.has(node)) continue;\n    const localCycle: string[] = [];\n    stack.push({\n      id: node,\n      iter: (adj.get(node) ?? [])[Symbol.iterator](),\n    });\n    onStack.add(node);\n    visited.add(node);\n\n    while (stack.length > 0) {\n      const top = stack[stack.length - 1];\n      const next = top.iter.next();\n      if (next.done) {\n        onStack.delete(top.id);\n        stack.pop();\n        continue;\n      }\n      const nextId = next.value.to;\n      if (onStack.has(nextId)) {\n        // 找到环：提取 onStack 中从 nextId 到 top.id 的所有节点\n        const cycle: string[] = [nextId];\n        for (let i = stack.length - 1; i >= 0; i--) {\n          cycle.push(stack[i].id);\n          if (stack[i].id === nextId) break;\n        }\n        cycle.reverse();\n        // 双向建表会把 s->v1->s 视为 2 节点\"环\"（实质是同一物理边的双向表示），\n        // 只保留 ≥3 个不同节点的\"真环\"\n        if (new Set(cycle).size >= 3) cycles.push(cycle);\n      } else if (!visited.has(nextId)) {\n        visited.add(nextId);\n        onStack.add(nextId);\n        stack.push({\n          id: nextId,\n          iter: (adj.get(nextId) ?? [])[Symbol.iterator](),\n        });\n      }\n    }\n  }\n\n  return cycles;\n}\n","/**\n * 连通性分析\n *\n * 用途：\n * - P-4 连通性高亮：选中管线后高亮上下游连通路径\n * - 健康评估的影响范围计算\n * - 用户问\"阀门X关闭后影响哪些小区？\"\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\nimport { bfs } from './bfs';\nimport type { PipelineNode, PipelineTopologyDataset, NodeKind } from '../types';\n\n/**\n * 连通分量（连通子图）\n */\nexport interface ConnectedComponent {\n  /** 节点集合 */\n  nodes: string[];\n  /** 节点数 */\n  size: number;\n  /** 是否包含 source 类型节点（影响气源/水源判定） */\n  hasSource: boolean;\n}\n\n/**\n * 求所有连通分量\n */\nexport function findConnectedComponents(\n  adj: AdjacencyList,\n  nodes: PipelineNode[]\n): ConnectedComponent[] {\n  const visited = new Set<string>();\n  const components: ConnectedComponent[] = [];\n\n  const kindById = new Map<string, NodeKind>();\n  for (const n of nodes) kindById.set(n.id, n.kind);\n\n  for (const nodeId of adj.keys()) {\n    if (visited.has(nodeId)) continue;\n    const r = bfs(adj, nodeId);\n    let hasSource = false;\n    for (const id of r.visited) {\n      visited.add(id);\n      if (kindById.get(id) === 'source') hasSource = true;\n    }\n    components.push({\n      nodes: r.visited,\n      size: r.visited.length,\n      hasSource,\n    });\n  }\n\n  return components;\n}\n\n/**\n * 找到两个节点之间的所有路径（k 短路）\n *\n * 用途：阀门隔离方案中\"备选路径\"分析\n * NOTE：DFS+Yen's 算法简化版，路径数 < 10 适用。\n */\nexport function findPaths(\n  adj: AdjacencyList,\n  start: string,\n  end: string,\n  opts: { maxPaths?: number; maxDepth?: number } = {}\n): string[][] {\n  const maxPaths = opts.maxPaths ?? 3;\n  const maxDepth = opts.maxDepth ?? 20;\n\n  const all: string[][] = [];\n  const path: string[] = [];\n  const onPath = new Set<string>();\n\n  const dfsLocal = (cur: string) => {\n    if (all.length >= maxPaths) return;\n    if (cur === end) {\n      all.push([...path]);\n      return;\n    }\n    if (path.length >= maxDepth) return;\n    onPath.add(cur);\n    path.push(cur);\n    const edges = adj.get(cur) ?? [];\n    for (const e of edges) {\n      if (onPath.has(e.to)) continue;\n      dfsLocal(e.to);\n      if (all.length >= maxPaths) return;\n    }\n    path.pop();\n    onPath.delete(cur);\n  };\n\n  dfsLocal(start);\n  return all;\n}\n\n/**\n * 沿拓扑向上游找到最近的指定类型节点（默认阀门）\n *\n * 用途：爆管推演自动定位隔离点（PRD §4.2.4 step 1）\n */\nexport function findUpstreamNode(\n  adj: AdjacencyList,\n  startPipeId: string,\n  dataset: PipelineTopologyDataset,\n  predicate: (n: PipelineNode) => boolean\n): PipelineNode | null {\n  const pipe = dataset.pipes.find((p) => p.id === startPipeId);\n  if (!pipe) return null;\n\n  const nodeById = new Map(dataset.nodes.map((n) => [n.id, n]));\n\n  // 起始：pipe 任意一端的\"非故障方向\" → 选择 fromNode 作为查找起点\n  const startId = pipe.fromNode;\n  const startNode = nodeById.get(startId);\n  if (!startNode) return null;\n\n  // 反向游走：只允许沿\"反向\"（即 from 是 to，to 是 from）前进\n  const allowEdge = (e: AdjEdge, _from: string, to: string) => {\n    // 边界：pipe 同时含 startId 端则允许从 startId 反向走\n    const targetPipe = dataset.pipes.find((p) => p.id === e.pipeId);\n    if (!targetPipe) return false;\n    // 始终允许走（无向图）\n    return true;\n  };\n\n  // BFS 到上层直到命中 predicate\n  const r = bfs(adj, startId, {\n    allowEdge,\n    until: (n) => {\n      const node = nodeById.get(n);\n      return node ? predicate(node) : false;\n    },\n    maxDepth: 50,\n  });\n\n  if (!r.end) return null;\n  return nodeById.get(r.end) ?? null;\n}\n\n/**\n * 高亮连通路径（从起点 BFS，把沿途所有 pipe 收集起来）\n *\n * 用途：选中管段/节点 → 高亮上下游\n */\nexport function highlightConnectivity(\n  adj: AdjacencyList,\n  start: string\n): { nodeIds: Set<string>; edgeIds: Set<string> } {\n  const r = bfs(adj, start, { maxDepth: 64 });\n  const nodeIds = new Set(r.visited);\n  const edgeIds = new Set<string>();\n\n  for (const n of r.visited) {\n    const edges = adj.get(n) ?? [];\n    for (const e of edges) {\n      // 只高亮两端都已访问的边\n      if (nodeIds.has(e.to)) edgeIds.add(e.pipeId);\n    }\n  }\n\n  return { nodeIds, edgeIds };\n}\n","/**\n * 最短路径（Dijkstra）\n *\n * 用途：\n * - 上游距离最近的阀门定位\n * - 备选供气/供水路径（按管径/压力选优）\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface ShortestPathResult {\n  distance: number;\n  path: string[];\n  found: boolean;\n}\n\nexport interface ShortestPathOptions {\n  /** 边权重函数：默认 1 */\n  weight?: (edge: AdjEdge) => number;\n  /** 提前终止：找到满足条件的节点立即返回 */\n  until?: (node: string, dist: number) => boolean;\n}\n\n/**\n * Dijkstra 最短路径\n *\n * 注意：当存在负权边时不可用；管网场景边权重非负，管长/管径均适用。\n */\nexport function dijkstra(\n  adj: AdjacencyList,\n  start: string,\n  end: string,\n  opts: ShortestPathOptions = {}\n): ShortestPathResult {\n  if (!adj.has(start) || !adj.has(end)) {\n    return { distance: Infinity, path: [], found: false };\n  }\n\n  const weight = opts.weight ?? ((e: AdjEdge) => e.length || 1);\n\n  const dist = new Map<string, number>();\n  const parents = new Map<string, string | null>();\n  const visited = new Set<string>();\n  const pq: Array<{ id: string; d: number }> = [{ id: start, d: 0 }];\n\n  for (const n of adj.keys()) {\n    dist.set(n, Infinity);\n    parents.set(n, null);\n  }\n  dist.set(start, 0);\n\n  while (pq.length > 0) {\n    // 简化：线性查找最小值（小图足够；大规模可换二叉堆）\n    pq.sort((a, b) => a.d - b.d);\n    const cur = pq.shift()!;\n    if (visited.has(cur.id)) continue;\n    visited.add(cur.id);\n    if (cur.id === end) break;\n\n    const edges = adj.get(cur.id) ?? [];\n    for (const e of edges) {\n      if (visited.has(e.to)) continue;\n      const w = weight(e);\n      const alt = (dist.get(cur.id) ?? Infinity) + w;\n      if (alt < (dist.get(e.to) ?? Infinity)) {\n        dist.set(e.to, alt);\n        parents.set(e.to, cur.id);\n        pq.push({ id: e.to, d: alt });\n      }\n    }\n\n    if (opts.until && opts.until(cur.id, cur.d)) break;\n  }\n\n  if ((dist.get(end) ?? Infinity) === Infinity) {\n    return { distance: Infinity, path: [], found: false };\n  }\n\n  // 回溯路径\n  const path: string[] = [];\n  let cur: string | null = end;\n  while (cur) {\n    path.unshift(cur);\n    const p = parents.get(cur);\n    if (p === undefined) break;\n    cur = p;\n  }\n\n  return { distance: dist.get(end) ?? 0, path, found: true };\n}\n"]}
+{"version":3,"sources":["../../src/graph/adjacency.ts","../../src/graph/bfs.ts","../../src/graph/dfs.ts","../../src/graph/connectivity.ts","../../src/graph/shortestPath.ts"],"names":["cur"],"mappings":";;;AAoCO,SAAS,eAAe,OAAA,EAAiD;AAC9E,EAAA,MAAM,GAAA,uBAAyB,GAAA,EAAI;AAGnC,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAQ,KAAA,EAAO;AAChC,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AAAA,EAC5C;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAQ,KAAA,EAAO;AAChC,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA,IAAU,uBAAuB,IAAA,EAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,CAAA;AAE1E,IAAA,MAAM,WAAW,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,QAAQ,KAAK,EAAC;AAC5C,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,IAAI,IAAA,CAAK,MAAA;AAAA,MACT,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,QAAQ,CAAA;AAE/B,IAAA,MAAM,SAAS,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,EAAC;AACxC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,IAAI,IAAA,CAAK,QAAA;AAAA,MACT,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC7B;AAEA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,sBAAA,CACd,MACA,KAAA,EACQ;AACR,EAAA,IAAI,KAAK,MAAA,IAAU,IAAA,CAAK,MAAA,GAAS,CAAA,SAAU,IAAA,CAAK,MAAA;AAChD,EAAA,IAAI,IAAA,CAAK,QAAA,IAAY,IAAA,CAAK,QAAA,CAAS,UAAU,CAAA,EAAG;AAC9C,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,KAAA,IAAS,SAAA;AAAA,QACP,IAAA,CAAK,QAAA,CAAS,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA;AAAA,QACtB,IAAA,CAAK,QAAA,CAAS,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA;AAAA,QACtB,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,CAAC,CAAA;AAAA,QAClB,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,CAAC;AAAA,OACpB;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,QAAQ,CAAA;AACrD,EAAA,MAAM,EAAA,GAAK,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,MAAM,CAAA;AACjD,EAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,EAAI,OAAO,CAAA;AACzB,EAAA,OAAO,SAAA,CAAU,KAAK,GAAA,EAAK,IAAA,CAAK,KAAK,EAAA,CAAG,GAAA,EAAK,GAAG,GAAG,CAAA;AACrD;AAGO,SAAS,SAAA,CACd,IAAA,EACA,IAAA,EACA,IAAA,EACA,IAAA,EACQ;AACR,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,MAAM,KAAA,GAAQ,CAAC,CAAA,KAAe,CAAA,GAAI,KAAK,EAAA,GAAM,GAAA;AAC7C,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,GAAO,IAAI,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,GAAO,IAAI,CAAA;AAC9B,EAAA,MAAM,CAAA,GACJ,KAAK,GAAA,CAAI,IAAA,GAAO,CAAC,CAAA,IAAK,CAAA,GACtB,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,GAClB,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,IACpB,IAAA,CAAK,GAAA,CAAI,IAAA,GAAO,CAAC,CAAA,IAAK,CAAA;AAC1B,EAAA,OAAO,IAAI,CAAA,GAAI,IAAA,CAAK,KAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACvC;AAGO,SAAS,WAAA,CAAY,KAAoB,MAAA,EAA0B;AACxE,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,MAAM,KAAK,EAAC;AACjC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACnB,MAAA,IAAA,CAAK,GAAA,CAAI,EAAE,EAAE,CAAA;AACb,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,EAAE,CAAA;AAAA,IACf;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,OAAA,CAAQ,KAAoB,MAAA,EAA2B;AACrE,EAAA,OAAO,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC;AAC7B;;;ACpFO,SAAS,GAAA,CACd,GAAA,EACA,KAAA,EACA,IAAA,GAAmB,EAAC,EACT;AACX,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA,EAAG;AACnB,IAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,KAAA,EAAM;AAAA,EACnC;AAEA,EAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,IAAA,OAAO,EAAE,OAAA,EAAS,EAAC,EAAG,SAAS,KAAA,EAAM;AAAA,EACvC;AAEA,EAAA,MAAM,QAA8C,CAAC,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AAC5E,EAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,EAAA,UAAA,CAAW,IAAI,KAAK,CAAA;AACpB,EAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAElB,EAAA,IAAI,QAAA;AACJ,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,KAAA,EAAM;AAElC,IAAA,IAAI,IAAA,CAAK,KAAA,IAAS,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,EAAG;AAChC,MAAA,QAAA,GAAW,EAAA;AACX,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AAE3D,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAC9B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AACjB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,KAAA,EAAO,KAAK,QAAA,EAAS;AAClD;AAOO,SAAS,cAAA,CACd,GAAA,EACA,MAAA,EACA,IAAA,GAAmB,EAAC,EAC4B;AAChD,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,MAAM,QAA8C,EAAC;AAErD,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,EAAG;AACjB,IAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,CAAC,CAAA,EAAG;AAC5C,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACtB,MAAA,UAAA,CAAW,IAAI,CAAC,CAAA;AAChB,MAAA,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,CAAA;AACnB,MAAA,SAAA,CAAU,GAAA,CAAI,GAAG,CAAC,CAAA;AAClB,MAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AACd,MAAA,KAAA,CAAM,KAAK,EAAE,EAAA,EAAI,CAAA,EAAG,KAAA,EAAO,GAAG,CAAA;AAAA,IAChC;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,KAAA,EAAM;AAElC,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AAE3D,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAC9B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,SAAA,CAAU,IAAI,CAAA,CAAE,EAAA,EAAI,SAAA,CAAU,GAAA,CAAI,EAAE,CAAE,CAAA;AACtC,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AACjB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,SAAS,OAAA,EAAS,KAAA,EAAO,OAAO,CAAC,CAAA,IAAK,IAAI,SAAA,EAAU;AAC/D;AAOO,SAAS,eAAA,CACd,SACA,GAAA,EACU;AACV,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,IAAI,GAAA,GAAqB,GAAA;AACzB,EAAA,OAAO,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACzB,IAAA,GAAA,GAAM,CAAA,IAAK,IAAA;AACX,IAAA,IAAI,GAAA,KAAQ,IAAA,IAAQ,CAAA,KAAM,IAAA,EAAM;AAE9B,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAM,IAAA,IAAQ,IAAA,CAAK,WAAW,CAAA,EAAG;AACpD,MAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,GAAA,EAAK;AAGrB,EAAA,OAAO,IAAA;AACT;;;AC5IO,SAAS,GAAA,CACd,GAAA,EACA,KAAA,EACA,IAAA,GAAmB,EAAC,EACT;AACX,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,IAAI,SAAA,GAAY,KAAA;AAEhB,EAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA,EAAG;AACnB,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,SAAA,EAAU;AAAA,EACvC;AACA,EAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,SAAA,EAAU;AAAA,EACvC;AAEA,EAAA,MAAM,QAA8C,CAAC,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AAC5E,EAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,EAAA,UAAA,CAAW,IAAI,KAAK,CAAA;AAEpB,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,GAAA,EAAI;AAChC,IAAA,OAAA,CAAQ,KAAK,EAAE,CAAA;AAEf,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AACzD,MAAA,SAAA,GAAY,IAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAE9B,IAAA,KAAA,IAAS,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AAC1C,MAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,SAAA,EAAU;AACvC;AAMO,SAAS,aAAa,GAAA,EAAgC;AAC3D,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,QAAwD,EAAC;AAE/D,EAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,CAAI,IAAA,EAAK,EAAG;AAC7B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAEvB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,EAAA,EAAI,IAAA;AAAA,MACJ,IAAA,EAAA,CAAO,IAAI,GAAA,CAAI,IAAI,KAAK,EAAC,EAAG,MAAA,CAAO,QAAQ,CAAA;AAAE,KAC9C,CAAA;AACD,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAEhB,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AAClC,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,IAAA,CAAK,IAAA,EAAK;AAC3B,MAAA,IAAI,KAAK,IAAA,EAAM;AACb,QAAA,OAAA,CAAQ,MAAA,CAAO,IAAI,EAAE,CAAA;AACrB,QAAA,KAAA,CAAM,GAAA,EAAI;AACV,QAAA;AAAA,MACF;AACA,MAAA,MAAM,MAAA,GAAS,KAAK,KAAA,CAAM,EAAA;AAC1B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AAEvB,QAAA,MAAM,KAAA,GAAkB,CAAC,MAAM,CAAA;AAC/B,QAAA,KAAA,IAAS,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AAC1C,UAAA,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,EAAE,CAAA;AACtB,UAAA,IAAI,KAAA,CAAM,CAAC,CAAA,CAAE,EAAA,KAAO,MAAA,EAAQ;AAAA,QAC9B;AACA,QAAA,KAAA,CAAM,OAAA,EAAQ;AAGd,QAAA,IAAI,IAAI,IAAI,KAAK,CAAA,CAAE,QAAQ,CAAA,EAAG,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,MACjD,CAAA,MAAA,IAAW,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AAC/B,QAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,QAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,QAAA,KAAA,CAAM,IAAA,CAAK;AAAA,UACT,EAAA,EAAI,MAAA;AAAA,UACJ,IAAA,EAAA,CAAO,IAAI,GAAA,CAAI,MAAM,KAAK,EAAC,EAAG,MAAA,CAAO,QAAQ,CAAA;AAAE,SAChD,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;ACnGO,SAAS,uBAAA,CACd,KACA,KAAA,EACsB;AACtB,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,aAAmC,EAAC;AAE1C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO,QAAA,CAAS,IAAI,CAAA,CAAE,EAAA,EAAI,EAAE,IAAI,CAAA;AAEhD,EAAA,KAAA,MAAW,MAAA,IAAU,GAAA,CAAI,IAAA,EAAK,EAAG;AAC/B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AACzB,IAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,EAAK,MAAM,CAAA;AACzB,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,MAAW,EAAA,IAAM,EAAE,OAAA,EAAS;AAC1B,MAAA,OAAA,CAAQ,IAAI,EAAE,CAAA;AACd,MAAA,IAAI,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA,KAAM,UAAU,SAAA,GAAY,IAAA;AAAA,IACjD;AACA,IAAA,UAAA,CAAW,IAAA,CAAK;AAAA,MACd,OAAO,CAAA,CAAE,OAAA;AAAA,MACT,IAAA,EAAM,EAAE,OAAA,CAAQ,MAAA;AAAA,MAChB;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,UAAA;AACT;AAQO,SAAS,UACd,GAAA,EACA,KAAA,EACA,GAAA,EACA,IAAA,GAAiD,EAAC,EACtC;AACZ,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,CAAA;AAClC,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,EAAA;AAElC,EAAA,MAAM,MAAkB,EAAC;AACzB,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAE/B,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,KAAgB;AAChC,IAAA,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU;AAC5B,IAAA,IAAI,QAAQ,GAAA,EAAK;AACf,MAAA,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,IAAI,CAAC,CAAA;AAClB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAA,CAAO,IAAI,GAAG,CAAA;AACd,IAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AACb,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,GAAG,KAAK,EAAC;AAC/B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACtB,MAAA,QAAA,CAAS,EAAE,EAAE,CAAA;AACb,MAAA,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU;AAAA,IAC9B;AACA,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,EACnB,CAAA;AAEA,EAAA,QAAA,CAAS,KAAK,CAAA;AACd,EAAA,OAAO,GAAA;AACT;AAWO,SAAS,gBAAA,CACd,GAAA,EACA,WAAA,EACA,OAAA,EACA,SAAA,EACqB;AACrB,EAAA,MAAM,IAAA,GAAO,QAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,WAAW,CAAA;AAC3D,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAElB,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAG5D,EAAA,MAAM,UAAU,IAAA,CAAK,QAAA;AACrB,EAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,OAAO,GAAG,OAAO,IAAA;AAGnC,EAAA,MAAM,SAAA,GAAY,CAAC,CAAA,EAAY,KAAA,EAAe,GAAA,KAAgB;AAC5D,IAAA,OAAO,EAAE,MAAA,KAAW,WAAA;AAAA,EACtB,CAAA;AAGA,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,EAAK,OAAA,EAAS;AAAA,IAC1B,SAAA;AAAA,IACA,KAAA,EAAO,CAAC,CAAA,KAAM;AACZ,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA;AAC3B,MAAA,OAAO,IAAA,GAAO,SAAA,CAAU,IAAI,CAAA,GAAI,KAAA;AAAA,IAClC,CAAA;AAAA,IACA,QAAA,EAAU;AAAA,GACX,CAAA;AAED,EAAA,IAAI,CAAC,CAAA,CAAE,GAAA,EAAK,OAAO,IAAA;AACnB,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,GAAG,CAAA,IAAK,IAAA;AAChC;AAOO,SAAS,qBAAA,CACd,KACA,KAAA,EACgD;AAChD,EAAA,MAAM,IAAI,GAAA,CAAI,GAAA,EAAK,OAAO,EAAE,QAAA,EAAU,IAAI,CAAA;AAC1C,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,CAAA,CAAE,OAAO,CAAA;AACjC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,KAAA,MAAW,CAAA,IAAK,EAAE,OAAA,EAAS;AACzB,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,CAAC,KAAK,EAAC;AAC7B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AAErB,MAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,CAAE,EAAE,GAAG,OAAA,CAAQ,GAAA,CAAI,EAAE,MAAM,CAAA;AAAA,IAC7C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ;AAC5B;;;ACvIO,SAAS,SACd,GAAA,EACA,KAAA,EACA,GAAA,EACA,IAAA,GAA4B,EAAC,EACT;AACpB,EAAA,IAAI,CAAC,IAAI,GAAA,CAAI,KAAK,KAAK,CAAC,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA,EAAG;AACpC,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,MAAM,EAAC,EAAG,OAAO,KAAA,EAAM;AAAA,EACtD;AAEA,EAAA,MAAM,SAAS,IAAA,CAAK,MAAA,KAAW,CAAC,CAAA,KAAe,EAAE,MAAA,IAAU,CAAA,CAAA;AAE3D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAuC,CAAC,EAAE,IAAI,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA;AAEjE,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,IAAA,EAAK,EAAG;AAC1B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAG,QAAQ,CAAA;AACpB,IAAA,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,CAAA;AAAA,EACrB;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,OAAO,CAAC,CAAA;AAEjB,EAAA,OAAO,EAAA,CAAG,SAAS,CAAA,EAAG;AAEpB,IAAA,EAAA,CAAG,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,CAAA,GAAI,EAAE,CAAC,CAAA;AAC3B,IAAA,MAAMA,IAAAA,GAAM,GAAG,KAAA,EAAM;AACrB,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAIA,IAAAA,CAAI,EAAE,CAAA,EAAG;AACzB,IAAA,OAAA,CAAQ,GAAA,CAAIA,KAAI,EAAE,CAAA;AAClB,IAAA,IAAIA,IAAAA,CAAI,OAAO,GAAA,EAAK;AAEpB,IAAA,MAAM,QAAQ,GAAA,CAAI,GAAA,CAAIA,IAAAA,CAAI,EAAE,KAAK,EAAC;AAClC,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACvB,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAIA,IAAAA,CAAI,EAAE,KAAK,QAAA,IAAY,CAAA;AAC7C,MAAA,IAAI,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,KAAK,QAAA,CAAA,EAAW;AACtC,QAAA,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,GAAG,CAAA;AAClB,QAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAIA,IAAAA,CAAI,EAAE,CAAA;AACxB,QAAA,EAAA,CAAG,KAAK,EAAE,EAAA,EAAI,EAAE,EAAA,EAAI,CAAA,EAAG,KAAK,CAAA;AAAA,MAC9B;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,IAAA,CAAK,KAAA,CAAMA,KAAI,EAAA,EAAIA,IAAAA,CAAI,CAAC,CAAA,EAAG;AAAA,EAC/C;AAEA,EAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,cAAc,QAAA,EAAU;AAC5C,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,MAAM,EAAC,EAAG,OAAO,KAAA,EAAM;AAAA,EACtD;AAGA,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,IAAI,GAAA,GAAqB,GAAA;AACzB,EAAA,OAAO,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACzB,IAAA,IAAI,MAAM,MAAA,EAAW;AACrB,IAAA,GAAA,GAAM,CAAA;AAAA,EACR;AAEA,EAAA,OAAO,EAAE,UAAU,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,IAAA,EAAK;AAC3D","file":"index.cjs","sourcesContent":["/**\n * 图邻接表构建（管线拓扑 → 双向邻接表）\n *\n * 输入：管网拓扑数据集（节点 + 管段）\n * 输出：邻接表 Map<nodeId, Edge[]>\n *\n * Phase 1 图遍历的入口：把物理拓扑转换为图论可用的数据结构。\n */\n\nimport type {\n  PipelineNode,\n  PipelinePipe,\n  PipelineTopologyDataset,\n} from '../types';\n\n/**\n * 邻接表中的\"边\"\n *  - 物理上一条 pipe 是两个 node 之间的连接\n *  - 邻接表中记录：pipeId、邻居节点 id、长度等\n */\nexport interface AdjEdge {\n  pipeId: string;\n  /** 邻居节点 id（沿此边走一步到达） */\n  to: string;\n  /** 长度（m），无则 0 */\n  length: number;\n  /** 阻力/权重（用于复杂路径优选，可选） */\n  weight?: number;\n}\n\n/** 邻接表：Map<nodeId, AdjEdge[]> */\nexport type AdjacencyList = Map<string, AdjEdge[]>;\n\n/**\n * 从 PipelineTopologyDataset 构建邻接表\n */\nexport function buildAdjacency(dataset: PipelineTopologyDataset): AdjacencyList {\n  const adj: AdjacencyList = new Map();\n\n  // 初始化所有节点（防止孤立点不出现）\n  for (const node of dataset.nodes) {\n    if (!adj.has(node.id)) adj.set(node.id, []);\n  }\n\n  for (const pipe of dataset.pipes) {\n    const len = pipe.length ?? pipeLengthFromGeometry(pipe, dataset.nodes) ?? 0;\n\n    const fromList = adj.get(pipe.fromNode) ?? [];\n    fromList.push({\n      pipeId: pipe.id,\n      to: pipe.toNode,\n      length: len,\n    });\n    adj.set(pipe.fromNode, fromList);\n\n    const toList = adj.get(pipe.toNode) ?? [];\n    toList.push({\n      pipeId: pipe.id,\n      to: pipe.fromNode,\n      length: len,\n    });\n    adj.set(pipe.toNode, toList);\n  }\n\n  return adj;\n}\n\n/**\n * 计算单条 pipe 长度（haversine）\n * 若 pipe 提供 geometry 则累计几何点距离，否则按 from-to 直线长度。\n */\nexport function pipeLengthFromGeometry(\n  pipe: PipelinePipe,\n  nodes: PipelineNode[]\n): number {\n  if (pipe.length && pipe.length > 0) return pipe.length;\n  if (pipe.geometry && pipe.geometry.length >= 2) {\n    let total = 0;\n    for (let i = 1; i < pipe.geometry.length; i++) {\n      total += haversine(\n        pipe.geometry[i - 1][0],\n        pipe.geometry[i - 1][1],\n        pipe.geometry[i][0],\n        pipe.geometry[i][1]\n      );\n    }\n    return total;\n  }\n  const from = nodes.find((n) => n.id === pipe.fromNode);\n  const to = nodes.find((n) => n.id === pipe.toNode);\n  if (!from || !to) return 0;\n  return haversine(from.lng, from.lat, to.lng, to.lat);\n}\n\n/** Haversine 距离（m） */\nexport function haversine(\n  lng1: number,\n  lat1: number,\n  lng2: number,\n  lat2: number\n): number {\n  const R = 6_371_000;\n  const toRad = (d: number) => (d * Math.PI) / 180;\n  const dLat = toRad(lat2 - lat1);\n  const dLng = toRad(lng2 - lng1);\n  const a =\n    Math.sin(dLat / 2) ** 2 +\n    Math.cos(toRad(lat1)) *\n      Math.cos(toRad(lat2)) *\n      Math.sin(dLng / 2) ** 2;\n  return 2 * R * Math.asin(Math.sqrt(a));\n}\n\n/** 从邻接表拿指定节点的邻居 id 列表（去重） */\nexport function neighborIds(adj: AdjacencyList, nodeId: string): string[] {\n  const list = adj.get(nodeId) ?? [];\n  const seen = new Set<string>();\n  const out: string[] = [];\n  for (const e of list) {\n    if (!seen.has(e.to)) {\n      seen.add(e.to);\n      out.push(e.to);\n    }\n  }\n  return out;\n}\n\n/** 取出指定节点的所有边 */\nexport function edgesOf(adj: AdjacencyList, nodeId: string): AdjEdge[] {\n  return adj.get(nodeId) ?? [];\n}\n","/**\n * BFS（广度优先遍历）\n *\n * 用途：\n * - 爆管推演：下游影响范围（沿拓扑扩散）\n * - 连通性查询：在指定层级内查找可达节点\n *\n * 实现要点：\n * - 支持 visited / parents 记录\n * - 支持 maxDepth 限制（避免极大连通分量过长）\n * - 支持 predicate 过滤可继续遍历的邻居\n * - 可返回\"沿途经过的管段\"列表（用于前端高亮）\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface BfsResult {\n  /** 访问过的节点（不重复） */\n  visited: string[];\n  /** 父节点表：node -> 上一步到达的 node（首节点为自身） */\n  parents: Map<string, string | null>;\n  /** 起点 节点 */\n  start: string;\n  /** 终点节点（搜到即停，返回时 visited 是到终点为止的节点） */\n  end?: string;\n}\n\nexport interface BfsOptions {\n  /** 最大深度（边数），默认无限制 */\n  maxDepth?: number;\n  /** 是否指定终点（BFS 找到则停止） */\n  until?: (node: string) => boolean;\n  /** 在扩展邻居前过滤：false 则该方向不继续遍历 */\n  allowEdge?: (edge: AdjEdge, from: string, to: string) => boolean;\n  /** 起点本身的过滤器（如只走下游/上游） */\n  allowStart?: (node: string) => boolean;\n}\n\n/**\n * 标准 BFS，可指定\"任意邻居是否可达\"\n *\n * 用法：\n *   const r = bfs(adj, 'node-A');\n *   bfs(adj, 'start', { until: (n) => n === 'target' }); // 找终点\n *   bfs(adj, 'start', { allowEdge: (_, __, to) => to !== 'forbidden' });\n */\nexport function bfs(\n  adj: AdjacencyList,\n  start: string,\n  opts: BfsOptions = {}\n): BfsResult {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const visitedSet = new Set<string>();\n\n  if (!adj.has(start)) {\n    parents.set(start, null);\n    return { visited, parents, start };\n  }\n\n  if (opts.allowStart && !opts.allowStart(start)) {\n    return { visited: [], parents, start };\n  }\n\n  const queue: Array<{ id: string; depth: number }> = [{ id: start, depth: 0 }];\n  parents.set(start, null);\n  visitedSet.add(start);\n  visited.push(start);\n\n  let foundEnd: string | undefined;\n  while (queue.length > 0) {\n    const { id, depth } = queue.shift()!;\n\n    if (opts.until && opts.until(id)) {\n      foundEnd = id;\n      break;\n    }\n\n    // maxDepth 语义：最多走 N 条边，到达节点的最短路径长度为 N\n    // 当前节点 depth=d = 经过 d 条边到达，扩展邻居须 depth+1 <= maxDepth\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) continue;\n\n    const edges = adj.get(id) ?? [];\n    for (const e of edges) {\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      visited.push(e.to);\n      queue.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, start, end: foundEnd };\n}\n\n/**\n * 多源 BFS（同时从多个起点扩散）\n *\n * 用法：爆管分析的下游影响可从多点同时推演（如多个隔离阀门的下游剩余服务区）\n */\nexport function multiSourceBfs(\n  adj: AdjacencyList,\n  starts: string[],\n  opts: BfsOptions = {}\n): BfsResult & { sourceMap: Map<string, string> } {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const sourceMap = new Map<string, string>();\n  const visitedSet = new Set<string>();\n\n  const queue: Array<{ id: string; depth: number }> = [];\n\n  for (const s of starts) {\n    if (!adj.has(s)) continue;\n    if (opts.allowStart && !opts.allowStart(s)) continue;\n    if (!visitedSet.has(s)) {\n      visitedSet.add(s);\n      parents.set(s, null);\n      sourceMap.set(s, s);\n      visited.push(s);\n      queue.push({ id: s, depth: 0 });\n    }\n  }\n\n  while (queue.length > 0) {\n    const { id, depth } = queue.shift()!;\n    // 同单源 BFS：depth=d 时扩展邻居；maxDepth=N 表示最多 N 条边\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) continue;\n\n    const edges = adj.get(id) ?? [];\n    for (const e of edges) {\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      sourceMap.set(e.to, sourceMap.get(id)!);\n      visited.push(e.to);\n      queue.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, start: starts[0] ?? '', sourceMap };\n}\n\n/**\n * 反向 BFS（沿父指针回溯）\n *\n * 给定终点 + parents Map，可还原 BFS 路径（用于\"找到的最短路径\"）。\n */\nexport function reconstructPath(\n  parents: Map<string, string | null>,\n  end: string\n): string[] {\n  const path: string[] = [];\n  let cur: string | null = end;\n  while (cur) {\n    path.unshift(cur);\n    const p = parents.get(cur);\n    cur = p ?? null;\n    if (cur === null && p === null) {\n      // 起点到达\n      if (parents.get(end) === null && path.length === 1) break;\n      break;\n    }\n  }\n  if (path[0] !== end) {\n    // already include end correctly\n  }\n  return path;\n}\n","/**\n * DFS（深度优先遍历）\n *\n * 用途：\n * - 管线编辑后构建新的连通分量\n * - 环检测（爆管推演风险评估）\n * - 上游路径追踪\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface DfsOptions {\n  /** 最大深度，默认无限制 */\n  maxDepth?: number;\n  /** 邻居过滤（在遍历孩子前判断） */\n  allowEdge?: (edge: AdjEdge, from: string, to: string) => boolean;\n  /** 起点过滤器 */\n  allowStart?: (node: string) => boolean;\n}\n\nexport interface DfsResult {\n  visited: string[];\n  parents: Map<string, string | null>;\n  /** 是否触发了 maxDepth 截断（true=未完全遍历） */\n  truncated: boolean;\n}\n\n/**\n * 深度优先遍历\n */\nexport function dfs(\n  adj: AdjacencyList,\n  start: string,\n  opts: DfsOptions = {}\n): DfsResult {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const visitedSet = new Set<string>();\n  let truncated = false;\n\n  if (!adj.has(start)) {\n    return { visited, parents, truncated };\n  }\n  if (opts.allowStart && !opts.allowStart(start)) {\n    return { visited, parents, truncated };\n  }\n\n  const stack: Array<{ id: string; depth: number }> = [{ id: start, depth: 0 }];\n  parents.set(start, null);\n  visitedSet.add(start);\n\n  while (stack.length > 0) {\n    const { id, depth } = stack.pop()!;\n    visited.push(id);\n\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) {\n      truncated = true;\n      continue;\n    }\n\n    const edges = adj.get(id) ?? [];\n    // 倒序遍历以保持\"原本右子树先访问\"的 DFS 直观\n    for (let i = edges.length - 1; i >= 0; i--) {\n      const e = edges[i];\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      stack.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, truncated };\n}\n\n/**\n * 检测有向图中的所有环（基于 Tarjan 算法的简化版本）。\n * 返回包含环的所有节点集合（连通分量内存在环时整分量被标记）。\n */\nexport function detectCycles(adj: AdjacencyList): string[][] {\n  const cycles: string[][] = [];\n  const visited = new Set<string>();\n  const onStack = new Set<string>();\n  const stack: Array<{ id: string; iter: Iterator<AdjEdge> }> = [];\n\n  for (const node of adj.keys()) {\n    if (visited.has(node)) continue;\n    const localCycle: string[] = [];\n    stack.push({\n      id: node,\n      iter: (adj.get(node) ?? [])[Symbol.iterator](),\n    });\n    onStack.add(node);\n    visited.add(node);\n\n    while (stack.length > 0) {\n      const top = stack[stack.length - 1];\n      const next = top.iter.next();\n      if (next.done) {\n        onStack.delete(top.id);\n        stack.pop();\n        continue;\n      }\n      const nextId = next.value.to;\n      if (onStack.has(nextId)) {\n        // 找到环：提取 onStack 中从 nextId 到 top.id 的所有节点\n        const cycle: string[] = [nextId];\n        for (let i = stack.length - 1; i >= 0; i--) {\n          cycle.push(stack[i].id);\n          if (stack[i].id === nextId) break;\n        }\n        cycle.reverse();\n        // 双向建表会把 s->v1->s 视为 2 节点\"环\"（实质是同一物理边的双向表示），\n        // 只保留 ≥3 个不同节点的\"真环\"\n        if (new Set(cycle).size >= 3) cycles.push(cycle);\n      } else if (!visited.has(nextId)) {\n        visited.add(nextId);\n        onStack.add(nextId);\n        stack.push({\n          id: nextId,\n          iter: (adj.get(nextId) ?? [])[Symbol.iterator](),\n        });\n      }\n    }\n  }\n\n  return cycles;\n}\n","/**\n * 连通性分析\n *\n * 用途：\n * - P-4 连通性高亮：选中管线后高亮上下游连通路径\n * - 健康评估的影响范围计算\n * - 用户问\"阀门X关闭后影响哪些小区？\"\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\nimport { bfs } from './bfs';\nimport type { PipelineNode, PipelineTopologyDataset, NodeKind } from '../types';\n\n/**\n * 连通分量（连通子图）\n */\nexport interface ConnectedComponent {\n  /** 节点集合 */\n  nodes: string[];\n  /** 节点数 */\n  size: number;\n  /** 是否包含 source 类型节点（影响气源/水源判定） */\n  hasSource: boolean;\n}\n\n/**\n * 求所有连通分量\n */\nexport function findConnectedComponents(\n  adj: AdjacencyList,\n  nodes: PipelineNode[]\n): ConnectedComponent[] {\n  const visited = new Set<string>();\n  const components: ConnectedComponent[] = [];\n\n  const kindById = new Map<string, NodeKind>();\n  for (const n of nodes) kindById.set(n.id, n.kind);\n\n  for (const nodeId of adj.keys()) {\n    if (visited.has(nodeId)) continue;\n    const r = bfs(adj, nodeId);\n    let hasSource = false;\n    for (const id of r.visited) {\n      visited.add(id);\n      if (kindById.get(id) === 'source') hasSource = true;\n    }\n    components.push({\n      nodes: r.visited,\n      size: r.visited.length,\n      hasSource,\n    });\n  }\n\n  return components;\n}\n\n/**\n * 找到两个节点之间的所有路径（k 短路）\n *\n * 用途：阀门隔离方案中\"备选路径\"分析\n * NOTE：DFS+Yen's 算法简化版，路径数 < 10 适用。\n */\nexport function findPaths(\n  adj: AdjacencyList,\n  start: string,\n  end: string,\n  opts: { maxPaths?: number; maxDepth?: number } = {}\n): string[][] {\n  const maxPaths = opts.maxPaths ?? 3;\n  const maxDepth = opts.maxDepth ?? 20;\n\n  const all: string[][] = [];\n  const path: string[] = [];\n  const onPath = new Set<string>();\n\n  const dfsLocal = (cur: string) => {\n    if (all.length >= maxPaths) return;\n    if (cur === end) {\n      all.push([...path]);\n      return;\n    }\n    if (path.length >= maxDepth) return;\n    onPath.add(cur);\n    path.push(cur);\n    const edges = adj.get(cur) ?? [];\n    for (const e of edges) {\n      if (onPath.has(e.to)) continue;\n      dfsLocal(e.to);\n      if (all.length >= maxPaths) return;\n    }\n    path.pop();\n    onPath.delete(cur);\n  };\n\n  dfsLocal(start);\n  return all;\n}\n\n/**\n * 沿拓扑向上游找到最近的指定类型节点（默认阀门）\n *\n * 用途：爆管推演自动定位隔离点（PRD §4.2.4 step 1）\n *\n * 说明：管网拓扑在无流向数据时是无向图。本实现从故障管段起点向上游\n * 广度搜索，并避免沿\"刚走过的同一管段\"原路返回，从而向远离故障点的\n * 上游方向收敛，命中 predicate（如阀门）即停。\n */\nexport function findUpstreamNode(\n  adj: AdjacencyList,\n  startPipeId: string,\n  dataset: PipelineTopologyDataset,\n  predicate: (n: PipelineNode) => boolean\n): PipelineNode | null {\n  const pipe = dataset.pipes.find((p) => p.id === startPipeId);\n  if (!pipe) return null;\n\n  const nodeById = new Map(dataset.nodes.map((n) => [n.id, n]));\n\n  // 起始：选择 fromNode 作为查找起点（故障管段上游侧）\n  const startId = pipe.fromNode;\n  if (!nodeById.has(startId)) return null;\n\n  // 向上游游走：禁止沿\"刚走过的同一管段\"原路返回，避免来回打转\n  const allowEdge = (e: AdjEdge, _from: string, _to: string) => {\n    return e.pipeId !== startPipeId;\n  };\n\n  // BFS 到上游直到命中 predicate\n  const r = bfs(adj, startId, {\n    allowEdge,\n    until: (n) => {\n      const node = nodeById.get(n);\n      return node ? predicate(node) : false;\n    },\n    maxDepth: 50,\n  });\n\n  if (!r.end) return null;\n  return nodeById.get(r.end) ?? null;\n}\n\n/**\n * 高亮连通路径（从起点 BFS，把沿途所有 pipe 收集起来）\n *\n * 用途：选中管段/节点 → 高亮上下游\n */\nexport function highlightConnectivity(\n  adj: AdjacencyList,\n  start: string\n): { nodeIds: Set<string>; edgeIds: Set<string> } {\n  const r = bfs(adj, start, { maxDepth: 64 });\n  const nodeIds = new Set(r.visited);\n  const edgeIds = new Set<string>();\n\n  for (const n of r.visited) {\n    const edges = adj.get(n) ?? [];\n    for (const e of edges) {\n      // 只高亮两端都已访问的边\n      if (nodeIds.has(e.to)) edgeIds.add(e.pipeId);\n    }\n  }\n\n  return { nodeIds, edgeIds };\n}\n","/**\n * 最短路径（Dijkstra）\n *\n * 用途：\n * - 上游距离最近的阀门定位\n * - 备选供气/供水路径（按管径/压力选优）\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface ShortestPathResult {\n  distance: number;\n  path: string[];\n  found: boolean;\n}\n\nexport interface ShortestPathOptions {\n  /** 边权重函数：默认 1 */\n  weight?: (edge: AdjEdge) => number;\n  /** 提前终止：找到满足条件的节点立即返回 */\n  until?: (node: string, dist: number) => boolean;\n}\n\n/**\n * Dijkstra 最短路径\n *\n * 注意：当存在负权边时不可用；管网场景边权重非负，管长/管径均适用。\n */\nexport function dijkstra(\n  adj: AdjacencyList,\n  start: string,\n  end: string,\n  opts: ShortestPathOptions = {}\n): ShortestPathResult {\n  if (!adj.has(start) || !adj.has(end)) {\n    return { distance: Infinity, path: [], found: false };\n  }\n\n  const weight = opts.weight ?? ((e: AdjEdge) => e.length || 1);\n\n  const dist = new Map<string, number>();\n  const parents = new Map<string, string | null>();\n  const visited = new Set<string>();\n  const pq: Array<{ id: string; d: number }> = [{ id: start, d: 0 }];\n\n  for (const n of adj.keys()) {\n    dist.set(n, Infinity);\n    parents.set(n, null);\n  }\n  dist.set(start, 0);\n\n  while (pq.length > 0) {\n    // 简化：线性查找最小值（小图足够；大规模可换二叉堆）\n    pq.sort((a, b) => a.d - b.d);\n    const cur = pq.shift()!;\n    if (visited.has(cur.id)) continue;\n    visited.add(cur.id);\n    if (cur.id === end) break;\n\n    const edges = adj.get(cur.id) ?? [];\n    for (const e of edges) {\n      if (visited.has(e.to)) continue;\n      const w = weight(e);\n      const alt = (dist.get(cur.id) ?? Infinity) + w;\n      if (alt < (dist.get(e.to) ?? Infinity)) {\n        dist.set(e.to, alt);\n        parents.set(e.to, cur.id);\n        pq.push({ id: e.to, d: alt });\n      }\n    }\n\n    if (opts.until && opts.until(cur.id, cur.d)) break;\n  }\n\n  if ((dist.get(end) ?? Infinity) === Infinity) {\n    return { distance: Infinity, path: [], found: false };\n  }\n\n  // 回溯路径\n  const path: string[] = [];\n  let cur: string | null = end;\n  while (cur) {\n    path.unshift(cur);\n    const p = parents.get(cur);\n    if (p === undefined) break;\n    cur = p;\n  }\n\n  return { distance: dist.get(end) ?? 0, path, found: true };\n}\n"]}

package/dist/graph/index.d.cts

@@ -170,6 +170,10 @@ declare function findPaths(adj: AdjacencyList, start: string, end: string, opts?
  * 沿拓扑向上游找到最近的指定类型节点（默认阀门）
  *
  * 用途：爆管推演自动定位隔离点（PRD §4.2.4 step 1）
+ *
+ * 说明：管网拓扑在无流向数据时是无向图。本实现从故障管段起点向上游
+ * 广度搜索，并避免沿"刚走过的同一管段"原路返回，从而向远离故障点的
+ * 上游方向收敛，命中 predicate（如阀门）即停。
  */
 declare function findUpstreamNode(adj: AdjacencyList, startPipeId: string, dataset: PipelineTopologyDataset, predicate: (n: PipelineNode) => boolean): PipelineNode | null;
 /**

package/dist/graph/index.d.ts

@@ -170,6 +170,10 @@ declare function findPaths(adj: AdjacencyList, start: string, end: string, opts?
  * 沿拓扑向上游找到最近的指定类型节点（默认阀门）
  *
  * 用途：爆管推演自动定位隔离点（PRD §4.2.4 step 1）
+ *
+ * 说明：管网拓扑在无流向数据时是无向图。本实现从故障管段起点向上游
+ * 广度搜索，并避免沿"刚走过的同一管段"原路返回，从而向远离故障点的
+ * 上游方向收敛，命中 predicate（如阀门）即停。
  */
 declare function findUpstreamNode(adj: AdjacencyList, startPipeId: string, dataset: PipelineTopologyDataset, predicate: (n: PipelineNode) => boolean): PipelineNode | null;
 /**

package/dist/graph/index.js

@@ -1,4 +1,4 @@
 export { detectCycles, dfs } from '../chunk-CDEYJ67B.js';
-export { bfs, buildAdjacency, dijkstra, edgesOf, findConnectedComponents, findPaths, findUpstreamNode, haversine, highlightConnectivity, multiSourceBfs, neighborIds, pipeLengthFromGeometry, reconstructPath } from '../chunk-GCDA7KJM.js';
+export { bfs, buildAdjacency, dijkstra, edgesOf, findConnectedComponents, findPaths, findUpstreamNode, haversine, highlightConnectivity, multiSourceBfs, neighborIds, pipeLengthFromGeometry, reconstructPath } from '../chunk-XCP7XVNO.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/health/index.cjs

@@ -219,10 +219,10 @@ var PipelineHealth = class {
       const input = {
         installDate: p.properties?.installDate,
         material: p.properties?.material,
-        failureCount: void 0,
+        failureCount: p.properties?.failureCount ?? 0,
         pressure: p.properties?.pressure,
         ratedPressure: p.properties?.ratedPressure,
-        hasCathodicProtection: void 0,
+        hasCathodicProtection: p.properties?.hasCathodicProtection ?? false,
         status: p.properties?.status
       };
       return { pipeId: p.id, score: scorePipeHealth(input, weights) };

package/dist/health/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/health/healthScorer.ts","../../src/health/riskHeatmap.ts","../../src/health/PipelineHealth.ts"],"names":[],"mappings":";;;AAiDO,IAAM,eAAA,GAAkB;AAAA,EAC7B,GAAA,EAAK,IAAA;AAAA,EACL,QAAA,EAAU,GAAA;AAAA,EACV,IAAA,EAAM,IAAA;AAAA,EACN,OAAA,EAAS,GAAA;AAAA,EACT,QAAA,EAAU,GAAA;AAAA,EACV,UAAA,EAAY;AACd;AAEA,IAAM,aAAA,GAA8C;AAAA,EAClD,SAAA,EAAW,IAAA;AAAA;AAAA,EACX,YAAA,EAAc,GAAA;AAAA;AAAA,EACd,KAAA,EAAO,GAAA;AAAA,EACP,EAAA,EAAI,GAAA;AAAA,EACJ,GAAA,EAAK,IAAA;AAAA,EACL,QAAA,EAAU,GAAA;AAAA,EACV,IAAA,EAAM,IAAA;AAAA,EACN,MAAA,EAAQ,GAAA;AAAA,EACR,OAAA,EAAS;AACX,CAAA;AAKO,SAAS,eAAA,CAAgB,KAAA,EAAwB,OAAA,GAAU,eAAA,EAAkC;AAClG,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,GAAA,EAAK,QAAA,CAAS,KAAA,EAAO,OAAA,CAAQ,GAAG,CAAA;AAAA,IAChC,QAAA,EAAU,aAAA,CAAc,KAAA,EAAO,OAAA,CAAQ,QAAQ,CAAA;AAAA,IAC/C,IAAA,EAAM,SAAA,CAAU,KAAA,EAAO,OAAA,CAAQ,IAAI,CAAA;AAAA,IACnC,OAAA,EAAS,YAAA,CAAa,KAAA,EAAO,OAAA,CAAQ,OAAO,CAAA;AAAA,IAC5C,QAAA,EAAU,aAAA,CAAc,KAAA,EAAO,OAAA,CAAQ,QAAQ,CAAA;AAAA,IAC/C,UAAA,EAAY,eAAA,CAAgB,KAAA,EAAO,OAAA,CAAQ,UAAU;AAAA,GACvD;AAEA,EAAA,MAAM,KAAA,GACJ,IAAA,CAAK,GAAA,CAAI,KAAA,GAAQ,KAAK,GAAA,CAAI,MAAA,GAC1B,IAAA,CAAK,QAAA,CAAS,QAAQ,IAAA,CAAK,QAAA,CAAS,MAAA,GACpC,IAAA,CAAK,KAAK,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,MAAA,GAC5B,KAAK,OAAA,CAAQ,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,SAClC,IAAA,CAAK,QAAA,CAAS,KAAA,GAAQ,IAAA,CAAK,SAAS,MAAA,GACpC,IAAA,CAAK,UAAA,CAAW,KAAA,GAAQ,KAAK,UAAA,CAAW,MAAA;AAG1C,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,SAAA,EAAW,KAAA,IAAS,GAAA;AAAA,OAAA,IAChC,KAAA,CAAM,MAAA,KAAW,cAAA,EAAgB,KAAA,IAAS,GAAA;AAAA,OAAA,IAC1C,KAAA,CAAM,MAAA,KAAW,WAAA,EAAa,KAAA,GAAQ,CAAA;AAE/C,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAAA,IACvB,KAAA,EAAO,QAAQ,KAAK,CAAA;AAAA,IACpB,UAAA,EAAY;AAAA,GACd;AACF;AAEA,SAAS,QAAQ,KAAA,EAAyC;AACxD,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,WAAA;AACxB,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,MAAA;AACxB,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,MAAA;AACxB,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,MAAA;AACxB,EAAA,OAAO,UAAA;AACT;AAEA,SAAS,QAAA,CAAS,OAAwB,MAAA,EAAsD;AAC9F,EAAA,IAAI,CAAC,MAAM,WAAA,EAAa;AACtB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,oEAAA,EAAc;AAAA,EACpD;AACA,EAAA,MAAM,QAAA,GAAA,CAAY,IAAA,CAAK,GAAA,EAAI,GAAI,IAAI,IAAA,CAAK,KAAA,CAAM,WAAW,CAAA,CAAE,OAAA,EAAQ,KAAM,MAAA,GAAS,KAAK,IAAA,GAAO,GAAA,CAAA;AAC9F,EAAA,IAAI,QAAA,GAAW,GAAG,OAAO,EAAE,OAAO,GAAA,EAAK,MAAA,EAAQ,QAAQ,wDAAA,EAAY;AACnE,EAAA,IAAI,QAAA,GAAW,GAAG,OAAO,EAAE,OAAO,GAAA,EAAK,MAAA,EAAQ,QAAQ,qCAAA,EAAa;AACpE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,2BAAA,EAAa;AACpE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,4BAAA,EAAc;AACrE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,4BAAA,EAAc;AACrE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,0BAAA,EAAY;AACnE,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,QAAQ,0BAAA,EAAY;AACjD;AAEA,SAAS,aAAA,CAAc,OAAwB,MAAA,EAA2D;AACxG,EAAA,IAAI,CAAC,MAAM,QAAA,EAAU;AACnB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,wDAAA,EAAY;AAAA,EAClD;AACA,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,QAAQ,CAAA,IAAK,GAAA;AAC9C,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAA,CAAO,CAAA,GAAI,QAAQ,GAAG,CAAA;AACzC,EAAA,MAAM,MAAA,GAAiC;AAAA,IACrC,SAAA,EAAW,4CAAA;AAAA,IACX,YAAA,EAAc,0BAAA;AAAA,IACd,KAAA,EAAO,QAAA;AAAA,IACP,EAAA,EAAI,kCAAA;AAAA,IACJ,GAAA,EAAK,KAAA;AAAA,IACL,QAAA,EAAU,oBAAA;AAAA,IACV,IAAA,EAAM,8BAAA;AAAA,IACN,MAAA,EAAQ,QAAA;AAAA,IACR,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA,EAAQ,MAAA,CAAO,KAAA,CAAM,QAAQ,KAAK,KAAA,CAAM;AAAA,GAC1C;AACF;AAEA,SAAS,SAAA,CAAU,OAAwB,MAAA,EAAuD;AAChG,EAAA,MAAM,CAAA,GAAI,MAAM,aAAA,IAAiB,GAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAA,CAAO,CAAA,GAAI,KAAK,GAAG,CAAA;AACtC,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA,EAAQ,CAAA,KAAM,GAAA,IAAO,CAAC,KAAA,CAAM,aAAA,GAAgB,8DAAA,GAAe,CAAA,qCAAA,EAAU,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,CAAA;AAAA,GACnF;AACF;AAEA,SAAS,YAAA,CAAa,OAAwB,MAAA,EAA0D;AACtG,EAAA,MAAM,IAAA,GAAO,MAAM,YAAA,IAAgB,CAAA;AACnC,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,GAAA,EAAK,MAAA,EAAQ,QAAQ,gCAAA,EAAQ;AAC7D,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,mCAAA,EAAW;AAC/D,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,mCAAA,EAAW;AAC/D,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,mCAAA,EAAW;AAC/D,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,QAAQ,MAAA,EAAQ,CAAA,mBAAA,EAAO,IAAI,CAAA,mBAAA,CAAA,EAAO;AACvD;AAEA,SAAS,aAAA,CAAc,OAAwB,MAAA,EAA2D;AACxG,EAAA,IAAI,CAAC,MAAM,QAAA,EAAU;AACnB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,0EAAA,EAAe;AAAA,EACrD;AACA,EAAA,IAAI,CAAC,MAAM,aAAA,EAAe;AACxB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,sCAAA,EAAS;AAAA,EAC/C;AACA,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,QAAA,GAAW,KAAA,CAAM,aAAA;AACrC,EAAA,IAAI,KAAA,GAAQ,KAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,oDAAA,EAAkB;AACvE,EAAA,IAAI,KAAA,GAAQ,KAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,sDAAA,EAAoB;AACzE,EAAA,IAAI,KAAA,GAAQ,GAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,uDAAA,EAAqB;AAC1E,EAAA,IAAI,KAAA,GAAQ,KAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,qCAAA,EAAkB;AACvE,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,QAAQ,8CAAA,EAAiB;AACtD;AAEA,SAAS,eAAA,CAAgB,OAAwB,MAAA,EAA6D;AAC5G,EAAA,IAAI,KAAA,CAAM,0BAA0B,IAAA,EAAM;AACxC,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,gCAAA,EAAQ;AAAA,EAC9C;AACA,EAAA,IAAI,KAAA,CAAM,0BAA0B,KAAA,EAAO;AACzC,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,gCAAA,EAAQ;AAAA,EAC9C;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,sCAAA,EAAS;AAC/C;AAKO,SAAS,UAAA,CAAW,MAAA,EAA2B,OAAA,GAAU,eAAA,EAAoC;AAClG,EAAA,OAAO,OAAO,GAAA,CAAI,CAAC,MAAM,eAAA,CAAgB,CAAA,EAAG,OAAO,CAAC,CAAA;AACtD;;;ACxKO,SAAS,gBAAA,CACd,MAAA,EACA,OAAA,GAA8B,EAAC,EAChB;AACf,EAAA,MAAM,IAAA,GAAO,QAAQ,QAAA,IAAY,GAAA;AACjC,EAAA,MAAM,GAAA,GAAM,QAAQ,WAAA,IAAe,SAAA;AAGnC,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEjC,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,CAAC,CAAA,CAAE,GAAA;AACzB,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,CAAC,CAAA,CAAE,GAAA;AACzB,EAAA,MAAM,UAAA,GAAa,MAAA;AACnB,EAAA,MAAM,aAAa,MAAA,GAAU,IAAA,CAAK,IAAK,MAAA,GAAS,IAAA,CAAK,KAAM,GAAG,CAAA;AAE9D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAkG;AACnH,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,MAAM,CAAA,GAAA,CAAK,CAAA,CAAE,GAAA,GAAM,MAAA,IAAU,UAAA;AAC7B,IAAA,MAAM,CAAA,GAAA,CAAK,CAAA,CAAE,GAAA,GAAM,MAAA,IAAU,UAAA;AAC7B,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,IAAI,CAAA;AAC9B,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,IAAI,CAAA;AAC9B,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,EAAE,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA;AACvB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA;AACxB,IAAA,IAAI,CAAC,GAAA,EAAK;AACR,MAAA,IAAA,CAAK,IAAI,GAAA,EAAK;AAAA,QACZ,KAAK,CAAA,CAAE,WAAA;AAAA,QACP,KAAA,EAAO,CAAA;AAAA,QACP,MAAM,CAAA,CAAE,WAAA;AAAA,QACR,MAAM,CAAA,CAAE,WAAA;AAAA,QACR,KAAK,CAAA,CAAE,GAAA;AAAA,QACP,KAAK,CAAA,CAAE;AAAA,OACR,CAAA;AAAA,IACH,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,OAAO,CAAA,CAAE,WAAA;AACb,MAAA,GAAA,CAAI,KAAA,IAAS,CAAA;AACb,MAAA,IAAI,EAAE,WAAA,GAAc,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,OAAO,CAAA,CAAE,WAAA;AAC3C,MAAA,IAAI,EAAE,WAAA,GAAc,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,OAAO,CAAA,CAAE,WAAA;AAC3C,MAAA,GAAA,CAAI,GAAA,GAAA,CAAO,IAAI,GAAA,IAAO,GAAA,CAAI,QAAQ,CAAA,CAAA,GAAK,CAAA,CAAE,OAAO,GAAA,CAAI,KAAA;AACpD,MAAA,GAAA,CAAI,GAAA,GAAA,CAAO,IAAI,GAAA,IAAO,GAAA,CAAI,QAAQ,CAAA,CAAA,GAAK,CAAA,CAAE,OAAO,GAAA,CAAI,KAAA;AAAA,IACtD;AAAA,EACF;AAEA,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,MAAA,EAAO,EAAG;AAC7B,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI,GAAA,KAAQ,KAAA,EAAO,KAAA,GAAQ,CAAA,CAAE,IAAA;AAAA,SAAA,IACpB,GAAA,KAAQ,KAAA,EAAO,KAAA,GAAQ,CAAA,CAAE,IAAA;AAAA,SAC7B,KAAA,GAAQ,CAAA,CAAE,GAAA,GAAM,CAAA,CAAE,KAAA;AACvB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,KAAK,CAAA,CAAE,GAAA;AAAA,MACP,KAAK,CAAA,CAAE,GAAA;AAAA,MACP,WAAA,EAAa,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAAA,MAC7B,WAAW,CAAA,CAAE;AAAA,KACd,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,iBAAiB,KAAA,EAAgE;AAC/F,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,mBAAA;AAAA,IACN,QAAA,EAAU,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MAC1B,IAAA,EAAM,SAAA;AAAA,MACN,QAAA,EAAU,EAAE,IAAA,EAAM,OAAA,EAAS,WAAA,EAAa,CAAC,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,GAAG,CAAA,EAAE;AAAA,MACvD,UAAA,EAAY;AAAA,QACV,aAAa,CAAA,CAAE,WAAA;AAAA,QACf,WAAW,CAAA,CAAE;AAAA;AACf,KACF,CAAE;AAAA,GACJ;AACF;AAGO,SAAS,qBAAA,CACd,KAAA,EACA,IAAA,GAAO,EAAA,EACP;AACA,EAAA,OAAO,CAAC,GAAG,KAAK,CAAA,CAAE,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,cAAc,CAAA,CAAE,WAAW,CAAA,CAAE,KAAA,CAAM,GAAG,IAAI,CAAA;AAC/E;;;AC7EO,IAAM,iBAAN,MAAqB;AAAA,EAClB,GAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,WAAA;AAAA,EACA,SAAA,uBAAgB,GAAA,EAAc;AAAA,EAC9B,UAAA,GAAkC,IAAA;AAAA,EAClC,WAAqB,EAAC;AAAA,EAE9B,YAAY,OAAA,EAAgC;AAC1C,IAAA,IAAA,CAAK,MAAM,OAAA,CAAQ,GAAA;AACnB,IAAA,IAAA,CAAK,UAAU,OAAA,CAAQ,OAAA;AACvB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAQ,QAAA,IAAY,GAAA;AACpC,IAAA,IAAA,CAAK,WAAA,GAAc,QAAQ,WAAA,IAAe,WAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,QAAA,CAAS,UAAU,eAAA,EAA+B;AAChD,IAAA,MAAM,EAAA,GAAM,OAAO,WAAA,KAAgB,WAAA,GAAc,YAAY,GAAA,EAAI,GAAI,KAAK,GAAA,EAAI;AAC9E,IAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,IAAA,CAAK,QAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAU,CAAC,CAAA;AAE1E,IAAA,MAAM,SAAS,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM;AAC3C,MAAA,MAAM,KAAA,GAAyB;AAAA,QAC7B,WAAA,EAAa,EAAE,UAAA,EAAY,WAAA;AAAA,QAC3B,QAAA,EAAU,EAAE,UAAA,EAAY,QAAA;AAAA,QACxB,YAAA,EAAc,MAAA;AAAA,QACd,QAAA,EAAU,EAAE,UAAA,EAAY,QAAA;AAAA,QACxB,aAAA,EAAe,EAAE,UAAA,EAAY,aAAA;AAAA,QAC7B,qBAAA,EAAuB,MAAA;AAAA,QACvB,MAAA,EAAQ,EAAE,UAAA,EAAY;AAAA,OACxB;AACA,MAAA,OAAO,EAAE,QAAQ,CAAA,CAAE,EAAA,EAAI,OAAO,eAAA,CAAgB,KAAA,EAAO,OAAO,CAAA,EAAE;AAAA,IAChE,CAAC,CAAA;AAED,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,CAAC,GAAG,CAAA,KAAM;AACtC,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA;AACjC,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA;AACvC,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACnC,MAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,SAAW,EAAC;AAC1B,MAAA,OAAO;AAAA,QACL;AAAA,UACE,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,UAC3B,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,UAC3B,WAAA,EAAa,EAAE,KAAA,CAAM;AAAA;AACvB,OACF;AAAA,IACF,CAAC,CAAA;AAED,IAAA,MAAM,UAAU,gBAAA,CAAiB,MAAA,EAAQ,EAAE,QAAA,EAAU,IAAA,CAAK,UAAU,CAAA;AACpE,IAAA,MAAM,WAAA,GAAc,qBAAA;AAAA,MAClB,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACvB,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA;AACjC,QAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA;AACvC,QAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACnC,QAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,SAAW,EAAC;AAC1B,QAAA,OAAO;AAAA,UACL;AAAA,YACE,IAAI,IAAA,CAAK,EAAA;AAAA,YACT,WAAA,EAAa,EAAE,KAAA,CAAM,KAAA;AAAA,YACrB,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,YAC3B,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,YAC3B,OAAO,IAAA,CAAK;AAAA;AACd,SACF;AAAA,MACF,CAAC;AAAA,KACH;AAEA,IAAA,MAAM,UAAA,GAAA,CACH,OAAO,WAAA,KAAgB,WAAA,GAAc,YAAY,GAAA,EAAI,GAAI,IAAA,CAAK,GAAA,EAAI,IAAK,EAAA;AAE1E,IAAA,MAAM,MAAA,GAAuB,EAAE,MAAA,EAAQ,OAAA,EAAS,aAAa,UAAA,EAAW;AACxE,IAAA,IAAA,CAAK,UAAA,GAAa,MAAA;AAClB,IAAA,IAAA,CAAK,cAAc,MAAM,CAAA;AACzB,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,SAAA,EAAW,CAAA,CAAE,MAAM,CAAA;AACxC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA,EAGA,KAAA,GAAc;AACZ,IAAA,KAAA,MAAW,EAAA,IAAM,KAAK,QAAA,EAAU;AAC9B,MAAA,IAAA,CAAK,GAAA,CAAI,YAAY,EAAE,CAAA;AAAA,IACzB;AACA,IAAA,IAAA,CAAK,WAAW,EAAC;AAAA,EACnB;AAAA;AAAA,EAGA,OAAA,GAAgB;AACd,IAAA,IAAA,CAAK,KAAA,EAAM;AACX,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAAA,EACpB;AAAA;AAAA,EAGA,SAAS,EAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,SAAA,CAAU,IAAI,EAAE,CAAA;AACrB,IAAA,OAAO,MAAM,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,EAAE,CAAA;AAAA,EACvC;AAAA;AAAA,EAGA,aAAA,GAAqC;AACnC,IAAA,OAAO,IAAA,CAAK,UAAA;AAAA,EACd;AAAA,EAEQ,cAAc,MAAA,EAA4B;AAChD,IAAA,IAAA,CAAK,KAAA,EAAM;AACX,IAAA,MAAM,KAAA,GAAS,KAAK,GAAA,CAMjB,QAAA;AACH,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,MAAA,CAAO,OAAO,CAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,CAAA,EAAG,IAAA,CAAK,WAAW,CAAA,SAAA,CAAA;AACpC,IAAA,MAAM,OAAA,GAAU,CAAA,EAAG,IAAA,CAAK,WAAW,CAAA,WAAA,CAAA;AACnC,IAAA,IAAI,CAAC,MAAM,SAAA,CAAU,QAAQ,GAAG,KAAA,CAAM,SAAA,CAAU,UAAU,IAAI,CAAA;AAC9D,IAAA,IAAI;AACF,MAAA,KAAA,CAAM,QAAA,CAAS;AAAA,QACb,EAAA,EAAI,OAAA;AAAA,QACJ,IAAA,EAAM,SAAA;AAAA,QACN,MAAA,EAAQ,QAAA;AAAA,QACR,KAAA,EAAO;AAAA,UACL,gBAAA,EAAkB;AAAA,YAChB,aAAA;AAAA,YACA,CAAC,QAAQ,CAAA;AAAA,YACT,CAAC,OAAO,aAAa,CAAA;AAAA,YACrB,CAAA;AAAA,YAAG,CAAA;AAAA,YACH,EAAA;AAAA,YAAI,GAAA;AAAA,YACJ,GAAA;AAAA,YAAK;AAAA,WACP;AAAA,UACA,mBAAA,EAAqB,CAAA;AAAA,UACrB,eAAA,EAAiB;AAAA,YACf,aAAA;AAAA,YACA,CAAC,QAAQ,CAAA;AAAA,YACT,CAAC,iBAAiB,CAAA;AAAA,YAClB,CAAA;AAAA,YAAG,mBAAA;AAAA,YACH,GAAA;AAAA,YAAK,qBAAA;AAAA,YACL,GAAA;AAAA,YAAK,sBAAA;AAAA,YACL,GAAA;AAAA,YAAK,qBAAA;AAAA,YACL,CAAA;AAAA,YAAG;AAAA,WACL;AAAA,UACA,gBAAA,EAAkB,EAAA;AAAA,UAClB,iBAAA,EAAmB;AAAA;AACrB,OACD,CAAA;AACD,MAAA,IAAA,CAAK,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,IAC5B,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AACF","file":"index.cjs","sourcesContent":["/**\n * 管线健康度评分（healthScorer）\n *\n * 6 维加权评分（PRD §4.4.2）：\n *   health_score = age (0.25) + material (0.20) + soil (0.15) +\n *                  history (0.20) + pressure (0.10) + protection (0.10)\n *\n * 每维 0-100，最终加权求和。\n * 评分模型可解释：每个维度的评分依据清晰可见。\n */\n\nimport type { PipeMaterial, PipeStatus } from '../types';\n\nexport interface PipeHealthInput {\n  /** 安装日期 ISO */\n  installDate?: string;\n  /** 材质 */\n  material?: PipeMaterial;\n  /** 当前故障次数 */\n  failureCount?: number;\n  /** 当前压力（MPa） */\n  pressure?: number;\n  /** 最高允许压力（MPa） */\n  ratedPressure?: number;\n  /** 是否阴极保护 */\n  hasCathodicProtection?: boolean;\n  /** 土壤腐蚀指数 0-1（无数据时 0.5） */\n  soilCorrosion?: number;\n  /** 状态（damaged / under_repair 直接影响评分） */\n  status?: PipeStatus;\n}\n\nexport interface PipeHealthScore {\n  /** 总分 0-100 */\n  score: number;\n  /** 等级 */\n  level: 'excellent' | 'good' | 'fair' | 'poor' | 'critical';\n  /** 6 维细分 */\n  dimensions: {\n    age: { score: number; weight: number; reason: string };\n    material: { score: number; weight: number; reason: string };\n    soil: { score: number; weight: number; reason: string };\n    history: { score: number; weight: number; reason: string };\n    pressure: { score: number; weight: number; reason: string };\n    protection: { score: number; weight: number; reason: string };\n  };\n}\n\n/** 默认权重 */\nexport const DEFAULT_WEIGHTS = {\n  age: 0.25,\n  material: 0.2,\n  soil: 0.15,\n  history: 0.2,\n  pressure: 0.1,\n  protection: 0.1,\n};\n\nconst MATERIAL_RISK: Record<PipeMaterial, number> = {\n  cast_iron: 0.85,    // 铸铁 = 高风险（旧管网）\n  ductile_iron: 0.2,  // 球墨铸铁\n  steel: 0.4,\n  pe: 0.1,\n  pvc: 0.15,\n  concrete: 0.3,\n  hdpe: 0.05,\n  copper: 0.1,\n  unknown: 0.5,\n};\n\n/**\n * 计算单根管线的健康度\n */\nexport function scorePipeHealth(input: PipeHealthInput, weights = DEFAULT_WEIGHTS): PipeHealthScore {\n  const dims = {\n    age: scoreAge(input, weights.age),\n    material: scoreMaterial(input, weights.material),\n    soil: scoreSoil(input, weights.soil),\n    history: scoreHistory(input, weights.history),\n    pressure: scorePressure(input, weights.pressure),\n    protection: scoreProtection(input, weights.protection),\n  };\n\n  const total =\n    dims.age.score * dims.age.weight +\n    dims.material.score * dims.material.weight +\n    dims.soil.score * dims.soil.weight +\n    dims.history.score * dims.history.weight +\n    dims.pressure.score * dims.pressure.weight +\n    dims.protection.score * dims.protection.weight;\n\n  // 损坏或维修中额外惩罚\n  let final = total;\n  if (input.status === 'damaged') final *= 0.5;\n  else if (input.status === 'under_repair') final *= 0.7;\n  else if (input.status === 'abandoned') final = 0;\n\n  return {\n    score: Math.round(final),\n    level: toLevel(final),\n    dimensions: dims,\n  };\n}\n\nfunction toLevel(score: number): PipeHealthScore['level'] {\n  if (score >= 80) return 'excellent';\n  if (score >= 60) return 'good';\n  if (score >= 40) return 'fair';\n  if (score >= 20) return 'poor';\n  return 'critical';\n}\n\nfunction scoreAge(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['age'] {\n  if (!input.installDate) {\n    return { score: 50, weight, reason: '未知安装日期，按中等计' };\n  }\n  const ageYears = (Date.now() - new Date(input.installDate).getTime()) / (365.25 * 24 * 3600 * 1000);\n  if (ageYears < 0) return { score: 100, weight, reason: '未来日期，视为优秀' };\n  if (ageYears < 5) return { score: 100, weight, reason: '新建管线 (<5年)' };\n  if (ageYears < 15) return { score: 85, weight, reason: '较新 (5-15年)' };\n  if (ageYears < 25) return { score: 65, weight, reason: '中龄 (15-25年)' };\n  if (ageYears < 40) return { score: 40, weight, reason: '老龄 (25-40年)' };\n  if (ageYears < 60) return { score: 20, weight, reason: '超期 (>40年)' };\n  return { score: 5, weight, reason: '超期 (>60年)' };\n}\n\nfunction scoreMaterial(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['material'] {\n  if (!input.material) {\n    return { score: 50, weight, reason: '未知材质，按中等计' };\n  }\n  const risk = MATERIAL_RISK[input.material] ?? 0.5;\n  const score = Math.round((1 - risk) * 100);\n  const labels: Record<string, string> = {\n    cast_iron: '铸铁（高风险）',\n    ductile_iron: '球墨铸铁',\n    steel: '钢',\n    pe: 'PE（低风险）',\n    pvc: 'PVC',\n    concrete: '混凝土',\n    hdpe: 'HDPE（最佳）',\n    copper: '铜',\n    unknown: '未知',\n  };\n  return {\n    score,\n    weight,\n    reason: labels[input.material] ?? input.material,\n  };\n}\n\nfunction scoreSoil(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['soil'] {\n  const c = input.soilCorrosion ?? 0.5;\n  const score = Math.round((1 - c) * 100);\n  return {\n    score,\n    weight,\n    reason: c === 0.5 && !input.soilCorrosion ? '无土壤数据，按平均计' : `土壤腐蚀指数 ${c.toFixed(2)}`,\n  };\n}\n\nfunction scoreHistory(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['history'] {\n  const fail = input.failureCount ?? 0;\n  if (fail === 0) return { score: 100, weight, reason: '历史无故障' };\n  if (fail === 1) return { score: 75, weight, reason: '历史 1 次故障' };\n  if (fail === 2) return { score: 50, weight, reason: '历史 2 次故障' };\n  if (fail === 3) return { score: 25, weight, reason: '历史 3 次故障' };\n  return { score: 0, weight, reason: `历史 ≥${fail} 次故障` };\n}\n\nfunction scorePressure(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['pressure'] {\n  if (!input.pressure) {\n    return { score: 75, weight, reason: '无压力数据，按中等偏好计' };\n  }\n  if (!input.ratedPressure) {\n    return { score: 75, weight, reason: '仅知当前压力' };\n  }\n  const ratio = input.pressure / input.ratedPressure;\n  if (ratio < 0.5) return { score: 60, weight, reason: '压力偏低 (使用率 <50%)' };\n  if (ratio < 0.8) return { score: 90, weight, reason: '压力正常 (使用率 50-80%)' };\n  if (ratio < 1.0) return { score: 75, weight, reason: '压力偏高 (使用率 80-100%)' };\n  if (ratio < 1.2) return { score: 30, weight, reason: '压力超限 (100-120%)' };\n  return { score: 0, weight, reason: '压力严重超限 (>120%)' };\n}\n\nfunction scoreProtection(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['protection'] {\n  if (input.hasCathodicProtection === true) {\n    return { score: 90, weight, reason: '有阴极保护' };\n  }\n  if (input.hasCathodicProtection === false) {\n    return { score: 30, weight, reason: '无阴极保护' };\n  }\n  return { score: 50, weight, reason: '阴保状态未知' };\n}\n\n/**\n * 批量评分（按需遍历）\n */\nexport function scorePipes(inputs: PipeHealthInput[], weights = DEFAULT_WEIGHTS): PipeHealthScore[] {\n  return inputs.map((i) => scorePipeHealth(i, weights));\n}\n","/**\n * 风险热力图（riskHeatmap）\n *\n * 把 scorePipeHealth 输出按地理网格聚合，输出每个网格的平均分/最高风险，\n * 用于地图热力图（heat-map layer）。\n *\n * 输入：管线数组 [{ lng, lat, healthScore }]\n * 输出：GeoJSON FeatureCollection<Point>（含 healthScore 属性）\n */\n\nexport interface HeatmapCell {\n  lng: number;\n  lat: number;\n  healthScore: number;\n  /** 网格内管段数 */\n  pipeCount: number;\n}\n\nexport interface PipeHealthPoint {\n  lng: number;\n  lat: number;\n  healthScore: number;\n}\n\nexport interface RiskHeatmapOptions {\n  /** 网格尺寸（m），默认 500 */\n  cellSize?: number;\n  /** 聚合方式 */\n  aggregation?: 'average' | 'min' | 'max';\n}\n\nexport function aggregateHeatmap(\n  points: PipeHealthPoint[],\n  options: RiskHeatmapOptions = {}\n): HeatmapCell[] {\n  const cell = options.cellSize ?? 500;\n  const agg = options.aggregation ?? 'average';\n\n  // 经纬度 → 米近似（以第一个点为原点）\n  if (points.length === 0) return [];\n\n  const refLat = points[0].lat;\n  const refLng = points[0].lng;\n  const mPerDegLat = 110_540;\n  const mPerDegLng = 111_320 * Math.cos((refLat * Math.PI) / 180);\n\n  const grid = new Map<string, { acc: number; count: number; minS: number; maxS: number; lng: number; lat: number }>();\n  for (const p of points) {\n    const x = (p.lng - refLng) * mPerDegLng;\n    const y = (p.lat - refLat) * mPerDegLat;\n    const cx = Math.floor(x / cell);\n    const cy = Math.floor(y / cell);\n    const key = `${cx}:${cy}`;\n    const cur = grid.get(key);\n    if (!cur) {\n      grid.set(key, {\n        acc: p.healthScore,\n        count: 1,\n        minS: p.healthScore,\n        maxS: p.healthScore,\n        lng: p.lng,\n        lat: p.lat,\n      });\n    } else {\n      cur.acc += p.healthScore;\n      cur.count += 1;\n      if (p.healthScore < cur.minS) cur.minS = p.healthScore;\n      if (p.healthScore > cur.maxS) cur.maxS = p.healthScore;\n      cur.lng = (cur.lng * (cur.count - 1) + p.lng) / cur.count;\n      cur.lat = (cur.lat * (cur.count - 1) + p.lat) / cur.count;\n    }\n  }\n\n  const cells: HeatmapCell[] = [];\n  for (const v of grid.values()) {\n    let score: number;\n    if (agg === 'min') score = v.minS;\n    else if (agg === 'max') score = v.maxS;\n    else score = v.acc / v.count;\n    cells.push({\n      lng: v.lng,\n      lat: v.lat,\n      healthScore: Math.round(score),\n      pipeCount: v.count,\n    });\n  }\n  return cells;\n}\n\nexport function heatmapToGeoJSON(cells: HeatmapCell[]): GeoJSON.FeatureCollection<GeoJSON.Point> {\n  return {\n    type: 'FeatureCollection',\n    features: cells.map((c) => ({\n      type: 'Feature',\n      geometry: { type: 'Point', coordinates: [c.lng, c.lat] },\n      properties: {\n        healthScore: c.healthScore,\n        pipeCount: c.pipeCount,\n      },\n    })),\n  };\n}\n\n/** 优先维护建议列表（风险最高的 Top N 管线） */\nexport function prioritizeMaintenance(\n  pipes: Array<{ id: string; healthScore: number; lng: number; lat: number; label?: string }>,\n  topN = 10\n) {\n  return [...pipes].sort((a, b) => a.healthScore - b.healthScore).slice(0, topN);\n}\n","/**\n * PipelineHealth 组件类（地图集成层）\n */\n\nimport type { Map as CaoguoMap } from '@caoguo/maplibre';\nimport { scorePipeHealth, type PipeHealthInput, type PipeHealthScore, DEFAULT_WEIGHTS } from './healthScorer';\nimport { aggregateHeatmap, heatmapToGeoJSON, type HeatmapCell, prioritizeMaintenance } from './riskHeatmap';\nimport type { PipelineTopologyDataset } from '../types';\n\nexport interface PipelineHealthOptions {\n  map: CaoguoMap;\n  dataset: PipelineTopologyDataset;\n  cellSize?: number;\n  layerPrefix?: string;\n}\n\nexport interface HealthResult {\n  /** 全部管段评分 */\n  scores: Array<{ pipeId: string; score: PipeHealthScore }>;\n  /** 热力图聚合格 */\n  heatmap: HeatmapCell[];\n  /** 优先维护建议 */\n  maintenance: Array<{ id: string; healthScore: number; lng: number; lat: number; label?: string }>;\n  /** 计算耗时 */\n  durationMs: number;\n}\n\ntype Listener = (r: HealthResult) => void;\n\n/**\n * 管线健康评估组件\n */\nexport class PipelineHealth {\n  private map: CaoguoMap;\n  private dataset: PipelineTopologyDataset;\n  private cellSize: number;\n  private layerPrefix: string;\n  private listeners = new Set<Listener>();\n  private lastResult: HealthResult | null = null;\n  private layerIds: string[] = [];\n\n  constructor(options: PipelineHealthOptions) {\n    this.map = options.map;\n    this.dataset = options.dataset;\n    this.cellSize = options.cellSize ?? 500;\n    this.layerPrefix = options.layerPrefix ?? 'cg-health';\n  }\n\n  /** 评估全网管线健康度 */\n  evaluate(weights = DEFAULT_WEIGHTS): HealthResult {\n    const t0 = (typeof performance !== 'undefined' ? performance.now() : Date.now());\n    const nodeById = new Map(this.dataset.nodes.map((n) => [n.id, n] as const));\n\n    const scores = this.dataset.pipes.map((p) => {\n      const input: PipeHealthInput = {\n        installDate: p.properties?.installDate,\n        material: p.properties?.material,\n        failureCount: undefined,\n        pressure: p.properties?.pressure,\n        ratedPressure: p.properties?.ratedPressure,\n        hasCathodicProtection: undefined,\n        status: p.properties?.status,\n      };\n      return { pipeId: p.id, score: scorePipeHealth(input, weights) };\n    });\n\n    const points = scores.flatMap((s, i) => {\n      const pipe = this.dataset.pipes[i];\n      const from = nodeById.get(pipe.fromNode);\n      const to = nodeById.get(pipe.toNode);\n      if (!from || !to) return [];\n      return [\n        {\n          lng: (from.lng + to.lng) / 2,\n          lat: (from.lat + to.lat) / 2,\n          healthScore: s.score.score,\n        },\n      ];\n    });\n\n    const heatmap = aggregateHeatmap(points, { cellSize: this.cellSize });\n    const maintenance = prioritizeMaintenance(\n      scores.flatMap((s, i) => {\n        const pipe = this.dataset.pipes[i];\n        const from = nodeById.get(pipe.fromNode);\n        const to = nodeById.get(pipe.toNode);\n        if (!from || !to) return [];\n        return [\n          {\n            id: pipe.id,\n            healthScore: s.score.score,\n            lng: (from.lng + to.lng) / 2,\n            lat: (from.lat + to.lat) / 2,\n            label: pipe.id,\n          },\n        ];\n      })\n    );\n\n    const durationMs =\n      (typeof performance !== 'undefined' ? performance.now() : Date.now()) - t0;\n\n    const result: HealthResult = { scores, heatmap, maintenance, durationMs };\n    this.lastResult = result;\n    this.renderHeatmap(result);\n    for (const l of this.listeners) l(result);\n    return result;\n  }\n\n  /** 清空图层 */\n  clear(): void {\n    for (const id of this.layerIds) {\n      this.map.removeLayer(id);\n    }\n    this.layerIds = [];\n  }\n\n  /** 销毁 */\n  destroy(): void {\n    this.clear();\n    this.listeners.clear();\n    this.lastResult = null;\n  }\n\n  /** 订阅结果 */\n  onResult(fn: Listener): () => void {\n    this.listeners.add(fn);\n    return () => this.listeners.delete(fn);\n  }\n\n  /** 取最后一次结果 */\n  getLastResult(): HealthResult | null {\n    return this.lastResult;\n  }\n\n  private renderHeatmap(result: HealthResult): void {\n    this.clear();\n    const mlMap = (this.map as unknown as {\n      instance: {\n        addSource: (id: string, source: unknown) => void;\n        addLayer: (layer: unknown) => void;\n        getSource: (id: string) => unknown;\n      };\n    }).instance;\n    const data = heatmapToGeoJSON(result.heatmap);\n    const sourceId = `${this.layerPrefix}-heat-src`;\n    const layerId = `${this.layerPrefix}-heat-point`;\n    if (!mlMap.getSource(sourceId)) mlMap.addSource(sourceId, data);\n    try {\n      mlMap.addLayer({\n        id: layerId,\n        type: 'heatmap',\n        source: sourceId,\n        paint: {\n          'heatmap-weight': [\n            'interpolate',\n            ['linear'],\n            ['get', 'healthScore'],\n            0, 1,\n            50, 0.5,\n            100, 0,\n          ] as unknown,\n          'heatmap-intensity': 1,\n          'heatmap-color': [\n            'interpolate',\n            ['linear'],\n            ['heatmap-density'],\n            0, 'rgba(34,197,94,0)',\n            0.2, 'rgba(34,197,94,0.5)',\n            0.5, 'rgba(245,158,11,0.7)',\n            0.8, 'rgba(239,68,68,0.8)',\n            1, 'rgba(127,29,29,0.9)',\n          ] as unknown,\n          'heatmap-radius': 25,\n          'heatmap-opacity': 0.7,\n        },\n      });\n      this.layerIds.push(layerId);\n    } catch {\n      // ignore\n    }\n  }\n}\n"]}
+{"version":3,"sources":["../../src/health/healthScorer.ts","../../src/health/riskHeatmap.ts","../../src/health/PipelineHealth.ts"],"names":[],"mappings":";;;AAiDO,IAAM,eAAA,GAAkB;AAAA,EAC7B,GAAA,EAAK,IAAA;AAAA,EACL,QAAA,EAAU,GAAA;AAAA,EACV,IAAA,EAAM,IAAA;AAAA,EACN,OAAA,EAAS,GAAA;AAAA,EACT,QAAA,EAAU,GAAA;AAAA,EACV,UAAA,EAAY;AACd;AAEA,IAAM,aAAA,GAA8C;AAAA,EAClD,SAAA,EAAW,IAAA;AAAA;AAAA,EACX,YAAA,EAAc,GAAA;AAAA;AAAA,EACd,KAAA,EAAO,GAAA;AAAA,EACP,EAAA,EAAI,GAAA;AAAA,EACJ,GAAA,EAAK,IAAA;AAAA,EACL,QAAA,EAAU,GAAA;AAAA,EACV,IAAA,EAAM,IAAA;AAAA,EACN,MAAA,EAAQ,GAAA;AAAA,EACR,OAAA,EAAS;AACX,CAAA;AAKO,SAAS,eAAA,CAAgB,KAAA,EAAwB,OAAA,GAAU,eAAA,EAAkC;AAClG,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,GAAA,EAAK,QAAA,CAAS,KAAA,EAAO,OAAA,CAAQ,GAAG,CAAA;AAAA,IAChC,QAAA,EAAU,aAAA,CAAc,KAAA,EAAO,OAAA,CAAQ,QAAQ,CAAA;AAAA,IAC/C,IAAA,EAAM,SAAA,CAAU,KAAA,EAAO,OAAA,CAAQ,IAAI,CAAA;AAAA,IACnC,OAAA,EAAS,YAAA,CAAa,KAAA,EAAO,OAAA,CAAQ,OAAO,CAAA;AAAA,IAC5C,QAAA,EAAU,aAAA,CAAc,KAAA,EAAO,OAAA,CAAQ,QAAQ,CAAA;AAAA,IAC/C,UAAA,EAAY,eAAA,CAAgB,KAAA,EAAO,OAAA,CAAQ,UAAU;AAAA,GACvD;AAEA,EAAA,MAAM,KAAA,GACJ,IAAA,CAAK,GAAA,CAAI,KAAA,GAAQ,KAAK,GAAA,CAAI,MAAA,GAC1B,IAAA,CAAK,QAAA,CAAS,QAAQ,IAAA,CAAK,QAAA,CAAS,MAAA,GACpC,IAAA,CAAK,KAAK,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,MAAA,GAC5B,KAAK,OAAA,CAAQ,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,SAClC,IAAA,CAAK,QAAA,CAAS,KAAA,GAAQ,IAAA,CAAK,SAAS,MAAA,GACpC,IAAA,CAAK,UAAA,CAAW,KAAA,GAAQ,KAAK,UAAA,CAAW,MAAA;AAG1C,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,SAAA,EAAW,KAAA,IAAS,GAAA;AAAA,OAAA,IAChC,KAAA,CAAM,MAAA,KAAW,cAAA,EAAgB,KAAA,IAAS,GAAA;AAAA,OAAA,IAC1C,KAAA,CAAM,MAAA,KAAW,WAAA,EAAa,KAAA,GAAQ,CAAA;AAE/C,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAAA,IACvB,KAAA,EAAO,QAAQ,KAAK,CAAA;AAAA,IACpB,UAAA,EAAY;AAAA,GACd;AACF;AAEA,SAAS,QAAQ,KAAA,EAAyC;AACxD,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,WAAA;AACxB,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,MAAA;AACxB,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,MAAA;AACxB,EAAA,IAAI,KAAA,IAAS,IAAI,OAAO,MAAA;AACxB,EAAA,OAAO,UAAA;AACT;AAEA,SAAS,QAAA,CAAS,OAAwB,MAAA,EAAsD;AAC9F,EAAA,IAAI,CAAC,MAAM,WAAA,EAAa;AACtB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,oEAAA,EAAc;AAAA,EACpD;AACA,EAAA,MAAM,QAAA,GAAA,CAAY,IAAA,CAAK,GAAA,EAAI,GAAI,IAAI,IAAA,CAAK,KAAA,CAAM,WAAW,CAAA,CAAE,OAAA,EAAQ,KAAM,MAAA,GAAS,KAAK,IAAA,GAAO,GAAA,CAAA;AAC9F,EAAA,IAAI,QAAA,GAAW,GAAG,OAAO,EAAE,OAAO,GAAA,EAAK,MAAA,EAAQ,QAAQ,wDAAA,EAAY;AACnE,EAAA,IAAI,QAAA,GAAW,GAAG,OAAO,EAAE,OAAO,GAAA,EAAK,MAAA,EAAQ,QAAQ,qCAAA,EAAa;AACpE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,2BAAA,EAAa;AACpE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,4BAAA,EAAc;AACrE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,4BAAA,EAAc;AACrE,EAAA,IAAI,QAAA,GAAW,IAAI,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,0BAAA,EAAY;AACnE,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,QAAQ,0BAAA,EAAY;AACjD;AAEA,SAAS,aAAA,CAAc,OAAwB,MAAA,EAA2D;AACxG,EAAA,IAAI,CAAC,MAAM,QAAA,EAAU;AACnB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,wDAAA,EAAY;AAAA,EAClD;AACA,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,QAAQ,CAAA,IAAK,GAAA;AAC9C,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAA,CAAO,CAAA,GAAI,QAAQ,GAAG,CAAA;AACzC,EAAA,MAAM,MAAA,GAAiC;AAAA,IACrC,SAAA,EAAW,4CAAA;AAAA,IACX,YAAA,EAAc,0BAAA;AAAA,IACd,KAAA,EAAO,QAAA;AAAA,IACP,EAAA,EAAI,kCAAA;AAAA,IACJ,GAAA,EAAK,KAAA;AAAA,IACL,QAAA,EAAU,oBAAA;AAAA,IACV,IAAA,EAAM,8BAAA;AAAA,IACN,MAAA,EAAQ,QAAA;AAAA,IACR,OAAA,EAAS;AAAA,GACX;AACA,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA,EAAQ,MAAA,CAAO,KAAA,CAAM,QAAQ,KAAK,KAAA,CAAM;AAAA,GAC1C;AACF;AAEA,SAAS,SAAA,CAAU,OAAwB,MAAA,EAAuD;AAChG,EAAA,MAAM,CAAA,GAAI,MAAM,aAAA,IAAiB,GAAA;AACjC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAA,CAAO,CAAA,GAAI,KAAK,GAAG,CAAA;AACtC,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA,EAAQ,CAAA,KAAM,GAAA,IAAO,CAAC,KAAA,CAAM,aAAA,GAAgB,8DAAA,GAAe,CAAA,qCAAA,EAAU,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,CAAA;AAAA,GACnF;AACF;AAEA,SAAS,YAAA,CAAa,OAAwB,MAAA,EAA0D;AACtG,EAAA,MAAM,IAAA,GAAO,MAAM,YAAA,IAAgB,CAAA;AACnC,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,GAAA,EAAK,MAAA,EAAQ,QAAQ,gCAAA,EAAQ;AAC7D,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,mCAAA,EAAW;AAC/D,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,mCAAA,EAAW;AAC/D,EAAA,IAAI,IAAA,KAAS,GAAG,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,mCAAA,EAAW;AAC/D,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,QAAQ,MAAA,EAAQ,CAAA,mBAAA,EAAO,IAAI,CAAA,mBAAA,CAAA,EAAO;AACvD;AAEA,SAAS,aAAA,CAAc,OAAwB,MAAA,EAA2D;AACxG,EAAA,IAAI,CAAC,MAAM,QAAA,EAAU;AACnB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,0EAAA,EAAe;AAAA,EACrD;AACA,EAAA,IAAI,CAAC,MAAM,aAAA,EAAe;AACxB,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,sCAAA,EAAS;AAAA,EAC/C;AACA,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,QAAA,GAAW,KAAA,CAAM,aAAA;AACrC,EAAA,IAAI,KAAA,GAAQ,KAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,oDAAA,EAAkB;AACvE,EAAA,IAAI,KAAA,GAAQ,KAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,sDAAA,EAAoB;AACzE,EAAA,IAAI,KAAA,GAAQ,GAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,uDAAA,EAAqB;AAC1E,EAAA,IAAI,KAAA,GAAQ,KAAK,OAAO,EAAE,OAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,qCAAA,EAAkB;AACvE,EAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,QAAQ,8CAAA,EAAiB;AACtD;AAEA,SAAS,eAAA,CAAgB,OAAwB,MAAA,EAA6D;AAC5G,EAAA,IAAI,KAAA,CAAM,0BAA0B,IAAA,EAAM;AACxC,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,gCAAA,EAAQ;AAAA,EAC9C;AACA,EAAA,IAAI,KAAA,CAAM,0BAA0B,KAAA,EAAO;AACzC,IAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,gCAAA,EAAQ;AAAA,EAC9C;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,EAAA,EAAI,MAAA,EAAQ,QAAQ,sCAAA,EAAS;AAC/C;AAKO,SAAS,UAAA,CAAW,MAAA,EAA2B,OAAA,GAAU,eAAA,EAAoC;AAClG,EAAA,OAAO,OAAO,GAAA,CAAI,CAAC,MAAM,eAAA,CAAgB,CAAA,EAAG,OAAO,CAAC,CAAA;AACtD;;;ACxKO,SAAS,gBAAA,CACd,MAAA,EACA,OAAA,GAA8B,EAAC,EAChB;AACf,EAAA,MAAM,IAAA,GAAO,QAAQ,QAAA,IAAY,GAAA;AACjC,EAAA,MAAM,GAAA,GAAM,QAAQ,WAAA,IAAe,SAAA;AAGnC,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEjC,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,CAAC,CAAA,CAAE,GAAA;AACzB,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,CAAC,CAAA,CAAE,GAAA;AACzB,EAAA,MAAM,UAAA,GAAa,MAAA;AACnB,EAAA,MAAM,aAAa,MAAA,GAAU,IAAA,CAAK,IAAK,MAAA,GAAS,IAAA,CAAK,KAAM,GAAG,CAAA;AAE9D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAkG;AACnH,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,MAAM,CAAA,GAAA,CAAK,CAAA,CAAE,GAAA,GAAM,MAAA,IAAU,UAAA;AAC7B,IAAA,MAAM,CAAA,GAAA,CAAK,CAAA,CAAE,GAAA,GAAM,MAAA,IAAU,UAAA;AAC7B,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,IAAI,CAAA;AAC9B,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,IAAI,CAAA;AAC9B,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,EAAE,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA;AACvB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA;AACxB,IAAA,IAAI,CAAC,GAAA,EAAK;AACR,MAAA,IAAA,CAAK,IAAI,GAAA,EAAK;AAAA,QACZ,KAAK,CAAA,CAAE,WAAA;AAAA,QACP,KAAA,EAAO,CAAA;AAAA,QACP,MAAM,CAAA,CAAE,WAAA;AAAA,QACR,MAAM,CAAA,CAAE,WAAA;AAAA,QACR,KAAK,CAAA,CAAE,GAAA;AAAA,QACP,KAAK,CAAA,CAAE;AAAA,OACR,CAAA;AAAA,IACH,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,OAAO,CAAA,CAAE,WAAA;AACb,MAAA,GAAA,CAAI,KAAA,IAAS,CAAA;AACb,MAAA,IAAI,EAAE,WAAA,GAAc,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,OAAO,CAAA,CAAE,WAAA;AAC3C,MAAA,IAAI,EAAE,WAAA,GAAc,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,OAAO,CAAA,CAAE,WAAA;AAC3C,MAAA,GAAA,CAAI,GAAA,GAAA,CAAO,IAAI,GAAA,IAAO,GAAA,CAAI,QAAQ,CAAA,CAAA,GAAK,CAAA,CAAE,OAAO,GAAA,CAAI,KAAA;AACpD,MAAA,GAAA,CAAI,GAAA,GAAA,CAAO,IAAI,GAAA,IAAO,GAAA,CAAI,QAAQ,CAAA,CAAA,GAAK,CAAA,CAAE,OAAO,GAAA,CAAI,KAAA;AAAA,IACtD;AAAA,EACF;AAEA,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,MAAA,EAAO,EAAG;AAC7B,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI,GAAA,KAAQ,KAAA,EAAO,KAAA,GAAQ,CAAA,CAAE,IAAA;AAAA,SAAA,IACpB,GAAA,KAAQ,KAAA,EAAO,KAAA,GAAQ,CAAA,CAAE,IAAA;AAAA,SAC7B,KAAA,GAAQ,CAAA,CAAE,GAAA,GAAM,CAAA,CAAE,KAAA;AACvB,IAAA,KAAA,CAAM,IAAA,CAAK;AAAA,MACT,KAAK,CAAA,CAAE,GAAA;AAAA,MACP,KAAK,CAAA,CAAE,GAAA;AAAA,MACP,WAAA,EAAa,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAAA,MAC7B,WAAW,CAAA,CAAE;AAAA,KACd,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,iBAAiB,KAAA,EAAgE;AAC/F,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,mBAAA;AAAA,IACN,QAAA,EAAU,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MAC1B,IAAA,EAAM,SAAA;AAAA,MACN,QAAA,EAAU,EAAE,IAAA,EAAM,OAAA,EAAS,WAAA,EAAa,CAAC,CAAA,CAAE,GAAA,EAAK,CAAA,CAAE,GAAG,CAAA,EAAE;AAAA,MACvD,UAAA,EAAY;AAAA,QACV,aAAa,CAAA,CAAE,WAAA;AAAA,QACf,WAAW,CAAA,CAAE;AAAA;AACf,KACF,CAAE;AAAA,GACJ;AACF;AAGO,SAAS,qBAAA,CACd,KAAA,EACA,IAAA,GAAO,EAAA,EACP;AACA,EAAA,OAAO,CAAC,GAAG,KAAK,CAAA,CAAE,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,cAAc,CAAA,CAAE,WAAW,CAAA,CAAE,KAAA,CAAM,GAAG,IAAI,CAAA;AAC/E;;;AC7EO,IAAM,iBAAN,MAAqB;AAAA,EAClB,GAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,WAAA;AAAA,EACA,SAAA,uBAAgB,GAAA,EAAc;AAAA,EAC9B,UAAA,GAAkC,IAAA;AAAA,EAClC,WAAqB,EAAC;AAAA,EAE9B,YAAY,OAAA,EAAgC;AAC1C,IAAA,IAAA,CAAK,MAAM,OAAA,CAAQ,GAAA;AACnB,IAAA,IAAA,CAAK,UAAU,OAAA,CAAQ,OAAA;AACvB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAQ,QAAA,IAAY,GAAA;AACpC,IAAA,IAAA,CAAK,WAAA,GAAc,QAAQ,WAAA,IAAe,WAAA;AAAA,EAC5C;AAAA;AAAA,EAGA,QAAA,CAAS,UAAU,eAAA,EAA+B;AAChD,IAAA,MAAM,EAAA,GAAM,OAAO,WAAA,KAAgB,WAAA,GAAc,YAAY,GAAA,EAAI,GAAI,KAAK,GAAA,EAAI;AAC9E,IAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,IAAA,CAAK,QAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAU,CAAC,CAAA;AAE1E,IAAA,MAAM,SAAS,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM;AAC3C,MAAA,MAAM,KAAA,GAAyB;AAAA,QAC7B,WAAA,EAAa,EAAE,UAAA,EAAY,WAAA;AAAA,QAC3B,QAAA,EAAU,EAAE,UAAA,EAAY,QAAA;AAAA,QACxB,YAAA,EAAc,CAAA,CAAE,UAAA,EAAY,YAAA,IAAgB,CAAA;AAAA,QAC5C,QAAA,EAAU,EAAE,UAAA,EAAY,QAAA;AAAA,QACxB,aAAA,EAAe,EAAE,UAAA,EAAY,aAAA;AAAA,QAC7B,qBAAA,EAAuB,CAAA,CAAE,UAAA,EAAY,qBAAA,IAAyB,KAAA;AAAA,QAC9D,MAAA,EAAQ,EAAE,UAAA,EAAY;AAAA,OACxB;AACA,MAAA,OAAO,EAAE,QAAQ,CAAA,CAAE,EAAA,EAAI,OAAO,eAAA,CAAgB,KAAA,EAAO,OAAO,CAAA,EAAE;AAAA,IAChE,CAAC,CAAA;AAED,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,CAAC,GAAG,CAAA,KAAM;AACtC,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA;AACjC,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA;AACvC,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACnC,MAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,SAAW,EAAC;AAC1B,MAAA,OAAO;AAAA,QACL;AAAA,UACE,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,UAC3B,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,UAC3B,WAAA,EAAa,EAAE,KAAA,CAAM;AAAA;AACvB,OACF;AAAA,IACF,CAAC,CAAA;AAED,IAAA,MAAM,UAAU,gBAAA,CAAiB,MAAA,EAAQ,EAAE,QAAA,EAAU,IAAA,CAAK,UAAU,CAAA;AACpE,IAAA,MAAM,WAAA,GAAc,qBAAA;AAAA,MAClB,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACvB,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA;AACjC,QAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA;AACvC,QAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACnC,QAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,SAAW,EAAC;AAC1B,QAAA,OAAO;AAAA,UACL;AAAA,YACE,IAAI,IAAA,CAAK,EAAA;AAAA,YACT,WAAA,EAAa,EAAE,KAAA,CAAM,KAAA;AAAA,YACrB,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,YAC3B,GAAA,EAAA,CAAM,IAAA,CAAK,GAAA,GAAM,EAAA,CAAG,GAAA,IAAO,CAAA;AAAA,YAC3B,OAAO,IAAA,CAAK;AAAA;AACd,SACF;AAAA,MACF,CAAC;AAAA,KACH;AAEA,IAAA,MAAM,UAAA,GAAA,CACH,OAAO,WAAA,KAAgB,WAAA,GAAc,YAAY,GAAA,EAAI,GAAI,IAAA,CAAK,GAAA,EAAI,IAAK,EAAA;AAE1E,IAAA,MAAM,MAAA,GAAuB,EAAE,MAAA,EAAQ,OAAA,EAAS,aAAa,UAAA,EAAW;AACxE,IAAA,IAAA,CAAK,UAAA,GAAa,MAAA;AAClB,IAAA,IAAA,CAAK,cAAc,MAAM,CAAA;AACzB,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,SAAA,EAAW,CAAA,CAAE,MAAM,CAAA;AACxC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA,EAGA,KAAA,GAAc;AACZ,IAAA,KAAA,MAAW,EAAA,IAAM,KAAK,QAAA,EAAU;AAC9B,MAAA,IAAA,CAAK,GAAA,CAAI,YAAY,EAAE,CAAA;AAAA,IACzB;AACA,IAAA,IAAA,CAAK,WAAW,EAAC;AAAA,EACnB;AAAA;AAAA,EAGA,OAAA,GAAgB;AACd,IAAA,IAAA,CAAK,KAAA,EAAM;AACX,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAAA,EACpB;AAAA;AAAA,EAGA,SAAS,EAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,SAAA,CAAU,IAAI,EAAE,CAAA;AACrB,IAAA,OAAO,MAAM,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,EAAE,CAAA;AAAA,EACvC;AAAA;AAAA,EAGA,aAAA,GAAqC;AACnC,IAAA,OAAO,IAAA,CAAK,UAAA;AAAA,EACd;AAAA,EAEQ,cAAc,MAAA,EAA4B;AAChD,IAAA,IAAA,CAAK,KAAA,EAAM;AACX,IAAA,MAAM,KAAA,GAAS,KAAK,GAAA,CAMjB,QAAA;AACH,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,MAAA,CAAO,OAAO,CAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,CAAA,EAAG,IAAA,CAAK,WAAW,CAAA,SAAA,CAAA;AACpC,IAAA,MAAM,OAAA,GAAU,CAAA,EAAG,IAAA,CAAK,WAAW,CAAA,WAAA,CAAA;AACnC,IAAA,IAAI,CAAC,MAAM,SAAA,CAAU,QAAQ,GAAG,KAAA,CAAM,SAAA,CAAU,UAAU,IAAI,CAAA;AAC9D,IAAA,IAAI;AACF,MAAA,KAAA,CAAM,QAAA,CAAS;AAAA,QACb,EAAA,EAAI,OAAA;AAAA,QACJ,IAAA,EAAM,SAAA;AAAA,QACN,MAAA,EAAQ,QAAA;AAAA,QACR,KAAA,EAAO;AAAA,UACL,gBAAA,EAAkB;AAAA,YAChB,aAAA;AAAA,YACA,CAAC,QAAQ,CAAA;AAAA,YACT,CAAC,OAAO,aAAa,CAAA;AAAA,YACrB,CAAA;AAAA,YAAG,CAAA;AAAA,YACH,EAAA;AAAA,YAAI,GAAA;AAAA,YACJ,GAAA;AAAA,YAAK;AAAA,WACP;AAAA,UACA,mBAAA,EAAqB,CAAA;AAAA,UACrB,eAAA,EAAiB;AAAA,YACf,aAAA;AAAA,YACA,CAAC,QAAQ,CAAA;AAAA,YACT,CAAC,iBAAiB,CAAA;AAAA,YAClB,CAAA;AAAA,YAAG,mBAAA;AAAA,YACH,GAAA;AAAA,YAAK,qBAAA;AAAA,YACL,GAAA;AAAA,YAAK,sBAAA;AAAA,YACL,GAAA;AAAA,YAAK,qBAAA;AAAA,YACL,CAAA;AAAA,YAAG;AAAA,WACL;AAAA,UACA,gBAAA,EAAkB,EAAA;AAAA,UAClB,iBAAA,EAAmB;AAAA;AACrB,OACD,CAAA;AACD,MAAA,IAAA,CAAK,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,IAC5B,CAAA,CAAA,MAAQ;AAAA,IAER;AAAA,EACF;AACF","file":"index.cjs","sourcesContent":["/**\n * 管线健康度评分（healthScorer）\n *\n * 6 维加权评分（PRD §4.4.2）：\n *   health_score = age (0.25) + material (0.20) + soil (0.15) +\n *                  history (0.20) + pressure (0.10) + protection (0.10)\n *\n * 每维 0-100，最终加权求和。\n * 评分模型可解释：每个维度的评分依据清晰可见。\n */\n\nimport type { PipeMaterial, PipeStatus } from '../types';\n\nexport interface PipeHealthInput {\n  /** 安装日期 ISO */\n  installDate?: string;\n  /** 材质 */\n  material?: PipeMaterial;\n  /** 当前故障次数 */\n  failureCount?: number;\n  /** 当前压力（MPa） */\n  pressure?: number;\n  /** 最高允许压力（MPa） */\n  ratedPressure?: number;\n  /** 是否阴极保护 */\n  hasCathodicProtection?: boolean;\n  /** 土壤腐蚀指数 0-1（无数据时 0.5） */\n  soilCorrosion?: number;\n  /** 状态（damaged / under_repair 直接影响评分） */\n  status?: PipeStatus;\n}\n\nexport interface PipeHealthScore {\n  /** 总分 0-100 */\n  score: number;\n  /** 等级 */\n  level: 'excellent' | 'good' | 'fair' | 'poor' | 'critical';\n  /** 6 维细分 */\n  dimensions: {\n    age: { score: number; weight: number; reason: string };\n    material: { score: number; weight: number; reason: string };\n    soil: { score: number; weight: number; reason: string };\n    history: { score: number; weight: number; reason: string };\n    pressure: { score: number; weight: number; reason: string };\n    protection: { score: number; weight: number; reason: string };\n  };\n}\n\n/** 默认权重 */\nexport const DEFAULT_WEIGHTS = {\n  age: 0.25,\n  material: 0.2,\n  soil: 0.15,\n  history: 0.2,\n  pressure: 0.1,\n  protection: 0.1,\n};\n\nconst MATERIAL_RISK: Record<PipeMaterial, number> = {\n  cast_iron: 0.85,    // 铸铁 = 高风险（旧管网）\n  ductile_iron: 0.2,  // 球墨铸铁\n  steel: 0.4,\n  pe: 0.1,\n  pvc: 0.15,\n  concrete: 0.3,\n  hdpe: 0.05,\n  copper: 0.1,\n  unknown: 0.5,\n};\n\n/**\n * 计算单根管线的健康度\n */\nexport function scorePipeHealth(input: PipeHealthInput, weights = DEFAULT_WEIGHTS): PipeHealthScore {\n  const dims = {\n    age: scoreAge(input, weights.age),\n    material: scoreMaterial(input, weights.material),\n    soil: scoreSoil(input, weights.soil),\n    history: scoreHistory(input, weights.history),\n    pressure: scorePressure(input, weights.pressure),\n    protection: scoreProtection(input, weights.protection),\n  };\n\n  const total =\n    dims.age.score * dims.age.weight +\n    dims.material.score * dims.material.weight +\n    dims.soil.score * dims.soil.weight +\n    dims.history.score * dims.history.weight +\n    dims.pressure.score * dims.pressure.weight +\n    dims.protection.score * dims.protection.weight;\n\n  // 损坏或维修中额外惩罚\n  let final = total;\n  if (input.status === 'damaged') final *= 0.5;\n  else if (input.status === 'under_repair') final *= 0.7;\n  else if (input.status === 'abandoned') final = 0;\n\n  return {\n    score: Math.round(final),\n    level: toLevel(final),\n    dimensions: dims,\n  };\n}\n\nfunction toLevel(score: number): PipeHealthScore['level'] {\n  if (score >= 80) return 'excellent';\n  if (score >= 60) return 'good';\n  if (score >= 40) return 'fair';\n  if (score >= 20) return 'poor';\n  return 'critical';\n}\n\nfunction scoreAge(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['age'] {\n  if (!input.installDate) {\n    return { score: 50, weight, reason: '未知安装日期，按中等计' };\n  }\n  const ageYears = (Date.now() - new Date(input.installDate).getTime()) / (365.25 * 24 * 3600 * 1000);\n  if (ageYears < 0) return { score: 100, weight, reason: '未来日期，视为优秀' };\n  if (ageYears < 5) return { score: 100, weight, reason: '新建管线 (<5年)' };\n  if (ageYears < 15) return { score: 85, weight, reason: '较新 (5-15年)' };\n  if (ageYears < 25) return { score: 65, weight, reason: '中龄 (15-25年)' };\n  if (ageYears < 40) return { score: 40, weight, reason: '老龄 (25-40年)' };\n  if (ageYears < 60) return { score: 20, weight, reason: '超期 (>40年)' };\n  return { score: 5, weight, reason: '超期 (>60年)' };\n}\n\nfunction scoreMaterial(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['material'] {\n  if (!input.material) {\n    return { score: 50, weight, reason: '未知材质，按中等计' };\n  }\n  const risk = MATERIAL_RISK[input.material] ?? 0.5;\n  const score = Math.round((1 - risk) * 100);\n  const labels: Record<string, string> = {\n    cast_iron: '铸铁（高风险）',\n    ductile_iron: '球墨铸铁',\n    steel: '钢',\n    pe: 'PE（低风险）',\n    pvc: 'PVC',\n    concrete: '混凝土',\n    hdpe: 'HDPE（最佳）',\n    copper: '铜',\n    unknown: '未知',\n  };\n  return {\n    score,\n    weight,\n    reason: labels[input.material] ?? input.material,\n  };\n}\n\nfunction scoreSoil(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['soil'] {\n  const c = input.soilCorrosion ?? 0.5;\n  const score = Math.round((1 - c) * 100);\n  return {\n    score,\n    weight,\n    reason: c === 0.5 && !input.soilCorrosion ? '无土壤数据，按平均计' : `土壤腐蚀指数 ${c.toFixed(2)}`,\n  };\n}\n\nfunction scoreHistory(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['history'] {\n  const fail = input.failureCount ?? 0;\n  if (fail === 0) return { score: 100, weight, reason: '历史无故障' };\n  if (fail === 1) return { score: 75, weight, reason: '历史 1 次故障' };\n  if (fail === 2) return { score: 50, weight, reason: '历史 2 次故障' };\n  if (fail === 3) return { score: 25, weight, reason: '历史 3 次故障' };\n  return { score: 0, weight, reason: `历史 ≥${fail} 次故障` };\n}\n\nfunction scorePressure(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['pressure'] {\n  if (!input.pressure) {\n    return { score: 75, weight, reason: '无压力数据，按中等偏好计' };\n  }\n  if (!input.ratedPressure) {\n    return { score: 75, weight, reason: '仅知当前压力' };\n  }\n  const ratio = input.pressure / input.ratedPressure;\n  if (ratio < 0.5) return { score: 60, weight, reason: '压力偏低 (使用率 <50%)' };\n  if (ratio < 0.8) return { score: 90, weight, reason: '压力正常 (使用率 50-80%)' };\n  if (ratio < 1.0) return { score: 75, weight, reason: '压力偏高 (使用率 80-100%)' };\n  if (ratio < 1.2) return { score: 30, weight, reason: '压力超限 (100-120%)' };\n  return { score: 0, weight, reason: '压力严重超限 (>120%)' };\n}\n\nfunction scoreProtection(input: PipeHealthInput, weight: number): PipeHealthScore['dimensions']['protection'] {\n  if (input.hasCathodicProtection === true) {\n    return { score: 90, weight, reason: '有阴极保护' };\n  }\n  if (input.hasCathodicProtection === false) {\n    return { score: 30, weight, reason: '无阴极保护' };\n  }\n  return { score: 50, weight, reason: '阴保状态未知' };\n}\n\n/**\n * 批量评分（按需遍历）\n */\nexport function scorePipes(inputs: PipeHealthInput[], weights = DEFAULT_WEIGHTS): PipeHealthScore[] {\n  return inputs.map((i) => scorePipeHealth(i, weights));\n}\n","/**\n * 风险热力图（riskHeatmap）\n *\n * 把 scorePipeHealth 输出按地理网格聚合，输出每个网格的平均分/最高风险，\n * 用于地图热力图（heat-map layer）。\n *\n * 输入：管线数组 [{ lng, lat, healthScore }]\n * 输出：GeoJSON FeatureCollection<Point>（含 healthScore 属性）\n */\n\nexport interface HeatmapCell {\n  lng: number;\n  lat: number;\n  healthScore: number;\n  /** 网格内管段数 */\n  pipeCount: number;\n}\n\nexport interface PipeHealthPoint {\n  lng: number;\n  lat: number;\n  healthScore: number;\n}\n\nexport interface RiskHeatmapOptions {\n  /** 网格尺寸（m），默认 500 */\n  cellSize?: number;\n  /** 聚合方式 */\n  aggregation?: 'average' | 'min' | 'max';\n}\n\nexport function aggregateHeatmap(\n  points: PipeHealthPoint[],\n  options: RiskHeatmapOptions = {}\n): HeatmapCell[] {\n  const cell = options.cellSize ?? 500;\n  const agg = options.aggregation ?? 'average';\n\n  // 经纬度 → 米近似（以第一个点为原点）\n  if (points.length === 0) return [];\n\n  const refLat = points[0].lat;\n  const refLng = points[0].lng;\n  const mPerDegLat = 110_540;\n  const mPerDegLng = 111_320 * Math.cos((refLat * Math.PI) / 180);\n\n  const grid = new Map<string, { acc: number; count: number; minS: number; maxS: number; lng: number; lat: number }>();\n  for (const p of points) {\n    const x = (p.lng - refLng) * mPerDegLng;\n    const y = (p.lat - refLat) * mPerDegLat;\n    const cx = Math.floor(x / cell);\n    const cy = Math.floor(y / cell);\n    const key = `${cx}:${cy}`;\n    const cur = grid.get(key);\n    if (!cur) {\n      grid.set(key, {\n        acc: p.healthScore,\n        count: 1,\n        minS: p.healthScore,\n        maxS: p.healthScore,\n        lng: p.lng,\n        lat: p.lat,\n      });\n    } else {\n      cur.acc += p.healthScore;\n      cur.count += 1;\n      if (p.healthScore < cur.minS) cur.minS = p.healthScore;\n      if (p.healthScore > cur.maxS) cur.maxS = p.healthScore;\n      cur.lng = (cur.lng * (cur.count - 1) + p.lng) / cur.count;\n      cur.lat = (cur.lat * (cur.count - 1) + p.lat) / cur.count;\n    }\n  }\n\n  const cells: HeatmapCell[] = [];\n  for (const v of grid.values()) {\n    let score: number;\n    if (agg === 'min') score = v.minS;\n    else if (agg === 'max') score = v.maxS;\n    else score = v.acc / v.count;\n    cells.push({\n      lng: v.lng,\n      lat: v.lat,\n      healthScore: Math.round(score),\n      pipeCount: v.count,\n    });\n  }\n  return cells;\n}\n\nexport function heatmapToGeoJSON(cells: HeatmapCell[]): GeoJSON.FeatureCollection<GeoJSON.Point> {\n  return {\n    type: 'FeatureCollection',\n    features: cells.map((c) => ({\n      type: 'Feature',\n      geometry: { type: 'Point', coordinates: [c.lng, c.lat] },\n      properties: {\n        healthScore: c.healthScore,\n        pipeCount: c.pipeCount,\n      },\n    })),\n  };\n}\n\n/** 优先维护建议列表（风险最高的 Top N 管线） */\nexport function prioritizeMaintenance(\n  pipes: Array<{ id: string; healthScore: number; lng: number; lat: number; label?: string }>,\n  topN = 10\n) {\n  return [...pipes].sort((a, b) => a.healthScore - b.healthScore).slice(0, topN);\n}\n","/**\n * PipelineHealth 组件类（地图集成层）\n */\n\nimport type { Map as CaoguoMap } from '@caoguo/maplibre';\nimport { scorePipeHealth, type PipeHealthInput, type PipeHealthScore, DEFAULT_WEIGHTS } from './healthScorer';\nimport { aggregateHeatmap, heatmapToGeoJSON, type HeatmapCell, prioritizeMaintenance } from './riskHeatmap';\nimport type { PipelineTopologyDataset } from '../types';\n\nexport interface PipelineHealthOptions {\n  map: CaoguoMap;\n  dataset: PipelineTopologyDataset;\n  cellSize?: number;\n  layerPrefix?: string;\n}\n\nexport interface HealthResult {\n  /** 全部管段评分 */\n  scores: Array<{ pipeId: string; score: PipeHealthScore }>;\n  /** 热力图聚合格 */\n  heatmap: HeatmapCell[];\n  /** 优先维护建议 */\n  maintenance: Array<{ id: string; healthScore: number; lng: number; lat: number; label?: string }>;\n  /** 计算耗时 */\n  durationMs: number;\n}\n\ntype Listener = (r: HealthResult) => void;\n\n/**\n * 管线健康评估组件\n */\nexport class PipelineHealth {\n  private map: CaoguoMap;\n  private dataset: PipelineTopologyDataset;\n  private cellSize: number;\n  private layerPrefix: string;\n  private listeners = new Set<Listener>();\n  private lastResult: HealthResult | null = null;\n  private layerIds: string[] = [];\n\n  constructor(options: PipelineHealthOptions) {\n    this.map = options.map;\n    this.dataset = options.dataset;\n    this.cellSize = options.cellSize ?? 500;\n    this.layerPrefix = options.layerPrefix ?? 'cg-health';\n  }\n\n  /** 评估全网管线健康度 */\n  evaluate(weights = DEFAULT_WEIGHTS): HealthResult {\n    const t0 = (typeof performance !== 'undefined' ? performance.now() : Date.now());\n    const nodeById = new Map(this.dataset.nodes.map((n) => [n.id, n] as const));\n\n    const scores = this.dataset.pipes.map((p) => {\n      const input: PipeHealthInput = {\n        installDate: p.properties?.installDate,\n        material: p.properties?.material,\n        failureCount: p.properties?.failureCount ?? 0,\n        pressure: p.properties?.pressure,\n        ratedPressure: p.properties?.ratedPressure,\n        hasCathodicProtection: p.properties?.hasCathodicProtection ?? false,\n        status: p.properties?.status,\n      };\n      return { pipeId: p.id, score: scorePipeHealth(input, weights) };\n    });\n\n    const points = scores.flatMap((s, i) => {\n      const pipe = this.dataset.pipes[i];\n      const from = nodeById.get(pipe.fromNode);\n      const to = nodeById.get(pipe.toNode);\n      if (!from || !to) return [];\n      return [\n        {\n          lng: (from.lng + to.lng) / 2,\n          lat: (from.lat + to.lat) / 2,\n          healthScore: s.score.score,\n        },\n      ];\n    });\n\n    const heatmap = aggregateHeatmap(points, { cellSize: this.cellSize });\n    const maintenance = prioritizeMaintenance(\n      scores.flatMap((s, i) => {\n        const pipe = this.dataset.pipes[i];\n        const from = nodeById.get(pipe.fromNode);\n        const to = nodeById.get(pipe.toNode);\n        if (!from || !to) return [];\n        return [\n          {\n            id: pipe.id,\n            healthScore: s.score.score,\n            lng: (from.lng + to.lng) / 2,\n            lat: (from.lat + to.lat) / 2,\n            label: pipe.id,\n          },\n        ];\n      })\n    );\n\n    const durationMs =\n      (typeof performance !== 'undefined' ? performance.now() : Date.now()) - t0;\n\n    const result: HealthResult = { scores, heatmap, maintenance, durationMs };\n    this.lastResult = result;\n    this.renderHeatmap(result);\n    for (const l of this.listeners) l(result);\n    return result;\n  }\n\n  /** 清空图层 */\n  clear(): void {\n    for (const id of this.layerIds) {\n      this.map.removeLayer(id);\n    }\n    this.layerIds = [];\n  }\n\n  /** 销毁 */\n  destroy(): void {\n    this.clear();\n    this.listeners.clear();\n    this.lastResult = null;\n  }\n\n  /** 订阅结果 */\n  onResult(fn: Listener): () => void {\n    this.listeners.add(fn);\n    return () => this.listeners.delete(fn);\n  }\n\n  /** 取最后一次结果 */\n  getLastResult(): HealthResult | null {\n    return this.lastResult;\n  }\n\n  private renderHeatmap(result: HealthResult): void {\n    this.clear();\n    const mlMap = (this.map as unknown as {\n      instance: {\n        addSource: (id: string, source: unknown) => void;\n        addLayer: (layer: unknown) => void;\n        getSource: (id: string) => unknown;\n      };\n    }).instance;\n    const data = heatmapToGeoJSON(result.heatmap);\n    const sourceId = `${this.layerPrefix}-heat-src`;\n    const layerId = `${this.layerPrefix}-heat-point`;\n    if (!mlMap.getSource(sourceId)) mlMap.addSource(sourceId, data);\n    try {\n      mlMap.addLayer({\n        id: layerId,\n        type: 'heatmap',\n        source: sourceId,\n        paint: {\n          'heatmap-weight': [\n            'interpolate',\n            ['linear'],\n            ['get', 'healthScore'],\n            0, 1,\n            50, 0.5,\n            100, 0,\n          ] as unknown,\n          'heatmap-intensity': 1,\n          'heatmap-color': [\n            'interpolate',\n            ['linear'],\n            ['heatmap-density'],\n            0, 'rgba(34,197,94,0)',\n            0.2, 'rgba(34,197,94,0.5)',\n            0.5, 'rgba(245,158,11,0.7)',\n            0.8, 'rgba(239,68,68,0.8)',\n            1, 'rgba(127,29,29,0.9)',\n          ] as unknown,\n          'heatmap-radius': 25,\n          'heatmap-opacity': 0.7,\n        },\n      });\n      this.layerIds.push(layerId);\n    } catch {\n      // ignore\n    }\n  }\n}\n"]}

package/dist/health/index.js

@@ -1,3 +1,3 @@
-export { DEFAULT_WEIGHTS, PipelineHealth, aggregateHeatmap, heatmapToGeoJSON, prioritizeMaintenance, scorePipeHealth, scorePipes } from '../chunk-VA2TQWL3.js';
+export { DEFAULT_WEIGHTS, PipelineHealth, aggregateHeatmap, heatmapToGeoJSON, prioritizeMaintenance, scorePipeHealth, scorePipes } from '../chunk-3656CGXE.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/index.cjs

@@ -1,5 +1,6 @@
 'use strict';
 
+var theme = require('@caoguo/theme');
 var maplibre = require('@caoguo/maplibre');
 
 // src/types/index.ts
@@ -11,8 +12,7 @@ var PIPELINE_TYPES = [
   "power",
   "telecom"
 ];
-
-// src/style/pipelineTheme.ts
+var INDUSTRY_PRIMARY = theme.INDUSTRY_META.pipeline.primary;
 var PIPELINE_TYPE_COLORS = {
   gas: "#f59e0b",
   // 琥珀（燃气）
@@ -645,12 +645,9 @@ function findUpstreamNode(adj, startPipeId, dataset, predicate) {
   if (!pipe) return null;
   const nodeById = new Map(dataset.nodes.map((n) => [n.id, n]));
   const startId = pipe.fromNode;
-  const startNode = nodeById.get(startId);
-  if (!startNode) return null;
-  const allowEdge = (e, _from, to) => {
-    const targetPipe = dataset.pipes.find((p) => p.id === e.pipeId);
-    if (!targetPipe) return false;
-    return true;
+  if (!nodeById.has(startId)) return null;
+  const allowEdge = (e, _from, _to) => {
+    return e.pipeId !== startPipeId;
   };
   const r = bfs(adj, startId, {
     allowEdge,
@@ -2069,10 +2066,10 @@ var PipelineHealth = class {
       const input = {
         installDate: p.properties?.installDate,
         material: p.properties?.material,
-        failureCount: void 0,
+        failureCount: p.properties?.failureCount ?? 0,
         pressure: p.properties?.pressure,
         ratedPressure: p.properties?.ratedPressure,
-        hasCathodicProtection: void 0,
+        hasCathodicProtection: p.properties?.hasCathodicProtection ?? false,
         status: p.properties?.status
       };
       return { pipeId: p.id, score: scorePipeHealth(input, weights) };
@@ -2296,24 +2293,53 @@ function buildDescription(intent, f) {
 // src/nlpg/pipelineNlpClass.ts
 var PipelineNlp = class {
   burstSimulator;
+  dataset;
   onIntent;
+  onBurst;
+  lastResult = null;
+  lastBurst = null;
   constructor(options = {}) {
     this.burstSimulator = options.burstSimulator;
+    this.dataset = options.dataset;
     this.onIntent = options.onIntent;
+    this.onBurst = options.onBurst;
   }
-  /** 解析并按意图触发动作 */
+  /** 解析并按意图触发动作（爆管意图自动联动推演） */
   query(text) {
     const result = parsePipelineQuery(text);
+    this.lastResult = result;
     if (this.onIntent) this.onIntent(result.intent, result);
+    if (result.intent === "burst" && this.burstSimulator) {
+      const pipeId = this.resolveBurstPipeId(text);
+      if (pipeId) {
+        this.lastBurst = this.burstSimulator.simulate(pipeId);
+        if (this.onBurst) this.onBurst(this.lastBurst);
+      }
+    }
     return result;
   }
   /** 仅解析不触发动作 */
   parse(text) {
     return parsePipelineQuery(text);
   }
-  /** 关联 BurstSimulator */
-  setBurstSimulator(sim) {
+  /** 关联 BurstSimulator 与数据集（联动推演用） */
+  setBurstSimulator(sim, dataset) {
     this.burstSimulator = sim;
+    if (dataset) this.dataset = dataset;
+  }
+  /** 取最近一次联动推演结果 */
+  getLastBurst() {
+    return this.lastBurst;
+  }
+  /**
+   * 从查询文本解析爆管管段 id。
+   * 优先匹配「pipe-xxx / 管段xxx」显式编号；否则回退到数据集首条管段。
+   */
+  resolveBurstPipeId(text) {
+    const m = text.match(/管段\s*([A-Za-z0-9_\-]+)|pipe[-\s]*([A-Za-z0-9_\-]+)/i);
+    if (m) return (m[1] ?? m[2]) || null;
+    if (this.dataset?.pipes?.length) return this.dataset.pipes[0].id;
+    return null;
   }
 };
 
@@ -2321,6 +2347,7 @@ exports.BurstSimulator = BurstSimulator;
 exports.DEFAULT_WEIGHTS = DEFAULT_WEIGHTS;
 exports.HEALTH_LEVEL_COLORS = HEALTH_LEVEL_COLORS;
 exports.HEALTH_LEVEL_LABELS = HEALTH_LEVEL_LABELS;
+exports.INDUSTRY_PRIMARY = INDUSTRY_PRIMARY;
 exports.LeakagePlume = LeakagePlume;
 exports.NODE_KIND_COLORS = NODE_KIND_COLORS;
 exports.NODE_KIND_ICONS = NODE_KIND_ICONS;