{"version":3,"sources":["jsdelivr-header.js","/npm/@tscircuit/routing@1.3.5/dist/index.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,ACNA,IAAI,SAAW,OAAO,OAClB,UAAY,OAAO,eACnB,iBAAmB,OAAO,yBAC1B,kBAAoB,OAAO,oBAC3B,aAAe,OAAO,eACtB,aAAe,OAAO,UAAU,eAChC,SAAW,CAAC,EAAQ,KACtB,IAAK,IAAI,KAAQ,EACf,UAAU,EAAQ,EAAM,CAAE,IAAK,EAAI,GAAO,YAAY,GAAO,EAE7D,YAAc,CAAC,EAAI,EAAM,EAAQ,KACnC,GAAI,GAAwB,iBAAT,GAAqC,mBAAT,EAC7C,IAAK,IAAI,KAAO,kBAAkB,GAC3B,aAAa,KAAK,EAAI,IAAQ,IAAQ,GACzC,UAAU,EAAI,EAAK,CAAE,IAAK,IAAM,EAAK,GAAM,aAAc,EAAO,iBAAiB,EAAM,KAAS,EAAK,aAE3G,OAAO,CAAE,EAEP,QAAU,CAAC,EAAK,EAAY,KAAY,EAAgB,MAAP,EAAc,SAAS,aAAa,IAAQ,CAAC,EAAG,aAKnG,GAAe,GAAQ,EAAI,WAA8E,EAAjE,UAAU,EAAQ,UAAW,CAAE,MAAO,EAAK,YAAY,IAC/F,IAEE,aAAgB,GAAQ,YAAY,UAAU,CAAC,EAAG,aAAc,CAAE,OAAO,IAAS,GAGlF,YAAc,CAAC,EACnB,SAAS,YAAa,CACpB,UAAW,IAAM,UACjB,mBAAoB,IAAM,mBAC1B,0BAA2B,IAAM,0BACjC,kCAAmC,IAAM,kCACzC,0BAA2B,IAAM,0BACjC,2BAA4B,IAAM,2BAClC,iBAAkB,IAAM,iBACxB,aAAc,IAAM,aACpB,2BAA4B,IAAM,6BAEpC,OAAO,QAAU,aAAa,aAG9B,IAAI,aAAe,EACjB,QACA,YACA,SAAS,MAET,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,OAAQ,IAAK,CACzC,MAAM,EAAW,EAAU,GACrB,EAAW,EAAS,OAAO,EAAI,EAAS,MAAQ,EAAI,EACpD,EAAY,EAAS,OAAO,EAAI,EAAS,MAAQ,EAAI,EACrD,EAAa,EAAS,OAAO,EAAI,EAAS,OAAS,EAAI,EACvD,EAAU,EAAS,OAAO,EAAI,EAAS,OAAS,EAAI,EAC1D,GAAI,EAAM,GAAK,GAAY,EAAM,GAAK,GAAa,EAAM,GAAK,GAAc,EAAM,GAAK,EACrF,OAAO,CAEX,CACA,OAAO,CAAK,EAIV,iBAAmB,CAAC,EAAI,IACnB,KAAK,KAAK,KAAK,IAAI,EAAG,EAAI,EAAG,EAAG,GAAK,KAAK,IAAI,EAAG,EAAI,EAAG,EAAG,IAIhE,GAAK,QAAQ,QAAQ,gBAGrB,wBAA2B,IAC7B,IAAI,EACJ,MAAO,CACL,GAAG,IAAoD,OAA/C,EAAa,MAAR,OAAe,EAAS,EAAK,eAAoB,EAAS,EAAG,aAAe,UAAU,OAAO,EAAG,QAAQ,EAAK,SAAS,EAAK,KAAO,KAAK,UAAU,EAAK,MAAQ,QACxK,EAAK,SAAS,KAAK,GAAU,wBAAwB,KAAQ,OAAO,KAAK,GAAS,UAAU,MAChG,EAEC,qBAAuB,EACzB,UACA,WACE,CAAC,KACH,MAAM,EAAO,CACX,KAAM,OACN,WAAY,KAAK,MACjB,KAAM,CAAC,EACP,SAAU,GAEZ,MAAc,IACZ,EAAK,KAAO,CAAI,EAElB,IAAW,KACT,EAAK,SAAW,KAAK,MACrB,EAAK,SAAW,EAAK,SAAW,EAAK,WACjC,GAAyB,SAAd,EAAK,MAClB,QAAQ,IAAI,wBAAwB,GAAM,KAAK,MACjD,EAEF,MAAc,IACZ,MAAM,EAAQ,uBAMd,OALI,GACF,QAAQ,IAAI,IAAI,KAClB,EAAM,KAAO,EACb,EAAM,QAAU,EAChB,EAAK,SAAS,KAAK,GACZ,CAAK,GAEd,OAAO,CAAI,EAIT,0BAA4B,EAC9B,kBACA,YACA,OACA,gBACA,UAGA,GADA,IAAQ,uBACuB,IAA3B,EAAgB,OAClB,MAAM,IAAI,MAAM,yCAClB,MAAO,EAAO,GAAO,EACf,EAA2B,IACxB,CACL,EAAG,KAAK,MAAM,EAAE,EAAI,EAAK,aAAe,EAAK,YAC7C,EAAG,KAAK,MAAM,EAAE,EAAI,EAAK,aAAe,EAAK,cAG3C,EAAc,EAAwB,CAC1C,EAAG,KAAK,IAAI,EAAM,EAAG,EAAI,GAAK,EAAK,YAAc,EAAK,eACtD,EAAG,KAAK,IAAI,EAAM,EAAG,EAAI,GAAK,EAAK,YAAc,EAAK,iBAElD,EAAkB,EAAwB,CAC9C,EAAG,KAAK,IAAI,EAAM,EAAG,EAAI,GAAK,EAAK,YAAc,EAAK,eACtD,EAAG,KAAK,IAAI,EAAM,EAAG,EAAI,GAAK,EAAK,YAAc,EAAK,iBAElD,EAAoB,KAAK,MAC5B,EAAgB,EAAI,EAAY,GAAK,EAAK,aAEvC,EAAqB,KAAK,MAC7B,EAAgB,EAAI,EAAY,GAAK,EAAK,aAEvC,EAAa,IAAI,GAAG,KAAK,EAAmB,GAC5C,EAAmB,IAAM,CAC7B,EAAG,KAAK,OAAO,EAAE,EAAI,EAAY,GAAK,EAAK,aAC3C,EAAG,KAAK,OAAO,EAAE,EAAI,EAAY,GAAK,EAAK,eAMvC,EAAY,EAAgB,GAC5B,EAAU,EAAgB,GAChC,EAAU,SAAS,IACjB,MAAM,EAAO,KAAK,OACf,EAAS,OAAO,EAAI,EAAS,MAAQ,EAAI,EAAY,GAAK,EAAK,aAE5D,EAAM,KAAK,OACd,EAAS,OAAO,EAAI,EAAS,OAAS,EAAI,EAAY,GAAK,EAAK,aAE7D,EAAQ,KAAK,MAAM,EAAS,MAAQ,EAAK,aACzC,EAAS,KAAK,MAAM,EAAS,OAAS,EAAK,aACjD,IAAK,IAAI,EAAI,EAAM,EAAI,EAAO,EAAO,IACnC,IAAK,IAAI,EAAI,EAAK,EAAI,EAAM,EAAQ,IAC9B,EAAI,GAAK,EAAI,GAAK,GAAK,GAAqB,GAAK,GAErD,EAAW,cAAc,EAAG,GAAG,EAEnC,IAEF,MAGM,EAHS,IAAI,GAAG,YAAY,CAChC,iBAAkB,GAAiB,EAAO,GAAG,iBAAiB,oBAAsB,GAAG,iBAAiB,QAEtF,SAClB,EAAU,EACV,EAAU,EACV,EAAQ,EACR,EAAQ,EACR,GAEF,GAAoB,IAAhB,EAAK,OACP,MAAO,CAAE,WAAW,GAEtB,MACM,EADgB,GAAG,KAAK,aAAa,GACZ,KAAI,EAAE,EAAG,MAAO,MArChB,CAC7B,GADuB,EAqCsC,CAAE,IAAG,MApC7D,EAAI,EAAK,YAAc,EAAY,EACxC,EAAG,EAAE,EAAI,EAAK,YAAc,EAAY,GAFlB,IAAC,CAqC+C,IAClE,EAAS,EAAS,QAAO,CAAC,EAAK,EAAG,KACtC,GAAU,IAAN,EACF,OAAO,EACT,MAAM,EAAO,EAAS,EAAI,GAC1B,OAAO,EAAM,KAAK,MAAM,EAAE,EAAI,EAAK,IAAM,GAAK,EAAE,EAAI,EAAK,IAAM,EAAE,GAChE,GAEH,OADA,EAAI,MACG,CACL,WAAW,EACX,OAAQ,EACR,SACA,MAAO,EACR,EAIC,qBAAuB,EACzB,OACA,cAAc,CAAE,EAAG,EAAG,EAAG,GACzB,WAAW,MAEP,IACF,EAAO,IACF,EACH,eAAgB,KAAK,IAAI,EAAG,KAAK,MAAM,EAAK,eAAiB,IAC7D,YAAa,EAAK,YAAc,IAiBpC,MAAO,CACL,wBAf+B,IACxB,CACL,EAAG,KAAK,MAAM,EAAE,EAAI,EAAK,aAAe,EAAK,YAC7C,EAAG,KAAK,MAAM,EAAE,EAAI,EAAK,aAAe,EAAK,cAa/C,gBAVuB,IAAM,CAC7B,EAAG,KAAK,OAAO,EAAE,EAAI,EAAY,GAAK,EAAK,aAC3C,EAAG,KAAK,OAAO,EAAE,EAAI,EAAY,GAAK,EAAK,eAS3C,gBAPuB,IAAM,CAC7B,EAAG,EAAE,EAAI,EAAK,YAAc,EAAY,EACxC,EAAG,EAAE,EAAI,EAAK,YAAc,EAAY,IAMxC,gBAAiB,EAClB,EAIC,0BAA4B,EAC9B,QACA,YACA,OACA,gBACA,mBACA,gBACA,UAEA,IAAQ,uBACR,MAAM,wBAAE,GAA4B,qBAAqB,CAAE,SACrD,EAAe,GACf,EAAsC,EAAnB,EACzB,IAAK,MAAO,EAAI,EAAI,EAAI,IAAO,CAC7B,EAAE,GAAI,EAAG,EAAG,GACZ,CAAC,GAAI,EAAG,EAAG,GACX,CAAC,EAAG,GAAI,EAAG,GACX,EAAE,EAAG,EAAG,GAAI,IAEZ,IAAK,IAAI,EAAI,EAAG,EAAI,EAAkB,GAAK,EAAK,YAAa,CAC3D,MAAM,EAAK,EAAwB,CACjC,EAAG,EAAM,EAAI,EAAK,EAAmB,EAAK,EAC1C,EAAG,EAAM,EAAI,EAAK,EAAmB,EAAK,IAExC,aAAa,CAAE,MAAO,EAAI,YAAW,OAAQ,EAAK,eAGtD,EAAa,KAAK,IACb,EACH,eAAgB,KAAK,MAClB,EAAG,EAAI,EAAc,IAAM,GAAK,EAAG,EAAI,EAAc,IAAM,IAGlE,CAEF,GAA4B,IAAxB,EAAa,OACf,MAAO,GAET,MAAM,EAAyB,CAAC,CAAC,EAAa,KAC9C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAa,OAAQ,IAAK,CAC5C,MAAM,EAAI,EAAa,EAAI,GACrB,EAAI,EAAa,GACvB,GAAI,EAAuB,EAAuB,OAAS,GAAG,OAAS,EAAa,OAAS,EAAG,CAC9F,EAAuB,KAAK,CAAC,IAC7B,QACF,CACA,MAAM,EAAS,0BAA0B,CACvC,gBAAiB,CAAC,EAAG,GACrB,OACA,eAEuB,IAArB,EAAO,WAAsB,EAAO,OAA4B,EAAnB,EAAK,YACpD,EAAuB,EAAuB,OAAS,GAAG,KAAK,GAE/D,EAAuB,KAAK,CAAC,GAEjC,CACA,MAAM,EAAsB,EAAuB,KAAK,GAC/C,EAAc,QACnB,CAAC,EAAS,IACD,EAAY,eAAiB,EAAQ,eAAiB,EAAc,GAE7E,CAAE,EAAG,EAAG,EAAG,EAAG,eAAgB,QAGlC,EAAoB,MAAK,CAAC,EAAG,IAAM,EAAE,eAAiB,EAAE,iBACxD,MAAM,EAAc,GACpB,IAAK,MAAM,KAAe,EAAqB,CAC7C,MAAM,EAAS,0BAA0B,CACvC,gBAAiB,CAAC,EAAO,GACzB,YACA,OACA,mBAEuB,IAArB,EAAO,WACT,EAAY,KAAK,IACZ,EACH,aAAc,GAGpB,CAEA,OADA,EAAI,MACG,CAAW,EAIhB,UAAY,CAAC,EAAG,EAAG,EAAG,GAAI,IAC1B,kCAAoC,EACtC,kBACA,YACA,OACA,gBACA,UAGA,GADA,IAAQ,uBACuB,IAA3B,EAAgB,OAClB,MAAM,IAAI,MAAM,yCAClB,MAAO,EAAO,GAAO,EACf,EAAU,KAAK,IAAI,KAAK,IAAI,EAAM,EAAI,EAAI,GAAI,KAAK,IAAI,EAAM,EAAI,EAAI,IAC3E,IAAK,MAAM,KAAY,UAAW,CAChC,GAAI,EAAK,YAAc,EAAW,EAAU,EAC1C,SAEF,GADyB,KAAK,IAAI,KAAK,IAAI,EAAM,EAAI,EAAI,GAAI,KAAK,IAAI,EAAM,EAAI,EAAI,KAAO,EAAK,YAAc,GACvF,EAAK,0BAC1B,SACF,MAAM,gBAAE,GAAoB,qBAAqB,CAAE,OAAM,aACnD,EAAS,0BAA0B,CACvC,gBAAiB,CAAC,EAAO,GACzB,YACA,KAAM,IAER,GAAI,EAAO,WAA0B,IAAb,EAAgB,CACtC,MAAM,EAAc,EAAO,OAAO,GAC5B,EAAY,0BAA0B,CAC1C,gBAAiB,CAAC,EAAO,GACzB,YACA,OACA,kBAEI,EAAY,EAAO,OAAO,EAAO,OAAO,OAAS,GACjD,EAAU,0BAA0B,CACxC,gBAAiB,CAAC,EAAW,GAC7B,YACA,OACA,kBAEF,GAAI,EAAU,WAAa,EAAQ,UAEjC,OADA,EAAI,MACG,CACL,WAAW,EACX,OAAQ,IACH,EAAU,UACV,EAAO,OAAO,MAAM,GAAI,MACxB,EAAQ,QAGb,OAAQ,EAAU,OAAS,EAAO,OAAS,iBAAiB,EAAO,OAAO,GAAI,EAAO,OAAO,IAAM,oBAAoB,EAAO,OAAO,OAAO,IAAM,EAAQ,OACzJ,MAAO,EAAU,MAGvB,CACA,GAAiB,IAAb,EAEF,OADA,EAAI,MACG,CAEX,CAGA,OAFA,EAAI,KAAK,WAAY,EACrB,EAAI,MACG,CAAE,WAAW,EAAO,EAIzB,0BAA4B,EAC9B,kBACA,YACA,OACA,gBACA,QACA,UAGA,GADA,IAAQ,uBACuB,IAA3B,EAAgB,OAClB,MAAM,IAAI,MAAM,yCAClB,EAAQ,GAAS,EACjB,IAAK,EAAG,GAAK,EACb,MAAM,EAAmB,KAAK,IAAI,KAAK,IAAI,EAAE,EAAI,EAAE,GAAI,KAAK,IAAI,EAAE,EAAI,EAAE,IAAM,EAAK,YACnF,GAAI,GAAoB,EAAK,0BAA2B,CACtD,MAAM,EAAY,0BAA0B,CAC1C,kBACA,YACA,OACA,gBACA,IAAK,EAAI,MAAM,uBAGjB,OADA,EAAI,MACG,CACT,CACA,MAAM,EAAiB,kCAAkC,CACvD,kBACA,YACA,OACA,gBACA,IAAK,EAAI,MAAM,gCAEjB,GAAI,EAAe,UAEjB,OADA,EAAI,MACG,EAET,GAAI,EAAQ,EAGV,OAFA,EAAI,KAAK,WAAY,EACrB,EAAI,MACG,CAAE,WAAW,EAAO,QAAS,qBAEtC,MAAM,EAAmB,KAAK,IAC5B,EAAK,YAAc,EAAK,2BACvB,EAAmB,EAAI,GAAK,EAAK,aAE9B,EAAM,0BAA0B,CACpC,MAAO,EACP,YACA,OACA,mBACA,cAAe,EACf,gBACA,IAAK,EAAI,MAAM,2BAEX,EAAM,0BAA0B,CACpC,MAAO,EACP,YACA,OACA,mBACA,cAAe,EACf,gBACA,IAAK,EAAI,MAAM,2BAEX,EAAS,GACT,EAAS,EAAI,MACjB,+BAA+B,EAAI,OAAS,EAAI,QAElD,IAAK,IAAI,EAAO,EAAG,EAAO,EAAI,OAAQ,IAAQ,CAC5C,MAAM,EAAM,EAAI,GAChB,IAAK,IAAI,EAAO,EAAG,EAAO,EAAI,OAAQ,IAAQ,CAC5C,MAAM,EAAM,EAAI,GACV,EAAc,0BAA0B,CAC5C,gBAAiB,CAAC,EAAI,aAAc,EAAI,cACxC,YACA,OACA,MAAO,EAAQ,EACf,gBACA,IAAK,EAAO,MACV,gBAAgB,EAAO,KAAK,EAAO,KAAK,EAAI,UAAU,EAAI,YAG9D,IAA8B,IAA1B,EAAY,UACd,SACF,MAAM,EAAY,CAChB,OAAQ,IACH,EAAI,UACJ,EAAY,UACZ,IAAI,EAAI,QAAQ,WAGrB,OAAQ,EAAI,OAAS,EAAY,OAAS,EAAI,OAC9C,WAAW,EACX,MAAO,EAAI,OAEb,EAAO,KAAK,EACd,CACF,CAEA,OADA,EAAO,MACe,IAAlB,EAAO,QACT,EAAI,KAAK,WAAY,EACrB,EAAI,MACG,CAAE,WAAW,KAEtB,EAAI,MACG,EAAO,QAAO,CAAC,EAAG,IAAM,EAAE,OAAS,EAAE,OAAS,EAAI,IAAE,EAIzD,UAAY,EACd,kBACA,YACA,OACA,oBAEA,EAAgB,MAAK,CAAC,EAAG,IACT,KAAK,KAAK,EAAE,GAAK,EAAI,EAAE,GAAK,GAC5B,KAAK,KAAK,EAAE,GAAK,EAAI,EAAE,GAAK,KAG5C,IAAI,GAAY,EACZ,EAAS,GACT,EAAc,EAClB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAgB,OAAS,EAAG,IAAK,CACnD,MAAM,EAAS,EAAgB,GACzB,EAAS,EAAgB,EAAI,GAC7B,EAAa,0BAA0B,CAC3C,gBAAiB,CAAC,EAAQ,GAC1B,YACA,OACA,kBAEF,KAAI,cAAe,KAAc,EAAW,UAK1C,MAAO,CAAE,WAAW,GAJpB,GAAY,EACZ,EAAS,IAAI,KAAW,EAAW,QACnC,GAAe,EAAW,MAI9B,CACA,OAAO,EAAY,CAAE,SAAQ,OAAQ,EAAa,MAAO,EAAG,WAAW,GAAS,CAAE,WAAW,EAAO,EAIlG,wBAA2B,IAC7B,GAAI,EAAO,QAAU,EACnB,OAAO,EACT,MAAM,EAAY,CAAC,EAAO,IAC1B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAS,EAAG,IAAK,CAC1C,MAAM,EAAI,EAAU,EAAU,OAAS,GACjC,EAAI,EAAO,GACX,EAAI,EAAO,EAAI,GACjB,EAAE,IAAM,EAAE,GAAK,EAAE,IAAM,EAAE,IAGzB,EAAE,IAAM,EAAE,GAAK,EAAE,IAAM,EAAE,GAG7B,EAAU,KAAK,GACjB,CAEA,OADA,EAAU,KAAK,EAAO,EAAO,OAAS,IAC/B,CAAS,EAId,uBAA0B,IAC5B,MAAM,UAAE,EAAS,OAAE,EAAS,GAAM,EAClC,IAAI,GAAE,EAAE,GAAE,EAAE,GAAE,EAAE,GAAE,EAAE,OAAE,GAAW,EACjC,MAAM,EAAW,CAAC,EAAK,EAAK,EAAK,EAAK,EAAM,EAAO,EAAQ,KACzD,IAAI,EAAK,EAAG,EAAK,EAAG,EAAK,EAAM,EAAK,EAAK,EAAM,EAC/C,MAAM,EAAI,EAAE,EAAI,GAAK,EAAI,GACnB,EAAI,CAAC,EAAM,EAAM,EAAQ,EAAK,EAAM,EAAQ,EAAM,GACxD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACrB,GAAa,IAAT,EAAE,IACJ,GAAI,EAAE,GAAK,EACT,OAAO,MACJ,CACL,MAAM,EAAI,EAAE,GAAK,EAAE,GACf,EAAE,GAAK,GAAK,EAAK,EACnB,EAAK,EACE,EAAE,GAAK,GAAK,EAAK,IACxB,EAAK,EACT,CAEF,OAAO,GAAM,CAAE,EAEjB,IAAe,MAAV,OAAiB,EAAS,EAAO,QAAU,EAC9C,OAAO,uBAAuB,CAC5B,OAAQ,EAAO,MAAM,EAAG,GACxB,YACA,YACI,uBAAuB,CAC3B,OAAQ,EAAO,MAAM,GACrB,YACA,WAGA,IACF,EAAK,EAAO,GAAG,EACf,EAAK,EAAO,GAAG,EACf,EAAK,EAAO,GAAG,EACf,EAAK,EAAO,GAAG,GAEjB,IAAK,MAAM,KAAY,EAAW,CAKhC,GAAI,EAAS,EAAI,EAAI,EAAI,EAJR,EAAS,OAAO,EAAI,EAAS,MAAQ,EAAI,EACxC,EAAS,OAAO,EAAI,EAAS,MAAQ,EAAI,EACxC,EAAS,OAAO,EAAI,EAAS,OAAS,EAAI,EAC7C,EAAS,OAAO,EAAI,EAAS,OAAS,EAAI,GAExD,OAAO,CAEX,CACA,OAAO,CAAK,EAIV,2BAA6B,CAAC,EAAG,IACX,UAApB,EAAE,cACG,EAAE,EAAI,EAAE,EACO,SAApB,EAAE,cACG,EAAE,EAAI,EAAE,EACO,OAApB,EAAE,cACG,EAAE,EAAI,EAAE,EACO,SAApB,EAAE,eACG,EAAE,EAAI,EAAE,EAGf,sBAAwB,CAAC,EAAG,EAAG,IAAM,EAAE,IAAM,EAAE,EAAI,CAAE,EAAG,EAAE,EAAG,EAAG,EAAE,GAAM,CAC1E,EAAG,EAAE,EACL,EAAG,EAAE,GAEH,uBAAyB,EAC3B,SACA,YACA,UAGA,GADA,IAAQ,uBACJ,EAAO,QAAU,EAEnB,OADA,EAAI,MACG,EAET,IAAI,EAAY,CAAC,EAAO,GAAI,EAAO,IACnC,GAAI,EAAO,GAAG,cAAe,CAC3B,MAAO,EAAG,EAAG,GAAK,EAClB,IAAK,2BAA2B,EAAG,GAAI,CACrC,MAAM,EAAkB,sBAAsB,EAAG,EAAG,GAChD,2BAA2B,EAAG,KAAqB,uBAAuB,CAAE,YAAW,OAAQ,CAAC,EAAG,EAAiB,OACtH,EAAY,CAAC,EAAG,GAEpB,CACF,CACA,GAAI,EAAO,EAAO,OAAS,GAAG,cAAe,CAC3C,MAAO,EAAG,EAAG,GAAK,EAAO,OAAO,GAChC,IAAK,2BAA2B,EAAG,GAAI,CACrC,MAAM,EAAsB,sBAAsB,EAAG,EAAG,GACpD,2BAA2B,EAAG,KAAyB,uBAAuB,CAChF,YACA,OAAQ,CAAC,EAAG,EAAqB,OAEjC,EAAO,EAAO,OAAS,GAAK,EAEhC,CACF,CACA,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAS,EAAG,IAAK,CAC1C,MAAM,EAAI,EAAU,EAAI,GAClB,EAAI,EAAU,GACd,EAAI,EAAO,EAAI,GACf,EAAI,EAAO,EAAI,GACrB,GAAI,EAAE,IAAM,EAAE,GAAK,EAAE,IAAM,EAAE,EAAG,CAC9B,EAAU,KAAK,GACf,QACF,CACA,GAAI,EAAE,IAAM,EAAE,GAAK,EAAE,IAAM,EAAE,EAAG,CAC9B,EAAU,KAAK,GACf,QACF,CACA,MAAM,EAAQ,sBAAsB,EAAG,EAAG,IACjB,uBAAuB,CAC9C,YACA,OAAQ,CAAC,EAAG,EAAO,KAGnB,EAAU,KAAK,GAEf,EAAU,KAAK,EAEnB,CAGA,OAFA,EAAU,QAAQ,EAAO,OAAO,IAChC,EAAI,MACG,CAAS,EAId,2BAA6B,EAC/B,OACA,YACA,kBACA,UAEA,IAAQ,uBACR,MAAM,EAAQ,0BAA0B,CACtC,OACA,YACA,kBACA,eAAe,EACf,QAEF,IAAK,EAAM,UACT,MAAO,CAAE,WAAW,GACtB,IAAK,MAAM,KAAkB,EAAiB,CAC5C,IAAK,EAAe,cAClB,SACmB,EAAM,OAAO,QAChC,CAAC,EAAS,KACR,MAAM,EAAO,KAAK,MAChB,EAAM,EAAI,EAAe,EACzB,EAAM,EAAI,EAAe,GAE3B,OAAI,EAAO,EAAQ,KACV,CAAE,QAAO,QACX,CAAO,GAEhB,CAAE,MAAO,EAAM,OAAO,GAAI,KAAM,MAChC,MACW,cAAgB,EAAe,aAC9C,CACA,IAAI,EAAc,EAAM,OACxB,MAAM,EAAS,EAAI,MAAM,4BAEzB,OAAa,CACX,EACA,IAAI,EAAY,uBAAuB,CACrC,OAAQ,EACR,cAIF,GADA,EAAY,wBAAwB,GAChC,EAAU,SAAW,EAAY,OACnC,MAEA,EAAc,CAElB,CAEA,OADA,EAAO,MACA,IACF,EACH,OAAQ,EACT,EAIC,mBAAqB,EACvB,kBACA,YACA,OACA,UAEA,IAAQ,uBACR,EAAgB,MAAK,CAAC,EAAG,IACT,KAAK,KAAK,EAAE,GAAK,EAAI,EAAE,GAAK,GAC5B,KAAK,KAAK,EAAE,GAAK,EAAI,EAAE,GAAK,KAG5C,IAAI,GAAY,EACZ,EAAS,GACT,EAAc,EAClB,MAAM,EAAS,EAAI,MAAM,GAAG,EAAgB,2BAC5C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAgB,OAAS,EAAG,IAAK,CACnD,MAAM,EAAS,EAAgB,GACzB,EAAS,EAAgB,EAAI,GAC7B,EAAa,2BAA2B,CAC5C,gBAAiB,CAAC,EAAQ,GAC1B,YACA,OACA,eAAe,EACf,IAAK,IAEP,KAAI,cAAe,KAAc,EAAW,UAK1C,MAAO,CAAE,WAAW,GAJpB,GAAY,EACZ,EAAS,IAAI,KAAW,EAAW,QACnC,GAAe,EAAW,MAI9B,CAGA,OAFA,EAAO,MACP,EAAI,MACG,EAAY,CAAE,SAAQ,OAAQ,EAAa,MAAO,EAAG,WAAW,GAAS,CAAE,WAAW,EAAO,EAIlG,2BAA6B,CAAC,EAAQ,KACxC,MAAM,gBAAE,EAAe,UAAE,GAAc,GACjC,OAAE,EAAS,EAAO,KAAK,aAAgB,GAAQ,CAAC,EAChD,EAAkC,EAAgB,KAAK,IAC3D,MAAM,EAAW,IAAK,GACtB,IAAK,MAAM,KAAY,EACrB,GAAI,aAAa,CAAE,MAAO,EAAU,UAAW,CAAC,GAAW,WAAW,CACpE,MAAM,OAAE,EAAM,MAAE,EAAK,OAAE,GAAW,EAClC,IAAI,EAAM,KAAK,KAAK,EAAS,EAAI,EAAO,GACpC,EAAM,KAAK,KAAK,EAAS,EAAI,EAAO,GAC5B,IAAR,IACF,EAAM,GACI,IAAR,IACF,EAAM,GACR,MAAM,EAAS,EAAO,EAAI,EAAQ,EAAI,EAChC,EAAS,EAAO,EAAI,EAAS,EAAI,EACjC,EAAU,KAAK,IAAI,EAAS,EAAI,GACtB,KAAK,IAAI,EAAS,EAAI,GACH,EAEjC,EAAS,EAAI,EAAS,EAAS,EAE/B,EAAS,EAAI,EAAS,EAAS,CAEnC,CAEF,OAAO,CAAQ,IAEjB,MAAO,IACF,EACH,gBAAiB,EAClB","file":"/npm/@tscircuit/routing@1.3.5/dist/index.js","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/@tscircuit/routing@1.3.5/dist/index.js\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","var __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __export = (target, all) => {\n  for (var name in all)\n    __defProp(target, name, { get: all[name], enumerable: true });\n};\nvar __copyProps = (to, from, except, desc) => {\n  if (from && typeof from === \"object\" || typeof from === \"function\") {\n    for (let key of __getOwnPropNames(from))\n      if (!__hasOwnProp.call(to, key) && key !== except)\n        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });\n  }\n  return to;\n};\nvar __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(\n  // If the importer is in node compatibility mode or this is not an ESM\n  // file that has been converted to a CommonJS file using a Babel-\n  // compatible transform (i.e. \"__esModule\" has not been set), then set\n  // \"default\" to the CommonJS \"module.exports\" for node compatibility.\n  isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: true }) : target,\n  mod\n));\nvar __toCommonJS = (mod) => __copyProps(__defProp({}, \"__esModule\", { value: true }), mod);\n\n// src/index.ts\nvar src_exports = {};\n__export(src_exports, {\n  findRoute: () => findRoute,\n  findSchematicRoute: () => findSchematicRoute,\n  findTwoPointGranularRoute: () => findTwoPointGranularRoute,\n  findTwoPointMixedGranularityRoute: () => findTwoPointMixedGranularityRoute,\n  findTwoPointNearBiasRoute: () => findTwoPointNearBiasRoute,\n  findTwoPointSchematicRoute: () => findTwoPointSchematicRoute,\n  getPointDistance: () => getPointDistance,\n  isInObstacle: () => isInObstacle,\n  movePointsOutsideObstacles: () => movePointsOutsideObstacles\n});\nmodule.exports = __toCommonJS(src_exports);\n\n// src/lib/is-in-obstacle.ts\nvar isInObstacle = ({\n  point,\n  obstacles,\n  margin = 0\n}) => {\n  for (let i = 0; i < obstacles.length; i++) {\n    const obstacle = obstacles[i];\n    const leftEdge = obstacle.center.x - obstacle.width / 2 - margin;\n    const rightEdge = obstacle.center.x + obstacle.width / 2 + margin;\n    const bottomEdge = obstacle.center.y - obstacle.height / 2 - margin;\n    const topEdge = obstacle.center.y + obstacle.height / 2 + margin;\n    if (point.x >= leftEdge && point.x <= rightEdge && point.y >= bottomEdge && point.y <= topEdge) {\n      return true;\n    }\n  }\n  return false;\n};\n\n// src/lib/get-point-distance.ts\nvar getPointDistance = (p1, p2) => {\n  return Math.sqrt(Math.pow(p1.x - p2.x, 2) + Math.pow(p1.y - p2.y, 2));\n};\n\n// src/lib/find-two-point-granular-route.ts\nvar PF = __toESM(require(\"pathfinding\"));\n\n// src/lib/logging/log-context.ts\nvar getStringifiedTreeLines = (tree) => {\n  var _a;\n  return [\n    `${`${((_a = tree == null ? void 0 : tree.duration) == null ? void 0 : _a.toString()) ?? \"???\"}ms`.padEnd(6, \" \")} ${tree.name}  ${tree.info ? JSON.stringify(tree.info) : \"\"}`,\n    ...tree.children.map((child) => getStringifiedTreeLines(child)).flat().map((line) => `       ${line}`)\n  ];\n};\nvar createLogContextTree = ({\n  loudEnd,\n  verbose\n} = {}) => {\n  const tree = {\n    name: \"root\",\n    start_time: Date.now(),\n    info: {},\n    children: []\n  };\n  tree.start = (info) => {\n    tree.info = info;\n  };\n  tree.end = () => {\n    tree.end_time = Date.now();\n    tree.duration = tree.end_time - tree.start_time;\n    if (loudEnd && tree.name === \"root\") {\n      console.log(getStringifiedTreeLines(tree).join(\"\\n\"));\n    }\n  };\n  tree.child = (name) => {\n    const child = createLogContextTree();\n    if (verbose)\n      console.log(`>${name}`);\n    child.name = name;\n    child.verbose = verbose;\n    tree.children.push(child);\n    return child;\n  };\n  return tree;\n};\n\n// src/lib/find-two-point-granular-route.ts\nvar findTwoPointGranularRoute = ({\n  pointsToConnect,\n  obstacles,\n  grid,\n  allowDiagonal,\n  log\n}) => {\n  log ??= createLogContextTree();\n  if (pointsToConnect.length !== 2)\n    throw new Error(\"Must supply exactly 2 pointsToConnect\");\n  const [start, end] = pointsToConnect;\n  const roundToNearestGridPoint = (p) => {\n    return {\n      x: Math.round(p.x / grid.segmentSize) * grid.segmentSize,\n      y: Math.round(p.y / grid.segmentSize) * grid.segmentSize\n    };\n  };\n  const gridTopLeft = roundToNearestGridPoint({\n    x: Math.min(start.x, end.x) - grid.segmentSize * grid.marginSegments,\n    y: Math.min(start.y, end.y) - grid.segmentSize * grid.marginSegments\n  });\n  const gridBottomRight = roundToNearestGridPoint({\n    x: Math.max(start.x, end.x) + grid.segmentSize * grid.marginSegments,\n    y: Math.max(start.y, end.y) + grid.segmentSize * grid.marginSegments\n  });\n  const gridWidthSegments = Math.ceil(\n    (gridBottomRight.x - gridTopLeft.x) / grid.segmentSize\n  );\n  const gridHeightSegments = Math.ceil(\n    (gridBottomRight.y - gridTopLeft.y) / grid.segmentSize\n  );\n  const gridMatrix = new PF.Grid(gridWidthSegments, gridHeightSegments);\n  const realToNodeSpace = (p) => ({\n    x: Math.round((p.x - gridTopLeft.x) / grid.segmentSize),\n    y: Math.round((p.y - gridTopLeft.y) / grid.segmentSize)\n  });\n  const nodeToRealSpace = (p) => ({\n    x: p.x * grid.segmentSize + gridTopLeft.x,\n    y: p.y * grid.segmentSize + gridTopLeft.y\n  });\n  const startNode = realToNodeSpace(start);\n  const endNode = realToNodeSpace(end);\n  obstacles.forEach((obstacle) => {\n    const left = Math.round(\n      (obstacle.center.x - obstacle.width / 2 - gridTopLeft.x) / grid.segmentSize\n    );\n    const top = Math.round(\n      (obstacle.center.y - obstacle.height / 2 - gridTopLeft.y) / grid.segmentSize\n    );\n    const width = Math.round(obstacle.width / grid.segmentSize);\n    const height = Math.round(obstacle.height / grid.segmentSize);\n    for (let x = left; x < left + width; x++) {\n      for (let y = top; y < top + height; y++) {\n        if (x < 0 || y < 0 || x >= gridWidthSegments || y >= gridHeightSegments)\n          continue;\n        gridMatrix.setWalkableAt(x, y, false);\n      }\n    }\n  });\n  const finder = new PF.AStarFinder({\n    diagonalMovement: allowDiagonal ?? true ? PF.DiagonalMovement.OnlyWhenNoObstacles : PF.DiagonalMovement.Never\n  });\n  const path = finder.findPath(\n    startNode.x,\n    startNode.y,\n    endNode.x,\n    endNode.y,\n    gridMatrix\n  );\n  if (path.length === 0) {\n    return { pathFound: false };\n  }\n  const optimizedPath = PF.Util.compressPath(path);\n  const realPath = optimizedPath.map(([x, y]) => nodeToRealSpace({ x, y }));\n  const length = realPath.reduce((acc, p, i) => {\n    if (i === 0)\n      return acc;\n    const prev = realPath[i - 1];\n    return acc + Math.sqrt((p.x - prev.x) ** 2 + (p.y - prev.y) ** 2);\n  }, 0);\n  log.end();\n  return {\n    pathFound: true,\n    points: realPath,\n    length,\n    width: 1\n  };\n};\n\n// src/lib/compute-grid-transform.ts\nvar computeGridTransform = ({\n  grid,\n  gridTopLeft = { x: 0, y: 0 },\n  multiple = 1\n}) => {\n  if (multiple) {\n    grid = {\n      ...grid,\n      marginSegments: Math.max(1, Math.floor(grid.marginSegments / multiple)),\n      segmentSize: grid.segmentSize * multiple\n    };\n  }\n  const roundToNearestGridPoint = (p) => {\n    return {\n      x: Math.round(p.x / grid.segmentSize) * grid.segmentSize,\n      y: Math.round(p.y / grid.segmentSize) * grid.segmentSize\n    };\n  };\n  const realToNodeSpace = (p) => ({\n    x: Math.round((p.x - gridTopLeft.x) / grid.segmentSize),\n    y: Math.round((p.y - gridTopLeft.y) / grid.segmentSize)\n  });\n  const nodeToRealSpace = (p) => ({\n    x: p.x * grid.segmentSize + gridTopLeft.x,\n    y: p.y * grid.segmentSize + gridTopLeft.y\n  });\n  return {\n    roundToNearestGridPoint,\n    realToNodeSpace,\n    nodeToRealSpace,\n    transformedGrid: grid\n  };\n};\n\n// src/lib/find-best-border-target-paths.ts\nvar findBestBorderTargetPaths = ({\n  point,\n  obstacles,\n  grid,\n  distantTarget,\n  distanceToBorder,\n  allowDiagonal,\n  log\n}) => {\n  log ??= createLogContextTree();\n  const { roundToNearestGridPoint } = computeGridTransform({ grid });\n  const borderPoints = [];\n  const borderSideLength = distanceToBorder * 2;\n  for (const [xs, ys, xd, yd] of [\n    [-1, -1, 1, 0],\n    [1, -1, 0, 1],\n    [1, 1, -1, 0],\n    [-1, 1, 0, -1]\n  ]) {\n    for (let d = 0; d < borderSideLength; d += grid.segmentSize) {\n      const bp = roundToNearestGridPoint({\n        x: point.x + xs * distanceToBorder + xd * d,\n        y: point.y + ys * distanceToBorder + yd * d\n      });\n      if (isInObstacle({ point: bp, obstacles, margin: grid.segmentSize })) {\n        continue;\n      }\n      borderPoints.push({\n        ...bp,\n        targetDistance: Math.sqrt(\n          (bp.x - distantTarget.x) ** 2 + (bp.y - distantTarget.y) ** 2\n        )\n      });\n    }\n  }\n  if (borderPoints.length === 0) {\n    return [];\n  }\n  const contiguousBorderPoints = [[borderPoints[0]]];\n  for (let i = 1; i < borderPoints.length; i++) {\n    const A = borderPoints[i - 1];\n    const B = borderPoints[i];\n    if (contiguousBorderPoints[contiguousBorderPoints.length - 1].length > borderPoints.length - 2) {\n      contiguousBorderPoints.push([B]);\n      continue;\n    }\n    const result = findTwoPointGranularRoute({\n      pointsToConnect: [A, B],\n      grid,\n      obstacles\n    });\n    if (result.pathFound === true && result.length < grid.segmentSize * 2) {\n      contiguousBorderPoints[contiguousBorderPoints.length - 1].push(B);\n    } else {\n      contiguousBorderPoints.push([B]);\n    }\n  }\n  const closestBorderPoints = contiguousBorderPoints.map((borderPoints2) => {\n    return borderPoints2.reduce(\n      (closest, borderPoint) => {\n        return borderPoint.targetDistance < closest.targetDistance ? borderPoint : closest;\n      },\n      { x: 0, y: 0, targetDistance: Infinity }\n    );\n  });\n  closestBorderPoints.sort((a, b) => a.targetDistance - b.targetDistance);\n  const resultPaths = [];\n  for (const borderPoint of closestBorderPoints) {\n    const result = findTwoPointGranularRoute({\n      pointsToConnect: [point, borderPoint],\n      obstacles,\n      grid,\n      allowDiagonal\n    });\n    if (result.pathFound === true) {\n      resultPaths.push({\n        ...result,\n        borderTarget: borderPoint\n      });\n    }\n  }\n  log.end();\n  return resultPaths;\n};\n\n// src/lib/find-two-point-mixed-granularity-route.ts\nvar MULTIPLES = [1, 2, 5, 10, 20];\nvar findTwoPointMixedGranularityRoute = ({\n  pointsToConnect,\n  obstacles,\n  grid,\n  allowDiagonal,\n  log\n}) => {\n  log ??= createLogContextTree();\n  if (pointsToConnect.length !== 2)\n    throw new Error(\"Must supply exactly 2 pointsToConnect\");\n  const [start, end] = pointsToConnect;\n  const maxDist = Math.max(Math.abs(start.x - end.x), Math.abs(start.y - end.y));\n  for (const multiple of MULTIPLES) {\n    if (grid.segmentSize * multiple > maxDist / 4)\n      continue;\n    const remainingSegDist = Math.max(Math.abs(start.x - end.x), Math.abs(start.y - end.y)) / (grid.segmentSize * multiple);\n    if (remainingSegDist > grid.maxGranularSearchSegments)\n      continue;\n    const { transformedGrid } = computeGridTransform({ grid, multiple });\n    const result = findTwoPointGranularRoute({\n      pointsToConnect: [start, end],\n      obstacles,\n      grid: transformedGrid\n    });\n    if (result.pathFound && multiple !== 1) {\n      const startMiddle = result.points[1];\n      const startPath = findTwoPointGranularRoute({\n        pointsToConnect: [start, startMiddle],\n        obstacles,\n        grid,\n        allowDiagonal\n      });\n      const middleEnd = result.points[result.points.length - 2];\n      const endPath = findTwoPointGranularRoute({\n        pointsToConnect: [middleEnd, end],\n        obstacles,\n        grid,\n        allowDiagonal\n      });\n      if (startPath.pathFound && endPath.pathFound) {\n        log.end();\n        return {\n          pathFound: true,\n          points: [\n            ...startPath.points,\n            ...result.points.slice(1, -1),\n            ...endPath.points\n          ],\n          // TODO result.length needs to be computed for slice\n          length: startPath.length + result.length - getPointDistance(result.points[0], result.points[1]) - getPointDistance(...result.points.slice(-2)) + endPath.length,\n          width: startPath.width\n        };\n      }\n    }\n    if (multiple === 1) {\n      log.end();\n      return result;\n    }\n  }\n  log.info.not_found = true;\n  log.end();\n  return { pathFound: false };\n};\n\n// src/lib/find-two-point-near-bias-route.ts\nvar findTwoPointNearBiasRoute = ({\n  pointsToConnect,\n  obstacles,\n  grid,\n  allowDiagonal,\n  depth,\n  log\n}) => {\n  log ??= createLogContextTree();\n  if (pointsToConnect.length !== 2)\n    throw new Error(\"Must supply exactly 2 pointsToConnect\");\n  depth = depth ?? 0;\n  let [A, B] = pointsToConnect;\n  const remainingSegDist = Math.max(Math.abs(A.x - B.x), Math.abs(A.y - B.y)) / grid.segmentSize;\n  if (remainingSegDist <= grid.maxGranularSearchSegments) {\n    const granRoute = findTwoPointGranularRoute({\n      pointsToConnect,\n      obstacles,\n      grid,\n      allowDiagonal,\n      log: log.child(\"2P Granular Route\")\n    });\n    log.end();\n    return granRoute;\n  }\n  const mixedGranRoute = findTwoPointMixedGranularityRoute({\n    pointsToConnect,\n    obstacles,\n    grid,\n    allowDiagonal,\n    log: log.child(`2P Mixed Granularity Route`)\n  });\n  if (mixedGranRoute.pathFound) {\n    log.end();\n    return mixedGranRoute;\n  }\n  if (depth > 3) {\n    log.info.max_depth = true;\n    log.end();\n    return { pathFound: false, message: \"Max depth reached\" };\n  }\n  const distanceToBorder = Math.min(\n    grid.segmentSize * grid.maxGranularSearchSegments,\n    (remainingSegDist / 2 - 3) * grid.segmentSize\n  );\n  const ABP = findBestBorderTargetPaths({\n    point: A,\n    obstacles,\n    grid,\n    distanceToBorder,\n    distantTarget: B,\n    allowDiagonal,\n    log: log.child(\"Border Target Paths A\")\n  });\n  const BBP = findBestBorderTargetPaths({\n    point: B,\n    obstacles,\n    grid,\n    distanceToBorder,\n    distantTarget: A,\n    allowDiagonal,\n    log: log.child(\"Border Target Paths B\")\n  });\n  const routes = [];\n  const bp_log = log.child(\n    `Border Target Matrix Search ${ABP.length * BBP.length}`\n  );\n  for (let abpi = 0; abpi < ABP.length; abpi++) {\n    const abp = ABP[abpi];\n    for (let bbpi = 0; bbpi < BBP.length; bbpi++) {\n      const bbp = BBP[bbpi];\n      const middleRoute = findTwoPointNearBiasRoute({\n        pointsToConnect: [abp.borderTarget, bbp.borderTarget],\n        obstacles,\n        grid,\n        depth: depth + 1,\n        allowDiagonal,\n        log: bp_log.child(\n          `Middle Route ${abpi + 1}x${bbpi + 1}/${ABP.length}x${BBP.length}`\n        )\n      });\n      if (middleRoute.pathFound === false)\n        continue;\n      const fullRoute = {\n        points: [\n          ...abp.points,\n          ...middleRoute.points,\n          ...[...bbp.points].reverse()\n        ],\n        // points: [...abp.points, ...middleRoute.points, ...bbp.points],\n        length: abp.length + middleRoute.length + bbp.length,\n        pathFound: true,\n        width: abp.width\n      };\n      routes.push(fullRoute);\n    }\n  }\n  bp_log.end();\n  if (routes.length === 0) {\n    log.info.no_routes = true;\n    log.end();\n    return { pathFound: false };\n  }\n  log.end();\n  return routes.reduce((a, b) => a.length < b.length ? a : b);\n};\n\n// src/lib/find-route.ts\nvar findRoute = ({\n  pointsToConnect,\n  obstacles,\n  grid,\n  allowDiagonal\n}) => {\n  pointsToConnect.sort((a, b) => {\n    const distA = Math.sqrt(a.x ** 2 + a.y ** 2);\n    const distB = Math.sqrt(b.x ** 2 + b.y ** 2);\n    return distA - distB;\n  });\n  let pathFound = false;\n  let points = [];\n  let totalLength = 0;\n  for (let i = 0; i < pointsToConnect.length - 1; i++) {\n    const pointA = pointsToConnect[i];\n    const pointB = pointsToConnect[i + 1];\n    const pathResult = findTwoPointNearBiasRoute({\n      pointsToConnect: [pointA, pointB],\n      obstacles,\n      grid,\n      allowDiagonal\n    });\n    if (\"pathFound\" in pathResult && pathResult.pathFound) {\n      pathFound = true;\n      points = [...points, ...pathResult.points];\n      totalLength += pathResult.length;\n    } else {\n      return { pathFound: false };\n    }\n  }\n  return pathFound ? { points, length: totalLength, width: 1, pathFound: true } : { pathFound: false };\n};\n\n// src/lib/remove-unnecessary-points.ts\nvar removeUnnecessaryPoints = (points) => {\n  if (points.length <= 3)\n    return points;\n  const newPoints = [points[0]];\n  for (let i = 1; i < points.length - 1; i++) {\n    const P = newPoints[newPoints.length - 1];\n    const A = points[i];\n    const B = points[i + 1];\n    if (P.x === A.x && A.x === B.x) {\n      continue;\n    }\n    if (P.y === A.y && A.y === B.y) {\n      continue;\n    }\n    newPoints.push(A);\n  }\n  newPoints.push(points[points.length - 1]);\n  return newPoints;\n};\n\n// src/lib/is-intersecting-obstacle.ts\nvar isIntersectingObstacle = (params) => {\n  const { obstacles, margin = 0 } = params;\n  let { x1, x2, y1, y2, points } = params;\n  const clipLine = (x12, y12, x22, y22, left, right, bottom, top) => {\n    let u1 = 0, u2 = 1, dx = x22 - x12, dy = y22 - y12;\n    const p = [-dx, dx, -dy, dy];\n    const q = [x12 - left, right - x12, y12 - bottom, top - y12];\n    for (let i = 0; i < 4; i++) {\n      if (p[i] === 0) {\n        if (q[i] < 0)\n          return false;\n      } else {\n        const u = q[i] / p[i];\n        if (p[i] < 0 && u1 < u)\n          u1 = u;\n        else if (p[i] > 0 && u2 > u)\n          u2 = u;\n      }\n    }\n    return u1 <= u2;\n  };\n  if ((points == null ? void 0 : points.length) > 2) {\n    return isIntersectingObstacle({\n      points: points.slice(0, 2),\n      obstacles,\n      margin\n    }) || isIntersectingObstacle({\n      points: points.slice(1),\n      obstacles,\n      margin\n    });\n  }\n  if (points) {\n    x1 = points[0].x;\n    x2 = points[1].x;\n    y1 = points[0].y;\n    y2 = points[1].y;\n  }\n  for (const obstacle of obstacles) {\n    const leftEdge = obstacle.center.x - obstacle.width / 2 - margin;\n    const rightEdge = obstacle.center.x + obstacle.width / 2 + margin;\n    const bottomEdge = obstacle.center.y - obstacle.height / 2 - margin;\n    const topEdge = obstacle.center.y + obstacle.height / 2 + margin;\n    if (clipLine(x1, y1, x2, y2, leftEdge, rightEdge, bottomEdge, topEdge)) {\n      return true;\n    }\n  }\n  return false;\n};\n\n// src/lib/remove-unnecessary-turns.ts\nvar isAlignedWithDirectionBias = (A, B) => {\n  if (A.directionBias === \"right\")\n    return B.x > A.x;\n  if (A.directionBias === \"left\")\n    return B.x < A.x;\n  if (A.directionBias === \"up\")\n    return B.y > A.y;\n  if (A.directionBias === \"down\")\n    return B.y < A.y;\n  return true;\n};\nvar getFlippedMiddlePoint = (A, B, C) => A.x === B.x ? { x: C.x, y: A.y } : {\n  x: A.x,\n  y: C.y\n};\nvar removeUnnecessaryTurns = ({\n  points,\n  obstacles,\n  log\n}) => {\n  log ??= createLogContextTree();\n  if (points.length <= 3) {\n    log.end();\n    return points;\n  }\n  let newPoints = [points[0], points[1]];\n  if (points[0].directionBias) {\n    const [A, B, C] = points;\n    if (!isAlignedWithDirectionBias(A, B)) {\n      const flipped2ndPoint = getFlippedMiddlePoint(A, B, C);\n      if (isAlignedWithDirectionBias(A, flipped2ndPoint) && !isIntersectingObstacle({ obstacles, points: [A, flipped2ndPoint, C] })) {\n        newPoints = [A, flipped2ndPoint];\n      }\n    }\n  }\n  if (points[points.length - 1].directionBias) {\n    const [A, B, C] = points.slice(-3);\n    if (!isAlignedWithDirectionBias(C, B)) {\n      const flipped2ndLastPoint = getFlippedMiddlePoint(A, B, C);\n      if (isAlignedWithDirectionBias(C, flipped2ndLastPoint) && !isIntersectingObstacle({\n        obstacles,\n        points: [A, flipped2ndLastPoint, C]\n      })) {\n        points[points.length - 2] = flipped2ndLastPoint;\n      }\n    }\n  }\n  for (let i = 1; i < points.length - 3; i++) {\n    const P = newPoints[i - 1];\n    const A = newPoints[i];\n    const B = points[i + 1];\n    const C = points[i + 2];\n    if (P.x === A.x && A.x === B.x) {\n      newPoints.push(B);\n      continue;\n    }\n    if (P.y === A.y && A.y === B.y) {\n      newPoints.push(B);\n      continue;\n    }\n    const B_opt = getFlippedMiddlePoint(A, B, C);\n    const newPathPossible = !isIntersectingObstacle({\n      obstacles,\n      points: [A, B_opt, C]\n    });\n    if (newPathPossible) {\n      newPoints.push(B_opt);\n    } else {\n      newPoints.push(B);\n    }\n  }\n  newPoints.push(...points.slice(-2));\n  log.end();\n  return newPoints;\n};\n\n// src/lib/find-two-point-schematic-route.ts\nvar findTwoPointSchematicRoute = ({\n  grid,\n  obstacles,\n  pointsToConnect,\n  log\n}) => {\n  log ??= createLogContextTree();\n  const route = findTwoPointNearBiasRoute({\n    grid,\n    obstacles,\n    pointsToConnect,\n    allowDiagonal: false,\n    log\n  });\n  if (!route.pathFound)\n    return { pathFound: false };\n  for (const pointToConnect of pointsToConnect) {\n    if (!pointToConnect.directionBias)\n      continue;\n    const nearestPoint = route.points.reduce(\n      (nearest, point) => {\n        const dist = Math.hypot(\n          point.x - pointToConnect.x,\n          point.y - pointToConnect.y\n        );\n        if (dist < nearest.dist)\n          return { point, dist };\n        return nearest;\n      },\n      { point: route.points[0], dist: Infinity }\n    ).point;\n    nearestPoint.directionBias = pointToConnect.directionBias;\n  }\n  let currentBest = route.points;\n  const tr_log = log.child(\"Remove Unnecessary Turns\");\n  let iters = 0;\n  while (true) {\n    iters++;\n    let newPoints = removeUnnecessaryTurns({\n      points: currentBest,\n      obstacles\n      // log: tr_log.child(`Remove Unnecessary Turns Iteration ${iters}`),\n    });\n    newPoints = removeUnnecessaryPoints(newPoints);\n    if (newPoints.length === currentBest.length) {\n      break;\n    } else {\n      currentBest = newPoints;\n    }\n  }\n  tr_log.end();\n  return {\n    ...route,\n    points: currentBest\n  };\n};\n\n// src/lib/find-schematic-route.ts\nvar findSchematicRoute = ({\n  pointsToConnect,\n  obstacles,\n  grid,\n  log\n}) => {\n  log ??= createLogContextTree();\n  pointsToConnect.sort((a, b) => {\n    const distA = Math.sqrt(a.x ** 2 + a.y ** 2);\n    const distB = Math.sqrt(b.x ** 2 + b.y ** 2);\n    return distA - distB;\n  });\n  let pathFound = false;\n  let points = [];\n  let totalLength = 0;\n  const ps_log = log.child(`${pointsToConnect.length} A->B Path Search`);\n  for (let i = 0; i < pointsToConnect.length - 1; i++) {\n    const pointA = pointsToConnect[i];\n    const pointB = pointsToConnect[i + 1];\n    const pathResult = findTwoPointSchematicRoute({\n      pointsToConnect: [pointA, pointB],\n      obstacles,\n      grid,\n      allowDiagonal: false,\n      log: ps_log\n    });\n    if (\"pathFound\" in pathResult && pathResult.pathFound) {\n      pathFound = true;\n      points = [...points, ...pathResult.points];\n      totalLength += pathResult.length;\n    } else {\n      return { pathFound: false };\n    }\n  }\n  ps_log.end();\n  log.end();\n  return pathFound ? { points, length: totalLength, width: 1, pathFound: true } : { pathFound: false };\n};\n\n// src/lib/move-points-outside-obstacles.ts\nvar movePointsOutsideObstacles = (params, opts) => {\n  const { pointsToConnect, obstacles } = params;\n  const { margin = params.grid.segmentSize } = opts ?? {};\n  const pointsToConnectOutsideObstacles = pointsToConnect.map((oldPoint) => {\n    const newPoint = { ...oldPoint };\n    for (const obstacle of obstacles) {\n      if (isInObstacle({ point: newPoint, obstacles: [obstacle], margin })) {\n        const { center, width, height } = obstacle;\n        let udx = Math.sign(newPoint.x - center.x);\n        let udy = Math.sign(newPoint.y - center.y);\n        if (udx === 0)\n          udx = 1;\n        if (udy === 0)\n          udy = 1;\n        const x_edge = center.x + width / 2 * udx;\n        const y_edge = center.y + height / 2 * udy;\n        const dx_edge = Math.abs(newPoint.x - x_edge);\n        const dy_edge = Math.abs(newPoint.y - y_edge);\n        const y_edge_is_closer = dy_edge < dx_edge;\n        if (y_edge_is_closer) {\n          newPoint.y = y_edge + margin * udy;\n        } else {\n          newPoint.x = x_edge + margin * udx;\n        }\n      }\n    }\n    return newPoint;\n  });\n  return {\n    ...params,\n    pointsToConnect: pointsToConnectOutsideObstacles\n  };\n};\n// Annotate the CommonJS export names for ESM import in node:\n0 && (module.exports = {\n  findRoute,\n  findSchematicRoute,\n  findTwoPointGranularRoute,\n  findTwoPointMixedGranularityRoute,\n  findTwoPointNearBiasRoute,\n  findTwoPointSchematicRoute,\n  getPointDistance,\n  isInObstacle,\n  movePointsOutsideObstacles\n});\n"]}