@vltpkg/graph 1.0.0-rc.13 → 1.0.0-rc.15

package/dist/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAC7C,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAS/C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAEnC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AAGxD,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAE7B,kEAAkE;AAClE,qEAAqE;AACrE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;AAI/C,MAAM,MAAM,GAAG,CAA0B,CAAK,EAAE,EAAE,CAChD,CAAC,IAAK,IAAI,GAAG,EAAQ,CAAA;AAEvB;;;GAGG;AACH,MAAM,qBAAqB,GAAG,CAC5B,IAAU,EACV,QAAgB,EAChB,KAAa,EACL,EAAE;IACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,0DAA0D;IAC1D,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAC5D,mEAAmE;IACnE,2DAA2D;IAC3D,MAAM,gBAAgB,GACpB,CAAC,CAAC,QAAQ,CAAC,CAAC;QACV,GAAG,iBAAiB,UAAU;YAC9B,GAAG,iBAAiB,GAAG,CAAC,CAAC,QAAQ,EAAE;QACrC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACb,GAAG,iBAAiB,KAAK,GAAG,GAAG,iBAAiB,GAAG,CAAC,CAAC,SAAS,EAAE;YAClE,CAAC,CAAC,GAAG,iBAAiB,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;IACnC,MAAM,cAAc,GAAG,GAAG,iBAAiB,GAAG,KAAK,EAAE,CAAA;IACrD,OAAO,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,gBAAgB,GAAG,cAAc,CAAA;AACnE,CAAC,CAAA;AAqBD,MAAM,OAAO,KAAK;IAChB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,qBAAqB,CAAA;IAC9B,CAAC;IAED,QAAQ,CAAc;IAEtB,YAAY,CAAa;IAEzB;;OAEG;IACH,QAAQ,CAAW;IAEnB;;OAEG;IACH,SAAS,CAAmB;IAE5B;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEvB;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAe,CAAA;IAE9B;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAA;IAE1C;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAgB,CAAA;IAErC;;OAEG;IACH,kBAAkB,GAAG,IAAI,GAAG,EAAqB,CAAA;IAEjD;;OAEG;IACH,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAA;IAE3B;;OAEG;IACH,YAAY,CAAM;IAElB;;OAEG;IACH,sBAAsB,GAAG,IAAI,GAAG,EAAQ,CAAA;IAExC;;OAEG;IACH,WAAW,CAAQ;IAEnB;;OAEG;IACH,YAAY,CAAe;IAE3B;;OAEG;IACH,uBAAuB,GAAG,CAAC,CAAA;IAE3B,YAAY,OAAqB;QAC/B,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAA;QAC1C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,kEAAkE;QAClE,MAAM,WAAW,GAAG,UAAU,CAAC;YAC7B,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC;YACjC,mBAAmB,EAAE,OAAO,CAAC,mBAAmB,CAAC;YACjD,kBAAkB,EAAE,OAAO,CAAC,kBAAkB,CAAC;YAC/C,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,CAAC;YAC3C,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,QAAQ,EAAE,OAAO,CAAC,QAAQ;SAC3B,CAAC,CAAA;QACF,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;QAC1C,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,CAAC,YAAY,GAAG;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,GAAG,WAAW;YACd,KAAK,EAAE,IAAI;SACZ,CAAA;QAED,4BAA4B;QAC5B,MAAM,oBAAoB,GAAG,GAAG,CAAA;QAChC,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CACjC,YAAY,CAAC,IAAI,IAAI,QAAQ,EAC7B,oBAAoB,CACrB,CAAA;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAC/B,SAAS,EACT,YAAY,EACZ,gBAAgB,CACjB,CAAA;QACD,YAAY,CAAC,mBAAmB,CAAC,oBAAoB,CAAC,CAAA;QACtD,YAAY,CAAC,YAAY,GAAG,IAAI,CAAA;QAChC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,YAAY,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;QACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,YAAY,CAAC,CAAA;QAEjD,0DAA0D;QAC1D,wDAAwD;QACxD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CACzB,EAAE,CAAC,EAAE,EACL,EAAE,CAAC,QAAQ,EACX,SAAS,EACT,EAAE,CAAC,IAAI,CACR,CAAA;gBACD,MAAM,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;gBAC1C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;gBAChD,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBAC1B,oEAAoE;gBACpE,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,MAAM,EACN,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,EACrD,IAAI,CAAC,YAAY,EACjB,MAAM,CACP,CAAA;gBACD,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,kBAAkB,GAAgB,IAAI,GAAG,EAAE,CAAA;QACjD,kBAAkB,CAAC,KAAK,GAAG,IAAI,CAAC,uBAAuB,CAAA;QACvD,IAAI,CAAC,YAAY,GAAG,CAAC,kBAAkB,CAAC,CAAA;IAC1C,CAAC;IAED;;OAEG;IACH,oBAAoB;QAClB,OAAO,EAAE,IAAI,CAAC,uBAAuB,CAAA;IACvC,CAAC;IAED;;;;;;;;OAQG;IACH,EAAE;QACA,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAA;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;QACtB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACtC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,6BAA6B;YAC7B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACpB,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAA;gBACnB,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBACnC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACd,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;gBACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO,CACL,IAAwB,EACxB,IAAU,EACV,IAAc,EACd,EAAa;QAEb,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC9B,IAAI,EAAE,EAAE,CAAC;gBACP,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB,IAAI,WAAW,CAAA;gBACvD,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAA;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CACT,oDAAoD,EACpD,EAAE,IAAI,EAAE,CACT,CAAA;YACH,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7C,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,IAAI,GAAG,QAAgB,CAAA;YAC7B,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;gBAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EACpC,CAAC;gBACD,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;oBACzB,qDAAqD;oBACrD,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;oBAC7B,0CAA0C;oBAC1C,IAAI,CAAC,EAAE,GAAG,EAAU,CAAA;oBACpB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC3B,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,MAAM,CAAC,GAAG,IAAY,CAAA;QACtB,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAC1B,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EACtC,IAAI,EACJ,EAAsB,CACvB,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACvB,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAU,EAAE,QAAc,EAAE,KAAK,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,EAAE,GAAG,qBAAqB,CAAC,CAAC,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IACE,SAAS,CACP,IAAI,CAAC,EAAE,EACP,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;gBAC9B,8DAA8D;gBAC9D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC1C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CACL,EAAU,EACV,QAA6B,EAC7B,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,IAAI,CAAC,YAAY,EACjB,EAAE,EACF,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,OAAO,CACR,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QACxD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAEb,gEAAgE;QAChE,8DAA8D;QAC9D,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAClD,CAAA;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;QAE7C,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QACvC,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CACV,QAAc,EACd,OAA2B,EAC3B,IAAU,EACV,QAA6B,EAC7B,EAAU,EACV,KAAc;QAEd,+DAA+D;QAC/D,iEAAiE;QACjE,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;YACrC,OAAM;QACR,CAAC;QAED,uDAAuD;QACvD,MAAM,KAAK,GAAG;YACZ,GAAG,EAAE,QAAQ,CAAC,GAAG,IAAI,OAAO,KAAK,KAAK;YACtC,QAAQ,EACN,QAAQ,CAAC,QAAQ;gBACjB,OAAO,KAAK,UAAU;gBACtB,OAAO,KAAK,cAAc;SAC7B,CAAA;QAED,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;QAE9D,8CAA8C;QAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,KAAK,CAAC,4CAA4C,EAAE;gBACxD,IAAI;gBACJ,QAAQ;aACT,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,8DAA8D;QAC9D,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAA;YAClD,oEAAoE;YACpE,yDAAyD;YACzD,WAAW,CAAC,QAAQ,GAAG,KAAK,CAAA;YAC5B,WAAW,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAA;YAC7B,WAAW,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;YACvC,OAAO,WAAW,CAAA;QACpB,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;QAClD,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC/B,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;QACtB,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAA;QAChC,4CAA4C;QAC5C,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;YACnD,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC1B,MAAM,CAAC,WAAW,GAAG,WAAW,CAAA;QAClC,CAAC;QAED,uCAAuC;QACvC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAA;YAC1C,iCAAiC;YACjC,IAAI,OAAO,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAyB,EAAE,CAAA;gBACzC,IAAI,OAAO;oBAAE,QAAQ,CAAC,OAAO,GAAG,OAAO,CAAA;gBACvC,IAAI,EAAE;oBAAE,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAA;gBACxB,IAAI,GAAG;oBAAE,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAA;gBAC3B,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC5B,CAAC;YACD,4BAA4B;YAC5B,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,CAAC,IAAI,GAAG,GAAG,CAAA;YACnB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QAE/C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAE7C,0CAA0C;QAC1C,MAAM,CAAC,GAAG,qBAAqB,CAC7B,IAAI,CAAC,KAAK,EACV,QAAQ,CAAC,QAAQ,EACjB,KAAK,IAAI,EAAE,CACZ,CAAA;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACX,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAEzC,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;;;;;OASG;IACH,UAAU,CAAC,IAAU,EAAE,WAAkB,EAAE,SAAmB;QAC5D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC3C,4CAA4C;QAC5C,IAAI,GAAG,EAAE,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;YAClD,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YAC/D,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,IACE,WAAW;gBACX,SAAS,CACP,WAAW,CAAC,EAAE,EACd,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,EAAE,GAAG,WAAW,CAAA;YACvB,CAAC;iBAAM,IAAI,SAAS,EAAE,CAAC;gBACrB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAA;YACrB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,IAAU,EAAE,KAAK,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAA;QACpB,MAAM,aAAa,GAAG,qBAAqB,CACzC,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,KAAK,CACN,CAAA;QACD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,EAAE,GAAG,SAAS,CAAA;YACnB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;YACtC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,aAAa,CAAC,CAAA;YACxD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAClC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,6BAA6B;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAElB,oCAAoC;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,iEAAiE;YACjE,oEAAoE;YACpE,kEAAkE;YAClE,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YAEvC,oCAAoC;YACpC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAA;YACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;QACtB,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO,YAAY,CAAC;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,KAAK,EAAE,IAAI;YACX,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IACJ,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAuB;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;QAC1B,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAA;IAChE,CAAC;CACF","sourcesContent":["import { getId, joinDepIDTuple, splitExtra } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { getOptions, Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type {\n  GraphLike,\n  NodeLike,\n  NormalizedManifest,\n  DependencySaveType,\n} from '@vltpkg/types'\nimport type { Monorepo } from '@vltpkg/workspaces'\nimport { inspect } from 'node:util'\nimport type { InspectOptions } from 'node:util'\nimport { lockfileData } from './lockfile/save.ts'\nimport { Edge } from './edge.ts'\nimport { Node } from './node.ts'\nimport type { NodeOptions } from './node.ts'\nimport { resolveSaveType } from './resolve-save-type.ts'\nimport type { PeerContext } from './ideal/types.ts'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nconst cacheKeySeparator = '│'\n\n// this is always the same, but we don't hard code it as a string,\n// in case the DepID module needs to change its delimiter again ever.\nconst mainDepID = joinDepIDTuple(['file', '.'])\n\nexport type ManifestInventory = Map<DepID, NormalizedManifest>\n\nconst getMap = <T extends Map<any, any>>(m?: T) =>\n  m ?? (new Map() as T)\n\n/**\n * Get a cache key for a resolution based on the\n * spec, location and query modifier.\n */\nconst getResolutionCacheKey = (\n  spec: Spec,\n  location: string,\n  extra: string,\n): string => {\n  const f = spec.final\n  // if it's a file: dep, then the fromNode location matters\n  const fromPrefix = f.type === 'file' ? location + ' : ' : ''\n  // the unique key should also precise what is the type of the spec,\n  // and in the case of a registry, what registry it is from.\n  const typePrecisionKey =\n    f.registry ?\n      `${cacheKeySeparator}registry` +\n      `${cacheKeySeparator}${f.registry}`\n    : f.gitRemote ?\n      `${cacheKeySeparator}git` + `${cacheKeySeparator}${f.gitRemote}`\n    : `${cacheKeySeparator}${f.type}`\n  const modifierSuffix = `${cacheKeySeparator}${extra}`\n  return fromPrefix + String(f) + typePrecisionKey + modifierSuffix\n}\n\nexport type GraphOptions = SpecOptions & {\n  /**\n   * The main importer manifest info.\n   */\n  mainManifest: NormalizedManifest\n  /**\n   * An inventory of seen manifests.\n   */\n  manifests?: ManifestInventory\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * Root of the project this graph represents\n   */\n  projectRoot: string\n}\n\nexport class Graph implements GraphLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Graph'\n  }\n\n  #options: GraphOptions\n\n  #nodeOptions: NodeOptions\n\n  /**\n   * A {@link Monorepo} instance, used for managing workspaces.\n   */\n  monorepo?: Monorepo\n\n  /**\n   * An inventory with all manifests related to an install.\n   */\n  manifests: ManifestInventory\n\n  /**\n   * A set of all edges in this graph.\n   */\n  edges = new Set<Edge>()\n\n  /**\n   * Map registered dep ids to the node that represent them in the graph.\n   */\n  nodes = new Map<DepID, Node>()\n\n  /**\n   * Map of nodes by their name\n   */\n  nodesByName = new Map<string, Set<Node>>()\n\n  /**\n   * Cached resolutions for spec lookups\n   */\n  resolutions = new Map<string, Node>()\n\n  /**\n   * Reverse map of resolutions\n   */\n  resolutionsReverse = new Map<Node, Set<string>>()\n\n  /**\n   * A set of importer nodes in this graph.\n   */\n  importers = new Set<Node>()\n\n  /**\n   * The {@link Node} that represents the project root `package.json`.\n   */\n  mainImporter: Node\n\n  /**\n   * A set of extraneous dependencies found when building the graph.\n   */\n  extraneousDependencies = new Set<Edge>()\n\n  /**\n   * The root of the project this graph represents\n   */\n  projectRoot: string\n\n  /**\n   * The peer context sets used to resolve peer dependencies within this graph.\n   */\n  peerContexts: PeerContext[]\n\n  /**\n   * Tracks the current peer context index.\n   */\n  currentPeerContextIndex = 0\n\n  constructor(options: GraphOptions) {\n    const { mainManifest, monorepo } = options\n    this.#options = options\n    // hydrate spec options to their full contents, including defaults\n    const specOptions = getOptions({\n      registry: options.registry,\n      registries: options.registries,\n      'git-hosts': options['git-hosts'],\n      'git-host-archives': options['git-host-archives'],\n      'scope-registries': options['scope-registries'],\n      'jsr-registries': options['jsr-registries'],\n      catalog: options.catalog,\n      catalogs: options.catalogs,\n    })\n    this.manifests = getMap(options.manifests)\n    this.projectRoot = options.projectRoot\n    this.#nodeOptions = {\n      ...this.#options,\n      ...specOptions,\n      graph: this,\n    }\n\n    // add the project root node\n    const mainImporterLocation = '.'\n    const mainImporterSpec = Spec.parse(\n      mainManifest.name || '(root)',\n      mainImporterLocation,\n    )\n    const mainImporter = this.addNode(\n      mainDepID,\n      mainManifest,\n      mainImporterSpec,\n    )\n    mainImporter.setImporterLocation(mainImporterLocation)\n    mainImporter.mainImporter = true\n    this.mainImporter = mainImporter\n    this.mainImporter.workspaces = new Map()\n    this.importers.add(mainImporter)\n    this.manifests.set(mainImporter.id, mainManifest)\n\n    // uses the monorepo instance in order to retrieve info on\n    // workspaces and create importer nodes for each of them\n    this.monorepo = monorepo\n    if (this.monorepo) {\n      for (const ws of this.monorepo) {\n        const wsNode = this.addNode(\n          ws.id,\n          ws.manifest,\n          undefined,\n          ws.name,\n        )\n        wsNode.setImporterLocation(`./${ws.path}`)\n        if (wsNode.manifest) {\n          this.manifests.set(wsNode.id, wsNode.manifest)\n        }\n        this.importers.add(wsNode)\n        // creates a virtual edge to connect the workspaces to the root node\n        const edge = new Edge(\n          'prod',\n          Spec.parse(wsNode.name, 'workspace:*', this.#options),\n          this.mainImporter,\n          wsNode,\n        )\n        this.mainImporter.workspaces.set(wsNode.name, edge)\n      }\n    }\n\n    // initializes the peer context set collection\n    const initialPeerContext: PeerContext = new Map()\n    initialPeerContext.index = this.currentPeerContextIndex\n    this.peerContexts = [initialPeerContext]\n  }\n\n  /**\n   * Get the next peer context index.\n   */\n  nextPeerContextIndex() {\n    return ++this.currentPeerContextIndex\n  }\n\n  /**\n   * Delete all nodes and edges that are unreachable from the importers.\n   * The collection of deleted nodes is returned.\n   *\n   * NOTE: This can be extremely slow for large graphs, and is almost always\n   * unnecessary! Only call when it is known that some unreachable nodes may\n   * have been created, for example when deleting the unneeded subgraph when an\n   * optional node fails to resolve/install.\n   */\n  gc() {\n    const { nodes } = this\n    this.edges.clear()\n    this.nodes = new Map()\n    const marked = new Set(this.importers)\n    for (const imp of marked) {\n      // don't delete the importer!\n      nodes.delete(imp.id)\n      this.nodes.set(imp.id, imp)\n      for (const edge of imp.edgesOut.values()) {\n        this.edges.add(edge)\n        const { to } = edge\n        if (!to || marked.has(to)) continue\n        marked.add(to)\n        nodes.delete(to.id)\n        this.nodes.set(to.id, to)\n      }\n    }\n    for (const node of nodes.values()) {\n      this.removeNode(node)\n    }\n    return nodes\n  }\n\n  /**\n   * Create a new edge between two nodes of the graph in case both exist,\n   * in case the destination node does not exists, then a dangling edge,\n   * pointing to nothing will be created to represent that missing dependency.\n   */\n  addEdge(\n    type: DependencySaveType,\n    spec: Spec,\n    from: NodeLike,\n    to?: NodeLike,\n  ) {\n    // fix any nameless spec\n    if (spec.name === '(unknown)') {\n      if (to) {\n        spec.name = to.name /* c8 ignore next */ || '(unknown)'\n        spec.spec = `${to.name}@${spec.bareSpec}`\n      } else {\n        throw error(\n          'Impossible to place a missing, nameless dependency',\n          { spec },\n        )\n      }\n    }\n    const existing = from.edgesOut.get(spec.name)\n    if (existing) {\n      const edge = existing as Edge\n      if (\n        edge.type === type &&\n        edge.spec.bareSpec === spec.bareSpec\n      ) {\n        if (to && to !== edge.to) {\n          // removes this edge from its destination edgesIn ref\n          edge.to?.edgesIn.delete(edge)\n          // now swap the destination to the new one\n          edge.to = to as Node\n          edge.to.edgesIn.add(edge)\n        }\n        return edge\n      }\n      this.edges.delete(edge)\n    }\n    const f = from as Node\n    const edgeOut = f.addEdgesTo(\n      resolveSaveType(from, spec.name, type),\n      spec,\n      to as Node | undefined,\n    )\n    this.edges.add(edgeOut)\n    return edgeOut\n  }\n\n  /**\n   * Find an existing node to satisfy a dependency\n   */\n  findResolution(spec: Spec, fromNode: Node, extra = '') {\n    const f = spec.final\n    const sf = getResolutionCacheKey(f, fromNode.location, extra)\n    const cached = this.resolutions.get(sf)\n    if (cached) return cached\n    const nbn = this.nodesByName.get(f.name)\n    if (!nbn) return undefined\n    for (const node of nbn) {\n      if (\n        satisfies(\n          node.id,\n          f,\n          fromNode.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        this.resolutions.set(sf, node)\n        // always set by now, because the node was added at some point\n        this.resolutionsReverse.get(node)?.add(sf)\n        return node\n      }\n    }\n  }\n\n  /**\n   * Create a new node in the graph.\n   */\n  addNode(\n    id?: DepID,\n    manifest?: NormalizedManifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    const node = new Node(\n      this.#nodeOptions,\n      id,\n      manifest,\n      spec,\n      name,\n      version,\n    )\n    this.nodes.set(node.id, node)\n    const nbn = this.nodesByName.get(node.name) ?? new Set()\n    nbn.add(node)\n\n    // ensure the nodes by name set is always sorted, this will help\n    // keeping a deterministic graph resolution when reusing nodes\n    const newByNameSet = new Set(\n      [...nbn].sort((a, b) => a.id.localeCompare(b.id)),\n    )\n    this.nodesByName.set(node.name, newByNameSet)\n\n    if (manifest) {\n      this.manifests.set(node.id, manifest)\n    }\n    return node\n  }\n\n  /**\n   * Place a new package into the graph representation, creating the new\n   * edges and possibly new nodes that are to be expected when traversing\n   * the graph in a top-down direction, e.g: from importers to leafs.\n   *\n   * For different uses that are not a direct top-down traversal of the graph\n   * consider using `addNode()` and `addEdge()` instead.\n   */\n  placePackage(\n    fromNode: Node,\n    depType: DependencySaveType,\n    spec: Spec,\n    manifest?: NormalizedManifest,\n    id?: DepID,\n    extra?: string,\n  ): Node | undefined {\n    // if no manifest is available, then create an edge that has no\n    // reference to any other node, representing a missing dependency\n    if (!manifest && !id) {\n      this.addEdge(depType, spec, fromNode)\n      return\n    }\n\n    // flags set on the node we're about to create or find.\n    const flags = {\n      dev: fromNode.dev || depType === 'dev',\n      optional:\n        fromNode.optional ||\n        depType === 'optional' ||\n        depType === 'peerOptional',\n    }\n\n    const depId = id || (manifest && getId(spec, manifest, extra))\n\n    /* c8 ignore start - should not be possible */\n    if (!depId) {\n      throw error('Could not find dep id when placing package', {\n        spec,\n        manifest,\n      })\n    }\n    /* c8 ignore stop */\n\n    // if a node for this package is already represented by a node\n    // in the graph, then just creates a new edge to that node\n    const toFoundNode = this.nodes.get(depId)\n    if (toFoundNode) {\n      this.addEdge(depType, spec, fromNode, toFoundNode)\n      // the current only stays dev/optional if this dep lets it remain so\n      // if it's not already, we don't make it dev or optional.\n      toFoundNode.detached = false\n      toFoundNode.dev &&= flags.dev\n      toFoundNode.optional &&= flags.optional\n      return toFoundNode\n    }\n\n    // creates a new node and edges to its parent\n    const toNode = this.addNode(depId, manifest, spec)\n    toNode.registry = spec.registry\n    toNode.dev = flags.dev\n    toNode.optional = flags.optional\n    // split extra into modifier and peerSetHash\n    if (extra) {\n      const { modifier, peerSetHash } = splitExtra(extra)\n      toNode.modifier = modifier\n      toNode.peerSetHash = peerSetHash\n    }\n\n    // add extra manifest info if available\n    if (manifest) {\n      const { bin, engines, os, cpu } = manifest\n      // add platform info if available\n      if (engines || os || cpu) {\n        const platform: NodeLike['platform'] = {}\n        if (engines) platform.engines = engines\n        if (os) platform.os = os\n        if (cpu) platform.cpu = cpu\n        toNode.platform = platform\n      }\n      // add bin info if available\n      if (bin) {\n        toNode.bins = bin\n      }\n    }\n    toNode.maybeSetConfusedManifest(spec, manifest)\n\n    this.addEdge(depType, spec, fromNode, toNode)\n\n    // populate resolution cache if applicable\n    const f = getResolutionCacheKey(\n      spec.final,\n      fromNode.location,\n      extra || '',\n    )\n    this.resolutions.set(f, toNode)\n    const rrev = this.resolutionsReverse.get(toNode) ?? new Set()\n    rrev.add(f)\n    this.resolutionsReverse.set(toNode, rrev)\n\n    return toNode\n  }\n\n  /**\n   * Removes a node and its relevant edges from the graph.\n   *\n   * Use the `keepEdges` option to keep the edges that were pointing to\n   * this node and only removes their `to` property value.\n   *\n   * If a replacement is provided, then any edges that were previously\n   * pointing to the removed node will be directed to the replacement,\n   * if it is valid to do so.\n   */\n  removeNode(node: Node, replacement?: Node, keepEdges?: boolean) {\n    this.nodes.delete(node.id)\n    const nbn = this.nodesByName.get(node.name)\n    // if it's the last one, just remove the set\n    if (nbn?.size === 1) this.nodesByName.delete(node.name)\n    else nbn?.delete(node)\n    for (const r of this.resolutionsReverse.get(node) ?? new Set()) {\n      this.resolutions.delete(r)\n    }\n    this.resolutionsReverse.delete(node)\n    this.manifests.delete(node.id)\n    for (const edge of node.edgesOut.values()) {\n      this.edges.delete(edge)\n    }\n    for (const edge of node.edgesIn) {\n      if (\n        replacement &&\n        satisfies(\n          replacement.id,\n          edge.spec,\n          edge.from.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        edge.to = replacement\n      } else if (keepEdges) {\n        edge.to = undefined\n      } else {\n        edge.from.edgesOut.delete(edge.spec.name)\n        this.edges.delete(edge)\n      }\n    }\n  }\n\n  /**\n   * Removes the resolved node of a given edge.\n   */\n  removeEdgeResolution(edge: Edge, extra = '') {\n    const node = edge.to\n    const resolutionKey = getResolutionCacheKey(\n      edge.spec,\n      edge.from.location,\n      extra,\n    )\n    if (node) {\n      edge.to = undefined\n      this.resolutions.delete(resolutionKey)\n      this.resolutionsReverse.get(node)?.delete(resolutionKey)\n      this.nodesByName.delete(node.name)\n      node.edgesIn.delete(edge)\n      if (node.edgesIn.size === 0) {\n        this.nodes.delete(node.id)\n      }\n    }\n  }\n\n  /**\n   * Remove all edges from the graph while preserving nodes and resolution caches.\n   * This allows the graph to be reconstructed efficiently using the existing nodes.\n   */\n  resetEdges() {\n    // Clear the global edges set\n    this.edges.clear()\n\n    // Clear all node edge relationships\n    for (const node of this.nodes.values()) {\n      // marking nodes as detached needs to be restricted to only those\n      // that had a manifest, otherwise we'd be skipping fetching manifest\n      // for nodes we don't have a manifest during the ideal build phase\n      if (node.manifest) node.detached = true\n\n      // detaches all edges from this node\n      node.edgesOut.clear()\n      node.edgesIn.clear()\n    }\n  }\n\n  toJSON() {\n    return lockfileData({\n      ...this.#options,\n      graph: this,\n      saveManifests: true,\n    })\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const data = this.toJSON()\n    return `${this[Symbol.toStringTag]} ${inspect(data, options)}`\n  }\n}\n"]}
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAC7C,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAS/C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAEnC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AAGxD,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAE7B,kEAAkE;AAClE,qEAAqE;AACrE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;AAI/C,MAAM,MAAM,GAAG,CAA0B,CAAK,EAAE,EAAE,CAChD,CAAC,IAAK,IAAI,GAAG,EAAQ,CAAA;AAEvB;;;GAGG;AACH,MAAM,qBAAqB,GAAG,CAC5B,IAAU,EACV,QAAgB,EAChB,KAAa,EACL,EAAE;IACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,0DAA0D;IAC1D,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAC5D,mEAAmE;IACnE,2DAA2D;IAC3D,MAAM,gBAAgB,GACpB,CAAC,CAAC,QAAQ,CAAC,CAAC;QACV,GAAG,iBAAiB,UAAU;YAC9B,GAAG,iBAAiB,GAAG,CAAC,CAAC,QAAQ,EAAE;QACrC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACb,GAAG,iBAAiB,KAAK,GAAG,GAAG,iBAAiB,GAAG,CAAC,CAAC,SAAS,EAAE;YAClE,CAAC,CAAC,GAAG,iBAAiB,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;IACnC,MAAM,cAAc,GAAG,GAAG,iBAAiB,GAAG,KAAK,EAAE,CAAA;IACrD,OAAO,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,gBAAgB,GAAG,cAAc,CAAA;AACnE,CAAC,CAAA;AAqBD,MAAM,OAAO,KAAK;IAChB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,qBAAqB,CAAA;IAC9B,CAAC;IAED,QAAQ,CAAc;IAEtB,YAAY,CAAa;IAEzB;;OAEG;IACH,QAAQ,CAAW;IAEnB;;OAEG;IACH,SAAS,CAAmB;IAE5B;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEvB;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAe,CAAA;IAE9B;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAA;IAE1C;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAgB,CAAA;IAErC;;OAEG;IACH,kBAAkB,GAAG,IAAI,GAAG,EAAqB,CAAA;IAEjD;;OAEG;IACH,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAA;IAE3B;;OAEG;IACH,YAAY,CAAM;IAElB;;OAEG;IACH,sBAAsB,GAAG,IAAI,GAAG,EAAQ,CAAA;IAExC;;OAEG;IACH,WAAW,CAAQ;IAEnB;;OAEG;IACH,YAAY,CAAe;IAE3B;;;;;OAKG;IACH,oBAAoB,GAAG,IAAI,GAAG,EAAuB,CAAA;IAErD;;OAEG;IACH,uBAAuB,GAAG,CAAC,CAAA;IAE3B,YAAY,OAAqB;QAC/B,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAA;QAC1C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,kEAAkE;QAClE,MAAM,WAAW,GAAG,UAAU,CAAC;YAC7B,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC;YACjC,mBAAmB,EAAE,OAAO,CAAC,mBAAmB,CAAC;YACjD,kBAAkB,EAAE,OAAO,CAAC,kBAAkB,CAAC;YAC/C,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,CAAC;YAC3C,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,QAAQ,EAAE,OAAO,CAAC,QAAQ;SAC3B,CAAC,CAAA;QACF,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;QAC1C,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,CAAC,YAAY,GAAG;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,GAAG,WAAW;YACd,KAAK,EAAE,IAAI;SACZ,CAAA;QAED,4BAA4B;QAC5B,MAAM,oBAAoB,GAAG,GAAG,CAAA;QAChC,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CACjC,YAAY,CAAC,IAAI,IAAI,QAAQ,EAC7B,oBAAoB,CACrB,CAAA;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAC/B,SAAS,EACT,YAAY,EACZ,gBAAgB,CACjB,CAAA;QACD,YAAY,CAAC,mBAAmB,CAAC,oBAAoB,CAAC,CAAA;QACtD,YAAY,CAAC,YAAY,GAAG,IAAI,CAAA;QAChC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,YAAY,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;QACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,YAAY,CAAC,CAAA;QAEjD,0DAA0D;QAC1D,wDAAwD;QACxD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CACzB,EAAE,CAAC,EAAE,EACL,EAAE,CAAC,QAAQ,EACX,SAAS,EACT,EAAE,CAAC,IAAI,CACR,CAAA;gBACD,MAAM,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;gBAC1C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;oBAC9C,qDAAqD;oBACrD,kDAAkD;oBAClD,oDAAoD;oBACpD,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;wBACxB,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAA;oBACnC,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBAC1B,oEAAoE;gBACpE,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,MAAM,EACN,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,EACrD,IAAI,CAAC,YAAY,EACjB,MAAM,CACP,CAAA;gBACD,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,kBAAkB,GAAgB,IAAI,GAAG,EAAE,CAAA;QACjD,kBAAkB,CAAC,KAAK,GAAG,IAAI,CAAC,uBAAuB,CAAA;QACvD,IAAI,CAAC,YAAY,GAAG,CAAC,kBAAkB,CAAC,CAAA;IAC1C,CAAC;IAED;;OAEG;IACH,oBAAoB;QAClB,OAAO,EAAE,IAAI,CAAC,uBAAuB,CAAA;IACvC,CAAC;IAED;;;;;;;;OAQG;IACH,EAAE;QACA,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAA;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;QACtB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACtC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,6BAA6B;YAC7B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACpB,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAA;gBACnB,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBACnC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACd,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;gBACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO,CACL,IAAwB,EACxB,IAAU,EACV,IAAc,EACd,EAAa;QAEb,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC9B,IAAI,EAAE,EAAE,CAAC;gBACP,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB,IAAI,WAAW,CAAA;gBACvD,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAA;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CACT,oDAAoD,EACpD,EAAE,IAAI,EAAE,CACT,CAAA;YACH,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7C,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,IAAI,GAAG,QAAgB,CAAA;YAC7B,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;gBAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EACpC,CAAC;gBACD,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;oBACzB,qDAAqD;oBACrD,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;oBAC7B,0CAA0C;oBAC1C,IAAI,CAAC,EAAE,GAAG,EAAU,CAAA;oBACpB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC3B,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,MAAM,CAAC,GAAG,IAAY,CAAA;QACtB,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAC1B,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EACtC,IAAI,EACJ,EAAsB,CACvB,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACvB,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAU,EAAE,QAAc,EAAE,KAAK,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,EAAE,GAAG,qBAAqB,CAAC,CAAC,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IACE,SAAS,CACP,IAAI,CAAC,EAAE,EACP,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;gBAC9B,8DAA8D;gBAC9D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC1C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CACL,EAAU,EACV,QAA6B,EAC7B,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,IAAI,CAAC,YAAY,EACjB,EAAE,EACF,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,OAAO,CACR,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QACxD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAEb,gEAAgE;QAChE,8DAA8D;QAC9D,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAClD,CAAA;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;QAE7C,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QACvC,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CACV,QAAc,EACd,OAA2B,EAC3B,IAAU,EACV,QAA6B,EAC7B,EAAU,EACV,KAAc;QAEd,+DAA+D;QAC/D,iEAAiE;QACjE,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;YACrC,OAAM;QACR,CAAC;QAED,uDAAuD;QACvD,MAAM,KAAK,GAAG;YACZ,GAAG,EAAE,QAAQ,CAAC,GAAG,IAAI,OAAO,KAAK,KAAK;YACtC,QAAQ,EACN,QAAQ,CAAC,QAAQ;gBACjB,OAAO,KAAK,UAAU;gBACtB,OAAO,KAAK,cAAc;SAC7B,CAAA;QAED,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;QAE9D,8CAA8C;QAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,KAAK,CAAC,4CAA4C,EAAE;gBACxD,IAAI;gBACJ,QAAQ;aACT,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,8DAA8D;QAC9D,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAA;YAClD,oEAAoE;YACpE,yDAAyD;YACzD,WAAW,CAAC,QAAQ,GAAG,KAAK,CAAA;YAC5B,WAAW,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAA;YAC7B,WAAW,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;YACvC,OAAO,WAAW,CAAA;QACpB,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;QAClD,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC/B,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;QACtB,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAA;QAChC,4CAA4C;QAC5C,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;YACnD,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC1B,MAAM,CAAC,WAAW,GAAG,WAAW,CAAA;QAClC,CAAC;QAED,uCAAuC;QACvC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAA;YAChD,iCAAiC;YACjC,IAAI,OAAO,IAAI,EAAE,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAyB,EAAE,CAAA;gBACzC,IAAI,OAAO;oBAAE,QAAQ,CAAC,OAAO,GAAG,OAAO,CAAA;gBACvC,IAAI,EAAE;oBAAE,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAA;gBACxB,IAAI,GAAG;oBAAE,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAA;gBAC3B,IAAI,IAAI;oBAAE,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAA;gBAC9B,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC5B,CAAC;YACD,4BAA4B;YAC5B,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,CAAC,IAAI,GAAG,GAAG,CAAA;YACnB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QAE/C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAE7C,0CAA0C;QAC1C,MAAM,CAAC,GAAG,qBAAqB,CAC7B,IAAI,CAAC,KAAK,EACV,QAAQ,CAAC,QAAQ,EACjB,KAAK,IAAI,EAAE,CACZ,CAAA;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACX,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAEzC,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;;;;;OASG;IACH,UAAU,CAAC,IAAU,EAAE,WAAkB,EAAE,SAAmB;QAC5D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC3C,4CAA4C;QAC5C,IAAI,GAAG,EAAE,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;YAClD,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YAC/D,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,IACE,WAAW;gBACX,SAAS,CACP,WAAW,CAAC,EAAE,EACd,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,EAAE,GAAG,WAAW,CAAA;YACvB,CAAC;iBAAM,IAAI,SAAS,EAAE,CAAC;gBACrB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAA;YACrB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,IAAU,EAAE,KAAK,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAA;QACpB,MAAM,aAAa,GAAG,qBAAqB,CACzC,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,KAAK,CACN,CAAA;QACD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,EAAE,GAAG,SAAS,CAAA;YACnB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;YACtC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,aAAa,CAAC,CAAA;YACxD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAClC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,6BAA6B;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAElB,oCAAoC;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,iEAAiE;YACjE,oEAAoE;YACpE,kEAAkE;YAClE,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YAEvC,oCAAoC;YACpC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAA;YACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;QACtB,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO,YAAY,CAAC;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,KAAK,EAAE,IAAI;YACX,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IACJ,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAuB;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;QAC1B,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAA;IAChE,CAAC;CACF","sourcesContent":["import { getId, joinDepIDTuple, splitExtra } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { getOptions, Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type {\n  GraphLike,\n  NodeLike,\n  NormalizedManifest,\n  DependencySaveType,\n} from '@vltpkg/types'\nimport type { Monorepo } from '@vltpkg/workspaces'\nimport { inspect } from 'node:util'\nimport type { InspectOptions } from 'node:util'\nimport { lockfileData } from './lockfile/save.ts'\nimport { Edge } from './edge.ts'\nimport { Node } from './node.ts'\nimport type { NodeOptions } from './node.ts'\nimport { resolveSaveType } from './resolve-save-type.ts'\nimport type { PeerContext } from './ideal/types.ts'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nconst cacheKeySeparator = '│'\n\n// this is always the same, but we don't hard code it as a string,\n// in case the DepID module needs to change its delimiter again ever.\nconst mainDepID = joinDepIDTuple(['file', '.'])\n\nexport type ManifestInventory = Map<DepID, NormalizedManifest>\n\nconst getMap = <T extends Map<any, any>>(m?: T) =>\n  m ?? (new Map() as T)\n\n/**\n * Get a cache key for a resolution based on the\n * spec, location and query modifier.\n */\nconst getResolutionCacheKey = (\n  spec: Spec,\n  location: string,\n  extra: string,\n): string => {\n  const f = spec.final\n  // if it's a file: dep, then the fromNode location matters\n  const fromPrefix = f.type === 'file' ? location + ' : ' : ''\n  // the unique key should also precise what is the type of the spec,\n  // and in the case of a registry, what registry it is from.\n  const typePrecisionKey =\n    f.registry ?\n      `${cacheKeySeparator}registry` +\n      `${cacheKeySeparator}${f.registry}`\n    : f.gitRemote ?\n      `${cacheKeySeparator}git` + `${cacheKeySeparator}${f.gitRemote}`\n    : `${cacheKeySeparator}${f.type}`\n  const modifierSuffix = `${cacheKeySeparator}${extra}`\n  return fromPrefix + String(f) + typePrecisionKey + modifierSuffix\n}\n\nexport type GraphOptions = SpecOptions & {\n  /**\n   * The main importer manifest info.\n   */\n  mainManifest: NormalizedManifest\n  /**\n   * An inventory of seen manifests.\n   */\n  manifests?: ManifestInventory\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * Root of the project this graph represents\n   */\n  projectRoot: string\n}\n\nexport class Graph implements GraphLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Graph'\n  }\n\n  #options: GraphOptions\n\n  #nodeOptions: NodeOptions\n\n  /**\n   * A {@link Monorepo} instance, used for managing workspaces.\n   */\n  monorepo?: Monorepo\n\n  /**\n   * An inventory with all manifests related to an install.\n   */\n  manifests: ManifestInventory\n\n  /**\n   * A set of all edges in this graph.\n   */\n  edges = new Set<Edge>()\n\n  /**\n   * Map registered dep ids to the node that represent them in the graph.\n   */\n  nodes = new Map<DepID, Node>()\n\n  /**\n   * Map of nodes by their name\n   */\n  nodesByName = new Map<string, Set<Node>>()\n\n  /**\n   * Cached resolutions for spec lookups\n   */\n  resolutions = new Map<string, Node>()\n\n  /**\n   * Reverse map of resolutions\n   */\n  resolutionsReverse = new Map<Node, Set<string>>()\n\n  /**\n   * A set of importer nodes in this graph.\n   */\n  importers = new Set<Node>()\n\n  /**\n   * The {@link Node} that represents the project root `package.json`.\n   */\n  mainImporter: Node\n\n  /**\n   * A set of extraneous dependencies found when building the graph.\n   */\n  extraneousDependencies = new Set<Edge>()\n\n  /**\n   * The root of the project this graph represents\n   */\n  projectRoot: string\n\n  /**\n   * The peer context sets used to resolve peer dependencies within this graph.\n   */\n  peerContexts: PeerContext[]\n\n  /**\n   * Cache of forked peer contexts so identical fork operations can reuse\n   * previously created contexts instead of duplicating them.\n   *\n   * Key format is internal and constructed in `ideal/peers.ts`.\n   */\n  peerContextForkCache = new Map<string, PeerContext>()\n\n  /**\n   * Tracks the current peer context index.\n   */\n  currentPeerContextIndex = 0\n\n  constructor(options: GraphOptions) {\n    const { mainManifest, monorepo } = options\n    this.#options = options\n    // hydrate spec options to their full contents, including defaults\n    const specOptions = getOptions({\n      registry: options.registry,\n      registries: options.registries,\n      'git-hosts': options['git-hosts'],\n      'git-host-archives': options['git-host-archives'],\n      'scope-registries': options['scope-registries'],\n      'jsr-registries': options['jsr-registries'],\n      catalog: options.catalog,\n      catalogs: options.catalogs,\n    })\n    this.manifests = getMap(options.manifests)\n    this.projectRoot = options.projectRoot\n    this.#nodeOptions = {\n      ...this.#options,\n      ...specOptions,\n      graph: this,\n    }\n\n    // add the project root node\n    const mainImporterLocation = '.'\n    const mainImporterSpec = Spec.parse(\n      mainManifest.name || '(root)',\n      mainImporterLocation,\n    )\n    const mainImporter = this.addNode(\n      mainDepID,\n      mainManifest,\n      mainImporterSpec,\n    )\n    mainImporter.setImporterLocation(mainImporterLocation)\n    mainImporter.mainImporter = true\n    this.mainImporter = mainImporter\n    this.mainImporter.workspaces = new Map()\n    this.importers.add(mainImporter)\n    this.manifests.set(mainImporter.id, mainManifest)\n\n    // uses the monorepo instance in order to retrieve info on\n    // workspaces and create importer nodes for each of them\n    this.monorepo = monorepo\n    if (this.monorepo) {\n      for (const ws of this.monorepo) {\n        const wsNode = this.addNode(\n          ws.id,\n          ws.manifest,\n          undefined,\n          ws.name,\n        )\n        wsNode.setImporterLocation(`./${ws.path}`)\n        if (wsNode.manifest) {\n          this.manifests.set(wsNode.id, wsNode.manifest)\n          // set bins for workspace nodes so they can be linked\n          // when another importer depends on this workspace\n          /* c8 ignore next 3 - tested by integration tests */\n          if (wsNode.manifest.bin) {\n            wsNode.bins = wsNode.manifest.bin\n          }\n        }\n        this.importers.add(wsNode)\n        // creates a virtual edge to connect the workspaces to the root node\n        const edge = new Edge(\n          'prod',\n          Spec.parse(wsNode.name, 'workspace:*', this.#options),\n          this.mainImporter,\n          wsNode,\n        )\n        this.mainImporter.workspaces.set(wsNode.name, edge)\n      }\n    }\n\n    // initializes the peer context set collection\n    const initialPeerContext: PeerContext = new Map()\n    initialPeerContext.index = this.currentPeerContextIndex\n    this.peerContexts = [initialPeerContext]\n  }\n\n  /**\n   * Get the next peer context index.\n   */\n  nextPeerContextIndex() {\n    return ++this.currentPeerContextIndex\n  }\n\n  /**\n   * Delete all nodes and edges that are unreachable from the importers.\n   * The collection of deleted nodes is returned.\n   *\n   * NOTE: This can be extremely slow for large graphs, and is almost always\n   * unnecessary! Only call when it is known that some unreachable nodes may\n   * have been created, for example when deleting the unneeded subgraph when an\n   * optional node fails to resolve/install.\n   */\n  gc() {\n    const { nodes } = this\n    this.edges.clear()\n    this.nodes = new Map()\n    const marked = new Set(this.importers)\n    for (const imp of marked) {\n      // don't delete the importer!\n      nodes.delete(imp.id)\n      this.nodes.set(imp.id, imp)\n      for (const edge of imp.edgesOut.values()) {\n        this.edges.add(edge)\n        const { to } = edge\n        if (!to || marked.has(to)) continue\n        marked.add(to)\n        nodes.delete(to.id)\n        this.nodes.set(to.id, to)\n      }\n    }\n    for (const node of nodes.values()) {\n      this.removeNode(node)\n    }\n    return nodes\n  }\n\n  /**\n   * Create a new edge between two nodes of the graph in case both exist,\n   * in case the destination node does not exists, then a dangling edge,\n   * pointing to nothing will be created to represent that missing dependency.\n   */\n  addEdge(\n    type: DependencySaveType,\n    spec: Spec,\n    from: NodeLike,\n    to?: NodeLike,\n  ) {\n    // fix any nameless spec\n    if (spec.name === '(unknown)') {\n      if (to) {\n        spec.name = to.name /* c8 ignore next */ || '(unknown)'\n        spec.spec = `${to.name}@${spec.bareSpec}`\n      } else {\n        throw error(\n          'Impossible to place a missing, nameless dependency',\n          { spec },\n        )\n      }\n    }\n    const existing = from.edgesOut.get(spec.name)\n    if (existing) {\n      const edge = existing as Edge\n      if (\n        edge.type === type &&\n        edge.spec.bareSpec === spec.bareSpec\n      ) {\n        if (to && to !== edge.to) {\n          // removes this edge from its destination edgesIn ref\n          edge.to?.edgesIn.delete(edge)\n          // now swap the destination to the new one\n          edge.to = to as Node\n          edge.to.edgesIn.add(edge)\n        }\n        return edge\n      }\n      this.edges.delete(edge)\n    }\n    const f = from as Node\n    const edgeOut = f.addEdgesTo(\n      resolveSaveType(from, spec.name, type),\n      spec,\n      to as Node | undefined,\n    )\n    this.edges.add(edgeOut)\n    return edgeOut\n  }\n\n  /**\n   * Find an existing node to satisfy a dependency\n   */\n  findResolution(spec: Spec, fromNode: Node, extra = '') {\n    const f = spec.final\n    const sf = getResolutionCacheKey(f, fromNode.location, extra)\n    const cached = this.resolutions.get(sf)\n    if (cached) return cached\n    const nbn = this.nodesByName.get(f.name)\n    if (!nbn) return undefined\n    for (const node of nbn) {\n      if (\n        satisfies(\n          node.id,\n          f,\n          fromNode.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        this.resolutions.set(sf, node)\n        // always set by now, because the node was added at some point\n        this.resolutionsReverse.get(node)?.add(sf)\n        return node\n      }\n    }\n  }\n\n  /**\n   * Create a new node in the graph.\n   */\n  addNode(\n    id?: DepID,\n    manifest?: NormalizedManifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    const node = new Node(\n      this.#nodeOptions,\n      id,\n      manifest,\n      spec,\n      name,\n      version,\n    )\n    this.nodes.set(node.id, node)\n    const nbn = this.nodesByName.get(node.name) ?? new Set()\n    nbn.add(node)\n\n    // ensure the nodes by name set is always sorted, this will help\n    // keeping a deterministic graph resolution when reusing nodes\n    const newByNameSet = new Set(\n      [...nbn].sort((a, b) => a.id.localeCompare(b.id)),\n    )\n    this.nodesByName.set(node.name, newByNameSet)\n\n    if (manifest) {\n      this.manifests.set(node.id, manifest)\n    }\n    return node\n  }\n\n  /**\n   * Place a new package into the graph representation, creating the new\n   * edges and possibly new nodes that are to be expected when traversing\n   * the graph in a top-down direction, e.g: from importers to leafs.\n   *\n   * For different uses that are not a direct top-down traversal of the graph\n   * consider using `addNode()` and `addEdge()` instead.\n   */\n  placePackage(\n    fromNode: Node,\n    depType: DependencySaveType,\n    spec: Spec,\n    manifest?: NormalizedManifest,\n    id?: DepID,\n    extra?: string,\n  ): Node | undefined {\n    // if no manifest is available, then create an edge that has no\n    // reference to any other node, representing a missing dependency\n    if (!manifest && !id) {\n      this.addEdge(depType, spec, fromNode)\n      return\n    }\n\n    // flags set on the node we're about to create or find.\n    const flags = {\n      dev: fromNode.dev || depType === 'dev',\n      optional:\n        fromNode.optional ||\n        depType === 'optional' ||\n        depType === 'peerOptional',\n    }\n\n    const depId = id || (manifest && getId(spec, manifest, extra))\n\n    /* c8 ignore start - should not be possible */\n    if (!depId) {\n      throw error('Could not find dep id when placing package', {\n        spec,\n        manifest,\n      })\n    }\n    /* c8 ignore stop */\n\n    // if a node for this package is already represented by a node\n    // in the graph, then just creates a new edge to that node\n    const toFoundNode = this.nodes.get(depId)\n    if (toFoundNode) {\n      this.addEdge(depType, spec, fromNode, toFoundNode)\n      // the current only stays dev/optional if this dep lets it remain so\n      // if it's not already, we don't make it dev or optional.\n      toFoundNode.detached = false\n      toFoundNode.dev &&= flags.dev\n      toFoundNode.optional &&= flags.optional\n      return toFoundNode\n    }\n\n    // creates a new node and edges to its parent\n    const toNode = this.addNode(depId, manifest, spec)\n    toNode.registry = spec.registry\n    toNode.dev = flags.dev\n    toNode.optional = flags.optional\n    // split extra into modifier and peerSetHash\n    if (extra) {\n      const { modifier, peerSetHash } = splitExtra(extra)\n      toNode.modifier = modifier\n      toNode.peerSetHash = peerSetHash\n    }\n\n    // add extra manifest info if available\n    if (manifest) {\n      const { bin, engines, os, cpu, libc } = manifest\n      // add platform info if available\n      if (engines || os || cpu || libc) {\n        const platform: NodeLike['platform'] = {}\n        if (engines) platform.engines = engines\n        if (os) platform.os = os\n        if (cpu) platform.cpu = cpu\n        if (libc) platform.libc = libc\n        toNode.platform = platform\n      }\n      // add bin info if available\n      if (bin) {\n        toNode.bins = bin\n      }\n    }\n    toNode.maybeSetConfusedManifest(spec, manifest)\n\n    this.addEdge(depType, spec, fromNode, toNode)\n\n    // populate resolution cache if applicable\n    const f = getResolutionCacheKey(\n      spec.final,\n      fromNode.location,\n      extra || '',\n    )\n    this.resolutions.set(f, toNode)\n    const rrev = this.resolutionsReverse.get(toNode) ?? new Set()\n    rrev.add(f)\n    this.resolutionsReverse.set(toNode, rrev)\n\n    return toNode\n  }\n\n  /**\n   * Removes a node and its relevant edges from the graph.\n   *\n   * Use the `keepEdges` option to keep the edges that were pointing to\n   * this node and only removes their `to` property value.\n   *\n   * If a replacement is provided, then any edges that were previously\n   * pointing to the removed node will be directed to the replacement,\n   * if it is valid to do so.\n   */\n  removeNode(node: Node, replacement?: Node, keepEdges?: boolean) {\n    this.nodes.delete(node.id)\n    const nbn = this.nodesByName.get(node.name)\n    // if it's the last one, just remove the set\n    if (nbn?.size === 1) this.nodesByName.delete(node.name)\n    else nbn?.delete(node)\n    for (const r of this.resolutionsReverse.get(node) ?? new Set()) {\n      this.resolutions.delete(r)\n    }\n    this.resolutionsReverse.delete(node)\n    this.manifests.delete(node.id)\n    for (const edge of node.edgesOut.values()) {\n      this.edges.delete(edge)\n    }\n    for (const edge of node.edgesIn) {\n      if (\n        replacement &&\n        satisfies(\n          replacement.id,\n          edge.spec,\n          edge.from.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        edge.to = replacement\n      } else if (keepEdges) {\n        edge.to = undefined\n      } else {\n        edge.from.edgesOut.delete(edge.spec.name)\n        this.edges.delete(edge)\n      }\n    }\n  }\n\n  /**\n   * Removes the resolved node of a given edge.\n   */\n  removeEdgeResolution(edge: Edge, extra = '') {\n    const node = edge.to\n    const resolutionKey = getResolutionCacheKey(\n      edge.spec,\n      edge.from.location,\n      extra,\n    )\n    if (node) {\n      edge.to = undefined\n      this.resolutions.delete(resolutionKey)\n      this.resolutionsReverse.get(node)?.delete(resolutionKey)\n      this.nodesByName.delete(node.name)\n      node.edgesIn.delete(edge)\n      if (node.edgesIn.size === 0) {\n        this.nodes.delete(node.id)\n      }\n    }\n  }\n\n  /**\n   * Remove all edges from the graph while preserving nodes and resolution caches.\n   * This allows the graph to be reconstructed efficiently using the existing nodes.\n   */\n  resetEdges() {\n    // Clear the global edges set\n    this.edges.clear()\n\n    // Clear all node edge relationships\n    for (const node of this.nodes.values()) {\n      // marking nodes as detached needs to be restricted to only those\n      // that had a manifest, otherwise we'd be skipping fetching manifest\n      // for nodes we don't have a manifest during the ideal build phase\n      if (node.manifest) node.detached = true\n\n      // detaches all edges from this node\n      node.edgesOut.clear()\n      node.edgesIn.clear()\n    }\n  }\n\n  toJSON() {\n    return lockfileData({\n      ...this.#options,\n      graph: this,\n      saveManifests: true,\n    })\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const data = this.toJSON()\n    return `${this[Symbol.toStringTag]} ${inspect(data, options)}`\n  }\n}\n"]}

package/dist/ideal/append-nodes.d.ts

@@ -13,8 +13,20 @@ import type { TransientAddMap, TransientRemoveMap } from './types.ts';
  * Append new nodes in the given `graph` for dependencies specified at `add`
  * and missing dependencies from the `deps` parameter.
  *
- * It also applies any modifiers that applies to a given node as it processes
- * and builds the graph.
+ * Uses **breadth-first traversal** (BFS) with **deterministic ordering** to
+ * ensure reproducible builds. The algorithm:
+ *
+ * 1. Process all deps at the current level in parallel
+ * 2. After each level, run `postPlacementPeerCheck` to handle peer contexts
+ * 3. Collect child deps for the next level
+ * 4. Repeat until no more deps to process
+ *
+ * **Peer Context Isolation**: Each workspace importer gets its own peer context
+ * to prevent cross-workspace leakage. Without this, `react@^18` from workspace A
+ * could incorrectly satisfy `react@^19` peer deps in workspace B.
+ *
+ * **Early Extraction**: When `actual` graph is provided, nodes are extracted
+ * to the vlt store during graph construction (not after), improving performance.
  */
 export declare const appendNodes: (packageInfo: PackageInfoClient, graph: Graph, fromNode: Node, deps: Dependency[], scurry: PathScurry, options: SpecOptions, seen: Set<DepID>, add?: Map<string, Dependency>, modifiers?: GraphModifier, modifierRefs?: Map<string, ModifierActiveEntry>, extractPromises?: Promise<ExtractResult>[], actual?: Graph, seenExtracted?: Set<DepID>, remover?: RollbackRemove, transientAdd?: TransientAddMap, transientRemove?: TransientRemoveMap) => Promise<void>;
 //# sourceMappingURL=append-nodes.d.ts.map

package/dist/ideal/append-nodes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"append-nodes.d.ts","sourceRoot":"","sources":["../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAE3C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAE7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAO/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAG7C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC,OAAO,KAAK,EACV,aAAa,EACb,mBAAmB,EACpB,MAAM,iBAAiB,CAAA;AACxB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAA;AAE7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAM7D,OAAO,KAAK,EAIV,eAAe,EACf,kBAAkB,EACnB,MAAM,YAAY,CAAA;AA4enB;;;;;;GAMG;AACH,eAAO,MAAM,WAAW,gBACT,iBAAiB,SACvB,KAAK,YACF,IAAI,QACR,UAAU,EAAE,UACV,UAAU,WACT,WAAW,QACd,GAAG,CAAC,KAAK,CAAC,QACV,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,cACjB,aAAa,iBACV,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,oBAC7B,OAAO,CAAC,aAAa,CAAC,EAAE,WACjC,KAAK,kBACE,GAAG,CAAC,KAAK,CAAC,YAChB,cAAc,iBACT,eAAe,oBACZ,kBAAkB,kBAyGrC,CAAA"}
+{"version":3,"file":"append-nodes.d.ts","sourceRoot":"","sources":["../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAE3C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAE7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAQ/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAG7C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC,OAAO,KAAK,EACV,aAAa,EACb,mBAAmB,EACpB,MAAM,iBAAiB,CAAA;AACxB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAA;AAE7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAS7D,OAAO,KAAK,EAKV,eAAe,EACf,kBAAkB,EACnB,MAAM,YAAY,CAAA;AAylBnB;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,WAAW,gBACT,iBAAiB,SACvB,KAAK,YACF,IAAI,QACR,UAAU,EAAE,UACV,UAAU,WACT,WAAW,QACd,GAAG,CAAC,KAAK,CAAC,QACV,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,cACjB,aAAa,iBACV,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,oBAC7B,OAAO,CAAC,aAAa,CAAC,EAAE,WACjC,KAAK,kBACE,GAAG,CAAC,KAAK,CAAC,YAChB,cAAc,iBACT,eAAe,oBACZ,kBAAkB,kBAqLrC,CAAA"}

package/dist/ideal/append-nodes.js

@@ -1,12 +1,14 @@
 import { joinDepIDTuple, joinExtra } from '@vltpkg/dep-id';
 import { error } from '@vltpkg/error-cause';
 import { Spec } from '@vltpkg/spec';
+import { satisfies } from '@vltpkg/satisfies';
 import { longDependencyTypes, normalizeManifest } from '@vltpkg/types';
 import { fixupAddedNames } from "../fixup-added-names.js";
 import { shorten } from "../dependencies.js";
 import { removeOptionalSubgraph } from "../remove-optional-subgraph.js";
 import { extractNode } from "../reify/extract-node.js";
-import { endPeerPlacement, postPlacementPeerCheck, startPeerPlacement, } from "./peers.js";
+import { checkPeerEdgesCompatible, endPeerPlacement, forkPeerContext, postPlacementPeerCheck, startPeerPlacement, } from "./peers.js";
+import { compareByHasPeerDeps } from "./sorting.js";
 /**
  * Only install devDeps for git dependencies and importers
  * Everything else always gets installed
@@ -39,18 +41,67 @@ const getFileTypeInfo = (spec, fromNode, scurry) => {
     };
 };
 const isStringArray = (a) => Array.isArray(a) && !a.some(b => typeof b !== 'string');
+/**
+ * Try to find a compatible resolution for a dependency, checking peer context.
+ * If the first resolution candidate is incompatible with the peer context,
+ * try other candidates.
+ */
+const findCompatibleResolution = (spec, fromNode, graph, peerContext, queryModifier, _peer) => {
+    const candidates = graph.nodesByName.get(spec.final.name);
+    let existingNode = graph.findResolution(spec, fromNode, queryModifier);
+    let peerCompatResult = existingNode ?
+        checkPeerEdgesCompatible(existingNode, fromNode, peerContext, graph)
+        : { compatible: true };
+    // CANDIDATE FALLBACK: If first candidate is peer-incompatible, try others
+    if (existingNode &&
+        !peerCompatResult.compatible &&
+        candidates &&
+        candidates.size > 1) {
+        for (const candidate of candidates) {
+            if (candidate === existingNode)
+                continue;
+            if (candidate.detached)
+                continue;
+            if (!satisfies(candidate.id, spec.final, fromNode.location, graph.projectRoot, graph.monorepo)) {
+                continue;
+            }
+            const compat = checkPeerEdgesCompatible(candidate, fromNode, peerContext, graph);
+            if (compat.compatible) {
+                existingNode = candidate;
+                peerCompatResult = compat;
+                break;
+            }
+        }
+    }
+    return { existingNode, peerCompatResult };
+};
 /**
  * Fetch manifests for dependencies and create placement tasks.
+ *
+ * This is Phase 1 of the breadth-first graph building process. For each
+ * dependency at the current level:
+ * 1. Apply any active modifiers (spec swapping)
+ * 2. Try to find an existing node to reuse (with peer compatibility check)
+ * 3. If no reusable node, start a manifest fetch (in parallel)
+ * 4. Create placement tasks for Phase 2
+ *
+ * The result is sorted to process non-peer-dependent packages first,
+ * ensuring peer dependencies can resolve to already-placed siblings.
+ *
+ * **Read-only**: This function no longer mutates the graph. It returns
+ * tasks that will be applied serially in the BFS loop for deterministic ordering.
  */
 const fetchManifestsForDeps = async (packageInfo, graph, fromNode, deps, scurry, peerContext, modifierRefs, depth = 0) => {
-    // Create fetch tasks for all dependencies at this level
     const fetchTasks = [];
     const placementTasks = [];
+    const reuseTasks = [];
+    const forkRequests = [];
     for (const { spec: originalSpec, type } of deps) {
         let spec = originalSpec;
         const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry);
         const activeModifier = modifierRefs?.get(spec.name);
-        // here is the place we swap specs if a edge modifier was defined
+        // MODIFIER HANDLING: Swap spec if an edge modifier is fully matched
+        // Example: `vlt install --override "react:^19"` changes react's spec
         const queryModifier = activeModifier?.modifier.query;
         const completeModifier = activeModifier &&
             activeModifier.interactiveBreadcrumb.current ===
@@ -59,28 +110,40 @@ const fetchManifestsForDeps = async (packageInfo, graph, fromNode, deps, scurry,
             completeModifier &&
             'spec' in activeModifier.modifier) {
             spec = activeModifier.modifier.spec;
+            // bareSpec of '-' means "remove this dependency"
             if (spec.bareSpec === '-') {
                 continue;
             }
         }
         const peer = type === 'peer' || type === 'peerOptional';
-        // skip reusing nodes for peer deps since their reusability
-        // is handled ahead-of-time during its parent's placement
-        const existingNode = graph.findResolution(spec, fromNode, queryModifier);
+        // NODE REUSE LOGIC with peer compatibility
+        const { existingNode, peerCompatResult } = findCompatibleResolution(spec, fromNode, graph, peerContext, queryModifier, peer);
+        // Accumulate fork request if incompatible peer edges detected (defer actual fork)
+        const effectivePeerContext = peerContext;
+        /* c8 ignore start */
+        if (!peerCompatResult.compatible && peerCompatResult.forkEntry) {
+            forkRequests.push(peerCompatResult.forkEntry);
+            // All fork entries from this fromNode will be applied together in Phase B
+        }
+        /* c8 ignore stop */
         // defines what nodes are eligible to be reused
         const validExistingNode = existingNode &&
             !existingNode.detached &&
-            // Regular deps can always reuse
+            // Regular deps can always reuse.
+            // Peer deps can reuse as well if their peer edges are compatible.
             /* c8 ignore start */
-            (!peer ||
-                // otherwise reusing peer deps only in case of a peerSetHash matche
-                existingNode.peerSetHash === fromNode.peerSetHash);
+            (!peer || peerCompatResult.compatible) &&
+            // Check if existing node's peer edges are compatible with new parent
+            peerCompatResult.compatible;
         /* c8 ignore stop */
         if (validExistingNode ||
-            // importers are handled at the ./add-nodes.ts top-level
+            // importers are handled at the ./refresh-ideal-graph.ts top-level
             // so we should just skip whenever we find one
             existingNode?.importer) {
-            graph.addEdge(type, spec, fromNode, existingNode);
+            // Defer edge creation to Phase B for deterministic ordering.
+            // Previously added immediately, but this caused race conditions when
+            // parallel fetches completed in different orders.
+            reuseTasks.push({ type, spec, fromNode, toNode: existingNode });
             continue;
         }
         // is the current edge pointint go an optional dependency?
@@ -114,7 +177,7 @@ const fetchManifestsForDeps = async (packageInfo, graph, fromNode, deps, scurry,
             edgeOptional,
             manifestPromise,
             depth,
-            peerContext,
+            peerContext: effectivePeerContext,
         };
         fetchTasks.push(fetchTask);
     }
@@ -130,34 +193,30 @@ const fetchManifestsForDeps = async (packageInfo, graph, fromNode, deps, scurry,
     // so that peer dependencies can easily reuse already placed regular
     // dependencies as part of peer context set resolution also makes sure to
     // sort by the manifest name for deterministic order.
-    placementTasks.sort((a, b) => {
-        const aIsPeer = (a.manifest?.peerDependencies &&
-            Object.keys(a.manifest.peerDependencies).length > 0) ?
-            1
-            : 0;
-        const bIsPeer = (b.manifest?.peerDependencies &&
-            Object.keys(b.manifest.peerDependencies).length > 0) ?
-            1
-            : 0;
-        // regular dependencies first, peer dependencies last
-        if (aIsPeer !== bIsPeer) {
-            return aIsPeer - bIsPeer;
-        }
-        // if both are in the same group,
-        // sort alphabetically by manifest name (fallback to spec.name)
-        const aName = a.manifest?.name /* c8 ignore next */ || a.fetchTask.spec.name;
-        const bName = b.manifest?.name || b.fetchTask.spec.name;
-        return aName.localeCompare(bName, 'en');
-    });
-    return placementTasks;
+    placementTasks.sort(compareByHasPeerDeps);
+    return { placementTasks, reuseTasks, forkRequests };
 };
 /**
- * Process placement tasks and collect child dependencies, this is the
- * second step of the appendNodes operation after manifest fetching in
- * which the final graph data structure is actually built.
+ * Process placement tasks and collect child dependencies.
+ *
+ * This is Phase 2 of the breadth-first graph building process. For each
+ * resolved manifest:
+ * 1. Handle missing manifests (optional vs required deps)
+ * 2. Start peer placement process (collect sibling context)
+ * 3. Place the node in the graph with appropriate flags
+ * 4. Trigger early extraction if eligible (performance optimization)
+ * 5. Collect child dependencies for the next BFS level
+ * 6. End peer placement (setup context update functions)
+ *
+ * Early extraction: When `actual` graph is provided, nodes destined for the
+ * vlt store are extracted immediately (in parallel) instead of waiting for
+ * the full ideal graph to be built. This significantly improves install time.
  */
 const processPlacementTasks = async (graph, options, placementTasks, add, modifiers, scurry, packageInfo, extractPromises, actual, seenExtracted, remover, transientAdd, transientRemove) => {
     const childDepsToProcess = [];
+    // Note: placementTasks are already sorted by fetchManifestsForDeps
+    // using compareByHasPeerDeps to ensure non-peer deps are processed first.
+    // We don't sort again here to preserve that ordering.
     for (const placementTask of placementTasks) {
         const { fetchTask, manifest } = placementTask;
         let { activeModifier, edgeOptional, fileTypeInfo, fromNode, peerContext, queryModifier, spec, type, } = fetchTask;
@@ -326,22 +385,43 @@ const processPlacementTasks = async (graph, options, placementTasks, add, modifi
  * Append new nodes in the given `graph` for dependencies specified at `add`
  * and missing dependencies from the `deps` parameter.
  *
- * It also applies any modifiers that applies to a given node as it processes
- * and builds the graph.
+ * Uses **breadth-first traversal** (BFS) with **deterministic ordering** to
+ * ensure reproducible builds. The algorithm:
+ *
+ * 1. Process all deps at the current level in parallel
+ * 2. After each level, run `postPlacementPeerCheck` to handle peer contexts
+ * 3. Collect child deps for the next level
+ * 4. Repeat until no more deps to process
+ *
+ * **Peer Context Isolation**: Each workspace importer gets its own peer context
+ * to prevent cross-workspace leakage. Without this, `react@^18` from workspace A
+ * could incorrectly satisfy `react@^19` peer deps in workspace B.
+ *
+ * **Early Extraction**: When `actual` graph is provided, nodes are extracted
+ * to the vlt store during graph construction (not after), improving performance.
  */
 export const appendNodes = async (packageInfo, graph, fromNode, deps, scurry, options, seen, add, modifiers, modifierRefs, extractPromises, actual, seenExtracted, remover, transientAdd, transientRemove) => {
+    // Cycle detection: skip if already processed
     /* c8 ignore next */
     if (seen.has(fromNode.id))
         return;
     seen.add(fromNode.id);
-    // Get the initial peer context from the graph
-    const [initialPeerContext] = graph.peerContexts;
+    // PEER CONTEXT ISOLATION: Each workspace importer needs its own context
+    // to prevent peer targets from one workspace affecting another.
+    // The main importer (index 0) uses the initial context; others get fresh ones.
+    let initialPeerContext = graph.peerContexts[0];
     /* c8 ignore start - impossible */
-    if (!initialPeerContext) {
+    if (!initialPeerContext)
         throw error('no initial peer context found in graph');
-    }
     /* c8 ignore stop */
-    // Use a queue for breadth-first processing
+    if (fromNode.importer && fromNode !== graph.mainImporter) {
+        // Create isolated peer context for this workspace importer
+        const nextPeerContext = new Map();
+        nextPeerContext.index = graph.nextPeerContextIndex();
+        graph.peerContexts[nextPeerContext.index] = nextPeerContext;
+        initialPeerContext = nextPeerContext;
+    }
+    // BFS queue: process deps level by level for deterministic builds
     let currentLevelDeps = [
         {
             node: fromNode,
@@ -357,27 +437,78 @@ export const appendNodes = async (packageInfo, graph, fromNode, deps, scurry, op
             /* c8 ignore stop */
         },
     ];
+    // BFS MAIN LOOP: Process level by level until no more deps
     while (currentLevelDeps.length > 0) {
         const nextLevelDeps = [];
-        // Process all nodes at the current level in parallel
-        const levelResults = await Promise.all(currentLevelDeps.map(async ({ node, deps: nodeDeps, modifierRefs: nodeModifierRefs, peerContext, depth, }) => {
-            // Mark node as seen when we start processing its dependencies
+        // ============================================================
+        // PHASE A: PARALLEL FETCH (READ-ONLY)
+        // ============================================================
+        // Fetch all manifests at this level in parallel without mutating the graph.
+        // This phase is read-only to avoid race conditions from network timing.
+        const fetchResults = await Promise.all(currentLevelDeps.map(async ({ node, deps: nodeDeps, modifierRefs: nodeModifierRefs, peerContext, depth, }) => {
+            // Cycle prevention: mark as seen when starting to process
             seen.add(node.id);
-            // Fetch manifests for this node's dependencies
-            const placementTasks = await fetchManifestsForDeps(packageInfo, graph, node, 
-            // Sort dependencies by spec.name for deterministic ordering
+            // Fetch manifests and collect tasks (no graph mutations)
+            const result = await fetchManifestsForDeps(packageInfo, graph, node, 
+            // Sort by name for deterministic ordering (reproducible builds)
             nodeDeps.sort((a, b) => a.spec.name.localeCompare(b.spec.name, 'en')), scurry, peerContext, nodeModifierRefs, depth);
-            // Process the placement tasks and get child dependencies
-            return await processPlacementTasks(graph, options, placementTasks, add, modifiers, scurry, packageInfo, extractPromises, actual, seenExtracted, remover, transientAdd, transientRemove);
+            return {
+                entry: {
+                    node,
+                    deps: nodeDeps,
+                    modifierRefs: nodeModifierRefs,
+                    peerContext,
+                    depth,
+                },
+                result,
+            };
         }));
-        // Traverse the queued up children dependencies, adding and tracking
-        // dependencies on the peer context set, forking the context as needed
-        // and resolving any peer dependency that is able to be resolved using
-        // the current peer context set
+        // ============================================================
+        // PHASE B: SERIAL MUTATIONS (DETERMINISTIC ORDER)
+        // ============================================================
+        // Sort results by stable identifiers to ensure deterministic ordering
+        // regardless of which manifest fetch completed first
+        const sortedResults = fetchResults.sort((a, b) => {
+            // Sort by node ID (DepID-based, stable) and depth
+            const keyA = `${a.entry.node.id}::${a.entry.depth}`;
+            const keyB = `${b.entry.node.id}::${b.entry.depth}`;
+            return keyA.localeCompare(keyB, 'en');
+        });
+        // Apply all mutations serially in deterministic order
+        const levelResults = [];
+        for (const { entry, result } of sortedResults) {
+            // Apply accumulated fork requests if any (from Phase A deferred forks)
+            if (result.forkRequests.length > 0) {
+                const forkedContext = forkPeerContext(graph, entry.peerContext, result.forkRequests);
+                entry.peerContext = forkedContext;
+                // Update peer context in all placement tasks to use forked context
+                for (const task of result.placementTasks) {
+                    task.fetchTask.peerContext = forkedContext;
+                }
+            }
+            // Apply reuse edges in deterministic order (before placement)
+            // Sort reuse tasks by spec name for stability
+            const sortedReuseTasks = result.reuseTasks.sort((a, b) => a.spec.name.localeCompare(b.spec.name, 'en'));
+            for (const { type, spec, fromNode, toNode, } of sortedReuseTasks) {
+                graph.addEdge(type, spec, fromNode, toNode);
+            }
+            // Place nodes and collect child deps
+            const placed = await processPlacementTasks(graph, options, result.placementTasks, add, modifiers, scurry, packageInfo, extractPromises, actual, seenExtracted, remover, transientAdd, transientRemove);
+            levelResults.push(placed);
+        }
+        // ============================================================
+        // PHASE C: POST-PLACEMENT PEER CHECK
+        // ============================================================
+        // After all nodes at this level are placed, update peer contexts,
+        // fork as needed, and resolve peer deps that can be satisfied.
+        // This must happen AFTER placement so sibling nodes are available.
         postPlacementPeerCheck(graph, levelResults);
-        // Collect all child dependencies for the next level
+        // ============================================================
+        // STEP 3: COLLECT CHILD DEPS FOR NEXT LEVEL
+        // ============================================================
         for (const childDepsToProcess of levelResults) {
             for (const childDep of childDepsToProcess) {
+                // Skip already-seen nodes (cycle prevention)
                 if (!seen.has(childDep.node.id)) {
                     /* c8 ignore next */
                     const currentDepth = currentLevelDeps[0]?.depth ?? 0;
@@ -388,7 +519,7 @@ export const appendNodes = async (packageInfo, graph, fromNode, deps, scurry, op
                 }
             }
         }
-        // Move to the next level
+        // Advance to next BFS level
         currentLevelDeps = nextLevelDeps;
     }
 };